ppxscal/embedding_network huggingface dataset:
Mobile interaction design: Integrating individual and organizational perspectives
Authors: Peter Tarasewich, Jun Gong, Fiona Fui-Hoon Nah, David Dewester
Venue: Information-Knowledge-Systems Management (2008)

While mobile computing provides organizations with many information systems implementation alternatives, it is often difficult to predict the potential benefits, limitations, and problems with mobile applications. Given the inherent portability of mobile devices, many design and use issues can arise which do not exist with desktop systems. While many existing rules of thumb for design of stationary systems apply to mobile systems, many new ones emerge. Issues such as the security and privacy of information take on new dimensions, and potential conflicts can develop when a single mobile device serves both personal and business needs. This paper identifies potential issues and problems with the use of mobile information systems by examining both personal and organizational perspectives of mobile devices and applications. It provides a set of guidelines that can assist organizations in making decisions about the design and implementation of mobile technologies and applications in organizations.
Norm emergence under constrained interactions in diverse societies
Authors: Partha Mukherjee, Sandip Sen, Stéphane Airiau
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2 (2008)

Effective norms, emerging from sustained individual interactions over time, can complement societal rules and significantly enhance performance of individual agents and agent societies. Researchers have used a model that supports the emergence of social norms via learning from interaction experiences where each interaction is viewed as a stage game. In this social learning model, which is distinct from an agent learning from repeated interactions against the same player, an agent learns a policy to play the game from repeated interactions with multiple learning agents. The key research question is to characterize when and how the entire population of homogeneous learners converge to a consistent norm when multiple action combinations yield the same optimal payoff. In this paper we study two extensions to the social learning model that significantly enhances its applicability. We first explore the effects of heterogeneous populations where different agents may be using different learning algorithms. We also investigate norm emergence when agent interactions are physically constrained. We consider agents located on a grid where an agent is more likely to interact with other agents situated closer to it than those that are situated afar. The key new results include the surprising acceleration in learning with limited interaction ranges. We also study the effects of pure-strategy players, i.e., nonlearners in the environment.
Computer generated celtic canvas
Authors: Sudhanshu K. Semwal
Venue:  (2008)

This thesis investigates the application of complex systems theory and methods in Celtic design. Of interest are the aesthetics of line and form seen in insular manuscripts from the 9th century and how these can be more closely approached in computer generated work. An extensive literature review evaluates all related areas of research and reveals complex systems theory as a rare approach not yet extensively applied to these problems. Complex systems theory is normally associated with the study of the evolution of patterns in chaotic systems. This thesis describes a number of novel ways in which the theory can be applied to problems that are highly structured at the outset, adapted, and then often finished by hand. Integration of the theory begins by recognizing a composition as the outcome of interactions between design elements. A robust model of curvature dynamics is introduced to allow the genetic description and evolution of space curves as a foundation for line drawing and structural anatomy. Cellular machines are developed to facilitate the integration of lines and forms, including the allocation of space, the solution of crossing states, occlusion processing, depth cues, and line weighting. Lattice gas automata are developed to assist with exploration and spontaneity. Original line art is used to specify shapes and forms. Finally, we demonstrate the application of linear genetic programming as a means of handling the complexity of representation, assembly, and the manipulation of designs under this level complexity. The ideas are tested against examples of knotwork, plant, and animal designs from the book of Kells, the Lindisfarne gospels, and drawings from the studies of George Bain.
A Leave-One-Out Bound for ν-Support Vector Regression
Authors: Qin Ruxin, Chen Jing, Deng Naiyang, Tian Yingjie
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

An upper bound on the Leave-one-out (Loo) error for &nu;-support vector regression (&nu;-SVR) is presented. This bound is based on the geometrical concept of span. We can select the parameters of &nu;-SVR by minimizing this upper bound instead of the error itself, because the computation of the Loo error is extremely time consuming. We also can estimate the generalization performance of &nu;-SVR with the help of the upper bound. It is shown that the bound presented herein provide informative and efficient approximations of the generalization behavior based on two data sets.
A Nearest Neighbor Approach to Predicting Survival Time with an Application in Chronic Respiratory Disease
Authors: Maurice Prijs, Linda Peelen, Paul Bresser, Niels Peek
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

