ppxscal/embedding_network huggingface dataset:
Gene SPILL: an evolutionary algorithm based on bacterial gene exchange
Authors: S. Das
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Prokaryotes mainly reproduce by binary fission where the offspring are genetically identical to their parents. In order to take advantage of the benefits of sexual reproduction, these organisms have evolved ingenious ways to exchange genetic information. This article proposes an evolutionary algorithm called SPILL (Simulated Prokaryote Interchange of aLLeles) that is based on prokaryote genetic exchange patterns. 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
A model of forensic analysis using goal-oriented logging
Authors: Sidney Karin
Venue:  (2007)

Forensic analysis is the process of understanding, re-creating, and analyzing arbitrary events that have previously occurred. It seeks to answer such questions as how an intrusion occurred, what an attacker did during an intrusion, and what the effects of an attack were. Currently the field of computer forensics is largely ad hoc. Data is generally collected because applications log it for debugging purposes or because someone thought it to be important. Practical forensic analysis has traditionally traded off analyzability against the amount of data recorded. Recording less data puts a smaller burden both on computer systems and on the humans that analyze them. Not recording enough data leaves analysts drawing their conclusions based on inference, rather than deduction. This dissertation presents a model of forensic analysis, called Laoco&ouml;n, designed to determine what data is necessary to understand past events. The model builds upon an earlier model used for intrusion detection, called the requires/provides model. The model is based on a set of qualities we believe a good forensic model should possess. Those qualities are in turn influenced by a set of five principles of computer forensic analysis. We apply Laoco&ouml;n to examples, and present the results for a UNIX system. The results demonstrate how the model can be used to record smaller amounts of highly useful data, rather than forcing a choice between overwhelming amounts of data or such a small amount of data to be effectively useless.
Real-time Detection of Semi-transparent Watermarks in Decompressed Video
Authors: Balint Seeber, Neil Yager, Adnan Amin
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Semi-transparent watermarks (logos) are a prominent feature of modern television programs. They are employed to label broadcasted programs, but not commercials, and therefore their absence can be exploited to filter out advertisements. A real-time template-based pixel matching algorithm for detecting known logos in video is presented. The logo detector achieves a high degree of precision (99.53%) and recall (97.23%) despite significant spatial variations inherent in the decompressed source video. When combined with other feature detectors, it forms the foundation of a live commercial detection system with applications in video archiving and embedded environments.
Solving the Region Growing Problem on the Connection Machine
Authors: Nawal Copty, Sanjay Ranka, Geoffrey Fox, Ravi Shankar
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

This paper presents a parallel algorithm for solving the region growing problem based on the split and merge approach. The algorithm was implemented on the CM-2 and the CM-5 in the data parallel and message passing models. The performance of these implementations is examined and compared.
Smart Classrooms Bring Top-Quality Education around the Globe
Authors: Davar Pishva
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

This paper describes a successful example that brings the much-needed information security education to Japan and effectively implements it in Hyogo Prefecture, which has been playing a leading role in providing measures for safety and security of Japanese society since the Great Hanshin Awaji Earthquake. The paper provides an overview of the technology used to link the university campuses in Japan and the US, and examines the methodologies used to make distance learning an exciting experience and as effective as the traditional classroom type education. It also discusses some of the challenges which were experienced during the process.
Ontology Based Clustering for Improving Genomic IR
Authors: Jian Wen, Zhoujun Li, Xiaohua Hu
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Recent work has shown that ontology is useful to improve the performance of information retrieval, especially in biomedical literatures. The method of ontology-based can solve synonym problems. In this paper, we propose a new frame for genomic information retrieval based on UMLS. In our frame, Genomic information retrieval includes three processes: first, documents were indexed based UMLS, which means documents were represented by concepts, besides, the concept weight was re-calculated combined with similarity between concepts. Second, documents were clustered using fuzzy c-means method. At last cluster language model is utilized for information retrieval. Our method can solve partly synonymy and polysemy problems. The new method is evaluated on TREC 2004/05 Genomics Track collections. Experiments show that the retrieval performance is greatly improved by the new method compared with the basic language model.
Performance and complexity trade off in CDMA multiuser communications
Authors: M. Nafie
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

