全文获取类型
收费全文 | 2300篇 |
免费 | 137篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 39篇 |
综合类 | 3篇 |
化学工业 | 600篇 |
金属工艺 | 37篇 |
机械仪表 | 35篇 |
建筑科学 | 77篇 |
矿业工程 | 2篇 |
能源动力 | 108篇 |
轻工业 | 197篇 |
水利工程 | 8篇 |
石油天然气 | 6篇 |
无线电 | 194篇 |
一般工业技术 | 372篇 |
冶金工业 | 208篇 |
原子能技术 | 24篇 |
自动化技术 | 528篇 |
出版年
2024年 | 5篇 |
2023年 | 18篇 |
2022年 | 85篇 |
2021年 | 113篇 |
2020年 | 54篇 |
2019年 | 93篇 |
2018年 | 85篇 |
2017年 | 76篇 |
2016年 | 91篇 |
2015年 | 75篇 |
2014年 | 97篇 |
2013年 | 145篇 |
2012年 | 141篇 |
2011年 | 167篇 |
2010年 | 122篇 |
2009年 | 118篇 |
2008年 | 119篇 |
2007年 | 85篇 |
2006年 | 85篇 |
2005年 | 59篇 |
2004年 | 65篇 |
2003年 | 44篇 |
2002年 | 27篇 |
2001年 | 30篇 |
2000年 | 36篇 |
1999年 | 21篇 |
1998年 | 50篇 |
1997年 | 57篇 |
1996年 | 29篇 |
1995年 | 24篇 |
1994年 | 15篇 |
1993年 | 24篇 |
1992年 | 11篇 |
1991年 | 14篇 |
1990年 | 12篇 |
1989年 | 6篇 |
1988年 | 20篇 |
1987年 | 7篇 |
1986年 | 7篇 |
1985年 | 13篇 |
1984年 | 8篇 |
1983年 | 11篇 |
1981年 | 5篇 |
1980年 | 7篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 11篇 |
1974年 | 7篇 |
1969年 | 4篇 |
1968年 | 5篇 |
排序方式: 共有2438条查询结果,搜索用时 15 毫秒
21.
Fabio Calefato Filippo Lanubile Tayana Conte Rafael Prikladnicki 《Empirical Software Engineering》2016,21(3):1002-1034
Communication in global software development is hindered by language differences in countries with a lack of English speaking professionals. Machine translation is a technology that uses software to translate from one natural language to another. The progress of machine translation systems has been steady in the last decade. As for now, machine translation technology is particularly appealing because it might be used, in the form of cross-language chat services, in countries that are entering into global software projects. However, despite the recent progress of the technology, we still lack a thorough understanding of how real-time machine translation affects communication. In this paper, we present a set of empirical studies with the goal of assessing to what extent real-time machine translation can be used in distributed, multilingual requirements meetings instead of English. Results suggest that, despite far from 100 % accurate, real-time machine translation is not disruptive of the conversation flow and, therefore, is accepted with favor by participants. However, stronger effects can be expected to emerge when language barriers are more critical. Our findings add to the evidence about the recent advances of machine translation technology and provide some guidance to global software engineering practitioners in regarding the losses and gains of using English as a lingua franca in multilingual group communication, as in the case of computer-mediated requirements meetings. 相似文献
22.
23.
M. Gobbi F. Levi G. Mastinu G. Previati 《Structural and Multidisciplinary Optimization》2015,51(3):645-657
The Fritz John conditions for Pareto-optimality have been set in matrix form and used for introducing a procedure for the analytical derivation of the Pareto-optimal set in the design variables domain. Subsequently, the derivation of the Pareto-optimal set in the objective functions domain can be obtained, if possible, by a proper analytical derivation. Both the objective and constraint functions are assumed to be available in analytical form and twice differentiable and convex (or pseudo-convex). The proposed procedure to find the Pareto-optimal set is relatively simple. The computation of the determinant of a matrix is required. A symbolic manipulator can be exploited. If there are two design variables and two objective functions, the Pareto-optimal set can be easily computed by applying a simple formula derived in the paper. If the number of design variables equals the number of objective functions, the Pareto-optimal set in the design variables domain can be found by computing the product of the constraint functions times the determinant of the Jacobian of the objective functions. A number of case studies have been proposed to test the effectiveness of the proposed procedure. The optimal structural design of, respectively, a pair of compressed spheres, a cantilever with rectangular cross section have been faced and solved. Additionally the test problem proposed by Fonseca and Fleming has been addressed and solved analytically. Optimization problems with low dimensionality (2 or 3 design variables and 2 objective functions, 2 or more constraints) have been easily solved. The proposed procedure can be useful in the actual engineering practice at the earliest design stage. In this case the designer can be made aware on the proper design variables setting to obtain the desired tradeoff among conflicting objective functions. 相似文献
24.
Carlos Rodríguez Daniel Schleicher Florian Daniel Fabio Casati Frank Leymann Sebastian Wagner 《Service Oriented Computing and Applications》2013,7(4):275-292
Facilitating compliance management, that is, assisting a company’s management in conforming to laws, regulations, standards, contracts, and policies, is a hot but non-trivial task. The service-oriented architecture (SOA) has evolved traditional, manual business practices into modern, service-based IT practices that ease part of the problem: the systematic definition and execution of business processes. This, in turn, facilitates the online monitoring of system behaviors and the enforcement of allowed behaviors—all ingredients that can be used to assist compliance management on the fly during process execution. In this paper, instead of focusing on monitoring and runtime enforcement of rules or constraints, we strive for an alternative approach to compliance management in SOAs that aims at assessing and improving compliance. We propose two ingredients: (i) a model and tool to design compliant service-based processes and to instrument them in order to generate evidence of how they are executed and (ii) a reporting and analysis suite to create awareness of a company’s compliance state and to enable understanding why and where compliance violations have occurred. Together, these ingredients result in an approach that is close to how the real stakeholders—compliance experts and auditors—actually assess the state of compliance in practice and that is less intrusive than enforcing compliance. 相似文献
25.
26.
Jorge E. Camargo Juan C. Caicedo Fabio A. Gonzalez 《Journal of Visual Languages and Computing》2013,24(1):53-67
While search engines have been a successful tool to search text information, image search systems still face challenges. The keyword-based query paradigm used to search in image collection systems, which has been successful in text retrieval, may not be useful in scenarios where the user does not have the precise way to express a visual query. Image collection exploration is a new paradigm where users interact with the image collection to discover useful and relevant pictures. This paper proposes a framework for the construction of an image collection exploration system based on kernel methods, which offers a mathematically strong basis to address each stage of an image collection exploration system: image representation, summarization, visualization and interaction. In particular, our approach emphasizes a semantic representation of images using kernel functions, which can be seamlessly harnessed across all system components. Experiments were conducted with real users to verify the effectiveness and efficiency of the proposed strategy. 相似文献
27.
Fabio Poiesi Riccardo Mazzon Andrea Cavallaro 《Computer Vision and Image Understanding》2013,117(10):1257-1272
We propose a generic online multi-target track-before-detect (MT-TBD) that is applicable on confidence maps used as observations. The proposed tracker is based on particle filtering and automatically initializes tracks. The main novelty is the inclusion of the target ID in the particle state, enabling the algorithm to deal with unknown and large number of targets. To overcome the problem of mixing IDs of targets close to each other, we propose a probabilistic model of target birth and death based on a Markov Random Field (MRF) applied to the particle IDs. Each particle ID is managed using the information carried by neighboring particles. The assignment of the IDs to the targets is performed using Mean-Shift clustering and supported by a Gaussian Mixture Model. We also show that the computational complexity of MT-TBD is proportional only to the number of particles. To compare our method with recent state-of-the-art works, we include a postprocessing stage suited for multi-person tracking. We validate the method on real-world and crowded scenarios, and demonstrate its robustness in scenes presenting different perspective views and targets very close to each other. 相似文献
28.
Miloš Hašan Edgar Velázquez‐Armendáriz Fabio Pellacini Kavita Bala 《Computer Graphics Forum》2008,27(4):1105-1114
Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long‐standing challenge. Prior work has shown that complex lighting can be accurately approximated by a large collection of point lights. In this formulation, rendering of animation sequences becomes the problem of efficiently shading many surface samples from many lights across several frames. This paper presents a tensor formulation of the animated many‐light problem, where each element of the tensor expresses the contribution of one light to one pixel in one frame. We sparsely sample rows and columns of the tensor, and introduce a clustering algorithm to select a small number of representative lights to efficiently approximate the animation. Our algorithm achieves efficiency by reusing representatives across frames, while minimizing temporal flicker. We demonstrate our algorithm in a variety of scenes that include deformable objects, complex illumination and arbitrary shading and show that a surprisingly small number of representative lights is sufficient for high quality rendering. We believe out algorithm will find practical use in applications that require fast previews of complex animation. 相似文献
29.
Service Overlay Networks (SONs) create a virtual topology on top of the Internet and provide end-to-end quality of service guarantees without requiring support by the underlying network.The optimization of the resources utilized by an SON is a fundamental issue for an overlay operator owing to the costs involved and the need to satisfy user requirements. Careful decisions are necessary to provide enough capacity to overlay links, to route traffic, to assign users to access nodes and to deploy overlay nodes.In this paper, we propose two mathematical programming models for the user assignment problem, the traffic routing optimization and the dimensioning of the capacity reserved on overlay links in SONs. The first model minimizes the SON installation cost while providing full access to all users. The second model maximizes the SON profit by selecting which users to serve, based on the expected gain, and taking into consideration budget constraints of the SON operator. Moreover, we extend these models to include the optimization of the number and position of overlay nodes.We provide the optimal solutions of the proposed SON design formulations on a set of realistic-size instances and discuss the effect of different parameters on the characteristics of the planned networks. Numerical results show that the proposed approach is able to solve the problem to the optimum even for large-scale networks. 相似文献
30.
Knowledge and Information Systems - Pattern mining is a fundamental data mining task with applications in several domains. In this work, we consider the scenario in which we have a sequence of... 相似文献