ppxscal/embedding_network huggingface dataset:
Interactive generative systems for conceptual design: An empirical perspective
Authors: Claudia Eckert, Ian Kelly, Martin Stacey
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

This paper argues from extensive research findings in design psychology and industrial design processes, as well as our own observations, that interactive generative systems can be powerful tools for human designers. Moreover, interactive generative systems can fit naturally into human design thinking and industrial design practice. This discussion is focused on aesthetic design fields like knitwear and graphic design, but is largely applicable to major branches of engineering. Human designers and generative systems have complementary abilities. Humans are extremely good at perceptual evaluation of designs, according to criteria that are extremely hard to program. As a result, they can provide fitness evaluations for evolutionary generative systems. They can also tailor the biases that generation systems use to reach useful solutions quickly. We discuss an application of these approaches: Kelly's evolutionary systems for color scheme design. Automatic design systems can work interactively with human designers by generating complete designs from partial specifications, that can then be used as starting points for designing by modification. We discuss an application of this approach: Eckert's garment shape design system.
Case study: tokamak plasma turbulence visualization
Authors: Scott E. Parker, Ravi Samtaney
Venue: Proceedings of the conference on Visualization '94 (1994)

One of the most fundamental issue in magnetic fusion research is the understanding of turbulent transport observed in present-day tokamak experiments. Plasma turbulence is very challenging from a theoretical point of view due to the nonlinearity and high dimensionality of the governing equations. Recent developments in algorithms along with the astounding advances in high performance computing now make first-principle particle simulations an important tool for improved understanding of such phenomena. Due to the five dimensional phase space (3 spatial, 2 velocity) and complex toroidal geometry, visualization is crucial for interpreting such simulation data. This paper discusses how visualization tools are currently used and what new physics has been elucidated, along with what can be learned about tokamak turbulence through the interplay between theory, simulation and visualization.
Pseudotransient Continuation and Differential-Algebraic Equations
Authors: Todd S. Coffey, C. T. Kelley, David E. Keyes
Venue: SIAM Journal on Scientific Computing (2003)

Pseudotransient continuation is a practical technique for globalizing the computation of steady-state solutions of nonlinear differential equations. The technique employs adaptive time-stepping to integrate an initial value problem derived from an underlying ODE or PDE boundary value problem until sufficient accuracy in the desired steady-state root is achieved to switch over to Newton's method and gain a rapid asymptotic convergence. The existing theory for pseudotransient continuation includes a global convergence result for differential equations written in semidiscretized method-of-lines form. However, many problems are better formulated or can only sensibly be formulated as differential-algebraic equations (DAEs). These include systems in which some of the equations represent algebraic constraints, perhaps arising from the spatial discretization of a PDE constraint. Multirate systems, in particular, are often formulated as differential-algebraic systems to suppress fast time scales (acoustics, gravity waves, Alfven waves, near equilibrium chemical oscillations, etc.) that are irrelevant on the dynamical time scales of interest. In this paper we present a global convergence result for pseudotransient continuation applied to DAEs of index 1, and we illustrate it with numerical experiments on model incompressible flow and reacting flow problems, in which a constraint is employed to step over acoustic waves.
Combined connectivity augmentation and orientation problems
Authors: András Frank, Tamás Király
Venue: Discrete Applied Mathematics (2003)

Two important branches of graph connectivity problems are connectivity augmentation, which consists of augmenting a graph by adding new edges so as to meet a specified target connectivity, and connectivity orientation, where the goal is to find an orientation of an undirected or mixed graph that satisfies some specified edge-connection property. In the present work, an attempt is made to link the above two branches, by considering degree-specified and minimum cardinality augmentation of graphs so that the resulting graph admits an orientation satisfying a prescribed edge-connection requirement, such as (k,l)-edge-connectivity. The results are obtained by combining the supermodular polyhedral methods used in connectivity orientation with the splitting off operation, which is a standard tool in solving augmentation problems.
Decomposition of Queueing Networks with Dependent Service and Negative Customers
Authors: P. P. Bocharov, E. V. Gavrilov, C. D'apice, A. V. Pechinkin
Venue: Automation and Remote Control (2004)

Queueing networks with negative customers (G-networks) and dependent service at different nodes are studied. Every customer arriving at the network is defined by a set of random parameters: his route over the network (a sequence of nodes visited by the customers), route length, and volume and service length of the customer at every stage of the route. For G-networks, which are the analogs of BCMP-networks, the multidimensional stationary distribution of the network state probabilities is shown to be representable in product form.
Estimating Pre-Placement FPGA Interconnection Requirements
Authors: Parivallal Kannan, Dinesh Bhatia
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

