ppxscal/embedding_network huggingface dataset:
GridBatch: Cloud Computing for Large-Scale Data-Intensive Batch Applications
Authors: Huan Liu, Dan Orban
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

To be competitive, Enterprises are collecting and analyzing increasingly large amount of data in order to derive business insights. However, there are at least two challenges to meet the increasing demand. First, the growth in the amount of data far outpaces the computation power growth of a uniprocessor. The growing gap between the supply and demand of computation power forces Enterprises to parallelize their application code. Unfortunately,parallel programming is both time-consuming and error-prone. Second,the emerging Cloud Computing paradigm imposes constraints on the underlying infrastructure, which forces Enterprises to rethink their application architecture. We propose the GridBatch system, which aims at solving large-scale data-intensive batch problems under the Cloud infrastructure constraints. GridBatch is a programming model and associated library that hides the complexity of parallel programming,yet it gives the users complete control on how data are partitioned and how computation is distributed so that applications can have the highest performance possible. Through a real client example, we show that GridBatch achieves high performance in Amazon's EC2 computingCloud.
Thermal stability of Ni silicide films on heavily doped n+ and p+ Si substrates
Authors: Parhat Ahmet, Takashi Shiozawa, Koji Nagahiro, Takahiro Nagata, Kuniyuki Kakushima, Kazuo Tsutsui, Toyohiro Chikyow, Hiroshi Iwai
Venue: Microelectronic Engineering (2008)

Electrical and structural properties of Ni silicide films formed at various temperatures ranged from 200^oC to 950^oC on both heavily doped n^+ and p^+ Si substrates were studied. It was found that surface morphology as well as the sheet resistance properties of the Ni silicide films formed on n^+ and p^+ Si substrates at the temperatures higher than 600^oC were very different. Agglomerations of Ni silicide films on n^+ Si substrates begin to occur at around 600^oC while there is no agglomeration observed in Ni silicide films on p^+ Si substrates up to a forming temperature of 700^oC. It was also found that the phase transition temperature from NiSi phase to NiSi"2 phase depend on substrate types; 900^oC for NiSi film on n^+ Si substrate and 750^oC for NiSi film on p^+ Si substrate, respectively. Our results show that the agglomeration is, especially, important factor in the process temperature dependency of the sheet resistance of Ni silicides formed on n^+ Si substrates.
3D face verification using a free-parts approach
Authors: C. McCool, V. Chandran, S. Sridharan, C. Fookes
Venue: Pattern Recognition Letters (2008)

This paper proposes a novel approach to 3D face verification which divides the 3D face into separate parts. This method, termed 3D free-parts, considers each part of the face independently and consequently the spatial relationship is discarded for the purpose of obtaining many observations from each face. Experiments illustrate the validity of the face verification system where the distribution of features are modelled robustly using Gaussian Mixture Models. This approach demonstrates a significant improvement over the eigenfaces approach, lowering the false rejection rate from 9.83% to 4.48% at a false acceptance rate of 0.1%, in tests conducted on 3D face data from the face recognition grand challenge database.
A security domain model to assess software for exploitable covert channels
Authors: Alan B. Shaffer, Mikhail Auguston, Cynthia E. Irvine, Timothy E. Levin
Venue: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security (2008)

Covert channels can result in unauthorized information flows when exploited by malicious software. To address this problem, we present a precise, formal definition for covert channels, which relies on control flow dependency tracing through program execution, and extends Dennings' and subsequent classic work in secure information flow [9][40][30]. A formal security Domain Model (DM) for conducting static analysis of programs to identify covert channel vulnerabilities is described. The DM is comprised of an Invariant Model, which defines the generic concepts of program state, information flow, and covert channel rules; and an Implementation Model, which specifies the behavior of a target program. The DM is compiled from a representation of the program, written in a domain-specific Implementation Modeling Language (IML), and a specification of the security policy written in Alloy. The Alloy Analyzer tool is used to perform static analysis of the DM to automatically detect potential covert channel vulnerabilities and security policy violations in the target program.
Characterizing social cascades in flickr
Authors: Meeyoung Cha, Alan Mislove, Ben Adams, Krishna P. Gummadi
Venue: Proceedings of the first workshop on Online social networks (2008)

