首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10701篇
  免费   666篇
  国内免费   589篇
电工技术   574篇
技术理论   1篇
综合类   679篇
化学工业   992篇
金属工艺   260篇
机械仪表   687篇
建筑科学   260篇
矿业工程   27篇
能源动力   984篇
轻工业   112篇
水利工程   58篇
石油天然气   86篇
武器工业   53篇
无线电   1392篇
一般工业技术   1518篇
冶金工业   108篇
原子能技术   139篇
自动化技术   4026篇
  2024年   25篇
  2023年   140篇
  2022年   178篇
  2021年   254篇
  2020年   285篇
  2019年   251篇
  2018年   265篇
  2017年   355篇
  2016年   421篇
  2015年   438篇
  2014年   634篇
  2013年   764篇
  2012年   641篇
  2011年   909篇
  2010年   606篇
  2009年   714篇
  2008年   724篇
  2007年   733篇
  2006年   612篇
  2005年   497篇
  2004年   381篇
  2003年   410篇
  2002年   309篇
  2001年   184篇
  2000年   182篇
  1999年   143篇
  1998年   137篇
  1997年   121篇
  1996年   104篇
  1995年   71篇
  1994年   97篇
  1993年   68篇
  1992年   64篇
  1991年   37篇
  1990年   36篇
  1989年   28篇
  1988年   24篇
  1987年   13篇
  1986年   19篇
  1985年   17篇
  1984年   10篇
  1983年   15篇
  1982年   8篇
  1981年   7篇
  1980年   5篇
  1979年   4篇
  1978年   4篇
  1977年   6篇
  1976年   2篇
  1975年   2篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
