ppxscal/embedding_network huggingface dataset:
Relaxed conditions for radial-basis function networks to be universal approximators
Authors: Yi Liao, Shu-Cherng Fang, Henry L. W. Nuttle
Venue: Neural Networks (2003)

In this paper, we investigate the universal approximation property of Radial Basis Function (RBF) networks. We show that RBFs are not required to be integrable for the REF networks to be universal approximators. Instead, RBF networks can uniformly approximate any continuous function on a compact set provided that the radial basis activation function is continuous almost everywhere, locally essentially bounded, and not a polynomial. The approximation in LP(µ)(1 ≤ p > ∞) space is also discussed. Some experimental results are reported to illustrate our findings.
An Analysable Bus-Guardian for Event-Triggered Communication
Authors: I. Broster, A. Burns
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

We present a guardian-based approach to detecting'babbling idiots', faulty nodes which erroneously consumeextra resource in an event triggered system. In general,one cannot detect all babbling idiots, but the maximum effect of undetected faults is bounded and small, and therefore can be taken into account in worst case response timeanalysis to guarantee that a babbling idiot cannot causea timing failure elsewhere in the system. The approach isapplied specifically to the CAN protocol to protect againstfaulty nodes transmitting message frames too often. Weshow that the overhead of including the effect of undetected frames into the worst case response time analysis is small enough to be of practical value.
Power minimization algorithms for LUT-based FPGA technology mapping
Authors: Hao Li, Srinivas Katkoori, Wai-Kei Mak
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2004)

We study the technology mapping problem for LUT-based FPGAs targeting at power minimization. The problem has been proved to be NP-hard previously. Therefore, we present an efficient heuristic algorithm to generate low-power mapping solutions. The key idea is to compute and select low-power K-feasible cuts by an efficient incremental network flow computation method. Experimental results show that our algorithm reduces power consumption as well as area over the best algorithms reported in the literature. In addition, we present an extension to compute depth-optimal low-power mappings. Compared with Cutmap, a depth-optimal mapper with simultaneous area minimization, we achieve a 14&percnt; power savings on average without any depth penalty.
Making Information Transparent as a Means to Close the Global Digital Divide
Authors: Soraj Hongladarom
Venue: Minds and Machines (2004)

This paper argues that information should be made transparent as a means to close the global digital divide problem. The usual conception of the digital divide as a bifurcation between the information &lsquo;rich&rsquo; and &lsquo;poor&rsquo; in fact does a poor job at describing the reality of the situation, which is characterized by multiple dimensions of digital divides in many contexts. Taking the lead from Albert Borgmann, it is recognized that the so-called information poor do possess a rich resource of information which needs to be fully accounted for in order to solve the global digital divide problem. In addition, making information transparent means, following the theory of development of Peruvian economist Hernando de Soto, that information should be made available and accessible through a system of representation. Floridi&rsquo;s account of information ethics thus needs to be supplemented by the realization that members of infosphere, which in his view consist of information objects, should be made transparent in order that the global digital divide be ameliorated. In other words there should be a system of information about information, namely semantic representation of objective information which enables the locals to make full use of their available informational resources.
Dynamic Procurement Subject to Temporal and Capacity Constraints
Authors: Jiong Sun, Norman Sadeh
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Reverse auctions offer the prospect of more efficiently matching suppliers and producers in the face of changing market conditions. Prior research has ignored the temporal and finite capacity constraints under which reverse auctioneers typically operate. In this paper, we consider the problem faced by a manufacturer that can procure key components from a number of possible suppliers through multi-attribute reverse auctions. Bids submitted by prospective suppliers include a price and a delivery date. The manufacturer has to select a combination of supplier bids that will maximize its overall profit, taking into account its own finite capacity and the prices and delivery dates offered by different suppliers for the same components. The manufacturer's profit is determined by the revenue generated by the products it sells, the costs of the components it purchases as well as late delivery penalties it incurs if it fails to deliver products in time to its own customers. We provide a formal model of this important class of problems, discuss its complexity and introduce rules that can be used to efficiently prune the resulting search space. We also introduce a branch-and-bound algorithm and an efficient heuristic search procedure. Computational results show that our heuristic procedure typically yields solutions that are within 10 percent of the optimum. They also indicate that taking into account finite capacity considerations can significantly improve the manufacturer's bottom line.
Architectural components for the efficient design of mobile agent systems
Authors: Marthie Schoeman, Elsabé Cloete
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

