ppxscal/embedding_network huggingface dataset:
Operating System Concepts, 8th edition
Authors: Abraham Silberschatz, Peter Baer Galvin, Greg Gagne
Venue:  (2008)

Keep pace with the fast-developing world of operating systems Open-source operating systems, virtual machines, and clustered computing are among the leading fields of operating systems and networking that are rapidly changing. With substantial revisions and organizational changes, Silberschatz, Galvin, and Gagnes Operating System Concepts, Eighth Edition remains as current and relevant as ever, helping you master the fundamental concepts of operating systems while preparing yourself for todays emerging developments. As in the past, the text brings you up to speed on core knowledge and skills, including: What operating systems are, what they do, and how they are designed and constructed Process, memory, and storage management Protection and security Distributed systems Special-purpose systems Beyond the basics, the Eight Edition sports substantive revisions and organizational changes that clue you in to such cutting-edge developments as open-source operating systems, multi-core processors, clustered computers, virtual machines, transactional memory, NUMA, Solaris 10 memory management, Suns ZFS file system, and more. New to this edition is the use of a simulator to dynamically demonstrate several operating system topics. Best of all, a greatly enhanced WileyPlus, a multitude of new problems and programming exercises, and other enhancements to this edition all work together to prepare you enter the world of operating systems with confidence.
Application of ADP to Intersection Signal Control
Authors: Tao Li, Dongbin Zhao, Jianqiang Yi
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

This paper discusses a new application of adaptive dynamic programming (ADP). Meanwhile, traffic control as an important factor in social development is a valuable research topic. Considering with advancement of ADP and importance of traffic control, this paper present a new signal control in a single intersection. Simulation results show that the proposed signal control is valid.
Designing Software for Pupils with Special Needs: Analysis of an Example for Complementary Action Design
Authors: Andreas Lingnau, Andreas Harrer
Venue: Proceedings of the 3rd European conference on Technology Enhanced Learning: Times of Convergence: Technologies Across Learning Contexts (2008)

Designing learning-software for a special target group should not only focus on the pupils but also on the teacher. The propagation of using computers for everyday teaching should take into account teachers' possible lack of technical competence. Thus, there are two gaps which have to be bridged: One for the pupils using a computer to learn and the other for the teacher preparing tasks within this learning environment.
A Time-Frequency Localization Method for Singular Signal Detection Using Wavelet-Based Hölder Exponent and Hilbert Transform
Authors: Xiaoyan Deng, Qiaohua Wang, Xiaokun Chen
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

This paper introduces a new methodology for signal singularity detection based on the combination of wavelet-based Holder exponent and Hilbert transform. Firstly, a discrete wavelet-based Holder exponent function is derived, which is viewed as a discriminant power function and provides a measure of the signal's regularity at different time points. Then local minimum method of Holder exponents is introduced to select important singularity positions arranged in ascending order, this enables us to accurately determine when the singularities occur. Finally, by taking Hilbert transform, the instantaneous frequencies are computed at the selected important positions. The numerical simulation results presented herein show the proposed method can effectively detect time-frequency features of the singularity. The proposed method is more sharp and effective than by using the wavelet-based Holder exponent method alone, which can only predict when the singularities occur.
Statistical Security Conditions for Two-Party Secure Function Evaluation
Authors: Claude Crépeau, Jürg Wullschleger
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

To simplify proofs in information-theoretic security, the standard security definition of two-party secure function evaluation based on the real/ideal model paradigm is often replaced by an information-theoretic security definition. At EUROCRYPT 2006, we showed that most of these definitions had some weaknesses, and presented new information-theoretic conditions that were equivalent to a simulation-based definition in the real/ideal model. However, there we only considered the perfect case, where the protocol is not allowed to make any error, which has only limited applications.We generalize these results to the statistical case, where the protocol is allowed to make errors with a small probability. Our results are based on a new measure of information that we call the statistical information, which may be of independent interest.
2008 Special Issue: Iterative principles of recognition in probabilistic neural networks
Authors: Jiří Grim, Jan Hora
Venue: Neural Networks (2008)

