ppxscal/embedding_network huggingface dataset:
Container-based operating system virtualization: a scalable, high-performance alternative to hypervisors
Authors: Stephen Soltesz, Herbert Pötzl, Marc E. Fiuczynski, Andy Bavier, Larry Peterson
Venue: ACM SIGOPS Operating Systems Review (2007)

Hypervisors, popularized by Xen and VMware, are quickly becoming commodity. They are appropriate for many usage scenarios, but there are scenarios that require system virtualization with high degrees of both isolation and efficiency. Examples include HPC clusters, the Grid, hosting centers, and PlanetLab. We present an alternative to hypervisors that is better suited to such scenarios. The approach is a synthesis of prior work on resource containers and security containers applied to general-purpose, time-shared operating systems. Examples of such container-based systems include Solaris 10, Virtuozzo for Linux, and Linux-VServer. As a representative instance of container-based systems, this paper describes the design and implementation of Linux-VServer. In addition, it contrasts the architecture of Linux-VServer with current generations of Xen, and shows how Linux-VServer provides comparable support for isolation and superior system efficiency.
An integrated first-year engineering curriculum at North Carolina State University
Authors: R. M. Felder, L. E. Bernold, E. E. Burniston, J. E. Gastineau, J. B. O'Neal
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

A pilot offering of an integrated freshman engineering curriculum took place at North Carolina State University in the 1994-95 academic year under the sponsorship of the National Science Foundation SUCCEED Coalition. In each semester the students took a calculus course, a physics course, and a one-credit engineering course, taught by a multidisciplinary team of professors. The instruction involved just-in-time presentation of fundamental material in the context of engineering problems and systems, hands-on experimentation and computer-based data analysis within most class sessions engineering design projects in each semester, extensive cooperative (team-based) learning, both in and out of class, and training in a variety of problem-solving, study, and communication skills. The paper outlines the curriculum structure and instructional approach, sketches the outcomes for the first year (detailed assessment and evaluation results will appear elsewhere), discusses obstacles to implementation of such integrated curricula, and suggests necessary conditions for overcoming the obstacles.
Inter-organizational Knowledge Transfer in the Buyer-Supplier Relationship: A Buyer's Perspective
Authors: Sung-Byung Yang, Young-Gul Kim
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

We delineate an integrative view of inter-organizational knowledge transfer (IOKT) in the upstream supply chain relationship from a buyer's perspective. For this purpose, we suggest that the concept of IOKT can be classified into the source and the recipient type of knowledge transfer according to the direction of knowledge flow. A three-stage model (motivation-behaviors-performance) is adopted to examine the relationships between IOKT and its antecedent factors, and, in turn, between IOKT and organizational performance. By analyzing 140 buyer-supplier relationships using the partial least squares (PLS) method, we verify our research hypotheses. The results show that each of these two sub-concepts of knowledge transfer has different motivational and resultant mechanism. In addition, we also consider information sharing as another key construct of IOKT-related behavior, examining its relationship with motivational and resultant factors. Contributions of this research and future research opportunities are also discussed.
An inline measurement method for capacity of end-to-end network path
Authors: L. Deri, G. Hasegawa, M. Murata
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

We previously proposed a new version of TCP, called inline measurement TCP (ImTCP), in Cao Le Thanh Man et al. (2004). The ImTCP sender adjusts the transmission intervals of data packets and then utilizes the arrival intervals of ACK packets for available bandwidth estimation. This type of active measurement is preferred because the obtained results are as accurate as those of other conventional types of active measurement, even though no extra probe traffic is injected onto the network. In the present research, we combine a new capacity measurement function with ImTCP in order to enable simultaneous measurement of both capacity and available bandwidth in ImTCP. The capacity measurement algorithm is a new packet-pair-based measurement technique that utilizes the estimated available bandwidth values for capacity calculation. This new algorithm promises faster measurement than current packet-pair-based measurement algorithms for various situations and works well for high-load networks, in which current algorithms do not work properly. Moreover, the new algorithm provides a confidence interval for the measurement result.
Hybrid simulation of deformable solids
Authors: Eftychios Sifakis, Tamar Shinar, Geoffrey Irving, Ronald Fedkiw
Venue: Proceedings of the 2007 ACM SIGGRAPH/Eurographics symposium on Computer animation (2007)

