ppxscal/embedding_network huggingface dataset:
The existence of subspace wavelet sets
Authors: X. Dai, Y. Diao, Q. Gu, D. Han
Venue: Journal of Computational and Applied Mathematics (2003)

Let H be a reducing subspace of L2(Rd), that is, a closed subspace of L2(Rd) with the property that f(Amt - l) ∈ H for any f ∈ H, m ∈ Z and l ∈ Zd, where A is a d × d expansive matrix. It is known that H is a reducing subspace if and only if there exists a measurable subset M of Rd such that AtM = M and F(H) = L2(Rd) ċ χM. Under some given conditions of M, it is known that there exist A-dilation subspace wavelet sets iwith respect to H. In this paper, we prove that this holds in general.
An Autonomous Decentralized Recognition System Having a Dispersive Wave Property
Authors: H. Yuasa, H. Maruyama, S. Ito, M. Ito
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

The concept of an autonomous decentralized system can be applied to recognizing various complicated and skillful actions performed by humans. This concept is the basis for a proposed pattern recognition system, which can be regarded as an associative memory system modeled by a reaction- diffusion equation system. This paper will improve upon this pattern recognition system using the property of a dispersive wave instead of diffusion. This improvement has three advantages: acceleration of recognition, spread of similar regions, and human-like hysteresis in recognition. Computer simulation has shown that propagation of a dispersive wave is faster than that of diffusion, and that the dispersive wave system exhibits the above advantageous properties of recognition.
Cell Clustering for Fast Handoff
Authors: Weiping Zhu
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

When wireless networks is connected to wired networks, e.g. ATM networks, mobile hosts can gain access to the resources stored on the wired networks. Handoffs originally used in wireless networks must be extended if the wired network is connection-oriented, such as ATM. In the new environment, if a mobile host is moving out of its current cell, radio signals and connections must be switched accordingly. To have seamless handoff, the related operations must be performed with low lantency, minimal cell loss and no change in cell sequence. In this paper, we propose a cluster structure to link wireless networks to ATM networks, which can greatly reduce handoff delay and improve performance. The performance of this method is analyzed and studied in simulation, which shows it is superiorto other methods.
An Efficient Algorithm for Incremental Data-Flow Analysis
Authors: F. K Zadeck
Venue:  (1989)

This paper presents a new algorithm for data-flow analysis that works for data-flow problems in a new class, {\em partitionable} data-flow problems. While this class is a subset of the well-established {\em fast} class introduced by Graham and Wegman, most of the global data-flow problems that are commonly solved are shown to be in this class. This algorithm has two advantages over extant methods: \begin{enumerate} \item The algorithm is asymptotically faster than any extant algorithm when applied to the partitionable problems. \item The algorithm can be easily transformed into an efficient incremental algorithm. \end{enumerate}
Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan
Authors: Edmund Clarke, Xudong Zhao
Venue:  (1994)

One way of building more powerful theorem provers is to use techniques from symbolic computation. The challenge problems in this paper are taken from Chapter 2 of Ramanujan''s Notebooks. They were selected because they are non-trivial and require the use of symbolic computation techniques. We have developed a theorem prover based on the symbolic computation system Mathematica, that can prove all the challenge problems completely automatically. The axioms and inference rules for constructing the proofs are also briefly discussed.
Slicing Aspect-Oriented Software
Authors: Jianjun Zhao
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

Program slicing has many applications in software engineering activities including program comprehension, debugging, testing, maintenance, and model checking. In this paper, we propose an approach to slicing aspect-oriented software. To solve this problem, we present a dependence-based representation called aspect-oriented system dependence graph (ASDG), which extends previous dependence graphs, to represent aspect-oriented software. The ASDG of an aspect-oriented program consists of three parts: a system dependence graph for non-aspect code, a group of dependence graphs for aspect code, and some additional dependence arcs used to connect the system dependence graph to the dependence graphs for aspect code. After that, we show how to compute a static slice of an aspect-oriented program based on the ASDG.
On-line Dynamic Bandwidth Allocation
Authors: Errin W. Fulp, Douglas S. Reeves
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

Network multimedia applications require certain performance guarantees that can be provided through proper resource allocation. Allocation techniques are needed to provide these guarantees as efficiently as possible since resources are limited. This paper presents an allocation method called Dynamic Search Algorithm (DSA+). DSA+ is an on-line algorithm that dynamically adjusts the resource allocation based upon the measured quality of service. Advantages of DSA+ include efficient use of resources, reasonable implementation cost and stringent quality of service control. In this paper we demonstrate how DSA+ dynamically allocates bandwidth to achieve a given loss rate for actual variable bit rate MPEG videos. Performance and cost advantages over other allocation methods are presented, as well as allocation for multiple hop connections.
On the Reliability of Fault-Tolerant Distributed Computing Systems
Authors: Ozalp Babaoglu
Venue:  (1986)

