ppxscal/embedding_network huggingface dataset:
Plenary lecture 13: synergy analysis in reaction systems
Authors: Zelimir Kurtanjek
Venue: Proceedings of the international conference on Computational and information science 2009 (2009)

This work introduces the concept of analysis of synergy interactions in chemical (biochemical) reaction systems. The systems are defined by mass balances for reacting species, reaction network given by a stoichiometric matrix, reaction (kinetic) parameters, and parameters of interaction between the reaction system and a surrounding. Systems analysis is based on statistical evaluation of numerical results of computer simulation of effects of a set of uncorrelated stochastic parameters, defined by corresponding ranges and probability distributions. From the simulation data are extracted parameter global sensitivities and synergy effect of each parameter in interaction with the whole system. The global parameter sensitivities are defined as ratios of conditional variances of expected values for each parameter and the total dispersion of simulation data. The synergy effects are defined as the relative difference between expected values of the conditional variances with exclusion of each parameter and the variance of the conditional expected value of the parameter. Numerical evaluations are performed by use of sampling the parametric space by Lissajous type of curves and the Fourier Amplitude Sensitivity Test (FAST) algorithm. The method is applied for analysis of propagation hepatitis B virus (HBV) in a stochastic single cell model, and for metabolic control analysis of a branched network. The results for virus propagation show dominant synergy effect of the system parameters, compared to negligible influence of individual parameters. The metabolic control analysis show that under homeostatic conditions influence of the individual enzymes is dominant and the key enzyme responsible for flux regulation is determined. However, under perturbed homeostatic conditions influence of synergy effects dominates over impact of individual parameters. Applicability of the proposed concept is discussed in view of model improvement and potential control of reaction systems.
Quality of routing congestion games in wireless sensor networks
Authors: Costas Busch, Rajgopal Kannan, Athanasios V. Vasilakos
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within a routing class, the maximum link congestion is also an important metric for measuring the quality of the paths. Here, we study routing games where each player i selfishly selects a path with a respective routing class that simultaneously minimizes its maximum edge congestion Ci and service cost Si, in other words minimizes Ci + Si. We examine the quality of Nash-equilibria and prove that the price of stability is 1. The price of anarchy is bounded above by min(C*, S*) &middot; m log n, where m is the number of routing classes, n is the size of the graph, and C* and S* are the optimal coordinated congestion and service costs. Thus, under certain circumstances, the player's selfishness does not hurt the social welfare and actually the equilibria can give good approximations for the coordinated optimal social cost.
LFTHREADS: a lock-free thread library
Authors: Anders Gidenstam, Marina Papatriantafilou
Venue: ACM SIGARCH Computer Architecture News (2009)

This extended abstract presents LFTHREADS, a thread library entirely based on lock-free methods, i.e. no spinlocks or similar synchronization mechanisms are employed in the implementation of the multithreading. Since lockfreedom is highly desirable in multiprocessors/multicores due to its advantages in parallelism, fault-tolerance, convoy-avoidance and more, there is an increased demand in lock-free methods in parallel applications, hence also in multiprocessor/multicore system services. LFTHREADS is the first thread library that provides a lock-free implementation of blocking synchronization primitives for application threads; although the latter may sound like a contradicting goal, such objects have several benefits: e.g. library operations that block and unblock threads on the same synchronization object can make progress in parallel while maintaining the desired thread-level semantics and without having to wait for any "low" operations among them. Besides, as no spin-locks or similar synchronization mechanisms are employed, memory contention can be reduced and processors/cores are able to do useful work. As a consequence, applications, too, can enjoy enhanced parallelism and fault-tolerance. For the synchronization in LFTHREADS we have introduced a new method, which we call responsibility hand-off (RHO), that does not need any special kernel support. The RHO method is also of independent interest, as it can also serve as a tool for lock-free token passing, management of contention and interaction between scheduling and synchronization. This paper gives an outline and the context of LFTHREADS. For more details the reader is refered to [7] and [8].
A Genetic-Algorithm-Based Weight Discretization Paradigm for Neural Networks
Authors: Jian Bao, Bin Zhou, Yi Yan
Venue: Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering - Volume 04 (2009)