In this paper, we describe a new tree-based CDMA receiver that can optimally trade complexity for detection performance. It yields the detector with the best detection performance for a given desired complexity level. Alternatively, it yields the lowest complexity receiver for any given desired detection performance. We describe a technique for designing receivers with linear complexity (including the optimal linear detector and decorrelator). We then explain how we can increase performance at the expense of a minimal increase in complexity. We show that as complexity increases to the level of that of the optimal receiver, our design approach automatically produces the optimal receiver. We also explain how our approach can be used with a minimum-mean-square-error design criterion and coded CDMA transmission. Finally, we illustrate with several examples the superiority of the receivers designed with our approach and discuss their advantages.
Developing a test program for the DoD 2400 bps vocoder selection process
Authors: M. R. Bielefeld
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The scores from a test program often receive close scrutiny when used for the selection of a vocoder algorithm. However, the test program itself is equally important to the proper evaluation and selection of a vocoder. It must translate user requirements into test procedures and test conditions that ensure the selected vocoder performs adequately. Furthermore, since the test program defines a significant portion of the evidence that will be used to make a selection, the integrity of the selection relies heavily on the structure of the test program. The test program is also constrained by finite resources of time, money, and personnel. In 1995, the DoD Digital Voice Processing Consortium (DDVPC) created a test program for the purpose of selecting a new 2400 bps federal standard vocoder. This test program demonstrated a process of selecting proper test methods and defining proper test conditions to assess required performance, complexity and implementation requirements. This paper discusses the motivation for the structure of the 1995 test program and provides a description of the actual test.
Comparison of Estimation Techniques Using Kalman Filter and Grid-Based Filter for Linear and Non-linear System
Authors: Subrata Bhowmik, Chandrani Roy
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The objective is to investigate the relative advantages and performance of grid based method. To achieve this, the grid-based method was compared with one of the known optimal filter i.e. Kalman filter. First two linear system models were tested by using these two methods. One was 1st order system and another was 2nd order system. The results obtained by these two methods were then compared. Again one nonlinear system model was tested by using these two methods. For non-linear system Extended Kalman filter was used in which linearization takes place about a trajectory that was continually updated with the state estimates resulting from the measurement. For non-linear system grid-based approximation method was used. The results obtained by these two methods were then compared.
Performing and Reviewing Assessments of Contemporary Modularization Approaches: What Constitutes Reasonable Expectations?
Authors: Robert J. Walker
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

The inherent difficulties in assessing contemporary modularization (CoM) approaches are considered. The motivation is provided for a model relating assessment methodologies to the maturity of the CoM approach.
On code coverage measurement for Verilog-A
Authors: Yuan-Bin Sha, Mu-Shun Lee
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

In order to verify the integration of digital circuits and analog circuits in a SOC design, HDL-A languages are proposed to describe analog circuits such that they can be simulated together with the digital circuits described in HDL code. For digital circuits, coverage-driven approach has been widely used to verify the quality of HDL designs. However, for analog models, there are still no suitable solutions to gauge their quality. Therefore, in this paper, we will first discuss the feasibility and its meaning of applying some existing coverage metrics to Verilog-A code. We also propose a new coverage metric, frequency coverage, for checking the completeness of the frequency response in Verilog-A designs. Using this coverage metric as an assistant to existing code coverage metrics, we can have more confidence on the correctness of the Verilog-A descriptions at different situations.
Intelligent compression of SAR imagery using multiresolution Markov models
Authors: R. J. Bonneau
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

We present a system for coding synthetic aperture radar (SAR) imagery, whereby regions of interest and background information are coded independently of each other. A multiresolution constant-false-alarm-rate (CFAR) detection scheme is utilized to discriminate between target regions and natural clutter. Based upon the detected target regions, we apply less compression to targets, and more compression to background data. This methodology preserves relevant features of targets for further analysis, and preserves the background only to the extent of providing contextual information. The resulting system dramatically reduces the bandwidth/storage requirements of the digital SAR imagery, while preserving the target-specific utility of the imagery.
Automatic 3D-2D image registration using partial digitally reconstructed radiographs along projected anatomic contours
Authors: Xin Chen, Martin R. Varley, Lik-Kwan Shark, Glyn S. Shentall, Mike C. Kirby
Venue: Proceedings of the International Conference on Medical Information Visualisation - BioMedical Visualisation (2007)

