ppxscal/embedding_network huggingface dataset:
Data Stream Splicing for Web Proxy Cache Optimization
Authors: Jingli Zhou, Jifeng Yu, Hongtao Xia
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

Redundant data copies in Web proxy cache applications result in poor performance. This paper analyzes the data stream movement of Squid, which is a widely used web proxy cache program. Data stream splicing optimization to Squid includes three models: splicing client and server socket, splicing local file cache and client socket, splicing server socket and local file cache. All these splicing operations are implemented in Linux kernel module and corresponding system call interfaces are provided for applications to use. Data stream splicing not only eliminates data copies between user space and kernel space, but also eliminates the translations of user virtual address to physical address. Experiments prove that data stream splicing can reduce mean response time and data transfer overheads, and improve the throughput of proxy servers remarkably most of the time.
Wiener Chaos expansions and numerical solutions of randomly forced equations of fluid mechanics
Authors: Thomas Y. Hou, Wuan Luo, Boris Rozovskii, Hao-Min Zhou
Venue: Journal of Computational Physics (2006)

In this paper, we propose a numerical method based on Wiener Chaos expansion and apply it to solve the stochastic Burgers and Navier-Stokes equations driven by Brownian motion. The main advantage of the Wiener Chaos approach is that it allows for the separation of random and deterministic effects in a rigorous and effective manner. The separation principle effectively reduces a stochastic equation to its associated propagator, a system of deterministic equations for the coefficients of the Wiener Chaos expansion. Simple formulas for statistical moments of the stochastic solution are presented. These formulas only involve the solutions of the propagator. We demonstrate that for short time solutions the numerical methods based on the Wiener Chaos expansion are more efficient and accurate than those based on the Monte Carlo simulations.
Indexing and Integrating Multiple Features for WWW Images
Authors: Heng Tao Shen, Xiaofang Zhou, Bin Cui
Venue: World Wide Web (2006)

In this paper, we present a novel indexing technique called Multi-scale Similarity Indexing (MSI) to index image's multi-features into a single one-dimensional structure. Both for text and visual feature spaces, the similarity between a point and a local partition's center in individual space is used as the indexing key, where similarity values in different features are distinguished by different scale. Then a single indexing tree can be built on these keys. Based on the property that relevant images have similar similarity values from the center of the same local partition in any feature space, certain number of irrelevant images can be fast pruned based on the triangle inequity on indexing keys. To remove the "dimensionality curse" existing in high dimensional structure, we propose a new technique called Local Bit Stream (LBS). LBS transforms image's text and visual feature representations into simple, uniform and effective bit stream (BS) representations based on local partition's center. Such BS representations are small in size and fast for comparison since only bit operation are involved. By comparing common bits existing in two BSs, most of irrelevant images can be immediately filtered. To effectively integrate multi-features, we also investigated the following evidence combination techniques--Certainty Factor, Dempster Shafer Theory, Compound Probability, and Linear Combination. Our extensive experiment showed that single one-dimensional index on multi-features improves multi-indices on multi-features greatly. Our LBS method outperforms sequential scan on high dimensional space by an order of magnitude. And Certainty Factor and Dempster Shafer Theory perform best in combining multiple similarities from corresponding multiple features.
Trie-based Observations on the Routing Tables
Authors: Zhenqiang Li, Yan Ma
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

Trie is a data structure that is widely used in the algorithms for routing table lookup. Usually, the structure and characteristics of the routing table are first examined, and then the efficient and effective triebased algorithms are designed to speed up the timecritical path of packet processing in routers. This paper, on the contrary, uses a binary trie to make observations on the backbone BGP routing tables of both IPv4 and IPv6. Following some new terms and definitions, we use the statistical features of the trie to reveal the characteristics of the routing tables, such as route redundancy, route hierarchy etc. Particularly, some of the most significant evaluation metrics of the routing table lookup algorithms, such as worst case and average case memory access times per lookup for both successful and unsuccessful lookups, are concluded using different types of nodes in the trie.
Module-based modeling of flow-type multistage manufacturing systems adopting dual-card Kanban system
Authors: Junichi Nomura, Soemon Takakuwa
Venue: Proceedings of the 36th conference on Winter simulation (2004)

