ppxscal/embedding_network huggingface dataset:
Supporting Consistency Management in Dynamic Content Distribution Overlays
Authors: Zhou Su, Jiro Katto, Yasuhiko Yasuda
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Content Distribution Overlays improves end-user performance by replicating Web contents on a group of geographically distributed sites interconnected over the Internet. However, with the development whereby overlay systems can manage dynamically changing files, an important issue to be resolved is consistency management, which means the cached replicas on different sites must be updated if the originals change. In this paper, based on the analytical formulation of object freshness time, web access distribution and network topology, we derive a novel algorithm as follows: (1) For a given content which has been changed at its original server, only a limited number of its replicas instead of all replicas are updated. (2) After a replica has been selected for update, the latest version will be sent from an algorithm-decided site instead of from its original server. Simulation results verify that the proposed algorithm provides much better consistency management than conventional methods with the reduced update overhead and network traffic.
Long Round-Trip Time Support with Shared-Memory Crosspoint Buffered Packet Switch
Authors: Ziqian Dong, Roberto Rojas-Cessa
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

The amount of memory in buffered crossbars in combined input-crosspoint buffered switches is proportional to the number of crosspoints, or O(N²), where N is the number of ports, and to the crosspoint buffer size, which is defined by the distance between the line cards and the buffered crossbar, to achieve 100% throughput under port-rate data flows. A long distance between these two components can make a buffered crossbar costly to implement. In this paper, we propose and examine two shared-memory crosspoint buffered packet switches that use small crosspoint buffers to support a long round-trip time, which is mainly affected by the transmission delay caused by the distance between line cards and the buffered crossbar. The proposed switch reduces the required buffer memory of the buffered crossbar by 50% or more. We show that a shared-memory crosspoint buffer switch can provide high this improvement without speedup.
Reliable Recording and Analysis of Multimedia Collaboration Sessions over Wireless Networks
Authors: Lambros Lambrinos
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The increasing popularity of multi-way multimedia collaboration sessions over wired networks is now spreading into the wireless domain. Due to this, the inherent need to record some sessions and make them available for later replay poses some new interesting challenges. This paper presents an analysis of the recording requirements and issues arising when participants "based" on a wireless network are also present in a session. An architecture for supporting reliable recording of Voice-Over-IP sessions is described; an inherent part is an agent on the sender host that assists in the recording process. Reliability is facilitated through a flexible and adaptive data repair protocol. Once a recording is complete, it can be used to analyse the session and assist in locating any network and reception problems that may have degraded the quality of the conversation. Moreover, playing back the recorded session will potentially provide better quality than what the participants observed if there was packet loss during the conversation.
On the usefulness of deterministic grammars for simulation languages
Authors: Antonio P. Bongulielmi, Francois E. Cellier
Venue: ACM SIGSIM Simulation Digest (1984)

The aim of this paper is to give some indications on how future simulation languages should be structured to guarantee a high degree of software robustness. For this purpose, we concentrated on the particular aspect of classifying languages into several groups out of which we recommend the group of the LL(1) languages for the construction of simulation software.A general purpose parser program is presented which allows to check whether a particular language definition falls into the class of the LL(1) languages, and which can be considered as a very powerful tool for the development of new languages. This parser program has already been used during the design phase of the new simulation language COSY for COmbined (continuous and discrete) SYstem simulation.In a final chapter we present another program which may be used to generate syntax diagrams out of an EBNF description of a grammar on any plotting device.
Making the trains run on time
Authors: Alexander T. Garthwaite
Venue:  (2005)

