ppxscal/embedding_network huggingface dataset:
Normal Form Nested Programs
Authors: Annamaria Bria, Wolfgang Faber, Nicola Leone
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

Disjunctive logic programming under the answer set semantics (DLP, ASP) has been acknowledged as a versatile formalism for knowledge representation and reasoning during the last decade. Lifschitz, Tang, and Turner have introduced an extended language of DLP, called Nested Logic Programming (NLP), in 1999 [1]. It often allows for more concise representations by permitting a richer syntax in rule heads and bodies. However, that language is propositional and thus does not allow for variables, one of the strengths of DLP.In this paper, we introduce a language similar to NLP, called Normal Form Nested (NPN) programs, which does allow for variables, and present the syntax and semantics. With the presence of variables, domain independence is no longer guaranteed. We study this issue in depth and define the class of safe NPN programs, which are guaranteed to be domain independent. Moreover, we show that for NPN programs which are also NLPs, our semantics coincides with the one of [1]; while keeping the standard meaning of answer sets on DLP programs with variables. Finally, we provide an algorithm which translates NPN programs into DLP programs, and does so in an efficient way, allowing for the effective implementation of the NPN language on top of existing DLP systems.
Replenishment Planning for Stochastic Inventory Systems with Shortage Cost
Authors: Roberto Rossi, S. Armagan Tarim, Brahim Hnich, Steven Prestwich
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

One of the most important policies adopted in inventory control is the (R,S) policy (also known as the "replenishment cycle" policy). Under the non-stationary demand assumption the (R,S) policy takes the form (R n ,S n ) where R n denotes the length of the n th replenishment cycle, and S n the corresponding order-up-to-level. Such a policy provides an effective means of damping planning instability and coping with demand uncertainty. In this paper we develop a CP approach able to compute optimal (R n ,S n ) policy parameters under stochastic demand, ordering, holding and shortage costs. The convexity of the cost-function is exploited during the search to compute bounds. We use the optimal solutions to analyze the quality of the solutions provided by an approximate MIP approach that exploits a piecewise linear approximation for the cost function.
Computerized Matching of Shoeprints Based on Sole Pattern
Authors: Rui Xiao, Pengfei Shi
Venue: Proceedings of the 2nd international workshop on Computational Forensics (2008)

Shoeprints are common clues left at crime scenes that provide valuable evidence in detecting criminals. Traditional shoeprints matching algorithm is based on manual coding with limited recognition ability, and the results are strongly dependent on the operator. In this paper, a shoeprint matching method based on PSD (power spectral density) and Zernike moment have been investigated. The PSD method aims at pressing images and the legible shoeprints. The correlation coefficients of the PSD value of each image are used as the measurements of similarity. In addition, the Zernike method has been developed for blurred crime scene shoeprint images and shoeprints with complex backgrounds. A series of irregular shapes are employed to identify the shoeprints. Features are then selected according to the Zernike moments of these shapes. More than 400 real shoeprint images have been tested, experimental results support that the method is effective in shoeprint matching.
Dynamic Grid Scheduling Using Job Runtime Requirements and Variable Resource Availability
Authors: Sam Verboven, Peter Hellinckx, Jan Broeckhove, Frans Arickx
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

We describe a scheduling technique in which estimated job runtimes and estimated resource availability are used to efficiently distribute workloads across a homogeneous grid of resources with variable availability. The objective is to increase efficiency by minimizing job failure caused by resources becoming unavailable. Optimal scheduling will be accomplished by mapping jobs onto resources with sufficient availability. Both the scheduling technique and the implementation called PGS (Prediction based Grid Scheduling) are described in detail. Results are presented for a set of sleep jobs, and compared with a first come, first serve scheduling approach.
Simulation of 3G DCHs supporting TCP traffic: design, experiments and insights on parameter tuning
Authors: Juan J. Alcaraz, Gaspar Pedreño, Fernando Cerdán, Joan García-Haro
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

This paper describes a simulator of dedicated channels in 3G radio access networks, with TCP traffic. The design principles of this simulator and the experiments performed in it are explained in depth. We provide specific implementation details of RLC functions in OMNeT++. The main objective of the simulator is RLC parameter configuration. Although many previous works have addressed this issue, our approach is different and more general: we investigate how the conditions of the environment (channel data rate, frame error ratio, Doppler frequency, etc) affect the proper adjustment of each parameter. We disclose the interactions between these conditions and the functionalities of RLC, achieving a methodology for robust RLC configuration in terms of suitable operation under changes in the environment.
About the Embedding of Color Uncertainty in CBIR Systems
Authors: Fabio Donna, Lucia Maddalena, Alfredo Petrosino
Venue: Proceedings of the 7th international workshop on Fuzzy Logic and Applications: Applications of Fuzzy Sets Theory (2007)