With increasing device and design sizes, InterconnectPlanning is fast becoming an important design issue for largeFPGA based designs. The fundamental requirement for interconnectplanning is the ability to estimate the routing requirementsof a given design at all stages of physical design. A numberof interconnect estimation methods have been proposed, butvery few operate prior to placement. Pre-placement estimationis very useful for detailed design space exploration during logicsynthesis and earlier stages of design. We propose a new localneighborhood analysis based method to estimate the wirelengthsof every net in a given netlist, prior to placement. We assume anoptimal placement with respect to total wirelength and estimatethe bounding-box sizes of all the nets. We then use the bounding-boxestimates to compute the post-routing peak channel widthof the device. Our method efficiently handles pad constraineddesigns. We compare our net bounding-box and peak channelwidth estimates with the post-placement and post-routing resultsobtained using VPR [1], a commonly used FPGA tool suite.
A formal analysis of exchange of digital signatures
Authors: Andre Scedrov
Venue:  (2003)

A fair signature exchange protocol lets two parties exchange digital signatures on a specified text. In optimistic protocols, it is possible for two signers to do so without invoking a trusted third party. However, an adjudicating third party remains available should one or both signers seek timely resolution. Each signer may have one or more objectives, ranging from &ldquo;optimistically&rdquo; trying to put the exchange in place as quickly as possible to maliciously manipulating the other party to gain an advantage. We study in detail the optimistic two-party signature exchange protocol of Garay, Jakobsson and MacKenzie [28] using a game-theoretic framework and show that no signer enjoys an advantage over an honest counterparty. In this setting, we employ the formal inductive proof methods previously used in the formal analysis of simpler, trace-based properties of authentication protocols. We extend this game-theoretic framework to include concepts of preferred behavior and analyze a class of signature exchange protocols. In the process of establishing relationships amongst various protocol properties obtained in the literature, we obtain a fundamental impossibility result: in any fair, optimistic protocol there is a point at which one signer realizes an advantage over an optimistic opponent.
The digital aid framework
Authors: Jason Sargent
Venue: Ubiquity (2003)

Technology enables humanitarian relief organizations to come closer to achieving Dunant's dream. The Digital Aid Framework shows organizations how to use technology during complex humanitarian relief operations.
The B-spline recurrence relations of Chakalov and of Popoviciu
Authors: Carl de Boor, Allan Pinkus
Venue: Journal of Approximation Theory (2003)

We discuss the early history of B-splines with an arbitrary knot sequence, and of their recurrence relations. These seem to have first appeared in papers of Popoviciu and Chakalov from the 1930s.
Internet Connectivity: Visions for the Networked Community
Authors: Adam Stone
Venue: IEEE Internet Computing (2004)

At the 9th Annual Advanced Network Workshop (AWN)-- held 20 to 23 October 2003 in Montreal, Quebec, Canada--two of that nation's leading proponents of Internet advancement, Canada's advanced Internet development organization Canarie and the Réseau d'informations scientifiques du Québec (RISQ), joined forces to cohost this conference exploring the next generation of Internet connectivity.
Evaluating Wireless Architectures for GDS Applications
Authors: Hesham Ali, Gert-Jan de Vreede, Karthik Ramachandra, Elwalid Sidahmed, Hiranmayi Sreenivas
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

