ppxscal/embedding_network huggingface dataset:
The Traffic-Flow Detection Based on Pseudo-Random Coded Radar
Authors: Jun Zhang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

A new traffic flow detection system based on pseudo-random coded (PRC) cw radar is studied and developed in this paper. The proposed system can measure the speed of vehicles at a high resolution. The speed can be measured by the Doppler principle, and in the system the good correlation performance of PRC is used to get a high resolution of range and eliminate the interference from nearby lane vehicles. The digital signal processor transforms and processes the signal in time-frequency domain, and gains the vehicle velocity and flow rate rapidly and accurately.
Structure-aware error diffusion
Authors: Jianghao Chang, Benoît Alain, Victor Ostromoukhov
Venue: ACM SIGGRAPH Asia 2009 papers (2009)

We present an original error-diffusion method which produces visually pleasant halftone images while preserving fine details and visually identifiable structures present in the original images. Our method is conceptually simple and computationally efficient. The source image is analyzed, and its local frequency content is detected. The main component of the frequency content (main frequency, orientation and contrast) serve as lookup table indices to a pre-calculated database of modifications to a standard error diffusion. The modifications comprise threshold modulation and variation of error-diffusion coefficients. The whole system is calibrated in such a way that the produced halftone images are visually close to the original images (patches of constant intensity, patches containing sinusoidal waves of different frequencies/orientations/contrasts, as well as natural images of different origins). Our system produces images of visual quality comparable to that presented in [Pang et al. 2008], but much faster. When processing typical images of linear size of several hundreds of pixels, our error-diffusion system is two to three orders of magnitude faster than [Pang et al. 2008]. Thanks to its speed combined with high visual quality, our error-diffusion algorithm can be used in many practical applications which may require digital halftoning: printing, visualization, geometry processing, various sampling techniques, etc.
Designed on the Low Cost System Framework of Road Condition Recognition Based on Roadside Multi-sensors
Authors: Xiumin Chu, Yong Wu
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

It is very important for traffic guidance and control to collect the information of road conditions in the adverse weather. Because the road condition collecting systems along highway are incomplete in the current, the inspecting density, efficiency, and content of the road condition collecting systems don’t meet highway demands of traffic control. A low cost road condition recognition system is design in this paper. Firstly, the function and designing principle of the road condition collecting system is put forward, furthermore the system framework based on roadside multi-sensors is designed. Secondly, the data filter of road weather and road images are analyzed, and the recognition flow about the visibility and slippery road are put forward. Finally, the software function of the collecting road condition are put forward, which include data collecting, data processing, data storing, data transferring, and long-distance controlling, and the modules of every software function are analyzed.
Spatial perspectives in event processing
Authors: Nir Zolotorevsky, Opher Etzion, Yuri G. Rabinovich
Venue: Proceedings of the Third ACM International Conference on Distributed Event-Based Systems (2009)

The processing of geo-spatial events plays an increasingly important role in constructing enterprise applications that can immediately react to business critical events. In this short paper we introduce spatial and spatio-temporal extensions to the event processing model, we will motivate spatio-temporal partitioning using notion of contexts and spatio-temporal patterns. This is an early report of a comprehensive work to formally define the notion of multidimensional context in general and particularly spatio-temporal context, using event processing language.
Research on Container Terminal Scheduling System Based on Multi-agent
Authors: Zhao Hui, Sun Junqing
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

In the near future, most container terminals will no longer be able to expand its surrounding land and will thus be unable to meet the storage requirements due to the boom in world trade. A solution is to improve utilization of the available resources. This paper presents a multi-agent theory based system for resource allocation and operation scheduling problems in container terminal to improve the productivity. The system defines distinct agent for ship, berth, quay cranes, yard crane, container truck and other factors. Solutions were determined with the intelligent character of agent and through the interaction among agents. Subsequently a partial implemented prototype of this system is given. Finally, a running instance in container terminal was simulated whose result excels the previous data to validate the feasibility of the methodology.
A Novel Swarm Model With Quasi-oppositional Particle
Authors: Chang Zhang, Zhiwei Ni, Zhangjun Wu, Lichuan Gu
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

