ppxscal/embedding_network huggingface dataset:
Using Ontology-Based Traffic Models for More Efficient Decision Making of Autonomous Vehicles
Authors: Ralf Regele
Venue: Proceedings of the Fourth International Conference on Autonomic and Autonomous Systems (2008)

The paper describes how a high-level abstract world model can be used to support the decision-making process of an autonomous driving system. The approach uses a hierarchical world model and distinguishes between a low-level model for the trajectory planning and a high-level model for solving the traffic coordination problem. The abstract world model used in the CyberCars-2 project is presented. It is based on a topological lane segmentation and introduces relations to represent the semantic context of the traffic scenario. This makes it much easier to realize a consistent and complete driving control system, and to analyze, evaluate and simulate such a system.
Module and Distortion Analysis for Video Decoding on Mobile Devices
Authors: Wen Ji, Yiqiang Chen, Chen Lei, Huiguo Zhang, Hui Wang, Yunbing Xing, Bo Tang
Venue: Proceedings of the Seventh International Conference on Networking (2008)

The appearance of the new AVS standard offers opportunities for low power implementations of video encoders and decoders suitable for a wide range of mobile applications. AVS is the recent video coding standard developed by the Audio and Video Coding Standard Workgroup of China, which promises similar performance but lower complexity compared with H.264. This paper presents the complexity analysis of the video decoder, especially for AVS decoder via empirical experiments, and provides the influence of the decoder modules on distortion, which is valuable for power saving video decoder designing.
Image based modelling with VideoTrace
Authors: Anton van den Hengel, Anthony Dick
Venue: ACM SIGGRAPH Computer Graphics (2008)

Image based modeling (IBM) combines aspects of computer vision, graphics and interface design. Practitioners in each field have approached IBM within the context of their own discipline, but recently systems have emerged that harness the strengths of each. In this article we discuss approaches to IBM, the development of our own system VideoTrace, and applications now and in the future.
Annotating Web archives-structure, provenance, and context through archival cataloguing
Authors: P. H. J. Wu, A. K. H. Heok, I. P. Tamsir
Venue: The New Review of Hypermedia and Multimedia (2007)

Despite the success of Internet access via search technology, such ease of access is still not available in Web archives, as a greater amount of relevant contextual information is essential in accessing Web archives. The degree of relevance of the contextual information has to be customized to suit research on culture and heritage study over time. Information scientists have long been struggling to find a system that can help them organize Web archives so that users can have access to complete and coherent collections. Lessons can be learned from archivists who have an established tradition of linking materials to its origin and ownership or what is termed provenance. In this paper, we demonstrate how Web Annotation for Web Intelligence, more than just an intuitive way of expressing one's thoughts on the materials under study, is in fact an appropriate tool for cataloguing Web archives in order to ensure a high quality of access for users. Informed by the theory of Records Continuum, a demonstration of access to archived Web materials will be presented. We then recommend an effective way of allowing the continual organization of Web archives based on several design principles for a Web annotation system. This system would preserve the evidence and context of the cataloguing process. Such a tool would also help facilitate collaboration among information professionals in organizing complex Web archives. Implementing the recommended Web annotation system will help ensure better-quality archives with more evidence and contextual information preserved within the system.
Model reference neural predictive controller for induction motor drive
Authors: M. Ouhrouche, A. Merabet, R. T. Bui
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In this paper an accurate nonlinear model of induction motor using an artificial neural network (ANN) is given. This modeling technique is done by using the data from the system inputs/outputs information without requiring the knowledge about machine parameters. The ANN training is carried out off-line using the Levenberg-Marquardt algorithm. Then, the proposed neural network model is used as predictor for predictive control with reference model to track speed and flux profiles, where the cost function is minimized by Newton-Raphson method. Results of simulation show that the proposed model is accurate under both transient and steady state conditions.
Forecasting the Impact of the Irregular Events with DIPA Methodology
Authors: Jinrong Zhu
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The impact of the irregular events on oil futures markets is so great that it is even superior to the variation tendency of the time series itself. In order to forecast the influence of the irregular events on oil futures price, based on the thorough analysis of the impact process of irregular events in oil futures markets, four concepts, which include direction, intensity, persistence and attenuation model, are introduced. Then a methodology called DIPA is proposed for events impact analysis in this paper. Empirical research shows the presented method can forecast the impact of irregular events on oil futures markets more preferably.
UAQ: a framework for user authorization query processing in RBAC extended with hybrid hierarchy and constraints
Authors: Yue Zhang, James B. D. Joshi
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

