首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   86949篇
  免费   1131篇
  国内免费   408篇
电工技术   827篇
综合类   2318篇
化学工业   11931篇
金属工艺   4846篇
机械仪表   3053篇
建筑科学   2382篇
矿业工程   587篇
能源动力   1186篇
轻工业   4002篇
水利工程   1292篇
石油天然气   358篇
无线电   9521篇
一般工业技术   16798篇
冶金工业   3049篇
原子能技术   283篇
自动化技术   26055篇
  2024年   28篇
  2023年   43篇
  2022年   34篇
  2021年   110篇
  2020年   85篇
  2019年   108篇
  2018年   14557篇
  2017年   13464篇
  2016年   10079篇
  2015年   708篇
  2014年   370篇
  2013年   421篇
  2012年   3325篇
  2011年   9597篇
  2010年   8428篇
  2009年   5692篇
  2008年   6950篇
  2007年   7924篇
  2006年   262篇
  2005年   1326篇
  2004年   1241篇
  2003年   1254篇
  2002年   643篇
  2001年   138篇
  2000年   221篇
  1999年   98篇
  1998年   122篇
  1997年   81篇
  1996年   94篇
  1995年   42篇
  1994年   49篇
  1993年   42篇
  1992年   41篇
  1991年   46篇
  1990年   24篇
  1989年   26篇
  1984年   29篇
  1969年   26篇
  1968年   43篇
  1967年   33篇
  1966年   42篇
  1965年   45篇
  1963年   29篇
  1960年   30篇
  1959年   35篇
  1958年   37篇
  1957年   36篇
  1956年   34篇
  1955年   63篇
  1954年   68篇
排序方式: 共有10000条查询结果,搜索用时 0 毫秒
61.
The polynomial-time solvable k-hurdle problem is a natural generalization of the classical s-t minimum cut problem where we must select a minimum-cost subset S of the edges of a graph such that |pS|≥k for every s-t path p. In this paper, we describe a set of approximation algorithms for “k-hurdle” variants of the NP-hard multiway cut and multicut problems. For the k-hurdle multiway cut problem with r terminals, we give two results, the first being a pseudo-approximation algorithm that outputs a (k−1)-hurdle solution whose cost is at most that of an optimal solution for k hurdles. Secondly, we provide a 2(1-\frac1r)2(1-\frac{1}{r})-approximation algorithm based on rounding the solution of a linear program, for which we give a simple randomized half-integrality proof that works for both edge and vertex k-hurdle multiway cuts that generalizes the half-integrality results of Garg et al. for the vertex multiway cut problem. We also describe an approximation-preserving reduction from vertex cover as evidence that it may be difficult to achieve a better approximation ratio than 2(1-\frac1r)2(1-\frac{1}{r}). For the k-hurdle multicut problem in an n-vertex graph, we provide an algorithm that, for any constant ε>0, outputs a ⌈(1−ε)k⌉-hurdle solution of cost at most O(log n) times that of an optimal k-hurdle solution, and we obtain a 2-approximation algorithm for trees.  相似文献   
62.
Linear and logistic regression are popular statistical techniques for analyzing multi-variate data. Typically, analysts do not simply posit a particular form of the regression model, estimate its parameters, and use the results for inference or prediction. Instead, they first use a variety of diagnostic techniques to assess how well the model fits the relationships in the data and how well it can be expected to predict outcomes for out-of-sample records, revising the model as necessary to improve fit and predictive power. In this article, we develop \(\epsilon \)-differentially private diagnostics tools for regression, beginning to fill a gap in privacy-preserving data analysis. Specifically, we create differentially private versions of residual plots for linear regression and of receiver operating characteristic (ROC) curves as well as binned residual plot for logistic regression. The residual plot and binned residual plot help determine whether or not the data satisfy the assumptions underlying the regression model, and the ROC curve is used to assess the predictive power of the logistic regression model. These diagnostics improve the usefulness of algorithms for computing differentially private regression output, which alone does not allow analysts to assess the quality of the posited model. Our empirical studies show that these algorithms can be effective tools for allowing users to evaluate the quality of their models.  相似文献   
63.
Bankruptcy prediction has long time been an active research field in finance. One of the main approaches to this issue is dealing with it as a classification problem. Among the range of instruments available, we focus our attention on the Evolutionary Nearest Neighbor Classifier (ENPC). In this work we assess the performance of the ENPC comparing it to six alternatives. The results suggest that this algorithm might be considered a good choice.  相似文献   
64.
Business process work-arounds are specific forms of incompliant behavior, where employees intentionally decide to deviate from the required procedures although they are aware of them. Detecting and understanding the work-arounds performed can guide organizations in redesigning and improving their processes and support systems. Existing process mining techniques for compliance checking and diagnosis of incompliant behavior rely on the available information in event logs and emphasize technological capabilities for analyzing this information. They do not distinguish intentional incompliance and do not address the sources of this behavior. In contrast, the paper builds on a list of generic types of work-arounds found in practice and explores whether and how they can be detected by process mining techniques. Results obtained for four work-around types in five real-life processes are reported. The remaining two types are not reflected in events logs and cannot be currently detected by process mining. The detected work-around data are further analyzed for identifying correlations between the frequency of specific work-around types and properties of the processes and of specific activities. The analysis results promote the understanding of work-around situations and sources.  相似文献   
65.
Automatic video annotation is a critical step for content-based video retrieval and browsing. Detecting the focus of interest in video frames automatically can benefit the tedious manual labeling process. However, producing an appropriate extent of visually salient regions in video sequences is a challenging task. Therefore, in this work, we propose a novel approach for modeling dynamic visual attention based on spatiotemporal analysis. Our model first detects salient points in three-dimensional video volumes, and then uses the points as seeds to search the extent of salient regions in a novel motion attention map. To determine the extent of attended regions, we use the maximum entropy in the spatial domain to analyze the dynamics derived by spatiotemporal analysis. Our experiment results show that the proposed dynamic visual attention model achieves high precision value of 70% and reveals its robustness in successive video volumes.  相似文献   
66.
As the impact of the financial crisis spreads worldwide, it has become a top priority of various countries, international institutions, entrepreneurs and scholars to find innovative and creative ways to face this challenge. As Hazel Henderson (2002) has pointed out, “the world has not fallen into a financial crisis, but fundamentally fell into a crisis of development paradigm.” We need to reflect seriously on this paradigm and rethink of the social and economic models and cultural values for meeting the challenges of this crisis. The paper introduces key issues of development within a global context, and explores the shift of the value system from hard technology centered to soft technology-based future direction of human development.  相似文献   
67.
Comprehensive study on novel Linear-Dispersion Division Multiple-Access(LDDMA) for multi-user uplink Multiple-Input Multiple-Output(MIMO)systems is proposed.In the new multiplexing scheme,each user’s information symbol is dispersed by a User-Specific Matrix(USM)both in space and time domain and linearly combined at base-station side.And a simple random search algorithm,based on capacity maximization criteria,is developed to generate a bank of USMs.Simulation results are presented to demonstrate the advantages of LDDMA.When the Bit Error Rate(BER) reaches 10^–3,the performance gains are 3dB and 5dB,compared with Time-Division Linear Dispersion Codes(TD-LDC)and BLAST,respectively.  相似文献   
68.
69.
In this paper, we propose a new construction of signature waveform sets based on Generalized Loosely Synchronization (GLS) sets and different chip waveforms. The new signature sets are applied into the multi-rate multi-cell quasi-synchronous CDMA (QS-CDMA) system where each cell is assigned with a GLS set; different users in the same cell are assigned with different GLS sequences in the same GLS set; user’s different streams are assigned with the same GLS sequence but different chip waveforms. According to the properties of GLS sets, the inter-cell interference (ICI) and the multi-user interference (MUI) in the same cell can be reduced significantly. The interferences among different streams of the same user are handled by an optimal (or suboptimal) multi-stream detector(s), notice that the multi-stream detector mentioned here is also named as multi-user detector in other references. We compare the performance of the multi-rate multi-cell QS-CDMA system employing the proposed sets with that of multi-rate system employing well-known concatenated orthogonal/PN sets and that of single-rate system employing GLS sets. The results show that the multi-rate system employing the proposed sets can achieve significant interference reduction. Meanwhile the performance of multi-rate system is similar to that of single-rate system due to the inclusion of multi-user detection.
Vahid TarokhEmail:
  相似文献   
