ppxscal/embedding_network huggingface dataset:
An Accurate and Efficient Time-Division Parallelization of Cycle Accurate Architectural Simulators
Authors: Masahiro Yano, Toru Takasaki, Takashi Nakada, Hiroshi Nakashima
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

This paper proposes a parallel cycle-accurate microarchitectural simulator which efficiently executes its workload by splitting the simulation process along time-axis into many intervals. This time-division parallelization is similar to the concept of trace-splitting parallelization but is completely different from this conventional technique because our simulator assures that its result is perfectly equivalent to what a sequential simulator produces. The assurance of the perfect accuracy is endued by a simple failure recovery mechanism; if i-th interval is simulated by a node with an approximate initial machine state which causes invalid result, the interval is simulated again by the node responsible to (i-1)-th interval and thus having the correct state at the beginning of i-th interval. In order to reduce the possibility of the interval failure for efficiency, the fully cycleaccurate simulation for an interval is preceded by a partial and thus fast microarchitectural simulation including that for caches, branch predictors and their interaction in speculative execution. Another important technique is to check the validity of an interval simulation by comparing approximate and correct initial states with respect to their effect to the subsequent execution, rather than the raw values of them. The effectiveness of these techniques are exhibited by our SimpleScalar-based implementation and its evaluation with SPEC CPU95 benchmarks which results that 8-node and 16-node parallel simulations achieve up to 5.8-fold and 9.4-fold speedup respectively.
A Detection and Offense Mechanism to Defend Against Application Layer DDoS Attacks
Authors: Jie Yu, Zhoujun Li, Huowang Chen, Xiaoming Chen
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Application layer DDoS attacks, which are legitimate in packets and protocols, gradually become a pressing problem for commerce, politics and military. We build an attack model and characterize layer-7 attacks into three classes: session flooding attacks, request flooding attacks and asymmetric attacks. We proposed a mechanism named as DOW (Defense and Offense Wall), which defends against layer-7 attacks using combination of detection technology and currency technology. An anomaly dete-ction method based on K-means clustering is introduced to detect and filter request flooding attacks and asymmetric attacks. To defend against session-flooding attacks, we propose an encoura-gement model that uses client's session rate as currency. Dete-ction model drops suspicious sessions, while currency model encourages more legitimate sessions. By collaboration of these two models, normal clients could gain higher service rate and lower delay of response time.
QoS-Broker for Transactional Workloads
Authors: Celso Rafael Santos, Joao Costa, Pedro Furtado
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Traditional database servers try to accommodate requests as fast as possible, which can be described as a best effort approach. However, different access items may have different quality-of-service (QoS) requirements. Therefore, it is important to provide QoS strategies such as differentiated services to accommodate those differences. In this paper we propose the QoS-Broker, which is a middleware for delivering QoS over database servers and applications, a modular and extensible architecture to support contracts over varied targets from queries to transactions or sessions and any desired QoS policy. Our experimental results illustrate the middleware by applying priority-based differentiation over terminals and over transactions on the TPCC benchmark.
Towards a Pervasive Mobile Multimedia Experience
Authors: Xu Chen, M. J. O'Grady, G. M. P. O'Hare
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

Mobile devices of the PDA and cellular phone genre are becoming increasingly ubiquitous. However, their ability to enable a truly mobile multimedia experience has been compromised by a number of factors including hardware limitations and a paucity of software graphics rendering engines for such devices. Ongoing developments in mobile technologies are rendering these limitations obsolete. However, a key remaining problem remains the lack of a standardised, open multimedia rendering framework for mobile devices. In this paper, a framework for rendering SMIL compliant, multimedia presentations on mobile devices is described.
Integrating materials, manufacturing and design in the sophomore year
Authors: E. Tsang, A. Wilhelm
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

A one credit hour laboratory course taught in the first quarter of the sophomore year is used to integrate the disciplines of materials science and engineering, manufacturing and design, and to help students make connection between mathematics, engineering science and design. Course activities aim to help students develop a feel for the design process; they will participate in the design and manufacturing of a product from start to finish. Students will engage in hands on activities to investigate the relationships between properties, structure and processing of materials, and will synthesize a process to solve a design problem involving mechanical forming. Students will also apply statistics for product description, tolerance, and properties, and they will make oral and written presentations about their design projects. The course meets once a week for three hours, and is team taught by two faculty members, one with background in materials science and the other with background in manufacturing and design.
Camera Motion Analysis in On-line MPEG Sequences
Authors: Fabricio Tiburzi, Jesus Bescos
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

