ppxscal/embedding_network huggingface dataset:
Interactive Fusion Simulation and Visualisation on the Grid
Authors: Herbert Rosmanith, Jens Volkert, Ruben Valles, Fermin Serrano, Marcin Plociennik, Michal Owsiak
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

This paper describes the "Fusion Plasma Application" which is developed within the "Interactive European Grid" (int.eu.grid), making use of its architecture to produce interactive visualisation of a distributed simulation executing on the grid. In properly combining and, where necessary, adopting the building blocks "Migrating Desktop" (MD), "Roaming Access Server" (RAS), "Grid Visualisation Tool" (GVid) and "Grid Interactive Tool" (glogin), the int.eu.grid adds extensions for interactive visualisation to grid middleware in a novel way.
Direction of arrival estimation in partly calibrated time-varying sensor arrays
Authors: M. Pesavento
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We consider the direction finding problem in time-varying arrays composed of identically oriented subarrays displaced by unknown vector translations. A new eigenstructure-based estimator is proposed for such a class of partly calibrated sensor arrays.
Back to the shed: gendered visions of technology and domesticity
Authors: Genevieve Bell, Paul Dourish
Venue: Personal and Ubiquitous Computing (2007)

One of the tropes of the age of ubiquitous computing is the migration of computation into new spaces. Domestic environments have been a particular focus of attention for many. However, these spaces are neither empty nor neutral. They are already populated by people and practices which shape both their physical form and cultural meaning. We want to consider here some questions of technology and domesticity. In order to give some critical perspective, we want to approach domestic space from the edge, and in particular, from the shed.
Self-Diagnosing Wireless Mesh and Ad-Hoc Networks using an Adaptable Comparison-Based Approach
Authors: Mourad Elhadef, Azzedine Boukerche, Hisham Elkadiki
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

This paper considers the problem of self-diagnosis of wireless mesh networks (WMNs) and mobile ad-hoc networks (MANETs) using the comparison approach. In this approach, the network consists of a collection of n independent heterogeneous mobile or stationary hosts interconnected via wireless links, and it is assumed that at most ó of these hosts are faulty. In order to diagnose the state of the wireless mesh and ad-hoc network, tasks are assigned to pairs of hosts and the outcomes of these tasks are compared. The agreements and disagreements among hosts are the basis for identifying the faulty ones. We develop a new distributed self-diagnosis protocol, called Adaptive-DSDP, for MANETs and WMNs that identifies both hard and soft faults in a finite amount of time. We analyze the time and communication complexities of our protocol and compare it to existing self-diagnosis protocols.
On the law S(S(x, y), T(x, y)) = S(x, y) of fuzzy logic
Authors: Claudi Alsina, Enric Trillas
Venue: Fuzzy Optimization and Decision Making (2007)

Motivated by some functional models arising in fuzzy logic, when classical boolean relations between sets are generalized, we study the functional equation S(S(x, y), T(x, y)) = S(x, y), where S is a continuous t-conorm and T is a continuous t-norm. Some interesting methods for solving this type of equations are introduced.
Frontiers in Education Conference Moving from "Teacher-Centered" to "Learner-Centered" Education
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

As part of the assessment requirements for a course on software design and testing, students are required to monitor the amount of time they spent on this course on a weekly basis. Three time values are required: in-class time, solo study time and group study time (since the course requires that assignments are completed by groups of three or four students). In addition, after each assignment students have to complete a one-page report on the preceding four or five weeks summarizing their time usage including a self-evaluation or reflection. The goal is to encourage students to develop insight into their own behavior, possibly leading to improvements. Student reaction to the task has been generally unfavorable as many students feel that the task is demeaning and pointless. On the other hand, they participate as the task forms part of the course assessment and it is perceived as an easy component to satisfy. Fortunately, some students are positive about the task. These students use the task as intended to extend their understanding of their own approach to learning. One proposal for improving the task is to link it to student-prepared plans developed in advance for each assignment. 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 formal proof of a new optimal image segmentation program with hypermaps
Authors: Jean-François Dufourd
Venue: Pattern Recognition (2007)

This article presents the design of a new functional 2D image segmentation algorithm by cell merging in a subdivision, its proof of total correctness, and the derivation of an optimal imperative program. The planar subdivisions are modeled by hypermaps. The formal specifications of hypermaps and segmentation are developed in the Calculus of Inductive Constructions. The proofs are assisted by the Coq system. The final program is written in C.
Studies on a micro turbine device with both journal- and thrust-air bearings
Authors: X. C. Shan, Q. D. Zhang, Y. F. Sun, R. Maeda
Venue: Microsystem Technologies (2007)

