首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3337篇
  免费   251篇
电工技术   35篇
综合类   29篇
化学工业   1166篇
金属工艺   33篇
机械仪表   69篇
建筑科学   119篇
矿业工程   6篇
能源动力   82篇
轻工业   481篇
水利工程   43篇
石油天然气   10篇
无线电   145篇
一般工业技术   525篇
冶金工业   407篇
原子能技术   14篇
自动化技术   424篇
  2024年   16篇
  2023年   27篇
  2022年   163篇
  2021年   222篇
  2020年   117篇
  2019年   94篇
  2018年   120篇
  2017年   120篇
  2016年   129篇
  2015年   110篇
  2014年   145篇
  2013年   211篇
  2012年   180篇
  2011年   259篇
  2010年   146篇
  2009年   159篇
  2008年   173篇
  2007年   122篇
  2006年   103篇
  2005年   75篇
  2004年   68篇
  2003年   76篇
  2002年   74篇
  2001年   48篇
  2000年   41篇
  1999年   50篇
  1998年   125篇
  1997年   72篇
  1996年   48篇
  1995年   39篇
  1994年   29篇
  1993年   38篇
  1992年   17篇
  1991年   13篇
  1990年   11篇
  1989年   8篇
  1988年   7篇
  1987年   14篇
  1986年   12篇
  1985年   9篇
  1983年   10篇
  1982年   7篇
  1981年   12篇
  1980年   9篇
  1979年   10篇
  1978年   6篇
  1977年   10篇
  1976年   9篇
  1975年   5篇
  1971年   4篇
排序方式: 共有3588条查询结果,搜索用时 15 毫秒
71.
72.
Voting is an essential mechanism that allows multiple agents to reach a joint decision. The joint decision, representing a function over the preferences of all agents, is the winner among all possible (candidate) decisions. To compute the winning candidate, previous work has typically assumed that voters send their complete set of preferences for computation, and in fact this has been shown to be required in the worst case. However, in practice, it may be infeasible for all agents to send a complete set of preferences due to communication limitations and willingness to keep as much information private as possible. The goal of this paper is to empirically evaluate algorithms to reduce communication on various sets of experiments. Accordingly, we propose an iterative algorithm that allows the agents to send only part of their preferences, incrementally. Experiments with simulated and real-world data show that this algorithm results in an average of 35% savings in communications, while guaranteeing that the actual winning candidate is revealed. A second algorithm applies a greedy heuristic to save up to 90% of communications. While this heuristic algorithm cannot guarantee that a true winning candidate is found, we show that in practice, close approximations are obtained.  相似文献   
73.
74.
This paper is concerned with two dimensional numerical simulations of plane extrusion of a Newtonian fluid. The problem is discretized using the spectral element method and the free surface is evolved according to an ALE treatment. Numerical simulations are performed over a wide range of Reynolds and Weber numbers to highlight the effects of inertia and surface tension, respectively. Convergence of the numerical approximations with respect to polynomial order is demonstrated for the sensitive measures of free surface location and downstream relaxation distance. The higher the inertia the further downstream the relaxation occurs. Numerical results show good qualitative and quantitative agreement with predictions of other numerical schemes and experiments.  相似文献   
75.
A profit and a demand are associated with each edge of a set of profitable edges of a given graph. A travel time is associated with each edge of the graph. A fleet of capacitated vehicles is given to serve the profitable edges. A maximum duration of the route of each vehicle is also given. The profit of an edge can be collected by one vehicle only that also serves the demand of the edge. The objective of this problem, which is called the undirected capacitated arc routing problem with profits (UCARPP), is to find a set of routes that satisfy the constraints on the duration of the route and on the capacity of the vehicle and maximize the total collected profit. We propose a branch-and-price algorithm and several heuristics. We can solve exactly instances with up to 97 profitable edges. The best heuristics find the optimal solution on most of instances where it is available.  相似文献   
76.
ContextOpen source software (OSS) is changing the way organizations develop, acquire, use, and commercialize software.ObjectiveThis paper seeks to identify how organizations adopt OSS, classify the literature according to these ways of adopting OSS, and with a focus on software development evaluate the research on adoption of OSS in organizations.MethodBased on the systematic literature review method we reviewed publications from 24 journals and seven conference and workshop proceedings, published between 1998 and 2008. From a population of 24,289 papers, we identified 112 papers that provide empirical evidence on how organizations actually adopt OSS.ResultsWe show that adopting OSS involves more than simply using OSS products. We moreover provide a classification framework consisting of six distinctly different ways in which organizations adopt OSS. This framework is used to illustrate some of the opportunities and challenges organizations meet when approaching OSS, to show that OSS can be adopted successfully in different ways, and to organize and review existing research. We find that existing research on OSS adoption does not sufficiently describe the context of the organizations studied, and it fails to benefit fully from related research fields. While existing research covers a large number of topics, it contains very few closely related studies. To aid this situation, we offer directions for future research.ConclusionThe implications of our findings are twofold. On the one hand, practitioners should embrace the many opportunities OSS offers, but consciously evaluate the consequences of adopting it in their own context. They may use our framework and the success stories provided by the literature in their own evaluations. On the other hand, researchers should align their work, and perform more empirical research on topics that are important to organizations. Our framework may be used to position this research and to describe the context of the organization they are studying.  相似文献   
77.
We consider a production-distribution system, where a facility produces one commodity which is distributed to a set of retailers by a fleet of vehicles. Each retailer defines a maximum level of the inventory. The production policy, the retailers replenishment policies and the transportation policy have to be determined so as to minimize the total system cost. The overall cost is composed by fixed and variable production costs at the facility, inventory costs at both facility and retailers and routing costs. We study two different types of replenishment policies. The well-known order-up to level (OU) policy, where the quantity shipped to each retailer is such that the level of its inventory reaches the maximum level, and the maximum level (ML) policy, where the quantity shipped to each retailer is such that the inventory is not greater than the maximum level. We first show that when the transportation is outsourced, the problem with OU policy is NP-hard, whereas there exists a class of instances where the problem with ML policy can be solved in polynomial time. We also show the worst-case performance of the OU policy with respect to the more flexible ML policy. Then, we focus on the ML policy and the design of a hybrid heuristic. We also present an exact algorithm for the solution of the problem with one vehicle. Results of computational experiments carried out on small size instances show that the heuristic can produce high quality solutions in a very short amount of time. Results obtained on a large set of randomly generated problem instances are also shown, aimed at comparing the two policies.  相似文献   
78.
In this work we used the sol-gel technique to develop luminescent Eu(III) transparent films deposited on glass slides to build for sensor devices capable of monitoring transition metal ions in aqueous solutions. The films were obtained from a bis(trialkoxysilyl) organic precursor synthesized from the amide of the 2,6-pyridinedicarboxylic acid (DPA) with aminopropyltriethoxysilane (APTES) in the presence or absence of cetyl trimethyl ammonium bromide (CTAB) surfactant as templating agent and triethylethoxysilane (TEOS) as crosslinker. These sensor devices were used to perform in situ quenching experiments by Cu(II), Fe(III), Co(II) and Ni(II) ions. The results indicate that the templated films allow the detection and quantification of these metals down to ppb levels by means of the values of the Stern-Volmer constants. In particular, it was shown that Cu(II) acts as an extremely efficient quencher (KSV = 3.5 × 105 M−1) when compared with the results obtained for the other metals, opening the possibility to use these devices as potential Cu(II) sensors for actual applications in aqueous media.  相似文献   
79.

