ppxscal/embedding_network huggingface dataset:
Learning Mazes with Aliasing States: An LCS Algorithm with Associative Perception
Authors: Zhanna V. Zatuchna, Anthony Bagnall
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2009)

Learning classifier systems (LCSs) belong to a class of algorithms based on the principle of self-organization and have frequently been applied to the task of solving mazes, an important type of reinforcement learning (RL) problem. Maze problems represent a simplified virtual model of real environments that can be used for developing core algorithms of many real-world applications related to the problem of navigation. However, the best achievements of LCSs in maze problems are still mostly bounded to non-aliasing environments, while LCS complexity seems to obstruct a proper analysis of the reasons of failure. We construct a new LCS agent that has a simpler and more transparent performance mechanism, but that can still solve mazes better than existing algorithms. We use the structure of a predictive LCS model, strip out the evolutionary mechanism, simplify the reinforcement learning procedure and equip the agent with the ability of associative perception, adopted from psychology. To improve our understanding of the nature and structure of maze environments, we analyze mazes used in research for the last two decades, introduce a set of maze complexity characteristics, and develop a set of new maze environments. We then run our new LCS with associative perception through the old and new aliasing mazes, which represent partially observable Markov decision problems (POMDP) and demonstrate that it performs at least as well as, and in some cases better than, other published systems.
L(p,q)-labeling of digraphs
Authors: Yi-Ting Chen, Ma-Lian Chia, David Kuo
Venue: Discrete Applied Mathematics (2009)

Given a graph G and two positive integers p,q with p>q an L(p,q)-labeling of G is a function f from the vertex set V(G) to the set of all nonnegative integers such that |f(x)-f(y)|>=p if d"G(x,y)=1 and |f(x)-f(y)|>=q if d"G(x,y)=2. A k-L(p,q)-labeling is an L(p,q)-labeling such that no label is greater than k. The L(p,q)-labeling number of G, denoted by @l"p","q(G) is the smallest number k such that G has a k-L(p,q)-labeling. When considering the digraph D, we use @l"p","q^*(D) in place of @l"p","q(D). We study the L(p,q)-labeling number of a digraph D in this paper. We find some relations between the L(p,q)-labeling number of a graph G and an orientation D of G, and give some results for the L(p,q)-labeling numbers of k-partite digraphs. We also study the L(p,q)-labeling numbers for those graphs D for which the underlying graphs are paths, cycles or trees.
A particle swarm with selective particle regeneration for multimodal functions
Authors: Chi-Yang Tsai, I-Wei Kao
Venue: WSEAS Transactions on Information Science and Applications (2009)

This paper proposes an improved particle swarm optimization (PSO). In order to increase the efficiency, suggestions on parameter settings is made and a mechanism is designed to prevent particles fall into the local optimal. To evaluate its effectiveness and efficiency, this approach is applied to multimodal function optimizing tasks. 16 benchmark functions were tested, and results were compared with those of PSO, HNMPSO and GA-PSO. It shows the proposed method is both robust and suitable for multimodal function optimization.
Tactile fabric comfort prediction using regression analysis
Authors: Les M. Sztandera
Venue: WSEAS Transactions on Computers (2009)

In this paper we explore complex relationships between mechanical and sensory properties of fabrics, and the perceived tactile comfort. Mechanical properties, measured objectively by Kawabata Evaluation System for Fabrics (KES-FB), and handfeel properties, measured subjectively by sensory expert panel, are related to the tactile comfort of fabrics using statistical regression approaches. A universe of 48 fabrics is examined to analyze and map the relations. The initial 17 mechanical and 17 handfeel parameter sets were reduced to 4 and 5 properties, respectively. Adjusted R2 values were 0.657 for mechanical and 0.863 for handfeel parameters, reflecting sound goodness-of-fit measures, and providing reasonable ways for prediction of tactile fabric comfort from mechanical and handfeel parameters.
Optimal constraint-preserving netlist simplification
Authors: Jason Baumgartner, Hari Mony, Adnan Aziz
Venue: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design (2008)

We consider the problem of optimal netlist simplification in the presence of constraints. Because constraints restrict the reachable states of a netlist, they may enhance logic minimization techniques such as redundant gate elimination which generally benefit from unreachability invariants. However, optimizing the logic appearing in a constraint definition may weaken its state-restriction capability, hence prior solutions have resorted to suboptimally neglecting certain valid optimization opportunities. We develop the theoretical foundation, and corresponding efficient implementation, to enable the optimal simplification of netlists with constraints. Experiments confirm that our techniques enable a significantly greater degree of redundant gate elimination than prior approaches (often greater than 2x), which has been key to the automated solution of various difficult verification problems.
Hierarchical Sampling from Sketches: Estimating&#x00a0;Functions over Data Streams
Authors: Sumit Ganguly, Lakshminath Bhuvanagiri
Venue: Algorithmica (2009)

