ppxscal/embedding_network huggingface dataset:
Tournament Competition and its Merits for Coevolutionary Algorithms
Authors: Jae Yun Kim, Yeo Keun Kim, Yeongho Kim
Venue: Journal of Heuristics (2003)

In a competitive coevolutionary algorithm, the competition strategy, selecting opposing individuals, has a great influence on the performance of the algorithm. Therefore, a good competition strategy is crucial for an effective and efficient competitive coevolutionary algorithm. In this paper, we propose a new competition strategy called tournament competition. We investigate its characteristics and merits when applied to adversarial problems. To verify the performance of the new strategy, we first classify adversarial problems into two types: solution-test problems and game problems. We apply the strategy to both types. A set of experiments compares our strategy to several existing competition strategies and analyzes several aspects such as solution quality, evolution speed, and coevolutionary balance. The experimental results indicate that some of the existing competition strategies give different patterns according to problem types. The results also support that the proposed tournament strategy has the potential for finding good solutions, regardless of problem types.
Creating adaptive web sites using personalization techniques: a unified, integrated approach and the role of evaluation
Authors: Charalampos Vassiliou, Dimitrios Stamoulis, Anastasios Spiliotopoulos, Drakoulis Martakos
Venue: Adaptive evolutionary information systems (2003)

This chapter introduces a comprehensive review in personalization techniques and presents key features of personalized e-services. A framework is also introduced for integrating different personalization techniques into a single unified approach along the various segments of the customer decision process and it argues over the enhancement of the traditional personalization chain with an evaluation phase from which the results can provide feedback into the personalization techniques. Finally, based on the underlined approaches and assumptions, an extended personalization architecture is proposed including the evaluation layer. The vision of the authors is to embed a learning capability (through a fuzzy logic system, a neural network etc.) into the personalization techniques so that they avoid making the same unsuccessful suggestions in terms of links and features not being valued by the user. By achieving this goal, personalization-enabled web sites will behave as adaptive and evolutionary information systems.
Semantic and schematic similarities between database objects: a context-based approach
Authors: Vipul Kashyap, Amit Sheth
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (1996)

In a multidatabase system, schematic conflicts between two objects are usually of interest only when the objects have some semantic similarity. We use the concept of semantic proximity, which is essentially an abstraction/mapping between the domains of the two objects associated with the context of comparison. An explicit though partial context representation is proposed and the specificity relationship between contexts is defined. The contexts are organized as a meet semi-lattice and associated operations like the greatest lower bound are defined. The context of comparison and the type of abstractions used to relate the two objects form the basis of a semantic taxonomy. At the semantic level, the intensional description of database objects provided by the context is expressed using description logics. The terms used to construct the contexts are obtained from {\em domain-specific ontologies}. Schema correspondences are used to store mappings from the semantic level to the data level and are associated with the respective contexts. Inferences about database content at the federation level are modeled as changes in the context and the associated schema correspondences. We try to reconcile the dual (schematic and semantic) perspectives by enumerating possible semantic similarities between objects having schema and data conflicts, and modeling schema correspondences as the projection of semantic proximity with respect to (wrt) context.
Formal software engineering for computational modelling
Authors: Magne Haveraaen, Helmer André Friis, Tor Arne Johansen
Venue: Nordic Journal of Computing (1999)

Software itself may be considered a formal structure and may be subject to mathematical analysis. This leads to a discipline of formal software engineering (which is not necessarily the same as the use of formal methods in software engineering), where a formal understanding of what software components are and how they may interact is used to engineer both the components themselves and their organisation. A strategy is using the concepts that are suited for organising the problem domain itself to organise the software as well. In this paper we apply this idea in the development of computational modelling software, in particular in the development of a family of related programs for simulation of elastic wave propagation in earth materials. We also discuss some data on the technique's effectiveness.
A characterization of the doubled Grassmann graphs, the doubled odd graphs, and the odd graphs by strongly closed subgraphs
Authors: Akira Hiraki
Venue: European Journal of Combinatorics (2003)

We characterize the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by the existence of sequences of strongly closed subgraphs.
Teachers' Forum: Spreadsheet Modeling and Simulation Improves Understanding of Queues
Authors: F. Fumero, C. Vercellis, Hai Yang, Thomas A. Grossman
Venue: Interfaces (1999)