Online social networking sites like MySpace and Flickr have become a popular way to share and disseminate content. Their massive popularity has led to the viral marketing of content, products, and political campaigns on the sites themselves. Despite the excitement, the precise mechanisms by which information is exchanged over these networks are not well understood. In this paper, we investigate social cascades, or how information disseminates through social links in online social networks. Using real traces of 1,000 popular photos and a social network collected from Flickr, and a theoretical framework borrowed from epidemiology, we show that social cascades are an important factor in the dissemination of content. Our work provides an important first step in understanding how information disseminates in social networks.
Exploring and measuring dependency trees for informationretrieval
Authors: Chang Liu
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

Natural language processing techniques are believed to hold a tremendous potential to supplement the purely quantitative methods of text information retrieval. This has led to the emergence of a large number of NLP-based IR research projects over the last few years, even though the empirical evidence to support this has often been inadequate. Most contributions of NLP to IR mainly concentrate on document representation and compound term matching strategies. Researchers have noted that the simple term-based representation of document content such as vector representation is usually inadequate for accurate discrimination. The "bag of words" representation does not invoke linguistic considerations and allow modelling of relationships between subsets of words. However, even though a variety of content indicator such as syntactic phrase have been tried and investigated for representing documents rather than single terms in IR systems, the matching strategy over those representation still cannot go beyond traditional statistical techniques that measure term co-occurrence characteristics and proximity in analyzing text structure. In this paper, we propose a novel IR strategy (SIR) with NLP techniques involved at the syntactic level. Within SIR, documents and query representation are built on the basis of a syntactic data structure of the natural language text - the dependency tree, in which syntactic relationships between words are identified and structured in the form of a tree. In order to capture the syntactic relations between words in their hierarchical structural representation, the matching strategy in SIR upgrades from the traditional statistical techniques by introducing a similarity measure method executing on the graph representation level as the key determiner. A basic IR experiment is designed and implemented on the TREC data to evaluate if this novel IR model is feasible. Experimental results indicate that this approach has the potential to outperform the standard bag of words IR model, especially in response to syntactical structured queries.
Retrieval of Personal Web Documents by Extracting Subjective Expressions
Authors: Takahiro Hayashi, Koji Abe, Rikio Onai
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

This paper presents a method for gathering Japanese web documents which contain personal opinions. Our method is available as a pre-processing of applications for mining various opinions. In order to find personal documents on the Web, we focus on four kinds of subjective expressions: (1) negative meaning expressions, (2) final particles, (3) interjections, and (4) specific symbols such as face marks. Measuring the frequencies of these subjective expressions in a document, our method classifies web documents into personal and impersonal ones. Besides, our method gives the documents scores which show the accuracy of the classification results. We experimentally confirmed the effectiveness of the proposal using 1200 web documents. The experimental results have shown the precision and recall of the proposed classification are 0.70 and 0.87, respectively. In addition, we have confirmed that personal documents can be easily obtained by gathering documents which are given high scores.
A heuristic flow-decomposition approach for generalized processor sharing under self-similar traffic
Authors: Xiaolong Jin, Geyong Min
Venue: Journal of Computer and System Sciences (2008)

The well-known Generalized Processor Sharing (GPS) scheduling principle and its variants have received tremendous research efforts due to their appealing properties of fairness, traffic isolation, and work conservation. Traffic self-similarity is highly detrimental to the performance of scheduling mechanisms and communication networks. This paper proposes a novel and heuristic flow-decomposition approach to performance modeling of the GPS system under self-similar traffic. Based on the comprehensive analysis of the excess service sharing behavior of traffic flows, we decompose the GPS system equivalently into a group of single-server single-queue systems. Extensive simulation experiments are used to validate the correctness of the proposed flow-decomposition approach as well as the analytical performance results.
The characterization of zero-sum (mod 2) bipartite Ramsey numbers
Authors: Yair Caro, Raphael Yuster
Venue: Journal of Graph Theory (1998)

Let G be a bipartite graph, with k|e(G). The zero-sum bipartite Ramsey number B(G, Zk) is the smallest integer t such that in every Zk-coloring of the edges of Kt,t, there is a zero-sum mod k copy of G in Kt,t. In this article we give the first proof that determines B(G, Z2) for all possible bipartite graphs G. In fact, we prove a much more general result from which B(G, Z2) can be deduced: Let G be a (not necessarily connected) bipartite graph, which can be embedded in Kn,n, and let F be a field. A function f : E(Kn,n) &rarr; F is called G-stable if every copy of G in Kn,n has the same weight (the weight of a copy is the sum of the values of f on its edges). The set of all G-stable functions, denoted by U(G, Kn,n, F) is a linear space, which is called the Kn,n uniformity space of G over F. We determine U(G, Kn,n, F) and its dimension, for all G, n and F. Utilizing this result in the case F = Z2, we can compute B(G, Z2), for all bipartite graphs G. &copy; 1998 John Wiley & Sons, Inc. J. Graph Theory 29: 151&ndash;166, 1998
The Myths of E-Government: Looking Beyond the Assumptions of a New and Better Government
Authors: Victor Bekkers, Vincent Homburg
Venue: The Information Society (2007)