We present a randomized procedure named Hierarchical Sampling from Sketches (Hss) that can be used for estimating a class of functions over the frequency vector f of update streams of the form . We illustrate this by applying the Hss technique to design nearly space-optimal algorithms for estimating the pth moment of the frequency vector, for real p&ge;2 and for estimating the entropy of a data stream.
Energy efficient redundant configurations for real-time parallel reliable servers
Authors: Dakai Zhu, Rami Melhem, Daniel Mossé
Venue: Real-Time Systems (2009)

Modular redundancy and temporal redundancy are traditional techniques to increase system reliability. In addition to being used as temporal redundancy, with technology advancements, slack time in a system can also be used by energy management schemes to save energy. In this paper, we consider the combination of modular and temporal redundancy to achieve energy efficient reliable real-time service provided by multiple servers. We first propose an efficient adaptive parallel recovery scheme that appropriately processes service requests in parallel to increase the number of faults that can be tolerated and thus system reliability. Then we explore schemes to determine the optimal redundant configurations of the parallel servers to minimize system energy consumption for a given reliability goal or to maximize system reliability for a given energy budget. Our analysis results show that small requests, optimistic approaches, and parallel recovery favor lower levels of modular redundancy, while large requests, pessimistic approaches and restricted serial recovery favor higher levels of modular redundancy.
Second International Workshop on Physicality
Authors: Devina Ramduny-Ellis, Alan Dix, Steve Gill
Venue: Proceedings of the 21st British HCI Group Annual Conference on HCI 2008: People and Computers XXI: HCI...but not as we know it - Volume 2 (2007)

When designing purely physical products we do not necessarily have to understand what it is about their physicality that makes them work - they simply have it. However, as we design hybrid physical/digital products we now have to understand what we lose or confuse by the added digitality - and so need to understand physicality more clearly than before. This multi-disciplinary workshop will seek to construct a fundamental understanding of the nature of physicality: how humans experience, manipulate, react and reason about 'real' physical things and how this may inform the design process and the design of future innovative products.
Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights: Average Case Setting
Authors: G. W. Wasilkowski, H. Wo&#x017a;niakowski
Venue: Foundations of Computational Mathematics (2009)

We study multivariate linear problems in the average case setting with respect to a&#x00a0;zero-mean Gaussian measure whose covariance kernel has a&#x00a0;finite-order weights structure. This means that the measure is concentrated on a&#x00a0;Banach space of d-variate functions that are sums of functions of at most q * variables and the influence of each such term depends on a&#x00a0;given weight. Here q * is fixed whereas d varies and can be arbitrarily large. For arbitrary finite-order weights, based on Smolyak&#x2019;s algorithm, we construct polynomial-time algorithms that use standard information. That is, algorithms that solve the d-variate problem to within &#x03b5; using of order $\varepsilon^{-p}d^{q^{*}}$function values modulo a&#x00a0;power of ln&#x2009;&#x03b5; &#x2212;1. Here p is the exponent which measures the difficulty of the univariate (d=1) problem, and the power of ln&#x2009;&#x03b5; &#x2212;1 is independent of&#x00a0;d. We also present a&#x00a0;necessary and sufficient condition on finite-order weights for which we obtain strongly polynomial-time algorithms, i.e., when the number of function values is independent of d and polynomial in &#x03b5; &#x2212;1. The exponent of &#x03b5; &#x2212;1 may be, however, larger than p. We illustrate the results by two multivariate problems: integration and function approximation. For the univariate case we assume the r-folded Wiener measure. Then p=1/(r+1) for integration and $p=1/(r+\frac{1}{2})$for approximation.
Towards unified radio power management for wireless sensor networks
Authors: Guoliang Xing, Mo Sha, Greg Hackmann, Kevin Klues, Octav Chipara, Chenyang Lu
Venue: Wireless Communications Mobile Computing (2009)

Many wireless sensor networks must sustain long lifetimes on limited energy resources. Two major approaches, transmission power control and sleep scheduling, have been proposed to reduce the radio power consumption in the transmission state and the idle state, respectively. In this paper, we first review existing transmission power control and sleep scheduling approaches and then describe a Unified Radio Power Management framework for the design and implementation of holistic radio power management solutions in wireless sensor networks. It has two key components: (1) a novel optimization approach called Minimum Power Configuration that minimizes the aggregate radio power consumption of all ratio states and (2) a Unified Power Management Architecture (UPMA) that aims to support the flexible cross-layer integration of different power management strategies. A novel feature of UPMA is that it enables cross-layer coordination and joint optimization of different power management strategies that exist at multiple network layers. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Spanning tree elevation protocol: Enhancing metro Ethernet performance and QoS
Authors: Minh Huynh, Prasant Mohapatra, Stuart Goose
Venue: Computer Communications (2009)

