ppxscal/embedding_network huggingface dataset:
Coping with network failures: routing strategies for optimal demand oblivious restoration
Authors: David Applegate, Lee Breslau, Edith Cohen
Venue: Proceedings of the joint international conference on Measurement and modeling of computer systems (2004)

Link and node failures in IP networks pose a challenge for network control algorithms. Routing restoration, which computes new routes that avoid failed links, involves fundamental tradeoffs between efficient use of network resources, complexity of the restoration strategy and disruption to network traffic. In order to achieve a balance between these goals, obtaining routings that provide good performance guarantees under failures is desirable.In this paper, building on previous work that provided performance guarantees under uncertain (and potentially unknown) traffic demands, we develop algorithms for computing optimal restoration paths and a methodology for evaluating the performance guarantees of routing under failures. We then study the performance of route restoration on a diverse collection of ISP networks. Our evaluation uses a competitive analysis type framework, where performance of routing with restoration paths under failures is compared to the best possible performance on the failed network. We conclude that with careful selection of restoration paths one can obtain restoration strategies that retain nearly optimal performance on the failed network while minimizing disruptions to traffic flows that did not traverse the failed parts of the network.
MPEG Video Encryption Algorithms
Authors: Bharat Bhargava, Changgui Shi, Sheng-Yih Wang
Venue: Multimedia Tools and Applications (2004)

Multimedia data security is important for multimedia commerce. Previous cryptography studies have focused on text data. The encryption algorithms developed to secure text data may not be suitable to multimedia applications because of the large data size and real time constraint. For multimedia applications, light weight encryption algorithms are attractive.We present four fast MPEG video encryption algorithms. These algorithms use a secret key to randomly change the sign bits of Discrete Cosine Transform (DCT) coefficients and/or the sign bits of motion vectors. The encryption is accomplished by the inverse DCT (IDCT) during the MPEG video decompression processing. These algorithms add a small overhead to MPEG codec. Software implementations are fast enough to meet the real time requirement of MPEG video applications. The experimental results show that these algorithms achieve satisfactory results. They can be used to secure video-on-demand, video conferencing, and video email applications.
Regularities and their relations to error bounds
Authors: Kung Fu Ng, Wei Hong Yang
Venue: Mathematical Programming: Series A and B (2004)

