ppxscal/embedding_network huggingface dataset:
An Implementation of CORBA's LifeCycle Service
Authors: Yvan Peter
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

CORBA (Common Object Request Broker Architecture) is a standard for distributed environments which enables object components to interact in a transparent manner according to location and heterogeneity. Mobility functions are needed on these platforms for classical concerns such as administration, fault tolerance or load balancing or for newer research fields such as mobile computing. We are considering an administration tool to enable servers positioning on a network as an application. We propose a generic mechanism to introduce the necessary mobility functions following CORBA's mobility model based on the LifeCycle Service. Much research work has been done about process migration and more recently object migration. Most projects consider an homogeneous environment (e.g., Mosix, Emerald). This cannot be the case with CORBA which is middleware and thus works on a variety of operating systems, hence heterogeneity is a primary concern. Migration transparency is also important and difficult to achieve in an open environment (i.e., in which objects do not know their clients a priori). It poses mainly two problems: managing object references so that clients are unaware of location changes of servers and actually migrating the server while it is invoked by clients. The mechanism we propose relies on intermediary objects that are used to encapsulate mobility management and an implementation of the architecture of the LifeCycle Service.
Change Costing in a Maintenance Environment
Authors: Ted Keller
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Over the years, as a software product is maintained, the factors involved in costing a change become much more complex than most customers and vendors realize. Failure to understand and dramatic declines in quality and reliability. This presentation will address the root cause of this problem. As requirements are recursively modified over time, basic software architecture assumptions become eroded. Users continue to subject the software to new scenarios neither "envisioned" nor accommodated by the original design and test strategies. Repair and change histories must be added to the long lists of traditional considerations to be addressed by the software maintainers. The cost impact of these additional activities are not readily recognized because software is an invisible abstract entity. Common resource control consideration algorithms based on lines on code, function points, and numbers of test cases break down because they do not include. A systematic approach is provided for developing a more accurate change costing algorithm in the maintenance environment.
Performance of the Vesta parallel file system
Authors: Dror G. Feitelson, Peter F. Corbett, Jean-Pierre Prost
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Vesta is an experimental parallel file system implemented on the IBM SPI. Its main features are support for parallel access from multiple application processes to file, and the ability to partition and re-partition the file data among these processes. This paper reports on a set of experiments designed to evaluate Vesta's performance. This includes basic single-node performance, and performance using parallel access with different file partitioning schemes. Results are that bandwidth scales with the number of I/O nodes accessed, and that orthogonal partitioning schemes achieve essentially the same performance. In many cases performance equals the disk hardware limit. This is often attributed to prefetching and write-behind in the I/O nodes.
Efficient Interconnects for Clustered Microarchitectures
Authors: Joan-Manuel Parcerisa, Julio Sahuquillo, Antonio González, José Duato
Venue: Proceedings of the 2002 International Conference on Parallel Architectures and Compilation Techniques (2002)

Clustering is an effective microarchitectural technique for reducing the impact of wire delays, the complexity, and the power requirements of microprocessors. In this work, we investigate the design of on-chip interconnection networks for clustered microarchitectures. This new class of interconnects has different demands and characteristics than traditional multiprocessor networks. In a clustered microarchitecture, a low inter-cluster communication latency is essential for high performance.We propose point-to-point interconnects together with an effective latency-aware instruction steering scheme and show that they achieve much better performance than bus-based interconnects. The results show that the connectivity of the network together with latency-aware steering schemes are key for high performance. We also show that these interconnects can be built with simple hardware and achieve a performance close to that of an idealized contention-free model.
The Internal Revenue Service function point analysis program: a brief
Authors: Charles B. Tichenor
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

The Internal Revenue Service (IRS) Information Systems has been using function point analysis since 1993 as the foundation of its software metrics program. Using function point analysis, the IRS has significantly improved the quality of its software project management as measured by the SEI Capability Maturity Model. The IRS can determine the size of its software about four times faster than industry averages can estimate software size and resource requirements for new development projects as soon as the central data model is known, and can accurately size small software work orders and estimate corresponding resources needed without examining the software or meeting with the project team. Each of these methodologies qualify at least at CMM Level 2.
Polarized Games
Authors: Olivier Laurent
Venue: Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (2002)

