ppxscal/embedding_network huggingface dataset:
A Novel Embedded Intelligent In-Vehicle Transportation Monitoring System Based on i.MX21
Authors: Kaihua Xu, Mi Chen, Yuhua Liu
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

In this paper, we introduces a novel intelligent vehicle transportation monitoring system (NIVTS) based on i.MX21 designed and realized by us, it overcomes drawbacks of traditional vehicle monitoring and it has characteristics of multi-functions, real time. It uses many technologies fusing GPS, GPRS, WebGIS, RS, and is composed mainly by two parts: the Mobile Terminal and Monitoring Center. Especially, GPRS technology is the reliable support for wireless communication smooth transition; then, the principles and the key technologies of Monitoring System are discussed respectively in detail. A novel vehicle scheduling model based on ant colony optimization algorithms are proposed and the course of scheduling tasks is also introduced. The system not only can be used in the vehicles scheduling, but also in the vessel and other fields, and it will reduce workloads of traffic control operators. The solid technical support will be provided for the ITS research.
Real-Time Recognition of Isolated Vowels
Authors: Mara Carvalho, Aníbal Ferreira
Venue: Proceedings of the 4th IEEE tutorial and research workshop on Perception and Interactive Technologies for Speech-Based Systems: Perception in Multimodal Dialogue Systems (2008)

In this paper we present a new approach to the problem of isolated vowel recognition in real-time. Language learning and speech therapy are examples of application areas that require real-time biofeedback of acoustic features. As the performance of known approaches usually drops for child speakers, we evaluated different alternatives of feature extraction and pattern recognition techniques, including PCA, LDA, ANN and Bayesian classification. In addition, we studied the explicit inclusion of pitch as a main parameter in both simulation and the real-time feature extraction process. Best results were obtained with our dataset when MFCCs are mapped, using LDA, to a 4-dimensional subspace that is followed by Bayesian classification. An interactive game was designed that implements the selected real-time vowel recognition technique.
Fast motion estimation using semi-hierarchical approach for the Dirac video codec
Authors: M. Tun, K. K. Loo, J. Cosmas
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

Having fast and efficient motion estimation is crucial in today's advance video compression technique. In this paper, a method which we call semi-hierarchical motion estimation is proposed for the Dirac video encoder. The experimental results show that the proposed method gives two to three times reduction in terms of the number of SAD calculation compared with existing motion estimation algorithm of Dirac for the same motion estimation accuracy, compression efficiency and PSNR. Moreover, depending upon the complexity of the test sequence, the proposed algorithm has the ability to increase or decrease the search range in order to maintain the accuracy of the motion estimation to a certain level.
Study of Security Investment Optimizing Combination Based on PSACO
Authors: Jinyu Tian, Jianhong Ma
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Based on Markowitz’ theory of asset portfolio, a multi-factor and optimal model for portfolio investment in the condition of considering friction factors in China security market is established. A hybrid methodology PSACO (particle swarm ant colony optimization) combining particle swarm optimization with ant colony optimization algorithm is applied to solve the model. Both particle swarm optimization (PSO) and ant colony optimization (ACO) are co-operative, population-based global search swarm intelligence meta-heuristics. PSO is inspired by social behavior of bird flocking or fish schooling, while ACO imitates foraging behavior of real life ants. In this study, we employ a pheromone-guided mechanism to improve the performance of PSO method. Additionally, the model is implemented on the demonstrated research of the index stock of index 30, the result could provide scientific foundation for security investment.
Ruby Topic Maps
Authors: Benjamin Bock
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

Ruby Topic Maps (RTM) is a Topic Maps engine created in and for the Ruby programming language. Its focus is an intuitive and easy to use interface, or (as the creators of Ruby would express it): RTM aims to be the Topic Maps programmer's best friend. The development of this library is a first step to enable Ruby programmers to work with the Topic Maps technology. The library is considered to be useful on its own but also as the basis for higher level tools, e.g. a Ruby on Rails plug-in with an interface like ActiveRecord's.
A new look at survey propagation and its generalizations
Authors: Elitza Maneva, Elchanan Mossel, Martin J. Wainwright
Venue: Journal of the ACM (JACM) (2007)

