ppxscal/embedding_network huggingface dataset:
Triangulation and embedding using small sets of beacons
Authors: Jon Kleinberg, Aleksandrs Slivkins, Tom Wexler
Venue: Journal of the ACM (JACM) (2009)

Concurrent with recent theoretical interest in the problem of metric embedding, a growing body of research in the networking community has studied the distance matrix defined by node-to-node latencies in the Internet, resulting in a number of recent approaches that approximately embed this distance matrix into low-dimensional Euclidean space. There is a fundamental distinction, however, between the theoretical approaches to the embedding problem and this recent Internet-related work: in addition to computational limitations, Internet measurement algorithms operate under the constraint that it is only feasible to measure distances for a linear (or near-linear) number of node pairs, and typically in a highly structured way. Indeed, the most common framework for Internet measurements of this type is a beacon-based approach one chooses uniformly at random a constant number of nodes (&ldquo;beacons&rdquo;) in the network, each node measures its distance to all beacons, and one then has access to only these measurements for the remainder of the algorithm. Moreover, beacon-based algorithms are often designed not for embedding but for the more basic problem of triangulation, in which one uses the triangle inequality to infer the distances that have not been measured. Here we give algorithms with provable performance guarantees for beacon-based triangulation and embedding. We show that in addition to multiplicative error in the distances, performance guarantees for beacon-based algorithms typically must include a notion of slack&mdash;a certain fraction of all distances may be arbitrarily distorted. For metric spaces of bounded doubling dimension (which have been proposed as a reasonable abstraction of Internet latencies), we show that triangulation-based distance reconstruction with a constant number of beacons can achieve multiplicative error 1 + &delta; on a 1 &minus; &epsi; fraction of distances, for arbitrarily small constants &delta; and &epsi;. For this same class of metric spaces, we give a beacon-based embedding algorithm that achieves constant distortion on a 1 &minus; &epsi; fraction of distances; this provides some theoretical justification for the success of the recent Global Network Positioning algorithm of Ng and Zhang [2002], and it forms an interesting contrast with lower bounds showing that it is not possible to embed all distances in a doubling metric space with constant distortion. We also give results for other classes of metric spaces, as well as distributed algorithms that require only a sparse set of distances but do not place too much measurement load on any one node.
A large dataset for the evaluation of ontology matching
Authors: Fausto Giunchiglia, Mikalai Yatskevich, Paolo Avesani, Pavel Shivaiko
Venue: The Knowledge Engineering Review (2009)

Recently, the number of ontology matching techniques and systems has increased significantly. This makes the issue of their evaluation and comparison more severe. One of the challenges of the ontology matching evaluation is in building large-scale evaluation datasets. In fact, the number of possible correspondences between two ontologies grows quadratically with respect to the numbers of entities in these ontologies. This often makes the manual construction of the evaluation datasets demanding to the point of being infeasible for large-scale matching tasks. In this paper, we present an ontology matching evaluation dataset composed of thousands of matching tasks, called TaxME2. It was built semi-automatically out of the Google, Yahoo, and Looksmart web directories. We evaluated TaxME2 by exploiting the results of almost two-dozen of state-of-the-art ontology matching systems. The experiments indicate that the dataset possesses the desired key properties, namely it is error-free, incremental, discriminative, monotonic, and hard for the state-of-the-art ontology matching systems.
Throughput Constraint for Synchronous Data Flow Graphs
Authors: Alessio Bonfietti, Michele Lombardi, Michela Milano, Luca Benini
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

Stream (data-flow) computing is considered an effective para-digm for parallel programming of high-end multi-core architectures for embedded applications (networking, multimedia, wireless communication). Our work addresses a key step in stream programming for embedded multicores, namely, the efficient mapping of a synchronous data-flow graph (SDFG) onto a multi-core platform subject to a minimum throughput requirement. This problem has been extensively studied in the past, and its complexity has lead researches to develop incomplete algorithms which cannot exclude false negatives. We developed a CP-based complete algorithm based on a new throughput-bounding constraint. The algorithm has been tested on a number of non-trivial SDFG mapping problems with promising results.
Information technology in social entrepreneurship: the role and the reality
Authors: Diana Burley
Venue: ACM SIGCAS Computers and Society (2009)