The designer of a fault-tolerant distributed system faces numerous alternatives. Using a stochastic model of processor failure times, we investigate design choices such as replication level, protocol running time, randomized versus deterministic protocols, fault detection and authentication. We use the probability with which a system produces the correct output as our evaluation criterion. This contrasts with previous fault-tolerance results that guarantee correctness only if the percentage of faulty processors in the system can be bounded. Our results reveal some subtle and counterintuitive interactions between the design parameters and system reliability.
The Seven-Eleven Problem
Authors: Paul Pritchard, David Gries
Venue:  (1983)

NO SUPPLIED
Constructing graphs with several pseudosimilar vertices or edges
Authors: Josef Lauri
Venue: Discrete Mathematics (2003)

Some of the most interesting problems connected with pseudosimilarity in graphs concern the construction of graphs with large sets of pseudosimilar vertices or edges. This can be understood in two ways: either the graph contains a large set of vertices or edges which are mutually pseudosimilar or else for every vertex (edge) in the graph there is another vertex (edge) to which it is pseudosimilar. We shall survey the methods used to construct such graphs and on the way we shall also discuss some related results and point out some unanswered questions.
Synergy Effects in Natural Language-Based Multimodal Interaction
Authors: Ivan Bretan, Jussi Karlgren
Venue:  (1994)

We discuss the synergetic effects that can be obtained in an integrated multimodal interface framework comprising on one hand a visual language-based modality and on the other natural language analysis and generation components. Besides a visual language with high expressive power, the framework includes a cross-modal translation mechanism which enables mutual illumination of interface language syntax and semantics. Special attention has been payed to how to address problems with robustness and pragmatics through unconventional methods which aim to enable user control of the discourse management process.
Minimally-immersive interactive volumetric information visualization
Authors: D. S. Ebert, C. Shaw, A. Zwa, E. L. Miller, D. A. Roberts
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

This paper describes a minimally immersive volumetric interactive system for information visualization. The system, SFA, uses glyph-based volume rendering, enabling more information attributes to be visualized than traditional 2D and surface-based information visualization systems. Two-handed interaction and stereoscopic viewing combine to produce a minimally immersive interactive system that enhances the user's three-dimensional perception of the information space, capitalizing on the human visual system's pre-attentive learning capabilities to quickly analyze the displayed information. The paper describes the usefulness of this system for the visualization of document similarity within a corpus of textual documents. SFA allows the three-dimensional volumetric visualization, manipulation, navigation, and analysis of multivariate, time-varying information spaces, increasing the quantity and clarity of information conveyed from the visualization as compared to traditional 2D information systems.
Resource Conscious Design of Distributed Real-Time Systems: An End-to-End Approach
Authors: Manas Saksena, Seongsoo Hong
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

In this paper, we present a resource conscious approach to designing distributed real-time systems. This work extends our original solution~\cite{hong:tse95-jul}, which was limited to single processor systems. Starting from a given task graph, and a set of end-to-end constraints, we systematically generate task attributes (e.g., periods and deadlines) such that (i) the task set is schedulable, and (ii) the end-to-end constraints are satisfied. The methodology presented in this paper can be mostly automated, and provides useful feedback to a designer when it fails to find a solution. We expect that the techniques presented in this paper will help reduce the laborious process of designing a real-time system, by bringing resource contention and schedulability aspects early into the design process.
Potential Capabilities in Algol-Like Programs
Authors: Charles G. Moore,  III
Venue:  (1974)

NO SUPPLIED
Localized Temporal Reasoning Using Subgoals and Abstraction
Authors: Sheiu Lin, Thomas Dean
Venue:  (1994)

