ppxscal/embedding_network huggingface dataset:
Stream Scheduling Algorithms for Multimedia Storage Servers
Authors: Xiaoye Jiang, Prasant Mohapatra
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

In this paper, we have proposed efficient stream scheduling algorithms for multimedia storage servers that are providers of variable bit rate media streams. We have developed three types of stream scheduling algorithms: In-Order Scheduling Algorithm (IOSA), Out-of-Order Scheduling Algorithm (OOSA), and Dynamic Merge Scheduling Algorithm (DMSA). In the IOSA scheme, media blocks must be transmitted according to their natural order. In the OOSA scheme, in-order transmission is not mandated and thus results in an out-of-order transmission. In the DMSA scheme, the requests that are possible to be merged are merged together at first. Then the OOSA scheduling scheme is used for the merged requests. The performance evaluations done through simulations show that the maximum bandwidth requirement, the fetch ahead distance, and the coefficient of variation for the bandwidth requirement are improved by using the IOSA, OOSA, and DMSA algorithms.
Practical Issues for RDBMS Application Development
Authors: Kwo-Jean Farn, Shin-Ling Hu
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We discuss some functions of relational database management systems (RDBMS) that may help RDBMS users to increase their productivity. First, for a data dictionary, we can define each field attribute characteristic in the create table statement, such as signed, unsigned, negative, nonnegative, list or coded value, range value, default value; uppercase, lowercase or upperlow case; IDstamp value; datestamp value; or computation field. We also point out some inconvenient functions of RDBMS. A more intelligent query optimizer is also needed. For users in a Chinese environment, Chinese characteristics such as field name defining, sorting, and partial searching are required. In addition, for an area center using a horizontal fragmentation scheme, a tool which which can automatically parallel update the other site when the central site's kernel part changes is required.
A parallel approach for multiprocessor scheduling
Authors: Ishfaq Ahmad, Yu-Kwong Kwok
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The objective of this research is to propose a low complexity static scheduling and allocation algorithm for message-passing architectures by considering factors such as communication delays, link contention, message routing and network topology. As opposed to the conventional list-scheduling approach, our technique works by first serializing the task graph and "injecting" all the tasks to one processor. The parallel tasks are then 'bubbled up' to other processors and are inserted at appropriate time slots. The edges among the tasks are also scheduled by treating communication links between the processors as resources. The proposed approach takes into account the link contention and underlying communication routing strategy, and can self-adjust on regular as well as arbitrary network topologies. To reduce the complexity, our scheduling algorithm is itself parallelized. To our knowledge, this is the first attempt in designing a parallel algorithm for scheduling. The proposed approach implemented on an iPSC/860 hypercube, while yielding a high speedup in its execution, performs considerably better under a wide range of parameters including the task graph size, communication-to-computation ratio, and the target system topology. Comparisons are made with two other approaches.
An Executable Graphical Representation of Mediatory Information Systems
Authors: Jacques Calmet, Dirk Debertin, Sebastian Jekutsch, Joachim Schü
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

In this paper we present an approach towards a unified modeling and query-processing tool for mediatory information systems. Based upon Coloured Petri nets we are able to model the integration of parametric data (external, uncertain and temporal informations) and to visualize the dataflow in mediatory information systems.
Efficient Algorithms for the Hough Transform on Arrays with Reconfigurable Optical Buses
Authors: Sandy Pavel, Selim G. Akl
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper examines the possibility of implementing the Hough transform for line and circle detection on arrays with reconfigurable optical buses (AROBs). It is shown that the Hough transform for line and circle detection in an N \times N image can be implemented in a constant number of steps. The costs of the two algorithms are O(N^2p) and O(N^2p^2), respectively, where p is the magnitude of one dimension in the parameter space. These values are optimal with respect to the time complexity of the best known sequential algorithms.
Character Recognition by Geometrical Moments on Structural Decompositions
Authors: Pasquale Foggia, Carlo Sansone, Francesco Tortorella, Mario Vento
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

In this paper a new description method is presented. It is based on the combination of structural and statistical approaches, and is applied to the problem of unconstrained isolated handwritten character recognition. Characters are preliminarily decomposed in terms of structural primitives (circular arcs) and successively described in terms of statistical features (geometrical moments suitably normalized). A Multilayer Perceptron is adopted in the classification stage. Results of the method on the digits of the ETL Database are reported.
KAPSEL - Programming within Boundaries
Authors: Raimund K. Ege
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

