首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   90篇
  免费   2篇
  国内免费   1篇
工业技术   93篇
  2024年   2篇
  2023年   1篇
  2021年   1篇
  2019年   2篇
  2018年   1篇
  2017年   1篇
  2016年   4篇
  2015年   1篇
  2014年   2篇
  2013年   5篇
  2012年   1篇
  2011年   4篇
  2010年   3篇
  2009年   5篇
  2008年   3篇
  2007年   6篇
  2006年   1篇
  2005年   3篇
  2004年   2篇
  2002年   3篇
  2001年   3篇
  2000年   1篇
  1999年   1篇
  1998年   3篇
  1997年   7篇
  1996年   2篇
  1995年   4篇
  1994年   2篇
  1993年   1篇
  1992年   3篇
  1991年   1篇
  1990年   1篇
  1989年   3篇
  1988年   1篇
  1987年   1篇
  1981年   1篇
  1980年   1篇
  1978年   2篇
  1972年   1篇
  1971年   1篇
  1968年   2篇
排序方式: 共有93条查询结果,搜索用时 15 毫秒
1.
Wang  Lijing  Chen  Jiangzhuo  Marathe  Achla 《World Wide Web》2019,22(6):2997-3020
World Wide Web - Infectious diseases such as Influenza and Ebola pose a serious threat to everyone but certain demographics and cohorts face a higher risk of infection than others. This research...  相似文献   
2.
3.
ABSTRACT

