ppxscal/embedding_network huggingface dataset:
Efficient coordination and transmission of data for cooperative vehicular safety applications
Authors: C. L. Robinson, L. Caminiti, D. Caveney, K. Laberteaux
Venue: Proceedings of the 3rd international workshop on Vehicular ad hoc networks (2006)

This paper presents a method for efficient exchanges of Data Elements between vehicles running multiple safety applications. To date, significant efforts have been made in designing lower-layer communication protocols for VANET. Also, industry and government agencies have made progress in identifying and implementing certain vehicular safety applications. However, the specific environment of VANET-enabled safety applications lends itself to significant efficiencies in how information is coordinated within a vehicle and transmitted to neighboring vehicles. These efficiencies are instantiated in what we call the Message Dispatcher. The Message Dispatcher is an interface between multiple safety applications and the lower-layer communication stack. This Message Dispatcher concept was recently contributed to the Society of Automotive Engineers (SAE) and has become an underlying principle in their safety message standardization process. It has also been implemented in vehicle demonstrations at the Toyota Technical Center (TTC) in Ann Arbor, MI.
Making knowledge explicit: how hard it is
Authors: Vladimir Brezhnev, Roman Kuznets
Venue: Theoretical Computer Science (2006)

Artemov's logic of proofs LP is a complete calculus of propositions and proofs, which is now becoming a foundation for the evidence-based approach to reasoning about knowledge. Additional atoms in LP have form t: F, read as "t is a proof of F" (or, more generally, as "t is an evidence for F") for an appropriate system of terms t called proof polynomials. In this paper, we answer two well-known questions in this area. One of the main features of LP is its ability to realize modalities in any S4-derivation by proof polynomials thus revealing a statement about explicit evidences encoded in that derivation. We show that the original Artemov's algorithm of building such realizations can produce proof polynomials of exponential length in the size of the initial S4-derivation. We modify the realization algorithm to produce proof polynomials of at most quadratic length. We also found a modal formula, any realization of which necessarily requires self-referential constants of type c: A(c). This demonstrates that the evidence-based reasoning encoded by the modal logic S4 is inherently self-referential.
GPU Rendering of the Thin Film on Paints with Full Spectrum
Authors: Roman Durikovic, Ryou Kimura
Venue: Proceedings of the conference on Information Visualization (2006)

Spectrum-based rendering uses spectral distributions instead of just three RGB colors for representation of light sources and surface properties in rendering equation. Since, spectrum has a value at every visible wavelength, the spectrum-based rendering gives much accurate color computation compared to RGB-based rendering and it give us opportunity to simulate wavelength dependent phenomena and effects caused by spectrum difference. We introduce a novel framework for spectrum-based rendering on GPU (Graphics Processing Unit) to compute local illumination. On this framework, the Phong reflectance model is implemented employing the spectral power distribution of light source and the spectral reflectance of surface simulating the color rendition of light sources and metamerism of surfaces. Multilayered thin film interference effects can also be handled within this framework with interactive speeds. Additionally, we propose the area light source defined by the spectral cube environment map and show the method for conversion of RGB environment map into a spectral one.
Unknown signal wavelength and array processing
Authors: A. P. -C. Ng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

DOA estimation using an array of sensors requires precise knowledge of the wavelength /spl lambda/ of the incident signal. This paper considers the case when /spl lambda/ is unknown or imprecisely known and shows that an inherent ambiguity prevents a linear array from resolving wavelength and DOA simultaneously. This problem does not arise in non-linear arrays, and an algorithm is presented for estimating DOA and wavelength.
A Generic Parallel Computing Model for the Distributed Environment
Authors: Chi-Chang Chen, Meng-Xiang Chen
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In the paper, we propose a generic parallel computing model for the distributed computing platforms. This model is built on the top of the popular CORBA middleware in order to ensure easy distribution of the software components along the participating computers. We use the concept of factory objects in the model to create slave objects dynamically to fulfill the master/slave parallel computing paradigm. The speedup of the experiment programs using our proposed model is measured and compared with the corresponding MPI implementation. The experiment results show that our model is not only a feasible model for designing parallel programs with CORBA but also an efficient way in comparison to the MPI implementation.
Implementing A Successful Secure Coding Continuing Education Curriculum For Industry: Challenges and Successful Strategies
Authors: Kenneth L. Ingham
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

