ppxscal/embedding_network huggingface dataset:
Data Hiding in 2-Color Images
Authors: Yu-Chee Tseng, Hsiang-Kuang Pan
Venue: IEEE Transactions on Computers (2002)

In an earlier paper, we proposed a steganography scheme for hiding a piece of critical information in a host binary image. That scheme ensures that, in each m \times n image block of the host image, as many as \lfloor \log_2 (mn+ 1) \rfloor bits can be hidden in the block by changing at most 2 bits in the block. In this paper, we propose a new scheme that improves in its capability to maintain higher quality of the host image after data hiding by sacrificing some data hiding space. The new scheme can still offer a good data hiding ratio. It ensures that, for any bit that is modified in the host image, the bit is adjacent to another bit which has a value equal to the former's new value. Thus, the hiding effect is quite invisible.
Distributed Concurrency Control Based on Limited Wait-Depth
Authors: P. A. Franaszek, J. R. Haritsa, J. T. Robinson, A. Thomasian
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The performance of high-volume transaction processing systems for business applications is determined by the degree of contention for hardware resources as well as for data. Hardware resource requirements may be met cost-effectively with a data-partitioned or shared-nothing architecture. However, the two-phase locking (2PL) concurrency control method may restrict the performance of a shared-nothing system more severely than that of a centralized system due to increased lock holding times. Deadlock detection and resolution are an added complicating factor in shared-nothing systems. The authors describe distributed Wait-Depth Limited (WDL) concurrency control (CC), a locking-based distributed CC method that limits the wait-depth of blocked transactions to one, thus preventing the occurrence of deadlocks. Several implementations of distributed WDL which vary in the number of messages and the amount of information available for decision making are discussed. The performance of a generic implementation of distributed WDL is compared with distributed 2PL (with general-waiting policy) and the Wound-Wait CC method through a detailed simulation. It is shown that distributed WDL behaves similarly to 2PL for low lock contention levels, but for substantial lock contention levels (caused by higher degrees of transaction concurrency), distributed WDL outperforms the other methods to a significant degree.
Single-pass redundancy addition and removal
Authors: Chih Wei Jim Chang, Malgorzata Marek-Sadowska
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Redundancy-addition-and-removal is a rewiring technique which for a given target wire wt finds a redundant alternative wire wa. Addition of wa makes wt redundant and hence removable without changing the overall circuit functionality. Incremental logic restructuring based on this technique has been used in many applications. However, the search for valid alternative wires requires trial-and-error redundancy testing of a potentially large set of candidate wires. In this paper, we study the fundamental theory behind this technique and propose a new reasoning scheme which directly identifies alternative wires without performing trial-and-error tests. Experimental results show up to 15 times speedup in comparison to the best techniques in literature.
A Systolic Architecture for Computing Inverses and Divisions in Finite Fields GF(2/sup m/)
Authors: Chin-Liang Wang, Jung-Lung Lin
Venue: IEEE Transactions on Computers (1993)

A new serial-in serial-out systolic array is presented for performing the element inversion in GF(2/sup m/) with the standard basis representation. The architecture is highly regular, modular, nearest neighbor connected, and thus well suited to VLSI implementation, It has a latency of 7m-3 clock cycles and a throughput rate of one result per 2m)-1 clock cycles. This speed performance is much better than those of the previous implementations. Without change in hardware design, the proposed inversion array can be directly used for computing the division in GF(2/sup m/).
Specifying a Real-Time Kernel
Authors: J. Michael Spivey
Venue: IEEE Software (1990)

The application of formal methods to a safety-critical system is illustrated. The objective of the study was to improve the existing documentation of a diagnostic X-ray machine to serve later reimplementations. The separation of the kernel from applications helped identify a design flaw in the kernel that could have caused damage by the X-ray application. The case study which shows that mathematical techniques have an important role to play in documenting systems and avoiding design flaws, is a good example of the use of the Z (pronounced 'Zed') notation and its methods for modeling systems. The limitations of this specification are delineated, showing that there is a need for other specification techniques to tackle the remaining properties, like real-time performance, for completeness and comparison.
A Semi-Lagrangian Method for Turbulence Simulations Using Mixed Spectral Discretizations
Authors: Jin Xu, Dongbin Xiu, George Em Karniadakis
Venue: Journal of Scientific Computing (2002)

We present a semi-Lagrangian method for integrating the three-dimensional incompressible Navier&ndash;Stokes equations. We develop stable schemes of second-order accuracy in time and spectral accuracy in space. Specifically, we employ a spectral element (Jacobi) expansion in one direction and Fourier collocation in the other two directions. We demonstrate exponential convergence for this method, and investigate the non-monotonic behavior of the temporal error for an exact three-dimensional solution. We also present direct numerical simulations of a turbulent channel-flow, and demonstrate the stability of this approach even for marginal resolution unlike its Eulerian counterpart.
Discriminative training of Gaussian mixture bigram models with application to Chinese dialect identification
Authors: Wuei-He Tsai, Wen-Whei Chang
Venue: Speech Communication (2002)

