ppxscal/embedding_network huggingface dataset:
QoS Management specification support for multimedia middleware
Authors: Hector A. Duran-Limon, Gordon S. Blair
Venue: Journal of Systems and Software (2004)

Middleware technologies are now widely used in order to provide support for the interaction of systems relying on different hardware and operating systems. At present middleware platforms, however, do not provide enough support for both the configuration and reconfiguration of quality of service (QoS) management aspects of real-time applications such as distributed multimedia systems. That is, current middleware only provides support for the low-level specification of QoS properties. This paper presents an architecture description language (ADL) called Xelha For the high-level specification of QoS management in multimedia middleware whereas lower-level aspects can be tuned by using an aspect-oriented suite of languages referred to as resource configuration description language (RCDL). Tool support is also provided for the interpretation of the Xelha and RCDL languages.
The Parallel Communication Protocol in BCL-4
Authors: Xiaocheng Zhou, Zhigang Huo, Jie Ma, Dan Meng
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

As CLUMPS become the main stream of clusters and the number of nodes in a cluster increases, it requires enhancing the bandwidth performance and availability of the communication system used in clusters. Parallel communication based on multiple system area networks (SANs) can fulfill the requirements. This paper introduces the parallel communication protocol used in BCL-4, which is a high efficient communication system used in DAWNING-4000A, a large-scale LINUX cluster. It dispatches small messages and sub-messages stripped from large messages into multiple SANs and maintains the communication semantics as before. The parallel communication process is transparent to both users and the control program on network interface card (NIC). It also provides an efficient load balance mechanism. Using the parallel communication protocol, BCL-4 provides many key features, such as multiple throughput, high availability, and backward compatibility. The experimental results show that the peak bandwidth of BCL-4 over two Myrinet is 494.7MB/s, which is almost twice of that over one, and that there is only 0.02us overhead of short message at the same time.
Restructuring computations for temporal data cache locality
Authors: Venkata K. Pingali, Sally A. McKee, Wilson C. Hsieh, John B. Carter
Venue: International Journal of Parallel Programming (2003)

Data access costs contribute significantly to the execution time of applications with complex data structures. A the latency of memory accesses becomes high relative to processor cycle times, application performance is increasingly limited by memory performance. In some situations it is useful to trade increased computation costs for reduced memory costs. The contributions of this paper are three-fold: we provide a detailed analysis of the memory performance of seven memory-intensive benchmarks; we describe Computation Regrouping, a source-level approach to improving the performance of memory-bound applications by increasing temporal locality to eliminate cache and TLB misses; and, we demonstrate significant performance improvement by applying Computation Regrouping to our suite of seven benchmarks. Using Computation Regrouping, we observe a geometric mean speedup of 1.90, with individual speedups ranging from 1.26 to 3.03. Most of this improvement comes from eliminating memory tall time.
Internet, GRID, Self-Adaptability and Beyond: Are We Ready?
Authors: Petre Dini, Wolfgang Gentzsch, Mark Potts, Alexander Clemm, Mazin Yousif, Andreas Polze
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper reflects different understanding and positions on future trends of GRID-oriented technologies, applications, and networks, as perceived by representatives from industry and academia. There is no definitive answer on the topic that is raised in the title. Instead, the question serves as a starting point for a discussion of methodologies to apply, of engineering requirements to consider, of technical challenges to resolve harnessing this next stage of evolution of the Internet. The panel guests present their perception on these issues. Is GRID the Internet-ng? What do GRID and self-adaptable applications have in common? Does GRID facilitate the adaptability of applications? Where would the Internet, as it exists today, fall short? Will Web Services come to the rescue? Are there new paradigms associated with heavily shared resources (infrastructure, protocols, services, user communities)? Which major bumps are ahead the roads for self-adaptability over GRID, how can they be crossed, at what cost, and what new paradigms are associated along this road? These are all open questions with no definitive conclusion, discussed from the point of view of what constitutes the state of the art today. Responses are intended to stimulate thought and foster discussion, rather than being a comprehensive treatise of the subject.
An Interview with Nicholas G. Carr: Do you really need that next upgrade?
Authors: Ubiquity staff
Venue: Ubiquity (2004)

Nicholas G. Carr talks about capitalizing on the commoditization trend by spending less on technology but getting better, more reliable systems. His suggestion that CEOs step away from the cutting edge has defenders and detractors in the IT community.
Measuring normality in HTTP traffic for anomaly-based intrusion detection
Authors: Juan M. Estévez-Tapiador, Pedro García-Teodoro, Jesús E. Díaz-Verdejo
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2004)