This paper focuses on the embedding of the uncertainty about color images, naturally arising from the quantization and the human perception of colors, into histogram-type descriptors, adopted as indexing mechanism. In particular, our work has led to an extension of the GIFT platform for Content Based Image Retrieval based on fuzzy color indexing in the HSV color space. To quantify the performances of this basic system, we have investigated different indexing strategies, based on classical logics and fuzzy logics. Performance improvements are shown, in terms of effectiveness, perfect/good searches, number and position of relevant images returned, especially in the case of large databases containing images with noisy interferences.
Mining Patterns for Visual Interpretation in a Multiple-Views Environment
Authors: José F. Rodrigues,  Jr., Agma J. Traina, Caetano Traina,  Jr.
Venue: Visual Data Mining: Theory, Techniques and Tools for Visual Analytics (2008)

This chapter introduces a novel systematization aiming at extending the application range of Information Visualization and Visual Data Mining. We present an innovative framework named Visualization Tree in order to integrate multiple data visualizations assisted by novel visual exploration techniques. These exploration techniques are named Frequency Plot, Relevance Plot and Representative Plot, and are integrated according the proposed Visualization Tree framework. The systematization of visualization techniques enabled by these concepts defines a Visual Data Mining environment where multiple presentation workspaces are kept together, linked according to analytical decisions taken by the user. Our emphasis is on developing an intuitive and versatile multiple-views system that helps the user to identify visual patterns while interpreting multiple data subsets. In this context, the analyst is able to draw and summarize several subsets that are inspected simultaneously each in a dedicated workspace.
Implementation of an Interactive NPC Based on Game Ontology and Game Community Q/A Bulletin Board
Authors: Doo-Kyung Park, Tae-Bok Yoon, Kyo-Hyun Park, Jee-Hyong Lee, Keon-Myung Lee
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

Recently, there are many researches about NPC (Non-player character) which are appeared in many games. There is a little study which has view of the speech of NPC, but most of them are focused on the movement of NPC. Most of NPC say the same line repeatedly, that make the game unrealistic. In the paper, we construct the quest ontology of game World of Warcraft and collect the articles of Q/A bulletin board which is from the web site, also called community, of the game. With the game ontology and the article from the bulletin, we construct a corpus consisted of game keywords as NPC knowledge. In the runtime, when a player asks a question to NPC, it can find the answer by comparing the question and its own knowledge.
The Application of Mexican Hat Wavelet Filtering and Averaging Algorithm in Raman Spectra Denoising
Authors: Haoyan Guo, Qinggang He, Bin Jiang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Random noise is inevitable in Raman spectral analysis. It has a negative influence on the accuracy of analysis and detection limit. There are many disadvantages for the present methods of wavelet filtering to spectral signals. We achieved separation noise from signal by using Mexican Hat wavelet filtering combined with the averaging algorithm. This method can be used in both low frequency and high frequency cases. It denoised excellently for strong noise signals with a low signal-to-noise ratio even for less than one, and good result can be gotten during spectral processing. The spectral processing technique we propose is relatively simpler and quicker, and the result is reliable. After processing, the relative errors of the position, the height and the area of the peak are less than 0.01%, 1.13% and 0.01%, respectively. Experiments show that this method can effectively raise the accuracy of spectral analysis.
The short and long of it: Neural correlates of temporal-order memory for autobiographical events
Authors: Peggy St. Jacques, David C. Rubin, Kevin S. LaBar, Roberto Cabeza
Venue: Journal of Cognitive Neuroscience (2008)

Previous functional neuroimaging studies of temporal-order memory have investigated memory for laboratory stimuli that are causally unrelated and poor in sensory detail. In contrast, the present functional magnetic resonance imaging (fMRI) study investigated temporal-order memory for autobiographical events that were causally interconnected and rich in sensory detail. Participants took photographs at many campus locations over a period of several hours, and the following day they were scanned while making temporal-order judgments to pairs of photographs from different locations. By manipulating the temporal lag between the two locations in each trial, we compared the neural correlates associated with reconstruction processes, which we hypothesized depended on recollection and contribute mainly to short lags, and distance processes, which we hypothesized to depend on familiarity and contribute mainly to longer lags. Consistent with our hypotheses, parametric fMRI analyses linked shorter lags to activations in regions previously associated with recollection (left prefrontal, parahippocampal, precuneus, and visual cortices), and longer lags with regions previously associated with familiarity (right prefrontal cortex). The hemispheric asymmetry in prefrontal cortex activity fits very well with evidence and theories regarding the contributions of the left versus right prefrontal cortex to memory (recollection vs. familiarity processes) and cognition (systematic vs. heuristic processes). In sum, using a novel photo-paradigm, this study provided the first evidence regarding the neural correlates of temporal-order for autobiographical events.
Approximate Solutions in Space Mission Design
Authors: Oliver Schütze, Massimiliano Vasile, Carlos A. Coello Coello
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

