ppxscal/embedding_network huggingface dataset:
On Global Convergence of a Trust Region and Affine Scaling Method for Nonlinearly Constrained Minimization
Authors: Yuying Li
Venue:  (1994)

(The following contains mathematical formulae and symbols that may become distorted in ASCII text.) A nonlinearly constrained optimization problem can be solved by the exact penalty approach involving nondifferentiable functions (summation(i) of |ci(x)|) and (summation(i) of max(0,ci(x))). In [11], a trust region affine scaling approach based on a 2-norm subproblem is proposed for solving a nonlinear l 1 problem. The (quadratic) approximation and the trust region subproblem are defined using affine scaling techniques. Explicit sufficient decrease conditions are proposed to obtain a limit point satisfying complementarity, dual feasibility, and second order optimality. In this paper, we present the global convergence properties of this new approach. Keywords: nonlinearly constrained minimization, trust region, sufficient decrease conditions, affine scaling, exact penalty, nonlinear l 1 problem, global convergence. 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
Reaching Fault Diagnosis Agreement on Dual Link Failure Mode
Authors: S. C. Wang, K. Q. Yan
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Previously, most Byzantine Agreement protocols can reach an agreement by the way of fault masking. Few of them can detect and locate the faulty components. On the other hand, the most fault diagnosis algorithms can detect and locate faulty component but few of them can make all fault free processors reach an agreement. This study analyzes the messages received at the period of reaching agreement, and then, to detect and to locate the faulty components of the network. Finally, the proposed protocol can further make all fault free processors agree on the common failure report of the synchronous fully connected network. The symptoms of the faults include the malicious fault and the dormant fault.
Optimal Linear Spline Approximation of Digitized Models
Authors: Giuseppe Monno
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

In this paper we present a new technique for surface reconstruction of digitized models in three dimensions. Concerning this problem, we are given a data set in three-dimensional space, represented as a set of points without connectivity information, and the goal is to find, for a fixed number of vertices, a set of approximating triangles which minimize the error measured by the displacement from the given points.Our method creates near-optimal linear spline approximations, using an iterative optimization scheme based on simulated annealing. The algorithm adapts the mesh to the data set and moves the triangles to enhance feature lines. At the end, we can use the approach to create a hierarchy of different resolutions for the model.
Krylov sequences of maximal length and convergence of GMRES
Authors: Mario Arioli, Vlastimil Ptak, Zdenek Strakos
Venue:  (1997)

In most practical cases, the convergence of GMRES method applied to a linear algebraic system $Ax = b$ is determined by the distribution of eigenvalues of $A$. In theory, however, the information about the eigenvalues alone is not sufficient for determining the convergence. In this paper our previous work is extended in the following direction. It is given a complete parametrization of the set of all pairs $\{ A,b \}$ for which GMRES$(A,b)$ generates the prescribed convergence curve while the matrix $A$ has the prescribed eigenvalues. Moreover, a characterization of the right hand sides $b$ for which the GMRES$(A,b)$ converges exactly in $m$ steps, where $m$ is the degree of the minimal polynomial of $A$, is given. EMAIL:: ian@microian.ian.pv.cnr.it KEYWORDS:: Minimal polynomial, Krylov sequences, GMRES method, Convergence
An extension of ternary majority function and its application to evolvable system
Authors: Yoshinori YAMAMOTO
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

Multiple-valued majority functions were defined in 1980as a group which differ from threshold functions, but themajority functions only consist of a subset of Kleeneanfunctions. This paper defines an extension of the ternarymajority function using cyclic operation to I/O values of thefunction. The extended ternary majority functions arefunctionally complete on a ternary logic system. We applythis function to systhesize evolvable logic system. The goalof the discussion in the latter half is to devise a method ofrepesenting any ternary logic function using the extendedternary majority functions. GA is used as a tool, and anadvanced method applicable to many variable case isproposed together with some experiments.
MEX: A Distributed Software Architecture for Wearable Computers
Authors: Juha Lehikoinen, Jussi Holopainen, Marja Salmimaa, Angelo Aldrovandi
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

A new dynamic software architecture for wearable computers is proposed. Key properties of this MEX architecture are examined and compared to some other existing software architecture. One application utilizing MEX, called WalkMap, is presented. The aim of the applications currently under development is to enhance the communication and cooperation of the users utilizing wearable computers in their daily lives. Based on that the software components needed to access context information anywhere and the hardware requirements arising from constant usage are considered. The hardware platform for the software architecture developed is briefly described.
Delivering Voice over IP Networks
Authors: Daniel Minoli, Emma Minoli
Venue:  (2002)