Process-driven spreadsheet queuing simulation is a better vehicle for understanding queue behavior than queuing theory or dedicated simulation software. Spreadsheet queuing simulation has many pedagogical benefits in a business school end-user modeling course, including developing students intuition, giving them experience with active modeling skills, and providing access to tools. Spreadsheet queuing simulations are surprisingly easy to program, even for queues with balking and reneging. The ease of prototyping in spreadsheets invites thoughtless design, so careful spreadsheet programming practice is important. Spreadsheet queuing simulation is inferior to dedicated simulation software for analyzing queues but is more likely to be available to managers and students.
Near-Optimal Echelon-Stock (R, Nq) Policies in Multistage Serial Systems
Authors: Fangruo Chen, Yu-Sheng Zheng
Venue: Operations Research (1998)

We study echelon-stock (R, nQ) policies in a multistage, serial inventory system with compound Poisson demand. We provide a simple method for determining near-optimal control parameters. This is achieved in two steps. First, we establish lower and upper bounds on the cost function by over- and under-charging a penalty cost to each upstream stage for holding inadequate stock. Second, we minimize the bounds, which are simple, separable functions of the control parameters, to obtain heuristic solutions. We also provide an algorithm that guarantees an optimal solution at the expense of additional computational effort. A numerical study suggests that the heuristic solutions are easy to compute (even for systems with many stages) and are close to optimal. It also suggests that a traditional approach for determining the order quantities can be seriously suboptimal. All the results can be easily extended to the discrete-time case with independent, identically distributed demands.
Typing and querying XML documents: some complexity bounds
Authors: Luc Segoufin
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

We study the complexity bound of validating XML documents, viewed as labeled unranked ordered trees, against various typing systems like DTDs, XML schemas, tree automata ... We also consider query evaluation complexities for various fragments of XPath. For both problems, validation and query evaluation, we consider data and combined complexity bounds.
On the approximation of a smooth surface with a triangulated mesh
Authors: J. M. Morvan, B. Thibert
Venue: Computational Geometry: Theory and Applications (2002)

We approximate the normals and the area of a smooth surface with the normals and the area of a triangulated mesh whose vertices belong to the smooth surface. Both approximations only depend on the triangulated mesh (which is supposed to be known), on an upper bound on the smooth surface's curvature, on an upper bound on its reach (which is linked to the local feature size) and on an upper bound on the Hausdorff distance between both surfaces.We show in particular that the upper bound on the error of the normals is better when triangles are right-angled (even if there are small angles). We do not need every angle to be quite large. We just need each triangle of the triangulated mesh to contain at least one angle whose sinus is large enough.
Aggressive communication optimizations for clusters of workstations
Authors: Gagan Agrawal
Venue: Cluster Computing (2001)

Because of the increasing computational power of workstations and the PCs, the peak processing power of clusters of workstations has been increasing at a rapid pace. However, the sustained performance on a variety of applications lags far behind, because these systems offer lower communication performance. In this paper, we focus on improving the communication performance of the applications run on the clusters through aggressive compiler optimizations. We present a general interprocedural technique for performing communication optimizations across procedure boundaries. Our technique uses the result of local analysis to model the communication as a communication loop, and then performs flow-sensitive interprocedural data-flow analysis to avoid redundant communication, and to perform communication aggregation. Our experimental results and the projected analysis on the clusters shows that aggressive communication optimizations from compilers are very important for system with low communication performance and high computational power.
Designing personalized user experiences for eCommerce: theory, methods, and research
Authors: Clare-Marie Karat, Jan Blom, John Karat
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

The present workshop aims to form a community of individuals interested in exploring the user implications of personalized eCommerce applications. People working in industry, academia, and government are welcomed to participate. The aim of the two-day workshop is to access the current state of theory, methods, and research in this area and to create a theoretical framework on personalization of the user experience in eCommerce to help identify critical questions and guide future research.
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review
Authors: John J. Kanet, V. Sridharan
Venue: Operations Research (2000)

In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and/or dynamically arriving jobs with due dates come into play. We provide a taxonomy of environments in which IIT scheduling is relevant, review the extant literature on IIT scheduling, and identify areas of opportunity for future research.
The computing power of programs over finite monoids
Authors: Pascal Tesson, Denis Thérien
Venue: Journal of Automata, Languages and Combinatorics (2001)

