ppxscal/embedding_network huggingface dataset:
A RM-Based Static Deployment System for Cluster
Authors: Weiguo Wu, Leiqiang Zhang, Lei Wang, Zhenghua Xue
Venue: International Journal of Distributed Sensor Networks (2009)

In this paper, a Reliable-Multicast (RM) based static deployment system for cluster is designed which can be functionally divided into three parts: image capture, image transference, and node configuration. Image capture takes the snapshot of the operating system in the source node. Image transference distributes the captured image to target nodes. Node configuration mainly finishes the configuration of some identified information to target nodes. Applying the technology of Image-Based Installation [1] and an idea of separating the operating system image from service software, this system solves the tedious problems involved when the large-scale cluster is divided into a number of functional pools; using the network transmit model of RM, this system reduces the cost of network bandwidth and significantly improves the efficiency in deployment; combining WOL [2] and PXE [3], the system provides the function of single control point and lightens the workload of the system administrator. So this system can solve the problems of current cluster deployment mechanisms, such as inefficiency, imperfection of automated node configuration, and only supporting the Linux-based operating system deployment, etc. The deployment system consists of the deployment server, image servers, and target nodes. The deployment server is the core of the entire deployment system, which provides DHCP and TFTP service to ensure that the deployment control program can finish the deployment of target nodes after the cluster nodes start up from the NIC. Image servers mainly store the images and applications which can be accessed by the deployment server or target nodes by the NFS service. Target nodes are the nodes which need to be deployed in the cluster. Before the deployment process, the image of the source node and the service environment of the deployment server and image server should be prepared. During the deployment, the target node communicates with the deployment server by using PXE and WOL, and then the deployment server deploys the corresponding image and application service to the target nodes through the RM method. Finally, the target nodes finish their configurations. In the same experimental environment, some experiments respectively for this system, clonesys, and a deployment system identified by X have been built. As proved in experiments, this system can build a cluster more quickly and efficiently.
Breadth-last technical electives: integrating the CS core via computer games and mobile robotics
Authors: William W. White, Jerry B. Weinberg
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

In this paper, we introduce the concept of breadth-last technical elective courses, which are designed to assist undergraduate CS students in integrating their entire core curriculum into a coherent whole at the end of their degree programs. Specific breadth-last courses in intelligent mobile robotics and computer game development have been implemented and are presented here to demonstrate the pedagogical concepts being discussed.
Generalizing Trust: Inferencing Trustworthiness from Categories
Authors: Rino Falcone, Cristiano Castelfranchi
Venue: Trust in Agent Societies: 11th International Workshop, TRUST 2008, Estoril, Portugal, May 12 -13, 2008. Revised Selected and Invited Papers (2008)

In this paper, starting from a socio-cognitive model of trust,we analyze how it is possible to predict how/when an agent whotrusts something/ someone will therefore trust something/someoneelse, before and without a direct experience. On the contrary ofmodels of trust just based on (or reduced to) a probability indexor a simple measure of experience and frequency, we are interestedto analyze the trust concept so that we are able to cope withproblems like: a) given X&rsquo;s evaluation about Y&rsquo;strustworthiness on a specific task &tau;, what can we say onX&rsquo;s evaluation about Y&rsquo;s trustworthiness on a differentbut analogous task &tau;&rsquo;? What would we intend for ananalogous task? b) Given X&rsquo;s evaluation about Y&rsquo;strustworthiness on a specific task &tau;, what can we say onX&rsquo;s evaluation about the trustworthiness of a different agentZ on the same task &tau;? In fact, in our view only a cognitivemodel of trust, with its analytical power, seems able to accountfor the inferential generalization of trustworthiness from task totask and from agent to agent not just based on specific experienceand/or learning.
Configuring and Using CATS
Authors: Manuel Gallardo
Venue:  (2008)