:An increasing number of companies are taking advantage of Voice over IP (VoIP) technology. Before implementing VoIP, companies must decide if the packetized voice should be delivered over Layer 2 networks such as ATM or Frame Relay, or over Layer 3 IP networks. This comprehensive book presents the latest standards and practices so you can determine which approach is best for your company. Drawing upon years of practical experience, the authors explore the unique engineering problems posed by running voice over a connectionless network. They clearly explain the advantages and disadvantages of IP versus traditional packet networks. This book is a significant expansion of the authors' first edition, which published in 1998 and had the distinction of being the first book in the industry dedicated to this important topic of key interest to enterprise customers.
User-level checkpointing through exportable kernel state
Authors: P. Tullmann, J. Lepreau, B. Ford, M. Hibler
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Checkpointing, process migration, and similar services need to have access not only to the memory of the constituent processes, but also to the complete state of all kernel provided objects (e.g., threads and ports) involved. Traditionally, a major stumbling block in these operations is acquiring and re-creating the state in the operating system. We have implemented a transparent user-mode checkpointer as an application on our Fluke microkernel. This microkernel consistently and cleanly supports the importing and exporting of fundamental kernel state safely to and from user applications. Implementing a transparent checkpointing facility with this sort of kernel support simplifies the implementation, and expands its flexibility and power.
Exploring Humanistic Intelligence Through Physiologically Mediated Reality
Authors: James Fung, Steve Mann
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

We present a way of making the wearing of a lifelong electrocardiographic health monitor fun for a user. The health monitor is coupled with a reality mediator device to create a Physiologically Mediated Reality. Physiologically Mediated Reality is Mediated Reality which alters a user's audiovisual perception of the world based upon their own electrocardiographic waveform. This creates an interesting audiovisual experience for the user, playing upon the poetic narrative of combining cardiocentric metaphors pervasive in everyday life (the heart as a symbol of love and centrality, e.g. "get to the heart of the matter") with the ubiquitous occularcentric metaphors such as "see the world from my point of view". This audiovisual experience is further enhanced by combining music which alters the visual perception and also heightens the user's emotional response to their experience, and in doing so, further affects their heart(beat).
Perspectives on Object-Oriented Design
Authors: Peter Wegner
Venue:  (1991)

In reviewing concepts and literature of object-oriented design, we focus on two new texts and consider their impact on broader issues of software engineering. \begin{enumerate} \item {\em Object-Oriented Design with Applications} (OODA), by Grady Booch, uses objects and classes as a structuring mechanism, develops concepts and notations for design, and devotes half its 500 pages to five extensive case studies in the areas of process control, scientific tools, information management, heuristic search, and command and control. \item {\em Object-Oriented Modeling and Design} (OOMD), by five authors from General Electric Research Labs, focuses on the modeling process rather than one case studies. Its three-pronged object modeling technique (OMT), which includes object, dynamic, and functional models that capture complementary views of software, offers a visual notation and methodology for object-oriented design. \end{enumerate} As object-oriented technology matures, attention is shifting from languages to software development. Our review of OODA and OOMD explores object-oriented design and its role in software development. Design promotes a language-independent view of underlying principles of software technology that deepens our understanding of the object-oriented paradigm. To motivate our discussion, we examine the nature of design as a human activity and compare OODA and OOMD to other software engineering texts.
ADHOC: a Tool for Performing Effective Feature Selection
Authors: Marco Richeldi, Pier Luca Lanzi
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper introduces ADHOC, a tool that integrates statistical methods and machine learning techniques to perform effective feature selection. Feature selection plays a central role in the data analysis process since redundant and irrelevant features often degrade the performance of induction algorithms, both in speed and predictive accuracy. ADHOC combines the advantages of both filter and feedback approaches to feature selection to enhance the understanding of the given data and increase the efficiency of the feature selection process. We report results of extensive experiments on real-world data which demonstrate the effectiveness of AD-HOC as data reduction technique as well as feature selection method. ADHOC has been employed in the analysis of several corporate databases. In particular, it is currently used to support the difficult task of early estimating the cost of software projects.
Managing Inference Process in Student Modeling for Intelligent Tutoring Systems
Authors: Roger Nkambou
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In this paper, we present an approach to managing side effect of information updates in the student model (SM). The approach is based on fuzzy logic and fuzzy reasoning on knowledge structure in the SM. The SM includes three parts: cognitive model, behavioral model and inference engine. The cognitive model is an overlay on curriculum knowledge structures, the behavioral model contains affective and conative values of the student and the inference engine aims to manage updates occurring in the SM during the learning process. As updates imply the evolution of the knowledge structure of the student the propagation module evaluates the possible impacts of the updated information on other related information. This is done by activating a fuzzy reasoning on knowledge networks in the curriculum and deducing new information in the SM. The control module handles conflict situations by considering some factors such as the information source and the confidence degree.
Adaptive Data Delivery in Wireless Communication Environments
Authors: Chi-Wai Lin, Dik-Lun Lee
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

