全文获取类型
收费全文 | 5579篇 |
免费 | 540篇 |
国内免费 | 200篇 |
专业分类
化学 | 348篇 |
晶体学 | 1篇 |
力学 | 835篇 |
综合类 | 56篇 |
数学 | 2488篇 |
物理学 | 975篇 |
无线电 | 1616篇 |
出版年
2024年 | 6篇 |
2023年 | 61篇 |
2022年 | 82篇 |
2021年 | 110篇 |
2020年 | 169篇 |
2019年 | 125篇 |
2018年 | 123篇 |
2017年 | 149篇 |
2016年 | 175篇 |
2015年 | 169篇 |
2014年 | 292篇 |
2013年 | 407篇 |
2012年 | 292篇 |
2011年 | 322篇 |
2010年 | 276篇 |
2009年 | 357篇 |
2008年 | 346篇 |
2007年 | 362篇 |
2006年 | 338篇 |
2005年 | 325篇 |
2004年 | 252篇 |
2003年 | 271篇 |
2002年 | 188篇 |
2001年 | 185篇 |
2000年 | 164篇 |
1999年 | 127篇 |
1998年 | 131篇 |
1997年 | 85篇 |
1996年 | 80篇 |
1995年 | 50篇 |
1994年 | 56篇 |
1993年 | 39篇 |
1992年 | 43篇 |
1991年 | 35篇 |
1990年 | 24篇 |
1989年 | 20篇 |
1988年 | 8篇 |
1987年 | 11篇 |
1986年 | 9篇 |
1985年 | 12篇 |
1984年 | 12篇 |
1983年 | 6篇 |
1982年 | 8篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 3篇 |
1977年 | 2篇 |
1976年 | 2篇 |
1957年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有6319条查询结果,搜索用时 383 毫秒
1.
《Journal of Pure and Applied Algebra》2022,226(8):107024
We solve a combinatorial question concerning eigenvalues of the universal intertwining endomorphism of a subset representation. 相似文献
2.
Erosion and sediments transport processes have a great impact on industrial structures and on water quality. Despite its limitations, the Saint‐Venant‐Exner system is still (and for sure for some years) widely used in industrial codes to model the bedload sediment transport. In practice, its numerical resolution is mostly handled by a splitting technique that allows a weak coupling between hydraulic and morphodynamic distinct softwares but may suffer from important stability issues. In recent works, many authors proposed alternative methods based on a strong coupling that cure this problem but are not so trivial to implement in an industrial context. In this work, we then pursue 2 objectives. First, we propose a very simple scheme based on an approximate Riemann solver, respecting the strong coupling framework, and we demonstrate its stability and accuracy through a number of numerical test cases. However, second, we reinterpret our scheme as a splitting technique and we extend the purpose to propose what should be the minimal coupling that ensures the stability of the global numerical process in industrial codes, at least, when dealing with collocated finite volume method. The resulting splitting method is, up to our knowledge, the only one for which stability properties are fully demonstrated. 相似文献
3.
4.
Frequency Insertion Strategy for Channel Assignment Problem 总被引:1,自引:0,他引:1
This paper presents a new heuristic method for quickly finding a good feasible solution to the channel assignment problem
(CAP). Like many other greedy-type heuristics for CAP, the proposed method also assigns a frequency to a call, one at a time.
Hence, the method requires computational time that increases only linear to the number of calls. However, what distinguishes
the method from others is that it starts with a narrow enough frequency band so as to provoke violations of constraints that
we need to comply with in order to avoid radio interference. Each violation is then resolved by inserting frequencies at the
most appropriate positions so that the band of frequencies expands minimally. An extensive computational experiment using
a set of randomly generated problems as well as the Philadelphia benchmark instances shows that the proposed method perform
statistically better than existing methods of its kind and even yields optimum solutions to most of Philadelphia benchmark
instances among which two cases are reported for the first time ever, in this paper.
Won-Young Shin was born in Busan, Korea in 1978. He received B.S. in industrial engineering from Pohang University of Science and Technology
(POSTECH) in 2001 and M.S in operation research and applied statistics from POSTECH in 2003. Since 2003 he has been a researcher
of Agency for Defense Development (ADD) in Korea. He is interested in optimization of communication system and applied statistics.
Soo Y. Chang is an associate professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH),
Pohang, Korea. He teaches linear programming, discrete optimization, network flows and operations research courses. His research
interests include mathematical programming and scheduling. He has published in several journals including Discrete Applied
Mathematics, Computers and Mathematics with Application, IIE Transactions, International Journal of Production Research, and
so on. He is a member of Korean IIE, and ORMSS.
Jaewook Lee is an assistant professor in the Department of Industrial Engineering at Pohang University of Science and Technology (POSTECH),
Pohang, Korea. He received the B.S. degree in mathematics with honors from Seoul National University, and the Ph.D. degree
from Cornell University in applied mathematics in 1993 and 1999, respectively. He is currently an assistant professor in the
department of industrial engineering at the Pohang University of Science and Technology (POSTECH). His research interests
include nonlinear systems, neural networks, nonlinear optimization, and their applications to data mining and financial engineering.
Chi-Hyuck Jun was born in Seoul, Korea in 1954. He received B.S. in mineral and petroleum engineering from Seoul National University in
1977, M.S. in industrial engineering from Korea Advanced Institute of Science and Technology in 1979 and Ph.D. in operations
research from University of California, Berkeley, in 1986. Since 1987 he has been with the department of industrial engineering,
Pohang University of Science and Technology (POSTECH) and he is now a professor and the department head. He is interested
in performance analysis of communication and production systems. He has published in several journals including IIE Transactions,
IEEE Transactions, Queueing Systems and Chemometrics and Intelligent Laboratory Systems. He is a member of IEEE, INFORMS and
ASQ. 相似文献
5.
6.
The sunset diagram of λφ4 theory is evaluated numerically in cutoff scheme and a nonzero finite term(in accordance with dimensional regularization (DR) result) is found in contrast to published calculations. This findingdramatically reduces the critical couplings for symmetry breaking in the two-loop effective potential discussed in ourprevious work. 相似文献
7.
Ben-Jye Chang 《Telecommunication Systems》2006,33(4):333-352
3G Wideband CDMA systems adopt the Orthogonal Variable Spreading Factor code tree as the channelization codes management for
achieving high data rate transmission in personal multimedia communications. It assigns a single channelization code for each
accepted connection. Nevertheless, it wastes the system capacity when the required rate is not powers of two of the basic
rate. One good solution is to assign multiple codes for each accepted connection but it causes two inevitable drawbacks: long
handoff delay and new call setup delay due to high complexity of processing with multiple channelization codes, and high cost
of using more number of rake combiners. Especially, long handoff delay may result in more call dropping probability and higher
Grade of Service, which will degrade significantly the utilization and revenue of the 3G cellular systems. Therefore, we propose
herein an adaptive efficient codes determination algorithm based on the Markov Decision Process analysis approach to reduce
the waste rate and reassignments significantly while providing fast handoff. Numerical results demonstrate that the proposed
approach yields several advantages, including the lowest GOS, the least waste rate, and the least number of reassignments.
Meanwhile, the optimal number of rake combiners is also analyzed in this paper.
This research was supported in part by the National Science Council of Taiwan, ROC, under contract NSC-93-2213-E-324-018. 相似文献
8.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a
given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred
to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional
(resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional
(resp., unidirectional) topology is k-edge connected.
The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied
by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18],
which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19],
which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity.
In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity,
and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity
and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for
distributed implementation.
A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless
(Adhoc-Now 2003).
Research performed in part while visiting the Max-Plank-Institut fur Informatik.
Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting
researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University
of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms.
Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor
since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and
Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990.
His research interests include optical networks and wireless networks. 相似文献
9.
10.
In this paper we study the optimization issues of ring networks employing novel parallel multi‐granularity hierarchical optical add‐drop multiplexers (OADMs). In particular, we attempt to minimize the number of control elements for the off‐line case. We present an integer linear programming formulation to obtain the lower bound in optimization, and propose an efficient heuristic algorithm called global bandwidth resource assignment that is suitable for the design of large‐scale OADM networks. 相似文献