When considering the probabilistic approach to neural networks in the framework of statistical pattern recognition we assume approximation of class-conditional probability distributions by finite mixtures of product components. The mixture components can be interpreted as probabilistic neurons in neurophysiological terms and, in this respect, the fixed probabilistic description contradicts the well known short-term dynamic properties of biological neurons. By introducing iterative schemes of recognition we show that some parameters of probabilistic neural networks can be ''released'' for the sake of dynamic processes without disturbing the statistically correct decision making. In particular, we can iteratively adapt the mixture component weights or modify the input pattern in order to facilitate correct recognition. Both procedures are shown to converge monotonically as a special case of the well known EM algorithm for estimating mixtures.
Contact Network Modeling of Flu Epidemics
Authors: Ian X. Leung, Gareth Gibbs, Franco Bagnoli, Anil Sorathiya, Pietro Liò
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Using actual census, family and age structure, land-use and population-mobility data, we develop a stochastic cellular automata on a social contact network to study the propagation of influenza epidemics in the UK. In particular, we address age dependency and obtain the contact networks through the analysis of location co-presence. We analyze infection propensities as well as vaccination techniques. The results indicate the relative merits of different vaccination strategies combined with early detection without resorting to mass vaccination of a population.
Strong Formulations for 2-Node-Connected Steiner Network Problems
Authors: Markus Chimani, Maria Kandyba, Ivana Ljubić, Petra Mutzel
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

We consider a survivable network design problem known as the 2-Node-Connected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partition into two sets of customer nodes and one set of Steiner nodes. We ask for the minimum weight connected subgraph containing all customer nodes, in which the nodes of the second customer set are nodewise 2-connected. This problem class has received lively attention in the past, especially with regard to exact ILP formulations and their polyhedral properties.In this paper, we present a transformation of 2NCON into a related problem on directed graphs and use this to establish two novel ILP formulations, based on multi-commodity flow and on directed cuts, respectively. We prove the strength of our formulations over the known formulations, and compare our ILPs theoretically and experimentally. This paper thereby consitutes the first experimental study of exact 2NCON algorithms considering more than ~100 nodes, and shows that graphs with up to 4900 nodes can be solved to provable optimality.
Plenary lecture I: from model-based strategies to intelligent control systems
Authors: Ioan Dumitrache
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The paper presents the evolution of control systems and trends in the field of integrated computer, communication and cognitive sciences for control applications. There are selected and presented the most efficient control strategies used in complex process control, as well as the limitations of model-based approaches in cases implying complex, non-linear and uncertain process models. In this context are presented some trends in robust identification and design of adaptive control systems with high level of robustness. There are analyzed the concepts for autonomous control of complex systems by integrating intelligent methodologies. Some aspects of hybrid intelligent control are considered and are also presented some new directions of research towards creating a new generation of control systems. The paper includes also a presentation of the evolution of computer controlled applications and a new paradigm - C4 - is analyzed from concept to application. Therefore, it is illustrated the transition from C2 to C4 paradigm in the context of integrating computers, communication and cognition in control. Finally, there are presented advanced control techniques for manufacturing, including intelligent agents, leading to large Intelligent Manufacturing Systems. Some trends in control of complex systems are presented, including multi-agent technology and hybrid systems formalism.
An Introductory Computer Graphics Course in the Context of the European Space of Higher Education: A Curricular Approach
Authors: Akemi Gálvez, Andrés Iglesias, Pedro Corcuera
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Currently, European countries are in the process of rethinking their higher education systems due to harmonization efforts initiated by the so-called Bologna's declaration. This process of reforms implies not only a re-evaluation of our way of teaching and learning but also a new curricular design in order to achieve the expected goals. In this context, the present paper focuses on the problem of teaching computer graphics, a discipline that is getting increasing importance in the realm of Computational Science. The paper discusses some issues regarding an introductory course on computer graphics taking into account its goals, contents, students' profile and other factors derived from the new scenario given by the European Space of Higher Education.
Cupping Classes of $\Sigma^0_2$ Enumeration Degrees
Authors: Mariya Ivanova Soskova
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

We prove that no subclass of the $\Sigma^0_2$ enumeration degrees containing the nonzero 3-c.e. enumeration degrees can be cupped to 0 e ¿ by a single incomplete $\Sigma^0_2$ enumeration degree.
Multi-class Prediction Using Stochastic Logic Programs
Authors: Jianzhong Chen, Lawrence Kelley, Stephen Muggleton, Michael Sternberg
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

