ppxscal/embedding_network huggingface dataset:
Expert-Driven Knowledge Discovery
Authors: Tristan Ling, Byeong Ho Kang, David P. Johns, Justin Walls, Ivan Bindoff
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Knowledge Discovery techniques find new knowledge about a domain by analysing existing domain knowledge and examples of domain data. These techniques typically involve using a human expert and automated software analysis (Data Mining). Often the human expertise is used initially to choose which data is processed, and then finally to determine which results are relevant. However studies have noted that some domains contain data stores too extensive and detailed, and existing knowledge too complex, for effective data selection or efficient Data Mining. A different approach is suggested which involves the human expert more pervasively, taking advantage of their expertise at each step, while using Data Mining techniques to assist in discovering data trends and in verifying the expert’s findings. Preliminary results suggest that the approach can be successfully applied to discover new knowledge in a complex domain, and reveal many potential areas for research and development.
KeyGraph-based chance discovery for mobile contents management system
Authors: Kyung-Joong Kim, Myung-Chul Jung, Sung-Bae Cho
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

Chance discovery provides a way to find rare but very important events for future decision making. It can be applied to stock market prediction, earthquake alarm, intrusion detection and social community evolution modeling. Similarly, contents management procedure can be regarded as a new application of chance discovery. By combining context information with contents, user's trivial behavior at a specific area can result in sudden photo creation, long-time mp3 listening, and going to specific area for content creation. Using chance discovery, such novel situation can be modeled and predictable. Recently mobile devices are regarded as a content storage with their functions such as camera, camcorder, and music player. It creates massive new data and downloads contents from desktop or wireless internet. Because of the massive size of digital contents in the mobile devices, user feels difficulty to recall or find information from the personal storage. We propose a KeyGraph-based reorganization method of mobile device storage for better accessibility to the data based on chance discovery. It can help user not only find useful information from the storage but also refresh his/her memory by using the summary of novel events. User can recall his/her memory from the contents and contexts. Using artificially generated logs from a pre-defined scenario, the proposed method is tested and analyzed to check the possibility.
Design methodology for configurable analog to digital conversion using support vector machines
Authors: V. Girish, Jayadeva, S. Nooshabadi
Venue: Microelectronics Journal (2008)

We apply a support vector machine (SVM) classifier to the design of analog to digital converters. Each output bit of the converter is the output of a binary classifier, which is a nonlinear SVM. The classifier effectively learns a folding characteristic for each bit, which is realized as the weighted sum of a set of kernel functions. In our proposal, the kernel does not need to be symmetric or positive definite, unlike in the case of a conventional SVM. This makes the approach more amenable to VLSI design, where such constraints are hard to satisfy. The SVM uses a set of binary weights, which allows the folding characteristics to be digitally corrected after fabrication. This facility is of considerable value in analog design in a deep sub micron era, where simulation models do not adequately capture the behavior of devices, or their variations. The proposed methodology reduces design time, can be automated and calibrated for process variations and ageing, by changing a set of digital scaling coefficients.
Polyomino coloring and complex numbers
Authors: Jurijs Kirillovs
Venue: Theoretical Computer Science (2008)

Usually polyominoes are represented as subsets of the lattice Z^2. In this paper we study a representation of polyominoes by Gaussian integers. Polyomino {(x"1,y"1),(x"2,y"2),...,(x"s,y"s)}@?Z^2 is represented by the set {(x"1+iy"1),(x"2+iy"2),...,(x"s+iy"s)}@?Z[i]. Then we consider functions of type f:P->G from the set P of all polyominoes to an abelian group G, given by f(x,y)=(x+iy)^m(modv), where v is prime in Z[i],1@?m
Application of Grid computing for designing a class of optimal periodic nonuniform sampling sequences
Authors: Andrzej Tarczynski, Tamas Kiss, Gabor Tersztyanszki, Thierry Delaitre, Dongdong Qu, Stephen Winter
Venue: Future Generation Computer Systems (2008)

Designing periodic nonuniform sampling sequences for digital alias free signal processing is a computationally extensive problem where sequential single computer based solutions could easily run for days or even weeks. In order to reduce computation time, the sequential algorithm needed to be parallelized making it possible to execute parts of the calculations on different nodes of a computational Grid at the same time, reducing the overall runtime of the application. This paper presents and compares two different Grid based implementations representing the two main Grid approaches at the moment. The first solution utilizes a production Grid environment based on GEMLCA and the P-Grade Grid portal, and the second represents a BOINC desktop Grid-based solution.
Design and analysis of a low power wireless portable media player
Authors: Wen-Yew Liang, Hung-Che Lee, Yang-Lang Chang, Jyh-Perng Fang, Jywe-Fei Fang
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