Although mesh-based methods are efficient for simulating simple hyperelasticity, maintaining and adapting a mesh-based representation is less appealing in more complex scenarios, e.g. collision, plasticity and fracture. Thus, meshless or point-based methods have enjoyed recent popularity due to their added flexibility in dealing with these situations. Our approach begins with an initial mesh that is either conforming (as generated by one's favorite meshing algorithm) or non-conforming (e.g. a BCC background lattice). We then propose a framework for embedding arbitrary sample points into this initial mesh allowing for the straightforward handling of collisions, plasticity and fracture without the need for complex remeshing. A straightforward consequence of this new framework is the ability to naturally handle T-junctions alleviating the requirement for a manifold initial mesh. The arbitrarily added embedded points are endowed with full simulation capability allowing them to collide, interact with each other, and interact with the parent geometry in the fashion of a particle-centric simulation system. We demonstrate how this formulation facilitates tasks such as arbitrary refinement or resampling for collision processing, the handling of multiple and possibly conflicting constraints (e.g. when cloth is nonphysically pinched between two objects), the straightforward treatment of fracture, and sub-element resolution of elasticity and plasticity.
Face recognition using discriminant eigenvectors
Authors: K. Etemad
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

The discriminatory power of different segments of a human face is studied end a new scheme for face recognition is proposed. We first focus on the linear discriminant analysis (LDA) of human faces in spatial and wavelet domains, which enables us to objectively evaluate the significant of visual information in different parts of the face for identifying the person. The results of this study can be compared with subjective psychovisual findings. The LDA of faces also provides us with a small set of features that carry the most relevant information for face recognition. The features are obtained through the eigenvector analysis of scatter matrices with the objective of maximizing between class variations and minimizing within class variations. The result is an efficient projection based feature extraction and classification scheme for recognition of human faces. For a midsize database of faces excellent classification accuracy is achieved with only four features.
TwoStick: writing with a game controller
Authors: Thomas Költringer, Poika Isokoski, Thomas Grechenig
Venue: Proceedings of Graphics Interface 2007 (2007)

We report the design and evaluation of a novel game controller text entry method called TwoStick. The design is based on the review of previous work and several rounds of pilot testing. We compared user performance with TwoStick experimentally to a selection keyboard which is the de facto standard of game controller text entry. Eight participants completed 20 fifteen-minute sessions with both text entry methods. In the beginning TwoStick was slower (4.3 wpm, uncorrected error rate = 0.68%) than the selection keyboard (5.6 wpm, 0.85%). During the last session TwoStick was faster (14.9 wpm, 0.86% vs. 12.9 wpm, 0.27%). Qualitative results indicated that TwoStick was more fun and easier to use than the selection keyboard.
A new tree widget for GTK+ 2.0
Authors: Jonathan Blandford
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

The GtkTreeView widget is a new widget for GTK+ 2.0. Designed in a Model/View controller fashion, it is highly flexible and capable. It allows multiple columns and custom rendering of cells, as well as specialized models.
Manipulating perceived social presence through the web interface and its impact on attitude towards online shopping
Authors: Khaled Hassanein, Milena Head
Venue: International Journal of Human-Computer Studies (2007)

Electronic commerce typically lacks human warmth and sociability, since it is more impersonal, anonymous and automated than traditional face-to-face commerce. This paper explores how human warmth and sociability can be integrated through the web interface to positively impact consumer attitudes towards online shopping. An empirical study was undertaken to investigate the impact of various levels of socially rich text and picture design elements on the perception of online social presence and its subsequent effect on antecedents of attitudes towards websites. Higher levels of perceived social presence are shown to positively impact the perceived usefulness, trust and enjoyment of shopping websites, leading to more favourable consumer attitudes. Implications of these finding for practitioners and future research are outlined.
Modeling spread of ideas in online social networks
Authors: Muhammad A. Ahmad, Ankur Teredesai
Venue: Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61 (2006)

Internet based online social networks collectively facilitate the spread of ideas. Hence, to understand how social networks evolve as a function of time, it is critical to learn the relationship between the information dissemination pathways or flows and the type of ideas being disseminated. We first classify the spread of ideas into two types based on their rate and nature of proliferation; fads and non-fads. A 'fad' refers to an idea that quickly becomes popular in a culture, remains popular for a brief period, and then loses popularity dramatically. We then model the information dissemination pathways for both these types of ideas. Our results indicate that the proliferation of information in a network strongly correlates with the the type of idea, the degree of participation of the nodes, and a node's availability i.e., presence. Further we derived that after reaching a certain saturation point, fad exhibits periodic spreading behavior implying that a fad rarely completely disappears from a network. We use data from an instant messaging network community to verify the proposed theoretical modeling framework.
Detecting Protein-Domains DNA-Motifs Association in Saccharomyces cerevisiae Regulatory Networks
Authors: Nawar Malhis, Kelvin Xi Zhang, BF Francis Ouellette
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

It is broadly known that conserved DNA sequences (e.g. cis-motifs in the upstream region of genes) and conserved sequences in the specific transcription factors that bind to them (i.e. protein domains) play a major role in the DNA binding process. These domain DNA binding interactions and other domain interactions such as protein-protein interactions play a critical role in the gene regulation process. To date, a number of investigations have been made, in first detecting protein domains and then detecting their functions and associated biological processes. With the rapid increase in the number of known DNA and protein sequences locating significant associations between protein domains and DNA motifs has become a valid approach for detecting their roles in the regulation process. Here we present our new approach to detecting associations between protein domains and DNA motifs in Saccharomyces cerevisiae based on Gene Ontology terms which can help biologists to generating different types of hypotheses.
VLR-Based Optimal Positioning of Resynchronization Markers
Authors: Yong Fang, Jechang Jeong
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Resynchronization makers (RM) are widely used in variable-length coding (VLC) bit stream to limit error propagation. However, the insertion of RMs introduces some decrease in coding efficiency unavoidably. To make a compromise between coding efficiency and error-resilience, this poster proposes a novel approach to the optimal RM positioning in which the valid-length ratio (VLR) is used as the measure of information. Hence, the optimization problem is converted into maximizing the VLR under a certain channel conditions.
Invited Talk: Zero-Programming Sensor Network Deployment
Authors: Karl Aberer, Manfred Hauswirth, Ali Salehi
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

The availability of cheap and smart wireless sensing devices provides unprecedented possibilities to monitor the physical world. On the technical side these devices introduce several original research problems, many of them related to the integration of the rampant technology proposals. Global Sensor Networks (GSN) is a platform which provides a scalable infrastructure for integrating heterogeneous sensor network technologies using a small set of powerful abstractions. GSN supports the integration and discovery of sensor networks and sensor data, provides distributed querying, filtering, and combination of sensor data, and offers dynamic adaption of the system configuration during operation through a declarative XML-based language, and enables zero-programming deployment and management.
Obtaining an outer approximation of the efficient set of nonlinear biobjective problems
Authors: José Fernández, Boglárka Tóth
Venue: Journal of Global Optimization (2007)

A new method for obtaining an outer approximation of the efficient set of nonlinear biobjective optimization problems is presented. It is based on the well known `constraint method', and obtains a superset of the efficient set by computing the regions of ¿-optimality of a finite number of single objective constraint problems. An actual implementation, which makes use of interval tools, shows the applicability of the method and the computational studies on a set of competitive location problems demonstrate its efficiency.
Secure method invocation in Jason
Authors: Richard Brinkman, Jaap-Henk Hoepman
Venue: Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5 (2002)

In this paper we describe the Secure Method Invocation (SMI) framework implemented for Jason, our Javacard As Secure Objects Networks platform. Jason realises the secure object store paradigm, that reconciles the card-as-storage-element and card-as-processing-element views. In this paradigm, smart cards are viewed as secure containers for objects, whose methods can be called straightforwardly and securely using SMI. Jason is currently being developed as a middleware layer that securely interconnects an arbitrary number of smart cards, terminals and back-office systems over the Internet.
Non-data aided joint estimation of carrier frequency offset and channel using periodic modulation precoders: performance analysis
Authors: E. Serpedin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Previous results have shown that blind channel estimators, which are robust to the location of channel zeros and channel order overestimation errors, can be derived for communication channels equipped with transmitted induced cyclostationarity (TIC) precoders. This paper addresses the problem of joint estimation of the unknown intersymbol interference (ISI) and carrier frequency offset using TIC-based set-ups. First, it is shown that the second-order cyclic statistics of the output allow recovery of the channel taps under a scaling factor ambiguity dependent on the unknown carrier offset frequency. Next, a carrier frequency estimator is proposed, and its asymptotic (large sample) performance is analyzed. It is shown that the asymptotic performance of the frequency estimator improves in the presence of a channel equalizer for high SNRs. Finally, numerical simulations are presented to collaborate the performance of proposed algorithms.
The computer attributes for learning scale (CALS) among university students: Scale development and relationship with actual computer use for learning
Authors: Johan van Braak, Penni Tearle
Venue: Computers in Human Behavior (2007)

The purpose of this study was twofold. First to develop an instrument, the computer attributes for learning scale (CALS) for assessing how university students perceive the attributes of computer use for learning, and secondly to examine the predictive value of the CALS in relation to the actual use students made of a computer for learning. The research was based on innovation diffusion theory, and was set in the context of higher education in Flanders, the Dutch speaking part of Belgium. The first step in the development of the computer attributes for learning scale, was to draw on the literature to determine a set of attributes which could be used in relation to the use of computers for learning. Secondly, working with a stratified sample of university students (n=237), exploratory factor analysis was used to develop a one-dimensional nine item-scale for measuring students' perceptions towards these specified attributes of a computer for learning. Next, using another similar stratified sample of the same size, confirmatory factor analysis was used to assess the stability of the one-factor structure. Finally, having developed the instrument, the predictive value of the CALS was assessed by examination of the relationship of the CALS with actual computer use for learning, when controlling for related computer variables, including computer self-efficacy, perceived usefulness of computers and computer use for personal purposes. The CALS was found to have a significant predictive value in terms of computer use for learning. In view of this it is argued that the CALS is an instrument which can be used in the future to assess the likely use students will make of a computer application in relation to their learning.
On the optimal working set size in serial and parallel support vector machine learning with the decomposition algorithm
Authors: Tatjana Eitrich, Bruno Lang
Venue: Proceedings of the fifth Australasian conference on Data mining and analystics - Volume 61 (2006)

The support vector machine (SVM) is a well-established and accurate supervised learning method for the classification of data in various application fields. The statistical learning task - the so-called training - can be formulated as a quadratic optimization problem. During the last years the decomposition algorithm for solving this optimization problem became the most frequently used method for support vector machine learning and is the basis of many SVM implementations today. It is characterized by an internal parameter called working set size. Usually small working sets have been assigned. The increasing amount of data used for classification led to new parallel implementations of the decomposition method with efficient inner solvers. With these solvers larger working sets can be assigned. It was shown, that for parallel training with the decomposition algorithm large working sets achieve good speedup values. However, the choice of the optimal working set size for parallel training is not clear. In this paper, we show how the working set size influences the number of decomposition steps, the number of kernel function evaluations and the overall training time in serial and parallel computation.
Innovating: the importance of right brain skills for computer science graduates
Authors: Alan L. Tharp
Venue: ACM SIGCSE Bulletin (2007)

This paper discusses the importance of teaching innovating skills in a computer science (CS) curriculum. The world is changing from a knowledge-based economy which depends upon the traditional left-brain skills to an innovation-based economy which relies more on right brain skills. The traditional skills taught in a CS curriculum remain very important to the success of its graduates. However, these skills now need to be augmented with innovating skills. The observations from teaching such a course and the plans for the future of the course are presented.
Reduced n-gram models for English and Chinese corpora
Authors: Le Q Ha, P Hanna, D W Stewart, F J Smith
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Statistical language models should improve as the size of the n-grams increases from 3 to 5 or higher. However, the number of parameters and calculations, and the storage requirement increase very rapidly if we attempt to store all possible combinations of n-grams. To avoid these problems, the reduced n-grams' approach previously developed by O'Boyle (1993) can be applied. A reduced n-gram language model can store an entire corpus's phrase-history length within feasible storage limits. Another theoretical advantage of reduced n-grams is that they are closer to being semantically complete than traditional models, which include all n-grams. In our experiments, the reduced n-gram Zipf curves are first presented, and compared with previously obtained conventional n-grams for both English and Chinese. The reduced n-gram model is then applied to large English and Chinese corpora. For English, we can reduce the model sizes, compared to 7-gram traditional model sizes, with factors of 14.6 for a 40-million-word corpus and 11.0 for a 500-million-word corpus while obtaining 5.8% and 4.2% improvements in perplexities. For Chinese, we gain a 16.9% perplexity reductions and we reduce the model size by a factor larger than 11.2. This paper is a step towards the modeling of English and Chinese using semantically complete phrases in an n-gram model.
Particle swarm optimization-based algorithms for TSP and generalized TSP
Authors: X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, Q. X. Wang
Venue: Information Processing Letters (2007)

A novel particle swarm optimization (PSO)-based algorithm for the traveling salesman problem (TSP) is presented. An uncertain searching strategy and a crossover eliminated technique are used to accelerate the convergence speed. Compared with the existing algorithms for solving TSP using swarm intelligence, it has been shown that the size of the solved problems could be increased by using the proposed algorithm. Another PSO-based algorithm is proposed and applied to solve the generalized traveling salesman problem by employing the generalized chromosome. Two local search techniques are used to speed up the convergence. Numerical results show the effectiveness of the proposed algorithms.