This study focuses on the parametric stochastic modeling of characteristic sound features that distinguish languages from one another. A new stochastic model, the so-called Gaussian mixture bigram model (GMBM), that allows exploitation of the acoustic feature bigram statistics without requiring transcribed training data is introduced. For greater efficiency, a minimum classification error (MCE) algorithm is employed to accomplish discriminative training of a GMBM-based Chinese dialect identification system. Simulation results demonstrate the effectiveness of the GMBM for dialect-specific acoustic modeling, and use of this model allows the proposed system to distinguish between the three major Chinese dialects spoken in Taiwan with 94.4% accuracy.
Correction to "Hard-Wired Multipliers with Encoded Partial Products"
Authors: S. Vassiliadis, E. M. Schwarz
Venue: IEEE Transactions on Computers (1993)

Several typographical errors in the above-named work are corrected.
Placement driven retiming with a coupled edge timing model
Authors: Ingmar Neumann, Wolfgang Kunz
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

Retiming is a widely investigated technique for performance optimization. It performs powerful modifications on a circuit netlist. However, often it is not clear, whether the predicted performance improvement will still be valid after placement has been performed. This paper presents a new retiming algorithm using a highly accurate timing model taking into account the effect of retiming on capacitive loads of single wires as well as fanout systems. We propose the integration of retiming into a timing-driven standard cell placement environment based on simulated annealing. Retiming is used as an optimization technique throughout the whole placement process. The experimental results show the benefit of the proposed approach. In comparison with the conventional design flow based on standard FEAS our approach achieved an improvement in cycle time of up to 34% and 17% on the average.
Fault-Tolerant Routing in Distributed Loop Networks
Authors: Krishnendu Mukhopadhyaya, Bhabani P. Sinha
Venue: IEEE Transactions on Computers (1995)

The ring network is a popular network topology for implementation in local area networks and other configurations. But it has a disadvantage of high diameter and large communication delay. So loop networks were introduced with fixed-jump links added over the ring. In this paper, we characterize some values for the number of nodes for which the lower bound on the diameter of loop networks is achieved. We also give an O(¿) time algorithm (where ¿ is the diameter of the graph) for finding a shortest path between any two nodes of a general loop network. We also propose a scheme to find a near optimal path (not more than one over the optimal) in case of a single node or link failure.
Exact Two-Image Structure from Motion
Authors: John Oliensis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

For two-image structure from motion, we present a simple, exact expression for a least-squares image-reprojection error for finite motion that depends only on the motion. Optimal estimates of the structure and motion can be computed by minimizing this expression just over the motion parameters. Also, we present a solution to the triangulation problem: an exact, explicit expression for the optimal structure estimate given the motion. We identify a new ambiguity in recovering the structure for known motion. We study the exact error's properties experimentally and demonstrate that it often has several local minima for forward or backward motion estimates. Our experiments also show that the "reflected" local minimum of Oliensis and Soatto et al. occurs for large translational motions. Our exact results assume that the camera is calibrated and use a least-squares image-reprojection error that applies most naturally to a spherical imaging surface. We approximately extend our approach to the standard least-squares error in the image plane and uncalibrated cameras. We present an improved version of the Sampson error which gives better results experimentally.
Structural Redocumentation: A Case Study
Authors: Kenny Wong, Scott R. Tilley, Hausi A. Müller, Margaret-Anne D. Storey
Venue: IEEE Software (1995)

Documentation has traditionally played a key role as an aid in program understanding. However, most documentation is "in-the- small," describing the program at the algorithm and data- structure level. For large, legacy software systems, one needs "in-the-large" documentation describing the high-level structural aspects of the software system's architecture from multiple perspectives. One way of producing such structural documentation for existing software systems is to use reverse-engineering technologies. This paper describes a case study in structural redocumentation: an analysis of SQL/DS (a multimillion line relational database system) using a flexible reverse-engineering approach developed as part of the Rigi project.
Automated Test Case Generation for BDI Agents
Authors: Chi Keen Low, T. Y. Chen, Ralph Rónnquist
Venue: Autonomous Agents and Multi-Agent Systems (1999)

We propose a coverage oriented test case generation methodology for BDI multi-agent systems. The coverage criteria involve plans and nodes within plans of multi-agent systems. We organise the criteria into a subsumption hierarchy to show the coverage relationships between the criteria. Then we apply the criteria on multi-agent systems to analyse some empirical data. The data analysed is the effect on the number of test cases generated automatically for each criterion. We use a tool, BDITESTER, to obtain the empirical data and to show that our proposal is pragmatic. Finally, we suggest some guidelines to select a criterion to automatically generate test cases for BDI agents.
Moving Endpoints and the Internal Consistency of Agents&lsquo; Ex Ante Forecasts
Authors: Sharon Kozicki, P. A. Tinsley
Venue: Computational Economics (1998)

