首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   180篇
  免费   3篇
  国内免费   1篇
电工技术   5篇
化学工业   27篇
金属工艺   2篇
机械仪表   4篇
建筑科学   13篇
能源动力   3篇
轻工业   1篇
水利工程   1篇
石油天然气   14篇
无线电   17篇
一般工业技术   64篇
冶金工业   14篇
原子能技术   1篇
自动化技术   18篇
  2022年   5篇
  2021年   4篇
  2020年   3篇
  2018年   10篇
  2017年   3篇
  2016年   2篇
  2015年   6篇
  2014年   5篇
  2013年   19篇
  2012年   11篇
  2011年   8篇
  2010年   3篇
  2009年   8篇
  2008年   9篇
  2007年   8篇
  2006年   7篇
  2005年   2篇
  2004年   3篇
  2003年   2篇
  2002年   2篇
  2001年   2篇
  2000年   3篇
  1999年   5篇
  1998年   9篇
  1997年   4篇
  1996年   6篇
  1995年   2篇
  1994年   3篇
  1993年   2篇
  1992年   2篇
  1991年   1篇
  1990年   2篇
  1989年   1篇
  1988年   1篇
  1986年   4篇
  1985年   5篇
  1984年   4篇
  1983年   2篇
  1980年   1篇
  1979年   1篇
  1977年   1篇
  1976年   2篇
  1973年   1篇
排序方式: 共有184条查询结果,搜索用时 15 毫秒
1.
Azzam RM 《Applied optics》1994,33(25):6009-6011
The modulated reflected and nonreflected light fluxes, measured as the azimuth of incident linearly polarized light is varied, yield the absolute reflectances R(p), and R(s), of a dielectric or semiconductor surface. Application to a reflective Si detector determines the refractive index and thickness of a SiO(2) film on the detector surface.  相似文献   
2.
3.
In this paper, we present new pointcuts and primitives to Aspect-Oriented Programming (AOP) languages that are needed for systematic hardening of security concerns. The two proposed pointcuts allow to identify particular join points in a program's control-flow graph (CFG). The first one is the GAFlow, Closest Guaranteed Ancestor, which returns the closest ancestor join point to the pointcuts of interest that is on all their runtime paths. The second one is the GDFlow, Closest Guaranteed Descendant, which returns the closest child join point that can be reached by all paths starting from the pointcut of interest. The two proposed primitives are called ExportParameter and ImportParameter and are used to pass parameters between two pointcuts. They allow to analyze a program's call graph in order to determine how to change function signatures for passing the parameters associated with a given security hardening. We find these pointcuts and primitives to be necessary because they are needed to perform many security hardening practices and, to the best of our knowledge, none of the existing ones can provide their functionalities. Moreover, we show the viability and correctness of the proposed pointcuts and primitives by elaborating and implementing their algorithms and presenting the result of explanatory case studies.  相似文献   
4.
5.
6.
7.
8.
9.
Anodic destruction of 4-chlorophenol solution   总被引:2,自引:0,他引:2  
The electrochemical oxidation of 4-chlorophenol solutions was studied using a dimensional stable anode (DSA), made of pure titanium sheet mesh coated with Ti/TiO(2) and RuO(2) film. An electrochemical cell with one working electrode and two counter-electrodes was designed. A gas collecting system to collect the electrolysis gaseous products was also designed. The influence of current density (6.51-21.58 mA/cm(2)), pH (2.0-12.6) and initial 4-chlorophenol concentration (25-100 mg/l) on the destruction was investigated. Complete elimination was successfully achieved within 2 h for most investigated conditions. Highest rates of elimination were achieved at a pH of 12.6.A new approach to calculate the current efficiency (CE) of the cell was proposed. The volumes of the gases produced at the anode and at the cathode were the basis for the new CE calculations. It was observed that the worst CE was approximately 20% and the best CE was approximately 89%. The most efficient pH was at 12.6 and the most efficient current density was at 11.39 mA/cm(2).  相似文献   
10.
In this paper, we address the problem of clustering in Vehicular Ad hoc Networks (VANETs) using Quality of Service Optimized Link State Routing (QoS-OLSR) protocol. Several clustering algorithms have been proposed for VANET and MANET. However, the mobility-based algorithms ignore the Quality of Service requirements that are important for VANET safety, emergency, and multimedia services while the QoS-based algorithms ignore the high speed mobility constraints since they are dedicated for Mobile Ad hoc Networks (MANETs). Our solution is a new QoS-based clustering algorithm that considers a tradeoff between QoS requirements and high speed mobility constraints. The goal is to form stable clusters and maintain the stability during communications and link failures while satisfying the Quality of Service requirements. This is achieved by: (1) considering the high mobility metrics while computing the QoS, (2) using Ant Colony Optimization for MPRs selection, and (3) using MPR recovery algorithm able to select alternatives and keep the network connected in case of link failures. Performance analysis and simulation results show that the proposed model can maintain the network stability, reduce the end-to-end delay, increase the packet delivery ratio, and reduce the communications overhead.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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