全文获取类型
收费全文 | 130篇 |
免费 | 0篇 |
专业分类
电工技术 | 2篇 |
化学工业 | 17篇 |
金属工艺 | 3篇 |
轻工业 | 5篇 |
石油天然气 | 6篇 |
无线电 | 23篇 |
一般工业技术 | 19篇 |
冶金工业 | 27篇 |
自动化技术 | 28篇 |
出版年
2022年 | 3篇 |
2021年 | 5篇 |
2020年 | 4篇 |
2019年 | 1篇 |
2018年 | 2篇 |
2016年 | 5篇 |
2015年 | 2篇 |
2014年 | 2篇 |
2013年 | 7篇 |
2012年 | 5篇 |
2011年 | 7篇 |
2010年 | 9篇 |
2009年 | 7篇 |
2008年 | 2篇 |
2007年 | 6篇 |
2006年 | 4篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1998年 | 8篇 |
1997年 | 7篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1993年 | 3篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 3篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1983年 | 1篇 |
1981年 | 3篇 |
1978年 | 4篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1973年 | 3篇 |
1972年 | 1篇 |
排序方式: 共有130条查询结果,搜索用时 562 毫秒
21.
We propose a novel framework for regularization of symmetric positive-definite (SPD) tensors (e.g., diffusion tensors). This framework is based on a local differential geometric approach. The manifold of symmetric positive-definite (SPD) matrices, P n , is parameterized via the Iwasawa coordinate system. In this framework distances on P n are measured in terms of a natural GL(n)-invariant metric. Via the mathematical concept of fiber bundles, we describe the tensor-valued image as a section where the metric over the section is induced by the metric over P n . Then, a functional over the sections accompanied by a suitable data fitting term is defined. The variation of this functional with respect to the Iwasawa coordinates leads to a set of frac12n(n+1)frac{1}{2}n(n+1) coupled equations of motion. By means of the gradient descent method, these equations of motion define a Beltrami flow over P n . It turns out that the local coordinate approach via the Iwasawa coordinate system results in very simple numerics that leads to fast convergence of the algorithm. Regularization results as well as results of fibers tractography for DTI are presented. 相似文献
22.
Online dynamic graph drawing 总被引:1,自引:0,他引:1
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, while allowing arbitrary modifications between consecutive layouts. The algorithm works online and uses various execution culling methods in order to reduce the layout time and handle large dynamic graphs. Techniques for representing graphs on the GPU allow a speedup by a factor of up to 17 compared to the CPU implementation. The scalability of the algorithm across GPU generations is demonstrated. Applications of the algorithm to the visualization of discussion threads in Internet sites and to the visualization of social networks are provided. 相似文献
23.
Yair Morad Yaniv Barkana Morris Hartstein Yosefa Bar-Dayan 《Accident; analysis and prevention》2009,41(4):856-860
Ocular parameters are influenced by sleep derivation and the use of chemical substances which are two major causes for traffic accidents. We assessed the use of these parameters as an objective screening tool for a driver's fitness for duty. Pupillary diameter, pupil reaction to light and saccadic velocity were measured in 29 army truck drivers every morning for two months and compared to baseline measurements taken while the subjects were alert. An index which expressed the difference between study and baseline measurements was calculated, and drivers with significant deviation from baseline were disqualified and interviewed. Non-disqualified drivers served as controls. Twenty-nine percent of disqualified drivers reported sleeping less than the minimum of 7 h required by army regulations compared with 8% of control drivers (p = 0.01). Disqualified drivers had worse sleep quality the night before the test (Groningen Sleep Quality Scale, p = 0.03) and incurred more accidents per driving day during their service (0.023 vs. 0.015 accidents/day, p = 0.03). Two disqualified drivers admitted to using alcohol or sleeping pills. Thus, these ocular parameters may serve as a screening tool for drivers that are at high risk for driving. Drivers who were disqualified even once, tend to be involved in more motor vehicle accidents than their peers. 相似文献
24.
Riskin M Ben-Amram Y Tel-Vered R Chegel V Almog J Willner I 《Analytical chemistry》2011,83(8):3082-3088
Molecularly imprinted Au nanoparticles (NPs) composites are generated on Au-coated glass surfaces. The imprinting process involves the electropolymerization of thioaniline-functionalized Au NPs (3.5 nm) on a thioaniline monolayer-modified Au surface in the presence of a carboxylic acid, acting as a template analogue for the respective explosive. The exclusion of the imprinting template from the Au NPs matrix yields the respective imprinted composites. The binding of the analyte explosives to the Au NPs matrixes is probed by surface plasmon resonance spectroscopy, SPR, where the electronic coupling between the localized plasmon of the Au NPs and the surface plasmon wave leads to the amplification of the SPR responses originating from the dielectric changes of the matrixes upon binding of the different explosive materials. The resulting imprinted matrixes reveal high affinities and selectivity toward the imprinted explosives. Using citric acid as an imprinting template, Au NPs matrixes for the specific analysis of pentaerythritol tetranitrate (PETN) or of nitroglycerin (NG) were prepared, leading to detection limits of 200 fM and 20 pM, respectively. Similarly, using maleic acid or fumaric acid as imprinting templates, high-affinity sensing composites for ethylene glycol dinitrate (EGDN) were synthesized, leading to a detection limit of 400 fM for both matrixes. 相似文献
25.
A sequence of three variables mini-max problems is introduced and implemented for numerically solving standard symmetric eigenvalue problems. The procedure is shown to possess considerable advantages over similar procedures introduced by the authors of this paper in the past. Finally, a general strategy for handling large scale symmetric eigenvalue problems is presented and implemented together with the new numerical solution procedure. 相似文献
26.
Scale-up rules and characteristic behavior were defined for coaxial impinging - stream reactors concerning the hydrodynamics, mean residence time and RTD of the particles and heat transfer in drying operations. 相似文献
27.
28.
29.
Simone L. Yaniv A. Sawla M. Peters 《Journal of research of the National Institute of Standards and Technology》1991,96(5):529-540
A comparison of force measurements performed at the National Institute of Standards and Technology, USA, and at the Physikalisch-Technische Bundesanstalt, Germany is reported. The focus of the study was the intercomparison of the forces realized by the two Institutes rather than the measurement process. The transfer standards used in the comparison consisted of force transducers and associated readout instrumentation. The results of the intercomparison reveal that over a range of 50 kN to 4.5 MN, the forces realized at NIST and at PTB compare favorably. For forces up to 900 kN the agreement is within ±40 ppm; above 900 kN the agreement is within ± 100 ppm. 相似文献
30.
Ariel Felner Yaron Shoshani Yaniv Altshuler Alfred M. Bruckstein 《Autonomous Agents and Multi-Agent Systems》2006,12(1):3-34
Physical A* (PHA*) and its multi-agent version MAPHA* are algorithms that find the shortest path between two points in an
unknown real physical environment with one or many mobile agents [A. Felner et al. Journal of Artificial Intelligence Research, 21:631–679, 2004; A. Felner et al. Proceedings of the First International Joint Conference on Autonomous Agents and Multi-Agent Systems, Bologna, Italy, 2002:240–247]. Previous work assumed a complete sharing of knowledge between agents. Here we apply this
algorithm to a more restricted model of communication which we call large pheromones, where agents communicate by writing and reading data at nodes of the graph that constitutes their environment. Previous
works on pheromones usually assumed that only a limited amount of data can be written at each node. The large pheromones model assumes no limitation on the size of the pheromones and thus each agent can write its entire knowledge at a node. We
show that with this model of communication the behavior of a multi-agent system is almost as good as with complete knowledge
sharing. Under this model we also introduce a new type of agent, a communication agent, that is responsible for spreading the knowledge among other agents by moving around the graph and copying pheromones. Experimental
results show that the contribution of communication agents is rather limited as data is already spread to other agents very
well with large pheromones 相似文献