Social entrepreneurship is increasingly seen as a critical component of the global conversation on volunteerism and civic engagement. The purpose of this article is to lay the groundwork for a larger conversation on the role of information technology in social entrepreneurship by summarizing the discussions among participants of a recent conference on the subject. Social networking and information sharing were identified as the most critical roles of IT in support of social entrepreneurship. However, in order to realize the full potential of these roles, conference participants suggested that four key challenges must be addressed: access, capacity, commonality, and the scholar-practitioner link.
Mobile Python: Rapid prototyping of applications on the mobile platform
Authors: Jrgen Scheible, Ville Tuulos
Venue:  (2007)

Mobile Python is the introduction of Python programming language to the mobile space. This practical hands-on book teaches readers how to realize their application ideas on the Symbian OS. Programming on the Symbian mobile platform has been difficult and time consuming in the past. This innovative new title will remedy this problem. Chapters deal with topics that are based on Python S60 features and presented in an order that lets the user learn first the simple to code ones and then increasing in complexity.
Word Sense Induction Using Graphs of Collocations
Authors: Ioannis P. Klapaftis, Suresh Manandhar
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

Word Sense Induction (WSI) is the task of identifying the different senses (uses) of a target word in a given text. Traditional graph-based approaches create and then cluster a graph, in which each vertex corresponds to a word that co-occurs with the target word, and edges between vertices are weighted based on the co-occurrence frequency of their associated words. In contrast, in our approach each vertex corresponds to a collocation that co-occurs with the target word, and edges between vertices are weighted based on the co-occurrence frequency of their associated collocations. A smoothing technique is applied to identify more edges between vertices and the resulting graph is then clustered. Our evaluation under the framework of SemEval-2007 WSI task shows the following: (a) our approach produces less sense-conflating clusters than those produced by traditional graph-based approaches, (b) our approach outperforms the existing state-of-the-art results.
Experimental and theoretical research of dimensional and roughness variation of high concentrated ceramic alumium oxide presintering after final sintering process
Authors: Horatiu Bulea, Rodica Paunescu
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

Starting from the tendency to produce materials of more and more performance, with superior properties, which assures high quality and low costs, the purpose of this research is to determine the dimensional and roughness variation of high concentrated aluminum oxid semipresinterisated after the final sintering process, through mathematical modelation useing regression functions.
Formal Methods for Web Services: 9th International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2009, Bertinoro, ... / Programming and Software Engineering), 1st edition
Authors: Marco Bernardo, Luca Padovani, Gianluigi Zavattaro
Venue:  (2009)

This book presents a set of 8 papers accompanying the lectures of leading researchers given at the 9th edition of the International School on Formal Methods for the Design of Computer, Communication and Software Systems, SFM 2009, held in Bertinoro, Italy, in June 2009. SFM 2009 was devoted to formal methods for web services and covered several aspects including coreography, orchestration, description techniques, interaction, synthesis, composition, session types, contracts, verification, security, and performance.
Tiered bandwidth reservation scheme for multimedia wireless networks
Authors: Lai Wei Kuang, Tsai Hsu-Sheng, Sun Yu-Hang
Venue: Wireless Communications Mobile Computing (2009)

It is important to provide quality of service (QoS) guarantees if we want to support multimedia applications over wireless networks. In this paper, considering the features of tiering in sectored cellular networks, we propose a novel scheme for bandwidth reservation to approach QoS provisioning. By predicting the movement of each connection, the reserving of bandwidth is only required in needful neighboring cells instead of in all neighboring cells. In addition, an admission control mechanism incorporated with bandwidth borrowing assists in distributing scarce wireless bandwidth in more adaptive way. Through mathematical analysis, we proof the advantages of tier-based approach and the bound for the selection of tiered boundary. The simulation results also verify that our scheme can achieve superior performance than traditional schemes regarding no bandwidth reserving, fixed bandwidth reserving, and bandwidth borrowing in sectored cellular networks when performance metrics are measured in terms of the connection dropping probability (CDP), connection blocking probability (CBP), and bandwidth utilization (BU). Copyright &copy; 2008 John Wiley & Sons, Ltd.
Asynchronous typed object groups for grid programming
Authors: Laurent Baduel, Françoise Baude, Denis Caromel
Venue: International Journal of Parallel Programming (2007)