The paper presents a new intensity-based 3D-2D image registration algorithm for automatic pretreatment validation in radiotherapy. The novel aspects of the algorithm includes a hybrid cost function developed based on partial digitally reconstructed radiographs (DRRs) generated along projected anatomic contours and level set for similarity measurement, and a fast search method developed based on parabola fitting and sensitivity based search order. Using CT and orthogonal X-ray images from a skull phantom, the proposed algorithm is compared with the conventional ray-casting full DRR based registration method. Not only is the algorithm shown to be computationally more efficient with registration time being reduced by a factor of 8, but also the algorithm is shown to offer 50% higher capture range allowing the initial patient displacement up to 15 mm (measured by mean target registration error) and high registration accuracy with average errors of 0.53± 0.12 mm for translation and 0.61°±0.29° for rotation within the capture range.
The Decidability of the Structural Congruence for Beta-binders
Authors: Corrado Priami, Alessandro Romanel
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Beta-binders is a recent process algebra developed for modeling and simulating biological systems. As usual for process calculi, the semantic definition heavily relies on a structural congruence. The treatment of the structural congruence is essential for implementation. The proof of the decidability of this congruence, reported in this paper, is a first step towards implementations.
Embedded Support Vector Machine: Architectural Enhancements and Evaluation
Authors: Soumyajit Dey, Monu Kedia, Niket Agarwal, Anupam Basu
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

In recent years, research and development in the field of machine learning and classification techniques have gained paramount importance. The future generation of intelligent embedded devices will obviously require such classi- fiers working on-line and performing classification tasks in a variety of fields ranging from data mining to recognition tasks in image and video. Among different such techniques, Support Vector Machines (SVMs) have been found to deliver state of the art performance thus emerging as the clear winner. In this work, the Support Vector Machine Learning and Classification tasks are evaluated on embedded processor architectures and subsequent architectural modifications are proposed for performance improvement of the same.
Closed loop optimization of image coding using subjective error criteria
Authors: M. Etoh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper proposes a closed-loop optimization framework to improve image coding efficiency by searching DCT coefficients at the equivalent subjective quality to the original coding result. The proposed framework shares a basic idea currently adopted in speech coding that searches optimal codes in a closed-loop operation, evaluating the coded signal with perceptually weighted mean square error. To evaluate the perceptual quality in image coding, we introduce the masked PSNR that accounts for the masking effects, by which we apply the stepwise removal of subjectively negligible DCT coefficients. The result justifies the effectiveness of the proposed framework.
Improving the Development Process for CSE Software
Authors: Michael A. Heroux, James. M. Willenbring, Michael N. Phenow
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

Scientific and engineering programming has been around since the beginning of computing, often being the driving force for new system development and innovation. At the same time a continual focus on new modeling capabilities, and some apparent cultural issues, find software processes for many computational science and engineering (CSE) software projects lacking. Certainly there are notable exceptions, but our experience has been that CSE software projects, although committed to writing high-quality software, have few if any formal software processes and tools in place, and are often unaware of formal software quality assurance (SQA) concepts. Presently, increasing complexity of applications and a broad push to certify computations are dictating a higher standard for CSE software quality; it is no longer sufficient to claim to write high quality software. However, traditional software development models can be impractical for CSE projects to implement. Despite this, CSE software teams can benefit by implementing valuable SQA processes and tools. In this paper we outline some the processes and tools that are successfully used by the Trilinos Project. These tools and processes have been useful not only in increasing verifiable software quality, but also have improved overall software quality, and the development experience in general.
A Parallel Multi-Path Routing Algorithm for Flexible Transmission in Wireless Sensor Networks
Authors: Zhendong Wu, Shanping Li
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Multi-path strategy is one of the favorable choices for various applications and environments in sensor networks. In this paper, we study how to choose multi-paths effectively by taking full advantage of the known geographic information. Geographic routing has to face a fundamental difficulty: the local minimum phenomenon. To help the packets get out of the local minima, long-known right hand rule is used, which lose many links and doesn't suit parallel multi-paths. We propose a new method that greedy forwarding can be used in local minima through restricting forwarding regions. Based on the new method, a parallel multi-path routing algorithm (P2MR) is proposed. It can flexibly adjust forwarding schemes to satisfy different requirements of applications. Simulations show that P2MR can improve the performance of networks significantly.
Simulating Future Changes in Arctic and Subarctic Vegetation
Authors: Howard E. Epstein, Jed O. Kaplan, Heike Lischke, Qin Yu
Venue: Computing in Science and Engineering (2007)

