ppxscal/embedding_network huggingface dataset:
The Architecture of the Butterfly Plus Parallel Processor
Authors: David Kotz
Venue:  (1988)

This paper investigates the architecture of the Butterfly Plus Parallel processor, an MIMD shared-memory machine based on the Motorola MC68020 microprocessor and a multi-stage interconnection network. The primary emphasis is on the interaction of components of the system rather than on the details of its components, especially the standard Motorola components. However, particular attention is paid to the memory management issues since this is the significant difference between the Butterfly Plus and its predecessor, the Butterfly Parallel Processor. 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
Design and implementation of a real-time switch for segmented Ethernets
Authors: C. Venkatramani, Tzi-cker Chiueh
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

Providing network bandwidth guarantees over an Ethernet requires coordination of the network nodes for traffic prioritization such that real-time data can have deterministic access to the network. We have shown previously how RETHER, a software based token passing protocol can efficiently provide real-time support over a single shared Ethernet segment. This work extends the token passing mechanism into a switched, multi-segment Ethernet environment. This paper describes the detailed design issues, their solutions, and a fully operational switch implementation built into the FreeBSD kernel. By testing the protocol independently and as the underlying network protocol of the Stony Brook Video Server, we have verified that the bandwidth guarantees are successfully provided, with relatively low run-time overhead, for real-time connections crossing multiple Ethernet segments. This paper also provides a comprehensive performance evaluation of the prototype.
Comparison of Two-Dimensional FFT Methods on the Hypercube: The Choice Between Strips and Patches
Authors: Clare Chu
Venue:  (1987)

Complex two-dimensional FFT''s up to size 256 X 256 points were implemented on the Intel iPSC/System 286 hypercube with emphasis on comparing the effects of data mapping, data transposition, and distributed FFT''s. Comparison is based on partitioning the data into either strips or patches and three distinct methods are discussed. Of the two strips methods, the Transpose-Split implementation involves local independent FFT computations in both directions with an intervening transpose, while the Local-Distributed method performs local FFT''s in one direction followed by distributed FFT''s in the other. The patch or Block method partitions the matrix in submatrices and maps the ($i,j$)th block into node $i \hat j$ ($\hat$ denoting concatenation of binary numbers). Both the row-wise FFT''s and the column-wise FFT''s require inter-node communication for the distributed butterfly computations. Timing results show that on the Intel iPSC/System 286, there is hardly a difference between the three methods. This is due primarily to the inadequacies of Intel communication handling and its inability to overlap communication and computation as well as a lack of vector boards. A model follows where several important factors such as vectorization and communication complexity are considered. While timing results show that on a vectorized hypercube with ideal synchronization of communication and computation the Block method is asymptomatically the fastest. The conclusion is that this problem is highly system dependent and therefore no sweeping recommendations can be made. 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
Microsoft Office System Step by Step 2003
Authors: Curtis Frye
Venue:  (2003)

Build exactly the skills you need to succeed with Microsoft Office 2003-one step at a time! Self-paced lessons and exercises teach you to easily create great documents, spreadsheets, e-mail messages, slide presentations, databases, Web sites, and more.
PhotoShop 7 Upgrade Essentials, 1 edition
Authors: Vicki Loader, Barry Huggins
Venue:  (2002)

:By the end of this book, you will be fully familiar with all the fundamentals of Photoshop 7, and ready to start exploring the new creative avenues it has opened up. It's the fastest way to start getting the most out of Adobe's brilliant image manipulation too: Photoshop - which still stands head and shoulders above the rest!And there's more! We've also included information about upgrading from earlier versions - not just version 6 and a 'graveyard': a list of the options that have been laid to rest... Author Biography:
Electronic Mail and Organizational Knowledge: Media Use in a Global Corporation
Authors: Robert E. Kraut, Paul Attewell
Venue:  (1993)

Several attributes of communication media influence the costs of their use and utility, and these in turn have the potential to influence their patterns of use and organizational consequences. The goal of this paper is to examine some of these media attributes and their consequences in a large international firm. The data come from a survey of 973 employees of a multi-national corporation. They show that the distinguishing attributes of different media are not dominant: people whose jobs require substantial communication are likely to communicate heavily using all media available to them. The best predictor of which medium is used is the extent to which the medium can put people into contact with their important communication partners. When the job is the unit of analysis, the data from this survey do not support the media richness hypothesis --- that use is determined by the fit between the richness of a medium and the degree to which people have complex, ambiguous, or social jobs. Yet when one takes a single conversation as a unit of analysis, the data show that media differing in interactivity and expressiveness are valuable for different tasks. Employees who use electronic mail extensively are better informed about their company and more committed to its management''s goals. One reason for their superior knowledge about the organization seems to be that electronic mail promotes "information spillover" from a focal recipient to others less directly interested in a message, without subjecting these marginal parties to the burdens of interruption and information overload.
A Rational Spline for Visualizing Positive Data
Venue: Proceedings of the International Conference on Information Visualisation (2000)

