ppxscal/embedding_network huggingface dataset:
Data Sandboxing: A Technique for Enforcing Confidentiality Policies
Authors: Tejas Khatiwala, Raj Swaminathan, V. N. Venkatakrishnan
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

When an application reads private / sensitive infor- mation and subsequently communicates on an output channel such as a public file or a network connection, how can we ensure that the data written is free of private information? In this paper, we address this question in a practical setting through the use of a technique that we call "data sandboxing" . Essentially, data sandboxing is implemented using the popular technique of system call interposition to mediate output channels used by a pro- gram. To distinguish between private and public data, the program is partitioned into two: one that contains all the instructions that handle sensitive data and the other containing the rest of the instructions. This parti- tioning is performed based on techniques from program slicing. When run together, these two programs collec- tively replace the original program. To address confi- dentiality, these programs are sandboxed with different system call interposition based policies. We discuss the design and implementation of a tool that enforces con- fidentiality policies on C programs using this technique. We also report our experiences in using our tool over several programs that handle confidential data.
A Mobile Peer-to-Peer Application for Distributed Recommendation and Re-Sale of Music
Authors: Jurgen Nutzel, Mario Kubek
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

This paper describes a mobile application, which was originally designed as an extension for the PotatoSystem [1], which is a distribution system for virtual goods with the focus on digital music. Its innovative idea is that buyers can become resellers and earn a provision for redistributing purchased files. With the "Mobile Music Messenger", a J2ME application for modern mobile phones, users can find other users with similar musical taste to sell them own songs or to find new pleasing music for themselves. The distributed recommendation algorithm uses the peer-to-peer system JXTA while avoiding a central database. Users may pre-listen recommended songs and contact each other. These functions are embedded in a music chat system, whose future enhancements will be covered as well. The application can be extended to function for all mobile music providers. The mobile users of all partaking mobile music stores will become mobile affiliate community.
Swara Indentification for South Indian Classical Music
Authors: Rajeswari Sridhar, T. V. Geetha
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

This paper deals with the identification of the swaras in a given Carnatic song, which is an essential component, needed for raga identification of South Indian Classical - Carnatic music. Raga is a representation of the possible swaras that can occur in a given Carnatic song. This paper first deals with the segmentation of Carnatic vocal music and then attempts to find the pitch associated with each segment. We propose a two level segmentation algorithm to yield the probable swara segments. For each segment, pitch information is extracted to find the frequency of that particular segment. The fundamental frequency associated with the music signal conveys the overall pitch of the singer, which in turn corresponds to the middle octave swara 'Sa'. The frequencies associated with the segments are identified and the exact tagging of swara is performed to find the 7-swara combinations in the given music signal.
Running a Production Grid Site at the London e-Science Centre
Authors: David McBride, Marko Krznaric, Olivier van der Aa, Mona Aggarwal, John Darlington, Dave Colling
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

This paper describes how the London e-Science Centre cluster MARS, a production 400+ Opteron CPU cluster, was integrated into the production Large Hadron Collider Compute Grid. It describes the practical issues that we encountered when deploying and maintaining this system, and details the techniques that were applied to resolve them. Finally, we provide a set of recommendations based on our experiences for grid software development in general that we believe would make the technology more accessible.
A Secure and Efficient Large Scale Distributed System for Data Sharing
Authors: Giorgio Zanin, Luigi Vincenzo Mancini
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

In this paper we consider a large distributed system in which data is shared among several users. Specifically, we present a secure adaptive algorithm for data fragment allocation on multiple nodes of the system. The algorithm handles (replicated) data fragments, stored by nodes without the need of encryption, in such a way to ease information sharing. Data confidentiality is guaranteed in the presence of passive and active attacks, and fragments are dynamically reallocated/replicated in the system to converge, under assumptions of regularity of the read-write activity, to an allocation that provably guarantees highest performance in terms of network load.
Research on IT outsourcing based on IT systems management
Authors: Jiang Hongxun, Du Honglu, Ye Xiang, Su Jun
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