This article provides a new conceptual perspective on survey propagation, which is an iterative algorithm recently introduced by the statistical physics community that is very effective in solving random k-SAT problems even with densities close to the satisfiability threshold. We first describe how any SAT formula can be associated with a novel family of Markov random fields (MRFs), parameterized by a real number &rho; &isin; [0, 1]. We then show that applying belief propagation---a well-known &ldquo;message-passing&rdquo; technique for estimating marginal probabilities---to this family of MRFs recovers a known family of algorithms, ranging from pure survey propagation at one extreme (&rho; &equals; 1) to standard belief propagation on the uniform distribution over SAT assignments at the other extreme (&rho; &equals; 0). Configurations in these MRFs have a natural interpretation as partial satisfiability assignments, on which a partial order can be defined. We isolate cores as minimal elements in this partial ordering, which are also fixed points of survey propagation and the only assignments with positive probability in the MRF for &rho; &equals; 1. Our experimental results for k &equals; 3 suggest that solutions of random formulas typically do not possess non-trivial cores. This makes it necessary to study the structure of the space of partial assignments for &rho; < 1 and investigate the role of assignments that are very close to being cores. To that end, we investigate the associated lattice structure, and prove a weight-preserving identity that shows how any MRF with &rho; > 0 can be viewed as a &ldquo;smoothed&rdquo; version of the uniform distribution over satisfying assignments (&rho; &equals; 0). Finally, we isolate properties of Gibbs sampling and message-passing algorithms that are typical for an ensemble of k-SAT problems.
A Policy-Based, Secure Access Control Mechanism for Network Roaming Infrastructures
Authors: Tetsuo Imai, Hideaki Goto, Hideaki Sone
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

In the Internet society, IP address is treated as information of organization. This is a problem that visitor uses IP address of visited organization because IP address user of visited organization is treated as a member of the organization. For that, the user's access to home resources may be blocked by firewalls because the user's IP address is not home's one. Therefore an application of authentication and access control is needed. The requirements for authentication and access control method are summarized to six items; (1) getting accessibility to the Internet by using a user credential of the home. (2) keeping accessibility to home resources. (3) keeping a local accessibility to visited resources for the visitor. (4) getting enough security along the wireless/wired channel. (5) authenticating a user, and trusting by the result, and assigning an IP address of visited organization. (6) by the authentication information, keeping accessibility to the Internet by using a home IP address. The authors investigate the existing methods and point out the merit and demerit for these requirements. Finally, the authors propose a method named `Campus Ubiquitous Network.' that fulfill these all requirements.
Adaptive processing of blind source separation through 'ICA with OS'
Authors: Y. B. Archilla
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

Blind source separation problem whose solution is vital in numerous applications in communications. We are proposing a multistage procedure to separate N original sources from N instantaneous mixtures. The goal is to extract the parameters of the unknown mixture in a deflation approach. In each stage of the procedure a novel cost function is applied. The cost function is derived from the properties of the cdf (cumulative density function) to perform an appropriate independent measure by means of order statistics (OS) (unbiased estimator of the cdf). The key-point of this contribution is the adaptive algorithm applied to optimize our cost function using gradient descent techniques.
Thermo-Fluids Provisioning of a High Performance High Density Data Center
Authors: Abdlmonem H. Beitelmal, Chandrakant D. Patel
Venue: Distributed and Parallel Databases (2007)