A piecewise rational cubic spline has been introduced to visualize the positive data in its natural form. It is attempted that the spline method preserves the shape of the data when it is positive. The spline representation is interpolatory and applicable to the scalar valued data. The shape parameters, in the description of the rational cubic, have been constrained in such a way that they control the shape of the curve to avoid any noise. As far as visual smoothness is concerned, the curve scheme under discussion is C1.
Culture and website usability: strategies for internationalisation and localisation
Authors: Andy Smith, Tim French, Shaíley Minocha
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Introduces theories that underpin global website design and summarises practical approaches. Will allow those working on international website development to engage, in a practically oriented interactive environment, and develop good practice.
A Hybrid Voting Algorithm
Authors: B J Dugan
Venue:  (1988)

We investigate the use of a hybrid between the {\em available copies} method and {\em voting with witnesses} to maintain consistency in a replicated file system. In such a system, the available copies method is augmented with witnesses, and a simple static voting algorithm is used. We show that high levels of availability are possible with only two copies, with the added advantage that the consistency of the file system is maintained even if the network is partitioned. We also discuss the transformation of copies and witnesses into the other, as needed. The system is analyzed via a Stochastic Petri net model.
Distributed Interoperable Virtual Environments
Authors: Michael Capps, David Stotts, Jim Duff, Jim Purtilo
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

This paper exhibits the use of existing software bus technology in interconnecting Virtual-Reality Environment (VE) Software. Interoperability and application construction from heterogeneous modules are well-explored topics of distributed systems. A joint project using the Polylith software bus from the University of Maryland and VE software from the UNC graphics lab has shown the utility of composing existing applications as opposed to making extensive individual modifications. This paper claims only a unique application of these methods to a new client area. Multi-user VE walkthroughs (software navigators) are an exciting new area in graphics software but we see that with the rapid development of graphics technology, next-generation applications (including multi-user systems) are commonly redesigned from the ground up. Here we see an excellent opportunity to examine module reusability, with proven software, in a new application area. As well, we hope our experiments will likely lead to conclusions about VE programming abstractions and produce development methods for making easily interoperable next-generation VE applications.
Improved Tracking of Multiple Humans with Trajectory Predcition and Occlusion Modeling
Authors: Romer Rosales, Stan Sclaroff
Venue:  (1998)

Abstract A combined 2D, 3D approach is presented that allows for robust tracking of moving bodies in a given environment as observed via a single, uncalibrated video camera. Tracking is robust even in the presence of occlusions. Low-level features are often insufficient for detection, segmentation, and tracking of non-rigid moving objects. Therefore, an improved mechanism is proposed that combines low-level (image processing) and mid-level (recursive trajectory estimation) information obtained during the tracking process. The resulting system can segment and maintain the tracking of moving objects before, during, and after occlusion. At each frame, the system also extracts a stabilized coordinate frame of the moving objects. This stabilized frame is used to resize and resample the moving blob so that it can be used as input to motion recognition modules. The approach enables robust tracking without constraining the system to know the shape of the objects being tracked beforehand; although, some assumptions are made about the characterstics of the shape of the objects, and how they evolve with time. Experiments in tracking moving people are described.
Optical Phase Conjugation in Nuclear Magnetic Resonance: Laser NMR Spectroscopy
Authors: M. W. Evans
Venue:  (1990)

The role of optical phase conjugation in nuclear magnetic resonance (NMR) spectroscopy is discussed theoretically in terms of the extra quantised angular momentum J(pi), produced by the conjugate product pi of a powerful pump laser such as a Nd:YAG. Elementary first order time dependent perturbation theory is used to derive an expression for a novel molecular property Yij tensor which mediates the induction by pi of an orbital molecular magnetic moment M(pi), which couples in to the spin magnetic moment of the nucleus. The tensor Yij is expressed in terms of the product of matrix elements of a transition molecular orbital magnetic moment multiplied by matrix elements of the dynamical molecular electronic orbital polarisability, a quantity which mediates the effect of pi on the interaction hamiltonian. It is shown that the conventional NMR detail splits, according to Clebsch Gordan and Lande coupling between J(pi) and N, the nuclear spin quantum number, a potentially useful phenomenon.
Video cataloguing and browsing
Authors: Jeff E. Tandianus, Andrias Chandra, Jesse S. Jin
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