Automatic memory management techniques aid the development of more robust and maintainable applications. However, these garbage collection services can be disruptive suspending an application for extended periods of time while the heap is traversed and unreachable memory is reclaimed. While many applications do not have hard, real-time requirements, they do require a certain level of responsiveness. To be practical, memory management services must scale with the available system resources and scale with the manner in which the application allocates and uses memory. One promising collection technique for reducing the lengths of these pauses is Train algorithm. This space-incremental copying technique allows a large memory space to be collected incrementally by dividing the heap into blocks and collecting subsets of these blocks in a particular order. By considering only a small portion of the heap at a time, the technique can collect only as much memory as is needed to keep up with the needs of the application. However, garbage collectors based on the Train algorithm have failed to live up to this promise. In addition to introducing significant overheads&mdash;for example, in the tracking of references between parts of the heap&mdash;the collectors have not moderated pauses or do not keep up with rate at which the application allocates memory. This dissertation demonstrates that the Train algorithm can form the basis of scalable, nondisruptive garbage collectors even for large heaps. We begin with a simple incremental collector to understand the basic mechanisms and costs of the algorithm. From this starting point, we show how the efficiency of the collector may be improved through better processing of roots during collection, more general detection of dead sequences of blocks of memory, more efficient remembered-sets and dynamic detection and isolation of popular objects, and better placement of objects in the generation. Finally, we show how a collector based on the Train algorithm can bound the amount of work performed in each increment.
The cross entropy method for classification
Authors: Shie Mannor, Dori Peleg, Reuven Rubinstein
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term instead of the L1 or L2 norms. In order to solve the optimization problem we use the cross entropy method to search over the possible sets of support vectors. The algorithm consists of solving a sequence of efficient linear programs. We report experiments where our method produces generalization errors that are similar to support vector machines, while using a considerably smaller number of support vectors.
Admission Control with Load Balancing in IEEE 802.11-Based ESS Mesh Networks
Authors: Dongmei Zhao, Jun Zou, Terence D. Todd
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

In this paper we study admission control in IEEE 802.11- based ESS mesh networks. An analytical model is developed for studying the mesh network capacity. Based on this, a distributed connection admission control (CAC) scheme is proposed, which incorporates load balancing in selecting a mesh path for a new connection. Our results show that connection level performance, including both average number of connections in the network and connection blocking probability, can be greatly improved using the proposed admission control compared to other admission control schemes.
Why Your Data Won't Mix
Authors: Alon Halevy
Venue: Queue (2005)

When independent parties develop database schemas for the same domain, they will almost always be quite different from each other. These differences are referred to as semantic heterogeneity, which also appears in the presence of multiple XML documents, Web services, and ontologies—or more broadly, whenever there is more than one way to structure a body of data. The presence of semi-structured data exacerbates semantic heterogeneity, because semi-structured schemas are much more flexible to start with. For multiple data systems to cooperate with each other, they must understand each other’s schemas. Without such understanding, the multitude of data sources amounts to a digital version of the Tower of Babel.
Graphics: from a 100x data expansion to a 100x compression function
Authors: Eng Lim Goh
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

In the mid 1980s, a typical large data visualization, involved the input of geometry in the order of 10,000 triangles, for rendering into about a million display pixels. However, today, we see input data sets growing to a billion triangles, while the generated display has only grown to about 10 million pixels. Consequently, large data visualization have, over the years, changed from a data expansion, to a data compression function.This four orders of magnitude change has evoked renewed interests in ray tracing rendering techniques, of which its performance can be made more input geometry-quantity insensitive. This is as opposed to scanline rendering techniques, such as OpenGL, that can be made more output pixel-quantity insensitive.For those staying with scanline techniques, the enormous growth in geometry count has made it necessary for the development of scalable parallel rendering. This is where tens of Graphics Processing Units (GPUs) are coordinated to render one large geometric data set. After the pixels are produced by each of these GPUs, ways of compositing their individual output into a single display, with feedback loops for dynamic load balancing, may be necessary.As the crossover "from expansion to compression" continues, it will become increasingly practical, in certain remote visualization sessions, to invent ways to transmit only the generated pixels; instead of the traditional method of transmitting the entire geometric data set for pixel generation at the remote user's station. Add to this the advances in display, lighting and input technologies for mobile handheld devices, interesting new applications may evolve for the scientific, engineering and creative users. 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
Design and Implementation of a Content-Aware Switch Using a Network Processor
Authors: Li Zhao, Yan Luo, Laxmi Bhuyan, Ravi Iyer
Venue: Proceedings of the 13th Symposium on High Performance Interconnects (2005)