For most Portable Media Player (PMP), the demands for large storage space and longer working time usually can not be satisfied at the same time. In this paper, a low power wireless LAN based PMP called WiPMP is proposed. WiPMP is basically a diskless PMP. Instead, it can retrieve a large number of multimedia data from a remote storage device wirelessly. A prototype of WiPMP has been realized on an Intel Xscale embedded platform with Embedded Linux as the operating system. A systematic power measurement and analysis method is used in this paper to evaluate the prototype from the perspective of power consumption. The result shows that WiPMP does consume less power and is able to access much more multimedia data than the hard disk based PMP.
A Formal and Practical Framework for Constraint-Based Routing
Authors: Stefano Bistarelli, Francesco Santini
Venue: Proceedings of the Seventh International Conference on Networking (2008)

We propose a formal model to represent and solve the Constraint-Based Routing problem in networks. To attain this, we model the network adapting it to a weighted or graph (unicast delivery) or and-or graph (multicast delivery), where the weight on a connector corresponds to the cost of sending a packet on the network link modelled by that connector. We use the Soft Constraint Logic Programming (SCLP) framework as a convenient declarative programming environment in which to solve the routing problem. In particular, we show how the semantics of an SCLP program computes the best route in the corresponding graph. At last, we provide an implementation of the framework over scale-free networks.
Character play: the use of game characters in multi-player role-playing games across platforms
Authors: Anders Tychsen, Michael Hitchens, Thea Brolund
Venue: Computers in Entertainment (CIE) (2008)

Avatars are a commonly used mechanism for representing the player within the world of a game. The avatar forms the main point of interaction between the player and the game, and thus the avatar is an important game design feature. Character-based games combine the concept of an avatar with that of a character, enhancing the avatar with specific features that commonly are changeable, and which can be defined within or outside the framework of the game rules. Within digital games, the rules-based features have received comparatively more attention than, for example, the personalities and background histories of game characters. This article presents results from a comprehensive empirical study of the way complex game characters are utilized by players in multiplayer role-playing games across two different media platforms. The results indicate that adult players are capable of comprehending and utilizing game characters with well-defined personalities and backgrounds, as well as rules-based components. Furthermore, that the game format plays a significant role in the pattern of usage of the character elements. This pattern appears directly linked with variations in the way that the different game formats handle player characters and activate or promote the activation of, different forms of character elements. The degree to which different character elements are activated also has implications for the degree of player engagement in the character.
Application of the data mining techniques to the systems biology of neuritogenesis
Authors: Z. Q. Zhang, A. R. Kammerdiner, S. Busygin, A. K. Ottens, S. F. Larner, F. H. Kobeissy, P. M. Pardalos, R. L. Hayes, K. K. Wang
Venue: Optimization Methods Software (2007)

A recent breakthrough in application of experimental methods to biomedicine not only has already resulted in accumulation of massive amounts of data, but also created new challenges in the field of data mining. This paper addresses the issue by combining advanced data mining techniques with the novel application of systems biology t o study axonal regeneration and neurogenesis. To obtain the data for analysis, a series of biological experiments are conducted, in which the rat pheochromocytoma cell PC-12 was used as an appropriate model for neuronal differentiation. The resulting DNA microarray data set is studied using a combination of methods-a statistical procedure for feature selection together with a dimensionality reduction technique. First, we apply feature selection, which can be based either on the Wilcoxon rank-sum test, or on the two-sample t-test, depending on the statistical properties of the data. Next, we utilized an efficient dimensionality reduction procedure called correspondence analysis to obtain a two-dimensional projection of the data, which allows us to perform a visual exploration of the patterns as well as to select the features corresponding to the top down-regulated and up-regulated genes.
Acceptance and use of electronic library services in ugandan universities
Authors: Prisca K.G. Tibenderana, Patrick J. Ogao
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

University libraries in Developing Countries (DCs), hampered by developmental problems, find it hard to provide electronic services. Donor communities have come in to bridge this technology gap by providing funds to university libraries for information technology infrastructure, enabling these university libraries to provide electronic library services to patrons. However, for these services to be utilized effectively, library end-users must accept and use them. To investigate this process in Uganda, this study modifies "The Unified Theory of Acceptance and Use of Technology" (UTAUT) by replacing "effort expectancy" and "voluntariness" with "relevancy", "awareness" and "benefits" factors. In so doing, we developed the Service Oriented UTAUT (SOUTAUT) model whose dependent constructs predict 133% of the variances in user acceptance and use of e-library services. The study revealed that relevancy moderated by awareness plays a major factor in acceptance and use of e-library services in DCs.
The validation and analysis of component-based metadata integration
Authors: Raymond Wu
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

