首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   77375篇
  免费   4692篇
  国内免费   107篇
电工技术   535篇
综合类   161篇
化学工业   16298篇
金属工艺   1443篇
机械仪表   1563篇
建筑科学   2537篇
矿业工程   180篇
能源动力   1916篇
轻工业   12352篇
水利工程   708篇
石油天然气   406篇
武器工业   6篇
无线电   4220篇
一般工业技术   12922篇
冶金工业   15633篇
原子能技术   379篇
自动化技术   10915篇
  2023年   671篇
  2022年   1213篇
  2021年   2128篇
  2020年   1601篇
  2019年   1632篇
  2018年   2764篇
  2017年   2758篇
  2016年   2923篇
  2015年   2171篇
  2014年   2939篇
  2013年   5772篇
  2012年   4832篇
  2011年   4694篇
  2010年   3692篇
  2009年   3403篇
  2008年   3521篇
  2007年   3078篇
  2006年   2408篇
  2005年   1998篇
  2004年   1790篇
  2003年   1663篇
  2002年   1413篇
  2001年   1040篇
  2000年   971篇
  1999年   1124篇
  1998年   5095篇
  1997年   3230篇
  1996年   2097篇
  1995年   1252篇
  1994年   1058篇
  1993年   1002篇
  1992年   381篇
  1991年   352篇
  1990年   321篇
  1989年   326篇
  1988年   318篇
  1987年   285篇
  1986年   273篇
  1985年   325篇
  1984年   289篇
  1983年   205篇
  1982年   232篇
  1981年   264篇
  1980年   246篇
  1979年   189篇
  1978年   166篇
  1977年   325篇
  1976年   637篇
  1975年   131篇
  1973年   139篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