In general, rhetoric and myth play important roles in policymaking. Myths may inspire collective action but may also mystify and blur views on reality. In this article we identify, analyze, and reflect on the myths underlying the e-government programs of Australia, Canada, the United Kingdom, Denmark, and the Netherlands. We found that in all national policies myths of technological inevitability, a new and better government, rational information planning, and empowerment of the intelligent citizen can be discerned. Although the mobilizing powers of these myths are acknowledged, we conclude that existing empirical studies have generated little support for the inescapable telos of these myths, which makes canvas cleaning effects of e-government initiatives less likely.
DISSIMILAR SETS OF EXPERIENCE KNOWLEDGE STRUCTURE: A NEGOTIATION PROCESS FOR DECISIONAL DNA
Authors: Cesar Sanin, Edward Szczerbicki
Venue: Cybernetics and Systems (2007)

Set of Experience Knowledge Structure is a tool that can be a source and target of multiple technologies. It comprises variables, functions, constraints, and rules associated in a DNA shape allowing the construction of Decisional DNA. However, when having various dissimilar Sets of Experience as output of the same formal decision event, a negotiation and unification process has to be performed in order to generate a holistic Set of Experience. The purpose of this article is to show such processes and produce one holistic Set of Experience, making it an even more useful technology within many different intelligent systems and platforms.
Usability Comparison of Pen-Based Input for Young Children on Mobile Devices
Authors: Chih-Kai Chang
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

This research implements a system, primarily focusing on examining young children's capability of pen-based input on mobile devices, to compare accuracy of pointing-and-clicking and dragging-and-dropping dots with different sizes, locations, and spreads. Although traditional e-learning systems use a mouse as input device, the trend of the mobile learning bring the devices for mobile learning into classroom, such as tablet PC and PDA (Personal Digital Assistant). Because the conventional input devices, that are a mouse and a keyboard, is replaced with a touch screen or pen-based input device, understanding young children's capability on those novel input device, which is originally designed for an adult, is crucial for designing interface for kids on mobile devices. Two experiments of point-and-click and drag-and-drop were conducted to compare speed and error rate for children on tablet PC and PDA. The results show that children's capability of drag-and-drop by using a pen-based input is significantly worse than using a mouse. However, most children can precisely point-and-click any object larger than the width and height of 0.3 centimeter on both tablet PC and PDA. The overall usability of PDA is better than the tablet PC for young children in the experimental settings. Consequently, using pen-based input, even in a small screen size, with proper interface design could be a feasible method for young children in a mobile learning activity.
Approximation algorithms for co-clustering
Authors: Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by several applications in text mining, market-basket analysis, and bioinformatics, this problem has attracted severe attention in the past few years. Unfortunately, to date, most of the algorithmic work on this problem has been heuristic in nature. In this work we obtain the first approximation algorithms for the co-clustering problem. Our algorithms are simple and obtain constant-factor approximation solutions to the optimum. We also show that co-clustering is NP-hard, thereby complementing our algorithmic result.
pNFS/PVFS2 over InfiniBand: early experiences
Authors: Lei Chai, Xiangyong Ouyang, Ranjit Noronha, Dhabaleswar K. Panda
Venue: Proceedings of the 2nd international workshop on Petascale data storage: held in conjunction with Supercomputing '07 (2007)