The economics and familiarity of Ethernet technology is motivating the vision of wide-scale adoption of Metro Ethernet Networks (MEN). Despite the progress made by the community on additional Ethernet standardization and commercialization of the first generation of MEN, the fundamental technology does not meet the expectations that carriers have traditionally held in terms of network resiliency, load management, and Quality of Service (QoS). We propose a new concept of Spanning Tree Elevation Protocol (STEP) that increases MEN performance while supporting QoS including traffic policing and service differentiation. STEP manages multiple Spanning Trees as a means to control the traffic flow rates and to differentiate classes of traffic. Whenever a service level agreement is compromised, STEP redirects frames of affected flows to the next spanning tree in sequence utilizing the alternate paths. As a result, the capacity in terms of network throughput is greatly enhanced while almost avoiding any reconvergence time in the case of failures. The gain ranges from 1.7% to 7.3% of the total traffic in the face of failure; while load balancing increases an additional 12.8% to 37% of the total throughput. At the same time, STEP maintains the required bandwidth for high priority traffic class during the failure scenarios and the high congestion scenarios.
An "intelligent" on-line assistant and tutor: NLS-scholar
Authors: Mario C. Grignetti, Catherine Hausmann, Laura Gould
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

NLS-SCHOLAR is an experimental system that uses Artificial Intelligence techniques to teach computer-naive people how to use the powerful and complex editor of NLS. This teaching is accomplished by presenting a sequence of lessons. During each lesson the student may interact with the system by asking and answering questions, performing tasks which are posed by the system, and performing tasks of his own choosing. Tasks are actually executed using our own implementation of NLS EDIT. Those tasks which have been posed are evaluated by the system, and the student is given encouragement, advice, and assistance.
Reactivity based model to study online auctions dynamics
Authors: Adriano Pereira, Leonardo Rocha, Fernando Mourão, Paulo Góes, Wagner Meira,  Jr.
Venue: Information Technology and Management (2009)

Online auctions have challenged many assumptions and results from the traditional economic auction theory. Observed bidder behavior in online auctions often deviates from equilibrium strategies postulated by economic theory. In this research, we consider an online auction as an information system that provides a long-duration, information-rich, dynamic application environment in which users (bidders) interact with the system in a feedback loop, in what we term reactivity. Bidders react to the observed conditions of the auction and events triggered by actions of other bidders. In this work we propose a new characterization model with the purpose of isolating the segments of the auction in which users react to the auction conditions and events. Through this model, it is possible to enrich the auction characterization. Despite the existence of other bidding characterization models, none of them is enough for understanding the factors that characterize and explain the auction dynamics. We present results which demonstrate the advantages of applying our methodology. The final objective is to gain an understanding of what drives the dynamics of online auctions, the role of reactivity in the auction dynamics, and how the outcome of the auction is affected by the particular dynamics of the system.
A class of multi-server queueing system with server failures
Authors: Xiaolan Yang, Attahiru Sule Alfa
Venue: Computers and Industrial Engineering (2009)

A multi-server queueing system with identical unreliable servers with phase type distributed service times is considered. The servers are subject to random breakdowns and repairs when a repair person is available. We consider both the cases of infinite and finite buffers. Job arrivals are Poisson and server inter-failure and repair times follow exponential distributions. The infinitesimal generator matrix has a block tri-diagonal structure. The stability condition for the infinite case and the loss probability for the finite buffer case are obtained. We use a matrix-geometric approach to analyze the infinite buffer problem. Numerical examples are presented for both cases.
Improved Anti-NBI UWB Waveform Design Based on Spectral Factorization
Authors: Yipeng Liu, Qun Wan
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

This paper introduces an improved ultra wideband (UWB) waveform design method to shape spectral notch to suppress interference. FIR filter is used to synthesize the waveform by summing a sequence of weighted and uniformly delayed monocycles. The Gaussian monocycle is chosen to meet the mask for easy generation, while the codeword is designed to shape notch. Different from previous non-convex Lagrange method, we introduce the minimum direct current minimum phase spectral factorization to obtain the codeword from the Fourier series coefficients of ideal codeword spectrum. It improves the efficiency and robustness by avoiding solving nonlinear equations, especially when the codeword is long. It can be applied to multi-interference situation.
Financial Products: An Introduction using Mathematics and Excel, 1 edition
Authors: Bill Dalton
Venue:  (2008)

