首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   380篇
  免费   29篇
  国内免费   5篇
电工技术   4篇
化学工业   89篇
金属工艺   5篇
机械仪表   5篇
建筑科学   12篇
能源动力   11篇
轻工业   67篇
水利工程   10篇
石油天然气   1篇
无线电   44篇
一般工业技术   105篇
冶金工业   23篇
自动化技术   38篇
  2024年   4篇
  2023年   7篇
  2022年   24篇
  2021年   38篇
  2020年   18篇
  2019年   12篇
  2018年   19篇
  2017年   24篇
  2016年   23篇
  2015年   12篇
  2014年   24篇
  2013年   24篇
  2012年   18篇
  2011年   24篇
  2010年   15篇
  2009年   21篇
  2008年   12篇
  2007年   13篇
  2006年   11篇
  2005年   2篇
  2004年   6篇
  2003年   11篇
  2002年   3篇
  2001年   1篇
  2000年   3篇
  1999年   1篇
  1998年   11篇
  1997年   4篇
  1996年   2篇
  1995年   3篇
  1994年   4篇
  1993年   3篇
  1992年   1篇
  1991年   2篇
  1989年   1篇
  1985年   1篇
  1984年   1篇
  1983年   7篇
  1982年   3篇
  1976年   1篇
排序方式: 共有414条查询结果,搜索用时 9 毫秒
1.
2.
Advances in the performance of electronic devices have resulted in high input/output counts both at the chip and the package level, which has led to the development of new packaging technologies that can accommodate these high counts. This paper presents and analyzes a novel method for the placement of ball grid array (BGA) bonding pads and routing wires on printed circuit boards to maximize signal density, which ultimately reduces the number of circuit board layers needed for routing. This method has been termed as the "balls shifted as needed" method and all the ball placement/trace routing designs shown in this paper are based on this method. We also present a performance metric defined as the number of balls routed out divided by the area of package footprint on the circuit board, and we compare various placement/routing schemes using this method.  相似文献   
3.
Sharma  Shalini  Chou  Jerry 《The Journal of supercomputing》2021,77(10):10896-10920
The Journal of Supercomputing - Travelling salesman problem (TSP) is a graph problem that has been widely used in many applications, especially for transportation and logistics. Because TSP is a NP...  相似文献   
4.
Given a set of points \(P \subset\mathbb{R}^{d}\) , the k-means clustering problem is to find a set of k centers \(C = \{ c_{1},\ldots,c_{k}\}, c_{i} \in\mathbb{R}^{d}\) , such that the objective function ∑ xP e(x,C)2, where e(x,C) denotes the Euclidean distance between x and the closest center in C, is minimized. This is one of the most prominent objective functions that has been studied with respect to clustering. D 2-sampling (Arthur and Vassilvitskii, Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07, pp. 1027–1035, SIAM, Philadelphia, 2007) is a simple non-uniform sampling technique for choosing points from a set of points. It works as follows: given a set of points \(P \subset\mathbb{R}^{d}\) , the first point is chosen uniformly at random from P. Subsequently, a point from P is chosen as the next sample with probability proportional to the square of the distance of this point to the nearest previously sampled point. D 2-sampling has been shown to have nice properties with respect to the k-means clustering problem. Arthur and Vassilvitskii (Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07, pp. 1027–1035, SIAM, Philadelphia, 2007) show that k points chosen as centers from P using D 2-sampling give an O(logk) approximation in expectation. Ailon et al. (NIPS, pp. 10–18, 2009) and Aggarwal et al. (Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp. 15–28, Springer, Berlin, 2009) extended results of Arthur and Vassilvitskii (Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA’07, pp. 1027–1035, SIAM, Philadelphia, 2007) to show that O(k) points chosen as centers using D 2-sampling give an O(1) approximation to the k-means objective function with high probability. In this paper, we further demonstrate the power of D 2-sampling by giving a simple randomized (1+?)-approximation algorithm that uses the D 2-sampling in its core.  相似文献   
5.

With the advancement of image acquisition devices and social networking services, a huge volume of image data is generated. Using different image and video processing applications, these image data are manipulated, and thus, original images get tampered. These tampered images are the prime source of spreading fake news, defaming the personalities and in some cases (when used as evidence) misleading the law bodies. Hence before relying totally on the image data, the authenticity of the image must be verified. Works of the literature are reported for the verification of the authenticity of an image based on noise inconsistency. However, these works suffer from limitations of confusion between edges and noise, post-processing operation for localization and need of prior knowledge about an image. To handle these limitations, a noise inconsistency-based technique has been presented here to detect and localize a false region in an image. This work consists of three major steps of pre-processing, noise estimation and post-processing. For the experimental purpose two, publicly available datasets are used. The result is discussed in terms of precision, recall, accuracy and f1-score on the pixel level. The result of the presented work is also compared with the recent state-of-the-art techniques. The average accuracy of the proposed work on datasets is 91.70%, which is highest among state-of-the-art techniques.

  相似文献   
