A novel pose and illumination robust face recognition with a single training image per person algorithm

In the real-world application of face recognition system, owing to the difficulties of collecting samples or storage space of systems, only one sample image per person is stored in the system, which is so-called one sample per person problem. Moreover, pose and illumination have impact on recognition performance. We propose a novel pose and illumination robust algorithm for face recognition with a single training image per person to solve the above limitations. Experimental results show that the proposed algorithm is an efficient and practical approach for face recognition.     

An improved partial SPIHT with classified weighted rate-distortion optimization for interferential multispectral image compression

Based on the property analysis of interferential multispectral images, a novel compression algorithm of partial set partitioning in hierarchical trees (SPIHT) with classified weighted rate-distortion optimization is presented.After wavelet decomposition, partial SPIHT is applied to each zero tree independently by adaptively selecting one of three coding modes according to the probability of the significant coefficients in each bitplane.Meanwhile the interferential multispectral image is partitioned into two kinds of regions in terms of luminous intensity, and the rate-distortion slopes of zero trees are then lifted with classified weights according to their distortion contribution to the constructed spectrum.Finally a global ratedistortion optimization truncation is performed.Compared with the conventional methods, the proposed algorithm not only improves the performance in spatial domain but also reduces the distortion in spectral domain.     

High-performance liquid chromatographic/tandem mass spectrometric identification of the phototransformation products of tebuconazole on titanium dioxide

Tebuconazole is a widely used fungicide. The formation of by-products on irradiated titanium dioxide as a photocatalyst was evaluated. Several species derived from tebuconazole degradation were identified and characterized by HPLC/MS(n). A pattern of reactions accounting for the observed intermediates is proposed. Different parallel pathways are operating (and through these pathways the transformation of the molecule proceeds), leading to a wide range of intermediate compounds. All these molecules are more hydrophylic than tebuconazole. The main steps involved are (1) the hydroxylation of the molecule with the formation of three species having [M + H](+) 324; the hydroxylation occurs on the C-1 carbon and on the aromatic ring in the two ortho-positions; (2) the cleavage of a C--C bond with the release of the tert-butyl moiety and the formation of a species having m/z 250; analogously to step 1, also on this species a further hydroxylation reaction occurs; (3) through the loss of the triazole moiety with the formation of a structure with m/z 257.     

Admission Control Algorithms for Revenue Optimization with QoS Guarantees in Mobile Wireless Networks

We propose and analyze call admission control algorithms integrated with pricing for revenue optimization with QoS guarantees to serve multiple service classes in mobile wireless networks. Traditional admission control algorithms make acceptance decisions for new and handoff calls to satisfy certain QoS constraints such as the dropping probability of handoff calls and the blocking probability of new calls being lower than a pre-specified threshold. We analyze a class of partitioning and threshold-based admission control algorithms that make acceptance/rejection decisions not only to satisfy QoS requirements but also to optimize the revenue of the system by taking prices and arrival/departure information of service calls into account. We show that for a “charge-by-time” pricing scheme, there exist optimal resource allocation settings under which the partitioning and threshold-based admission control algorithms would produce the maximum revenue obtainable by the system without sacrificing QoS requirements. Further, we develop a new hybrid admission control algorithm which outperforms both partitioning and threshold-based admission control algorithms over a wide range of input parameters characterizing the operating environment and service workload conditions. Methods for utilizing of the analysis results for realtime admission control for revenue optimization with QoS guarantees are described with numerical data given to demonstrate the applicability.     

Design and Analysis of Optimal Multi-Level Hierarchical Mobile IPv6 Networks

