ppxscal/embedding_network huggingface dataset:
A Flexible Model for Simulation of Mammalian Coats
Authors: Carlos E. S. Moreira, Marcelo Walter
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

We show the flexibility of the Clonal Mosaic model as a pattern generation mechanism. The coat patterns are generated directly on the 3D mesh representing the animals. We illustrate the flexibility of the model generating two visually distinct species of cheetah with a small change in the parameters of the simulation.
3D representations for software visualization
Authors: Andrian Marcus, Louis Feng, Jonathan I. Maletic
Venue: Proceedings of the 2003 ACM symposium on Software visualization (2003)

The paper presents a new 3D representation for visualizing large software systems. The origins of this representation can be directly traced to the SeeSoft metaphor. This work extends these visualization mechanisms by utilizing the third dimension, texture, abstraction mechanism, and by supporting new manipulation techniques and user interfaces. By utilizing a 3D representation we can better represent higher dimensional data than previous 2D views. An overview of our prototype tool and its basic functionality is given. Applications of this method to particular software engineering tasks are also discussed.
Procedural cuing using an expert support system
Authors: Beverley G. Hope, Rosemary H. Wild
Venue: Decision making support systems: achievements, trends and challenges for (2002)

This chapter describes the development of a system to assist teams in determining which problems to address and what data to collect in order to incrementally improve business processes. While prototyping is commonly advocated for expert system development, this project used a structured development methodology comprising requirements analysis, knowledge acquisition, and system development. The knowledge acquisition phase resulted in a logical model, which specified the decision task and suggested a system structure. The field prototype developed from this model uses procedural cuing to guide decision makers through a decision making process. The system provides decision support, interactive training, and expert advice.
Reviewing the professionalization of software engineering: can small colleges remain viable?
Authors: J. William Cupp
Venue: Journal of Computing Sciences in Colleges (2001)

The issue of the increasing professionalization of Software Engineering is a contemporary one. Recently various jurisdictions have enacted legislation providing for Professional Engineer (PE) licenses for software engineers. There are current and recently settled lawsuits over the use of the term "software engineer." Heavyweight organizations in the software engineering domain struggle to codify a Software Engineering Body of Knowledge, prestigious universities have begun offering Doctor of Philosophy degrees in Software Engineering, and the academic accrediting bodies which govern various aspects of computing sciences are coming to terms with the longstanding accrediting body of engineering programs.Still, it is not at all universally agreed that licensure of professional software engineers is a desirable idea. The Association for Computing Machinery (ACM) has come out resoundingly opposed to PE licensure for software engineers.Should licensure of professional Software Engineers become the norm, it is reasonable to expect that most licensing bodies will require those taking the Professional Engineer exam to have a degree in the field from an accredited academic institution. Should this come to pass, can small colleges and universities realistically hope to offer degrees for candidates for a PE license? Will undergraduate Software Engineering degree programs become the exclusive domain of larger schools with substantial engineering programs?This paper takes an early look at these topics and tries to scope out directions small colleges might take now to position themselves well in the future.
Constructing the IT skills shortage in Canada: the implications of institutional discourse and practices for the participation of women
Authors: Wendy Cukier
Venue: Proceedings of the 2003 SIGMIS conference on Computer personnel research: Freedom in Philadelphia--leveraging differences and diversity in the IT workforce (2003)

Building on previous work, this paper explores systemic barriers to women in information technology professions by focusing on the ways in which institutional practices reinforce a definition of "information technology professional" that tends to exclude women. It examines the recent discourse on the "Information Technology Skills Shortage" in selected texts from industry, professional associations, academia and programs aimed at increasing the participation of women, focusing on the implications of discursive practices for the inclusion of women. In particular, it examines some of the apparent inconsistencies and contradictions which appear in the institutionalized discourse and practices.It argues that:1. With changing employment patterns, convergence of technologies and the expansion of e-business, professionals who combine technical skills with business and communication skills are needed more than ever.2. In spite of this, much of the discourse regarding the "IT Skills Shortage" focuses on Computer Science and Engineering and excludes other disciplines. It also emphasizes skills such as mathematics. These patterns are also reflected in the discourse regarding programmes aimed at increasing the participation of women.3. The discourse has unintended consequences by privileging disciplines which tend to be male dominated and excluding disciplines which include higher representations of women. The discourse also valorizing skills constructed as "male" such as math while devaluing those constructed as "female" such as communications skills. This is also reinforced in the discourse regarding programmes aimed at increasing the participation of women.4. The interaction of the industry, professional associations, educational institutions and the media produce and reproduce these discursive patterns regardless of their link to qualifications or skill requirements.5. These discourses are consistent with institutional theory, which suggests that certain practices may become widespread and "taken-for-granted" regardless of their link to actual performance or outcomes. The unintended consequence is systemic discrimination.
Hands on cooking: towards an attentive kitchen
Authors: Jeremy S. Bradbury, Jeffrey S. Shell, Craig B. Knowles
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