Consolidation and dense aggregation of slim compute, storage and networking hardware has resulted in high power density data centers. The high power density resulting from current and future generations of servers necessitates detailed thermo-fluids analysis to provision the cooling resources in a given data center for reliable operation. The analysis must also predict the impact on the thermo-fluid distribution due to changes in hardware configuration and building infrastructure such as a sudden failure in data center cooling resources. The objective of the analysis is to assure availability of adequate cooling resources to match the heat load, which is typically non-uniformly distributed and characterized by high-localized power density. This study presents an analysis of an example modern data center with a view of the magnitude of temperature variation and impact of a failure. Initially, static provisioning for a given distribution of heat loads and cooling resources is achieved to produce a reference state. A perturbation in reference state is introduced to simulate a very plausible scenario--failure of a computer room air conditioning (CRAC) unit. The transient model shows the "redlining" of inlet temperature of systems in the area that is most influenced by the failed CRAC. In this example high-density data center, the time to reach unacceptable inlet temperature is less than 80 seconds based on an example temperature set point limit of 40°C (most of today's servers would require an inlet temperature below 35°C to operate). An effective approach to resolve this issue, if there is adequate capacity, is to migrate the compute workload to other available systems within the data center to reduce the inlet temperature to the servers to an acceptable level.
A Semantics for UML-RT using n-calculus
Authors: Juliana de Melo Bezerra, Celso Massaki Hirata
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

UML-RT is a UML real-time profile that allows modeling event-driven and distributed systems. UML-RT is not a formal specification language, therefore it is not possible to do formal verification of UML-RT models. This article proposes formal semantics for UML-RT via mapping of UML-RT communicating elements into n-calculus. The p-calculus is a process algebra to model concurrent systems. A prototype was also developed; it captures information of UML-RT model from RoseRT and generates n-calculus definitions according to the proposed mapping rules. The generated n- calculus definitions use the syntax of HAL-JACK, that is an integrated tool set for the specification, verification and analysis of systems expressed by p-calculus. In the article, we describe the UML-RT to n-calculus mapping, we explain the prototype and we present an example of the mapping.
Using Developer Information as a Factor for Fault Prediction
Authors: Elaine J. Weyuker, Thomas J. Ostrand, Robert M. Bell
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

We have been investigating different prediction models to identify which files of a large multi-release industrial software system are most likely to contain the largest numbers of faults in the next release. To make predictions we considered a number of different file characteristics and change information about the files, and have built fullyautomatable models that do not require that the user have any statistical expertise. We now consider the effect of adding developer information as a prediction factor and assess the extent to which this affects the quality of the predictions.
Compositional State Space Reduction Using Untangled Actions
Authors: Xu Wang, Marta Kwiatkowska
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We propose a compositional technique for efficient verification of networks of parallel processes. It is based on an automatic analysis of LTSs of individual processes (using a failure-based equivalence which preserves divergences) that determines their sets of ''conflict-free'' actions, called untangled actions. Untangled actions are compositional, i.e. synchronisation on untangled actions will not destroy their ''conflict-freedom''. For networks of processes, using global untangled actions derived from local ones, efficient reduction algorithms have been devised for systems with a large number of small processes running in parallel.
3D-reconstruction of complex geological interfaces from irregularly distributed and noisy point data
Authors: Tobias Frank, Anne-Laure Tertois, Jean-Laurent Mallet
Venue: Computers Geosciences (2007)

In this paper we introduce a new, precise and adaptive method for the implicit reconstruction of faulted surfaces with complex geometry from scattered, unorganized points as obtained from seismic data or laser scanners. We embed the point set into a 3d-complex on which a 3d-implicit function is interpolated. The 3d-complex is a set of tetrahedrons and the implicit function represents a surface that lies as close as possible to the input data points. The density of the 3d-complex can be adapted to efficiently control both the precision of the implicit function and the size of triangles of the reconstructed surface. Discontinuities in the topology of the tetrahedral mesh make it possible to reconstruct discontinuous, bounded surfaces and very close parallel patches without introducing unwanted connections (topological ''handles'') between these regions. To compute the implicit function we use the discrete smooth interpolation (DSI) method with a set of boundary, off-boundary and smoothness constraints. The interpolation problem does not primarily depend on the number of input data points but on the magnitude of the 3d-complex. This method can be applied to the construction of faulted horizons and salt-top surfaces.
Generating Web Services for Statistical Survey Packages from Domain-specific Visual Languages
Authors: Chul Hwee Kim, John Hosking, John Grundy
Venue: Proceedings of the Second International Workshop on Incorporating COTS Software into Software Systems: Tools and Techniques (2007)

High-quality, large-scale statistical survey design, data analysis and information visualisation can be very complex. Current statistical COTS software tools provide powerful statistical processing and analysis support but very limited mechanisms for designing, implementing and reusing such support. We have been developing a highlevel, domain-specific visual language, the Survey Design Language (SDL), and associated support tool, SDLTool, in conjunction with statisticians. In this paper we describe SDLTool's support for turning high-level survey design models into widely accessible web services to share complex statistical survey technique implementations run by COTS statistical packages.
Dataflow Analysis of Distributed Programs Using Generalized Marked Nets
Authors: Victor V. Toporkov
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

The satisfiability and algorithmic decidability problems are discussed for message passing models of distributed programs represented as processes communicating through buffers. The satisfiability means that parameters of the buffers are coordinated such that any admissible process histories do not result in appearance of deadlock situations. The decidability problem is reduced to finding the least stable marking on upper semi-lattice of labels of arcs and vertices of the generalized marked net of the distributed program with alternative selections, switches and forks of dataflows. The labels are allowed to be of arbitrary semantic nature. The generalized marked nets represent an algorithmically decidable class of dataflow models of distributed programs.
Towards a European Master Programme on Global Software Engineering
Authors: Patricia Lago, Henry Muccini, Ljerka Beus-Dukic, Ivica Crnkovic, Sasikumar Punnekkat, Hans Van Vliet
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

This paper presents a European Master programme on Global Software Engineering (SE), being put forward by four leading institutions from Sweden, UK, Netherlands and Italy. The Global SE European Master (GSEEM) programme aims to provide students with an excellence in SE based on sound theoretical foundations and practical experience, as well as prepare them to participate in global development of complex and large software systems. GSEEM has been designed with three noteworthy aspects: 1) Three specialization profiles in which the consortium excels: Software Architecting, Real-time Embedded Systems Engineering, and Web Systems and Services Engineering. 2) Two market-driven routes: "professional" to work as professionals, and "scientific" to continue the education towards research degrees. 3) An innovative concept of "shared modules", delivered together by multiple institutions. Four types of shared modules are foreseen: "parallel" twin modules which run remotely between universities, "shifted" modules which teach SE concepts incrementally with shifts in study locations and timeline ,"complementary" modules in which complementary SE concepts are taught in parallel through shared projects, and "common" modules which share the presentations and the project. The profiles realize "integrated knowledge" by complementing partial knowledge available at partner institutions. The paper explains how GSEEM achieves the objectives of educating global software engineers.
EnviroMic: Towards Cooperative Storage and Retrieval in Audio Sensor Networks
Authors: Liqian Luo, Qing Cao, Chengdu Huang, Tarek Abdelzaher, John A. Stankovic, Michael Ward
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

