ppxscal/embedding_network huggingface dataset:
Bayesian turbo multiuser detection for nonlinearly modulated CDMA
Authors: Van Dao Phan, Xiaodong Wang
Venue: Signal Processing (2002)

This study introduces a blind iterative multiuser detection scheme for demodulating nonlinearly modulated CDMA signals in Gaussian and non-Gaussian noise, based on the Bayesian inference. The detector jointly estimates the channel gains, the noise parameters and the transmitted symbols. It yields asymptotically to the MAP receiver (or minimum error probability on decisions) by using the Gibbs sampler, a Markov Chain Monte Carlo method for Bayesian computation. Its performance is compared with that of the coherent parallel interference cancelation receiver and an iterative detector based on interference suppression. It is seen that the proposed Bayesian multiuser detector offers substantial performance gain over those existing methods, especially in a highly loaded system and in the presence of non-Gaussian ambient noise. Being a "soft-input soft-output" algorithm, the Bayesian multiuser detector is particularly well suited for turbo processing in a coded system: the multiuser detector can incorporate the a priori symbol probabilities, and it produces as output the a posteriori symbol probabilities; the channel decoder delivers information about the code bits prior distributions, which can then be fed back to the multiuser detector to refine its processing, and vice versa. Hence, the proposed Bayesian multiuser detector naturally leads to a turbo receiver structure for joint multiuser detection and decoding.
How User Perceptions Influence Software Use
Authors: Michael G. Morris, Andrew Dillon
Venue: IEEE Software (1997)

Traditionally, human-computer interaction researchers have focused on a system's usability. The authors applied an MIS-proven technology acceptance model that accounts for system usefulness as well. They discovered that this factor has a strong bearing on user acceptance.
Optimizing NET Compilers for Improved Java Performance
Authors: Cheng-Hsueh A. Hsieh, Marie T. Conte, Teresa L. Johnson, John C. Gyllenhaal, Wen-mei W. Hwu
Venue: Computer (1997)

Because they are interpreted, Java executables run slower than their compiled counterparts. The native executable translation (NET) compiler's objective is to optimize the translation of Java bytecode to native machine code so that it runs nearly as fast as native code generated directly from a source. The article presents some preliminary results for several large application programs and standard benchmarks. It compares the NET-compiled code performance with Sun's Java VM, Microsoft's Java just-in-time compiler, and equivalent C and C++ programs directly compiled. The results show that the optimizing NET compiler is capable of achieving better performance than the two other bytecode execution methods, in some cases achieving speeds comparable to directly compiled native code.
Gibbs Random Field Model Based Weight Selection for the 2-D Adaptive Weighted Median Filter
Authors: L. Onural, M. Bilge Alp, M. I. Gürelli
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

A generalized filtering method based on the minimization of the energy of the Gibbs model is described. The well-known linear and median filters are all special cases of this method. It is shown that, with that selection of appropriate energy functions, the method can be successfully used to adapt the weights of the adaptive weighted median filter to preserve different textures within the image white eliminating the noise. The newly developed adaptive weighted median filter is based on a 3/spl times/3 square neighborhood structure. The weights of the pixels are adapted according to the clique energies within this neighborhood structure. The assigned energies to 2- or 3-pixel cliques are based on the local statistics within a larger estimation window. It is shown that the proposed filter performance is better compared to some well-known similar filters like the standard, separable, weighted and some adaptive weighted median filters.
Decomposition Algorithms for Stochastic Programming on a Computational Grid
Authors: Jeff Linderoth, Stephen Wright
Venue: Computational Optimization and Applications (2003)

We describe algorithms for two-stage stochastic linear programming with recourse and their implementation on a grid computing platform. In particular, we examine serial and asynchronous versions of the L-shaped method and a trust-region method. The parallel platform of choice is the dynamic, heterogeneous, opportunistic platform provided by the Condor system. The algorithms are of master-worker type (with the workers being used to solve second-stage problems), and the MW runtime support library (which supports master-worker computations) is key to the implementation. Computational results are presented on large sample-average approximations of problems from the literature.
SigDAQ: an enhanced XML query optimization technique
Authors: Sangwon Park, Hyoung-Joo Kim
Venue: Journal of Systems and Software (2002)

