ppxscal/embedding_network huggingface dataset:
Efficient rate-controlled bulk data transfer using multiple multicast groups
Authors: Supratik Bhattacharyya, James F. Kurose, Don Towsley, Ramesh Nagarajan
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

Controlling the rate of bulk data multicast to a large number of receivers is difficult, due to the heterogeneity among the end systems' capabilities and their available network bandwidth. If the data transfer rate is too high, some receivers will lose data, and retransmissions will be required. If the data transfer rate is too slow, an inordinate amount of time will be required to transfer the data. In this paper, we examine an approach toward rate-controlled multicast of bulk data in which the sender uses multiple multicast groups to transmit data at different rates to different subgroups of receivers. We present simple algorithms for determining the transmission rate associated with each multicast channel, based on static resource constraints, e.g., network bandwidth bottlenecks. Transmission rates are chosen so as to minimize the average time needed to transfer data to all receivers. Analysis and simulation are used to show that our policies for rate selection perform well for large and diverse receiver groups and make efficient use of network bandwidth. Moreover, we find that only a small number of multicast groups are needed to reap most of the possible performance benefits.
IT services = People + Tools + processes
Authors: Kemal A. Delic
Venue: Ubiquity (2003)

People add the power to a simple equation for enlightened decision-making in the IT service industry
An ASIC Implementation of Kohonen's Map Based Color Image Compression
Authors: N. Sudha
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper presents a hardware design for a neuralnetwork based color image compression.The compressedimage consists of a color palette containing fewbest colors and the coded image.Kohonen's map neuralnetwork is applied to construct the color palette andthe coded image, both forming the compressed image.The scheme results in linear time complexity (in thesize of the image).The architecture of the hardwareunit is based on SIMD methodology.The architecturehas been implemented in ASIC and results show thatthe proposed design achieves high speed taking only afew milliseconds for compression of images up to sizeof 512x512 with low area requirement.
Trust in Virtual Healthcare Communities: Design and Implementation of Trust-Enabling Functionalities
Authors: Winfried Ebner, Jan Marco Leimeister, Helmut Krcmar
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Trust in online communities, particularly in the healthcare domain, provides (apart from other success factors) the foundation for a successful implementation and operation of a virtual community (VC). A look at existing communities however leads to the conclusion that many VCs fail to meet requirements upon which trust is established. Based on the researchers' experience, this paper describes how trust-enabling functionalities can be systematically designed and implemented in a virtual community for cancer patients. The presented components support the process of creating trust in the VC and contribute to the successful implementation and maintenance of the community. The paper concludes with a discussion on aspects of trust yet to be implemented and recommendations for further research in this area.
Understanding online purchase intentions: contributions from technology and trust perspectives
Authors: Hans van der Heijden, Tibert Verhagen, Marcel Creemers
Venue: European Journal of Information Systems (2003)

This paper explores factors that influence consumer's intentions to purchase online at an electronic commerce website. Specifically, we investigate online purchase intention using two different perspectives: a technology-oriented perspective and a trust-oriented perspective. We summarise and review the antecedents of online purchase intention that have been developed within these two perspectives. An empirical study in which the contributions of both perspectives are investigated is reported. We study the perceptions of 228 potential online shoppers regarding trust and technology and their attitudes and intentions to shop online at particular websites. In terms of relative contributions, we found that the trust-antecedent 'perceived risk' and the technology-antecedent 'perceived ease-of-use' directly influenced the attitude towards purchasing online.
Specifying Roles within Agent-Oriented Software Engineering
Authors: Kevin Chan, Leon Sterling
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Roles are an essential concept within agent-orientedsoftware engineering (AOSE). Role definitions in currentAOSE methodologies are usually claimed to be for use atthe requirements level. However, in most methodologies,they are too low level, specifying too much detail. In thispaper, we present a "higher level" role specification. Therole specification method described in this paper workstogether with other agent specification/analysis methodsthat we and others have developed. However, we believethat role specification may also be used with non-agent-basedsystems, and provide a useful abstraction forspecifying the requirements of any software system.
Study of distributed learning as a solution to category proliferation in Fuzzy ARTMAP based neural systems
Authors: Emilio Parrado-Hernández, Eduardo Gómez-Sánchez, Yannis A. Dimitriadis
Venue: Neural Networks (2003)

