首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2515篇
  免费   65篇
  国内免费   5篇
电工技术   33篇
综合类   10篇
化学工业   519篇
金属工艺   76篇
机械仪表   53篇
建筑科学   50篇
能源动力   93篇
轻工业   136篇
水利工程   4篇
石油天然气   4篇
无线电   442篇
一般工业技术   455篇
冶金工业   295篇
原子能技术   16篇
自动化技术   399篇
  2023年   10篇
  2022年   54篇
  2021年   56篇
  2020年   20篇
  2019年   23篇
  2018年   34篇
  2017年   35篇
  2016年   51篇
  2015年   55篇
  2014年   80篇
  2013年   176篇
  2012年   118篇
  2011年   150篇
  2010年   140篇
  2009年   173篇
  2008年   137篇
  2007年   150篇
  2006年   103篇
  2005年   82篇
  2004年   83篇
  2003年   59篇
  2002年   72篇
  2001年   49篇
  2000年   44篇
  1999年   40篇
  1998年   123篇
  1997年   69篇
  1996年   60篇
  1995年   33篇
  1994年   40篇
  1993年   26篇
  1992年   25篇
  1991年   30篇
  1990年   20篇
  1989年   19篇
  1988年   10篇
  1987年   7篇
  1986年   11篇
  1985年   13篇
  1984年   16篇
  1983年   7篇
  1982年   11篇
  1981年   11篇
  1980年   9篇
  1979年   8篇
  1978年   5篇
  1977年   7篇
  1976年   6篇
  1973年   5篇
  1971年   4篇