In this paper, we mainly study various notions of regularity for a finite collection {C1,&#x22ef;,Cm} of closed convex subsets of a Banach space X and their relations with other fundamental concepts. We show that a proper lower semicontinuous function f on X has a Lipschitz error bound (resp., &#x03d2;-error bound) if and only if the pair {epi(f),X&#x00d7;{0}} of sets in the product space X&#x00d7;&#x211d; is linearly regular (resp., regular). Similar results for multifunctions are also established. Next, we prove that {C1,&#x22ef;,Cm} is linearly regular if and only if it has the strong CHIP and the collection {NC1(z),&#x22ef;,NCm(z)} of normal cones at z has property (G) for each z&#x2208;C:=&#x2229;i=1mCi. Provided that C1 is a closed convex cone and that C2=Y is a closed vector subspace of X, we show that {C1,Y} is linearly regular if and only if there exists &#x03b1;>0 such that each positive (relative to the order induced by C1) linear functional on Y of norm one can be extended to a positive linear functional on X with norm bounded by &#x03b1;. Similar characterization is given in terms of normal cones.
Amplification of Ultrawideband Signals
Authors: Won Namgoong, Jongrit Lerdworatawee
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

One of the main implementation challenges in the ultrawide-band(UWB) radio is the design of efficient amplifiers. The difficultyin amplifying an UWB signal stems from its bandwidth beinga large fraction of the amplifier gain-bandwidth product. This paperdescribes a methodology and the tradeoffs associated with thedesign of UWB amplifiers. The amplifiers are designed to minimizea new performance metric, which we refer to as the effectivenoise figure (NF). The effective NF measures the degradationcaused by the amplifier in the achievable receiver performance afterthe digital decoding process, which is ultimately the most relevantmeasure of performance.
Preliminary experiences with a tablet PC based system to support active learning in computer science courses
Authors: Beth Simon, Ruth Anderson, Crystal Hoyer, Jonathan Su
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

There has been much research on the benefits of active and collaborative learning and on its use in computer science courses. As classroom technology becomes more prevalent it is natural to develop systems that support the use of these techniques. We have developed such a system as an extension to Classroom Presenter [2], a Tablet PC-based presentation system. In our system students (or groups of students) are equipped with tablet computers and at various points during the lecture, are asked to solve a problem or respond to a question. Students respond by writing their solution on the tablet and submitting it wirelessly to the instructor. The instructor can view all student responses, select one or more to display to the class, and annotate responses with ink as they are being displayed. Student responses can be saved for review after lecture by the instructor or made available electronically to the students. In this paper we describe the system and our initial experiences using the system in two classes (CS1 and Computer Ethics) at the University of San Diego in Fall 2003.
A Speculative Multithreading with Selective Multi-Path Execution
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

Recent microprocessors' performance has been improved by their high-speed clock frequency and by their exploiting instruction-level parallelism (ILP). Physical limitations of clock speed and semantical limitations of control dependencies impede the improvement of performance. To overcome this difficulty, it is indispensable to make use of the thread-level parallelism. This paper proposes a speculative thread execution model that aims at a speed-up of sequential program execution by selective multi-path thread execution. 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
Fast, Accurate Static Analysis for Fixed-Point Finite-Precision Effects in DSP Designs
Authors: Claire F. Fang, Rob A. Rutenbar, Tsuhan Chen
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Translating digital signal processing (DSP) software intoits finite-precision hardware implementation is often a time-consumingtask. We describe a new static analysis techniquethat can accurately analyze finite-precision effects arisingfrom fixed-point implementations of DSP algorithms.The technique is based on recent interval representation methodsfrom affine arithmetic, and the use of new probabilisticbounds. The resulting numerical error estimates are comparableto detailed statistical simulation, but achieve speedupsof four to five orders of magnitude by avoiding actual bit-truesimulation. We show error analysis results on both feedforward and feedback DSP kernels.
Region-based image retrieval using integrated color, shape, and location index
Authors: B. G. Prasad, K. K. Biswas, S. K. Gupta
Venue: Computer Vision and Image Understanding (2004)

A technique to retrieve images by region matching using a combined feature index based on color, shape, and location is presented within the framework of MPEG-7. Dominant regions within each image are indexed using integrated color, shape, and location features. Various combinations of regions are also indexed. The resulting indices and related metadata are stored in a Hash structure, where similar images tend to form clusters. The retrieval process is non-cascading and images can be retrieved based on color, shape or location and also based on a combined color shape location index. Results obtained show that retrieval effectiveness increases in non-cascaded region-based querying by combined index.
Modelling of laser-material interaction using semi-analytical approach
Authors: Radovan Gospavic, Milesa Sreckovic, Viktor Popov
Venue: Mathematics and Computers in Simulation (2004)

In this paper different aspects of laser-material interaction were considered. Semi-analytical method was developed and applied to analysis of spatial and temporal distribution of temperature field inside bulk materials. In particular, cases with cylindrical geometry, finite diameter and infinite length as well as cylindrical geometry, finite diameter and finite length were considered. For solving the governing partial differential equations (PDEs) the Laplace transform and the Fourier method of variables separation were used. In this way instead of the original governing PDEs, ordinary differential equations were solved. Particular solutions of the ordinary differential equations were used for evaluating the general solution, which was expressed in terms of series of particular solutions. The unknown coefficients in the series of particular solutions were determined using the boundary and initial conditions. The laser-material interaction was represented using the thermal model. These interactions for the cases of the high power laser in pulse and continuous regime were analysed. The incident intensity of laser radiation was under critical intensity.Using these methods the temperature field distribution was obtained in the Laplace transform domain. The convolution integral and the Green function were used to determine the temperature field in time domain. General semi-analytical methods and numerical solutions of appropriate transcendent equations were considered and numerical results for Al specimens were presented. The influences of laser beam parameters to the temperature field distribution and isothermal curves inside the bulk material were evaluated.
Optimal deployment of construction equipment using linear programming with fuzzy coefficients
Authors: K. Eshwar, Vellanki S. S. Kumar
Venue: Advances in Engineering Software (2004)

Decisions made by the experts in the construction industry, are usually approximate and contain some sort of imprecision. Classical linear programming (LP) model optimize the decision making situation in a crisp environment. It is difficult to get an optimum decision with imprecise information of the project environment using LP. In the construction industry, identifying optimum number of construction pieces of equipment require experts' knowledge. When certain degree of flexibility needs to be incorporated in the given model to get more realistic results, fuzzy LP is used. But when the parameters on constraints and objective function are in a state of ambiguity then the extension principle is best suited, which is based on personal opinions and subjective judgments. The objective of this paper is to identify the optimum number of pieces of equipment required to complete the project in the targeted period with fuzzy data. A realistic case study has been considered for optimization and LINGO6 has been used to solve the various non-linear equations.
Computational Construction of Nitrogen Assimilation Pathway in Cyanobacteria Synechococcus sp. WH8102
Authors: Z. Su, P. Dam, X. Chen, V. Olman, T. Jiang, Y. Xu
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

One of the challenging problems in post-genomic era is to computationally infer the regulatory pathways of a less-studied organism. We have previously developed a computational protocol for inference of regulatory and signaling pathways in less-studied microbes, through mining high-throughput biological data of various types. Using a similar protocol we have constructed the nitrogen assimilation pathway in cyanobacteria Synechoccocus sp. WH8102. A considerable amount of high confident knowledge of this pathway were derived.
An On-line Evaluation System for Optical See-through Augmented Reality
Authors: Nassir Navab, Siavash Zokai, Yakup Genc, Enylton Machado Coelho
Venue: Proceedings of the IEEE Virtual Reality 2004 (2004)

This work introduces a technique that allows final usersto evaluate and re-calibrate their AR system as frequently asneeded. We developed an interactive game as a prototypefor such evaluation system and explain how this techniquecan be implemented to be used in real life.
The Effects of Predicated Execution on Architectures Supporting Dynamic Speculation
Venue: Proceedings of the 1998 International Workshop on Innovative Architecture (1998)

Achieving a good instruction level parallelism (ILP) from a program. Modern microprocessors have attempted to alleviate this problem with the support of sophisticated branch prediction schemes. Dynamic speculation, as a hardware feature, is used to execute instructions out-of-order (OOO) guided by the outcomes of such prediction schemes. Previous branch outcomes are used to speculate an instruction before the branch is fully resolved. Studies have shown that inspite of such complex prediction schemes, there still exist many frequently executed branches which are hard to predict. Predicated execution has been proposed as an alternative technique by researchers to eliminate some of these hard to predict branches. Previous studies have analyzed the effects of applying predicated execution with branch prediction. In this paper, we study the effects of predicated execution on architectures supporting dynamic speculation. Branch classification, as a technique, is used to group branches with similar dynamic execution frequencies. The effects of different predication models on dynamic speculation are then studied for each of these branch classes. An in-depth analysis of useful and useless instructions as a result of applying these different models is also summarized. 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
Multi-log Processor - Towards Scalable Event-Driven Multiprocessors
Authors: Vinod Viswanath
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

We present the Multi-log Processors, an event-driven multiprocessor. The functionality of the processor is defined by the triggering of events, maintained in a single event queue. The key feature of Multi-log is that the entire register file and the event queue are shared.We describe the network architecture of the Multi-log and discuss optimum layout schemes. This article describes two scalable event-driven multiprocessor architectures, the Multi-log I and the Multi-log II, and compares their VLSI complexities (gate delays, wire-length delays, and area).Both multiprocessors are implemented by a large collection of ALUs with controllers and on chip speculative L0 caches (together called log¿s) connected together by a network of parallel-prefix tree circuits.A fat-tree network connects an interleaved memory to the log¿s.These networks provide superscalar uniprocessor-like functionality, including register renaming, out-of-order event execution, and speculative event execution. Given 1 billion transistors on a single chip, the Multi-log I architecture would have 256 log¿s on chip, while the Multi-log II architecture would allow for 1024 log¿s on chip. We propose a new strategy to handle non-local events by introducing a mechanism to allow event transfers over the just described network, by means of event stealing.We also propose an instruction set architecture for the Multi-logprocessor and give a programming model for event-driven applications.Scheduling events and stealing events are implemented in software.We suggest some innovative schemes for their implementation and analysis.
GeneTide: Terra Incognita Discovery Endeavor Mining ESTs and Expression Data to Elucidate Known and De-Novo GeneCards Genes
Authors: Maxim Shklar, Orit Shmueli, Liora Strichman-Almashanu, Michael Shmoish, Doron Lancet, Marilyn Safran
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The construction of a complete EST-based gene index is an intricate task yet to be accomplished. GeneTide [1], the Gene Terra Incognita Discovery Endeavor (http://genecards.weizmann.ac.il/genetide/), which is the newest addition to the GeneCards [2] [3] suite of databases, comprehensively maps > 4.5 of the ~5.5 million human ESTs currently available at dbEST with either known or newly defined putative human genes. The association is accomplished via data mining genomic resources, and integrating using a unified scoring scheme. Groups of unassociated transcripts serve as a basis for defining EST-based Gene Candidates (EGCs). These EGCs are annotated with various parameters, including expression data, to determine their validity as possible de-novo genes. An immediate application of GeneTide to microarray annotation has increased, in a specific example, the number of annotated Affymetrix HGU95A-E probe sets by 50% in comparison to previous attempts.
Automatic image annotation by using concept-sensitive salient objects for image content representation
Authors: Jianping Fan, Yuli Gao, Hangzai Luo, Guangyou Xu
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Multi-level annotation of images is a promising solution to enable more effective semantic image retrieval by using various keywords at different semantic levels. In this paper, we propose a multi-level approach to annotate the semantics of natural scenes by using both the dominant image components and the relevant semantic concepts. In contrast to the well-known image-based and region-based approaches, we use the salient objects as the dominant image components to achieve automatic image annotation at the content level. By using the salient objects for image content representation, a novel image classification technique is developed to achieve automatic image annotation at the concept level. To detect the salient objects automatically, a set of detection functions are learned from the labeled image regions by using Support Vector Machine (SVM) classifiers with an automatic scheme for searching the optimal model parameters. To generate the semantic concepts, finite mixture models are used to approximate the class distributions of the relevant salient objects. An adaptive EM algorithm has been proposed to determine the optimal model structure and model parameters simultaneously. We have also demonstrated that our algorithms are very effective to enable multi-level annotation of natural scenes in a large-scale dataset.
Mazur Sets in Normed Spaces
Authors: A. S. Granero, J. P. Moreno, R. R. Phelps
Venue: Discrete Computational Geometry (2004)

In this paper we investigate different questions concerning Mazur sets in normed spaces, which point out the close connections between geometric functional analysis and discrete geometry. Motivated by a result of Chen and Lin, we study the relationship between Mazur disks and weak denting points of the dual unit ball. We prove that the only Mazur sets of the spaces l1n are points and closed balls. Finally, a new stability property for the family of all sets which are intersections of closed balls is found.
Policies and Practice of E-Government Construction in China
Authors: Zhiguang Shan, Xinyou Li, Zhongming Wang, Jiajun Ning
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

E-government construction is the most important content of the national economy and society informatization in China today. It is a basic national policy to promote China informatization by means of e-government. This paper firstly introduces the development process, current states, and development strategies of e-government in China. Furthermore, the two national key e-government projects that are currently undertaking by the State Information Center, the Golden Macro-economy project and China Govnet project, are described.
SoundCompass: a practical query-by-humming system; normalization of scalable and shiftable time-series data and effective subsequence generation
Authors: Naoko Kosugi, Yasushi Sakurai, Masashi Morimoto
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

This paper describes our practical query-by-humming system, SoundCompass, which is being used as a karaoke song selection system in Japan. First, we describe the fundamental techniques employed by SoundCompass such as normalization in a time-wise sense of music data, time-scalable and tone-shiftable time-series data, and making subsequences for efficient matching. Second, we describe techniques to make effective feature vectors based on real music data and do matching with them to develop accurate query-by-humming. Third, we share valuable knowledge that has been obtained through month's of practical use of Sound Compass. Fourth, we describe the latest version of the SoundCompass system that incorporates these new techniques and knowledge, as well as describe quantitative evaluations that prove the practicality of SoundCompass. The new system provides flexible and accurate similarity retrieval based on k-nearest neighbor searches with multi-dimensional spatial indices structured with multi-dimensional features vectors.
Management of Nested Collections of Resources in Spatial Data Infrastructures
Authors: J. Nogueras-Iso, F. J. Zarazaga-Soria, P. R. Muro-Medrano
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The management of collections of resources is an important issue in Digital Libraries. The modelling of collections provides added-value because they facilitate the organization of resources and special services may be tailored to the characteristics of the collection. This paper will provide a metadata solution to manage nested collections in digital library catalogs, which is based on XML technologies and concepts derived from knowledge bases. The management of collections is particularly relevant in the context of Geolibraries and Spatial Data Infrastructures. Given the high volumes of geographic information, it is very frequent to find collections that arise as a result of the fragmentation of geographic resources into datasets of manageable size and similar scale. However, the concepts presented here are extensible to any type of Digital Library collections.