XML is an emerging standard for data representation and exchange on the Web. XML is represented as a tree and the query as a regular path expression (RPE). The query is evaluated by traversing each node of the tree. Several indexes are proposed for RPEs for fast retrieval. In some cases these indexes may not cover all possible paths because of storage requirements. In this paper, we propose a signature-based query optimization technique to minimize the number of nodes retrieved from the database when the indexes cannot be used. The signature is a hint attached to each node, and is used to prune unnecessary sub-trees as early as possible when traversing nodes. For this goal, we propose the SigDAQ which is a signature-based DOM (s-DOM) as a storage model and a signature-based query executor (s-NFA). Our experimental results show that the signature method outperforms the original.
Testing Embedded-Core-Based System Chips
Authors: Yervant Zorian, Erik Jan Marinissen, Sujit Dey
Venue: Computer (1999)

Recently, designers have been embedding reusable modules to build on-chip systems that form rich libraries of predesigned, preverified building blocks. These embedded cores make it easier to import technology to a new system and differentiate the corresponding product by leveraging intellectual property advantages. Most importantly, design reuse shortens the time-to-market for new systems.The attributes that make system chips built with embedded IP cores an attractive methodology--design reuse, heterogeneity, reconfigurability, and customizability--also make testing and debugging these chips a complex challenge.The authors review the various alternatives for testing embedded cores and describe solutions and proposed standards that are expected to play a key role in developing the core-based design paradigm.
Multimedia LSI Accelerator with Embedded DRAM
Authors: Ichiro Sase, Nobuyuki Shimizu, Takashi Yoshikawa
Venue: IEEE Micro (1997)

The MSM7680 integrates the frame buffer with graphics controller functions including 2D drawing engine, MPEG-1 decoder, DAC for RGB analog output, and clock generator PLL. The MSM7680 uses embedded DRAM technology and can provides high performance and/or one chip solution for many graphic display systems.
What Is Software Testing? And Why Is It So Hard?
Authors: James A. Whittaker
Venue: IEEE Software (2000)

The author sheds some light on why testing today's software products is so challenging, and he identifies several solid approaches that all testers should be able to thoughtfully apply. The effective tester has a rich toolkit of fundamental testing techniques, understands how the product will be used in its operating environment, and has a nose for where subtle bugs might lurk in the product and a bag of tricks for flushing them out. The methods described here can help testers provide a sensible answer to the question of what they really mean when they say they are done testing a software system.
Representing Knowledge by Neural Networks for Qualitative Analysis and Reasoning
Authors: Mankuan Vai, Zhimin Xu
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

A systematic approach has been developed to construct neural networks for qualitative analysis and reasoning. These neural networks are used as specialized parallel distributed processors for solving constraint satisfaction problems. A typical application of such a neural network is to determine a reasonable change of a system after one or more of its variables are changed. A six-node neural network is developed to represent fundamental qualitative relations. A larger neural network can be constructed hierarchically for a system to be modeled by using six-node neural networks as building blocks. The complexity of the neural network building process is thus kept manageable. An example of developing a neural network reasoning model for a transistor equivalent circuit is demonstrated. The use of this neural network model in the equivalent circuit parameter extraction process is also described.
Learning Hardware Using Multiple-Valued Logic, Part 2: Cube Calculus and Architecture
Authors: Marek Perkowski, David Foote, Qihong Chen, Anas Al-Rabadi, Lech Jozwiak
Venue: IEEE Micro (2002)

