ppxscal/embedding_network huggingface dataset:
Handling Network Partitions and Mergers in Structured Overlay Networks
Authors: Tallat M. Shafaat, Ali Ghodsi, Seif Haridi
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Structured overlay networks form a major class of peerto- peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. These systems have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this paper, we present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.
A Framework for Designing Grid Workflow System based on Ontology
Authors: Shanchen Pang, Shumei Wang, Changjun Jiang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Grid computing is innovative information service infrastructure for dynamic and distributed resources sharing and collaboration. Grid workflow is used to handle tasks with control and data dependencies C and plays an important role in Grid computing. It is essential to design an appropriate model to satisfy the distributed and heterogeneous workflow systems that must be flexible, reusable, dynamic feature in higher level. As the idea of the designing and composing semantic Web services, a method for designing Grid workflow system framework based on ontology is proposed in this paper. Four types of Ontology concept are defined: Workflow_Meta Ontology, Model_Driven Method Ontology, Knowledge Representation Ontology and Date Types Ontology, and the particular description of their functions, constitutes and relations with each other are given. Based on this framework, the Grid workflow systems will have stronger capability to deal with their cooperation and dynamic composition with each other.
Interinput and Interoutput Time Distribution in Classical Product-Form Networks
Authors: J. Y. Le Boudec
Venue: IEEE Transactions on Software Engineering (1987)

It is shown that, in a general Jackson network of queues, the distribution of interinput and interoutput times are not equal. Equality holds in reversible classical product-form networks with or without blocking. A sufficient condition for reversibility is given.
Abstract Requirements Specification: A New Approach and Its Application
Authors: C. L. Heitneter
Venue: IEEE Transactions on Software Engineering (1983)

An abstract requirements specification states system requirements precisely without describing a real or a paradigm implementation. Although such specifications have important advantages, they are difficult to produce for complex systems and hence are seldom seen in the "real" programming world. This paper introduces an approach to producing abstract requirements specifications that applies to a significant class of real-world systems, including any system that must reconstruct data that have undergone a sequence of transformations. tions. It also describes how the approach was used to produce a requirements document for SCP, a small, but nontrivial Navy communications system. The specification techniques used in the SCP requirements document are introduced and illustrated with examples.
Multi-device User Interface Development with Composition-oriented User Interface Design Patterns
Authors: Shihong Feng, Jiancheng Wan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

As the knowledge reuse is becoming more and more crucial, patterns play a more effective way on the knowledge use of the HCI domain. However, some patterns are mostly oriented to different tasks, which are too coarse-grained to be easily implemented. And the relative user interfaces are not provided in these patterns. Furthermore many different patterns are oriented to different models in the model based on UI development, which are hard to be integrated into the UI development tool. On the point of Multi-device UI Development (MD_UID), the Composition-oriented UI Design Pattern (CUIDP) is proposed from the interior model, the presentation characteristic and the behavior feature. In particular, it spans various models of the MD_UID and provides various parameters to users to custom UIs intuitively, which helps the engineering-oriented UI development. As a case, the Grid CUIDP is explicitly described according to the form of CUIDP. The algorithm of Grid presentation unit is given, which is oriented to ASP.NET. Finally, the conclusion and the further work are discussed.
Design and implementation tradeoffs for wide-area resource discovery
Authors: D. Oppenheimer, J. Albrecht, D. Patterson
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

This paper describes the design and implementation of SWORD, a scalable resource discovery service for wide-area distributed systems. In contrast to previous systems, SWORD allows users to describe desired resources as a topology of interconnected groups with required intragroup, intergroup, and per-node characteristics, along with the utility that the application derives from various ranges of values of those characteristics. This design gives users the flexibility to find geographically distributed resources for applications that are sensitive to both node and network characteristics, and allows the system to rank acceptable configurations based on their quality for that application. We explore a variety of architectures to deliver SWORD's functionality in a scalable and highly-available manner. A 1000-node ModelNet evaluation using a workload of measurements collected from PlanetLab shows that an architecture based on 4-node server cluster sites at network peering facilities outperforms a decentralized DHT-based resource discovery infrastructure for all but the smallest number of sites. While such a centralized architecture shows significant promise, we find that our decentralized implementation, both in emulation and running continuously on over 200 PlanetLab nodes, performs well while benefiting from the DHT's self-healing properties.
Hidden Markov Models for Activity Recognition in Ambient Intelligence Environments
Authors: Dairazalia Sanchez, Monica Tentori, Jesus Favela
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