Most industry software engineers have little experience designing and building secure systems; features and time-to-market have been their focus. With the rising demand for secure software, there is a corresponding increased need for continuing education classes to improve engineers' skills. This type of course has different challenges from academic classes; these differences are because continuing education courses have no grades and they run all day for several consecutive days. This paper describes these classes and presents an overview of topics covered in the classes, providing example exercises. Challenges in offering such classes are discussed and solutions are presented.
A conceptual model for the creation of supply chain simulation models
Authors: Guilherme E. Vieira, Osmar César Júnior
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper presents the development of conceptual models that can be used in the creation of certain types of supply chain simulation projects. The supply chain considered is composed of four elements: suppliers, manufacturer, retailers, and the consumer market. The presented ideas can be used in supply chain simulation projects, which objective can be, for instance, to study the bullwhip effect or new collaboration practices. ARENA simulation models using the conceptual models presented are currently under development.
A New Routing Algorithm in Triple-Based Hierarchical Interconnection Network
Authors: Qiao Baojun, Shi Feng, Ji Weixing
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Triple-based hierarchical interconnection network (THIN) is not only a new kind of direct networks but also a kind of HIN's. Efficient routing algorithm is very essential to the performance of the interconnection network and the parallel computing system. This paper presents DDRA (Distributed Deterministic Routing Algorithm) routing algorithm in triple-based hierarchical interconnection network. Fully applying the hierarchical characteristic of the network, DDRA routing algorithm just uses the node address to determine an approximate minimal path between source and destination node, without constructing the route table on each node. The analysis based on the simulation of DDRA shows it is not only very simple and easy to be implemented in hardware, but has high efficiency.
What value is Microsoft's .Net to discrete event simulations?
Authors: Adelaide Carvalho, Michael Pidd
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Developers of simulation software have responded to the increasing demand for customised solutions by adding new features and tools to their simulation packages. This has led to monolithic applications with functionalities constantly extended by addition of templates, add-ons, etc in a generalising-customising-generalising development cycle. Though successful so far, this approach may be approaching its limit. An alternative approach is to compose simulation packages from prefabricated components that users may select, modify and assemble to acquire functionality to suit each model. This approach requires component-based paradigms and integration mechanisms. We investigate the value of .Net integration philosophy for development of discrete event simulation models. The DotNetSim prototype is used to investigate how software components developed within different packages can be linked into a single simulation application deployed as web services. DotNetSim consists of a graphical modelling environment and a base simulation engine.
Visual Activation in Prefrontal Cortex is Stronger in Monkeys than in Humans
Authors: Katrien Denys, Wim Vanduffel, Denis Fize, Koen Nelissen, Hiromasa Sawamura, Svetlana Georgieva, Rufin Vogels, David Van Essen, Guy A. Orban
Venue: Journal of Cognitive Neuroscience (2004)

The prefrontal cortex supports many cognitive abilities, which humans share to some degree with monkeys. The specialized functions of the prefrontal cortex depend both on the nature of its inputs from other brain regions and on distinctive aspects of local processing. We used functional MRI to compare prefrontal activity between monkey and human subjects when they viewed identical images of objects, either intact or scrambled. Visual object-related activation of the lateral prefrontal cortex was observed in both species, but was stronger in monkeys than in humans, both in magnitude (factors 2&ndash;3) and in spatial extent (fivefold or more as a percentage of prefrontal volume). This difference was observed for two different stimulus sets, at two field strengths, and over a range of tasks. These results suggest that there may be more volitional control over visual processing in humans than in monkeys.
An Automatic Method to Extract Data from an Electronic Contract Composed of a Number of Documents in PDF Format
Authors: Thomas Kwok, Thao Nguyen
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

An electronic contract can encompass a large number of collateral contract documents in PDF format. These contract documents are of different contract document types and converted from different original formats. Data extraction and thus data mining for this kind of electronic contracts is very difficult. In this paper, we present a novel method to automatically extract contract data from this kind of electronic contracts. Our automatic electronic contract data extraction system comprises an administrator module, a PDF parser, a pattern recognition engine and a contract data extraction engine. The administrator module provides templates for inputting document patterns and a list of contract data tags for each contract document type. It also constructs the pattern matrices and stores them in a database. The PDF parser converts the contract PDF document into the contract text document with the insertion of formatting bookmarks, such as a new page, paragraph or line. The pattern recognition engine determines a list of contract document types in the electronic contract by comparing and matching the patterns of all known contract document types with the pattern of the contract text document. The contract data extraction engine retrieves the corresponding list of contract data tags and then extracts contract data accordingly for each contract document type on the list. Our automatic electronic contract data extraction system has found to be very accurate, efficient and useful in extracting contract data for data mining.
Covert Speech Arrest Induced by rTMS over Both Motor and Nonmotor Left Hemisphere Frontal Sites
Authors: Lisa Aziz-zadeh, Luigi Cattaneo, Magali Rochat, Giacomo Rizzolatti
Venue: Journal of Cognitive Neuroscience (2005)

