ppxscal/embedding_network huggingface dataset:
A Real-Time Communication Method for Wormhole Switching Networks
Authors: Byungjae Kim, Jong Kim, Sung Je Hong, Sunggu Lee
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

In this paper, we propose a real-time communication scheme that can be used in general point-to-point real-time multicomputer systems with wormhole switching. Real-time communication should satisfy the two requirements of predictability and priority handling. Since traditional wormhole switching does not support priority handling, which is essential in real-time computing, flit-level preemption is adopted in our wormhole switching. Also, we develop an algorithm to determine the message transmission delay upper bound to predict worst-case message delay. Simulation results show that the delay upper bounds calculated using the proposed algorithm are very close to actual average message transmission delays for messages with high priorities.
Recognition of Facsimile Documents using a Database of Robust Features
Authors: G. Raza, A. Hennig, N. Sherkat, R. J. Whitrow
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A method for the recognition of poor quality documents containing touching characters is presented. The method is based on extraction of independent and robust features of each object of a sample word, where objects consist of single letters or of several touching ones. Thus avoiding letter segmentation the method eliminates errors frequently introduced in segmentation based approaches. Feature are attributed by their position and extent in order to facilitate discrimination between different classes of objects. A method for automatic construction of a comprehensive database is presented. From a given dictionary every possible letter combination is obtained and the images of the artificially touching letters created. These images are subjected to noise and their features extracted.. For recognition, alternatives for each object are found based on the database. Object alternatives are then combined into valid word alternatives using lexicon lookup.
On the Dynamic Initialization of Parallel Computers
Authors: Stephan Olariu, Ivan Stojmenovic, Albert. Y. Zomaya
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to be contended with at power-up time. The problem -- henceforth called the initialization problem -- is fundamental, for virtually all parallel algorithms known to the authors assume that the processors know their global coordinates within the newly created entity.Rather surprisingly, the initialization problem has not received the attention it deserves. Our main contribution is to present parallel algorithms for the initialization problem on a number of network topologies, including complete binary trees, meshes of trees, pyramids, linear arrays, rings, meshes, tori, higher dimensional meshes and tori, hypercubes, butterflies, linear arrays with a global bus, rings with a global bus and meshes with multiple broadcasting, under various assumptions about edge labels, leader existence, and a priori knowledge of the number of nodes in the network.
Data and Applications Security: Developments and Directions
Authors: Bhavani M. Thuraisingham
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

This paper first describes the developments in data and applications security with a specialemphasis on database security. Then it discusses direction for data and applications securitywhich includes secure semantic web, XML security, and security for emerging applicationssuch as bioinformatics, peer-to-peer computing, and stream information management.
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
Authors: Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum, Russell A. Martin
Venue: Proceedings of the 43rd Symposium on Foundations of Computer Science (2002)

We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] have recently given a fully polynomial randomized approximation scheme (fpras) for the related counting problem, which only employs Markov chain methods indirectly. But they leave open the question as to whether a natural Markov chain on such tables mixes rapidly. Here we answer this question in the affirmative, and hence provide a very different proof of the main result of [3]. We show that the "2 × 2 heat-bath" Markov chain is rapidly mixing. We prove this by considering first a heat-bath chain operating on a larger window. Using techniques developed by Morris and Sinclair [20] (see also Morris [19]) for the multidimensional knapsack problem, we show that this chain mixes rapidly. We then apply the comparison method of Diaconis and Saloff-Coste [8] to show that the 2 × 2 chain is rapidly mixing. As part of our analysis, we give the first proof that the 2 × 2 chain mixes in time polynomial in the input size when both the number of rows and the number of columns is constant.
Binding Time in Distributed Shared Memory Architectures
Authors: Jinseok Kong, Gyungho Lee
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

This paper revisits three distributed shared memory (DSM) architectures to clarify them with their binding times for new addresses at the local memory: page fault time, node miss time, and cache miss time. The DSM architectures which have different binding times arrange data in different ways with different overheads at an event of reference. Since a large number of cache misses can occur in a large (relative to the cache size) working set, binding at the page fault time alone cannot efficiently utilize locality of reference at the local memory. In a small working set, most of the addresses bound to the local memory at a node miss time are not effective due to the low cache miss rate. This paper shows that binding at the cache miss time can improve system performance.
Evaluation and Optimization of the LIVING IN A LATTICE Rule Language
Authors: Holger Riedel, Andreas Heuer
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