We generalize the intuitionistic Hyland-Ong games to a notion of polarized games allowing games with plays starting by proponent moves. The usual constructions on games are adjusted to fit this setting yielding a game model for polarized linear logic with a definability result. As a consequence this gives a complete game model for various classical systems: LC, \lamdba\mu-calculus, . . . for both call-by-name and call-by-value evaluations.
A performance comparison of fast distributed mutual exclusion algorithms
Authors: Theodore Johnson
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Several fast and low-overhead distributed mutual exclusion algorithms have been proposed. Each of these algorithms required O(log n) messages per critical section entry and O(log n) bits of storage per processor. In this paper, we make a comparative performance study of four distributed mutual exclusion algorithms. Since the algorithms we study are the basis for distributed synchronization, distributed virtual memory, coherent caches, and distributed object systems, our results have implications about the best methods for their implementation. We find that the distributed synchronization algorithm of Chang, Singhal, and Liu (1990) has the overall best performance, though other algorithms are more efficient in special cases. In a system of 350 processors, the CSL algorithm requires only six messages per critical section entry, including the initial request and the token response messages.
Quasi-Morphism and Comprehensibility of Rules in Inductive Learning
Authors: Wiphada Wettayaprasit, Chidchanok Lursinsap, Chee-Hung Henry Chu
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

We present a model of creating a hierarchical set of rules that encode generalizations and exceptions derived from induction learning. The rules use the input features directly and are therefore comprehensible to the users. Learning is performed by a feedforward neural networkand the rules are extracted from the trained network. A pattern classification task is used to demonstrate the efficacy of our approach. We show that the rules have similar classification performance while being more comprehensible to the users.
The Mcube: a symmetrical cube based network with twisted links
Authors: Nitin K. Singhvi, Kanad Ghose
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The Mcube network proposed in this paper is a highly recursive and symmetrical interconnection network based on twisted links (Abraham and Padmanabhan, 1989). However, unlike other twist-based networks which are asymmetrical, the Mcube has a uniform distance distribution. In addition the Mcube is immune to the adverse effects of skewed traffic patterns that occur in asymmetrical structures. Mcubes have about half the diameter of a hypercube with the same node and link complexity. Mcubes have been defined in terms of the structure of components rather than relations between binary strings chiefly to ensure structural symmetry. Mcubes have a lower average internode distance than other twist-based networks. Reduced network congestion and low message delays allow Mcubes to perform significantly better than other comparable networks particularly under heavy traffic loads. Mcubes can emulate comparable hypercubes with a small routing overhead. Several classes of parallel algorithms can be mapped to execute faster on Mcubes than on hypercubes.
Using Rough Sets Theory and Database Operations to Construct a Good Ensemble of Classifiers for Data Mining Applications
Authors: Xiaohua Hu
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

