ppxscal/embedding_network huggingface dataset:
Effects of Population Size on Computational Performance of Genetic Algorithm on Multiplicative Landscape
Authors: Hiroshi Furutani, Tetsuro Fujimaru, Yu-an Zhang, Makoto Sakamoto
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

One of the most fundamental problems in the practice of Genetic Algorithms (GAs) is the choice of population size N. Theoretical investigation of this problem with a finite population size requires stochastic theory. In this study, We examined effects of stochastic fluctuation in a GA on the multiplicative landscape. We used Markov chain model and its diffusion approximation to calculate the distribution of the first order schemata. In numerical experiments, we found that the effect of stochastic fluctuation bcomes larger when we use smaller population size N. If selection strength is small, the effect of stochastic fluctuation is very strong, and this causes significant N-dependence. We applied diffusion approximation in the analysis of GA calculations, and found that this theory can explain various aspects of the GA on the multiplicative landscape.
Forensic Analysis for Epidemic Attacks in Federated Networks
Authors: Yinglian Xie, Vyas Sekar, Michael Reiter, Hui Zhang
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

We present the design of a Network Forensic Alliance (NFA), to allow multiple administrative domains (ADs) to jointly locatethe origin of epidemic spreading attacks. ADs in the NFA collaborate in a distributed protocol for post-mortem analysis ofworm-like attacks. Information exchange between any two participating ADs is limited to traffic records that are known toboth sides, maintaining the privacy of participants. Such an architecture is incentive-compatible ¿ participants benefit bygaining better local investigative capabilities, even with partial deployment. Further, we show that by sharing local investigationresults, ADs can achieve global investigative capabilities that are comparable to a centralized implementation with accessto global traffic records. Our evaluation demonstrates that it is feasible for large-scale attack investigation to be incrementallydeployed in an Internet-like federation.
Google home: Experience, support and re-experience of social home activities
Authors: Anton Nijholt
Venue: Information Sciences: an International Journal (2008)

Ambient intelligence research is about ubiquitous computing and about social and intelligent properties of computer-supported environments. These properties aim at providing inhabitants or visitors of ambient intelligence environments with support in their activities. Activities include interactions between inhabitants and between inhabitants and (semi-) autonomous agents, including mobile robots, virtual humans and other smart objects in the environment. Providing real-time support requires understanding of behavior and activities. Clearly, being able to provide real-time support also allows us to provide off-line support, that is, intelligent off-line retrieval, summarizing, browsing and even replay, possibly in a transformed way, of stored information. Real-time remote access to these computer-supported environments also allows participation in activities and such participation as well can profit from the real-time capturing and interpretation of behavior and activities performed and supported by ambient intelligence technology. In this paper, we illustrate and support these observations by looking at results obtained in several European and US projects, in particular projects on smart environments, whether they are smart meetings or lecture rooms, smart offices or intelligently monitored events in public spaces. In particular, we look at the augmented multi-party interaction (AMI) project in which we are involved and we try to sketch a framework in which we can transform research results from the meeting context to the home environment context.
Agent-Based Price Negotiation System for Electronic Commerce
Authors: Jinkai Wang, Youlin Chen
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

With the rapid development of electronic commerce, more and more people begin to go shopping on the Internet at present. Price negotiation has become increasingly important for two reasons. One is from a consumer's view price negotiation provides an opportunity to debate the price, the other is from a vendor's view the ability to price negotiation allows for flexibility in pricing that a rigidly fixed price cannot offer. An obstacle of hindering the development of electronic commerce is that price negotiation on the Internet is not different like shopping in store. In this paper, the author wants to design an agent-based price negotiation system for electronic commerce. It can replace the seller to negotiate with the buyers on the Internet. Firstly we put forward a framework of agent- based price negotiation, then we propose a price negotiation model based on equilibrium theory of game theory. Finally, the paper describes the behavior definition of agent and explains the rules how to communicate between agents.
E-learning service management and brokerage framework: architecture and functional services
Authors: Anna Kefala, Theodore Apostolopoulos
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