In this paper, we address multi-objective space mission design problems. We argue that it makes sense from the practical point of view to consider in addition to the `optimal' trajectories (in the Pareto sense) also approximate or nearly optimal solutions since this can lead to a significant larger variety for the decision maker. For this, we suggest a novel MOEA which is a modification of the well-known NSGA-II algorithm equipped with a recently proposed archiving strategy which aims for the storage of the set of approximate solution of a given MOP. Using this algorithm we will examine several space missions and demonstrate the benefit of the novel approach.
A new mathematical model based on Laplace and modified Z transform for investigation of three-phase switched circuits
Authors: Jiri Klima
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

A new mathematical method for time-domain analysis of power converters with periodic switching cuircuits is proposed. The method is based on mixed using of the Laúlace and modified Z-Transform in linear periodically time-varying system. The model was used for the analysis of three-phase voltage source inverters with Space Vector PWM feeding a three-phase static load, but it is applicable for all types of converters with an explicitly determined output voltage (converters with forced commutation) and periodical modulation. Instead of solution of algebraic equations for the initial current conditions the change of switching instants is reflected in the solution only by a change in two values mk and nk. From the modulated waveforms we can easily obtained equations for the six step waveforms. The derived equations are validated using a 3 kW three-phase inverter.
Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
Authors: Maurice J. Jansen
Venue: Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science (2008)

It is shown that any weakly-skew circuit can be converted into a skew circuit with constant factor overhead, while preserving either syntactic or semantic multilinearity. This leads to considering syntactically multilinear algebraic branching programs (ABPs), which are defined by a natural read-once property. A 2 n/4 size lower bound is proven for ordered syntactically multilinear ABPs computing an explicitly constructed multilinear polynomial in 2n variables. Without the ordering restriction a lower bound of level ¿(n 3/2/logn) is observed, by considering a generalization of a hypercube covering problem by Galvin [1].
On Sharp Estimating of Bond Option Prices for Heath-Jarrow-Morton Model Based on Jump
Authors: Kisoeb Park, Moonseong Kim, Seki Kim
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

We propose Heath-Jarrow-Morton (HJM) model in which the forward rate follows a jump-diffusion process. We represent HJM model based on jump and give the analytic proof for it. We derive a closed-form solution of the European bond option for HJM model based on jump. We get the fact that bond option price for the proposed model estimate highly precision. Furthermore, we simulate the proposed model by Monte Carlo method with scenarios. Lower value of precision of bond option price for HJM model based on jump means sharper estimates.
Encoding and decoding spikes for dynamic stimuli
Authors: Rama Natarajan, Quentin J. M. Huys, Peter Dayan, Richard S. Zemel
Venue: Neural Computation (2008)

Naturally occurring sensory stimuli are dynamic. In this letter, we consider how spiking neural populations might transmit information about continuous dynamic stimulus variables. The combination of simple encoders and temporal stimulus correlations leads to a code in which information is not readily available to downstream neurons. Here, we explore a complex encoder that is paired with a simple decoder that allows representation and manipulation of the dynamic information in neural systems. The encoder we present takes the form of a biologically plausible recurrent spiking neural network where the output population recodes its inputs to produce spikes that are independently decodeable. We show that this network can be learned in a supervised manner by a simple local learning rule.
Reconfigurable HW/SW Architecture of a Real-Time Driver Assistance System
Authors: Josef Angermeier, Ulrich Batzer, Mateusz Majer, Jürgen Teich, Christopher Claus, Walter Stechele
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

Driver assistance systems significantly increase the driving comfort and can prevent accidents. On the other side, they require high performance and computations need to adopt to the environment to reach their goals. Reconfigurable architectures offer the requested flexibility and performance, if care is taken to partition the tasks in hardware and software parts. Elsewise, real-time requirements can't be fulfilled. In this paper, the implementation and a hardware/software partitioning of a driver assistance system for a reconfigurable architecture are presented. The assistance system detects taillights of ahead moving vehicles in dark environments or in tunnels and visualizes the results. A detailed description of the implementation on a reconfigurable platform is given. Furthermore, the experimental results demonstrate the effectiveness of the approach.
A Pioneer's Flash of Insight
Authors: Bryan Cantrill
Venue: Queue (2008)

Jim Gray's vision of flash-based storage anchors this issue's theme. In the May/June issue of Queue, Eric Allman wrote a tribute to Jim Gray, mentioning that Queue would be running some of Jim's best works in the months to come. I'm embarrassed to confess that when this idea was first discussed, I assumed these papers would consist largely of Jim's seminal work on databasesshowing only that I (unlike everyone else on the Queue editorial board) never knew Jim. In an attempt to learn more about both his work and Jim himself, I attended the tribute held for him at UC Berkeley in May.
Introducing advanced telematic services in rural areas
Authors: Constantina I. Costopoulou, Miltiades E. Anagnostou
Venue: Information Polity (2002)

Recent developments in the area of information and communication technology can prove to be enablers of rural development by bringing advanced telematic services. However, it is the way in which network operators, service providers and rural users organize and use technology that contributes to rural development. By carefully and systematically selecting a service set, which is both meaningful to rural users and profitable to him/herself, a service provider will establish a successful enterprise and will exploit the investment on network equipment. Subsequently, the introduction of advanced telematic services in rural areas is an important problem. A scenario based approach for introducing advanced telematic services in rural areas in the European Union is presented with an emphasis to economic viability. It is split into a usage and technical scenario. The objective of this paper is to present and review important aspects of the aforementioned problem under the light of modern service provision methodologies. A case study of a rural area in Greece is described in order to illustrate the methodology. It seems that rural areas can benefit from recent advances in technology provided that cost effective network solutions and carefully selected services are offered. The penetration of modern technology in urban areas and the general trend towards cost-effective solutions are likely to further accelerate progress in rural areas.
Study of the characteristics of CT-Equivalence with proves
Authors: Hazem El-Gendy
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

"Semantic" equivalence between process specifications is essential for various phases of the development of computer/telecommunications protocols as well as other systems. This includes the verifications of the refined communicating entities and their underlying service provider against their service specifications. It includes also checking the equivalence of competing designs while developing the National or International Standards. Also, it is needed in transforming a specification given in the algebraic International Standardization Organization (ISO) Formal Description Technique (FDT) Lotos into an equivalent version given in the ISO FDT Estelle or the FDT SDL (Specification and Description Language) developed by the Telecommunications Standardization Section of the International Telecommunications Union (TSS/ITU). Nevertheless, often in conformance testing/certification testing of the final products this is needed to facilitate the derivation of testing sequences. In the literature, there are many notions for equivalence that aim at ratifying the problem of semantic equivalence. In this paper, we study the characteristics of Conformance Testing (CT) Equivalence. We prove that CT Equivalence ratifies significant problems with the other notions of "semantic equivalence" in the literature. We prove that CT Equivalence is a congruent equivalence and develop an application of it in verification.
Modelling Medical Time Series Using Grammar-Guided Genetic Programming
Authors: Fernando Alonso, Loïc Martínez, Aurora Pérez, Agustín Santamaría, Juan Pedro Valente
Venue: Proceedings of the 8th industrial conference on Advances in Data Mining: Medical Applications, E-Commerce, Marketing, and Theoretical Aspects (2008)

The analysis of time series is extremely important in the field of medicine, because this is the format of many medical data types. Most of the approaches that address this problem are based on numerical algorithms that calculate distances, clusters, reference models, etc. However, a symbolic rather than numerical analysis is sometimes needed to search for the characteristics of time series. Symbolic information helps users to efficiently analyse and compare time series in the same or in a similar way as a domain expert would. This paper describes the definition of the symbolic domain, the process of converting numerical into symbolic time series and a distance for comparing symbolic temporal sequences. Then, the paper focuses on a method to create the symbolic reference model for a certain population using grammar-guided genetic programming. The work is applied to the isokinetics domain within an application called I4.
Cognitive conditions in text reading on a visual display terminal by different age groups
Authors: Yuka Kawasaki, Hironori Sasaki, Haruhisa Yamaguchi, Yumi Yamaguchi
Venue: Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering (2008)

In this study, we compare the visual configuration of proper font size, design on a Visual Display Terminal (VDT), easy-to-read font style (typeface) in text reading on a VDT by thirteen age groups in Japan, including elementary school students, junior high school students, high school students, and university students. We conducted an experiment and examined the readability of a text on a VDT for each age group by comparing the students' preferences of font style, font size, and color combination of font and background. Then, we compared the reading cognition of each age group. The results showed that: 1) the preferences for font size dramatically differed by each age group, 2) the average of the first graders preferable font size was twenty-two point, 3) the preferences for font style differed by each age group, 4) the preferences for color combinations of font and background depended on the individual participants, not the age groups. Combining all those results, we analyzed and verified the cognitive conditions in text reading on a VDT, and suggested suitable working environments for each age group.