The care for patients with chronic and progressive diseases often requires that reliable estimates of their remaining lifetime are made. The predominant method for obtaining such individual prognoses is to analyze historical data using Cox regression, and apply the resulting model to data from new patients. However, the black-box nature of the Cox regression model makes it unattractive for clinical practice. Instead most physicians prefer to relate a new patient to the histories of similar, individual patients that were treated before. This paper presents a prognostic inference method that combines the k-nearest neighbor paradigm with Cox regression. It yields survival predictions for individual patients, based on small sets of similar patients from the past, and can be used to implement a prognostic case-retrieval system. To evaluate the method, it was applied to data from patients with idiopathic interstitial pneumonia, a progressive and lethal lung disease. Experiments pointed out that the method competes well with Cox regression. The best predictive performance was obtained with a neighborhood size of 20.
A coordination mechanism for swarm navigation: experiments and analysis
Authors: Leandro Soriano Marcolino, Luiz Chaimowicz
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

We present an algorithm that allows swarms of robots to navigate in environments containing unknown obstacles, moving towards and spreading along 2D shapes given by implicit functions. Basically, a gradient descent approach augmented with local obstacle avoidance is used to control the swarm. To deal with local minima regions, we use a coordination mechanism that reallocates some robots as "rescuers" and sends them to help other robots that may be trapped. The main objective of this paper is to analyze the performance of this algorithm in terms of its completion rate and communication requirements as the number of robots increases. For this, a series of simulations are presented and discussed.
History of Mechanical Computing Machinery
Authors: George C. Chase
Venue: IEEE Annals of the History of Computing (1980)

A brief (25 page) history of mechanical computing machinery, from the abacus to Aiken's Mark I. 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
Approximating Minimum Multicuts by Evolutionary Multi-objective Algorithms
Authors: Frank Neumann, Joachim Reichel
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

It has been shown that simple evolutionary algorithms are able to solve the minimum cut problem in expected polynomial time when using a multi-objective model of the problem. In this paper, we generalize these ideas to the NP-hard minimum multicut problem. Given a set of k terminal pairs, we prove that evolutionary algorithms in combination with a multi-objective model of the problem are able to obtain a k-approximation for this problem in expected polynomial time.
Guided Prefetching Based on Runtime Access Patterns
Authors: Jie Tao, Georges Kneip, Wolfgang Karl
Venue: Proceedings of the 8th international conference on Computational Science, Part III (2008)

Cache prefetching is a basic technique for removing cache misses and the resulting access penalty. This work proposes a kind of guided prefetching which uses the access pattern of an application to prohibit from loading data which are not required. The access pattern is achieved with a data analyzer capable of discovering the affinity and regularity of data accesses. Initial results depict a performance improvement of up to 20%.
Sensitivity Analysis of a Dynamical System Using C++
Authors: Donna Calhoun, Roy Overstreet
Venue: Scientific Programming (1993)

This article introduces basic principles of first order sensitivity analysis and presents an algorithm that can be used to compute the sensitivity of a dynamical system to a selected parameter. This analysis is performed by extending with sensitivity equations the set of differential equations describing the dynamical system. These additional equations require the evaluation of partial derivatives, and so a technique known as the table algorithm, which can be used to exactly and automatically compute these derivatives, is described. A C++ class which can be used to implement the table algorithm is presented along with a driver routine for evaluating the output of a model and its sensitivity to a single parameter. The use of this driver routine is illustrated with a specific application from environmental hazards modeling.
Coaching Web-based Collaborative Learning based on Problem Solution Differences and Participation
Authors: Maria de los Angeles Constantino-Gonzalez, Daniel D. Suthers, José G. Escamilla de los Santos
Venue: International Journal of Artificial Intelligence in Education (2003)

This paper describes the design and evaluation of COLER, a coach that helps students collaborate while solving Entity Relationship modelling problems. Unlike previous work generally emphasizing dialogue analysis or expert models, this work evaluates a new approach to supporting collaboration that identifies learning opportunities based on differences between problem solutions and tracking levels of participation. The contribution made by these and other knowledge sources in the generation of collaboration advice was evaluated by comparing expert rankings of advice to the software coach's rankings, and by identifying the advice that would be lost if each respective knowledge source were removed. Results show that good quality advice can be obtained through these knowledge sources, although other knowledge sources may fill in gaps relative to the expert's performance. This work demonstrates how intelligent agents can produce reasonable collaboration advice in domains for which structured problem solutions exist by using a few basic knowledge sources, and illustrates several methods of evaluating the knowledge and reasoning of complex knowledge-based system.
Modeling production with artificial societies: the emergence of social structure
Authors: Monica Dascalu, Eduard Franti, Gheorghe Stefan, Lucian Milea
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

