全文获取类型
收费全文 | 1434篇 |
免费 | 50篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 18篇 |
化学工业 | 326篇 |
金属工艺 | 40篇 |
机械仪表 | 40篇 |
建筑科学 | 29篇 |
矿业工程 | 2篇 |
能源动力 | 98篇 |
轻工业 | 72篇 |
水利工程 | 15篇 |
石油天然气 | 6篇 |
无线电 | 149篇 |
一般工业技术 | 314篇 |
冶金工业 | 182篇 |
原子能技术 | 3篇 |
自动化技术 | 191篇 |
出版年
2023年 | 11篇 |
2022年 | 17篇 |
2021年 | 29篇 |
2020年 | 21篇 |
2019年 | 21篇 |
2018年 | 51篇 |
2017年 | 43篇 |
2016年 | 41篇 |
2015年 | 14篇 |
2014年 | 49篇 |
2013年 | 85篇 |
2012年 | 54篇 |
2011年 | 68篇 |
2010年 | 62篇 |
2009年 | 83篇 |
2008年 | 81篇 |
2007年 | 60篇 |
2006年 | 46篇 |
2005年 | 50篇 |
2004年 | 27篇 |
2003年 | 41篇 |
2002年 | 38篇 |
2001年 | 23篇 |
2000年 | 16篇 |
1999年 | 21篇 |
1998年 | 35篇 |
1997年 | 25篇 |
1996年 | 37篇 |
1995年 | 28篇 |
1994年 | 22篇 |
1993年 | 20篇 |
1992年 | 20篇 |
1991年 | 19篇 |
1990年 | 11篇 |
1989年 | 18篇 |
1988年 | 8篇 |
1987年 | 11篇 |
1986年 | 20篇 |
1985年 | 18篇 |
1984年 | 17篇 |
1983年 | 10篇 |
1982年 | 12篇 |
1981年 | 15篇 |
1980年 | 16篇 |
1979年 | 6篇 |
1978年 | 9篇 |
1977年 | 17篇 |
1976年 | 15篇 |
1974年 | 5篇 |
1973年 | 7篇 |
排序方式: 共有1485条查询结果,搜索用时 31 毫秒
41.
RSS (really simple syndication) based feeds have become the defacto mechanism of web based publish subscribe. Peer-to-Peer
delivery of such feeds can not only alleviate the load at the content server, but also reduce the dissemination latency. However,
due to openness of P2P system, malicious peers can join the network as easily as normal peers do. Such malicious peers may
pretend to relay but actually not, and thus deny service, or even disseminate counterfeit updates, rendering a Peer-to-Peer
mechanism not only useless, but even harmful (e.g. by false updates). We propose overlay independent randomized strategies
to mitigate these ill-effects of malicious peers at a marginal overhead, thus enjoying the benefits of Peer-to-Peer dissemination,
along with the assurance of content integrity in RSS like web-based publish-subscribe applications without altering currently
deployed server infrastructure. We conduct analysis of performance of our proposal by modeling behavior of the system and
validating the same with simulation. Results show that our proposal is effective, robust and scalable. 相似文献
42.
The goal of this project is to build a miniaturized, user-friendly cytometry setup (Datta et al. in Microfluidic platform for education and research. COMS, Baton Rouge, 2008; Frische et al. in Development of an miniaturized flow cytometry setup for visual cell inspection and sorting. Baton Rouge, Project Report, 2008) by combining a customized, microfluidic device with visual microscope inspection to detect and extract specific cells from a continuous sample flow. We developed a cytological tool, based on the Coulter particle counter principle, using a microelectrode array patterned on a borosilicate glass chip as electrical detection set-up which is fully embedded into a polymeric multi-layer microfluidic stack. The detection takes place between pairs of coplanar Cr/Au microelectrodes by sensing an impedance change caused by particles continuously carried within a microfluidic channel across the detection area under laminar flow conditions. A wide frequency range available for counting provides information on cell size, membrane capacitance, cytoplasm conductivity and is potentially of interest for in-depth cell diagnostic e.g. to detect damaged or cancerous cells and select them for extraction and further in-depth analysis. 相似文献
43.
Current real-time collaborative application implementations use dedicated infrastructure to carry out all communication and synchronization activities. Specifically, they require all end nodes to communicate directly with and through the central server. In this paper, we investigate scenarios in which the most resource intensive functionality of continuous communication among collaborators to disseminate changes is decentralized, utilizing the end users themselves as relays. We observe that communication characteristics of real-time collaboration makes use of existing multicast mechanisms unsuitable. As collaborative editing sessions are typically long and repeated, it is possible to gather and leverage node behavior (their instabilities and frequency of sending updates) and communication links (latencies and average costs). Several criteria to determine the quality of a multicast tree can be identified: cost, latency and instability. In this paper, we analyze the complexity of the problem of finding optimal communication topologies, and propose approximate algorithms to optimize the same. We also consider the multiobjective problem in which we search for a topology that provides good trade-off between these sometimes conflicting measures. Validation of our proposed algorithms on numerous graphs shows that it is important to consider the multiobjective problem, as optimal solutions for one performance measure can be far from optimal for the other metrics. Finally, we briefly present an implementation of a communication library that uses the proposed algorithms to periodically adjust the dissemination tree. 相似文献
44.
Datta Deepanwita Singh Sanjay K. Chowdary C. Ravindranath 《Multimedia Tools and Applications》2017,76(21):22871-22888
Multimedia Tools and Applications - Multimodal Retrieval provides new paradigms and methods aimed at effectively searching through the enormous volume of data. Multimodal retrieval is a well... 相似文献
45.
Robbert?Jongeling Proshanta?Sarkar Subhajit?Datta Alexander?SerebrenikEmail authorView authors OrcID profile 《Empirical Software Engineering》2017,22(5):2543-2584
Recent years have seen an increasing attention to social aspects of software engineering, including studies of emotions and sentiments experienced and expressed by the software developers. Most of these studies reuse existing sentiment analysis tools such as SentiStrength and NLTK. However, these tools have been trained on product reviews and movie reviews and, therefore, their results might not be applicable in the software engineering domain. In this paper we study whether the sentiment analysis tools agree with the sentiment recognized by human evaluators (as reported in an earlier study) as well as with each other. Furthermore, we evaluate the impact of the choice of a sentiment analysis tool on software engineering studies by conducting a simple study of differences in issue resolution times for positive, negative and neutral texts. We repeat the study for seven datasets (issue trackers and Stack Overflow questions) and different sentiment analysis tools and observe that the disagreement between the tools can lead to diverging conclusions. Finally, we perform two replications of previously published studies and observe that the results of those studies cannot be confirmed when a different sentiment analysis tool is used. 相似文献
46.
Datta A Sheikh Y Kanade T 《IEEE transactions on pattern analysis and machine intelligence》2011,33(4):780-793
In this paper, we describe the explicit application of articulation constraints for estimating the motion of a system of articulated planes. We relate articulations to the relative homography between planes and show that these articulations translate into linearized equality constraints on a linear least-squares system, which can be solved efficiently using a Karush-Kuhn-Tucker system. The articulation constraints can be applied for both gradient-based and feature-based motion estimation algorithms and to illustrate this, we describe a gradient-based motion estimation algorithm for an affine camera and a feature-based motion estimation algorithm for a projective camera that explicitly enforces articulation constraints. We show that explicit application of articulation constraints leads to numerically stable estimates of motion. The simultaneous computation of motion estimates for all of the articulated planes in a scene allows us to handle scene areas where there is limited texture information and areas that leave the field of view. Our results demonstrate the wide applicability of the algorithm in a variety of challenging real-world cases such as human body tracking, motion estimation of rigid, piecewise planar scenes, and motion estimation of triangulated meshes. 相似文献
47.
Researchers have identified network effects as one of the major drivers for the adoption and diffusion of household technologies. However, the mechanisms and social contexts through which network effects induce technology adoption are unclear. In this paper, we investigate the adoption of household computers using the dataset from the 1989-2003 Computer and Internet Supplement to the Current Population Surveys (CPS). We argue that social influence and learning play a dominant role in inducing the adoption of home computers, and workplaces and schools are important channels through which network effects take place. We find that recent adopters have a stronger impact than distant adopters on future computer adoptions. When the adoption rate is low, channels play a more important role, but their effects diminish as the adoption rate grows. We also find that diffusion channels are more effective for first-time adoption than for repeat purchases. Overall, our study provides important theoretical, policy, and managerial implications. 相似文献
48.
A very important problem in many wireless ad-hoc networks, including wireless sensor networks, is positioning or the determination of geographical locations of the wireless nodes. Positioning is used both in infrastructural aspects of sensor networks, like geographic routing and topology maintenance, and in applications like wildlife tracking. Connectivity-based positioning algorithms in mobile wireless systems are studied in this work. These algorithms compute node positions based only on the connectivity, i.e. the neighborhood information of each node. Many algorithms have been proposed for positioning in stationary node systems and bounds on positional error of algorithms have been derived. The design and analysis of positioning algorithms for mobile node systems is a more challenging problem. Node mobility increases the amount of positional information available to a positioning algorithm. The work in this paper establishes a bound on the positional error for connectivity-based algorithms in mobile systems. The formulation from the analysis is used to investigate the benefit of this additional positional information on reducing positional error. There is a limit to the usefulness of positional information from previous node positions due to movement. This captures an important performance tradeoff: historical positional information can yield reduced positional error but requires more connectivity information from the network which requires greater computational resources. 相似文献
49.
We describe CHAMP (CHurn Analysis, Modeling, andPrediction), an automated system for modeling cellularsubscriber churn that is predicting which customerswill discontinue cellular phone service. We describevarious issues related to developing and deployingthis system including automating data access from aremote data warehouse, preprocessing, featureselection, model validation, and optimization toreflect business tradeoffs. Using data from GTE'sdata warehouse for cellular phone customers, CHAMP iscapable of developing churn models customized byregion for over one hundred GTE cellular phone marketstotaling over 5 million customers. Every month churnfactors are identified for each geographic region andmodels are updated to generate churn scores predictingwho is likely to churn in the short term. Learningmethods such as decision trees and genetic algorithmsare used for feature selection and a cascade neuralnetwork is used for predicting churn scores. Inaddition to producing churn scores, CHAMP alsoproduces qualitative results in the form of rules andcomparison of market trends that are disseminatedthrough a web based interface. 相似文献
50.
The contribution of this paper is threefold. First, we present the paradigm of snap-stabilization. A snap- stabilizing protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves
according to its specification. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes
in 0 rounds). Second, we propose a new Propagation of Information with Feedback (PIF) cycle, called Propagation of Information with Feedback and Cleaning (). We show three different implementations of this new PIF. The first one is a basic cycle which is inherently snap-stabilizing. However, the first PIF cycle can be delayed O(h
2) rounds (where h is the height of the tree) due to some undesirable local states. The second algorithm improves the worst delay of the basic
algorithm from O(h
2) to 1 round. The state requirement for the above two algorithms is 3 states per processor, except for the root and leaf processors
that use only 2 states. Also, they work on oriented trees. We then propose a third snap-stabilizing PIF algorithm on un-oriented
tree networks. The state requirement of the third algorithm depends on the degree of the processors, and the delay is at most
h rounds. Next, we analyze the maximum waiting time before a PIF cycle can be initiated whether the PIF cycle is infinitely
and sequentially repeated or launch as an isolated PIF cycle. The analysis is made for both oriented and un-oriented trees.
We show or conjecture that the two best of the above algorithms produce optimal waiting time. Finally, we compute the minimal
number of states the processors require to implement a single PIF cycle, and show that both algorithms for oriented trees
are also (in addition to being time optimal) optimal in terms of the number of states.
WARNING: The concept of snap-stabilization was first introduced in [12]. The concept evolved over the last eight years. We
take this evolution in consideration in this paper, which includes the early results published in [10] and [12]. In particular,
infinite repetition of computation cycles is a requirement of self-stabilizing systems. This is not required in snap-stabilization because snap-stabilization ensures that the first completed computation cycle is executed according to the
specification of the problem. The correctness proofs conform to this basic property. 相似文献