Automatic fog detection and estimation of visibility distance through use of an onboard camera

In this paper, we will present a technique for measuring visibility distances under foggy weather conditions using a camera mounted onboard a moving vehicle. Our research has focused in particular on the problem of detecting daytime fog and estimating visibility distances; thanks to these efforts, an original method has been developed, tested and patented. The approach consists of dynamically implementing Koschmieder's law. Our method enables computing the meteorological visibility distance, a measure defined by the International Commission on Illumination (CIE) as the distance beyond which a black object of an appropriate dimension is perceived with a contrast of less than 5%. Our proposed solution is an original one, featuring the advantage of utilizing a single camera and necessitating the presence of just the road and sky in the scene. As opposed to other methods that require the explicit extraction of the road, this method offers fewer constraints by virtue of being applicable with no more than the extraction of a homogeneous surface containing a portion of the road and sky within the image. This image preprocessing also serves to identify the level of compatibility of the processed image with the set of Koschmieder's model hypotheses. Nicolas Hautiére graduated from the École Nationale des Travaux Publics de l'État, France (2002). He received his M.S. and Ph.D. degree in computer vision, respectively, in 2002 and 2005 from Saint-Étienne University (France). From 2002, he is a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC), Paris, France. His research interests include trafic engineering, computer vision, and pattern recognition. Jean-Philippe Tarel graduated from the École Nationale des Ponts et Chaussées, Paris, France (1991). He received his Ph.D. degree in Applied Mathematics from Paris IX-Dauphine University in 1996 and he was with the Institut National de Recherche en Informatique et Automatique (INRIA) from 1991 to 1996. From 1997 to 1998, he was a research associate at Brown University, USA. From 1999, he is a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC), Paris, France, and from 2001 to 2003 in the INRIA. His research interests include computer vision, pattern recognition, and shape modeling. Jean Lavenant graduated from the École Nationale des Travaux Publics de l'État, Lyon, France (2001). He received the M.S. degree in Computer Vision from Jean Monnet university of Saint-Étienne in 2001. In 2001, he was a researcher in the Laboratoire Central des Ponts et Chaussées (LCPC). In 2002, he was a system engineer in Chicago (USA). He is currently an engineer for the french ministry of transports. Didier Aubert received the M.S. and Ph.D. degree, respectively, in 1985 and 1989 from the National Polytechnical Institut of Grenoble (INPG). From 1989--1990, he worked as a research scientist on the development of an automatic road following system for the NAVLAB at Carnegie Mellon University. From 1990–1994, he worked in the research department of a private company (ITMI). During this period he was the project leader of several projects dealing with computer vision. He is currently a researcher at INRETS since 1995 and works on Road traffic measurements, crowd monitoring, automated highway systems, and driving assistance systems for vehicles. He is an image processing expert for several companies, teaches at Universities (Paris VI, Paris XI, ENPC, ENST) and is at the editorial board of RTS (Research - Transport - Safety).     

自由曲面五坐标数控加工干涉检查

提出了一种新方法，用于环刀五坐标数控加工的干涉检查。该方法将干涉检查分为刀轴及侧刃干涉检查和端面干涉检查。首先将加工曲面分片，选取合适的初始点。然后利用自由曲面的微分特性，确定跟踪方向和步长，迅速计算出工件和刀具的最短距离，从而判断是否发生干涉。实验仿真表明，达到同样精度时，该算法计算效率远高于常规的三角面片法。     

Optimal H∞ general distance problem with degree constraint

In this paper the optimal H_∞, general distance problem, for continuous-time systems, with a prescribed degree on the solution is studied. The approach is based on designing the Hankel singular values using an imbedding idea. The problem is first imbedded into another problem with desirable characteristics on the Hankel singular values, then the solution to the original problem is retracted via a compression. The result is applicable to both the one-block and the four-block problems. A special case is given for illustration.     

长距离钢带传动的张紧机构设计与应用

