全文获取类型
收费全文 | 1483篇 |
免费 | 61篇 |
国内免费 | 1篇 |
专业分类
电工技术 | 21篇 |
化学工业 | 355篇 |
金属工艺 | 37篇 |
机械仪表 | 43篇 |
建筑科学 | 26篇 |
能源动力 | 67篇 |
轻工业 | 102篇 |
水利工程 | 3篇 |
石油天然气 | 5篇 |
无线电 | 177篇 |
一般工业技术 | 304篇 |
冶金工业 | 167篇 |
原子能技术 | 20篇 |
自动化技术 | 218篇 |
出版年
2023年 | 13篇 |
2022年 | 45篇 |
2021年 | 44篇 |
2020年 | 45篇 |
2019年 | 29篇 |
2018年 | 67篇 |
2017年 | 51篇 |
2016年 | 54篇 |
2015年 | 36篇 |
2014年 | 57篇 |
2013年 | 126篇 |
2012年 | 61篇 |
2011年 | 61篇 |
2010年 | 54篇 |
2009年 | 85篇 |
2008年 | 43篇 |
2007年 | 51篇 |
2006年 | 49篇 |
2005年 | 34篇 |
2004年 | 30篇 |
2003年 | 28篇 |
2002年 | 22篇 |
2001年 | 12篇 |
2000年 | 26篇 |
1999年 | 21篇 |
1998年 | 50篇 |
1997年 | 25篇 |
1996年 | 37篇 |
1995年 | 19篇 |
1994年 | 20篇 |
1993年 | 24篇 |
1992年 | 19篇 |
1991年 | 11篇 |
1990年 | 11篇 |
1989年 | 12篇 |
1988年 | 11篇 |
1987年 | 9篇 |
1986年 | 8篇 |
1985年 | 15篇 |
1984年 | 14篇 |
1983年 | 13篇 |
1982年 | 10篇 |
1981年 | 8篇 |
1980年 | 16篇 |
1979年 | 14篇 |
1978年 | 12篇 |
1977年 | 9篇 |
1976年 | 10篇 |
1975年 | 7篇 |
1974年 | 5篇 |
排序方式: 共有1545条查询结果,搜索用时 31 毫秒
21.
Normal modes of vibration of syndiotactic polypropylene (sPP) and their dispersion are obtained in the reduced zone scheme for helical form I having the conformational sequence (t2g2) using Urey-Bradley force field and Wilson's GF matrix method as modified by Higgs. Optically active frequencies corresponding to the zone center and zone boundary are assigned and characteristic features of the dispersion curves are discussed. In general the dispersion in the helical form is less as compared to the planar form. Heat capacity has been calculated via density-of-states using Debye relation in the temperature range 10-460 K and compared with the experimental measurements. 相似文献
22.
Huddar Mahesh G. Sannakki Sanjeev S. Rajpurohit Vijay S. 《Multimedia Tools and Applications》2021,80(9):13077-13077
Multimedia Tools and Applications - A Correction to this paper has been published: https://doi.org/10.1007/s11042-021-10591-y 相似文献
23.
Suruchi Poddar Piyush Sunil Agarwal Ajay Kumar Sahi Neelima Varshney Kiran Yellappa Vajanthri Sanjeev Kumar Mahto 《应用聚合物科学杂志》2021,138(24):50569
The present study reports for first time the blending of psyllium husk (PH) powder/gelatin (G) in the polymer-rich composition of polyvinyl alcohol (PVA) to make an electrospinnable solution. The composite was prepared in 3 different ratios viz., 100% (wt/wt) (PVA + PH), 75% + 25% (PVA + 75PH + 25G) (wt/wt) and 50% + 50% (PVA + 50PH + 50G) (wt/wt) in 6% PVA solution. Optimum electrospinning parameters were evaluated for all the prepared blends. The fabricated nanofibers were characterized by scanning electron microscopy (SEM), attenuated total reflectance-Fourier transform infrared, differential scanning calorimetry, porosity percentage, and fiber orientation using ImageJ software. A qualitative in vitro degradation study at room temperature is supported by SEM images. The cellular interactions were characterized by MTT assay of NIH-3T3 fibroblast cells for 2 and 4 days with an optimum cell growth of >50% by fourth day of culture and long-term cultivation of L929-RFP cells was observed for 10 days. The nanofibers were formed in the range of 49–600 nm. PVA + 75PH + 25G when cultured with L929-RFP cells exhibited highest fluorescence intensity and thus supported cellular proliferation significantly. Based on the results obtained from various analyses, we anticipate that fabricated psyllium-based nanofiber can be used as a promising candidate for wound healing and other biomedical applications. 相似文献
24.
25.
Accuracy improvement method for flank milling surface design 总被引:2,自引:2,他引:0
Chenggang Li Sanjeev Bedi Stephen Mann 《The International Journal of Advanced Manufacturing Technology》2008,38(3-4):218-228
In this paper, a variation of the method of designing surfaces for flank milling proposed by Li et al. 2006 (Surface design for flank milling. Submitted to CAD, July) is presented. Li’s method is based on the premise that the surface flank milled by a cylindrical tool can be represented by a NURBS surface and can be used by designers to build efficient impellers, blades and other engineering parts. In the proposed method, a four control point curve is used to approximate the grazing curves and for subsequent generation of a polynomial surface. This eliminates the need of weights for the interior control points and still results in a good surface. The accuracy of the surface can be controlled by adding control points. Examples are given to demonstrate the proposed surface design method. 相似文献
26.
The present research is the first type of study in which the application of powder mixed electrical discharge machining (PMEDM) for the machining of β-phase titanium (β-Ti) alloy has been proposed. β-Ti alloys are new range of titanium alloys, which has a wide-spread application in dental, orthopedics, shape memory, and stents. The aim of the present study is to fabricate submicro- and nanoscale topography by PMEDM process to enhance the biocompatibility without affecting machining efficiency. The effect of Si powder concentration along with pulse current and duration on the surface and machining characteristics has been investigated. A significant decrease in surface crack density on the machined surface with 4 g/l Si powder concentration was observed. When β-Ti alloy was modified at 15 A pulse current, longer pulse interval with 8 g/l concentration of Si powder particles, the interconnected surface porosities with pore size 200–500 nm was observed. Moreover, at Si powder concentrations of 2 g/l and 4 g/l, the recast layer thickness is 8 µm and 2–3 µm, respectively. Elemental mapping analysis confirmed that PMEDM also generated carbides and oxides enriched surface, a favorable surface chemistry to enhance the biocompatibility of β-Ti alloy. Furthermore, PMEDM also enhances the machining performance by improving material removal rate and reducing tool wear rate. 相似文献
27.
Sanjeev K Srivastava Alireza Aghajamali 《Journal of Superconductivity and Novel Magnetism》2017,30(2):343-351
In the present work, reflectance properties of one-dimensional photonic crystal (1D PC) containing a metamaterial and high-temperature superconductor have been investigated theoretically and analyzed. The reflectance/transmittance spectrum of the proposed structure is obtained by using the characteristic or transfer-matrix method (TMM). The results show that by increasing the thickness of the metamaterial layer, the width of the second reflection band decreases while the width of the first reflection band remains almost the same though it shifts towards the higher frequency side. In addition to this, a new band gap arises in the lower side of frequency. But, when the thickness of the superconductor layer is increased, the width of both the bands increases and no additional band arises in this case. Moreover, the reflection band is also affected by varying the operating temperature of the superconducting layer and the results show that bands get narrower by increasing the operating temperature. Finally, the effect of incident angle on the reflection band has been discussed for both transverse electric (TE) and transverse magnetic (TM) polarizations. 相似文献
28.
Cost of software testing can be reduced by automated test data generation to find a minimal set of data that has maximum coverage. Search-based software testing (SBST) is one of the techniques recently used for automated testing task. SBST makes use of control flow graph (CFG) and meta-heuristic search algorithms to accomplish the process. This paper focuses on test data generation for branch coverage. A major drawback in using meta-heuristic techniques is that the CFG paths have to be traversed from the starting node to end node for each automated test data. This kind of traversal could be improved by branch ordering, together with elitism. But still the population size and the number of iterations are maintained as the same to keep all the branches alive. In this paper, we present an incremental genetic algorithm (IGA) for branch coverage testing. Initially, a classical genetic algorithm (GA) is used to construct the population with the best parents for each branch node, and the IGA is started with these parents as the initial population. Hence, it is not necessary to maintain a huge population size and large number of iterations to cover all the branches. The performance is analyzed with five benchmark programs studied from the literature. The experimental results indicate that the proposed IGA search technique outperforms the other meta-heuristic search techniques in terms of memory usage and scalability. 相似文献
29.
Sanjeev Saxena 《Information Processing Letters》2010,110(4):168-170
In this paper a linear time algorithm is proposed for preprocessing the edges of a graph. After preprocessing (in linear time), the fundamental cut set of any tree edge can be determined in time proportional to the size of that cut set. 相似文献
30.
Self-assembly is a process in which small building blocks interact autonomously to form larger structures. A recently studied
model of self-assembly is the Accretive Graph Assembly Model whereby an edge-weighted graph is assembled one vertex at a time
starting from a designated seed vertex. The weight of an edge specifies the magnitude of attraction (positive weight) or repulsion
(negative weight) between adjacent vertices. It is feasible to add a vertex to the assembly if the total attraction minus repulsion of the already built neighbors exceeds a certain threshold,
called the assembly temperature. This model naturally generalizes the extensively studied Tile Assembly Model. A natural question
in graph self-assembly is to determine whether or not there exists a sequence of feasible vertex additions to realize the
entire graph. However, even when it is feasible to realize the assembly, not much can be inferred about its likelihood of
realization in practice due to the uncontrolled nature of the self-assembly process. Motivated by this, we introduce the robust self-assembly problem where the goal is to determine if every possible sequence of feasible vertex additions leads to the
completion of the assembly. We show that the robust self-assembly problem is co-NP-complete even on planar graphs with two
distinct edge weights. We then examine the tractability of the robust self-assembly problem on a natural subclass of planar
graphs, namely grid graphs. We identify structural conditions that determine whether or not a grid graph can be robustly self-assembled,
and give poly-time algorithms to determine this for several interesting cases of the problem. Finally, we also show that the
problem of counting the number of feasible orderings that lead to the completion of an assembly is #P-complete. 相似文献