Videos contain rich information. Until recently, information within a video had been largely left under-utilized, with fast forward/rewind as the most popular method of accessing video content. This is no longer sufficient however, as more and more users demanded the flexibility and ability to access video content selectively. Unlike textual information however, video bits do not convey same level of meaning as text do. Therefore, we have to use metadata to describe the structured information within videos.One project, ViMeta-Vu or Video Metadata Viewer, was undertaken to provide users with such content-based video access. It represented video using fixed three-level hierarchical structure. Users can access and retrieve specific video information through browsing of the metadata.This paper will discuss various ways of improving the existing system. It proposes a more generic hierarchical structure using XML to represent the metadata, which will facilitate additional query methods. This paper also proposes additional query methods utilizing visual features of key frames in the video. The queries implemented include structural browsing, query by feature, query by selection and query by keyword.
Scheduling Using Genetic Algorithms
Authors: Ursula Fissgus
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

We consider the scheduling of mixed task and data parallel modules comprising computation and communication operations. The program generation starts with a specification of the maximum degree of task and data parallelism of the method to be implemented. In several derivation steps, the degree of parallelism is adapted to a specific distributed memory machine.We present a scheduling derivation step based on the genetic algorithm paradigm. The scheduling takes not only decisions on the execution order (independent modules can be executed consecutively by all processors available or concurrently by independent groups of processors) but also on appropriate data distributions and task implementation versions. We demonstrate the efficiency of the algorithm by an example from numerical analysis.
Meme Media and Meme Market Architectures: Knowledge Media for Editing, Distributing, and Managing Intellectual Resources
Authors: Yuzuru Tanaka
Venue:  (2003)

:In this book, Yuzuru Tanaka proposes a powerful new paradigm: that knowledge media, or "memes," operate in a way that closely resembles the biological function of genes, with their network publishing repository working as a gene pool to accelerate the evolution of knowledge shared in our societies. In Meme Media and Meme Market Architectures: Knowledge Media for Editing, Distributing, and Managing Intellectual Resources, Tanaka outlines a ready-to-use knowledge media system, supplemented with sample media objects, which allows readers to experience the knowledge media paradigm.
Clustering Algorithms for Content-Based Publication-Subscription Systems
Authors: Anton Riabov, Zhen Liu, Joel L. Wolf, Philip S. Yu, Li Zhang
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

We consider efficient communication schemes based on both network-supported and application-level multicast techniques for content-based publication-subscription systems. We show that the communication costs depend heavily on the network configurations, distribution of publications and subscriptions. We devise new algorithms and adapt existing partitional data clustering algorithms. These algorithms can be used to determine multicast groups with as much commonality as possible, based on the totality of subscribers' interests. They perform well in the context of highly heterogeneous subscriptions, and they also scale well. An efficiency of 60% to 80% with respect to the ideal solution can be achieved with a small number of multicast groups (less than 100 in our experiments). Some of these same concepts can be applied to match publications to subscribers in real-time, and also to determine dynamically whether unicast, multicast or broadcast information about the events over the network to the matched subscribers. We demonstrate the quality of our algorithms via simulation experiments.
Wavelet Multifractal Modeling for Network Traffic and Queueing Analysis
Authors: Xing Lu, Ke Wang, Huijing Dou
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

In this paper, we give a wavelet-based model of network traffic, which exhibits multifractalcharacter. The discovery of the multifractal nature of traffic has made new models and analysis tools for traffic essential, since self-similar or long-range Dependence (LRD) models are far too optimistic in their predictions of performance. Short-range Dependence (SRD) is must be considered especially in flow control (FC) and CRC design. We find that the wavelet-based model can capture important fractal properties like multi-scale variability and bursting that deleteriously affect performance. Experiments and queuing analysis is performed and the results show that the model is matched well with the real data.
A New Lower Bound for the Bipartite Crossing Number withApplications
Authors: Shahrokhi Farhad, Sykora Ondrej, Szekely Laszlo A., Vrto Imrich
Venue:  (1998)