This paper presents a new experiment undertaken in the artificial society introduced by Epstein and Axtell [1]. The artificial society basically consists of a "cellular" landscape that contains resources and a population of agents that move around in this landscape, searching for the resources that they need to consume in order to survive. The new experiment introduces production and trade in this model in a very simple manner: the richest agents can produce a new commodity, named vitamin, that the other agents can buy and consume. The effect of the vitamins is to improve the agent's skills for a certain period of time, proportional to the quantity consumed. Running the artificial societies program with this new scenario, one can notice the improvement of population dynamics, explained by the fact that the agents have better survival skills. The most important effect is that the dynamics of agents' wealth shows a very clear clustering of agents after the level of their accumulated resources, phenomenon that we have called emergence of social classes.
RFQ: Redemptive Fair Queuing
Authors: Ajay Gulati, Peter Varman
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

Fair-queuing schedulers provide clients with bandwidth or latency guarantees provided they are well-behaved i.e. the requested service is always within strict predefined limits. Violation of the service bounds results in nullification of the performance guarantees of the misbehaving client.In this paper we relax this notion of good behavior and present a generalized service model that takes the current system load into consideration. Consequently clients may opportunistically consume more than their contracted service without losing future performance guarantees, if doing so will not penalize well-behaved clients. We present a new algorithm RFQ (Redemptive Fair Queuing) along with a generalized traffic model called the Deficit Token Bucket (DTB). RFQ incorporates the notion of redemption, whereby a misbehaving client may be rejuvenated and regain its performance guarantees. We characterize the conditions for rejuvenating a client, and prove that RFQ meets its performance guarantees in the DTB model.
Unit Testing of Z Specifications
Authors: Mark Utting, Petra Malik
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

We propose a simple framework for validation unit testing of Z specifications, and illustrate this framework by testing the first few levels of a POSIX specification. The tests are written in standard Z, and are executable by the CZT animator, ZLive.
Service clouds: overlay-based infrastructure for autonomic communication services
Authors: Philip K. Mckinley
Venue:  (2007)

In autonomic computing, systems manage their own operation and adapt to changes in the environment, with only limited human guidance. Further, autonomic computing supports pervasive computing, which removes the traditional boundaries for how, when, and where humans and computers interact. One area in which autonomic behavior can be particularly helpful is communication-related software; autonomic computing can be used to enhance quality of service in the presence of dynamic or adverse conditions. However, coordinating the actions of software components that are distributed across multiple platforms is a complex task. Developers of autonomic communication services can benefit from a software infrastructure to support coordinated actions among system layers, and across system platforms. In this dissertation, we introduce Service Clouds, which represents a new approach to supporting the development of autonomic communication services. In this approach, collaborating overlay nodes use dynamic software composition to realize autonomic distributed services. The key insight is that overlay networks provide a "blank computational canvas" on which services can be instantiated and configured as needed, and later reconfigured in response to changing conditions. We have implemented a prototype of Service Clouds and evaluated it both for high-performance communication services atop the Internet, and for mobile computing services. The Service Clouds architecture and prototype enable developers to rapidly design and deploy autonomic communication services. This dissertation addresses four aspects of autonomic communication services. First, we explore requirements for autonomic communication services, identify constituent components for an infrastructure. We design the Service Clouds overlay-based model and architecture and describe how to organize components, specify interactions among building blocks, and provide basic algorithms and protocols to compose services. We conclude this part with a description of the prototype. Second, we evaluate the Service Clouds model on the Internet. We use the prototype to construct and deploy two services: TCP-Relay, in which a node is selected and configured dynamically to serve as a relay to expedite data transfer; and MCON, a multipath connection algorithm that exploits network topology to dynamically establish a high-quality secondary path, as a shadow connection to the primary path to support robust streaming. Third, we investigate extension of Service Clouds to the wireless edge of the Internet to support pervasive mobile computing. Specifically, we address multimedia streaming and demonstrate how dynamic creation and configuration of proxy services support QoS streaming in highly dynamic conditions and frequent relocation of users. Fourth, we address composition of distributed services atop an overlay network. We introduce and evaluate Dynamis, a generic algorithmic approach to locating suitable nodes on which to map service entities with minimal probing overhead.
A Peer-to-Peer Database Server
Authors: John Colquhoun, Paul Watson
Venue: Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge (2008)