We introduce an evaluation technique for a declarative OODB query language. The query language is rule-based and can be evaluated and optimized using an appropriate object algebra. We introduce a new framework which uses concepts of the object-oriented data model to define adequate accesses to the database. Additionally, the problems according to the evaluation of recursive queries are discussed.
Fuzzy Cognitive Agents for Personalized Recommendation
Authors: Chunyan Miao, Qiang Yang, Haijing Fang, Angela Goh
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

There is an increasing need for various web-service,e-commerce and e-business sites to provide personalizedrecommendations to on-line customers. This paperproposes a new type of personalized recommendationagents called fuzzy cognitive agents. Fuzzy cognitiveagents are designed to give personalized suggestionsbased on the user's current personal preferences, otheruser's common preferences, and expert's domainknowledge. Fuzzy cognitive agents are able to representknowledge via extended fuzzy cognitive maps, to learnusers' preferences from most recent cases and to helpcustomers make inferences and decisions throughnumeric computation instead of symbolic and logicdeduction. A case study is included to illustrate howpersonalized recommendations are made by fuzzycognitive agents in e-commerce sites. The case studydemonstrates that the fuzzy cognitive agent is bothflexible and effective in supporting e-commerceapplications.
Incentive Engineering in Wireless LAN Based Access Networks
Authors: Raymond R.-F. Liao, Rita H. Wouhaybi, Andrew T. Campbell
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Traffic regulation in public and private wireless LANs face a number of significant challenges, particularly in commercial networks where there is a need for efficient regulation of bursty transactional applications, support for bandwidth reservation services while inhibiting bandwidth hogging by mobile devices, and incentivizing user cooperation. In this paper, we take a new approach to solving these problems by applying incentive engineering techniques to wireless access networks. We design two incentive-based allocation service classes: an instantaneous allocation (IA) class, which provides better throughput, and a stable allocation(SA) class, which provides better allocation stability. Our approach possesses a number of beneficial properties including minimizing the algorithmic and protocol overhead on mobile devices, Nash bargaining fairness for the IA service, and incentive compatibility for mobile users promoting the truthfully selection of service class and bandwidth declaration. We use analysis, simulation and experimental results from a wireless testbed to demonstrate theeffectiveness of wireless incentive engineering1.
A Documentation Suite for Maintenance Programmers
Authors: Frank A. Cioch, Michael Palazzolo, Scott Lohrer
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

A documentation approach has been developed to accelerate the productivity of maintenance programmers (mps). The documentation approach takes into account that the mp's level of understanding changes as more experience is gained. Four learning stages have been identified: newcomer, student, intern and expert. Both the type of information and the form in which it is presented differs, depending upon the mp's learning stage. Mps in the four stages receive respectively contextual overviews, design stories, task-oriented manuals and reference materials. This documentation approach has been used at U.S. Army TARDEC to develop a documentation suite for a software module serving as the core of ground vehicle simulation software for the Vetronics Simulation Facility. We describe the documentation suite and what we have learned over the past two years developing and using it.
Design of a Circuit-Switched Highly Fault-Tolerant k-ary n-cube
Authors: Baback A. Izadi, Füsun Özgüner
Venue: Proceedings of the international Conference on Parallel Processing (1997)

In this paper, we present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with (k/j)^n spare nodes; each set of j^n regular nodes is connected to a spare node and the spare nodes are interconnected as a (k/j)-ary n-cube. Our approach utilizes the circuit-switched capabilities of the communication modules of the spare nodes to tolerate a large number of faulty nodes and faulty links without any performance degradation. Both theoretical and simulation results are presented.
Semantic Web and Knowledge Representation
Authors: Gian Piero Zarri
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

In this paper, we suggest that it should be possible to come closer to the Semantic Web goals by enhancing the ontology paradigm and, in particular, by supplementing the traditional' ontologies of concepts with ontologies of events'. We present then some of the properties of NKRL (Narrative Knowledge Representation Language). This conceptual modeling formalism makes use of ontologies of events to denote the semantic characteristics of those narratives' that represent a very large percentage of the global Web information.
Supporting Software Distributed Shared Memory with an Optimizing Compiler
Authors: Tatsushi Inagaki, Junpei Niwa, Takashi Matsumoto, Kei Hiraki
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