The traditional neural networks with continuous weights easy to implement in software might often be very burdensome in the embedded hardware systems and therefore more costly. Hardware-friendly neural networks are essential to ensure the functionality and effectiveness of the embedded implementation. To achieve this aim, A GA-based algorithm for training neural networks with discrete weights and quantized on-linear activation function is presented in this paper. The performance of this procedure is evaluated by comparing it with multi-threshold method and continuous discrete learning method based on computing the gradient of the error function, and the simulation results show this new learning algorithm outperforms the other two greatly in convergence and generalization.
Symbolic Classification of General Multi-Player Games
Authors: Peter Kissmann, Stefan Edelkamp
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

For general two-player turn-taking games, first solvers have been contributed. Algorithms for multi-player games like Maxn, however, cannot classify general games robustly, and its extension Soft-Maxn, which can play optimally against unknown and weak opponents, demands large amounts of memory. As RAM is a scarce resource, this paper proposes a memory-efficient implementation of the Soft-Maxn algorithm, by exploiting the functional representation of state and evaluation sets with BDDs.
Online Algorithm for Application Layer Anycast
Authors: Shui Yu, Zhongwen Li, Bin Liu
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

Application layer anycast possesses the property of flexibility, however, all the proposed application layer anycast routing algorithms are based on probing so far. One disadvantage of probing algorithms is that there are too many probing packets, which degrade the network performance, wast network bandwidth. In this paper, we propose an online algorithm, balance algorithm, for application layer anycast. Compared with the probing algorithms, the proposed algorithm has no probing cost at all. We model the two kinds of algorithms, and analyse the performance of the two algorithms. The results show that the online balance algorithm is better than the probing algorithms in terms of performance. A simulation is conducting as future work.
Scaffolding the Process of Collaboration: Exploration of Separate Control of Shared Space
Authors: Lucinda Kerawalla, Darren Pearce, Jeanette O'Connor, Rosemary Luckin, Nicola Yuill, Amanda Harris
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Most educational software available to children is designed for a single user and this, coupled with a shortage of computers in schools, means that pairs or groups of children often share an inappropriate interface. Previous research has found that this can be detrimental to the process of collaboration. We describe a novel user interface, Separate Control of Shared Space (SCOSS), and present two studies that explore its potential as a tool to resource collaborative interactions. We illustrate how it can be used to allow for equitable control at both input and task levels, and how it visually represents agreement and disagreement which can be used to mediate collaboration about a final, agreed-upon, solution. We conclude by recognising the potential of the SCOSS interface for providing data about each user's input into a learner model, which can then be used as an additional resource for mediating the collaborative process.
Quantifying optimum fault tolerance of manipulators and robotic vision systems
Authors: John E. Mcinroy
Venue:  (2008)

For any robotic system, fault tolerance is a desirable property. This work uses a comparative approach to investigate fault tolerance and the associated problem of reduced manipulability of robots and reduced perceptibility of vision systems. An important result in combinatorial matrix theory is first obtained. Its consequent modifications are then applied to the theory of fault tolerance of robotic manipulators and vision systems. It is shown that for a certain class of manipulators, the mean squared relative manipulability over all possible cases of a given number of actuator failures is always constant irrespective of the geometry of the manipulator. A theorem formulates the value of the mean squared relative manipulability. It is shown that this value depends only upon the number of simultaneous joint failures, the nominal number of joint degrees of freedom and the nominal task degrees of freedom. It is difficult to predict specific failures at the design stage and as such failure of any actuator is considered equally likely. In this context, optimal fault tolerant manipulability is quantified. The theory is applied to a special class of parallel manipulators called Orthogonal Gough-Stewart Platforms (Orthogonal GSPs or OGSPs). A class of symmetric OGSPs which inherently provide for optimal fault tolerant manipulability under a single failure is developed. The theory is then extended to study failure tolerance of robotic vision systems. The problem of reduced perceptibility under failures in such systems is addressed. The concept of relative perceptibility, which is analogous to the concept of relative manipulability, is used to design vision systems capable of withstanding failures. It is shown that for a certain class of robotic vision systems analogous to the aforementioned class of robotic manipulators, the mean squared relative motion perceptibilities over all possible cases of a given number of sensing failures (or a given number of actuator failures) is always constant irrespective of the geometry of the robotic vision system.
Dynamic Agent Architectures for Complex Systems
Authors: Jeffrey Tweedale, Lakhmi Jain
Venue: Proceeding of the 2008 conference on Knowledge-Based Software Engineering: Proceedings of the Eighth Joint Conference on Knowledge-Based Software Engineering (2008)

