ppxscal/embedding_network huggingface dataset:
Correction of color information of a 3D model using a range intensity image
Authors: Megumi Shinozaki, Masato Kusanagi, Kazunori Umeda, Guy Godin, Marc Rioux
Venue: Computer Vision and Image Understanding (2009)

Most active optical range sensors record, simultaneously with the range image, the amount of light reflected at each measured surface location: this information forms what is called a range intensity image, also known as a reflectance image. This paper proposes a method that uses this type of image for the correction of the color information of a textured 3D model. This color information is usually obtained from color images acquired using a digital camera. The lighting condition for the color images are usually not controlled, thus this color information may not be accurate. On the other hand, the illumination condition for the range intensity image is known since it is obtained from a controlled lighting and observation configuration, as required for the purpose of active optical range measurement. The paper describes a method for combining the two sources of information, towards the goal of compensating for a reference range intensity image is first obtained by considering factors such as sensor properties, or distance and relative surface orientation of the measured surface. The color image of the corresponding surface portion is then corrected using this reference range intensity image. A B-spline interpolation technique is applied to reduce the noise of range intensity images. Finally, a method for the estimation of the illumination color is applied to compensate for the light source color. Experiments show the effectiveness of the correction method using range intensity images.
Depth Estimation Using Variant of Depth of Field by Horizontal Planes of Sharp Focus
Authors: Hiroshi Ikeoka, Takayuki Hamamoto
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

We have been investigating depth estimation techniques using variant of depth of field (DOF) by tilted optics imaging. These techniques can be applied for robotic and automation tasks, because it needs extremely fewer multiple focus images for depth estimation than the conventional passive methods. Hence, our method gets rid of the bottleneck of passive methods with a single camera; the motion speed of optical mechanics is very slower than that of image processing parts. Therefore, it is suitable for the high speed depth estimation like real-time processing accomplished by hardware such as a smart image sensor or an FPGA.
Inputs of Coma: Static Detection of Denial-of-Service Vulnerabilities
Authors: Richard Chang, Guofei Jiang, Franjo Ivancic, Sriram Sankaranarayanan, Vitaly Shmatikov
Venue: Proceedings of the 2009 22nd IEEE Computer Security Foundations Symposium (2009)

As networked systems grow in complexity, they are increasingly vulnerable to denial-of-service (DoS) attacks involving resource exhaustion. A single malicious "input of coma" can trigger high-complexity behavior such as deep recursion in a carelessly implemented server, exhausting CPU time or stack space and making the server unavailable to legitimate clients.These DoS attacks exploit the semantics of the target application, are rarely associated with network traffic anomalies, and are thus extremely difficult to detect using conventional methods.We present SAFER, a static analysis tool for identifying potential DoS vulnerabilities and the root causes of resource-exhaustion attacks before the software is deployed.Our tool combines taint analysis with control dependency analysis to detect high-complexity control structures whose execution can be triggered by untrusted network inputs.When evaluated on real-world networked applications, SAFER discovered previously unknown DoS vulnerabilities in the Expat XML parser and the SQLite library, as well as a new attack on a previously patched version of the wu-ftpd server.This demonstrates the importance of understanding and repairing the root causes of DoS vulnerabilities rather than simply blocking known malicious inputs.
Performance Issues of Selective Disclosure and Blinded Issuing Protocols on Java Card
Authors: Hendrik Tews, Bart Jacobs
Venue: Proceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks (2009)

In this paper we report on the performance of the RSA variants of Brands protocols for zero-knowledge proof and restrictive blinded issuing . The performance is relatively bad: For 4 attributes and an RSA key size of 1280 bits, blinded issuing takes about 10 seconds and the zero-knowledge proof takes about 9 seconds. For 2 attributes the zero-knowledge proof drops to 5 seconds. The poor performance comes from the fact that the cryptographic coprocessor on the Java card can only be employed in very limited ways. With appropriate support of the cryptographic coprocessor both protocols would run much faster.
Application of Multi-scale Principal Component Analysis and SVM to the Motor Fault Diagnosis
Authors: Chen Wenying
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Multi-scale Principal Component Analysis (MSPCA) and Support Vector Machine (SVM) are the modern methods, which have much application in classifications. A novel application of them in the motor fault diagnosis is proposed. The Multi-scales PCA models are constructed by T2 and Q statistics. As the signal features, T2 and Q statistics are fed to train SVM to diagnose fault. The accuracy of monitoring and fault diagnosis is improved and the experiments illustrate the efficiency of the proposed approach.
Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
Authors: David Jao, Kayo Yoshida
Venue: Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography (2009)