During the last years, the evolution occurred in WWW and communication technologies has enabled access to e-Services via diverse means and locations. E-learning systems presenting diverse features and functionality are implemented en masse. We propose a management framework that acts as a facilitator among e-learning systems, learners, underlying communication infrastructure, learning content and provided learning methods, offering an integrated management architecture, while at the same time, it acts as a broker for e-learning and content providing systems. A key characteristic of proposed architecture is detection and management of parameters, which change dynamically at each user session and mainly concern connection context and access device characteristics. In this paper, we present content and e-learning provision services context, resulting in features and capabilities that a management and brokerage framework should support. We outline key features of proposed architecture and present main functional services supported by proposed framework. A use scenario is also presented and we conclude with summarizing main points of proposed management framework.
Technical communique: On the region of attraction of nonlinear quadratic systems
Authors: F. Amato, C. Cosentino, A. Merola
Venue: Automatica (Journal of IFAC) (2007)

Quadratic systems play an important role in the modelling of a wide class of nonlinear processes (electrical, robotic, biological, etc.). For such systems, it is of mandatory importance not only to determine whether the origin of the state space is locally asymptotically stable but also to ensure that the operative range is included into the convergence region of the equilibrium. Based on this observation, this paper considers the following problem: given the zero equilibrium point of a nonlinear quadratic system, assumed to be locally asymptotically stable, and a certain polytope in the state space containing the origin, determine whether this polytope belongs to the region of attraction of the equilibrium. The proposed algorithm requires the solution of a suitable feasibility problem involving linear matrix inequalities constraints. An example illustrates the effectiveness of the proposed procedure by exploiting a population interaction model of three species.
Solution of three problems of Cornuéjols
Authors: Maria Chudnovsky, Paul Seymour
Venue: Journal of Combinatorial Theory Series B (2008)

A graph is balanced if it is bipartite and every induced cycle has length divisible by four. In his book, Gerard Cornuejols proposed a number of open questions, offering $5000 for the solution of any of them. Here we solve three of them, about balanced graphs.
User Interface Design Model
Authors: Lu Xudong, Wan Jiancheng
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

To promote the model-based software engineering development of user interfaces, this paper proposes an EIP model that can design user interfaces in abstract and can support automatic generation of user interfaces. In the model, functionality and composition are taken as the direct descriptive objects of engineering modeling, making user interface construction more intuitive and easily acceptable; and a layered approach is adopted for both abstraction and presentation of user interface description, making the modeling powerful enough in dealing with complex user interfaces. In the research, internal data models and their related user interface design patterns are isolated as the user interface modeling components, making presentation and layout more easily constructed. Based on EIP and tools, the automatic generation of user interfaces is achieved.
Exploring Concepts for Deterministic Software Engineering: Service Interfaces, Pattern Expansion, and Stability
Authors: Herwig Mannaert, Jan Verelst, Kris Ven
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Automated production does not yet have an equivalent in the software development industry. Mathematical laws describing software development, and rules for structural composition of building blocks to create larger systems, do not exist exist at this point in time. Nevertheless, due to the fundamental need to improve the efficiency of software development, and to eliminate human errors, it is imperative to automate the software development process. In this paper, we explore some concepts that may contribute towards a more deterministic approach to software engineering. As the software industry is currently evolving to service oriented architectures, an attempt is made to define concepts like service interfaces, loose coupling, and stability of interfaces. In order to achieve a more structured and deterministic implementation of the components, the concept of pattern expansion is proposed: the extension of current code generation techniques to entire template solutions or design patterns. This technique is elaborated, and an implementation example is presented. The results of this pattern expansion prototype are discussed.
Fault-Toleront System Design: Broad Brush and Fine Print
Authors: A. L. ,  Jr. Hopkins
Venue: Computer (1980)

Fault-tolerant computing encompasses diverse architectures. This examination of the field's general concepts, with cautionary notes, identifies common characteristics within this diversity.
A Data Flow Language for Controlling Multiple Interactive Devices
Authors: Kazunori Yamaguchi, Naota Inamoto, Tosiyasu Kunii
Venue: IEEE Computer Graphics and Applications (1985)

System designers construct a conceptual model ¿ independent of, and interfacing with, application and device models ¿and apply it to the PS300 graphics display system for assembly purposes.
Workshop Report: Dedicated Microcomputers for Defense and Industry
Authors: T. H. Nymn
Venue: Computer (1979)

Standards for microprocessors are becoming increasingly important for military and industrial market expansion. This view, expressed by speakers and participants alike, emerged as a recurrent theme at the IEEE Computer Society's microprocessor workshop on the application of dedicated microprocessors in military and industrial systems. The consensus held, however, that standards must be objectively chosen with applications engineers and user communities involved in the decisions and must be "technology transparent" to provide continuity and support for microcomputer development without stifling innovation.
NP-hard graph problems and boundary classes of graphs
Authors: V. E. Alekseev, R. Boliac, D. V. Korobitsyn, V. V. Lozin
Venue: Theoretical Computer Science (2007)