Over the past eighteen months, there has been a renewed interest in mobile agent technology due to the continued exponential growth of Internet applications, the establishment of open standards for these applications, as well as the semantic web developments. However, the lack of a standardised programming model addressing all aspects of mobile agent systems prevents widespread deployment of the potentially useful technology. The architectural requirements dealing with all aspects of a mobile agent system are not clearly stipulated. As a result, the commercially available mobile agent systems and mobile agent tool kits address different mobile agent issues, and little reuse of available technologies and architectures takes place. The purpose of this paper is to describe an architectural model that identifies the components representing the essential aspects of a mobile agent system. Due to the intensive nature of development, implementation and testing of this model, we describe preliminary work. However, in the meanwhile, there are benefits associated with this preliminary model, namely that it provides a clear understanding of the architectural issues of mobile agent computing, giving novice researchers and practitioners who enters the field for the first time a foundation for making sensible decisions when researching, designing and developing mobile agents. The model is also significant in that it provides a benchmark for researchers and developers to measure the capabilities of mobile agents created by commercially available tool kits.
Shared virtual memory clusters: bridging the cost-performance gap between SMPs and hardware DSM systems
Authors: Angelos Bilas, Dongming Jiang, Jaswinder Pal Singh
Venue: Journal of Parallel and Distributed Computing (2003)

Although the shared memory abstraction is gaining ground as a programming abstraction for parallel computing, the main platforms that support it, small-scale symmetric multiprocessors (SMPs) and hardware cache-coherent distributed shared memory systems (DSMs), seem to lie inherently at the extremes of the cost-performance spectrum for parallel systems. In this paper we examine if shared virtual memory (SVM) clusters can bridge this gap by examining how application performance scales on a state-of-the-art shared virtual memory cluster. We find that: (i) The level of application restructuring needed is quite high compared to applications that perform well on a DSM system of the same scale and larger problem sizes are needed for good performance. (ii) However, surprisingly, SVM performs quite well for a fairly wide range of applications, achieving at least half the parallel efficiency of a high-end DSM system at the same scale and often much more.
Design and validation of a message-passing system
Authors: Fuyau Lin
Venue: Proceedings of the 7th international workshop on Software specification and design (1993)

This paper describes a case study for designing and validating the core of a message-passing communication system. The approach is based on the use of the Petri Net Workbench, the protocol validation language, PROMELA, and its simulator/validator, SPIN. By using these tools, a protocol and underlying hardware for communicating between two heterogeneous computer systems is designed and validated. A reachability analysis is performed which includes a check for live-and dead-lock system states.
Fundamental building blocks for a compact optoelectronic neural network processor
Authors: Benjamin Franklin Ruedlinger
Venue:  (2003)

The focus of this thesis is interconnects within the Compact Optoelectronic Neural Network Processor. The goal of the Compact Optoelectronic Neural Network Processor Project (CONNPP) is to build a small, rugged neural network co-processing unit. This processor will be optimized for solving various signal processing problems such as image segmentation or facial recognition. These represent a class of problems for which the traditional logic-based architectures are not optimized. The CONNPP utilizes the processing power of traditional electronic integrated circuits along with the communications benefits of optoelectronic interconnects to provide a three-dimensionally scalable architecture. The topic of interconnects includes both optoelectronic interconnects between processing planes as well as wire based interconnects within the processing planes. The optoelectronic inter-plane interconnects allow the CONNPP to achieve 3-dimensional scalablility. These interconnects employ an array of holograms designed and fabricated using an analytic model that has been developed. This analytic model takes into account reading and writing the hologram at different wavelengths as well as non-idealities of the optoelectronic devices being used. The analytic model was tested and showed agreement with experiment to within 10% of the calculated values. The photodetectors used for the testing of this system have been designed within standard process technologies using a lateral PiN structure and a novel lateral BJT structure. In addition, highly-linear transimpedance amplifiers were designed to condition the signal from the photodetector for further processing. Finally, a new chip-level interconnect architecture has been proposed for the CONNPP that utilizes a system bus to provide global connectivity between the neurons within the plane of the chip. Software models were built to simulate various chip-level connectivity schemes. These simulations show the significant potential benefits of the global bus-based chip-level architecture that has been proposed. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Computational algebra and algebraic curves
Authors: Tanush Shaska
Venue: ACM SIGSAM Bulletin (2003)