Component decision and validation using political and analytical models are applicable in creating the foundation of component-based enterprise architecture. This research deals with both political and analytical models to take the results from the group decision for further development. We demonstrate how to use analysis and modeling techniques to produce the common component and service aggregation which is the foundation of enterprise integration. Decision input from human factors plays a crucial role in component-based design. We have extended the focus of the methods and techniques to component decision in supporting enterprise integration and ontology interoperability, to follow the nature of business performance. As we believe human interactivity in this early analysis and pre-design stage plays a key role in the integration's success, we have assessed the feasibility and received the consensus of the pre-design stage of industry.
Violator spaces: Structure and algorithms
Authors: B. Gärtner, J. Matoušek, L. Rüst, P. Škovroň
Venue: Discrete Applied Mathematics (2008)

Sharir and Welzl introduced an abstract framework for optimization problems, called LP-type problems or also generalized linear programming problems, which proved useful in algorithm design. We define a new, and as we believe, simpler and more natural framework: violator spaces, which constitute a proper generalization of LP-type problems. We show that Clarkson's randomized algorithms for low-dimensional linear programming work in the context of violator spaces. For example, in this way we obtain the fastest known algorithm for the P-matrix generalized linear complementarity problem with a constant number of blocks. We also give two new characterizations of LP-type problems: they are equivalent to acyclic violator spaces, as well as to concrete LP-type problems (informally, the constraints in a concrete LP-type problem are subsets of a linearly ordered ground set, and the value of a set of constraints is the minimum of its intersection).
Anomalies in Internet Law
Authors: Pieter Kleve, Richard De Mulder
Venue: International Review of Law, Computers and Technology (2007)

Modern information technology has brought a flood of new possibilities to communicate with other people anywhere in the world and to send each other music, videos, texts and pictures. Rather than just enjoying these new possibilities, many governments, companies and even individuals try to stop others from using these new technologies to their full potential. In response to these new technologies, national governments (as well as the EU) have introduced a confusing system of new rules. Not only are these new rules often ineffective and even contradictory, they in turn create problems. In order to protect intellectual property rights, e.g., they have accepted that the content providers could introduce new technologies that harm the property rights of consumers: the so-called Digital Rights Management systems. When it became apparent, however, that these technologies were not effective, more new rules were introduced, not to solve the problem of the legal protection of intellectual property rights, but to make it illegal to try to circumvent digital rights management techniques. In this paper, an attempt is made to identify the anomalies referred to here, to explain them and to suggest some new ways for governments, firms and individuals to deal with new technologies.
UBIGIouS: a ubiquitous, mixed-reality geographic information system
Authors: Daniel Porta, Jan Conrad
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

Moving in virtual environments has become very common. On the one hand there are e.g. non-interactive route guidance systems which are not adequate for pedestrians. On the other hand interactive applications like Second Life fascinate a broad community. This work presents the information system UBIGIouS that combines reality with virtuality in an interactive mixed reality scenario. It is intended to link Virtual Reality Geographic Information Systems with purely virtual interactive applications. For ubiquitous access, users can participate from their homes by standard, stationary PCs or on site using mobile devices like smartphones. By means of visual building recognition capabilities UBIGIouS offers location-based services with or without positioning via the Global Positioning System GPS.
Exploiting connector knowledge to efficiently disseminate highly voluminous data sets
Authors: Chris A. Mattmann, David Woollard, Nenad Medvidovic
Venue: Proceedings of the 3rd international workshop on Sharing and reusing architectural knowledge (2008)

Ever-growing amounts of data that must be distributed from data providers to consumers across the world necessitate a greater understanding of the software architectural implications of choosing data movement technologies. Currently, this understanding is mired in the minds of software architects who have been there before, and who rely on past intuition and choices, failing to properly document their rationale and context. In this paper we describe a software architecture-based decision making framework called DISCO for selecting data movement technologies, or software connectors. DISCO effectively captures (traditionally undocumented) insight, observation and ultimately architectural knowledge about the connectors, demonstrating the effectiveness of using such information to accurately encode the connector selection decision making process
Tail bounds for occupancy and the satisfiability threshold conjecture
Authors: A. Kamath, R. Motwani
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