To make human computer interaction more transparent, different modes of communication need to be explored. We present eyeCOOK, a multimodal attentive cookbook to help a non-expert computer user cook a meal. The user communicates using eye-gaze and speech commands, and eyeCOOK responds visually and/or verbally, promoting communication through natural human input channels without physically encumbering the user. Our goal is to improve productivity and user satisfaction without creating additional requirements for user attention. We describe how the user interacts with the eyeCOOK prototype and the role of this system in an Attentive Kitchen.
Auctions for Procuring Options
Authors: James Schummer, Rakesh V. Vohra
Venue: Operations Research (2003)

We examine the mechanism-design problem for a single buyer to procure purchase options for a homogeneous good when that buyer is required to satisfy an unknown future demand. Suppliers have two-dimensional types in the form of commitment costs and production costs. The efficient schedule of options depends on the distribution of demand. To implement an efficient outcome, we introduce a class of mechanisms which are essentially pivotal mechanisms (Vickrey-Clarke-Groves) with respect to the expected costs of the suppliers. We show that the computational task of running such mechanisms is not burdensome. Our discussion uses electricity markets as an example.
Haptic rendering of complex force fields
Authors: Aleš Křenek
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

With a particular focus in scientific applications, we propose a method of haptic rendering of virtual environments which require rather complex calculations to evaluate their behaviour. Therefore it is not possible to perform the calculations within a haptic loop. We specify a class of problems for which the method is applicable, describe the designed data structure, present involved algorithms, and prove their critical properties. The general section is followed by a case study of applying the method in a specific application in computational chemistry. The paper is concluded with first practical results of deployment of the method as well as preliminary quantitative assessment.
3D input devices and interaction concepts for optical tracking in immersive environments
Authors: Oliver Stefani, Jörg Rauschenbach
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

In this poster abstract we present an interaction concept and input devices for optical tracking in virtual immersive environments. Requirements to input devices for immersive environments will be based on a document, outlining major requirements for VR-systems. A preliminary testing of the usability will be discussed. We conclude this abstract by presenting our interim findings.
Compact and noncompact structures for a variant of KdV equation in higher dimensions
Authors: Abdul-Majid Wazwaz
Venue: Applied Mathematics and Computation (2002)

In this paper we study two mathematical variants of KdV equation. We show that the focusing branches of these variants exhibit compactons: solitons with finite wavelength, whereas the defocusing branches support solitary patterns solutions with cusps or infinite slopes. A framework is developed for studying these problems in higher dimensions. Two distinct sets of general formulas for each type of variants are developed to present a fairly complete understanding of the compact and noncompact dispersive structures.
Chessboard Distributions and Random Vectors with Specified Marginals and Covariance Matrix
Authors: Soumyadip Ghosh, Shane G. Henderson
Venue: Operations Research (2002)

There is a growing need for the ability to specify and generate correlated random variables as primitive inputs to stochastic models.Moti vated by this need, several authors have explored the generation of random vectors with specified marginals, together with a specified covariance matrix, through the use of a transformation of a multivariate normal random vector (the NORTA method).A covariance matrix is said to be feasible for a given set of marginal distributions if a random vector exists with these characteristics. We develop a computational approach for establishing whether a given covariance matrix is feasible for a given set of marginals. The approach is used to rigorously establish that there are sets of marginals with feasible covariance matrix that the NORTA method cannot match. In such cases, we show how to modify the initialization phase of NORTA so that it will exactly match the marginals, and approximately match the desired covariance matrix.An important feature of our analysis is that we show that for almost any covariance matrix (in a certain precise sense), our computational procedure either explicitly provides a construction of a random vector with the required properties, or establishes that no such random vector exists.
A Branching Time Temporal Framework for Quantitative Reasoning
Authors: Krishnendu Chatterjee, Pallab Dasgupta, P. P. Chakrabarti
Venue: Journal of Automated Reasoning (2003)