The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be approached from a computational viewpoint.
Association Rule Mining in Peer-to-Peer Systems
Authors: Ran Wolff, Assaf Schuster
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

We extend the problem of association rule mining -a key data mining problem - to systems in which thedatabase is partitioned among a very large number ofcomputers that are dispersed over a wide area. Such computing systems include GRID computing platforms, federated database systems, and peer-to-peer computing environments. The scale of these systems poses several difficulties, such as the impracticality of global communications and global synchronization, dynamic topology changes ofthe network, on-the-fly data updates, the need to share resources with other applications, and the frequent failureand recovery of resources.We present an algorithm by which every node in thesystem can reach the exact solution, as if it were giventhe combined database. The algorithm is entirely asynchronous, imposes very little communication overhead,transparently tolerates network topology changes andnode failures, and quickly adjusts to changes in the dataas they occur. Simulation of up to 10,000 nodes show thatthe algorithm is local: all rules, except for those whoseconfidence is about equal to the confidence threshold, arediscovered using information gathered from a very smallvicinity, whose size is independent of the size of the system.
A computer-assisted method for training and researching timbre memory and evaluation skills
Authors: Wieslaw Woszczyk, Daniel Levitin
Venue:  (2002)

Timbre is a multidimensional attribute of sound and depends to a large extent on its spectral content. The evaluation and control of timbre is a task commonly performed by sound engineers, loudspeaker designers, and subjects participating in listening tests on the quality of transmitted and reproduced sound. Such listening tasks require specific listening abilities. This dissertation presents a training method that aims at developing memory for timbre, sensitivity to timbre changes, and listening strategies involving disciplined auditory attention and efficiency. The physical timbre space is divided into categories defined by the center frequency of standard octave and third-octave resonances. This simplification of the physical timbre space allows the memorization of a limited set of perceptual timbre categories or references that can be used to evaluate other timbres. The proposed method combines the use of computer software for the presentation and evaluation of exercises and individual tutoring sessions with an instructor. The software monitors the actions of listeners during equalization adjustment tasks and allows data to be collected on the sequence of problem solving operators that are used. Performance indicators can thus be compiled and used for the assessment of skill level achieved by the listeners. A global performance index is proposed. A listening test involving the adjustment of multiple peaks and dips in a sound's spectrum is presented, in which the performance of a group of experienced professionals involved in sound recording and audio post-production was compared with a group of student subjects with comparatively little listening experience but who were trained with the method described in the present work for a period of 6 months. Results indicate that overall the experimental student group outperformed the control group of professionals. Suggestions for further improvement of the training method and performance level assessment are proposed.
Enterprise in context: assessing the usability of parallel programming environments
Authors: Gregory V. Wilson, Jonathan Schaeffer, Duane Szafron
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

The growth of commercial and academic interest in parallel and distributed computing during the past fifteen years has been accompanied by a corresponding increase in the number of available parallel programming systems, and in the variety of approaches to parallel programming being taken. However, little or no work has been done to compare or evaluate different systems, or to develop criteria by which such comparisons could be made. As a result, a typical parallel programming system is usually evaluated by the ease or difficulty with which its author(s) can implement a small set of trivially-parallel algorithms.This paper is a step toward rectifying this situation. We present several criteria by which parallel programming systems might be quantitatively evaluated, and assess the importance and measurability of each. Of these criteria, we feel that usability is the most important, but also the least frequently quantified. For illustration, we compare the approach taken in the Enterprise parallel programming environment with several other systems and their approaches. We also predict the results we expect from these comparisons. Finally, we argue that while the cost of performing quantitative measurements of usability might seem large, the cost of not performing them, as borne by a group which selects an inappropriate or low-performing programming system, is likely to be much larger.
Analysis of a Multigrid Algorithm for Time Harmonic Maxwell Equations
Authors: Jayadeep Gopalakrishnan, Joseph E. Pasciak, Leszek F. Demkowicz
Venue: SIAM Journal on Numerical Analysis (2004)