70.
The impulse response in frontside-illuminated mid-wave infrared HgCdTe electron avalanche photodiodes (APDs) has been measured with localized photoexcitation at varying positions in the depletion layer. Gain measurements have shown an exponential gain, with a maximum value of M = 5000 for the diffusion current at a reverse bias of V b = 12 V. When the light was injected in the depletion layer, the gain was reduced as the injection approached the N+ edge of the junction. The impulse response was limited by the diode series resistance–capacitance product, RC, due to the large capacitance of the diode metallization. Hence, the fall time is given by the RC constant, estimated as RC = 270 ps, and the rise time is due to the charging of the diode capacitance via the transit and multiplication of carriers in the depletion layer. The latter varies between t 10–90 = 20 ps (at intermediate gains M < 500) and t 10–90 = 70 ps (at M = 3500). The corresponding RC-limited bandwidth is BW = 600 MHz, which yields a new absolute record in gain–bandwidth product of GBW = 2.1 THz. The increase in rise time at high gains indicates the existence of a limit in the transit-time-limited gain–bandwidth product, GBW = 19 THz. The impulse response was modeled using a one-dimensional deterministic model, which allowed a quantitative analysis of the data in terms of the average velocity of electrons and holes. The fitting of the data yielded a saturation of the electron and hole velocity of v e = 2.3 × 107 cm/s and v h = 1.0 × 107 cm/s at electric fields E > 1.5 kV/cm. The increase in rise time at high bias is consistent with the results of Monte Carlo simulations and can be partly explained by a reduction of the electron saturation velocity due to frequent impact ionization. Finally, the model was used to predict the bandwidth in diodes with shorter RC = 5 ps, giving BW = 16 GHz and BW = 21 GHz for x j = 4 μm and x j = 2 μm, respectively, for a gain of M = 100.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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