Cognitive Science is a field of research attracting significant effort. This research requires the formation of teams of agents in order to dynamically configure the team with the ability to solve the decomposed task of the goal presented. Traditionally all tasks must be completed successfully or the team fails the goal [1,2]. A dynamic architecture would substitute agents within the team with alternative capabilities in order to succeed. It may even compromise and offer a partial solution and offer it to another system to complete. A good communications framework is required to pass messages between separate agent and other systems. Discussion about confined frameworks have recently been extended to enable individual students associated with our Knowledge-Based and Intelligent Information and Engineering Systems (KES) group to fast track the development of their research concepts. A Plug 'n' Play concept based on a multi-agent blackboard architecture forms the basis of this research. This paper highlights the core architecture, we believe is required for Multi-Agent System (MAS) developers achieve such flexibility. The research focuses on how agents can be teamed to provide the ability to adapt and dynamically organise the required functionality to automate in a team environment. The model is conceptual and is proposed initially as a blackboard model, where each element represents a block of functionality required to automate a process in order to complete a specific task. Discussion is limited to the formative work within the foundation layers of that framework.
A unified tensor framework for face recognition
Authors: Santu Rana, Wanquan Liu, Mihai Lazarescu, Svetha Venkatesh
Venue: Pattern Recognition (2009)

In this paper we propose a new optimization framework that unites some of the existing tensor based methods for face recognition on a common mathematical basis. Tensor based approaches rely on the ability to decompose an image into its constituent factors (i.e. person, lighting, viewpoint, etc.) and then utilizing these factor spaces for recognition. We first develop a multilinear optimization problem relating an image to its constituent factors and then develop our framework by formulating a set of strategies that can be followed to solve this optimization problem. The novelty of our research is that the proposed framework offers an effective methodology for explicit non-empirical comparison of the different tensor methods as well as providing a way to determine the applicability of these methods in respect to different recognition scenarios. Importantly, the framework allows the comparative analysis on the basis of quality of solutions offered by these methods. Our theoretical contribution has been validated by extensive experimental results using four benchmark datasets which we present along with a detailed discussion.
Evie - A developer toolkit for encoding service interaction patterns
Authors: Anthony M. O'Hagan, Shazia Sadiq, Wasim Sadiq
Venue: Information Systems Frontiers (2009)

Facilitation of collaborative business processes across organizational and infrastructural boundaries continues to present challenges to enterprise software developers. One of the greatest difficulties in this respect is achieving a streamlined pipeline from business modeling to execution infrastructures. In this paper we present Evie - an approach for rapid design and deployment of event driven collaborative processes based on significant language extensions to Java that are characterized by abstract and succinct constructs. The focus of this paper is to provide proof of concept of Evie's expressability using a recent benchmark known as service interaction patterns. While the patterns encapsulate the breadth of required business process semantics the Evie language delivers a rapid means of encoding them at an abstract level, and subsequently compiling and executing them to create a fully fledged Java-based execution environment.
Administering Windows Server 2008 Server Core
Authors: John Paul Mueller
Venue:  (2008)

Microsoft's new GUI-less Server Core is a command line version of Windows Server 2008 that offers better security, reduced size, and faster access. Inside this comprehensive guide, you'll find everything you need to quickly master this sleek new version. Packed with instructions and practical examples, this book teaches you how to operate in a windowless environment, including using all the commands, creating BAT files, working with scripts, using registry hacks, managing remote systems, and more. Includes best practices, 52 indispensable command line tricks, and an alphabetical list of all the commands. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Real time medical telemonitoring of sustainable health care measuring devices
Authors: Carmen Aurora Bulucea, Marius Constantin Popescu, Cornelia Aida Bulucea, Anca Patrascu, Gheorghe Manolea
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

