ppxscal/embedding_network huggingface dataset:
On proxy server based multipath connection
Authors: Yu Cai
Venue:  (2005)

A multipath connection provides multiple paths among network hosts. The traffic from a source can be spread over multiple paths and transmitted in parallel through the network. The receiver collects the incoming network packets, re-assembles them, and delivers them to the upper-level end users. Multipath connections offer applications with the ability to improve network performance, security and reliability. In this dissertation, techniques for supporting the proxy server based multipath connection (PSMC) are studied. First, the design and implementation of a proxy server based overlay network using a set of intermediate connection relay proxy servers is presented. Multiple indirect alternate paths can be set up via these proxy servers. The proxy server based overlay network is used in a Secure Collective Defense system (SCOLD) to defend against Distributed Denial of Services (DDoS) attacks. The Berkeley Internet Name Domain (BIND - v.9) package is enhanced to support indirect routing with IP Tunneling. The performance of the SCOLD system validates the capability of PSMC in enhancing the network security. Second, the existing TCP/IP protocol is enhanced with a proxy server based multipath protocol (PSMP). On the sender side, the IP layer is enhanced to distribute packets across multiple paths. The TCP congestion window control is revised for higher throughput. On the receiver side, the TCP layer is enhanced with a double buffer to solve the persistent reordering problem. Detailed analysis of the PSMP is presented. A communication channel is set up between the sender and the receiver for exchanging network traffic information. The enhancement supports both Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). Third, proxy server selection algorithms are developed for selecting a subset of proxy servers from a large set of available proxy servers with various object functions and constraints. Fourth, resource allocation schemes are proposed and implemented on the end server to provide proportional differentiated services. These schemes are based on the queueing theory and feedback control theory. By combining the multipath on the network with service differentiation at the end server, a comprehensive solution for various QoS and security related applications can be provided. PSMC utilizes existing network protocols and infrastructure with some enhancements. This ensures the ease of its deployment with the current Internet in various network environments. Therefore, a large number of applications could benefit from utilizing PSMC. The research results and insight obtained from PSMC could have broader impact on the protocols and security in today's Internet.
Porting and performance aspects from IPv4 to IPv6: The case of OpenH323: Research Articles
Authors: Ch. Bouras, A. Gkamas, D. Primpas, K. Stamos
Venue: International Journal of Communication Systems (2005)

This paper is a summary of our experiences on a case study for porting applications to IPv6. We present the results of the effort to port OpenH323, an open-source H.323 platform to IPv6, which we believe can serve as guidelines for other projects with similar goals. We briefly present the structure of the OpenH323 platform. We also discuss a number of issues arising during the porting of a platform to IPv6, like which would be the easiest approach to the porting procedure, how compatibility with earlier, IPv4-only versions of the platform could be retained, if there are any useful tools for assisting this task, how and when one could be positive that the necessary modifications had been made, and which testing procedures should be followed. We then present a variety of experiments that we conducted in order to comparatively evaluate the IPv4 and IPv6 protocol stacks. We also present the results of some initial experiments comparing IPv4 and IPv6 performance under congested network links and the conclusions that they lead us to. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Ecosystems modelling methodologies: desirable computer assistance
Authors: George Innis
Venue: ACM SIGSIM Simulation Digest (1977)

The construction of a simulation model proceeds from a statement of objectives, through hypothesis choice and formulation, to computer implementation and model experiments. Even the best of the modern simulation languages provide good support for only a portion of these activities. Ideally, we might specify objectives and environment and have the "system" develop the appropriate simulation model. We do not appear to be ready for such a system for several reasons: 1. The way in which objectives specify model structure is quite an art at the present, and while scenarios can be constructed in which certain properties of the model structure are clearly dictated by objectives, as yet the full model structure does not follow algorithmically from objectives; 2. A language for objective specification is needed. A natural language is too broad and ambiguous; 3. Ecosystem theory is not yet up to the task of defining, in detail, the ecosystem that would exist in a given environment although certain properties of that system can be predicted. 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
Stream Programming on General-Purpose Processors
Authors: Jayanth Gummaraju, Mendel Rosenblum
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

