首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   3402篇
  免费   216篇
  国内免费   4篇
电工技术   48篇
综合类   28篇
化学工业   943篇
金属工艺   90篇
机械仪表   74篇
建筑科学   234篇
矿业工程   8篇
能源动力   79篇
轻工业   208篇
水利工程   16篇
石油天然气   1篇
无线电   257篇
一般工业技术   719篇
冶金工业   153篇
原子能技术   32篇
自动化技术   732篇
  2024年   4篇
  2023年   54篇
  2022年   37篇
  2021年   138篇
  2020年   110篇
  2019年   118篇
  2018年   115篇
  2017年   119篇
  2016年   151篇
  2015年   119篇
  2014年   191篇
  2013年   227篇
  2012年   225篇
  2011年   297篇
  2010年   208篇
  2009年   183篇
  2008年   204篇
  2007年   180篇
  2006年   140篇
  2005年   120篇
  2004年   74篇
  2003年   66篇
  2002年   63篇
  2001年   32篇
  2000年   51篇
  1999年   45篇
  1998年   54篇
  1997年   29篇
  1996年   25篇
  1995年   28篇
  1994年   18篇
  1993年   24篇
  1992年   20篇
  1991年   16篇
  1990年   14篇
  1989年   15篇
  1988年   15篇
  1987年   9篇
  1986年   7篇
  1985年   12篇
  1984年   5篇
  1983年   4篇
  1982年   5篇
  1981年   6篇
  1980年   4篇
  1979年   7篇
  1976年   9篇
  1975年   5篇
  1973年   5篇
  1966年   3篇
排序方式: 共有3622条查询结果,搜索用时 196 毫秒
101.
Continuous-time quantum Monte Carlo impurity solvers are algorithms that sample the partition function of an impurity model using diagrammatic Monte Carlo techniques. The present paper describes codes that implement the interaction expansion algorithm originally developed by Rubtsov, Savkin, and Lichtenstein, as well as the hybridization expansion method developed by Werner, Millis, Troyer, et al. These impurity solvers are part of the ALPS-DMFT application package and are accompanied by an implementation of dynamical mean-field self-consistency equations for (single orbital single site) dynamical mean-field problems with arbitrary densities of states.

Program summary

Program title: dmftCatalogue identifier: AEIL_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEIL_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: ALPS LIBRARY LICENSE version 1.1No. of lines in distributed program, including test data, etc.: 899 806No. of bytes in distributed program, including test data, etc.: 32 153 916Distribution format: tar.gzProgramming language: C++Operating system: The ALPS libraries have been tested on the following platforms and compilers:
  • • 
    Linux with GNU Compiler Collection (g++ version 3.1 and higher), and Intel C++ Compiler (icc version 7.0 and higher)
  • • 
    MacOS X with GNU Compiler (g++ Apple-version 3.1, 3.3 and 4.0)
  • • 
    IBM AIX with Visual Age C++ (xlC version 6.0) and GNU (g++ version 3.1 and higher) compilers
  • • 
    Compaq Tru64 UNIX with Compq C++ Compiler (cxx)
  • • 
    SGI IRIX with MIPSpro C++ Compiler (CC)
  • • 
    HP-UX with HP C++ Compiler (aCC)
  • • 
    Windows with Cygwin or coLinux platforms and GNU Compiler Collection (g++ version 3.1 and higher)
RAM: 10 MB–1 GBClassification: 7.3External routines: ALPS [1], BLAS/LAPACK, HDF5Nature of problem: (See [2].) Quantum impurity models describe an atom or molecule embedded in a host material with which it can exchange electrons. They are basic to nanoscience as representations of quantum dots and molecular conductors and play an increasingly important role in the theory of “correlated electron” materials as auxiliary problems whose solution gives the “dynamical mean field” approximation to the self-energy and local correlation functions.Solution method: Quantum impurity models require a method of solution which provides access to both high and low energy scales and is effective for wide classes of physically realistic models. The continuous-time quantum Monte Carlo algorithms for which we present implementations here meet this challenge. Continuous-time quantum impurity methods are based on partition function expansions of quantum impurity models that are stochastically sampled to all orders using diagrammatic quantum Monte Carlo techniques. For a review of quantum impurity models and their applications and of continuous-time quantum Monte Carlo methods for impurity models we refer the reader to [2].Additional comments: Use of dmft requires citation of this paper. Use of any ALPS program requires citation of the ALPS [1] paper.Running time: 60 s–8 h per iteration.References:
  • [1] 
    A. Albuquerque, F. Alet, P. Corboz, et al., J. Magn. Magn. Mater. 310 (2007) 1187.
  • [2] 
    http://arxiv.org/abs/1012.4474, Rev. Mod. Phys., in press.
  相似文献   