This complete guide to effectively configuring CATS provides detailed explanations of Special Approvals and customizing for Duet, along with detailed steps for setting up CATS to fulfill the many complex configuration requirements. Details on each CATS User-exit and tips on what functionality can or cannot be accomplished with particular User-exits is also included . In addition, the author provides in-depth guidance for how to prevent and correct performance problems, answers to frequently asked questions, tips for audit report development, and much more. Readers will explore how to perform frequently used activities, such as recording time or executing a CATS report directly from Microsoft Office and discover the key steps you can take to avoid or correct some of the most common causes for the slowdown of some CATS transactions. You'll learn how to effectively use the Business Application Programming Interfaces (BAPIs) provided by CATS to exchange time data with external systems and master the Import/Export functionality and how to increase the efficiency of the approval process by implementing rules for automatic time approvals. In addition, you'll uncover how best to customize the approval report with your own data fields and messages to facilitate the entire process. Highlights include: Customizing CATS for Duet CATS Performance and Support Tools Special Approval Techniques Importing and Extracting CATS Data Actual Labor Costing Deploying User-exits and BAdIs
Enhanced bandwidth-delay based routing algorithm for a packet-switched virtual call centre environment
Authors: Akinbola Adetunji, Hadi Larijani
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Traditionally call centres were based on circuit-switched systems. But with the advancement of communication technologies, call centres have shifted to packet-switched systems. This packet-switched system aids the creation of virtual Call Centre Environments. The current dynamic routing algorithms used for circuit-switched systems do not fully support packet-switched virtual call centre environments. We addressed this issue in this paper by developing a new call routing algorithm capable of supporting this type of virtual environments. This was done by performing a comparison study on our hybrid routing algorithm, Enhanced Bandwidth-Delay Based Routing Algorithm. Our hybrid routing algorithm was compared with a commonly used call routing algorithm known as Minimum Expected Delay. We used both analytical and simulation methods to achieve our goal of comparison study. Call centre data collected from a real-call centre was utilised to aid our model development, validation and scenario generation. The results from this study concluded that under high traffic arrival rates, systems running EBDRA outperforms MED by possessing a lower probability of delay.
Animated database courseware (ADbC): interactive instructional materials to support the teaching of database concepts
Authors: Meg Murray, Mario Guimaraes
Venue: Journal of Computing Sciences in Colleges (2009)

Understanding database concepts and acquiring capabilities in database technologies are necessary skills for any student of computing. However, there are many obstacles to teaching an introductory database course including prioritizing the many important database concepts, incorporating new technologies into an already full curriculum and supporting students who find the topic challenging. Interactive instructional materials such as animations can often be incorporated into the instructional process to enhance and enrich the teaching/learning process. This workshop presents an overview of a set of animated database courseware materials (referred to as ADbC) and explores how these materials might be utilized in a database course. The ADbC courseware, being developed as part of an NSF CCLI grant, currently includes over 100 animations categorized into modules covering database design, SQL, transactions and database security. The courseware has been made freely available and may be accessed at http://adbc.kennesaw.edu
Use of Webster's Seventh New Collegiate Dictionary to construct a master hyphenation list
Authors: James L. Peterson
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

A machine-readable form of Webster's Seventh New Collegiate Dictionary has been obtained. After substantial processing to understand the form and content of the dictionary and to correct residual typographical errors, we have begun the task of constructing a master word-hyphenation list based on this dictionary and other sources. Substantial problems can arise in preparing the master hyphenation list because of incompatible hyphenation definitions from various sources. Some statistics are given.
Spirit-III: an advanced relational database machine introducing a novel data-staging architecture with Tuple Stream Filters to preprocess relational algebra
Authors: Noriyuki Kamibayashi, Kazuo Seo
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

