全文获取类型
收费全文 | 91885篇 |
免费 | 1809篇 |
国内免费 | 490篇 |
专业分类
电工技术 | 942篇 |
综合类 | 2357篇 |
化学工业 | 13758篇 |
金属工艺 | 4956篇 |
机械仪表 | 3376篇 |
建筑科学 | 2481篇 |
矿业工程 | 578篇 |
能源动力 | 1700篇 |
轻工业 | 4429篇 |
水利工程 | 1411篇 |
石油天然气 | 480篇 |
武器工业 | 5篇 |
无线电 | 10081篇 |
一般工业技术 | 17707篇 |
冶金工业 | 2799篇 |
原子能技术 | 314篇 |
自动化技术 | 26810篇 |
出版年
2024年 | 40篇 |
2023年 | 191篇 |
2022年 | 346篇 |
2021年 | 611篇 |
2020年 | 552篇 |
2019年 | 683篇 |
2018年 | 15003篇 |
2017年 | 13879篇 |
2016年 | 10514篇 |
2015年 | 1016篇 |
2014年 | 925篇 |
2013年 | 1213篇 |
2012年 | 3731篇 |
2011年 | 10016篇 |
2010年 | 8666篇 |
2009年 | 5916篇 |
2008年 | 6969篇 |
2007年 | 7917篇 |
2006年 | 254篇 |
2005年 | 1297篇 |
2004年 | 1218篇 |
2003年 | 1220篇 |
2002年 | 587篇 |
2001年 | 121篇 |
2000年 | 196篇 |
1999年 | 79篇 |
1998年 | 71篇 |
1997年 | 44篇 |
1996年 | 66篇 |
1995年 | 27篇 |
1994年 | 21篇 |
1993年 | 23篇 |
1992年 | 21篇 |
1991年 | 39篇 |
1988年 | 16篇 |
1969年 | 24篇 |
1968年 | 43篇 |
1967年 | 34篇 |
1966年 | 42篇 |
1965年 | 44篇 |
1963年 | 28篇 |
1962年 | 22篇 |
1961年 | 18篇 |
1960年 | 30篇 |
1959年 | 35篇 |
1958年 | 37篇 |
1957年 | 36篇 |
1956年 | 34篇 |
1955年 | 63篇 |
1954年 | 68篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
951.
This paper focuses on the computational and experimental study of dielectrophoretic (DEP) force based manipulation of spherical and non-spherical particles by taking into consideration of both electrokinetic effects and particle hydrodynamics. The model is first validated with conventional dipole moment theory. The movements of a spherical polystyrene particle and a rod-shape particle under a non-uniform electric field created by a pair of non-symmetrical electrodes in a microfluidic channel are studied, and a good agreement between the simulation and experimental results is obtained. Both experimental and simulation results reveal that the rod-shape particle experiences larger DEP force and moves faster than spherical particle with a similar mass. It was also interestingly found that the shape-dependent DEP force distribution on the microscale rod particle results in its unique behavior, which cannot be captured by traditional DEP theory. 相似文献
952.
Finding logos in the real-world images is a challenging task due to their small size, simple shape, less texture and clutter background. In this paper, through visual logo analysis with different types of features, we propose a novel framework for finding visual logos in the real-world images. First, we exploit the contextual shape and patch information around feature points, merge them into a combined feature representation (point-context). Considering the characteristics of logos, this kind of fusion is an effective enhancement for the discriminability of single point features. Second, to eliminate the interference of the complex and noisy background, we transfer the logo recognition to a region-to-image search problem by segmenting real-world images into region trees. A weak geometric constraint based on regions is encoded into an inverted file structure to accelerate the search process. Third, we apply global features to refine initial results in the re-ranking stage. Finally, we combine each region score both in max-response and accumulate-response mode to obtain the final results. Performances of the proposed approach are evaluated on both our CASIA-LOGO dataset and the standard Flickr logos 27 dataset. Experiments and comparisons show that our approach is superior to the state-of-the-art approaches. 相似文献
953.
Variational functionals such as Mumford-Shah and Chan-Vese methods have a major impact on various areas of image processing. After over 10 years of investigation, they are still in widespread use today. These formulations optimize contours by evolution through gradient descent, which is known for its overdependence on initialization and the tendency to produce undesirable local minima. In this paper, we propose an image segmentation model in a variational nonlocal means framework based on a weighted graph. The advantages of this model are twofold. First, the convexity global minimum (optimum) information is taken into account to achieve better segmentation results. Second, the proposed global convex energy functionals combine nonlocal regularization and local intensity fitting terms. The nonlocal total variational regularization term based on the graph is able to preserve the detailed structure of target objects. At the same time, the modified local binary fitting term introduced in the model as the local fitting term can efficiently deal with intensity inhomogeneity in images. Finally, we apply the Split Bregman method to minimize the proposed energy functional efficiently. The proposed model has been applied to segmentation of real medical and remote sensing images. Compared with other methods, the proposed model is superior in terms of both accuracy and efficient. 相似文献
954.
A beam-shaped cantilever resonance type magnetic sensor device has been proposed with a micro magnet. Two structural designs, named as design 1 and design 2, have been comparatively analyzed using ANSYS in order to obtain larger frequency shifts (higher magnetism sensitivity) due to the applied exterior magnetic field. The analytical results show that, in the range of 0–10 mT, the frequency shifts are small, while under 100 mT, a relatively larger frequency shift of about 30 Hz can be theoretically obtained. The power consumption of the proposed devices has been further theoretically studied for preliminary understanding. Using the well-known displacement equations, the estimated power consumption is around 0.21 μW, which is very lower than that of the reported magnetic field sensors. This implies that it is possible to fabricate higher sensitive magnetic field sensor with lower power consumption. 相似文献
955.
Anuja Hariharan Marc Thomas Philipp Adam Timm Teubner Christof Weinhardt 《Electronic Markets》2016,26(4):339-355
Environmental conditions and the interplay of cognitive and affective processes both exert influences on bidding behavior. This paper brings the above together, considering how the (external) auction environment determines the impact of (internal) cognitive and affective processes on bidding behavior, assessed in comparison to the optimal bid. Two aspects of the auction environment were considered, namely auction dynamics (low: first-price sealed-bid auction, high: Dutch auction) and value uncertainty (low, high). In a laboratory experiment, we assess bidders’ cognitive workload and emotional arousal through physiological measurements. We find that higher auction dynamics increase the impact of emotional arousal on bid deviations, but not that of cognitive workload. Higher value uncertainty, conversely, increases the impact of cognitive workload on bid deviations, but not that of emotional arousal. Taken together, the auction environment is a critical factor in understanding the nature of the underlying decision process and its impact on bids. 相似文献
956.
Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and in the quantum regime, we examine computationally secure commitment schemes. In this paper we study worst-case complexity assumptions that imply quantum bit commitment schemes. First, we show that QSZK \({\not\subseteq}\) QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP \({\not\subseteq}\) QMA (which is weaker than PSPACE \({\not\subseteq}\) PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK \({\not\subseteq}\) QMA, we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA, the class of languages that can be verified using a classical proof in quantum polynomial time. 相似文献
957.
A square matrix V is called rigid if every matrix \({V^\prime}\) obtained by altering a small number of entries of V has sufficiently high rank. While random matrices are rigid with high probability, no explicit constructions of rigid matrices are known to date. Obtaining such explicit matrices would have major implications in computational complexity theory. One approach to establishing rigidity of a matrix V is to come up with a property that is satisfied by any collection of vectors arising from a low-dimensional space, but is not satisfied by the rows of V even after alterations. In this paper, we propose such a candidate property that has the potential of establishing rigidity of combinatorial design matrices over the field \({\mathbb{F}_2.}\) Stated informally, we conjecture that under a suitable embedding of \({\mathbb{F}_2^n}\) into \({\mathbb{R}^n,}\) vectors arising from a low-dimensional \({\mathbb{F}_2}\)-linear space always have somewhat small Kolmogorov width, i.e., admit a non-trivial simultaneous approximation by a low-dimensional Euclidean space. This implies rigidity of combinatorial designs, as their rows do not admit such an approximation even after alterations. Our main technical contribution is a collection of results establishing weaker forms and special cases of the conjecture above. 相似文献
958.
Rafael Oliveira 《Computational Complexity》2016,25(2):507-561
Kaltofen (Randomness in computation, vol 5, pp 375–412, 1989) proved the remarkable fact that multivariate polynomial factorization can be done efficiently, in randomized polynomial time. Still, more than twenty years after Kaltofen’s work, many questions remain unanswered regarding the complexity aspects of polynomial factorization, such as the question of whether factors of polynomials efficiently computed by arithmetic formulas also have small arithmetic formulas, asked in Kopparty et al. (2014), and the question of bounding the depth of the circuits computing the factors of a polynomial. We are able to answer these questions in the affirmative for the interesting class of polynomials of bounded individual degrees, which contains polynomials such as the determinant and the permanent. We show that if \({P(x_{1},\ldots,x_{n})}\) is a polynomial with individual degrees bounded by r that can be computed by a formula of size s and depth d, then any factor \({f(x_{1},\ldots, x_{n})}\) of \({P(x_{1},\ldots,x_{n})}\) can be computed by a formula of size \({\textsf{poly}((rn)^{r},s)}\) and depth d + 5. This partially answers the question above posed in Kopparty et al. (2014), who asked if this result holds without the dependence on r. Our work generalizes the main factorization theorem from Dvir et al. (SIAM J Comput 39(4):1279–1293, 2009), who proved it for the special case when the factors are of the form \({f(x_{1}, \ldots, x_{n}) \equiv x_{n} - g(x_{1}, \ldots, x_{n-1})}\). Along the way, we introduce several new technical ideas that could be of independent interest when studying arithmetic circuits (or formulas). 相似文献
959.
Recommender systems and other Internet-enabled technologies have changed the surrounding conditions of pre-purchase evaluations on the Internet. In some cases consumers can now sample entire products prior to a purchase – hereby removing all uncertainty about whether a product fits their taste. While previous research has mainly focused on vendor and product quality uncertainty, it is still not clear how declining product fit uncertainty affects consumers. To close this gap, we conducted a laboratory experiment to analyze the effects on consumers’ vendor selection. We find that full elimination of product fit uncertainty is beneficial for vendors, as it increases both the number of purchases and consumer loyalty. Interestingly, if product fit uncertainty is only partially eliminated, consumers do not necessarily show differential behavior for different levels of remaining product fit uncertainty. This has important implications for online vendors that consider the implementation of additional means to reduce product fit uncertainty. 相似文献
960.
Ezlika Ghazali Bang Nguyen Dilip S. Mutum Amrul Asraf Mohd-Any 《Electronic Markets》2016,26(2):157-171
Developing switching barriers to retain customers has become a critical marketing strategy for online retailers. However, research on the role of switching barriers in e-retailing is still limited. Recent trends show that when competitors are just one click away, it is questionable if customer loyalty can be achieved at all in online environments. This leads to the research question on whether switching barriers have any impact on e-loyalty in pure-play retailers. The paper examines the influence of switching barriers on customer retention (i.e., e-store loyalty) and further investigates the moderating effects of switching costs and alternative attractiveness. Data were gathered via a survey of 590 shoppers of online pure-play retailers in the UK. Findings show that customer satisfaction and the two dimensions of switching barriers (perceived switching costs and perceived attractiveness of alternatives) significantly influence customer loyalty. Contrary to findings in earlier studies, it was found that switching costs did not moderate the relationships between satisfaction and loyalty nor between perceived attractiveness of alternatives and loyalty. The paper makes imperative recommendations to develop switching barriers and to foster loyalty along with suggestions for future research. 相似文献