全文获取类型
收费全文 | 2572篇 |
免费 | 180篇 |
国内免费 | 2篇 |
专业分类
电工技术 | 33篇 |
综合类 | 2篇 |
化学工业 | 639篇 |
金属工艺 | 44篇 |
机械仪表 | 44篇 |
建筑科学 | 95篇 |
矿业工程 | 9篇 |
能源动力 | 60篇 |
轻工业 | 420篇 |
水利工程 | 16篇 |
石油天然气 | 4篇 |
无线电 | 153篇 |
一般工业技术 | 394篇 |
冶金工业 | 342篇 |
原子能技术 | 16篇 |
自动化技术 | 483篇 |
出版年
2024年 | 6篇 |
2023年 | 24篇 |
2022年 | 59篇 |
2021年 | 74篇 |
2020年 | 51篇 |
2019年 | 76篇 |
2018年 | 99篇 |
2017年 | 86篇 |
2016年 | 88篇 |
2015年 | 69篇 |
2014年 | 118篇 |
2013年 | 176篇 |
2012年 | 172篇 |
2011年 | 170篇 |
2010年 | 145篇 |
2009年 | 142篇 |
2008年 | 139篇 |
2007年 | 133篇 |
2006年 | 91篇 |
2005年 | 73篇 |
2004年 | 60篇 |
2003年 | 60篇 |
2002年 | 65篇 |
2001年 | 37篇 |
2000年 | 50篇 |
1999年 | 34篇 |
1998年 | 103篇 |
1997年 | 66篇 |
1996年 | 32篇 |
1995年 | 35篇 |
1994年 | 33篇 |
1993年 | 30篇 |
1992年 | 21篇 |
1991年 | 18篇 |
1990年 | 10篇 |
1989年 | 11篇 |
1988年 | 7篇 |
1987年 | 9篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 7篇 |
1983年 | 7篇 |
1982年 | 4篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1979年 | 5篇 |
1978年 | 3篇 |
1977年 | 7篇 |
1976年 | 12篇 |
1968年 | 3篇 |
排序方式: 共有2754条查询结果,搜索用时 15 毫秒
61.
62.
Miguel A. Palacios-Alonso Carlos A. Brizuela L. Enrique Sucar 《Journal of Automated Reasoning》2010,45(1):21-37
Many problems such as voice recognition, speech recognition and many other tasks have been tackled with Hidden Markov Models
(HMMs). These problems can also be dealt with an extension of the Naive Bayesian Classifier (NBC) known as Dynamic NBC (DNBC).
From a dynamic Bayesian network (DBN) perspective, in a DNBC at each time there is a NBC. NBCs work well in data sets with
independent attributes. However, they perform poorly when the attributes are dependent or when there are one or more irrelevant
attributes which are dependent of some relevant ones. Therefore, to increase this classifier accuracy, we need a method to
design network structures that can capture the dependencies and get rid of irrelevant attributes. Furthermore, when we deal
with dynamical processes there are temporal relations that should be considered in the network design. In order to learn automatically
these models from data and increase the classifier accuracy we propose an evolutionary optimization algorithm to solve this
design problem. We introduce a new encoding scheme and new genetic operators which are natural extensions of previously proposed
encoding and operators for grouping problems. The design methodology is applied to solve the recognition problem for nine
hand gestures. Experimental results show that the evolved network has higher average classification accuracy than the basic
DNBC and a HMM. 相似文献
63.
A quality evaluation methodology for health-related websites based on a 2-tuple fuzzy linguistic approach 总被引:1,自引:1,他引:0
J. M. Moreno J. M. Morales del Castillo C. Porcel E. Herrera-Viedma 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2010,14(8):887-897
Nowadays, the patients and physicians use the health-related websites as an important information source and, therefore, it
is critical the quality evaluation of health- related websites. The quality assessment of health-related websites becomes
especially relevant because their use imply the existence of a wide range of threats which can affect people’s health. Additionally,
website quality evaluation can also contribute to maximize the exploitation of invested resources by organizations in the
development of user-perceived quality websites. But there is not yet a clear and unambiguous definition of the concept of
website quality and the debate about quality evaluation on the Web remains open. In this paper, we present a qualitative and
user-oriented methodology for assessing quality of health-related websites based on a 2-tuple fuzzy linguistic approach. To
identify the quality criteria set, a qualitative research has been carried out using the focus groups technique. The measurement
method generates linguistic quality assessments considering the visitors’ judgements with respect to those quality criteria.
The combination of the linguistic judgements is implemented without a loss of information by applying a 2-tuple linguistic
weighted average operator. This methodology means an improvement on quality evaluation of health websites through the commitment
to put users first. 相似文献
64.
Antonio Fernández-CaballeroAuthor Vitae María T. LópezAuthor Vitae Enrique J. CarmonaAuthor VitaeAna E. DelgadoAuthor Vitae 《Neurocomputing》2011,74(8):1175-1181
Certainly, one of the prominent ideas of Professor José Mira was that it is absolutely mandatory to specify the mechanisms and/or processes underlying each task and inference mentioned in an architecture in order to make operational that architecture. The conjecture of the last fifteen years of joint research has been that any bottom-up organization may be made operational using two biologically inspired methods called “algorithmic lateral inhibition”, a generalization of lateral inhibition anatomical circuits, and “accumulative computation”, a working memory related to the temporal evolution of the membrane potential. This paper is dedicated to the computational formulation of both methods. Finally, all of the works of our group related to this methodological approximation are mentioned and summarized, showing that all of them support the validity of this approximation. 相似文献
65.
José Ramón González de Mendívil José Enrique Armendáriz-Iñigo José Ramón Garitagoitia Francesc D. Muñoz-Escoí 《The Journal of supercomputing》2009,50(2):121-161
This paper provides a formal specification and proof of correctness of a basic Generalized Snapshot Isolation certification-based data replication protocol for database middleware architectures. It has been modeled using a state transition
system, as well as the main system components, allowing a perfect match with the usual deployment in a middleware system.
The proof encompasses both safety and liveness properties, as it is commonly done for a distributed algorithm. Furthermore,
a crash failure model has been assumed for the correctness proof, although recovery analysis is not the aim of this paper.
This allows an easy extension toward a crash-recovery model support in future works. The liveness proof focuses in the uniform
commit: if a site has committed a transaction, the rest of sites will either commit it or it would have crashed. 相似文献
66.
Ricardo Enrique Gutiérrez-Carvajal João Maurício Rosário J.A. Tenreiro Machado 《International journal of systems science》2016,47(9):2169-2177
While fractional calculus (FC) is as old as integer calculus, its application has been mainly restricted to mathematics. However, many real systems are better described using FC equations than with integer models. FC is a suitable tool for describing systems characterised by their fractal nature, long-term memory and chaotic behaviour. It is a promising methodology for failure analysis and modelling, since the behaviour of a failing system depends on factors that increase the model’s complexity. This paper explores the proficiency of FC in modelling complex behaviour by tuning only a few parameters. This work proposes a novel two-step strategy for diagnosis, first modelling common failure conditions and, second, by comparing these models with real machine signals and using the difference to feed a computational classifier. Our proposal is validated using an electrical motor coupled with a mechanical gear reducer. 相似文献
67.
68.
This article addresses a new dynamic optimization problem (DOP) based on the Predator-Prey (PP) relationship in nature. Indeed, a PP system involves two adversary species where the predator’s objective is to hunt the prey while the prey’s objective is to escape from its predator. By analogy to dynamic optimization, a DOP can be seen as a predation between potential solution(s) in the search space, which represents the predator, and the moving optimum, as the prey. Therefore we define the dynamic predator-prey problem (DPP) whose objective is to keep track of the moving prey, so as to minimize the distance to the optimum. To solve this problem, a dynamic approach that continuously adapts to the changing environment is required. Accordingly, we propose a new evolutionary approach based on three main techniques for DOPs, namely: multi-population scheme, random immigrants, and memory of past solutions. This hybridization of methods aims at improving the evolutionary approaches ability to deal with DOPs and to restrain as much as possible their drawbacks. Our computational experiments show that the proposed approach achieves high performance for DPP and and competes with state of the art approaches. 相似文献
69.
J.M. Badia J.L. Movilla J.I. Climente M. Castillo M. Marqués R. Mayo E.S. Quintana-Ortí J. Planelles 《Computer Physics Communications》2011,182(2):533-539
We present a Fortran library which can be used to solve large-scale dense linear systems, Ax=b. The library is based on the LU decomposition included in the parallel linear algebra library PLAPACK and on its out-of-core extension POOCLAPACK. The library is complemented with a code which calculates the self-polarization charges and self-energy potential of axially symmetric nanostructures, following an induced charge computation method. Illustrative calculations are provided for hybrid semiconductor–quasi-metal zero-dimensional nanostructures. In these systems, the numerical integration of the self-polarization equations requires using a very fine mesh. This translates into very large and dense linear systems, which we solve for ranks up to 3×105. It is shown that the self-energy potential on the semiconductor–metal interface has important effects on the electronic wavefunction.
Program summary
Program title: HDSS (Huge Dense System Solver)Catalogue identifier: AEHU_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEHU_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 98 889No. of bytes in distributed program, including test data, etc.: 1 009 622Distribution format: tar.gzProgramming language: Fortran 90, CComputer: Parallel architectures: multiprocessors, computer clustersOperating system: Linux/UnixHas the code been vectorized or parallelized?: Yes. 4 processors used in the sample tests; tested from 1 to 288 processorsRAM: 2 GB for the sample tests; tested for up to 80 GBClassification: 7.3External routines: MPI, BLAS, PLAPACK, POOCLAPACK. PLAPACK and POOCLAPACK are included in the distribution file.Nature of problem: Huge scale dense systems of linear equations, Ax=B, beyond standard LAPACK capabilities. Application to calculations of self-energy potential in dielectrically mismatched semiconductor quantum dots.Solution method: The linear systems are solved by means of parallelized routines based on the LU factorization, using efficient secondary storage algorithms when the available main memory is insufficient. The self-energy solver relies on an induced charge computation method. The differential equation is discretized to yield linear systems of equations, which we then solve by calling the HDSS library.Restrictions: Simple precision. For the self-energy solver, axially symmetric systems must be considered.Running time: About 32 minutes to solve a system with approximately 100 000 equations and more than 6000 right-hand side vectors using a four-node commodity cluster with a total of 32 Intel cores. 相似文献70.
Evolvable agents,a fine grained approach for distributed evolutionary computing: walking towards the peer-to-peer computing frontiers 总被引:1,自引:1,他引:0
J. L. J. Laredo P. A. Castillo A. M. Mora J. J. Merelo 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(12):1145-1156
In this work we propose a fine grained approach with self-adaptive migration rate for distributed evolutionary computation.
Our target is to gain some insights on the effects caused by communication when the algorithm scales. To this end, we consider
a set of basic topologies in order to avoid the overlapping of algorithmic effects between communication and topological structures.
We analyse the approach viability by comparing how solution quality and algorithm speed change when the number of processors
increases and compare it with an Island model based implementation. A finer-grained approach implies a better chance of achieving
a larger scalable system; such a feature is crucial concerning large-scale parallel architectures such as peer-to-peer systems.
In order to check scalability, we perform a threefold experimental evaluation of this model: first, we concentrate on the
algorithmic results when the problem scales up to eight nodes in comparison with how it does following the Island model. Second,
we analyse the computing time speedup of the approach while scaling. Finally, we analyse the network performance with the
proposed self-adaptive migration rate policy that depends on the link latency and bandwidth. With this experimental setup,
our approach shows better scalability than the Island model and a equivalent robustness on the average of the three test functions
under study. 相似文献