This paper considers a multigrid algorithm suitable for efficient solution of indefinite linear systems arising from finite element discretization of time harmonic Maxwell equations. In particular, a "backslash" multigrid cycle is proven to converge at rates independent of refinement level if certain indefinite block smoothers are used. The method of analysis involves comparing the multigrid error reduction operator with that of a related positive definite multigrid operator. This idea has previously been used in multigrid analysis of indefinite second order elliptic problems. However, the Maxwell application involves a nonelliptic indefinite operator. With the help of a few new estimates, the earlier ideas can still be applied. Some numerical experiments with lowest order Nedelec elements are also reported.
A study in responsiveness in spoken dialog
Authors: Nigel Ward, Wataru Tsukahara
Venue: International Journal of Human-Computer Studies (2003)

The future of human-computer interfaces may include systems which are human-like in abilities and behavior. One particularly interesting aspect of human-to-human communication is the ability of some conversation partners to sensitively pick up on the nuances of the other's utterances, as they shift from moment to moment, and to use this information to subtly adjust responses to express interest, supportiveness, sympathy and the like. This paper reports a model of this ability in the context of a spoken dialog system for a tutoring-like interaction. The system used information about the user's internal state--such as feelings of confidence, confusion, pleasure and dependency--as inferred from the prosody of his utterances and the context, and used this information to select the most appropriate acknowledgement form at each moment. Although straight-forward rating reveals no significant preference for a system with this ability, a clear preference was found when users rated the system after listening to a recording of their interaction with it. This suggests that human-like, real-time sensitivity can be of value in interfaces. The paper further discusses ways to discover and quantify such rules of social interaction, using corpus-based analysis, developer intuitions and feedback from naive judges; and further suggests that the technique of "evaluation after re-listening" is useful for evaluating spoken dialog systems which operate at near-human levels of performance.
The effect of web-based negative information on brand attitude
Authors: Doyle Yoon
Venue:  (2003)

This research examined the effects of Web-based negative information on participant brand attitudes and information processing. Based on prior literature, a Web-based negative information model for advertising processing was proposed. In addition, two methodological issues&mdash;real vs. fictitious brands and student vs. non-student samples&mdash;were explored in the hypotheses. These have great import for advertising research. To test the hypotheses, two experiments were conducted. The first experiment tested the hypotheses for fictitious brands and was a mixed repeated measures factorial design, 3 (attitude) x 2 (source credibility) x 2 (product attributes), with 120 student and non-student respondents. The second study used a mixed repeated measures factorial design to test the hypotheses for real brands, 2 (source credibility) x 2 (product attributes), with 40 student and non-student respondents. No significant effects for involvement and source credibility on participant brand attitude change were found. However, the proposed model shows that the perception variables&mdash;perceived negativity, perceived importance of attributes, and perceived beliefs about attributes&mdash;mediate the effect of source credibility on attitude change. In addition, path analyses revealed there was evidence of a hierarchy effect in the proposed model. This finding was similar to that found in advertising information processing research, where negative information is processed through the perception-beliefs-attitudes route. Although there were no critical differences in responses between the student and non-student samples, a critical difference was found between fictitious and real brand information processing. Respondents exposed to fictitious brands were slow to perceive the negativity of the information but were more likely to change their cognitive responses. Conversely, respondents exposed to real brands were more likely to perceive the negativity of the information but less likely to change their cognitive responses. Respondents who were exposed to real brands have established prior brand attitudes; therefore, they have an ability to counter-argue when they experience dissonance between existing attitudes and new information. The model proposed in this research is under development and should be tested several times with different media. However, it is believed that this model can contribute to the theoretical understanding of persuasion and aid advertising and public relations practitioners manage negative information more effectively.