ppxscal/embedding_network huggingface dataset:
A Simulation of Vehicle Lateral Stability Based on Fuzzy PID Control
Authors: Yihu Wu, Cui Wang, Li Zhou, Linli Ou
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

In order to improve the lateral stability of the vehicles at a high speed, a parameter self-tuning fuzzy PID Control method to control the yaw moment couple with side slip angle of the front wheel is proposed, and a Fuzzy PID controller is designed. Based on Vehicle dynamic model analysis, and by using MATLAB / Simulink software, vehicle’s yaw rate and the side slip angle of the front at the step steering condition and the sine steering condition is simulated. The simulation results show that, compared to the vehicle only under ABS control, vehicle by fuzzy PID controller could reduce the yaw rate and the side slip angle of the front and back wheels effectively. Further more, the vehicle’s motion can be controlled in a stable region. Thus, the lateral stability of vehicles is improved.
Exploiting Locality on the Cell/B.E. through Bypassing
Authors: Pieter Bellens, Josep M. Perez, Rosa M. Badia, Jesus Labarta
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

Cell Superscalar (CellSs) provides a simple, flexible and easy programming approach for the Cell Broadband Engine (Cell/B.E.) that automatically exploits the inherent concurrency of applications at a function or task level. The CellSs environment is based on a source-to-source compiler that translates annotated C or Fortran code and a runtime library tailored for the Cell/B.E. that orchestrates the concurrent execution of the application. In the context of our parallel runtime we analyse the effect of the bandwidth of the Element Interconnect Bus (EIB) on an application's performance. We introduce a technique called bypassing that potentially increases the observed bandwidth and improves the execution time for applications with a distributed computation pattern. Although the integration of bypassing with CellSs is work in progress we present results for five fundamental linear algebra kernels to demonstrate the applicability of bypassing and to attempt to quantify the benefit that can be reaped.
Lift Measurement System of Bionic Fins Stabilizer at Zero Speed
Authors: Yu Wang, Chunmei Hua
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

Ship fins stabilizer is a kind of anti rolling ship technique that the fins could produce lift with higher speed. Zero speed fins stabilizer run in the condition that ship is anchored or sailing at lower speed. Lift is produced by initiative swing of fins. The rolling forces of ocean waves could be counteracted by the lift and so the ship could be stabilized. For the lift measurement of zero speed fins stabilizer, the lift control concept is introduced into the anti rolling ship and the lift sensor is designed that take into account the factor of fixing of the sensor in the actual ship and the coupling factors. The integrated lift signals have sufficient precision by synthesizing arithmetic of feedback signals, and the designed measurement system of lift could satisfied the requirement of anti rolling ship at zero forward speed.
Privacy-Preserving Policy-Based Information Transfer
Authors: Emiliano Cristofaro, Stanislaw Jarecki, Jihye Kim, Gene Tsudik
Venue: Proceedings of the 9th International Symposium on Privacy Enhancing Technologies (2009)

As the global society becomes more interconnected and more privacy-conscious, communication protocols must balance access control with protecting participants' privacy. A common current scenario involves an authorized party (client) who needs to retrieve sensitive information held by another party (server) such that: (1) the former only gets the information for which it is duly authorized, (2) the latter does not learn what information information is retrieved. To address this scenario, in this paper, we introduce and explore the concept of Privacy-preserving Policy-based Information Transfer (PPIT). We construct three PPIT schemes based, respectively, on: RSA, Schnorr and IBE techniques. We then investigate various performance improvements and demonstrate the practicality of proposed PPIT schemes.
A New Digital Signature Scheme with Threshold Subliminal Channel
Authors: Xin Xiangjun, Zhi Guizhen
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

To improve the security and efficiency of the signature scheme with threshold subliminal channel, by using the Lagrange interpolating polynomial and the Schnorr signature scheme under modular n, a new digital signature scheme with (t, l) threshold subliminal channel is proposed. In the new scheme, the subliminal channel can be used efficiently. On the other hand, under the hardness assumptions of factoring RSA modular and computing discrete logarithm, the proposed scheme can be proved to be secure against resending subliminal message attack, forgery attack and conspiracy attack.
A New Evolutionary Optimization Algorithm Based on Super-individual
Authors: Shun-jiu Wang, Xin-li Zhang, Chang-jian Ni
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

