ppxscal/embedding_network huggingface dataset:
Small is beautiful: near minimal evolutionary neurocontrollers obtained with self-organizing compressed encoding
Authors: Shlomy Boshy, Eytan Ruppin
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

This paper presents a novel method for evolution of artificial autonomous agents. It is based on adaptive, self-organizing compressed genotypic encoding (SOCE) of the phenotypic synaptic efficacies of the agent's neurocontroller. The SOCE encoding implements a parallal evolutionary search for neurocontroller solutions in a dynamically varying and reduced subspace of the original synaptic space. It leads to the robust emergence of compact, near minimal successful neurocontrollers starting, from arbitrarily large networks. This is important since on practice the network size needed to solve the problem is unknown beforehand. The SOCE method may also serve to estimate the network size needed to solve a given task, and to delineate the-relative importance of the neurons composing the agent's controller network.
Lessons learned in the development of an information technology concentration
Authors: John D. Chenoweth
Venue: Journal of Computing Sciences in Colleges (2001)

During the 1997-1999 academic years, the Computer and Information Sciences Department at East Tennessee State University developed a new concentration in Information Technology. This concentration was developed in an attempt to fill a need indicated by articles in the national press, students enrolled in our other two concentrations, and our departmental advisory board. Two existing concentrations, computer science and information science, focus heavily on general programming skills, including a four semester programming sequence followed by a two semester software engineering sequence. The newest concentration includes coverage of web design and development, networking, system administration and database design and development. Since the implementation of this program starting with the Fall 1999 freshman class, the faculty have had many discussions aimed at improving this new concentration. Included in these discussions are a failure to plan for course overlap, a lack of faculty expertise in certain areas, and a better appreciation for the skills required for the types of graduates we envisioned. Due to these discussions, a major revision of this concentration was undertaken during the 2000-2001 academic year in an attempt to overcome the numerous problems that occurred along the way. The presentation of this paper will include an in depth look at these three concentrations, the problems that arose with the development of the newest of these, and the solutions implement to address these problems.
The Digital Hormone Model for self-organization
Authors: Wei-Min Shen, Cheng-Ming Chuong
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

This paper presents the Digital Hormone Model (DHM) as a new computational model for self-organization. The model is a generalization of an earlier distributed control system for self-reconfigurable robots [1-3] and an integration of reaction-diffusion model with stochastic cellular automata. In this model, cells secrete hormones, and hormones diffuse into space and influence the behaviors of other cells to self-organize into global patterns. In contrast to the reaction-diffusion models, cells movements are computed not by the Turing's differential equations [4] but by stochastic rules that are based on the concentration of hormones in the neighboring space. Different from simulated annealing, the stochastic rules are not the Metropolis rule [5], which will not produce the desired results here. Experimental results have shown that the simulated cells in the DHM produce results that match to the observations made in the biological experiments where homogenous skin cells self-organize into feather buds regulated by hormones [6]. With the unique properties of being distributed, scalable, robust, and adaptive, the DHM opens opportunities for new hypotheses, theories, and experiments for further investigating the nature of self-organization.
Mobile business services: a strategic perspective
Authors: Jukka Alanen, Erkko Autio
Venue: Mobile commerce: technology, theory, and applications (2003)

Mobile business services are attracting increasing attention and they promise a multibillion dollar market whose characteristics are quite distinct compared to mobile consumer services. Competitive activity among players keen on tapping into this opportunity is increasing rapidly. In this article, we look at mobile business services from a strategic business perspective. We chart the mobile business services landscape and discuss the underlying market drivers and potential end-user benefits. Additionally, we describe the competitive landscape and discuss the relative positions of the primary player groups.
Entrance Capacity of an Automated Highway System
Authors: Randolph W. Hall, Ali Nowroozi, Jacob Tsao
Venue: Transportation Science (2001)

This paper evaluates the entrance capacity and queueing delay for Automated Highway Systems through use of simulations and analytical modeling. Queueing statistics are also used to determine the sustainable capacity of alternative concepts, taking trip length distribution and spacing between ramps into consideration. Based on safety-spacing headways (produced in a separate analysis), the most promising concept utilizes platoons both on the highway and on on-ramps. However, it is unclear whether comparable capacity can be achieved on exit, when vehicles must be decoupled from their platoons, and whether it is safe for vehicles to enter the highway in closely spaced platoons. The analytical evaluation indicates that entrance/exit spacing on the order of one per 2 km or closer would be required to support highways with total capacity on the order of 20,000 vehicles per hour. Most likely, this would be achieved most efficiently if separate dedicated entrances are provided for automated vehicles, to minimize weaving on manual lanes.
New faculty contributions toward enhancing diversity
Authors: Alfreda Dudley-Sponaugle, Elizabeth Goode, Cheryl Schroeder-Thomas, Goran Trajkovski
Venue: Journal of Computing Sciences in Colleges (2003)