The Boneh-Boyen signature scheme is a pairing based short signature scheme which is provably secure in the standard model under the q-Strong Diffie-Hellman assumption. In this paper, we prove the converse of this statement, and show that forging Boneh-Boyen signatures is actually equivalent to solving the q-Strong Diffie-Hellman problem. Using this equivalence, we exhibit an algorithm which, on the vast majority of pairing-friendly curves, recovers Boneh-Boyen private keys in $O(p^{\frac{2}{5}+\varepsilon})$ time, using $O(p^{\frac{1}{5}+\varepsilon})$ signature queries. We present implementation results comparing the performance of our algorithm and traditional discrete logarithm algorithms such as Pollard's lambda algorithm and Pollard's rho algorithm. We also discuss some possible countermeasures and strategies for mitigating the impact of these findings.
State management and concurrency in event processing
Authors: David Jeffery, Alexander Kozlenkov, Adrian Paschke
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

State management in stream and event processing applications is a long-standing problem. There is a conflict between individual stream processing (SP) operators as transformational units, whose purpose is to generate business events, and (explicit) state that evolves with time. In the paper, we propose a new scalable design solution for this problem using functional state transformer (ST) component(s) combined with a traditional stream processor.
Coarse Grained Retrenchment and the Mondex Denial of Service Attacks
Authors: Richard Banach
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Retrenchment is a framework that allows relatively unrestricted system evolution steps to be described in a way that gives an evolution step some formal content --- unlike model based refinement, whence it emerged, which is inapplicable outside some fairly tightly drawn notion of `progress towards implementation'. In this paper, we introduce a `coarse grained' version of retrenchment, relating to system behaviours in the large, and exemplify it on the requirements issues surrounding a Denial of Service case study drawn from the Mondex Purse. We show that the coarse grained retrenchment framework gives a good account of this case study.
Performance Optimization Strategies of High Performance Computing on GPU
Authors: Anguo Ma, Jing Cai, Yu Cheng, Xiaoqiang Ni, Yuxing Tang, Zuocheng Xing
Venue: Proceedings of the 8th International Symposium on Advanced Parallel Processing Technologies (2009)

Recently GPU is widely utilized in scientific computing and engineering applications, owing primarily to the evolution of GPU architecture. Firstly, we analyze some key performance characters of GPU in detail, and the relationships among GPU architecture, programming model and memory hierarchy. Secondly, we present three performance optimization strategies: Prefetching, Streamlizing, and Task Division. Adequate experiments have been done to abstract the relationships among different factors and efficiency. Finally, we map the HPL benchmark to testify our strategies and achieve certain speedup.
Parallelization of a Video Segmentation Algorithm on CUDA---Enabled Graphics Processing Units
Authors: Juan Gómez-Luna, José María González-Linares, José Ignacio Benavides, Nicolás Guil
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Nowadays, Graphics Processing Units (GPU) are emerging as SIMD coprocessors for general purpose computations, specially after the launch of nVIDIA CUDA. Since then, some libraries have been implemented for matrix computation and image processing. However, in real video applications some stages need irregular data distributions and the parallelism is not so inherent. This paper presents the parallelization of a video segmentation application on GPU hardware, which implements an algorithm for abrupt and gradual transitions detection. A critical part of the algorithm requires highly intensive computation for video frames features calculation. Results on three CUDA-enabled GPUs are encouraging, because of the significant speedup achieved. They are also compared with an OpenMP version of the algorithm, running on two platforms with multiples cores.
When is collaborating with friends a good idea? insights from design education
Authors: Heidy Maldonado, Scott R. Klemmer, Roy D. Pea
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Prior research is split on the relationship between prior friendship and performance. Based on our review of the literature, we highlight areas where further research is needed to achieve greater practical applicability of the results. We then present our study measures and preliminary analysis of data collected from a design studio university course. Our quantitative and qualitative probes suggest a link between teammates' prior friendship and lower performance outcomes. We also identify four group processes that may mediate the relationship between friendship and performance.
Research and Simulation of a Fault Diagnosis and Tolerant Algorithm in Gravity Aided Inertial Navigation System
Authors: Bing Xia, Tijing Cai, Zhuopeng Yang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 02 (2009)