According to evolutionary principle, a new evolutionary optimization algorithm based on super-individual (SIEA) is presented. In the SIEA, the population is generated based on super-individual, and the complex process in genetic algorithm (GA) is not required. At last, several typical optimization problems including extremum, multivariable and NiH problem are used to test the efficiency of the SIEA. The results show the SIEA has good performance, which can be a new method to solve complicated optimization problems.
Flight Searching --- A Comparison of Two User-Interface Design Strategies
Authors: Antti Pirhonen, Niko Kotilainen
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part III: Ubiquitous and Intelligent Interaction (2009)

The most usable user-interface is not necessarily the most popular. For example, the extent to which an interaction is based on graphics can depend highly on convention rather than usability. This study compares contemporary flight search applications in order to investigate whether a more extensive use of graphics can enhance usability. Two user-interfaces are compared: one follows the ideal principles of graphical user-interfaces and direct manipulation, while the second interface requires text to be entered with a keyboard. The results of the comparison indicate that even an early prototype of the graphics based alternative performed better than the typical formula based search application for several measurements of usability.
Kernel principal component analysis for the classification of hyperspectral remote sensing data over urban areas
Authors: Mathieu Fauvel, Jocelyn Chanussot, Jón Atli Benediktsson
Venue: EURASIP Journal on Advances in Signal Processing (2009)

Kernel principal component analysis (KPCA) is investigated for feature extraction from hyperspectral remote sensing data. Features extracted using KPCA are classified using linear support vector machines. In one experiment, it is shown that kernel principal component features are more linearly separable than features extracted with conventional principal component analysis. In a second experiment, kernel principal components are used to construct the extended morphological profile (EMP). Classification results, in terms of accuracy, are improved in comparison to original approach which used conventional principal component analysis for constructing the EMP. Experimental results presented in this paper confirm the usefulness of the KPCA for the analysis of hyperspectral data. For the one data set, the overall classification accuracy increases from 79% to 96% with the proposed approach.
Status of Municipal Wastewater Treatment in Some Cities of India
Authors: Rajendra Prasad Singh, Jiang Ying he, Praveen Mathur
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

Sewage discharge creates a serious environmental pollution in water resources. This is the one of the biggest pollution problem in India. The rapid growths of the population, the technological and industrial boom have brought enormous problems and degradation of the environment. Effective collection and treatment of municipal wastewater is a critical problem in a fast developing country like India. The present paper includes cities of Indore, Delhi, Kanpur, Tiruchirappalli and Pune. This paper highlights the present wastewater treatment status in these cities. The suggestions could be made for utilizing the treated sewage wastewater for agriculture, growing greens etc.
A Simple Distributed Conflict-Driven Answer Set Solver
Authors: Enrico Ellguth, Martin Gebser, Markus Gusowski, Benjamin Kaufmann, Roland Kaminski, Stefan Liske, Torsten Schaub, Lars Schneidenbach, Bettina Schnor
Venue: Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning (2009)

We propose an approach to distributed Answer Set Solving based on Message Passing. Our approach aims at taking advantage of modern ASP solvers rather than proposing a genuine yet involved parallel ASP solver. To this end, we rely upon a simple master-worker architecture in which each worker amounts to an off-the-shelf ASP solver augmented with a separate communication module being only lightly connected to the actual solver. The overall communication is driven by the workers' communication modules, which asynchronously exchange messages with the master. We have implemented our approach and report upon an empirical study demonstrating its computational impact.
Modeling the Image-Processing Behavior of the NASA Voyager Mission with ASSL
Authors: Emil Vassev, Mike Hinchey
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

NASA exploration missions increasingly rely on the concepts of autonomic computing, exploiting these to increase the survivability of remote missions, particularly when human tending is not feasible. This paper presents initial results of long-term research targeted at the design and implementation of prototype models for future Voyager-like missions that rely on principles of autonomic computing. Here, we employ the Autonomic System Specification Language (ASSL) to build a formal model and to generate a prototype for the image-processing behavior of the NASA Voyager Mission. This helps to validate existing features and perform experiments through simulation. Moreover, this prototype lays the basis for future experiments whereby autonomic features are added in a stepwise manner.
The fast recursive row-Householder subspace tracking algorithm
Authors: Peter Strobach
Venue: Signal Processing (2009)

We introduce a new sequential algorithm for tracking the principal subspace and, optionally, the r dominant eigenvalues and associated eigenvectors of an exponentially updated covariance matrix of dimension NxN, where N>r. The method is based on an updated orthonormal-square (QS) decomposition using the row-Householder reduction. This new subspace tracker reaches a dominant complexity of only 3Nr multiplications per time update for tracking the principal subspace, which is the lower bound in dominant complexity for an algorithm of this kind. The new method is completely reflection based. An updating of inverse matrices is not used.
A Spatio-Temporal Isotropic Operator for the Attention-Point Extraction
Authors: Roman M. Palenichka, Marek B. Zaremba
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