A systematic procedure of module-based modeling is designed and proposed to develop a simulation of any flow-type multistage manufacturing system adopting especially the dual-card Kanban system. First, functional analysis is performed to present kanban flows exactly in the same fashion in a simulation model as they are actually appeared in the real manufacturing system. One Customer module, the required number of Workstation modules, and one Supplier module make a set to develop a designated simulation. In addition, a numerical example is shown to apply the proposed procedure.
Robust stabilizing control of discrete-time jumping system via static output feedback
Authors: P. V. Pakshin, D. M. Retinsky, A. V. Ryabov
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

The paper considers a class of hybrid-state discrete time control systems, described by a set of systems with the transition between then determined by a homogeneous Markov chain taking values in a finite set of modes. When the mode is fixed, the plant state evolves according to the corresponding individual linear dynamics. The necessary and sufficient conditions of stabilizability in the mean square via static output feedback control are obtained. In the case when the mode change process has uncertainties a robust version of these conditions is given. A heuristic LMI based algorithm for computation of static output feedback control is also given.
Improving the Quality of Discussion Forum discourses by Using an Internal Market
Authors: Alexei Tretiakov, Oyvind Smestad, Prof. Kinshuk
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

We describe an approach that attempts to improve the quality of discussion forum discussions and to reduce the cost of discussion forum support by prioritizing and structuring messages. Learners prioritize and structure their own messages and evaluate the structure of messages posted by others, with an internal market in question priorities providing the driving force.
A SWOT analysis of the field of virtual reality rehabilitation and therapy
Authors: Albert Rizzo, Gerard Jounghyun Kim
Venue: Presence: Teleoperators and Virtual Environments (2005)

The use of virtual-reality technology in the areas of rehabilitation and therapy continues to grow, with encouraging results being reported for applications that address human physical, cognitive, and psychological functioning. This article presents a SWOT (Strengths, Weaknesses, Opportunities, and Threats) analysis for the field of VR rehabilitation and therapy. The SWOT analysis is a commonly employed framework in the business world for analyzing the factors that influence a company's competitive position in the marketplace with an eye to the future. However, the SWOT framework can also be usefully applied outside of the pure business domain. A quick check on the Internet will turn up SWOT analyses for urban-renewal projects, career planning, website design, youth sports programs, and evaluation of academic research centers, and it becomes obvious that it can be usefully applied to assess and guide any organized human endeavor designed to accomplish a mission. It is hoped that this structured examination of the factors relevant to the current and future status of VR rehabilitation will provide a good overview of the key issues and concerns that are relevant for understanding and advancing this vital application area.
Addressing SMTP-Based Mass-Mailing Activity within Enterprise Networks
Authors: David Whyte, P. C. van Oorschot, Evangelos Kranakis
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Malicious mass-mailing activity on the Internet is a serious and continuing threat that includes mass-mailing worms, spam, and phishing. A mechanism commonly used to deliver such malicious mass mail is an SMTP-engine, which turns an infected system into a malicious mail server. We present a technique that enables, within a single mailing attempt in many popular network environments, detection and containment of (even zero-day) SMTP-engine based mass-mailing activity. Contrary to other mass-mailing detection techniques our approach is content independent and requires no attachment processing, network traffic correlation, statistical measures, or system behavioral analysis. It relies instead on the observation of DNS MX queries within the enterprise network. This stateless detection technique requires minimal computational resources making it ideally suited for real-time wire-speed deployment.
The Confluent Capacity of the Internet: Congestion vs. Dilation
Authors: Jiangzhuo Chen, Ravi Sundaram, Madhav Marathe, Rajmohan Rajaraman
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Using shortest paths, the Internet scales very poorly with respect to congestion [2]. Two main reasons for using shortest paths are dilation (or delay) and size of routing tables. As the Internet grows, the small size of routing tables is important for scaling, but it does not require shortest paths. As long as the paths are confluent, the routing table size is unchanged. In this paper we study the confluent capacity of the Internet. We use the preferential attachment model [5] for the Internet, and all-pair uniform demand for the traffic pattern. Our main theoretical result is that the confluent congestion1 is within a logarithmic factor of the optimal splittable congestion and can be achieved using a simple randomized and distributed scheme called Locally Independent Rounding Algorithm (LIRA). We reinforce this result experimentally by employing simulations to demonstrate that for almost all instances the confluent congestion is (nearly) equal to the splittable congestion. Thus we conclude that the Internet scales well using confluent paths. We combine known results on expanders and the expansion properties of the preferential attachment model to show that for almost all Internet-like networks, we can find a confluent flow that simultaneously achieves O(log n)- approximate congestion and O(1)-approximate dilation. We confirm, using simulations, the intuition that confluence does not come at the cost of dilation.
Transitivity-based Removal of Correspondence Outliers for Motion Analysis
Authors: Antonio Robles-Kelly, Yael Moses
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In this paper we address the problem of removing correspondence outliers in a sequence of images. The input to the system is a set of putative matches which are based upon image-feature similarity. Classical methods for outlier removal, such as RANSAC-based approaches, assume consistency and rigidity in the scene motion between two or three frames in the sequence. Here we propose a novel method for removing correspondence outliers that does not depend on such assumptions. Our method is based on the observation that correspondence is an equivalence relation, and, hence, transitivity must hold between corresponding features in different frames. We impose consistency on the transitivity by representing the matching information as a weighted graph with positive and negative edge-weights. Consistency is then enforced by partitioning the nodes in the graph so as to remove edges corresponding to falsepositive correspondences. The clustering algorithm is of spectral nature and can handle graphs whose edge-weights are non-positive. Our method is a general one that can be used for purposes of outlier removal from correspondences between any entities whose putative matches imply equivalence relations. We illustrate the utility of the method for purposes of outlier removal on a real-world image sequence and compare our results with those yield using an alternative.
The development and evaluation of software for teaching reading at primary level
Authors: Cathy Lewin
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

