ppxscal/embedding_network huggingface dataset:
Getting the best of both worlds: discrete and continuous genetic and evolutionary algorithms in concert
Authors: Martin Pelikan, David E. Goldberg, Shigeyoshi Tsutsui
Venue: Information Sciences: an International Journal (2003)

This paper describes an evolutionary algorithm for optimization of continuous problems that combines advanced recombination techniques for discrete representations with advanced mutation techniques for continuous representations. Discretization is used to transform solutions between the discrete and continuous domains. The proposed algorithm combines the strengths of purely continuous and purely discrete approaches and eliminates some of their disadvantages. The paper tests the proposed algorithm with the recombination operator of the Bayesian optimization algorithm, σ-self-adaptive mutation, and three discretization methods. The empirical results on three problems suggest that the tested variant of the algorithm scales up well on all tested problems, indicating good scalability over a broad range of continuous problems.
Leading-edge information technologies and American local governments
Authors: Donald F. Norris
Venue: Public information technology: policy and management issues (2003)

In this study, I examine the adoption, penetration and impacts of the adoption of leading-edge information technologies in American local governments. I also discuss future trends with respect to these technologies. Data for this study come from three nationwide surveys of information technology in local governments and a series of case studies in US cities about the adoption of leading-edge information technologies.My principal findings are that American local governments have adopted a range of these technologies and can be expected to do so in coming years. This is especially true of the adoption of electronic government. Local government characteristics associated with adoption include principally local government size as measured by population. Other characteristics include type and form of government, region of the country, and metropolitan status. Additionally, local governments adopt leading-edge information technologies for both general reasons (e.g., to improve efficiency and effectiveness) and to solve specific problems (e.g., the adoption of automated fingerprint identification systems to solve crimes).Finally, future trends can expect to see American local governments adopt more leading-edge technologies, in part because local governments believe that they produce largely positive results. These technologies will continue to penetrate local government organizations more deeply, and, thus, provide greater payoffs. Finally, as newer and more sophisticated information technologies are adopted, local governments will necessarily have to provide more integration and support for them.
Getting the most from XMMS with plugins
Authors: Dave Phillips
Venue: Linux Journal (2004)

The standard Linux music player has some little-known but powerfulfeatures. 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
The effect of training subjects in self-explanation strategies on problem solving success in computer programming
Authors: Elizabeth Susan Rezel
Venue:  (2003)

This study analyzed the effectiveness of training participants in the use of self-explanation strategies on their subsequent problem solving success in the writing of computer programs and on the participants' use of the targeted self-explanation strategies during problem solving. The study was set in four university level computer programming classes using Microsoft Visual Basic 6.0 to teach introductory programming concepts. Participants were enrolled in an accelerated undergraduate bachelor's degree program in Management of Information Technology at a private Midwestern university. The classes were divided into a training group (N = 19) that received training in the targeted self-explanation strategies and a control group (N = 20) that received training in the use of think alouds as a data gathering technique but did not receive training in any learning strategies. All participants were involved in three problem solving experiences involving the writing of computer programs to solve specified problems. During these exercises participants were audio taped while thinking aloud. Programming success of the participants in the training group was compared to that of the control group to test the first hypothesis regarding whether students who received the training would have greater success than those who did not. Results did not show a significant difference between training group and the control group in programming success. Prior programming experience was a significant predictor of programming success. The audio taped protocols were analyzed to discover the answer to two further questions. The hypothesis that participants in the training group would use the strategies during problem solving more often than students in the control group was not upheld. The third hypothesis stated that participants who were successful would use the targeted strategies more often than participants who were not successful. One of the strategies, determine both the syntax and meaning of the code and the reasons behind the given form design in the example being studied, showed significant predictive value in relation to programming success. Possible reasons for the results were discussed as were suggestions for future research.
An Implementation of Fast Wavelet Galerkin Methods for Integral Equations of the Second Kind
Authors: Weifu Fang, Yi Wang, Yuesheng Xu
Venue: Journal of Scientific Computing (2004)

We present a numerical implementation of the fast Galerkin method for Fredholm integral equations of the second kind using the piecewise polynomial wavelets. We focus on addressing critical issues for the numerical implementation of such a method. They include a choice of practical truncation strategy, numerical integration of weakly singular integrals and the error control of the numerical quadrature. We also implement a multiscale iteration method for solving the resulting compressed linear system. Numerical examples are given to demonstrate the proposed ideas and methods.
A friendly face for Eclipse
Authors: Charles Reis, Robert Cartwright
Venue: Proceedings of the 2003 OOPSLA workshop on eclipse technology eXchange (2003)