In this paper we investigate mapping stream programs (i.e., programs written in a streaming style for streaming architectures such as Imagine and Raw) onto a general-purpose CPU. We develop and explore a novel way of mapping these programs onto the CPU. We show how the salient features of stream programming such as computation kernels, local memories, and asynchronous bulk memory loads and stores can be easily mapped by a simple compilation system to CPU features such as the processor caches, simultaneous multi-threading, and fast inter-thread communication support, resulting in an executable that efficiently uses CPU resources. We present an evaluation of our mapping on a hyperthreaded Intel Pentium 4 CPU as a canonical example of a general-purpose processor. We compare the mapped stream program against the same program coded in a more conventional style for the general-purpose processor. Using both micro-benchmarks and scientific applications we show that programs written in a streaming style can run comparably to equivalent programs written in a traditional style. Our results show that coding programs in a streaming style can improve performance on today¿s machines and smooth the way for significant performance improvements with the deployment of streaming architectures.
GRID-enabled bioinformatics applications for comparative genomic analysis at the CBBC
Authors: A. Hunter, D. Schibeci, H. L. Hiew, M. Bellgard
Venue: Proceedings of the 2004 IEEE International Conference on Cluster Computing (2004)

Summary form only given. Bioinformatics is an important application area for grid computing. The grid computing issues required to tackle current bioinformatics challenges include processing power, large-scale data access and management, security, application integration, data integrity and curation, control/automation/tracking of workflows, data format consistency and resource discovery. In this poster, we describe preliminary steps taken to develop a grid environment to advance bioinformatics research. We developed a system called Grendel, with the aims of providing bioinformatics researchers transparent access to basic computational resources used in their research. Grendel is a platform and language independent Web-services based system for distributed resource management utilising Sun Grid Engine that provides a single entry point for computational tasks while keeping the actual resources transparent to the user. Grendel is developed in Java and deployed using the Tomcat. Client libraries have been developed in Perl and Java to provide access to computation resource exported via Grendel.
Classic and Quantum Network Coding
Authors: Kazuo Iwama
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

The notion of network coding is often explained by using the butterfly network (Fig. 1). Every channel has a capacity of one. [Ahlswede, Cai, Li, and Yeung 00] shows that two classical bits can be sent from s1 to t1 and s2 to t2, one for each. It seems that two bits can go through the channel (s0, t0) of capacity one, which is counter-intuitive against the case of "liquid flow". The trick is that any Boolean operation (including free fan-out) is allowed at each node. In its quantum version, classical channels are replaced by quantum channels with the same capacity. Any unitary operation is allowed at each node. (But note that fan-out is not free in quantum.) From the analogy of the above classical result, the natural attempt is to try sending two quantum bits on the crossing two paths. Unfortunately this seems difficult and it is unlikely to be able to keep a good quality of the transfered quantum bits. However, it turns out that we can keep a reasonably good quality for one qubit in one path and one classical bit in the other and for two special qubits. In the latter case, we can also think of sending four classical bits on the two paths, two for each.
Les usages &eacute;mergents d'un jeu multijoueurs sur terminaux mobiles g&eacute;olocalis&eacute;s: les cons&eacute;quences interactionnelles des "rencontres d'&eacute;cran"
Authors: Christian Licoppe, Yoriko Inada
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

This communication a case study about the uses in Japan of a multiplayer location aware mobile game. The gameplay is a collection game where users must gather sets of "virtual" objects. This case study of a commercially available location-aware multiplayer game provides a glimpse of what the experience of inhabiting an augmented urban public space might be like, and of the kind of social order and emergent "form-of-life" that might characterize it.The key feature is an onscreen map which features geo-localized players and virtual objects within a radius of 500 meters. This interface allows players to "see" one another onscreen. We analyze the interactional conventions that develop through such mediated encounter. How can "seing" one another in this way, and the geographical proximity it entails, become a pretext to start text-messaging exchanges. We discuss how such encounters involving mutual perception on the screen of the mobile phone are embodied, by analyzing the work users occasionally accomplish to realign their onscreen perspective with their embodied one.
Locality analysis to control dynamically way-adaptable caches
Authors: Hiroaki Kobayashi, Isao Kotera, Hiroyuki Takizawa
Venue: Proceedings of the 2004 workshop on MEmory performance: DEaling with Applications , systems and architecture (2004)

This paper presents a control mechanism for dynamically way-adaptable caches. The mechanism uses the local and global information about the locality of reference during execution. As the local information, the cache access pattern is evaluated based on the statistics of the LRU (Least-Recently Used) states of cache entries referenced. If the memory accesses are concentrated on and near the most recently used entries, the mechanism knows that the locality of reference is very high and there is room to decrease the number of ways activated to fit the current locality. On the other hand, if the accesses are widely distributed from the most recently used entries to the least recently used ones, the mechanism understands that more ways are needed to improve the performance as long as the resources are available. In addition, to examine the global behavior of the locality of reference, an n-bit state machine like n-bit branch predictors is introduced into the mechanism. The state machine traces a sequence of cache resizing requests and evaluates its stability across the execution time. Therefore, the state machine helps the mechanism avoid unstable actions for enabling/disabling cache ways when the locality shows the highly irregular behavior. The experimental results indicate that an n-bit asymmetric state machine using the LRU status information works well to appropriately control cache ways even in the case of the benchmarks with highly-irregular access behaviors in cache references.
Ontology Assisted Web Services Discovery
Authors: Po Zhang, Juanzi Li
Venue: Proceedings of the IEEE International Workshop (2005)