This work describes a two stages algorithm for camera motion analysis. First, it detects frames defining changes in the camera motion pattern, and then characterises the motion pattern for each video segment. The proposed scheme is motivated by hierarchical content-aware adaptation of on-line video. Its main characteristics are on-line operation, direct analysis on the compressed domain, efficiency and robustness. Results are similar to those achieved by state-of-the-art camera motion classification schemes based on iterative fitting to a motion model, despite involving a significantly smaller number of operations.*
Searching and indexing text documents based on topic identification
Authors: Susan Mcroy
Venue:  (2006)

This work provides algorithms and heuristics to index text documents by determining important topics in the documents. To index text documents, the work provides algorithms to generate topic candidates, determine their importance, detect similar and synonymous topics, and eliminate incoherent topics. The indexing algorithm uses topic frequency to determine the importance and the existence of the topics. Repeated phrases are topic candidates. This work shows that indexing and searching results can be made significantly better than the current text indexing and searching systems. This work also describes applications that use the index to present search results more effectively, to browse the most important topics in text documents, and to extract summary paragraphs from text documents. Related topics are ordered by a simple, but useful, measure of the semantic distance among phrases. Keywords. indexing text documents, searching text documents, browsing text documents, summarizing text documents, topic semantic distance, phrase semantic distance
Voronoi L-types and hypermetrics
Authors: Michel Deza
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

It is a survey/research lecture, on Voronoi and Delaunay polytopes of lattices in relation, especially, to the following problems: 1) Voronoi L-type domains and non-rigidity degree of lattices, 2) Hypermetric cone and non-rigidity degree of Delaunay polytopes, 3) Voronoi conjecture for tilings.
Best bands selection for detection in hyperspectral processing
Authors: N. Keshava
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We explore the role of best bands algorithms in the context of maximizing the performance of hyperspectral algorithms. Specifically, we first focus on creating an intuitive framework for how metrics quantify the distance between two spectra. Focusing on the spectral angle mapper (SAM) metric, we demonstrate how the separability of two spectra can be increased by choosing the bands that maximize the metric. This intuition about best bands analysis for SAM is extended to the generalized likelihood ratio test (GLRT) for a practical target/background detection scenario. Results are shown for a scene imaged by the HYDICE sensor demonstrating that the separability of targets and background can be increased by carefully choosing the bands for the test.
A fixed-point recursive digital oscillator for additive synthesis of audio
Authors: T. Hodes
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

This paper summarizes our work adapting a recursive digital resonator for use on sixteen-bit fixed-point hardware. Our modified oscillator is a two-pole filter that maintains frequency precision at a cost of two additional operations per filter sample. The new filter's error properties are expressly matched to use in the range of frequencies relevant to additive synthesis of digital audio and sinusoidal modelling of speech in order to minimize the additional computational overhead. We present the algorithm, an error analysis, a performance analysis, and measurements of an implementation on a fixed-point vector microprocessor system.
Early Experiences on the NRL Cray XD1
Authors: Jeanie Osburn, Wendell Anderson, Robert Rosenberg, Marco Lanzagorta
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Scientists at the Naval Research Laboratory (NRL) are engaged in a broad spectrum of research. In order to provide the high performance computing resources to support that work NRL has recently obtained a three cabinet XD1 with 432 Opteron 275 dual core CPUs, 144 Vertex II FPGAs, and 6 Virtex 4 FPGAs. This paper will examine the applicability of the XD1 to these scientific problems.
Invariant kernel functions for pattern analysis and machine learning
Authors: Bernard Haasdonk, Hans Burkhardt
Venue: Machine Learning (2007)