An evaluation of distributed learning as a means to attenuate the category proliferation problem in Fuzzy ARTMAP based neural systems is carried out, from both qualitative and quantitative points of view. The study involves two original winner-take-all (WTA) architectures, Fuzzy ARTMAP and FasArt, and their distributed versions, dARTMAP and dFasArt.A qualitative analysis of the distributed learning properties of dARTMAP is made, focusing on the new elements introduced to endow Fuzzy ARTMAP with distributed learning. In addition, a quantitative study on a selected set of classification problems points out that problems have to present certain features in their output classes in order to noticeably reduce the number of recruited categories and achieve an acceptable classification accuracy.As part of this analysis, distributed learning was successfully adapted to a member of the Fuzzy ARTMAP family, FasArt, and similar procedures can be used to extend distributed learning capabilities to other Fuzzy ARTMAP based systems.
Demand-Driven Caching in Multiuser Environment
Authors: Shen-Tat Goh, Beng Chin Ooi, Kian-Lee Tan
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--In this paper, we propose a novel demand-driven caching framework, called cache-on-demand (CoD). In CoD, intermediate/final answers of existing running queries are viewed as virtual caches that can be materialized if they are beneficial to incoming queries. Such an approach is essentially nonspeculative: the exact cost of investment and the return on investment are known, and the cache is certain to be reused! We address several issues for CoD to be realized. We also propose three optimizing strategies: Conform-CoD, Scramble-CoD, and Integrated-CoD. Conform-CoD and Scramble-CoD are based on a two-phase optimization framework, while Integrated-CoD operates in a single-phase framework. We conducted extensive performance study to evaluate the effectiveness of these algorithms. Our results show that all the CoD-based schemes can provide substantial performance improvement when compared with a predictive scheme and a no-caching scheme.
VTCMOS characteristics and its optimum conditions predicted by a compact analytical model
Authors: Hyunsik Im, Takashi Inukai, Hiroyuki Gomyo, Toshiro Hiramoto, Takayasu Sakurai
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

A compact analytical model of variable-threshold-voltage CMOS (VTCMOS) is proposed to study the active on current, linking it with the standby off-current characteristics. Comparisons of modeled results to both numerical simulations and experimental data are made with an excellent agreement. It is clearly demonstrated using the model that speed degradation due to low supply voltage can be compensated by the VTCMOS scheme, even with smaller power. Influence of the short channel effect (SCE) on the performance of VTCMOS is investigated in terms of a new parameter, dS/dγ, both qualitatively and quantitatively. It is found that the SCE degrades the VTCMOS performance. Issues on the optimum conditions of VTCMOS and the performance of series-connected VTCMOS circuits are also discussed.
Teaching data structures using list boxes
Authors: Douglas Bell, Mehdi Mir-Ghasemi
Venue: ACM SIGCSE Bulletin (2003)

This paper suggests an approach to the initial teaching of data structures that uses GUI list boxes.
Studying program correctness in ProVIDE
Authors: Timothy S. Gegg-Harrison, Gary R. Bunce, Rebecca D. Ganetzky, Christina M. Olson, Joshua D. Wilson
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

In an attempt to better integrate discrete mathematics into the introductory CS curriculum, we implemented ProVIDE, an enhanced integrated development environment (IDE) for Java that enables students to analyze their computer programs (in terms of their correctness) while they are creating them [1]. The primary goal of the construction of ProVIDE is the seamless integration of analysis with the creation of computer programs. Because the concept of program correctness is generally taught as an activity independent of the programming process, most introductory CS students preceive it is unnecessary and even irrelevant. The concept of contracts, on the other hand, is generally taught as an integral part of the programming process. As such, most introductory CS students have little difficulty understanding the need to establish contracts via preconditions and postconditions.The approach we have taken with ProVIDE is a modified version of the "design by contract" methodology. Rather than asking the student programmer for both a precondition and postcondition for each of his/her methods, ProVIDE asks the student to simply supply a postcondition. ProVIDE then helps the student construct the appropriate precondition by leading him/her through an axiomatic proof of the correctness of the method. Thus, the proof of correctness of the method is a side-effect of the student's need to construct an appropriate precondition.In this demonstration, we will show some examples of method precondition construction (including loop invariant construction) within ProVIDE, including the following squaring algorithms that uses only additions (which highlights the construction of a loop invariant for a single loop) and only increments and decrements (which highlights the construction of loop invariants for both sequential and nested loops), respectively.
Linear-time algorithms for graphs with bounded branchwidth
Authors: William Anderson Christian,  Jr.
Venue:  (2003)

We present an algorithmic framework (including a single data structure) that is extended into linear-time algorithms to solve several NP-complete graph problems (i.e., INDEPENDENT SET, M AXIMUM CUT, GRAPH COLORING, HAMILTONIAN CYCLE, and DISJOINT PATHS). The linearity is achieved assuming the provision of a branch decomposition of the instance graph. We then modify the framework to create a multithreaded framework that uses the existing problem-specific extensions without any revision. Computational results for the serial and parallel algorithms are provided. In addition, we present a graphical package called JPAD that can display a graph and branch decomposition, show their relationship to each other, and be extended to rim and display the progress and results of algorithms on graphs or on branch decompositions.
Electroless deposition of novel Ag-W thin films
Authors: V. Bogush, A. Inberg, N. Croitoru, V. Dubin, Y. Shacham-Diamand
Venue: Microelectronic Engineering (2003)