The combination of broadcast and on-demand data delivery services is an economic way to build a highly scalable wireless information system with limited bandwidth. The use of data broadcasting should be adaptive so that the system response time can always be minimized. A traditional approach requires the development of a system response time equation in order to find the optimal solution. However, obtaining such an equation is not always possible.We observe that by maintaining a certain level of on-demand request arrival rate, a close approximation to the optimal solution can be obtained. Using this approach, a real-time adaptive data delivery algorithm is developed. Our algorithm does not require the access information of the data items to be known exactly, which is needed normally for this kind of optimization problems. A simple and low overhead bit vector mechanism is able to capture the relative popularities of the data items. With this information, our algorithm can give a performance comparable to the ideal case in which the access information for each data item is known exactly.
A Parallel Architecture for Quadtree-based Fractal Image Coding
Authors: Shinhaeng Lee, Shin'ichiro Omachi, Hirotomo Aso
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

This paper proposes a parallel architecture for quadtree-based fractal image coding. This architecture is capable of performing the fractal image coding based on quadtree partitioning without the external memory for the fixed domain pool. Since a large domain block consists of small domain blocks, the calculations of distortion for all kinds of domain blocks are performed by the summation of the distortions for the maximum-depth domain pool, which is extracted from the smallest range blocks of the neighbor processors. Fast comparison module is proposed for this architecture. This module can compute the distortions between range blocks and their eight isometric transformations by one full rotation around the center.
A Distributed Real-Time Java System Based on CSP
Authors: Gerald H. Hilderink, Andry W. P. Bakkers, Jan F. Broenink
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

CSP is a fundamental concept for developing software for distributed real-time systems. The CSP paradigm constitutes a natural addition to Object Orientation and offers higher-order multithreading constructs.The CSP channel concept that has been implemented in Java deals with single- and multi-processor environments and also takes care of the real-time priority scheduling requirements. For this, the notion of priority and scheduling has been carefully examined and as a result it was reasoned that priority scheduling should be attached to the communicating channels rather than to the processes.In association with channels, a priority based parallel construct is developed for composing processes - hiding threads and priority indexing from the user. This approach simplifies the use of priorities for the object-oriented paradigm. Moreover, in the proposed system, the notion of scheduling is no longer connected to the operating system but has become part of the application instead.
An In-Depth Look at Flow Aggregation for Efficient Quality of Service
Authors: Jorge A. Cobb
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

We investigate the preservation of quality of service guarantees to a flow of packets in the presence of flow aggregation. For efficiency, multiple flows, known as the constituent flows, are merged together resulting in a single aggregate flow. Packet schedulers located after the net-work point where the aggregation occurred are aware of the aggregate flow, but are unaware of its constituent flows. In spite of this, we show that quality of service guarantees may still be offered to the constituent flows provided the aggregation is performed fairly. In earlier work, we showed that the end-to-end delay is preserved (and in some cases improved) under flow aggregation, when the packet delay is coupled with the reserved rate of the flow. We go beyond these results by showing that, even when the delay is de-coupled from the reserved rate, the end-to-end delay is preserved under flow aggregation.
Neurofuzzy Approaches for Advanced Hearing Devices
Authors: R. Gao, Y. Liu, L. H. Tsoukalas, S. Basseas
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

An important issue, in the user of hearing devices, is estimating specific set of gains requirements, referred to as "target". Conventional error-and-trial methods are inefficient. This paper presents a neurofuzzy approach for fitting hearing aid parameters. A neural network is designed to generate the initial target and fuzzy logic is used in fine-tuning the initial target. The introduction of the neurofuzzy approach is expected to accelerate the fitting process. It may also enable audiologists to incorporate their knowledge into the system and make it fit specific needs.
An Assertional Proof of a Byzantine Agreement Protocol
Authors: Jiahua Qian
Venue:  (1983)