Hierarchical Mobile IPv6 (HMIPv6) is an enhanced version of Mobile IPv6 designed to reduce signaling overhead and to support seamless handoff in IP-based wireless/mobile networks. To support more scalable services, HMIPv6 networks can be organized as the form of a multi-level hierarchy architecture (i.e., tree structure). However, since multi-level HMIPv6 networks incur additional packet processing overhead at multiple mobility agents, it is important to find the optimal hierarchy level to minimize the total cost, which consists of the location update cost and the packet delivery cost. In this paper, we investigate this problem, namely the design of an optimal multi-level HMIPv6 (OM-HMIPv6) network. To accomplish this, we design a function to represent the location update cost and the packet delivery cost in multi-level HMIPv6 networks. Based on these formulated cost functions, we calculate the optimal hierarchy level in multi-level HMIPv6 networks, in order to minimize the total cost. In addition, we investigate the effects of the session-to-mobility ratio (SMR) on the total cost and the optimal hierarchy. The numerical results, which show various relationships among the network size, optimal hierarchy, and SMR, can be utilized to design an optimal HMIPv6 network. In addition, the analytical results are validated by comprehensive simulations. Sangheon Pack received his B.S. (2000, magna cum laude) and Ph.D. (2005) degrees from Seoul National University, both in computer engineering. He is a post doctor fellow in the School of Computer Science and Engineering at the Seoul National University, Korea. He is a member of the IEEE and ACM. During 2002–2005, he was a recipient of the Korea Foundation for Advanced Studies (KFAS) Computer Science and Information Technology Scholarship. He has been also a member of Samsung Frontier Membership (SFM) from 1999. He received a student travel grant award for the IFIP Personal Wireless Conference (PWC) 2003. He was a visiting researcher to Fraunhofer FOKUS, German in 2003. His research interests include mobility management, wireless multimedia transmission, and QoS provision issues in the next-generation wireless/mobile networks. Yanghee Choi received B.S. in electronics engineering from Seoul National University, M.S. in electrical engineering from Korea advanced Institute of Science, and Doctor of Engineering in Computer Science from Ecole Nationale Superieure des Telecommunications (ENST) in Paris, in 1975, 1977 and 1984 respectively. Before joining the School of Computer Engineering, Seoul National University in 1991, he has been with Electronics and Telecommunications Research Institute (ETRI) during 1977–1991, where he served as director of Data Communication Section, and Protocol Engineering Center. He was research student at Centre National d'Etude des Telecommunications (CNET), Issy-les-Moulineaux, during 1981–1984. He was also Visiting Scientist to IBM T.J. Watson Research Center for the year 1988–1989. He is now leading the Multimedia Communications Laboratory in Seoul National University. He is also director of Computer Network Research Center in Institute of Computer Technology (ICT). He was editor-in-chief of Korea Information Science Society journals. He was chairman of the Special Interest Group on Information Networking. He has been associate dean of research affairs at Seoul National University. He was president of Open Systems and Internet Association of Korea. His research interest lies in the field of multimedia systems and high-speed networking. Minji Nam received her B.S. and M.S degrees in Computer Science and Engineering from Seoul National University in 2003 and 2005, respectively. From 2005, she has worked on Portable Internet Development Team for Korea Telecom. Her research interests are mobile networks, portable internet technology (IEEE 802.16) and Mobile IPv6.     

PKI体系下的网络安全性能评估算法

通过分析基于公钥基础设施安全的网络防御问题和攻击问题,得出一个能反应网络安全性能的网络安全性能评估算法。该算法包含4个重要的安全参数:网络用户数n、密钥破解系数p、网络安全系数λ和网络安全度s。通过对网络安全性能评估算法中的各个安全参数进行分析,观察各参数对网络安全性能的影响,最后得出网络安全系数的一个上限值和网络用户数的一个上限值。这些结果可用于网络安全建设和对网络安全性能进行度量和评估。     

基于请求集与动态令牌的一种对称分布式互斥算法

提出了一种新的分布式互斥算法。该算法通过在基于竞争或请求集的分布式互斥算法中引入动态令牌的概念以及改变某些消息例如应答(reply)、释放(release)等消息的传送方向以及增加各类型消息的信息量将Makawa类算法的消息复杂度从O(3K～5K)降低到O(2K～4K),同时将算法的同步延迟从2T降低至T,并将算法的节点容错能力提高到N?2并保持算法无饥饿,无死锁。通过实际运行和对比,具有较高的使用价值。     

基于测量的网络性能评价方法研究

网络性能评价方法的研究对于指导网络设计和改进网络运行性能状况有着重要的意义。为了综合地评价网络的运行状况，在测量的基础上，提出了基于多个测量指标的多指标综合评价方法，并应用到路径性能评价和网络性能评价上，该值反映了路径和网络的综合性能状况，并可以按照不同的策略分析路径和网络之间的性能变化情况。实验结果表明，该方法可以有效的评价目标路径和网络的运行状况。     

工作在动态阈值MOS的特性研究

通过将衬底和栅极连接在一起实现了MOSFET的动态阈值,DTMOS与标准的MOSFET相比具有更高的迁移率,在栅极电压升高时DTMOS阈值电压会随之降低,从而获得了比标准的MOSFET大的电流驱动能力。DTMOS是实现低电压、低功耗的一种有效手段。     

卡尔曼滤波实现车载GPS/DR组合导航

陆地车辆是在二维平面内运动的,而在车载GPS接收机和DR组合装置中,测量值是在不同的坐标系中得到的,通过对坐标系转换和测量误差分析得到组合系统的整体状态方程和测量方程,由于这些状态方程和测量方程都是关于状态的非线性函数,用广义卡尔曼滤波器来实现GPS/DR组合导航的实时求解。最后在行驶车辆上采集数据并进行仿真试验,结果表明这种组合系统能够大大提高系统实时定位精度和容错能力。