The Arctic is a sensitive system undergoing dramatic changes related to recent warming trends. Vegetation dynamics—increases in the quantity of green vegetation and a northward migration of trees into the arctic tundra—are a component of this change. Although field studies over long time periods can be logistically problematic, simulation modeling provides a means for projecting changes in arctic and subarctic vegetation caused by environmental variations.
Techniques to Enhance Cache Performance Across Parallel Program Sections
Authors: J. K. Peir, K. So, J. H. Tang
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

Private caches are critical components in high per formance multiprocessor systems. However, it has been found that, when executing a parallel program, individual processors are very difficult to attain high cache hit ratio from one program section to another; therefore sophisti cated software coherence schemes are not cost effective. In this study, trace-driven simulation has been used to evaluate various less sophisticated compiler and software techniques which can enhance this inter-section locality in parallel executions. We found that the locality can be substantially im proved through the following ways of altering the sched uling of iterations in parallel DO loops among the executing processors: i) assignment of iterations in chunks, ii) reversed execution of parallel loops, and Hi) interchange inner and outer loops. These can be done manually by a programmer or automatically by a parallelizing compiler. Moreover, we also propose a software coherence scheme which can attain the maxi mum inter-section locality for read-only shared data.
Blind watermarking applied to image authentication
Authors: J. J. Eggers
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

To prevent image manipulations and fraudulent use of modified images, the embedding of semi-fragile digital watermarks into image data has been proposed. The watermark should survive modifications introduced by random noise or compression, but should not be detectable from non-authentic regions of the image The original image cannot be used by the watermark detector to verify the authenticity of the image. In this paper, we investigate the application of a recently developed quantization based watermarking scheme to image authentication. The watermarking technology, called Scalar Costa Scheme (SCS), allows reliable blind watermark detection from a small number of pixels, and thus enables the detection of local modifications to the image content.
A performance study of sequential I/O on windows NTTM4
Authors: Erik Riedel, Catharine van Ingen, Jim Gray
Venue: Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2 (1998)

Large-scale database, data mining, and multimedia applications require large, sequential transfers and have bandwidth as a key requirement. This paper investigates the performance of reading and writing large sequential files using the Windows NTtm 4.0 File System. The study explores the performance of Intel Pentium ProTM based memory and IO subsystems, including the processor bus, the PCI bus, the SCSI bus, the disk controllers, and the disk media in a typical server or high-end desktop system. We provide details of the overhead costs at each level of the system and examine a variety of the available tuning knobs. We show that NTFS out-of-the-box performance is quite good, but overheads for small requests can be quite high. The best performance is achieved by using large requests, bypassing the file system cache, spreading the data across many disks and controllers, and using deep-asynchronous requests. This combination allows us to reach or exceed the half-power point of all the individual hardware components.
A novel trellis-based searching scheme for EEAS-based CORDIC algorithm
Authors: Cheng-Shing Wu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

The CORDIC algorithm is a well-known iterative method for the computation of vector rotation. For applications that require forward rotation (or vector rotation) only, the extended elementary angle set (EEAS) Scheme provides a relaxed approach to speed up the operation of the CORDIC algorithm. When determining the parameters of EEAS-based CORDIC algorithm, two optimization problems are encountered. In the previous work, the greedy algorithm is suggested to solve these optimization problems. However, for an application that requires high-precision rotation operation, the results generated by the greedy algorithm may not be applicable. We propose a novel searching algorithm to overcome the aforementioned problem, called the trellis-based searching (TBS) algorithm. Compared with the greedy algorithm used in the conventional EEAS-based CORDIC algorithm, the proposed TBS algorithm yields apparent performance improvement. Moreover, the derivation of the error boundary as well as computer simulations are provided to support our arguments.