As instructors, we bring to the classroom the diversity within us. The phenomenon of cultural transfusion and interchange with the environment tends to be the most obvious in the beginning of the career in the new environment, and the experience can be full of frustrating, interesting, and supportive events that one would categorize as learning experiences.The Computer Sciences are believed to be diversity-hostile disciplines, in the sense that it is hard to introduce topics of gender, national origin, disability etc. However, it is being done in our classrooms, on a micro and macro level. Being "the new colleague", our efforts to integrate these issues into our courses may incur different reactions by both students and colleagues.The panel is designed to present the experiences and the view of four new Towson University instructors on teaching in an environment where they are minority in one or several socially induced categories, and how they infuse their diversity topics of interest in the curriculum.
Testing in the capstone course - reusable patterns for a value-added experience
Authors: Edward L. Jones
Venue: Journal of Computing Sciences in Colleges (2002)

The capstone course is designed to integrate and apply concepts and skills learned throughout the curriculum to a practical software development project. Students use this course as a springboard into careers as systems analysts and software engineers. In many curricula, the capstone course provides students their only exposure to software engineering. As such, the capstone course is an opportunity to demonstrate the relationship between software specification and software testing. This paper presents a simple framework for specifying user driven software applications, and for identifying verification patterns that apply to elements in the specification. The use of verification patterns early in the life cycle actually helps students understand and document the intended behavior of the application, and provide the bases for design reviews and for testing the completed project. Attention to issues of testing improves the overall software development process. Tutorial packages will include PowerPoint presentations, verification worksheets (useful for testing and walkthroughs), and URL to web resources.
Analytical treatment of the earth oblateness and solar radiation pressure effects on an artificial satellite: I. the equations of motion
Authors: Ahmed A. El-Enna
Venue: Applied Mathematics and Computation (2003)

In this paper, the motion of the Earth artificial satellite problem including the solar radiation pressure force has been considered. The geopotential will be expressed in terms of both the zonal and tesseral harmonics up to J4 and S44 respectively. The solar radiation pressure force will be obtained to enable this effect to contribute in the Hamiltonian function corresponding to the motion of the satellite. The Hamiltonian function is then obtained in terms of the Delauny set of canonical variables, augmented so as to remove the explicit time dependence due to the mean longitude of the Sun and due to the motion of the Earth about its axis.
Sequential optimization in the absence of global reset
Authors: Vigyan Singhal, Carl Pixley, Adnan Aziz, Shaz Qadeer, Robert Brayton
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2003)

We study the problem of optimizing synchronous sequential circuits. There have been previous efforts to optimize such circuits. However, all previous attempts make implicit or explicit assumptions about the design or the environment of the design. For example, it is widespread practice to assume the existence of a hardware reset line and consequently a fixed power-up state; in the absence of the same, a common premise is that the design's environment will apply an initializing sequence. We review the concept of safe replaceability which does away with these assumptions and the delay-safe replaceability notion, which is applicable when the design's output is not used for a certain number of cycles after power-up. We then develop procedures for optimizing the combinational next-state and output logic, as well as routines for reencoding the state space and removing state bits under these replaceability criteria. Experimental results demonstrate the effectiveness of our algorithms.
The Infeasibility of Invariant Laws in Management Studies: a Reflective Dialogue in Defense of Case Studies
Authors: Jean-Francois Hennart, Dong-Jae Kim, Ming Zeng, Tsuyoshi Numagami
Venue: Organization Science (1998)

The author questions the possibility of establishing invariant laws for social phenomena and presents an argument for the case study method. Despite the many alleged advantages of the case study method, its validity remains in doubt. Various concepts and techniques have been developed to make the method rigorous enough to meet the stringent criteria of nomothetical social science, but it often fails to meet two of them: (1) reliability and replicability, and (2) external validity. Those two criteria can be met only when social researchers find an invariant law. The author examines whether those two criteria are really necessary and attempts to clarify the conditions under which they are relevant, that is, the conditions under which an invariant law can be discovered in social phenomena. He argues that the conditions are so stringent that the search for an invariant law should not be the main objective of management studies, and he contends that reliability/replicability and external validity are irrelevant not only for the case study, but for any method of management studies. Without those two criteria, the validity of the case study can be forcefully reasserted. The author concludes by suggesting that serious consideration be given to whether the objective of management studies should be changed from a search for invariant laws of practical use to the encouragement of reflective dialogue in society.
A free-derivative iteration method of order three having convergence of both point and interval for nonlinear equations
Authors: Yiran Zhu, Xinyuan Wu
Venue: Applied Mathematics and Computation (2003)