Radio frequency identification (RFID) is a powerful technology that enables wireless information storage and control in an economical way. These properties have generated a wide range of applications in different areas. Due to economic and technological constrains, RFID devices are seriously limited, having small or even tiny computational capabilities. This issue is particularly challenging from the security point of view. Security protocols in RFID environments have to deal with strong computational limitations, and classical protocols cannot be used in this context. There have been several attempts to overcome these limitations in the form of new lightweight security protocols designed to be used in very constrained (sometimes called ultra‐lightweight) RFID environments. One of these proposals is the David–Prasad ultra‐lightweight authentication protocol. This protocol was successfully attacked using a cryptanalysis technique named Tango attack. The capacity of the attack depends on a set of boolean approximations. In this paper, we present an enhanced version of the Tango attack, named Genetic Tango attack, that uses Genetic Programming to design those approximations, easing the generation of automatic cryptanalysis and improving its power compared to a manually designed attack. Experimental results are given to illustrate the effectiveness of this new attack.  相似文献   
992.
This paper presents a new complex system systemic. Here, we are working in a fuzzy environment, so we have to adapt all the previous concepts and results that were obtained in a non-fuzzy environment, for this fuzzy case. The direct and indirect influences between variables will provide the basis for obtaining fuzzy and/or non-fuzzy relationships, so that the concepts of coverage and invariability between sets of variables will appear naturally. These two concepts and their interconnections will be analyzed from the viewpoint of algebraic properties of inclusion, union and intersection (fuzzy and non-fuzzy), and also for the loop concept, which, as we shall see, will be of special importance.  相似文献   
993.
Data reconciliation consists in modifying noisy or unreliable data in order to make them consistent with a mathematical model (herein a material flow network). The conventional approach relies on least-squares minimization. Here, we use a fuzzy set-based approach, replacing Gaussian likelihood functions by fuzzy intervals, and a leximin criterion. We show that the setting of fuzzy sets provides a generalized approach to the choice of estimated values, that is more flexible and less dependent on oftentimes debatable probabilistic justifications. It potentially encompasses interval-based formulations and the least squares method, by choosing appropriate membership functions and aggregation operations. This paper also lays bare the fact that data reconciliation under the fuzzy set approach is viewed as an information fusion problem, as opposed to the statistical tradition which solves an estimation problem.  相似文献   
994.
Dairy farming is the main agricultural activity of the Basque Country. A dairy farm is characterized as a system with soils and crops, forage, cattle and manure as main components, and in such a system, nutrient cycling is very important to maintain soil fertility and optimize forage production. To quantify nutrient transfers in the cycle, a simple system was developed and has been applied to seventeen farms to examine its ability to achieve a balanced P and K fertilization. These farms have provided data on inputs (fertilizer, feeds, concentrates), pasture and manure management, and outputs (milk production), and soil samples have been taken from farm pastures. Phosphorus and K in excreta and uneaten pasture is used with a relatively high efficiency as suggested by the relatively high efficiency of P and K utilization by the pasture that usually ranges from 70 to 90%. Concentrate feeding (3000 kg cow–1 yr–1) represents one of the main P and K inputs in Basque Country dairy farms, averaging 26 and 66 kg ha–1, respectively. Besides, release of K in the soil through slow liberation from non-exchangeable sites was estimated as 30 kg ha–1. Thus, a high efficiency in excreta recycling would diminish substantially P and K mineral fertilizer needs. Farm nutrient budgets appear to be a convenient tool for determining nutrient shortages and surpluses at farm level, and thus they are considered as a first step to support a better management of maintenance fertilization of permanent pastures.  相似文献   
995.
It has been shown that with careful grazing management and addition of Pand K, but not N, fertilisers Brachiaria pastures are ableto maintain sustainable live weight gains over many years. However, standardon-farm practice, which generally involves high stocking rates, leads after afew years to pasture decline due mainly to N deficiency for grass regrowth. Togenerate an understanding of the mechanism of pasture decline and possiblemanagement options to mitigate this process, a study was performed in theAtlantic forest region of the south of Bahia state to study the N dynamics inpastures of Brachiaria humidicola subject to threedifferent stocking rates of beef cattle, with and without the presence of theforage legume Desmodium ovalifolium. Despite the fact thatthe C:N ratio of the deposited litter was high (60 to 70) the rate ofdecomposition was very rapid (k –0.07 gg–1 day–1) and annual rates of Nturnover through the litter pathway were between 105 and 170 kg Nha–1 year–1. In the grass-onlypasturesas stocking rate increased from 2 to 3 head ha–1, N recycledinthe litter decreased by 11%, but a further increase to 4 headha–1 decreased N recycling by 30% suggesting thatbeyonda certain critical level higher grazing stocking rates would lead to pasturedecline if there was no N addition. High stocking rates decreased theproportionof the legume in the sward, but at all rates the concentration of N in both thegreen and dead grass in the forage on offer and in the litter was higher in themixed sward. The presence of the legume caused a decrease in the C:N ratio ofthe microbial biomass while both soil N mineralisation and nitrificationincreased. This increased rate of turnover of the microbial biomass and thecontribution of N2 fixation to the legume resulted in largeincreasesin the N recycled via litter deposition ranging from 42 to 155 kg Nha–1 year–1.  相似文献   
996.
997.
In this paper we propose a new class of incomplete Riemann solvers, based on approximations in the \(L^\infty \) -norm to the absolute value function in \([-1,1]\) by means of rational functions, for the numerical approximation of the solution of hyperbolic systems of conservation laws. The main idea relies on the construction of a numerical approximation to the viscosity matrix by using an appropriate rational real function \(R(x)\) , that approximates the function \(|x|\) uniformly in \([-1,1]\) , evaluated at the Jacobian of the fluxes of the hyperbolic system computed at some average value (for example, Roe averages). In addition to the Jacobians of the fluxes we shall use either the maximum in absolute value of the characteristic speeds in each cell or an upper bound of them. Thus, the resulting approximate Riemann solver is incomplete in the sense that we do not use the complete spectral decomposition of the Jacobian. Moreover, the new class of Riemann solvers consists of a hierarchy of schemes running from the more dissipative to the less dissipative ones, and having as limiting case a Roe-like scheme. According to the order of the approximation of the generating rational function used, the degree of dissipation can be dosed for particular applications. We study different rational approximations: Newman-type functions, iterative generated Halley functions, and also Chebyshev polynomial approximants. We test our basic algorithms for different initial value Riemann problems for ideal gas dynamics (HD) and magnetohydrodynamics (MHD) to observe their behavior with respect to challenging scenarios in numerical simulations, including some standard numerical pathologies (e. g., heat conduction, postshock oscillations and overheating) and the formation of compound waves in ideal MHD. We also examine our proposed schemes, by computing the numerical approximation of different initial value problems for nonconservative multilayer shallow water equations, where it has been observed that intermediate waves can be properly captured for an appropriate degree of approximation of the generating rational function used. Our numerical tests indicate that the proposed schemes are robust, running stable and accurate with a satisfactory time step restriction (CFL constant), and the computational cost is more advantageous with respect to schemes that use a complete spectral decomposition of the Jacobians.  相似文献   
998.
This paper examines four different strategies, each one with its own data distribution, for implementing the parallel conjugate gradient (CG) method and how they impact communication and overall performance. Firstly, typical 1D and 2D distributions of the matrix involved in CG computations are considered. Then, a new 2D version of the CG method with asymmetric workload, based on leaving some threads idle during part of the computation to reduce communication, is proposed. The four strategies are independent of sparse storage schemes and are implemented using Unified Parallel C (UPC), a Partitioned Global Address Space (PGAS) language. The strategies are evaluated on two different platforms through a set of matrices that exhibit distinct sparse patterns, demonstrating that our asymmetric proposal outperforms the others except for one matrix on one platform.  相似文献   
999.
1000.
Diarrhea caused by enterotoxigenic Escherichia coli (ETEC) is the main infectious disease of newborn calves. The first step of infection involves bacterial attachment to the intestinal mucosa. This adhesion is mediated by fimbriae that recognize some glycoconjugates on the host cell surface, in particular, several gangliosides. Because milk also contains gangliosides, these have been suggested to serve as ligands for bacterial fimbriae and thus prevent the bacterial attachment to mucosa. The most relevant ETEC strains in calves, including those with K99 and F41 fimbriae, were assayed to determine whether they are able to bind gangliosides isolated from several stages of bovine lactation. Both GM3 and GD3, the main gangliosides of milk, were recognized by ETEC strains, although the different fimbriae showed diverse levels of affinity. Unexpectedly, the adhesion to colostral gangliosides was considerably weaker than that to gangliosides from the other stages of lactation. Because the carbohydrate moiety did not change and because differences in the percentages of unsaturated FA and sphingosine between colostrum and other stages were observed, we conclude that the differences in adhesion could be due to a different composition of the ganglioside caramide.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号