While Wireless data communication technology promises to be the next primary communication media in the 21st century, thus far, skepticism about their degree of reliability and performance has prevented wireless networks from replacing traditional networks in critical or demanding applications. In this paper, we explore the use of wireless environments in various applications related to Group Decision Support (GDS) Systems. In particular, we look into the impact of using various network architectures on the performance measures of GDS applications. Our experiments show that while the Quality of Service parameters of wireless networks still do not the match those of wired networks, the performance of wirelessenvironments is acceptable for several GDS applications. We show that selecting the proper wireless architecture has a significant impact on the performance of the applications. In particular, the peer-to-peer architecture provided far better performance than other wireless architectures.
Double-Layer Stream Scheduling Scheme with QoS Control for Cluster Video Servers
Authors: Xiaofei Liao, Hai Jin, Hao Chen
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Researchers have put more emphasis on stream-scheduling policies to build high performance video servers. But the most important aim of these traditional stream-scheduling schemes is to improve the resource utilization, such as memory, network bandwidth and CPU, to maximize the number of concurrent streams. These schemes did not consider the QoS needs of video streaming or described the QoS parameter weakly, so the average qualities of media streams have no guarantees when the number of media streams is very large.In this paper, we propose a new two-layer stream-scheduling scheme with QoS control for cluster video servers. We first propose new definitions for video streams with the consideration of QoS and then describe the scheme of how to schedule video streams from two layers. The target of this scheme is to improve the average QoS of all streaming tasks and to obtain largenumber of scheduled video streams.
A Comparative Evaluation of Dynamic Visualisation Tools
Authors: Michael J. Pacione, Marc Roper, Murray Wood
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Despite their potential applications in softwarecomprehension, it appears that dynamic visualisationtools are seldom used outside the research laboratory.This paper presents an empirical evaluation of fivedynamic visualisation tools - AVID, Jinsight, jRMTool,Together ControlCenter diagrams and TogetherControlCenter debugger. The tools were evaluated on anumber of general software comprehension and specificreverse engineering tasks using the HotDraw object-orientedframework. The tasks considered typicalcomprehension issues, including identification of softwarestructure and behaviour, design pattern extraction,extensibility potential, maintenance issues, functionalitylocation, and runtime load. The results revealed that thelevel of abstraction employed by a tool affects its successin different tasks, and that tools were more successful inaddressing specific reverse engineering tasks thangeneral software comprehension activities. It was foundthat no one tool performs well in all tasks, and some taskswere beyond the capabilities of all five tools. This paperconcludes with suggestions for improving the efficacy ofsuch tools.
Computational methods for modifying seemingly unrelated regressions models
Authors: Erricos John Kontoghiorghes
Venue: Journal of Computational and Applied Mathematics (2004)

Computational efficient methods for updating seemingly unrelated regressions models with new observations are proposed. A recursive algorithm to solve a series of updating problems is developed. The algorithm is based on orthogonal transformations and has as main computational tool the updated generalized QR decomposition (UGQRD). Strategies to compute the orthogonal factorizations by exploiting the block-sparse structure of the matrices are designed. The problems of adding and deleting exogenous variables from the seemingly unrelated regressions model have also been investigated. The solution of these problems utilize the strategies for computing the UGQRD.
Sensing and mapping for interactive performance
Authors: Kia Ng
Venue: Organised Sound (2002)

This paper describes a trans-domain mapping (TDM) framework for translating meaningful activities from one creative domain onto another. The multi-disciplinary framework is designed to facilitate an intuitive and non-intrusive interactive multimedia performance interface that offers the users or performers real-time control of multimedia events using their physical movements. It is intended to be a highly dynamic real-time performance tool, sensing and tracking activities and changes, in order to provide interactive multimedia performances.From a straightforward definition of the TDM framework, this paper reports several implementations and multi-disciplinary collaborative projects using the proposed framework, including a motion and colour-sensitive system, a sensor-based system for triggering musical events, and a distributed multimedia server for audio mapping of a real-time face tracker, and discusses different aspects of mapping strategies in their context.Plausible future directions, developments and exploration with the proposed framework, including stage augmenta tion, virtual and augmented reality, which involve sensing and mapping of physical and non-physical changes onto multimedia control events, are discussed.
Hybrid stochastic framework for freeway traffic flow modelling
Authors: Lyudmila Mihaylova, René Boel
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Traffic flow is an interesting many-particle phenomenon, with nonlinear interactions between the vehicles. This paper studies highway traffic and presents a general framework for traffic modelling as a stochastic hybrid system (with continuous and discrete dynamics and some interactions between its components). The freeway is considered as a network of components, each component modelling a different section of the traffic network. A model is developed in order to design stochastic predictors of the flows. The different traffic modes and transitions between them are detected and analyzed in real data, collected by induction loop detectors from Belgian and Dutch freeways.
The evolution of artifacts in cooperative work: constructing meaning through activity
Authors: Marlin M. Cluts
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

A two year case study of cooperative work was inspired by the installation of CSCW software in a community bank. The framework for the research was developed by combining activity theory and the principles of communities of practice. This framework provided a useful model and insight into the evolution of artifact meaning, sharing, and credibility. In essence, users needed to experience results within the activity system and social structure of the community to establish meaning and credibility. The study applied the theory and language of activity theory and communities of practice to make sense of case phenomena and provide a richer context for understanding traditional principles.
Constructive timing violation for improving energy efficiency
Authors: Toshinori Sato, Itsujiro Arita
Venue: Compilers and operating systems for low power (2003)

