ppxscal/embedding_network huggingface dataset:
Redundancy in network traffic: findings and implications
Authors: Ashok Anand, Chitra Muthukrishnan, Aditya Akella, Ramachandran Ramjee
Venue: Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems (2009)

A large amount of popular content is transferred repeatedly across network links in the Internet. In recent years, protocol-independent redundancy elimination, which can remove duplicate strings from within arbitrary network flows, has emerged as a powerful technique to improve the efficiency of network links in the face of repeated data. Many vendors offer such redundancy elimination middleboxes to improve the effective bandwidth of enterprise, data center and ISP links alike. In this paper, we conduct a large scale trace-driven study of protocol independent redundancy elimination mechanisms, driven by several terabytes of packet payload traces collected at 12 distinct network locations, including the access link of a large US-based university and of 11 enterprise networks of different sizes. Based on extensive analysis, we present a number of findings on the benefits and fundamental design issues in redundancy elimination systems. Two of our key findings are (1) A new redundancy elimination algorithm based on Winnowing that outperforms the widely-used Rabin fingerprint-based algorithm by 5-10% on most traces and by as much as 35% in some traces. (2) A surprising finding that 75-90% of middlebox's bandwidth savings in our enterprise traces is due to redundant byte-strings from within each client's traffic, implying that pushing redundancy elimination capability to the end hosts, i.e. an end-to-end redundancy elimination solution, could obtain most of the middlebox's bandwidth savings.
Classification on the grassmannians: theory and applications
Authors: Jen-Mei Chang
Venue:  (2008)

This dissertation consists of four parts. It introduces a novel geometric framework for the general classification problem and presents empirical results obtained from applying the proposed method on some popular classification problems. An analysis of the robustness of the method is provided using matrix perturbation theory, which in turn motivates an optimization problem to improve the robustness of the classifier. Lastly, we illustrate the use of compressed data representations based on Karcher mean. The success of this geometric framework builds upon the facts that the geometry and statistics of the Grassmannians are well-understood and families of patterns with a common characterization possesses discriminatory variations that are useful for classification. Under the right conditions, these families of patterns can be viewed as points on the Grassmannian where distances are available for classification. In this dissertation, we will make precise this connection, review various ways these metrics arise, and how to efficiently compute distances between points on this manifold. Under this framework, we achieve excellent classification results for a variety of applications in face recognition and offer new insights to the problem in general. Attempting to break the method, we consider nonlinear data sets and images of extremely low resolutions. We are pleased to learn that the Grassmann method is robust against resolution reductions. In order to understand how robust the Grassmann method is against perturbation, we draw support from matrix perturbation theory where we exploit the natural correspondence between linear subspaces and points on the Grassmannians. We are then led to formulate an optimization problem using these characteristics as an objective function and further connect this optimization criterion to the idea of Fisher Linear Discriminant on general image sets. Numerical solutions obtained show promising improvements on the separability criterion. The thesis is concluded by providing a novel algorithm that computes subject prototypical points using the Karcher mean on the Grassmannian. A lot of new ideas for geometric data analysis are generated through studies of old ideas. We hope that the suite of these frameworks and algorithms can collectively provide useful insights in studying geometric aspects of large data sets.
The Problem of Object Recognition in the Presence of Noise in Original Data
Authors: V. N. Vagin, M. V. Fomina, A. V. Kulikov
Venue: Proceeding of the 2008 conference on Tenth Scandinavian Conference on Artificial Intelligence: SCAI 2008 (2008)

The problem of object generalization with account for the necessity of processing the incomplete and inconsistent information stored in real databases is considered. It is suggested to use means of rough sets theory and decision trees to generalize the information stored in real databases. Noise models are presented, and a noise effect on the operation of generalization algorithms using the methods of building decision trees is developed. The algorithm for unknown values reconstruction in learning samples subjected to the noise effect based on the nearest neighbour method is proposed. The results of program modeling are brought out.
How to keep members using the information in a computer-supported social network
Authors: Xiao-Ling Jin, Christy M. K. Cheung, Matthew K. O. Lee, Hua-Ping Chen
Venue: Computers in Human Behavior (2009)