This paper presents design, fabrication, analysis and test of a silicon-based micro turbine device that is driven by compressed air. To improve the motion stability at high rotational speed, the turbine device employs an enhanced micro air bearing system that includes both journal air bearing and thrust air bearings. The double-sides dynamic thrust air bearings are designed to support the rotor from both its top and bottom sides. The top thrust air bearing employs pump-in spiral groove configuration, and the bottom bearing uses pump-out spiral groove configuration. The dynamic journal air bearing is formed by a plain circular trench with a short journal length (L) and a narrow radial clearance (C). The critical aspect ratio (L/C) over 20:1 is realized through an optimized fabrication process. The micro turbine device has been fabricated, integrated and tested. During the test, the turbine device demonstrated stable operations at a rotational speed of 14,700&#x00a0;rpm.
An innovative approach to asynchronous learning using Mallard: application of Java applets in a freshman course
Authors: C. R. Graham
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

The goals of the authors' work have been to enhance the learning environment of their students and to increase the productivity of faculty by freeing them from the drudgery of grading homework and quizzes, as well as the time required to record and compute grades. They have achieved these goals by means of the highly interactive World Wide Web (WWW)-based learning environment provided by Mallard and by the development of several Java applets within the Mallard environment to enhance the learning process. These Java applets are the subject of this paper. They include the ability to draw timing diagrams and graphs whose data points can be communicated to the server for grading. Java applets have also been written to simulate a simple microprocessor, and a whiteboard has been implemented as an applet for synchronous communication with online tutors. The authors also present some interesting student survey results on Mallard and Web-based instruction.
Estimation of morphological degradation model parameters
Authors: T. Kanungo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Noise models are crucial for designing image restoration algorithms, generating synthetic training data, and predicting algorithm performance. However, to accomplish any of these tasks, an estimate of the degradation model parameters is essential. We describe a parameter estimation algorithm for a morphological, binary image degradation model. Inputs to the estimation algorithm are the ideal and degraded images. We search for the optimal parameter by looking for a parameter value for which the corresponding noise pattern distribution in the simulated image and the given degraded image are most similar. The parameter space is searched using the downhill simplex algorithm of Nelder and Mead (1965). We use the p-value of the Kolmogorov-Smirnov test of difference between the two pattern distributions as the objective function value. We show results of applying our algorithm on document images.
Software Development: What Is the Problem?
Authors: Raghavendra Rao Loka
Venue: Computer (2007)

Skepticism, expertise, and good management can right many software wrongs.
Guest Editor's Introduction: Rapid System Prototyping
Authors: Fabrice Kordon
Venue: IEEE Distributed Systems Online (2007)

The March, April, and May 2007 issues of IEEE Distributed Systems Online feature revised versions of the best papers presented at the 17th International IEEE Workshop on Rapid System Prototyping (RSP 06). These articles were selected by reviewers from a large selection of excellent submissions. "Gaining Insight into Executable Models during Runtime: Architecture and Mappings" by Philipp Graf and Klaus D. Müller-Glaser appears in the March issue. The article describes an extension to a model-based development approach that provides an architecture for debugging models that execute on target systems or in dedicated rapid-prototyping environments.
Calculation of radix-2 discrete multiresolution Fourier transform
Authors: X. Wen, M. Sandler
Venue: Signal Processing (2007)

This article discusses the efficient calculation of radix-2 multiresolution Fourier transform (MFT), which can also be regarded as a collection of short-time Fourier transforms (STFTs) with multiple 2-based window sizes, calculated on the same discrete-time signal. We show that by reconfiguring the (decimation-in-frequency)-fast Fourier transform (DIF-FFT) framework to adopt different internal calculations, we are able to save nearly 50% of the calculation compared with a direct DIF-FFT method. Practical issues on real signals, sliding windows and cosine-family windowing are also discussed.
Alloneword
Authors: Stan Kelly-Bootle
Venue: Queue (2007)