This paper proposes an enhanced version of the Opposition-Based PSO (OCLPSO) that we call the quasi-oppositional comprehensive learning particle swarm optimizers (QCLPSO). OCLPSO employs opposition based learning (OBL) for population initialization and also for exemplar selecting. Instead of opposition numbers, QCLPSO uses quasi opposite particles, which is generated from the interval between the median and the opposite position of the particle. Mathematical proof shows that quasi-opposite particles have a higher chance to be closer to the optimum than opposite particles in problems without apriori information. Experiments were conducted on benchmark functions and comparisons between the original CLPSO, OCLPSO and the QCLPSO are presented. The results are very promising, as the new algorithm outperforms CLPSO and OCLPSO in terms of convergence speed and global search ability.
Application Study of PS-DInSAR Technique Fusing Multi-metadata in Urban Ground Deformation Survey
Authors: Sichun Long, Tao Li, Jingnan Liu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

PS-DInSAR technique fusing multi-metadata and its basic flow are expounded considering limitations of conventional D-InSAR in atmospheric delay and space-time decoherence. It is held that multi-metadata helps to weaken the influence of systematic error and improve the surveying precision and model steadiness of PS-DInSAR. Tianjing City is surveyed in PS-DInSAR fusing ENVISAT ASAR from 2003 to 2007,GPS,SRTM3-DEM and leveling data, which greatly weakens the influence of atmospheric delay, space-time decoherence and systematic error. The precise deformation of the studied area in that period is obtained.
On the analysis of queries with counting constraints
Authors: Everardo Bárcenas, Pierre Genevès, Nabil Layaïda
Venue: Proceedings of the 9th ACM symposium on Document engineering (2009)

We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select portions of documents subject to transformations. We explore how recent results on the static analysis of navigational aspects of XPath can be extended to counting constraints. The static analysis of this combined XPath fragment allows to detect bugs in transformations and to perform many kinds of optimizations of document transformations. More precisely, we study how a logic for finite trees capable of expressing upward and downward recursive navigation, can be equipped with a counting operator along regular path expressions.
Vision Module for Mini-robots Providing Optical Flow Processing for Obstacle Avoidance
Authors: Teerapat Chinapirom, Ulf Witkowski, Ulrich Rueckert
Venue: Proceedings of the FIRA RoboWorld Congress 2009 on Advances in Robotics (2009)

This paper presents a flexible prototyping platform that can be efficiently used for vision systems of small mobile robots. The vision module has been integrated into the mini-robot "Khepera". The module is utilized to realize optical flow algorithm for obstacle avoidance. The obstacles are detected from abrupt change of the normal flow vectors during operation. This technique is also inspired by visual perception of insects, which alert when an object suddenly appears nearby them. The optical flow algorithm implemented for this approach is Sum of Absolute Differences (SAD) algorithm. The SAD is programmed using the hardware description language (VHDL) efficiently utilizing the FPGA device that is the central processing device of the module. The 30x16 pixels used in SAD for block matching are computed in parallel by 16 pairs of pixels in each operation, which allows in real-time operation. Therefore, the mini-robot being equipped with our 2D vision module for the real-time image processing is able to drive autonomously without collision with obstacles, called ego-motion. The result also shows that the implementation can reduce the execution time compared to serial implementation and helps to reduce energy consumption.
Structural models of algorithms in problems of applied programming. II. Structural-algorithmic approach to software simulation
Authors: V. I. Shynkarenko, V. M. Ilman, V. V. Skalozub
Venue: Cybernetics and Systems Analysis (2009)

Relations existing between algorithms that are variously represented and are performed on various execution units are formalized. The process of software development is considered in the context of development and transformation of models. Possible applications of the structural-algorithmic approach are analyzed in various aspects of applied programming. Problems of analyzing algorithms in the context of execution of programs on computers are formulated.
Efficient Vertical Mining of Frequent Closures and Generators
Authors: Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few miners address both concerns, typically by applying levelwise breadth-first traversal. As depth-first traversal is known to be superior, we examine here the depth-first FCI/FG-mining. The proposed algorithm, Touch, deals with both tasks separately, i.e., uses a well-known vertical method, Charm, to extract FCIs and a novel one, Talky-G, to extract FGs. The respective outputs are matched in a post-processing step. Experimental results indicate that Touch is highly efficient and outperforms its levelwise competitors.
Game Analysis of Copyright Protection of Software Products under Network Condition
Authors: Xiaobo Yin, Hong Liu
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Aiming at the phenomenon that the pirate software predominates over the software market, based on the cost characteristics and network externality of software products, this paper analyzes the situation that the software manufacturers are confronted with when taking loose and strict strategies for copyright protection of software, and offers the countermeasures to the software manufacturers.
Target Acquisition with Force Feedback: The Effect of Different Forces on the User's Performance
Authors: Joan Boeck, Lode Vanacken, Karin Coninx
Venue: Proceedings of the 4th International Conference on Haptic and Audio Interaction Design (2009)

