首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1551篇
  免费   111篇
  国内免费   16篇
电工技术   42篇
综合类   5篇
化学工业   377篇
金属工艺   44篇
机械仪表   66篇
建筑科学   71篇
矿业工程   1篇
能源动力   136篇
轻工业   123篇
水利工程   17篇
石油天然气   21篇
无线电   127篇
一般工业技术   316篇
冶金工业   68篇
原子能技术   6篇
自动化技术   258篇
  2024年   4篇
  2023年   29篇
  2022年   42篇
  2021年   98篇
  2020年   76篇
  2019年   100篇
  2018年   126篇
  2017年   137篇
  2016年   107篇
  2015年   91篇
  2014年   105篇
  2013年   169篇
  2012年   96篇
  2011年   117篇
  2010年   79篇
  2009年   74篇
  2008年   45篇
  2007年   32篇
  2006年   24篇
  2005年   19篇
  2004年   10篇
  2003年   13篇
  2002年   12篇
  2001年   11篇
  2000年   7篇
  1999年   5篇
  1998年   7篇
  1997年   5篇
  1996年   2篇
  1995年   5篇
  1994年   5篇
  1992年   3篇
  1991年   1篇
  1990年   1篇
  1989年   1篇
  1988年   3篇
  1987年   3篇
  1986年   1篇
  1985年   2篇
  1982年   4篇
  1981年   1篇
  1980年   2篇
  1979年   1篇
  1976年   3篇
