ppxscal/embedding_network huggingface dataset:
Multidomain spectral method for the helically reduced wave equation
Authors: Stephen R. Lau, Richard H. Price
Venue: Journal of Computational Physics (2007)

We consider the 2+1 and 3+1 scalar wave equations reduced via a helical Killing field, respectively referred to as the 2-dimensional and 3-dimensional helically reduced wave equation (HRWE). The HRWE serves as the fundamental model for the mixed-type PDE arising in the periodic standing wave (PSW) approximation to binary inspiral. We present a method for solving the equation based on domain decomposition and spectral approximation. Beyond describing such a numerical method for solving strictly linear HRWE, we also present results for a nonlinear scalar model of binary inspiral. The PSW approximation has already been theoretically and numerically studied in the context of the post-Minkowskian gravitational field, with numerical simulations carried out via the ''eigenspectral method.'' Despite its name, the eigenspectral technique does feature a finite-difference component, and is lower-order accurate. We intend to apply the numerical method described here to the theoretically well-developed post-Minkowski PSW formalism with the twin goals of spectral accuracy and the coordinate flexibility afforded by global spectral interpolation.
Display Techniques for Octree-Encoded Objects
Authors: L. J. Doctor
Venue: IEEE Computer Graphics and Applications (1981)

A family of algorithms and extensions provides a computationally efficient means of displaying shaded, semitransparent 3-D objects.
Towards a workflow-aware distributed versioning file system for metacomputing systems
Authors: Yang Wang
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