Besides realistic haptic rendering of objects, haptic feedback can also be used to provide an abstract feedback channel. This can either be realised by a tactile or a force feedback stimulus. When using forces, care has to be taken that the user's performance is not influenced in a negative way. However, as it is not obvious to determine a suitable force, and currently not many guidelines exist. Therefore, in this paper we investigate the influence on some important parameters that define a force (shape, duration and amplitude). In order to compare different forces, we propose to use the definite integral (Force Integral, FI) which combines the considered parameters. From the conducted experiment we learn that the FI can be used (within bounds) to make an estimation of the result of the force. Besides this, we also found that above a given FI value, the user's performance degrades significantly.
A Query Cache Tool for Optimizing Repeatable and Parallel OLAP Queries
Authors: Ricardo Jorge Santos, Jorge Bernardino
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

On-line analytical processing against data warehouse databases is a common form of getting decision making information for almost every business field. Decision support information oftenly concerns periodic values based on regular attributes, such as sales amounts, percentages, most transactioned items, etc. This means that many similar OLAP instructions are periodically repeated, and simultaneously, between the several decision makers. Our Query Cache Tool takes advantage of previously executed queries, storing their results and the current state of the data which was accessed. Future queries only need to execute against the new data, inserted since the queries were last executed, and join these results with the previous ones. This makes query execution much faster, because we only need to process the most recent data. Our tool also minimizes the execution time and resource consumption for similar queries simultaneously executed by different users, putting the most recent ones on hold until the first finish and returns the results for all of them. The stored query results are held until they are considered outdated, then automatically erased. We present an experimental evaluation of our tool using a data warehouse based on a real-world business dataset and use a set of typical decision support queries to discuss the results, showing a very high gain in query execution time.
Modelling and simulation of moving contact line problems with wetting effects
Authors: Sashikumaar Ganesan, Lutz Tobiska
Venue: Computing and Visualization in Science (2009)

This paper presents a numerical scheme for computing moving contact line flows with wetting effects. The numerical scheme is based on Arbitrary Lagrangian Eulerian (ALE) finite elements on moving meshes. In the computations, the wetting effects are taken into account through a weak enforcement of the prescribed equilibrium contact angle into the model equations. The equilibrium contact angle is included in the variational form of the model by replacing the curvature with Laplace Beltrami operator and integration by parts. This weak implementation allows that the contact angle determined by the numerical scheme differs from the equilibrium value and develops a certain dynamics. The Laplace Beltrami operator technique with an interface/boundary resolved mesh is well-suited for describing the dynamic contact angle observed in experiments. We consider the spreading and the pendant liquid droplets to investigate this implementation of the contact angle. It is shown that the dynamic contact angle tends to the prescribed equilibrium contact angle when time goes to infinity. However, the dynamics of the contact angle is influenced by the slip at the moving contact line.
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
Authors: Kazumaro Aoki, Yu Sasaki
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

Preimage resistance of several hash functions has already been broken by the meet-in-the-middle attacks and they utilize a property that their message schedules consist of only permutations of message words. It is unclear whether this type of attacks is applicable to a hash function whose message schedule does not consist of permutations of message words. This paper proposes new attacks against reduced SHA-0 and SHA-1 hash functions by analyzing a message schedule that does not consist of permutations but linear combinations of message words. The newly developed cryptanalytic techniques enable the meet-in-the-middle attack to be applied to reduced SHA-0 and SHA-1 hash functions. The attacks find preimages of SHA-0 and SHA-1 in 2156.6 and 2159.3 compression function computations up to 52 and 48 steps, respectively, compared to the brute-force attack, which requires 2160 compression function computations. The previous best attacks find preimages up to 49 and 44 steps, respectively.
Fuzzy Comprehensive Evaluation on Cleaning Performance of Sugarcane Harvester
Authors: Fanglan Ma, Shangping Li, Shi Liang, Yuanling Chen
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

