全文获取类型
收费全文 | 6034篇 |
免费 | 749篇 |
国内免费 | 747篇 |
专业分类
电工技术 | 228篇 |
技术理论 | 1篇 |
综合类 | 649篇 |
化学工业 | 99篇 |
金属工艺 | 41篇 |
机械仪表 | 305篇 |
建筑科学 | 96篇 |
矿业工程 | 37篇 |
能源动力 | 21篇 |
轻工业 | 59篇 |
水利工程 | 34篇 |
石油天然气 | 30篇 |
武器工业 | 135篇 |
无线电 | 966篇 |
一般工业技术 | 374篇 |
冶金工业 | 832篇 |
原子能技术 | 19篇 |
自动化技术 | 3604篇 |
出版年
2024年 | 35篇 |
2023年 | 98篇 |
2022年 | 162篇 |
2021年 | 134篇 |
2020年 | 161篇 |
2019年 | 148篇 |
2018年 | 122篇 |
2017年 | 175篇 |
2016年 | 206篇 |
2015年 | 237篇 |
2014年 | 383篇 |
2013年 | 425篇 |
2012年 | 488篇 |
2011年 | 490篇 |
2010年 | 402篇 |
2009年 | 430篇 |
2008年 | 451篇 |
2007年 | 442篇 |
2006年 | 375篇 |
2005年 | 364篇 |
2004年 | 302篇 |
2003年 | 278篇 |
2002年 | 202篇 |
2001年 | 179篇 |
2000年 | 102篇 |
1999年 | 93篇 |
1998年 | 85篇 |
1997年 | 65篇 |
1996年 | 66篇 |
1995年 | 55篇 |
1994年 | 46篇 |
1993年 | 31篇 |
1992年 | 29篇 |
1991年 | 26篇 |
1990年 | 29篇 |
1989年 | 15篇 |
1988年 | 15篇 |
1987年 | 8篇 |
1986年 | 10篇 |
1985年 | 10篇 |
1966年 | 10篇 |
1965年 | 8篇 |
1964年 | 17篇 |
1963年 | 17篇 |
1962年 | 9篇 |
1961年 | 8篇 |
1960年 | 6篇 |
1959年 | 14篇 |
1956年 | 12篇 |
1955年 | 6篇 |
排序方式: 共有7530条查询结果,搜索用时 31 毫秒
1.
Journal of Computer Science and Technology - DOACROSS loops are significant parts in many important scientific and engineering applications, which are generally exploited pipeline/wave-front... 相似文献
2.
Mohamed Becherif 《Asian journal of control》2019,21(4):2137-2154
Induction machines (IM) constitute a theoretically interesting and practically important class of nonlinear systems. They are frequently used as wind generators for their power/cost ratio. They are described by a fifth‐order nonlinear differential equation with two inputs and only three state variables available for measurement. The control task is further complicated by the fact that IM are subject to unknown (load) disturbances and the parameters can be of great uncertainty. One is then faced with the challenging problem of controlling a highly nonlinear system, with unknown time‐varying parameters, where the regulated output, besides being unmeasurable, is perturbed by an unknown additive signal. Passivity‐based control (PBC) is a well‐established structure‐preserving design methodology which has shown to be very powerful to design robust controllers for physical systems described by Euler‐Lagrange equations of motion. PBCs provide a natural procedure to "shape" the potential energy yielding controllers with a clear physical interpretation in terms of interconnection of the system with its environment and are robust vis á vis to unmodeled dissipative effects. One recent approach of PBC is the Interconnection and Damping Assignment Passivity‐Based Control (IDA‐PBC) which is a very useful technique to control nonlinear systems assigning a desired (Port‐Controlled Hamiltonian) structure to the closed‐loop. The aim of this paper is to give a survey on different PBC of IM. The originality of this work is that the author proves that the well known field oriented control of IM is a particular case of the IDA‐PBC with disturbance. 相似文献
3.
Evidence suggests that transient visual information, such as animations, may be more challenging to learn than static visualizations. However, when a procedural-manipulative task is involved, our evolved embodied cognition seems to reverse this transitory challenge. Hence, for object manipulative tasks, instructional animations may be more suitable than statics. We investigated this argument further by comparing animations with statics using a Lego task shown to university students, by examining three potential moderators of effectiveness: (a) the environment of manipulation (virtual or physical), (b) the quality of visual information (focused or unfocused), and (c) the presence of hands (no hands or with hands). In Experiment 1 we found an advantage of animation over statics, and no differences among the environments. In Experiment 2, we again observed an animation advantage, a small advantage of focused static information compared to unfocused static information, and a positive effect of not showing the hands. 相似文献
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.
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. 相似文献
6.
嵌入式RTOS中任务优先级反转问题研究 总被引:1,自引:0,他引:1
针对嵌入式实时系统任务调度策略的特点,任务在运行的时候可能被更高优先级的任务中断。分析了嵌入式RTOS中的最高就绪任务的查找算法,指出该调度算法存在的不同优先级的反转问题,并且针对这一问题进行研究,给出了相应的优先级继承方案。较好地解决了RTOS中任务调度中的优先级的反转问题。 相似文献
7.
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. 相似文献
8.
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. 相似文献
9.
介绍了一种日常参数智能控制器的研制及研制过程中的几个重要问题的解决方法。特别是用于城市照明及美化城市的彩灯的开、关时间智能控制方面,给出了依据当地绝对时间、经度、纬度进行昼夜时间计算的方法,使之在不接光电传感器情况下可跟踪季节的昼夜变化。控制系统采用89C2051单片机,配有时钟日历芯片DS12887,系统体积小、功能强、可靠性高。 相似文献
10.
交通平衡分配下的公路桥收费策略 总被引:3,自引:0,他引:3
假定一个城市被一条河流分为两部分(如我国的武汉,重庆等市),河上至少架设了两座公路桥梁,本文研究在交通平衡状态下,怎样制定车辆过桥梁的收费水平,使获得的总收入最大,乘客的总行驶时间最少,对多车种问题,研究了等价的数学模型和算法。还对一个含两座桥梁与三种车型的简单算例,进行了计算与分析。 相似文献