ppxscal/embedding_network huggingface dataset:
Deferred Updates and Data Placement in Distributed Databases
Authors: Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

Commercial distributed database systems generally support an optional protocol that provides loose consistency of replicas, allowing replicas to be inconsistent for some time. In such a protocol, each replicated data item is assigned a primary copy site. Typically, a transaction updates only the primary copies of data items, with updates to other copies deferred until after the transaction commits. After a transaction commits, its updates to primary copies are sent transactionally to the other sites containing secondary copies. We investigate the transaction model underlying the above protocol. We show that global serializability in such a system is a property of the placement of primary and secondary copies of replicated data items. We present a polynomial time algorithm to assign primary sites to data items so that the resulting topology ensures serializability.
A novel deadlock-free routing technique for a class of de Bruijn graph based networks
Authors: Hyunmin Park, Dharma P. Agrawal
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

This paper introduces a new deadlock-free routing algorithm with fewer virtual channels than the known algorithm for a generalized de Bruijn digraph of m virtual channels, where m is the maximum message path length and r is a radix. Our new algorithm requires maximum m-[/sup m-1///sub r/] virtual channels per physical channel. Extension to this algorithm for a generalized de Bruijn graph and a dBCube graph is introduced, and virtual channel requirements have also been identified. In most of dBCube graphs, maximum m-[/sup m-1///sub r/] virtual channels are required for the outcluster channels, and maximum m+1-[/sup m///sub r/] virtual channels for the incluster channels, where m is the maximum length of the cluster-to-cluster path.
The Design and Implementation of a Virtual Conference System
Authors: Timothy K. Shih, Jiung-Yao Huang, Jason C. Hung, Te-Hua Wang, Wen C. Pai
Venue: 24th International Computer Software and Applications Conference (2000)

With the enormous use of the networks, many real world activities are realized on the Internet. We proposed a complete virtual conference system (VCS) to handle all activities of real-world conferences. The VCS includes a virtual conference management system and a mobile virtual conference system. Video conferencing is a trend of future communications. With the improvement of broadband network technologies, video conferencing becomes possible in the global society. It is feasible to use video conferencing technologies to organize future international conferences. This research proposed a total solution toward virtual conferencing. We use a mobile server/storage pre-broadcasting technique, as well as a communication network optimization algorithm, which is based on a graph computation mechanism. With the assistant of a conference management system, the system is able to support virtual conferencing in the future academic society.
A Novel Intrusion Detection System Model for Securing Web-based Database Systems
Authors: Shu Wenhui, Daniel Tan
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Intrusion Detection (ID) has become an important technology for protecting information resources and databases from malicious attacks and information leakage. This paper proposes a novel two-layer mechanism to detect intrusions against a web-based database service. Layer one built historical profiles based on audit trails and other log data provided by the web server and database server. Pre-alarms would be triggered if anomalies occurred. Layer two made further analysis on the pre-alarms generated from layer one. Such methods integrated the alarm context with the alarms themselves rather than a simple "analysis in isolation". This would reduce error rates, especially false positives and greatly improve the accuracy of intrusion detection, alarm notification and hence more effective incident handling.
Hypermedia Database ``Himotoki'' and Its Applications
Authors: Yoshinori Hara, Kyoji Hirata, Hajime Takano, Shigehito Kawasaki
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

This paper describes the design concept of a hypermedia database "Himotoki" and its navigational capabilities. A hypermedia database is a system that integrates hypermedia operations with database models. Advantages are: (a) its structured design can improve authoring and browsing capabilities for large hypermedia applications, (b) nodes and links can be automatically generated under a certain condition, (c) navigational data interface for DBMS is obtained, etc.For providing cost-effective operations as hypermedia databases, we introduce a set-to-set linking and the navigational functions, i.e., media-based navigation, schema navigation, moving hot-spot navigation. These functional capabilities make media contents well-organized so as to improve the human-machine interactive interface. Implemented applications such as "Electronic Aquatic Life" and "Hypermedia Museum" demonstrate the usefulness of Himotoki navigational functions and customizability of its architectural design.
Good Processor Management = Fast Allocation + Efficient Scheduling
Authors: Byung S. Yoo, Chita R. Das
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Fast and efficient processor allocation and job scheduling algorithms are essential components of a multi-user multicomputer operating system. In this paper, we propose two novel processor management schemes which meet such demands for mesh-connected multicomputers. A stack-based allocation algorithm that can locate a free submesh for a job very quickly using simple coordinate calculation and spatial subtraction is proposed. Simulation results show that the stack-based allocation algorithm outperforms all the existing allocation policies in terms of allocation overhead while delivering competitive performance. Another technique, called group scheduling, schedules jobs in such a way that the jobs belonging to the same group do not block each other. The groups are scheduled in an FCFS order to prevent starvation. This simple but efficient scheduling policy reduces the response time significantly by minimizing the queueing delay for the jobs in the same group. These two schemes, when used together, can provide faster service to users with very little overhead.
An Optical Interconnect Model for k-ary n-cube Wormhole Networks
Authors: Mongkol Raksapatcharawong, Timothy Mark Pinkston
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper presents an optical interconnect model for k-ary n-cube network topologies based on free-space analysis. This model integrates relevant parameters inherent to optics with traditional network parameters to make it applicable for performance evaluation of parallel processor optical network designs. We apply this model to a free-space diffractive-reflective optical interconnect and compare our results with electronic-based networks.
Probabilistic Framework for Combining Multiple Classifiers at Abstract Level
Authors: Hee-Joong Kang, Jin H. Kim
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Most previous studies assumed that classifiers behave independently. Such an assumption makes classification performance be degraded and biased, in case of adding highly dependent classifiers. In order to overcome such weakness, it should be considered to combine multiple classifiers in a probabilistic framework using a Bayesian formalism without the assumption. Probabilistic combination of K classifiers needs a (K+1)st-order probability distribution. However, it is well known that the distribution becomes unmanageable in storing and estimating, even for a small K. Chow and Liu as well as Lewis proposed a product approximation of a high order distribution with a set of only first-order tree dependencies or second-order distributions. However, if a classifier follows more than one classifier, such a first-order dependency will not be suitable to approximate the high order distribution properly. In this paper, a probabilistic framework is proposed to identify an optimal product set of kth-order dependencies for an approximation of the (K+1)st-order probability distribution where 1 \leq k \leq K, and to combine K decisions by the identified product set using a Bayesian formalism. This framework was experimented and evaluated with a standardized CENPARMI data base and showed superior performance than other combination methods.
Robust Watershed Segmentation Using the Wavelet Transform
Authors: C. R. Jung, J. Scharcanski
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract. The watershed transform has been used for image segmentation relying mostly on image gradients. However, background noise tends to produce spurious gradients, that cause over-segmentation and degrade the output of the watershed transform. Also, low-contrast edges produce gradients with small magnitudes, which may cause different regions to be erroneously merged. In this paper, a new technique is presented to improve the robustness of watersheds segmentation, by reducing the undesirable over-segmentation. A redundant wavelet transform is used to denoise the image and enhance the edges in multiple resolutions, and the image gradient is estimated with the wavelet transform. The watershed transform is then applied to the obtained gradient image, and segmented regions that do not satisfy specific criteria are removed.
The Interpersonal and Intrapersonal Variability Influences on Off-Line Signature Verification Using HMM
Authors: Edson J. R. Justino, Flávio Bortolozzi, Robert Sabourin
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

The off-line signature verification rests on the hypothesis that each writer has similarity amongsignature samples, with small distortion and scale variability. This kind of distortion represents the intrapersonal variability [3]. This paper reports the interpersonal and intrapersonal variability influences in a software approach based on Hidden Markov Model (HMM) classifier [1,5,7]. The experiments have shown the error rates variability considering different forgery types, random, simples and skilled forgeries. The mathematical approach and the resulting software also report considerations in a real application problem.
Performance Prediction of PVM Programs
Authors: Michael R. Steed, Mark J. Clement
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

As workstation clusters gain popularity as a parallel computing platform, there is an increasing need for performance tools that support these platforms. Performance prediction is important for performance analysis of scalable parallel applications. Although there are several performance tools available that work with PVM programs, none are capable of performance prediction. We have developed the APACHE (Automated PVM Application Characterization Environment) performance prediction system for PVM programs running on workstation clusters. We review the system implementation and present some experimental results obtained with the system.
Extra-Enterprise Production Planning in ExPlanTech System
Authors: Jirí Vokrínek, Ales Ríha, Michal Pechoucek, Vladimír Marík
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

The work presented in this paper reports on extending the intra-enterprise multi-agent production planning to the extra-enterprise level. By reusing and extending the classical multi-agent production planning infrastructure the extra-enterprise technology helps to organise external business relations of an enterprise and optimize their supply chains. It is obvious that small and medium enterprises that operate in project-driven manufacturing, need to share their available resources in the most optimal way.
Recognizing Letters in on-line Handwriting using Hierarchical Fuzzy Inference
Authors: A. Hennig, N. Sherkat, Robert J. Whitrow
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

The recognition of unconstrained handwriting has to cope with the ambiguity and variability of cursive script. Preprocessing techniques are often applied to on-line data before representing the script as basic primitives, resulting in the propagation of errors introduced during pre-processing. This paper therefore combines pre-processing of the data (i.e. tangential smoothing) and encoding into primitives (Partial Strokes) in a single step. Finding the correct character at the correct place (i.e. letter spotting) is the main problem in non-holistic recognition approaches. Many cursive letters are composed of common shapes of varying complexity that can in turn consist of other sub-shapes. In this paper, we present a production rule system using Hierarchical Fuzzy Inference in order to exploit this hierarchical property of cursive script. Shapes of increasing complexity are found on a page of handwriting until letters are finally spotted. Zoning is then applied to verify their vertical position.
A Schema Intergration Architecture for Multidatabase Systems
Authors: Guoren Wang, Ge Yu, Bin Zhang, Huaiyuan Zheng
Venue: Proceedings of the 21st International Computer Software and Applications Conference (1997)

This paper presents a three-level schema integration architecture which consists of local schemas, mapped schemas, and a global scema, for global multidatabase systems, And Schema mapping rules, merging and restructuring rules are also presented in the paper for mapping local schemas into mapped schemas and for merging and restructuring the mapped schemas to get a final global schem.
Applying Topic Maps to Ad Hoc Workflows for Semantic Associative Navigation in Process Networks
Authors: Carsten Huth, Stefan Smolnik, Ludwig Nastansky
Venue: Proceedings of the Seventh International Workshop on Groupware (2001)

Abstract: The increasing integration of groupware-based office systems in the internal business processes of companies leads to growing information memories. A significant part of work in such an office environment involves a combination of highly structured processes and tasks where the process is fuzzy and the rules, routes, and roles are dynamically defined as the work is being done (ad hoc processes). Until now, this type of processes has been viewed as not worthwhile to be supported by specific tools or systems. The GroupProcess project postulates the need for an effective support of ad hoc workflows in groupware-based office environments. An inherent challenge in this project is the analysis of a great amount of already run workflows. As a solution we chose topic maps to identify distributed knowledge structures in a process-oriented groupware environment. Topic maps provide mechanisms for navigating and linking, as well as options for extensive searches and investigations to explore and to use the complex information and knowledge offer. The usage of topic maps addresses the challenge of analyzing run ad hoc workflows. Furthermore, applying topic maps to workflows in general enables the identification of the implicit and inherent process knowledge.
Distance Measures for Effective Clustering of ARIMA Time-Series
Authors: Konstantinos Kalpakis, Dhiral Gada, Vasundhara Puttagunta
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Many environmental and socioeconomic time-series data can be adequately modeled using Auto-RegressiveIntegrated Moving Average (ARIMA) models. We call such Time-series ARIMA time-series. We consider the problem of clustering ARIMA time-series. We propose the use of the Linear Predictive Coding (LPC) cepstrum of time-series for clustering ARIMA time-series, by using the Euclideandistance between the LPC cepstra of two time-series as their dissimilarity measure. We demonstrate that LPC cepstral coefficients have the desire features for accurate clustering and efficient indexing of ARIMA time-series. For example, few LPC cepstral coefficients are sufficient in order todiscriminate between time-series that are modeled by different ARIMA models. In fact this approach requires fewer coefficients than traditional approaches, such as DFT and DWT. The proposed distance measure can be use for measuring the similarity between different ARIMA models as well.We cluster ARIMA time-series using the Partition Around Medoids method with various similarity measures. We present experimental results demonstrating that using the proposed measure we achieve significantly betterclusterings of ARIMA time-series data as compared to clusterings obtained by using other traditional similaritymeasures, such as DFT, DWT, PCA, etc. Experiments wereperformed both on simulated as well as real data.
Automatic Topic Identification Using Webpage Clustering
Authors: Xiaofeng He, Chris H. Q. Ding, Hongyuan Zha, Horst D. Simon
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Grouping webpage into distinct topics is one way to organize the large amount of retrieved information on the web. In this paper, we report that based on similaritymetric which incorporates textual information, hyperlinkstructure and co-citation relations, an unsupervised clustering method can automatically and effectively identify relevant topics, a shown in experiments on several retrieved sets of webpages. The clustering method is a state-of-art spectral graph partitioning method based on normalized cutcriterion first developed for image segmentation.
Towards Local Control for Image-Based Texture Synthesis
Authors: Leandro Tonietto, Marcelo Walter
Venue: Proceedings of the 15th Brazilian Symposium on Computer Graphics and Image Processing (2002)

Abstract. New advances in image based texture synthesis techniques allow the generation of arbitrarily sized textures based on a small sample. The generated textures are perceived as very similar to the given sample. One main drawback of these techniques, however, is that the synthesized result cannot be locally controlled, that is, we are able to synthesize a larger version of the sample but without much variation. We present in this paper a technique which improves on current fast texture synthesis techniques by allowing local control over the result.By local control we mean a final texture that is still perceived as a whole but presents variations in size of the basic elements. Our solution generates the final texture from a small collection of the same sample at different resolutions, adequately interpolated. We illustrate our results with some examples, including natural textures such as animal coat patterns, which exhibit local variations that can be adequately captured by our algorithm.
Workflow and Data Management in InConcert
Authors: Sunil K. Sarin
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

InConcert is an object-oriented client-server workflow management system. An overview is provided of the functionality of InConcert and how it is implemented on an underlying relational database management system. Data management issues in supporting distributed workflow are briefly reviewed.
Addressing Scalability Issues Using the CLF Middleware
Authors: Damián Arregui, François Pacull, Jutta Willamowski
Venue: Proceedings of the 5th IEEE International Conference on Enterprise Distributed Object Computing (2001)

Abstract: This article illustrates how to easily address scalability issues within distributed applications built on top of the Coordination Language Facility (CLF) middleware. CLF provides a distributed object computing framework with high expressiveness, flexibility and dynamicity. Our solutions rely on a core set of techniques such as replication, caching and distribution. We decline them along a geographical, a numerical, and an administrative dimension. We illustrate our approach with examples taken from Yaka, an application in the field of knowledge management and document awareness. In the context of this application we show in detail how the coordination model of the CLF and its associated scripting language enable straightforward solutions to various scalability issues.
A Parallel Algorithm for Minimization of Finite Automata
Authors: Bala Ravikumar, X. Xiong
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In this paper, we present a parallel algorithm for the minimization of deterministic finite state automata (DFA's) and discuss its implementation on a connection machine CM-5 using data parallel and message passing models. We show that its time complexity on a p processor EREW PRAM (p \leq n) for inputs of size n is O(\frac{n\log ^2n}{p}+\log n\ \log p) uniformly on almost all instances. The work done by our algorithm is thus within a factor of O(\log n) of the best known sequential algorithm. The space used by our algorithm is linear in the input size. The actual resource requirements of our implementations are consistent with these estimates. Although parallel algorithms have been proposed for this problem in the past, they are not practical. We discuss the implementation details and the experimental results.
Electronics and Telecommunications Research Institute: A Multiprocessor Server with a New Highly Pipelined Bus
Authors: Woo-Jong Hahn, Ando Ki, Kee-Wook Rim, Soo-Won Kim
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

In this paper, we explore the design issues of a shared bus with pipelined protocol, so called HiPi+Bus, which is implemented for a multiprocessor server. The characteristics and design parameters for the HiPi+Bus are described. In the viewpoint of a pipelined bus, a block transfer is no good because of involving complex and unbalanced pipeline. However, it is requested by a local cache memory of which line size tends to be increased. To get the best performance and compensate unbalanced data transfer characteristic caused by block transfer, a responder queue for the bus interface is also proposed. According to the simulation results, it is explored that the HiPi+Bus, with help of the responder queue, can provide balanced service for more than 16 processors, which is important in running commercial applications. The HiPi+Bus is implemented for the TICOM III, a successor of the TICOM II which is the main server of the national administrative information network in Korea.
Balancing Conciseness, Readability and Salience in Generated Text
Authors: Bruce Eddy, Alison Cawsey
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In this paper we present an architecture for generating texts that vary in the emphasis put on conciseness, readability and the marking of particularly salient items. We abandon the traditional pipeline architecture, and use an integrated approach which makes the search for an optimum text explicit, taking into account both inter-sentential and intra-sentential features. This approach can be used in generating paragraph length texts, optimised against variouscriteria.