ppxscal/embedding_network huggingface dataset:
Merging Realities: Psychosocial Happenings--A World on Stage
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

One of the virtues of our changing times is that new media has challenged us to rethink and reexamine our basic presumptions about reality and the reality that is virtually perceived.From the perspective of an electronic media artist, I present a body of work (CASE STUDIES) of performative-like installations comprised of 3-D structures integrating video imagery with the reality of the physical, psychological, virtual, and social worlds. These structures are instigators for enticing "social happenings" whereby participants and viewers become subjects from an observational perspective, providing a simulated clinical "case study." With the influence of theoretical and scientific information in the constructs of mediated environments, perceptions of risk, danger trust, andself identity(s) are challenged. Using a metaphor to that of a "world on stage," the works provide a visual, conceptual, and concrete model to illustrate "Progress from Theory to Practice." 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
Parameterized Macrocells with Accurate Delay Models for Core-Based Designs
Authors: Makram M. Mansour, Mohammad M. Mansour, Amit Mehrotra
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

In this paper we propose a new design methodology targetedfor core-based designs using parameterized macro-cells(PMC's). This methodology provides the flexibility forinstance-based cores to be easily customized for applicationrequirements. By using few scaling parameters to characterizea PMC, a macrocell can be instantiated in virtually anysize depending on the required performance. Moreover, a newfirst-order macro delay model is proposed which is a functionof the scaling parameters of the PMC which enables accuratedelay predictions at the subsystem/core level. The proposeddelay model is suitable for use by a delay optimizer to determinethe optimum scaling parameters of individual PMC's ina core. A PMC library has been developed and used to designcores for communications applications. To demonstrate the effectivenessof the proposed methodology, several subsystemsused in a channel LDPC decoder were synthesized using thislibrary where the individual PMC's were optimized for minimumdelay. The resulting custom-quality layout have areasranging from 40 \times 100µm2 to 380 \times 200µm2 and delay in therange of 1:6ns to 10ns in 0:18µm, 1:8V CMOS technology.
Testing of Analogue Circuits via (Standard) Digital Gates
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

The possibility of using window comparators for on-chip (and potentially on-line) response evaluation of analogue circuits is investigated. No additional analogue test inputs are required and the additional circuitry can be realised either by means of standard digital gates taken from an available library or by full custom designed gates to obtain an observation window tailored to the application. With this approach, the test overhead can be kept extremely low. Due to the low gate capacitance also the load on the observed nodes is very low. Simulation results for some examples show that 100% of all assumed layout-realistic faults could be detected.
Discovering and structuring information flow among bioinformatics resources
Authors: Joan C. Bartlett, Elaine G. Toms
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

In this poster, we present a model of the flow of information among bioinformatics resources in the context of a specific scientific problem. Combining task analysis with traditional, qualitative research, we determined the extent to which the bioinformatics analysis process could be automated. The model represents a semi-automated process, involving fourteen distinct data processing steps, and forms the framework for an interface to bioinformatics information.
Networking abstractions and protocols under variable length messages
Authors: S. Milliner, A. Delis
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

The size of data shipped over networks of distributed databases has increased substantially with the introduction of multimedia and high performance systems. Therefore, there is a need to understand the behavior and the trade-offs of available data communication abstractions in such settings. In this paper, we consider parameters associated with the abstractions, the impact of their implementation on throughput, and we compare the performance of BSD sockets (TCP, UDP), System V TLI (TCP), and SunOS RPCs (TCP) in the presence of large messages. In such environments, segmentation overhead of UDP messages at the user level outweighs other considerations such as optimal mbuf allocation and full ethernet bandwidth usage. In addition, it is found that the size of buffer areas allocated to TCP sockets gains further impedance when sending large messages. We also find that communication induced paging significantly deteriorates the data transmission throughput and suggest a policy to avoid this problem
MCSA Self-Paced Training Kit: Microsoft Windows 2000 Core Requirements: Exams 70-210, 70-215, 70-216, and 70-218, Second Edition, 2 edition
Venue:  (2002)

:Four kits in one! Get self-paced, from-the-source information and practice with the skills measured by the core exams for Microsoft Certified Systems Administrator (MCSA) certification on Windows 2000-all in one box. Covering core Exams 70-210, 70-215, and 70-218-plus elective Exam 70-216-these official Microsoft study guides deliver in-depth training in hands-on, learn-by-doing format. Each book also contains 200+ pages of exam-preparation material, along with a testing tool to help assess what you know and where to focus your studies-before taking the actual exams. Work at your own pace through the skill-building lessons and exercises. As you gain practical experience administering the Windows 2000-based desktop, server, and network environments, you're also preparing for MCSA certification. The set includes four Microsoft study guides in print and on CD-ROM; exam preparation, including objective-by-objective review; test-readiness tools; Microsoft Encyclopedia of Networking, Second Edition, eBook; and a 120-day evaluation version of Windows 2000 Server. LIMITED TIME OFFER! This kit includes a voucher for a 15% discount at VUE Testing Centers, good toward all four exams (70-210, 70-215, 70-216, 70-218). Offer valid from VUE on exams taken by 12/31/03.
On geometric graphs with no k pairwise parallel edges
Authors: Pavel Valtr
Venue:  (1997)

A {\em geometric graph\/} is a graph $G=(V,E)$ drawn in the plane so that the vertex set $V$ consists of points in general position and the edge set $E$ consists of straight line segments between points of $V$. Two edges of a geometric graph are said to be {\em parallel\/}, if they are opposite sides of a convex quadrilateral. In this paper we show that, for any fixed $k\ge3$, any geometric graph on $n$ vertices with no $k$ pairwise parallel edges contains at most $O(n)$ edges, and any geometric graph on $n$ vertices with no $k$ pairwise crossing edges contains at most $O(n\log n)$ edges. We also prove a conjecture of Kupitz that any geometric graph on $n$ vertices with no pair of parallel edges contains at most $2n-2$ edges.
Numerical analysis of a 3-D super-elastic constitutive model
Authors: F. Auricchio, U. Stefanelli
Venue:  (2002)

This note deals with the efficient approximation of a nonlinear constitutive relation arising in the study of the mechanical behavior of shape memory alloys at constant temperature. In particular, a variable time-step discretization is investigated, sharp error estimates of optimal order are provided, and some numerical results relative to proportional and non-proportional loading tests are included.
Network management with Nagios
Authors: Richard C. Harlan
Venue: Linux Journal (2003)

The servers are from many vendors, the management software budget is small and the demands are high. Find out how the team at John Deere made it work.
Impact of Interconnect Pattern Density Information on a 90nm Technology ASIC Design Flow
Authors: Payman Zarkesh-Ha, S. Lakshminarayann, Ken Doniger, William Loh, Peter Wright
Venue: Proceedings of the 4th International Symposium on Quality Electronic Design (2003)

The importance of an interconnect pattern densitymodel in ASIC design flow for a 90nm technology ispresented. It is shown that performing the timing analysisat the worst-case corner model for interconnect variation,without the knowledge of interconnect pattern density,often results in overdesign. Our experiments on real ASICproducts indicate that knowledge of interconnect patterndensity in timing analysis of 90nm ASIC design flowprevents such overdesign. Quantitatively, it is shown thatconsidering only the worst-case corner model in a globalnet results in a 10% delay overdesign. To meet the targetdelay for the net, it is sufficient to use a 45% smaller gate,which results in a 32% reduction in gate powerdissipation, as well. It is, therefore, imperative to takeinto account the interconnect pattern density informationin ASIC design flow of 90nm and future technologies.
Evaluation of Compiler-Assisted Software DSM Schemes for a Workstation Cluster
Authors: Junpei Niwa, Tatsushi Inagaki, Takashi Matsumoto, Kei Hiraki
Venue: Proceedings of the 1999 International Workshop on Innovative Architecture (1999)

To execute shared-memory parallel programs efficiently on distributed-memory systems without remote-caching hardware mechanisms, software-caching mechanisms must be used. We have proposed two compiler-assisted software-caching schemes. One is a page-based system (Asymmetric Distributed Shared Memory: ADSM) that uses virtual memory mechanisms only for read cache-misses. The other is a full user-level system (User-level Distributed Shared Memory: UDSM) that uses user-level checking codes and consistency-management codes.In these schemes, an optimizing compiler directly analyses the shared-memory source programs and optimizes them. It exploits the capabilities of middle-grained or coarse-grained remote-memory accesses to reduce the volume of communications and to reduce the overhead of the cache-emulation codes. It performs interprocedural points-to analysis; interprocedural shared-access set calculations by using interval analysis to solve redundancy elimination equations along with lazy release consistency model. We implemented this optimizing compiler for both ADSM and UDSM, and run-time system for user-level cache-emulation.The run-time system runs on an SS20 workstation cluster connected with a 100BASE-TX Ethernet. Both schemes achieve a high speed-up ratio with the SPLASH-2 benchmark suite. The experimental results show that the combination of the optimizing compiler and Software DSM is very effective. The experimental results also show that the performance of the ADSM scheme is limited by the communication of unnecessary data, while that of the UDSM scheme is limited by the instrumentation overhead.
Compiling with Non-Parametric Polymorphism (Preliminary Report)
Authors: Robert Harper, Greg Morrisett
Venue:  (1994)

There is a middle ground between parametric and ad-hoc polymorphism in which a computation can depend upon a type parameter but is restricted to being defined at all types in an inductive fashion. We call such polymorphism non-parametric. We show how non-parametric polymorphism can be used to implement a variety of useful language mechanisms including overloading, unboxed data representations in the presence of ML-style polymorphism, and canonical representations of equivalent types. Moreover, we show that, by using a second-order, explicitly typed language extended with non-parametric operations, these mechanisms can be implemented without having to tag data with type information at runtime. Finally, we demonstrate that this approach retains a "phase distinction" permitting type checking and separate compilation. Our aim is to provide a unifying language, translation, and proof framework in which a variety of non-parametric mechanisms can be expressed and verified.
Mobile Agents in Autonomous Decentralized Systems
Authors: Manuel de Jesus Mendes, Flávio M. de Assis Silva
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

In this position paper the authors present their view on the convenience of applying mobile agents to ADSs. Firstly, some benefits of mobile agents that can be explored in applications are presented (section 2). Afterwards, a discussion of some issues that shall enable more effective use of mobile agents in real applications and that have impact on the definition of the scope of applicability of mobile agents to ADSs is presented (section 3). The last section (section 4) concludes the paper.
Towards a Consistent Distributed Design: A Multi-Agent Approach
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper reviews existing methods and techniques addressing the problem of mismatch control in distributed collaborative design. In order to contribute towards a more comprehensive solution a basis for a taxonomy of design mismatches is presented. The paper argues that a multi-agent approach is a more effective, and a promising, way forward towards a reliable automatic solution to the problem. An outline multi-agent architecture is proposed. The architecture assumes that the design knowledge is encapsulated within the different members of agent community. Agents are endowed with the capacity of negotiation with one another to ensure that any mismatches are detected and that a solution is proposed. The notions of proactiviness and social ability, which the agents need to exhibit, are central to this work.
A scalable method for visualising changes in portfolio data
Authors: Tim Dwyer
Venue: Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24 (2003)

In this paper techniques from multidimensional scaling and graph drawing are coupled to provide an overview-and-detail style method for visualising a high dimensional dataset whose attributes change over time. The method is shown to be useful for the visualisation of movements within a large set of fund manager's stock portfolios.
A Fully Distributed Location Management Scheme for Large PCS
Authors: Karunaharan Ratnam, Ibrahim Matta, Sampath Rangarajan
Venue:  (1999)

Abstract In [previous papers] we presented the design, specification and proof of correctness of a fully distributed location management scheme for PCS networks and argued that fully replicating location information is both appropriate and efficient for small PCS networks. In this paper, we analyze the performance of this scheme. Then, we extend the scheme in a hierarchical environment so as to scale to large PCS networks. Through extensive numerical results, we show the superiority of our scheme compared to the current IS-41 standard.
The Potential Method for Blending Surfaces and Corners
Authors: Christoph M. Hoffmann, John E. Hopcroft
Venue:  (1985)

We survey the potential method for blending implicit algebraic surfaces, summarizing and extending work previously reported. The method is capable of deriving blends for pairs of algebraic surfaces, and is guaranteed to produce blending surfaces of lowest possible degree for two quadrics in general position. We give two paradigms by which to understand the method. The first paradigm views the blends as surfaces swept out by a family of space curves. The second, more general paradigm considers the surfaces as result of deformation of a parameter space effected by substitution. The method has a general formulation based on projective parameter spaces, but is also the image under projective transformation of the simpler, affine formulation. The deformation by substitution paradigm is extended to blend blending surfaces at solid vertices without a degree penalty, under the assumption that the vertex valence has been reduced to three. It may also lead to a general solution for blending patches of algebraic surfaces that meet tangentially. A special case of this problem is solved and illustrated.
Digital hormone models for self-organization
Authors: Wei-Min Shen, Cheng-Ming Chuong, Peter Will
Venue: Proceedings of the eighth international conference on Artificial life (2002)

How do multiple elements/agents self-organize into global patterns based on local communications and interactions? This paper describes a theoretical and simulation model called "Digital Hormone Model" (DHM) for such a self-organization task. The model is inspired by two facts: complex biological patterns are results of self-organization of homogenous cells regulated by hormone-like chemical signals (Jiang et al. 1999), and distributed controls can enable self-reconfigurable agents to performance locomotion and reconfiguration (Shen, Salemi, & Will 2000; Shen, Lu, & Will 2000; Salemi, Shen, & Will 2001). The DHM is an integration and generalization of reaction-diffusion model (Turing 1952) and stochastic cellular automata (Lee et al. 1991). The movements of agents (or cells) in DHM are computed not by the Turing's differential equations, nor the Metropolis rule (Kirkpatrick & Sorkin 1995), but by stochastic rules that are based on the concentration of hormones in the neighboring space. Experimental results have shown that this model can produce results that match and predict the actual findings in the biological experiments of feather bud formation among uniform skin cells (Jiang et al. 1999). Furthermore, an extension of this model may be directly applicable to self-organization in multi-agent systems using simulated hormone-like signals.
Measuring Design Quality by Measuring Design Complexity
Authors: Michael Keating
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Chips continue to get larger and more complex, and as they do, design quality continues to become more difficult and more important. Improving quality metrics is a key to addressing this problem, both for measuring quality and for predicting design quality early in the design cycle. This paper proposes a method of quantifying design complexity, enabling design teams to produce architectures and implementations that manage complexity, and hence quality, effectively
Efficient Content-Based Event Dispatching in the Presence of Topological Reconfiguration
Authors: Gian Pietro Picco, Gianpaolo Cugola, Amy L. Murphy
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Distributed content-based publish-subscribe middlewareprovides the decoupling, flexibility, expressiveness, andscalability required by highly dynamic distributed applications,e.g., mobile ones. Nevertheless, the available systemsexploiting a distributed event dispatcher are unable to rearrangedynamically their behavior to adapt to changes in thetopology of the dispatching infrastructure.In this work, we first define a strawman solution basedon ideas proposed (but never precisely characterized) in existingwork. We then analyze this solution and achieve adeeper understanding of how the event dispatching informationis reconfigured. Based on this analysis, we modifythe strawman approach to reduce its overhead. Simulationsshow that the reduction is significant (up to 50%), and yetthe algorithm is resilient to concurrent reconfigurations.
Project 2002: Effective Project Management in Eight Steps
Authors: Stephen L. Nelson
Venue:  (2002)

:More than simply a reference to the Microsoft Project software program, this book amounts to a hybrid business/computer book. Not only are the Project software or a subset of the software features documented but also business managers are taught how to organize and manage a project using either Project 2002 Standard or Project 2002 Professional. The goal of this concise reference is to help the project manager quickly and effectively begin organizing and then managing a project.Author Biography: Stephen L. Nelson is the author of more than 100 computer books including Quicken 2002 for Dummies, QuickBooks 2001 for Dummies, and MBA 's Guide to Microsoft Excel. He lives in Redmond, Washington. 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
Guidelines for Computational Modelling in CORBA Environments
Authors: H. Korte, R. Westerga
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

Transferring the behaviour of computational design in a CORBA implementation is not always a trivial job, especially when the design incorporates the special feature of objects having multiple interfaces, such as those abundantly used in TINA specifications. This paper shows this is possible, and gives guidelines prescribing the structure of C++ objects that represents a computational object in the implementation. An example application, that includes the seven special features for which the guidelines can provide solutions, is used throughout the paper.
Bounds for Packings of Spheres in the Grassmann Manifolds
Authors: Barg A., Nogin D.
Venue:  (2000)

We derive the Varshamov--Gilbert and Hamming bounds for packings of spheres (codes) in the Grassmann manifolds over $\mathbb R$ and $\mathbb C$. The distance between two $k$-planes is defined as $\rho(p,q)=(\sin^2\theta_1+\dots+\sin^2\theta_k)^{1/2}$, where $\theta_i, 1\le i\le k$, are the principal angles between $p$ and $q$.
On the Size of Set Systems on [n] Not Containing Weak (r, \Delta)-Systems
Authors: Vojtech Rodl, Lubos Thoma
Venue:  (1996)

Let $r\ge 3$ be an integer. A weak $(r, \Delta)$-system is a family of $r$ sets such that all pairwise intersections among the members have the same cardinality. We show that for $n$ large enough, there exists a family ${\cal F}$ of subsets of $[n]$ such that ${\cal F}$ does not contain a weak $(r, \Delta)$-system and $|{\cal F}| \ge 2^{ {1\over 3} \cdot n^{1/5}\log^{4/5}(r-1)}.$ This improves an earlier result of P. Erd\H{o}s and E. Szemer\''edi.
A New Technique for Construction of Image Pyramids
Authors: Petr Vanek, Sugata Ghosal
Venue:  (1995)

A systematic graph-theoretic approach to image pyramid generation is proposed in this article that does not assume any specific pixel geometry. It is argued that requirements for construction of image pyramids is very similar to the assumptions of multigrid convergence theory. Smoothed aggregation based basis functions are employed as pyramid generating kernels. Experimental results are shown to demonstrate the effectiveness of the proposed approach.
Optimising the File Allocation of Parallel Web Server Online using Access Patterns
Authors: Jörg Jensch, Reinhard Lüling, Norbert Sensen
Venue: Proceedings of the 1998 International Conference on Parallel Processing Workshops (1998)

This paper presents a new mechanism for mapping dataitems onto the storage devices of a parallel web server. Themethod is based on careful observation of the effects thatlimit the performance of parallel web servers and by studyingthe access patterns for these servers.On the basis of these observations a graph theoretic conceptis developed and partitioningalgorithms are used to allocatethe data items. The resulting strategy is investigatedand compared to other methods using experiments and typicalaccess patterns from web servers that are in daily use.