Cluster based server architectures have been widely used as a solution to overloading in web servers because of their cost effectiveness, scalability and reliability. A content aware switch can be used to examine the web requests and distribute them to the servers based on application level information. In this paper, we present the analysis, design and implementation of such a content aware switch based on an IXP2400 network processor (NP). We first analyze the mechanisms for implementing a content-aware switch and present the necessity for an NP-based solution. We then present various possibilities of workload allocation among different computation resources in an NP and discuss the design tradeoffs. Measurement results based on an IXP 2400 NP demonstrate that our NP-based switch can reduce the http processing latency by an average of 83.3% for a 1K byte web page, compared to a Linux-based switch. The amount of reduction increases with larger file sizes. It is also shown that the packet throughput can be improved by up to 5.7x across a range of files by taking advantage of multithreading and multiprocessing, available in the NP.
Guest Editors' Introduction: Ad Hoc and P2P Security
Authors: Shiuhpyng W. Shieh, Dan S. Wallach
Venue: IEEE Internet Computing (2005)

In this special issue, we present important topics for computer security in ad hoc and P2P areas that lead to future development and deployment of efficient and powerful networks.
Successfully Outsourcing Embedded Software Development
Authors: Joseph W. Rottman
Venue: Computer (2006)

The experience of a large US company that capitalized on its experience to build a global development model shows how both the people involved in offshore projects and the projects themselves must be treated differently from internally developed projects.
An adaptive edge detection based colorization algorithm and its applications
Authors: Yi-Chin Huang, Yi-Shin Tung, Jun-Cheng Chen, Sung-Wen Wang, Ja-Ling Wu
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Colorization is a computer-assisted process for adding colors to grayscale images or movies. It can be viewed as a process for assigning a three-dimensional color vector (YUV or RGB) to each pixel of a grayscale image. In previous works, with some color hints the resultant chrominance value varies linearly with that of the luminance. However, it is easy to find that existing methods may introduce obvious color bleeding, especially, around region boundaries. It then needs extra human-assistance to fix these artifacts, which limits its practicability. Facing such a challenging issue, we introduce a general and fast colorization methodology with the aid of an adaptive edge detection scheme. By extracting reliable edge information, the proposed approach may prevent the colorization process from bleeding over object boundaries. Next, integration of the proposed fast colorization scheme to a scribble-based colorization system, a modified color transferring system and a novel chrominance coding approach are investigated. In our experiments, each system exhibits obvious improvement as compared to those corresponding previous works.
Rewriting Queries Using Views for RDF-Based Relational Integration
Authors: Huajun Chen, Zhaohui Wu, Yuxin Mao
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

We study the problem of answering queries through a tar get RDF ontology, given a set of view-based mappings between one or more source relational schemas and this target ontology. We design a novel query rewriting algorithm that can efficiently rewrites a RDF query into relational queries using a set of RDF views. With our approach , we highlight the important role played by RDF Blank Node in representing incomplete semantics of relational data when integrating them using RDF.
D&eacute;tection de partition pour la gestion de groupes en environnement mobile
Authors: Muhammad Usman Bhatti, Denis Conan
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

Wireless networks are more ubiquitous than before and they present a whole new set of problems with their inception. Disconnection is one of such problems where mobile terminals can disconnect. Failure is another problem that is inherited from the distributed systems. The two may create partitions in the distributed systems which are necessary to be detected for fault tolerance in mobile environments. In this work, we present a partition detection service which is interoperable with group communication systems. The main idea of our proposition is to allow clients of the partition detection service to make the distinction between the nodes that are faulty and the ones that are only partitioned or disconnected.
Voronoi Treemaps
Authors: Michael Balzer, Oliver Deussen
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

Treemaps are a well-known method for the visualization of attributed hierarchical data. Previously proposed Treemap layout algorithms are limited to rectangular shapes, which causes problems with the aspect ratio of the rectangles as well as with identifying the visualized hierarchical structure. The approach of Voronoi Treemaps presented in this paper eliminates these problems through enabling subdivisions of and in polygons. Additionally, this allows for creating Treemap visualizations within areas of arbitrary shape, such as triangles and circles, thereby enabling a more flexible adaptation of Treemaps for a wider range of applications.
Learning predictive representations from a history
Authors: Eric Wiewiora
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Predictive State Representations (PSRs) have shown a great deal of promise as an alternative to Markov models. However, learning a PSR from a single stream of data generated from an environment remains a challenge. In this work, we present a formalism of PSRs and the domains they model. This formalization suggests an algorithm for learning PSRs that will (almost surely) converge to a globally optimal model given sufficient training data.
A minimax disparity approach for obtaining OWA operator weights
Authors: Ying-Ming Wang, Celik Parkan
Venue: Information Sciences: an International Journal (2005)