A massively parallel reconfigurable processor speeds up logic operators performed in learning hardware. The approach uses combinatorial synthesis methods developed within the framework of the logic synthesis approach in digital-circuit-design automation.
A Systematic Approach to Designing Distributed Real-Time Systems
Authors: Lui Sha, Shirish S. Sathaye
Venue: Computer (1993)

The authors describe the use of generalized rate monotonic scheduling (GRMS) theory for the design and analysis of a distributed real-time system. This theory ensures that as long as the system utilization of all tasks lies below a certain bound, and appropriate scheduling algorithms are used, all tasks will meet their deadlines. This puts the development and maintenance of real-time systems on an analytic, engineering basis making, these systems easier to develop and maintain. The authors review the recent extensions of the theory to distributed systems scheduling and examine the architectural requirements for use of the theory. They provide an application example to demonstrate the benefits of this theory.
Highly Reliable Symmetric Networks
Authors: L. M. Huisman, S. Kundu
Venue: IEEE Transactions on Parallel and Distributed Systems (1994)

We generalize directed loop networks to loop-symmetric networks in which there are Nnodes and in which each node has in-degree and out-degree k, subject to the conditionthat 2/sup k/ does not exceed N. We show that by proper selection of links one canobtain generalized loop networks with optimal or close to optimal diameter andconnectivity. The optimized diameter is less than k/spl lsqb/N/sup 1/k//spl rsqb/, where/spl lsqb/x/spl rsqb/ indicates the ceiling of x. We also show that these networks arerather compact in that the diameter is not more than twice the average distance.Roughly 1/2(k/spl minus/1)N/sup 1/k/ nodes can be removed such that the network ofremaining nodes is still strongly connected, if all remaining nodes have at least oneincoming and one outgoing link left.
Stress analysis of a truck chassis with riveted joints
Authors: Ciçek Karaoglu, N. Sefa Kuralay
Venue: Finite Elements in Analysis and Design (2002)

In this study, stress analysis of a truck chassis with riveted joints was performed by using FEM. The commercial finite element package ANSYS version 5.3 was used for the solution of the problem. Determination of the stresses of a truck chassis before manufacturing is important due to the design improvement. In order to achieve a reduction in the magnitude of stress near the riveted joint of the chassis frame, side member thickness, connection plate thickness and connection plate length were varied. Numerical results showed that stresses on the side member can be reduced by increasing the side member thickness locally. If the thickness change is not possible, increasing the connection plate length may be a good alternative.
Learning the iTunesDB file format
Authors: Patrick Crosby
Venue: Linux Journal (2002)

iPods aren't just for people who use computers from Mattel, no wait, Apple. Here's the playlist format. Don't all buy iPods at once, folks.
Modeling the relationship between source code complexity and maintenance difficulty
Authors: David L. Lanning, Taghi M. Khoshgoftaar
Venue: Computer (1994)

Canonical correlation analysis can be a useful exploratory tool for software engineers who want to understand relationships that are not directly observable and who are interested in understanding influences affecting past development efforts. These influences could also affect current development efforts. In this paper, we restrict our findings to one particular development effort. We do not imply that either the weights or the loadings of the relations generalize to all software development efforts. Such generalization is untenable, since the model omitted many important influences on maintenance difficulty. Much work remains to specify subsets of indicators and development efforts for which the technique becomes useful as a predictive tool. Canonical correlation analysis is explained as a restricted form of soft modeling. We chose this approach not only because the terminology and graphical devices of soft modeling allow straightforward high-level explanations, but also because we are interested in the general method. The general method allows models involving many latent variables having interdependencies. It is intended for modeling complex interdisciplinary systems having many variables and little established theory. Further, it incorporates parameter estimation techniques relying on no distributional assumptions. Future research will focus on developing general soft models of the software development process for both exploratory analysis and prediction of future performance.
Association Schemes Related to Kasami Codes and KerdockSets
Authors: D. De Caen, E. R. Van Dam
Venue: Designs, Codes and Cryptography (1999)

