全文获取类型
收费全文 | 1817篇 |
免费 | 124篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 19篇 |
综合类 | 2篇 |
化学工业 | 515篇 |
金属工艺 | 21篇 |
机械仪表 | 35篇 |
建筑科学 | 68篇 |
矿业工程 | 1篇 |
能源动力 | 79篇 |
轻工业 | 180篇 |
水利工程 | 6篇 |
石油天然气 | 5篇 |
无线电 | 144篇 |
一般工业技术 | 301篇 |
冶金工业 | 55篇 |
原子能技术 | 21篇 |
自动化技术 | 490篇 |
出版年
2024年 | 5篇 |
2023年 | 19篇 |
2022年 | 79篇 |
2021年 | 103篇 |
2020年 | 51篇 |
2019年 | 89篇 |
2018年 | 71篇 |
2017年 | 69篇 |
2016年 | 85篇 |
2015年 | 70篇 |
2014年 | 88篇 |
2013年 | 134篇 |
2012年 | 131篇 |
2011年 | 150篇 |
2010年 | 119篇 |
2009年 | 110篇 |
2008年 | 93篇 |
2007年 | 73篇 |
2006年 | 72篇 |
2005年 | 50篇 |
2004年 | 53篇 |
2003年 | 28篇 |
2002年 | 17篇 |
2001年 | 18篇 |
2000年 | 19篇 |
1999年 | 12篇 |
1998年 | 15篇 |
1997年 | 20篇 |
1996年 | 12篇 |
1995年 | 8篇 |
1994年 | 5篇 |
1993年 | 8篇 |
1992年 | 4篇 |
1991年 | 7篇 |
1990年 | 6篇 |
1988年 | 4篇 |
1986年 | 1篇 |
1985年 | 7篇 |
1984年 | 3篇 |
1983年 | 6篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 4篇 |
1977年 | 3篇 |
1976年 | 6篇 |
1975年 | 1篇 |
1974年 | 3篇 |
1973年 | 1篇 |
排序方式: 共有1942条查询结果,搜索用时 0 毫秒
21.
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. 相似文献
22.
23.
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. 相似文献
24.
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. 相似文献
25.
26.
The paper presents the detailed design and some preliminary results obtained from a study regarding a wastewater treatment pilot plant (WWTPP), serving as a multistage constructed wetland (CW) located at the rural settlement of 'Chorfech 24' (Tunisia). The WWTPP implemented at Chorfech 24 is mainly designed as a demonstration of sustainable water management solutions (low-cost wastewater treatment), in order to prove the efficiency of these solutions working under real Tunisian conditions and ultimately allow the further spreading of the demonstrated techniques. The pilot activity also aims to help gain experience with the implemented techniques and to improve them when necessary to be recommended for wide application in rural settlements in Tunisia and similar situations worldwide. The selected WWTPP at Chorfech 24 (rural settlement of 50 houses counting 350 inhabitants) consists of one Imhoff tank for pre-treatment, and three stages in series: as first stage a horizontal subsurface flow CW system, as second stage a subsurface vertical flow CW system, and a third horizontal flow CW. The sludge of the Imhoff tank is treated in a sludge composting bed. The performances of the different components as well as the whole treatment system were presented based on 3 months monitoring. The results shown in this paper are related to carbon, nitrogen and phosphorus removal as well as to reduction of micro-organisms. The mean overall removal rates of the Chorfech WWTPP during the monitored period have been, respectively, equal to 97% for total suspended solids and biochemical oxygen demand (BOD5), 95% for chemical oxygen demand, 71% for total nitrogen and 82% for P-PO4. The removal of E. coli by the whole system is 2.5 log units. 相似文献
27.
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. 相似文献
28.
Roberto Gorrieri Fabio Martinelli Marinella Petrocchi 《Journal of Automated Reasoning》2008,41(3-4):325-364
The spreading of multicast technology enables the development of group communication and so dealing with digital streams becomes more and more common over the Internet. Given the flourishing of security threats, the distribution of streamed data must be equipped with sufficient security guarantees. To this aim, some architectures have been proposed, to supply the distribution of the stream with guarantees of, e.g., authenticity, integrity, and confidentiality of the digital contents. This paper shows a formal capability of capturing some features of secure multicast protocols. In particular, both the modeling and the analysis of some case studies are shown, starting from basic schemes for signing digital streams, passing through protocols dealing with packet loss and time-synchronization requirements, concluding with a secure distribution of a secret key. A process-algebraic framework will be exploited, equipped with schemata for analysing security properties and compositional principles for evaluating if a property is satisfied over a system with more than two components. 相似文献
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... 相似文献