ppxscal/embedding_network huggingface dataset:
Adaptive and evolutionary systems: lessons from object, component and agent approaches
Authors: Randall Perrey, Mark Lycett
Venue: Adaptive evolutionary information systems (2003)

This chapter examines the issues surrounding the development of adaptive evolutionary systems by evaluating the characteristics of contemporary development paradigms. It categorises these characteristics as advantages or limitations with respect to the purpose of servicing adaptive evolutionary systems' requirements. The chapter considers the evolution of development paradigms and concludes that a key limitation in each case has been the preoccupation with addressing the shortcomings of the previous paradigm's implementation. The maturity of the paradigm is seen as a significant element in determining what the current research issues for that paradigm will be and this observation is used to recommend the line of development that should be taken to avoid recurrent pitfalls. The issues extracted are structured into a framework for the evaluation of any given approach with respect to its suitability for the development of adaptive evolutionary systems. Recommendations are given for future work including recommendations outside the accepted sphere of information systems research.
Another look at CS0
Authors: William Mitchell
Venue: Journal of Computing Sciences in Colleges (2001)

This paper describes the goals and methods of a new kind of CS0 course and explains why it is being used as the introductory course for an Information Science Major. Information Science is a new discipline that has been distinguished from Computer Science, but it shares with CS the problem of what to present in its first course. This paper describes a CS0-type course that aims both at preparing for a first programming course and at surveying the problems that the Information Science major will encounter in the undergraduate program and on the job. A problem list is appended that gives a flavor of the variety of the exercises that the students face.
Learning fuzzy rules from iterative execution of games
Authors: Hisao Ishibuchi, Ryoji Sakamoto, Tomoharu Nakashima
Venue: Fuzzy Sets and Systems (2003)

This paper discusses the linguistic knowledge extraction from the iterative execution of a multiplayer non-cooperative repeated game. Linguistic knowledge is automatically extracted in the form of fuzzy if-then rules. Our knowledge extraction is mainly based on the on-line incremental learning of fuzzy rule-based systems. In this sense, our linguistic knowledge extraction is the learning of fuzzy rules. We first briefly describe a market selection game, which is formulated as a non-cooperative repeated game with many players and several alternative actions. We also describe some simple strategies for our market selection game. In our market selection game, the payoff of each player depends on the actions of all players. When a particular action is chosen by many players, those players receive low payoff. High payoff is obtained from actions chosen by only a small number of players. This means that minority players with respect to their actions receive high payoff. Next we show how our market selection game can be handled as a pattern classification problem where a single training pattern is successively generated from every round of our game. A fuzzy rule-based classification system is used as a decision-making system by each player for choosing an action in every round. An on-line incremental learning algorithm is proposed for adjusting the fuzzy rule-based classification system. Then we show how our market selection game can be handled as a function approximation problem. A fuzzy rule-based approximation system is used as a value function for approximating the expected payoff from each action. Finally simulation results show that comprehensible linguistic knowledge is extracted by the learning of fuzzy rule-based systems.
Memory leak detection in C++
Authors: Cal Erickson
Venue: Linux Journal (2003)

It's never too soon to fix bugs, and you canstart using these tools as soon as your project will compile.
A simple algorithm for finding frequent elements in streams and bags
Authors: Richard M. Karp, Scott Shenker, Christos H. Papadimitriou
Venue: ACM Transactions on Database Systems (TODS) (2003)

We present a simple, exact algorithm for identifying in a multiset the items with frequency more than a threshold &theta;. The algorithm requires two passes, linear time, and space 1/&theta;. The first pass is an on-line algorithm, generalizing a well-known algorithm for finding a majority element, for identifying a set of at most 1/&theta; items that includes, possibly among others, all items with frequency greater than &theta;.
Just-in-Time Manufacturing and Pollution Prevention Generate Mutual Benefits in the Furniture Industry
Authors: Robert D. Klassen
Venue: Interfaces (2000)

Managing the natural environment is becoming increasingly important to manufacturing firms; yet managers are also being asked to simultaneously make changes to improve their firms' competitiveness. Just-in-time (JIT) manufacturing has long emphasized reducing waste. Similarly, pollution prevention stresses reducing pollutants before they are created. During field work in five furniture manufacturing firms and a subsequent survey in 1994, I observed links between investment in JIT and improved environmental performance. More surprising, I also found that an emphasis on pollution prevention, instead of pollution control, improved delivery performance. Thus, production and environmental managers should pursue JIT and pollution prevention as complementary initiatives that can improve performance along multiple dimensions.
The design and implementation of K: a high-level knowledge-base programming language of OSAM*.KBMS
Authors: Yuh-Ming Shyy, Javier Arroyo, Stanley Y.W. Su, Herman Lam
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (1996)