In this paper, a novel workflow-aware distributed versioning file system, WAD-VFS is presented to overcome the shortcoming of traditional DFS and facilitate the high performance computing. Our preliminary simulation results are impressive and can hence serve as a supporting evidence of deploying WAD-VFS to our ongoing metacomputing project, Trellis system.
The Description and Use of Register-Transfer Modules (RTM's)®
Authors: C. G. Bell
Venue: IEEE Transactions on Computers (1972)

This note describes a set of register-transfer modules (RTM's) that are used as a basis for digital systems design. RTM's allow digital systems to be specified in a flow chart form with complete construction (wiring) information, thus obviating combinational and sequential switching circuit theory based design. The modules make extensive use of integrated circuitry. The note briefly describes the class of problems that RTM's can be used to solve, together with some of the module design decisions. The most important RTM's are described from the user's viewpoint, and two example designs are given.
A Reengineering Approach of the Legacy System in the Digital Media Domain
Authors: Hyunmin Ko, Gihun Chang, Kangtae Kim
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Most digital media products are developed from legacy code with small modifications because of their characteristics such as short development lead-time and budget constraints on the cost of the product. As such, if the legacy code is repeatedly revised without considering issues of maintenance, the legacy code gradually gets harder to maintain. At such point of time, reengineering of the legacy code is needed as one of the solutions to improve maintainability. However, existing reengineering researches on embedded systems mainly focus on hardware rather than embedded software. Consequently, this paper proposes the reengineering approach to improve maintainability suitable for embedded software in the digital media domain; it consists of the reengineering process, the reengineering views, and the reengineering infrastructure, and it is applied to two projects of the digital media domain.
Implementing Parallel Counters with Four-Valued Threshold Logic
Authors: K. W. Current
Venue: IEEE Transactions on Computers (1979)

Parallel counters are multiple-input circuits that count the number of their inputs that are in a given state. They are useful in implementing parallel multipliers, digital summers, digital correlators, and in other digital signal processing capacities. In this paper, the implementation of parallel counters with four-valued threshold logic is described and these implementations are compared to their binary full adder network counter equivalents. This logic form was selected because of the increasing importance of implementing state-of-the-art digital signal processing systems in large-scale-integrated (LSI) circuit form. LSI circuit designs are, in general, limited by the number of metal signal and power lines that must be placed upon the chip's surface, not by the number of active and passive devices used. Since each signal variable in four-valued logic may assume four logic states, twice the information carrying capacity as in binary logic, an over 50-percent savings in the total number of signal variables required to implement the parallel counter results. Also, with the circuits we describe here, approximately 50 percent fewer transistors and resistors are necessary for the implementation of four-valued logic parallel counters. These savings are attainable with a modest tradeoff in speed and power.
A high quality steganographic method with pixel-value differencing and modulus function
Authors: Chung-Ming Wang, Nan-I Wu, Chwei-Shyong Tsai, Min-Shiang Hwang
Venue: Journal of Systems and Software (2008)

In this paper, we shall propose a new image steganographic technique capable of producing a secret-embedded image that is totally indistinguishable from the original image by the human eye. In addition, our new method avoids the falling-off-boundary problem by using pixel-value differencing and the modulus function. First, we derive a difference value from two consecutive pixels by utilizing the pixel-value differencing technique (PVD). The hiding capacity of the two consecutive pixels depends on the difference value. In other words, the smoother area is, the less secret data can be hidden; on the contrary, the more edges an area has, the more secret data can be embedded. This way, the stego-image quality degradation is more imperceptible to the human eye. Second, the remainder of the two consecutive pixels can be computed by using the modulus operation, and then secret data can be embedded into the two pixels by modifying their remainder. In our scheme, there is an optimal approach to alter the remainder so as to greatly reduce the image distortion caused by the hiding of the secret data. The values of the two consecutive pixels are scarcely changed after the embedding of the secret message by the proposed optimal alteration algorithm. Experimental results have also demonstrated that the proposed scheme is secure against the RS detection attack.
Distinguish Coding And Noncoding Sequences In A Complete Genome Using Fourier Transform
Authors: Yu Zhou, Li-Qian Zhou, Zu-Guo Yu, Vo Anh
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

A Fourier transform method is proposed to distinguish coding and non-coding sequences in a complete genome based on a number sequence representation of the DNA sequence proposed in our previous paper (Zhou et al., J. Theor. Biol. 2005) and the imperfect periodicity of 3 in protein coding sequences. The three parameters P_x(\bar S) (1), P_x(\bar S) (1/3) and P_x(\bar S) (1/36) in the Fourier transform of the number sequence representation of DNA sequences are selected to form a three-dimensional parameter space. Each DNA sequence is then represented by a point in this space. The points corresponding to coding and non-coding sequences in the complete genome of prokaryotes are seen to be divided into different regions. If the point (P_x(\bar S) (1), Px(\bar S) (1/3), P_x(\bar S) (1/36)) for a DNA sequence is situated in the region corresponding to coding sequences, the sequence is distinguished as a coding sequence; otherwise, the sequence is classified as a noncoding one. Fisher's discriminant algorithm is used to study the discriminant accuracy. The average discriminant accuracies pc, pnc, qc and qnc of all 51 prokaryotes obtained by the present method reach 81.02%, 92.27%, 80.77% and 92.24% respectively.
Integrating learner corpora and natural language processing: A crucial step towards reconciling technological sophistication and pedagogical effectiveness1
Authors: Sylviane Granger, Olivier Kraif, Claude Ponton, Georges Antoniadis, Virginie Zampa
Venue: ReCALL (2007)

Learner corpora, electronic collections of spoken or written data from foreign language learners, offer unparalleled access to many hitherto uncovered aspects of learner language, particularly in their error-tagged format. This article aims to demonstrate the role that the learner corpus can play in CALL, particularly when used in conjunction with web-based interfaces which provide flexible access to error-tagged corpora that have been enhanced with simple NLP techniques such as POS-tagging or lemmatization and linked to a wide range of learner and task variables such as mother tongue background or activity type. This new resource is of interest to three main types of users: teachers wishing to prepare pedagogical materials that target learners' attested difficulties; learners themselves for editing or language awareness purposes and NLP researchers, for whom it serves as a benchmark for testing automatic error detection systems.
System Organizations for Speech Understanding: Implications of Network and Multiprocessor Computer Architectures for AI
Authors: L. D. Erman, R. D. Fennell, V. R. Lesser, D. R. Reddy
Venue: IEEE Transactions on Computers (1976)

This paper considers various factors affecting system em organization for speech understanding research. The structure of the Hearsay system based on a set of cooperating, independent processes using the hypothesize-and-test paradigm is presented. Design considerations for the effective use of multiprocessor and network achitectures in speech understanding systems ems are presented: control of pro
Blind equalization in spatial multiplexing MIMO-OFDM systems based on vector CMA and decorrelation criteria
Authors: Traian Emanuel Abrudan, Visa Koivunen
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper we address the problem of blind recovery of multiple OFDM data streams in a Multiple-Input Multiple-Output (MIMO) system. We propose an equalization algorithm which is based on a combined criterion designed to cancel both inter-symbol interference (ISI) and co-channel interference (CCI). ISI is minimized by using a modified Vector Constant Modulus criterion while CCI is minimized by a decorrelation criterion. We establish conditions for the existence of the stable minima corresponding to the zero forcing receiver which performs the joint blind equalization and the co-channel signal cancellation. The local convergence properties of the algorithm are proved under the assumption that the balance parameter weighting the two criteria is set appropriately. We also provide the optimal value for this parameter. Reliable performance is achieved with relatively fast convergence and small steady-state error. The implementation of the blind equalizer requires low-computational cost, without any matrix inversions or other expensive operations.
Matrix Multiplication on the Biswapped-Mesh Network
Authors: Wenhong Wei, Wenjun Xiao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

In this paper, we introduce a new interconnection network named as biswapped network (BSN) simply, which are built of 2n copies of an n-node basis network. Biswapped-Mesh network is a kind of network whose basic network is mesh. In this network model, we develop algorithms to multiply two vectors, a vector and a matrix, and two matrices, and their complexity are analyzed.
Comments on "A Nonparametric Partitioning Procedure for Pattern Classification"1
Authors: G. W. Beakley
Venue: IEEE Transactions on Computers (1970)

In the above-mentioned paper, Henrichon and Fu present a non- parametric procedure for multivariate, multiclass pattern classification. They obtain a confidence bound on the probability of error through the theory of distribution-free tolerance regions. However, their procedure for obtaining a confidence bound on the basis of a sample from each class is not valid.
Feedback for guiding reflection on teamwork practices
Authors: Gilly Leshed, Jeffrey T. Hancock, Dan Cosley, Poppy L. McLeod, Geri Gay
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

Effective communication in project teams is important, but not often taught. We explore how feedback might improve teamwork in a controlled experiment where groups interact through chat rooms. Collaborators who receive high feedback ratings use different language than poor collaborators (e.g. more words, fewer assents, and less affect-laden language). Further, feedback affects language use. This suggests that a system could use linguistic analysis to automatically provide and visualize feedback to teach teamwork. To this end, we present GroupMeter, a system that applies principles discovered in the experiment to provide feedback both from peers and from automated linguistic analysis.
Compcon Spring Wrap-Up
Authors: W. Myers
Venue: Computer (1978)

Despite the current widespread preoccupation with microcomputers and small-scale, low-cost computing, there are certain kinds of scientific problems that appear to be solvable only through large computers. This, according to Seymour Cray of Cray Research, Inc., is the chief answer to the rhetorical question posed by the title of his COMPCON Spring 78 keynote speech, "Why Bother With Large Computers?" The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Pattern Spectra for Texture Segmentation of Gray-Scale Images
Authors: Maria Luiza F. Velloso, Thales A. A. Carneiro, Flavio J. de Souza
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper presents an unsupervised segmentation of textured images which combines local pattern spectra features and dimensionality reduction techniques. A pattern spectrum is a shape-size descriptor which can detect critical scales in an image and quantify various aspects of its shape-size content. We estimated local features from pattern spectra for discrete graytone images and arbitrary multilevel signals by using a discrete-size family of patterns. Then we applied dimensionality reduction techniques on the features extracted for achieving redundancy reduction and noise reduction. Recently, many neural algorithms have proposed for principal component analysis (PCA) and independent component analysis. In this work, we used two neural PCA and two neural ICA algorithms and compared them.
A Method to Construct Dynamic S-box Based on Chaotic Map
Authors: Jing Qiu, Xiaofeng Liao, Ping Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, a method for obtaining substitution boxes (S-boxes) dynamically based on chaotic map is presented. The properties such as nonlinearity, strict avalanche and resistance against the differential cryptanalysis are analyzed in detail. The result shows that the criterion for designing good S-box can be met approximately. As a result, our approach is suitable for practical application in designing block cryptosystem.
The Realization of Polylinear Sequential Circuits Using Flip-Flop Memory
Authors: H. A. Curtis
Venue: IEEE Transactions on Computers (1971)

In this paper there are developed simple processes for deriving, for finite synchronous sequential machines, polylinear sequential circuit realizations using trigger, set-reset, or J-K flip-flops as the memory elements. It is shown that each such realization is directly obtainable from a graph analogous to the reverse state diagram of the given machine; the latter graph was shown in a former paper by this author to correspond to a polylinear sequential circuit realization using delays for memory. The processes consist of the straightforward steps in the construction of the reverse state diagram analogs. Almost polylinear sequential circuits are defined, and it is shown how certain proper subgraphs of the aforementioned graphs can be used to derive these circuits.
Event-based application of ws-security policy on soap messages
Authors: Nils Gruschka, Meiko Jensen, Torben Dziuk
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

WS-Security and WS-Security Policy are the common standards for ensuring integrity and confidentiality for Web Service messages. On the one hand they allow very flexible definition of security requirements. On the other hand they lead to complex security administration and low performance message processing. In this paper, we present our solution for a security gateway, which uses complete event-based XML and WS-Security processing to create policy conforming SOAP messages. The evaluation of our implementation shows that the event-based approach leads to a much better performance than tree-based WS-Security implementations. Further, we discuss some problematical issues of WS-Security Policy processing, such as determination of digital identities.
Mobile IP and the IETF
Authors: Charles E. Perkins
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (1999)

At the 43rd IETF mobile-ip working group meeting in Orlando, there were a number of new developments of importance. In fact, the meeting was much too short to actually do justice to the list of subjects, and we could have made good use of a second working group meeting. The following topics were covered: &bull; private addresses &bull; Cellular IP, regionalized registration &bull; Ericsson's telephony requirements draft &bull; Mobile IPv6 &bull; RAT &bull; mobile PPP/L2TP
Bistable hybrids in sol-gel technology for switching devices
Authors: Antonela Dima, Francesco Della Corte, Ivo Rendina, Mihai O. Dima
Venue: Microelectronics Journal (2007)

Development of memories based on organic soft materials is a current industrial niche aimed at the upper contacts flash memories. The electrical bistability of such materials makes them ideal candidates for cost-effective, fast-programming switching devices. Hybrid thin films of SiO"2 with Rose Bengal (bis-triethylammonium) dopant are here reported for the first time, together with their characterisations. Technology-wise the main advantage of the films is the possibility to cast photolithographically, which is also cost-effective. The physical and chemical stability of the films yields reproducible devices, from both the microtechnological and electrical point of view.
Using Length-weighted Once Kernel to Detect Anomalous Process
Authors: Shaomin Mu, Shengfeng Tian, Chuanhuan Yin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In this paper, we present a new string kernel, called length-weighted once kernel, and propose an efficient algorithm to compute this kernel. The algorithm is based on dynamic programming and suffix kernel. Moreover, we intend to distinguish anomalous process from normal processes using a one-class support vector machine classifier with certain kernel function. In the experiments, gap-weighted kernels, length-weighted once kernel, and RBF kernel are tested with an SVM classifier on the UNM datasets. The experimental results reveal that the length-weighted once kernel outperforms the others.
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
Authors: P. Goel
Venue: IEEE Transactions on Computers (1981)

The D-algorithm (DALG) is shown to be ineffective for the class of combinational logic circuits that is used to implement error correction and translation (ECAT) functions. PODEM (path-oriented decision making) is a new test generation algorithm for combinational logic circuits. PODEM uses an implicit enumeration approach analogous to that used for solving 0-1 integer programming problems. It is shown that PODEM is very efficient for ECAT circuits and is significantly more efficient than DALG over the general spectrum of combinational logic circuits. A distinctive feature of PODEM is its simplicity when compared to the D-algorithm. PODEM is a complete algorithm in that it will generate a test if one exists. Heuristics are used to achieve an efficient implicit search of the space of all possible primary input patterns until either a test is found or the space is exhausted.
Volumetric Curved Planar Reformation for Virtual Endoscopy
Authors: David Williams, Soren Grimm, Ernesto Coto, Abdul Roudsari, Haralambos Hatzakis
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Curved Planar Reformation (CPR) has proved to be a practical and widely used tool for the visualization of curved tubular structures within the human body. It has been useful in medical procedures involving the examination of blood vessels and the spine. However, it is more difficult to use it for large, tubular, structures such as the trachea and the colon because abnormalities may be smaller relative to the size of the structure and may not have such distinct density and shape characteristics.Our new approach improves on this situation by using volume rendering for hollow regions and standard CPR for the surrounding tissue. This effectively combines gray scale contextual information with detailed color information from the area of interest. The approach is successfully used with each of the standard CPR types and the resulting images are promising as an alternative to virtual endoscopy.Because the CPR and the volume rendering are tightly coupled, the projection method used has a significant effect on properties of the volume renderer such as distortion and isometry. We describe and compare the different CPR projection methods and how they affect the volume rendering process.A version of the algorithm is also presented which makes use of importance driven techniques; this ensures the users attention is always focused on the area of interest and also improves the speed of the algorithm.
The Bidirectional Double Latch (BDDL)
Authors: J. Savir
Venue: IEEE Transactions on Computers (1986)

This paper describes a new type of shift register latch that is compatible with LSSD. The new latch has the property that information may be shifted in and out of it in two directions: left to right and right to left.