Context-aware computing offers several advantages for human computer interaction by augmenting ambient intelligence environments with computational artifacts that can be responsive to the needs of users. One of the main challenges in context-aware computing is context recognition. While some contextual variables, such as location, can be easily recognized, others, such as activity are more complex to estimate. This paper describes an approach to estimate activities in a working environment. The approach is based on information gathered from a workplace study, in which 196 hours of detailed observation of hospital workers were recorded. This data is used to train a Hidden Markov Model to estimate user activity. The results indicate that the user activity can be correctly estimated 92.6% of the time. We compare our results with the use of neuronal networks and human observers familiar with those work practice. We discuss how these results can be used for context-aware applications.
Hierarchical Optimization Methodology for Wideband Low Noise Amplifiers
Authors: A. Nieuwoudt, T. Ragheb, Y. Massoud
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this paper, we present a systematic synthesis methodology for fully integrated wideband low noise amplifiers that simultaneously optimizes impedance matching, noise figure, and other performance parameters. Leveraging an accurate analytical model, we hierarchically couple global optimization techniques with local convex optimization methods to efficiently locate optimal wideband LNA circuits. The results indicate that the methodology yields significant improvement in key LNA design constraints over existing methodologies while achieving up to one order of magnitude speedup in computational performance.
Using Moodle and Other Software Tools in EFL Courses in a Japanese IT University
Authors: John Brine, Ian Wilson, Debopriyo Roy
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Throughout their public school education, Japanese students are socialized into cultural learning practices [1] that emphasize group-oriented tasks. Well-organized group work is paramount to successful EFL teaching in Japan. In this paper, we look at how Moodle an open-source learning management system, is used at a Japanese computer science university to organize both individual and group tasks. Examples are provided of freeware and open-source software tools, such as CmapTools for concept mapping and Praat for acoustic analysis that can be used within Moodle to enhance EFL reading, writing, and pronunciation courses. We also explore how Moodle can be integrated with collaborative document production tools, such as Google Docs and Spreadsheets. Finally, we demonstrate the use of Moodle as a tool for action research, enabling the teacher/researcher to tightly control the course content in two different courses while systematically varying aspects of the content to test hypotheses about language learning. An important aspect of our work is the systematization of group process in language and communication courses and the development of a context for experimentation.
Influence of site effects on inelastic displacement ratios for SDOF and MDOF systems
Authors: F. Mollaioli, S. Bruno
Venue: Computers Mathematics with Applications (2008)

Lateral displacements' control of structures subjected to earthquake ground motion has now been recognized as a key factor in the assessment of system performance, leading to design approaches that use displacements rather than forces as the starting point for the seismic evaluation of structures. In fact performance-based approaches offer significant advantages in comparison with traditional force-based approaches, since the former are capable of focusing on nonlinear behaviour and consequent damage to the structure, in contrast to the latter. Lateral displacement demand, particularly in structures that exhibit nonlinear behaviour, can be significantly affected by the features of strong ground motion, i.e., amplitude, frequency content and duration. Such characteristics are in turn profoundly influenced by the irregularity and changeability in earthquake ground motions, which should therefore be taken into account appropriately. The great number of strong motion records gathered throughout the last decades in the most widely varying soil-site conditions has made accounting for soil-site effects in the characterization of elastic and inelastic displacement demands feasible. The aim of this paper is to present the results of numerical investigations on the response of both single-degree-of-freedom (SDOF) and multiple-degree-of-freedom (MDOF) systems, through nonlinear time-history analyses performed on the basis of a wide data set of strong motion records. Constant ductility spectra of the ratios of the maximum inelastic displacement to the corresponding maximum elastic demand were derived for this purpose. In particular, the influences of earthquake magnitude, source-to-site distance, local soil-site conditions, ductility and hysteretic behaviour were quantified. Finally, simplified expressions for the ratio of the maximum inelastic to the maximum elastic displacement were established, in order to allow the evaluation of inelastic displacements for new or rehabilitated structures for which the global displacement ductility can be estimated, directly from the knowledge of the corresponding elastic demands.
Empirical studies of the genetic algorithm with noncoding segments
Authors: Annie S. Wu, Robert K. Lindsay
Venue: Evolutionary Computation (1995)