1.
Although hybrid Petri net (HPN) is a popular formalism in modelling hybrid production systems, the HPN model of large scale systems gets substantially complicated for analysis and control due to large dimensionality of such systems. To overcome this problem, a typical approach is to decompose the net into subnets and then control the plant through hierarchical or decentralized structures. Although this concept has been widely discussed in the literature for discrete PNs, there is a lack of research for HPNs. In this paper, a new method of decomposition of first-order hybrid Petri nets (FOHPNs) is proposed first and then the hierarchical control of the subnets through a coordinator is introduced. The advantage of using the proposed approach is validated by an existing example. A sugar milling case study is analysed by using a decomposed FOHPN model and the optimization results are compared against the results of the approaches presented in other papers. Simulation results show not only an improvement in production rate, but also show the ability to control the plant online. In addition, by using the hierarchical control structure for an FOHPN model, it is possible to reduce the cost of communication links, improve the reliability of the system, maintain the plant locally, and partially redesign the system.  相似文献   
2.
Protein databases used in research are huge and still grow at a fast pace. Many comparisons need to be done when searching similar (homologous) sequences for a given query sequence in these databases. Comparing a query sequence against all sequences of a huge database using the well-known Smith–Waterman algorithm is very time-consuming. Hidden Markov Models pose an opportunity for reducing the number of entries of a database and also enable to find distantly homologous sequences. Fewer entries are achieved by clustering similar sequences in a Hidden Markov Model. Such an approach is used by the bioinformatics tool HHblits. To further reduce the runtime, HHblits uses two-level prefiltering to reduce the number of time-consuming Viterbi comparisons. Still, prefiltering is very time-consuming. Highly parallel architectures and huge bandwidth are required for processing and transferring the massive amounts of data. In this article, we present an approach exploiting the reconfigurable, hybrid computer architecture Convey HC-1 for migrating the most time-consuming part. The Convey HC-1 with four FPGAs and high memory bandwidth of up to 76.8 GB/s serves as the platform of choice. Other bioinformatics applications have already been successfully supported by the HC-1. Limited by FPGA size only, we present a design that calculates four first-level prefiltering scores per FPGA concurrently, i.e. 16 calculations in total. This score calculation for the query profile against database sequences is done by a modified Smith–Waterman scheme that is internally parallelized 128 times in contrast to the original Streaming ‘Single Instruction Multiple Data (SIMD)’ Extensions (SSE)-supported implementation where only 16-fold parallelism can be exploited and where memory bandwidth poses the limiting factor. Preloading the query profile, we are able to transform the memory-bound implementation to a compute- and resource-bound FPGA design. We tightly integrated the FPGA-based coprocessor into the hybrid computing system by employing task-parallelism for the two-level prefiltering. Despite much lower clock rates, the FPGAs outperform SSE-based execution for the calculation of the prefiltering scores by a factor of 7.9.  相似文献   
3.
Steganography is the science of hiding secret message in an appropriate digital multimedia in such a way that the existence of the embedded message should be invisible to anyone apart from the sender or the intended recipient. This paper presents an irreversible scheme for hiding a secret image in the cover image that is able to improve both the visual quality and the security of the stego-image while still providing a large embedding capacity. This is achieved by a hybrid steganography scheme incorporates Noise Visibility Function (NVF) and an optimal chaotic based encryption scheme. In the embedding process, first to reduce the image distortion and to increase the embedding capacity, the payload of each region of the cover image is determined dynamically according to NVF. NVF analyzes the local image properties to identify the complex areas where more secret bits should be embedded. This ensures to maintain a high visual quality of the stego-image as well as a large embedding capacity. Second, the security of the secret image is brought about by an optimal chaotic based encryption scheme to transform the secret image into an encrypted image. Third, the optimal chaotic based encryption scheme is achieved by using a hybrid optimization of Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) which is allowing us to find an optimal secret key. The optimal secret key is able to encrypt the secret image so as the rate of changes after embedding process be decreased which results in increasing the quality of the stego-image. In the extracting process, the secret image can be extracted from the stego-image losslessly without referring to the original cover image. The experimental results confirm that the proposed scheme not only has the ability to achieve a good trade-off between the payload and the stego-image quality, but also can resist against the statistics and image processing attacks.  相似文献   
4.
We introduce a new architecture for the design of a tool for modeling and simulation of continuous and hybrid systems. The environment includes a compiler based on Modelica, a modular and a causal standard specification language for physical systems modeling (the tool supports models composed using certain component classes defined in the Modelica Standard Library, and the instantiation, parameterization and connection of these MSL components are described using a subset of Modelica). Models are defined in Modelica and are translated into DEVS models. DEVS theory (originally defined for modeling and simulation of discrete event systems) was extended in order to permit defining these of models. The different steps in the compiling process are show, including how to model these dynamic systems under the discrete event abstraction, including examples of model simulation with their execution results.  相似文献   
5.
A steelmaking-continuous casting (SCC) scheduling problem is an example of complex hybrid flow shop scheduling problem (HFSSP) with a strong industrial background. This paper investigates the SCC scheduling problem that involves controllable processing times (CPT) with multiple objectives concerning the total waiting time, earliness/tardiness and adjusting cost. The SCC scheduling problem with CPT is seldom discussed in the existing literature. This study is motivated by the practical situation of a large integrated steel company in which the just-in-time (JIT) and cost-cutting production strategy have become a significant concern. To address this complex HFSSP, the scheduling problem is decomposed into two subproblems: a parallel machine scheduling problem (PMSP) in the last stage and an HFSSP in the upstream stages. First, a hybrid differential evolution (HDE) algorithm combined with a variable neighborhood decomposition search (VNDS) is proposed for the former subproblem. Second, an iterative backward list scheduling (IBLS) algorithm is presented to solve the latter subproblem. The effectiveness of this bi-layer optimization approach is verified by computational experiments on well-designed and real-world scheduling instances. This study provides a new perspective on modeling and solving practical SCC scheduling problems.  相似文献   
6.
Industrialized white organic light-emitting diodes (OLEDs) currently require host-guest doping, a complicated process necessitating precise control of the guest concentration to get high efficiency and stability. Two doping-free, hybrid white OLEDs with fluorescent blue, and phosphorescent green and red emissive layers (EMLs) are reported in this work. An ultra-thin red phosphorescent EML was situated in a blue-emitting electron transport layer (ETL), while the ultra-thin green phosphorescent EML was placed either in the ETL (Device 1), or the hole transport layer (HTL) (Device 2). Device 2 exhibits higher efficiency and more stable spectrum due to the enhanced utilization of excitons by ultra-thin green EML at the exciton generation zone within the HTL. Values of current efficiency (CE), power efficiency (PE), and CRI obtained for the optimized hybrid white OLEDs fabricated through a doping-free process were of 23.2 cd/A, 20.5 lm/W and 82 at 1000 cd/m2, respectively.  相似文献   
7.
Greenish yellow organic light-emitting diodes (GYOLEDs) have steadily attracted researcher's attention since they are important to our life. However, their performance significantly lags behind compared with the three primary colors based OLEDs. Herein, for the first time, an ideal host-guest system has been demonstrated to accomplish high-performance phosphorescent GYOLEDs, where the guest concentration is as low as 2%. The GYOLED exhibits a forward-viewing power efficiency of 57.0 lm/W at 1000 cd/m2, which is the highest among GYOLEDs. Besides, extremely low efficiency roll-off and voltages are achieved. The origin of the high performance is unveiled and it is found that the combined mechanisms of host-guest energy transfer and direct exciton formation on the guest are effective to furnish the greenish yellow emission. Then, by dint of this ideal host-guest system, a simplified but high-performance hybrid white OLED (WOLED) has been developed. The WOLED can exhibit an ultrahigh color rendering index (CRI) of 92, a maximum total efficiency of 27.5 lm/W and a low turn-on voltage of 2.5 V (1 cd/m2), unlocking a novel avenue to simultaneously achieve simplified structure, ultrahigh CRI (>90), high efficiency and low voltage.  相似文献   
8.
针对传统的小区内开环功率控制算法通常以提升本小区的吞吐量性能为目标,忽略了当前小区用户对邻小区用户同频干扰的问题,为提升边缘用户性能的同时兼顾系统整体性能,提出了一种LTE系统小区间上行联合功率控制(UJPC)算法。该算法采用单基站三扇区为系统模型,以最优化系统吞吐量比例公平函数为目标,首先根据最小信干噪比(SINR)约束值和用户最大发射功率这两个约束条件得到相应的数学优化模型,然后采用连续凸近似的方法求解优化问题得出各个基站所管辖的小区内所有用户的最优发射功率。仿真结果表明,与基准的开环功控方案相比,联合功控方案在保证系统平均频谱利用率的情况下能够较大幅度地提高小区边缘频谱利用率,其最佳性能增益能达到50%。  相似文献   
9.
Depending on whether bidirectional links or unidirectional links are used for communications, the network topology under a given range assignment is either an undirected graph referred to as the bidirectional topology, or a directed graph referred to as the unidirectional topology. The Min-Power Bidirectional (resp., Unidirectional) k-Node Connectivity problem seeks a range assignment of minimum total power subject to the constraint that the produced bidirectional (resp. unidirectional) topology is k-vertex connected. Similarly, the Min-Power Bidirectional (resp., Unidirectional) k-Edge Connectivity problem seeks a range assignment of minimum total power subject to the constraint the produced bidirectional (resp., unidirectional) topology is k-edge connected. The Min-Power Bidirectional Biconnectivity problem and the Min-Power Bidirectional Edge-Biconnectivity problem have been studied by Lloyd et al. [23]. They show that range assignment based the approximation algorithm of Khuller and Raghavachari [18], which we refer to as Algorithm KR, has an approximation ratio of at most 2(2 – 2/n)(2 + 1/n) for Min-Power Bidirectional Biconnectivity, and range assignment based on the approximation algorithm of Khuller and Vishkin [19], which we refer to as Algorithm KV, has an approximation ratio of at most 8(1 – 1/n) for Min-Power Bidirectional Edge-Biconnectivity. In this paper, we first establish the NP-hardness of Min-Power Bidirectional (Edge-) Biconnectivity. Then we show that Algorithm KR has an approximation ratio of at most 4 for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity, and Algorithm KV has an approximation ratio of at most 2k for both Min-Power Bidirectional k-Edge Connectivity and Min-Power Unidirectional k-Edge Connectivity. We also propose a new simple constant-approximation algorithm for both Min-Power Bidirectional Biconnectivity and Min-Power Unidirectional Biconnectivity. This new algorithm applies only to Euclidean instances, but is best suited for distributed implementation. A preliminary version of this work appeared in the proceedings of the 2nd International Conference on AD-HOC Network and Wireless (Adhoc-Now 2003). Research performed in part while visiting the Max-Plank-Institut fur Informatik. Gruia Calinescu is an Assistant Professor of Computer Science at the Illinois Institute of Technology since 2000. He held postdoc or visiting researcher positions at DIMACS, University of Waterloo, and Max-Plank Institut fur Informatik. Gruia has a Diploma from University of Bucharest and a Ph.D. from Georgia Insitute of Technology. His research interests are in the area of algorithms. Peng-Jun Wan has joined the Computer Science Department at Illinois Institute of Technology in 1997 and has been an Associate Professor since 2004. He received his Ph.D. in Computer Science from University of Minnesota in 1997, M.S. in Operations Research and Control Theory from Chinese Academy of Science in 1993, and B.S. in Applied Mathematics from Tsinghua University in 1990. His research interests include optical networks and wireless networks.  相似文献   
10.
 A cell vertex finite volume method for the solution of steady compressible turbulent flow problems on unstructured hybrid meshes of tetrahedra, prisms, pyramids and hexahedra is described. These hybrid meshes are constructed by firstly discretising the computational domain using tetrahedral elements and then by merging certain tetrahedra. A one equation turbulence model is employed and the solution of the steady flow equations is obtained by explicit relaxation. The solution process is accelerated by the addition of a multigrid method, in which the coarse meshes are generated by agglomeration, and by parallelisation. The approach is shown to be effective for the simulation of a number of 3D flows of current practical interest. Sponsored by The Research Council of Norway, project number 125676/410 Dedicated to the memory of Prof. Mike Crisfield, a respected colleague  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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