全文获取类型
收费全文 | 2758篇 |
免费 | 204篇 |
国内免费 | 27篇 |
专业分类
电工技术 | 51篇 |
综合类 | 12篇 |
化学工业 | 605篇 |
金属工艺 | 62篇 |
机械仪表 | 117篇 |
建筑科学 | 144篇 |
矿业工程 | 4篇 |
能源动力 | 182篇 |
轻工业 | 202篇 |
水利工程 | 44篇 |
石油天然气 | 27篇 |
无线电 | 253篇 |
一般工业技术 | 443篇 |
冶金工业 | 205篇 |
原子能技术 | 27篇 |
自动化技术 | 611篇 |
出版年
2024年 | 8篇 |
2023年 | 51篇 |
2022年 | 98篇 |
2021年 | 171篇 |
2020年 | 152篇 |
2019年 | 181篇 |
2018年 | 175篇 |
2017年 | 165篇 |
2016年 | 152篇 |
2015年 | 111篇 |
2014年 | 181篇 |
2013年 | 282篇 |
2012年 | 197篇 |
2011年 | 221篇 |
2010年 | 143篇 |
2009年 | 145篇 |
2008年 | 82篇 |
2007年 | 45篇 |
2006年 | 56篇 |
2005年 | 45篇 |
2004年 | 29篇 |
2003年 | 26篇 |
2002年 | 30篇 |
2001年 | 19篇 |
2000年 | 14篇 |
1999年 | 15篇 |
1998年 | 27篇 |
1997年 | 15篇 |
1996年 | 14篇 |
1995年 | 12篇 |
1994年 | 8篇 |
1993年 | 13篇 |
1991年 | 5篇 |
1990年 | 11篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 8篇 |
1986年 | 6篇 |
1985年 | 8篇 |
1984年 | 8篇 |
1983年 | 5篇 |
1982年 | 6篇 |
1981年 | 5篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 5篇 |
1975年 | 6篇 |
1969年 | 2篇 |
排序方式: 共有2989条查询结果,搜索用时 15 毫秒
91.
In this paper we investigate data structures obtained by a recursive partitioning of the multi- dimensional input domain
into regions of equal size. One of the best known examples of such a structure is the quadtree . It is used here as a basis for more complex data structures. We also provide multidimensional versions of the stratified tree by van Emde Boas [vEB]. We show that under the assumption that the input points have limited precision (i.e., are drawn
from the integer grid of size u ) these data structures yield efficient solutions to many important problems. In particular, they allow us to achieve O(log log u) time per operation for dynamic approximate nearest neighbor (under insertions and deletions) and exact on-line closest pair
(under insertions only) in any constant number of dimensions. They allow O(log log u) point location in a given planar shape or in its expansion (dilation by a ball of a given radius). Finally, we provide a
linear time (optimal) algorithm for computing the expansion of a shape represented by a region quadtree. This result shows
that the spatial order imposed by this regular data structure is sufficient to optimize the operation of dilation by a ball.
Received January 19, 1999; revised November 4, 1999. 相似文献
92.
Most known two-dimensional matching algorithms have a rectangular text (image) and rectangular pattern (template) as their input. These matching algorithms perform a row by row analysis followed by some column processing. These techniques are only efficient if all the rows are of equal length, hence the necessity for rectangular patterns.We present a novel method for analysing patterns with rows of different lengths. This enables finding all occurrences of a nonrectangular figure of heightm in ann×n text in time
. We make use of thesmaller matching problem.The smaller matching problem is that of finding all appearances of a numerical one dimensional pattern in a numerical one-dimensional text, where every element of the pattern is no greater than the corresponding text element.Partially supported by NSF grant CCR-88-03641 and a University of Maryland full year research award.Supported by a University of Maryland Graduate Fellowship, an ACM Samuel M. Alexander Fellowship and NSF grant CCR-88-03641. 相似文献
93.
Numerical Simulation of Submarine Groundwater Flow in the Coastal Aquifer at the Palmahim Area, the Mediterranean Coast of Israel 总被引:2,自引:1,他引:1
The lower sub-aquifers of the Mediterranean coastal aquifer of Israel, at the Palmahim area, are hypothesized to be laterally blocked to connection with the sea, and thus to seawater intrusion. This is mostly due to the detection of fresh water bodies at these sub-aquifers. This study examine this hypothesis by using two dimensional numerical model simulations of the groundwater flow system at this area, which conducted in order to reveal which hydrogeological setting enables the existence of these fresh water bodies in the lower sub-aquifers and to assess the on-land pumping rates that will prevent their salinization. The hydrogeological settings were examined by steady state simulations followed by simulations of the last 15,000 years sea level changes. These simulations imply that the presence of fresh water in the lower sub-aquifer, whether blocked or connected to the sea, requires offshore separation between the upper and lower sub-aquifers. On-land pumping simulations, with a well located inside the lower sub-aquifers at the shoreline, show a maximum pumping rate of 250 m3/m strip width/year, hereafter m2/year, to prevent the salinization of the lower sub-aquifers. The various pumping scenarios revealed differences in salinization trends between the scenarios with impermeable separating layers and those with semi permeable layers. Scenarios with extreme pumping rates emphasize these differences, and together with field test, can allow assessing the amount of separation between the sub-aquifers. 相似文献
94.
Evaluation of suspended load transport rate using transport formulas and artificial neural network models (Case study: Chelchay Catchment)* 总被引:2,自引:0,他引:2
HADDADCHI Arman MOVAHEDI Neshat VAHIDI Elham OMID Mohammad Hossein _ DEHGHANI Amir Ahmad 《水动力学研究与进展(B辑)》2013,25(3):459-470
Accurate estimation of sediment load or transport rate is very important to a wide range of water resources projects. This study was undertaken to determine the most appropriate model to predict suspended load in the Chelchay Watershed, northeast of Iran. In total, 59 data series were collected from four gravel bed-rivers and a sand bed river and two depth integrating suspended load samplers to evaluate nine suspended load formulas and feed forward backpropagation Artificial Neural Network (ANN) structures. Although the Chang formula with higher correlation coefficient (r = 0.69) and lower Root Mean Square Error (RMSE = 0.013) is the best suspended load predictor among the nine studied formulas, the ANN models significantly outperform traditional suspended load formulas and show their superior performance for all statistical parameters. Among different ANN structures two models including 4 inputs, 4 hidden and one output neurons, and 4 inputs, 4 and one hidden and one output neurons provide the best simulation with the RMSE values of 0.0009 and 0.001, respectively. 相似文献
95.
Farjadfard S Borghei SM Hassani AH Yakhchali B Ardjmand M Zeinali M 《Water science and technology》2012,66(3):594-602
A bacterial strain, FBHYA2, capable of degrading naphthalene, was isolated from the American Petroleum Institute (API) separator of the Tehran Oil Refinery Complex (TORC). Strain FBHYA2 was identified as Achromobacter sp. based on physiological and biochemical characteristics and also phylogenetic similarity of 16S rRNA gene sequence. The optimal growth conditions for strain FBHYA2 were pH 6.0, 30 °C and 1.0% NaCl. Strain FBHYA2 can utilize naphthalene as the sole source of carbon and energy and was able to degrade naphthalene aerobically very fast, 48 h for 96% removal at 500 mg/L concentration. The physiological response of Achromobacter sp., FBHYA2 to several hydrophobic chemicals (aliphatic and aromatic hydrocarbons) was also investigated. No biosurfactant was detected during bacterial growth on any aliphatic/aromatic hydrocarbons. The results of hydrophobicity measurements showed no significant difference between naphthalene- and LB-grown cells. The capability of the strain FBHYA2 to degrade naphthalene completely and rapidly without the need to secrete biosurfactant may make it an ideal candidate to remediate polycyclic aromatic hydrocarbon (PAH)-contaminated sites. 相似文献
96.
Machine loading problem in a flexible manufacturing system (FMS) encompasses various types of flexibility aspects pertaining to part selection and operation assignments. The evolution of flexible manufacturing systems offers great potential for increasing flexibility by ensuring both cost-effectiveness and customized manufacturing at the same time. This paper proposes a linear mathematical programming model with both continuous and zero-one variables for job selection and operation allocation problems in an FMS to maximize profitability and utilization of system. The proposed model assigns operations to different machines considering capacity of machines, batch-sizes, processing time of operations, machine costs, tool requirements, and capacity of tool magazine. A genetic algorithm (GA) is then proposed to solve the formulated problem. Performance of the proposed GA is evaluated based on some benchmark problems adopted from the literature. A statistical test is conducted which implies that the proposed algorithm is robust in finding near-optimal solutions. Comparison of the results with those published in the literature indicates supremacy of the solutions obtained by the proposed algorithm for attempted model. 相似文献
97.
Amir Talaei-Khoei Terje Solvoll Pradeep Ray Nandan Parameshwaran 《Journal of Computer and System Sciences》2012,78(1):370-391
The field of computer supported cooperative work aims at providing information technology models, methods, and tools that assist individuals to cooperate. The presented paper is based on three main observations from literature. First, one of the problems in utilizing information technology for cooperation is to identify the relevance of information, called awareness. Second, research in computer supported cooperative work proposes the use of agent technologies to aid individuals to maintain their awareness. Third, literature lacks the formalized methods on how software agents can identify awareness. This paper addresses the problem of awareness identification. The main contribution of this paper is to propose and evaluate a formalized structure, called Policy-based Awareness Management (PAM). PAM extends the logic of general awareness in order to identify relevance of information. PAM formalizes existing policies into Directory Enabled Networks-next generation structure and uses them as a source for awareness identification. The formalism is demonstrated by applying PAM to the space shuttle Columbia disaster occurred in 2003. The paper also argues that efficacy and cost-efficiency of the logic of general awareness will be increased by PAM. This is evaluated by simulation of hypothetical scenarios as well as a case study. 相似文献
98.
Data clustering is a common technique for data analysis, which is used in many fields, including machine learning, data mining, customer segmentation, trend analysis, pattern recognition and image analysis. Although many clustering algorithms have been proposed, most of them deal with clustering of one data type (numerical or nominal) or with mix data type (numerical and nominal) and only few of them provide a generic method that clusters all types of data. It is required for most real-world applications data to handle both feature types and their mix. In this paper, we propose an automated technique, called SpectralCAT, for unsupervised clustering of high-dimensional data that contains numerical or nominal or mix of attributes. We suggest to automatically transform the high-dimensional input data into categorical values. This is done by discovering the optimal transformation according to the Calinski–Harabasz index for each feature and attribute in the dataset. Then, a method for spectral clustering via dimensionality reduction of the transformed data is applied. This is achieved by automatic non-linear transformations, which identify geometric patterns in the data, and find the connections among them while projecting them onto low-dimensional spaces. We compare our method to several clustering algorithms using 16 public datasets from different domains and types. The experiments demonstrate that our method outperforms in most cases these algorithms. 相似文献
99.
Nazanin SaadatAuthor Vitae Amir Masoud Rahmani Author Vitae 《Future Generation Computer Systems》2012,28(4):666-681
In recent years, grid technology has had such a fast growth that it has been used in many scientific experiments and research centers. A large number of storage elements and computational resources are combined to generate a grid which gives us shared access to extra computing power. In particular, data grid deals with data intensive applications and provides intensive resources across widely distributed communities. Data replication is an efficient way for distributing replicas among the data grids, making it possible to access similar data in different locations of the data grid. Replication reduces data access time and improves the performance of the system. In this paper, we propose a new dynamic data replication algorithm named PDDRA that optimizes the traditional algorithms. Our proposed algorithm is based on an assumption: members in a VO (Virtual Organization) have similar interests in files. Based on this assumption and also file access history, PDDRA predicts future needs of grid sites and pre-fetches a sequence of files to the requester grid site, so the next time that this site needs a file, it will be locally available. This will considerably reduce access latency, response time and bandwidth consumption. PDDRA consists of three phases: storing file access patterns, requesting a file and performing replication and pre-fetching and replacement. The algorithm was tested using a grid simulator, OptorSim developed by European Data Grid projects. The simulation results show that our proposed algorithm has better performance in comparison with other algorithms in terms of job execution time, effective network usage, total number of replications, hit ratio and percentage of storage filled. 相似文献
100.