IT in the classroom can provide both those children beginning to read and those finding difficulty learning to read with the opportunity to practice regularly with minimum supervision. The use of speech synthesis, graphics and the future incorporation of speech recognition have the potential to revolutionise the use of computers in the classroom. Talking book software, which replicates real books with the addition of speech feedback, complements well the current holistic approaches to teaching reading in a meaningful context. Thus, it is this form of software which is the focus of my research. The aim of the study is to identify any weaknesses in software currently being used in the UK, as highlighting its strengths. The design of a prototype system will draw upon the findings of an extensive review of the literature on the theory of learning to read, and the results of a pilot study evaluating talking book software. One of the objectives of this research is to identify whether the use of talking book software in the classroom helps children in their efforts to learn to read or removes the need to try. In addition, it is acknowledged that the new technology of speech recognition should have a great impact upon future computer assisted reading software. In order to explore this aspect, contact has been made with two commercial UK companies who are jointly developing 'talking and listening' books. They will be evaluating the new system this year and have agreed to my involvement in this process, in exchange for being able to report upon the results in my thesis. Another aspect related to the research is the effective evaluation of such software. As part of my doctoral studies, a framework for evaluation has already been designed based upon a holistic approach including pedagogical issues, cognitive, affective and technical issues [Lewin, 1995a]. This research is now in its second of three years.
A new algorithm for fast blind equalization of wireless communication channels
Authors: Guanghan Xu, Lang Tong, Hui Liu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Tong et al. (see IEEE Trans. on Information Theory, March 1994) has proposed a parametric approach for blind equalization based solely on the second-order statistics. It first demonstrates the possibility of achieving satisfactory blind equalization by using a few hundred data samples in some typical wireless communication scenarios. Nevertheless, the algorithm is still far from optimal and is quite computationally intensive. In this paper, we use a different approach and derive a new algorithm which is less complicated as the original one. Simulation studies also show that some improvement of the new approach over its alternative in some scenarios.
Changes in the Spatial Distribution of Visual Attention after Early Deafness
Authors: Jason Proksch, Daphne Bavelier
Venue: Journal of Cognitive Neuroscience (2002)

There is much anecdotal suggestion of improved visual skills in congenitally deaf individuals. However, this claim has only been met by mixed results from careful investigations of visual skills in deaf individuals. Psychophysical assessments of visual functions have failed, for the most part, to validate the view of enhanced visual skills after deafness. Only a few studies have shown an advantage for deaf individuals in visual tasks. Interestingly, all of these studies share the requirement that participants process visual information in their peripheral visual field under demanding conditions of attention. This work has led us to propose that congenital auditory deprivation alters the gradient of visual attention from central to peripheral field by enhancing peripheral processing. This hypothesis was tested by adapting a search task from Lavie and colleagues in which the interference from distracting information on the search task provides a measure of attentional resources. These authors have established that during an easy central search for a target, any surplus attention remaining will involuntarily process a peripheral distractor that the subject has been instructed to ignore. Attentional resources can be measured by adjusting the difficulty of the search task to the point at which no surplus resources are available for the distractor. Through modification of this paradigm, central and peripheral attentional resources were compared in deaf and hearing individuals. Deaf individuals possessed greater attentional resources in the periphery but less in the center when compared to hearing individuals. Furthermore, based on results from native hearing signers, it was shown that sign language alone could not be responsible for these changes. We conclude that auditory deprivation from birth leads to compensatory changes within the visual system that enhance attentional processing of the peripheral visual field.
Hardware-Software Codesign of a Vector Co-processor for Public Key Cryptography
Authors: Jacques J. A. Fournier, Simon Moore
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