To execute a shared memory program efficiently, we have to manage memory consistency with low overheads, and have to utilize communication bandwidth of the platform as much as possible. A software distributed shared memory (DSM) can solve these problems via proper support by an optimizing compiler. The optimizing compiler can detect shared write operations, using interprocedural points-to analysis. It also coalesces shared write commitments onto contiguous regions, and removes redundant write commitments, using interprocedural redundancy elimination. A page-based target software DSM system can utilize communication bandwidth, owing to coalescing optimization. We have implemented the above optimizing compiler and a runtime software DSM on AP1000+. We have obtained a high speed-up ratio with the SPLASH-2 benchmark suite. The result shows that using an optimizing compiler to assist a software DSM is a promising approach to obtain a good performance. It also shows that the appropriate protocol selection at a write commitment is an effective optimization.
Domain-Independent eNegotiation Design: Prospects, Methods, and Challenges
Authors: Dirk Neumann, Christof Weinhardt
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

Designing electronic markets is still a rather intricate process. eNegotiation - and thereby trading rules - embody the core of the institution "electronic market". Although success or failure of electronic markets is strongly influenced by the design of the trading rules the design process currently constitutes a trial-and-error game. It is only partly guided by theory and by all available evidence, but it also uses ad-hoc methods to resolve issues about which theory is silent. Consequently, this paper suggests a conceptual framework for domain-independent eNegotiation design. The core of the framework is described by an expertise model which divides knowledge into three categories: domain, task and inference knowledge. The main contribution of this expertise model is twofold. Firstly, it can guide the further acquisition of knowledge. Secondly, a knowledge based system that could be built upon this model rendersreproducible designs. In case the expertise model is sufficiently well formed the system can be used to perform - if not the entire design process - at least the step of preanalysis. This developed expertise model is deemed promising to turn the trial-and-error game of market design from a question of arts more to an engineering approach.
Performance Analysis and Optimization of a Parallel Carbon Molecular Dynamic Code on a Cray T3E
Authors: Mihai Horoi, Richard J. Enbody
Venue: Proceedings of the 1998 International Conference on Parallel Processing (1998)

An analysis of the primary factors influencing the performance of a parallel implementation on a Cray T3E of a Carbon Molecular Dynamics code developed at Department of Physics and Astronomy at Michigan State University is presented. We show that classical load-sharing techniques combined with careful analysis of Amdahl's law can be successfully used to significantly increase the performance of the code. This report describes the quantitative analysis of these factors and the solutions used to diminish or eliminate their effects. By slightly modifying the code we reduced its sequential portion to less than 0.1%. We also demonstrate that the MPI collective communications implementation on the Cray T3E dramatically reduces the communication overhead for our code. In the end, a speedup of 170 was obtained using 256 Cray T3E processing elements. These results create the prospect of simulating the dynamics of 1,000-atom nanotubes in the microsecond regime (~1,000,000 time steps).
A simple Voronoi diagram algorithm for a reconfigurable mesh
Authors: Hossam A. ElGindy, Lachlan Wetherall
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

We introduce a simple and efficient algorithm for computing the Voronoi diagram for n planar points on a reconfigurable mesh of size O(n)/spl times/O(n). The algorithm has a worst case running of O(logn log logn) time, and O(logn) in practice. The algorithm exploits the O(1) communication diameter of the reconfigurable mesh model to implement efficient load balancing.
Background Compensation and an Active-Camera Motion Tracking Algorithm
Authors: Rohit Gupta, Mitchell D. Theys, Howard Jay Siegel
Venue: Proceedings of the international Conference on Parallel Processing (1997)