The OSAM*.KBMS is a knowledge-base management system, or the so-called next-generation database management system, for non-traditional data/knowledge-intensive applications. In order to define, query, and manipulate a knowledge base, as well as to write codes to implement any application system, we have developed an object-oriented knowledge-base programming language called K to serve as the high-level interface of OSAM*.KBMS. This paper presents the design of K, its implementation, and its supporting KBMS developed at the Database Systems Research and Development Center of the University of Florida.
Managing Stochastic Multiproduct Systems: Model, Measures, and Analysis
Authors: Ravi Anupindi, Sridhar Tayur
Venue: Operations Research (1998)

We consider a model for managing a single stage that produces multiple items. The production rates are finite, and there are switchover times. The interarrival times and quantities of demands for the items are random, and demand may occur for a set of items. We consider order focussed measures: cost based on response times; service levels based on quoted lead times and Type-1 service. We operate the stage in the following manner: (1) there is a cyclic schedule that determines the sequence of items and the number of times a particular item is produced in a cycle; (2) given a cyclic schedule, production of each item follows a modified base-stock policy or a (s, S) policy. We present a simulation based procedure to obtain good values for the base stock levels or S (for any fixed S-s) for each of the above performance measures. Numerical results indicate that good solutions can be obtained with modest computational effort. We also report on a real world implementation of this model.
Facets of the Complementarity Knapsack Polytope
Authors: I. R. de Farias ,  Jr., E. L. Johnson, G. L. Nemhauser
Venue: Mathematics of Operations Research (2002)

We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additional constraints, and the model is tightened by introducing strong inequalities valid for the resulting MIP. We use an alternative approach, in which we keep in the model only the continuous variables, and we tighten the model by introducing inequalities that define facets of the convex hull of the set of feasible solutions in the space of the continuous variables. To obtain the facet-defining inequalities, we extend the concepts of cover and cover inequality, commonly used in 0-1 programming, for this problem, and we show how to sequentially lift cover inequalities. We obtain tight bounds for the lifting coefficients, and we present two families of facet-de.ning inequalities that can be derived by lifting cover inequalities. We show that unlike 0-1 knapsack polytopes, in which different facet-defining inequalities can be derived by fixing variables at 0 or 1, and then sequentially lifting cover inequalities valid for the projected polytope, any sequentially lifted cover inequality for the complementarity knapsack polytope can be obtained by fixing variables at 0.
A lesson in choosing the wrong algorithm for determining milestones in a trajectory simulation
Authors: John H. Reynolds
Venue: Journal of Computing Sciences in Colleges (2003)

Computer Science majors at Mary Washington College (MWC) are offered an elective in Simulation Techniques. This course exposes students to both the discrete-event simulation and continuous simulation paradigms. For the latter, students implement numerical integration and interpolation algorithms needed to manipulate the differential equations representing a simple three-degrees-of-freedom trajectory of a launched object. This assignment also requires students to recover times at which particular values for dependent variables, or milestones, occur in the trajectory. Recovery is necessary because the trajectory needs to advance beyond a milestone so that an iterative process can be triggered to go back in time to achieve the desired timeline within an acceptable tolerance. This paper discusses a problem that arises if backward numerical integration is chosen to recover these milestone times. For closed-form mathematical exercises the technique is safe and is especially appealing to students because of its ease of implementation. But, since students are required to interpolate in tables of empirical data representing drag and weather influences, backward integration involving abrupt trajectory transitions can produce spectacularly erroneous results. This paper dramatically illustrates the problem and discusses a tabular method, involving Lagrangian interpolation, which offers a foolproof alternative to the very tempting backward integration scheme.
Parallel computations of finite element output bounds for conjugate heat transfer
Authors: Zhong Cheng, Marius Paraschivoiu
Venue: Finite Elements in Analysis and Design (2003)