Computer-supported social networks have become a significant channel for people to interact and exchange information. The success of computer-supported social networks depends on the extent to which members will stay and continue participating. Many computer-supported social networks however suffer from the problem of retaining members. Drawing from theories of user satisfaction and information adoption, we develop a model to examine how computer-supported social networks encourage members to continue participating and using the information in the network. The theoretical model is validated through an online survey of 240 users of a Bulletin Board System established by a local university in China. The results reveal that individuals will continue to use the information in a computer-supported social network when they are satisfied with their prior usage, and when they perceive that the information in the network is useful. The results also suggest that individuals' perceived information usefulness and satisfaction are determined by information quality and source credibility in the context of computer-supported social networks. Theoretical and practical implications about computer-supported social networks are discussed.
Development and Evaluation of a Learning Support System for Learning by Following
Authors: Akira Urao, Kazuhisa Miwa
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

In this study, we focus on the acquisition of cognitive skills by doing, which has not yet been studied in the fields of learning by examples. We propose a new way of learning, “learning by following”, which enables learners to attentively follow an example of a series of actions. Since following actions is difficult, we designed a learning support system that enables learners to be assisted to learn by following. We examined this system though experiments using the LEGO Mindstorms, whose results showed that our learning support system successfully enabled learning by following.
Search your memory ! - an associative memory based desktop search system
Authors: Jidong Chen, Hang Guo, Wentao Wu, Chunxin Xie
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

We present XSearcher, an associative memory based desktop search system, which exploits associations by creating semantic links of personal desktop resources from explicit and implicit user activities. With these links, associations among memory fragments can be built or rebuilt in a user's brain during a search. The personalized ranking scheme uses these links together with a user's personal preferences to rank results by both relevance and importance. XSearcher enhances traditional keyword based search systems since it is closer to the way that human associative memory works.
Mining Archived ITS Data for Multidimensional Analysis
Authors: Margaret Cusack
Venue:  (2007)

Knowledge and information are the basis of informed travel behavior. Individual choice in transportation decision-making is improved by the availability and robustness of traveler information. Historical information combined with new information contributes to the individual decision maker's mode, route, and travel time choices. Intelligent Transportation Systems (ITS) improve the information available to travelers which in turn, can alleviate recurring capacity problems and incident related capacity overloads on roadways, transit systems, at airports and ports, by disseminating better information to travelers. While generating data to send out to travelers in real time, ITS also creates valuable data in non-homogenous archive systems. This rich data source often goes unused, and is not typically accessed by analysts. This book suggests that Geographic Information Systems (GIS) are the perfect environment in which to convert ITS generated and archived data into a homogenous source for robust analysis. This work describes a prototype to exploit GIS and data collection technologies, using sound systems engineering principles, to address a transportation industry problem. The prototype shows how ITS data archiving and retrieval problems are opportunities for data analysis and decision-making. This work will aid in the development of archived ITS data analysis around the world. 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
Impacts of decoy elements on result set evaluations in knowledge-based recommendation
Authors: Erich Christian Teppan, Alexander Felfernig
Venue: International Journal of Advanced Intelligence Paradigms (2009)

State-of-the-art recommender systems only partially consider psychological aspects of consumer behaviour. Taking into account those aspects helps to improve the overall understanding of related decision processes. In this paper we investigate influences triggered by so called decoy effects which are known phenomena in decision psychology and marketing. Particularly, we focus on changes in the perceived product utility and the effect on the subjectively felt confidence in a customer's own decision in a potential sales situation. To this end, we report the results of two empirical studies which analyse decoy effects in not yet investigated item&#47;attribute constellations.
Random graphs from a minor-closed class
Authors: Colin Mcdiarmid
Venue: Combinatorics, Probability and Computing (2009)

A minor-closed class of graphs is addable if each excluded minor is 2-connected. We see that such a class <private-char><inline-graphic mime-subtype="gif" xlink="S0963548309009717_char1"/></private-char> of labelled graphs has smooth growth; and, for the random graph Rn sampled uniformly from the n-vertex graphs in <private-char><inline-graphic mime-subtype="gif" xlink="S0963548309009717_char1"/></private-char>, the fragment not in the giant component asymptotically has a simple ‘Boltzmann Poisson distribution’. In particular, as n → ∞ the probability that Rn is connected tends to 1/A(ρ), where A(x) is the exponential generating function for <private-char><inline-graphic mime-subtype="gif" xlink="S0963548309009717_char1"/></private-char> and ρ is its radius of convergence.
Websters Occitan - English Thesaurus Dictionary
Authors: Philip M. Parker
Venue:  (2007)

