ppxscal/embedding_network huggingface dataset:
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
Authors: Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1 - o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, under both types of node failure. We finish the paper by demonstrating that our models match simulations very well and that dynamic P2P systems are extremely resilient under node churn as long as the neighbor replacement delay is much smaller than the average user lifetime.
Data sonification from the desktop: Should sound be part of standard data analysis software?
Authors: John H. Flowers, Dion C. Buhman, Kimberly D. Turnage
Venue: ACM Transactions on Applied Perception (TAP) (2005)

The design of auditory formats for data display is presently focused on applications for blind or visually impaired users, specialized displays for use when visual attention must be devoted to other tasks, and some innovative work in revealing properties of complex data that may not be effectively rendered by traditional visual means. With the availability of high-quality and flexible sound production hardware in standard desktop computers, the potential exists for using sound to represent characteristics of typical &ldquo;small and simpl&rdquo; samples of data in routine data inspection and analysis. Our research has shown that basic properties of simple functions, distribution properties of data samples, and patterns of covariation between two variables can be effectively displayed by simple auditory graphs involving patterns of pitch variation over time. While such developments have implications for specialized applications and populations of users, these displays are easily comprehended by normal users with minimal practice. Providing further software enhancement to encourage exploration of data representation by sound may lead to a variety of useful creative developments in data display technology.
The variety of information society development paths in central Europe
Authors: Hans van Zon
Venue: AI Society (2005)

Mainly on the basis of the eEurope+surveys the variety of Information Society developments paths in Central European countries is analysed, focusing on ICT infrastructure, Internet usage, e-commerce and digital divides. Despite the big progress made by the Central European countries since transition began, most of these countries lag behind the EU-15 average on most Information Society indicators. The variety within Central Europe is enormous, with Slovenia and Estonia close to main-stream Europe and, on the other hand, Bulgaria, Romania and Hungary lagging far behind. In most surveyed countries fixed telephone line penetration is stagnating or declining on a rather low level, putting a break on IS development. This makes alternative access devices to Internet, such as cable TV modem, even more important.
Simulation as a process
Authors: Michael F. Morris
Venue: ACM SIGSIM Simulation Digest (1972)

Simulation is too often viewed as an entity: a self-contained task that could be compared with "coding" a computer program. It is more accurate and far more useful to view simulation as a continuum of tasks: a process.
yagg: an easy-to-use generator for structured test inputs
Authors: David Coppit, Jiexin Lian
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Automated testing typically uses specifications to drive the generation of test inputs and/or the checking of program outputs. Many software systems have structurally complex inputs that cannot be adequately described using simple formalisms such as context-free grammars. In order to generate such inputs, many automated testing environments require the user to express the structure of the input using an unfamiliar formal notation. This raises the cost of employing automated testing, thereby offsetting the benefits gained. We present yagg (yet another generator-generator), a tool that allows the programmer to specify the input using a syntax very similar to that of LEX and YACC, widely used scanner and parser generators. yagg allows the user to bound the input space using several different techniques, and generates an input generator that systematically enumerates inputs. We evaluate the ease of use and performance of the tool relative to a model checker-based generator used in previous research. Our experiences indicate that yagg generators can be somewhat slower, but that the ease-of-use afforded by the familiar syntax may be attractive to users.
Strong and Auxiliary Forms of the Semi-Lagrangian Method for Incompressible Flows
Authors: D. Xiu, S. J. Sherwin, S. Dong, G. E. Karniadakis
Venue: Journal of Scientific Computing (2005)

We present a review of the semi-Lagrangian method for advection---diffusion and incompressible Navier---Stokes equations discretized with high-order methods. In particular, we compare the strong form where the departure points are computed directly via backwards integration with the auxiliary form where an auxiliary advection equation is solved instead; the latter is also referred to as Operator Integration Factor Splitting (OIFS) scheme. For intermediate size of time steps the auxiliary form is preferrable but for large time steps only the strong form is stable.
Landmine detection and classification through hybrid neural networks and fuzzy set
Authors: Nirmal K. Bose
Venue:  (2005)

