全文获取类型
收费全文 | 131篇 |
免费 | 11篇 |
专业分类
电工技术 | 3篇 |
化学工业 | 43篇 |
金属工艺 | 1篇 |
机械仪表 | 3篇 |
建筑科学 | 1篇 |
矿业工程 | 2篇 |
能源动力 | 1篇 |
轻工业 | 17篇 |
水利工程 | 1篇 |
无线电 | 17篇 |
一般工业技术 | 11篇 |
冶金工业 | 3篇 |
原子能技术 | 6篇 |
自动化技术 | 33篇 |
出版年
2024年 | 1篇 |
2023年 | 5篇 |
2022年 | 10篇 |
2021年 | 12篇 |
2020年 | 5篇 |
2019年 | 4篇 |
2018年 | 9篇 |
2017年 | 9篇 |
2016年 | 7篇 |
2015年 | 3篇 |
2014年 | 1篇 |
2013年 | 11篇 |
2012年 | 6篇 |
2011年 | 8篇 |
2010年 | 5篇 |
2009年 | 8篇 |
2008年 | 5篇 |
2007年 | 3篇 |
2006年 | 2篇 |
2005年 | 1篇 |
2004年 | 1篇 |
2002年 | 1篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1998年 | 1篇 |
1997年 | 6篇 |
1996年 | 1篇 |
1995年 | 1篇 |
1994年 | 3篇 |
1993年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1985年 | 1篇 |
1984年 | 2篇 |
1983年 | 2篇 |
排序方式: 共有142条查询结果,搜索用时 31 毫秒
1.
Aishwarya
Srivastava Siddhant Aggarwal Amy Apon Edward Duffy Ken Kennedy Andre Luckow Brandon Posey Marcin Ziolkowski 《Software》2020,50(6):868-898
We investigate the challenges of building an end-to-end cloud pipeline for real-time intelligent visual inspection system for use in automotive manufacturing. Current methods of visual detection in automotive assembly are highly labor intensive, and thus prone to errors. An automated process is sought that can operate within the real-time constraints of the assembly line and can reduce errors. Components of the cloud pipeline include capture of a large set of high-definition images from a camera setup at the assembly location, transfer and storage of the images as needed, execution of object detection, and notification to a human operator when a fault is detected. The end-to-end execution must complete within a fixed time frame before the next car arrives in the assembly line. In this article, we report the design, development, and experimental evaluation of the tradeoffs of performance, accuracy, and scalability for a cloud system. 相似文献
2.
In this paper, we discuss a loop transformation framework that is based on integer non-singular matrices. The transformations
included in this framework are called Λ-transformations and include permutation, skewing and reversal, as well as a transformation
calledloop scaling. This framework is more general than existing ones; however, it is also more difficult to generate code in our framework.
This paper shows how integer lattice theory can be used to generate efficient code. An added advantage of our framework over
existing ones is that there is a simple completion algorithm which, given a partial transformation matrix, produces a full
transformation matrix that satisfies all dependences. This completion procedure has applications in parallelization and in
the generation of code for NUMA machines.
This work was supported by the Cornell Theory Center, NSF Presidential Young Investigator award #CCR-8958543. by NSF Grant
#CCR-9008526, and by a grant from the Hewlett-Packard Company. 相似文献
3.
The alkali hydrolysis of poly(ethylene terephthalate), anionic copolymer of poly(ethylene terephthalate), and block copolymer of poly(ethylene terephthalate)–poly(ethylene glycol) is investigated under a variety of conditions of alkali concentration in aqueous bath, additives, time, and temperature. Measurements of loss in weight, linear density, breaking load, tenacity, elongation to break apart from intrinsic viscosity, fiber density, COOH-end group content, diameter of filaments, and scanning electron micrographs have been analyzed to identify the differences in the action of alkali on these polymer materials. 相似文献
4.
We study dynamic routing in store-and-forward packet networks where each network link has bounded buffer capacity for receiving
incoming packets and is capable of transmitting a fixed number of packets per unit of time. At any moment in time, packets
are injected at various network nodes with each packet specifying its destination node. The goal is to maximize the throughput, defined as the number of packets delivered to their destinations.
In this paper, we make some progress on throughput maximization in various network topologies. Let n and m denote the number of nodes and links in the network, respectively. For line networks, we show that Nearest-to-Go (NTG), a
natural distributed greedy algorithm, is
-competitive, essentially matching a known
lower bound on the performance of any greedy algorithm. We also show that if we allow the online routing algorithm to make centralized decisions, there is a randomized
polylog(n)-competitive algorithm for line networks as well as for rooted tree networks, where each packet is destined for the root
of the tree. For grid graphs, we show that NTG has a competitive ratio of
while no greedy algorithm can achieve a ratio better than
. Finally, for arbitrary network topologies, we show that NTG is
-competitive, improving upon an earlier bound of O(mn).
An extended abstract appeared in the Proceedings of the 8th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005, Berkeley, CA, USA, pp. 1–13, Lecture Notes in Computer Science, vol. 1741, Springer, Berlin.
S. Angelov is supported in part by NSF Career Award CCR-0093117, NSF Award ITR 0205456 and NIGMS Award 1-P20-GM-6912-1.
S. Khanna is supported in part by an NSF Career Award CCR-0093117, NSF Award CCF-0429836, and a US-Israel Binational Science
Foundation Grant.
K. Kunal is supported in part by an NSF Career Award CCR-0093117 and NSF Award CCF-0429836. 相似文献
5.
Image fusion is an important technique which aims to produce a synthetic result by leveraging the cross information available in the existing data. Sparse Representation (SR) is a powerful signal processing theory used in wide variety of applications like image denoising, compression and fusion. Construction of a proper dictionary with reduced computational efficiency is a major challenge in these applications. Owing to the above criterion, we propose a supervised dictionary learning approach for the fusion algorithm. Initially, gradient information is obtained for each patch of the training data set. Then, the edge strength and information content are measured for the gradient patches. A selection rule is finally employed to select the patches with better focus features for training the over complete dictionary. By the above process, the number of input patches for dictionary training is reduced to a greater extent. At the fusion step, the globally learned dictionary is used to represent the given set of source image patches. Experimental results with various source image pairs demonstrate that the proposed fusion framework gives better visual quality and competes with the existing methodologies quantitatively. 相似文献
6.
Many mal-practices in stock market trading—e.g., circular trading and price manipulation—use the modus operandi of collusion. Informally, a set of traders is a candidate collusion set when they have “heavy trading” among themselves, as compared to their trading with others. We formalize the problem of detection of collusion sets, if any, in the given trading database. We show that naïve approaches are inefficient for real-life situations. We adapt and apply two well-known graph clustering algorithms for this problem. We also propose a new graph clustering algorithm, specifically tailored for detecting collusion sets. A novel feature of our approach is the use of Dempster–Schafer theory of evidence to combine the candidate collusion sets detected by individual algorithms. Treating individual experiments as evidence, this approach allows us to quantify the confidence (or belief) in the candidate collusion sets. We present detailed simulation experiments to demonstrate effectiveness of the proposed algorithms. 相似文献
7.
Fractal symbolic analysis is a symbolic analysis technique for verifying the legality of program transformations. It is strictly more powerful than dependence analysis; for example, it can be used to verify the legality of blocking LU factorization with pivoting, a task for which dependence analysis is inadequate. In this paper, we show how fractal symbolic analysis can be used to convert between left- and right-looking versions of three kernels of central importance in computational science: triangular solve, Cholesky factorization, and LU factorization with pivoting. 相似文献
8.
9.
Wireless Networks - Unmanned Aerial Vehicles (UAVs) deployed as flying base stations is a promising technology for enhancing the quality of service (QoS) and quick recovery from unexpected damages... 相似文献
10.
Kailas L. Wasewar Diwakar Shende Amit Keshav 《Journal of chemical technology and biotechnology (Oxford, Oxfordshire : 1986)》2011,86(2):319-323
Itaconic acid finds a place in various industrial applications. It can be produced by biocultivation in a clean and environment friendly route but recovery of the acid from the dilute stream of the bioreactor is an economic problem. Reactive extraction is a promising method to recover carboxylic acid but suffers from toxicity problems of the diluent and extractant employed. So there is need for a non‐toxic extractant and diluent or a combination of less toxic extractants in a non‐toxic diluent that can recover acid efficiently. Effect of different extractants: tri‐n‐butylphosphate (TBP) (an organophosporous compound) and Aliquat 336 (a quaternary amine) in sunflower oil was studied to find the best extractant–sunflower oil combination. Equilibrium complexation constant, KE, values of 1.789 and 2.385 m3 kmol?1, respectively, were obtained for itaconic acid extraction using TBP and Aliquat 336 in sunflower oil. The problem of toxicity in reactive extraction can be reduced by using a natural non‐toxic diluent (sunflower oil) with the extractant. Copyright © 2010 Society of Chemical Industry 相似文献