نتایج جستجو برای: super

تعداد نتایج: 50148  

اشرفی‌زاده, فخرالدین, خرسند, شهره, رئیسی, کیوان,

Super-hydrophobic nickel and nickel-cobalt alloy coatings with micro-nano structure were successfully electrodeposited on copper substrates with one and two steps electrodeposition. Surface morphology, wettability and corrosion  resistance were characterized by scanning electron microscopy, water contact angle measurements, electrochemical impedanc spectroscopy (EIS) and potentiodynamic...

Journal: :IJCSA 2012
Yuh-Jong Hu Win-Nan Wu Jiun-Jan Yang

Extending from the previous semantic privacy-preserving model, we propose a widescale super-peer data integration and protection architecture. Any user from a superpeer domain can contribute new data, schema, or even mappings for other super-peer domains to integrate the information. Each super-peer domain is essentially a mediatorbased data integration system, where an agent at the super-peer ...

Journal: :Cell 2013
Denes Hnisz Brian J. Abraham Tong Ihn Lee Ashley Lau Violaine Saint-André Alla A. Sigova Heather A. Hoke Richard A. Young

Super-enhancers are large clusters of transcriptional enhancers that drive expression of genes that define cell identity. Improved understanding of the roles that super-enhancers play in biology would be afforded by knowing the constellation of factors that constitute these domains and by identifying super-enhancers across the spectrum of human cell types. We describe here the population of tra...

Journal: :Journal of Optics A: Pure and Applied Optics 2007

2016
Won-Ho Chung

A P2P system based on super-peer overlay shows good features of combining both advantages of hybrid and pure P2P systems. Most P2P applications being developed are based on the overlay networks composed of super-peers. Super-peer is a special peer acting as a server to a cluster of client peers. Selecting super-peers and constructing a super-peer overlay for clustering client peers are importan...

P. Sugirtha R. Vasuki, S. Arockiaraj,

Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)cup E(G)$ to ${0, pm 1, pm2, dots, pm (frac{p+q-1}{2})}$ when $p+q$ is odd and from $V(G)cup E(G)$ to ${pm 1, pm 2, dots, pm (frac{p+q}{2})}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {...

Journal: :ژورنال بین المللی پژوهش عملیاتی 0
a. payan b. rahmani parchikolaei

this article will address the extension of super efficiency method to rank the non-extreme efficient decision making units. many methodologies have introduced methods that can rank efficient units, amongst which, the super efficiency method due to its ability to provide meaningful geometrical as well as economic analyses has a significant place. but the common problem with all the super efficie...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید