全文获取类型
收费全文 | 2198篇 |
免费 | 163篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 21篇 |
综合类 | 2篇 |
化学工业 | 483篇 |
金属工艺 | 46篇 |
机械仪表 | 95篇 |
建筑科学 | 91篇 |
矿业工程 | 4篇 |
能源动力 | 206篇 |
轻工业 | 321篇 |
水利工程 | 26篇 |
石油天然气 | 16篇 |
无线电 | 144篇 |
一般工业技术 | 370篇 |
冶金工业 | 103篇 |
原子能技术 | 36篇 |
自动化技术 | 399篇 |
出版年
2024年 | 9篇 |
2023年 | 27篇 |
2022年 | 62篇 |
2021年 | 105篇 |
2020年 | 70篇 |
2019年 | 66篇 |
2018年 | 127篇 |
2017年 | 89篇 |
2016年 | 126篇 |
2015年 | 75篇 |
2014年 | 113篇 |
2013年 | 274篇 |
2012年 | 127篇 |
2011年 | 161篇 |
2010年 | 136篇 |
2009年 | 201篇 |
2008年 | 115篇 |
2007年 | 88篇 |
2006年 | 77篇 |
2005年 | 38篇 |
2004年 | 37篇 |
2003年 | 24篇 |
2002年 | 26篇 |
2001年 | 14篇 |
2000年 | 22篇 |
1999年 | 14篇 |
1998年 | 28篇 |
1997年 | 13篇 |
1996年 | 7篇 |
1995年 | 12篇 |
1994年 | 9篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 6篇 |
1989年 | 2篇 |
1988年 | 2篇 |
1986年 | 3篇 |
1985年 | 2篇 |
1984年 | 5篇 |
1983年 | 7篇 |
1982年 | 6篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 8篇 |
1978年 | 5篇 |
1975年 | 1篇 |
1974年 | 3篇 |
1973年 | 2篇 |
1971年 | 1篇 |
排序方式: 共有2363条查询结果,搜索用时 578 毫秒
41.
Mobility path information of cell phone users play a crucial role in a wide range of cell phone applications, including context based search and advertising, early warning systems, city-wide sensing applications such as air pollution exposure estimation and traffic planning. However, there is a disconnect between the low level location data logs available from the cell phones and the high level mobility path information required to support these cell phone applications. In this paper, we present formal definitions to capture the cell phone users’ mobility patterns and profiles, and provide a complete framework, Mobility Profiler, for discovering mobile cell phone user profiles starting from cell based location data. We use real-world cell phone log data (of over 350 K h of coverage) to demonstrate our framework and perform experiments for discovering frequent mobility patterns and profiles. Our analysis of mobility profiles of cell phone users expose a significant long tail in a user’s location-time distribution: A total of 15% of a cell phone user’s time is spent on average in locations that each appears with less than 1% of total time. 相似文献
42.
Detecting and tracking ground targets is crucial in military intelligence in battlefield surveillance. Once targets have been detected, the system used can proceed to track them where tracking can be done using Ground Moving Target Indicator (GMTI) type indicators that can observe objects moving in the area of interest. However, when targets move close to each other in formation as a convoy, then the problem of assigning measurements to targets has to be addressed first, as it is an important step in target tracking. With the increasing computational power, it became possible to use more complex association logic in tracking algorithms. Although its optimal solution can be proved to be an NP hard problem, the multidimensional assignment enjoyed a renewed interest mostly due to Lagrangian relaxation approaches to its solution. Recently, it has been reported that randomized heuristic approaches surpassed the performance of Lagrangian relaxation algorithm especially in dense problems. In this paper, impelled from the success of randomized heuristic methods, we investigate a different stochastic approach, namely, the biologically inspired ant colony optimization to solve the NP hard multidimensional assignment problem for tracking multiple ground targets. 相似文献
43.
This paper proposes the Mobility-Aware Resource Reservation Protocol (MARSVP) in which mobility and QoS signaling are performed as a single functional block. The key concept of MARSVP is to convey mobility-specific information (binding updates and their associated acknowledgments) by using newly defined RSVP objects embedded in existing RSVP messages. An appealing feature of MARSVP is that it adheres to the current RSVP standard (RFC 2205) and thus requires minimal changes to end nodes without affecting any of the conventional RSVP routers in between. The proposed mechanism is evaluated using a simulation model for application-level performance and an analytical model for network-level signaling cost. Simulation results indicate a 27.9% improvement in QoS interruption when using Mobile IPv6 (MIPv6), 12.5% when using Hierarchical Mobile IPv6 (HMIPv6), and no improvement when using Fast Handovers for MIPv6 (FMIPv6). On the network-level, signaling cost savings of 9.4% and 11.9% are achieved for MIPv6 and HMIPv6, respectively, while FMIPv6 achieves savings of 17.9% when using Voice-over-IP traffic and 26.7% for Video-over-IP traffic. The results of the conducted studies indicate MARSVP’s superiority to conventional RSVP when deployed over wireless networks. 相似文献
44.
In a network, one of the important problems is making an efficient routing decision. Many studies have been carried out on
making a decision and several routing algorithms have been developed. In a network environment, every node has a routing table
and these routing tables are used for making routing decisions. Nowadays, intelligent agents are used to make routing decisions.
Intelligent agents have been inspired by social insects such as ants. One of the intelligent agent types is self a cloning
ant. In this study, a self cloning ant colony approach is used. Self cloning ants are a new synthetic ant type. This ant assesses
the situation and multiplies through cloning or destroying itself. It is done by making a routing decision and finding the
optimal path. This study explains routing table updating by using the self cloning ant colony approach. In a real net, this
approach has been used and routing tables have been created and updated for every node. 相似文献
45.
Bug fixing has a key role in software quality evaluation. Bug fixing starts with the bug localization step, in which developers use textual bug information to find location of source codes which have the bug. Bug localization is a tedious and time consuming process. Information retrieval requires understanding the programme's goal, coding structure, programming logic and the relevant attributes of bug. Information retrieval (IR) based bug localization is a retrieval task, where bug reports and source files represent the queries and documents, respectively. In this paper, we propose BugCatcher, a newly developed bug localization method based on multi‐level re‐ranking IR technique. We evaluate BugCatcher on three open source projects with approximately 3400 bugs. Our experiments show that multi‐level reranking approach to bug localization is promising. Retrieval performance and accuracy of BugCatcher are better than current bug localization tools, and BugCatcher has the best Top N, Mean Average Precision (MAP) and Mean Reciprocal Rank (MRR) values for all datasets. 相似文献
46.
Anthony?Etuk Timothy?J.?Norman Murat??ensoyEmail author Mudhakar?Srivatsa 《Autonomous Agents and Multi-Agent Systems》2017,31(3):531-560
The presence of numerous and disparate information sources available to support decision-making calls for efficient methods of harnessing their potential. Information sources may be unreliable, and misleading reports can affect decisions. Existing trust and reputation mechanisms typically rely on reports from as many sources as possible to mitigate the influence of misleading reports on decisions. In the real world, however, it is often the case that querying information sources can be costly in terms of energy, bandwidth, delay overheads, and other constraints. We present a model of source selection and fusion in resource-constrained environments, where there is uncertainty regarding the trustworthiness of sources. We exploit diversity among sources to stratify them into homogeneous subgroups to both minimise redundant sampling and mitigate the effect of certain biases. Through controlled experiments, we demonstrate that a diversity-based approach is robust to biases introduced due to dependencies among source reports, performs significantly better than existing approaches when sampling budget is limited and equally as good with an unlimited budget. 相似文献
47.
Murat Arcak Author vitae 《Automatica》2011,(6):1219-1229
We present a condition that guarantees spatial uniformity for the asymptotic behavior of the solutions of a reaction–diffusion PDE with Neumann boundary conditions. This condition makes use of the Jacobian matrix of the reaction terms and the second Neumann eigenvalue of the Laplacian operator on the given spatial domain, and eliminates the global Lipschitz assumptions commonly used in mathematical biology literature. We then derive numerical procedures that employ linear matrix inequalities to certify this condition, and illustrate these procedures on models of several biochemical reaction networks. Finally, we present an analog of this PDE result for the synchronization of a network of identical ODE models coupled by diffusion terms. From a systems biology perspective, the main contribution of the paper is to blend analytical and numerical tools from nonlinear systems and control theory to derive a relaxed and verifiable condition for spatial uniformity of biological processes. 相似文献
48.
We extend the traditional notion of passivity to a forced system whose equilibrium is dependent on the control input by defining equilibrium-independent passivity, a system property characterized by a dissipation inequality centered at an arbitrary equilibrium point. We provide a necessary input/output condition which can be tested for systems of arbitrary dimension and sufficient conditions to certify this property for scalar systems. An example from network stability analysis is presented which demonstrates the utility of this new definition. We then proceed to numerical certification of equilibrium-independent passivity using sum-of-squares programming. Finally, through numerical examples we show that equilibrium-independent passivity is less restrictive than incremental passivity. 相似文献
49.
Ali Şaman Tosun 《Distributed and Parallel Databases》2006,19(2-3):107-124
Declustering is a common technique used to reduce query response times. Data is declustered over multiple disks and query
retrieval can be parallelized. Most of the research on declustering is targeted at spatial range queries and investigates
schemes with low additive error. Recently, declustering using replication has been proposed to reduce the additive overhead.
Replication significantly reduces retrieval cost of arbitrary queries. In this paper, we propose a disk allocation and retrieval
mechanism for arbitrary queries based on design theory. Using the proposed c-copy replicated declustering scheme,
buckets can be retrieved using at most k disk accesses. Retrieval algorithm is very efficient and is asymptotically optimal with
complexity for a query Q. In addition to the deterministic worst-case bound and efficient retrieval, proposed algorithm handles nonuniform data, high
dimensions, supports incremental declustering and has good fault-tolerance property. Experimental results show the feasibility
of the algorithm.
Recommended by: Sunil Prabhakar 相似文献
50.
Permanent international river basin organizations (IRBOs) come in many shapes and sizes, ranging from those which are mainly facilitative in nature to those empowered to act on their own. Although differences in IRBO types may have important impacts on transboundary water resources management, systematic analysis of variation in their structure and responsibilities is scant. This paper synthesizes and applies a typology to determine the structural composition, abundance, spatial distribution, scale and in-basin configurations of the different forms of IRBOs. The results provide a set of options for future IRBOs, and serve to ground-truth and nuance theoretical divisions between different types of organizations in transboundary basins. 相似文献