The formalism of programs over monoids has been studied for its close connection to parallel complexity classes defined by small-depth boolean circuits. We investigate two basic questions about this model. When is a monoid rich enough that it can recognize arbitrary languages (provided no restriction on length is imposed)? When is a monoid weak enough that all its computations can be realized in polynomial length? Surprisingly, these two properties appear to be dual to each other.
Sharp features on multiresolution subdivision surfaces
Authors: Henning Biermann, Ioana M. Martin, Denis Zorin, Fausto Bernardini
Venue: Graphical Models (2002)

In this paper we describe a method for creating sharp features and trim regions on multiresolution subdivision surfaces along a set of user-defined curves. Operations such as engraving, embossing, and trimming are important in many surface modeling applications. Their implementation, however, is nontrivial due to computational, topological, and smoothness constraints that the underlying surface has to satisfy. The novelty of our work lies in the ability to create sharp features anywhere on a surface and in the fact that the resulting representation remains within the multiresolution subdivision framework. Preserving the original representation has the advantage that other operations applicable to multiresolution subdivision surfaces can subsequently be applied to the edited model. We also introduce an extended set of subdivision rules for Catmull-Clark surfaces that allows the creation of creases along diagonals of control mesh faces.
The Wisconsin Division of Narcotics Enforcement Uses Multi-Agent Information Systems to Investigate Drug Crimes
Authors: Rahul Bhaskar, Parag C. Pendharkar
Venue: Interfaces (1999)

We built a multiagent information system (MAIS) called Sherpa using distributed artificial intelligence architecture. The system integrates distributed knowledge sources and information to help the Wisconsin Division of Narcotics Enforcement (WDNE) make decisions about the level of charges against a drug crime suspect. Sherpa outperforms the existing system in the identification of criminals.
A generalisation of an algorithm solving the fuzzy multiple choice knapsack problem
Authors: Dorota Kuchta
Venue: Fuzzy Sets and Systems (2002)

It is shown that the solution method presented in the Okada and Gen paper can be applied to a much broader class of fuzzy multiple choice knapsack problems than that it is suggested in the original paper. Okada and Gen assume that the fuzzy coefficients in the objective function and in the constraint are pairwise comparable according to a rather strong relation, the same one for the objective and the constraint coefficients. Here, it is shown that the Okada and Gen algorithm can be applied also if the pairwise comparability of the coefficients is assured by some weaker relations, and what is more, not necessarily the same ones for the objective and the constraint.
Ideal clutters
Authors: Gérard Cornuéjols, Bertrand Guenin
Venue: Discrete Applied Mathematics (2002)

The Operations Research model known as the Set Covering Problem has a wide range of applications. See for example the survey by Ceria, Nobili and Sassano and edited by Dell'Amico, Maffioli and Martello (Annotated Bibliographies in Combinatorial Optimization, Wiley, New York, 1997). Sometimes, due to the special structure of the constraint matrix, the natural linear programming relaxation yields an optimal solution that is integer, thus solving the problem. Under which conditions do such integrality properties hold? This question is of both theoretical and practical interest. On the theoretical side, polyhedral combinatorics and graph theory come together in this rich area of discrete mathematics. In this tutorial, we present the state of the art and open problems on this question.
Outsourcing Logistics: Designing Transportation Contracts Between a Manufacturer and a Transporter
Authors: Osman Alp, Nesim K. Erkip, Refik Güllü
Venue: Transportation Science (2003)

In our environment, a manufacturer procures material from a supplier and the supplier brings it in bulk to a warehouse. This material is then consigned to the plant area, where it is utilized as an input of the production process. This consignment process is outsourced by the manufacturer and a transportation company is selected via a bidding mechanism. Primarily, we consider the problem of designing parameters of a given contract for the transportation activity. We define three subproblems within the contract design problem that interact with each other to a certain extent. These subproblems are the vehicle dispatching problem, inventory control problem, and contract value problem. We define these problems, exploit their interactions, and propose solution methods. Moreover, we present an approach to design such transportation contracts, which is based on solving these subproblems in an order for an adequate number of contract parameter combinations and selecting the one that minimizes expected total costs for the manufacturer.
Improvement Procedures for the Undirected Rural Postman Problem
Authors: Alain Hertz, Gilbert Laporte, Pierrette Nanchen Hugo
Venue: INFORMS Journal on Computing (1999)

This article describes new construction and postoptimization heuristics for the Undirected Rural Postman Problem. Extensive computational tests indicate that some combinations of these heuristics consistently produce optimal or high-quality solutions.
Numerical challenges for turbulence computation: statistical equipartition and the method of spectral reduction
Authors: John C. Bowman, B. A. Shadwick, P. J. Morrison
Venue: Scientific computing and applications (2001)