This paper proposes an advanced architecture of the relational database machine (RDBM), named SPIRIT-III, which is basically organized into a three-level memory hierarchy with a sophisticated data-staging and preprocessing architecture for executing relational algebra. SPIRIT-III aims at totally improving both I/O and CPU processing boundary problems and has two major architectural features. One is the introduction of the relational-database-oriented data-staging mechanism, called the look-ahead data-staging mechanism, which can optimally schedule data movement in the memory hierarchy. The other is to attach refined preprocessing mechanisms for relational algebra operations to data transfer lines connected between each memory stage. When a relation stages up or down in the memory hierarchy, these preprocessing mechanisms can function to select tuples and attributes needed by a query and to arrange the relation for parallel processing. SPIRIT-III provides three basic preprocessing filters, called as a whole the Tuple Stream Filter: the tuple selector, the attribute selector, and the grouping filter, implemented with a hash function, which rearranges an original relation and groups the relation into subrelations. The operation of this grouping filter is the primitive preprocessing operation for executing Join and Projection. Then, without the overhead of interprocessor communications, each microprocessor can execute relational algebra operations to a few subsegments assigned to it in parallel. Therefore, SPIRIT-III can perform Join and Projection operations by O (N/L) (L = number of microprocessors), whereas the early RDBMs required O (N X N/L). The proposed SPIRIT-III, which includes features from data-staging architecture to relational algebra execution architecture under the total concept, is the most powerful RDBM based on the state of the art.
Dimensionality reduced HRTFs: a comparative study
Authors: Bill Kapralos, Nathan Mekuz, Agnieszka Kopinska, Saad Khattak
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Dimensionality reduction is a statistical tool commonly used to map high-dimensional data into lower a dimensionality. The transformed data is typically more suitable for regression analysis or classification than the original data. Being of high dimensionality, HRTF data is commonly reduced using Principal Components Analysis (PCA). While highly effective at compressing data that follows the assumed model, PCA compression performance suffers when data follows a nonlinear distribution or when outliers are present. More recent data reduction techniques such as Isomap and locally linear embedding (LLE) take advantage of local neighborhood information in order to learn a more suitable basis for the HRTF data at hand. Quantitative results from previous work indicate that the embedding created by both LLE and Isomap are superior to those obtained with PCA. This paper presents a study that compares sound source localization accuracy by human observers when presented with a virtual sound synthesized using HRTFs whose dimensionality was reduced using either Isomap, LLE or PCA. Preliminary results indicate that good sound source localization judgement is obtainable using dimensionality reduced HRTFs and that Isomap and LLE produce superior results thus, confirming previous quantitative results.
Huge Data But Small Programs: Visualization Design via Multiple Embedded DSLs
Authors: D. J. Duke, R. Borgo, M. Wallace, C. Runciman
Venue: Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages (2009)

Although applications of functional programming are diverse, most examples deal with modest amounts of data --- no more than a few megabytes. This paper describes how Haskell has been used to address a challenging astrophysics visualization problem, where the complete uncompressed dataset is nearly a terabyte. Our solution makes extensive use of three novel domain-specific languages: to specify data resources, to abstract over rendering operations, and most significantly, to design the desired visualization. The result is a powerful framework for time-varying multi-field visualization. This approach represents a significant departure from standard practices in the visualization field, and has application well beyond the original problem. That our solution consists of less than 4.5K lines of code is itself a notable result. This paper motivates and describes the overall architecture of our solution, and technical features of the DSLs that are used in place of the traditional visualization pipeline.
Parallel query processing on distributed clustering indexes
Authors: Veronica Gil-Costa, Mauricio Marin, Nora Reyes
Venue: Journal of Discrete Algorithms (2009)

Similarity search has been proved suitable for searching in large collections of unstructured data objects. A number of practical index data structures for this purpose have been proposed. All of them have been devised to process single queries sequentially. However, in large-scale systems such as Web Search Engines indexing multi-media content, it is critical to deal efficiently with streams of queries rather than with single queries. In this paper we show how to achieve efficient and scalable performance in this context. To this end we transform a sequential index based on clustering into a distributed one and devise algorithms and optimizations specially tailored to support high-performance parallel query processing.
A design of microwave resonator
Authors: A. A. Sulaiman, M. F. Ain, S. I. S. Hassan, A. Othman, M. A. Othman, N. Z. Ahmad, Z. I. Khan, N. H. Baba, M. H. Jusoh, R. Awang
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

A microwave resonator has been designed with the aid of GENESYS software and the circuit was fabricated on Roger microstrip with dielectric constant of 3.48. A combination of two congruent coupled line sections was used to resonate at 1.8 GHz. The discrepancies between measure and simulated result of half-power bandwidth was due to the size of the gap between the two conductors. Such structure has advantage to design ultra-narrowband filter. Some simulation and experimental results have been compared and presented in this paper.
A Shape Representation with Elastic Quadratic Polynomials--Preservation of High Curvature Points under Noisy Conditions
Authors: Toshiro Kubota
Venue: International Journal of Computer Vision (2009)

We present a new shape representation technique for a planar shape using overlapping quadratic splines. The technique refines the shape by iteratively updating each spline to reduce the cost associated with C 1 discontinuity. It consists of a series of affine commutative linear operators, producing a smooth bandpass frequency response. The primary purpose of the technique is to remove minute high-curvature points while preserving salient ones. We compare the performance of the technique against those that are based on either linear splines, cubic splines, or wavelets. We consider three criteria: sensitivity of detecting salient high-curvature points, Hausdorff distance between the representation and the original shape, and computation time. The results show that the proposed technique is highly effective in preserving salient high curvature points with a relatively small Hausdorff distance and a computational cost.
Dynamic Resource Allocation in Wireless FadingChannels: A Convex Optimization Approach
Authors: Rui Zhang
Venue:  (2008)