It is proposed to extract multi-location image features at maxima points of a spatio-temporal attention operator, which indicates locations with high intensity contrast, region homogeneity, shape saliency and temporal change. The scale-adaptive estimation of local change (motion) and its aggregation with the region shape saliency contribute to robust detection of moving objects. Experiments on the accuracy of interest-point detection have proved the operator consistency and its high potential for object detection in image sequences.
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
Authors: Chenyu Yan, Yang Xiang, Feodor F. Dragan
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can assign each vertex of an n---vertex UDG G a compact O(log2 n)-bit label such that, given the label of a source vertex and the label of a destination, it is possible to compute efficiently, based solely on these two labels, a neighbor of the source vertex that heads in the direction of the destination. We prove that this routing labeling scheme has a constant hop route-stretch (= hop delay), i.e., for each two vertices x and y of G, it produces a routing path with h(x,y) hops (edges) such that h(x,y) ≤ 3·d G (x,y) + 12, where d G (x,y) is the hop distance between x and y in G. To the best of our knowledge, this is the first compact routing scheme for UDGs which not only guaranties delivery but has a low hop delay and polylog label size. Furthermore, our routing labeling scheme has a constant length route-stretch.
Study on Saturation Flow Rates for Signalized Intersections
Authors: Guoqiang Zhang, Jun Chen
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Past research has indicated that the effectiveness and efficiency of traffic control of signalized intersections strongly depend on the accurate calculation of saturation flow rate, particularly when demand approaches capacity. Minimal work has been done in the past on calibration of the parameters for saturation flow rate used in traffic control of signalized intersections. This paper discusses a saturation flow study conducted in Nanjing City, the Capital of Jiangsu Province, which lies in the east of China. Using linear regression analysis, average time headway of saturation flow rate for nine signalized intersections has been studied. Base saturation flow rate and heavy vehicle equivalency factor have been calculated. The results confirm that the methodology for saturation flow rates, put forward by Highway Capacity Manual (HCM) can also be used in China. However, parameters should be systematically calibrated, based upon widespread study, before they can be used effectively in the practice of traffic control in China.
Model-Based Control Scheme for Networked Multi-rate Sampling Systems
Authors: Jin Jin, Zhiwen Wang, Dongsong Luo
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

In this paper, control problem of model-based networked control systems (MB-NCSs) with multi-rate input sampling is considered. Two classes of transmission policies termed as perfect transmission and delay transmission are investigated. Necessary and sufficient conditions for system to be globally exponentially stable are derived.
Similarity Retrieval of Video Database Based on 3D Z-string
Authors: Ping Yu, Chein-Shung Hwang, NaiWen Kuo
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 02 (2009)

Recently, the video retrieval processing is concerned with retrieving videos that are relevant to the users’ requests from a large collection of videos, referred to as a video database. We have proposed 3D Z-string to represent symbolic videos accompanying with the string generation and video reconstruction algorithms. In this paper, we proposed the spatial-temporal similarity retrieval approach of vides in 3D Z-string. Our approach defines a set of user assigned weights, based on the factors of spatial-temporal relations of object pairs in a video, in order to rank the retrieval videos. We use dynamic programming to calculate the similarity measures and propose the similarity retrieval algorithm. By providing various criterion of similarity between videos to match user requirement, our proposed similarity retrieval algorithm has discrimination power about different criteria.
A statistical constraint dependency grammar (CDG) parser
Authors: Wen Wang, Mary P. Harper
Venue: Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together (2004)

CDG represents a sentence's grammatical structure as assignments of dependency relations to functional variables associated with each word in the sentence. In this paper, we describe a statistical CDG (SCDG) parser that performs parsing incrementally and evaluate it on the Wall Street Journal Penn Treebank. Using a tight integration of multiple knowledge sources, together with distance modeling and synergistic dependencies, this parser achieves a parsing accuracy comparable to several state-of-the-art context-free grammar (CFG) based statistical parsers using a dependency-based evaluation metric. Factors contributing to the SCDG parser's performance are analyzed.
Decomposition formulas for Srivastava's hypergeometric function HA on Saran functions
Authors: Mamasali Turaev
Venue: Journal of Computational and Applied Mathematics (2009)