比较了几种长距离传动方式的特点与适用场合，重点探讨了实现长距离精密传动的技术要点。结合实际工程，完成了长距离钢带精密传动的应用，并指出张紧机构的设计与应用是钢带实现长距离精密传动的关键。为此文中对钢带传动的典型张紧机构进行了比较，并分析了这几类张紧机构的应用情况，有参考和应用价值。     

无功补偿对远距离供电节能降耗的分析

本文从理论上分析了在不同功率因数下不同供电距离的能耗对比及近年来进行无功补偿的情况,从而说明了无功补偿对远距离供电节能降耗的重要意义。     

DNA序列比对分析中的统计特征方法

提出了一种新的基于统计的序列特征定义,并以此对进化树进行构建.同时对这一方法进行了分类测试和进化树构建测试,发现所得测试结果与同样是用进化树进行构建的基于两序列比对的传统算法比较,其性能和适用性都有明显改善.     

煤矿局部通风的设计与应用技术

分析了现有煤矿局部通风工程中普遍存在的问题，采用符合矿井实际的设计和施工技术，就能在使用过程中获得显著效果，可大大减少漏风，提高有效风量，满足安全生产的需要，从而解决长距离独头掘进通风的难题。     

Education-driven research in CAD

We argue for a new research category, named education-driven research (EDR), which fills the gap between traditional field-specific research that is not concerned with educational objectives and research in education that focuses on fundamental teaching and learning principles and possibly on their customization to broad areas (such as mathematics or physics), but not to specific disciplines (such as CAD). The objective of EDR is to simplify the formulation of the underlying theoretical foundations and of specific tools and solutions in a specialized domain, so as to make them easy to understand and internalize. As such, EDR is a difficult and genuine research activity, which requires a deep understanding of the specific field and can rarely be carried out by generalists with primary expertise in broad education principles. We illustrate the concept of EDR with three examples in CAD: (1) the Split and Tweak subdivisions of a polygon and its use for generating curves, surfaces, and animations; (2) the construction of a topological partition of a plane induced by an arbitrary arrangement of edges; and (3) a romantic definition of the minimal and Hausdorff distances. These examples demonstrate the value of using analogies, of introducing evocative terminology, and of synthesizing the simplest fundamental building blocks. The intuitive understanding provided by EDR enables the students (and even the instructor) to better appreciate the limitations of a particular solution and to explore alternatives. In particular, in these examples, EDR has allowed the author to: (1) reduce the cost of evaluating a cubic B-spline curve; (2) develop a new subdivision curve that is better approximated by its control polygon than either a cubic B-spline or an interpolating 4-point subdivision curve; (3) discover how a circuit inclusion tree may be used for identifying the faces in an arrangement; and (4) rectify a common misconception about the computation of the Hausdorff error between triangle meshes. We invite the scientific community to encourage the development of EDR by publishing its results as genuine research contributions in peer-reviewed professional journals.     

内容寻址网络中内容的有效定位

P2P(Peer—to—Peer)的最基本的问题是如何高效地查找到存放文件的节点。本文提出在保持内容寻址网络(Content Addressable Network：CAN)现有特性的基础上建立一种更快捷有效的内容定位结构：基于快捷链接和最小距离的内容定位。本文首先介绍了内容寻址网络的基本工作原理，然后详细描述了基于快捷链接和最小距离进行内容定位的方法，并通过仿真证实了该方法很大程度上改善了CAN的性能。     

The ethics of asking about abuse and the harm of "don't ask, don't tell."

Replies to comments by J. Read (see record 2007-07130-012), D. Gleaves et al (see record 2007-07130-013), V. Edwards et al (see record 2007-07130-014), M. Black and R. Black (see record 2007-07130-015), and S. Ullman (see record 2007-07130-016), which raised important points about the authors' original article (see record 2006-03947-003). Those comments extend our thinking about how to ask participants about abuse in an ethical way. Together, the comments point to the importance of researchers examining our own reasons for asking--or not asking--about abuse and of paying attention to how we respond when we ask. (PsycINFO Database Record (c) 2010 APA, all rights reserved)