ppxscal/embedding_network huggingface dataset:
Management agent for search algorithms
Authors: Jukkrit Kluabwang, Deacha Puangdownreong, Sarawut Sujitjorn
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

This paper presents a management approach applied to search algorithms to achieve more efficient search. It acts as a management agent to a core search unit, in which the Adaptive Tabu Search (ATS) has been applied. The proposed management agent composes of partitioning and discarding mechanisms to speed up the search. It has been tested against Bohachevsky's, Rastrigin's and Shekel's foxholes functions, respectively, for surface optimization.
A Parallax-Map-Based DIBR System to Compromise Visual Quality and Depth Resolution
Authors: Ting-Ching Lin, Hsien-Chao Huang, Yueh-Min Huang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Depth-Image-Based Rendering (DIBR) has been regarded as the most promising solution for 3D TV, but exposure of occlusion areas that will lead to poor visual quality of synthesized virtual-view images is its inherent disadvantage. In previous studies, an asymmetric Gaussian low-pass filter with strong strength has been used to reduce numbers and sizes of disocclusion areas in synthesized images for improving visual quality. However, it also attenuates depth resolution seriously. DIBR should have a good compromise between improving visual quality and preserving depth resolution. In this paper, the factors inducing poor visual quality and attenuate depth resolution are addressed, and how these factors influence one another is analyzed as well. Based on the analysis results, a parallax-map-based DIBR system without soothing depth-images is proposed. Experimental results show that the proposed DIBR system can improve visual quality and preserve depth resolution well within normal depth preferences of viewers.
A multistage interpolation design of an audio DAC
Authors: Qin Kun, Lu Tiejun, Xiao Du, Wang Zongmin, Luo Binming
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The concepts of digital signal processing are playing an increasingly important role in the area of multirate signal processing. The multistage interpolator main building blocks are a Cascaded Integrator-Comb (CIC) filter and the respective compensation filter and halfband filters. Their coefficients were attained from the MATLAB simulation. The CIC was designed to have 4 stages, a differential delay of 1 and a variable rate change factor of 16. A novel method based on CSD coding is proposed to realize a polyphase multiplier-free halfband subfilter with a high resolution. This approach reduces the complexity of the control system and saves chip area dramatically. The final designed interpolation filter's passband is in the region from -0.01dB to 0.01dB and the stop attenuation is 85dB.
Coherent multiresolution isosurface ray tracing
Authors: Aaron M. Knoll, Ingo Wald, Charles D. Hansen
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

We implement and evaluate a fast ray tracing method for rendering large structured volumes. Input data is losslessly compressed into an octree, enabling residency in CPU main memory. We cast packets of coherent rays through a min/max acceleration structure within the octree, employing a slice-based technique to amortize the higher cost of compressed data access. By employing a multiresolution level of detail (LOD) scheme in conjunction with packets, coherent ray tracing can efficiently render inherently incoherent scenes of complex data. We achieve higher performance with lesser footprint than previous isosurface ray tracers, and deliver large frame buffers, smooth gradient normals and shadows at relatively lesser cost. In this context, we weigh the strengths of coherent ray tracing against those of the conventional single-ray approach, and present a system that visualizes large volumes at full data resolution on commodity computers.
Laminar structure of ptolemaic graphs with applications
Authors: Ryuhei Uehara, Yushi Uno
Venue: Discrete Applied Mathematics (2009)

Ptolemaic graphs are those satisfying the Ptolemaic inequality for any four vertices. The graph class coincides with the intersection of chordal graphs and distance hereditary graphs. It can also be seen as a natural generalization of block graphs (and hence trees). In this paper, we first state a laminar structure of cliques, which leads to its canonical tree representation. This result is a translation of @c-acyclicity which appears in the context of relational database schemes. The tree representation gives a simple intersection model of ptolemaic graphs, and it is constructed in linear time from a perfect elimination ordering obtained by the lexicographic breadth first search. Hence the recognition and the graph isomorphism for ptolemaic graphs can be solved in linear time. Using the tree representation, we also give an efficient algorithm for the Hamiltonian cycle problem.
Virtualization as a teaching tool
Authors: Michal Bližňák, Jiří Vojtešek, Radek Matušů, Tomáš Dulík
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