Until now, most cryptography implementations on parallel architectures have focused on adapting the software to SIMD architectures initially meant for media applications. In this paper, we review some of the most significant contributions in this area. We then propose a vector architecture to efficiently implement long precision modular multiplications. Having such a data level parallel hardware provides a circuit whose decode and schedule units are at least of the same complexity as those of a scalar processor. The excess transistors are mainly found in the data path. Moreover, the vector approach gives a very modular architecture where resources can be easily redefined. We built a functional simulator onto which we performed a quantitative analysis to study how the resizing of those resources affects the performance of the modular multiplication operation. Hence we not only propose a vector architecture for our Public Key cryptographic operations but also show how we can analyze the impact of design choices on performance. The proposed architecture is also flexible in the sense that the software running on it would offer room for the implementation of counter-measures against side-channel or fault attacks.
High dimensional nearest neighbor searching
Authors: Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agrawal, Amr El Abbadi
Venue: Information Systems (2006)

As databases increasingly integrate different types ot Information SUCh as time-series, multimedia and scientific data, it becomes necessary to support efficient retrieval of multi-dimensional data. Both the dimensionality and the amount of data that needs to be processed are increasing rapidly. As a result of the scale and high dimensional nature, the traditional techniques have proven inadequate. In this paper, we propose search techniques that are effective especially for large high dimensional data sets. We first propose VA+-file technique which is based on scalar quantization of the data. VA+-file is especially useful for searching exact nearest neighbors (NN) in non-uniform high dimensional data sets. We then discuss how to improve the search and make it progressive by allowing some approximations in the query result. We develop a general framework for approximate NN queries, discuss various approaches for progressive processing of similarity queries, and develop a metric for evaluation of such techniques. Finally, a new technique based on clustering is proposed, which merges the benefits of various approaches for progressive similarity searching. Extensive experimental evaluation is performed on several real-life data sets. The evaluation establishes the superiority of the proposed techniques over the existing techniques for high dimensional similarity searching. The techniques proposed in this paper are effective for real-life data sets, which are typically non-uniform, and they are scalable with respect to both dimensionality and size of the data set.
Augmented interiors with digital camera images
Authors: Sanni Siltanen, Charles Woodward
Venue: Proceedings of the 7th Australasian User interface conference - Volume 50 (2006)

In this paper, we present a system for Augmented Reality interior design based on digital images. The system can be used with an ordinary PC and a digital camera: no special equipment is required. Once placed in the image, virtual objects may be scaled, moved and rotated freely. In addition, the layout can be stored in file for later adjustment. We describe various user interface details and implementation issues, including a useful marker erasure method for general AR applications.
Path Integration Deficits during Linear Locomotion after Human Medial Temporal Lobectomy
Authors: John W. Philbeck, Marlene Behrmann, Lucien Levy, Samuel J. Potolicchio, Anthony J. Caputy
Venue: Journal of Cognitive Neuroscience (2004)

Animal navigation studies have implicated structures in and around the hippocampal formation as crucial in performing path integration (a method of determining one's position by monitoring internally generated self-motion signals). Less is known about the role of these structures for human path integration. We tested path integration in patients who had undergone left or right medial temporal lobectomy as therapy for epilepsy. This procedure removed approximately 50&percnt; of the anterior portion of the hippocampus, as well as the amygdala and lateral temporal lobe. Participants attempted to walk without vision to a previously viewed target 2&ndash;6 m distant. Patients with right, but not left, hemisphere lesions exhibited both a decrease in the consistency of path integration and a systematic underregistration of linear displacement (and/or velocity) during walking. Moreover, the deficits were observable even when there were virtually no angular acceleration vestibular signals. The results suggest that structures in the medial temporal lobe participate in human path integration when individuals walk along linear paths and that this is so to a greater extent in right hemisphere structures than left. This information is relevant for future research investigating the neural substrates of navigation, not only in humans (e.g., functional neuroimaging and neuropsychological studies), but also in rodents and other animals.