首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   7097篇
  免费   364篇
  国内免费   53篇
电工技术   133篇
综合类   26篇
化学工业   1811篇
金属工艺   120篇
机械仪表   211篇
建筑科学   283篇
矿业工程   6篇
能源动力   464篇
轻工业   726篇
水利工程   76篇
石油天然气   115篇
无线电   653篇
一般工业技术   1149篇
冶金工业   337篇
原子能技术   83篇
自动化技术   1321篇
  2024年   24篇
  2023年   151篇
  2022年   320篇
  2021年   409篇
  2020年   296篇
  2019年   339篇
  2018年   425篇
  2017年   361篇
  2016年   357篇
  2015年   238篇
  2014年   322篇
  2013年   642篇
  2012年   359篇
  2011年   506篇
  2010年   354篇
  2009年   327篇
  2008年   288篇
  2007年   217篇
  2006年   201篇
  2005年   140篇
  2004年   111篇
  2003年   117篇
  2002年   90篇
  2001年   64篇
  2000年   73篇
  1999年   50篇
  1998年   77篇
  1997年   41篇
  1996年   49篇
  1995年   40篇
  1994年   36篇
  1993年   44篇
  1992年   36篇
  1991年   32篇
  1990年   31篇
  1989年   20篇
  1988年   35篇
  1987年   30篇
  1986年   20篇
  1985年   15篇
  1984年   27篇
  1983年   22篇
  1982年   23篇
  1981年   17篇
  1980年   20篇
  1979年   16篇
  1978年   17篇
  1976年   18篇
  1975年   19篇
  1974年   12篇
排序方式: 共有7514条查询结果,搜索用时 15 毫秒
111.

In this article, we will present a new set of hybrid polynomials and their corresponding moments, with a view to using them for the localization, compression and reconstruction of 2D and 3D images. These polynomials are formed from the Hahn and Krawtchouk polynomials. The process of calculating these is successfully stabilized using the modified recurrence relations with respect to the n order, the variable x and the symmetry property. The hybrid polynomial generation process is carried out in two forms: the first form contains the separable discrete orthogonal polynomials of Krawtchouk–Hahn (DKHP) and Hahn–Krawtchouk (DHKP). The latter are generated as the product of the discrete orthogonal Hahn and Krawtchouk polynomials, while the second form is the square equivalent of the first form, it consists of discrete squared Krawtchouk–Hahn polynomials (SKHP) and discrete polynomials of Hahn–Krawtchouk squared (SHKP). The experimental results clearly show the efficiency of hybrid moments based on hybrid polynomials in terms of localization property and computation time of 2D and 3D images compared to other types of moments; on the other hand, encouraging results have also been shown in terms of reconstruction quality and compression despite the superiority of classical polynomials.

  相似文献   
112.
Wireless Personal Communications - Software-defined networking (SDN) is widely perceived to simplify network management and monitoring. The introduction of the SDN model into wireless sensor...  相似文献   
113.
Numerical simulation has been performed to improve the performance of Cu2ZnSnS4 (CZTS) solar cells by replacing CdS with Zn1–xSnxO buffer layer. The influences of thickness, donor concentration and defect density of buffer layers on the performance of CZTS solar cells were investigated. It has been found that Zn1–xSnxO buffer layer for Sn content of 0.20 is better for CZTS solar cell. A higher efficiency can be achieved with thinner buffer layer. The optimized solar cell demonstrated a maximum power conversion efficiency of 13%.  相似文献   
114.
In this work, chaos game optimization (CGO), a robust optimization approach, is employed for efficient design of a novel cascade controller for four test systems with interconnected power systems (IPSs) to tackle load–frequency control (LFC) difficulties. The CGO method is based on chaos theory principles, in which the structure of fractals is seen via the chaotic game principle and the fractals’ self-similarity characteristics are considered. CGO is applied in LFC studies as a novel application, which reveals further research gaps to be filled. For practical implementation, it is also highly desirable to keep the controller structure simple. Accordingly, in this paper, a CGO-based controller of fractional-order (FO) proportional–integral–derivative–FO proportional–integral (FOPID–FOPI) controller is proposed, and the integral time multiplied absolute error performance function is used. Initially, the proposed CGO-based FOPID–FOPI controller is tested with and without the nonlinearity of the governor dead band for a two-area two-source model of a non-reheat unit. This is a common test system in the literature. A two-area multi-unit system with reheater–hydro–gas in both areas is implemented. To further generalize the advantages of the proposed scheme, a model of a three-area hydrothermal IPS including generation rate constraint nonlinearity is employed. For each test system, comparisons with relevant existing studies are performed. These demonstrate the superiority of the proposed scheme in reducing settling time, and frequency and tie-line power deviations.  相似文献   
115.
Identity management is based on the creation and management of user identities for granting access to the cloud resources based on the user attributes. The cloud identity and access management (IAM) grants the authorization to the end-users to perform different actions on the specified cloud resources. The authorizations in the IAM are grouped into roles instead of granting them directly to the end-users. Due to the multiplicity of cloud locations where data resides and due to the lack of a centralized user authority for granting or denying cloud user requests, there must be several security strategies and models to overcome these issues. Another major concern in IAM services is the excessive or the lack of access level to different users with previously granted authorizations. This paper proposes a comprehensive review of security services and threats. Based on the presented services and threats, advanced frameworks for IAM that provide authentication mechanisms in public and private cloud platforms. A threat model has been applied to validate the proposed authentication frameworks with different security threats. The proposed models proved high efficiency in protecting cloud platforms from insider attacks, single sign-on failure, brute force attacks, denial of service, user privacy threats, and data privacy threats.  相似文献   
116.
Riad  Rabia  Ros  Frédéric  hajji  Mohamed El  Harba  Rachid 《Applied Intelligence》2022,52(10):11592-11605