Considering the structure and characteristics of gravity aided navigation system and federal filter, the paper presents a new algorithm of the fault detection isolation and system reset. The new fault-tolerant algorithm changes the traditional fault judgment to the filtering convergence judgment. Based on this algorithm a new fault diagnosis and tolerant method is established, and the method is verified by the simulation of gravity aided inertial integrated navigation system with the new fault toleration algorithm. Simulation results show that the new fault diagnosis and tolerant algorithm can efficiently restrain the fault of the gravity measurement unit, play the gravity aided navigation subsystem for best results and enhance the system accuracy and fault-tolerant performance.
Bio-inspired Clustering of Moving Objects
Authors: Ivonne Maricela Avila-Mora, Claudio Castellanos-Sanchez
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

Nowadays several researches have implemented various techniques to solve the problem of clustering data. In this paper we present a visual bio-inspired approach to clustering based on the Conepvim model for visual perception of moving objects in the primary visual cortex (V1) of the human brain. This model uses the Gabor-like filters to detect motion, estimates the global speed, direction and trajectory. We have extended this model with a bio-inspired algorithm: the Self-Organization Maps (SOM) to define how many objects in motion there are in the sequence. Our approach is totally bio-inspired and it has been evaluated on natural sequences of images.
Three Generalizations to a Generic Integrated Test Generation Method for Finite State Machines
Authors: Monika Kapus-Kolar
Venue: The Computer Journal (2009)

In a previous paper, we proposed a generic test generation method for deterministic implementations of deterministic finite state machines. The method supports a wide class of testing strategies, multi-criteria optimization and integrated handling of all the usual optimization concerns. The present paper generalizes the method to an even wider class of strategies, to non-deterministic machines and to machines handling data. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Analysis and Evaluation on the Rear-End Crash of the Car with a Dummy
Authors: Guangyao Zhao, Liyang Xie, Yunpeng Guo, Jinghong Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Based on a certain type car, the finite element model for whole car was developed in which the space occupied by the 50th percentile Hybrid III dummy and safety-belt restraint system. According to the basic principle of the dynamic explicit non-linear FEM, an equation describing the rear-end crash process and finite element discretization equation were given. Then the rear-end crash was simulated and analyzed, Solving the responses of structure deformation, the time curve of acceleration and energy absorption and dissipation during the whole crash process , as well as the response of dummy and the performance indicators including head, chest, thigh etc.. The energy absorption effect of the main energy-absorption components, and the state of fuel tank safety and driving safety during the rear-end crash process were analyzed. A more comprehensive evaluation of the car during the rear-end crash process and crash performance was achieved.
Security in RFID and Sensor Networks, 1st edition
Authors: Yan Zhang, Paris Kitsos
Venue:  (2009)

In the past several years, there has been an increasing trend in the use of Radio Frequency Identification (RFID) and Wireless Sensor Networks (WSNs) as well as in the integration of both systems due to their complementary nature, flexible combination, and the demand for ubiquitous computing. As always, adequate security remains one of the open areas of concern before wide deployment of RFID and WSNs can be achieved. Security in RFID and Sensor Networks is the first book to offer a comprehensive discussion on the security challenges and solutions in RFID, WSNs, and integrated RFID & WSNs, providing an essential reference for those who regularly interface with these versatile technologies.Exposes Security RisksThe book begins with a discussion of current security issues that threaten the effective use of RFID technology. The contributors examine multi-tag systems, relay attacks, authentication protocols, lightweight cryptography, and host of other topics related to RFID safety. The book then shifts the focus to WSNs, beginning with a background in sensor network security before moving on to survey intrusion detection, malicious node detection, jamming, and other issues of concern to WSNs and their myriad of applications. Offers Viable SolutionsIn each chapter, the contributors propose effective solutions to the plethora of security challenges that confront users, offering practical examples to aid in intuitive understanding. The last part of the book reviews the security problems inherent in integrated RFID & WSNs. The book ends with a glimpse of the future possibilities in these burgeoning technologies and provides recommendations for the proactive design of secure wireless embedded systems.
An early real-time checker for retargetable compile-time analysis
Authors: Emilio Wuerges, Luiz C. V. dos Santos, Olinto Furtado, Sandro Rigo
Venue: Proceedings of the 22nd Annual Symposium on Integrated Circuits and System Design: Chip on the Dunes (2009)

With the demand for energy-efficient embedded computing and the rise of heterogeneous architectures, automatically retargetable techniques are likely to grow in importance. On the one hand, retargetable compilers do not handle real-time constraints properly. On the other hand, conventional worst-case execution time (WCET) approaches are not automatically retargetable: measurement-based methods require time-consuming dynamic characterization of target processors, whereas static program analysis and abstract interpretation are performed in a post-compiling phase, being therefore restricted to the set of supported targets. This paper proposes a retargetable technique to grant early real-time checking (ERTC) capabilities for design space exploration. The technique provides a general (minimum, maximum and exact-delay) timing analysis at compile time. It allows the early detection of inconsistent time-constraint combinations prior to the generation of binary executables, thereby promising higher design productivity. ERTC is a complement to state-of-the-art design flows, which could benefit from early infeasiblity detection and exploration of alternative target processors, before the binary executables are submitted to tight-bound BCET and WCET analyses for the selected target processor.
Bayesian Inference on QGARCH Model Using the Adaptive Construction Scheme
Authors: Tetsuya Takaishi
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