Database systems have traditionally used a Client-Server architecture. If the server becomes overloaded, clients will experience an increase in query response time, and in the worst case the server may be unable to provide any service at all.In the domain of file-sharing, the problem of server overloading has been successfully addressed by the use of Peer-to-Peer (P2P) techniques in which clients (peers) supply files --- or pieces of files --- to each other. This paper describes the Wigan P2P Database System, which was designed to investigate how P2P techniques for reducing server load and so increasing system scalability can be applied successfully in a database environment. Peers cache query results and use them to satisfy each other's queries. Wigan is based on the popular BitTorrent file-sharing protocol.
Impossibility of a Quantum Speed-Up with a Faulty Oracle
Authors: Oded Regev, Liron Schiff
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I (2008)

We consider Grover's unstructured search problem in the setting where each oracle call has some small probability of failing. We show that no quantum speed-up is possible in this case.
Periodic Solution of Cohen-Grossberg Neural Networks with Variable Coefficients
Authors: Hongjun Xiang, Jinde Cao
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

In this paper, the periodic solution for a class of Cohen-Grossberg neural networks with variable coefficients is discussed. By using inequality analysis technique and matrix theory, some new sufficient conditions are obtained to ensure the existence, uniqueness, global attractivity and exponential stability of the periodic solution. An example is given to show the effectiveness of the obtained results.
Memory-Centric Hardware Synthesis from Dataflow Models
Authors: Scott Fischaber, John Mcallister, Roger Woods
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

Generation of hardware architectures directly from dataflow representations is increasingly being considered as research moves toward system level design methodologies. Creation of networks of IP cores to implement actor functionality is a common approach to the problem, but often the memory sub-systems produced using these techniques are inefficiently utilised. This paper explores some of the issues in terms of memory organisation and accesses when developing systems from these high level representations. Using a template matching design study, challenges such as modelling memory reuse and minimising buffer requirements are examined, yielding results with significantly less memory requirements and costly off-chip memory accesses.
EVM's Java Dynamic Memory Manager and Garbage Collector
Authors: Sang-Yun Lee, Byung-Uk Choi
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In this paper, we propose the dynamic memory manager and garbage collector for the embedded Java virtual machine. In order to facilitate to memory allocation and deallocation fast, the memory manager divides a heap into various sizes and thus manages it with the unit of block which is a set of identical cell. And we propose a new 4-color based Mark Sweep garbage collector in order to support a multi-thread.
Artificial neural network model for passenger car unit
Authors: Praveen Aggarwal
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

In most of the developing countries including India mixed traffic condition prevail on roads and highways. There is a wide variation in the static and the dynamic characteristics of different types of traffic. The only way of accounting for this non-uniformity for any traffic analysis in traffic stream is to convert all vehicles into a common unit and the most accepted unit for this purpose is passenger car unit (PCU). PCU value for a vehicle is not constant but varies with traffic and roadway condition around. A number of factors have been identifies affecting PCU values. The current study aims at developing a Artificial Neural Network (ANN) based model for the estimation of PCU values for bus. ANN based model is of importance because of a number of independent affecting factors. Results of developed ANN based model are compared with the quoted results and are found with high degree of correlation.
Multi-Class Segmentation with Relative Location Prior
Authors: Stephen Gould, Jim Rodgers, David Cohen, Gal Elidan, Daphne Koller
Venue: International Journal of Computer Vision (2008)

Multi-class image segmentation has made significant advances in recent years through the combination of local and global features. One important type of global feature is that of inter-class spatial relationships. For example, identifying "tree" pixels indicates that pixels above and to the sides are more likely to be "sky" whereas pixels below are more likely to be "grass." Incorporating such global information across the entire image and between all classes is a computational challenge as it is image-dependent, and hence, cannot be precomputed.In this work we propose a method for capturing global information from inter-class spatial relationships and encoding it as a local feature. We employ a two-stage classification process to label all image pixels. First, we generate predictions which are used to compute a local relative location feature from learned relative location maps. In the second stage, we combine this with appearance-based features to provide a final segmentation. We compare our results to recent published results on several multi-class image segmentation databases and show that the incorporation of relative location information allows us to significantly outperform the current state-of-the-art.