If you are learning Occitan, this book was not created for you, and you should not purchase it. It was created for completely fluent mother-tongue speakers of Occitan who already know the full meaning of Occitan words, but who need to learn how a single English translation of a Occitan word may have ambiguous meanings in the English language. It is designed for bi-lingual education for the non-English reader who wants to improve English-language test scores covering English synonyms. Synonyms may bear no relationship to a translation word (e.g. love can signify both an emotion and a score of zero in tennis; zero, while being a synonym of love, is likely to be a bad translation to the original Occitan headword). This is a regular English thesaurus, like Rogets, but the entries are sorted alphabetically using headwords from Occitan. It cannot be used to translate between the two languages, but may help a fluent speaker of Occitan who is learning basic English, to learn the ambiguities of the English language and its vocabulary. The synonyms for each headword are not translations; Occitan words are used to facilitate looking up English synonyms. Prior to purchase, educators and students should review the contents of this unique form of thesaurus which is free to view on Google books, or using Amazons look inside function. Public domain translations used were contributed to Websters Online Dictionary and have originated from uncited volunteers, native speakers, professional translators, field linguists and academics (not by the editor of the thesaurus). If you would like citation for any translations, make suggestions, note errors, or contribute in any other way, please email Philip M. Parker at INSEAD, who will periodically update this series. Reproduction rights are granted to educators. 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
Impact of FEC on different modulation formats in optical communication systems
Authors: Ajay K. Sharma, Amarpal Singh, Manisha
Venue: International Journal of Communication Networks and Distributed Systems (2009)

The desire for higher per-fibre transport capacities and at the same time, the drive for lower costs per end-to-end transmitted information bit has led to optically routed transmission systems with higher spectral efficiencies. Among other enabling techniques that are used for the purpose, optical modulation formats with the application of some forward error correction techniques have become key to the design of modern optical transmission systems. In this paper we have analysed the optical communication system to evaluate the performance of different modulation formats with or without applying forward error correction techniques.
A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands
Authors: Cao Erbao, Lai Mingyong
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, the vehicle routing problem with fuzzy demands (VRPFD) is considered, and a fuzzy chance constrained program model is designed, based on fuzzy credibility theory. Then stochastic simulation and differential evolution algorithm are integrated to design a hybrid intelligent algorithm to solve the fuzzy chance constrained program model. Moreover, the influence of the dispatcher preference index on the final objective of the problem is discussed using stochastic simulation, and the best value of the dispatcher preference index is obtained.
Data Modeling with UML 2.0
Authors: Bogumiła Hnatkowska, Zbigniew Huzar, Lech Tuzinkiewicz
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

Database design goes through three-stage development process: conceptual modeling, logical modeling and physical modeling. The paper deals with transformation of conceptual models to logical ones. Assuming that conceptual models are expressed in UML 2.0, the paper presents two groups of transformation rules. The first group contains commonly used rules dealing with transformation of conceptual models. The second group gathers specific rules, proposed by authors, that can be applied for new features of the UML 2.0.
Systematic approach to the synthesis of continuous-time cascaded sigma---delta modulators
Authors: Matthias Keller, Alexander Buhmann, Maurits Ortmanns, Yiannos Manoli
Venue: Analog Integrated Circuits and Signal Processing (2009)

This paper deals with a systematic approach to the synthesis of continuous-time cascaded sigma---delta modulators. Based on a system-theoretical model, a detailed derivation of the digital cancelation filters for continuous-time cascaded architectures is presented in order to achieve maximum signal-to-noise ratio together with optimal anti-aliasing performance. By using the same model, an exact equation for the performance loss of any cascaded architecture is derived. The latter is due to the scaling for stability and given relative to an ideal high-pass filter of the overall modulator order. Finally, an analytical calculation of optimal scaling coefficients in between the stages is performed, resulting in a limited search-space for these coefficients. Theoretical results are verified by simulations.
Speed up of the edge-based inverse halftoning algorithm using a finite state machine model approach
Authors: Kuo-Liang Chung, Ping-Zen Chen, Ying-Lin Pan
Venue: Computers Mathematics with Applications (2009)