An important issue of medical world concerns the creation of systems for online medical parameters monitoring. The solution is to pervade into computing systems which have the capabilities of monitoring, data acquisition and data transfer from medical devices. In the paper the medical measurement devices which are realized on basis of optoelectronics and microwave, and the adaptation and use of these devices or sensors in instrumentation systems and telecommunications are taken into account. The study aims to create a user-friendly interface software?that enables the steering vector network analyzers vector via the Internet.
Courier problems
Authors: Malay Bhattacharyya
Venue: Crossroads (2009)

Courier problems comprise a set of recently proposed combinatorial optimization problems, which are inspired by some novel requirements in railway wagon scheduling. In these problems, scheduling strategies of some mobile couriers are considered. These mobile couriers initially reside at some fixed location. They are assigned some duties of commodity transfer between different pairs of locations. The scenario may be static or dynamic. The motivation is to optimize the movement of the couriers over the constraint of the traversed path or the associated cost. We discuss here some varieties of the courier problems formalized on graphs and address the potential methods of their solution.
Efficient Frequent Itemsets Mining by Sampling
Authors: Yanchang Zhao, Chengqi Zhang, Shichao Zhang
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

As the first stage for discovering association rules, frequent itemsets mining is an important challenging task for large databases. Sampling provides an efficient way to get approximating answers in much shorter time. Based on the characteristics of frequent itemsets counting, a new bound for sampling is proposed, with which less samples are necessary to achieve the required accuracy and the efficiency is much improved over traditional Chernoff bounds.
Reduction of peak input currents during charge pump boosting in integrated high-voltage generators
Authors: Jan Doutreloigne
Venue: Proceedings of the 8th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics (2009)

This paper describes two methods for the reduction of the peak input current during the boosting of Dickson charge pumps. One of the methods is implemented in the fully integrated Dickson charge pumps of a high-voltage display driver chip for smart-card applications. Experimental results reveal good correspondence with Spice simulations and show a reduction of the peak input current by a factor of 6 during boosting.
Toward dependency-aware live virtual machine migration
Authors: Anthony Nocentino, Paul M. Ruth
Venue: Proceedings of the 3rd international workshop on Virtualization technologies in distributed computing (2009)

The most powerful characteristic of any machine virtualization technology is its ability to adapt to both its underlying infrastructure and the applications it supports. Possibly the most dynamic feature of machine virtualization is the ability to migrate live virtual machines between physical hosts in order to optimize performance or avoid catastrophic events. Unfortunately, the need for live migration increases during times when resources are most scarce. For example, load-balancing is only necessary when load is significantly unbalanced and impending downtime often causes many virtual machines to seek new hosts simultaneously. It is imperative that live migration mechanisms be as fast and efficient as possible in order for virtualization to provide dynamic load balancing, zero-downtime scheduled maintenance, and automatic failover during unscheduled downtime. This paper proposes a novel dependency-aware approach to live virtual machine migration and presents the results of the initial investigation into its ability to reduce migration latency and overhead. The approach uses a tainting mechanism originally developed as an intrusion detection mechanism. Dependency information is used to distinguish processes that create direct or indirect external dependencies during live migration. It is shown that the live migration process can be significantly streamlined by selectively applying a more efficient protocol when migrating processes that do not create external dependencies during migration.
Grey Neural Network Based Predictive Model for Multi-core Architecture 2D Spatial Characteristics
Authors: Jingling Yuan, Tao Jiang, Jingjing He, Luo Zhong
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

The trend toward multi-/many- core processors will result in sophisticated large-scale architecture substrates that exhibit increasingly complex and heterogeneous behavior. Existing methods lack the ability to accurately and informatively forecast the complex behavior of large and distributed architecture substrates across the design space. Grey neural network is an innovative intelligent computing approach that combines grey system model and neural network. Grey neural network makes full use of the similarities and complementarity between grey system model and neural network to overcome the disadvantage of individual method. In this paper, we propose to use grey neural network to predict 2D space parameters produced by wavelet analysis,which can efficiently reason the characteristics of large and sophisticated multi-core oriented architectures during the design space exploration stage with less samples rather than using detailed cycle-level simulations. Experimental results show that the models achieve high accuracy while maintaining low complexity and computation overhead.