Blocking the capacity to speak aloud (overt speech arrest, SA) may be induced by repetitive transcranial magnetic stimulation (rTMS). The possibility, however, of blocking internal speech (covert SA) has not been explored. To investigate this issue, we conducted two rTMS experiments. In the first experiment, we stimulated two left frontal lobe sites. The first was a motor site (left posterior site) and the second was a nonmotor site located in correspondence to the posterior part of the inferior frontal gyrus (IFG) (left anterior site). The corresponding right hemisphere nonmotor SA site was stimulated as a control. In the second experiment, we focused on the right hemisphere and stimulated a right hemisphere motor site (right posterior site), and, as control sites, a right hemisphere nonmotor site corresponding to the IFG (right anterior site) and a left hemisphere anteromedial site (left control). For both experiments, participants performed a syllable counting task both covertly and overtly for each stimulation site. Longer latencies in this task imply the occurrence of an overt and/or covert SA.All participants showed significantly longer latencies when stimulation was either over the left posterior or the left anterior site, as compared with the right hemisphere site (Experiment 1). This result was observed for the overt and covert speech task alike. During stimulation of the posterior right hemisphere site, a dissociation for overt and covert speech was observed. An overt SA was observed but there was no evidence for a covert SA (Experiment 2). Taken together, the results show that rTMS can induce a covert SA when applied to areas over the brain that are pertinent to language. Furthermore, both the left posterior/motor site and the left anterior/IFG site appear to be essential to language elaboration even when motor output is not required.
Expanding the Possibilities for Enterprise Computing: Multi-Agent Autonomic Architectures
Authors: Gilda Pour
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Enterprise computing faces major challenges such as ever-increasing size and complexity and escalating costs of administering mission-critical IT systems, numerous human-caused failures and outages of IT systems, lack of sufficient supply of trained system administrators, and major obstacles in dealing with changes throughout the software system life cycle. Thus, it is practically impossible to rely on human intervention and administration for development, integration, deployment, and management of enterprise IT systems in mission critical applications. This has led to the development of autonomic computing that is derived from human body's self-regulatory nervous system. Autonomic computing is an emerging trend for building nextgeneration enterprise IT systems. Autonomic systems are envisioned to be self-aware and able to selfmanage. The focus of our research is to develop multi-agent autonomic architectures. The application domains range from telehealth and telemedicine to quality management and space exploration. This paper presents our multi-agent autonomic architecture design.
Meta Clustering
Authors: Rich Caruana, Mohamed Elhawary, Nam Nguyen, Casey Smith
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Clustering is ill-defined. Unlike supervised learning where labels lead to crisp performance criteria such as accuracy and squared error, clustering quality depends on how the clusters will be used. Devising clustering criteria that capture what users need is difficult. Most clustering algorithms search for optimal clusterings based on a pre-specified clustering criterion. Our approach differs. We search for many alternate clusterings of the data, and then allow users to select the clustering(s) that best fit their needs. Meta clustering first finds a variety of clusterings and then clusters this diverse set of clusterings so that users must only examine a small number of qualitatively different clusterings. We present methods for automatically generating a diverse set of alternate clusterings, as well as methods for grouping clusterings into meta clusters. We evaluate meta clustering on four test problems and two case studies. Surprisingly, clusterings that would be of most interest to users often are not very compact clusterings.
Globally Optimal Interactive Boundary Extraction Using Markov Chain Modeling
Authors: Christina Pavlopoulou, Avi Kak
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We present a novel boundary-based (discontinuity tracking) hierarchical statistical criterion to address the interactive contour extraction problem. Our criterion relies on a Markov Chain representation of the boundary and can be efficiently optimized using Dijkstra's algorithm for solving the shortest paths problem. Unlike other criteria optimized with Dijkstra's algorithm, ours is capable of extracting geometrically complex boundaries even when the features incorporated in the objective function are based only on user markings on a small part of the image. The critical quantity in our criterion that yields the above-mentioned results is a normalization factor that boosts the probability of a particular boundary segment based on the candidate boundary segments in its vicinity. Although similar in spirit to the technique of non-maximum suppression routinely employed in edge detection, our method boosts gradually the probability of a particular segment given its surroundings using windows of increasing size in a hierarchical fashion.
Ternary Codes From Modified Hadamard Matrices
Authors: Xueqin Jiang, MoonHo Lee, Sergey A. Stepanov, KwangJe Lee, KimSung Hun
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