A novel technique for improving the energy efficiency of microprocessors is disclosed. This new method relies on a fault-tolerance mechanism for timing violations, based on a speculative execution technique. Since power reduces quadratically with supply voltage, supply voltage reductions can result in substantial power savings. However, these reductions also cause a longer gate delay, and so the clock frequency must be reduced so that timing constraints of critical paths are not violated. If any fault-tolerance mechanism is provided for timing faults, it is not necessary to maintain the constraints. From these observations, we propose a fault-tolerance technique for timing violations, that efficiently utilizes the speculative execution mechanism and reduces power consumption. We call the technique constructive timing violation. The present study evaluated our proposal regarding this technique using a cycle-by-cycle simulator and determined the technique's efficiency regarding energy consumption.
Hash-based internet traffic distribution and tcp performance analysis
Authors: Francis L. Merat
Venue:  (2003)

IP packet transmission over multiple parallel links is in extensive use in today's Internet and its use is growing due to its scalability, reliability and cost-effectiveness. To maximize the efficiency of parallel links load balancing is necessary among the links; however, this may cause a problem with packet reordering. Since packet reordering impairs the performance of TCP or other application, it is important to reduce the amount of reordering. Hashing offers a simple solution to maintaining the packet order by sending a flow over a unique link; however, static hashing and conventional dynamic hashing do not achieve load balancing at adequate levels. We have enhanced the dynamic hashing algorithm to use flow volume information to reassign only appropriate flows. This new method, called dynamic hashing with flow volume (DHFV), eliminates unnecessary reassignments of small flows. It achieves load balancing very quickly without load fluctuation by accurately predicting the amount of transferred load between the links. We provide the general framework of DHFV and address the challenges in implementing DHFV. We analyze the TCP performance under packet loss and packet reordering to show that packet reordering has less impact on TCP performance. Simulation results show that DHFV reduces the packet loss by 97% compared to static hashing and reduces the number of flow reassignments by 98% compared to dynamic hashing. When compared with a single link, Multilink with DHFV allows the receiving host to receive approximately 98% of the TCP traffic with only 0.4% additional traffic generated. Static hashing allows approximately 97% of the TCP traffic to be received with 5.5% additional traffic as compared to a single link. Dynamic hashing does not perform well either and allows only 89% of the TCP traffic to be received with 6.9% additional traffic. DHFV performs better than either static or dynamic hashing with performance approaching that of a comparable single link.
Automated meshing of sparse 3D point clouds
Authors: Oli Cooper, Neill Campbell, David Gibson
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

We propose a novel method that uses simulated annealing to create an optimal surface mesh by selecting a subset of a 3D point cloud and a triangulation that reliably represents the actual topology of the scene. This method provides a number of advantages: it copes well with noisy data, it produces a simplified mesh, particularly for scenes that contain many planes and, unlike greedy search techniques, it is much more likely to converge to a global minimum.
Developing an object-oriented view management system
Authors: Harumi A. Kuno, Elke A. Rundensteiner
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

This paper discusses our experiences regarding the design and implementation of the Multi View system - a framework for the specification, creation, and management of updatable views in object-oriented databases (OODBs) - using commercially available OODB technology. Multi View, which simplifies view schema design and maintenance by breaking view specification into the tasks of class derivation, global schema integration, view class selection, and view hierarchy generation, has been implemented on top of the GemStone OODB. The current implementation employs a three-layered architecture (composed of meta-objects, schema-objects, and data-objects) to extend the GemStone object model. It results in a view tool that extends the GemStone data model by supporting view specification, maintenance, and access. In this paper, we describe the system classes and methods as well as necessary algorithms. The first prototype of Multi View has been built, and we describe a sample application example.
Information technology as a facilitator of results-based management in government
Authors: James E. Swiss
Venue: Public information technology: policy and management issues (2003)

The most widely accepted normative model of "good" public management is often called results-based management. It encourages planning and target setting to make the organization more proactive; an emphasis on outcomes to make the organization better focused on its mission; quick performance feedback to make the organization more responsive; and continuous process improvements to make the organization better able to serve its clients. These changes are possible only with supporting information technology. This chapter discusses ways that IT, including GIS, EIS, and intranets, can support the new management model. However, IT can increase management effectiveness only if its role has been carefully designed. Before implementing major IT changes, top public managers must begin by determining such policy issues as what information would best guide upcoming major decisions; what balance the agency wishes between internal information accessibility versus security; and how best to balance frontline worker empowerment versus the need for organizational uniformity.