To adapt to changing market conditions and intense competition more quickly than ever before, enterprises can not help equipping more and more new IT applications continuously. But new challenges emerged. Most of enterprises lack for IT technique and experience which result to ruin. In this environment, IT outsourcing is a new solution for the development and management of IT applications. However, once lack of a comprehensive IT systems management, IT outsourcing is hard to come true. This paper first briefly introduced concepts, functions and significances of IT outsourcing and IT systems management. Then it was proposed that IT systems management was the key factors to determine whether IT outsourcing succeed or not. The execution of IT Outsourcing based on IT Systems Management was emphasized by a workflow consist of three main performable phases. Present research challenges and future research trends were discussed at last.
A Replication Model for Trading Data Integrity against Availability
Authors: Johannes Osrael, Lorenz Froihofer, Karl M. Goeschka
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Higher availability and better performance of datacentric applications can be achieved by replication of objects or data items. If data integrity, a correctness criterion for such systems, needs to be maintained even during degraded situations (node or link failures) the system soon becomes (partially) unavailable. However, some applications exist (e.g., in control engineering) where data integrity can be relaxed for higher availability during degraded situations. Traditional replication models do not support the balancing of these two properties. In this paper1, we present a novel replication model that (i) allows replicas to diverge if data integrity can be temporarily relaxed and (ii) re-establishes both replica consistency and data integrity during repair time.
Towards clustering of incomplete microarray data without the use of imputation
Authors: Dae-Won Kim, Ki-Young Lee, Kwang H. Lee, Doheon Lee
Venue: Bioinformatics (2007)

Motivation: Clustering technique is used to find groups of genes that show similar expression patterns under multiple experimental conditions. Nonetheless, the results obtained by cluster analysis are influenced by the existence of missing values that commonly arise in microarray experiments. Because a clustering method requires a complete data matrix as an input, previous studies have estimated the missing values using an imputation method in the preprocessing step of clustering. However, a common limitation of these conventional approaches is that once the estimates of missing values are fixed in the preprocessing step, they are not changed during subsequent processes of clustering; badly estimated missing values obtained in data preprocessing are likely to deteriorate the quality and reliability of clustering results. Thus, a new clustering method is required for improving missing values during iterative clustering process. Results: We present a method for Clustering Incomplete data using Alternating Optimization (CIAO) in which a prior imputation method is not required. To reduce the influence of imputation in preprocessing, we take an alternative optimization approach to find better estimates during iterative clustering process. This method improves the estimates of missing values by exploiting the cluster information such as cluster centroids and all available non-missing values in each iteration. To test the performance of the CIAO, we applied the CIAO and conventional imputation-based clustering methods, e.g. k-means based on KNNimpute, for clustering two yeast incomplete data sets, and compared the clustering result of each method using the Saccharomyces Genome Database annotations. The clustering results of the CIAO method are more significantly relevant to the biological gene annotations than those of other methods, indicating its effectiveness and potential for clustering incomplete gene expression data. Availability: The software was developed using Java language, and can be executed on the platforms that JVM (Java Virtual Machine) is running. It is available from the authors upon request. Contact: dwkim@cau.ac.kr
BGP-like TE Capabilities for SHIM6
Authors: Marcelo Bagnulo, Alberto Garcia-Martinez, Arturo Azcorra
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

In this paper we present a comprehensive set of mechanisms that restore to the site administrator the capacity of enforcing Traffic Engineering (TE) policies in a multiaddressed IPv6 scenario. The mechanisms rely on the ability of SHIM6 to securely perform locator changes in a transparent fashion to transport and application layers. Once an outgoing path has been selected for a communication by proper routing configuration in the site, the source prefix of SHIM6 data packets is rewritten by the site routers to avoid packet discarding due to ingress filtering. The SHIM6 locator preferences exchanged in the context establishment phase are modified by the site routers to influence in the path used for receiving traffic. Scalable deployment is ensured by the stateless nature of these mechanisms.
XShreX: Maintaining Integrity Constraints in the Mapping of XML Schema to Relational
Authors: Qiuju Lee, Stephane Bressan, Wenny Rahayu
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