In this paper, we present a probabilistic method of dealing with multi-class classification using Stochastic Logic Programs (SLPs), a Probabilistic Inductive Logic Programming (PILP) framework that integrates probability, logic representation and learning. Multi-class prediction attempts to classify an observed datum or example into its proper classification given that it has been tested to have multiple predictions. We apply an SLP parameter estimation algorithm to a previous study in the protein fold prediction area and a multi-class classification working example, in which logic programs have been learned by Inductive Logic Programming (ILP) and a large number of multiple predictions have been detected. On the basis of several experiments, we demonstrate that PILP approaches (eg. SLPs) have advantages for solving multi-class prediction problems with the help of learned probabilities. In addition, we show that SLPs outperform ILP plus majority class predictor in both predictive accuracy and result interpretability.
Analog Multiplying/Weighting VLSI Cells for SVM Classifiers
Authors: Lelia Festila, Lorant Andras Szolga, Mihaela Cirlugea, Robert Groza
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

VLSI support vector machine classifiers require a large amount of calculations, therefore their implementation needs high density, high speed and low power circuits. In a SVM architecture based on a multiplying law the main building blocks are multipliers. We propose in this paper multiplying and weighting cells, developed by using a model consisting of a compound of two inverse non-linear functions. This procedure is suitable for VLSI implementation because it permits the use of simple nonlinearized standard DA cells that compensate each other nonlinearities to obtain an extended domain of operation. The resulted weighting/multiplying cells were analyzed and tested by simulations.
Controller Synthesis with Budget Constraints
Authors: Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

We study the controller synthesis problem under budget constraints. In this problem, there is a cost associated with making an observation, and a controller can make only a limited number of observations in each round so that the total cost of the observations does not exceed a given fixed budget. The controller must ensure some ¿-regular requirement subject to the budget constraint. Budget constraints arise in designing and implementing controllers for resource-constrained embedded systems, where a controller may not have enough power, time, or bandwidth to obtain data from all sensors in each round. They lead to games of imperfect information, where the unknown information is not fixed a priori, but can vary from round to round, based on the choices made by the controller how to allocate its budget.We show that the budget-constrained synthesis problem for ¿-regular objectives is complete for exponential time. In addition to studying synthesis under a fixed budget constraint, we study the budget optimization problem, where given a plant, an objective, and observation costs, we have to find a controller that achieves the objective with minimal average accumulated cost (or minimal peak cost). We show that this problem is reducible to a game of imperfect information where the winning objective is a conjunction of an ¿-regular condition and a long-run average condition (or a least max-cost condition), and this again leads to an exponential-time algorithm.Finally, we extend our results to games over infinite state spaces, and show that the budget-constrained synthesis problem is decidable for infinite state games with stable quotients of finite index. Consequently, the discrete time budget-constrained synthesis problem is decidable for rectangular hybrid automata.
Engineering Business Ecosystems Using Environment-Mediated Interactions
Authors: César A. Marín, Iain Stalker, Nikolay Mehandjiev
Venue: Engineering Environment-Mediated Multi-Agent Systems: International Workshop, EEMMAS 2007, Dresden, Germany, October 5, 2007. Selected Revised and Invited Papers (2008)

The increasingly complex and dynamic nature of contemporary markets demands that a business engages in an ongoing dialogue with all aspects of its environment, including other cooperative and competitive businesses. Whilst the concept of a business ecosystem captures the essence of such a domain, the lack of a convincing software architecture for its support has resulted in solutions which only partially leverages the potential of the forementioned concept. In this paper, we present an architecture for a business ecosystem supporting application based on Dynamic Agent-based Ecosystem Model (DAEM:) a novel and promising approach to support business ecosystems and their adaptation capabilities where the environment plays an identifiable mediating role.
A verification framework for service-oriented architecture applications
Authors: Xinyu Zhou
Venue:  (2008)