In this paper, the problem of measuring normality in HTTP traffic for the purpose of anomaly-based network intrusion detection is addressed. The work carried out is expressed in two steps: first, some statistical analysis of both normal and hostile traffic is presented. The experimental results of this study reveal that certain features extracted from HTTP requests can be used to distinguish anomalous (and, therefore, suspicious) traffic from that corresponding to correct, normal connections. The second part of the paper presents a new anomaly-based approach to detect attacks carried out over HTTP traffic. The technique introduced is statistical and makes use of Markov chains to model HTTP network traffic. The incoming HTTP traffic is parameterised for evaluation on a packet payload basis. Thus, the payload of each HTTP request is segmented into a certain number of contiguous blocks, which are subsequently quantized according to a previously trained scalar codebook. Finally, the temporal sequence of the symbols obtained is evaluated by means of a Markov model derived during a training phase. The detection results provided by our approach show important improvements, both in detection ratio and regarding false alarms, in comparison with those obtained using other current techniques.
Cluster prefetch: tolerating on-chip wire delays in clustered microarchitectures
Authors: Rajeev Balasubramonian
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

The growing dominance of wire delays at future technology points renders a microprocessor communication-bound. Clustered microarchitectures allow most dependence chains to execute without being affected by long on-chip wire latencies. They also allow faster clock speeds and reduce design complexity, thereby emerging as a popular design choice for future microprocessors. However, a centralized data cache threatens to be the primary bottle-neck in highly clustered systems. The paper attempts to identify the most complexity-effective approach to alleviate this bottleneck. While decentralized cache organizations have been proposed, they introduce excessive logic and wiring complexity. The paper evaluates if the performance gains of a decentralized cache are worth the increase in complexity. We also introduce and evaluate the behavior of Cluster Prefetch - the forwarding of data values to a cluster through accurate address prediction. Our results show that the success of this technique depends on accurate speculation across unresolved stores. The technique applies for a wide class of processor models and most importantly, it allows high performance even while employing a simple centralized data cache. We conclude that address prediction holds more promise for future wire-delay-limited processors than decentralized cache organizations.
Ordered theta graphs
Authors: Prosenjit Bose, Joachim Gudmundsson, Pat Morin
Venue: Computational Geometry: Theory and Applications (2004)

Let V be a set of n points in R2. The θ-graph of V is a geometric graph with vertex set V that has been studied extensively and which has several nice properties. We introduce a new variant of θ-graphs which we call ordered θ-graphs. These are graphs that are built incrementally by inserting the vertices one by one so that the resulting graph depends on the insertion order. We show that careful insertion orders can produce graphs with desirable properties including low spanning ratio, logarithmic maximum degree and logarithmic diameter.
On Compacting Test Response Data Containing Unknown Values
Authors: Chen Wang, Sudhakar M. Reddy, Irith Pomeranz, Janusz Rajski, Jerzy Tyszer
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

The design of a test response compactor called a Block Compactoris given. Block Compactors belong to a new class of compactorscalled Finite Memory Compactors. Different from spacecompactors, finite memory compactors contain memory elements.Also unlike time compactors, finite memory compactors havefinite impulse response. These properties give finite memorycompactors the ability to achieve higher compaction ratios thanspace compactors and still be able to tolerate unknown values intest responses. The proposed Block Compactors, as an instance offinite memory compactors generate a signature of response data inseveral scan cycles. Results presented on several industrial designsshow that Block Compactors provide better test quality and higherdata compaction than earlier works on test response compactors.
Applying Personalized Annotation Mechanism to E-Documentation
Authors: Stephen J. H. Yang, Vincent M. Z. Du, Norman W. Y. Shao, Irene Chen
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

In this paper, we describe the design and implementation of Personalized Annotation Mechanism that enable people to manage, share and reuse their annotation in an efficient way. We develop an anchoring method which associated annotation to E-document in a precisely position. It also provides an adaptive annotation service for different service. The proposed system provides an interactive mechanism for discussion about shared annotations among multiple users.
Contouring Medial Surface of Thin Plate Structure Using Local Marching Cubes
Venue: Proceedings of the Shape Modeling International 2004 (2004)

