全文获取类型
收费全文 | 79篇 |
免费 | 1篇 |
专业分类
化学 | 7篇 |
力学 | 1篇 |
数学 | 7篇 |
物理学 | 23篇 |
无线电 | 42篇 |
出版年
2020年 | 1篇 |
2017年 | 1篇 |
2016年 | 2篇 |
2013年 | 2篇 |
2012年 | 1篇 |
2011年 | 2篇 |
2010年 | 2篇 |
2009年 | 1篇 |
2008年 | 4篇 |
2007年 | 6篇 |
2006年 | 5篇 |
2005年 | 8篇 |
2004年 | 4篇 |
2003年 | 5篇 |
2002年 | 4篇 |
2001年 | 2篇 |
2000年 | 6篇 |
1999年 | 3篇 |
1998年 | 4篇 |
1997年 | 1篇 |
1996年 | 1篇 |
1993年 | 1篇 |
1992年 | 1篇 |
1990年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1983年 | 2篇 |
1981年 | 2篇 |
1979年 | 1篇 |
1978年 | 3篇 |
1977年 | 2篇 |
排序方式: 共有80条查询结果,搜索用时 15 毫秒
1.
Cluster Analysis of Gene Expression Data 总被引:1,自引:0,他引:1
Eytan Domany 《Journal of statistical physics》2003,110(3-6):1117-1139
The expression levels of many thousands of genes can be measured simultaneously by DNA microarrays (chips). This novel experimental tool has revolutionized research in molecular biology and generated considerable excitement. A typical experiment uses a few tens of such chips, each dedicated to a single sample—such as tissue extracted from a particular tumor. The results of such an experiment contain several hundred thousand numbers, that come in the form of a table, of several thousand rows (one for each gene) and 50–100 columns (one for each sample). We developed a clustering methodology to mine such data. In this review I provide a very basic introduction to the subject, aimed at a physics audience with no prior knowledge of either gene expression or clustering methods. I explain what genes are, what is gene expression and how it is measured by DNA chips. Next I explain what is meant by clustering and how we analyze the massive amounts of data from such experiments, and present results obtained from analysis of data from colon cancer, brain tumors and breast cancer. 相似文献
2.
Clustering gene expression data by exploiting phase transitions in granular ferromagnets requires transforming the data to a granular substrate. We present a method using the recently introduced homogeneity order parameter Lambda [H. Agrawal, Phys. Rev. Lett. 89, 268702 (2002)]] for optimizing the parameter controlling the "granularity" and thus the stability of partitions. The model substrates obtained for gene expression data have a highly granular structure. We explore properties of phase transition in high q ferromagnetic Potts models on these substrates and show that the maximum of the width of superparamagnetic domain, corresponding to maximally stable partitions, coincides with the minimum of Lambda. 相似文献
3.
Capacity and delay tradeoffs for ad hoc mobile networks 总被引:4,自引:0,他引:4
Neely M.J. Modiano E. 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2005,51(6):1917-1937
We consider the throughput/delay tradeoffs for scheduling data transmissions in a mobile ad hoc network. To reduce delays in the network, each user sends redundant packets along multiple paths to the destination. Assuming the network has a cell partitioned structure and users move according to a simplified independent and identically distributed (i.i.d.) mobility model, we compute the exact network capacity and the exact end-to-end queueing delay when no redundancy is used. The capacity-achieving algorithm is a modified version of the Grossglauser-Tse two-hop relay algorithm and provides O(N) delay (where N is the number of users). We then show that redundancy cannot increase capacity, but can significantly improve delay. The following necessary tradeoff is established: delay/rate/spl ges/O(N). Two protocols that use redundancy and operate near the boundary of this curve are developed, with delays of O(/spl radic/N) and O(log(N)), respectively. Networks with non-i.i.d. mobility are also considered and shown through simulation to closely match the performance of i.i.d. systems in the O(/spl radic/N) delay regime. 相似文献
4.
Chan V.W.S. Hall K.L. Modiano E. Rauschenbach K.A. 《Lightwave Technology, Journal of》1998,16(12):2146-2168
Current optical networks are migrating to wavelength division multiplexing (WDM)-based fiber transport between traditional electronic multiplexers/demultiplexers, routers, and switches. Passive optical add-drop WDM networks have emerged but an optical data network that makes full use of the technologies of dynamic optical routing and switching exists only in experimental test-beds. This paper discusses architecture and technology issues for the design of high performance optical data networks with two classes of technologies, WDM and time division multiplexing (TDM). The WDM network architecture presented stresses WDM aware Internet protocol (IP), taking full advantage of optical reconfiguration, optical protection and restoration, traffic grooming to minimize electronics costs, and optical flow-switching for large transactions. Special attention is paid to the access network where innovative approaches to architecture may have a significant cost benefit. In the more distant future, ultrahigh-speed optical TDM networks, operating at single stream data rates of 100 Gb/s, may offer unique advantages over WDM networks. These advantages may include the ability to provide integrated services to high-end users, multiple quality-of-service (QoS) levels, and truly flexible bandwidth-on-demand. The paper gives an overview of an ultrahigh-speed TDM network architecture and describes recent key technology developments such as high-speed sources, switches, buffers, and rate converters 相似文献
5.
We develop on-line routing and wavelength assignment (RWA) algorithms for WDM bidirectional ring and torus networks with N nodes. The algorithms dynamically support all k-allowable traffic matrices, where k denotes an arbitrary integer vector [k/sub 1/, k/sub 2/,... k/sub N/], and node i, 1 /spl les/ i /spl les/ N, can transmit at most k/sub i/ wavelengths and receive at most k/sub i/ wavelengths. Both algorithms support the changing traffic in a rearrangeably nonblocking fashion. Our first algorithm, for a bidirectional ring, uses [(/spl Sigma//sub i=1//sup N/ k/sub i/)/3] wavelengths in each fiber and requires at most three lightpath rearrangements per new session request regardless of the number of nodes N and the amount of traffic k. When all the k/sub i/'s are equal to k, the algorithm uses [kN/3] wavelengths, which is known to be the minimum for any off-line rearrangeably nonblocking algorithm. Our second algorithm, for a torus topology, is an extension of a known off-line algorithm for the special case with all the k/sub i/'s equal to k. For an R /spl times/ C torus network with R /spl ges/ C nodes, our on-line algorithm uses [kR/2] wavelengths in each fiber, which is the same as in the off-line algorithm, and is at most two times a lower bound obtained by assuming full wavelength conversion at all nodes. In addition, the on-line algorithm requires at most C - 1 lightpath rearrangements per new session request regardless of the amount of traffic k. Finally, each RWA update requires solving a bipartite matching problem whose time complexity is only O (R), which is much smaller than the time complexity O(kCR/sup 2/) of the bipartite matching problem for an off-line algorithm. 相似文献
6.
A next-generation optical regional access network 总被引:2,自引:0,他引:2
Kuznetsov M. Froberg N.M. Henion S.R. Rao H.G. Korn J. Rauschenbach K.A. Modiano E.H. Chan V.W.S. 《Communications Magazine, IEEE》2000,38(1):66-72
We describe an optical regional access network which combines electronic IP routing with intelligent networking functionality of the optical WDM layer. The optical WDM layer provides such networking functions as network logical topology reconfiguration, optical flow switching to offload traffic and bypass IP routers, wavelength routing of signals, protection switching and restoration in the optical domain, and flexible network service provisioning by reconfigurable wavelength connectivity. We discuss key enabling technologies for the WDM layer and describe their limitations. The symbiosis of electronic and optical WDM networking functions also allows support for heterogeneous format traffic and will enable efficient gigabit-per-second user access in next-generation Internet networks 相似文献
7.
Eytan Gilboa 《The Journal of communication》2002,52(4):731-748
This study investigated the effects global communication is having on the formulation and conduct of foreign policy and showed that it both constrains leaders and officials yet provides them with opportunities to advance their goals. The article presents a taxonomy where global communication is viewed as an actor in the policy process with corresponding attributes of type, activity, context, and concept. Four types of actors are identified: controlling, constraining, intervening, and instrumental. The article critically and respectively examines concepts developed to explain each type: the "CNN Effect theory,""real-time policy,""international political brokerage," and "media diplomacy." Although some of these concepts were found to be useful, major progress in this field requires interdisciplinary research based on joint application of theories and models from both communication and international relations. 相似文献
8.
Wireless channel allocation using an auction algorithm 总被引:1,自引:0,他引:1
Jun Sun Modiano E. Lizhong Zheng 《Selected Areas in Communications, IEEE Journal on》2006,24(5):1085-1096
We develop a novel auction-based algorithm to allow users to fairly compete for a wireless fading channel. We use the second-price auction mechanism whereby user bids for the channel, during each time slot, based on the fade state of the channel, and the user that makes the highest bid wins use of the channel by paying the second highest bid. Under the assumption that each user has a limited budget for bidding, we show the existence of a Nash equilibrium strategy, and the Nash equilibrium leads to a unique allocation for certain channel state distribution, such as the exponential distribution and the uniform distribution over [0, 1]. For uniformly distributed channel state, we establish that the aggregate throughput received by the users using the Nash equilibrium strategy is at least 3/4 of what can be obtained using an optimal centralized allocation that does not take fairness into account. We also show that the Nash equilibrium strategy leads to an allocation that is Pareto optimal (i.e., it is impossible to make some users better off without making some other users worse off). Based on the Nash equilibrium strategies of the second-price auction with money constraint, we further propose a centralized opportunistic scheduler that does not suffer the shortcomings associated with the proportional fair scheduler. 相似文献
9.
Neely M.J. Modiano E. Rohrs C.E. 《Selected Areas in Communications, IEEE Journal on》2005,23(1):89-103
We consider dynamic routing and power allocation for a wireless network with time-varying channels. The network consists of power constrained nodes that transmit over wireless links with adaptive transmission rates. Packets randomly enter the system at each node and wait in output queues to be transmitted through the network to their destinations. We establish the capacity region of all rate matrices (/spl lambda//sub ij/) that the system can stably support-where /spl lambda//sub ij/ represents the rate of traffic originating at node i and destined for node j. A joint routing and power allocation policy is developed that stabilizes the system and provides bounded average delay guarantees whenever the input rates are within this capacity region. Such performance holds for general arrival and channel state processes, even if these processes are unknown to the network controller. We then apply this control algorithm to an ad hoc wireless network, where channel variations are due to user mobility. Centralized and decentralized implementations are compared, and the stability region of the decentralized algorithm is shown to contain that of the mobile relay strategy developed by Grossglauser and Tse (2002). 相似文献
10.
Eytan Barouch 《Studies in Applied Mathematics》1977,56(2):169-185
A resonance of a magnetic impurity with a quantum spin-chain is studied. A Fresnel diffraction pattern is found. 相似文献