A free-derivative iteration method of order three having convergence of both points and intervals for nonlinear equations is proposed in this paper. Our numerical experience show that this new method compares well with the classical method.
Almost Perfect Matrices and Graphs
Authors: Manfred Padberg
Venue: Mathematics of Operations Research (2001)

We introduce the notions of w-projection and w-projection that map almost integral polytopes associated with almost perfect graphsGï¾ withn nodes from R n into R n-w?, where w is the maximum clique size inG. We show that C. Berge's strong perfect graph conjecture is correct if and only if the projection (of either kind) of such polytopes is again almost integral inR n-w?. Several important properties of w-projections and w-projections are established. We prove, among other results, that the strong perfect graph conjecture is wrong if an w-projection and a related w-projection of an almost integral polytope with 2 = w = ( n-1)/2 produce different polytopes inR n-w?.
Searching in metric spaces by spatial approximation
Authors: Gonzalo Navarro
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2002)

We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function defined among them which satisfies the triangle inequality. The goal is, given a set of objects and a query, retrieve those objects close enough to the query. The complexity measure is the number of distances computed to achieve this goal. Our data structure, called sa-tree (&ldquo;spatial approximation tree&rdquo;), is based on approaching the searched objects spatially, that is, getting closer and closer to them, rather than the classic divide-and-conquer approach of other data structures. We analyze our method and show that the number of distance evaluations to search among n objects is sublinear. We show experimentally that the sa-tree is the best existing technique when the metric space is hard to search or the query has low selectivity. These are the most important unsolved cases in real applications. As a practical advantage, our data structure is one of the few that does not need to tune parameters, which makes it appealing for use by non-experts.
Computing characteristic classes of projective schemes
Authors: Paolo Aluffi
Venue: Journal of Symbolic Computation (2003)

We discuss an algorithm computing the push-forward to projective space of several classes associated to a (possibly singular, reducible, non-reduced) projective scheme. For example, the algorithm yields the topological Euler characteristic of the support of a projective scheme S, given the homogeneous ideal of S. The algorithm has been implemented in Macaulay2.
Content-Based Trademark Retrieval System Using a New Region Based Shape Description Method: The Distance-Angle Pair-Wise Histogram
Authors: Shinfeng D. Lin, B. Y. Hsu, X. L. Yang
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Due to the increasing number of registered trademarks, it is more and more difficult to design and register a new trademark without a good retrieval method. Thus, we propose a new region based shape description method, the distance-angle pair-wise histogram, as the trademark shape feature vector to retrieve similar trademarks. Experiments have been conducted on about 1000 trademark images. Some moment-based methods have also been implemented. In general, the proposed method performs better than other moment-based methods.
Challenges and rewards of teaching in a small computer science department
Authors: Barbara Boucher Owens, Anne Gates Applin, Adel M. Abunawass, Laura Baker, David Luginbuhl, Mike Way
Venue: Journal of Computing Sciences in Colleges (2003)

Teaching in a small computing department has many unique challenges and rewards. A committee has started to identify these areas and develop ways to meet these challenges. Over the past 8 months a significant effort (via a survey and panel presentations at conferences in fall of 2002) has been made to get feedback from this community as to what the needs are. The panel will present the results of that work, get more feedback, give an overview of future work, and look to enlist people interested in the project.
Metamodelig architectures and interoperability of web-enabled information systems
Authors: Marie-Noëlle Terrasse, George Becker, Marinette Savonnet
Venue: Web-enabled systems integration: practices and challenges (2003)

Metamodeling, which is extensively used in information system analysis & design, provides modelers with two complementary mechanisms for abstraction: abstraction by projection and abstraction by conceptualization. Metamodeling architectures are becoming a backbone of modeling environments in which modeling is carried out through a two-stage process: first, defining a convenient metamodel for the application domain, and second, describing the model of the application as an instantiation of the application-domain metamodel. We propose to use metamodeling-and its abstraction mechanisms-for modeling of web-enabled information systems and achieving their interoperability. Abstraction by projection allows us to describe user-specific features of web-enableb information systems and their security aspects more accurately. Abstraction by conceptualization allows us to define abstract bases of agreement for interoperability of web-based information systems.
On market-inspired approaches to propositional satisfiability
Authors: William E. Walsh, Makoto Yokoo, Katsutoshi Hirayama, Michael P. Wellman
Venue: Artificial Intelligence (2003)