This paper describes a new algorithm for contouringmedial surface from CT (Computed Tomography) dataa thin plate structure. Thin plate structures are commonmechanical structures such as car body shells. When designingthe thin plate structures in CAD (Computer AidedDesign) and CAE (Computer Aided Engineering) systems,their shapes are usually represented as surface models associatedwith their thickness values. In this research we areaiming at extracting medial surface models of a thin platestructure from its CT data so as to be used in CAD andCAE systems. However, in such CT data, each voxel in regionaround the medial surface can not be classified insideor outside, so we can not easily apply iso-surfacing methodto contour the medial surface.From the above motives, we first extract medial cells(cubes comprising eight neighboring voxels) from the CTdata using a skeletonization method so as to apply MarchingCubes algorithm to extract the medial surface. It is not,however, guaranteed that the Marching Cubes algorithmcan contour those medial cells (in short, not "MarchingCubeable"). We developed cell operations which correcttopological connectivity so as to guarantee such MarchingCubeability. We then apply our method to assign virtualsigns to the voxels to apply the Marching Cubes algorithm.And last, we map thicknesses of thin plate structureto the triangle meshes as textures. A prototype system is developedto show some experimental results.
Voluntariness of Permissions Required for Security Measures
Authors: Michael Sonntag
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Employing security measures is a common practice for companies. However, some security measures intrude upon personal rights of employees, e.g. privacy, their personal life, or dignity. In these cases their consent is required. But usually there exists quite an imbalance of power and information between both parties. As fundamental rights in certain cases even protect someone from him/herself, not everywhere giving consent is possible. This article discusses different forms of protections in Austria and a common feature, means, properties and their relation, in more detail. As example, filtering personal E-Mail of employees and Intrusion Detection Systems are discussed briefly.
Embedding universal delay-insensitive circuits in asynchronous cellular spaces
Authors: Jia Lee, Susumu Adachi, Ferdinand Peper, Kenichi Morita
Venue: Fundamenta Informaticae (2003)

Asynchronous Cellular Automata (ACA) are cellular automata which allow cells to be updated at times that are random and independent of each other. Due to their unpredictable behavior, ACA are usually dealt with by simulating a timing mechanism that forces all cells into synchronicity. Though this allows the use of well-established synchronous methods to conduct computations, it comes at the price of an increased number of cell states. This paper presents a more effective approach based on a 5-state ACA with von Neumann neighborhood that uses rotation- and reflection-symmetric transition rules to describe the interactions between cells. We achieve efficient computation on this model by embedding so-called Delay-Insensitive circuits in it, a type of asynchronous circuits in which signals may be subject to arbitrary delays, without this being an obstacle to correct operation. Our constructions not only imply the computational universality of the proposed cellular automaton, but also allow the efficient use of its massive parallelism, in the sense that the circuits operate in parallel and there are no signals running around indefinitely in the circuits in the absence of input.
Paper material considerations for system printers
Authors: J. Borch, R. G. Svendsen
Venue: IBM Journal of Research and Development (1984)

Laser printing of continuous forms by means of electrophotographic imaging requires that the paper on which the printing is carried out show good handling characteristics at fast machine speeds and be compatible with toner transfer and fixing. Toner transfer requires suitable electrical paper characteristics, similar to those of xerographic cut sheets intended for use in electrophotographic cut-sheet copiers and printers. Hot-pressure fusing in the IBM 3800 printing subsystem has been shown to require adequate paper-fiber wettability by the hot molten toner. Therefore, characteristics of paper chemistry, and in particular paper sizing, are essential in creating good image fixing (fusing). In addition, the temperature and pressure in the fusing assembly affect the thermal and dimensional stability of the paper. For the 3800, this necessitated modifications in roll design within the fusing station in order to ensure satisfactory paper handling.
Crumpled Cube and Solid Horned Sphere Space Fillers
Authors: Tai-Man Tang
Venue: Discrete Computational Geometry (2004)

We construct two classes of wildly embedded space fillers of R3. First, every crumpled cube is shown to have an embedding in R3 that admits a monohedral tiling of R3. Second, a solid Alexander horned sphere with a topologically trivial interior is shown to admit a monohedral tiling of a cube and hence R3. By joining a solid horned sphere with compact polyhedral 3-submanifolds of R3 with one boundary component, we construct space fillers homeomorphic to the polyhedral submanifolds but of different embedding types. Using the suitably embedded crumpled cubes instead of a solid horned sphere, space fillers of even more different topological types can be produced. 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
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
Authors: Uriel Feige
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We prove the following inequality: for every positive integer n and every collection X1,..., Xn of nonnegative independent random variables that each has expectation 1, the probability that their sum remains below n+1 is at least α > 0. Our proof produces a value of α = 1/13 ≅ 0.077, but we conjecture that the inequality also holds with α = 1/e ≅ 0.368.As an example for the use of the new inequality, we consider the problem of estimating the average degree of a graph by querying the degrees of some of its vertices. We show the following threshold behavior: approximation factors above 2 require far less queries than approximation factors below 2. The new inequality is used in order to get tight (up to multiplicative constant factors) relations between the number of queries and the quality of the approximation. We show how the degree approximation algorithm can be used in order to quickly find those edges in a network that belong to many shortest paths.
Incremental maintenance of XML structural indexes
Authors: Ke Yi, Hao He, Ioana Stanoi, Jun Yang
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many structural indexes have been proposed. The most popular ones are the 1-index, based on the notion of graph bisimilarity, and the recently proposed A(k)-index, based on the notion of local similarity to provide a trade-off between index size and query answering power. For these indexes to be practical, we need effective and efficient incremental maintenance algorithms to keep them consistent with the underlying data. However, existing update algorithms for structural indexes essentially provide no guarantees on the quality of the index; the updated index is usually larger size than necessary, degrading the performance for subsequent queries.In this paper, we propose update algorithms for the 1-index and the A(k)-index with provable guarantees on the resulting index quality. Our algorithms always maintain a minimal index, i.e., merging any two index nodes would result in an incorrect index. For the 1-index, if the data graph is acyclic, our algorithm further ensures that the index is minimum, i.e., it has the least number of index nodes possible. For the A(k)-index, we show that the minimal index our algorithm maintains is also the unique minimum A(k)-index, for both acyclic and cyclic data graphs. Finally, through experimental evaluation, we demonstrate that our algorithms bring significant improvement over previous methods, in terms of both index size and update time.
Quantum Arthur-Merlin Games
Authors: Chris Marriott, John Watrous
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