排序方式: 共有1678条查询结果,搜索用时 31 毫秒
11.
12.
The notion of extended filter of a filter associated to a subset of Rl-monoids is defined and related properties are investigated. Rachunek and Salounova proved that positive implicative filters and Boolean filters in Rl-monoids coincide with a condition in Rachunek and Salounova (Acta Univ Palacki Olomuc Fac rer nat Math 48(1):93–107, 2009). In this paper, we prove that positive implicative filters and Boolean filters coincide without any condition and get some results on various types of filters.  相似文献   
13.
In this paper, an iterative algorithm is established for finding the generalized bisymmetric solution group to the coupled matrix equations (including the generalized (coupled) Lyapunov and Sylvester matrix equations as special cases). It is proved that proposed algorithm consistently converges to the generalized bisymmetric solution group for any initial generalized bisymmetric matrix group. Finally a numerical example indicates that proposed algorithm works quite effectively in practice.  相似文献   
14.
Iranian Polymer Journal - Effects of graphene oxide (GO) on various properties of rubber hybrid nanocomposites based on PVMQ/XNBR-g-GMA/XNBR (phenyl-vinyl-methyl-polysiloxane/carboxylated nitrile...  相似文献   
15.
Journal of Porous Materials - In this work, tris(hydroxymethyl)aminomethane-Zirconium complex supported on modified SBA-15 (SBA-15@n-Pr-THMAM-ZrO) prepared as a novel mesoporous catalyst. The...  相似文献   
16.
In cloud computing, services play key roles. Services are well defined and autonomous components. Nowadays, the demand of using Fuzzy inference as a service is increasing in the domain of complex and critical systems. In such systems, along with the development of the software, the cost of detecting and fixing software defects increases. Therefore, using formal methods, which provide clear, concise, and mathematical interpretation of the system, is crucial for the design of these Fuzzy systems. To obtain this goal, we introduce the Fuzzy Inference Cloud Service (FICS) and propose a novel discipline for formal modeling of the FICS. The FICS provides the service of Fuzzy inference to the consumers. We also introduce four novel formal verification tests, which allow strict analysis of certain behavioral disciplines in the FICS as follows: (1) Internal consistency, which analyzes the service in a strict and delicate manner; (2) Deadlock freeness; (3) Divergence freeness; and (4) Goal reach ability. The four tests are discussed and the FICS is verified to ensure that it can pass all these tests.  相似文献   
17.
The increasing demand on execution of large-scale Cloud workflow applications which need a robust and elastic computing infrastructure usually lead to the use of high-performance Grid computing clusters. As the owners of Cloud applications expect to fulfill the requested Quality of Services (QoS) by the Grid environment, an adaptive scheduling mechanism is needed which enables to distribute a large number of related tasks with different computational and communication demands on multi-cluster Grid computing environments. Addressing the problem of scheduling large-scale Cloud workflow applications onto multi-cluster Grid environment regarding the QoS constraints declared by application’s owner is the main contribution of this paper. Heterogeneity of resource types (service type) is one of the most important issues which significantly affect workflow scheduling in Grid environment. On the other hand, a Cloud application workflow is usually consisting of different tasks with the need for different resource types to complete which we call it heterogeneity in workflow. The main idea which forms the soul of all the algorithms and techniques introduced in this paper is to match the heterogeneity in Cloud application’s workflow to the heterogeneity in Grid clusters. To obtain this objective a new bi-level advanced reservation strategy is introduced, which is based upon the idea of first performing global scheduling and then conducting local scheduling. Global-scheduling is responsible to dynamically partition the received DAG into multiple sub-workflows that is realized by two collaborating algorithms: (1) The Critical Path Extraction algorithm (CPE) which proposes a new dynamic task overall critically value strategy based on DAG’s specification and requested resource type QoS status to determine the criticality of each task; and (2) The DAG Partitioning algorithm (DAGP) which introduces a novel dynamic score-based approach to extract sub-workflows based on critical paths by using a new Fuzzy Qualitative Value Calculation System to evaluate the environment. Local-scheduling is responsible for scheduling tasks on suitable resources by utilizing a new Multi-Criteria Advance Reservation algorithm (MCAR) which simultaneously meets high reliability and QoS expectations for scheduling distributed Cloud-base applications. We used the simulation to evaluate the performance of the proposed mechanism in comparison with four well-known approaches. The results show that the proposed algorithm outperforms other approaches in different QoS related terms.  相似文献   
18.
Although leather has a number of desirable properties such as thermal stability and fire retardancey, in addition to high toughness, it has a few drawbacks such as weight, high water absorption, poor soil and rot resistance, and nonuniformity. If these defects are overcome, leather's usefulness would be further enhanced and its competitive position with respect to synthetics would increase. This study reports the physical and mechanical properties of buffalo leather after chemical graft copolymerization with ethyl acrylate, butyl acrylate, and 2‐ethyl hexyl acrylate using benzoyl peroxide as an initiator. The optimum conditions for grafting (e.g., monomer and initiator concentrations, temperature and time of grafting, and solvent leather ratio) were extensively investigated. The study achieved outstanding properties for buffalo leather in reduction of water uptake after grafting, especially on using 2‐ethyl hexyl acrylate and butyl acrylate monomers. FT‐IR and solid 13C‐NMR for leather before and after grafting confirmed the grafting process.© 2003 Wiley Periodicals, Inc. J Appl Polym Sci 89: 1478–1483, 2003  相似文献   
19.
Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even the simplest network settings. Estimating probabilities associated with rare events has been a topic of great importance in queueing theory, and in applied probability at large. In this article, we analyse the performance of an importance sampling estimator for a rare event probability in a Jackson network. This article carries out strict deadlines to a two-node Jackson network with feedback whose arrival and service rates are modulated by an exogenous finite state Markov process. We have estimated the probability of network blocking for various sets of parameters, and also the probability of missing the deadline of customers for different loads and deadlines. We have finally shown that the probability of total population overflow may be affected by various deadline values, service rates and arrival rates.  相似文献   
20.
Virtualization is the cornerstone of the developing third-party compute industry, allowing cloud providers to instantiate multiple virtual machines (VMs) on a single set of physical resources. Customers utilize cloud resources alongside unknown and untrusted parties, creating the co-resident threat—unless perfect isolation is provided by the virtual hypervisor, there exists the possibility for unauthorized access to sensitive customer information through the exploitation of covert side channels. This paper presents co-resident watermarking, a traffic analysis attack that allows a malicious co-resident VM to inject a watermark signature into the network flow of a target instance. This watermark can be used to exfiltrate and broadcast co-residency data from the physical machine, compromising isolation without reliance on internal side channels. As a result, our approach is difficult to defend against without costly underutilization of the physical machine. We evaluate co-resident watermarkingunder a large variety of conditions, system loads and hardware configurations, from a local laboratory environment to production cloud environments (Futuregrid and the University of Oregon’s ACISS). We demonstrate the ability to initiate a covert channel of 4 bits per second, and we can confirm co-residency with a target VM instance in $<$ 10 s. We also show that passive load measurement of the target and subsequent behavior profiling is possible with this attack. We go on to consider the detectability of co-resident watermarking, extending our scheme to create a subtler watermarking attack by imitating legitimate cloud customer behavior. Our investigation demonstrates the need for the careful design of hardware to be used in the cloud.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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