This paper investigates the a posteriori finite element bound method applied to a heat transfer problem in a multi-material electronic components array. The temperature field is obtained by solving Poisson equations and convection-diffusion equations in different regions of the computational domain. The bound method calculates very sharp lower and upper bounds of the temperature of the hottest component which is assumed to be the engineering output of interest. This paper shows that for this two-dimensional problem the bound method can yield more than an 80-fold reduction in simulation time over a fine mesh calculation (330,050 d.o.f.) while still maintaining quantitative control over the accuracy of the engineering output of interest. Parallel implementation on a Beowulf cluster is also reported.
Basic aspects of uncertainty: II. the inverse estimations
Authors: J. Vrba
Venue: Systems Analysis Modelling Simulation (2002)

This article complements the part [1] presenting the theoretical and formal background. The goal is to illustrate the solution of typical modelling and simulation problems either uncertain or even vague by their very nature as well as crisp, but solvable by a chain of time and effort-consuming operations suffering from problematic convergence. To avoid unnecessary repetition of the key formulas already presented, they are marked [1] when referred to.
Determinism and fuzzy automata
Authors: Radim Bělohlávek
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

The concept of a fuzzy automaton, as studied in the literature, is a direct generalization of the classical concept of a non-deterministic automaton. In this paper, we consider the question of whether there is a deterministic counterpart to the notion of a fuzzy automaton. We propose a definition of deterministic fuzzy automata and show that they are equally powerful as fuzzy automata. Compared to the classical notion of a deterministic automaton, the deterministic fuzzy automaton defined in our paper differs essentially only in that the final states form a fuzzy set. Moreover, we show that deterministic fuzzy automata are equally powerful as nested systems of deterministic automata.
A cluster-based approach to broadcast news
Authors: David Eichmann, Padmini Srinivasan
Venue: Topic detection and tracking: event-based information organization (2002)

We present an approach to detection and tracking of topics in multilingual broadcast news based upon a dynamic clustering scheme. Our approach derives from a system used to filter Web searches from multiple sources, with extensions for pipelining document clusters, part-of-speech tagging and extraction of named entities for use in an extended similarity measure.
An Improved Architecture for Java Domain Transformation Applications
Authors: Matheus Cabral de Araújo Gois, Alejandro César Frery
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

This work suggests an architecture that uses Java Native Interface to improve the performance of Java Domain Transformation applications. It also shows how to make possible the independency between image formats and each domain transformation.
Incorporating mathematics into the first year CS program: a new approach to CS2
Authors: Joan Krone, Todd Feil
Venue: Journal of Computing Sciences in Colleges (2001)

Computer scientists, both in academia and in industry, agree that computer science students should study mathematics. What is not so clear is what particular topics in mathematics they should study. Most CS curricula include one or more courses in discrete math, often taken during the junior or senior year by undergraduates and often taught by instructors in the mathematics department. Here we present the idea of incorporating some discrete math into the first year curriculum for computer science students. We do not advocate a separate course for discrete math for first year students, but rather we suggest the introduction of discrete math topics directly into CS2, showing immediate applications to computer science through exercises and programming assignments.
Global transaction support for workflow management systems: from formal specification to practical implementation
Authors: Paul Grefen, Jochem Vonk, Peter Apers
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2001)

In this paper, we present an approach to global transaction management in workflow environments. The transaction mechanism is based on the well-known notion of compensation, but extended to deal with both arbitrary process structures to allow cycles in processes and safepoints to allow partial compensation of processes. We present a formal specification of the transaction model and transaction management algorithms in set and graph theory, providing clear, unambiguous transaction semantics. The specification is straightforwardly mapped to a modular architecture, the implementation of which is first applied in a testing environment, then in the prototype of a commercial workflow management system. The modular nature of the resulting system allows easy distribution using middleware technology. The path from abstract semantics specification to concrete, real-world implementation of a workflow transaction mechanism is thus covered in a complete and coherent fashion. As such, this paper provides a complete framework for the application of well-founded transactional workflows.
Graphs having distance-n domination number half their order
Authors: Miranca Fischermann, Lutz Volkmann
Venue: Discrete Applied Mathematics (2002)