Errors, deceptions, and abmiguity Three years ago, to the very tick, my first Curmudgeon column appeared in ACM Queue to the rapturous, one-handed claps of the silent majority. Since then my essays have alternated intermittently with those of other grumpy contributors. With this issue (muffled drumroll), I'm proud to announce a Gore-like climate change in the regime that will redefine the shallow roots of ACJ (agile computer journalism, of which more anon). The astute ACM Queue Management (yes, there is such - you really must read the opening pages of this magazine!) has offered me the chance to go solo. For the next few Queues, at least, I am crowned King Curmudgeon, the Idi Amin of Moaners, nay, Supreme General Secretary of the Complaining Party! "I am Sir Oracle, and when I ope my lips, let no dog bark!" Or rather, under the new dispensation, I command you to bark back via curmudgeon@acmqueue.com with your own pet peeves or counter-moans, which I promise to print if printable (subject to as light an editing as the Law dictates).
A Novel Model for User Mobility in Wireless Sensor Networks
Authors: Sang-Sik Kim, Ae-Soon Park
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Wireless sensor networks generally have three kinds of objects: sensor nodes, sinks, and users that send queries and receive data via the sinks. In addition, the user and the sinks are mostly connected to each other by infrastructure networks. The users, however, should receive the data from the sinks through multi-hop communications between disseminating sensor nodes if such users move into the sensor networks without infrastructure networks. To support mobile users in wireless sensor network, previous work has studied various user mobility models. Nevertheless, such approaches are not compatible with the existing data-centric routing algorithms, and it is difficult for the mobile users to gather data efficiently from sensor nodes due to their mobility. To improve the shortcomings, we propose a view of mobility for wireless sensor networks and propose a model to support a user mobility that is independent of sinks. The proposed model, finally, is evaluated by simulation of delivery ratio, latency, and network lifetime.
Cluster Evolution and Interpretation via Penalties
Authors: Daniel Fleder, Balaji Padmanabhan
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

There are many applications where the world being interpreted via clusters can change. We present a method that discovers new clusters and describes the changes. The method works by constraining existing prototypes while penalizing changes in a variable, total number of clusters. This results in a clustering that is comparable to the old yet still flexible enough to learn new behaviors. Moreover, the results are highly interpretable. The paper offers two main contributions. One, we present a framework that distinguishes different types of change of interest. Two, we present a new cluster-based change description algorithm and test, both of which are applicable to multiple underlying clusterers.
Slicing spreadsheets: an integrated methodology for spreadsheet testing and debugging
Authors: James Reichwein, Gregg Rothermel, Margaret Burnett
Venue: Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2 (1999)

Spreadsheet languages, which include commercial spreadsheets and various research systems, have proven to be flexible tools in many domain specific settings. Research shows, however, that spreadsheets often contain faults. We would like to provide at least some of the benefits of formal testing and debugging methodologies to spreadsheet developers. This paper presents an integrated testing and debugging methodology for spreadsheets. To accommodate the modeless and incremental development, testing and debugging activities that occur during spreadsheet creation, our methodology is tightly integrated into the spreadsheet environment. To accommodate the users of spreadsheet languages, we provide an interface to our methodology that does not require an understanding of testing and debugging theory, and that takes advantage of the immediate visual feedback that is characteristic of the spreadsheet paradigm.
Identifying Success and Tragedy of FLOSS Commons: A Preliminary Classification of Sourceforge.net Projects
Authors: Robert English, Charles M. Schweik
Venue: Proceedings of the First International Workshop on Emerging Trends in FLOSS Research and Development (2007)

Free/Libre and Open Source Software (FLOSS) projects are a form of commons where individuals work collectively to produce software that is a public, rather than a private, good. The famous phrase "Tragedy of the Commons" describes a situation where a natural resource commons, such as a pasture, or a water supply, gets depleted because of overuse. The tragedy in FLOSS commons is distinctly different -- it occurs when collective action ceases before a software product is produced or reaches its full potential. This paper builds on previous work about defining success in FLOSS projects by taking a collective action perspective. We first report the results of interviews with FLOSS developers regarding our ideas about success and failure in FLOSS projects. Building on those interviews and previous work, we then describe our criteria for defining success/tragedy in FLOSS commons. Finally, we discuss the results of a preliminary classification of nearly all projects hosted on Sourceforge.net as of August 2006.
QoS-LI: QoS Loss Inference in Disadvantaged Networks
Authors: Vidyaraman Sankaranarayanan, Shambhu Upadhyaya, Kevin Kwiat
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Quality of Service (QoS) of disadvantaged networks is considered from a purely network standpoint in existing works. Adversarial intervention in such networks is not analyzed, nor is it possible to infer if a QoS loss is benign or otherwise. In this paper, we present a QoS loss inference module, where the end nodes can infer the nature of a QoS loss in a non-intrusive manner. The objective of this work is to develop a conceptual framework to model the inference module, and investigate its integration into existing platforms. We abstract the problem of link selection (as opposed to route selection) in disadvantaged networks as a resource selection problem, and apply a game theoretic model to set limits on the rate of convergence. Using this convergence rate, our loss inference model can distinguish between adversarial network manipulation and benign network loss. Such a module will help manage the operation of disadvantaged networks in a more effective manner in critical networks.
Hierarchical Spatial Hashing for Real-time Collision Detection
Authors: Mathias Eitz, Gu Lixu
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