The computing power of clusters has been rapidly growing up towards petascale capability, which requires petascale I/O systems to provide data in a sustained high-throughput manner. Network File System (NFS), a ubiquitous standard used in most existing clusters, has shown performance bottleneck associated with the single server model. pNFS, a parallel version of NFS, has been proposed in this context to eliminate the performance bottleneck while maintain the ease of management and interoperability features of NFS. With InfiniBand being one of the most popular high speed networks for clusters, whether pNFS can pick up the advantages of InfiniBand is an interesting and important question. It is also important to quantify and understand the potential benefits of using pNFS compared with the single server NFS, and the possible overhead associated with pNFS. However, since pNFS is relatively new, few such study has been carried out in an InfiniBand cluster environment. In this paper we have designed and carried out a set of experiments to study the performance and scalability of pNFS, using PVFS2 as the backend file system. The aim is to understand the characteristics of pNFS, and its feasibility as the parallel file system solution for clusters. From our experimental results we observer that pNFS can take advantages of high speed networks such as InfiniBand, and achieve up to 480% improvement in throughput compared with using GigE as the transport. pNFS can eliminate the single server bottleneck associated with NFS. pNFS/PVFS2 shows significantly higher throughput and better scalability compared with NFS/PVFS2. pNFS/PVFS2 achieves peak write throughput about 490MB/s, and read throughput about 2250MB/s, with 4 I/O servers. With 8 I/O servers, the numbers are 754MB/s and 3100MB/s. Further, we find that pNFS adds little overhead and achieves almost the same throughput as the backend file system PVFS2. Our results indicate that pNFS is promising as the parallel file system solution for clusters.
Taming the situationist beast
Authors: Lucian Leahu, Jennifer Thom-Santelli, Claudia Pederson, Phoebe Sengers
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

The interplay between arts and HCI has become increasingly commonplace in the past years, offering new opportunities for approaching interaction, but also raising challenges in integrating methods and insights from across a great disciplinary divide. In this paper, we examine the ways Situationist art practice has been used as an inspiration for HCI design. We argue that methods from Situationist art practice have often been picked up without regard for their underlying sensibility: reflection and improvisation in an activist socio-political context. We describe an experiment in incorporating Situationist sensibility in design and use it to elucidate the challenges that face HCI in truly integrating the arts.
Coupling Analysis of Regional Economic Structure System
Authors: Yi-xin Zhang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Regional economic structure system is an exoteric self-organization system with dissipation structure and high-step, multi-variables, multi-loops and nonlinear feedback structure. On the basis of the qualitative analysis of coupling relations of subsystems in regional economic structure system, considering Heilongjiang province as the example, the paper establishes the model applying system dynamics method. By means of this model, the operating mechanism of regional economic structure system is studied. Some results have been concluded: the error is little between simulative value and true value, which means that the model could represent the performance of regional economic structure system and the obtained strategic conclusions can give reference to the future regulation.
Secure Delegation Model based on SAML in Ubiquitous Environments
Authors: Kyu Il Kim, Hae Kyung Lee, Ung Mo Kim
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Ubiquitous environment is a post-desktop model of human-computer interaction in which information processing has been thoroughly integrated into everyday objects and activities. But hacker attack one of fragile point and can misuse legitimate user privilege because all of the connected devices provide services for the user control and monitoring in real time. Also, the users of web services must temporarily delegate some or all of their rights to agents in order to perform actions on their behalf. This fact risks the exposure of user privacy information. In this paper, we propose secure delegation model based on SAML that provides confidentiality and integrity about the user information in ubiquitous environment. The proposed mechanism defines extended agent delegation by Security Assertion Markup Language (SAML) and proposes not only authentication but also privilege grant by access control server based on eXtensible Access Control Markup Language (XACML).
Evolution by Communication: A Revision of Sperm-Mediated Gene Transfer
Authors: Andrew V. Kuznetsov
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

The role of sperm-mediated gene transfer (SMGT) in the development and evolution is poorly understood. The possibility of constructive approach, high-throughput "omic' data extraction, modelling and simulation are considered to make a next step in SMGT research. The complex program to study this phenomenon is proposed.
Reflection on development and delivery of a data mining unit
Authors: Bozena Stewart
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

Educators developing data mining courses face a difficult task of designing curricula that are adaptable, have solid foundations, and are tailored to students from different academic fields. This task could be facilitated by debating and sharing the ideas and experiences gained from the practice of data mining as well as from teaching data mining. The shared body of knowledge would be a valuable resource which would help educators design better data mining curricula. The aim of this paper is to make a contribution to such a debate. The paper presents a reflection and evaluation of the author's experience with developing and delivering a postgraduate unit Knowledge Discovery and Data Mining.
P4-decompositions of regular graphs
Authors: Katherine Heinrich, Jiping Liu, Minli Yu
Venue: Journal of Graph Theory (1999)

In this article, we show that every simple r-regular graph G admits a balanced P4-decomposition if r &equiv; 0(mod 3) and G has no cut-edge when r is odd. We also show that a connected 4-regular graph G admits a P4-decomposition if and only if |E(G)| &equiv; 0(mod 3) by characterizing graphs of maximum degree 4 that admit a triangle-free Eulerian tour. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31: 135&ndash;143, 1999