全文获取类型
收费全文 | 4993篇 |
免费 | 279篇 |
国内免费 | 8篇 |
专业分类
电工技术 | 77篇 |
综合类 | 5篇 |
化学工业 | 1180篇 |
金属工艺 | 115篇 |
机械仪表 | 108篇 |
建筑科学 | 116篇 |
矿业工程 | 38篇 |
能源动力 | 181篇 |
轻工业 | 567篇 |
水利工程 | 42篇 |
石油天然气 | 18篇 |
无线电 | 499篇 |
一般工业技术 | 750篇 |
冶金工业 | 773篇 |
原子能技术 | 56篇 |
自动化技术 | 755篇 |
出版年
2023年 | 55篇 |
2022年 | 123篇 |
2021年 | 180篇 |
2020年 | 131篇 |
2019年 | 120篇 |
2018年 | 154篇 |
2017年 | 146篇 |
2016年 | 161篇 |
2015年 | 128篇 |
2014年 | 228篇 |
2013年 | 310篇 |
2012年 | 285篇 |
2011年 | 314篇 |
2010年 | 226篇 |
2009年 | 205篇 |
2008年 | 224篇 |
2007年 | 224篇 |
2006年 | 154篇 |
2005年 | 136篇 |
2004年 | 110篇 |
2003年 | 77篇 |
2002年 | 86篇 |
2001年 | 77篇 |
2000年 | 68篇 |
1999年 | 77篇 |
1998年 | 199篇 |
1997年 | 137篇 |
1996年 | 104篇 |
1995年 | 84篇 |
1994年 | 65篇 |
1993年 | 77篇 |
1992年 | 45篇 |
1991年 | 44篇 |
1990年 | 26篇 |
1989年 | 28篇 |
1988年 | 33篇 |
1987年 | 37篇 |
1986年 | 23篇 |
1985年 | 26篇 |
1984年 | 25篇 |
1983年 | 24篇 |
1982年 | 29篇 |
1981年 | 25篇 |
1980年 | 22篇 |
1979年 | 16篇 |
1977年 | 22篇 |
1976年 | 21篇 |
1975年 | 11篇 |
1972年 | 15篇 |
1943年 | 21篇 |
排序方式: 共有5280条查询结果,搜索用时 15 毫秒
101.
Skeletons are powerful geometric abstractions that provide useful representations for a number of geometric operations. The straight skeleton has a lower combinatorial complexity compared with the medial axis. Moreover, while the medial axis of a polyhedron is composed of quadric surfaces the straight skeleton just consist of planar faces. Although there exist several methods to compute the straight skeleton of a polygon, the straight skeleton of polyhedra has been paid much less attention. We require to compute the skeleton of very large datasets storing orthogonal polyhedra. Furthermore, we need to treat geometric degeneracies that usually arise when dealing with orthogonal polyhedra. We present a new approach so as to robustly compute the straight skeleton of orthogonal polyhedra. We follow a geometric technique that works directly with the boundary of an orthogonal polyhedron. Our approach is output sensitive with respect to the number of vertices of the skeleton and solves geometric degeneracies. Unlike the existing straight skeleton algorithms that shrink the object boundary to obtain the skeleton, our algorithm relies on the plane sweep paradigm. The resulting skeleton is only composed of axis‐aligned and 45° rotated planar faces and edges. 相似文献
102.
Garzón-Alvarado DA Martinez AM Segrera DL 《Computer methods and programs in biomedicine》2011,104(3):489-497
The cerebral cortex is a gray lamina formed by bodies of neurons covering the cerebral hemispheres, varying in thickness from 1.25 mm in the occipital lobe to 4 mm in the anterior lobe. The brain's surface is about 30 times greater that of the skull because of its many folds; such folds form the gyri, sulci and fissures and mark out areas having specific functions, divided into five lobes. Convolution formation may vary between individuals and is an important feature of brain formation; such patterns can be mathematically represented as Turing patterns. This article describes how a phenomenological model was developed by describing the formation pattern for the gyri occurring in the cerebral cortex by reaction diffusion equations with Turing space parameters. Numerical examples for simplified geometries of a brain were solved to study pattern formation. The finite element method was used for the numerical solution, in conjunction with the Newton–Raphson method. The numerical examples showed that the model can represent cerebral cortex fold formation and reproduce pathologies related to gyri formation, such as polymicrogyria and lissencephaly. 相似文献
103.
Angel Rivas Casado Rafael Martinez‐Tomás Antonio Fernández‐Caballero 《Expert Systems》2011,28(5):488-501
This work presents a multi‐agent system for knowledge‐based high‐level event composition, which interprets activities, behaviour and situations semantically in a scenario with multi‐sensory monitoring. A perception agent (plurisensory agent and visual agent)‐based structure is presented. The agents process the sensor information and identify (agent decision system) significant changes in the monitored signals, which they send as simple events to the composition agent that searches for and identifies pre‐defined patterns as higher‐level semantic composed events. The structure has a methodology and a set of tools that facilitate its development and application to different fields without having to start from scratch. This creates an environment to develop knowledge‐based systems generally for event composition. The application task of our work is surveillance, and event composition/inference examples are shown which characterize an alarming situation in the scene and resolve identification and tracking problems of people in the scenario being monitored. 相似文献
104.
Bruno Salvy 《Theoretical computer science》2011,412(35):4469-4470
105.
Modeling and visualizing molecular surfaces is an important and challenging task in bioinformatics. Such surfaces play an essential role in better understanding the chemical and physical properties of molecules. However, constructing and displaying molecular surfaces requires complex algorithms. In this article we introduce MetaMol, a new program that generates high-quality images in interactive time. In contrast with existing software that discretizes the surface with triangles or grids, our program is based on a GPU accelerated ray-casting algorithm that directly uses the piecewise-defined algebraic equation of the molecular skin surface. As a result, both better performances and higher quality are obtained. 相似文献
106.
Operations on basic data structures such as queues, priority queues, stacks, and counters can dominate the execution time
of a parallel program due to both their frequency and their coordination and contention overheads. There are considerable
performance payoffs in developing highly optimized, asynchronous, distributed, cache-conscious, parallel implementations of
such data structures. Such implementations may employ a variety of tricks to reduce latencies and avoid serial bottlenecks,
as long as the semantics of the data structure are preserved. The complexity of the implementation and the difficulty in reasoning
about asynchronous systems increases concerns regarding possible bugs in the implementation.
In this paper we consider postmortem, black-box procedures for testing whether a parallel data structure behaved correctly. We present the first systematic study of algorithms
and hardness results for such testing procedures, focusing on queues, priority queues, stacks, and counters, under various
important scenarios. Our results demonstrate the importance of selecting test data such that distinct values are inserted
into the data structure (as appropriate). In such cases we present an O(n) time algorithm for testing linearizable queues, an O(n log n) time algorithm for testing linearizable priority queues, and an O( np
2
) time algorithm for testing sequentially consistent queues, where n is the number of data structure operations and p is the number of processors. In contrast, we show that testing such data structures for executions with arbitrary input
values is NP-complete. Our results also help clarify the thresholds between scenarios that admit polynomial time solutions
and those that are NP-complete. Our algorithms are the first nontrivial algorithms for these problems. 相似文献
107.
Multimodal support to group dynamics 总被引:1,自引:1,他引:0
Fabio Pianesi Massimo Zancanaro Elena Not Chiara Leonardi Vera Falcon Bruno Lepri 《Personal and Ubiquitous Computing》2008,12(3):181-195
The complexity of group dynamics occurring in small group interactions often hinders the performance of teams. The availability
of rich multimodal information about what is going on during the meeting makes it possible to explore the possibility of providing
support to dysfunctional teams from facilitation to training sessions addressing both the individuals and the group as a whole.
A necessary step in this direction is that of capturing and understanding group dynamics. In this paper, we discuss a particular
scenario, in which meeting participants receive multimedia feedback on their relational behaviour, as a first step towards
increasing self-awareness. We describe the background and the motivation for a coding scheme for annotating meeting recordings
partially inspired by the Bales’ Interaction Process Analysis. This coding scheme was aimed at identifying suitable observable
behavioural sequences. The study is complemented with an experimental investigation on the acceptability of such a service.
相似文献
Fabio Pianesi (Corresponding author)Email: |
Massimo ZancanaroEmail: |
Elena NotEmail: |
Chiara LeonardiEmail: |
Vera FalconEmail: |
Bruno LepriEmail: |
108.
Basic algorithms have been proposed in the field of low-power (Yao, F., et al. in Proceedings of lEEE annual foundations of
computer science, pp. 374–382, 1995) which compute the minimum energy-schedule for a set of non-recurrent tasks (or jobs) scheduled under EDF on a dynamically
variable voltage processor. In this study, we propose improvements upon existing algorithms with lower average and worst-case
complexities. They are based on a new EDF feasibility test that helps to identify the “critical intervals”. The complexity
of this feasibility test depends on structural characteristics of the set of jobs. More precisely, it depends on how tasks
are included one in the other. The first step of the algorithm is to construct the Hasse diagram of the set of tasks where
the partial order is defined by the inclusion relation on the tasks. Then, the algorithm constructs the shortest path in a
geometrical representation at each level of the Hasse diagram. The optimal processor speed is chosen according to the maximal
slope of each path.
相似文献
Nicolas NavetEmail: |
109.
Bruno Juliá-Díaz Joseph M. Burdis Frank Tabakin 《Computer Physics Communications》2006,174(11):914-934
This Mathematica 5.2 package1 is a simulation of a Quantum Computer. The program provides a modular, instructive approach for generating the basic elements that make up a quantum circuit. The main emphasis is on using the density matrix, although an approach using state vectors is also implemented in the package. The package commands are defined in Qdensity.m which contains the tools needed in quantum circuits, e.g., multiqubit kets, projectors, gates, etc. Selected examples of the basic commands are presented here and a tutorial notebook, Tutorial.nb is provided with the package (available on our website) that serves as a full guide to the package. Finally, application is made to a variety of relevant cases, including Teleportation, Quantum Fourier transform, Grover's search and Shor's algorithm, in separate notebooks: QFT.nb, Teleportation.nb, Grover.nb and Shor.nb where each algorithm is explained in detail. Finally, two examples of the construction and manipulation of cluster states, which are part of “one way computing” ideas, are included as an additional tool in the notebook Cluster.nb. A Mathematica palette containing most commands in QDENSITY is also included: QDENSpalette.nb.
Program summary
Title of program: QDENSITYCatalogue identifier: ADXH_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXH_v1_0Program available from: CPC Program Library, Queen's University of Belfast, N. IrelandOperating systems: Any which supports Mathematica; tested under Microsoft Windows XP, Macintosh OS X, and Linux FC4Programming language used: Mathematica 5.2No. of bytes in distributed program, including test data, etc.: 180 581No. of lines in distributed program, including test data, etc.: 19 382Distribution format: tar.gzMethod of solution: A Mathematica package is provided which contains commands to create and analyze quantum circuits. Several Mathematica notebooks containing relevant examples: Teleportation, Shor's Algorithm and Grover's search are explained in detail. A tutorial, Tutorial.nb is also enclosed. 相似文献110.
Jean Mayrand Jean-François Patenaude Ettore Merlo Michel Dagenais Bruno Laguë 《Annals of Software Engineering》2000,9(1-2):117-141
This paper presents an assessment method to evaluate the quality of object oriented software systems. The assessment method is based on source code abstraction, object–oriented metrics and graphical representation. The metrics used and the underlying model representing the software are presented. The assessment method experiment is part of an industrial research effort with the Bell Canada Quality Engineering and Research Group. It helps evaluators assess the quality and risks associated with software by identifying code fragments presenting unusual characteristics. The assessment method evaluates object–oriented software systems at three levels of granularity: system level, class level and method level. One large C++ and eight Java software systems, for a total of over one million lines of code, are presented as case studies. A critical analysis of the results is presented comparing the systems and the two languages. 相似文献