This paper studies quantum Arthur-Merlin games, whichare a restricted form of quantum interactive proof system inwhich the verifierýs messages are given by unbiased coin-flips. The following results are proved.For one-message quantum Arthur-Merlin games, whichcorrespond to the complexity class QMA, completenessand soundness errors can be reduced exponentiallywithout increasing the length of Merlinýs message. Previousconstructions for reducing error required a polynomialincrease in the length of Merlinýs message. Applicationsof this fact include a proof that logarithmiclength quantum certificates yield no increase in powerover BQP and a simple proof that QMA ¿ PP.In the case of three or more messages, quantum Arthur-Merlin games are equivalent in power to ordinary quantuminteractive proof systems. In fact, for any languagehaving a quantum interactive proof system there existsa three-message quantum Arthur-Merlin game in whichArthurýs only message consists of just a single coin-flipthat achieves perfect completeness and soundness errorexponentially close to 1/2.Any language having a two-message quantum Arthur-Merlin game is contained in BP \cdotPP. This gives somesuggestion that three messages are stronger than two inthe quantum Arthur-Merlin setting.
Competitive on-line scheduling with level of service
Authors: Ee-Chien Chang, Chee Yap
Venue: Journal of Scheduling (2003)

Motivated by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus, our problem embodies a notion of "Level of Service" that is increasingly important in multimedia applications. We give two schedulers FirstFit and EndFit based on two simple heuristics, and generalize them into a class of greedy schedulers. We show that both FirstFit and EndFit are 2-competitive, and any greedy scheduler is 3-competitive. These bounds are shown to be tight.
On the k-power free number sequence
Authors: Zhang Tianping
Venue: Smarandache Notions Journal (2004)

The main purpose of this paper is to study the distribution properties of k-power free numbers, and give an interesting asymptotic formula.
Application of Virtual Showcase Technologies in Real Scenarios: The Case of San Telmo Museum
Authors: I. Macia, A. Susperregui, E. Carrasco, M. T. Linaza, L. Mihalic, A. Stork
Venue: Proceedings of the Computer Graphics International (2004)

Intuitive access to information in real environmentsis a challenge for Information Society Technologies.Having this in mind, a new device for Mixed Realityapplications called Virtual Showcase has beendeveloped. It has been conceived to be used inmuseums and exhibitions, due to its compatibility withtraditional museum showcases, offering additionalinformation to the public by means of a simple, directand intuitive interface. This paper presents the realimplementation of a Virtual Showcase passive-stereoprototype exhibited in a museum for three months.Some preliminary results concerning the evaluationprocess have also been included. Although thetechnology seems to be promising, implementationaspects such as size should be improved.
Image Restoration with High Resolution Adaptive Optical Imaging System
Authors: Shuyu Yang, Gavin Erry, Sheila Nemeth, Sunanda Mitra, Peter Soliz
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The challenge in producing a clear retinal image lies in the design of the imaging system thatcan reduce the strong aberrations of the human eye and the photographer's expertise inadjusting the fundus camera when the image is taken. A technique that combines an advanced adaptive optical system and image post-processing algorithm has been shown to be able to significantly improve the image quality up to 2-5 times higher resolution than currently used clinical devices [Deconvolution of Color Retinal Images with Wavefront Sensing]. The optical system has been designed to suppress low-order aberrations and enhance the precision of the wavefront measurement. Image post-processing mainly involves deconvolution by calculating the system transfer function (here the optical transfer function (OTF)) from the data obtained by the Shack-Hartman wavefront sensor.