全文获取类型
收费全文 | 38篇 |
免费 | 0篇 |
专业分类
电工技术 | 1篇 |
机械仪表 | 1篇 |
建筑科学 | 1篇 |
水利工程 | 1篇 |
无线电 | 2篇 |
一般工业技术 | 3篇 |
冶金工业 | 10篇 |
原子能技术 | 1篇 |
自动化技术 | 18篇 |
出版年
2013年 | 1篇 |
2012年 | 1篇 |
2011年 | 1篇 |
2008年 | 1篇 |
2005年 | 1篇 |
2002年 | 1篇 |
1998年 | 3篇 |
1996年 | 4篇 |
1993年 | 3篇 |
1992年 | 3篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 2篇 |
1982年 | 1篇 |
1977年 | 2篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1965年 | 1篇 |
1963年 | 1篇 |
排序方式: 共有38条查询结果,搜索用时 31 毫秒
1.
This research produced evidence that an aspect of visual long-term memory—memory for lateral orientation of pictures—is constrained by a viewer-centered or egocentric reference frame. Subjects in Experiment 1 verbally encoded and then verbally recalled the locations of objects within scenic pictures. Recall of locations in terms of left-right directions (using a viewer-centered frame) exceeded recall of locations in terms of relative proximities to features of the room (using an environmental frame), even if the relative proximities had been verbalized at input. Subjects in Experiment 2 viewed half of a list of pictures directly and the remainder, reflected in a mirror. They then took a test in which they classified old pictures—all viewed directly— as "same-orientation" or "reversed." Performance was much better with a viewer-centered definition of same orientation (Does the picture appear the same way around?) than with an environmental definition (Is the picture the same way around on the screen?), even with forewarning of an environmental orientation test. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
2.
We introduce and solve a problem motivated by integrity verification in third-party data distribution: Given an undirected tree, find a minimum-cardinality set of simple paths that cover all the tree edges and, secondarily, have smallest total path lengths. We give a linear time algorithm for this problem. 相似文献
3.
Classes of network topologies are identified in which shortest-path information can be succinctly stored at the nodes, if they are assigned suitable names. The naming allows each edge at a node to be labeled with zero or more intervals of integers, representing all nodes reachable by a shortest path via that edge. Starting with the class of outerplanar networks, a natural hierarchy of networks is established, based on the number of intervals required. The outerplanar networks are shown to be precisely the networks requiring just one interval per edge. An optimal algorithm is given for determining the labels for edges in outerplanar networks.The research of this author was supported in part by the National Science Foundation under Grant DCR-8320124, and by the Office of Naval Research on contract N 00014-86-K-0689.The research of this author was supported in part by the National Science Foundation under Grant DCR-8320124. 相似文献
4.
The detection task employed a 9?-in. plan position indicator (PPI) and simulated targets. 30 Army trainees served as Ss. Each S performed the 9 combinations of viewing distance, (a) 6 ins., (b) 12 ins., (c) 18 ins., and, search area, (a) whole scope, (b) ? scope, and (c) –1–1??-diameter circle within the whole scope. A Treatments X Treatments X Subjects analysis of variance indicated significant main and interaction effects: as viewing distance increases, detection performance is degraded; as search area increases, detection performance is degraded; optimum viewing distance when searching the whole scope is approximately 12 ins., while optimum viewing distance for a small area (–1–1??-in. diameter) within a larger area is 6 ins. or less. (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
5.
Healthy volunteers supplemented their usual Western diets with Promega fish oil supplement (eicosapentaenoic acid [EPA], 0.28 g; docosahexaenoic acid [DCHA], 0.12 g; other n-3 fatty acids 0.10 g per capsule) using three protocols. Initial experiments (protocol 1 and 2) investigated the kinetics of incorporation of n-3 fatty acids into serum and neutrophil lipids after 10 capsules/d of Promega. EPA was rapidly detected in both serum and neutrophil lipids; the arachidonic acid (AA) to EPA ratio in neutrophil phospholipids showed a maximal reduction of 49:1 to 8:1 within 1 wk of beginning supplementation. EPA was preferentially incorporated into phosphatidyl-ethanolamine and phosphatidylcholine but not phosphatidylinositol. Long-term supplementation for up to 7 wk did not influence the AA/EPA ratio or the distribution of EPA among neutrophil phospholipids in a manner that was not observed after the first week. Neutrophils produced similar quantities of platelet-activating factor and slightly lower quantities of leukotriene B4 during long-term supplementation when compared with presupplementation values. Experiments examining the influence of Promega dosage indicated that the AA/EPA ratio in neutrophil lipids decreased in a dose-dependent manner. Only when the dose was increased to 15 capsules/d was there a reduction in the AA/DCHA ratio in neutrophil lipids. The quantity of AA in neutrophil lipids remained relatively constant at all supplement doses. Taken together, the current study demonstrates the capacity of n-3 fatty acids provided with a Western diet to be rapidly incorporated into neutrophil lipids. However, dietary n-3 fatty acids appear not to significantly reduce arachidonate content within neutrophil phospholipids. Constant arachidonate levels may account for the lack of large reductions in the biosynthesis of lipid mediators by neutrophils after fish-oil supplementation. 相似文献
6.
Greg N. Frederickson 《Information Processing Letters》1984,19(5):219-224
Certain properties of planar graphs are established in a particularly straightforward fashion. These properties assure good performance in two linear-time algorithms for five-coloring planar graphs. A new linear-time algorithm, based on a third property, is also presented. 相似文献
7.
8.
Doss-Hammel SM Zeisse CR Barrios AE de Leeuw G Moerman M de Jong AN Frederickson PA Davidson KL 《Applied optics》2002,41(18):3706-3724
Midwave and long-wave infrared propagation were measured in the marine atmosphere close to the surface of the ocean. Data were collected near San Diego Bay for two weeks in November 1996 over a 15-km horizontal path. The data are interpreted in terms of effects expected from molecules, aerosol particles, and refraction. Aerosol particles are a dominant influence in this coastal zone. They induce a diurnal variation in transmission as their character changes with regular changes in wind direction. A refractive propagation factor calculation is introduced, and it is systematically applied to the model and to the data analysis. It is shown that this refractive propagation factor is a necessary component of a complete near-sea-surface infrared transmission model. 相似文献
9.
Constant-factor, polynomial-time approximation algorithms are presented for two variations of the traveling salesman problem with time windows. In the first variation, the traveling repairman problem, the goal is to find a path that visits the maximum possible number of locations during their time windows. In the second variation, the speeding deliveryman problem, the goal is to find a path that uses the minimum possible speedup to visit all locations during their time windows. For both variations, the time windows are of unit length, and the distance metric is based on a weighted, undirected graph. Algorithms with improved approximation ratios are given for the case when the input is defined on a tree rather than a general graph. The algorithms are also extended to handle time windows whose lengths fall in any bounded range. 相似文献
10.
Classes of network topologies are identified in which shortest-path information can be succinctly stored at the nodes, if they are assigned suitable names. The naming allows each edge at a node to be labeled with zero or more intervals of integers, representing all nodes reachable by a shortest path via that edge. Starting with the class of outerplanar networks, a natural hierarchy of networks is established, based on the number of intervals required. The outerplanar networks are shown to be precisely the networks requiring just one interval per edge. An optimal algorithm is given for determining the labels for edges in outerplanar networks. 相似文献