This dissertation looks at the problem of dynamic resource allocation (DRA) in both single-user and multi-user wireless fading channels. This dissertation investigates various key issues on implementation of DRA in wireless systems, such as delay constraint, algorithm complexity, feedback overhead, transceiver structure, and fairness between users, among others. This dissertation demonstrates the usefulness of convex optimization techniques for solving DRA problems in wireless fading channels. First, this dissertation studies the capacity limits and power-control policies for the single-user fading channel. Second, for the MIMO-OFDM channel, this dissertation presents a closed-loop extension of the well-known vertical Bell Labs layered space-time (V-BLAST) architecture whereby the receiver jointly optimizes the power and rate assignments for transmit antennas and then returns them to the transmitter. Third, this dissertation investigates the information-theoretic limits of multiuser, fading, multiple-access channel (MAC). This dissertation draws an interesting dual relationship between power and capacity regions of Gaussian MAC.
DPLM: a novel application-layer routing scheme for low delay VoIP
Authors: Xiaofei Liao, Hai Jin, Lili Zhu
Venue: Proceedings of the 4th Asian Conference on Internet Engineering (2008)

In order to achieve low delay services in VoIP, we can use application-layer routing scheme, which is to find proper relay nodes to intermediate voice packets from the source peer to the destination peer. The difficulty of the scheme is how to find the proper relay nodes, which we call relay problem. This paper presents a new application-layer routing scheme, called DPLM, to resolve relay problem. We introduced the mechanism in detail, and evaluated our mechanism in NS2 network simulation environment and got a high relay node hit ratio result, which confirms the feasibility of a real system. Also we make a comparison with traditional schemes, and the results show that DPLM scheme has good performances.
Label-based access control (LBAC) in DB2 LUW
Authors: Walid Rjaibi
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

data at the row and/or column level based on security labels. Unlike traditional implementations of mandatory access control (e.g., Multilevel Security), the DB2 LBAC capability allows you to tailor the security label definition to best suit your application specific needs. In DB2 LBAC, a security label does not have to be a rigid structure made up of two components (level and compartments). DB2 LBAC allows you to construct the security label type that best suits your application needs from a predefined set of security label components. DB2 then chooses and applies the appropriate access control rules based on the types of the security label components. DB2 LBAC integrates well with other DB2 capabilities and can be combined with such capabilities to offer an even stronger security. For example, you can combine LBAC with any of the data partitioning capabilities available in DB2 such as Multi-Dimensional Clustering (MDC), Data Partitioning Facility (DPF), or table partitioning to increase security by having data from different security levels stored on different data partitions (e.g., the most secure data on the most secure partition). You can also combine LBAC with XML to provide document level access control based on security labels. 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
DICE: designing conference rooms for usability
Authors: Gene Golovchinsky, Pernilla Qvarfordt, Bill van Melle, Scott Carter, Tony Dunnigan
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

One of the core challenges now facing smart rooms is supporting realistic, everyday activities. While much research has been done to push forward the frontiers of novel interaction techniques, we argue that technology geared toward widespread adoption requires a design approach that emphasizes straightforward configuration and control, as well as flexibility. We examined the work practices of users of a large, multi-purpose conference room, and designed DICE, a system to help them use the room's capabilities. We describe the design process, and report findings about the system's usability and about people's use of a multi-purpose conference room.
Efficient top-k count queries over imprecise duplicates
Authors: Sunita Sarawagi, Vinay S Deshpande, Sourabh Kasliwal
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

We propose efficient techniques for processing various Top-K count queries on data with noisy duplicates. Our method differs from existing work on duplicate elimination in two significant ways: First, we dedup on the fly only the part of the data needed for the answer --- a requirement in massive and evolving sources where batch deduplication is expensive. The non-local nature of the problem of partitioning data into duplicate groups, makes it challenging to filter only those tuples forming the K largest groups. We propose a novel method of successively collapsing and pruning records which yield an order of magnitude reduction in running time compared to deduplicating the entire data first. Second, we return multiple high scoring answers to handle situations where it is impossible to resolve if two records are indeed duplicates of each other. Since finding even the highest scoring deduplication is NP-hard, the existing approach is to deploy one of many variants of score-based clustering algorithms which do not easily generalize to finding multiple groupings. We model deduplication as a segmentation of a linear embedding of records and present a polynomial time algorithm for finding the R highest scoring answers. This method closely matches the accuracy of an exact exponential time algorithm on several datasets.