Financial Products provides a step-by-step guide to some of the most important ideas in financial mathematics. It describes and explains interest rates, discounting, arbitrage, risk neutral probabilities, forward contracts, futures, bonds, FRA and swaps. It shows how to construct both elementary and complex (Libor) zero curves. Options are described, illustrated and then priced using the Black Scholes formula and binomial trees. Finally, there is a chapter describing default probabilities, credit ratings and credit derivatives (CDS, TRS, CSO and CDO). An important feature of the book is that it explains this range of concepts and techniques in a way that can be understood by those with only a basic understanding of algebra. Many of the calculations are illustrated using Excel spreadsheets, as are some of the more complex algebraic processes. This accessible approach makes it an ideal introduction to financial products for undergraduates and those studying for professional financial qualifications.
An experimental system to support a very high level user interface
Authors: William L. Batchelor, Lucian J. Endicott,  Jr.
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

An experimental project is described that developed a very high level end user interface to provide the capability for non-DP trained individuals to automate business procedures.
Using Distributed Diagnosis to Deploy Highly-Available Web Servers
Authors: Roverli Pereira Ziwich, Egon Hilgenstieler, Emerson Fabiano Fontana Carara, Elias Procópio Duarte Jr., Luis Carlos Erpen De Bona
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

This work presents SAPOTI (Dependable TCP/IP Application Servers - in Portuguese: Servidores de APlicações cOnfiáveis Tcp/Ip), a distributed tool that guarantees the availability of TCP/IP application servers, in particular of Web servers. The tool is based on the SNMP framework and is executed on a group of Web servers running on a set of hosts that are monitored by a dependable distributed network management tool based on the hierarchical diagnosis algorithm Hi-ADSD with Timestamps. One server is elected to be responsible for the service. After this server becomes faulty and this event is diagnosed, the service is automatically recovered by electing another server among those that are fault-free. A priority scheme based on identifiers is defined. The service is available even if only one host/server is fault-free. Experiments are described obtained from a implementation of SAPOTI on a LAN with real Apache servers. Experiments that involved the injection of 210 faults distributed among a group of six servers were run, the measured availability was at least 97.3%. In another experiment with five servers, where 27 faults were injected, the availability was 99.5% during the whole experiment time.
A plug-in-based architecture for random number generation in simulation systems
Authors: Roland Ewald, Johannes Rössel, Jan Himmelspach, Adelinde M. Uhrmacher
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Simulations often depend heavily on random numbers, yet the impact of random number generators is recognized seldom. The generation of random numbers for simulations is not trivial, as the quality of each algorithm depends on the simulation scenario. Therefore, simulation environments for large-scale experimentation with safety-critical models require a reliable mechanism to cope with this aspect. We show how to address this problem by realizing a random number generation architecture for a general-purpose simulation system. It provides various random number generators (RNGs), probability distributions, and RNG tests. It is open to future additions, which allows the assessment of new generators in a simulation context and the re-validation of past simulation studies. We present a short example that illustrates why the features of such an architecture are essential for getting valid results.
Microsoft Dynamics GP For Dummies
Authors: Renato Bellu
Venue: For Dummies (2008)

If youre accountable for accounting in a mid-level business, Microsoft Dynamics GP accounting software can be your friend. Microsoft Dynamics GP For Dummies improves the friendship by highlighting the most useful and practical features, dispelling the most common misconceptions, and letting you in on the best tips and tricks all in plain English!Microsoft Dynamics GP For Dummies shows you how to set up and use this modular accounting program. Youll learn to customize Dynamics Great Plains, get around the program, create a company, build an effective chart of accounts, and maintain a general ledger. Youll find out how to:Create invoices and bill your customers, manage receipts, and easily match payments to invoices Set up vendors quickly and easily Customize GP fit your business perfectly and make the home page more efficient Work with the modules youll use most often in the Purchasing, Sales, Inventory, and Financial series Safeguard your database and set up a disaster recovery plan containing all the right steps Use Professional Services Tools and utilities to find and fix data discrepancies Get inventory under control Close your books at year end and use shortcuts to easily print reports from all the data youve collected Save keystrokes with Quick Journal and batch frequency Leverage the interoperability between Dynamics GP and Microsoft Office applications Make upgrading hassle-free Microsoft Dynamics GP For Dummies helps you make this sometimes-complex program do your bidding, which might account for your rising popularity in the office!
Xfce: the third man
Authors: Federico Kereki
Venue: Linux Journal (2009)

The other desktop environment.
The making of Street Fighter IV
Authors: Toshio Ohashi
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

For the cinematics for the new Capcom game Street Fighter IV, Polygon Pictures wanted to create a look that evokes the misty feeling of Asian ink-brush painting but also showcases the furious action inherent to the game and makes it clear that the characters and cameras really exist in 3D.