This paper proposes the construction method and the formal description of Web Service Discovery Oriented Ontology, then gives the definition of Ontology-based Knowledge Base. As the data layer and semantic layer of the whole framework of Semantic Web Services Discovery, Web Service Oriented Ontology-based Knowledge Base is different from traditional knowledge base. It will represent the domain knowledge (domain in this paper is Travel Domain), the formal description of Web Service and even the description of personal interest model which supports the formal specification of request query; then proposes an algorithm to realize the objective of discovering the Web Services through the way of manipulating the relations between ontology. This paper shows the applied merit of this model through illustrating a use case of Web Services Discovery, and compares between other Ontology construction methods.
Computational aspects of Bayesian partition models
Authors: Mikko Koivisto, Kismat Sood
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

The conditional distribution of a discrete variable y, given another discrete variable x, is often specified by assigning one multinomial distribution to each state of x. The cost of this rich parametrization is the loss of statistical power in cases where the data actually fits a model with much fewer parameters. In this paper, we consider a model that partitions the state space of x into disjoint sets, and assigns a single Dirichlet-multinomial to each set. We treat the partition as an unknown variable which is to be integrated away when the interest is in a coarser level task, e.g., variable selection or classification. Based on two different computational approaches, we present two exact algorithms for integration over partitions. Respective complexity bounds are derived in terms of detailed problem characteristics, including the size of the data and the size of the state space of x. Experiments on synthetic data demonstrate the applicability of the algorithms.
Fast Vector Matching Methods and Their Applications to Handwriting Recognition
Authors: Ying-Ho Liu, Wen-Hsiung Lin, Fu Chang, Chin-Chin Lin
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A common practice in pattern recognition is to classify an unknown object by matching its feature vector with all the feature vectors stored in a database. When the number of class types and the set of stored entities are both large, it is essential to speed up the matching process. This can be achieved more effectively by eliminating unlikely candidates, rather than impossible candidates, from the process. We propose two methods for this purpose: one employs multiple trees, while the other employs a sub-vector matching technique. Both approaches use a learning procedure to estimate the optimal value of certain parameters. An online matching is then performed with a combination of the two methods, which matches candidates rapidly without sacrificing accuracy rates. The process is demonstrated by experiments in which we apply the proposed methods to handwriting recognition.
Turning the Bucket of Text into a Pipe
Authors: Elizabeth G. Hetzler, Vernon L. Crow, Deborah A. Payne, Alan E. Turner
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

Many visual analysis tools operate on a fixed set of data. However, professional information analysts follow issues over a period of time and need to be able to easily add new documents to an ongoing exploration. Some analysts handle documents in a moving window of time, with new documents constantly added and old ones aging out. This paper describes both the user interaction and the technical implementation approach for a visual analysis system designed to support constantly evolving text collections.
Higher-Order Web Link Analysis Using Multilinear Algebra
Authors: Tamara G. Kolda, Brett W. Bader, Joseph P. Kenny
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Linear algebra is a powerful and proven tool in web search. Techniques, such as the PageRank algorithm of Brin and Page and the HITS algorithm of Kleinberg, score web pages based on the principal eigenvector (or singular vector) of a particular non-negative matrix that captures the hyperlink structure of the web graph. We propose and test a new methodology that uses multilinear algebra to elicit more information from a higher-order representation of the hyperlink graph. We start by labeling the edges in our graph with the anchor text of the hyperlinks so that the associated linear algebra representation is a sparse, three-way tensor. The first two dimensions of the tensor represent the web pages while the third dimension adds the anchor text. We then use the rank-1 factors of a multilinear PARAFAC tensor decomposition, which are akin to singular vectors of the SVD, to automatically identify topics in the collection along with the associated authoritative web pages.
Modelling of SACK TCP and application to the HTTP File Transfer Environment
Authors: Damien Phillips, Jiankun Hu
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

