33400437
Facial Expression Recognition Using Active Appearance Model
This paper describes a facial expression recognition system based upon Active Appearance Model (AAM), which has been typically used for the face recognition task. Given that AAM has been also used in tracking the moving object, we thought it could be effective in recognizing the facial expressions of humans. Our results show that the performance of the facial expression recognition using AAM is reliably high when it combined with an enhanced Fisher classification model.
44579377
Head Detection and Tracking for the Car Occupant's Pose Recognition
This paper describes a Vision-based Occupant Pose Recognition (VOPR) system, which can ensure a safe airbag deployment. Head detection and its tracking are necessary for occupant’s pose recognition in the car, since the position of occupant’s head provides valuable information, such as his pose, size, position, and so on. We use the stereo cameras to extract a disparity map. Against variable lighting conditions including the night drive, we adopt infrared illumination as well as normal one. Results suggest that VOPR system is reliable and performs reasonably well.
14743541
SCAI TREC-8 Experiments
This working note reports our experiences with TREC-8 on four tracks: Ad Hoc, Filtering, Web, and QA. The Ad Hoc retrieval engine, SCAIR, has been used for the Web and QA experiments, and the ltering experiments were based on it's own engine. As a second entry to TREC, we focused this year on exploring possibilities of applying machine learning techniques to TREC tasks. The Ad Hoc track employed a cluster-based retrieval method where the scoring function used cluster information extracted from a collection of precompiled documents. Filtering was based on naive Bayes learning supported by an EM algorithm. In the Web track, we compared the performance of using link information to that of not using the information. In the QA track, some passage extraction techniques have been tested using the baseline SCAIR retrieval engine.
1181632
Group key agreement efficient in communication
In recent years, collaborative and group-oriented applications and protocols have gained popularity. These applications typically involve communication over open networks; security thus is naturally an important requirement. Group key management is one of the basic building blocks in securing group communication. Most prior research in group key management focused on minimizing computation overhead, in particular minimizing expensive cryptographic operations. However, continued advances in computing power have not been matched by a decrease in network communication delay. Thus, communication latency, especially in high-delay long-haul networks, increasingly dominates the key setup latency, replacing computation delay as the main latency contributor. Hence, there is a need to minimize the size of messages and, especially, the number of rounds in cryptographic protocols. Since most previously proposed group key management techniques optimize computational (cryptographic) overhead, they are particularly impacted by high communication delay. In this work, we discuss and analyze a specific group key agreement technique which supports dynamic group membership and handles network failures, such as group partitions and merges. This technique is very communication-efficient and provably secure against hostile eavesdroppers as well as various other attacks specific to group settings. Furthermore, it is simple, fault-tolerant, and well-suited for high-delay networks.
9445026
Efficient Uplink Scheduler Architecture of Subscriber Station in IEEE 802.16 System
The IEEE 802.16, broadband fixed wireless access standard, defines four service classes, USG, rtPS, nrtPS and BE on high speed wireless networks. To guarantee the QoS requirement of these classes, the subscriber station and base station require scheduling architecture and algorithm. However, the IEEE 802.16 does not define any scheduling architecture or algorithm, and the most existing scheduling mechanisms only focus on working at the BS. In this paper, we propose two types of scheduling architecture working at the SS. In the one-level scheduler, we use a flow queue and class queue by differentiating flows with their class priority. The two-level scheduler can provide more organized QoS service with complementing the one-level scheduler. Adapting these architectures makes scheduler efficiently control all types of traffic defined in the IEEE 802.16. In the proposed architecture, any scheduling algorithms such as SCFQ and EDF can be applied. We evaluate the proposed scheduling architecture by simulation. The results of the simulation show that our proposed architecture can use the bandwidth efficiently.
205099619
Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
We consider a short-term production scheduling problem in a manufacturing system producing products with multi-level product structure, and their components and subassemblies. The problem is to schedule production of components, subassemblies, and final products with the objective of minimizing the weighted sum of tardiness and earliness of the items. We consider due dates of final products, precedence relationships among items, and processing capacity of the manufacturing system. The scheduling problem is solved with simulated annealing and genetic algorithms, which are search heuristics often used for global optimization in a complex search space. To compare the performance of these algorithms with the finite loading method, which is often used in practice, computational experiments are carried out using randomly generated test problems and results are reported.
26568006
Defense Mechanism for Information and Communication Infrastructure