Temporal logics such as Computation Tree Logic (CTL) and Linear Temporal Logic (LTL) have become popular for specifying temporal properties over a wide variety of planning and verification problems. In this paper we work towards building a generalized framework for automated reasoning based on temporal logics. We present a powerful extension of CTL with first-order quantification over the set of reachable states for reasoning about extremal properties of weighted labeled transition systems in general. The proposed logic, which we call Weighted Quantified Computation Tree Logic (WQCTL), captures the essential elements common to the domain of planning and verification problems and can thereby be used as an effective specification language in both domains. We show that in spite of the rich, expressive power of the logic, we are able to evaluate WQCTL formulas in time polynomial in the size of the state space times the length of the formula. We present experimental results on the WQCTL verifier.
On smoothers in parallel coupled multigrid methods for incompressible Navier-Stokes equations
Authors: Volker John
Venue: Scientific computing and applications (2001)

We present a numerical study of two types of smoothers in parallelized coupled multigrid methods for the solution of incompressible Navier-Stokes equations. The Vanka smoother is characterized by the solution of many small linear systems of equations in each smoothing step whereas the Braess-Sarazin smoother solves one large linear saddle point problem. Our study is based on the nonconforming P1/P0- finite element discretization in space and the Crank-Nicolson discretization in time. The computations were performed on parallel computer HP N-Class with RISC 8500 processors using the communication interface MPI. The Vanka smoother shows a better efficiency in this framework.
Homogenization of heat equation with hysteresis
Authors: Jan Franců
Venue: Mathematics and Computers in Simulation (2003)

The contribution deals with heat equation in the form (c u + W[u])t = div(a . ∇u) + f, where the nonlinear functional operator W[u] is a Prandtl-Ishlinskii hysteresis operator of play type characterized by a distribution function η. The spatially dependent initial boundary value problem is studied. Proof of existence and uniqueness of the solution is omitted since the proof is a slightly modified proof by Brokate-Sprekels.The homogenization problem for this equation is studied. For ε → 0, a sequence of problems of the above type with spatially ε-periodic coefficients cε, ηε, aε is considered. The coefficients c*, η* and a* in the homogenized problem are identified and convergence of the corresponding solutions uε to u* is proved.
Solving Real-World Linear Programs: A Decade and More of Progress
Authors: Robert E. Bixby
Venue: Operations Research (2002)

This paper is an invited contribution to the 50th anniversary issue of the journalOperations Research, published by the Institute of Operations Research and Management Science (INFORMS). It describes one person's perspective on the development of computational tools for linear programming. The paper begins with a short personal history, followed by historical remarks covering the some 40 years of linear-programming developments that predate my own involvement in this subject. It concludes with a more detailed look at the evolution of computational linear programming since 1987.
Sharing a charging station without explicit communication in collective robotics
Authors: Angélica Muñoz-Meléndez, François Sempé, Alexis Drogoul
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

This research focuses on the design of teams of mobile robots that are able to operate in real life situations and non-controlled environments. In order to perform any service, robots have firstly to display two properties: autonomy and self-sufficiency. This paper explores briefly a simple mechanism to enable a team of robots to behave in an autonomous and self-sufficient manner for as long as possible while taking into account the needs of partners.
Power protocol: reducing power dissipation on off-chip data buses
Authors: K. Basu, A. Choudhary, J. Pisharath, M. Kandemir
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

Power consumption is becoming increasingly important for both embedded and high-performance systems. Off-chip data buses can be a major power consumer In this paper, we present a strategy called "power protocol" that tries to reduce the dynamic power dissipation on off-chip data buses. To accomplish this, our strategy reduces the number of bus lines that need to be activated for data transfer by employing a small cache (called "value cache") at each side of the off-chip data bus. These value caches keep track of the data values that have recently been transmitted over the bus. The entries in these caches are constructed in such a way that the contents of both the value caches are the same all the time. When a data value needs to be transmitted over the bus, we first check whether it is in the value cache of the sender If it is, we transmit only the index of the data (i.e., its value cache address) instead of the actual data value and, the other side (receiver) can determine the data value by using this index and its value cache. Our experimental results using a set of fifteen benchmark codes from embedded systems domain show that power protocol is very effective in practice, and reduces the bit switching activity on the data bus by as much as 70.7% (with a value cache of 128 entries). We also present results from an implementation that combines our strategy with 1-to-2 encoding, a popular bus encoding strategy for low power. Our results indicate that this combined optimization strategy reduces bit switching activity by 67.8% on the average (across all benchmarks). These reductions in bit switching activity lead to more than 7% reduction on overall system energy on the average for a value cache of 256 entries. We also study the sensitivity of our savings to the value cache capacity and data cache capacity.
At the crossroads of technology and policy
Authors: Ubiquity staff
Venue: Ubiquity (2003)