A primary goal for human-autonomy integration (HAI) is to balance the strengths of human and autonomy in order to achieve performance objectives more efficiently and robustly than either the human or autonomous agents would independently. This paper proposes the Privileged Sensing Framework (PSF) as a novel approach to HAI. This approach is based on the concept of dynamically ‘privileging’ information during the process of integration by dynamically bestowing special rights based on the characteristics of each individual agent, the task context, and the performance goals. The proposed framework is tested through a series of simulation experiments that provide a clear demonstration of increased accuracy and throughput of human-autonomy performance. These proof-of-concept simulations provide initial evidence of the utility of the PSF. Continued development of this approach has the potential to revolutionise capabilities of multi-agent cooperative teams across a broad range of applications.  相似文献   
4.
We present polylogarithmic approximations for the R|prec|C max  and R|prec|∑ j w j C j problems, when the precedence constraints are “treelike”—i.e., when the undirected graph underlying the precedences is a forest. These are the first non-trivial generalizations of the job shop scheduling problem to scheduling with precedence constraints that are not just chains. These are also the first non-trivial results for the weighted completion time objective on unrelated machines with precedence constraints of any kind. We obtain improved bounds for the weighted completion time and flow time for the case of chains with restricted assignment—this generalizes the job shop problem to these objective functions. We use the same lower bound of “congestion + dilation”, as in other job shop scheduling approaches (e.g. Shmoys, Stein and Wein, SIAM J. Comput. 23, 617–632, 1994). The first step in our algorithm for the R|prec|C max  problem with treelike precedences involves using the algorithm of Lenstra, Shmoys and Tardos to obtain a processor assignment with the congestion + dilation value within a constant factor of the optimal. We then show how to generalize the random-delays technique of Leighton, Maggs and Rao to the case of trees. For the special case of chains, we show a dependent rounding technique which leads to a bicriteria approximation algorithm for minimizing the flow time, a notoriously hard objective function. A preliminary version of this paper appeared in the Proc. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 146–157, 2005. V.S. Anil Kumar supported in part by NSF Award CNS-0626964. Part of this work was done while at the Los Alamos National Laboratory, and supported in part by the Department of Energy under Contract W-7405-ENG-36. M.V. Marathe supported in part by NSF Award CNS-0626964. Part of this work was done while at the Los Alamos National Laboratory, and supported in part by the Department of Energy under Contract W-7405-ENG-36. Part of this work by S. Parthasarathy was done while at the Department of Computer Science, University of Maryland, College Park, MD 20742, and in part while visiting the Los Alamos National Laboratory. Research supported in part by NSF Award CCR-0208005 and NSF ITR Award CNS-0426683. Research of A. Srinivasan supported in part by NSF Award CCR-0208005, NSF ITR Award CNS-0426683, and NSF Award CNS-0626636.  相似文献   
5.
An approximate correlation for the solubility of helium in a variety of solvents over a wide range of temperatures is presented.  相似文献   
6.
Optimizing Message Passing Interface (MPI) point-to-point communication for large messages is of paramount importance since most communications in MPI applications are performed by such operations. Remote Direct Memory Access (RDMA) allows one-sided data transfer and provides great flexibility in the design of efficient communication protocols for large messages. However, achieving high point-to-point communication performance on RDMA-enabled clusters is challenging due to both the complexity in communication protocols and the impact of the protocol invocation scenario on the performance of a given protocol. In this work, we analyze existing protocols and show that they are not ideal in many situations, and propose to use protocol customization, that is, different protocols for different situations to improve MPI performance. More specifically, by leveraging the RDMA capability, we develop a set of protocols that can provide high performance for all protocol invocation scenarios. Armed with this set of protocols that can collectively achieve high performance in all situations, we demonstrate the potential of protocol customization by developing a trace-driven toolkit that allows the appropriate protocol to be selected for each communication in an MPI application to maximize performance. We evaluate the performance of the proposed techniques using micro-benchmarks and application benchmarks. The results indicate that protocol customization can out-perform traditional communication schemes by a large degree in many situations.  相似文献   
7.
Extension of shelf-life of whole-wheat flour by gamma radiation   总被引:1,自引:0,他引:1  
The effect of low-dose gamma irradiation (0.25–1.00 kGy) on pre-packed whole-wheat flour (atta) was assessed in terms of physico-chemical properties, nutritional quality, chapati-making quality and sensory attributes. Semi-pilot scale storage studies on irradiated pre-packed whole-wheat flour revealed that there was no adverse effect of irradiation and storage up to 6 months of whole-wheat flour treated at doses up to 1.00 kGy on total proteins, fat, carbohydrates, vitamin B1 and B2 content, colour index, sedimentation value, dough properties, total bacterial and mould count. Storage of wheat flour resulted in slight increase in moisture, free fatty acids, damaged starch, reducing sugars and slight decrease in gelatinization viscosity.
However, irradiation as such had no effect on any of these parameters. Irradiation at 0.25 kGy was sufficient to extend the shelf-life of atta up to 6 months without any significant change in the nutritional, functional attributes. Chapaties made from irradiated atta (0.25 kGy) were preferred even after 6 months storage, compared with the control.  相似文献   
8.
Arrays are a common and important class of data in many applications. Arrays can model data such as digital images, digital video, scientific and experimental data, matrices, and finite element grids. Although array manipulations are diverse and domain-specific, they often exhibit structural regularities. This paper describes an algorithm called sub-pushdown to trace data lineage in such array computations. Lineage tracing is a type of data-flow analysis that relates parts of a result array to those parts of the argument (base) arrays that have bearings on the result array parts. Sub-pushdown can be used to trace data lineage in array-manipulating computations expressed in the Array Manipulation Language (AML) that was introduced previously. Sub-pushdown has several useful features. First, the lineage computation is expressed as an AML query. Second, it is not necessary to evaluate the AML lineage query to compute the array data lineage. Third, sub-pushdown never gives false-negative answers. Sub-pushdown has been implemented as part of the ArrayDB prototype array database system that we have built.  相似文献   
9.
Gasketless flanged joints with metal to metal contact offer some advantages over gasketed joints such as lower weight and better fatigue life. Design of such joints is often based on finite element analyses, and complicated by the fact that the area of contact between the flanges changes upon application of loads. Such analyses can be done using commercial software, which can incorporate geometrical nonlinearities as well as contact nonlinearities. Engineering intuition suggests that the role of geometrical nonlinearities might be small for such problems. However, many engineers continue to use the fully nonlinear analyses. Our aim in this paper is simply to put on record that significant savings in time can be obtained by “turning off” geometric nonlinearities in such analyses, with negligible loss of accuracy. To this end, a nonautomated implementation of the basic ideas is first demonstrated for a simple geometry; more automated analyses for a more general geometry follow.  相似文献   
10.
Indium-doped zinc oxide (IZO) films were deposited on Corning 7059 substrates by the spray pyrolysis technique. To achieve higher electrical conductivity both the zinc acetate concentration and indium concentration in the solution were varied. The films were characterized for their structural and electrical properties. Film stability in H2 plasma was also checked for possible use in amorphous and microcrystalline silicon related fields. It was observed that the films can be sustained in a hydrogen plasma, and hence IZO films of high conductivity can be used for the development of amorphous and microcrystalline silicon solar cells.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号