In many learning problems prior knowledge about pattern variations can be formalized and beneficially incorporated into the analysis system. The corresponding notion of invariance is commonly used in conceptionally different ways. We propose a more distinguishing treatment in particular in the active field of kernel methods for machine learning and pattern analysis. Additionally, the fundamental relation of invariant kernels and traditional invariant pattern analysis by means of invariant representations will be clarified. After addressing these conceptional questions, we focus on practical aspects and present two generic approaches for constructing invariant kernels. The first approach is based on a technique called invariant integration. The second approach builds on invariant distances. In principle, our approaches support general transformations in particular covering discrete and non-group or even an infinite number of pattern-transformations. Additionally, both enable a smooth interpolation between invariant and non-invariant pattern analysis, i.e. they are a covering general framework. The wide applicability and various possible benefits of invariant kernels are demonstrated in different kernel methods.
Creating speaker-specific phonetic templates with a speaker-independent phonetic recognizer: implications for voice dialing
Authors: N. Jain
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

We present a new approach to speaker dependent template generation which uses dramatically less storage to represent a speaker's words, with minimal degradation in recognition accuracy. In this approach, the symbolic string produced by a speaker-independent phonetic recognizer is used to represent utterances. We investigate effective procedures for template generation, and compare the results of these procedures to templates represented by acoustic parameters for utterances produced with different telephone handsets. The use of speaker-specific templates led to a reduction of about 1:500 in data-storage requirements with comparable recognition accuracy. We also compare recognition performance for speaker-specific and speaker-independent templates, and for combinations of the two. The results showed that combining speaker-specific and speaker-independent templates produces better recognition performance than either alone. A voice dialing system is described which incorporates the speaker-specific templates.
Novel image compression technique for faster transmission
Authors: S. Ahamed
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper considers a novel combination of a scanning technique with the region based image coding scheme for better compression and for faster transmission is considered here. When applying predictive compression on image data there is an implicit assumption that the image scanned in a particular order may give a better compression. In addition region based coding has gained much favour in recent years. The efficiency of this algorithm in compressing an image having large uniform areas has been exploited here. A brief explanation of the hardware setup, which includes the important components is used to make the paper understandable. Finally, the results, though not entirely favourable yet, yield sufficient scope for its use in various applications in video transmission. 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
Clutter adaptive multiframe detection/tracking of random signature targets
Authors: M. G. S. Bruno
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

This paper develops the two-dimensional (2D) clutter adaptive, multiframe Bayes detector/tracker for targets with random signature. We model the background Clutter and the target signature as samples of two independent, spatially correlated, 2D noncausal Gauss-Markov random fields (GMrfs). The target's motion is modeled by a 2D hidden Markov model (HMM). We study, through Monte Carlo simulations, the performance of the adaptive multiframe detector/tracker, and show that the performance of the adaptive tracker is very close to the performance of the tracker when the clutter model is perfectly known.
A New Method for Infrared Weak Small Target Enhancement Based on Image Fusion
Authors: Lei Tang, Zong-gui Zhao
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

A new method for infrared weak small target enhancement based on image fusion was presented. The structure of this method is two times fusion. In first fusion stage, the simple image fusion method is used to fuse the continuous frames. In second fusion stage, the multiscale decomposition method is used to decompose the result from first fusion stage and then fuse them. The fusion effect with different multiscale decomposition methods such as the Wavelet transform, the Contourlet transform and the Wavelet-based Contourlet transform (WBCT) is contrasted. The experimental results show that the method is effective and can enhance infrared weak small targets.
Sizing sketches: a rank-based analysis for similarity search
Authors: Zhe Wang, Wei Dong, William Josephson, Qin Lv, Moses Charikar, Kai Li
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

Sketches are compact data structures that can be used to estimate properties of the original data in building large-scale search engines and data analysis systems. Recent theoretical and experimental studies have shown that sketches constructed from feature vectors using randomized projections can effectively approximate L1 distance on the feature vectors with the Hamming distance on their sketches. Furthermore, such sketches can achieve good filtering accuracy while reducing the metadata space requirement and speeding up similarity searches by an order of magnitude. However, it is not clear how to choose the size of the sketches since it depends ondata type, dataset size, and desired filtering quality. In real systems designs, it is necessary to understand how to choose sketch size without the dataset, or at least without the whole datase. This paper presents an analytical model and experimental results to help system designers make such design decisions. We present arank-based filtering model that describes the relationship between sketch size and data set size based on the dataset distance distribution. Our experimental results with several datasets including images, audio, and 3D shapes show that the model yields good, conservative predictions. We show that the parameters of the model can be set with a small sample data set and the resulting model can make good predictions for a large dataset. We illustrate how to apply the approach with a concrete example.
Image retrieval based on energy histograms of the low frequency DCT coefficients
Authors: J. A. Lay
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