Background removal of an identity (ID) picture consists in separating the foreground (face, body, hair and clothes) from the background of the image. It is a necessary groundwork for all modern identity documents that also has many benefits for improving ID security. State of the art image processing techniques encountered several segmentation issues and offer only partial solutions. It is due to the presence of erratic components like hairs, poor contrast, luminosity variation, shadow, color overlap between clothes and background. In this paper, a knowledge infused approach is proposed that hybridizes smart image processing tasks and prior knowledge. The research is based on a divide and conquer strategy aiming at simulating the sequential attention of human when performing a manual segmentation. Knowledge is infused by considering the spatial relation between anatomic elements of the ID image (face feature, forehead, body and hair) as well as their “signal properties”. The process consists in first determining a convex hull around the person’s body including all the foreground while keeping very close to the contour between the background and the foreground. Then, a body map generated from biometric analysis associated to an automatic grab cut process is applied to reach a finer segmentation. Finally, a heuristic-based post-processing step consisting in correcting potential hair and fine boundary issues leads to the final segmentation. Experimental results show that the newly proposed architecture achieves better performances than tested current state-of-the-art methodologies including active contours, generalist popular deep learning techniques, and also two other ones considered as the smartest for portrait segmentation. This new technology has been adopted by an international company as its industrial ID foreground solution.

  相似文献   
117.
In this work, acrylic acid (AAc) monomer was grafted onto low-density polyethylene (LDPE) films by the direct method to obtain acid (LDPE-grafted poly(acrylic acid) (LDPE-g-PAAc)) graft copolymers. The presence of the grafted PAAc with COOH groups allows coupling with Fe2+/3+ ions. The stabilization of Fe3O4 particles onto the graft copolymers was done by in situ reduction of LDPE-g-PAAc/Fe2+/3+ with sodium borohydride (NaBH4) in aqueous solution. The LDPE-g-PAAc graft copolymer and LDPE-g-PAAc/Fe3O4 composite films were characterized by scanning electron microscopy (SEM), X-ray diffraction (XRD), thermogravimetric analysis (TGA), Fourier transform infrared spectroscopy (FT-IR), differential scanning calorimetry (DSC), and electron spin resonance (ESR). The synthesized composites exhibit excellent magnetic properties. The results indicated that the magnetic oxide (Fe3O4) was embedded and homogenously dispersed into the surfaces of the graft copolymer films as indicated by SEM. The FT-IR analysis clearly suggests that an AAc monomer was effectively grafted onto LDPE. The XRD studies elucidate the change in the crystallinity of the graft copolymers.
Graphical Abstract The procedures for magnetic film manufacture LDPE-g-PAAc/Fe3O4 using gamma irradiation technique
  相似文献   
118.
119.
In this paper, the problem of scheduling with agreements (SWA) is considered. In scheduling, this consists of a set of jobs non-preemptively on identical machines subject to constraints that only some specific jobs can be scheduled concurrently on different machines. These constraints are given by an agreement graph and the aim is to minimise the makespan. In the case of two machines we extend two NP-hardness results of SWA with processing times at most three that hold for bipartite agreement graphs to more general agreement graphs. Complexity results of SWA are established in the case of split and complement of bipartite graphs. We also present some approximation results for SWA.  相似文献   
120.
This article proposes to solve the problem of minimizing the total completion time in a two-machine permutation flowshop environment in which time delays between the machines are considered. For this purpose, an enumeration algorithm based on the branch-and-bound framework is developed, which includes new lower and upper bounds as well as dominance rules. The computational study shows that problems with up to 40 jobs can be solved in a reasonable amount of time.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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