首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   128篇
  免费   4篇
化学工业   14篇
机械仪表   1篇
建筑科学   2篇
能源动力   1篇
轻工业   1篇
无线电   23篇
一般工业技术   12篇
冶金工业   24篇
原子能技术   6篇
自动化技术   48篇
  2023年   1篇
  2021年   7篇
  2020年   5篇
  2019年   1篇
  2018年   8篇
  2017年   2篇
  2016年   2篇
  2015年   3篇
  2014年   1篇
  2013年   4篇
  2012年   9篇
  2011年   2篇
  2010年   4篇
  2009年   2篇
  2008年   6篇
  2007年   3篇
  2006年   2篇
  2005年   2篇
  2004年   2篇
  2003年   5篇
  2002年   2篇
  2001年   5篇
  2000年   2篇
  1999年   2篇
  1998年   12篇
  1997年   2篇
  1996年   3篇
  1995年   3篇
  1994年   5篇
  1993年   5篇
  1990年   1篇
  1989年   4篇
  1988年   2篇
  1987年   1篇
  1986年   1篇
  1984年   2篇
  1983年   2篇
  1981年   1篇
  1980年   3篇
  1979年   1篇
  1977年   1篇
  1976年   1篇
排序方式: 共有132条查询结果,搜索用时 31 毫秒
1.
Prostate cancer requires the attention of social workers in health care for three reasons: the growing elderly population which will increase the number diagnosed, the recent introduction of new treatments and the lack of social acceptability for this condition. Interventions for prostate cancer are specific to the stage of the disease. These individual, family and group interventions are a model for social work services to elderly men with other forms of cancer. Social workers have opportunity to research quality of life and decision-making issues to enhance medical practise in prostate cancer.  相似文献   
2.
An instance of the path hitting problem consists of two families of paths, and ℋ, in a common undirected graph, where each path in ℋ is associated with a non-negative cost. We refer to and ℋ as the sets of demand and hitting paths, respectively. When p∈ℋ and share at least one mutual edge, we say that p hits q. The objective is to find a minimum cost subset of ℋ whose members collectively hit those of . In this paper we provide constant factor approximation algorithms for path hitting, confined to instances in which the underlying graph is a tree, a spider, or a star. Although such restricted settings may appear to be very simple, we demonstrate that they still capture some of the most basic covering problems in graphs. Our approach combines several novel ideas: We extend the algorithm of Garg, Vazirani and Yannakakis (Algorithmica, 18:3–20, 1997) for approximate multicuts and multicommodity flows in trees to prove new integrality properties; we present a reduction that involves multiple calls to this extended algorithm; and we introduce a polynomial-time solvable variant of the edge cover problem, which may be of independent interest. An extended abstract of this paper appeared in Proceedings of the 14th Annual European Symposium on Algorithms, 2006. This work is part of D. Segev’s Ph.D. thesis prepared at Tel-Aviv University under the supervision of Prof. Refael Hassin.  相似文献   
3.
B2B Procurement and Marketplace Transformation   总被引:2,自引:0,他引:2  
Emerging web technologies and systems have started a revolutionary path that will have a profound impact on procurement processes and systems, especially in the area of indirect procurement and the management of operating resources. In fact, what started as more narrowly focused procurement systems only a couple of years ago, has transformed into a web of technologies, markets, and business strategies that have ramifications well beyond the purchasing function. The focus of this paper is on the marketplace structure, functionality and capabilities of systems, and key factors that buyers need to take into consideration when transforming their procurement processes. Contents management, markets, standards, and outsourcing are important problems that are discussed in this paper.  相似文献   
4.
In this note, we consider the application of a velocity-free controller for attitude regulation of a rigid spacecraft with gas jet actuators when the effects of time-delays in the feedback loop are taken into consideration. Simple sufficient conditions for exponential stability are presented. Some structural properties of the resulting closed-loop system are studied, and relevant design tools are demonstrated.  相似文献   
5.
6.
Transfer matrix models have been frequently used to analyze the structural behavior of rods, including curved and pretwisted ones. The advantages of these models include their relative simplicity, numerical efficiency and ease of implementation. Previous investigations did not include nonlinear analyses of curved rods that undergo large deformations. The present paper describes a nonlinear transfer matrix model of curved and pretwisted rods, which is capable of analyzing very large spatial deformations. The rod is divided into segments. A body system of coordinates is attached to each segment. This system translates and rotates with the segment during the deformation. If the segments are kept small enough, the local deformations of each segment, relative to its body system of coordinates, are small. The segments’ systems of coordinates rotate relative to their neighbors and if this rotation is dealt with properly, large rotations and displacement of the curved rod can be analyzed. In spite of its nonlinear nature, the model remains relatively simple and efficient. The new model is used to solve a few problems and the results show very good agreement with other analytical, finite-element, and experimental results.  相似文献   
7.
We consider the problem of scheduling a set of pages on a single broadcast channel using time-multiplexing. In a perfectly periodic schedule, time is divided into equal size slots, and each page is transmitted in a time slot precisely every fixed interval of time (the period of the page). We study the case in which each page i has a given demand probability , and the goal is to design a perfectly periodic schedule that minimizes the average time a random client waits until its page is transmitted. We seek approximate polynomial solutions. Approximation bounds are obtained by comparing the costs of a solution provided by an algorithm and a solution to a relaxed (non-integral) version of the problem. A key quantity in our methodology is a fraction we denote by , that depends on the maximum demand probability: . The best known polynomial algorithm to date guarantees an approximation of . In this paper, we develop a tree-based methodology for perfectly periodic scheduling, and using new techniques, we derive algorithms with better bounds. For small values, our best algorithm guarantees approximation of . On the other hand, we show that the integrality gap between the cost of any perfectly periodic schedule and the cost of the fractional problem is at least . We also provide algorithms with good performance guarantees for large values of . Received: December 2001 / Accepted: September 2002  相似文献   
8.
In this work, we explored the relationship between the freely exchangeable Ca2+ (FECa2+) in the dense tubules (DT) and the sarco(endo)plasmic reticulum (SER) Ca2+-ATPase (SERCA) in circulating human platelets and examined the relationship between blood pressure (BP) and these platelet parameters. Studying platelets from 32 healthy men, we showed that the maximal reaction velocity (Vmax) of the SERCA significantly correlated with FECa2+ in the DT and with the protein expressions of SERCA 2 and 3. BP positively correlated with both the Vmax of the SERCA (r=.462, P=.010) and the FECa2+ sequestered in the DT (r=.492, P=.005). The relationships between these platelet Ca2+ parameters and BP were in part confounded by increased levels of serum triglycerides and diminished HDL cholesterol with a higher BP. No correlation was observed between the resting cytosolic Ca2+ and BP. Collectively, these findings indicate that (1) an increase in the cellular Ca2+ load in platelets is expressed by a higher activity of the SERCA and an increase in the expressions of SERCA 2 and 3 proteins, coupled with an increase in the FECa2+ in the DT, and (2) a higher BP is associated with an increase in platelet Ca2+ load in human beings, expressed by a rise in the FECa2+ in the DT and the upregulation of SERCA activity.  相似文献   
9.
Biosynthesis and stability of the mRNA population in DMSO-induced Friend erythroleukemic cells were studied after labeling the RNA with 3H-uridine and then chasing it with nonlabeled uridine. Globin RNA metabolism was studied by hybridization to excess complementary DNA convalently coupled to oligo(dT)-cellulose. After a labeling period of 120 min, 2-4% of the poly(A)-containing labeled RNA was in globin RNA; it decayed with a half-life of 16-17 hr. The rest of the poly(A)-containing RNA was composed to two kinetic populations: 85-90% decayed with a half-life of about 3 hr, while 10% decayed with a half-life of about 37 hr. The portion of globin RNA in labeled poly(A)-containing RNA behaved in an unexpected fashion during the chase period. During the initial chase period, the percentage of globin RNA increased rapidly, reaching a maximum of about 15% at 20 hr, but it subsequently declined gradually. Based on these findings, a model was built that describes the changes in the proportion of globin mRNA in poly(A)-containing RNA during continuous synthesis and after chase of the labeled RNA. It appears that if the parameters described remain constant during the maturation of erythroblasts, then this model would not account for the almost exclusive presence of globin RNA in the reticulocyte. By far the most effective way to achieve this high level of globin RNA is the destabilization of the mRNA population which is more stable than globin RNA, and not the stabilization of globin RNA itself.  相似文献   
10.
This article presents a general approach for employing lesion analysis to address the fundamental challenge of localizing functions in a neural system. We describe functional contribution analysis (FCA), which assigns contribution values to the elements of the network such that the ability to predict the network's performance in response to multilesions is maximized. The approach is thoroughly examined on neurocontroller networks of evolved autonomous agents. The FCA portrays a stable set of neuronal contributions and accurate multilesion predictions that are significantly better than those obtained based on the classical single lesion approach. It is also used for a detailed synaptic analysis of the neurocontroller connectivity network, delineating its main functional backbone. The FCA provides a quantitative way of measuring how the network functions are localized and distributed among its elements. Our results question the adequacy of the classical single lesion analysis traditionally used in neuroscience and show that using lesioning experiments to decipher even simple neuronal systems requires a more rigorous multilesion analysis.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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