With the increasing popularity of the use of compressed images, an intuitive approach for lowering computational complexity towards a practically efficient image retrieval system is to propose a scheme that is able to perform retrieval computation directly in the compressed domain. In this paper, we investigate the use of energy histograms of the low frequency DCT coefficients as features for the retrieval of DCT compressed images. We propose a feature set that is able to identify similarities on changes of image-representation due to several lossless DCT transformations. We then use the features to construct an image retrieval system based on the real-time image retrieval model. We observe that the proposed features are sufficient for performing high level retrieval on medium size image databases. And by introducing transpositional symmetry, the features can be brought to accommodate several lossless DCT transformations such as horizontal and vertical mirroring, rotating, transposing, and transversing.
Motion Estimation Using a General Purpose Neural Network Simulator for Visual Attention
Authors: Florentin Dorian Vintila, John K. Tsotsos
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Motion detection and estimation is a first step in the much larger framework of attending to visual motion based on Selective Tuning Model of Visual Attention [1]. In order to be able to detect and estimate complex motion in a hierarchical system it is necessary to use robust and efficient methods which encapsulate as much information as possible about the motion together with a measure of reliability of that information. One such method is the orientation tensor formalism which incorporates a confidence measure that propagates into subsequent processing steps. The tensor method is implemented in a neural network simulator which allows distributed processing and visualization of results. As output we obtain information about the moving objects from the scene.
Representing aggregate works in the digital library
Authors: George Buchanan, Jeremy Gow, Ann Blandford, Jon Rimmer, Claire Warwick
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper studies the challenge of representing aggregate works such as encyclopedias, collected poems and journals in heterogenous digital library collections. Reflecting on the materials used by humanities academics, we demonstrate the varied range of aggregate types and the problems of faithfully representing this in the DL interface. Aggregates are complex and pervasive, challenge common assumptions and confuse boundaries within organisational structures. Existing DL systems can only provide imperfect representation of aggregates, and alterations to document encoding are insufficient to create a faithful reproduction of the physical library. The challenge is amplified through concrete examples, and solutions are demonstrated in a well-known DL system and related to standard DL architecture.
Minitrack: Towards the "Service Oriented Enterprise"
Authors: Haluk Demirkan, Michael Goul, George W. Brown
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The complexities, costs and brittleness of current information architectures, infrastructures and distributed software have provided impetus to emerging conceptualizations of the Service Oriented Enterprise (SOE)1 and its orientation towards ondemand, proactive computing. Some scholars have even predicted the demise of enterprise computing as we know it today given anticipated SOE capabilities2. The foundations for SOE are rooted in current applications of service oriented architecture (SOA), service oriented infrastructure (SOI), business process and workflow, computing resource virtualization, business semantics, service level agreements, increasing standardization, end-to-end enterprise integration and other areas of applied and theoretical research. The purpose of this minitrack is to investigate this paradigm, review the impact of SOE on business and IT strategy, enterprise systems, organizational structures and individuals; investigate its tenets and evaluate relevant management and technical approaches to architecture, infrastructure, business processes, workflows and strategy.
Analyzing cooperative coevolution with evolutionary game theory
Authors: R. P. Wiegand, W. C. Liles, K. A. De Jong
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

The task of understanding coevolutionary algorithms is very difficult. These algorithms search landscapes which are, in some sense, adaptive. As a result, the dynamical behaviors of coevolutionary systems can frequently be even more complex than traditional evolutionary algorithms (EAs). Moreover, traditional EA theory tells us little about coevolutionary algorithms. One major question that has yet to be clearly addressed is whether or not coevolutionary algorithms re well-suited for optimization tasks. Although this question is equally applicable to competitive, as well as cooperative approaches, answering the question for cooperative coevolutionary algorithms is perhaps more attainable. Recently, evolutionary game theoretic (EGT) models have begun to be used to help analyze the dynamical behaviors of coevolutionary algorithms. One type of EGT model which is already reasonably well understood are multi-population symmetric games. We believe these games can be used to analytically model cooperative coevolutionary algorithms. This paper introduces our analysis framework, explaining how and why such models may be generated. It includes some examples illustrating specific theoretical and empirical analyses. We demonstrate that using our framework, a better understanding for the degree to which cooperative coevolutionary algorithms can be used for optimization can be achieved.