全文获取类型
收费全文 | 9285篇 |
免费 | 318篇 |
国内免费 | 18篇 |
专业分类
电工技术 | 102篇 |
综合类 | 9篇 |
化学工业 | 2098篇 |
金属工艺 | 258篇 |
机械仪表 | 188篇 |
建筑科学 | 341篇 |
矿业工程 | 28篇 |
能源动力 | 212篇 |
轻工业 | 784篇 |
水利工程 | 112篇 |
石油天然气 | 38篇 |
武器工业 | 2篇 |
无线电 | 666篇 |
一般工业技术 | 1746篇 |
冶金工业 | 1932篇 |
原子能技术 | 62篇 |
自动化技术 | 1043篇 |
出版年
2023年 | 63篇 |
2022年 | 112篇 |
2021年 | 189篇 |
2020年 | 146篇 |
2019年 | 137篇 |
2018年 | 190篇 |
2017年 | 172篇 |
2016年 | 188篇 |
2015年 | 141篇 |
2014年 | 230篇 |
2013年 | 506篇 |
2012年 | 403篇 |
2011年 | 507篇 |
2010年 | 330篇 |
2009年 | 359篇 |
2008年 | 430篇 |
2007年 | 425篇 |
2006年 | 341篇 |
2005年 | 313篇 |
2004年 | 283篇 |
2003年 | 246篇 |
2002年 | 263篇 |
2001年 | 118篇 |
2000年 | 128篇 |
1999年 | 131篇 |
1998年 | 161篇 |
1997年 | 146篇 |
1996年 | 156篇 |
1995年 | 140篇 |
1994年 | 140篇 |
1993年 | 157篇 |
1992年 | 118篇 |
1991年 | 107篇 |
1990年 | 131篇 |
1989年 | 106篇 |
1988年 | 82篇 |
1987年 | 129篇 |
1986年 | 97篇 |
1985年 | 127篇 |
1984年 | 124篇 |
1983年 | 131篇 |
1982年 | 104篇 |
1981年 | 93篇 |
1980年 | 77篇 |
1979年 | 74篇 |
1978年 | 92篇 |
1977年 | 71篇 |
1976年 | 74篇 |
1975年 | 79篇 |
1974年 | 82篇 |
排序方式: 共有9621条查询结果,搜索用时 0 毫秒
81.
We consider the problem of nonpreemptively scheduling a set of n jobs with equal processing times on m parallel machines so as to minimize the makespan. Each job has a prespecified set of machines on which it can be processed,
called its eligible set. We consider the most general case of machine eligibility constraints as well as special cases of nested and inclusive eligible
sets. Both online and offline models are considered. For offline problems we develop optimal algorithms that run in polynomial
time, while for online problems we focus on the development of optimal algorithms of a new and more elaborate structure as
well as approximation algorithms with good competitive ratios. 相似文献
82.
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function
f whose value depends on the whole network, the goal is for every agent to eventually compute the value f (N). We call this problem global function computation. Various solutions for instances of this problem, such as Boolean function computation, leader election, (minimum) spanning
tree construction, and network determination, have been proposed, each under particular assumptions about what processors
know about the system and how this knowledge can be acquired. We give a necessary and sufficient condition for the problem
to be solvable that generalizes a number of well-known results (Attyia et al. in J ACM 35(4):845–875, 1988; Yamashita and
Kameda in IEEE Trans Parallel Distrib Syst 7(1):69–89, 1996; Yamashita and Kameda in IEEE Trans Parallel Distrib Syst 10(9):878–887,
1999). We then provide a knowledge-based (kb) program (like those of Fagin et al. (Reasoning about knowledge, MIT Press, Cambridge, 1995, Distrib Comput 10(4):199–225, 1997))
that solves global function computation whenever possible. Finally, we improve the message overhead inherent in our initial
kb program by giving a counterfactual belief-based program (Halpern and Moses in Distrib Comput 17(2):91–106, 2004) that also solves the global function computation whenever possible,
but where agents send messages only when they believe it is necessary to do so. The latter program is shown to be implemented
by a number of well-known algorithms for solving leader election. 相似文献
83.
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free XML storage structures with as few scheme trees as possible. Redundancy-free XML structures guarantee both economy in storage space and the absence of update anomalies, and having the least number of scheme trees requires the fewest number of joins to navigate among the data elements. We know that the general problem is intractable. The problem may still be intractable even when the hypergraph is acyclic and each hyperedge is in Boyce–Codd normal form (BCNF). As we show here, however, given an acyclic hypergraph with each hyperedge in BCNF, a polynomial-time algorithm exists that generates a largest possible redundancy-free XML storage structure. Successively generating largest possible scheme trees from among hyperedges not already included in generated scheme trees constitutes a reasonable heuristic for finding the fewest possible scheme trees. For many practical cases, this heuristic finds the set of redundancy-free XML storage structures with the fewest number of scheme trees. In addition to a correctness proof and a complexity analysis showing that the algorithm is polynomial, we also give experimental results over randomly generated but appropriately constrained hypergraphs showing empirically that the algorithm is indeed polynomial. 相似文献
84.
Guangming Yao Joseph Kolibal C.S. Chen 《Computers & Mathematics with Applications》2011,61(9):2376-2387
The method of approximate particular solutions (MAPS) has been recently developed to solve various types of partial differential equations. In the MAPS, radial basis functions play an important role in approximating the forcing term. Coupled with the concept of particular solutions and radial basis functions, a simple and effective numerical method for solving a large class of partial differential equations can be achieved. One of the difficulties of globally applying MAPS is that this method results in a large dense matrix which in turn severely restricts the number of interpolation points, thereby affecting our ability to solve large-scale science and engineering problems.In this paper we develop a localized scheme for the method of approximate particular solutions (LMAPS). The new localized approach allows the use of a small neighborhood of points to find the approximate solution of the given partial differential equation. In this paper, this local numerical scheme is used for solving large-scale problems, up to one million interpolation points. Three numerical examples in two-dimensions are used to validate the proposed numerical scheme. 相似文献
85.
Brain-machine interfaces (BMIs) transform the activity of neurons recorded in motor areas of the brain into movements of external actuators. Representation of movements by neuronal populations varies over time, during both voluntary limb movements and movements controlled through BMIs, due to motor learning, neuronal plasticity, and instability in recordings. To ensure accurate BMI performance over long time spans, BMI decoders must adapt to these changes. We propose the Bayesian regression self-training method for updating the parameters of an unscented Kalman filter decoder. This novel paradigm uses the decoder's output to periodically update its neuronal tuning model in a Bayesian linear regression. We use two previously known statistical formulations of Bayesian linear regression: a joint formulation, which allows fast and exact inference, and a factorized formulation, which allows the addition and temporary omission of neurons from updates but requires approximate variational inference. To evaluate these methods, we performed offline reconstructions and closed-loop experiments with rhesus monkeys implanted cortically with microwire electrodes. Offline reconstructions used data recorded in areas M1, S1, PMd, SMA, and PP of three monkeys while they controlled a cursor using a handheld joystick. The Bayesian regression self-training updates significantly improved the accuracy of offline reconstructions compared to the same decoder without updates. We performed 11 sessions of real-time, closed-loop experiments with a monkey implanted in areas M1 and S1. These sessions spanned 29 days. The monkey controlled the cursor using the decoder with and without updates. The updates maintained control accuracy and did not require information about monkey hand movements, assumptions about desired movements, or knowledge of the intended movement goals as training signals. These results indicate that Bayesian regression self-training can maintain BMI control accuracy over long periods, making clinical neuroprosthetics more viable. 相似文献
86.
We have investigated real-time, label-free, in-situ detection of human epidermal growth factor receptor 2 (Her2) in diluted serum using the first longitudinal extension mode of a lead zirconate-lead titanate (PZT)/glass piezoelectric microcantilever sensor (PEMS) with H3 single-chain variable fragment (scFv) immobilized on the 3-mercaptopropyltrimethoxysilane (MPS) insulation layer of the PEMS surface. We showed that with the longitudinal extension mode, the PZT/glass PEMS consisting of a 1 mm long and 127 μm thick PZT layer bonded with a 75 μm thick glass layer with a 1.8 mm long glass tip could detect Her2 at a concentration of 6-60 ng/ml (or 0.06-0.6 nM) in diluted human serum, about 100 times lower than the concentration limit obtained using the lower-frequency flexural mode of a similar PZT/glass PEMS. We further showed that with the longitudinal mode, the PZT/glass PEMS determined the equilibrium H3-Her2 dissociation constant K(d) to be 3.3±0.3 × 10(-8) M consistent with the value, 3.2±0.28 ×10(-8) M deduced by the surface plasmon resonance method (BIAcore). 相似文献
87.
Byung-Ho Jeon Marco Ajovalasit Joseph Giacomin 《International Journal of Industrial Ergonomics》2009,39(5):736-743
The aims of this study were to determine equal sensation curves for hand–arm steering wheel rotational vibration and to investigate the effect of gender on the subjective perceived intensity of steering wheel hand–arm vibration. Psychophysical response tests of 40 participants (20 males and 20 females) were performed using a steering wheel rotational vibration simulator using the category-ratio Borg CR10 scale procedure for direct estimation of perceived intensity. The test stimuli were sinusoidal vibrations at 22 third octave band centre frequencies in the range from 3 to 400 Hz, with acceleration amplitudes in the range from 0.04 to 27 m/s2 r.m.s. Multivariate regression procedures were applied to the experimentally acquired data in order to establish a regression model expressing the Borg CR10 perceived intensity values as a function of the two independent parameters of the frequency and amplitude of vibration. The equal sensation curves suggested a non-linear dependency of the subjective perceived intensity on both frequency and amplitude. Females were found to provide higher Borg CR10 perceived intensity values than males (p < 0.05), particularly at the higher intensity levels above approximately 1.0 m/s2 r.m.s and at the higher frequencies above approximately 20 Hz.
Relevance to industry
For the manufacturers of steering systems and of other automobile components this study provides vibration perception curves and identifies the possible importance of gender towards the perception of vibration which arrives at the steering wheel. 相似文献88.
Jean-Paul Brichta Aden N. Seaman Joseph H. Sanderson 《Computer Physics Communications》2009,180(2):197-200
A simplex algorithm used to solve molecular structure from asymptotic momentum values is reported. The geometry of molecular ions in linear and bent configurations is reconstructed. A polyatomic molecular ion with trigonal planar symmetry is used to demonstrate the scalability of the algorithm. 相似文献
89.
Joseph Conroy Gregory Gremillion Badri Ranganathan J. Sean Humbert 《Autonomous Robots》2009,27(3):189-198
Insects are capable of robust visual navigation in complex environments using efficient information extraction and processing
approaches. This paper presents an implementation of insect inspired visual navigation that uses spatial decompositions of
the instantaneous optic flow to extract local proximity information. The approach is demonstrated in a corridor environment
on an autonomous quadrotor micro-air-vehicle (MAV) where all the sensing and processing, including altitude, attitude, and
outer loop control is performed on-board. The resulting methodology has the advantages of computation speed and simplicity,
hence are consistent with the stringent size, weight, and power requirements of MAVs. 相似文献
90.
Joseph Lee 《AI & Society》2016,31(1):29-40
The brain–computer interface (BCI) has made remarkable progress in the bridging the divide between the brain and the external environment to assist persons with severe disabilities caused by brain impairments. There is also continuing philosophical interest in BCIs which emerges from thoughtful reflection on computers, machines, and artificial intelligence. This article seeks to apply BCI perspectives to examine, challenge, and work towards a possible resolution to a persistent problem in the mind–body relationship, namely dualism. The original humanitarian goals of BCIs and the technological inventiveness result in BCIs being surprisingly useful. We begin from the neurologically impaired person, the problems encountered, and some pioneering responses from computers and machines. Secondly, the interface of mind and brain is explored via two points of clarification: direct and indirect BCIs, and the nature of thoughts. Thirdly, dualism is beset by mind–body interaction difficulties and is further questioned by the phenomena of intentions, interactions, and technology. Fourthly, animal minds and robots are explored in BCI settings again with relevance for dualism. After a brief look at other BCIs, we conclude by outlining a future BCI philosophy of brain and mind, which might appear ominous and could be possible. 相似文献