Forecasts by rational agents contain embedded initial and terminal boundary conditions. Standard time series models generate two types of long-run boundary values or steady-state &rsquo;endpoints&lsquo; &ndash; fixed endpoints and moving average endpoints. Neither can explain the shifting endpoints implied by postwar movements in the cross-section of forward rate forecasts in the term structure or by post-1979 changes in survey estimates of expected long-run inflation. Multiperiod forecasts by a broader class of &rsquo;moving endpoint&lsquo; time series models provide substantially improved tracking of the historical term structure and generally support the internal consistency of the ex ante long-run expectations of bond traders and survey respondents.
2001 Technology Roadmap for Semiconductors
Authors: Alan Allan, Don Edenfeld, William H. Joyner,  Jr., Andrew B. Kahng, Mike Rodgers, Yervant Zorian
Venue: Computer (2002)

The International Technology Roadmap for Semiconductors is a worldwide collaborative effort within the semiconductor industry to confront the challenges implicit in Moore's law. The Roadmap's goal is to present an industry-wide consensus on the "best current estimate" of its R&D needs out to a 15-year horizon. As such, the ITRS provides a guide to the efforts of companies, research organizations, and governments to improve the quality of R&D investment decisions made at all levels. The 2001 Roadmap is notable because it was developed with truly international representation. In this article, representatives of the International Technology Working Groups for Design and Test showcase some of the contributions from 839 international experts seeking to address the difficult and exciting challenges facing the design and test communities and the semiconductor industry as a whole.
Structural Matching in Computer Vision Using Probabilistic Relaxation
Authors: William J. Christmas, Josef Kittler, Maria Petrou
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

In this paper, we develop the theory of probabilistic relaxation for matching features extracted from 2D images, derive as limiting cases the various heuristic formulae used by researchers in matching problems, and state the conditions under which they apply. We successfully apply our theory to the problem of matching and recognizing aerial road network images based on road network models and to the problem of edge matching in a stereo pair. For this purpose, each line network is represented by an attributed relational graph where each node is a straight line segment characterized by certain attributes and related with every other node via a set of binary relations.
Expressing cross-loop dependencies through hyperplane data dependence analysis
Authors: A. Zaafrani, M. R. Ito
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

Traditional dependence analysis techniques usually attempt to recognize the existence of dependencies between iterations of a loop and, in some cases, characterize these dependencies by finding direction vectors or distance vectors. In this paper, a more general form of data dependence called hyperplane dependence is introduced. It is a dependence whose source and destination are subspaces of the iteration space. This dependence form can be useful mainly for expressing dependencies across loop-nests, and consequently better understand the interaction between the loops. In order to be able to express across loop dependencies and analyze all loops in the code simultaneously, a global iteration space for all loops in the code is formed. Hyperplane dependence analysis is used in this paper to improve automatic generation of communication statements across loops and index alignment for n-dimensional grid target machines.
FETI and FETI-DP Methods for Spectral and Mortar Spectral Elements: A Performance Comparison
Authors: Dan Stefanica
Venue: Journal of Scientific Computing (2002)

We investigate the numerical performance of several FETI and FETI-DP algorithms, for both spectral and mortar spectral elements on geometrically conforming discretizations of the computational domain.
Fuzzy Inductive Learning Strategies
Authors: Ching-Hung Wang, Chang-Jiun Tsai, Tzung-Pei Hong, Shian-Shyong Tseng
Venue: Applied Intelligence (2003)

In real applications, data provided to a learning system usually contain linguistic information which greatly influences concept descriptions derived by conventional inductive learning methods. Design of learning methods for working with vague data is thus very important. In this paper, we apply fuzzy set concepts to machine learning to solve this problem. A fuzzy learning algorithm based on the AQR learning strategy is proposed to manage linguistic information. The proposed learning algorithm generates fuzzy linguistic rules from &ldquo;soft&rdquo; instances. Experiments on the Sports and the Iris Flower classification problems are presented to compare the accuracy of the proposed algorithm with those of some other learning algorithms. Experimental results show that the rules derived from our approach are simpler and yield higher accuracy than those from some other learning algorithms.
Defining Open Software Architectures for Customized Remote Execution of Web Agents
Authors: Valérie Issarny, Titos Saridakis
Venue: Autonomous Agents and Multi-Agent Systems (1999)