Numerical issues in the implementation of spectral reduction, a new method for the computation of statistical moments of homogeneous turbulence, are examined. The method implements a coarse graining in Fourier space and exploits the fact that statistical moments are much smoother functions of wave number than the underlying fluctuating velocities. A notable feature of this turbulence model is the existence of a control parameter (bin size) that can be varied to increase the accuracy of the approximation. The inviscid version of spectral reduction satisfies a Liouville theorem and yields statistical equipartition solutions. However, if the wavenumber bins are of nonuniform size (as is desirable for efficiency), an additional bin-dependent rescaling of time by the relative bin area must be introduced to obtain the correct equipartition. This rescaling of the time derivative term drastically increases the stiffness of the spectrally reduced equations. The prospect of developing an implicit nonlinear integrator for this highly stiffened convection problem is examined.
A Grouping Principle and Four Applications
Authors: Agnès Desolneux, Lionel Moisan, Jean-Michel Morel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Wertheimer's theory suggests a general perception law according to which objects having a quality in common get perceptually grouped. The Helmholtz principle is a quantitative version of this general grouping law. It states that a grouping is perceptually ¿meaningful¿ if its number of occurrences would be very small in a random situation: Geometric structures are then characterized as large deviations from randomness. In two previous works, we have applied this principle to the detection of orientation alignments and boundaries in a digital image. In this paper, we show that the method is fully general and can be extended to a grouping by any quality. We treat as an illustration the alignments of objects, their grouping by color and by size, and the vicinity gestalt (clusters). Collaboration of the gestalt grouping laws and their pyramidal structure are illustrated in a case study.
"This is a lot easier!": constrained movement speeds navigation
Authors: Susanne Jul
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This paper reports on an experiment comparing constrained and unconstrained movement in a 2D zooming environment. Results showed a significant reduction in time on task when movement was constrained, accompanied by considerable decreases in mouse movement activity. Detailed analysis suggests that subjects were calmer, more confident in their actions and experienced less spatial disorientation, indicating that judiciously constrained movement can reduce both mechanical and cognitive demands of navigation.
Ada/Mindstorms 2.0 user's guide and reference manual
Authors: Barry Fagin
Venue: Journal on Educational Resources in Computing (JERIC) (2002)

Ada/Mindstorms 2.0 is an Ada interface to the Lego RCX "brick," included as part of the Lego Mindstorms&trade; Robotics Invention System. Programs are written with an Ada compiler, translated into Dave Baum's Not Quite C language (NQC), then recompiled and downloaded through the Mindstorms IR transmitter to the RCX.Ada/Mindstorms 2.0 is distributed with the USAFA AdaGIDE Windows Ada compiler. This document assumes that you have obtained and installed AdaGIDE. If you are using another Ada compiler, see Appendix B. We also assume a working knowledge of Ada. If you haven't used Ada before, we recommend learning the basics first before reading further. <u>http://www.adahome.com/Discover/Introduction.html</u> is a good place to start. We also assume a general familiarity with the Lego Mindstorms Robotics Invention System and the RCX.
Genetic algorithms vs. greedy algorithms in the optimization of course scheduling
Authors: Christopher Herbig
Venue: Journal of Computing Sciences in Colleges (2002)

Genetic algorithms are a recent addition to the computing paradigm and with their arrival, comes the idea that they may be able to replace currently used methods. This is an experiment to determine if genetic algorithms can produce a course schedule and if the algorithm compares to a greedy algorithm in response time.
A Mixed Complementarity Model of Hydrothermal Electricity Competition in the Western United States
Authors: James Bushnell
Venue: Operations Research (2003)

This paper presents a modeling framework for analyzing competition between multiple firms that each possess a mixture of hydroelectric and thermal generation resources. Based upon the concept of a Cournot oligopoly with a competitive fringe, the model characterizes the Cournot equilibrium conditions of a multiperiod hydrothermal scheduling problem. Using data from the western United States electricity market, this framework is implemented as a mixed linear complementarity model. The results show that some firms may find it profitable to allocate considerably more hydro production to off-peak periods then they would under perfect competition. This strategy is a marked contrast to the optimal hydroschedules that would arise if no firms were acting strategically. These results highlight the need to explicitly consider profit-maximizing behavior when examining the impact of regulatory and environmental policies on electricity market outcomes.