We describe three market-inspired approaches to propositional satisfiability. The first is based on a formulation of safisfiability as production on a supply chain, where producers of particular variable assignments must acquire licenses to fail to satisfy particular clauses. Experiments show that although this general supply-chain protocol can converge to market allocations corresponding to satisfiable truth assignments, it is impractically slow. We find that a simplified market structure and a variation on the pricing method can improve performance significantly. We compare the performance of the three market-based protocols with distributed breakout algorithm and GSAT on benchmark 3-SAT problems. We identify a tradeoff between performance and economic realism in the market protocols, and a tradeoff between performance and the degree of decentralization between the market protocols and distributed breakout. We also conduct informal and experimental analyses to gain insight into the operation of price-guided search.
Creating new computer science curricula for the new millenium
Authors: Evelyn Stiller, Cathie LeBlanc
Venue: Journal of Computing Sciences in Colleges (2003)

Now that Computing Curricula 2001 [IEEE00] is in place, we have an opportunity to review our computing curricula in order to modernize them. This paper suggests that while we are altering our curricula to comply with Computing Curricula 2001, we should consider additional factors in determining our revised curricula. One significant consideration for departments offering traditional computer science bachelor's degrees is that we are competing with fresh and exciting information technology programs. Additionally, there is a long history of including too few women and minorities [NCES96], so we should consider making our courses and curricula more appealing to these audiences.
On validity of m-step multisplitting preconditioners for linear systems
Authors: Zhi-Hao Cao, Yang Wang
Venue: Applied Mathematics and Computation (2002)

Let Ax = b be a linear system where A is a symmetric positive definite (spd) matrix. m-step multisplitting preconditioners, which include the preconditioners based on multisplittings obtained by incomplete Cholesky factorizations [R. Bru, C. Corral, A. Martínez, J. Mas, SIAM J. Matrix Anal. Appl. 16 (1995) 1210-1222], for the conjugate gradient method are studied. The validity of the proposed m-step multisplitting preconditioners when A is an spd matrix is proved. Our results improve and extend previous ones.
Correlation-Induction Techniques for Estimating Quantiles in Simulation Experiments
Authors: Athanassios N. Avramidis, James R. Wilson
Venue: Operations Research (1998)

A simulation-based quantile estimator measures the level of system performance that can be delivered with a prespecified probability. To estimate selected quantiles of the response of a finite-horizon simulation, we develop procedures based on correlation induction techniques for variance reduction, with emphasis on antithetic variates and Latin hypercube sampling. These procedures achieve improved precision by controlling the simulation's random-number inputs as an integral part of the experimental design. The proposed multiple-sample quantile estimator is the average of negatively correlated quantile estimators computed from disjoint samples of the simulation response, where negative correlation is induced between corresponding responses in different samples while mutual independence of responses is maintained within each sample. The proposed single-sample quantile estimator is computed from negatively correlated simulation responses within one all-inclusive sample. The single-sample estimator based on Latin hypercube sampling is shown to be asymptotically normal and unbiased with smaller variance than the comparable directsimulation estimator based on independent replications. Similar asymptotic comparisons of the multiple-sample and directsimulation estimators focus on bias and mean square error. Monte Carlo results suggest that the proposed procedures can yield significant reductions in bias, variance, and mean square error when estimating quantiles of the completion time of a stochastic activity network.
Connections Between Integer Linear Programming and Constraint Logic Programming-An Overview and Introduction to the Cluster of Articles
Authors: H. Paul Williams, John M. Wilson
Venue: INFORMS Journal on Computing (1998)

The fields of integer linear programming and constraint logic programming have developed from different standpoints in mathematics and operations research, but offer synergy. This article will briefly review some aspects of their separate development that give rise to connections between the two fields and will describe some of these connections which appear to have potential for harnessing and for future research. The article will then introduce the other four articles in this cluster, which further explore and develop these interconnections.
Stratified Hutton uniform spaces
Authors: Dexue Zhang
Venue: Fuzzy Sets and Systems (2002)

In this paper some categorical properties of Hutton uniform spaces are investigated. At first, the initial and final structures for Hutton uniform spaces are discussed and it is proved that the canonical functor from the construct of Hutton uniform spaces to that of L-topological spaces preserves initial sources. Secondly, the notion of stratified Hutton uniform spaces is introduced, and it is demonstrated that every stratified Hutton uniformity induces a stratified L-topology and that the relationship between stratified Hutton uniform spaces and Hutton uniform spaces is like that between stratified L-topological spaces and L-topological spaces. Finally, it is showed that the construct of uniform spaces can be embedded in the construct of stratified Hutton uniform spaces as a concretely both reflective and co-reflective full sub-construct.