As XML becomes a serious candidate medium for the management and interchange of critical enterprise data, more attention to the issue of data integrity maintenance is needed. We propose a mapping of XML to relational that takes into account the integrity constraints expressed in XML Schema. We present a an extension, called XShreX, of the ShreX mapping. We report the preliminary results of a comparative performance analysis using a mainstream commercial relational database management system. The results suggest that the extension of ShreX does not come at a prohibitive cost for insertions, deletions, updates and queries. In the case of queries, XShreX can even yield a performance improvement.
Addressing the memory bottleneck in packet processing systems
Authors: Harrick M. Vin
Venue:  (2006)

The design of packet processing systems is guided by two requirements: (1) high packet processing throughput, and (2) ease-of-programming. Meeting these two requirements simultaneously has proved to be challenging primarily because, packet processing aggravates the well-known problem of memory bottleneck. To overcome the memory bottleneck, today's packet processing systems support a wide-range of mechanisms such as exposed memory hierarchy, multithreading, and non-blocking multi-word accesses. However, supporting many such mechanisms without clear guidelines for their usage complicates programmability and wastes system resources. In this dissertation, we ask two fundamental questions: (1) what minimal set of mechanisms should a packet processing system support to simultaneously achieve the goals of high throughput and ease-of-programming? and (2) how should one allocate common system resources such as chip area and off chip memory bandwidth to these competing mechanisms? We make three contributions. First, we demonstrate that the minimal set must include data caches and multithreading for two reasons: (1) contrary to the widely-held belief, packet processing exhibits considerable data locality and (2) relying exclusively on either data locality or packet-level parallelism leads to low packet throughput. Second, we demonstrate that no fixed configuration of caches and multithreading works well across a spectrum of deployments (combinations of application, workload, and system characteristics). Achieving high throughput in all cases requires a malleable architecture that allows deployments to trade off resources between data caching and multithreading. Third, we develop such a malleable architecture based on a novel predictive register prefetcher that efficiently overlaps the execution of a thread with the thread-switch. Our predictor is accurate and imposes no significant overheads. We demonstrate that for the same chip area and memory bandwidth, our architecture achieves four times the throughput of current commercial systems. We argue that our architecture simplifies programmability. Data caches, unlike the mechanisms used today, are transparent to programmers and compilers. Farther, our architecture eliminates the need for explicit thread scheduling as threads can be switched on cache misses. Thus, our approach simultaneously achieves both, high throughput and ease-of-programming. In addition, our findings lay the foundation for managing data accesses in the broader class of high-throughput, request-processing systems.
O-Key: A Scoopable Interface
Authors: Chiemi Tanabe, Masahito Hirakawa
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Nowadays computers are considered a common tool for everyday activities, including document management and message communication. This in turn requests us to care- fully design computers so that anyone can use them without any special skill. Augmented/mixed reality and tangible in- terface would be promising toward the development of such daily use interface systems. In this paper, we propose a new interface which is named O-Key. O-Key allows the user with his/her hands to scoop up objects which are virtually floating on the water in a bucket. A certain function associated with the selected ob- jects is activated. An experiment showed that the proposed interface works effectively. Possible application scenarios of the interface system are also presented.
An Efficiency Criterion for 2D Shape Model Selection.
Authors: Kathryn Leonard
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We propose efficiency of representation as a criterion for evaluating shape models, then apply this criterion to compare the boundary curve representation with the medial axis. We estimate the å-entropy of two compact classes of curves. We then construct two adaptive encodings for noncompact classes of shapes, one using the boundary curve and the other using the medial axis, and determine precise conditions for when the medial axis is more efficient. Along the way we construct explicit near-optimal boundarybased approximations for compact classes of shapes and an explicit compression scheme for non-compact classes of shapes based on the medial axis. We end with an application of the criterion to shape data.
Fast Random Walk with Restart and Its Applications
Authors: Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance score between two nodes in a weighted graph, and it has been successfully used in numerous settings, like automatic captioning of images, generalizations to the "connection subgraphs", personalized PageRank, and many more. However, the straightforward implementations of RWR do not scale for large graphs, requiring either quadratic space and cubic pre-computation time, or slow response time on queries. We propose fast solutions to this problem. The heart of our approach is to exploit two important properties shared by many real graphs: (a) linear correlations and (b) blockwise, community-like structure. We exploit the linearity by using low-rank matrix approximation, and the community structure by graph partitioning, followed by the Sherman- Morrison lemma for matrix inversion. Experimental results on the Corel image and the DBLP dabasets demonstrate that our proposed methods achieve significant savings over the straightforward implementations: they can save several orders of magnitude in pre-computation and storage cost, and they achieve up to 150x speed up with 90%+ quality preservation.
Response-Selection-Related Parietal Activation during Number Comparison
Authors: Silke M. Göbel, Heidi Johansen-berg, Tim Behrens, Matthew F.S. Rushworth
Venue: Journal of Cognitive Neuroscience (2004)