Unlike conventional weapons, the buried landmine, if not removed, remains a threat. The clearance of anti-personnel landmine has become an important issue in military, economic, and especially humanitarian concerns worldwide. Traditionally, the landmine clearance is conducted by human expert or animal. With the advance of technology, various detection and classification strategies and sensors have been proposed to provide better solutions. The research conducted in the areas of landmine detection is voluminous. This work seeks to focus on improving the detection and classification of landmine by applying neural networks and fuzzy set theory. The phase information in scattering parameters dataset measured by separated aperture sensor and ignored in previous research is shown to be valuable with proper selection of neural network model capable of handling complex-valued data. By using the complex-operator and complex chain rule, a simplified derivation of the back-propagation learning method is constructed. A two-stage hybrid neural network architecture, combining a complex-valued feedforward neural network and a self-organizing feature map, is proposed to classify the types of landmine by integrating fuzzy information at pixel level. From the proposed architecture, a new technique using self-organizing feature map to elicit fuzzy membership function for classification from data with labelling information is discovered.
Storage-based file system integrity checker
Authors: Mohammad Banikazemi, Dan Poff, Bulent Abali
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

In this paper we present a storage based intrusion detection system (IDS) which uses time and space efficient point-in-time copy and performs file system integrity checks to detect intrusions. The storage system software is enhanced to keep track of modified blocks such that the file system scan can be performed more efficiently. Furthermore, when an intrusion occurs a recent undamaged copy of the storage is used to recover the compromised data.
Process support to help novices design software faster and better
Authors: Aaron G. Cass, Leon J. Osterweil
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

In earlier work we have argued that formal process definitions can be useful in improving our understanding and performance of software development processes. There has, however, been considerable sentiment that formalized processes cannot capture the creative process of software design. This paper describes our experimentation with the hypothesis that both design speed and design quality can be improved through the use of formalized process definitions. Our experimentation supports this hypothesis.
Multiple gate devices: advantages and challenges
Authors: T. Poiroux, M. Vinet, O. Faynot, J. Widiez, J. Lolivier, T. Ernst, B. Previtali, S. Deleonibus
Venue: Microelectronic Engineering (2005)

As device scaling is entering the sub-25nm range, multiple gate device architectures are needed to fulfill the ITRS requirements, since they offer a greatly improved electrostatic control of the channel. However, practical realization of multiple gate devices face with technological issues, mainly linked to the use of very thin films or very narrow active areas. On the other hand, these architectures are very likely to allow the performance improvement trend down to the sub-10nm regime and can offer new circuit design opportunities.
Supporting Presentation Techniques based on Virtual Humans in Educational Virtual Worlds
Authors: Luca Chittaro, Lucio Ieronutti, Sara Rigutti
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Educational Virtual Worlds (EVWs) allow one to circumvent physical, safety, and cost constraints that often affect real-world training and learning scenarios. Virtual humans can improve the effectiveness of an EVW e.g., by explaining and demonstrating to the user procedural tasks and communicating with learners in a natural way by exploiting both verbal and nonverbal communication. However, choosing how the learning material has to be presented to the learner and how to employ the virtual human is influenced by different factors, ranging from available technology (e.g., bandwidth, graphics hardware, installed software) to learner's profile (e.g., physical and/or cognitive disabilities, spatial abilities, 2D/3D navigation expertise). The system we present in this paper flexibly supports different presentation techniques employing a virtual human into an EVW. The different capabilities of the system are illustrated, motivated and discussed.
Computer lab usage by rural elementary classroom teachers
Authors: Wanda L. Honey
Venue:  (2005)