Eclipse is a powerful integrated development environment (IDE) for Java1 targeted at professional software developers. However, Eclipse is poorly suited for use in introductory computing education because the complexity of its interface and the associated computing environment can overwhelm beginners. In contrast, DrJava is a friendly, highly interactive IDE targeted at teaching Java to beginners. DrJava has a simple interface consisting of a Definitions pane for entering and editing program text and an Interactions pane for evaluating arbitrary Java statements and expressions given the program in the Definitions pane. This interface frees students from the complication of defining main methods for their programs and encourages them to explore the Java language by conducting simple experiments.We have developed a plug-in for Eclipse, based largely on the existing DrJava code base, that provides an Interactions pane to Eclipse with precisely the same capabilities as the Interactions pane in DrJava, along with a simplified user interface. With this plug-in, Eclipse becomes a suitable vehicle for teaching introductory programming, enabling instructional programs to use the same IDE for all levels of the programming curriculum. In addition, it provides professional developers with a convenient mechanism for interactively evaluating arbitrary program text during program development --- a common feature of programming interfaces for functional languages like Scheme and ML.
Interactive exploration of coherent patterns in time-series gene expression data
Authors: Daxin Jiang, Jian Pei, Aidong Zhang
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Discovering coherent gene expression patterns in time-series gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we propose an interactive exploration framework for mining coherent expression patterns in time-series gene expression data. We develop a novel tool, coherent pattern index graph, to give users highly confident indications of the existences of coherent patterns. To derive a coherent pattern index graph, we devise an attraction tree structure to record the genes in the data set and summarize the information needed for the interactive exploration. We present fast and scalable algorithms to construct attraction trees and coherent pattern index graphs from gene expression data sets. We conduct an extensive performance study on some real data sets to verify our design. The experimental results strongly show that our approach is more effective than the state-of-the-art methods in mining real gene expression data, and is scalable in mining large data sets.
Switch and logic-level modeling in EDIF 200: limitations and proposed solutions
Authors: Shankar R. Mukherjee, Maqsoodul Mannan
Venue: Proceedings of the conference on European design automation (1991)

In order to transfer switch and gate-level descriptions from one simulation environment to another, information like connectivity, delay, and strength needs to be maintained. Since EDIF is rapidly becoming an industry standard, it can be used as an intermediate format for such transfers. This paper illustrates the effectiveness of EDIF 200 netlist and logicModel views for this purpose and identifies its limitations. Several EDIF writers have been implemented using these concepts. In addition, this paper discusses possible extensions to improve the expressiveness of EDIF.
The Performance and Energy Consumption of Embedded Real-Time Operating Systems
Authors: Kathleen Baynes, Chris Collins, Eric Fiterman, Brinda Ganesh, Paul Kohout, Christine Smit, Tiebing Zhang, Bruce Jacob
Venue: IEEE Transactions on Computers (2003)

This paper presents the modeling of embedded systems with SimBed, an execution-driven simulation testbed that measures the execution behavior and power consumption of embedded applications and RTOSs by executing them on an accurate architectural model of a microcontroller with simulated real-time stimuli. We briefly describe the simulation environment and present a study that compares three RTOSs: µC/OS-II, a popular public-domain embedded real-time operating system; Echidna, a sophisticated, industrial-strength (commercial) RTOS; and NOS, a bare-bones multirate task scheduler reminiscent of typical "roll--your-own" RTOSs found in many commercial embedded systems. The microcontroller simulated in this study is the Motorola M--CORE processor: a low-power, 32-bit CPU core with 16-bit instructions, running at 20MHz. Our simulations show what happens when RTOSs are pushed beyond their limits and they depict situations in which unexpected interrupts or unaccounted-for task invocations disrupt timing, even when the CPU is lightly loaded. In general, there appears no clear winner in timing accuracy between preemptive systems and cooperative systems. The power-consumption measurements show that RTOS overhead is a factor of two to four higher than it needs to be, compared to the energy consumption of the minimal scheduler. In addition, poorly designed idle loops can cause the system to double its energy consumption¿energy that could be saved by a simple hardware sleep mechanism.
Evolutionary algorithms with deterministic mutation operators used for the optimization of the trajectory of a four-bar mechanism
Authors: A. Kanarachos, D. Koulocheris, H. Vrazopoulos
Venue: Mathematics and Computers in Simulation (2003)