Lorrie Cranor on privacy, online voting and Internet censorship.
A logic programming approach to knowledge-state planning, II: the DLVk system
Authors: Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer, Axel Polleres
Venue: Artificial Intelligence (2003)

In Part I of this series of papers, we have proposed a new logic-based planning language, called K. This language facilitates the description of transitions between states of knowledge and it is well suited for planning under incomplete knowledge. Nonetheless,K also supports the representation of transitions between states of the world (i.e., states of complete knowledge) as a special case, proving to be very flexible. In the present Part II, we describe the DLVK planning system, which implements K on top of the disjunctive logic programming system DLV. This novel planning system allows for solving hard planning problems, including secure planning under incomplete initial states (often called conformant planning in the literature), which cannot be solved at all by other logic-based planning systems such as traditional satisfiability planners. We present a detailed comparison of the DLVK system to several state-of-the-art conformant planning systems, both at the level of system features and on benchmark problems. Our results indicate that, thanks to the power of knowledge-state problem encoding, the DLVK system is competitive even with special purpose conformant planning systems, and it often supplies a more natural and simple representation of the planning problems.
Design concept to promote both reflective and experimental cognition for creative design work
Authors: Shun'ichi Tano
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

We discuss the disadvantages of the current design support systems that arise from a poor understanding of the human-cognitive characteristics, such as the reflective and experimental modes, and the selection of a suitable media for use in the creative design process. Then we demonstrate the current prototype system called "Godzilla" that supports the creative design especially for the car exterior designer. The designers can draw the concept image on a 2D pad (tablet with an LCD). When they grasp it and put it in midair, the shape of the 2D sketch is automatically recognized and appears as 3D sketch on a 3D pad (stereovision TV). They can sketch, modify, and observe from different viewpoints in both 2D and 3D. Note that 3D images are not displayed as a beautiful CG image, but a 3D sketch that consists of many 3D-cursive lines produced by mimicking the designer's pen touch in order to keep the designers in the reflective cognitive mode and to provide them with rich stimuli for their creative activities.
When Talk Is Not Cheap: Substantive Penance and Expressions of Intent in Rebuilding Cooperation
Authors: William P. Bottom, Kevin Gibson, Steven E. Daniels, J. Keith Murnighan
Venue: Organization Science (2002)

Interpersonal relationships can be fragile. The mere perception of opportunistic behavior can lead to a breakdown in cooperation. Once damaged, the question then arises as to whether and how cooperation might be restored. Noncooperative game theory raises serious doubts about the possibilities, although interactional justice and impression management research have shown that verbal explanations can dampen reactions to aversive behavior. Philosophical, anthropological, and ethological research all suggest that genuine forgiveness may require something more tangible and substantive than an explanation. Thus, the current experiment investigated the effects of explanations and varying forms of substantive amends on the restoration of mutual cooperation. The results confirm that rebuilding cooperation is feasible. Apologies and simple explanations can be effective to a degree, though substantive amends have significantly more positive effects than explanations alone. In contrast to prior findings on interactional justice, acknowledgments were more effective than denials in repairing short interactions. This research demonstrates that, once breached, cooperation can be reestablished and that actions as well as explanations and apologies can augment the process in important and sometimes subtle ways.
Virtual circles: a new set of features for fast image registration
Authors: Haikel Salem Alhichri, Mohamed Kamel
Venue: Pattern Recognition Letters (2003)

In this paper, we propose a novel set of image features called virtual circles, and their use in an efficient image registration algorithm to find translation and scale differences. A virtual circle is a circle with maximal radius encompassing a background area that does not contain edge points. Virtual circles have a number of nice properties such as the fact that they can be extracted efficiently with the help of the distance transform from many types of images. They can also have extra information, such as their radii, which can be used for efficient registration. Furthermore, virtual circles are robust against broken or corrupt edges. On the other hand, they are vulnerable to background noise, but through the use of a heuristic called the smoothness criterion, virtual circles that are less likely to be corrupted by background noise can be selected. Another advantage of the smoothness criterion is that it reduces the number of virtual circles needed, which increases the efficiency of the algorithm.