By using some techniques based upon certain inverse pairs of symbolic operators, the author investigates several decomposition formulas associated with Srivastava's hypergeometric function H"A in three variables. The operator identities involving these pairs of symbolic operators are first constructed for this purpose. By means of these operator identities, as many as ten decomposition formulas are then found, which are expressed through the aforementioned triple hypergeometric function in terms of Saran's hypergeometric functions.
Profit sharing auction
Authors: Sandip Sen, Teddy Candale, Susnata Basak
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

Auctions are a class of multi-party negotiation protocols. Classical auctions try to maximize social welfare by selecting the highest bidder as the winner. If bidders are rational, this ensures that the sum of profits for all bidders and the seller is maximized. In all such auctions, however, only the winner and the seller make any profit. We believe that "social welfare distribution" is a desired goal of any multiparty protocol. In the context of auctions, this goal translates into a rather radical proposal of profit sharing between all bidders and the seller. We propose a Profit Sharing Auction (PSA) where a part of the selling price paid by the winner is paid back to the bidders. The obvious criticism of this mechanism is the incentive for the seller to share its profit with nonwinning bidders. We claim that this loss can be compensated by attracting more bidders to such an auction, resulting in an associated increase in selling price. We run several sets of experiments where equivalent items are concurrently sold at a First Price Sealed Bid, a Vickrey, and a PSA auction. A population of learning bidders repeatedly choose to go to one of these auctions based on their valuation for the good being auctioned and their learned estimates of profits from these auctions. Results show that sellers make more or equivalent profits by using PSA as compared to the classical auctions. Additionally, PSA always attracts more bidders, which might create auxiliary revenue streams, and a desirable lower variability in selling prices. Interestingly then, a rational seller has the incentive to share profits and offer an auction like PSA which maximizes and distributes social welfare.
An Improved Localization Algorithm for Wireless Sensor Network Using a Mobile Anchor Node
Authors: Baoli Zhang, Fengqi Yu, Zusheng Zhang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

In this paper, we present an improved localization algorithm for wireless sensor network using a mobile anchor node which is equipped with a GPS receiver to obtain its position. The mobile anchor node moves around in a sensor area to broadcast beacon messages which include its location information. Each stationary sensor node takes the position as a beacon point and calculates its location by computing the intersection area of its communication coverage. After the first round localization, the un-localized sensor nodes can compute their locations with the help of localized stationary sensor nodes. Simulation results show that the accuracy of our proposed localization scheme is better than that of the other schemes using mobile anchor nodes.
Behavior Model Based Recognition of Critical Pilot Workload as Trigger for Cognitive Operator Assistance
Authors: Diana Donath, Axel Schulte
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

Knowledge-based assistant systems are an approach to support operators in complex task situations, especially in vehicle guidance and control. The central idea is to introduce automation functions working in parallel to the human operator instead of replacing him. Like a human team member, an assistant system should be able to support a human operator according to his actual needs. Therefore, it needs capabilities to identify situations in which the human operator is overtaxed in order to transfer such situations into situations which can be handled normally by the assisted human operator. This paper will present a concept for a human behavior model based approach to subjective workload identification which uses a recognizable modification of human behavior occurring prior to severe performance decrements or errors. Therefore, behavior models of the operator, previously gathered within simulator trials, shall continuously compared with the actually observed behavior patterns in the same situational context. First results will be presented showing a modification of operator visual scanning behavior.
Topic Difficulty Prediction in Entity Ranking
Authors: Anne-Marie Vercoustre, Jovan Pehcevski, Vladimir Naumovski
Venue: Advances in Focused Retrieval: 7th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2008, Dagstuhl Castle, Germany, December 15-18, 2008. Revised and Selected Papers (2009)

Entity ranking has recently emerged as a research field that aims at retrieving entities as answers to a query. Unlike entity extraction where the goal is to tag the names of the entities in documents, entity ranking is primarily focused on returning a ranked list of relevant entity names for the query. Many approaches to entity ranking have been proposed, and most of them were evaluated on the INEX Wikipedia test collection. In this paper, we show that the knowledge of predicted classes of topic difficulty can be used to further improve the entity ranking performance. To predict the topic difficulty, we generate a classifier that uses features extracted from an INEX topic definition to classify the topic into an experimentally pre-determined class. This knowledge is then utilised to dynamically set the optimal values for the retrieval parameters of our entity ranking system. Our experiments suggest that topic difficulty prediction is a promising approach that could be exploited to improve the effectiveness of entity ranking.