102.
Electrical borehole wall images represent micro-resistivity measurements at the borehole wall. The lithology reconstruction is often based on visual interpretation done by geologists. This analysis is very time-consuming and subjective. Different geologists may interpret the data differently. In this work, linear discriminant analysis (LDA) in combination with texture features is used for an automated lithology reconstruction of ODP (Ocean Drilling Program) borehole 1203A drilled during Leg 197. Six rock groups are identified by their textural properties in resistivity data obtained by a Formation MircoScanner (FMS). Although discriminant analysis can be used for multi-class classification, non-optimal decision criteria for certain groups could emerge. For this reason, we use a combination of 2-class (binary) classifiers to increase the overall classification accuracy. The generalization ability of the combined classifiers is evaluated and optimized on a testing dataset where a classification rate of more than 80% for each of the six rock groups is achieved. The combined, trained classifiers are then applied on the whole dataset obtaining a statistical reconstruction of the logged formation. Compared to a single multi-class classifier the combined binary classifiers show better classification results for certain rock groups and more stable results in larger intervals of equal rock type.  相似文献   
103.
This paper presents an analytical method to derive the worst-case traffic pattern caused by a task graph mapped to a cache-coherent shared-memory system. Our analysis allows designers to rapidly evaluate the impact of different mappings of tasks to IP cores on the traffic pattern. The accuracy varies with the application’s data sharing pattern, and is around 65% in the average case and 1% in the best case when considering the traffic pattern as a whole. For individual connections, our method produces tight worst-case bandwidths.  相似文献   
104.
We present an adaptive octree based approach for interactive cutting of deformable objects. Our technique relies on efficient refine- and node split-operations. These are sufficient to robustly represent cuts in the mechanical simulation mesh. A high-resolution surface embedded into the octree is employed to represent a cut visually. Model modification is performed in the rest state of the object, which is accomplished by back-transformation of the blade geometry. This results in an improved robustness of our approach. Further, an efficient update of the correspondences between simulation elements and surface vertices is proposed. The robustness and efficiency of our approach is underlined in test examples as well as by integrating it into a prototype surgical simulator.  相似文献   
105.
We present a new foreign-function interface for SML/NJ. It is based on the idea of data-level interoperability—the ability of ML programs to inspect as well as manipulate C data structures directly.The core component of this work is an encoding of the almost2 complete C type system in ML types. The encoding makes extensive use of a “folklore” typing trick, taking advantage of ML's polymorphism, its type constructors, its abstraction mechanisms, and even functors. A small low-level component which deals with C struct and union declarations as well as program linkage is hidden from the programmer's eye by a simple program-generator tool that translates C declarations to corresponding ML glue code.  相似文献   
106.
107.
Visual cryptography and (k,n)-visual secret sharing schemes were introduced by Naor and Shamir (Advances in Cryptology — Eurocrypt 94, Springer, Berlin, 1995, pp. 1–12). A sender wishing to transmit a secret message distributes n transparencies amongst n recipients, where the transparencies contain seemingly random pictures. A (k,n)-scheme achieves the following situation: If any k recipients stack their transparencies together, then a secret message is revealed visually. On the other hand, if only k−1 recipients stack their transparencies, or analyze them by any other means, they are not able to obtain any information about the secret message. The important parameters of a scheme are its contrast, i.e., the clarity with which the message becomes visible, and the number of subpixels needed to encode one pixel of the original picture. Naor and Shamir constructed (k,k)-schemes with contrast 2−(k−1). By an intricate result from Linial (Combinatorica 10 (1990) 349–365), they were also able to prove the optimality of these schemes. They also proved that for all fixed kn, there are (k,n)-schemes with contrast . For k=2,3,4 the contrast is approximately and . In this paper, we show that by solving a simple linear program, one is able to compute exactly the best contrast achievable in any (k,n)-scheme. The solution of the linear program also provides a representation of a corresponding scheme. For small k as well as for k=n, we are able to analytically solve the linear program. For k=2,3,4, we obtain that the optimal contrast is at least and . For k=n, we obtain a very simple proof of the optimality of Naor's and Shamir's (k,k)-schemes. In the case k=2, we are able to use a different approach via coding theory which allows us to prove an optimal tradeoff between the contrast and the number of subpixels.  相似文献   
108.
The evolution and maintenance of large-scale software systems requires first an understanding of its architecture before delving into lower-level details. Tools facilitating the architecture comprehension tasks by visualization provide different sets of configurable, graphical elements to present information to their users. We conducted a controlled experiment that exemplifies the critical role of such graphical elements when aiming at understanding the architecture. In our setting, a different configuration of graphical elements had significant influence on program comprehension tasks. In particular, a 63% gain in effectiveness in architectural analysis tasks was achieved simply by changing the configuration of the graphical elements of the same tool. Based on the results, we claim that significant effort should be spent on the configuration of architecture visualization tools and that configurability should be a requirement for such tools.
Matthias Naab (Corresponding author)Email:

Jens Knodel   is a scientist at the Fraunhofer Institute for Experimental Software Engineering (IESE) in Kaiserslautern, Germany. As an applied researcher in the department “Product Line Architectures” he works in several industrial and research projects in the context of product line engineering and software architectures. His main research interests are architecture compliance checking, software evolution, and architecture reconstruction. Jens Knodel is the architect of the Fraunhofer SAVE tool (the acronym SAVE stands for Software Architecture Evaluation and Visualization). Dirk Muthig   heads the division “Software Development” at the Fraunhofer Institute for Experimental Software Engineering (IESE). He has been involved in the definition, development, and transfer of Fraunhofer PuLSE (Product Line Software Engineering) methodology since 1997. Further, he leads the research and technology transfer in the area of “Software and Systems Architecture”. He received a diploma in computer science, as well as a Ph.D., from the Technical University of Kaiserslautern. Matthias Naab   is an engineer at the Fraunhofer Institute for Experimental Software Engineering (IESE). He works in the areas of software- and system architectures and product lines. In several industry projects, he was involved in architecture evaluations of large-scale information systems from different industries and customers. To the Fraunhofer SAVE tool, he contributed the visualization component. Matthias Naab received a diploma in computer science from the Technical University of Kaiserslautern in 2005.   相似文献   
109.
Increasingly in the recent years, passengers’ services are extended into the ascent and descent flight phases on short distance flights. Trolleys containing the required meal and beverage items are used for these service operations and pushed or pulled along the aisles of the aircraft. Flight attendants reported about increased musculo-skeletal disorders and had been complaining about high physical workload from handling trolleys. In order to ensure acceptable load levels for pushing or pulling operations of trolleys, the physical capabilities of the collective “flight attendants” had been investigated by means of force measurements at maximum voluntary contraction (MVC) level and associated relevant anthropometrical and biometrical data. CEN and ISO standards as well as international and national German methods were used to derive recommended force limits for pushing/pulling operations with respect to the physical capabilities of the target group “flight attendants”. Comparing these recommended limits with the force requirements per shift under various conditions of trolley handlings (inclination of the floor, type and weight of trolley, mode of handling, frequency of operation) showed that especially for higher floor inclinations and trolley weights, flight attendants work (substantially) above recommended limits. It became also apparent that the handling of half-size trolleys is unexpectedly high demanding due to high vertical force components, caused by the unfavorable location of their center of gravity.

Relevance to industry

On short-distance flights, passengers’ services are performed by means of trolleys from the ascent to the descent flight phases. Flight attendants had been complaining about high physical workload. This study offers recommendations on maximum force limits for the handling of trolleys with respect to the muscular capacities and work situations of flight attendants on short-distance flights.  相似文献   
110.
The musculoskeletal loads from moving trolleys aboard aircraft were assessed by observation of trolley handling on planes and by physical workload analyses of pushing and pulling of trolleys in a laboratory set up. Trolley handling by a total of 15 female flight attendants was observed on 10 short- and medium-distance flights in different types of aircraft. About 25 selected flight attendants (22 females; 3 males) of five German airlines took part in the laboratory study, which comprised three-dimensional (3D) measurements of posture and hand forces during pushing and pulling of trolleys in a variety of configurations. From the on-flight observations performed, between 150 and 250 trolley movements can be projected for a work shift. The greatest physical workload is to be expected at the beginning of service: The trolleys are fully laden then, and the cabin floor can still be inclined up to 8°, as the aircraft is still climbing, particularly on short-distance flights. The laboratory investigation revealed that the musculoskeletal workload from pushing and pulling depends essentially on the trolley load and on the gradient of the cabin floor. In addition, the degree of stressing depends significantly on the trolley type, mode of handling and personal dexterity. The up/down force component perpendicular to the direction of motion often achieved considerable amplitudes-in some cases equal to or exceeding the force in the direction of movement. The posture analysis demonstrated that pulling forced the flight attendants to adopt ergonomically unfavourable postures such as pronounced flexion of the back, particularly among female subjects. The highest values for flexion of the back occurred while pulling the half-size trolley. The results demonstrate that female flight attendants are likely to overload themselves if they frequently have to move heavily laden trolleys unaided on an inclined cabin floor.

Relevance to industry

On short distance flights, flight attendants have been complaining increasingly of high physical workload from manoeuvring trolleys. On the basis of the presented data airline companies may improve the trolley handling skills of their flight attendances by practical trainings and may ergonomically optimize the general service procedures aboard aircrafts.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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