The purpose of this study is to determine the current use and utilization of computer labs and to examine variables that affect lab usage, specifically instructional (i.e., time-on-task and student diversity) and technological competence, training, and institutional support were also examined. Public school teachers (N = 230) from rural Illinois elementary schools were surveyed to collect data regarding computer lab usage. The rate of return was 60%. Results indicated that there was a significant relationship between instructional competency and computer applications competency and the number of minutes spent in the computer lab. The more confident a teacher felt about his/her computer instruction and application skills the more minutes he/she spent in the computer lab. Training and institutional support was not related to the number of minutes a teacher spent in the lab. Teachers who had the support of a technology teacher spent significantly more time in the lab. In addition, there were significant differences between teachers who went to the lab and those who did not go at all in their levels of perceived competence in instruction and computer application skills. Those who did not go to the lab felt less competent, instructionally and technologically, and less well-trained. Open-ended responses revealed some of the same concerns in terms of technological competency along with time/availability of lab, training, and institutional support issues that were mentioned. Training issues included a need for more training (hardware and software troubleshooting, and teaching computer dependent lessons), competency (managing a diverse group of students, maintaining a lab classroom, providing individual instruction in a lab situation, whole class instruction in a lab, and managing hardware and software problems), and institutional support (training opportunities, help in lab, functioning hardware and software, and money for updated hardware and software). The 21 respondents that gave positive responses to computer lab usage mentioned that they were well trained/very comfortable in the lab, had a computer assistant in the lab, had a good experience in the lab, felt the lab was of high importance, or used classroom or other computers.
Selectors Make Set-Based Analysis Too Hard
Authors: Philippe Meunier, Robert Bruce Findler, Paul Steckler, Mitchell Wand
Venue: Higher-Order and Symbolic Computation (2005)

A set-based program analysis establishes constraints between sets of abstract values for all expressions in a program. Solving the system of constraints produces a conservative approximation to the program's runtime flow of values.Some practical set-based analyses use explicit selectors to extract the relevant values from an approximation set. For example, if the analysis needs to determine the possible return values of a procedure, it uses the appropriate selector to extract the relevant component from the abstract representation of the procedure.In this paper, we show that this selector-based approach complicates the constraint solving phase of the analysis too much and thus fails to scale up to realistic programming languages. We demonstrate this claim with a full-fledged value flow analysis for case-lambda, a multi-branched version of lambda. We show how both the theoretical underpinnings and the practical implementation become too complex. In response, we present a variant of set-based closure analysis that computes equivalent results in a much more efficient manner.
Gossip-based Multicast Loss Recovery Mechanisms in Group Key Distribution
Authors: Yan Yao, Weiming Fu, Shiyong Zhang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Group key distribution is faced with two important problems, i.e. reliability and scalability, to support security multicast for large and dynamic groups. With group member increasing, traditional reliable multicast protocol can not deal with them fully. In this paper, we provide gossip-based group key distribution idea for wide-area dissemination. It is a gossip-based loss recovery control mechanism, which can provide a probabilistic reliable guarantee for information dissemination. To achieve full reliability, we provide three layers protocol model in group key distribution. One is best effect layer, which provides unreliable dissemination. Other is gossip-based loss recovery layer, which provides probabilistic reliable guarantee. Last is sync-based layer, which provide deterministic loss recovery. We integrate probabilistic loss recovery method with deterministic one. To evaluate the effectiveness of gossip technique in scalable and reliable multicast protocols, we compare gossip protocol with other reliable multicast protocols. Experimental result shows that gossip protocol has better scalability than others.
Color science and color appearance models for CG, HDTV, and D-CINEMA
Authors: Charles Poynton, Garrett Johnson
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

