全文获取类型
收费全文 | 2255篇 |
免费 | 151篇 |
国内免费 | 2篇 |
学科分类
工业技术 | 2408篇 |
出版年
2023年 | 10篇 |
2021年 | 47篇 |
2020年 | 32篇 |
2019年 | 44篇 |
2018年 | 50篇 |
2017年 | 66篇 |
2016年 | 67篇 |
2015年 | 76篇 |
2014年 | 88篇 |
2013年 | 132篇 |
2012年 | 110篇 |
2011年 | 165篇 |
2010年 | 103篇 |
2009年 | 105篇 |
2008年 | 124篇 |
2007年 | 111篇 |
2006年 | 101篇 |
2005年 | 79篇 |
2004年 | 59篇 |
2003年 | 64篇 |
2002年 | 42篇 |
2001年 | 41篇 |
2000年 | 44篇 |
1999年 | 40篇 |
1998年 | 52篇 |
1997年 | 43篇 |
1996年 | 42篇 |
1995年 | 35篇 |
1994年 | 21篇 |
1993年 | 30篇 |
1992年 | 23篇 |
1991年 | 20篇 |
1990年 | 17篇 |
1989年 | 21篇 |
1988年 | 18篇 |
1987年 | 11篇 |
1986年 | 23篇 |
1985年 | 20篇 |
1984年 | 20篇 |
1983年 | 14篇 |
1982年 | 13篇 |
1981年 | 18篇 |
1980年 | 13篇 |
1979年 | 17篇 |
1978年 | 16篇 |
1977年 | 17篇 |
1976年 | 13篇 |
1974年 | 12篇 |
1973年 | 11篇 |
1970年 | 9篇 |
排序方式: 共有2408条查询结果,搜索用时 15 毫秒
41.
Joachim Meyer Yuval Bitan David Shinar 《International journal of human-computer interaction》2013,29(3):273-290
Two experiments assessed the effect of displaying a boundary on duration estimates and preference ratings for dynamic displays that were shown while users waited for the system's response. Displays were either symbolic (changing numbers) or graphic (increasing rectangles) and could contain a boundary that indicated when the interval was expected to be over. Duration estimates were similar for symbolic and graphic displays and for displays with and without a boundary. However, when the displays were encountered successively, participants assessed the graphic displays as having shorter durations than the symbolic displays. Faster rates of change in both types of displays led to increased duration estimates. Although displaying a boundary did not affect duration estimates, participants preferred displays in which a boundary was shown and preferred the graphic displays over the symbolic displays. Hence, bounded graphic displays are recommended as “wait” displays for computerized applications. 相似文献
42.
We study a generalized job-shop problem called the body shop scheduling problem (BSSP). This problem arises from the industrial application of welding in a car body production line, where possible collisions between industrial robots have to be taken into account. BSSP corresponds to a job-shop problem where the operations of a job have to follow alternating routes on the machines, certain operations of different jobs are not allowed to be processed at the same time and after processing an operation of a certain job a machine might be unavailable for a given time for operations of other jobs. As main results we will show that for three jobs and four machines the special case where only one machine is used by more than one job is already $\mathcal NP $ -hard. This also implies that the single machine scheduling problem that asks for a makespan minimal schedule of three chains of operations with delays between the operations of a chain is $\mathcal NP $ -hard. On the positive side, we present a polynomial algorithm for the two job case and a pseudo-polynomial algorithm together with an FPTAS for an arbitrary but constant number of jobs. Hence for a constant number of jobs we fully settle the complexity status of the problem. 相似文献
43.
Nonparametric Bayesian Image Segmentation 总被引:1,自引:0,他引:1
Image segmentation algorithms partition the set of pixels of an image into a specific number of different, spatially homogeneous
groups. We propose a nonparametric Bayesian model for histogram clustering which automatically determines the number of segments
when spatial smoothness constraints on the class assignments are enforced by a Markov Random Field. A Dirichlet process prior
controls the level of resolution which corresponds to the number of clusters in data with a unique cluster structure. The resulting posterior is efficiently
sampled by a variant of a conjugate-case sampling algorithm for Dirichlet process mixture models. Experimental results are
provided for real-world gray value images, synthetic aperture radar images and magnetic resonance imaging data. 相似文献
44.
In this work we examine the influence of the diffusive motion of vortices in highly anisotropic high-Tc superconductors near the Berezinskii-Kosterlitz-Thouless (BKT) transition temperature T
bkt
on the spin-lattice relaxation rate T
1
–1
.We find a jump in T
1
–1
at the temperature T
bkt
. 相似文献
45.
Yixuan Jia Christoph A. Spiegel Alexander Welle Stefan Heißler Elaheh Sedghamiz Modan Liu Wolfgang Wenzel Maximilian Hackner Joachim P. Spatz Manuel Tsotsalas Eva Blasco 《Advanced functional materials》2023,33(39):2207826
Manufacturing programmable materials, whose mechanical properties can be adapted on demand, is highly desired for their application in areas ranging from robotics, to biomedicine, or microfluidics. Herein, the inclusion of dynamic and living bonds, such as alkoxyamines, in a printable formulation suitable for two-photon 3D laser printing is exploited. On one hand, taking advantage of the dynamic covalent character of alkoxyamines, the nitroxide exchange reaction is investigated. As a consequence, a reduction of the Young´s Modulus by 50%, is measured by nanoindentation. On the other hand, due to its “living” characteristic, the chain extension becomes possible via nitroxide mediated polymerization. In particular, living nitroxide mediated polymerization of styrene results not only in a dramatic increase of the volume (≈8 times) of the 3D printed microstructure but also an increase of the Young's Modulus by two orders of magnitude (from 14 MPa to 2.7 GPa), while maintaining the shape including fine structural details. Thus, the approach introduces a new dimension by enabling to create microstructures with dynamically tunable size and mechanical properties. 相似文献
46.
47.
Optimized Photoinitiator for Fast Two‐Photon Absorption Polymerization of Polyester‐Macromers for Tissue Engineering 下载免费PDF全文
48.
49.
50.
Orphan detection in distributed systems is a well-researched field for which many solutions exist. These solutions exploit well defined parent-child relationships given in distributed systems. But they are not applicable in mobile agent systems, since no similar natural relationship between agents exist. Thus new protocols have to be developed. In this paper one such protocol for controlling mobile mobile agents and for orphan detection is presented. The shadow approach presented in this paper uses the idea of a placeholder (shadow) which is assigned by the agent system to each new agent. This defines an artificial relationship between agents and shadow. The shadow records the location of all dependent agents. Removing the root shadow implies that all dependent agents are declared orphan and are eventually be terminated. We introduce agent proxies that create a path from shadow to every agent. In an extension of the basic protocol we additionally allow the shadow to be mobile.The shadow approach can be used for termination of groups of agents even if the exact location of each single agent is not known. 相似文献