A key issue in RBAC systems is how to efficiently handle the user authorization process. That is, whether or not to grant a user's request to acquire a set of requested permissions or to activate a set of requested roles in a single session. The presence of hybrid hierarchies as well as the cardinality and dynamic separation of duty constraints make the issue more complex. In this paper, we define this issue as the user authorization query problem consisting of a role mapping problem and an activation checking problem. We also propose a set of algorithms to solve the role mapping and the activation checking problems. We show that our model is practical and flexible, and can deal with various cases in presence of the hybrid hierarchy and cardinality/DSoD constraints.
Filter Banks for Prediction-Compensated Multiple Description Coding
Authors: Jing Wang, Jie Liang
Venue: Proceedings of the Data Compression Conference (2008)

This paper investigates the design and application of the optimal filter banks for a prediction-compensated multiple description coding (PC-MDC) scheme, where the coefficients in each subband are split into two descriptions. Each description also includes the prediction residuals of the data in the other description. The optimal designs of orthogonal and biorthogonal filter banks with multiple-level decompositions are formulated in a unified framework. The optimal results in all cases are found to be very close to the optimal filter banks in traditional single description coding. This allows us to apply the proposed method to existing systems with single-description-optimized filter banks and still enjoy near-optimal performance. Image coding results in the JPEG 2000 framework show that the proposed method achieves similar or better performance than other methods. It also has lower complexity and is more compatible to the JPEG 2000 standard.
On the Optimization of Resource Utilization in Distributed Multimedia Applications
Authors: R. Yang, R. D. van der Mei, D. Roubos, F. J. Seinstra, G. M. Koole
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