Neuroimaging studies of number comparison have consistently found activation in the intraparietal sulcus (IPS). Recently, it has been suggested that activations in the IPS vary with the distance between the numbers being compared. In number comparison, the smaller the distance between a number and the reference the longer the reaction time (RT ). Activations in the right or left IPS, however, have also been related to attentional and intentional selection. It is possible, therefore, that activity in this region is a reflection of the more basic stimulus and response-selection processes associated with changes in RT. This fMRI experiment investigated the effect of numerical distance independently from RT. In addition, activations during number comparison of single-digit and double-digit stimuli were compared. During number comparison blocks, subjects had to indicate whether digits were greater or smaller than a reference (5 or 65). In control blocks, they were asked to perform a perceptual task (vertical line present/absent) on either numerical or nonnumerical stimuli. Number comparison versus rest yielded a large bilateral parietal-posterior frontal network. However, no areas showed more activation during number comparison than during the control tasks. Furthermore, no areas were more active during comparison of numbers separated by a small distance than comparisons of those separated by a large distance or vice versa. A left-lateralized parietal-posterior frontal network varied significantly with RT. Our findings suggest that magnitude and numerical-distance-related IPS activations might be difficult to separate from fundamental stimulus and response-selection processes associated with RT changes. As is the case with other parameters, such as space, magnitude may be represented in the context of response selection in the parietal cortex. In this respect, the representation of magnitude in the human IPS may be similar to the representation of magnitude in other nonhuman primates.
Virtual teamwork in very large undergraduate classes
Authors: P. M. Alexander
Venue: Computers Education (2006)

Collaborative work is an important part of tertiary education but it is very difficult to arrange and supervise for extremely large classes of students in their first year. The possibility that computer-mediated communication can be used to facilitate this type of learning is appealing from a pragmatic organisational point of view. This paper explains in detail what a 'virtual team' is in the educational context. It reports on an interpretive field study where students taking an introductory course were allowed to choose where and when they did the required collaborative work. The paper discusses the factors that should be taken into account when offering students the option of working as a virtual team. These include factors that influence the students' choice. The project cannot be considered to have been successful but indicates reasons for the lack of success and suggests contexts in which it would be valuable to repeat the project. The importance of extensive preparation in terms of teaching the students necessary social and technological skills cannot be over emphasised.
Collaboration and Community Grids
Authors: Geoffrey Fox
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

We study Grid architectures and relate them to the ideas of collaboration and community networks. We discuss services and architectural principles that support both synchronous and asynchronous collaboration and the integration with community networks and peer-to-peer systems. We identify 18 core features and services that characterize Grid systems. We conclude with a proposed Semantic Scholars' Grid integrating these concepts to support information discovery and sharing in communities of users.
Using High-Level Petri Nets for Hierarchical Grid Workflows
Authors: Martin Alt, Sergei Gorlatch, Andreas Hoheisel, Hans-Werner Pohl
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

An increasingly popular application programming model for Grids is to deploy often-used functionalities as remote services on high-performance hosts, following the principles of a service-oriented architecture. Complex applications are created by using several services and specifying a workflow between them. We discuss how workflows of Grid applications can be described easily as High-Level Petri Nets (HLPN), in order to orchestrate and execute distributed applications on the Grid automatically. In order to simplify the handling of complex and large-scale workflows, we introduce hierarchical Grid workflows, making use of the Petri Net refinement paradigm that allows to represent sub-workflows by single graph elements. We show how a complex application, the Barnes-Hut algorithm for N-Body simulation can be expressed as a hierarchical HLPN, using our platform-independent, XML-based Grid Workflow Description Language (GWorkflowDL). We discuss how the GWorkflowDL can be adapted to current Grid technologies, in particular to Java/RMI and the recent WSRF framework.