Agent-based solutions promise to ameliorate Web services, by promoting the modular construction of Web servers, relieving the network from transferring useless data, supporting user mobility, etc. However, existing Web servers do not favor the hosting of agents. This paper proposes a description of agent behavior in terms of its requirements regarding resource utilization (e.g. memory, and disk space), functional services (e.g. system calls), and non-functional properties (e.g. degree of replication, and access control). When formally expressed, these requirements can be used in an automated decision process, which is based on software specification matching techniques. Upon the acceptance of an agent, the host uses these requirements to construct an environment customized to agent's execution. We discuss the benefits of this approach, and how it can be used to promote existing agent-based solutions in the Web framework.
Post-Layout Verification of the WE DSP32 Digital Signal Processor
Authors: Laurence E. Bays, Chin-Fu Chen, Evelyn M. Fields, Renato N. Gadenz, W. Patrick Hays, Howard S. Moscovitz, Thomas G. Szymanski
Venue: IEEE Design Test (1989)

The authors describe the successful postlayout verification of the WE DSP32 digital signal processor and the application of advanced CAD (computer-aided design) tools. The development work culminated in the smooth transfer of the DSP32 design into high-volume production. During this period, the authors were able to diagnose and repair hundreds of design errors. They also caught errors in the test-vector software and fixed them before first silicon. They estimate that their verification work saved the DSP32 project a year of silicon debugging. In addition, the authors were able to enhance the CAD tools themselves.
A graph transformation approach to software architecture reconfiguration
Authors: Michel Wermelinger, José Luiz Fiadeiro
Venue: Science of Computer Programming (2002)

The ability of reconfiguring software architectures in order to adapt them to new requirements or a changing environment has been of growing interest. We propose a uniform algebraic approach that improves on previous formal work in the area due to the following characteristics. First, components are written in a high-level program design language with the usual notion of state. Second, the approach deals with typical problems such as guaranteeing that new components are introduced in the correct state (possibly transferred from the old components they replace) and that the resulting architecture conforms to certain structural constraints. Third, reconfigurations and computations are explicitly related by keeping them separate. This is because the approach provides a semantics to a given architecture through the algebraic construction of an equivalent program, whose computations can be mirrored at the architectural level.
Automatic segmentation of news items based on video and audio features
Authors: Wang Weiqiang, Gao Wen
Venue: Journal of Computer Science and Technology (2002)

The automatic segmentation of news items is a key for implementing the automatic cataloging system of news video. This paper presents an approach which manages audio and video feature information to automatically segment news items. The integration of audio and visual analyses can overcome the weakness of the approach using only image analysis techniques. It makes the approach more adaptable to various situations of news items. The proposed approach detects silence segments in accompanying audio, and integrates them with shot segmentation results, as well as anchor shot detection results, to determine the boundaries among news items. Experimental results show that the integration of audio and video features is an effective approach to solving the problem of automatic segmentation of news items.
A simulation-based method for the verification of shared memory in multiprocessor systems
Authors: Scott Taylor, Carl Ramey, Craig Barner, David Asher
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

As processor architectural complexity increases, greater effort must be focused on functional verification of the chip as a component of the system. Multiprocessor verification presents a particular challenge in terms of both difficulty and importance. While formal methods have made significant progress in the validation of coherence protocols, these methods are not always practical to apply to the structural implementation of a complex microprocessor. This paper describes a simulation-based approach to modeling and checking the shared-memory properties of the Alpha architecture by using a directed acyclic graph to represent memory-access orderings. The resulting tool is integrated with a simulation model of an Alpha implementation, allowing the user to verify aspects of the implementation with respect to the overall architectural specification. Both an implementation-independent and an implementation-specific version of the tool are discussed.
Face Recognition: Features Versus Templates
Authors: R. Brunelli, T. Poggio
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

Two new algorithms for computer recognition of human faces, one based on the computation of a set of geometrical features, such as nose width and length, mouth position, and chin shape, and the second based on almost-gray-level template matching, are presented. The results obtained for the testing sets show about 90% correct recognition using geometrical features and perfect recognition using template matching.
Predicting the performance of synchronous discrete event simulation systems
Authors: Jinsheng Xu, Moon Jung Chung
Venue: Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design (2001)

In this paper we propose a model to predict the performance of synchronous discrete event simulation. The model considers parameters including the number of active objects per cycle, event execution granularity and communication cost. We derive a single formula that predicts the performance of synchronous simulation.We have benchmarked several VHDL circuits on SGI Origin 2000. The benchmark results show that the prediction model explains more than 90% of parallel simulation execution time. We also measure the effect of computation granularity over performance. The benchmark results show that although higher granularity can have better speedup because of dominance of computation over communication, the computational granularity cannot overshadow the inherent synchronization cost. This model can be used to predict the speed-up expected for synchronous simulation, and to decide whether it is worthwhile to use synchronous simulation before actually implementing it.