全文获取类型
收费全文 | 1308篇 |
免费 | 76篇 |
国内免费 | 2篇 |
学科分类
工业技术 | 1386篇 |
出版年
2024年 | 4篇 |
2023年 | 14篇 |
2022年 | 31篇 |
2021年 | 40篇 |
2020年 | 36篇 |
2019年 | 35篇 |
2018年 | 64篇 |
2017年 | 37篇 |
2016年 | 66篇 |
2015年 | 39篇 |
2014年 | 63篇 |
2013年 | 125篇 |
2012年 | 75篇 |
2011年 | 108篇 |
2010年 | 68篇 |
2009年 | 137篇 |
2008年 | 83篇 |
2007年 | 63篇 |
2006年 | 61篇 |
2005年 | 34篇 |
2004年 | 31篇 |
2003年 | 25篇 |
2002年 | 21篇 |
2001年 | 13篇 |
2000年 | 14篇 |
1999年 | 7篇 |
1998年 | 15篇 |
1997年 | 9篇 |
1996年 | 4篇 |
1995年 | 7篇 |
1994年 | 3篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 3篇 |
1985年 | 1篇 |
1984年 | 3篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1980年 | 2篇 |
1979年 | 7篇 |
1978年 | 3篇 |
1977年 | 1篇 |
1975年 | 1篇 |
1974年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有1386条查询结果,搜索用时 15 毫秒
11.
The kinetics of non-congruent dissolution of long E-glass fiber in saturated calcium hydroxide solution has been investigated at 25°C in a closed reactor adopting the rotating disc method for the sample holder. The fiber dissolution rate (), measured from the relative loss weight of the fiber after selective dissolution of the attack layer in acetic acid, is a linear function of time, what implies an interfacial dissolution process. However, the kinetics does not stay regular for a long time due to local detachment of the attack layer. The comparison between = f (t) and ′ = f (t) curves, where ′ is the formation rate of the attack layer, shows that the formation of the layer does not only imply the deposit of a bad-crystalline hydrated calcium silicate but the nucleation and growth of solid calcium hydroxide and calcium carbonate resulting from the transfert, to the interface, of ions coming from the liquid phase. This phenomenon was precedently observed by some other authors in the case of glass-fiber reinforced cement matrix. 相似文献
12.
It is commonly accepted that an individual's beliefs and actions are based on his or her assessment and perceptions of the world. In order to determine what practices an individual is likely to follow at any given time, it is necessary to understand the individual's behavioral intention in a given circumstance. From an Information Technology perspective, a software development professional's belief systems are potentially the basis for the adoption and implementation of new and innovative work practices and processes. In this article, we explore the belief systems of software development professionals in order to understand the beliefs underlying intention and practice, and we seek answers about how they adopt or reject new and innovative software development processes and practices. The results point out a strong influence of past experiences, personality types, and repeated behavior on current software development processes and practices in industrial settings. 相似文献
13.
14.
Murat Kalender Ahmed Kheiri Ender Özcan Edmund K. Burke 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2013,17(12):2279-2292
Educational timetabling problem is a challenging real world problem which has been of interest to many researchers and practitioners. There are many variants of this problem which mainly require scheduling of events and resources under various constraints. In this study, a curriculum based course timetabling problem at Yeditepe University is described and an iterative selection hyper-heuristic is presented as a solution method. A selection hyper-heuristic as a high level methodology operates on the space formed by a fixed set of low level heuristics which operate directly on the space of solutions. The move acceptance and heuristic selection methods are the main components of a selection hyper-heuristic. The proposed hyper-heuristic in this study combines a simulated annealing move acceptance method with a learning heuristic selection method and manages a set of low level constraint oriented heuristics. A key goal in hyper-heuristic research is to build low cost methods which are general and can be reused on unseen problem instances as well as other problem domains desirably with no additional human expert intervention. Hence, the proposed method is additionally applied to a high school timetabling problem, as well as six other problem domains from a hyper-heuristic benchmark to test its level of generality. The empirical results show that our easy-to-implement hyper-heuristic is effective in solving the Yeditepe course timetabling problem. Moreover, being sufficiently general, it delivers a reasonable performance across different problem domains. 相似文献
15.
We study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors is specified, and chain partitioning, where processor permutation is allowed. We present polynomial time algorithms to solve the chain-on-chain partitioning problem optimally, while we prove that the chain partitioning problem is NP-complete. Our empirical studies show that our proposed exact algorithms produce substantially better results than heuristics, while solution times remain comparable. 相似文献
16.
Mathematical model of vertical electrical sounding by using resistivity method is studied. The model leads to an inverse problem of determination of the unknown leading coefficient (conductivity) of the elliptic equation in R2 in a slab. The direct problem is obtained in the form of mixed BVP in axisymmetric cylindrical coordinates. The additional (available measured) data is given on the upper boundary of the slab, in the form of tangential derivative. Due to ill-conditionedness of the considered inverse problem the logarithmic transformation is applied to the unknown coefficient and the inverse problem is studied as a minimization problem for the cost functional, with respect to the reflection coefficient. The Conjugate Gradient method (CGM) is applied for the numerical solution of this problem. Computational experiments were performed with noise free and random noisy data. 相似文献
17.
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. 相似文献
18.
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. 相似文献
19.
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. 相似文献
20.
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. 相似文献