The classical occupancy problem is concerned with studying the number of empty bins resulting from a random allocation of m balls to n bins. We provide a series of tail bounds on the distribution of the number of empty bins. These tail bounds should find application in randomized algorithms and probabilistic analysis. Our motivating application is the following well-known conjecture on threshold phenomenon for the satisfiability problem. Consider random 3-SAT formulas with cn clauses over n variables, where each clause is chosen uniformly and independently from the space of all clauses of size 3. It has been conjectured that there is a sharp threshold for satisfiability at c*/spl ap/4.2. We provide the first non-trivial upper bound on the value of c*, showing that for c>4.758 a random 3-SAT formula is unsatisfiable with high probability. This result is based on a structural property, possibly of independent interest, whose proof needs several applications of the occupancy tail bounds.
Risk Management for Collaborative Software Development
Authors: Mojgan Mohtashami, Thomas Marlowe, Vassilka Kirova, Fadi P. Deek
Venue: The EDP Audit, Control, and Security Newsletter (2007)

Collaborative software development involving multiple organizational units, often spanning national, language, and cultural boundaries, raises new challenges and risks that can derail software development projects even when traditional risk factors are being controlled. This article presents a framework that can be used to manage collaborative software development projects, based on an extended set of risk management principles. Three risk factors-trust, culture, and collaborative communication-are discussed in depth.
Approximate bivariate gamma generator with prespecified correlation and different marginal shapes
Authors: Simon Rosenfeld
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2008)

A new algorithm is proposed for generating approximate bivariate gamma random samples with a prespecified correlation coefficient and different marginal shapes. A distinctive feature of this approach is computational simplicity and ease of control. Extensive testing demonstrates high accuracy of the proposed algorithm. An S-PLUS code implementing the algorithm is provided. Regression lines produced by the technique are nearly linear, even when marginal shapes are drastically different. This feature makes the approach especially useful in simulation studies associated with linear regression problems. A real-life example of application to the analysis of heteroscedastic regression models is presented. This analysis is a part of a bigger study aimed at quantification of risk factors in cancer research. Two-dimensional probabilistic patterns produced by the algorithm are compared to those generated by the well-known technique by Schmeiser and Lal [1982].
A fuzzy analytic network process based approach to transportation-mode selection between Turkey and Germany: A case study
Authors: Umut R. Tuzkaya, Semih Önüt
Venue: Information Sciences: an International Journal (2008)

A case study examining the different modes for transportation of freight by a Turkish logistics-service provider company is presented herein. A number of conflicting qualitative and quantitative criteria exist for evaluating alternative modes of transport. Qualitative criteria are often accompanied by ambiguity and vagueness. To cope with ambiguity and vagueness problem, the fuzzy analytic network process (ANP) method has been used. A large number of detailed criteria that interact with each other have been evaluated and synthesized to obtain the most suitable transportation mode. This evaluation has been carried out by a group of decision makers coming from different management levels and functional areas in the sector of logistics and from the service company with intent to provide a more accurate and mutually acceptable solution. Furthermore, the model used here has been validated by comparing the results obtained with the current preferences of the company.
Complete subdivision algorithms, II: isotopic meshing of singular algebraic curves
Authors: Michael Burr, Sung Woo Choi, Benjamin Galehouse, Chee K. Yap
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

Given a real function f(X,Y), a box region B and ε>0, we want to compute an ε-isotopic polygonal approximation to the curve C: f(X,Y)=0 within B. We focus on subdivision algorithms because of their adaptive complexity. Plantinga & Vegter (2004) gave a numerical subdivision algorithm that is exact when the curve C is non-singular. They used a computational model that relies only on function evaluation and interval arithmetic. We generalize their algorithm to any (possibly non-simply connected) region B that does not contain singularities of C. With this generalization as subroutine, we provide a method to detect isolated algebraic singularities and their branching degree. This appears to be the first complete numerical method to treat implicit algebraic curves with isolated singularities.
Algorithm 886: Padua2D---Lagrange Interpolation at Padua Points on Bivariate Domains
Authors: Marco Caliari, Stefanode Marchi, Marco Vianello
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

We present a stable and efficient Fortran implementation of polynomial interpolation at the Padua points on the square [&thinsp;&minus;&thinsp;1,1]2. These points are unisolvent and their Lebesgue constant has minimal order of growth (log square of the degree). The algorithm is based on the representation of the Lagrange interpolation formula in a suitable orthogonal basis, and takes advantage of a new matrix formulation together with the machine-specific optimized BLAS subroutine for the matrix-matrix product. Extension to interpolation on rectangles, triangles and ellipses is also described.