This paper presents EnviroMic, a novel distributed acoustic monitoring, storage, and trace retrieval system. Audio rep- resents one of the least exploited modalities in sensor net- works to date. The relatively high frequency and large size of audio traces motivate distributed algorithms for coordi- nating recording tasks, reducing redundancy of data stored by nearby sensors, filtering out silence, and balancing stor- age utilization in the network. Applications of acoustic monitoring with EnviroMic range from the study of mating rituals and social behavior of animals in the wild to au- dio surveillance of military targets. EnviroMic is designed for disconnected operation, where the luxury of having a basestation cannot be assumed. We implement the system on a TinyOS-based platform and systematically evaluate its performance through both indoor testbed experiments and a preliminary outdoor deployment. Results demonstrate up to a 4-fold improvement in effective storage capacity of the network compared to uncoordinated recording.
Graph Matching Based Authorization Model for Efficient Secure XML Querying
Authors: Seunghan Chang, Artem Chebotko, Shiyong Lu, Farshad Fotouhi
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

XML is rapidly emerging as a standard for data representation and exchange over the World Wide Web and an increasing amount of sensitive business data is processed in the XML format. Therefore, it is critical to have control mechanisms to restrict a user to access only the parts of XML documents that he/she is authorized to access. In this paper, we propose the first DTD-based access control model that employs graph matching to analyze if an input query is fully acceptable, fully rejectable, or partially acceptable, and to rewrite for partially acceptable queries only if necessary, along with the features of optimization and speed-up for query rewriting by introducing an index structure.
Comparison of linear and nonlinear methods of confidence estimation for statistically uncertain systems
Authors: N. V. Medvedeva, G. A. Timofeeva
Venue: Automation and Remote Control (2007)

In this paper, we consider a problem of confidence sets design for the estimation problem with observations in the system that contains both random perturbations with given distributions and uncertain perturbations with information completely defined by the domain of their possible values. Two approaches are compared: the first is based on application of a posteriori distributions and relations of the Kalman filter for systems with uncertain parameters, the other is connected with design of optimal confidence sets. It was shown that nonlinear estimates are better for the estimation problem under consideration.
A generalized computational formulation and model for transport and stoichiometry of multivalent weak analytes in Capillary Electrophoresis techniques
Authors: A. Chatterjee, D. Keating
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

A generalized mathematical and computational model for various Capillary Electrophoresis (CE) techniques is presented. Accurate analysis of these electrokinetic phenomena can only be performed when the chemical interaction of the analytes with the system are taken into consideration. It should also be taken into consideration that majority of constituents in the electrolyte systems are weak, multivalent analytes, which have complex stoichiometric behavior intricately linked with the local transport phenomena. A generalized formulation to couple the association/dissociation stoichiometry of weak analyte with transport phenomena is presented along with a broad, fundamental treatment of macroscopic transport phenomena that will render common approximations like absence of bulk flow, a priori assumption of pH and conductivity, etc., redundant. Novel domain decomposition based Multi-Block Finite Volume scheme is developed and implemented. These formulations and strategy constitute the core of the microfluidics module of MEMS software Intellisuite/sup /spl reg// being developed by Corning Intellisense.