The genetic algorithm (GA) is a problem-solving method that is modeled after the process of natural selection. We are interested in studying a specific aspect of the GA: the effect of noncoding segments on GA performance. Noncoding segments are segments of bits in an individual that provide no contribution, positive or negative, to the fitness of that individual. Previous research on noncoding segments suggests that including these structures in the GA may improve GA performance. Understanding when and why this improvement occurs will help us to use the GA to its full potential. In this article we discuss our hypotheses on noncoding segments and describe the results of our experiments. The experiments may be separated into two categories: testing our program on problems from previous related studies, and testing new hypotheses on the effect of noncoding segments.
A Method for Obtaining SPOOF's
Authors: Siu-Chong Si
Venue: IEEE Transactions on Computers (1975)

A compatibility relationship on network paths is defined in such a way that the maximal compatibles are isomorphic to the products in the "structure and parity-observing output function" (SPOOF), a subscripted Boolean expression for the network output that uniquely specifies the network structure. For a given network, the path compatibility relations are easy to find, as are the maximal compatibles and hence the SPOOF for the network output. Because the collection of all the path compatibility relations, conveniently displayed in matrix form, completely characterizes the network, the compatibility matrix can be used for a variety of purposes.
Fuzzy logic as a logic of the expressive strength of information
Authors: Thomas Vetterlein
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

We develop alternative semantics for &#x0141;ukasiewicz logic and for cancellative hoop logic according to the following idea. We formalize statements reflecting an inexact knowledge of certain (sharp) properties; we assume that all what can be known about a property is its expressive strength. To this end, we consider a Boolean algebra endowed with an automorphism group or, alternatively, with a measure. The Boolean algebra is meant to model a collection of properties; and the additional structure is used to identify pairs of properties which, although possibly distinct, are equally strong. Propositions are defined as subsets of the algebra containing with any element also those identified with it in this way. We show that then, the set of all propositions carries the structure of an MV-algebra or of a cancellative hoop.
A Knowledge-Based Logic Design System
Authors: Takao Uehara
Venue: IEEE Design Test (1985)

Our computer-aided logic design system employs a synthesizer, a typical knowledgebased system. The register-transfer-leveldesign is described in digital system design language (DDL). The DDL translator generates a technology-independent functionaldesign from the DDL description, and the syntehsizer transforms the functional design into a technology-dependent gate-leveldesign. We implemented the synthesizer as a knowledge-based system because it works without an established algorithm and iseasy to modify according to the target technology. Our knowledge-based synthesizer for TTLICs generated a logic diagram ofalmost as high quality as one designed by a human expert. Only two CPU seconds are required for the FACOM M-380 to generatelogic diagrams containing 1000 gates, whereas a human designer takes one week. The CMOS gate array version was developed inonly one-half man-year, compared to four man-years for the original version
Detection of Storage Errors in Mass Memories Using Low-Cost Arithmetic Error Codes
Authors: B. Parhami
Venue: IEEE Transactions on Computers (1978)

Arithmetic error codes constitute a class of error codes that are preserved during most arithmetic operations. Effectiveness studies for arithmetic error codes have shown their value for concurrent detection of faults in arithmetic processors, data transmission subsystems, and main storage units in fault-tolerant computers. In this paper, it is shown that the same class of codes is also quite effective for detecting storage errors in both shift-register and magnetic-recording mass memories. Some of the results are more general and deal with properties of arithmetic error codes in detecting unidirectional failures. For example, it is shown that a low-cost arithmetic error code with check modulus A = 2N - 1 can detect any unidirectional failure which affects fewer than N bits. The use of arithmetic error codes for checking of mass memories is further justified since it eliminates the need for hard-core or self-checking code translators and reduces the number of different types of code checkers required.
QoS and energy efficiency in network wide broadcasting: A MAC layer perspective
Authors: Bulent Tavli, Wendi B. Heinzelman
Venue: Computer Communications (2007)