An assertional proof of a Byzantine Agreement protocol is given. This provides a formal argument for the correctness of the protocol.
Neuron " A Wide-Area Service Discovery Infrastructure
Authors: Hung-Chang Hsiao, Chung-Ta King
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

A wide-area service discovery infrastructure provides a repository in which services over a wide area can register themselves and clients everywhere can inquire about them. In this paper, we discuss how to build such an infrastructure based on the peer-to-peer model. The proposed system, called Neuron, can be executed on top of a set of federated nodes across the global network and aggregate their resources to provide the discovery service. Neuron is self-organizing, self-tuning, and capable of tolerating failures of nodes and communication links. In addition, it allows the services to be described with arbitrary forms and the system load to be distributed evenly to the nodes. Neuron also supports event notification. We evaluated Neuron via simulation. The preliminary results show that service registration, discovery and service state advertising take at most hops to complete. (N log O )
Computing the CS and the Generalized Singular Value Decompositions
Authors: Charles Van Loan
Venue:  (1984)

If the columns of a matrix are orthonormal and it is partitioned into a 2-by-1 block matrix, then the singular value decompositions of the blocks are related. This is the essence of the ``CS decomposition''''. The computation of these related SVD''s requires some care. Stewart has given an algorithm that uses the LIN-PACK SVD algorithm together with a Jacobi-type ``clean-up'''' operation on a cross-product matrix. Our technique is equally stable and fast but avoids the cross-product matrix. The simplicity of our technique makes it more amenable to parallel computation on systolic-type computer architectures. These developments are of interest because the best way to compute the generalized singular value decomposition of a matrix pair (A,B) is to compute the CS decomposition of a certain orthogonal column matrix related to A and B.
An optimal deadlock resolution algorithm in multidatabase systems
Authors: Xuemin Lin, Jian Chen
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In this paper, we propose a novel deadlock resolution algorithm. In the presence of global deadlocks in a multidatabase system, this algorithm always selects an optimal set of victims for removing deadlocks. It makes use of network flow techniques, and runs in time O(n3), where n is the number of the deadlocked global transactions. Furthermore, the proposed deadlock resolution algorithm does not have livelock and transaction processing starvation problems.
Using neural networks to design cold-formed steel sections
Authors: R. I. Mackie, E. M. A. El-Kassas, A. I. El-Sheikh
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

One of the main advantages of cold-formed steel over traditional hot-rolled steel is the great flexibility of cross-sectional profiles and sizes available to the structural engineer. However, this variety, combined with the complex rules that govern cold-formed member design, makes the selection of the most economical section for a given application difficult. This paper examines the possibility of using neural networks to assist in the design of cold-formed sections. Networks are used to design the section for a given design criteria. The work in this paper covers three profile types, plain, hat and lipped. Two strategies were used in network design: (i) using a single network to cover all the profiles; and (ii) using two networks, one to choose the profile type, and another to choose the profile dimensions. The results demonstrate the potential for using neural networks in this context.
Out-of-Order Instruction Fetch Using Multiple Sequencers
Authors: Paramjit Oberoi, Gurindar Sohi
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Conventional instruction fetch mechanisms fetch contiguous blocks of instructions in each cycle. They are difficult to scale since taken branches make it hard to increase the size of these blocks beyond eight instructions. Trace caches have been proposed as a solution to this problem, but they use cache space inefficiently.We show that fetching large blocks of contiguous instructions, or wide fetch, is inefficient for modern out-of-order processors. Instead of the usual approach of fetching large blocks of instructions from a single point in the program, we propose a high-bandwidth fetch mechanism that fetches small blocks of instructions from multiple points in a program.In this paper, we demonstrate that it is possible to achieve high-bandwidth fetch by using multiple narrow fetch units operating in parallel. Our mechanism performs as well as a trace cache, does not waste cache space, is more resilient to instruction cache misses, and is a natural fit for techniques that require fetching multiple threads, like multithreading, dual-path execution, and speculative threads.
Parallel Lossless Image Compression Using Huffman and Arithmetic Coding
Authors: G P Howard, Scott J Vitter
Venue:  (1995)

We show that high-resolution images can be encoded and decoded efficiently in parallel. We present an algorithm based on the hierarchical MLP method, used either with Huffman coding or with a new variant of arithmetic coding called {\em quasi-arithmetic coding}. The coding step can be parallelized, even though the codes for different pixels are of different lengths; parallelization of the prediction and error modeling components is straightforward. {\em Index terms}: Data compression, Huffman coding, arithmetic coding, parallel algorithms.