全文获取类型
收费全文 | 159篇 |
免费 | 9篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 1篇 |
化学工业 | 29篇 |
金属工艺 | 5篇 |
机械仪表 | 5篇 |
建筑科学 | 9篇 |
矿业工程 | 2篇 |
能源动力 | 5篇 |
轻工业 | 9篇 |
水利工程 | 2篇 |
石油天然气 | 2篇 |
无线电 | 18篇 |
一般工业技术 | 34篇 |
冶金工业 | 13篇 |
自动化技术 | 35篇 |
出版年
2024年 | 2篇 |
2023年 | 2篇 |
2022年 | 2篇 |
2021年 | 7篇 |
2020年 | 2篇 |
2019年 | 4篇 |
2018年 | 8篇 |
2017年 | 9篇 |
2016年 | 9篇 |
2015年 | 4篇 |
2014年 | 7篇 |
2013年 | 14篇 |
2012年 | 9篇 |
2011年 | 13篇 |
2010年 | 10篇 |
2009年 | 7篇 |
2008年 | 10篇 |
2007年 | 7篇 |
2006年 | 8篇 |
2005年 | 8篇 |
2004年 | 7篇 |
2003年 | 4篇 |
2002年 | 3篇 |
1999年 | 3篇 |
1998年 | 1篇 |
1996年 | 2篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1985年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1971年 | 1篇 |
1937年 | 1篇 |
排序方式: 共有169条查询结果,搜索用时 109 毫秒
1.
2.
Jared Bon Christan Grant Josh Imbriani Erik Holbrook 《International Journal of Software and Informatics》2016,10(3)
In this paper, we describe our progress in creating the framework for an
interactive application that allows humans to actively participate in a t-SNE clustering
process. t-SNE (t-Distributed Stochastic Neighbor Embedding) is a dimensionality
reduction technique that maps high dimensional data sets to lower dimensions that can
then be visualized for human interpretation. By prompting users to monitor outlying
points during the t-SNE clustering process, we hypothesize that users may be able to make
clustering faster and more accurate than purely algorithmic methods. Further research
would test these hypotheses directly. We would also attempt to decrease the lag time
between the various components of our application and develop an intuitive approach for
humans to aid in clustering unlabeled data. Research into human assisted clustering can
combine the strengths of both humans and computer programs to improve the results of
data analysis. 相似文献
3.
It is now a well-known fact that the phase of electron waves is altered by external magnetic fields via the Aharonov-Bohm effect. This implies that any electron interference effects will be to some degree affected by the presence of such fields. In this study we examine the distortion effects of external (constant and variable) magnetic fields on electron interference and holography. For digital holography, the reconstruction of the object is done via numerical calculations and this leaves the door open for correcting phase distortions in the hologram reconstruction. We design and quantitatively assess such correction schemes, which decidedly depend on our knowledge of the magnetic field values in the holographic recording process. For constant fields of known value we are able to correct for magnetic distortions to a great extent. We find that variable fields are more destructive to the holographic process than constant fields. We define two criteria, related respectively to global and local contrast of the hologram to establish the maximum allowed external field which does not significantly hinder the accuracy of in-line holographic microscopy with electrons. 相似文献
4.
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k≥2, is NP-hard [F. Blanchet-Sadri, R. Jungers, J. Palumbo, Testing avoidability on sets of partial words is hard, Theoret. Comput. Sci. 410 (2009) 968-972]. Building on their work, we analyze in this paper the complexity of natural variations on the problem. While some of them are NP-hard, others are shown to be efficiently decidable. Using some combinatorial properties of de Bruijn graphs, we establish a correspondence between lengths of cycles in such graphs and periods of avoiding words, resulting in a tight bound for periods of avoiding words. We also prove that Avoidability can be solved in polynomial space, and reduces in polynomial time to the problem of deciding the avoidability of a finite set of partial words of equal length over the binary alphabet. We give a polynomial bound on the period of an infinite avoiding word, in the case of sets of full words, in terms of two parameters: the length and the number of words in the set. We give a polynomial space algorithm to decide if a finite set of partial words is avoided by a non-ultimately periodic infinite word. The same algorithm also decides if the number of words of length n avoiding a given finite set of partial words grows polynomially or exponentially with n. 相似文献
5.
Amir Yair Danilov Claudiu Dolev Danny Kirsch Jonathan Lane John Nita-Rotaru Cristina Olsen Josh Zage David 《Dependable and Secure Computing, IEEE Transactions on》2010,7(1):80-93
This paper presents the first hierarchical Byzantine fault-tolerant replication architecture suitable to systems that span multiple wide-area sites. The architecture confines the effects of any malicious replica to its local site, reduces message complexity of wide-area communication, and allows read-only queries to be performed locally within a site for the price of additional standard hardware. We present proofs that our algorithm provides safety and liveness properties. A prototype implementation is evaluated over several network topologies and is compared with a flat Byzantine fault-tolerant approach. The experimental results show considerable improvement over flat Byzantine replication algorithms, bringing the performance of Byzantine replication closer to existing benign fault-tolerant replication techniques over wide area networks. 相似文献
6.
7.
Josh Tenenberg Wolff-Michael Roth David Socha 《Computer Supported Cooperative Work (CSCW)》2016,25(4-5):235-278
Awareness is one of the central concepts in Computer Supported Cooperative Work, though it has often been used in several different senses. Recently, researchers have begun to provide a clearer conceptualization of awareness that provides concrete guidance for the structuring of empirical studies of awareness and the development of tools to support awareness. Such conceptions, however, do not take into account newer understandings of shared intentionality among cooperating actors that recently have been defined by philosophers and empirically investigated by psychologists and psycho-linguists. These newer conceptions highlight the common ground and socially recursive inference that underwrites cooperative behavior. And it is this inference that is often seamlessly carried out in collocated work, so easy to take for granted and hence overlook, that will require computer support if such work is to be partially automated or carried out at a distance. Ignoring the inferences required in achieving common ground may thus focus a researcher or designer on surface forms of “heeding” that miss the underlying processes of intention shared in and through activity that are critical for cooperation to succeed. Shared intentionality thus provides a basis for reconceptualizing awareness in CSCW research, building on and augmenting existing notions. In this paper, we provide a philosophically grounded conception of awareness based on shared intentionality, demonstrate how it accounts for behavior in an empirical study of two individuals in collocated, tightly-coupled work, and provide implications of this conception for the design of computational systems to support tightly-coupled collaborative work. 相似文献
8.
Kate Sanders Sally Fincher Dennis Bouvier Gary Lewandowski Briana Morrison Laurie Murphy Marian Petre Brad Richards Josh Tenenberg Lynda Thomas Richard Anderson Ruth Anderson Sue Fitzgerald Alicia Gutschow Susan Haller Raymond Lister Renée McCauley John McTaggart Christine Prasad Terry Scott Dermot Shinners-Kennedy Suzanne Westbrook Carol Zander 《Expert Systems》2005,22(3):121-128
Abstract: This paper presents a case study of the use of a repeated single‐criterion card sort with an unusually large, diverse participant group. The study, whose goal was to elicit novice programmers' knowledge of programming concepts, involved over 20 researchers from four continents and 276 participants drawn from 20 different institutions. In this paper we present the design of the study and the unexpected result that there were few discernible systematic differences in the population. The study was one of the activities of the National Science Foundation funded Bootstrapping Research in Computer Science Education project (2003). 相似文献
9.
Ken C.K. Lee Josh Schiffman Baihua Zheng Wang-Chien Lee Hong Va Leong 《Journal of Systems and Software》2007,80(12):2063-2076
This paper presents “Round-Eye”, a system for tracking nearest surrounding objects (or nearest surrounders) in moving object environments. This system provides a platform for surveillance applications. The core part of this system is continuous nearest surrounder (NS) query that maintains views of the nearest objects at distinct angles from query points. This query differs from conventional spatial queries such as range queries and nearest neighbor queries as NS query considers both distance and angular aspects of objects with respect to a query point at the same time. In our system framework, a centralized server is dedicated (1) to collect location updates of both objects and queries, (2) to determine which NS queries are invalidated in presence of object/query location changes and corresponding result changes if any, and (3) to refresh the affected query answers. To enhance the system performance in terms of processing time and network bandwidth consumption, we propose various techniques, namely, safe region, partial query reevaluation, and incremental query result update. Through simulations, we evaluate our system with the proposed techniques over a wide range of settings. 相似文献
10.
This paper presents a high-speed real-time plane fitting implementation on a field-programmable gate array (FPGA) platform. A novel hardware-based least squares algorithm fits planes to patches of points within a depth image captured using a Microsoft Kinect v2 sensor. The validity of a plane fit and the plane parameters are reported for each patch of 11 by 11 depth pixels. The high level of parallelism of operations in the algorithm has allowed for a fast, low-latency hardware implementation on an FPGA that is capable of processing depth data at a rate of 480 frames per second. A hybrid hardware–software end-to-end system integrates the hardware solution with the Kinect v2 sensor via a computer and PCI express communication link to a Terasic TR4 FPGA development board. We have also implemented two proof-of-concept object detection applications as future candidates for bionic vision systems. We show that our complete end-to-end system is capable of running at 60 frames per second. An analysis and characterisation of the Kinect v2 sensor errors has been performed in order to specify logic precision requirements, statistical testing of the validity of a plane fit, and achievable plane fitting angle resolution. 相似文献