Yao A.,CAS Institute of Automation |
Yu S.,National Institute for Research in Computer Science and Control
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2011
In this paper, a new face descriptor called spatial feature interdependence matrix (SFIM) is proposed for addressing representation of human faces under variations of illumination and facial expression. Unlike traditional face descriptors which usually use a hierarchically organized or a sequentially concatenated structure to describe the spatial arrangement of features in different facial regions, SFIM is focused on exploring inherent spatial feature interdependences among separated facial regions in a face image. We compute the feature interdependence strength between each pair of facial regions as the Chi square distance between two corresponding histogram based feature vectors. Once face images are represented as SFIMs, we then employ spectral regression discriminant analysis (SRDA) to achieve face recognition under a nearest neighbor search framework. Extensive experimental results on two well-known face databases demonstrate that the proposed method has superior performance in comparison with related approaches. © 2011 Springer-Verlag.
Lin X.,University of Ontario Institute of Technology |
Li X.,Huawei |
Li X.,National Institute for Research in Computer Science and Control
IEEE Transactions on Vehicular Technology | Year: 2013
Recently, vehicular ad hoc networks (VANETs) have emerged as a promising approach to increasing road safety and efficiency, as well as improving the driving experience. This can be accomplished in a variety of applications that involve communication between vehicles, such as warning other vehicles about emergency braking; however, if we do not take security and privacy issues into consideration, the attractive features of VANETs will inevitably result in higher risks for abuse, even before the wide deployment of such networks. While message authentication is a common tool for ensuring information reliability, namely, data integrity and authenticity, it faces a challenge in VANETs. When the number of messages that are received by a vehicle becomes large, traditional exhaustive (or per-message) authentication may generate unaffordable computational overhead on the vehicle and therefore bring unacceptable delay to time-critical applications, such as accident warning. In this paper, we propose an efficient cooperative authentication scheme for VANETs. To reduce the authentication overhead on individual vehicles and shorten the authentication delay, this scheme maximally eliminates redundant authentication efforts on the same message by different vehicles. To further resist various attacks, including free-riding attacks that are launched by selfish vehicles, and encourage cooperation, the scheme uses an evidence-token approach to controlling the authentication workload, without the direct involvement of a trusted authority (TA). When a vehicle passes a roadside unit (RSU), the vehicle obtains an evidence token from the TA via the RSU. This token reflects the contribution that the vehicle has made to cooperative authentication in the past, which enables the vehicle to proportionally benefit from other vehicles' authentication efforts in the future and thus reduce its own workload. Through extensive simulation, we evaluate the proposed cooperative authentication scheme in terms of workload savings and the ability to resist free-riding attacks. © 2013 IEEE.
Gao J.-H.,CAS Institute of Software |
Gao J.-H.,University of Chinese Academy of Sciences |
Gao J.-H.,National Institute for Research in Computer Science and Control
Journal of Computer Science and Technology | Year: 2013
Resolution modulo is an extension of first-order resolution in which rewrite rules are used to rewrite clauses during the search. In the first version of this method, clauses are rewritten to arbitrary propositions. These propositions are needed to be dynamically transformed into clauses. This unpleasant feature can be eliminated when the rewrite system is clausal, i.e., when it rewrites clauses to clauses. We show in this paper how to transform any rewrite system into a clausal one, preserving the existence of cut free proofs of any sequent. © 2013 Springer Science+Business Media New York & Science Press, China.
Monot A.,National Institute for Research in Computer Science and Control |
Navet N.,French Institute for Research in Computer Science and Automation |
Bavoux B.,PSA Peugeot Citroen |
Simonot-Lion F.,University of Lorraine
IEEE Transactions on Industrial Electronics | Year: 2012
As the demand for computing power is quickly increasing in the automotive domain, car manufacturers and tier-one suppliers are gradually introducing multicore electronic control units (ECUs) in their electronic architectures. In addition, these multicore ECUs offer new features such as higher levels of parallelism, which ease the compliance with safety requirements such as the International Organization for Standardization (ISO) 26262 and the implementation of other automotive use cases. These new features involve greater complexity in the design, development, and verification of the software applications. Hence, car manufacturers and suppliers will require new tools and methodologies for deployment and validation. In this paper, we address the problem of sequencing numerous elementary software modules, called runnables, on a limited set of identical cores. We show how this problem can be addressed as the following two subproblems, which cannot optimally be solved due to their algorithmic complexity: 1) partitioning the set of runnables and 2) building the sequencing of the runnables on each core. We then present low-complexity heuristics to partition and build sequencer tasks that execute the runnable set on each core. Finally, we globally address the scheduling problem, at the ECU level, by discussing how we can extend this approach in cases where other OS tasks are scheduled on the same cores as the sequencer tasks. © 2012 IEEE.
Lanzer P.,Health Care Center Bitterfeld |
Boehm M.,U.S. National Institutes of Health |
Sorribas V.,University of Zaragoza |
Thiriet M.,National Institute for Research in Computer Science and Control |
And 4 more authors.
European Heart Journal | Year: 2014
Vascular calcifications (VCs) are actively regulated biological processes associated with crystallization of hydroxyapatite in the extracellular matrix and in cells of the media (VCm) or intima (VCi) of the arterial wall. Both patterns of VC often coincide and occur in patients with type II diabetes, chronic kidney disease, and other less frequent disorders; VCs are also typical in senile degeneration. In this article, we review the current state of knowledge about the pathology, molecular biology, and nosology of VCm, expand on potential mechanisms responsible for poor prognosis, and expose some of the directions for future research in this area. © 2014 Published on behalf of the European Society of Cardiology. All rights reserved. © The Author 2014. For permissions please email: firstname.lastname@example.org.