The cleaning performance of sugarcane harvester is influenced by many factors. In order to find out the effects on the cleaning performance the orthogonal experiment is integrated with fuzzy comprehensive evaluation to study the remainder ratio of leaf. First, the orthogonal experiment is carried out on different parameter combinations to research the influences of different targets on the cleaning element. Then, the fuzzy comprehensive evaluation method is used to dispose the experiment results. Finally, the evaluation results are combined with the range analysis of orthogonal experiment to determine the optimal parameter combination. Therefore, the multi-target experiment is changed into single-target experiment. The research shows that using fuzzy comprehensive evaluation can get better application effect.
Towards Enhanced Retrieval of Biological Models through Annotation-Based Ranking
Authors: Dagmar Köhn, Carsten Maus, Ron Henkel, Martin Kolbe
Venue: Proceedings of the 6th International Workshop on Data Integration in the Life Sciences (2009)

Modelling and simulation methods gain increasing importance for the understanding of biological systems. The growing number of available computational models makes support in maintenance and retrieval of those models essential to the community. This article discusses which model information are helpful for efficient retrieval and how existing similarity measures and ranking techniques can be used to enhance the retrieval process, i. e. the model reuse. With the development of new tools and modelling formalisms, there also is an increasing demand for performing search independent of the models' encoding. Therefore, the presented approach is not restricted to certain model storage formats. Instead, the model meta-information is used for retrieval and ranking of the search result. Meta-information include general information about the model, its encoded species and reactions, but also information about the model behaviour and related simulation experiment descriptions.
Research on Telerobotic System Based on ARM Core Processor
Authors: Xiaojun Zhao, Mingwei Ren, Yunfei Li, Haixia Su, Lei Chen, Fei Wang
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

This paper discusses an embedded and teleoperation technology-based, the use of Internet to achieve real-time remote device control system,embedded ARM processor S3C2410 as a network server, CAN bus as a multi-robot remote control bus operating system.It realizes bilateral communication between control command and feedback data of the master-slave robot, and enhances the performance of stability. The simulation experimental results demonstrate that the system is accurate and available.
Translating Preferred Answer Set Programs to Propositional Logic
Authors: Vernon Asuncion, Yan Zhang
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and practical interests: on one hand, it will shed new insights to understand the expressive power of preferred answer set programs; on the other hand, it may also lead to efficient implementations for computing preferred answer sets of logic programs. In this paper, we focus on Brewka and Eiter's preferred answer set programs. We propose a translation from preferred answer set programs to propositional logic and show that there is one-to-one correspondence between the preferred answer sets of the program to the models of the resulting propositional theory. We then link this result to Brewka and Eiter's weakly preferred answer set semantics.
FRANz
Authors: Markus Riester, Peter F. Stadler, Konstantin Klemm
Venue: Bioinformatics (2009)

Summary: We present a software package for pedigree reconstruction in natural populations using co-dominant genomic markers such as microsatellites and single nucleotide polymorphisms (SNPs). If available, the algorithm makes use of prior information such as known relationships (sub-pedigrees) or the age and sex of individuals. Statistical confidence is estimated by Markov Chain Monte Carlo (MCMC) sampling. The accuracy of the algorithm is demonstrated for simulated data as well as an empirical dataset with known pedigree. The parentage inference is robust even in the presence of genotyping errors. Availability: The C source code of FRANz can be obtained under the GPL from http://www.bioinf.uni-leipzig.de/Software/FRANz/. Contact: markus@bioinf.uni-leipzig.de
New Interaction Concepts by Using the Wii Remote
Authors: Michael Schreiber, Margeritta Wilamowitz-Moellendorff, Ralph Bruder
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

The interaction concept of the video game console Nintendo Wii has created a furor in the interface design community due to its intuitive interface: the Wii Remote. At the Institute of Ergonomics (IAD) of the Darmstadt University of Technology, several projects investigated the potential of interaction concepts with the Wii Remote, especially in nongaming contexts. In a first study an interactive whiteboard according to [1] was recreated, modified and evaluated. In this case, the Wii Remote is not the human-machine-interface but the sensor that detects an infrared emitting (IR) pencil. A survey with 15 subjects was conducted in which different IR pencils were evaluated. In a second study the potential of a gesture based human-computer interaction with the help of the Wii-Remote according to [2] was evaluated by using a multimedia software application. In a survey with 30 subjects, the Wii gesture interaction was compared to a standard remote control.