The seedless electroless deposition of silver-tungsten (Ag-W) thin films on silicon dioxide substrate was performed using wet palladium activation from ammonia-acetate and benzoate solutions. Introducing tungsten in the plating bath catalyzes the deposition for benzoic acid solution and decreases the deposition rate for ammonia-acetate solution. The tungsten content in the deposit was 0-1.0 at%, mainly in WOx form. It was found that the electrical, optical, and mechanical properties of the Ag-W films depends on the W content in the deposit. The optimal Ag-W thin films that were deposited from either the ammonia-acetate or benzoate bath demonstrate good adhesion to the substrate, high brightness, and do not corrode at temperatures up to 350 °C in air. Sub-100 nm thick Ag-W deposits have demonstrated resistivity of about 4 µΩ cm after vacuum annealing at 350 °C for 1 h. Finally, we present the film microstructure characterization and discuss the possibility of using Ag-W thin films for advanced microelectronics metallization.
Application of automatic differentiation in numerical solution of a flexible mechanism
Authors: Ming-Gong Lee
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The dynamic behavior of a rotating flexible four-bar structure has been analyzed by Lagrange multiplier formulation, which includes a coupled of rigid and flexible generalized coordinates and they form a structure which can be defined as differential-algebraic equations (DAEs). A stable numerical algorithm for solving differential-algebraic equations is implemented. Automatic differentiation (AD) system (ADIFOR) are used to generate numerical values of Jacobian matrix of the constraint equation described in the formulation. Another AD tool AUTODERIVE is used further to get the second order derivative terms. Comparison between using hand-deriving and automatic differentiation is studied, and it shows that a great accuracy of implementing AD tools in the differential-algebraic equation solver for flexible structure.
How to construct optimal one-time signatures
Authors: Kemal Bicakci, Gene Tsudik, Brian Tung
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

One-time signature (OTS) offer a viable alternative to public key-based digital signatures. OTS security is typically based only on the strength of the underlying one-way function and does not depend on the conjectured difficulty of some mathematical problem. Although many OTS methods have been proposed in the past, no solid foundation exists for judging their efficiency or optimality. This paper develops a methodology for evaluating OTS methods and presents optimal OTS techniques for a single OTS or a tree with many OTS's. These techniques can be used in a seesaw mode to obtain the desired tradeoff between various parameters such as the cost of signature generation and its subsequent verification.
A Variational Approach to Nonlinear Estimation
Authors: Sanjoy K. Mitter, Nigel J. Newton
Venue: SIAM Journal on Control and Optimization (2003)

We consider estimation problems, in which the estimand, X, and observation, Y, take values in measurable spaces. Regular conditional versions of the forward and inverse Bayes formula are shown to have dual variational characterizations involving the minimization of apparent information and the maximization of compatible information. These both have natural information-theoretic interpretations, according to which Bayes' formula and its inverse are optimal information processors. The variational characterization of the forward formula has the same form as that of Gibbs measures in statistical mechanics. The special case in which X and Y are diffusion processes governed by stochastic differential equations is examined in detail. The minimization of apparent information can then be formulated as a stochastic optimal control problem, with cost that is quadratic in both the control and observation fit. The dual problem can be formulated in terms of infinite-dimensional deterministic optimal control. Local versions of the variational characterizations are developed which quantify information flow in the estimators. In this context, the information conserving property of Bayesian estimators coincides with the Davis--Varaiya martingale stochastic dynamic programming principle.
Cyberspace memes
Authors: Mladen Milicevic
Venue: Organised Sound (2001)

This paper addresses the issues concerning the impact of music on cyberspace globalisation. It points out that Internet access is limited to only one per cent of the wealthiest human population. It also looks into the future of cyberspace music and predicts that most of the cyberspace activities are going to be unleashing one of many of humanity's predispositions &ndash; the predisposition to steal. Cyberspace represents a perfect medium for concealing a person's identity and for the masking of any of the responsibility that is expected from socially acceptable human behaviour. With these aspects in mind, the paper concentrates on the Internet's distribution of pirated software and the trading of MP3 files. The paper also focuses on commercial music whose economic impact on the development of music technology allows &lsquo;academic musicians&rsquo; to appropriate most of the tools that otherwise would not have been developed for &lsquo;academic&rsquo; use.
Deterministic computations on a PRAM with static processor and memory faults
Authors: Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
Venue: Fundamenta Informaticae (2002)