Temporal reasoning with uncertainty about the ordering of events is important in a wide variety of applications. Previous research shows that the associated decision problems are hard even for very restricted cases. In this paper, we investigate using the temporal locality of events and the spatial locality of state spaces to speed inference. We propose a new perspective for representing cause-and-effect relationships based on finite state automata. This perspective exposes the sources of complexity in temporal reasoning more clearly, and facilitates transforming rule-based temporal reasoning problems into graph reachability problems. We present both positive and negative results that provide insight into the complexity of temporal reasoning. Content areas: Temporal Reasoning, Reasoning about Action, Planning, Scheduling
Helping based on future expectations
Authors: Sabyasachi Saha, Sandip Sen, Partha Sarathi Dutta
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Autonomous agents interacting in an open world can be considered to be primarily driven by self interests. Previous work in this area has prescribed a strategy of reciprocal behavior, based on past interactions, for promoting and sustaining cooperation among such self-interested agents. Here we present a new mechanism where agents base their decisions both on historical data as well as on future interaction expectations. A decision mechanism is presented that compares current helping cost with expected future savings from interaction with the agent requesting help. We experiment with heterogeneous agents that have varying expertise for different job types. We evaluate the effect of both change of agent expertise and distribution of task types on subsequent agent relationships. The reciprocity mechanism based on future expectations is found to be robust and flexible in adjusting to the environmental dynamics.
Measurement-Based Availability of Unix Systems in a Distributed Environment
Authors: Cristina Simache Simache, Mohamed Kaâniche
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

This paper presents a measurement-based availability study of networked Unix systems,based on data collected during 11 months from 298 workstations and serversinterconnected through a local area computing network.The data corresponds to event logs recorded by the Unix operating system via the Syslogd daemon.Our study focuses on the identification of machine reboots and the evaluation of statistical measures characterizing: a) the distribution of reboots (per machine,time), b) the distribution of uptimes and downtimes associated to these reboots,c) the availability of machines including workstations and servers, and d) error dependencies between clients and servers.
Indexed Sequential Data Broadcasting in Wireless Mobile Computing
Authors: Ming-Syan Chen, Philip S. Yu, Kun-Lung Wu
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Energy saving is one of the most important issues in wireless mobile computing. Among others, one viable approach to achieving energy saving is to use an indexed data organization to broadcast data over wireless channels to mobile units. In this paper, we explore the issue of indexing data with skewed access for sequential broadcasting in wireless mobile computing. We propose methods to build index trees based on access frequencies of data records. To minimize the average cost of index probes, we consider two cases: one for fixed index fanouts and the other for variant index fanouts, and devise algorithms to construct index trees for both cases. We show that the cost of index probes can be minimized not only by employing an imbalanced index tree that is designed in accordance with data access skew, but also by exploiting variant fanouts for index nodes.
Aggregating Congestion Information Over Sequences of TCP Connections
Authors: Azer B Bestavros, Olivier Hartmann
Venue:  (1998)

Abstract In this paper we present an extension of the TCP stack that allows a sequence of TCP connections between the same machines to share the congestion window. Our Linux implementation of this scenario shows significant improvement in performance, particularly when the individual connections are short-lived. Such a behavior is common on the web, due to the nature of the HTTP protocol and the distribution of file sizes.
Functional Behavioral Assessment Using the LERS Data Mining System&mdash;Strategies for Understanding Complex Physiological and Behavioral Patterns
Authors: Rachel L. Freeman, Jerzy W. Grzymala-Busse, Mark Harvey
Venue: Journal of Intelligent Information Systems (2003)

Many individuals with mental retardation, autism, and other related disabilities lead lives that are significantly restricted because of problem behaviors such as self-injury and aggression. We processed two data sets, one describing heart rate patterns and the other describing the behavioral events of one subject diagnosed with severe mental retardation, visual impairments, and severe problem behavior. From these data sets the LERS data mining system induced certain and possible rule sets. In our research these rule sets were successfully used for interpretation, or, more specifically, to discover mechanisms of triggering specific physiological and behavioral patterns.
Searching for the Perfect Match: A Comparison of Free Sorting Results for Images by Human Subjects and by Latent Semantic Analysis Techniques
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Information visualization can improve the access and manipulation of digital data if it conforms to human expectations, and supports the particular interface, task, data, and user. Detailed usability studies are required to prove this assumption. This paper reports a usability study of the data analysis algorithm applied in the LVis - Digital Library Visualizer that spatially visualizes search results derived from user queries of digital library collections. In particular, it presents a comparison of free sorting results for image data done by 20 human subjects and the data analysis result derived via Latent Semantic Analysis from the textual image descriptions. The results of the study suggest that people, if asked to categorize with no constraints, will use features that are often derivable from textual metadata. Human clustering strategies and resulting demands for image browsing systems are discussed and future work is outlined.
Compiler-Directed Resource Management for Active Code Regions
Authors: Ravikrishnan Sree, Alex Settle, Ian Bratt, Dan Connors
Venue: Proceedings of the Seventh Workshop on Interaction between Compilers and Computer Architectures (2003)