This article presents an object-oriented mechanism to achieve group communication in large scale grids. Group communication is a crucial feature for high-performance and grid computing. While previous work on collective communications imposed the use of dedicated interfaces, we propose a scheme where one can initiate group communications using the standard public methods of the class by instantiating objects through a special object factory. The object factory utilizes casting and introspection to construct a "parallel processing enhanced" implementation of the object which matches the original class' interface. This mechanism is then extended in an evolution of the classical SPMD programming paradigm into the domain of clusters and grids named "Object-Oriented SPMD". OOSPMD provides interprocess (inter-object) communications via transparent remote method invocations rather than custom interfaces. Such typed group communication constitutes a basis for improvement of component models allowing advanced composition of parallel building blocks. The typed group pattern leads to an interesting, uniform, and complete model for programming applications intended to be run on clusters and grids.
The number of roots of a lacunary bivariate polynomial on a line
Authors: Martín Avendaño
Venue: Journal of Symbolic Computation (2009)

We prove that a polynomial f@?R[x,y] with t non-zero terms, restricted to a real line y=ax+b, either has at most 6t-4 zeros or vanishes over the whole line. As a consequence, we derive an alternative algorithm for deciding whether a linear polynomial y-ax-b@?K[x,y] divides a lacunary polynomial f@?K[x,y], where K is a real number field. The number of bit operations performed by the algorithm is polynomial in the number of non-zero terms of f, in the logarithm of the degree of f, in the degree of the extension K/Q and in the logarithmic height of a, b and f.
Session-based Choreography with Exceptions
Authors: Marco Carbone
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Choreography has recently emerged as a pragmatic and concise way of describing communication-based systems such as web services and financial protocols. Recent studies have investigated the transition from the design stage of a system to its implementation providing an automatic way of mapping a choreograhy into executable code. In this work, we focus on an extension of choreography with a communication-based (interactional) exception mechanism by giving its formal semantics. In particular, we discuss through some examples how interactional exceptions at choreography level can be implemented into end-point code.
Using image texture analysis to improve land cover classification
Authors: Xiaochen Zou, Daoliang Li
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

Image texture analysis has received a considerable amount of attention over the last few years as it has played an important role in the classification of the remote sensing images. This paper provides an overview of several different approaches to image texture analysis and demonstrates their use on the problem of land cover classification. We used grey level co-occurrence matrix (GLCM) method to assistant the land cover classification and then compared and evaluated all of the result of classifications. In the experimentation, by comparing the classification result of contrast, energy and entropy we find out that the preferable texture features of grey level co-occurrence matrices method was contrast.
SeisPrho: An interactive computer program for processing and interpretation of high-resolution seismic reflection profiles
Authors: Luca Gasperini, Giuseppe Stanghellini
Venue: Computers Geosciences (2009)

SeisPrho is an interactive computer program for processing and interpreting high-resolution seismic reflection profiles developed using the Delphi/Kylix multiplatform programming environment. For this reason, it is available under Windows(TM) and Linux(TM) operating systems. The program allows the users to handle SEG-Y data files (and other non-standard formats) carrying out a processing sequence over the data to obtain, as a final result, bitmap images of seismic sections. Some basic algorithms are implemented, including filtering and deconvolution. However, the main feature of SeisPrho is its interactive graphic interface, which provides the user with several tools for interpreting the data, such as reflector picking and map digitizing. Moreover, the program allows importing and geo-referencing maps and seismic profiles in the form of digital images. Trace-by-trace analysis of seismic signal and sea-bottom reflectivity is also implemented, as well as other special functions such as compilation of time-slice maps from close-spaced grids of seismic lines. SeisPrho is distributed as public domain software for non-commercial purposes by the Marine Geology division of the Istituto di Scienze Marine (ISMAR-CNR). This paper is an introduction to the program and a preliminary guide to the users.
Hyperbolic Numerics for Variational Approaches to Correspondence Problems
Authors: Henning Zimmer, Michael Breuß, Joachim Weickert, Hans-Peter Seidel
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

Variational approaches to correspondence problems such as stereo or optic flow have now been studied for more than 20 years. Nevertheless, only little attention has been paid to a subtle numerical approximation of derivatives. In the area of numerics for hyperbolic partial differential equations (HDEs) it is, however, well-known that such issues can be crucial for obtaining favourable results. In this paper we show that the use of hyperbolic numerics for variational approaches can lead to a significant quality gain in computational results. This improvement can be of the same order as obtained by introducing better models. Applying our novel scheme within existing variational models for stereo reconstruction and optic flow, we show that this approach can be beneficial for all variational approaches to correspondence problems.
Neural architectures optimization and genetic algorithms
Authors: Mohamed Ettaouil, Youssef Ghanou
Venue: WSEAS Transactions on Computers (2009)