Nowadays, the virtualization technologies are more and more often used in many informatics areas. They are applied for better utilization of existing hardware or software resources, servers' consolidation and for security reasons as well. This article shows how is possible to used the virtualization technology also in the academic environment as a support of laboratory exercises of two academic courses. The case study is based on the idea of virtualization of the physical computer for lower costs and security reasons. The VMWare and VirtualBox were chosen suitable programs for demonstration. However, described approaches and techniques can be applied to many others fields, not only in these two courses.
Economic efficiency analysis of wafer fabrication facilities
Authors: Wen-Chih Chen, Chen-Fu Chien, Ming-Hsuan Chou
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Semiconductor industry is capital intensive and competitive, and thus efficiently utilizing resources to provide products and services is essential for maintaining competitive advantages. Knowing whether the resource is properly utilized is the foundation for future improvements and/or decision making. This study investigates the economic efficiency of fabrication facility (fab) operations. We develop a two-stage overall efficiency model, which clearly defines and explains the "real" performance of fab production operations and the non-production issues. The model provides an overall performance index while considering different aspects. A single performance index can be used to evaluate and rank the performance for period review. Factors affecting performance can be identified. Furthermore, according to a real case, an ex post relative efficiency analysis is conducted and the initial results are reported. The case study can help providing diagnosis for inefficient production facilities and identifying best practices of efficient production units.
Requirements definition and its interface to the SARA design methodology for computer-based systems
Authors: James W. Winchester, Gerald Estrin
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper presents results of efforts during 1979--1981 to integrate and enhance the work of the System ARchitects Apprentice (SARA) Project at UCLA and the Information System Design Optimization System (ISDOS) Project at the University of Michigan. While expressing a need for a requirements definition subsystem, SARA had no appropriate requirements definition language, no defined set of requirements analysis techniques or tools, and no procedures to form a more cohesive methodology for linking computer system requirements to the ensuing design. Research has been performed to fill this requirements subsystem gap, using concepts derived from the ISDOS project as a basis for departure.
Early analysis for power distribution networks
Authors: Kai Wang, Aveek Sarkar, Norman Chang, Shen Lin
Venue: Proceedings of the 2009 international symposium on Physical design (2009)

An efficient and effective power distribution network is crucial to the function and performance of chip and package. As semiconductor processing technology advances to 90nm node and below, system-on-chip (SoC) designs face complex power supply challenges driven by changes such as higher placement and power density, smaller wire and via geometries, and lower supply voltages, in sophisticated, multi-layered packages and boards. The design and verification of power distribution networks is becoming more and more difficult, requiring that these issues be addressed at an early stage of design. In this talk, we present a methodology for verifying power distribution networks early in the design process, when complete placement and routing information is not yet available. The usage model is extremely flexible and allows designers to run the analysis with different types of design abstraction. We demonstrate that the proposed methodology can help designers ensure that the power distribution network meets the performance guideline all through the design cycle.
Structured Coding for Content Based Interactive Audio
Authors: Kathy Melih, Ruben Gonzalez
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper addresses the dual problem of audio coding for compression and retrieval. Because of the sheer volume of multimedia data, much research effort has focused on coding techniques for the compression of this data. However, being able to store large amounts of data in a compact fashion has limited application if there is no meaningful way to access and interact with them. Traditionally, these two issues have been treated separately resulting in many problems for multimedia data management. The authors have proposed a solution to these problems for audio by developing a compact, perceptually based, structured audio representation that provides explicit support for content based retrieval, browsing and other interactions. In addition, the representation offers potential for compressed data storage. This paper outlines a coding scheme based on the representation and reports the compression results.
Robust Watermarking Using Distributed MR-DCT and SVD
Authors: Gaurav Bhatnagar, Balasubramanian Raman
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper, a robust watermarking scheme is proposed for copyright protection using Distributed multi resolution discrete cosine transform(D-MR-DCT) and singular value decomposition. The core idea of the proposed scheme is to decompose an image into four frequency sub-bands using D-MR-DCT and then singular values of every sub-band are modified with the singular values of the watermark. The experimental results show better visual imperceptibility and resiliency of the proposed scheme against intentional or unintentional variety of attacks.
Query by shots: retrieving meaningful events using multiple queries and rough set theory
Authors: Kimiaki Shirahama, Kuniaki Uehara
Venue: Proceedings of the 9th International Workshop on Multimedia Data Mining: held in conjunction with the ACM SIGKDD 2008 (2008)