KAPSEL is a new object-oriented programming language to encourage the building of re-usable software components. The components, i.e. classes, establish clear boundaries between their implementation detail and their outside-visible specification. The underlying software concept employed is that of encapsulation: the close integration and protection of information and its functionality. This paper explores the basic idea of encapsulation in object-oriented methodology: as it applies to objects, classes and class hierarchies, and introduces the programming language - KAPSEL - which facilitates the specification of re-usable object-oriented software components.
An Efficient Dynamic Load Balancing using the Dimension Exchange Method for Balancing of Quantized Loads on Hypercube Multiprocessors
Authors: Hwakyung Rim, Ju-wook Jang, Sung-Chun Kim
Venue: Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing (1999)

Dynamic load balancing on hypercube multiprocessors is considered with emphasis on quantized loads. Quantized loads are divisible only in a fixed size. First, we show that a direct application of the well-known Dimension Exchange Method(DEM) to quantized loads may result in difference in assigned loads to processors as large as log N units after balancing for a hypercube of size N. Then we propose a new method which reduces the maximum difference by half to [}The claim is proved both by analysis of possible cases incrementing the difference on each phase of balancing and by enumerating all possible combination of load for hypercubes of limited sizes using a computer. To estimate the accumulated effect of balancing instances under real-world parallel processing environment, a simulation for hypercube multiprocessors using SLAM II tool is performed. The result shows about 30% improvement in speedup which results from reduced processing time, which in turn results from reduced nonuniformity.
A Scalable Approach to Automated Service Dependency Modeling in Heterogeneous Environments
Authors: Christian Ensel
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: This paper presents a new methodology to automatically generate service dependency models. It strives to enable more comprehensive IT-management by providing an always up-to-date information basis about inter- dependencies of IT-services and other management objects like services applications and network components. The approach specially aims for heterogeneous environments as found in large enterprises and outsourcing scenarios. It comes with an agent based implementation architecture allowing its smooth integration into existing IT- infrastructures.
Scheduling Over a Time-Varying User-Dependent Channel with Applications to High Speed Wireless Data
Authors: Matthew Andrews, Lisa Zhang
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

In a wireless network, a basestation transmits data to mobiles at time-varying, mobile-dependent rates due to the ever changing nature of the communication channels. Inthis paper we consider a wireless system in which the channel conditions and data arrival processes are governed by an adversary. We first consider a single server and a set of users. At each time step t the server can only transmit data to one user. If user i is chosen the transmission rate is r_i (t). We say that the system is (w,\varepsilon )-admissible if in any window of w time steps the adversary can schedule the users so that the total data arriving to each user is at most 1 - \varepsilon times the total service it receives.Our objective is to design on-line scheduling algorithms to ensure stability in an admissible system. We first show, somewhat surprisingly, that the admissibility condition alone does not guarantee the existence of a stable on-line algorithm, even in a subcritical system (i.e. \varepsilon > 0). For example, if the nonzero rates in an infinite rate set can be arbitrarily small, then a subcritical system can be unstable for any deterministic online algorithm.On a positive note, we present a tracking algorithm that attempts to mimic the behavior of the adversary. This algorithm ensures stability for all (w,\varepsilon )-admissible systems that are not excluded by our instability results. As a special case, if the rate set is finite, then the tracking algorithm is stable even for a critical system (i.e. \varepsilon = 0). Moreover, the queue sizes are independent of \varepsilon. For subcritical systems, we also show that a simpler max weight algorithm is stable as long as the user rates are bounded away from zero.The offline version of our problem resembles the problem of scheduling unrelated machines and can be modeled by an integer program. We present a rounding algorithm forits linear relaxation and prove that the rounding technique cannot be substantially improved.We conclude by discussing the extension of our model to the network setting.
Active Gateway: A Facility for Video Conferencing Traffic Control
Authors: Shunge Li, Bharat K. Bhargava
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

This paper describes our work of applying active network technology to video conferencing (VC) research. We present the architecture and features of an application-level facility, called active gateway, for video conferencing traffic and quality of service (QoS) control. It is shown through experiments that this facility enables more control functions that are not seen in conventional video conferencing tools.
Minitomography Scanner for Agriculture Based on Dual-Energy Compton Scattering
Authors: Paulo E. Cruvinel, Fatei A. Balogun
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

