全文获取类型
收费全文 | 5872篇 |
免费 | 321篇 |
国内免费 | 5篇 |
专业分类
电工技术 | 76篇 |
综合类 | 13篇 |
化学工业 | 1503篇 |
金属工艺 | 138篇 |
机械仪表 | 115篇 |
建筑科学 | 403篇 |
矿业工程 | 29篇 |
能源动力 | 146篇 |
轻工业 | 454篇 |
水利工程 | 50篇 |
石油天然气 | 8篇 |
无线电 | 460篇 |
一般工业技术 | 1245篇 |
冶金工业 | 258篇 |
原子能技术 | 37篇 |
自动化技术 | 1263篇 |
出版年
2024年 | 11篇 |
2023年 | 102篇 |
2022年 | 141篇 |
2021年 | 231篇 |
2020年 | 151篇 |
2019年 | 129篇 |
2018年 | 190篇 |
2017年 | 166篇 |
2016年 | 251篇 |
2015年 | 244篇 |
2014年 | 301篇 |
2013年 | 402篇 |
2012年 | 379篇 |
2011年 | 464篇 |
2010年 | 356篇 |
2009年 | 340篇 |
2008年 | 343篇 |
2007年 | 317篇 |
2006年 | 242篇 |
2005年 | 213篇 |
2004年 | 159篇 |
2003年 | 150篇 |
2002年 | 128篇 |
2001年 | 85篇 |
2000年 | 79篇 |
1999年 | 68篇 |
1998年 | 78篇 |
1997年 | 46篇 |
1996年 | 52篇 |
1995年 | 61篇 |
1994年 | 34篇 |
1993年 | 35篇 |
1992年 | 29篇 |
1991年 | 21篇 |
1990年 | 18篇 |
1989年 | 19篇 |
1988年 | 15篇 |
1987年 | 14篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 24篇 |
1983年 | 9篇 |
1982年 | 10篇 |
1981年 | 7篇 |
1980年 | 7篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 9篇 |
1975年 | 8篇 |
1974年 | 5篇 |
排序方式: 共有6198条查询结果,搜索用时 46 毫秒
101.
Stefan Porschen 《Annals of Mathematics and Artificial Intelligence》2007,51(1):27-54
We show that the NP-hard optimization problems minimum and maximum weight exact satisfiability (XSAT) for a CNF formula C over n propositional variables equipped with arbitrary real-valued weights can be solved in O(||C||20.2441n ) time. To the best of our knowledge, the algorithms presented here are the first handling weighted XSAT optimization versions in non-trivial worst case time. We also investigate the corresponding weighted counting problems, namely we show that the number of all minimum, resp. maximum, weight exact satisfiability solutions of an arbitrarily weighted formula can be determined in O(n 2·||C||?+?20.40567n ) time. In recent years only the unweighted counterparts of these problems have been studied (Dahllöf and Jonsson, An algorithm for counting maximum weighted independent sets and its applications. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 292–298, 2002; Dahllöf et al., Theor Comp Sci 320: 373–394, 2004; Porschen, On some weighted satisfiability and graph problems. In: Proceedings of the 31st Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2005). Lecture Notes in Comp. Science, vol. 3381, pp. 278–287. Springer, 2005). 相似文献
102.
Vangelis Gazis Nancy Alonistioti Nikos Houssos Maria Koutsopoulou Stefan Gessler Juergen Quittek 《Journal of Network and Systems Management》2006,14(2):221-241
Mobile communications beyond 3G will integrate different (but complementary) access technologies into a common platform to deliver value-added services and multimedia content in an optimum way. However, the numerous possible configurations of mobile networks complicated the dynamic deployment of mobile applications. Therefore, research is intensely seeking a service provisioning framework that is technology-independent, supports multiple wireless network technologies, and can interwork high-level service management tasks to network management operations. This paper presents an open value chain paradigm, a model for downloadable applications and a mediating platform for service provisioning in beyond 3G mobile settings. Furthermore, we introduce mechanisms that support a coupled interaction between service deployment and network configuration operations, focusing on the dynamic provisioning of QoS state to data path devices according to the requirements of dynamically downloadable mobile value-added services (VAS).
相似文献
Vangelis GazisEmail: |
103.
Illustrative context-preserving exploration of volume data 总被引:2,自引:0,他引:2
Bruckner S Grimm S Kanitsar A Gröller ME 《IEEE transactions on visualization and computer graphics》2006,12(6):1559-1569
In volume rendering, it is very difficult to simultaneously visualize interior and exterior structures while preserving clear shape cues. Highly transparent transfer functions produce cluttered images with many overlapping structures, while clipping techniques completely remove possibly important context information. In this paper, we present a new model for volume rendering, inspired by techniques from illustration. It provides a means of interactively inspecting the interior of a volumetric data set in a feature-driven way which retains context information. The context-preserving volume rendering model uses a function of shading intensity, gradient magnitude, distance to the eye point, and previously accumulated opacity to selectively reduce the opacity in less important data regions. It is controlled by two user-specified parameters. This new method represents an alternative to conventional clipping techniques, sharing their easy and intuitive user control, but does not suffer from the drawback of missing context information 相似文献
104.
Bruckner S Gröiller ME 《IEEE transactions on visualization and computer graphics》2006,12(5):1077-1084
Exploded views are an illustration technique where an object is partitioned into several segments. These segments are displaced to reveal otherwise hidden detail. In this paper we apply the concept of exploded views to volumetric data in order to solve the general problem of occlusion. In many cases an object of interest is occluded by other structures. While transparency or cutaways can be used to reveal a focus object, these techniques remove parts of the context information. Exploded views, on the other hand, do not suffer from this drawback. Our approach employs a force-based model: the volume is divided into a part configuration controlled by a number of forces and constraints. The focus object exerts an explosion force causing the parts to arrange according to the given constraints. We show that this novel and flexible approach allows for a wide variety of explosion-based visualizations including view-dependent explosions. Furthermore, we present a high-quality GPU-based volume ray casting algorithm for exploded views which allows rendering and interaction at several frames per second. 相似文献
105.
Stefan Wintein 《Minds and Machines》2012,22(1):1-24
Uzquiano (Analysis 70:39–44, 2010) showed that the Hardest Logic Puzzle Ever (HLPE) [in its amended form due to Rabern and Rabern (Analysis 68:105–112, 2008)] has a solution in only two questions. Uzquiano concludes his paper by noting that his solution strategy naturally suggests
a harder variation of the puzzle which, as he remarks, he does not know how to solve in two questions. Wheeler and Barahona
(J Philos Logic, to appear, 2011) formulated a three question solution to Uzquiano’s puzzle and gave an information theoretic argument to establish that a
two question solution for Uzquiano’s puzzle does not exist. However, their argument crucially relies on a certain conception
of what it means to answer self-referential yes–no questions truly and falsely. We propose an alternative such conception which, as we show, allows one to solve Uzquiano’s puzzle in two questions. The
solution strategy adopted suggests an even harder variation of Uzquiano’s puzzle which, as we will show, can also be solved
in two questions. Just as all previous solutions to versions of HLPE, our solution is presented informally. The second part of the paper investigates the prospects of formally representing solutions
to HLPE by exploiting theories of truth. 相似文献
106.
Gietzelt M Schnabel S Wolf KH Büsching F Song B Rust S Marschollek M 《Computer methods and programs in biomedicine》2012,106(2):97-103
One of the key problems in accelerometry based gait analyses is that it may not be possible to attach an accelerometer to the lower trunk so that its axes are perfectly aligned to the axes of the subject. In this paper we will present an algorithm that was designed to virtually align the axes of the accelerometer to the axes of the subject during walking sections. This algorithm is based on a physically reasonable approach and built for measurements in unsupervised settings, where the test persons are applying the sensors by themselves. For evaluation purposes we conducted a study with 6 healthy subjects and measured their gait with a manually aligned and a skewed accelerometer attached to the subject's lower trunk. After applying the algorithm the intra-axis correlation of both sensors was on average 0.89±0.1 with a mean absolute error of 0.05g. We concluded that the algorithm was able to adjust the skewed sensor node virtually to the coordinate system of the subject. 相似文献
107.
Stefan Kiefer Andrzej S. Murawski Jo?l Ouaknine Bj?rn Wachter James Worrell 《Formal Aspects of Computing》2012,24(4-6):671-678
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics of the protocol very difficult to analyze. In this paper we study the distribution of the time to stabilization, assuming that there are three tokens in the initial configuration. We show for arbitrary N and for an arbitrary timeout t that the probability of stabilization within time t is minimized by choosing as the initial three-token configuration the configuration in which the tokens are placed equidistantly on the ring. Our result strengthens a corollary of a theorem of McIver and Morgan (Inf. Process Lett. 94(2): 79–84, 2005), which states that the expected stabilization time is minimized by the equidistant configuration. 相似文献
108.
Sediments filling reservoirs is a common problem in the world today, with an estimated 1% of the capacity of hydropower reservoirs being lost annually through sedimentation. One of the most used techniques for reducing this problem is reservoir flushing. During a flood, the water level is drawn down, causing increased velocities, therefore facilitating erosion and sediment transport. During the flushing, water from the reservoir will be lost, resulting in significant economic implications for the reservoir owner. The success of reservoir flushing depends on several parameters, including water discharge, sediment properties and reservoir geometry. This study describes the use of Computational Fluid Dynamics (CFD) as a modern method to predict the reservoir flushing process. A three‐dimensional numerical model (SSIIM 2), with an adaptive, non‐orthogonal and unstructured grid has been used. Through the application of special modified algorithms (e.g., wetting/drying, free water surface), numerical modelling of sediment movement can be an alternative for planning and optimizing the flushing process for complex reservoir geometries. The numerical model was tested against data from a physical model study of the Kali Gandaki hydropower reservoir in Nepal. The total quantity of flushed out sediments, and the bed deformation in six cross‐sections, were compared, highlighting a good correspondence between the results. These include the cross‐sectional shape of a 90‐degree bend, for which secondary currents influenced the results. The study indicates that numerical models might become a useful tool for reservoir flushing predictions. 相似文献
109.
Definition of the problem The development of personalized medicine is currently a popular topic. Particularly the personalized pharmacotherapy is a matter of relative importance due to pharmacological and molecular–genetic developments. For this reason it is required to examine the implications of personalized pharmacotherapy to statutory health insurance and health care of patients. Arguments In this context the question of orphanization arises: If medical drugs of personalized medicine could be regularly indicated as orphan drugs, i.e., as drugs to medicate orphan diseases, it would not be necessary according to the “Arzneimittelneuordnungsgesetz” (AMNOG) to prove an auxiliary value within the assessment of the “Gemeinsamer Bundesausschuss” (GBA). Crucial to the drug’s indication as an orphan drug is among other things the rate of prevalence of the patient group, whose disease should be medicated with the drug. In this connection, there is importance attached to the stratification of patient groups within personalized medicine. Conclusion An orphanization causes consequences in terms of prices to the statutory health insurance due to the lack of knowledge about an auxiliary value. For patients, the implications must be considered in a more differentiated manner. 相似文献
110.
In order to reduce the computational complexity of model predictive control (MPC) a proper input signal parametrization is proposed in this paper which significantly reduces the number of decision variables. This parametrization can be based on either measured data from closed-loop operation or simulation data. The snapshots of representative time domain data for all manipulated variables are projected on an orthonormal basis by a Karhunen-Loeve transformation. These significant features (termed principal control moves, PCM) can be reduced utilizing an analytic criterion for performance degradation. Furthermore, a stability analysis of the proposed method is given. Considerations on the identification of the PCM are made and another criterion is given for a sufficient selection of PCM. It is shown by an example of an industrial drying process that a strong reduction in the order of the optimization is possible while retaining a high performance level. 相似文献