Any graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable when restricted to graphs in special classes. When does a difficult problem become easy? To answer this question we study the notion of boundary classes. In the present paper we define this notion in its most general form, describe several approaches to identify boundary classes and apply them to various graph problems.
Combining multiple microarrays in the presence of controlling variables
Authors: Taesung Park, Sung-Gon Yi, Young Kee Shin, SeungYeoun Lee
Venue: Bioinformatics (2006)

Motivation: Microarray technology enables the monitoring of expression levels for thousands of genes simultaneously. When the magnitude of the experiment increases, it becomes common to use the same type of microarrays from different laboratories or hospitals. Thus, it is important to analyze microarray data together to derive a combined conclusion after accounting for the differences. One of the main objectives of the microarray experiment is to identify differentially expressed genes among the different experimental groups. The analysis of variance (ANOVA) model has been commonly used to detect differentially expressed genes after accounting for the sources of variation commonly observed in the microarray experiment. Results: We extended the usual ANOVA model to account for an additional variability resulting from many confounding variables such as the effect of different hospitals. The proposed model is a two-stage ANOVA model. The first stage is the adjustment for the effects of no interests. The second stage is the detection of differentially expressed genes among the experimental groups using the residuals obtained from the first stage. Based on these residuals, we propose a permutation test to detect the differentially expressed genes. The proposed model is illustrated using the data from 133 microarrays collected at three different hospitals. The proposed approach is more flexible to use, and it is easier to accommodate the individual covariates in this model than using the meta-analysis approach. Availability: A set of programs written in R will be electronically sent upon request. Contact: tspark@stats.snu.ac.kr
Communication Issues in the Design and Analysis of Parallel Algorithms
Authors: B. Lint
Venue: IEEE Transactions on Software Engineering (1981)

As multiple processor systems become more widely accepted the importance of parallel programming increases. In this paper, approaches to the design and analysis of parallel algorithms are investigated. Through several examples, the importance of interprocessor communication in parallel processing is demonstrated. Various techniques that are applicable in the design and analysis of parallel algorithms are examined with emphasis on those techniques that incorporate communication aspects. The paper discusses several models of synchronous and asynchronous parallel computation and their use in analyzing algorithms. Relatively primitive methodologies for designing parallel algorithms are discussed and the need for more general and practical methodologies is indicated.
Kernel PCA for similarity invariant shape recognition
Authors: Hichem Sahbi
Venue: Neurocomputing (2007)

We present in this paper a novel approach for shape description based on kernel principal component analysis (KPCA). The strength of this method resides in the similarity (rotation, translation and particularly scale) invariance of KPCA when using a family of triangular conditionally positive definite kernels. Beside this invariance, the method provides an effective way to capture non-linearities in shape geometry. A given two-dimensional curve is described using the eigenvalues of the underlying manifold modeled in a high-dimensional Hilbert space. Using Fourier analysis, we will show that this eigenvalue description captures low to high variations of the shape frequencies. Experiments conducted on standard databases including the SQUID, the Swedish and the Smithsonian leaf databases, show that the method is effective in capturing invariance and generalizes well for shape matching and retrieval.
Enabling database-aware storage with OSD
Authors: Aravindan Raghuveer, Steven W. Schlosser, Sami Iren
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

The ANSI Object-based Storage Device (OSD) standard is a major step toward enabling explicit applicationawareness in storage systems behind a standard, fullyinteroperable interface [3]. In this paper, we explore a particular flavor of application-awareness, that of database applications. We describe the design and implementation of a database-aware storage system that uses the OSD interface not only as a means to access data, but also to permit explicit communication between the application and the storage system. This communication is significant, as it enables our storage system to transparently optimize data placement and request scheduling. We demonstrate that OSD makes it practical to improve storage performance in these ways without exposing proprietary disk drive parameters to application code, and without labor-intensive, fragile parameter measurement.
Robust Path-Vector Routing Despite Inconsistent Route Preferences
Authors: Aaron Jaggard, Vijay Ramachandran
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Some commonly used inter-domain-routing policies¿e.g., those using BGP's MED attribute for cold-potato routing¿are beyondthe scope of routing theory developed to date. This is because these policies cannot be expressed as a linear preference rankingof available routes at each node. Existing characterizations of well-behaved path-vector routing, however, critically dependon this linear ranking and do not naturally extend to more complex policies. In this paper, we present a framework that isable to model these more general policies. We use it to give the broadest-known sufficient condition for robust convergenceof path-vector protocols, even when complex policies are used. In doing so, we present a new, unified notion of order on policies;this reduces to earlier results in the case of restricted policies, but it allows us to analyze the practically useful butinconsistent policies that could not be directly modeled before. As an application, we rigorously analyze (and improve) variousrobust protocol-design proposals.
Vectorized adaptive quadrature in MATLAB
Authors: L. F. Shampine
Venue: Journal of Computational and Applied Mathematics (2008)