排序方式: 共有2585条查询结果,搜索用时 31 毫秒
41.
Two surface modification methods—plasma surface treatment and chemical agent treatment—were used to investigate their effects on the surface properties of ultrahigh‐molecular‐weight polyethylene (UHMWPE) fibers. In the analyses, performed using electron spectroscopy for chemical analysis, changes in weight, and scanning electron microscope observations, demonstrated that the two fiber‐surface‐modified composites formed between UHMWPE fiber and epoxy matrix exhibited improved interfacial adhesion and slight improvements in tensile strengths, but notable decreases in elongation, relative to those properties of the composites reinforced with the untreated UHMWPE fibers. In addition, three kinds of epoxy resins—neat DGEBA, polyurethane‐crosslinked DGEBA, and BHHBP‐DGEBA—were used as resin matrices to examine the tensile and elongation properties of their UHMWPE fiber‐reinforced composites. From stress/strain measurements and scanning electron microscope observations, the resin matrix improved the tensile strength apparently, but did not affect the elongation. © 2007 Wiley Periodicals, Inc. J Appl Polym Sci 104: 655–665, 2007  相似文献   
42.
One of the major survival challenges of premature birth is production of lung surfactant. The lipid component of surfactant, dipalmitoyl PC (DPPC), increases in concentration in the period before normal term birth via a net shift in FA composition away from unsaturates. We investigated the influence of dietary DHA and arachidonic acid (AA) on lung FA composition and DPPC concentration in term and preterm baboons. Pregnant animals/neonates were randomized to one of four groups: breast-fed (B), term formula-fed (T), preterm formulafed (P), and preterm fed formula supplemented with DHA-AA (P+). Breast milk contained 0.68%wt DHA and the P+ group formula contained 0.61%wt DHA. In the preterm groups (P and P+), pregnant females received a course of antenatal corticosteroids. At the adjusted age of 4 wk, neonate lung tissue was harvested, and FA composition and DPPC were analyzed. Palmitate was ∼28%wt of lung total FA and no significant differences were found among the four treatment groups. In contrast, DPPC in the B group lung tissue was significantly greater than DPPC in the unsupplemented groups, but not compared with the P+ group. The B and P+ groups were not significantly different in DHA and AA, but were different compared with the unsupplemented (T, P) groups. These results indicate that LCP supplementation increases lung DHA and AA, without compromising overall lung 16∶0 or DPPC. The shift in FA composition toward greater unsaturation in the groups consuming LCP supported improved surfactant lipid concentration in preterm neonate lungs.  相似文献   
43.
The electronic portfolio (ePortfolio) is learner-centred, and its effectiveness depends on the learners’ long-term use. Thus, it is proper to conduct the study from the learners’ perspectives. Currently, most research on the use of the ePortfolio is in the form of cross-sectional studies, and it is difficult to find the reasons for the changes in students’ beliefs with regard to the long-term use of the ePortfolio. Based on the longitudinal test, this study explained the students’ continuous use of ePortfolio and the changes in their beliefs. With 122 samplers in the adoption–continuous stage (t 1–t 2) and 117 samplers in the continuous stage (t 2–t 3), this study demonstrates that in continuous use stage (t 2–t 3), perceived ease of use still influences the users’ perceived usefulness (PU) and attitude towards the ePortfolio. Attribution significantly moderates the users’ beliefs from the adoption stage (t 1) to the continuous use stage (t 2). However, the moderating effect of attribution in the continuous use stage (t 2–t 3) is insignificant; satisfaction and attribution are the key factors driving the users’ continuous intention towards the ePortfolio rather than PU and attitude. Meanwhile, satisfaction and attribution will change because of the users’ expectation disconfirmation, and it will influence the users to continue using ePortfolio.  相似文献   
44.
Electronic Knowledge Repository (EKR) is one of the most commonly deployed knowledge management technologies, yet its success hinges upon employees’ continued use and is further complicated in today’s multinational context. We integrate multiple theoretical linkages into a research model, conceptualizing knowledge-seeking as an instrumental behavior, adopting the technology acceptance model to characterize the individual-level continued EKR knowledge-seeking behavioral model, and drawing on the climato-economic theory to explain cross-national behavioral differences. Using hierarchical linear modeling (HLM), we test the model with data from 1352 randomly sampled knowledge workers across 30 nations. We find that two national-level factors, climate harshness and national wealth, interactively moderate the individual-level relationship between perceived usefulness (PU) and behavioral intention (BI) to continue seeking knowledge from EKR, such that the difference in the strength of this relationship is larger between poor-harsh and poor-temperate nations than between rich-harsh and rich-temperate nations. We find similar cross-level cross-national differences for the link between perceived ease of use (PEOU) and PU but not for the link between PEOU and BI. Implications for research and practice are discussed.  相似文献   
45.
46.
47.
The current article examines user satisfaction with instant messaging in building and maintaining social relationships with friends, family members, and others. The research model integrates motivation theory with media capacity theories to explain how the attributes of media capacity (e.g., social presence and media richness) and users' intrinsic and extrinsic motivations toward using instant messaging influence user satisfaction. Data were collected from a sample of 247 Chinese university students via an online survey. The results suggest that perceived enjoyment, perceived social presence, and perceived usefulness are key to user satisfaction. Perceived social presence and perceived media richness are positively associated with perceived enjoyment. It was also found that perceived enjoyment, perceived social presence, and perceived media richness have significant effects on perceived usefulness. Of interest, perceived enjoyment and perceived social presence have stronger effects on user satisfaction than perceived usefulness.  相似文献   
48.
It is foreseen that more and more music objects in symbolic format and multimedia objects, such as audio, video, or lyrics, integrated with symbolic music representation (SMR) will be published and broadcasted via the Internet. The SMRs of the flowing songs or multimedia objects will form a music stream. Many interesting applications based on music streams, such as interactive music tutorials, distance music education, and similar theme searching, make the research of content-based retrieval over music streams much important. We consider multiple queries with error tolerances over music streams and address the issue of approximate matching in this environment. We propose a novel approach to continuously process multiple queries over the music streams for finding all the music segments that are similar to the queries. Our approach is based on the concept of n-grams, and two mechanisms are designed to reduce the heavy computation of approximate matching. One mechanism uses the clustering of query n-grams to prune the query n-grams that are irrelevant to the incoming data n-gram. The other mechanism records the data n-gram that matches a query n-gram as a partial answer and incrementally merges the partial answers of the same query. We implement a prototype system for experiments in which songs in the MIDI format are continuously broadcasted, and the user can specify musical segments as queries to monitor the music streams. Experiment results show the effectiveness and efficiency of the proposed approach.  相似文献   
49.
50.
A review of the methods for global optimization reveals that most methods have been developed for unconstrained problems. They need to be extended to general constrained problems because most of the engineering applications have constraints. Some of the methods can be easily extended while others need further work. It is also possible to transform a constrained problem to an unconstrained one by using penalty or augmented Lagrangian methods and solve the problem that way. Some of the global optimization methods find all the local minimum points while others find only a few of them. In any case, all the methods require a very large number of calculations. Therefore, the computational effort to obtain a global solution is generally substantial. The methods for global optimization can be divided into two broad categories: deterministic and stochastic. Some deterministic methods are based on certain assumptions on the cost function that are not easy to check. These methods are not very useful since they are not applicable to general problems. Other deterministic methods are based on certain heuristics which may not lead to the true global solution. Several stochastic methods have been developed as some variation of the pure random search. Some methods are useful for only discrete optimization problems while others can be used for both discrete and continuous problems. Main characteristics of each method are identified and discussed. The selection of a method for a particular application depends on several attributes, such as types of design variables, whether or not all local minima are desired, and availability of gradients of all the functions.Notation Number of equality constraints - () T A transpose of a vector - A A hypercubic cell in clustering methods - Distance between two adjacent mesh points - Probability that a uniform sample of sizeN contains at least one point in a subsetA ofS - A(v, x) Aspiration level function - A The set of points with cost function values less thanf(x G * ) +. Same asA f () - A f () A set of points at which the cost function value is within off(x G * ) - A () A set of points x with[f(x)] smaller than - A N The set ofN random points - A q The set of sample points with the cost function value f q - Q The contraction coefficient; –1 Q 0 - R The expansion coefficient; E > 1 - R The reflection coefficient; 0 < R 1 - A x () A set of points that are within the distance from x G * - D Diagonal form of the Hessian matrix - det() Determinant of a matrix - d j A monotonic function of the number of failed local minimizations - d t Infinitesimal change in time - d x Infinitesimal change in design - A small positive constant - (t) A real function called the noise coefficient - 0 Initial value for(t) - exp() The exponential function - f (c) The record; smallest cost function value over X(C) - [f(x)] Functional for calculating the volume fraction of a subset - Second-order approximation tof(x) - f(x) The cost function - An estimate of the upper bound of global minimum - f E The cost function value at xE - f L The cost function value at xL - f opt The current best minimum function value - f P The cost function value at x P - f Q The cost function value at x Q - f q A function value used to reduce the random sample - f R The cost function value at x R - f S The cost function value at xS - f T F min A common minimum cost function value for several trajectories - f TF opt The best current minimum value found so far forf TF min - f W The cost function value at x W - G Minimum number of points in a cell (A) to be considered full - The gamma function - A factor used to scale the global optimum cost in the zooming method - Minimum distance assumed to exist between two local minimum points - gi(x) Constraints of the optimization problem - H The size of the tabu list - H(x*) The Hessian matrix of the cost function at x* - h j Half side length of a hypercube - h m Minimum half side lengths of hypercubes in one row - I The unity matrix - ILIM A limit on the number of trials before the temperature is reduced - J The set of active constraints - K Estimate of total number of local minima - k Iteration counter - The number of times a clustering algorithm is executed - L Lipschitz constant, defined in Section 2 - L The number of local searches performed - i The corresponding pole strengths - log () The natural logarithm - LS Local search procedure - M Number of local minimum points found inL searches - m Total number of constraints - m(t) Mass of a particle as a function of time - m() TheLebesgue measure of thea set - Average cost value for a number of random sample of points inS - N The number of sample points taken from a uniform random distribution - n Number of design variables - n(t) Nonconservative resistance forces - n c Number of cells;S is divided inton c cells - NT Number of trajectories - Pi (3.1415926) - P i (j) Hypersphere approximating thej-th cluster at stagei - p(x (i)) Boltzmann-Gibbs distribution; the probability of finding the system in a particular configuration - pg A parameter corresponding to each reduced sample point, defined in (36) - Q An orthogonal matrix used to diagonalize the Hessian matrix - i (i = 1, K) The relative size of thei-th region of attraction - r i (j) Radius of thej-th hypersp here at stagei - R x * Region of attraction of a local minimum x* - r j Radius of a hypersphere - r A critical distance; determines whether a point is linked to a cluster - R n A set ofn tuples of real numbers - A hyper rectangle set used to approximateS - S The constraint set - A user supplied parameter used to determiner - s The number of failed local minimizations - T The tabu list - t Time - T(x) The tunneling function - T c (x) The constrained tunneling function - T i The temperature of a system at a configurationi - TLIMIT A lower limit for the temperature - TR A factor between 0 and 1 used to reduce the temperature - u(x) A unimodal function - V(x) The set of all feasible moves at the current design - v(x) An oscillating small perturbation. - V(y(i)) Voronoi cell of the code point y(i) - v–1 An inverse move - v k A move; the change from previous to current designs - w(t) Ann-dimensional standard. Wiener process - x Design variable vector of dimensionn - x# A movable pole used in the tunneling method - x(0) A starting point for a local search procedure - X(c) A sequence of feasible points {x(1), x(2),,x(c)} - x(t) Design vector as a function of time - X* The set of all local minimum points - x* A local minimum point forf(x) - x*(i) Poles used in the tunneling method - x G * A global minimum point forf(x) - Transformed design space - The velocity vector of the particle as a function of time - Acceleration vector of the particle as a function of time - x C Centroid of the simplex excluding x L - x c A pole point used in the tunneling method - x E An expansion point of x R along the direction x C x R - x L The best point of a simplex - x P A new trial point - x Q A contraction point - x R A reflection point; reflection of x W on x C - x S The second worst point of a simplex - x W The worst point of a simplex - The reduced sample point with the smallest function value of a full cell - Y The set of code points - y (i) A code point; a point that represents all the points of thei-th cell - z A random number uniformly distributed in (0,1) - Z (c) The set of points x where [f (c) ] is smaller thanf(x) - []+ Max (0,) - | | Absolute value - The Euclidean norm - f[x(t)] The gradient of the cost function  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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