In this paper we construct two families C*m and C*m of ternary (2^m ,3^m ,2^m-1) and (2^m ,3^m+1,2^m-1) codes, for m =1,2,3,.., derived from the corresponding families of modified ternary Hadamard matrices. These codes are close to the Plotkin bound and have a very easy decoding procedure.
Threat and Fraud Intelligence, Las Vegas Style
Authors: Jeff Jonas
Venue: IEEE Security and Privacy (2006)

Matching and relating identities is of the utmost importance for Las Vegas casinos. The author describes a specific matching technique known as identity resolution. This approach provides superior results over traditional identity matching systems.
Evaluation of Intensity and Color Corner Detectors for Affine Invariant Salient Regions
Authors: Nicu Sebe, Theo Gevers, Sietse Dijkstra, Joost van de Weije
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Global features are commonly used to describe the image content. The problem with this approach is that these features cannot capture all parts of the image having different characteristics. Therefore, local computation of image information is necessary. By using salient points to represent local information, more discriminative features can be computed. This research is based on an existing affine invariant local feature detector, in which the features are assumed to be intensity corners. First, the existing algorithm is extended with the intensity based SUSAN corner detector which fundamentally differs from the original Harris corner detector. Second, the algorithm is extended to incorporate color information into the detection process. This results in a comparison between three different detection algorithms: the intensity based algorithm using the Harris or SUSAN detector and a color based algorithm that uses two color extended Harris detectors. The different algorithms are compared in terms of invariance and distinctiveness of the regions and computational complexity.
Clustering with Bregman Divergences
Authors: Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon, Joydeep Ghosh
Venue: The Journal of Machine Learning Research (2005)

A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In this paper, we propose and analyze parametric hard and soft clustering algorithms based on a large class of distortion functions known as Bregman divergences. The proposed algorithms unify centroid-based parametric clustering approaches, such as classical <tt>kmeans</tt>, the Linde-Buzo-Gray (LBG) algorithm and information-theoretic clustering, which arise by special choices of the Bregman divergence. The algorithms maintain the simplicity and scalability of the classical <tt>kmeans</tt> algorithm, while generalizing the method to a large class of clustering loss functions. This is achieved by first posing the hard clustering problem in terms of minimizing the loss in Bregman information, a quantity motivated by rate distortion theory, and then deriving an iterative algorithm that monotonically decreases this loss. In addition, we show that there is a bijection between regular exponential families and a large class of Bregman divergences, that we call regular Bregman divergences. This result enables the development of an alternative interpretation of an efficient EM scheme for learning mixtures of exponential family distributions, and leads to a simple soft clustering algorithm for regular Bregman divergences. Finally, we discuss the connection between rate distortion theory and Bregman clustering and present an information theoretic analysis of Bregman clustering algorithms in terms of a trade-off between compression and loss in Bregman information.
Proposal of Incremental Sliding Mode Control
Authors: Yinxing Hao, Jianqiang Yi, Dongbin Zhao, Wei Wang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

An incremental sliding mode controller for a class of second-order underactuated systems is proposed to achieve asymptotic stability and favorable performance. The second-order underactuated systems include two subsystems. Firstly, two state variables of a subsystem are chosen to construct the first-layer sliding surface. Secondly, the first-layer sliding surface and one of the left state variables are used to construct the second-layer sliding surface. The last sliding surface is constructed by the second-layer sliding surface and the left state variable. This proposed design method is applied to investigate the decoupled control of an inverted pendulum. The simulation results show the validity of incremental sliding mode control. At the same time, we analyze the way to construct the sliding surfaces and a rule of selecting parameters to construct the sliding surfaces.