In this paper we present a new approach to construct a good ensemble of classifiers using rough sets theory and database operations. Ensembles of classifiers is formulated precisely within the framework of rough sets theory and constructed very efficiently by using set-oriented database operations. Our method first computes a set of reductswhich include all the indispensable attributes required for the decision categories. For each reduct, a reduct table is generated by removing those attributes which are not in the reduct. Next, a novel rule induction algorithm is used to compute the maximal generalized rules for each reducttable and a set of reduct classifiers is formed based on thecorresponding reducts. The distinctive features of our method as compared to other methods of constructing ensembles of classifiers are:(1) present a theoretical model to explain the mechanism of constructing ensemble of classifiers, (2) each reduct is a minimum subset of attributes, has the same classification ability as the entire attributes,(3)ea h reduct classifier constructed from the corresponding reduct has a minimal set of classification rules, and is as accurate andcomplete as possible and at the same time as diverse as possible from the other classifiers, (4)the test indicates that the number of classifiers used to improve the accuracy is muchless than other methods
Throttle and Preempt: A New Flow Control for Real-Time Communications in Wormhole Networks
Authors: Hyojeong Song, Boseob Kwon, Hyunsoo Yoon
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In this paper, we study wormhole routed networks and their suitability for real-time traffic in a priority-driven paradigm. A traditional blocking flow control in wormhole routing may lead to a priority inversion in the sense that high priority packets are blocked by low priority packets for unlimited time. This uncon-trolled priority inversion causes the frequent deadline missing. This paper therefore proposes a new flow control called throttle and preempt flow control, where high priority packets can preempt network resources held by low priority packets, if necessary. As a result, this flow control does not cause priority inversion. Our simulations show that the throttle and preempt flow control dramat-ically reduces deadline miss ratio without extra virtual channels. It is also observed that the throttle and preempt flow control offers shorter delay for non-real-time traffic than existing real-time flow control does.
Monitoring Learners Activities in a Collaborative Environment
Authors: Armando Luiz N. Delgado, Carlos José M. Olguín, Ivan Luiz Marques Ricarte
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: Collaborative learning supported through computers seems to be very promising due to advances in computer mediated communication tools. However, it is not clear which approach for on-line learning individual or collaborative is more effective for the students. This paper is a continuation of previous work from authors, that combine both approaches, taking in account that some advantages related to individual learning, such as the self-pacing and the establishment of learning goals by the learner, imply in difficulties to establish collaborative settings. In this article it is proposed a framework for the management of study groups of distributed learners sharing on-line material. A model is presented to capture the essences of group activities. These information allow further analysis of group and individual performances.
Robust parallel resource management in shared memory multiprocessor systems
Authors: I-Ling Yen, Farokh B. Bastani
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

Parallel machines are being increasingly used for applications that require both quick response time and high reliability. This poses a challenge in programming these systems since it must be ensured that there is sufficient redundancy to cope with failures and that, at the same time, redundant components are used effectively during failure free periods to enhance the performance. Among the issues, resource management in such systems is highly critical to the robustness and efficiency of the system. A good resource management algorithm should allow the system to continue its operation even in the presence of a significant number of processor failures. Also, the incorporation of fault tolerance should not incur too much overhead. In this paper, we develop two robust resource management algorithms which simultaneously achieve the twin objectives of low overhead and high reliability.
The Subsumption Architecture: Distributed Control for Business Objects
Authors: Dan Murray
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

The goal of enterprise modeling is to capture the structure and operations of a business as simply and directly as possible. The object-oriented approach to enterprise modeling allows us to capture the structure and operations of a business as a collection of interacting business objects. The enterprise model provides us with useful insights into the workings of a business and hence facilitates exercises in business process re-engineering (BPR). The role of BPR is to improve the structure and operations of a business. In this paper, we propose the Subsumption Architecture as a solution to a class of control problems which arise in BPR efforts. The Subsumption Architecture is ideally suited to implementation in the distributed computing environment, yielding a scaleable, high-performance solution which is particularly robust under exceptional conditions.
Using Boosting to Simplify Classification Models
Authors: Virginia Wheway
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Ensemble classification techniques such as bagging ,boosting and arcingalgorithms have been shown to lead to reduced classification error on unseencases and seem immune t the problem of overfitting. Several explanations forthe reduction in generalisation error have been presented, with authors morerecently defining and applying diagnostics such as edge and margin [4,9,10 ].These measures pr vide insight into the behaviour of ensemble classifiers but can they be exploited further?
Privacy in a Mobile Environment
Authors: Silke Holtmanns
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Future mobile network operator will provide the users with all the information and services wanted. Using a mobile phone for services is strongly dependent on personalization to provide the user with a comfortable experience. Hence many of these services (e.g. location, electronic wallet) will handle sensitive user data. This article presents a technique for the network operator to support users need for personal information privacy against third parties like Internet service providers. We propose a new and user-friendly method for handling privacy. The method is based on a privacy receipt mechanism for all personal data that the user agrees to be transferred to third parties. The role of the network operator in our scenario is the one of a consumer privacy protector, since the operators already store and process many sensitive user data and must comply with the data protection legislation.
Measurements for managing software maintenance
Authors: George E. Stark
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Software maintenance is central to the mission of many organizations. Thus, it is natural for managers to characterize and measure those aspects of products and processes that seem to affect the cost, schedule, quality and functionality of software maintenance delivery. This paper answers basic questions about software maintenance for a single organization and discusses some of the decisions made based on the answers. Attributes of both the software maintenance process and the resulting product were measured to direct management and engineering attention toward improvement areas, track the improvement over time, and help make choices among alternatives.
Handwritten ZIP Code Recognition
Authors: Gregory Dzuba, Alexander Filatov, Alexander Volgunin
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The encoding of delivery point code (DPC) for handwritten address is one of the most complex problems of the US mail delivery automation. This paper describes a real-time system intended to recognize the 5-digit ZIP code part of DPC. To increase the system performance the results of ZIP code recognition are cross-validated with those of city and state names recognition. Main principles of the handwritten word recognizer which is the core of the system are explained. The system throughput is 40.000 address blocks per hour. Experimental results on live mail pieces are presented. ZIP code recognition rate is 73% with 1% error rate.
The WHIPS Prototype for Data Warehouse Creation and Maintenance
Authors: Janet L. Wiener, Himanshu Gupta, Wilburt Labio, Yue Zhuge, Hector Garcia-Molina
Venue: Proceedings of the Thirteenth International Conference on Data Engineering (1997)

