全文获取类型
收费全文 | 13403篇 |
免费 | 1465篇 |
国内免费 | 1125篇 |
学科分类
工业技术 | 15993篇 |
出版年
2024年 | 56篇 |
2023年 | 131篇 |
2022年 | 201篇 |
2021年 | 264篇 |
2020年 | 340篇 |
2019年 | 308篇 |
2018年 | 266篇 |
2017年 | 408篇 |
2016年 | 438篇 |
2015年 | 646篇 |
2014年 | 771篇 |
2013年 | 1020篇 |
2012年 | 977篇 |
2011年 | 1115篇 |
2010年 | 776篇 |
2009年 | 1019篇 |
2008年 | 1040篇 |
2007年 | 1048篇 |
2006年 | 870篇 |
2005年 | 691篇 |
2004年 | 583篇 |
2003年 | 508篇 |
2002年 | 410篇 |
2001年 | 325篇 |
2000年 | 277篇 |
1999年 | 208篇 |
1998年 | 205篇 |
1997年 | 193篇 |
1996年 | 128篇 |
1995年 | 100篇 |
1994年 | 95篇 |
1993年 | 71篇 |
1992年 | 73篇 |
1991年 | 44篇 |
1990年 | 38篇 |
1989年 | 40篇 |
1988年 | 45篇 |
1987年 | 26篇 |
1986年 | 23篇 |
1985年 | 33篇 |
1984年 | 48篇 |
1983年 | 28篇 |
1982年 | 21篇 |
1981年 | 20篇 |
1980年 | 19篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 11篇 |
1976年 | 9篇 |
1975年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs
In recent years growing interest in local distributed algorithms has widely been observed. This results from their high resistance to errors and damage, as well as from their good performance, which is independent of the size of the network. A local deterministic distributed algorithm finding an approximation of a Minimum Dominating Set in planar graphs has been presented by Lenzen et al., and they proved that the algorithm returns a 130-approximation of the Minimum Dominating Set. In this article we will show that the algorithm is two times more effective than was previously assumed, and we prove that the algorithm by Lenzen et al. outputs a 52-approximation to a Minimum Dominating Set. Therefore the gap between the lower bound and the approximation ratio of the best yet local deterministic distributed algorithm is reduced by half. 相似文献
62.
In order to reduce logistic costs, the scheduling of logistic tasks and resources for fourth party logistics (4PL) is studied. Current scheduling models only consider costs and finish times of each logistic resource or task. Not generally considered are the joint cost and time between two adjacent activities for a resource to process and two sequential activities of a task for two different resources to process are ignored. Therefore, a multi-objective scheduling model aiming at minimizing total operation costs, finishing time and tardiness of all logistic tasks in a 4PL is proposed. Not only are the joint cost and time of logistic activities between two adjacent activities and two sequential activities included but the constraints of resource time windows and due date of tasks are also considered. An improved nondominated sorting genetic algorithm (NSGA-II) is presented to solve the model. The validity of the proposed model and algorithm are verified by a corresponding case study. 相似文献
63.
In this paper, we develop a parallel algorithm for the solution of an integrated topology control and routing problem in Wireless Sensor Networks (WSNs). After presenting a mixed-integer linear optimization formulation for the problem, for its solution, we develop an effective parallel algorithm in a Master–Worker model that incorporates three parallelization strategies, namely low-level parallelism, domain decomposition, and multiple search (both cooperative and independent) in a single Master–Worker framework. 相似文献
64.
The paper presents a new approach for recommending suitable learning paths for different learners groups. Selection of the learning path is considered as recommendations to choosing and combining the sequences of learning objects (LOs) according to learners’ preferences. Learning path can be selected by applying artificial intelligence techniques, e.g. a swarm intelligence model. If we modify and/or change some LOs in the learning path, we should rearrange the alignment of new and old LOs and reallocate pheromones to achieve effective learning recommendations. To solve this problem, a new method based on the ant colony optimisation algorithm and adaptation of the solution to the changing optimum is proposed. A simulation process with a dynamic change of learning paths when new LOs are inserted was chosen to verify the method proposed. The paper contributes with the following new developments: (1) an approach of dynamic learning paths selection based on swarm intelligence, and (2) a modified ant colony optimisation algorithm for learning paths selection. The elaborated approach effectively assist learners by helping them to reach most suitable LOs according to their preferences, and tutors – by helping them to monitor, refine, and improve e-learning modules and courses according to the learners’ behaviour. 相似文献
65.
《Computer Speech and Language》2014,28(2):543-571
Speech output technology is finding widespread application, including in scenarios where intelligibility might be compromised – at least for some listeners – by adverse conditions. Unlike most current algorithms, talkers continually adapt their speech patterns as a response to the immediate context of spoken communication, where the type of interlocutor and the environment are the dominant situational factors influencing speech production. Observations of talker behaviour can motivate the design of more robust speech output algorithms. Starting with a listener-oriented categorisation of possible goals for speech modification, this review article summarises the extensive set of behavioural findings related to human speech modification, identifies which factors appear to be beneficial, and goes on to examine previous computational attempts to improve intelligibility in noise. The review concludes by tabulating 46 speech modifications, many of which have yet to be perceptually or algorithmically evaluated. Consequently, the review provides a roadmap for future work in improving the robustness of speech output. 相似文献
66.
Giuseppe Placidi Danilo Avola Marco Ferrari Daniela Iacoviello Andrea Petracca Valentina Quaresima Matteo Spezialetti 《Computer methods and programs in biomedicine》2014
Background and objective
The degeneration of the balance control system in the elderly and in many pathologies requires measuring the equilibrium conditions very often. In clinical practice, equilibrium control is commonly evaluated by using a force platform (stabilometric platform) in a clinical environment.In this paper, we demonstrate how a simple movement analysis system, based on a 3D video camera and a 3D real time model reconstruction of the human body, can be used to collect information usually recorded by a physical stabilometric platform.Methods
The algorithm used to reconstruct the human body model as a set of spheres is described and discussed. Moreover, experimental measurements and comparisons with data collected by a physical stabilometric platform are also reported. The measurements were collected on a set of 6 healthy subjects to whom a change in equilibrium condition was stimulated by performing an equilibrium task.Results
The experimental results showed that more than 95% of data collected by the proposed method were not significantly different from those collected by the classic platform, thus confirming the usefulness of the proposed system.Conclusions
The proposed virtual balance assessment system can be implemented at low cost (about 500$) and, for this reason, can be considered a home use medical device. On the contrary, astabilometric platform has a cost of about 10,000$ and requires periodical calibration. The proposed system does not require periodical calibration, as is necessary for stabilometric force platforms, and it is easy to use. In future, the proposed system with little integration can be used, besides being an emulator of a stabilometric platform, also to recognize and track, in real time, head, legs, arms and trunk, that is to collect information actually obtained by sophisticated optoelectronic systems. 相似文献67.
68.
《Expert systems with applications》2014,41(14):6274-6290
This paper revisits the classical Polynomial Mutation (PLM) operator and proposes a new probe guided version of the PLM operator designed to be used in conjunction with Multiobjective Evolutionary Algorithms (MOEAs). The proposed Probe Guided Mutation (PGM) operator is validated by using data sets from six different stock markets. The performance of the proposed PGM operator is assessed in comparison with the one of the classical PLM with the assistance of the Non-dominated Sorting Genetic Algorithm II (NSGAII) and the Strength Pareto Evolutionary Algorithm 2 (SPEA2). The evaluation of the performance is based on three performance metrics, namely Hypervolume, Spread and Epsilon indicator. The experimental results reveal that the proposed PGM operator outperforms with confidence the performance of the classical PLM operator for all performance metrics when applied to the solution of the cardinality constrained portfolio optimization problem (CCPOP). We also calculate the True Efficient Frontier (TEF) of the CCPOP by formulating the CCPOP as a Mixed Integer Quadratic Program (MIQP) and we compare the relevant results with the approximate efficient frontiers that are generated by the proposed PGM operator. The results confirm that the PGM operator generates near optimal solutions that lie very close or in certain cases overlap with the TEF. 相似文献
69.
《Expert systems with applications》2014,41(14):6459-6466
Metaheuristic optimization algorithms have become a popular choice for solving complex problems which are otherwise difficult to solve by traditional methods. However, these methods have the problem of the parameter adaptation and many researchers have proposed modifications using fuzzy logic to solve this problem and obtain better results than the original methods. In this study a comprehensive review is made of the optimization techniques in which fuzzy logic is used to dynamically adapt some important parameters in these methods. In this paper, the survey mainly covers the optimization methods of Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Ant Colony Optimization (ACO), which in the last years have been used with fuzzy logic to improve the performance of the optimization methods. 相似文献
70.
《Expert systems with applications》2014,41(15):6596-6610
The Bayesian learning provides a natural way to model the nonlinear structure as the artificial neural networks due to their capability to cope with the model complexity. In this paper, an evolutionary Monte Carlo (MC) algorithm is proposed to train the Bayesian neural networks (BNNs) for the time series forecasting. This approach called as Genetic MC is based on Gaussian approximation with recursive hyperparameter. Genetic MC integrates MC simulations with the genetic algorithms and the fuzzy membership functions. In the implementations, Genetic MC is compared with the traditional neural networks and time series techniques in terms of their forecasting performances over the weekly sales of a Finance Magazine. 相似文献