It is known that analytic modelling for TCP latency is a non trivial task. Recently, some significant progress has been made, such as the comprehensive result by Sikdar et al. However, models similar to these often rely on trial and error methods such as "data fitting". This can lead to a very limited scope for the resulting model and also large estimation error. In this paper, we propose improvements to Sikdar's SACK TCP model. A new delayed acknowledgement slow start model is developed that is analytically derived from the slow start algorithm which provides a novel mechanism to model the relationship between RTT and the delayed acknowledgement timer. We introduce a simple mechanism to include time taken to send an HTTP Get Request to broaden the scope of our SACK TCP model to website file transfer. Simulation and live Internet experimentation has validated our scheme.
Commutation with codes
Authors: Juhani Karhumäki, Michel Latteux, Ion Petre
Venue: Theoretical Computer Science (2005)

The centralizer of a set of words X is the largest set of words C(X)commuting with X: XC(X) = C(X)X. It has been a long standing open question due to [J.H. Conway, Regular Algebra and Finite Machines, Chapman & Hall, London (1971).], whether the centralizer of any rational set is rational. While the answer turned out to be negative in general, see [M. Kunc, Proc. of ICALP 2004, Lecture Notes in Computer Science, Vol. 3142, Springer, Berlin, 2004, pp. 870-881.], we prove here that the situation is different for codes: the centralizer of any rational code is rational and if the code is finite, then the centralizer is finitely generated. This result has been previously proved only for binary and ternary sets of words in a series of papers by the authors and for prefix codes in an ingenious paper by [B. Ratoandromanana, RAIRO Inform. Theor. 23(4) (1989) 425-444.]--many of the techniques we use in this paper follow her ideas. We also give in this paper an elementary proof for the prefix case.
SHiC: A Service-Aware, High-Level Communication Infrastructure Supporting Integration with the Grid
Authors: Fabrizio Messina, Giuseppe Pappalardo, Emiliano Tramontana
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

The ability to adapt a software system to a new communication technology critically depends on the support available to cope with the relevant integration effort. In view of this goal, this paper puts forward a communication infrastructure consisting of two layers. The upper layer allows software to obtain remote services through simple but powerful abstractions, while the lower layer provides the upper one with uniform access to a specific underlying data transfer technology. As a benefit, resorting to the proposed infrastructure equips the system to be adapted with high level communication facilities, leaving it unconcerned about the specific data transfer technology used.
Portable C/C++ Code for Portable XML Data
Authors: Zhaoqing Wang, Harry H. Cheng
Venue: IEEE Software (2006)

C/C++ is one of the high-performance programming languages software developers use to develop XML applications. However, it's challenging to use C/C++ for such a task. The code developed in one platform can't readily run in another platform. Ch is a cross-platform embeddable C/C++ interpreter for scripting, shell programming, numerical computing, network computing, and embedded scripting. The authors have developed open source Ch XML packages developed for the Gnome libxml2 XML library and Oracle XML Developer's Kit (XDK) for C/C++. With these Ch XML packages, applications in C/C++ using either libxml2 or Oracle XDK can be executed interpretively without compilation across different platforms. Portable C/C++ code can be used to process portable XML data. The authors discuss how they designed the Ch XML packages and present potential applications. They also present a Web-based network computing application using a Ch XML package.
ViVo: Visual Vocabulary Construction for Mining Biomedical Images
Authors: Arnab Bhattacharya, Vebjorn Ljosa, Jia-Yu Pan, Mark R. Verardo, Hyungjeong Yang, Christos Faloutsos, Ambuj K. Singh
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Given a large collection of medical images of several conditions and treatments, how can we succinctly describe the characteristics of each setting? For example, given a large collection of retinal images from several different experimental conditions (normal, detached, reattached, etc.), how can data mining help biologists focus on important regions in the images or on the differences between different experimental conditions? If the images were text documents, we could find the main terms and concepts for each condition by existing IR methods (e.g., tf/idf and LSI). We propose something analogous, but for the much more challenging case of an image collection: We propose to automatically develop a visual vocabulary by breaking images into n × n tiles and deriving key tiles ("ViVos") for each image and condition. We experiment with numerous domain-independent ways of extracting features from tiles (color histograms, textures, etc.), and several ways of choosing characteristic tiles (PCA, ICA). We perform experiments on two disparate biomedical datasets. The quantitative measure of success is classification accuracy: Our "ViVos" achieve high classification accuracy (up to 83% for a nine-class problem on feline retinal images). More importantly, qualitatively, our "ViVos" do an excellent job as "visual vocabulary terms": they have biological meaning, as corroborated by domain experts; they help spot characteristic regions of images, exactly like text vocabulary terms do for documents; and they highlight the differences between pairs of images.