In videos, even if events have the same semantic content (e.g. conversation, battle, chase and so on), they are presented in different ways. So, these events have significantly different properties. For example, one battle event is characterized by a large sound volume (e.g. gunshot), while another one is characterized by a large amount of motion (e.g. fighting action). Thus, events with the same semantic content cannot be internally defined by a single model. In this paper, we propose an example-based event retrieval method which uses multiple queries to externally define events with the same semantic content. Specifically, we apply rough set theory to multiple queries. Thereby, we can extract subsets of events, which are characterized by different combinations of low-level features. Then, by unifying extracted subsets, we conceptualize the semantic content. The experimental results indicate a possibility of our method based on multiple queries and rough set theory.
Agentification of Markov model-based segmentation: Application to magnetic resonance brain scans
Authors: Benoit Scherrer, Michel Dojat, Florence Forbes, Catherine Garbay
Venue: Artificial Intelligence in Medicine (2009)

Objective: Markov random field (MRF) models have been traditionally applied to the task of robust-to-noise image segmentation. Most approaches estimate MRF parameters on the whole image via a global expectation-maximization (EM) procedure. The resulting estimated parameters are likely to be uncharacteristic of local image features. Instead, we propose to distribute a set of local MRF models within a multiagent framework. Materials and methods: Local segmentation agents estimate local MRF models via local EM procedures and cooperate to ensure a global consistency of local models. We demonstrate different types of cooperations between agents that lead to additional levels of regularization compared to the standard label regularization provided by MRF. Embedding Markovian EM procedures into a multiagent paradigm shows interesting properties that are illustrated on magnetic resonance (MR) brain scan segmentation. Results: A cooperative tissue and subcortical structure segmentation approach is designed with such a framework, where both models mutually improve. Several experiments are reported and illustrate the working of Markovian EM agents. The evaluation of MR brain scan segmentation was performed using both phantoms and real 3T brain scans. It showed a robustness to intensity non-uniformity and noise, together with a low computational time. Conclusion: Based on these experiments MRF agent-based approach appears to be a very promising new tool for complex image segmentation.
The Design of Multimedia Languages Based on Teleaction Objects
Authors: G. Polese, G. Tortora, S. K. Chang
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We present a design methodology for multidimensional languages to be used in multimedia applications. The design framework extends methodologies for visual language design and relies on Teleaction Objects as a model for specifying and controlling multimedia presentations.
Weighted game developer qualifications for consideration in curriculum development
Authors: Monica McGill
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

Game development programs are being added to computer science departments as either a track, minor, or major in post-secondary institutions across the United States. These programs are being developed with little published quantitative or qualitative research on what such programs should entail. The quantitative research in this pilot study defines qualifications sought when hiring game developers for positions in industry. Using cross-sectional data, qualifications from job advertisements were coded, categorized, and then subcategorized and weighted totals were calculated based on skills being either required or desired. Weighted totals in each subcategory were compared and ranked. The top 10 qualifications are provided, along with a breakdown of rankings of all subcategories within each category. Subcategories of Languages and Tools/Environments are also discussed briefly to highlight key qualifications in each.
Variation-aware resource sharing and binding in behavioral synthesis
Authors: Feng Wang, Yuan Xie, Andres Takach
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

As technology scales, the delay uncertainty caused by process variations has become increasingly pronounced in deep submicron designs. In the presence of process variations, worst-case timing analysis may lead to overly conservative synthesis, and may end up using excess resources to guarantee design constraints. In this paper, we propose an efficient variation-aware resource sharing and binding algorithm in behavioral synthesis, which takes into account the performance variations for functional units. The performance yield, which is defined as the probability that the synthesized hardware meets the target performance constraints, is used to evaluate the synthesis result. An efficient metric called statistical performance improvement, is used to guide resource sharing and binding. The proposed algorithm is evaluated within a commercial synthesis framework that generates optimized RTL netlists from behavioral specifications. The effectiveness of the proposed algorithm is demonstrated with a set of industrial benchmark designs, which consist of blocks that are commonly used in wireless and image processing applications. The experimental results show that our method achieves an average 33% area reduction over traditional methods, which are based on the worst-case delay analysis, with an average 10% run time overhead.1
Computing a rational in between
Authors: Ioannis Emiris, Bernard Mourrain, Elias Tsigaridas
Venue: ACM Communications in Computer Algebra (2009)