Let $G$ be a connected bipartite graph.% on $n$-vertices. We give a short proof, using a variation of Menger''s Theorem, for a new lower bound which relates the bipartite crossing number of $G$, denoted by $bcr(G)$, to the edge connectivity properties of $G$. The general lower bound implies a weaker version of a very recent result, establishing a bisection based lower bound on $bcr(G)$ which has algorithmic consequences. Moreover, we show further applications of our general method to estimate $bcr(G)$ for ``well structured'''' families of graphs, for which tight isoperimetric inequalities are available. For hypercubes and 2-dimensional meshes, the upper bounds (asymptotically) are within multiplicative factors of $4$ and $2$, from the lower bounds, respectively. The general lower bound also implies a lower bound involving eigenvalues of $G$.
Automatic Synthesis of Controllers from Formal Specifications
Authors: Enrico Tronci
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

Many safety critical reactive systems are indeed embedded control systems. Usually a control system can be partitioned into two main subsystems: a controller and a plant. Roughly speaking: the controller observes the state of the plant and sends commands (stimulus) to the plant to achieve predefined goals.We show that when the plant can be modeled as a deterministic Finite State System (FSS) it is possible to effectively use formal methods to automatically synthesize the program implementing the controller from the plant model and the given formal specifications for the closed loop system (plant + controller). This guarantees that the controller program is correct by construction. To the best of our knowledge there is no previously published effective algorithm to extract executable code for the controller from closed loop formal specifications.We show practical usefulness of our techniques by giving experimental results on their use to synthesize C programs implementing optimal controllers (OCs) for plants with more than $10^{9}$ states.
Ontology Based Personalized Search
Authors: Alexander Pretschner, Susan Gauch
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

With the exponentially growing amount of information available on the Internet, the task of retrieving documents of interest has become increasingly difficult. Search engines usually return more than 1,500 results per query, yet out of the top twenty results, only one half turn out to be relevant to the user. One reason for this is that Web queries are in general very short and give an incomplete specification of individual users' information needs. This paper explores ways of incorporating users' interests into the search process to improve the results. The user profiles are structured as a concept hierarchy of 4,400 nodes. These are populated by "watching over a user's shoulder" while he is surfing. No explicit feedback is necessary. The profiles are shown to converge and to reflect the actual interests quite well. One possible deployment of the profiles is investigated: re-ranking and filtering search results. Increases in performance are moderate but noticeable and show that fully automatic creation of large hierarchical user profiles is possible.
On Using a Benchmark to Evaluate C++ Extractors
Authors: Susan Elliott Sim, Richard C. Holt, Steve Easterbrook
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

In this paper, we take the concept of benchmarking as used extensively in computing and apply it to evaluating C++ fact extractors. We demonstrated the efficacy of this approach bydeveloping a prototype benchmark, CppETS 1.0 (C++ Extractor Test Suite, pronounced see-pets) and collecting feedback in a workshop setting. The CppETS benchmark characterises C++ extractors along two dimensions: Accuracy and Robustness. It consists of a series of test buckets that contain small C++ programs and related questions that pose different challenges to the extractors. As with other research areas, benchmarks are best developed through technical work and consultation with a community, so we invited researchers to apply CppETS to their extractors and report on their results in a workshop. Four teams participated in this effort, evaluating Ccia, cppx, the Rigi C++ parser, and TkSee/SN. They found that CppETS gave results that were consistent with their experience with thesetools and therefore had good external validity. Workshop participants agreed that CppETS was an important contribution to fact extractor development and testing. Further efforts to make CppETS a widely-accepted benchmark will involve technical improvements and collaboration with the broader community.
Multivariate visualization with data fusion
Authors: Pak Chung Wong, Harlan Foote, David L. Kao, Ruby Leung, Jim Thomas
Venue: Information Visualization (2002)

We discuss a fusion-based visualization method to analyze a multivariate climate dataset and its metadata. The primary difference between a conventional visualization and a fusion-based visualization is that the former draws on a single image whereas the latter draws on multiple see-through layers, which are then overlaid on each other to form the final visualization. We propose optimized colormaps to highlight subtle features that would not be shown with conventional colormaps. We present fusion techniques that integrate multiple single-purpose visualization techniques into the same viewing space. Our highly flexible fusion approach allows scientists to explore multiple parameters concurrently by mixing and matching images without frequently reconstructing new visualizations from the data for every possible combination. Although our primary visualization application is climate modeling, we show with examples that our fundamental design - fusing layers of data images for multivariate visualization - can be generalized for other information visualization applications.