We consider Parallel Random Access Machine (PRAM) which has some processors and memory cells faulty. The faults considered are static, i.e., once the machine starts to operate, the operational/faulty status of PRAM components does not change. We develop a deterministic simulation of a fully operational PRAM on a similar faulty machine which has constant fractions of faults among processors and memory cells. The simulating PRAM has n processors and m memory cells, and simulates a PRAM with n processors and a constant fraction of m memory cells. The simulation is in two phases: it starts with preprocessing, which is followed by the simulation proper performed in a step-by-step fashion. Preprocessing is performed in time O((m/n + log n) log n). The slowdown of a step-by-step part of the simulation is O(log m).
An Architecture for Motion Estimation in the Transform Domain
Authors: J. Lee, N. Vijaykrishnan, M. J. Irwin, W. Wolf
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

In this paper, a novel architecture for transformdomain motion estimation is proposed. We derive arecursion equation from the algorithm and wavefrontarray processors are used to perform motion estimationalgorithm adaptively in the transform domain accordingto the compression ratio. It is also shown that a higherthroughput rate with the reduction of arithmetic buildingblocks, frame memory size and the number of memoryaccesses is achieved. The proposed architecture canalso reconfigure to different algorithms that can be usedto perform power-aware video encoding. Simulationresults on video sequences of different characteristicsshow comparable performance of the proposedalgorithm to spatial domain approaches in the aspectsof PSNR and compression ratio.
Growth-sensitivity of context-free languages
Authors: Tullio Ceccherini-Silberstein, Wolfgang Woess
Venue: Theoretical Computer Science (2003)

A language L over a finite alphabet Σ is called growth-sensitive if forbidding any set of subwords F yields a sub-language LF whose exponential growth rate is smaller than that of L. It is shown that every (essentially) ergodic non-linear context-free language of convergent type is growth-sensitive. "Ergodic" means that the dependency di-graph of the generating context-free grammar is strongly connected, and "essentially ergodic" means that there is only one nonregular strong component in that graph. The methods combine (1) an algorithm for constructing from a given grammar one that generates the associated 2-block language and (2) a generating function technique regarding systems of algebraic equations. Furthermore, the algorithm of (1) preserves unambiguity as well as the number of non-regular strong components of the dependency di-graph.
Discrete Universal Filtering Through Incremental Parsing
Authors: Erik Ordentlich, Tsachy Weissman, Marcelo J. Weinberger, Anelia Somekh-Baruch, Neri Merhav
Venue: Proceedings of the Conference on Data Compression (2004)

In the discrete filtering problem, a data sequence over a finite alphabet is assumedto be corrupted by a discrete memoryless channel. The goal is to reconstruct the cleansequence, with as high a fidelity as possible, by way of causal processing of the noisysequence alone, with the reconstruction at time t depending only on noisy observationsoccurring no later than t. We study a universal version of this problem in whichno assumptions are made about the distribution of the clean data, which may evenbe non-stochastic. Using techniques from universal data compression, in particular,the incremental parsing rule of LZ78, we derive practical and efficient algorithms forthe universal filtering of discrete sources. A finite-memory filter of order k has theproperty that the reconstruction at any time t is a time-invariant function only of noisyobservations occurring between times t - k and t, inclusive. We show that our universalfiltering algorithms perform essentially as well, in an expected sense (with respect tothe noise process), as the best finite-memory filter of any fixed order, determined withfull knowledge of the actual clean data sequence, for all such data sequences. We alsoconsider more general finite-state filters and show that any such filter is arbitrarilywell approximated by a finite-memory filter of growing order, thereby establishing theuniversality of the proposed algorithms with respect to this larger class. This resultcan be viewed as the filtering analogue of the well known optimality of LZ78 relativeto the class of finite-state compressors.
Teaching programming to the deaf
Authors: Rockford J. Ross
Venue: Issue 30 (Autumn 1982) (1982)

For certain groups of handicapped persons the field of computer science offers challenging, high-paying careers which are more accessible than other careers. Programming can be done at cathode ray tube terminals which provide a dynamic, visual environment needed by the hearing impaired, and which can be placed in locations convenient to those with mobility impairments. Unfortunately, most colleges and universities are not prepared to teach such students, particularly the deaf. In this paper an ongoing research project to design an online, dynamic, student-controlled library of programming language examples for use in teaching programming languages is described. This system promises to be useful in meeting the needs of handicapped students.
A hardware design system based on object-oriented principles
Authors: A. J. van der Hoeven, E. F. Deprettere, P. van Prooijen, P. M. Dewilde
Venue: Proceedings of the conference on European design automation (1991)

Most hardware description languages and their environments are either based on imperative language concepts or on functional language concepts. We propose a hardware specification and simulation environment based on object-oriented principles. Object-oriented concepts such as classes, objects, inheritance and abstraction are considered in a design environment with the HiFi hardware design model as its underlying basis. This model uses single token Petri nets and Applicative State Transitions to describe the functionality and data flow of a VLSI network.