Summary form only given. The goal of the Whips project (WareHousing Information Project at Stanford) is to develop algorithms and tools for the creation and maintenance of a data warehouse (J. Wiener et al., 1996). In particular, we have developed an architecture and implemented a prototype for identifying data changes at distributed heterogeneous sources, transforming them and summarizing them in accordance with warehouse specifications, and incrementally integrating them into the warehouse. In effect, the warehouse stores materialized views of the source data. The Whips architecture is designed specifically to fulfil several important and interrelated goals: sources and warehouse views can be added and removed dynamically; it is scalable by adding more internal modules; changes at the sources are detected automatically; the warehouse may be updated continuously as the sources change, without requiring down time; and the warehouse is always kept consistent with the source data by the integration algorithms. The Whips system is composed of many distinct modules that potentially reside on different machines. Each module is implemented as a CORBA object. They communicate with each other using ILU, a COBRA compliant object library developed by Xerox PARC.
A Knowledge-Oriented Clustering Technique Based on Rough Sets
Authors: Shoji Hirano, Shusaku Tsumoto
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

This paper presents a knowledge-oriented clustering method based on rough set theory. The method evaluates simplicity of classification knowledge during the clustering process and produces readable clusters reflecting global feature of objects. The method uses a newly introduced measure, indiscernibility degree, to evaluate importance of equivalence relations that is related to roughness of the classification knowledge. Indiscernibility degree is defined as a ratio of equivalence relations that give common classification to two objects under consideration. The two objects can be classified into the same class if they have high indiscernibility degree, even in presence of equivalence relations which differentiate these objects. Ignorance of such equivalence relations is related to generalization of knowledge, and yields simple clusters that can be represented by simple knowledge. An experiment was performed on the artificially created numerical datasets. The results showed that objects were classified into the expected clusters if modification was performed, whereas they were classified into many small categories without modification.
Client-Based Logging for High Performance Distributed Architectures
Authors: Euthimios Panagos, Alexandros Biliris, H. V. Jagadish, Rajeev Rastogi
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

In this paper, we propose logging and recovery algorithms for distributed architectures that use local disk space to provide transactional facilities locally. Each node has its own log file where all log records for updates to locally cached pages are written. Transaction rollback and node crash recovery are handled exclusively by each node and log files are not merged at any time. Our algorithms do not require any form of time synchronization between nodes and nodes can take checkpoints independently of each other. Finally, our algorithms make possible a new paradigm for distributed transaction management that has the potential to exploit all available resources and improve scalability and performance.
A Hybrid Interconnection Network for Integrated Communication Services
Authors: Yi-long Chen, Jyh-Charn Liu
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

This paper presents a hybrid interconnection network architecture to support integrated communication services for multicomputer-based database and multimedia systems. Most existing interconnection networks are mainly designed to handle a single type of message services, but may perform poorly for heterogeneous types of network traffic. Our study shows that wormhole routing networks, which are known to be suitable for number crunching applications, are inefficient in transfer of long files. We demonstrate the feasibility of integrating different network techniques based on the virtual channel technique and flexible routing mechanisms.