全文获取类型
收费全文 | 3226篇 |
免费 | 104篇 |
国内免费 | 4篇 |
专业分类
电工技术 | 43篇 |
综合类 | 4篇 |
化学工业 | 633篇 |
金属工艺 | 80篇 |
机械仪表 | 65篇 |
建筑科学 | 123篇 |
矿业工程 | 13篇 |
能源动力 | 64篇 |
轻工业 | 166篇 |
水利工程 | 11篇 |
石油天然气 | 12篇 |
无线电 | 354篇 |
一般工业技术 | 571篇 |
冶金工业 | 754篇 |
原子能技术 | 19篇 |
自动化技术 | 422篇 |
出版年
2023年 | 23篇 |
2022年 | 88篇 |
2021年 | 93篇 |
2020年 | 52篇 |
2019年 | 54篇 |
2018年 | 55篇 |
2017年 | 77篇 |
2016年 | 84篇 |
2015年 | 61篇 |
2014年 | 92篇 |
2013年 | 149篇 |
2012年 | 141篇 |
2011年 | 139篇 |
2010年 | 134篇 |
2009年 | 113篇 |
2008年 | 144篇 |
2007年 | 131篇 |
2006年 | 102篇 |
2005年 | 107篇 |
2004年 | 62篇 |
2003年 | 61篇 |
2002年 | 74篇 |
2001年 | 45篇 |
2000年 | 54篇 |
1999年 | 46篇 |
1998年 | 169篇 |
1997年 | 137篇 |
1996年 | 95篇 |
1995年 | 55篇 |
1994年 | 65篇 |
1993年 | 60篇 |
1992年 | 26篇 |
1991年 | 13篇 |
1990年 | 20篇 |
1989年 | 30篇 |
1988年 | 23篇 |
1987年 | 23篇 |
1986年 | 16篇 |
1985年 | 30篇 |
1984年 | 27篇 |
1983年 | 27篇 |
1982年 | 22篇 |
1981年 | 34篇 |
1980年 | 34篇 |
1979年 | 24篇 |
1978年 | 21篇 |
1977年 | 31篇 |
1976年 | 49篇 |
1975年 | 18篇 |
1974年 | 14篇 |
排序方式: 共有3334条查询结果,搜索用时 0 毫秒
51.
Michael Monagan Roman Pearce 《Journal of Symbolic Computation》2011,46(7):807-822
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexity as multiplication. It is a fraction-free method that also reduces the number of integer operations for divisions of polynomials with integer coefficients over the rationals. Heap-based algorithms use very little memory and do not generate garbage. They can run in the CPU cache and achieve high performance. We compare our C implementation of sparse polynomial multiplication and division with integer coefficients to the routines of the Magma, Maple, Pari, Singular and Trip computer algebra systems. 相似文献
52.
Given recent experimental results suggesting that neural circuits may evolve through multiple firing states, we develop a framework for estimating state-dependent neural response properties from spike train data. We modify the traditional hidden Markov model (HMM) framework to incorporate stimulus-driven, non-Poisson point-process observations. For maximal flexibility, we allow external, time-varying stimuli and the neurons' own spike histories to drive both the spiking behavior in each state and the transitioning behavior between states. We employ an appropriately modified expectation-maximization algorithm to estimate the model parameters. The expectation step is solved by the standard forward-backward algorithm for HMMs. The maximization step reduces to a set of separable concave optimization problems if the model is restricted slightly. We first test our algorithm on simulated data and are able to fully recover the parameters used to generate the data and accurately recapitulate the sequence of hidden states. We then apply our algorithm to a recently published data set in which the observed neuronal ensembles displayed multistate behavior and show that inclusion of spike history information significantly improves the fit of the model. Additionally, we show that a simple reformulation of the state space of the underlying Markov chain allows us to implement a hybrid half-multistate, half-histogram model that may be more appropriate for capturing the complexity of certain data sets than either a simple HMM or a simple peristimulus time histogram model alone. 相似文献
53.
Roman Palenichka Ahmed Lakhssassi Marek Zaremba 《Engineering Applications of Artificial Intelligence》2011,24(5):822-832
This paper presents a method for multi-scale segmentation of surface data using scale-adaptive region growing. The proposed segmentation algorithm is initiated by an unsupervised learning of optimal seed positions through the surface attribute clustering with a two-criterion score function. The seeds are selected as consecutive local maxima of the clustering map, which is computed by an aggregation of the local isotropic contrast and local variance maps. The proposed method avoids typical segmentation errors caused by an inappropriate choice of seed points and thresholds used in the region-growing algorithm. The scale-adaptive threshold estimate is based on the image local statistics in the neighborhoods of seed points. The performance of this method was evaluated on LiDAR surface images. 相似文献
54.
55.
56.
We give lower bounds on the growth rate of Dejean words, i.e. minimally repetitive words, over a k-letter alphabet, for 5≤k≤10. Put together with the known upper bounds, we estimate these growth rates with the precision of 0.005. As a consequence, we establish the exponential growth of the number of Dejean words over a k-letter alphabet, for 5≤k≤10. 相似文献
57.
This paper deals with task scheduling, where each task is one particular iteration of a DO loop with partial loop-carried dependencies. Independent iterations of such loops can be scheduled in an order different from the one of classical serial execution, so as to increase program performance.The approach that we present is based both on the use of a directive added to the High Performance Fortran (HPF2) language, which specifies the dependencies between iterations, and on inspector/executor support, implemented in the CoLUMBO library, which builds the task graph and schedules tasks associated with iterations. We validate our approach by showing results achieved on an IBM SP2 for a sparse Cholesky factorization algorithm applied to real problems. 相似文献
58.
59.
Roman Beck Daniel Beimborn Tim Weitzel Wolfgang König 《Information Systems Frontiers》2008,10(4):415-429
Adoption research has largely ignored the dynamic impact of network effects on technology adoption and diffusion. For example, some technologies become more attractive the more social peers use them as well. But adoption at the same time increases the value for the peers and thereby their adoption decisions as well. Unfortunately, interdependencies like these make adoption and diffusion patterns very complex. Drawing on network effect theory, we develop an adoption and diffusion model that explicitly considers the role of direct and indirect network effects for individual technology adoption, using mobile commerce adoption as application example. By applying a simulation approach we can exemplify and analyze the fundamental adoption dynamics given rise to by network effects. We thereby propose a way of how to incorporate network effects into adoption research and disclose the role of the technology diffusion lifecycle for individual adoption. 相似文献
60.
Towards a continuous microfluidic rheometer 总被引:1,自引:1,他引:0
Pierre Guillot Thomas Moulin Roman Kötitz Matthieu Guirardel Arash Dodge Mathieu Joanicot Annie Colin Charles-Henri Bruneau Thierry Colin 《Microfluidics and nanofluidics》2008,5(5):619-630
In a previous paper we presented a way to measure the rheological properties of complex fluids on a microfluidic chip (Guillot
et al., Langmuir 22:6438, 2006). The principle of our method is to use parallel flows between two immiscible fluids as a pressure
sensor. In fact, in a such flow, both fluids flow side by side and the size occupied by each fluid stream depends only on
both flow rates and on both viscosities. We use this property to measure the viscosity of one fluid knowing the viscosity
of the other one, both flow rates and the relative size of both streams in a cross-section. We showed that using a less viscous
fluid as a reference fluid allows to define a mean shear rate with a low standard deviation in the other fluid. This method
allows us to measure the flow curve of a fluid with less than 250 μL of fluid. In this paper we implement this principle in
a fully automated set up which controls the flow rate, analyzes the picture and calculates the mean shear rate and the viscosity
of the studied fluid. We present results obtained for Newtonian fluids and complex fluids using this set up and we compare
our data with cone and plate rheometer measurements. By adding a mixing stage in the fluidic network we show how this set
up can be used to characterize in a continuous way the evolution of the rheological properties as a function of the formulation
composition. We illustrate this by measuring the rheological curve of four formulations of polyethylene oxide solution with
only 1.3 mL of concentrated polyethylene oxide solution. This method could be very useful in screening processes where the
viscosity range and the behavior of the fluid to an applied stress must be evaluated. 相似文献