For any positive integer n and any graph G a set D of vertices of G is a distance-n dominating set, if every vertex v ∈ V(G)-D has exactly distance n to at least one vertex in D. The distance-n domination number γ=n(G) is the smallest number of vertices in any distance-n dominating set. If G is a graph of order p and each vertex in G has distance n to at least one vertex in G, then the distance-n domination number has the upper bound p/2 as Ore's upper bound on the classical domination number. In this paper, a characterization is given for graphs having distance-n domination number equal to half their order, when the diameter is greater or equal 2n - 1. With this result we confirm a conjecture of Boland, Haynes, and Lawson.
Time Series Segmentation for Context Recognition in Mobile Devices
Authors: Johan Himberg, Kalle Korpiaho, Heikki Mannila, Johanna Tikanmäki, Hannu Toivonen
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Recognizing the context of se is important in making mobile devices as simple to use as possible. Finding out what the user's situation is can help the device andunderlying service in providing an adaptive and personalized user interface. The device can infer parts of the context of the user from sensor data: the mobile device can includesensors for acceleration, noise level, luminosity, humidity, etc. In this paper we consider context recognition by unsupervisedsegmentation of time series produced by sensors.Dynamic programming can be used to find segments that minimize the intra-segment variances. While this method produces optimal solutions, it is too slow for long sequencesof data. We present and analyze randomized variations of the algorithm. One of them, Global Iterative Replacement or GIR, gives approximately optimal results in a fraction of the time required by dynamic programming. Wedemonstrate the se of time series segmentation in contextrecognition for mobile phone applications.
Dynamic run-time HW/SW scheduling techniques for reconfigurable architectures
Authors: Juanjo Noguera, Rosa M. Badia
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

Dynamic run-time scheduling in System-on-Chip platforms has become recently an active area of research because of the performance and power requirements of new applications. Moreover, dynamically reconfigurable logic (DRL) architectures are an exciting alternative for embedded systems design. However, all previous approaches to DRL multi-context scheduling and HW/SW scheduling for DRL architectures are based on static scheduling techniques. In this paper, we address this problem and present: (1) a dynamic scheduler hardware architecture, and (2) four dynamic run-time scheduling algorithms for DRL-based multi-context platforms. The scheduling algorithms have been integrated in our codesign environment, where a large number of experiments have been carried out. Results demonstrate the benefits of our approach.
Exploring the Role of Information Technology in Organizational Downsizing: A Tale of Two American Cities
Authors: Alain Pinsonneault, Kenneth L. Kraemer
Venue: Organization Science (2002)

This study explores the role information technology (IT) plays in organizational downsizing by studying two medium-sized American cities over a period of 10 years (1985-1995). Data were collected through 73 interviews, a questionnaire, and numerous documents. Four main findings emerged from the case studies. First, IT was found to facilitate organizational downsizing, but not to cause it. New City invested heavily in state-of-the-art IT over the years and more successfully downsized the organization than Old City, which lagged behind in IT investment and made no serious attempts to use IT as a tool to support strategic actions. Second, adverse environmental conditions triggered downsizing in both cities and determined the change strategies that managers used. When environmental pressures were mild (1985-1990), managers favored a convergent change strategy that resulted in limited downsizing efforts and small personnel reductions. In contrast, when environmental pressures were strong (1990-1995), managers of both cities engaged in strategic reorientation and in downsizing efforts that led to larger personnel reductions. Third, the role IT played in organizational downsizing varied according to the change strategy. IT was used to facilitate work redesign in a convergent change strategy and to facilitate more significant structural and work redesign in strategic reorientation. Fourth, more integrated and better use of IT allowed managers of New City to downsize more rationally and efficiently. It facilitated the transfer of personnel within departments, from middle management to the operations level, and across departments, from internally oriented to customer-oriented personnel. In doing so, managers of New City minimized operating costs while maintaining the same level of services. In contrast, IT in Old City did not facilitate such an agenda and managers downsized more superficially across the board, in all departments. Differences in IT consequences in the two cities are explained using the theory of slack resources in organizations.
Scalable on-demand media streaming with packet loss recovery
Authors: Anirban Mahanti, Derek L. Eager, Mary K. Vernon, David J. Sundaram-Stukel
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

Previous scalable on-demand streaming protocols do not allow clients to recover from packet loss. This paper develops new protocols that: 1) have a tunably short latency for the client to begin playing the media; 2) allow heterogeneous clients to recover lost packets without jitter as long as each client's cumulative loss rate is within a tunable threshold; and 3) assume a tunable upper bound on the transmission rate to each client that can be as small as a fraction (e.g., 25%) greater than the media play rate. Models are developed to compute the minimum required server bandwidth for a given loss rate and playback latency. The results of the models are used to develop the new protocols and assess their performance. The new protocols, Reliable Periodic Broadcast and Reliable Bandwidth Skimming, are simple to implement and achieve nearly the best possible scalability and efficiency for a given set of client characteristics and desirable/feasible media quality. Furthermore, the results show that the new reliable protocols that transmit to each client at only twice the media play rate have similar performance to previous protocols that require clients to receive at many times the play rate.