首页 | 官方网站   微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   69篇
  免费   0篇
工业技术   69篇
  2021年   1篇
  2018年   1篇
  2017年   2篇
  2016年   1篇
  2009年   1篇
  2008年   1篇
  2007年   1篇
  2006年   1篇
  2004年   3篇
  2002年   1篇
  2000年   1篇
  1996年   1篇
  1995年   3篇
  1993年   2篇
  1991年   1篇
  1990年   2篇
  1989年   3篇
  1988年   2篇
  1987年   2篇
  1986年   2篇
  1985年   1篇
  1984年   1篇
  1983年   2篇
  1982年   1篇
  1981年   2篇
  1980年   1篇
  1979年   1篇
  1978年   1篇
  1977年   1篇
  1976年   5篇
  1975年   1篇
  1974年   3篇
  1973年   2篇
  1971年   2篇
  1970年   4篇
  1969年   2篇
  1968年   2篇
  1967年   1篇
  1966年   2篇
  1965年   1篇
  1964年   1篇
排序方式: 共有69条查询结果,搜索用时 31 毫秒
1.
Atomic Energy - The results of calculations and experimental determination of the neutronics characteristics of the IRT-T research reactor are presented. The IRT-T reactor is a pool reactor with...  相似文献   
2.
3.
Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. Numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.  相似文献   
4.
5.
6.
7.
8.
The objective of this work is not a fracture prediction or prevention. We are interested in modeling the crack network geometry in rocks and swelling soils and in the application of the model to rock volume fragmentation or preferential flow in swelling soils. Natural and explosion-induced rock fragmentation is important in geophysics and mining. Preferential flow in swelling soils is important in agricultural and environmental engineering. The presentation gives a brief review of the authors' work in this area. A concentration criterion of crack connection and effective independency of cracks in the case of multiple cracking are a basis for the modeling of a crack network. This basis enables one to introduce a condition of fragment formation at crack connection and a number of relevant concepts (an average cracking – an average crack number of x dimension in volume; crack connection probability of x dimension; fragment formation probability; average and maximum fragment dimensions; crack connectedness – a ratio connected to the total number of cracks; and crack network tortuosity), as well as to suggest quantitative relations between the concepts. In the frame of an application, the average fragment dimension and crack connectedness (or the maximum fragment dimension and fragment formation probability) can depend on the spatial coordinates and parameters specific for the application. The simplest application relates to the block-dimension distribution of a rock mass for statistically homogeneous conditions. The second application relates to the granulometric composition of a blasted rock mass in quarries. In this case the specific parameters are the preliminary rock disturbance (including natural cracking), charge construction, blasting scheme and others. The third application relates to the shrinkage crack network geometry in swelling clay soils, the spatial coordinate being the soil depth. The specific parameters are an upper layer thickness (of a few tens of centimeters) of intensive cracking and the maximum crack depth (its boundary being the depth of the water table level). Crack width, depth, spacing, volume, and tortuosity of the crack network are estimated by using the shrinkage curve of the soil and a water content profile. The fourth application relates to the hydraulic properties of capillary crack networks in swelling soils as compared to those of the soil matrix. For all the applications considered, comparison between the model prediction and available data shows good agreement.  相似文献   
9.
10.
PMD-induced fluctuations of bit-error rate in optical fiber systems   总被引:1,自引:0,他引:1  
This paper presents a method that allows evaluating the performance of an optical fiber system where bit errors result from a complex interplay of spontaneous noise generated in optical amplifiers and birefringent disorder of the transmission fiber. We demonstrate that in the presence of temporal fluctuations of birefringence characteristics, the bit-error rate (BER) itself is insufficient for characterizing system performance. Adequate characterization requires introducing the probability distribution function (PDF) of the BER obtained by averaging over many realizations of birefringent disorder. Our theoretical analysis shows that this PDF has an extended tail indicating the importance of anomalously large values of BER. We present the results of comprehensive analysis of the following issues: 1) The dependence of the PDF tail shape on detection details, such as filtering and regular temporal shift adjustment; 2) the changes in the PDF of BER that occur when the first- or higher order polarization mode dispersion (PMD) compensation techniques are applied; 3) an alternative PMD compensation method capable of providing more efficient suppression of extreme outages.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号