首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   966篇
  免费   34篇
  国内免费   1篇
电工技术   16篇
化学工业   238篇
金属工艺   33篇
机械仪表   11篇
建筑科学   9篇
能源动力   41篇
轻工业   121篇
水利工程   5篇
石油天然气   7篇
无线电   153篇
一般工业技术   155篇
冶金工业   97篇
原子能技术   6篇
自动化技术   109篇
  2023年   7篇
  2022年   19篇
  2021年   26篇
  2020年   20篇
  2019年   19篇
  2018年   22篇
  2017年   22篇
  2016年   26篇
  2015年   16篇
  2014年   37篇
  2013年   71篇
  2012年   41篇
  2011年   42篇
  2010年   36篇
  2009年   43篇
  2008年   48篇
  2007年   42篇
  2006年   26篇
  2005年   22篇
  2004年   13篇
  2003年   24篇
  2002年   13篇
  2001年   16篇
  2000年   15篇
  1999年   19篇
  1998年   21篇
  1997年   26篇
  1996年   29篇
  1995年   19篇
  1994年   16篇
  1993年   28篇
  1992年   17篇
  1991年   16篇
  1990年   14篇
  1989年   14篇
  1988年   14篇
  1987年   11篇
  1986年   15篇
  1985年   12篇
  1984年   9篇
  1983年   3篇
  1982年   8篇
  1981年   10篇
  1980年   3篇
  1979年   3篇
  1978年   7篇
  1977年   3篇
  1973年   3篇
  1970年   3篇
  1968年   2篇