The application and research area of Multimedia Content Analysis (MMCA) considers all aspects of the automated extraction of new knowledge from large multimedia data streams and archives. In recent years, there has been a tremendous growth in theMMCA application domain (for real-time and off-line execution scenarios alike), and this growth is likely to continue in the near future. Multimedia applications operated in a real-time environment pose very strict requirements on the obtained processing times, while off-line applications have to perform within `tolerable' time frames. To meet these requirements, large-scale multimedia applications typically are being executed on Grid systems consisting of large collections of compute clusters. For optimized use of resources, it is essential to determine the optimal number of compute nodes per cluster, properly dealing with the perceived computation versus communication ratio. This ratio generally depends on the characteristics of the application at hand, and on the software and hardware specifics of the computational environment.Motivated by these observations, in this paper we develop a simple and easy-to-implement method to determine the "optimal" number of parallel compute nodes. The method is based on the classical binary search method for non-linear optimization, and does not depend on the, usually unknown, specifics of the system. Extensive experimental validation on a real distributed systemshows that our method is indeed highly effective.
Corner-based keypoints for scale-Invariant detection of partially visible objects
Authors: Andrzej Sluzek
Venue: Machine Graphics Vision International Journal (2006)

Local features (also known as interest points, keypoints, etc.) are a popular and powerful tool for matching images and detecting partially occluded objects. While the problems of photometric distortions of images and rotational invariance of the features have satisfactory solutions, satisfactorily simple seale-invariant algorithms do not exist yet. Generally, either computationally complex methods of scale-space (multi-scale approach) are used, or the correct scale is estimated using additional mechanisms. The paper proposes a new category of keypoints that can be used to develop a simple scale-invariant method for detecting known objects in analyzed images. Keypoints are defined as locations at which selected moment-based parameters are consistent over a wide range of different-size circular patches around the keypoint. While the database of known objects (i.e. the keypoints and their descriptions) is still built using a multi-scale approach, analyzed images are scanned using only a single-scale window and its sub-window. The paper focuses on the keypoint building and keypoint matching principles. Higher-level issues of hypotheses building and verification (regarding the presence of objects in analyzed images) are only briefly discussed.
Schizophrenia Genes: Characteristics of Function and Protein Interaction Networks
Authors: Jingchun Sun, Leng Han, Zhongming Zhao
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Schizophrenia is a heritable complex disease that involves multiple genes interacting themselves or with environment. Its genetic mechanisms have not been well understood. Currently, studies have revealed hundreds of genes associated with schizophrenia. This provides us an opportunity to explore the molecular characteristics of schizophrenia genes (SCZGenes) using genomics and systems biology approaches. In this study, we selected SCZGenes based on the published association studies and examined their functional features by comparing to the neurodevelopmental genes and control genes. We revealed that SCZGenes have strong correlation with neurodevelopment and other functional term. We further investigated the topological characteristics of SCZGenes in the human protein interaction network. We found that SCZGenes do not tend to encode hub proteins; rather they interact in a modest degree. Finally, we extracted SCZGenes subnetworks, which may be further analyzed with other information.
The Long Arc Behind Bill Gates' Wealth, Part 2
Authors: Shane Greenstein
Venue: IEEE Micro (2008)

Bill Gates brought Microsoft to dominance through participation in a competitive meritocracy; later he subverted the principles behind the very system that had made him wealthy. Greenstein continues his analysis of Gates' career, focusing especially on Microsoft's browser wars with Netscape and the eventual antitrust trial.
Optical Manipulation of Azimuthally Polarized Beam Altered by Phase Plate
Authors: Xiumin Gao, Song Hu, Jian Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

The ring focus evolution of the azimuthally polarized beam induced by a pure two-portion phase plate is investigated. The pure phase plate consists of two concentric portions, center circle portion, and outer annular portion. When the phase of the center portion is π, one ring focus may evolve into novel focal patterns with increasing radius of the center circle portion, such as cylindrical crust focus, two-ring focus, and three-ring focus. And if the geometrical parameters keep unchanged, focal patterns also changes considerably with tunable phase of the center portion. Ring focus shifts along optical axis with the increasing phase. The ring focus altered by the phase plate can be used in optical manipulation and material processing technologies.
Towards an optimal separation of space and length in resolution
Authors: Jakob Nordström, Johan Håstad
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Most state-of-the-art satisfiability algorithms today are variants of the DPLL procedure augmented with clause learning. The main bottleneck for such algorithms, other than the obvious one of time, is the amount of memory used. In the field of proof complexity, the resources of time and memory correspond to the length and space of resolution proofs. There has been a long line of research trying to understand these proof complexity measures, as well as relating them to the width of proofs, i.e., the size of the largest clause in the proof, which has been shown to be intimately connected with both length and space. While strong results have been proven for length and width, our understanding of space is still quite poor. For instance, it has remained open whether the fact that a formula is provable in short length implies that it is also provable in small space (which is the case for length versus width), or whether on the contrary these measures are completely unrelated in the sense that short proofs can be arbitrarily complex with respect to space. In this paper, we present some evidence that the true answer should be that the latter case holds and provide a possible roadmap for how such an optimal separation result could be obtained. We do this by proving a tight bound of Theta(√(n)) on the space needed for so-called pebbling contradictions over pyramid graphs of size n. Also, continuing the line of research initiated by (Ben-Sasson 2002) into trade-offs between different proof complexity measures, we present a simplified proof of the recent length-space trade-off result in (Hertel and Pitassi 2007), and show how our ideas can be used to prove a couple of other exponential trade-offs in resolution.
Automated planning of CPICH power allocation for enhancing HSDPA performance at cell edges
Authors: Iana Siomina, Di Yuan
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Power allocated to common pilot channel (CPICH) is an important parameter in performance tuning of UMTS networks. CPICH is used to announce network presence, and hence CPICH power has great influence on the cell coverage pattern. We study automated planning of CPICH power allocation in UMTS networks implementing high speed downlink packet access (HSDPA). A commonly used strategy is to allocate uniformly a constant proportion of the total power available to CPICH. This strategy is not optimized for HSDPA service. Adopting non-uniform CPICH power and minimizing the amount required for coverage lead to spare power that can be re-allocated to HSDPA to improve user throughput. We present a novel approach for optimizing non-uniform CPICH power with emphasis on HSDPA performance at cell edge, where user throughput is typically very low. Our approach is based on a linear-integer mathematical model that ensures CPICH coverage, and optimally utilizes the power saving of CPICH to enhance HS-DPA performance at cell edges. A case study shows that the proposed approach significantly outperforms the uniform CPICH assignment.
A decentralized ant-inspired approach for resource management and discovery in grids
Authors: Agostino Forestiero, Carlo Mastroianni, Giandomenico Spezzano
Venue: Multiagent and Grid Systems (2007)

This paper examines a decentralized and self-organizing approach inspired by ant behavior for building an information system in which metadata related to Grid resources is disseminated and logically organized. Each agent/ant, by analyzing its own past activity, copies and moves resource metadata among Grid hosts and contributes to collect resources belonging to the same class in a restricted region of the Grid, so decreasing the system entropy. A semi-informed resource discovery protocol exploits the ants' work: asynchronous query messages issued by clients are driven towards "representative peers" which maintain information about a large number of resources having the required characteristics. Agents control their activities, and query messages travel the network, according to self-organizing mechanisms based, respectively, on sematectonic and marker-based stigmergy, with no information about the global system state. Simulation analysis suggests that the combined use of the proposed resource mapping protocol (ARMAP) and resource discovery protocol (ARDIP) is profitable: as resources are progressively reorganized by the ARMAP process, users are able to find more and more results in a smaller amount of time.
Using Memcached for Data Distribution in Industrial Environment
Authors: Jure Petrovic
Venue: Proceedings of the Third International Conference on Systems (2008)

This article focuses on data exchange in a distributed industrial application. It presents data distribution mechanism that imitates distributed shared memory by caching heavily used objects in memory. When configured and used properly such system is suitable for transparent data sharing in a distributed real-time image processing environment.
Anomalous acid diffusion in a triphenylene molecular resist with melamine crosslinker
Authors: H. M. Zaid, M. Manickam, J. A. Preece, R. E. Palmer, A. P. G. Robinson
Venue: Microelectronic Engineering (2008)

Next generation lithography will require next generation resists. Molecular resists, based on small non-polymeric molecules, promise improvements in line width roughness and resolution control for high resolution lithographic patterns. However, these materials are generally not sensitive enough for commercial application. We have investigated the application of a common chemical amplification scheme to molecular resists. The triphenylene derivative C5/C0 (symmetrical 2,6,11-trihydroxy-3,7,11-tris(pentyloxy)triphenylene), mixed with the crosslinker hexamethoxymethyl melamine and the photoacid generator triphenylsulfonium triflate shows a substantial sensitivity enhancement, requiring a dose of only 5@mC/cm^2 compared with the pure triphenylene sensitivity of 6500@mC/cm^2 at 20keV. Previous work has indicated that the acid diffusion length of the photoacid generator used here is around 350nm and that the diffusion length decreases with film thickness. However, in this molecular resist system anomalous levels of acid diffusion were observed, indicating that previous results for polymeric systems may not hold true for these new materials. Initial results indicate that the acid diffusion length in this system may be on the order of microns. Furthermore, there is some evidence that the excessive diffusion is occurring in the surface layers of the resist or at the air: resist interface itself.
Comments on "A Study of Odd Graphs as Fault-Tolerant Interconnection Networks"
Authors: Jong-Seok Kim, Hyeong-Ok Lee
Venue: IEEE Transactions on Computers (2008)

A. Ghafoor and T. R. Bahskow proposed the fault diameter of Odd graphs is d+1 (d=even) and d+3 (d=odd) [1]. However, their their fault diameter is not correct. In this paper, we show the fault diameter of Odd graph is d+1 (d=even or odd).
Dethroning Fibonacci Sequence (abstract only)
Authors: Michael A. Kelsey
Venue: ACM Communications in Computer Algebra (2008)

The purpose of this presentation is to demonstrate some properties and applications of Fibonacci numbers. We present Binet's Formula and its proof. By using Binet's Formula, we show that the Fibonacci sequence is not a special sequence. The Fibonacci sequence has a closed form solution which can be expressed analytically in terms of a bounded number of certain "well-known" functions, which indicates that the Fibonacci sequence is not unique.
Least square image matting
Authors: Wang Kun, Zheng Nanning, Qi Huilai
Venue: Machine Graphics Vision International Journal (2007)

This paper addresses the well-known problem of natural image matting. Most of the previous matting algorithms require the user to define the tri-map, which is an inconvenient work and sometimes a burden, especially in a complex situation. This paper uses ceratain user defined foreground and background strokes to estimate the image matte. First we use a Gauss Markov random field to model the matting problem. Then we use the least square optimization approach to solve it. Experimental results show that our approach could properly handle confused boundaries. It also could deal with semi-transparent conditions such as fire etc.
Inverse problems in heat exchange processes
Authors: Andrés Fraguela, Juan-Antonio Infante, Ángel Manuel Ramos, José María Rey
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

This paper deals with an inverse problem concerning the identification of the heat exchange coefficient H (assumed depending on the temperature) between a certain material with the external environment (see, e.g., [2], [4] for real applications modelled with equations involving this coefficient). Only experimental measurements of the temperature are supposed to be known. The goal is to identify H in order to get a solution for the corresponding model, approximating same given temperature measurements. We begin by setting several scenarios for the inverse problem. For each scenario, we know the initial and ambient temperatures, identify function H through different methods and obtain error bounds in adequate norms (uniform and square integrable). Finally, we study the inverse problem in the framework of the classical theory for Hilbert spaces. Several methods are used (Tikhonov, Morozov, Landweber,...) and the approximations obtained, as well as the one provided by the previous algorithm, are shown.