In this paper, we propose an Evolutionary Algorithm (EA) with a deterministic mutation operator which is a combination of EA with the Broyden, Fletcher, Goldfarb and Shanno (BFGS) method. The advantages of both optimization algorithms are retained and interconnected. The proposed algorithm shows faster convergence as well as increased reliability in the search for the global optimum. Results referring to the Fletcher and Powel test function in comparison with EA (Evolution Strategies, Evolutionary Programming, and Genetic Algorithms), provide sufficient indication for the performance of the new method. Finally, the proposed method is successfully implemented for the trajectory optimization of a four-bar mechanism.
Checking Finite Traces Using Alternating Automata
Authors: Bernd Finkbeiner, Henny Sipma
Venue: Formal Methods in System Design (2004)

Alternating automata have been commonly used as a basis for static verification of reactive systems. In this paper we show how alternating automata can be used in runtime verification. We present three algorithms to check at runtime whether a reactive program satisfies a temporal specification, expressed by a linear-time temporal logic formula. The three methods start from the same alternating automaton but traverse the automaton in different ways: depth-first, breadth-first, and backwards, respectively. We then show how an extension of these algorithms, that collects statistical data while verifying the execution trace, can be used for a more detailed analysis of the runtime behavior. All three methods have been implemented and experimental results are presented.
Modelling and computation of axially symmetric flows of electrorheological fluids
Authors: R. Hoppe, W. Litvinov, T. Rahman
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In this article, we discuss the extended Bingham fluid model introduced in the paper [2] for electrorheological fluids, and formulate the problem in the axially symmetric cyllindrical coordinates system. As an application we choose the ER Shockabsorber, and present some numerical simulation of its behaviour.
A Two-Level Hierarchy Software Architecture Framework for the Manufacturing Industry
Authors: Whey Seen Heah, Mohamed k. Omar
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

The main objective of this paper is to propose anintegrated framework architecture that facilitatescoordination and collaboration among differentmanagerial levels in a manufacturing facility. We aredeploying an object-oriented approach as the conceptualmodeling methodology. Our thesis is that local decisions(at the operation level) can benefit from the timelyaccessibility of appropriately aggregate decisions that areimposed by top management. In turn, the manufacturingsystem as a whole can benefit from timely dissemination ofappropriate aggregate decisions pertaining toimprovements of the overall productivity, and profitabilityof the manufacturing system.This paper reports on the development andimplementation of framework for integrating tactical andoperational decisions. The developed framework is user-friendly,generic in nature and will be of interest topractitioners and managers for the manufacturingindustry to assist their decision-making.
Using digital cultural probes in design with children
Authors: Ole Sejer Iversen, Christina Nielsen
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

The poster presents digital cultural probes as a way of advising the design of children's technology.
The involvement of human resources in large scale data mining projects
Authors: Markus Hofmann, Brendan Tierney
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Data mining projects are complex and have a high failure rate. In order to improve the success rate of such projects it is not only important to follow a predefined life cycle but it is also vital to the overall success of the project to manage human resources and their involvement in data mining projects. This paper reports on research outcomes based on the development of a data mining life cycle in regards to human involvement. This area is often neglected during project planning and implementation. Throughout the paper a detailed study of the human resource involvement in a large scale data mining project has been carried out resulting in various matrices and diagrams that can support project management, IT managers and academic research.
Using Jacobi polynomials for degree reduction of B&#x00E9;zier curves withCk-constraints
Authors: Young Joon Ahn
Venue: Computer Aided Geometric Design (2003)

We propose the constrained Jacobi polynomial as an error function of good degree reduction of Bézier curve with Ck-constraints at the boundaries, k = 2, 3. The result is a natural extension of the method proposed by Kim and Ahn (2000). The best Ck-constrained degree reduction in L∞-norm, k > 0, cannot be obtained in explicit form and requires higher computational complexity such as Remes algorithm. The method of Ck-constrained degree reduction using the constrained Jacobi polynomials is represented in explicit form, and its L∞-norm error is obtainable using Newton method and is slightly larger than that of the best Ck-constrained degree reduction. We also present the subdivision scheme for the Ck-constrained degree reduction within given tolerance. As an illustration, our method is applied to Ck-constrained degree reduction of planar Bézier curve, and compare its result to that of the best Ck-constrained degree reduction.
Constraint satisfaction algorithms for graph pattern matching
Authors: Javier Larrosa, Gabriel Valiente
Venue: Mathematical Structures in Computer Science (2002)