排序方式: 共有1001条查询结果,搜索用时 203 毫秒
31.
With the advent of multicores, multithreaded programming has acquired increased importance. In order to obtain good performance, the synchronization constructs in multithreaded programs need to be carefully implemented. These implementations can be broadly classified into two categories: busy–wait and schedule‐based. For shared memory architectures, busy–wait synchronizations are preferred over schedule‐based synchronizations because they can achieve lower wakeup latency, especially when the expected wait time is much shorter than the scheduling time. While busy–wait synchronizations can improve the performance of multithreaded programs running on multicore machines, they create a challenge in program debugging, especially in detecting and identifying the causes of data races. Although significant research has been done on data race detection, prior works rely on one important assumption—the debuggers are aware of all the synchronization operations performed during a program run. This assumption is a significant limitation as multithreaded programs, including the popular SPLASH‐2 benchmark have busy–wait synchronizations such as barriers and flag synchronizations implemented in the user code. We show that the lack of knowledge of these synchronization operations leads to unnecessary reporting of numerous races. To tackle this problem, we propose a dynamic technique for identifying user‐defined synchronizations that are performed during a program run. Both software and hardware implementations are presented. Furthermore, our technique can be easily exploited by a record/replay system to significantly speedup the replay. It can also be leveraged by a transactional memory system to effectively resolve a livelock situation. Our evaluation confirms that our synchronization detector is highly accurate with no false negatives and very few false positives. We further observe that the knowledge of synchronization operations results in 23% reduction in replay time. Finally, we show that using synchronization knowledge livelocks can be efficiently avoided during runtime monitoring of programs. Copyright © 2009 John Wiley & Sons, Ltd.  相似文献   
32.
33.
Selective oxidation reactions like the oxyfunctionalization of alkanes, hydroxylation of aromatics and sulfoxidation of thioethers have been carried out with dilute hydrogen peroxide over titanium and vanadium metallosilicate molecular sieves with MEL topology, viz., TS-2 and VS-2. Though both the catalysts possess similar activities, substantial differences in the product distribution are observed. The oxyfunctionalization of the primary carbon atoms of the alkanes and the oxidation of the methyl substituents of the aromatic hydrocarbons distinguish VS-2 from TS-2. Both the catalysts are found to be equally active in the hydroxylation of phenol, though they possess different activities in different solvents. In general, the oxidations are deeper over VS-2 than on TS-2.  相似文献   
34.
Dynamic slicing is a promising trace based technique that helps programmers in the process of debugging. In order to debug a failed run, dynamic slicing requires the dynamic dependence graph (DDG) information for that particular run. The two major challenges involved in utilizing dynamic slicing as a debugging technique are the efficient computation of the DDG and the efficient computation of the dynamic slice, given the DDG. In this paper, we present an efficient debugger, which first computes the DDG efficiently while the program is executing; dynamic slicing is later performed efficiently on the computed DDG, on demand. To minimize program slowdown during the online computation of DDG, we make the design decision of not outputting the computed dependencies to a file, instead, storing them in memory in a specially allocated fixed size circular buffer. The size of the buffer limits the length of the execution history that can be stored. To maximize the execution history that can be maintained, we introduce optimizations to eliminate the storage of most of the generated dependencies, at the same time ensuring that those that are stored are sufficient to capture the bug. Experiments conducted on CPU‐intensive programs show that our optimizations are able to reduce the trace rate from 16 to 0.8 bytes per executed instruction. This enables us to store the dependence trace history for a window of 20 million executed instructions in a 16‐MB buffer. Our debugger is also very efficient, yielding slicing times of around a second, and only slowing down the execution of the program by a factor of 19 during the online tracing step. Using recently proposed architectural support for monitoring, we are also able to handle multithreaded programs running on multicore processors. Copyright © 2011 John Wiley & Sons, Ltd.  相似文献   
35.
A common method for designing brain-computer Interface (BCI) is to use electroencephalogram (EEG) signals extracted during mental tasks. In these BCI designs, features from EEG such as power and asymmetry ratios from delta, theta, alpha, and beta bands have been used in classifying different mental tasks. In this paper, the performance of the mental task based BCI design is improved by using spectral power and asymmetry ratios from gamma (24-37 Hz) band in addition to the lower frequency bands. In the experimental study, EEG signals extracted during five mental tasks from four subjects were used. Elman neural network (ENN) trained by the resilient backpropagation algorithm was used to classify the power and asymmetry ratios from EEG into different combinations of two mental tasks. The results indicated that ((1) the classification performance and training time of the BCI design were improved through the use of additional gamma band features; (2) classification performances were nearly invariant to the number of ENN hidden units or feature extraction method.  相似文献   
36.
This paper presents modeling and simulation results of a modified copper-column-based flip-chip interconnect with ultrafine pitch for wafer-level packaging, and the process and prototyping procedure are described as well. This interconnect consists of multiple copper columns which are electrically in parallel and supporting a solder bump. A simple analytical model has been developed for correlation between the interconnect geometry and the thermal fatigue life. In comparison to the conventional single-copper-column (SCC) interconnects, numerical analysis reveals that the multi-copper-column (MCC) interconnect features enhanced compliances and, hence, higher thermomechanical reliability, while the associated electrical parasitics (R, L, and C) at dc and moderate frequencies are still kept low. Parametric studies reveal the effects of geometric parameters of MCC interconnects on both compliances and electrical parasitics, which in turn facilitate design optimization for best performance. By using coplanar waveguides (CPWs) as feed lines on both chip and package substrate, a high-frequency (up to 40 GHz) S-parameter analysis is conducted to investigate the transmission characteristics of the MCC interconnects within various scenarios which combines various interconnect pitches and common chip and package substrates. An equivalent lumped circuit model is proposed and the circuit parameters (R, L, C, and G) are obtained throughout a broad frequency range. Good agreement is achieved for the transmission characteristics between the equivalent lumped circuit model and direct simulation results.  相似文献   
37.
38.
A software architecture is presented that allows client application programs to interact with a DBMS server in a flexible and powerful way, using either direct, volatile messages, or messages sent via recoverable queues. Normal requests from clients to the server and replies from the server to clients can be transmitted using direct or recoverable messages. In addition, an application event notification mechanism is provided, whereby client applications running anywhere on the network can register for events, and when those events are raised, the clients are notified. A novel parameter passing mechanism allows a set of tuples to be included in an event notification. The event mechanism is particularly useful in an active DBMS, where events can be raised by triggers to signal running application programs. Received July 21, 1995 / Accepted May 30, 1996  相似文献   
39.
A full-length phytase gene (phy) of Aspergillus nidulans was amplified from the cDNA library by polymerase chain reaction (PCR), and it was introduced into a bacterial expression vector, pET-28a. The recombinant protein (rPhy-E, 56 kDa) was overexpressed in the insoluble fraction of Escherichia coli culture, purified by Ni-NTA resin under denaturing conditions and injected into rats as an immunogen. To express A. nidulans phytase in a plant, the full-length of phy was cloned into a plant expression binary vector, pPZP212. The resultant construct was tested for its transient expression by Agrobacterium-infiltration into Nicotiana benthamiana leaves. Compared with a control, the agro-infiltrated leaf tissues showed the presence of phy mRNA and its high expression level in N. benthamiana. The recombinant phytase (rPhy-P, 62 kDa) was strongly reacted with the polyclonal antibody against the nonglycosylated rPhy-E. The rPhy-P showed glycosylation, two pH optima (pH 4.5 and pH 5.5), an optimum temperature at 45~55 °C, thermostability and broad substrate specificities. After deglycosylation by peptide-N-glycosidase F (PNGase-F), the rPhy-P significantly lost the phytase activity and retained 1/9 of the original activity after 10 min of incubation at 45 °C. Therefore, the deglycosylation caused a significant reduction in enzyme thermostability. In animal experiments, oral administration of the rPhy-P at 1500 U/kg body weight/day for seven days caused a significant reduction of phosphorus excretion by 16% in rat feces. Besides, the rPhy-P did not result in any toxicological changes and clinical signs.  相似文献   
40.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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