ppxscal/embedding_network huggingface dataset:
Combining Functional and Object-oriented Programming Methodologies in a Large Commercial Application
Authors: Ian Poole, Craig Ewington, Steve Wille, Arthur Jones
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

Functional programming concepts of referential transparency and lazy evaluation combine effectively with objected-oriented encapsulation. We present a design pattern for C++ classes that are logically immutable and fully determined by the parameters of their constructor. Hidden state is used internally to cache the results of computation performed in the scope of accessors, giving them lazy semantics. Modifying replicators model change by constructing a new instance without changing the original. Previously computed results are lazily copied via a back reference if the parameters upon which the computation depends have not changed.Since these classes are logically immutable they can be freely shared by reference in complex networks, mitigating the amount of actual copying performed. These techniques realize several advantages - well known to the functional programming community - including suitability for modular reasoning and parallel evaluation. `Undo' facilities and safe recovery from exceptions can be provided with little extra effort. Examples from a large multi-platform biomedical imaging application illustrate the techniques.
Receiver-Cooperative Bandwidth Management for Layered Multicast
Authors: Hirozumi Yamaguchi, Teruo Higashino, Kenichi Taniguchi, Keiichi Yasumoto
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

In this paper, we propose a receiver-cooperative bandwidth management method for layered multicast streams, considering not only bandwidth requirements but also receivers' preference. In our method, we assume that each receiver has a preference value for each layer of streams. When a receiver requests an additional layer and required bandwidth is not available on links, it can let other receivers release a part of the layers of streams which they receive if, it increases the sum of the satisfied preference values of all receivers as a total. We give an algorithm to calculate an optimal way of releasing layers in a polynomial time under some assumption. We had an experiment to transmit JPEG video over a private IP network and confirmed that our method could control bandwidth among the video streams within a second.
An online programming assessment tool
Authors: Graham H. B. Roberts, Janet L. M. Verbyla
Venue: Proceedings of the fifth Australasian conference on Computing education - Volume 20 (2003)

The role of assessment in modern university curricula has become far more diverse and open to scrutiny in recent years. Although its most significant role is as a measure of a student's knowledge and skills, the role as a learning device has become increasingly important and as a consequence informative and useful feed back is critical to achieve good learning outcomesThis paper describes a tool that provides a self-contained, easy to use, programming environment that facilitates the development, testing and marking of programming tasks in addition to the presentation and marking of "standard" examination questions. The tool takes responsibility for many of the tasks that program development normally requires so that the student can focus on the task of writing program source code. It has been used in a Java programming topic for two consecutive years.
Quicksort on a Linear Array with a Reconfigurable Pipelined Bus System
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Based on the current fiber optic technology, a new computational model, called a linear array with a reconfigurable pipelined bus system (LARPBS), is proposed in this paper. A parallel quicksort algorithm is implemented on the model, and its time complexity is analyzed. For a set of N numbers, the quicksort algorithm reported in this paper runs in O( log sub 2 N ) average time on a linear array with a reconfigurable pipelined bus system of size N. Besides proposing a new algorithm on the model, some basic data movement operations involved in the algorithm are discussed. We believe that these operations can be used to design other parallel algorithms on the same model. Future research in this area is also identified in this paper.
Flexible-sized page-objects
Authors: H. Hartig, J. Wolter, J. Liedtke
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Demand-paging memory-management systems usually work with pages of fixed size. This is a limitation in systems relying on hierarchies of pagers to build layers of abstract machines. A generalized scheme is presented that allows for pages of flexible sizes and for multiple pages to be mapped within a single page-fault operation. Performance measurements (microbenchmarks) of a prototype implementation are presented.
Power Bus Maximum Voltage Drop in Digital VLSI Circuits
Authors: G. Bai, S. Bobba, I. N. Hajj
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

This paper presents a new input-independent method for finding the maximum voltage drop of power bus in digital VLSI circuits. The method relies on expressing the voltage at the power bus nodes in terms of gate currents using sensitivity analysis. Circuit timing information and circuit functionality are used to find maximum simultaneous switching and upper bounds on maximum voltage drop at a given node over a clock cycle. The effects of primary inputs(PIs) misalignment and statistical variation in the circuit delays on maximum voltage drop are automatically included in our method. HSPICE exhaustive simulation results on 3 by 3 and 4 by 4 multiplier are used to validate our work.
The Gesture Pendant: A Self-illuminating, Wearable, Infrared Computer Vision System for Home Automation Control and Medical Monitoring
Authors: Maribeth Gandy, Thad Starner, Jake Auxier, Daniel Ashbrook
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

In this paper, we present a wearable device for control of home automation systems via hand gestures. This solution has many advantages over traditional home automation interfaces in that those with loss of vision, motor skills, and mobility can use it. By combining other sources of context with the pendant, we can reduce the number and complexity of gestures while maintaining functionality. As users input gestures, the system can also analyze their movements for pathological tremors. This information can then be used for medical diagnosis, therapy, and emergency services. Currently, the Gesture Pendant can recognize control gestures with an accuracy of 95% and user-defined gestures with an accuracy of 97% it can detect tremors above 2HZ within plus or minus 0.1 Hz.
On parallelization of neural classification algorithms
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Since the mid 80's neural computing has been gaining substantial attention as an important computing paradigm. A variety of neural computation models and learning algorithms have been developed and implemented on both general-purpose computers and dedicated hardware. The spectacular advances in VLSI technology over the last few years has further sparked interest and research activities in the field. This paper examines the implementation of neural classification algorithms, the main theme is focused on the parallelisation of a novel neural classifier architecture on three different platforms including the latest on-chip ZISC036 "hyperparallel" neuro-processors. A significant advantage of implementing neural networks directly on silicon is that it overcomes performance limitations of complex networks required for real-time applications. Furthermore, the technology owes much to its efficacy in achieving an algorithmic match between the fine-grained, parallel computation structure of neural architectures and the highly regular VLSI processing model.
Entropic approach to interior point solution of linear programs
Authors: M. Diasparra, H. Gzyl
Venue: Applied Mathematics and Computation (2003)

We present a maxentropic approach for obtaining interior, suboptimal solutions to a linear programming problem (not necessarily in Karmarkar's canonical form). Each suboptimal solution lies in the relative interior set of feasible solutions. We present an application to the problem of obtaining reconstructions of minimal weighted L1-norm, of a function from the knowledge of a few of its Fourier coefficients.
On the Mutual Definability of Classes of Generalized Fuzzy Implications and of Classes of Generalized Negations and S-Norms
Authors: Helmut Thiele
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

Given the real functions $\nu : -> $ and $\sigma, \pi : ^2 -> $. First we define a functional operator $SIMP$ where $SIMP (\sigma, \nu) : ^2 -> $ and $SIMP (\sigma, \nu)$ is interpreted as the ``S-implication'' generated by $\nu$ and $\sigma$. Secondly, we define functional operators $NEG (\pi) : -> $ and $SNOR (\pi) : ^2 -> $ where $NEG (\pi)$ is interpreted as the ``negation'' generated by $\pi$ and $SNOR (\pi)$ is interpreted as the ``S-norm'' (T-conorm) generated by $\pi$. We investigate under which assumptions these operators are injective (bijective) and which properties of the ``argument functions'' are translated into the ``value functions''. Numerous well-known results on negations, S-norms, and implications can be derived within the framework of this general approach. Further results concern the mutual definability or R-implications and T-norms.
The deepest repetition-free decompositions of nonsingular functions of finite-valued logics
Authors: F. Sokhatsky
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

A superposition is called repetition-free if every variable appears in it at most once. Two terms are said to almost coincide if the second term can be obtained from the first one in a finite number of steps: isotopy change, commutation change and associative change. The main result: every two deepest repetition-free decompositions of a nonsingular function of a finite-valued logics almost coincide. As a corollary we have the corresponding Kuznetaov's results for Boolean functions and Sosinsky's result for functions of three-valued logics.
A Discussion of Cybersickness in Virtual Environments
Authors: Joseph J. LaViola,  Jr.
Venue:  (1999)

An important and troublesome problem with current virtual environment (VE) technology is the tendency for some users to exhibit symptoms that parallel symptoms of classical motion sickness both during and after the VE experience. This type of sickness, cybersickness, is distinct from motion sickness in that the user is often stationary but has a compelling sense of self motion through moving visual imagery. Unfortunately, there are many factors that can cause cybersickness and there is no foolproof method for eliminating the problem. In this paper, I discuss a number of the primary factors that contribute to the cause of cybersickness, describe three conflicting cybersickness theories that have been postulated, and discuss some possible methods for reducing cybersickness in VEs.
Branching time and orthogonal bisimulation equivalence
Authors: Jan A. Bergstra, Alban Ponse, Mark B. Zwaag
Venue:  (2000)

We propose a refinement of branching bisimulation equivalence that we call orthogonal bisimulation equivalence. Typically, internal activity (i.e., the performance of $\tau$-steps) may be compressed, but not completely discarded. Hence, a process with $\tau$-steps cannot be equivalent to one without $\tau$-steps. Also, we present a modal characterization of orthogonal bisimulation equivalence. This equivalence is a congruence for ACP extended with abstraction and priority operations. We provide a complete axiomatization, and describe some expressiveness results. Finally, we present the verification of a PAR protocol that is specified with use of priorities.
Performance criteria for graph clustering and Markov cluster experiments
Authors: Stijn Dongen
Venue:  (2000)

In~[1] a cluster algorithm for graphs was introduced called the Markov cluster algorithm or MCL~algorithm. The algorithm is based on simulation of (stochastic) flow in graphs by means of alternation of two operators, expansion and inflation. The results in~[2] establish an intrinsic relationship between the corresponding algebraic process (MCL~process) and cluster structure in the iterands and the limits of the process. Several kinds of experiments conducted with the MCL~algorithm are described here. Test cases with varying homogeneity characteristics are used to establish some of the particular strengths and weaknesses of the algorithm. In general the algorithm performs well, except for graphs which are very homogeneous (such as weakly connected grids) and for which the natural cluster diameter (i.e. the diameter of a subgraph induced by a natural cluster) is large. This can be understood in terms of the flow characteristics of the MCL~algorithm and the heuristic on which the algorithm is grounded. A generic performance criterion for clusterings of weighted graphs is derived, by a stepwise refinement of a simple and appealing criterion for simple graphs. The most refined criterion uses a particular Schur convex function, several properties of which are established. A metric is defined on the space of partitions, which is useful for comparing different clusterings of the same graph. The metric is compared with the metric known as the equivalence mismatch coefficient. The performance criterion and the metric are used for the quantitative measurement of experiments conducted with the MCL~algorithm on randomly generated test graphs with 10000 nodes. Scaling the MCL~algorithm requires a regime of pruning the stochastic matrices which need to be computed. The effect of pruning on the quality of the retrieved clusterings is also investigated. [1] A cluster algorithm for graphs. Technical report INS-R0010, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam, 2000. [2] A stochastic uncoupling process for graphs. Technical report INS-R0011, National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam, 2000.
Experience with Disconnected Operation in a Mobile Computing Environment
Authors: Mahadev Satyanarayan, James J. Kistler, Lily B. Mummert, Maria R. Ebling, Puneet Kumar, Qi Lu
Venue:  (1993)

In this paper we present qualitative and quantitative data on file access in a mobile computing environment. This information is based on actual usage experience with the Coda File System over a period of about two years. Our experience confirms the viability and effectiveness of disconnected operation. It also exposes certain deficiencies of the current implementation of Coda, and identifies new functionality that would enhance its usefulness for mobile computing. The paper concludes with a description of what we are doing to address these issues.
Resource Management in Communications Systems
Authors: S. Varada, D. Shilonie
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The management of memory resources is critical to the preservation of system integrity in data communications system. The memory resources appear in various forms in a target system; examples include objects such as connection management data structures, data or control flow request descriptors, buffers and their descriptors. The critical part of resource management is to free-up or recycle the allocated memory resources when no longer needed with a scope that encompasses all user and system components in the target system. The challenge is to perform the resource management in a way that preserves the system integrity. This paper discusses resource management in an experimental communications system.
Query complexity of membership comparable sets
Authors: Till Tantau
Venue: Theoretical Computer Science (2003)

This paper investigates how many queries to k-membership comparable sets are needed in order to decide all (k + 1)-membership comparable sets. For k ≥ 2 this query complexity is at least linear and at most cubic. As a corollary, we obtain that more languages are O(log n)-membership comparable than truth-table reducible to P-selective sets.
Physical network design to facilitate capacity reallocation
Authors: Janelle Harms, Chenjiang Hu
Venue: Discrete Applied Mathematics (2003)

Asynchronous transfer mode (ATM) is a multiplexing and switching technique that supports integrated services in high-speed networks. Flexibility is crucial in order to handle the dynamic resource requirements of multimedia traffic in these networks. ATM provides virtual paths (VPs) that can facilitate resource management. The physical topology of an ATM network should be designed to provide flexibility to the logical VP reconfiguration mechanism in order to adapt to changing traffic conditions. In this paper, we address the problem of physical topology design for ATM networks with a view to facilitating the logical reconfiguration phase. A basic physical topology design model is formulated as a nonlinear mixed integer programming problem and a graph-based heuristic algorithm is developed to solve the problem. Three models to support multiple traffic types are designed based on this model. Two parameters in this model control the spare capacity and the secondary route allocation. The static performance evaluation experiments indicate that the secondary route allocation parameter has more effect on the physical topology than the other and that the two parameters can be adjusted to achieve better performance with little increase in network cost. Simulation results show that the physical topology generated by the heuristic algorithm improves the dynamic capacity reallocation in the logical VP network.
An extended comparison of slotted and unslotted deflection routing
Authors: T. Chich, P. Fraigniaud
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

In this paper, we have experimentally compared synchronized versus asynchronous all-optical deflection networks. We have compared four routing modes: synchronous mode, partially synchronous mode, and asynchronous mode with fixed or bound packet sizes. Our experiments mainly show that the natural decrease of the performances of the asynchronous mode, compared to the synchronous mode, can be balanced in a significant way by the use of a sophisticated routing algorithm. Moreover, we have also shown that asynchronous routing is not very sensitive to bursty traffic. These results, and the fact that asynchronous networks are easier to design, and cheaper to build than synchronous networks, show the practical interest of asynchronous deflection routing.
Agent Technology Applied to Adaptive Relay Setting for Multi-Terminal Lines
Authors: Denis V. Coury, Jim S. Thorp, Kenneth M. Hopkinson, Birman K P.
Venue:  (2000)

Abstract: This paper discusses the adaptation of the settings of distance relays for multi-terminal lines employing agents. Agents are software processes capable of searching for information in networks, interacting with pieces of equipment and performing tasks on behalf of their owners (relays). Results illustrating the performance of the adaptive method proposed compared to conventional fixed settings are presented. It is shown that the digital relays and agents acting within a communication structure (also called middleware) can alter adaptive settings to ensure correct performance over a wide variety of operation conditions, without the need of an additional communication link. The proposed relaying scheme can also be utilized for first zone clearing over the entire line.
Resource augmentation in load balancing
Authors: Y. Azar, L. Epstein, Rob Stee
Venue:  (1999)

We consider load-balancing in the following setting. The on-line algorithm is allowed to use $n$ machines, whereas the optimal off-line algorithm is limited to $m$ machines, for some fixed $m > n$. We show that while the greedy algorithm has a competitive ratio which decays linearly in the inverse of $n/m$, the best on-line algorithm has a ratio which decays exponentially in $n/m$. Specifically, we give an algorithm with competitive ratio of $1+2^{- \frac{n}{m} (1- o (1))}$, and a lower bound of $1+ e^{ - \frac{n}{m} (1+ o(1))}$ on the competitive ratio of any randomized algorithm. We also consider the preemptive case. We show an on-line algorithm with a competitive ratio of $1+ e^{ - \frac{n}{m} (1+ o(1))}$. We show that the algorithm is optimal by proving a matching lower bound. We also consider the non-preemptive model with temporary tasks. We prove that for $n=m+1$, the greedy algorithm is optimal. (It is not optimal for permanent tasks.)
Modeling and Analysis of Software Rejuvenation in Cable Modem Termination Systems
Authors: Yun Liu, Kishor S. Trivedi, Yue Ma, James J. Han, Haim Levendel
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

In order to reduce system outages and the associateddowntime cost caused by the "software aging"phenomenon,we propose to use software rejuvenation asa proactive system maintenance technique deployed in aCMTS (Cable Modem Termination System) cluster system.Different rejuvenation policies are studied from theperspective of cost and availability. To evaluate thesepolicies, stochastic reward net models are developed andsolved by SPNP (Stochastic Petri Net Package). Numericalresults show that significant improvement in capacity-orientedavailability and decrease in downtime cost can beachieved. The optimization of the rejuvenation interval inthe time-based approach and the effect of the predictioncoverage in the measurement-based approach are also studiedin this paper.
The Paging Channel in cdma2000
Authors: Sandip Sarkar, Ed Riedemann
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

Cdma2000 has been proposed as the standard in the US for the next generation mobile phones. This document describes the proposed Paging Channel of the cdma2000. It provides both the physical layer details of operation, and the signaling and network issues required to support these new channels. The new Paging Channel significantly improves the standby times of the phones for the 3G systems. This paper looks at a way to put this common channel in soft handoff, thereby improving the reliability of call set up, and leading to a better standby time for the cdma2000 phones. It is shown that the method does not affect the call setup time, and causes no significant impact on the power budget of the base stations. Furthermore, it is completely backward compatible.
Bit-Parallel Selfrouting Optoelectronic Switching Fabrics for Massively Parallel Wide-Format Data Processing: Principle and Optical Architecture
Authors: V. B. Fyodorov
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

Three types of optoelectronic architectures for NxN high- performance switching fabrics with multibit word parallel data transmission through connected pairs of free-space optical channels are considered. The fabrics differ in their functional capability to realize selfrouting strictly nonblocking conflict-free networking under arbitrary call requests. The possibility of creating such networks from laser and photodetector arrays, smart pixel structures, free-space optics, lenslets or selfoc lens arrays, and electronic control circuits is discussed. Key words: Free space optical interconnections, Completely connected networks, Smart pixel arrays, VCSEL technology. 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