Motion tracking using an active camera is a very computationally complex problem. Existing serial algorithms have provided frame rates that are much lower than those desired, mainly because of the lack of computational resources. Parallel computers are well suited to image processing tasks and can provide the computational power that is required for real-time motion tracking algorithms. This paper develops a parallel implementation of a known serial motion tracking algorithm, with the goal of achieving greater than real-time frame rates, and to study the effects of data layout, choice of parallel mode of execution, and machine size on the execution time of this algorithm. A distinguishing feature of this application study is that the portion of each image frame that is relevant changes from one frame to the next based on the camera motion. This impacts the effect of the chosen data layout on the needed inter-processor data transfers and the way in which work is distributed among the processors. Experiments were performed to determine for which image sizes and number of processors which data layout would perform better. The parallel computers used in this study are the MasPar MP-1, Intel Paragon, and PASM. Different modes are examined and it is determined that mixed mode is faster than SIMD or MIMD implementations.
Consistency and Performance of Concurrent Interactive Database Applications
Authors: Konstantinos Stathatos, Stephen Kelley, Nick Roussopoulos, John S. Baras
Venue: Proceedings of the Twelfth International Conference on Data Engineering (1996)

In many modern database applications, there is an emerging need for interactive environments where users directly manipulate the contents of the database. Graphical user interfaces (GUIs) display images of the database which must reflect a consistent up--to--date state of the data with minimum perceivable delay to the user. Moreover, the possibility of several applications concurrently displaying different views of the same database increases the overall system complexity. In this paper, we show how design, performance and concurrency issues can be addressed by adapting existing database techniques. We propose the use of suitable display schemas whose instances compose active views of the database, an extended client caching scheme which is expected to yield significant performance benefits and a locking mechanism that maintains consistency between the GUIs and the database.
A Compact Neural Network Based CDMA Receiver for Multimedia Wireless Communication
Authors: David C. Chen, Bing J. Sheu, Theodore W. Berger
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

A compact neural network receiver to process code division multiple access (CDMA) communication is presented. In CDMA system, near-far problem is a major impediment for the performance of a conventional detector. By using a compact neural network with hardware annealing function and combinatorial optimazion technique, an optimal multiuser detector can be implemented. The algorithm and architecture of the compact neural network based CDMA receiver are described.
Enhancing the Volumetric Approach to Stereo Matching
Authors: Italo De Oliveira Matias, Antonio Alberto Fernandes De Oliveira
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

Describes a volumetric stereo algorithm for obtaining disparity maps and identifying the presence of occlusions. It works in the (row /spl times/ column /spl times/ disparity range) space, initializing the voxels with a measure of the similarity between the stereo pair they represent (similarity phase) and refining these values through an iterative process which inhibits all voxels but one, placed along the same line of sight (competition phase). By ceasing the updating of those voxels that showed little promise, it was possible to enhance the time performance without influencing the results in all tested examples. Also, to obtain smoother maps, a dynamic programming process is applied to obtain the final solution.
Compression and Its Metrics for Multimedia
Authors: W. Kinsner
Venue: Proceedings of the 1st IEEE International Conference on Cognitive Informatics (2002)

Multimedia involves a myriad of data and multidimensional signals, including not only plain andformatted text, but also mathematical and other symbols, tables, vector and bitmap graphics, images, sound, animation, video, and interactive virtual reality objects. Space or airborne remote sensing also produces very large images. Telemedicine and telerobotics require signalmonitoring and multichannel video transmission. Compression of such signals is usually necessary to fit them into the available communications channels and digital storage, or for data mining. This paper provides an overview of important compression methods andtechniques, including lossless entropy coding techniques designed to reduce the redundancy in the critical multimedia material, as well as lossy coding techniques designed to preserve the relevancy of the noncritical multimedia material. Modern lossy techniques often employ wavelets, wavelet packets, fractals, and neural networks. Progressive image transmission is also employed to deliver the material quickly. The paper also addresses several approaches to blind separation of signal from noise (denoising) to improve the compression, and to the difficult question of objective and subjective image quality assessment through complexity metrics. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Markov Model Order Optimization for Text Recognition
Authors: Christian Olivier, Frédéric Jouzel, Manuel Avila
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Markov models are currently used for printed or hand-written words recognition. The order k is a very important parameter of these models. The aim of this paper is to use model selection criteria in order to estimate the order of a Markov model. H. Akaike (1973) suggested the AIC criterion for the estimation of the order k of a parameterized statistical model, including the term k as penalization of the likelihood function. Yet, selection according to this criterion leads asymptotically to a strict overestimation of the order. That is why we suggest the use of other consistent criteria in a Markovian case: the Bayesian and the Hannan and Quinn Information Criteria. The performance of the criteria are analysed on simulated data and on a real case: a hand-written word description. We discuss the limit of these methods in relation to the number of states in the model.