One of the key issues in the theory of ordered weighted averaging (OWA) operators is the determination of OWA operator weights. In this paper, a minimax disparity approach for obtaining OWA operator weights is proposed. This involves the formulation and solution of a linear programming (LP) model for a given degree of orness. The proposed approach generates the OWA operator weights by minimizing the maximum difference between any two adjacent weights. A numerical example is provided to illustrate the application of the proposed approach in generating viable OWA operator weights in a simple and effective way.
Techniques for improving the accuracy of geometric-programming based analog circuit design optimization
Authors: Jintae Kim, Jaeseo Lee, L. Vandenberghe
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

We present techniques for improving the accuracy of geometric-programming (GP) based analog circuit design optimization. We describe major sources of discrepancies between the results from optimization and simulation, and propose several methods to reduce the error. Device modeling based on convex piecewise-linear (PWL) function fitting is introduced to create accurate active and passive device models. We also show that in selected cases GP can enable nonconvex constraints such as bias constraints using monotonicity, which help reduce the error. Lastly, we suggest a simple method to take the modeling error into account in GP optimization, which results in a robust design over the inherent errors in GP device models. Two-stage operational amplifier and on-chip spiral inductor designs are given as examples to demonstrate the presented ideas.
Digital Technology, Age, and Gaming
Authors: Neville Holmes
Venue: Computer (2005)

Educators could use video gaming technology to deliver the drill and practice that helps students develop the basic academic skills that are essential to the computing profession.
A conceptual framework for understanding collaborative systems evaluation
Authors: Josie P. H. Huang
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

This paper presents a conceptual framework for the understanding of collaborative systems evaluation. Based on previous research, a conceptual framework for understanding collaborative system evaluation is introduced using the lifecycle based approach. This concept is supported through a follow up evaluation activity within the DIECoM project (Distributed Integrated Environment for Configuration Management), an EC Framework V project. Consequently, the issues are identified from the findings of the follow up as needing further investigation.
On a Hybrid Rule Based Recommender System
Authors: FENG ZHANG, HUI-YOU CHANG
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Compared with relative recently-reported conterparts, a novel recommender system prototype is implemented. Its efforts focus on the three essential issues as a whole that recommender systems have to handle: data source, data modeling and recommendation strategy. It is based on a common data format and introduces a hybrid-rule model with a strategy of one-round table scanning. Laboratory experiment results show that this recommender system produces a better outcome.
2005 EDOC: Meeting the Challenges of Enterprise Computing
Authors: Patrick C. K. Hung, Marten J. van Sinderen
Venue: IT Professional (2005)

As enterprises demand increasing levels of networked information and services to carry out business processes, IT professionals need conferences like EDOC to discuss emerging technologies and issues in enterprise computing. Since 1997, EDOC has grown into an international annual event focusing on the convergence of the paradigms, technologies, and methods involved in enterprise computing.
Semantic Business Process Management: A Vision Towards Using Semantic Web Services for Business Process Management
Authors: Martin Hepp, Frank Leymann, John Domingue, Alexander Wahler, Dieter Fensel
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Business Process Management (BPM) is the approach to manage the execution of IT-supported business operations from a business expert's view rather than from a technical perspective. However, the degree of mechanization in BPM is still very limited, creating inertia in the necessary evolution and dynamics of business processes, and BPM does not provide a truly unified view on the process space of an organization. We trace back the problem of mechanization of BPM to an ontological one, i.e. the lack of machineaccessible semantics, and argue that the modeling constructs of Semantic Web services frameworks, especially WSMO [13, 14], are a natural fit to creating such a representation. As a consequence, we propose to combine SWS and BPM and create one consolidated technology, which we call Semantic Business Process Management (SBPM).