Adaptive quadrature codes process a collection of subintervals one at a time. We show how to process them all simultaneously and so exploit vectorization and the use of fast built-in functions and array operations that are so important to efficient computation in MATLAB. Using algebraic transformations we have made it just as easy for users to solve problems on infinite intervals and with moderate end point singularities as problems with finite intervals and smooth integrands. Piecewise-smooth integrands are handled effectively with breakpoints.
Emotion in Decision Making under Uncertainty and Cognitive Control: A Computational Framework
Authors: Ping Xu, Tao Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Models of decision making usually focus on cognitive, situational, and socio-cultural variables in accounting for human performance. However, emotion especially immediate emotion is rarely addressed within these models. This paper proposes an emotion-based cognitive model about how decisions are made which unifies emotion and cognition as two symbiotically integrated aspects of intelligent behavior. Within the general computational framework the influence of both immediate emotion and expected emotion are included. And to deal with the Zajonc-Lazarus controversy concerns whether emotion depends upon appraisal of a situation or is triggered directly by stimulus features, the present study fits the compromise interpretation that there are parallel processes involved in the triggering of emotion. We also give a formalized description of the model to make it computable and illustrate it by an example of taxpayer's reporting decision.
FPGA Acceleration of Gene Rearrangement Analysis
Authors: Jason D. Bakos
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

In this paper we present our work toward FPGA acceleration of phylogenetic reconstruction, a type of analysis that is commonly performed in the fields of systematic biology and comparative genomics. In our initial study, we have targeted a specific application that reconstructs maximum-parsimony (MP) phylogenies for gene-rearrangement data. Like other prevalent applications in computational biology, this application relies on a control-dependent, memory-intensive, and non-arithmetic combinatorial optimization algorithm. To achieve hardware acceleration, we developed an FPGA core design that implements the application's primary bottleneck computation. Because our core is lightweight, we are able to synthesize multiple cores on a single FPGA. By using several cores in parallel, we have achieved a 25X end-to-end application speedup using simulated input data.
An examination of the auditability of voter verified paper audit trail (VVPAT) ballots
Authors: Stephen N. Goggin, Michael D. Byrne
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

With heightened concerns over the security of electronic voting machines, 37 states now require some form of voter verification mechanism that could then be used in a recount. This usually takes the form of a Voter-Verified Paper Audit Trail (VVPAT). Unfortunately, little is known about the usability of VVPATs for recount purposes. The current study examines the speed and accuracy of hand recounts of VVPATs. Participants counted completed VVPAT ballots which were based on those actually in use in DREs today. Two races from of a spool of 120 ballots were manually counted, which includes separating ballots from the spool and removing rejected ballots. This task was time-consuming and prone to high error rates, with only 57.5% of participants' counts providing the correct election results. Furthermore, ballot rejection rate interacted with the closeness of the race being counted; high rejection rate paired with a small margin of victory resulted in a particularly high error rate. This experiment raises serious concerns about the viability of conducting manual recounts or audits using current VVPAT technology.
Design of high-speed two-stage cascode-compensated operational amplifiers based on settling time and open-loop parameters
Authors: Hamed Aminzadeh, Mohammad Danaie, Reza Lotfi
Venue: Integration, the VLSI Journal (2008)

Settling behavior of operational amplifiers is of great importance in many applications. In this paper, an efficient methodology for the design of high-speed two-stage operational amplifiers based on settling time is proposed. Concerning the application of the operational amplifier, it specifies proper open-loop circuit parameters to obtain the desired settling time and closed-loop stability. As the effect of transfer function zeros has been taken into account, the proposed methodology becomes more accurate in achieving the desired specifications. Simulation results are presented to show the effectiveness of the methodology.