Two new infinite series of imprimitive 5-class association schemes are constructed. The first series of schemes arises from forming, in a special manner, two edge-disjoint copies of the coset graph of a binary Kasami code (double error-correcting BCH code). The second series of schemes is formally dual to the first. The construction applies vector space duality to obtain a fission scheme of a subscheme of the Cameron-Seidel 3-class scheme of linked symmetric designs derived from Kerdock sets and quadratic forms over GF(2).
Change Detection in Overhead Imagery Using Neural Networks
Authors: Chris Clifton
Venue: Applied Intelligence (2003)

Identifying interesting changes from a sequence of overhead imagery&mdash;as opposed to clutter, lighting/seasonal changes, etc.&mdash;has been a problem for some time. Recent advances in data mining have greatly increased the size of datasets that can be attacked with pattern discovery methods. This paper presents a technique for using predictive modeling to identify unusual changes in images. Neural networks are trained to predict &ldquo;before&rdquo; and &ldquo;after&rdquo; pixel values for a sequence of images. These networks are then used to predict expected values for the same images used in training. Substantial differences between the expected and actual values represent an unusual change. Results are presented on both multispectral and panchromatic imagery.
Generalized Analytic Rule Extraction for Feedforward Neural Networks
Authors: Amit Gupta, Sang Park, Siuwa M. Lam
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

This paper suggests the ¿Input-Network-Training-Output-Extraction-Knowledge¿ framework to classify existing rule extraction algorithms for feedforward neural networks. Based on the suggested framework, we identify the major practices of existing algorithms as relying on the technique of generate and test, which leads to exponential complexity, relying on specialized network structure and training algorithms, which leads to limited applications and reliance on the interpretation of hidden nodes, which leads to proliferation of classification rules and their incomprehensibility. In order to generalize the applicability of rule extraction, we propose the rule extraction algorithm GeneraLized Analytic Rule Extraction (GLARE), and demonstrate its efficacy by comparing it with neural networks per se and the popular rule extraction program for decision trees, C4.5.
Improvement of Translation Quality of English NewspaperHeadlines by Automatic Pre-editing
Authors: Takehiko Yoshimi
Venue: Machine Translation (2001)

Since the headlines of English news articles have a characteristic style, different from the styles which prevail in ordinary sentences, it is difficult for MT systems to generate high-quality translation for headlines. We try to solve this problem by adding to an existing system a pre-editing module which rewrites headlines as ordinary expressions. Rewriting of headlines makes it possible to generate better translations which would not otherwise be generated, with little or no changes to the existing parts of the system. Focusing on the absence of a form of the verb be as a missing part of normal English, we have described rewriting rules for putting properly the verb be into headlines, based on information obtained by morpho-lexical and rough syntactic analysis. We have incorporated the proposed method into our English&ndash;Japanese MT system, and carried out an experiment with 312 headlines as unknown data. Our method has satisfactorily marked 81.2% recall and 92.0% precision.
Gradient Computation of Continuous-Time Cellular Neural/Nonlinear Networks with Linear Templates via the CNN Universal Machine
Authors: Mátyás Brendel, Tamás Roska, Gusztáv Bártfai
Venue: Neural Processing Letters (2002)

Single-layer, continuous-time cellular neural/nonlinear networks (CNN) are considered with linear templates. The networks are programmed by the template-parameters. A fundamental question in template training or adaptation is the gradient computation or approximation of the error as a function of the template parameters. Exact equations are developed for computing the gradients. These equations are similar to the CNN network equations, i.e. they have the same neighborhood and connectivity as the original CNN network. It is shown that a CNN network, with a modified output function, can compute the gradients. Thus, fast on-line gradient computation is possible via the CNN Universal Machine, which allows on-line adaptation and training. The method for computing the gradient on-chip is investigated and demonstrated.
Exploring scalar fields using critical isovalues
Authors: Gunther H. Weber, Gerik Scheuermann, Hans Hagen, Bernd Hamann
Venue: Proceedings of the conference on Visualization '02 (2002)