Graph pattern matching is a central problem in many application fields. Since it is NP-complete, we cannot expect to find algorithms with a good worst-case performance. However, there is still room for general procedures with a good average performance. In this paper we explore four different solving approaches within the constraint satisfaction framework, and introduce a new algorithm, which we call nRF+. The algorithm is a refinement of really full look ahead that takes advantage of the problem structure in order to enhance the look ahead procedure. We give a formal proof that nRF+ is superior to the other approaches in terms of number of visited nodes. An additional contribution of this paper is the introduction of a new benchmark for testing algorithms in this domain. It is formed by a large set of well-defined graphs of very diverse nature. In this benchmark, we show that nRF+ can efficiently solve a broad range of problems, while still leaving many problem instances unsolved. The use of this challenging benchmark is encouraged for future algorithms evaluation.
Queuing network analysis for waterways with artificial neural networks
Authors: Liang Zhu, Paul Schonfeld, Yeon Myung Kim, Ian Flood, Ching-Jung Ting
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

An Artificial Neural Network (ANN) model has been developed for analyzing traffic in an inland waterway network. The main purpose of this paper is to determine how well such a relatively fast model for analyzing a queuing network could substitute for far more expensive simulation. Its substitutability for simulation is judged by relative discrepancies in predicting tow delays between the ANN and simulation models. This model is developed by integrating five distinct ANN submodels that predict tow headway variances at (1) merge points, (2) branching (i.e., diverging) points, (3) lock exits, and (4) link outflow points (e.g., at ports, junctions, or lock entrances), plus (5) tow queuing delays at locks. Preliminary results are shown for those five submodels and for the integrated network analysis model. Eventually, such a network analyzer should be useful for designing, selecting, sequencing, and scheduling lock improvement projects, for controlling lock operations, for system maintenance planning, and for other applications where many combinations of network characteristics must be evaluated. More generally, this method of decomposing complex queuing networks into elements that can be analyzed with ANNs and then recombined provides a promising approach for analyzing other queuing networks (e.g., in transportation, communication, computing, and production systems).
Regulating Best Effort Flows on Per Domain Basis
Authors: Yang Xiang, Qiwei Gu, Zhengxiang Li
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

It is difficult to properly regulate best effort flows. Although several methods have been proposed, the communication cost is too high to make them effective for large number of non-TCP friendly flows. We solve this problem by making a tradeoff between the communication cost and the computation complexity of core routers. In addition, core routers and edge routers regulate aggregate flows without dynamic calculation of round trip time and consumption of extra buffers. By simulation experiments, we find our proposal is effective in both tail-drop FIFO queuing and RED queuing.
Media selection and end-user satisfaction: an empirical study of help-desk using SERVQUAL
Authors: Sang-Gun Lee, Sangjin Yoo, Zoonky Lee
Venue: Computing information technology: the human side (2003)

In this paper, we investigate the relationship between the use of different media and customer satisfaction in help desk service. Different dimensions of customer satisfaction were derived based on SERVQUAL: reliability, empathy, assurance, tangibles, and responsiveness. The results support our hypotheses that the use of conventional medial (face-to-face and telephone) is related to help desk satisfaction, through reliability and empathy and electronic media (e-mail and Internet), users show higher satisfaction in tangibles and assurance. Also, hybrid media users (multi-media users by task) show a higher level of satisfaction in reliability and responsibility. The results suggest automating help desks should be considered as a way to provide more options to end-users.
Organizational modeling in UML and XML in the context of workflow systems
Authors: W. M. P. van der Aalst, Akhil Kumar, H. M. W. Verbeek
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Workflow technology plays a key role as an enabler in E-Commerce applications, such as supply chains. Until recently the major share of the attention of workflow systems researchers has gone to the exchange of information in cross-organizational processes. Increasingly the focus is shifting from the exchange of data to support for interorganizational workflow processes. One of the initiatives in this direction has been XRL (eXchangeable Routing Language), an extendible instance-based language having an XML syntax and Petri-net semantics. In this paper, we move to the next level by extending XRL with organizational entities, structures, and rules. Hence, we describe an organizational model first in UML and then convert it into an XML DTD. Our organizational model allows for the specification of non-human resources, collections of resources (e.g., departments, teams, etc.), availability of resources, delegation, and role inheritance. Additional features of our proposal are the tight integration of organizational concepts and routing concepts. An important goal of this work is to create standard for organizational modeling much like the X. 500 standard for directories.