We study the performance of the adaptive construction scheme for a Bayesian inference on the Quadratic GARCH model which introduces the asymmetry in time series.In the adaptive construction scheme a proposal density in the Metropolis-Hastings algorithm is constructed adaptively by changing the parameters of the density to fit the posterior density.Using artificial QGARCH data we infer the QGARCH parameters by applying the adaptive construction scheme to the Bayesian inference of QGARCH model.We find that the adaptive construction scheme samples QGARCH parameters effectively, i.e.correlations between the sampled data are very small.We conclude that the adaptive construction scheme is an efficient method to the Bayesian estimation of the QGARCH model.
Supporting Multidisciplinary Teams and Early Design Stages Using Storyboards
Authors: Mieke Haesen, Jan Meskens, Kris Luyten, Karin Coninx
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

Current tools for multidisciplinary teams in user-centered software engineering (UCSE) provide little support for the different approaches of the various disciplines in the project team. Although multidisciplinary teams are getting more and more involved in UCSE projects, an efficient approach to communicate clearly and to pass results of a user needs analysis to other team members without loss of information is still missing. Based on previous experiences, we propose storyboards as a key component in such tools. Storyboards contain sketched information of users, activities, devices and the context of a future application. The comprehensible and intuitive notation and accompanying tool support presented in this paper will enhance communication and efficiency within the multidisciplinary team during UCSE projects.
A New Approach to Protect the OS from Off-line Attacks Using the Smart Card
Authors: Hossein Rezaei Ghaleh, Shahin Norouzi
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Since the present computer systems use layered and modular architectures and execute the instructions in a number of different phases, therefore it has become an imperative to establish a trusted chain between various layers. It usually is integrity checking by hashing of executable codes. With guarantee of software integrity, the web servers and other network entities can trust to client systems or workstations. Several methods have been proposed for this purpose, each of them have their own advantages and weakness. Recently a group of big software and hardware companies working in Information Technology field known as Trusted Computing Group (TCG) are engaged in designing and making standards of various aspects of trusted computer systems including applications, PCs, networks, cryptography modules and so on. These standards can make the system trusted, but they need some hardware changes such as BIOS and Trusted Platform Module (TPM). These changes are not applicable for present systems and we have to purchase new hardware. This paper is an attempt at propose a new method that can make the present systems trusted. This method uses are movable trusted storage that is compatible with TCG storage standard.
Shared device driver model for virtualized mobile handsets
Authors: François Armand, Michel Gien, Gilles Maigné, Gregory Mardinian
Venue: Proceedings of the First Workshop on Virtualization in Mobile Computing (2008)

One of the major expected benefits of hardware virtualization in mobile handsets is the ability to use a peripheral device, for which an original device driver has been written for a particular operating system, from applications running on other operating systems. The savings and new opportunities generated by avoiding writing multiple device drivers for the same peripheral because for different operating systems (Symbian, Windows, Linux, and proprietary real-time operating systems) are tremendous, and relevant to the whole eco-system (chipset and hardware peripheral vendors, device manufacturers, Independent Software Vendors (ISVs), service providers and even end-users. This paper quantifies the scope of the problem in terms of investments, time and effort, and lost opportunities. The authors then propose an architecture based on a virtualization layer, allowing sharing and control of physical peripheral device drivers among multiple execution environments running/hosting different operating systems. The paper concludes with a discussion on research topics generated by such distributed device driver architecture within a single handset, in the areas of performance optimization, sharing policies to guarantee quality of service, access control policies, dependability (stop and restart of a device driver), power management optimization, and partial or incremental system reconfiguration.
Design of the Energy Monitoring System for Motors Corporation
Authors: Wenfeng Wang, Wei Long, Zhi Zhang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

This paper designs an energy monitoring system for a certain Motors Corporation in China based on not only the technology of combining Industrial Field Bus with Industrial Ethernet but also other technologies. System's main functions, hardware configuration, network structure, as well as the development of application software are all discussed in this article. Statistical data collected from that Motors Corporation since the system was put into operation shows that the monitoring system has brought good energy-management effects to the Motors Corporation.