We are interested in the following problem: Given two (distinct) real algebraic numbers in isolating interval representation, that is an isolating interval with rational endpoints and a square free polynomial with integer coefficients, can we compute a number between them as a rational function of the coefficients of the polynomials that define these two numbers? Assume that the order of the two numbers is known (we will remove this assumption in the sequel). If we are given intervals that contain the real algebraic numbers and a procedure to refine them, we can solve our problem as follows: We refine the intervals until they become disjoint, this will happen eventually since we assume that the algebraic numbers are not equal, and then we compute a rational between the intervals, which separates the algebraic numbers. However, this iterative approach depends on separation bounds, e.g. [7]. We present a direct method, which is applicable when we allow in addition to compute the floor of a polynomial expression that involves real algebraic numbers. The problem arises when we wish to compute rational numbers that isolate the roots of an integer polynomial of small degree, say ≤ 5 [2]. Also in geometry, in order to analyse the intersection of two quadrics P and Q [6], one needs to determine the real roots of the polynomial det(P +xQ) = 0, their multiplicities and a value in between each of these roots. Another motivation comes from the arrangement of quadrics [4] In this case a rational is needed separating two real roots of two polynomials with real algebraic numbers as coefficients. The real roots of such polynomials can be expressed as real algerbaic numbers and so we face the problem of computing a rational separating two real algebraic numbers.
A general model for matroids and the greedy algorithm
Authors: Ulrich Faigle, Satoru Fujishige
Venue: Mathematical Programming: Series A and B (2009)

We present a general model for set systems to be independence families with respect to set families which determine classes of proper weight functions on a ground set. Within this model, matroids arise from a natural subclass and can be characterized by the optimality of the greedy algorithm. This model includes and extends many of the models for generalized matroid-type greedy algorithms proposed in the literature and, in particular, integral polymatroids. We discuss the relationship between these general matroids and classical matroids and provide a Dilworth embedding that allows us to represent matroids with underlying partial order structures within classical matroids. Whether a similar representation is possible for matroids on convex geometries is an open question.
Modeling Propagation Dynamics of Bluetooth Worms (Extended Version)
Authors: Guanhua Yan, Stephan Eidenbenz
Venue: IEEE Transactions on Mobile Computing (2009)

In the last few years, the growing popularity of mobile devices has made them attractive to virus and worm writers. One communication channel often exploited by mobile malware is the Bluetooth interface. In this paper, we present a detailed analytical model that characterizes the propagation dynamics of Bluetooth worms. Our model captures not only the behavior of the Bluetooth protocol but also the impact of mobility patterns on the Bluetooth worm propagation. Validation experiments against a detailed discrete-event Bluetooth worm simulator reveal that our model predicts the propagation dynamics of Bluetooth worms with high accuracy. We further use our model to efficiently predict the propagation curve of Bluetooth worms in big cities such as Los Angeles. Our model not only sheds light on the propagation dynamics of Bluetooth worms, but also allows to predict spreading curves of Bluetooth worm propagation in large areas without the high computational cost of discrete-event simulation.
An investigation on the approaches for version control systems
Authors: Vladimir Jotov
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

The article introduces the major flows in version control area. Here we present and classify the major features and challenges and their approaches in the problem area. Furthermore a roadmap for further elaborations is outlined in this article.
Healing DNA Self-Assemblies Using Punctures
Authors: Masoud Hashempour, Zahra Mashreghian Arani, Fabrizio Lombardi
Venue: Journal of Electronic Testing: Theory and Applications (2009)

In self-assembly, individual components (commonly referred to as tiles) have sufficient infor mation to build templates for structures such as lat tices for two-dimensional scaffolds. Tile sets that can heal (fully or partially) an erroneous DNA assembly have been proposed. Healing requires growth to be restarted such that erroneous tiles can be removed and the correct tiles can bind to the aggregate. Punctures have been proposed for this purpose; in this paper, a puncture is intentionally induced in the self-assembly to restart the growth process. The goal of this paper is to characterize an intentionally induced puncture (and its relevant properties) on an erroneous tile site in the grown crystal as part of a healing process. This allows to propagate any newly generated error away from the source of growth (i.e. the seed tile), such that self-assembly can continue along specific directions. Different types of puncture are considered with respect to healing and related features, such as growth direction, error and aggregate types. Punctures are analyzed using a new characterization and metric; different tile sets are investigated in detail for healing of a DNA self-assembly.