首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1058篇
  免费   13篇
  国内免费   2篇
工业技术   1073篇
  2024年   19篇
  2023年   19篇
  2022年   94篇
  2021年   119篇
  2020年   35篇
  2019年   28篇
  2018年   48篇
  2017年   40篇
  2016年   48篇
  2015年   30篇
  2014年   59篇
  2013年   64篇
  2012年   56篇
  2011年   60篇
  2010年   49篇
  2009年   35篇
  2008年   34篇
  2007年   20篇
  2006年   25篇
  2005年   21篇
  2004年   22篇
  2003年   14篇
  2002年   7篇
  2001年   7篇
  2000年   6篇
  1999年   13篇
  1998年   8篇
  1997年   10篇
  1996年   6篇
  1995年   10篇
  1993年   10篇
  1992年   4篇
  1990年   2篇
  1989年   2篇
  1988年   3篇
  1987年   4篇
  1986年   3篇
  1985年   5篇
  1983年   3篇
  1982年   5篇
  1981年   3篇
  1980年   2篇
  1979年   3篇
  1978年   2篇
  1976年   4篇
  1975年   3篇
  1974年   2篇
  1965年   1篇
  1964年   1篇
  1953年   1篇
排序方式: 共有1073条查询结果,搜索用时 24 毫秒
81.
Application Layer Traffic Optimization (ALTO) has recently gained attention in the research and standardisation community as a way for a network operator to guide the peer selection process of distributed applications by providing network layer topology information. In particular P2P applications are expected to gain from ALTO, due to the many connections peers form among each other, often without taking network layer topology information into account. In this paper, we present results of an extensive intra-ISP trial with an ALTO-enhanced P2P filesharing software. In summary, our results show that—depending on the concrete setting and on the distribution of upload capacity in the network—ALTO enables an ISP to save operational costs significantly while not degrading application layer performance noticeably. In addition, based on our experience we are able to give advice to operators on how to save costs with ALTO while not sacrificing application layer performance at all.  相似文献   
82.
System identification is one of the most important research directions. It is a diverse field which can be employed in many different areas. One of them is the model-based fault diagnosis. Thus, the problems of system identification and fault diagnosis are closely related. Unfortunately, in both cases, the research is strongly oriented towards linear systems, while the problem of identification and fault diagnosis of non-linear dynamic systems still remains open. There are, of course, many more or less sophisticated approaches to this problem, although they are not as reliable and universal as those related to linear systems, and the choice of the method to be used depends on the application. The purpose of this paper is to provide a new system identification framework based on a genetic programming technique. Moreover, a fault diagnosis scheme for non-linear systems is proposed. In particular, a new fault detection observer is presented, and the Lyapunov approach is used to show that the proposed observer is convergent under certain conditions. It is also shown how to use the genetic programming technique to increase the convergence rate of the observer. The final part of this paper contains numerical examples concerning identification of chosen parts of the evaporation station at the Lublin Sugar Factory S.A., as well as state estimation and fault diagnosis of an induction motor.  相似文献   
83.
84.
85.
The Parity Path problem is to decide if a given graph contains both an induced path of odd length and an induced path of even length between two specified vertices. In the related problems Odd Induced Path and Even Induced Path, the goal is to determine whether an induced path of odd, respectively even, length between two specified vertices exists. Although all three problems are NP-complete in general, we show that they can be solved in $\mathcal{O}(n^{5})$ time for the class of claw-free graphs. Two vertices s and t form an even pair in G if every induced path from s to t in G has even length. Our results imply that the problem of deciding if two specified vertices of a claw-free graph form an even pair, as well as the problem of deciding if a given claw-free graph has an even pair, can be solved in $\mathcal{O}(n^{5})$ time and $\mathcal{O}(n^{7})$ time, respectively. We also show that we can decide in $\mathcal{O}(n^{7})$ time whether a claw-free graph has an induced cycle of given parity through a specified vertex. Finally, we show that a shortest induced path of given parity between two specified vertices of a claw-free perfect graph can be found in $\mathcal {O}(n^{7})$ time.  相似文献   
86.
We propose a new encryption algorithm relying on reversible cellular automata (CA). The behavior complexity of CA and their parallel nature makes them interesting candidates for cryptography. The proposed algorithm belongs to the class of symmetric key systems. Marcin Seredynski: He is a Ph.D. student at University of Luxembourg and Polish Academy of Sciences. He received his M.S. in 2004 from Faculty of Electronics and Information Technology in Warsaw University of Technology. His research interests include cryptography, cellular automata, nature inspired algorithms and network security. Currently he is working on intrusion detection algorithms for ad-hoc networks. Pascal Bouvry, Ph.D.: He earned his undergraduate degree in Economical & Social Sciences and his Master degree in Computer Science with distinction (’91) from the University of Namur, Belgium. He went on to obtain his Ph.D. degree (’94) in Computer Science with great distinction at the University of Grenoble (INPG), France. His research at the IMAG laboratory focussed on Mapping and scheduling task graphs onto Distributed Memory Parallel Computers. Next, he performed post-doctoral researches on coordination languages and multi-agent evolutionary computing at CWI in Amsterdam. He gained industrial experience as manager of the technology consultant team for FICS in the banking sector (Brussels, Belgium). Next, he worked as CEO and CTO of SDC (Ho Chi Minh city, Vietnam) in the telecom, semi-conductor and space industry. After that, He moved to Montreal Canada as VP Production of Lat45 and Development Director for MetaSolv Software in the telecom industry. He is currently serving as Professor in the group of Computer Science and Communications (CSC) of the Faculty of Sciences, Technology and Communications of Luxembourg University and he is heading the Intelligent & Adaptive Systems lab. His current research interests include: ad-hoc networks & grid-computing, evolutionary algorithms and multi-agent systems.  相似文献   
87.
New Results in Minimum-Comparison Sorting   总被引:1,自引:0,他引:1  
We prove that sorting 13, 14 and 22 elements requires 34, 38 and 71 comparisons, respectively. This solves a long-standing problem posed by Knuth in his famous book The Art of Computer Programming, Volume 3, Sorting and Searching. The results are due to an efficient implementation of an algorithm for counting linear extensions of a given partial order. We also present some useful heuristics which allow us to decrease the running time of the implementation.  相似文献   
88.
This paper describes a method of rigorous verification of an isolating neighborhood based on computer assisted computations. As an application we study the Kuramoto-Sivashinsky equation. The result of the computer assisted proof was directly used in [9] to prove the existence of heteroclinic solutions of the Kuramoto-Sivashinsky equation.  相似文献   
89.
Integrated motion planning and control for the purposes of maneuvering mobile robots under state- and input constraints is a problem of vital practical importance in applications of mobile robots such as autonomous transportation. Those constraints arise naturally in practice due to specifics of robot mechanical construction and the presence of obstacles in motion environment. In contrast to approaches focusing on feedback control design under the assumption of given reference motion or motion planning with neglection of subsequent feedback motion execution, we adopt a controller-driven motion planning paradigm, which has recently gained attention of many researchers. It postulates design of motion planning algorithms dedicated to specific feedback control policies, which compute a sequence of feedback control subtasks instead of classically planned open-loop controls or parametric paths. In this spirit, we propose a motion planning algorithm driven by the VFO (Vector Field Orientation) control law for the waypoint-following task. Presented analysis of the VFO control law reveals its beneficial properties, which are subsequently utilized to solve a generally nonlinear and non-convex optimal motion planning problem by formulating it as a mixed-integer linear program (MILP). The solution proposed in this paper yields a waypoint sequence, which is designed for execution by application of the VFO control law to drive a robot to a prescribed final configuration under an input constraint imposed by bounded curvature of robot motion and state constraints resulting from a convex decomposition of task space. Satisfaction of these constraints is guaranteed analytically and exactly, i.e., without utilization of numerical approximations. Moreover, for a given discrete set of possible waypoint orientations, the proposed algorithm computes plans optimal w.r.t. given cost functional, which can be any convex linear combination of quantities such as robot path length, curvature of robot motion, distance to imposed state constraints, etc. Furthermore, the planning algorithm exploits the possibility of both forward or backward movement of the robot to allow maneuvering in demanding environments. Generated waypoint sequences are a compact representation of a motion plan, which can be immediately executed with the VFO controller without any additional post-processing. Validity of the proposed approach has been confirmed by simulation studies and experimental motion execution with a laboratory-scale mobile robot.  相似文献   
90.
Neural Computing and Applications - The paper is devoted to the problem of a neural network-based robust simultaneous actuator and sensor faults estimator design for the purpose of the fault...  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号

京公网安备 11010802026262号