6.
This paper investigates the performance of a dual-hop mixed relay system with radio frequency (RF) and free-space optics (FSO) communication under the effect of pointing error (PE) and atmospheric turbulence (AT). This paper considers a system where RF and FSO links are cascaded. The RF link is modeled by Nakagami-m fading, and the FSO link is modeled as gamma–gamma (G-G) fading channel. Both the channel models use orthogonal frequency division multiplexing (OFDM) with M-ary quadrature amplitude modulation (QAM). The expressions for probability density function, cumulative distribution function, signal-to-noise ratio, and ergodic capacity are derived. The moment generating function (MGF) of fading and the bit error rate (BER) of the OFDM-based M-ary QAM scheme is derived in terms of Meijer's G-function. It has been observed that, in fixed gain relay systems, the modulation scheme's BER is dominated by the SNR of the RF link. While in a variable gain relay system, the turbulence conditions of the FSO system affect the SNR and the BER of the modulation method. The feasibility of heterodyne detection and intensity modulation direct detection (IM/DD) is analyzed in terms of outage probability and ergodic capacity. The results can be used to choose the optimal modulation order and relay system for QAM-OFDM-based optical wireless systems.  相似文献   
7.
The purpose of this study was to compare the osteoconductivity, and absorbability of hydroxyapatite or beta-tricalcium phosphate in clinical scenario of opening wedge high tibial osteotomy Total 41 knees of 40 patients with follow up period of more than 1 year were enrolled. These patients were divided into two groups, Group I (22 knees, 21 patients) used hydroxyapatite and Group II (19 knees, 19 patients) used beta-tricalcium phosphate as a substitute in the opening gap. According to proven method, the osteoconductivity was assessed radiographically by the extent of new bone formation at osteotomy space and absorbability was evaluated by measuring the area occupied by substitute at immediate postoperative, postoperative 6 months and 1 year. Regarding preoperative demographic data, no significant differences were found between two groups. No statistically significant differences were found between two groups regarding lower limb alignment (mechanical femorotibial angle, weight-bearing line%) and posterior tibial slope at postoperative and final follow up radiographs. Concerning the osteoconductivity, there were no significant differences between two groups in any zone. However, the absorption rate was significantly greater in the Group II than in Group I at 6 months (Group I: 13.7?±?6.8, group II: 35.3?±?15.8, P?=?0.001) and 1 year (Group I: 24.2?±?6.3, Group II: 49.6?±?14.3, P?<?0.0001). The complications related to bone substitutes were not observed. Both hydroxyapatite and beta-tricalcium phosphate showed satisfactory gap healing without complications and can be successfully used as alternative healing materials in opening wedge high tibial osteotomy. Our study showed that beta-tricalcium phosphate has superior absorbability than hydroxyapatite. But osteoconductivity showed no significant difference.  相似文献   
8.
The strength and deformation of full-scale adhesively bonded multi-material joints is studied in this paper. Four joints with a thick layer of methyl methacrylate adhesive (MMA) have been manufactured in shipyard conditions. In two specimens, cracks have been introduced at steel–adhesive and composite–adhesive interfaces. One cracked and one un-cracked specimen were subjected to quasi-static tensile testing; the two remaining specimens were stepwise loaded/unloaded with increasing load until failure. The strain in the adhesive layers was measured with digital image correlation (DIC). This showed a predominant shear deformation and dissimilar shear strain patterns for different bond lines. Fibre Bragg (FBG) sensors were used to monitor strains at steel and composite constituents and to detect the onset and evolution of damage in the un-cracked specimen. Strains measured by FBG sensors correspond well with DIC results at nearby regions. All specimens failed by delamination of the composite panel near the composite–adhesive interface.  相似文献   
9.
Classical data mining algorithms require expensive passes over the entire database to generate frequent items and hence to generate association rules. With the increase in the size of database, it is becoming very difficult to handle large amount of data for computation. One of the solutions to this problem is to generate sample from the database that acts as representative of the entire database for finding association rules in such a way that the distance of the sample from the complete database is minimal. Choosing correct sample that could represent data is not an easy task. Many algorithms have been proposed in the past. Some of them are computationally fast while others give better accuracy. In this paper, we present an algorithm for generating a sample from the database that can replace the entire database for generating association rules and is aimed at keeping a balance between accuracy and speed. The algorithm that is proposed takes into account the average number of small, medium and large 1-itemset in the database and average weight of the transactions to define threshold condition for the transactions. Set of transactions that satisfy the threshold condition is chosen as the representative for the entire database. The effectiveness of the proposed algorithm has been tested over several runs of database generated by IBM synthetic data generator. A vivid comparative performance evaluation of the proposed technique with the existing sampling techniques for comparing the accuracy and speed has also been carried out.  相似文献   
10.
The distortion in a 2-D scan pattern generated by a system of a plane mirror and a regular polygon scanner was investigated using the matrix formulation of reflection by plane mirrors. A particular configuration involving the two scan elements was identified which does not introduce any distortion in its 2-D scan pattern.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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