全文获取类型
收费全文 | 1886篇 |
免费 | 182篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 14篇 |
综合类 | 1篇 |
化学工业 | 391篇 |
金属工艺 | 21篇 |
机械仪表 | 32篇 |
建筑科学 | 69篇 |
矿业工程 | 2篇 |
能源动力 | 87篇 |
轻工业 | 345篇 |
水利工程 | 15篇 |
石油天然气 | 8篇 |
无线电 | 170篇 |
一般工业技术 | 367篇 |
冶金工业 | 61篇 |
原子能技术 | 10篇 |
自动化技术 | 476篇 |
出版年
2024年 | 6篇 |
2023年 | 24篇 |
2022年 | 43篇 |
2021年 | 99篇 |
2020年 | 56篇 |
2019年 | 92篇 |
2018年 | 111篇 |
2017年 | 85篇 |
2016年 | 94篇 |
2015年 | 72篇 |
2014年 | 116篇 |
2013年 | 159篇 |
2012年 | 149篇 |
2011年 | 184篇 |
2010年 | 116篇 |
2009年 | 98篇 |
2008年 | 97篇 |
2007年 | 83篇 |
2006年 | 79篇 |
2005年 | 55篇 |
2004年 | 54篇 |
2003年 | 39篇 |
2002年 | 32篇 |
2001年 | 13篇 |
2000年 | 13篇 |
1999年 | 16篇 |
1998年 | 19篇 |
1997年 | 16篇 |
1996年 | 4篇 |
1995年 | 10篇 |
1994年 | 9篇 |
1993年 | 4篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 1篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1975年 | 1篇 |
1974年 | 1篇 |
1971年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2069条查询结果,搜索用时 797 毫秒
61.
Pablo San Segundo 《Computers & Operations Research》2012,39(7):1724-1733
This paper describes a new exact algorithm PASS for the vertex coloring problem based on the well known DSATUR algorithm. At each step DSATUR maximizes saturation degree to select a new candidate vertex to color, breaking ties by maximum degree w.r.t. uncolored vertices. Later Sewell introduced a new tiebreaking strategy, which evaluated available colors for each vertex explicitly. PASS differs from Sewell in that it restricts its application to a particular set of vertices. Overall performance is improved when the new strategy is applied selectively instead of at every step. The paper also reports systematic experiments over 1500 random graphs and a subset of the DIMACS color benchmark. 相似文献
62.
The Flemish Ministry of Education promotes the integrated education of disabled children by providing educational opportunities in common schools. In the current system, disabled children receive ambulant help from a teaching assistant (TA) employed at an institute for extra-ordinary education. The compensation that the TAs receive for driving to visit the pupils is a major cost factor for the institute that provides the assistance. Therefore, the institute's management desires a schedule that minimizes the accumulated distance traveled by all TAs combined. We call this optimization problem the teaching assistants assignment-routing problem (TAARP). It involves three decisions that have to be taken simultaneously: (1) pupils have to be assigned to TAs; (2) pupils assigned to a given TA have to be spread over the TA's different working days; and (3) the order in which to visit the pupils on each day has to be determined. We propose a solution strategy based on an auction algorithm and a variable neighborhood search heuristic which has an excellent performance when applied to both simulated and real instances. The total distance traveled in the solution obtained for the institute's data set improves the current solution by about 22% which represents a saving of approximately 9% on the annual budget of the institute for integrated education. 相似文献
63.
Several non-axiomatic approaches have been taken to define Quantum Cellular Automata (QCA); Partitioned QCA (PQCA) are the most canonical. Here we show any QCA can be put into PQCA form. Our construction reconciles the non-axiomatic definitions of QCA, showing that they can all simulate one another, thus they are all equivalent to the axiomatic definition. A simple n-dimensional QCA capable of simulating all others to arbitrary precision is described, where the initial configuration and the evolution of any QCA can be encoded within the initial configuration of the intrinsically universal QCA. Several steps then correspond to one step of the simulated QCA, achieved via a non-trivial reduction of the problem to universality in quantum circuits. Results are formalised by defining generalised n-dimensional intrinsic simulation, preserving topology in that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. Implications are discussed. 相似文献
64.
A key process for post-secondary educational institutions is the definition of course timetables and classroom assignments. Manual scheduling methods require enormous amounts of time and resources to deliver results of questionable quality, and multiple course and classroom conflicts usually occur. This article presents a scheduling system implemented in a Web environment. This system generates optimal schedules via an integer-programming model. Among its functionalities, this system enables direct interaction with instructors in order to gather data on their time availability for teaching courses. The results demonstrate that significant improvements over the typical fully manual process were obtained. 相似文献
65.
This paper deals with the problem of supervised wrapper-based feature subset selection in datasets with a very large number of attributes. Recently the literature has contained numerous references to the use of hybrid selection algorithms: based on a filter ranking, they perform an incremental wrapper selection over that ranking. Though working fine, these methods still have their problems: (1) depending on the complexity of the wrapper search method, the number of wrapper evaluations can still be too large; and (2) they rely on a univariate ranking that does not take into account interaction between the variables already included in the selected subset and the remaining ones.Here we propose a new approach whose main goal is to drastically reduce the number of wrapper evaluations while maintaining good performance (e.g. accuracy and size of the obtained subset). To do this we propose an algorithm that iteratively alternates between filter ranking construction and wrapper feature subset selection (FSS). Thus, the FSS only uses the first block of ranked attributes and the ranking method uses the current selected subset in order to build a new ranking where this knowledge is considered. The algorithm terminates when no new attribute is selected in the last call to the FSS algorithm. The main advantage of this approach is that only a few blocks of variables are analyzed, and so the number of wrapper evaluations decreases drastically.The proposed method is tested over eleven high-dimensional datasets (2400-46,000 variables) using different classifiers. The results show an impressive reduction in the number of wrapper evaluations without degrading the quality of the obtained subset. 相似文献
66.
Prediction of parking space availability in real time 总被引:1,自引:0,他引:1
Intelligent parking reservation (IPR) systems allow customers to select a parking facility according to their preferences, rapidly park their vehicle without searching for a free stall, and pay their reservation in advance avoiding queues. Some IPR systems interact with in-vehicle navigation systems and provide users with information in real time such as capacity, parking fee, and current parking utilization. However, few of these systems provide information on the forecast utilization at specific hours - a process that requires the study of the competition between parking alternatives for the market share. This paper proposes a methodology for predicting real-time parking space availability in IPR architectures. This methodology consists of three subroutines to allocate simulated parking requests, estimate future departures, and forecast parking availability. Parking requests are allocated iteratively using an aggregated approach as a function of simulated drivers’ preferences, and parking availability. This approach is based on a calibrated discrete choice model for selecting parking alternatives. A numerical comparison between a one-by-one simulation-based forecast and the proposed aggregated approach indicates that no significant discrepancies exists, validating and suggesting the use of the less time consuming proposed aggregated methodology. Results obtained from contrasting predictions with real data yielded small average error availabilities. The forecast improves as the system registers arrivals and departures. Thus, the forecast is adequate for potential distribution in real-time using different media such as Internet, navigation systems, cell phones or GIS. 相似文献
67.
Oxidation state of titanium was determined in CaO‐SiO2‐TiOx slags in the composition range 25‐53 percent CaO, 27‐46 percent SiO2, 10‐55 percent TiOx at 1873K using gas equilibration method. In the experiments, slags with different titanium oxide contents were equilibrated with a known carbon monoxide and carbon dioxide ratio. The results were used to determine the Ti3+ and Ti4+ contents as well as the activity coefficient ratio of corresponding oxides in the slag. The dependence of the activity coefficient ratio as a function of oxygen partial pressure was determined. 相似文献
68.
We consider the problem of implementing a security protocol in such a manner that secrecy of sensitive data is not jeopardized. Implementation is assumed to take place in the context of an API that provides standard cryptography and communication services. Given a dependency specification, stating how API methods can produce and consume secret information, we propose an information flow property based on the idea of invariance under perturbation, relating observable changes in output to corresponding changes in input. Besides the information flow condition itself, the main contributions of the paper are results relating the admissibility property to a direct flow property in the special case of programs which branch on secrets only in cases permitted by the dependency rules. These results are used to derive an unwinding theorem, reducing a behavioural correctness check (strong bisimulation) to an invariant. 相似文献
69.
Ratcliff Roger; Thapar Anjali; Gomez Pablo; McKoon Gail 《Canadian Metallurgical Quarterly》2004,19(2):278
The effects of aging on response time (RT) are examined in 2 lexical-decision experiments with young and older subjects (age 60-75). The results show that the older subjects were slower than the young subjects, but more accurate. R. Ratcliff s (1978) diffusion model provided a good account of RTs, their distributions, and response accuracy. The fits show an 80-100-ms slowing of the nondecision components of RT for older subjects relative to young subjects and more conservative decision criterion settings for older subjects than for young subjects. The rates of accumulation of evidence were not significantly different for older compared with young subjects (less than 2% and 5% higher for older subjects relative to young subjects in the 2 experiments). (PsycINFO Database Record (c) 2010 APA, all rights reserved) 相似文献
70.
Pablo Andrés Arbeláez Laurent D. Cohen 《Journal of Mathematical Imaging and Vision》2004,20(1-2):43-57
We address the issue of low-level segmentation for real-valued images. The proposed approach relies on the formulation of the problem in terms of an energy partition of the image domain. In this framework, an energy is defined by measuring a pseudo-metric distance to a source point. Thus, the choice of an energy and a set of sources determines a tessellation of the domain. Each energy acts on the image at a different level of analysis; through the study of two types of energies, two stages of the segmentation process are addressed. The first energy considered, the path variation, belongs to the class of energies determined by minimal paths. Its application as a pre-segmentation method is proposed. In the second part, where the energy is induced by a ultrametric, the construction of hierarchical representations of the image is discussed. 相似文献