The artificial neural networks (ANN) have proven their efficiency in several applications: pattern recognition, voice and classification problems. The training stage is very important in the ANN's performance. The selection of the architecture of a neural network suitable to solve a given problem is one of the most important aspects of neural network research. The choice of the hidden layers number and the values of weights has a large impact on the convergence of the training algorithm. In this paper we propose a mathematical formulation in order to determine the optimal number of hidden layers and good values of weights. To solve this problem, we use genetic algorithms. The numerical results assess the effectiveness of the theorical results shown in this paper and computational experiments are presented, and the advantages of the new modelling.
Three-dimensional shape reconstruction of abdominal aortic aneurysm
Authors: Mun-Bo Shim, Murat Gunay, Kenji Shimada
Venue: Computer-Aided Design (2009)

This paper presents an effective computational technique for reconstructing a three-dimensional shape of an abdominal aortic aneurysm (AAA), from a limited number of computed tomography (CT) images. The three-dimensional template geometry of a healthy abdominal aorta is used as a priori knowledge, and the template geometry is deformed by extended free-form deformation (EFFD), to generate a patient-specific AAA geometry. A two-step optimization scheme is devised to find an optimal set of EFFD parameters that match the cross-section of a deformed template with an AAA contour shown in a CT image. The geometric continuity of a deformed model is maintained by raising the order of the polynomial function used in EFFD. Experimental results show that the proposed method creates the three-dimensional shape of AAA suitable for structural finite element analysis and computational fluid dynamics for medical diagnosis.
Design Considerations for an ELeGI Portal
Authors: Colin Allison, Rosa Michaelson
Venue: Proceeding of the 2005 conference on Towards the Learning Grid: Advances in Human Learning Services (2005)

ELeGI, the European Learning Grid Infrastructure, has the ambitious goal of fostering effective learning and knowledge construction through the dynamic provision of service-based contextualised and personalised learning environments. The success of this venture will depend to a considerable extent on the usability of such environments, and their usability in turn will depend on a successful strategy for the dynamic integration and maintenance of sets of services. The concept of the portal is therefore of considerable interest, as it is often portrayed as a means whereby a user can access an integrated set of related information and services. This paper reviews the portal concept with a view to its suitability as a design basis for enabling technology that will address usability concerns. The paper proceeds by summarising the usability requirements of learning environments, reviewing some of the ideas currently associated with different types of portals (enterprise portals, institutional portals, user-centric portals, Grid portals), and concludes by deriving a taxonomy of portal characteristics against which the usability requirements of ELeGI can be assessed.
A practical method for authentication of remote computer systems
Authors: Leah H. Jamieson
Venue:  (2008)

The preservation of physical security for computer systems has long been used as a foundation for computational trust. This requirement has come as a result of the use of shared secrets as host identifiers since there has been no empirical means of ascertaining the trustworthiness of a host in an absolute sense. Recent technological trends erode the usefulness of physical security as the basis for trust as well as open the possibility for a new trust model. This new model is not based on the traditional human qualities of trust such as reputation and accountability, but on capability, timeliness and determinism. A software-based procedure is demonstrated for establishing the trustworthiness of a remote computer system in the context of this new model. Deficiencies of this method are examined and used as a motivation for the development of a hardware implementation that offers greater durability of trust as well as ease of use.
Adversarial search with procedural knowledge heuristic
Authors: Viliam Lisý, Branislav Bošanský, Michal Jakob, Michal Pěchouček
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

We introduce an adversarial planning algorithm based on game tree search, which is applicable in large-scale multiplayer domains. In order to tackle the scalability issues of game tree search, the algorithm utilizes procedural knowledge capturing how individual players tend to achieve their goals in the domain; the information is used to limit the search only to the part of the game tree that is consistent with pursuing players' goals. We impose no specific requirements on the format of the procedural knowledge; any programming language or agent specification paradigm can be employed. We evaluate the algorithm both theoretically and empirically, confirming that the proposed approach can lead to a substantial search reduction with only a minor negative impact on the quality of produced solutions.
Methodology of Building and Using Ontology for Providing Content-Based Access to Scientific Information Resources
Authors: Yury Zagorulko, Olesya Borovikova
Venue: Proceeding of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07 (2007)

The paper is devoted to the discussion on the problem of provision of the content-based access to scientific information resources. We suggest solving this problem by means of creation of specialized topic-oriented Internet portals. The information basis of such portals is an ontology that supports integration of information resources relevant to the subject domain of a portal into a uniform information space and provides formulation of user queries in terms of the subject domain and knowledge-driven navigation through the information space of the portal.