In this paper we investigate the role of medium access control on the performance of network-wide real-time data broadcasting through flooding using three MAC protocols (IEEE 802.11, CPS, and MH-TRACE) in terms of QoS (packet delivery ratio, packet delay, and delay jitter) and energy dissipation. We conduct extensive simulations to evaluate the performance of network-wide broadcasting through flooding in the node density, traffic load, and network size/topology parameter space. The results of our study show that different MAC protocols produce better performance than the others in different parts of the parameter space. Thus, in designing network layer broadcast architectures, the characteristics of the medium access control layer should be given the utmost importance to ensure the satisfactory performance of the system.
SSS website: an online community which supports successful extensive reading for learning English
Authors: Akio Furukawa, Hitoshi Nishizawa, Hikaru Uruno, Takayoshi Yoshioka
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

In this paper we describe how the SSS (Start with Simple Stories) website supports individual learners to improve their communication skills in English through extensive reading. Our research shows that web-based communities can help remote learners to continue their learning in several ways. Although, in the real world, reading is an individual activity, readers need fellow learners to share their own experience or information about reading materials. The website provides the learners with the opportunities to get information about easy-to-read English books and provides advice on how to select appropriate books in the community. From the analysis of conversations between the learners posted on the website, we have found the website has an important role not only to supply useful information, but also to connect learners who are encouraged by others with similar experiences. The SSS website seems to attract individuals to the learning community and to enhance their learning of English. It also has a ripple effect to improve the learning environment in the real world.
Effective keyword search for valuable lcas over xml documents
Authors: Guoliang Li, Jianhua Feng, Jianyong Wang, Lizhu Zhou
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

In this paper, we study the problem of effective keyword search over XML documents. We begin by introducing the notion of Valuable Lowest Common Ancestor (VLCA) to accurately and effectively answer keyword queries over XML documents. We then propose the concept of Compact VLCA (CVLCA) and compute the meaningful compact connected trees rooted as CVLCAs as the answers of keyword queries. To efficiently compute CVLCAs, we devise an effective optimization strategy for speeding up the computation, and exploit the key properties of CVLCA in the design of the stack-based algorithm for answering keyword queries. We have conducted an extensive experimental study and the experimental results show that our proposed approach achieves both high efficiency and effectiveness when compared with existing proposals.
Improving the Effectiveness of Virtual Teams by Adapting Team Processes
Authors: Daniel J. Rice, Barry D. Davidson, John F. Dannenhoffer, Geri K. Gay
Venue: Computer Supported Cooperative Work (2007)

Results are presented from a study on virtual teams and whether appropriate early training can positively influence their effectiveness. Sixteen teams that worked together for periods ranging from three months to three years were studied. Team processes that emerged naturally from long-duration teams were formalized and taught to shorter duration teams. These shorter duration teams comprised three different cohorts, each of which received different levels of training. It was found that the adoption of formal procedures and structured processes significantly increased the effectiveness of virtual teams. Tasks that lend themselves to a structured approach were most effectively accomplished during virtual meetings, whereas face-to-face interactions were better for relatively unstructured, discussion intensive tasks. The performance of a virtual team was significantly improved when team processes were adapted to the affordances of the CMC environment. It is shown that this adaptation can occur very rapidly if teams are trained on the technology as well as on work processes that best exploit it.
A search-based approach for dynamically re-packaging downloadable applications
Authors: Thierry Bodhuin, Massimiliano Di Penta, Luigi Troiano
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

Mechanisms such as Java Web Start enable on-the-fly downloading and execution of applications installed on remote servers, without the need for having them installed on the local machine. The rapid diffusion of mobile devices (e.g., Personal Device Assistants - PDAs) connected to the Internet make these applications appealing to mobile users. However, in many cases the available bandwidth is limited, and its excessive usage can even be a cost when wireless connections are paid on a Kbyte transfer basis. This paper proposes an approach based on Genetic Algorithms and an environment that, based on previous usage information of the application (i.e. scenarios), re-packages it with the objective of limiting amount of resources transmitted for using a set of application features. The paper reports an empirical study on the application of the proposed approach on three medium-sized Java applications.