Recent studies on program execution behavior revealthat a large amount of execution time is spent in small frequentlyexecuted regions of code. Whereas adaptive cachemanagement systems focus on allocating cache resourcesbased on execution access patterns, this paper presents amethod of using compiler analysis to manage critical processorresources. With the addition of new architecturetechniques to direct the utilization of instruction and datacache resources, the compiler can guard the most active regionsof program execution from cache contention issues.The effect is that the overall performance of programs canbe improved by either selectively granting each dynamic regiona priority level for using cache and memory resourcesor providing active regions with dedicated cache structures.
Parallel First Fit Memory Allocation
Authors: Carla Ellis, J T Olson
Venue:  (1987)

Dynamic storage allocation is a vital component of a programming system intended for a multiprocessor architecture that supports globally shared memory. As the number of processors in such machines grows significantly, the development of highly parallel allocation mechanisms becomes increasingly important. In this paper, we investigate four solutions, all based on the first fit approach, that provide different granularities of parallel access to the allocator''s data structures. We describe an experiment that we are doing to compare the performance of these four schemes.
Designing Fault-Tolerant Algorithms for Distributed Systems Using Communication Primitives
Venue:  (1986)

Fault-tolerance is an important requirement in distributed computing systems. However, designing applications for distributed systems is a difficult task, particularly when components of the system can fail. The difficulty of this task increases with the severity of failures encountered. Arbitrary process failures are generally much harder to overcome than failures that are restricted, e.g. where processes only fail by halting. Thus, techniques that restrict the disruptive behavior of faulty processes can greatly simplify the design of fault-tolerant algorithms. Such techniques effectively provide reduction mechanisms from one class of failures to a more benign class. Message authentication is an example of a technique that imposes restrictions on the bahavior of fault processes. This technique has been used to derive simple solutions to many problems of fault-tolerance for systems with arbitrary failures. To exploit the simplicity provided by authentication we present communication primitives that provide properties of authentication without using digital signatures. These primitives can also be extended to provide properties beyond those of authentication, thereby further restricting the types of faults that have to be overcome. (ABRIDGED ) 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
Crosstalk Noise Analysis in Ultra Deep Submicrometer Technologies
Authors: Mohamed A. Elgamel, Kannan S. Tharmalingam, Magdy A. Bayoumi
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

In ultra deep submicron (UDSM) circuit design, theinterconnect delay and noise have become the dominantfactors in determining circuit performance. Analyticalexpressions are preferred because simulation is alwaysexpensive and ineffective in use with modern designscontaining millions of transistors and wires. However,analytical expressions are not sufficiently accurate anddo not consider all of interconnect and driverparameters. In this paper, we analyze the effects of allknown interconnect and driver parameters on thecrosstalk peak noise, crosstalk noise pulse width, and theimpact of coupling on aggressor delay. We considerparameters like spacing between wires, wire length,coupling length, load capacitance, rise time of the inputs,place of overlap (near driver or receiver side), frequency,direction of the signals, wire width for both theaggressors and the victim wires. Also, we considerparameters like driver strength as several recent studiesconsidered the simultaneous device and interconnectsizing.
A Sine Transform Algorithm for the Hypercube
Authors: Clare Chu
Venue:  (1987)

A new sine transform algorithm is presented where the pre-and post-processing steps are amenable to implementation on the hypercube parallel computer. Interprocessor communication is minimized at the expense of some redundant computations resulting in an algorithm with almost linear speedup against the conventional sequential algorithm. The transforms for both naturally ordered input and bit-reversed input can be processed, thereby avoiding the communication overhead needed to either run an autosort algorithm or to unscramble the results by performing a bit-reversed permutation about $O(d)$ parallel transmissions on hypercubes of dimension $d$. 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
Generating Trust in Online Business: From Theory to Practice
Authors: Magda Fusaro, Claude-Yves Charron, Yves Theoret
Venue:  (2003)

:The importance of developing electronic commerce has become increasingly apparent over the last decade. At the same time, a number of regulatory and economic measures are required to help develop on-line transaction volume. Although governments and some businesses have taken the first steps, consumers are still conspicuously absent from the cyberspace marketplace. The implementation of a new technology must, of necessity, proceed in stages, from its introduction to its gradual adoption and ultimate appropriation. It is only when this process is complete that e-commerce will gain widespread acceptance. Generating Trust In Online Business invites you to embark on a journey spanning theory and practice. The goal is to provide you -- entrepreneurs and webmasters -- with an overview of the rules of the game as they exist at the present time, and to help you adapt your e-commerce strategies so that they generate maximum consumer confidence.
Language Based Protection Mechanisms
Authors: Nancy Eland
Venue:  (1978)

NO SUPPLIED 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