The recently published edge- and lookup table-based inverse halftoning (ELIH) algorithm has shown its quality and superiority when compared with the previous lookup table-based IH algorithm. This paper presents a new finite state machine model (FSMM)-based search method to speed up the existing ELIH algorithm significantly while preserving the same image quality as in the ELIH algorithm. From the observation that the sliding window for the ELIH algorithm moves from left to right one position; there are therefore one output column and one input column which are introduced at each step and thus a simple finite state machine can track the transitions from the current window movement to the next. This is faster than a full search in the lookup table. Under thirty typical testing images adopted from Mese's website, experimental results demonstrated that the proposed FSMM-based ELIH algorithm has an improvement in execution time of 20% to 80%, with a typical improvement of 50%, when compared to the ELIH algorithm.
Software agents in music and sound art research/creative work: Current state and a possible direction
Authors: Ian Whalley
Venue: Organised Sound (2009)

Composers, musicians and computer scientists have begun to use software-based agents to create music and sound art in both linear and non-linear (non-predetermined form and/or content) idioms, with some robust approaches now drawing on various disciplines. This paper surveys recent work: agent technology is first introduced, a theoretical framework for its use in creating music/sound art works put forward, and an overview of common approaches then given. Identifying areas of neglect in recent research, a possible direction for further work is then briefly explored. Finally, a vision for a new hybrid model that integrates non-linear, generative, conversational and affective perspectives on interactivity is proposed.
Advanced Preprocessing for Answer Set Solving
Authors: Martin Gebser Benjamin Kaufmann André Neumann Torsten Schaub
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

We introduce the first substantial approach to preprocessing in the context of answer set solving. The idea is to simplify a logic program while identifying equivalences among its relevant constituents. These equivalences are then used for building a compact representation of the program (in terms of Boolean constraints). We implemented our approach as well as a SAT-based technique to reduce Boolean constraints. This allows us to empirically analyze both preprocessing types and to demonstrate their computational impact.
Towards a uniform self-configuring virtual private network for workstations and clusters in grid computing
Authors: David Isaac Wolinsky, Yonggang Liu, Renato Figueiredo
Venue: Proceedings of the 3rd international workshop on Virtualization technologies in distributed computing (2009)

The rising popularity of grid computing makes the issues of growth, security, and access critical in deploying and maintaining well-functioning grid systems. Overlay networks (ON)provide a framework to deal with these issues, but current techniques impose limitations and administrative burdens such as manual configuration for each new system in the grid, installation and configuration of software. Additionally, current approaches lack methods of effectively merging clusters with individual workstations, usually focusing on either the grouping of distributed clusters or a desktop/workstation Grid. The main difference between the two scenarios is that in a cluster environment all machines share a common ON router, whereas in a workstation environment each machine has ON software. This paper presents a novel approach of self-configuring IP-based Virtual Private Networks (VPNs)1 overlays that support dynamic, seamless addition of new resources to the grid for both cluster and workstation platforms. The approach allows for bridging physical and virtual networking in clusters, in a manner that allows dynamic configuration of IP addresses while avoiding overlay routing among nodes within the same layer 2 network. To enable these features, the ON runs on top of a Peer-To-Peer (P2P) network that provides supports a distributed data store. IP addresses are dynamically allocated by a virtual DHCP server controlled by the ON router through atomic operations on the distributed data store. This atomic operation creates a mapping of an IP address to a P2P address that can later be used by the VPN and router to determine the host of an IP address. We have prototyped this approach, demonstrating the ability to seamlessly mix both workstation and cluster based approaches into a wide-area Condor pool.
Parts-Based Face Verification Using Local Frequency Bands
Authors: Christopher Mccool, Sébastien Marcel
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

In this paper we extend the Parts-Based approach of face verification by performing a frequency-based decomposition. The Parts-Based approach divides the face into a set of blocks which are then considered to be separate observations, this is a spatial decomposition of the face. This paper extends the Parts-Based approach by also dividing the face in the frequency domain and treating each frequency response from an observation separately. This can be expressed as forming a set of sub-images where each sub-image represents the response to a different frequency of, for instance, the Discrete Cosine Transform. Each of these sub-images is treated separately by a Gaussian Mixture Model (GMM) based classifier. The classifiers from each sub-image are then combined using weighted summation with the weights being derived using linear logistic regression. It is shown on the BANCA database that this method improves the performance of the system from an Average Half Total Error Rate of 24.38% to 15.17% when compared to a GMM Parts-Based approach on Protocol P.