The paper presents an approach in tomographic instrumentation for agriculture based on dual-energy Compton scattering. The results show a linear relationship, independent of soil aggregate sizes with regression coefficient of better than 0.95 for bulk density and 0.70 for water content. A minimum detectable density of 0.13 g/cm/sup 3/ and 0.10 cm/sup 3//cm/sup 3/ were observed with better than 2% and 5% precision respectively. Compton scatter images of soil samples illustrating the efficacy of this imaging technique are presented.
Deriving an Object Model from Legacy Fortran Code
Authors: Gokul V. Subramaniam, Eric J. Byrne
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

The practice of software development continues to shift towards the use of object-oriented approaches. The motivation for this trend is the benefits attributed to object-oriented software, including improved maintainability. As organizations develop new object-oriented software, they face the problem of maintaining their older software. How can existing non-objected-oriented software benefit from this new software engineering technology? This paper presents a nine step process for deriving an object model from existing unstructured FORTRAN source code. Both top-down and bottom-up approaches are used to derive objects, classes, class attributes and methods, and relationships among classes. This process can be used within a reengineering project to convert legacy FORTRAN code into a new object-oriented implementation written in a language such as C++. Experience with using this process is also described.
An Experimental Study of Input/Output Characteristics of NASA Earth and Space Sciences Applications
Authors: Michael R. Berry, Tarek A. El-Ghazawi
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

Parallel input/output (I/O) workload characterization studies are necessary to better understand the factors that dominate performance. When translated into system design principles this knowledge can lead to higher performance/cost systems. In this paper we present the experimental results of an I/O workload characterization study of NASA Earth and Space Sciences (ESS) applications. Measurements were collected using device driver instrumentation. Baseline measurements, with no workload, and measurements during regular application runs, were collected and then analyzed and correlated. It will be shown how the observed disk I/O can be identified as block transfers, page requests, and cache activity, and how the ESS applications are characterized by a high degree of spatial and temporal locality.
Process Support and Knowledge Management for Virtual Teams Doing Agile Software Development
Authors: Seth Bowen, Frank Maurer
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

Agile practices are arguably improving the productivity of small, co-located software development teams. In this paper, we describe an approach that tries to overcome the constraint of co-location by introducing a process-support environment (called MILOS) that helps software development teams to maintain adaptive practices in a distributed setting. MILOS supports project coordination, information routing, team communication, pair programming and experience management.
On the multiple fault diagnosis of multistage interconnection networks: the lower bound and the CMOS fault model
Authors: Y.-N. Shen, Xiao-Tao Chen, Susumu Horiguchi, Fabrizio Lombardi
Venue: Proceedings of the international Conference on Parallel Processing (1997)

This paper presents new results for diagnosing (detection and location) multistage interconnection networks (MINs) in the presence of multiple faults. Initially, it is proved that the lower bound in the number of tests for multiple fault diagnosis (independent of the assumed fault model for the MIN) is 2/spl times/log/sub 2/N, where N is the number of inputs/outputs of the network. A new fault model is introduced; this fault model is applicable to interconnection networks implemented using CMOS technology. The characterization for diagnosing stuck-open faults is presented.
The Partition Technique for Overlays of Envelopes
Authors: Vladlen Koltun, Micha Sharir
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We obtain a near-tight bound of 0(n^{3 + \varepsilon }), for any \varepsilon > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This settles a long-standing problem in the theory of arrangements, most recently cited by Agarwal and Sharir [3, Open Problem 2], and substantially improves and simplifies a result previously published by the authors [15]. Our bound has numerous algorithmic and combinatorial applications, some of which are presented in this paper.Our result is obtained by introducing a new approach to the analysis of combinatorial structures arising in geometric arrangements of surfaces. This approach, which we call the partition technique', is based on k-fold divide and conquer, in which a given collection F of n surfaces is partitioned into k subcollections Fi of {n \mathord{\left/ {\vphantom {n k}} \right. \kern-\nulldelimiterspace} k} surfaces each, and the complexity of the relevant combinatorial structure in F is recursively related to the complexities of the corresponding structures in each of the Fi's. We introduce this approach by applying it first to obtain a new simple proof for the known near-quadratic bound on the complexity of an overlay of two minimization diagrams of collections of surfaces in \mathbb{R}^3, thereby simplifying the previously available proof [2].
Mining Fuzzy Rules in A Donor Database for Direct Marketing by a Charitable Organization
Authors: Keith C. C. Chan, Wai-Ho Au, Berry Choi
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

