ppxscal/embedding_network huggingface dataset:
Juggling polynomials
Authors: Lute Kamstra
Venue:  (2001)

A mathematical model for juggling has previously been described by Buhler, Eisenbud, Graham and Wright. This paper uses this model and observes that juggling patterns have different `states'' at different times. States can be represented by polynomials. This representation is exploited to give a new proof of an enumeration theorem on juggling patterns by Buhler et al. The paper concludes by discussing state graphs and a generalization of the juggling model. Both lead to new enumeration problems. 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
Comparing Three Interconnection Networks Embedded In a Multiprocessor System
Authors: T J Blake, S K Trivedi
Venue:  (1987)

In this paper, we compare performance, reliability, and performability measures for three architectural alternatives of a multiprocessor system constructed from processors, shared memories, and an interconnection network for communication between the processors and the memories. The crossbar and the Omega networks are used to represent the interconnection network, and two implementations of the crossbar are considered. Closed-form combinatorial expressions, Markov chains, and Markov reward models are used in the analysis. The use of state lumping enables us to compute reliability and performability measures for a system with 16 processors, 16 memories and an Omega network. We show that both the requirement for processor-memory connectivity and the metric for comparison influence the preference for one architectural alternative over the others.
Focus on Quality of Design: Does it Help or Hinder Time to Market?
Authors: Nader Vasseghi, Rita Glover
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

The ability to deliver high quality products on time has become increasingly important in today's competitive environment. Speed and time to market, are the new competitive weapons. The ability to accelerate products from concept to production, and ahead of the competition, is more than ever central to success.So, what is the shortest path from concept to production? One school of thought is to focus on total quality along the way with an aim to ensure that the first product is fully functional and as close to production worthy as possible. This usually means following systematic product development processes with detailed quality check points and gate reviews built-in at every stage.On the other hand, some view this as too much of bureaucracy, rules, and restrictions that slow down and hinder the first introduction of the product to market. This point of view believes in getting the product out as soon as possible to get the necessary technical and marketing validations early, and then continue on improving and polishing the product to make it production worthy.
Moving away from a hacker vs. disciplined-based organizational legacy-an organization theory perspective on software processes
Authors: N. Staudenmayer
Venue: Proceedings of the 10th International Software Process Workshop (1996)

Software firms, like producers in any industry, face a spectrum of product and process choices. Historically, however, this continuum has been anchored by two contrasting approaches to software development, and these paradigms continue to dominate literature and practice today: the hacker versus a more discipline-based approach. As application type software products have become larger and more complex, former practitioners of the hacker approach have had to impose more discipline and structure on their development process. Likewise, discipline-based firms are having to learn to work more flexibly in the face of increasingly volatile competition and reduced cycle times. This paper addresses the managerial challenges presented by these converging models. Can firms overcome their legacy as either a hacker or disciplinarian without sacrificing the advantages associated with their old approach?.
WWW-Oriented System for Visualization, Animation and Investigation of Mapping Algorithms
Authors: O. G. Monakhov, O. J. Chunikhin
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

TOPAS, programming environment for visualization, animation and investigation of algorithms of mapping graphs of parallel programs into graphs of parallel computing systems implemented on Java and accessible on WWW is submitted.
Empirically Derived Design Issues in Auditory Information Processing for Mobile Telephony
Authors: D. I. Rigas, D. Memery, D. Hopwood, M. A. Rodrigues
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper investigates empirically design issues in auditory information processing, relevant to interfaces for mobile telephony. This investigation forms the initial part of a larger experimental program, which aims to investigate design methodologies for auditory-multimedia interfaces. Structured musical and environmental audio was used to communicate simple and complex (i.e., larger amounts) information for mobile telephony.The contribution of this paper is in the empirical investigation of the perceptual principles involved in using auditory stimuli to communicate information rather than the mere application of sound in this problem domain. Some of these experiments also aim to communicate information that would normally be communicated using the visual displays of mobile devices.Results indicate perceptual issues that need to be considered in the design process of auditory interfaces. Memory demands on users may in some cases prevent the correct interpretation of the auditory stimuli. Other issues observed to help the designing process of auditory user interfaces include the creation of perceptual context, semantic coding and auditory user interaction model.
Integration of soft computing towards autonomous legged robots
Authors: Anthony Wong, Marcelo H. Ang,  Jr.
Venue: Autonomous robotic systems: soft computing and hard computing methodologies and applications (2003)

Mobile robots are extensively used in various terrains to handle situations inaccessible to man. Legged robots in particular are tasked to move in uneven terrain. Hence the primary problem of these robots is locomotion in an autonomous fashion. Autonomy is important as the tasks are plagued with many uncertainties. Some of these tasks include leg movement and coordination, navigation, localisation, and stability during movement, all operating in dynamic and unexplored territories.Classical control and traditional programming methods provide stable and simple solutions in a known environment. The environment that legged robots work in is dynamic and unstructured, and such control methods are not always able to cope with. It is difficult to model the environment to provide the controller with the relevant data and program actions for all possible situations. Hence controllers with abilities to learn and to adapt are needed to solve this problem. Soft computing provides an attractive avenue to deal with these situations.Soft computing methods are based on biological systems and they provide the following features: generalisation, adaptation and learning. As more is realised about the use and properties of soft computing methods, the development of controller is shifting towards using soft computing. They have properties that can be used to improve the stability, adaptability, and generalisation of the controllers. Some of the more popular methods used are fuzzy logic, artificial neural networks, reinforcement learning and genetic algorithms. They are commonly integrated with classical methods to enhance the features of classical controllers and vice versa. Each soft computing method serves a different purpose, with its advantages and disadvantages, and the methods are often used together to complement each other.This chapter provides a survey on the different uses of soft computing methods in the different aspects of legged robotics. We see how soft computing methods and classical techniques compliment each other. Two areas of legged robotics are dealt with - control architecture and the problem of navigation. The Central Pattern Generator (CPG) controller and the behaviour-based controller are two architectures presented in this chapter. Various soft computing techniques are used to implement and improve these two controllers.
Systolic Array Implementation of Block Based Hopfield Neural Network for Pattern Association
Authors: Ming-Jung Seow, Hau Ngo, Vijayan Asari
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

This paper suggests the systolic arrayimplementation of block based Hopfield neural networkarchitecture using completely digital circuits. Thedesign is based on rewriting the energy equation ofHopfield neural network to a systolic (or modular) form.The performance of the proposed architecture isevaluated by applying various binary inputs and it isobserved that the network provides massive parallelismand can be extended by cascading identical chips.
Intelligent Heterogeneous Multimedia and Intelligent Active Visual DB and KB
Authors: Cyrus F. Nourani
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

Intelligent multimedia provides a basis as briefed here for designing active databases with agents, multimedia and intelligent objects. Intelligent Multimedia techniques and paradigms are defined. Multimedia paradigms can be applied to customize with many facets for many application areas. The computing techniques, a language, the Morph Gentezen deductive system and its models are applied towards an active multimedia database customization interface design. The application area is based on AI planning and reasoning defining specific dynamics based on descriptions and compatibility relations. Intelligent visual computing paradigms are applied to define the multiagent multimedia computing and active databases and pre-specified views
Optimal Prefetching via Data Compression
Authors: S J Vitter, Krishnan,  P
Venue:  (1995)

Caching and prefetching are important mechanisms for speeding up access time to data on secondary storage. Recent work in competitive online algorithms has uncovered several promising new algorithms for caching. In this paper we apply a form of the competitive philosophy for the first time to the problem of prefetching to develop an optimal universal prefetcher in terms of fault ratio, with particular applications to large-scale databases and hypertext systems. Our prediction algorithms for prefetching are novel in that they are based on data compression techniques that are both theoretically optimal and good in practive. Intuitively, in order to compress data effectively, you have to be able to predict future data well, and thus good data compressors should be able to predict well for purposes of prefetching. We show for powerful models such as Markov soursces and {\em m}th order Markov sources that the page fault rates incurred by our prefetching algorithms are optimal in the limit for almost all sequences of page requests.
Context-Dependent Substroke Model for HMM-Based On-Line Handwriting Recognition
Authors: Junko Tokuno, Nobuhito Inami, Shigeki Matsuda, Mitsuru Nakai, Hiroshi Shimodaira, Shigeki Sagayama
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper describes context-dependent substroke hidden Markov models (HMMs) for on-line handwritten recognition of cursive Kanji and Hiragana characters. As there are more than 6,000 distinctive characters including Kanji and Hiragana in Japanese, modeling each character by an HMM leads to an infeasible character-recognition system requiring huge amount of memory and enormous computation time. In order to tackle this problem, we have proposed the substroke HMM approach where a modeling unit "substroke" that is much smaller than a whole character is employed and each character is modeled as a concatenation of only 25 kinds of substroke HMMs. One of the drawback of this approach is that the recognition accuracy deteriorates in case of scribbled characters, and characters where the shape of the substrokes varies a lot. In this paper, we show that the context-dependent substroke modeling which depends on how the substroke connects to the adjacent sub-strokes is e....ective to achieve robust recognition of low quality characters. The Successive State Splitting (SSS) algorithm which was mainly developed for speech recognition is employed to construct the context dependent substroke HMMs. Experimental results show that the correct recognition rate improved from 88% to 92% for cursive Kanji handwritings and from 90% to 98% for Hiragana handwritings.
Partitionable Light-Weight Groups
Authors: L. Rodrigues, Katherine Guo
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Group communication, providing virtual synchrony semantics, is a powerful paradigm for building distributed applications. For applications that require a large number of groups, significant performance gains can be attained if these groups share the resources required to provide virtual synchrony. A service that maps multiple user groups onto a small number of instances of a virtually synchronous implementation is called a Light-Weight Group Service.This paper describes the design of a lightweight group service able to operate in partitionable networks. Partitions pose challenges to the design of this service, in particular because inconsistent mapping decisions can be made when the system is partitioned. The paper focuses on the design of reconciliation mechanisms needed when a partition is healed.
A Simple Host Deflection Scheme for High-Speed LANs Using Wormhole Routing
Authors: Po-Chi Hu, Leonard Kleinroc, k
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

Wormhole routing is a simple, low-cost switching scheme often used for supercomputer interconnections. Recently, it also has been applied to high-speed local area networks to support applications demanding high-data-rate communications, such as cluster computing. The drawback to wormhole routing is its low link efficiency caused by worm blocking. To overcome this blocking problem, a timeout scheme was investigated in our previous paper by analytical modeling. In this paper, we present timeout simulation results, showing the effect of packet size, propagation delay, and network size. Furthermore, a simple deflection scheme, which we call host deflection, is introduced and tested. This simple host deflection scheme requires only small modifications to the protocol and very little processing power from the switches; it improves the network throughput significantly.
A Finite Element Solver for Convection Diffusion Problems Using a Cluster of PC's
Authors: Renato Simöes Silva
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

In this work an experimental cluster of PCs is presented. Some benckmarks and a Krylov-Schwarchz solver for convection diffusion problems are considered. The results obtained are stimulating and point out the necessity of improving the topology configuration. 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
Removing divergences in the negative moments of the multi-fractal partition function with the wavelet transformation
Authors: Zbigniew R. Struzik
Venue:  (1998)

We present a promising technique which is capable of accessing the divergence free component of the partition function for the negative moments of the multi-fractal analysis of data using the wavelet transformation. It is based on implicitly bounding the local logarithmic slope of the wavelet maxima lines between the values of the Holder exponent of the singularities which are accessible for the wavelet used. The method delivers correct and stable results, illustrated using a test example of the Besicovich measure analysed with the Mexican hat wavelet. The performance of the method is then shown as applied to real-life data.
Electron Spin and Nuclear Magnetic Resonance in the Presence of a Circularly Polarized Laser: Angular Momentum of Radiation
Authors: M. W. Evans
Venue:  (1991)

A magnetic dipole moment is set up in an ESR or NMR sample by the angular momentum of circularly polarised laser radiation, selectively influencing resonances in a complex sample such as a protein in solution, leading to extra spectral information.
The Development of a Betting System on the Internet
Authors: K. T. Ng, Y. M. Siu
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

This paper describes the development of a betting system for horseracing on the Internet. The system is set up by using Java Web Server to run on the Window NT platform. The server uses Java Servlets to handle the requests from customers, to connect the database server, and to generate dynamic content for the web browser. HTTP (Hypertext Transfer Protocol) is combined with SSL (Secure Sockets Layer) protocol to guarantee secure transactions through the Internet. The system allows registered WWW users to access the web site for processing real-time betting transactions and obtaining on-line racing information.
The Compiler for Supporting Multithreading in Cyclic Register Windows
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

This paper presents the compilation technique to support the P&M (Pipelining and Multithreading) multithreaded program execution model on the SPARC processor, which has cyclic register windows. The program execution model improves the performance by running multiple user-level threads on each processor and filling the idle cycles that would otherwise be wasted waiting for messages. The integrated compilation paradigm is described systematically. The generated code is efficient, which obtains rapid context switching without sacrificing the benefit of fast procedure call.
On the Performance of Polynomial-time CLIQUE Algorithms on Very Large Graphs
Authors: Steve Homer, Marcus Peinado
Venue:  (1994)

Abstract The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halld\''{o}rsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a version of simulated annealing. These algorithms are tested on graphs with up to 10,000 vertices on a workstation and graphs as large as 70,000 vertices on a Connection Machine. Our implementations establish the ability to run clique approximation algorithms on very large graphs. We test our implementations on a variety of different graphs. Our conclusions indicate that on randomly generated graphs minor changes to the distribution can cause dramatic changes in the performance of the heuristic algorithms. The Ramsey algorithm, while not as good as the others for the most common distributions, seems more robust and provides a more even overall performance. In general, and especially on deterministically generated graphs, a combination of simulated annealing with either the Ramsey algorithm or the greedy heuristic seems to perform best. This combined algorithm works particularly well on large Keller and Hamming graphs and has a competitive overall performance on the DIMACS benchmark graphs.
Mobile-Agents for Distributed Market Computing
Authors: Shinji Tanaka, Hirofumi Yamaki, Toru Ishida
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

This paper discusses the implementation using mobile agent and the performance of the market computing to allocate network quality of service most efficiently, based on users' preference. Though the protection of users' private preference and the efficient calculation are both important, these two requirements often contradict each other.By implementing QoS Market, a market-based network resource allocation system, using mobile agents, the communication time between agents and an auctioneer, which is the largest overhead in market computing, is reduced dramatically without leaking users' privacy information. The result of experiments show a mobile agent approach is more efficient then others, and the overhead of one market computing cycle in this system is about 450msec, which means that the system achieves sufficient efficiency.
A Two-Tier Technique for Authoring Distributed Multimedia Applications
Authors: Shing-Chi Cheung, Kam-Keung Wong, Samuel T. Chanson
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Distributed multimedia systems have stringent quality of service requirements which make them difficult to specify and implement. These include near-real-time constraints and synchronization requirements as well as complex user interaction patterns. Traditional approaches to the development of distributed multimedia applications have focussed on specifying temporal constraints. Not much attention has been paid to interactive multimedia applications. The objective of this paper is to propose a two-tier approach for the development of multimedia applications which facilitates modular design. As a proof of concept, a prototype with runtime support has been developed and used to construct several non-trivial distributed multimedia applications, including a video conferencing system, a video phone system and a virtual city tour.
A Framework for Adaptive Mail Classification
Authors: Giuseppe Manco, Elio Masciari, Andrea Tagarelli
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

We introduce a technique based on data mining algorithms for classifying incoming messages, as a basis for an overall architecture for maintenance and management of e-mail messages. We exploit clustering techniques for grouping structured and unstructured information extracted from e-mail messages in an unsupervised way, and exploit the resulting algorithm in the process of folder creation (and maintenance) and e-mail redirection. Some initial experimental results show the effectiveness of the technique, both from an efficiency and a quality-of-results viewpoint.
Performance Analysis of Dynamic Location Updation Strategies for Mobile Users
Authors: Asimava Bera, Nabanita Das
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

This paper focuses on the important issue of strategies for tracking users in a mobile communication network. Since the users are mobile, the network must keep track of where the users are, a prerequisite for routing calls to the users. We assume, the mobile users periodically inform the network of its present location. Now, it is very important to decide an efficient location updation strategy, that will optimize the overhead in terms of usage of radio spectrum, and power, as well as the search cost for a mobile when a call is to set up. Static location updation strategies often result poor performance.Three dynamic location updation strategies have been considered here, namely, the time-based strategy, the movement-based strategy and the distance-based strategy. A memoryless movement pattern on a two-dimensional mesh topology of cells has been studied. Analytical models have been developed to compare the performances of the strategies. Simulation studies also have been made for performance evaluation.