We present a new, efficient and easy to use collision detection scheme for real-time collision detection between highly deformable tetrahedral models. Tetrahedral models are a common representation of volumetric meshes which are often used in physically based simulations, e.g. in virtual surgery. In a deformable models environment collision detection usually is a performance bottleneck since the data structures used for efficient intersection tests need to be rebuilt or modified frequently. Our approach minimizes the time needed for building a collision detection data structure. We employ an infinite hierarchical spatial grid in which for each single tetrahedron in the scene a well fitting grid cell size is computed. A hash function is used to project occupied grid cells into a finite 1D hash table. Only primitives mapped to the same hash index indicate a possible collision and need to be checked for intersections. This results in a high performance collision detection algorithm which does not depend on user defined parameters and thus flexibly adapts to any scene setup.
Services Driven Cross-Layer Routing Protocol for Mobile Ad Hoc Networks
Authors: Jun Ren, Xiaolin Zhang, Yunhui Liu
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

A novel services driven routing protocol for mobile ad hoc network is presented. The protocol is based on AODV, cross-layer model and power control. In this paper services are classified to four types using a time management method. Service type in application layer drives the transmit power in physical layer by a common register in cross-layer model. At the same time service type is also induced to network layer. The experiment is done in an ad hoc network from 10*10 to 100*100 nodes in ns2. It is shown that the protocol can improve network performance in packet loss, delay time and transmit power obviously.
The power of slicing in internet flow measurement
Authors: Ramana Rao Kompella, Cristian Estan
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

Network service providers use high speed flow measurement solutions in routers to track dominant applications, compute traffic matrices and to perform other such operational tasks. These solutions typically need to operate within the constraints of the three precious router resources - CPU, memory and bandwidth. Cisco's Net-Flow, a widely deployed flow measurement solution, uses a configurable static sampling rate to control these resources. In this paper, we propose Flow Slices, a solution inspired from previous enhancements to NetFlow such as Smart Sampling [8], Adaptive NetFlow (ANF) [10]. Flow Slices, in contrast to NetFlow, controls the three resource bottlenecks at the router using separate "tuning knobs"; it uses packet sampling to control CPU usage, flow sampling to control memory usage and finally multi-factor smart sampling to control reporting bandwidth. The resulting solution has smaller resource requirements than current proposals (up to 80% less memory usage than ANF), enables more accurate traffic analysis results (up to 10% less error than ANF) and balances better the error in estimates of byte, packet and flow counts (flow count estimates up to 8 times more accurate than after Smart Sampling). We provide theoretical analyses of the unbiasedness and variances of the estimators based on Flow Slices and experimental comparisons with other flow measurement solutions such as ANF.
Performance analyses of the chaotic spread spectrum sequences with finite precision
Authors: Cai Guoquan, Yu Dapeng, Song Wentao
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper investigates the effect of different precision on the correlation properties of Chebyshev-map chaotic spread-spectrum sequences. For the first time, it defines the finite precision threshold term and gives the mathematical description of the relationship between the finite precision thresholds of the Chebyshev-map chaotic spread-spectrum sequences and their lengths. It analyzes the effect of the selection of iteration seeds on the correlation properties of the sequences when the calculation precision is lower than the finite precision threshold and proposes the criterion of seed selection. The study results of the paper provide the basis for the application study of chaotic spread-spectrum sequences.
Mobile Social Software - Potentials and Limitations of Enabling Social Networking on Mobile Devices
Authors: Oliver Bohl, Shakib Manouchehri, Sebastian Ammermueller, Oliver Gerstheimer
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

Driven by the increased usage of information and communication technology (ICT) the typical behavior and the acting of users in private as well as in professional settings changed dramatically over the last years. Modern applications of ICT are seen as instruments to fulfill the wants and needs of heterogeneous user groups. Above of all, the event of the Internet as well as the omnipresent availability of computing systems and mobile technologies altered the communication between users. For instance nowadays a lot of them regularly use web-based search engines to search for information, they chat with friends, upload and share pictures which they took for instance with their mobile phone camera, and last but not least they download and share music files to listen to them on their mobile devices. Against this background the users already experience the medial convergence which they have to create actively.
Constructing unconditionally time-stable numerical solutions for mixed parabolic problems
Authors: R. Aloy, M. C. Casabán, L. Jódar
Venue: Computers Mathematics with Applications (2007)

This paper proposes a new numerical method based on an implicit difference scheme and the Fourier method which is applied to construct numerical solutions of mixed parabolic problems. The method is consistent and unconditionally time stable.