This course introduces the science behind image digitization, tone reproduction, and color reproduction in computer generated imagery (CGI), HDTV, and digital cinema (D-cinema). We detail how color is represented and processed as images are transferred between these domains. We detail the different forms of nonlinear coding ("gamma") used in CGI, HDTV, and D-cinema. We explain why one system's RGB does not necessarily match the RGB of another system. We explain color specification systems such as CIE XYZ, L*a*b*, L*u*v*, HLS, HSB, and HVC. We describe why the coding of color image data has a different set of constraints than color specification, and we detail color image coding systems such as RGB, R'G'B', CMY, Y'CBCR, and DPX/Cineon. We explain color measurement instruments such as densitometers and colorimeters, and we explain monitor calibration. We explain how color management technology works, and how it is currently being used in motion picture film production (both animation and live action).Reproducing the tristimulus numbers of classical color science only reproduces colors accurately in an identical viewing environment. If the viewing situation changes, color is not completely described by numbers. In applying color science to image reproduction, we wish to reproduce images in environments where angular subtense, background, surround, and ambient illumination may differ from the conditions at image origination. Recent advances in color appearance modelling allow us to quantify the alterations necessary to reproduce color appearance in different conditions. We will introduce the theory and standards of color appearance models. We will then describe the application of color science and color appearance models to commercial motion imaging in computer graphics, video, HDTV, and D-cinema.
A Hardware-Accelerated Framework with IP-Blocks for Application in MPEG-4
Authors: Ihab Amer, Choudhury A. Rahman, Tamer Mohamed, Mohammed Sayed, Wael Badawy
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In this paper we present a hardware-accelerated framework and hardware blocks for MPEG-4 Part 10 IP-quality assessment. We give examples of various IP-blocks that have been designed and tested on the integration platform. The hardware-accelerated framework enabled us to asses their quality along with the MPEG-4 Part 10 software reference model.
A Circuit Level Fault Model for Resistive Shorts of MOS Gate Oxide
Authors: Xiang Lu, Zhuo Li, Wangqi Qiu, D. M. H. Walker, Weiping Shi
Venue: Proceedings of the Fifth International Workshop on Microprocessor Test and Verification (2004)

Previous researchers in logic testing focused on shorts in MOS gate oxides that have zero-resistance. However, most shorts are resistive and may cause delay faults. In this paper, we propose a simple and realistic delay fault model for gate oxide shorts. A reasonably accurate method is proposed to compute delay change due to resistive shorts. We also enumerate all possible fault behaviors and present the relationship between input patterns and output behaviors, which is useful in ATPG.
Wholesale byte reversal of the outermost Ada record object to achieve endian independence for communicated data types
Authors: Randal P. Andress
Venue: ACM SIGAda Ada Letters (2005)

For years computer engineers have dealt with the problems associated with transfer of binary data between systems of different bit and byte order. Big-Endian (most significant first) vs. Little-Endian (least significant first). In this article, existing techniques are extended to develop a new, systematic method for coding Ada record component representations so that the same declaration may be used to define an input/output object of a communications link (or "flat" file) to achieve complete endian independence. The uniqueness of this approach is that rather than dealing with byte swapping at the lowest level where the fields of the most nested record components are defined, a single, simple byte-swap is done at the outermost level of the multi-field object. This technique works for multi-layered, nested records as well as for records with fields that consume partial, contiguous bytes. It is especially well suited for implementation where endian independence has not been anticipated in the design. The only special case is that of array components which require a simple pre/post fix-up. Some potential pitfalls and compiler issues are discussed.
Proactive Self-Healing System based on Multi-Agent Technologies
Authors: Jeongmin Park, Giljong Yoo, Eunseok Lee
Venue: Proceedings of the Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (2005)

Most distributed computing environments today are extremely complex and time-consuming for human administrators to manage. Thus, there is increasing demand for the self-healing and self-diagnosing of problems or errors arising in systems operating within today's ubiquitous computing environment. This paper proposes a proactive self-healing system that monitors, diagnoses and heals its own internal problems using self-awareness as contextual information. The proposed system consists of Multi-Agents that analyze the log context, error events and resource status in order to perform self-healing and self-diagnosis. To minimize the resources used by the Adapters which monitor the logs in an existing system, we place a single process in memory. By this, we mean a single Monitoring Agent monitors the context of the logs generated by the different system components. For rapid and efficient self-healing, we use a 6-step process. The effectiveness of the proposed system is confirmed through practical experiments conducted with a prototype system.