Service-Oriented Architecture (SOA) and its implementation of Web Services (WS) received significant attention as major computer companies such as IBM, Microsoft, Oracle and Sun Microsystems are adopting this new approach to developing software and systems. SOA advocates run-time system integration of loosely coupled services across heterogeneous platforms in a distributed environment and also improves the flexibility of system development. However, trustworthiness becomes a serious problem and appropriate tradeoffs have to be made. This research introduces a verification framework for SOA. An effective verification framework will greatly reduce the effort for rapid and adaptive service composition and evaluation of applications based on SOA. The proposed framework consists of two aspects: a testing infrastructure for static verification of services, and a policy-based dynamic verification mechanism for service collaboration and composition. The proposed verification framework provides the following advantages: (1) It offers a CV V mechanism to verify services. (2) It provides the function of integration testing and functional (black-box) testing. (3) It provides the capability of test case profiling, test case ranking, service ranking, static service profiling, and dynamic service profiling. (4) It has the capability of dynamic verification over services. WebStrar (Web Services Testing, Ranking, and test case Ranking) is the component in the verification framework to perform static verification It assures the trustworthiness and reduces the vulnerability of WS by rigorous positive and negative testing, reliability assessing, and ranking. A policy specification language PSML-P (Process Specification and Modeling Language for Policy) and a policy enforcement framework "Pi4SOA" (Policy Infrastructure for Service-Oriented Architecture) are proposed to verify and control the collaboration process of SOA during service runtime.
Rainbow: cost-effective software architecture-based self-adaptation
Authors: David Garlan
Venue:  (2008)

Modern, complex software systems (e-commerce, IT, critical infrastructures, etc.) are increasingly required to continue operation in the face of change, to self-adapt to accommodate shifting user priorities, resource variability, changing environments, and component failures. While manual oversight benefits from global problem contexts and flexible policies, human operators are costly and prone to error. Low-level, embedded mechanisms (exceptions, time-outs, etc.) are effective and timely for error recovery, but are local in scope to the point-of-failure, application-specific, and costly to modify when adaptation objectives change. An ideal solution leverages domain expertise, provides an end-to-end system perspective, adapts the system in a timely manner, and can be engineered cost-effectively.Architecture-based self-adaptation closes the &ldquo;loop of control,&rdquo; using external mechanisms and the architecture model of the target system to adapt the system. An architecture model exposes important system properties and constraints, provides end-to-end problem contexts, and allows principled and automated adaptations. Existing architecture-based approaches specialize support for particular classes of systems and fixed sets of quality-of-service concerns; they are costly to develop for new systems and to evolve for new qualities. To overcome these limitations, we posit this thesis:We can provide software engineers the ability to add and evolve self-adaptation capabilities cost-effectively, for a wide range of software systems, and for multiple objectives, by defining a self-adaptation framework that factors out common adaptation mechanisms and provides explicit customization points to tailor self-adaptation capabilities for particular classes of systems, for multiple quality-of-service objectives.Our approach, embodied in a system called Rainbow, provides an engineering approach and a framework of mechanisms to monitor a target system and its environment, reflect observations into the system's architecture model, detect opportunities for improvements, select a course of action, and effect changes. The framework provides general and reusable infrastructures with well-defined customization points, a set of abstractions, and an adaptation engineering process, focusing engineers on adaptation concerns to systematically customize Rainbow to particular systems. To automate system self-adaptation, Rainbow provides a language, called Stitch, to represent routine human adaptation knowledge using a core set of adaptation concepts.
An improved cathode ray tube storage system
Authors: R. Thorensen
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

Several years have passed since Williams and Kilburn first described their method of storing digital information as charge patterns on the phosphor screens of common cathode ray tubes.
Cellular Automata-Based Structures to Compute the Solutions of Linear Difference Equations
Authors: A. Fúster-Sabater, P. Caballero-Gil, O. Delgado
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

A cellular automata-based linear model that computes all the solutions of linear binary difference equations has been developed. Such a model is based on successive concatenations of a basic linear automaton. Different sequential solutions are obtained from different automaton initial states. Many of these solutions are binary sequences of cryptographic utility. In this way, a linear structure based on cellular automata realizes not only difference equation solutions but also generates sequences currently used in cryptography. The model is simple, linear and can be applied in a range of practical cryptographic applications.
Using Error Recovery Techniques to Improve Sketch Recognition Accuracy
Authors: Gennaro Costagliola, Vincenzo Deufemia, Michele Risi
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

Sketching is an activity that produces informal documents containing hand-drawn shapes highly variable and ambiguous. In this paper we present a diagrammatic sketch recognizer that is able to cope with the recognition of in-accurate hand-drawn symbols by exploiting error recovery techniques as developed for programming language compilers. The error recovery algorithms are able to interact with recognizers automatically generated from grammar specifications in order to obtain the information on missing or misrecognized strokes.