Context

Adopting IT innovation in organizations is a complex decision process driven by technical, social and economic issues. Thus, those organizations that decide to adopt innovation take a decision of uncertain success of implementation, as the actual use of a new technology might not be the one expected. The misalignment between planned and effective use of innovation is called assimilation gap.

Objective

This research aims at defining a quantitative instrument for measuring the assimilation gap and applying it to the case of the adoption of OSS.

Method

In this paper, we use the theory of path dependence and increasing returns of Arthur. In particular, we model the use of software applications (planned or actual) by stochastic processes defined by the daily amounts of files created with the applications. We quantify the assimilation gap by comparing the resulting models by measures of proximity.

Results

We apply and validate our method to a real case study of introduction of OpenOffice. We have found a gap between the planned and the effective use despite well-defined directives to use the new OS technology. These findings suggest a need of strategy re-calibration that takes into account environmental factors and individual attitudes.

Conclusions

The theory of path dependence is a valid instrument to model the assimilation gap provided information on strategy toward innovation and quantitative data on actual use are available.  相似文献   
80.
Massimo Ficco  Stefano Russo 《Software》2009,39(13):1095-1125
Location‐aware computing is a form of context‐aware mobile computing that refers to the ability of providing users with services that depend on their position. Locating the user terminal, often called positioning, is essential in this form of computing. Towards this aim, several technologies exist, ranging from personal area networking, to indoor, outdoor, and up to geographic area systems. Developers of location‐aware software applications have to face with a number of design choices, that typically depend on the chosen technology. This work addresses the problem of easing the development of pull location‐aware applications, by allowing uniform access to multiple heterogeneous positioning systems. Towards this aim, the paper proposes an approach to structure location‐aware mobile computing systems in a way independent of positioning technologies. The approach consists in structuring the system into a layered architecture, that provides application developers with a standard Java Application Programming Interface (JSR‐179 API), and encapsulates location data management and technology‐specific positioning subsystems into lower layers with clear interfaces. In order to demonstrate the proposed approach we present the development of HyLocSys. It is an open hybrid software architecture designed to support indoor/outdoor applications, which allows the uniform (combined or separate) use of several positioning technologies. HyLocSys uses a hybrid data model, which allows the integration of different location information representations (using symbolic and geometric coordinates). Moreover, it allows support to handset‐ and infrastructure‐based positioning approaches while respecting the privacy of the user. The paper presents a prototypal implementation of HyLocSys for heterogeneous scenarios. It has been implemented and tested on several platforms and mobile devices. Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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