Isosurfaces are commonly used to visualize scalar fields. Critical isovalues indicate isosurface topology changes: the creation of new surface components, merging of surface components or the formation of holes in a surface component. Therefore, they highlight "interesting" isosurface behavior and are helpful in exploration of large trivariate data sets. We present a method that detects critical isovalues in a scalar field defined by piecewise trilinear interpolation over a rectilinear grid and describe how to use them when examining volume data. We further review varieties of the Marching Cubes (MC) algorithm, with the intention to preserve topology of the trilinear interpolant when extracting an isosurface. We combine and extend two approaches in such a way that it is possible to extract meaningful isosurfaces even when a critical value is chosen as isovalue.
Clock system design
Authors: Kenneth D. Wagner
Venue: IEEE Design Test (1988)

Provides a framework for understanding system timing and then describes how the computer clock system executes the timing specifications. He examines clock generation and the construction of clock-distribution networks, which are integral to any clock system. Examples from contemporary high-speed systems highlight several common methods of clock generation, distribution, and tuning. Tight control of system clock skew is stressed.
A Performance Model of Pipelined k-ary n-cubes
Authors: Sudhakar Yalamanchili, Patrick T. Gaughan
Venue: IEEE Transactions on Computers (1995)

Pipelined communication using virtual channels can realize low latency, high throughput, inter-processor communication. This paper presents an analytic performance model of pipelined communication in k-ary n-cubes. The model contains elements intended to capture and study key performance issues. In addition to the modeling of throughput and latency, the following issues are addressed using this model: 1) the tradeoff between full-duplex vs. half-duplex links, 2) the effects of intranode delay, 3) the effects of buffer size for each virtual channel. Detailed simulation experiments under a variety of conditions establish the viability of this model.
Mapping Petri Nets with Inhibitor Arcs onto Basic LOTOS Behavior Expressions
Authors: Adriano Valenzano, Riccardo Sisto
Venue: IEEE Transactions on Computers (1995)

The integration of different formal description techniques is an important feature in the design of communication protocols and concurrent systems. In this paper we address the problem of translating Petri nets with inhibitor arcs into basic LOTOS specifications, which is an important step in the direction of integrating these two commonly used formalisms. A mapping which preserves strong bisimulation equivalence is formally defined and illustrated by means of an example. The definition of the mapping enables us also to state a new result about the expressive power of the basic LOTOS subset which constitutes the mapping range.
Alphorn: A Remote Procedure Call Environment for Fault-Tolerant, Heterogeneous, Distributed Systems
Authors: Hans-Ruedi Aschmann, Niklaus Giger, Elisabeth Hoepli, Peter Janak, Hubert Kirrmann
Venue: IEEE Micro (1991)

Alphorn, a software environment for programming distributed computer systems, is described. Programs running on different computers, possibly of different types and running different operating systems, communicate in a client-server relationship by means of remote procedure calls. This efficient construct structures programs neatly. The paper covers distributed process control, Alphorn's object-based programming style, remote procedure calls, the service interface language, configuration, runtime and debugging, and fault tolerance support.
Angular Propagation Descriptions Relevant for Base Station Adaptive Antenna Operations
Authors: Patrick C. F. Eggers
Venue: Wireless Personal Communications: An International Journal (1999)

This paper presents basic short-term angular domain propagation descriptions relevant for beam-oriented SDMA operations, i.e. for spatially based algorithms, contrary to temporally based. A distinction is made between angular variant and invariant situations, i.e. whether the antenna system radiation pattern remains unchanged or not when sweeping over the angular domain. For the angular invariant case, multibeam diversity relations are explained, as well as simple data enhancement techniques for measurement refinements. For the angular variant case using linear arrays, this paper suggests a representation in the invariant virtual Doppler domain. A key benefit of generating beams in the Doppler domain instead of directly in the angular domain is a substantial saving in numerical complexity.