Given a donor database by a charitable organization in Hong Kong, we propose to use a new data mining technique to discover fuzzy rules for direct marketing. The discovered fuzzy rules employ linguistic terms, which are natural for human users to understand because of theaffinity with the human knowledge representations, to represent the association relationships revealed in the data. The proposed approach utilizes an objective measure to distinguish interesting associations from uninteresting ones. Furthermore, it allows the ranking of discovered rules according to an uncertainty measure and allows quantitative values to be inferred by the discovered fuzzy rules. The domain expert from the organization is interested at finding how the response of a donor is affected by his demographics (e.g., age, education,occupation, salary, etc.) and his donation histories (e.g., the average yearly donation frequency, the average monthly donation amount, etc.). We applied the proposed approach to the donor database in order to mine a set of fuzzy rules. The experimental results showed that our approach is able to achieve accurate prediction of donor's response. By examining the discovered rules, the domain expert has found some unexpected patterns and formulated some direct mail strategies for future use.
An Environment for the Collaborative Revision of Digital Theses
Authors: Lourdes Fernández, J. Alfredo Sánchez, Arturo Flores
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

We present Zeus, an environment designed to aid in the creation of a repository of digital theses. Zeus is an asynchronous cooperative toolset which allows the revision and annotation of digital theses over the Internet. With Zeus, students working on their theses (and their academic committees) are provided with a highly personalizable environment which simplifies the process of reviewing electronic documents. Participants of the process of producing and publishing a thesis can work together without regard of time and place constraints.
IFT-Watershed from Gray-Scale Marker
Authors: Roberto de Alencar Lotufo, Alexandre X. Falcão, Francisco A. Zampirolli
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract. The watershed transform and the morphological reconstruction are two of the most important operators for image segmentation in the framework of mathematical morphology. In many situations, the segmentation requires the classical watershed transform of a reconstructed image. In this paper, we introduce the IFT-watershed from gray scale marker - a method to compute at same time, the reconstruction and the classical watershed transformof the reconstructed image, without explicit computation of any regional minima. The method is based on the Image Foresting Transform (IFT) - a unified and efficient approach to reduce image processing problems to a minimum-cost path forest problem in a graph. As additional contributions, we demonstrate that (i) the cost map of the IFT-watershed from markers is identical to the output of the superior gray scale reconstruction; (ii) other reconstruction algorithms are not watersheds; and (iii) the proposed method achieves competitive advantages as compared to the current classical watershed approach.
Software Evolution Observations Based on Product Release History
Authors: Harald Gall, Mehdi Jazayeri, René Klösch, Georg Trausmuth
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Large software systems evolve slowly but constantly. In this paper we examine the structure of several releases of a telecommunication switching system (TSS) based on information stored in a database of product releases. We tracked the historical evolution of the TSS structure and related the adaptations made (e.g. addition of new features, etc.) to the structure of the system. Such a systematic examination can uncover potential shortcomings in the structure of the system and identify modules or subsystems that should be subject to restructuring or reengineering. Further, we have identified additional information that would be useful for such investigations but is currently lacking in the database.
A Combined Statistical Query Term Disambiguation in Cross-Language Information Retrieval
Authors: Fatiha Sadat, Akira Maeda, Masatoshi Yoshikawa, Shunsuke Uemura
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The diversity of information sources and the explosive growth of the Internet worldwide are compelling evidence of a need for information retrieval that can cross language boundaries. Ambiguity from failure to translate queries is one of the major causes for large drops ineffectiveness below monolingual performance, for the dictionary-based method in Cross-Language Information Retrieval. In this paper, we focus on the query translation and disambiguation, to improve the effectiveness of an information retrieval and to dramatically reduce errors such an approach normally makes. A combined statistical disambiguation method both before and after translation is proposed, to avoid the problem of wrong selection of target translations. We tested the effectiveness of the proposed disambiguation method, by an application to French-English Information Retrieval. Evaluations using TREC data collection proved a great effectiveness of the proposed disambiguation method.