ppxscal/embedding_network huggingface dataset:
Minimal Distance-Based Generalisation Operators for First-Order Objects
Authors: Vicent Estruch, César Ferri, Jose Hernández-Orallo, María José Ramírez-Quintana
Venue: Inductive Logic Programming: 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers (2007)

Distance-based methods have been a successful family of machine learning techniques since the inception of the discipline. Basically, the classification or clustering of a new individual is determined by the distance to one or more prototypes. From a comprehensibility point of view, this is not especially problematic in propositional learning where prototypes can be regarded as a good generalisation (pattern) of a group of elements. However, for scenarios with structured data, this is no longer the case. In recent work, we developed a framework to determine whether a pattern computed by a generalisation operator is consistent w.r.t. a distance. In this way, we can determine which patterns can provide a good representation of a group of individuals belonging to a metric space. In this work, we apply this framework to analyse and define minimal distance-based generalisation operators (mg operators) for first-order data. We show that Plotkin's lgg is a mg operator for atoms under the distance introduced by J. Ramon, M. Bruynooghe and W. Van Laer. We also show that this is not the case for clauses with the distance introduced by J. Ramon and M. Bruynooghe. Consequently, we introduce a new mg operator for clauses, which could be used as a base to adapt existing bottom-up methods in ILP.
Innovation Together: Microsoft Research Asia Academic Research Collaboration, 1 edition
Authors: Lolan Song
Venue:  (2008)

Since its establishment in 1998, Microsoft Research Asia's trademark and long term commitment has been to foster innovative research and advanced education in the Asia-Pacific region. Through open collaboration and partnership with universities, government and other academic partners, MSRA has been consistently advancing the state-of-the-art in computer science. This book was compiled to record these outstanding collaborations, as Microsoft Research Asia celebrates its 10th Anniversary. The selected papers are all authored or co-authored by faculty members or students through collaboration with MSRA lab researchers, or with the financial support of MSRA. Papers previously published in top-tier international conference proceedings and journalsare compiled here into one accessiblevolume of outstanding research. Innovation Together highlights the outstanding work of Microsoft Research Asia asit celebrates ten years of achievement and looks forward to the next decade of success.
Towards Computerized Adaptive Assessment Based on Structured Tasks
Authors: Jozef Tvarožek, Miloš Kravčík, Mária Bieliková
Venue: Proceedings of the 5th international conference on Adaptive Hypermedia and Adaptive Web-Based Systems (2008)

In an attempt to support traditional classroom assessment processes with fully computerized methods, we have developed a method for adaptive assessment suitable for well structured domains with high emphasis on problem solving and capable of robust continuous assessment, potentially encouraging student's achievements, reflective thinking, and creativity. The method selects problems according to the student's demonstrated ability, structured task description schemes allow for a detailed analysis of student's errors, and on-demand generation of task instances facilitates independent student work. We evaluated the proposed method using a software system we had developed in the domain of middle school mathematics.
Shape gradient of the dissipated energy functional in shape optimization for the viscous incompressible flow
Authors: Zhiming Gao, Yichen Ma
Venue: Applied Numerical Mathematics (2008)

This paper is concerned with a numerical simulation of shape optimization in a two-dimensional viscous incompressible flow governed by Navier-Stokes equations with mixed boundary conditions containing the pressure. The minimization problem of total dissipated energy was established in the fluid domain. We derive the structures of continuous shape gradient of the cost functional by using the differentiability of a minimax formulation involving a Lagrange functional with a function space parametrization technique. Finally a gradient type algorithm is effectively used for our problem.
A Dense Packing of Regular Tetrahedra
Authors: Elizabeth R. Chen
Venue: Discrete Computational Geometry (2008)

We construct a dense packing of regular tetrahedra, with packing density D>.7786157.
Multitask Learning with Data Editing
Authors: Andrés Bueno-Crespo, Antonio Sánchez-García, Juan Morales-Sánchez, José-Luis Sancho-Gómez
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

In real life, the task learning is reinforced by the related tasks that we have learned or that we learn at the same time. This scheme applied to Artificial Neural Networks (ANN) is known with the name of Multitask Learning (MTL). So, the information coming from the related secondary tasks provide a bias to the main task, which improves its performances versus a Single-Task Learning (STL) scheme. However, this implies a bigger complexity. Data Editing procedures are used to reduce the algorithmic complexity, obtaining an outstanding samples set from the original set. This edited set gets the performance very fast. In this paper we combine MTL with Data Editing, so we can approach the small samples set training in an MTL scheme.
Identity-Based Proxy Re-encryption
Authors: Matthew Green, Giuseppe Ateniese
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

In a proxy re-encryption scheme a semi-trusted proxy converts a ciphertext for Alice into a ciphertext for Bob without seeing the underlying plaintext. A number of solutions have been proposed in the public-key setting. In this paper, we address the problem of Identity-Based proxy re-encryption, where ciphertexts are transformed from one identity to another. Our schemes are compatible with current IBE deployments and do not require any extra work from the IBE trusted-party key generator. In addition, they are non-interactive and one of them permits multiple re-encryptions. Their security is based on a standard assumption (DBDH) in the random oracle model.
Feature Extraction of Ultrasonic Flaw Signals of Pipelines Using Hilbert-Huang Transform
Authors: Qi Zhang, Pei-wen Que, Yi-mei Mao
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

Ultrasonic nondestructive testing technique is widely used to detect material flaws. When flaws were classified using collected ultrasonic echo signals, the features of the ultrasonic flaw signals play an important role in ultrasonic flaw classification systems. In this paper, a new feature extraction method was proposed. Hilbert-Huang Transform was applied to ultrasonic flaw signals to obtain the marginal spectrum, the instantaneous energy density and HHT time frequency spectrum. According to the marginal spectrum, the instantaneous energy density and HHT time frequency spectrum, the features of flaws were extracted in the frequency domain, time domain and time-frequency domain. This is a new feature extraction method. From these new features the flaws can be classified easily.
Fast track article: A pragmatic analysis of user mobility patterns in macrocellular wireless networks
Authors: M. S. Sricharan, V. Vaidehi
Venue: Pervasive and Mobile Computing (2008)

Due to multifaceted human behavior, synthetic models are inept at realistically modeling long term mobility characteristics of users. The diversity in mobility character adds yet another dimension to this complex problem. Empirical studies are essential and are capable of providing realistic user models. This paper examines the real-time mobility traces of users and identifies key mobility parameters, which are used to classify users and create homogenized groups. Based on mobility and degree of predictability, a mobile user classification is attempted. As per-user mobility management schemes proposed in the literature are difficult to implement, it is essential to adopt a class or group based approach to facilitate implementation of dynamic schemes. Further, this paper characterizes in-session and out-of-session Cell Residence Time (CRT), the feature that critically influences several management tasks. The out-of-session CRT distribution has been represented using a heavy tail distribution. The applicability of the model for various classes of users has been studied. The results of this study can be used to spawn a more realistic user model, for simulation studies.
On the Evolution of User Authentication: Non-bilateral Factors
Authors: Moti Yung
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

In this position note we review the notion of "User Authentication," i.e., the idea of a person facing the computer and in need of authenticating herself to the system in order to get access to her account. We analyze the state of the art of user authentication and that of "Authentication Factors," i.e., the techniques and instruments the user can present to the computer. We compare the state of the art of these factors with the acceptable textbook view.
Graph Models of Critical Infrastructure Interdependencies
Authors: Nils Kalstad Svendsen, Stephen D. Wolthusen
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

Critical infrastructures are interconnected on multiple levels, and due to their size models with acceptable computational complexity and adequate modeling capacities must be developed. This paper presents the skeleton of a graph based model and sketches its capabilities.
Plenary lecture III: towards narrowing the gap between artificial intelligence & its destination
Authors: Suash Deb
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

Human brain continues to live with an image as the one which is inscrutable & very poorly understood. Hence theories concerning the same are available in plenty. However, without unraveling the mystery of the self learning process as well as that of the information processing capability of the same, the field of Artificial Intelligence (AI) will continue to reside at a far distance from its ultimate goal. The AI community might, with great optimism, wait for the arrival of enough computing power to fulfill its promise of building truly intelligent machines. However, without getting rid of its confusion vis-a-vis what constitutes intelligence & the associated misinterpretation concerning the functioning of neocortex- the subset of human brain responsible for arming us with intelligence, that wait will never come to an end and instead will acquire an everlasting status. How do the neurons, immensely slow as compared to transistors, but faster and more powerful for majority of the situations? The answer lies in the fact is that unlike computers, the human brain doesn't resort to computation while solving problems. Instead, it relies upon retrieval of answers from its memory. This paper will dwell on the origin of Artificial Intelligence by stating the lessons it can learn from the invention of Artificial Flight. Subsequently the need to modify the concept of "intelligence as computation" will be touched. Based on those the pros-and-cons of the present state-of-the-art of Artificial Neural Networks will be discussed and the scope of building a truly intelligent machine will be explored.
Sliding Window Method for NTRU
Authors: Mun-Kyu Lee, Jung Woo Kim, Jeong Eun Song, Kunsoo Park
Venue: Proceedings of the 5th international conference on Applied Cryptography and Network Security (2007)

The NTRU cryptosystem is a ring-based public key system using hard problems over lattices. There has been an extensive research on efficient implementation of NTRU operations, including recent results such as Bailey et al.'s software implementation over a resource-constrained device and Gaubatz et al.'s hardware implementation using only 3,000 gates. In this paper, we present a new algorithm to improve further the performance of NTRU. We speed up the encryption and decryption operations of NTRU up to 32% using some temporary memory, and if we can use precomputation, then the speed-up becomes up to 37%. Our method is based on the observation that specific sub-operations are repeated frequently in the underlying polynomial operations of NTRU.
Enterprise mobility: Researching a new paradigm
Authors: Rahul C. Basole
Venue: Information-Knowledge-Systems Management (2008)

The proliferation of mobile information and communication technologies has led to a profound change in the way people work, communicate, and collaborate and conduct business. However, businesses today are just beginning to recognize the importance and potentially transformative impact of enterprise mobility. While the concept of enterprise mobility continues to emerge in the management and technology literatures, it is still not well understood. This special issue brings together global, multi-disciplinary perspectives from leading scholars and practitioners on the value and transformative impact of enterprise mobility on work, technology, and organizations, discusses critical enablers and strategies, and provides case study insights.
Domain/boundary decomposition method for finite element analyses with contact boundaries
Authors: Eui Sup Shin, Yong Uhn Kim, Sung Nam Jung
Venue: Finite Elements in Analysis and Design (2008)

This paper discusses a domain/boundary decomposition method for efficient finite element analyses of contact problems. The whole domain is regarded as a set of subdomains, an interface and contact interfaces. The penalty formulation is carried out to combine the interface or contact interfaces with the neighboring subdomains that satisfy continuity constraints As a result, non-linearity due to the contact boundaries can be localized in a few subdomains and/or contact interfaces, and the computational efficiency is greatly improved by adopting suitable solution algorithms. Numerical examples demonstrate these advantageous features of the proposed method.
Constraint Solving and Symbolic Execution
Authors: Jian Zhang
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

For many decades, the correctness of programs has been a concern for computer scientists and software engineers. At present, it is still not easy to ensure the correctness of nontrivial programs, although many researchers have made various attempts in this direction.Recently, the Verifying Compiler is proposed as a grand challenge in computing research [7]. But its goal can be achieved incrementally. The following is quoted from Hoare (page 68 of [7]):The progress of the project can be assessed by the number of lines of code that have been verified, and the level of annotation and verification that has been achieved. The relevant levels of annotations are: structural integrity, partial functional specification, total specification. The relevant levels of verification are: by testing, by human proof, by machine assistance, and fully automatic. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Pinpointing users with location estimation techniques and Wi-Fi hotspot technology
Authors: Kevin Curran, Eoghan Furey
Venue: International Journal of Network Management (2008)

Location awareness is becoming an important capability for mobile computing; however, it has not been possible until now to provide cheap pervasive positioning systems. Wide area coverage is most famously achieved by using global positioning systems (GPS). A constellation of low-orbit satellites cover the earth's surface. Unfortunately GPS does not work indoors and has limited success in big cities because of the 'urban canyon' effect. PlaceLab is a research project that attempts to solve the ubiquity issues surrounding 802.11-based location estimation. PlaceLab, like RADAR, uses a device's 802.11 interface; however, it does not require the area to be pre-calibrated. It predicts location via the known positions of the access points detected by the device. Commonly used systems have a number of drawbacks, including cost, accuracy and the ability to work indoors. PlaceLab is a piece of open source software developed by Intel Research that can pinpoint a user within a Wi-Fi network. We set out here to investigate whether PlaceLab can be used as a means of establishing a user's position. This type of investigation could, if successful, pave the way for the development of other location-based applications. This report documents the efforts to answer the above question. PlaceLab was found to work, but only in ideal locations where factors such as the number of floors and the lack of available APs did not affect its use. It was concluded that these factors prevent the system from being effective as a means of establishing a user's position in most locations on campus.
Towards Dataintegration from WITSML to ISO 15926
Authors: Kari Anne Haaland Thorsen, Chunming Rong
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

To enable information sharing and automatic reasoning across applications and domains, with relevant context and content, we need to model and map data into common standards with semantic annotation. The project Integrated Operations (IO) has been estimated to increase the value of the petroleum resources on the Norwegian continental shelf (NCS) with NOK 250 billions in NPV (EUR 30 billions). It has been decided to use ISO 15926 as the instrument for integrating data across disciplines and business domains. Different domains metadata is mapped onto the common ontology defined in ISO 15926. Only in this manner can true integrations emerge. There is a need to have a mapping of WITSML types and structures in ISO 15926. Much work has already been done, but a vital part still remains. At present it is not possible to categories and identify WITSML base types and WITSML schemas structures in ISO 15926.
The Robot Cleans Up
Authors: Margaret-Ellen Messinger, Richard J. Nowakowski
Venue: Proceedings of the 2nd international conference on Combinatorial Optimization and Applications (2008)

Imagine a large building with many corridors. A robot cleans these corridors in a greedy fashion, the next corridor cleaned is always the dirtiest to which it is adjacent. We determine bounds on the minimum s(G) and maximum S(G) number of time steps (over all edge weightings) before every edge of a graph G has been cleaned. We show that Eulerian graphs have a self-stabilizing property that holds for any initial edge weighting: after the initial cleaning of all edges, all subsequent cleanings require s(G) time steps. Finally, we show the only self-stabilizing trees are a subset of the superstars.
Hacking the Best-Seller List
Authors: Marc Donner
Venue: IEEE Security and Privacy (2004)

In the same way that Windows introduced the masses to graphical user interfaces without having invented them, Dan Brown's books are exploring some important sci-fi themes for the general public. This installment of Biblio Tech departs from the normal pattern of examining more obscure, idea-driven publications to focus on the works of a contemporary best-selling author instead. This departure is unusual because neither this department nor this magazine is part of the vast marketing machinery of today's publishing industry. By choosing to look at current popular fiction, we run the risk of discovering later that we should have delved deeper. Nevertheless, the works in question are poised to be influential in the years to come, and thus merit our attention.
Analytic Model of BEB Protocol with Voice/Data Class in Mobile Multimedia Networks
Authors: Dong Chun Lee, Hong Jin Kim
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

We propose analytic model to compute the delay of the Binary Exponential Backoff (BEB) protocol as a collision resolution algorithm. When a packet which tries to reserve a channel collides n times, it chooses one of the next 2n frames with equal probabilities and attempts the reservation again. We derive the expected access delay until an arbitrary packet reserves a channel. Then the expected transmission delays for packets are calculated analytically. Proposed analytic model is checked against simulation.
Assessing the Impact of Positive Feedback in Constraint-Based Tutors
Authors: Devon Barrow, Antonija Mitrovic, Stellan Ohlsson, Michael Grimley
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Most existing Intelligent Tutoring Systems (ITSs) are built around cognitive learning theories, such as Ohlsson's theory of learning from performance errors and Anderson's ACT theories of skill acquisition, which focus primarily on providing negative feedback, facilitating learning by correcting errors. Research into the behavior of expert tutors suggest that experienced tutors use positive feedback quite extensively and successfully. This paper investigates positive feedback; learning by capturing and responding to correct behavior, supported by cognitive learning theories. Our aim is to develop and implement a systematic approach to delivering positive feedback in ITSs. We report on an evaluation study done in the context of SQL-Tutor, in which the control group used the original version of the system giving only negative feedback, while the experimental group received both negative and positive feedback. Results show that the experimental group students needed significantly less time to solve the same number of problems, in fewer attempts compared to those in the control group. Students in the experimental group also learn approximately the same number of concepts as students in the control group, but in much less time. This indicates that positive feedback facilitates learning and improves the effectiveness of learning in ITSs.
Using Dynamic Electronic Institutions to Enable Digital Business Ecosystems
Authors: Eduard Muntaner-Perich, Josep Lluís Rosa Esteva
Venue: Coordination, Organizations, Institutions, and Norms in Agent Systems II: AAMAS 2006 and ECAI 2006 International Workshops, COIN 2006 Hakodate, Japan, May 9, 2006 Riva del Garda, Italy, August 28, 2006. Revised Selected Papers (2007)

In this paper, which is exploratory in nature, we introduce how to use Dynamic Electronic Institutions to enable Digital Business Ecosystems. A Digital Business Ecosystem is an evolutionary self-organising system aimed at creating a digital software environment for small organisations. These new forms of networked business require a multi-disciplinary approach based on biology, computer science and social sciences mechanisms and models. Our proposal is to use a multi-agent approach in combination with some social sciences metaphors. More specifically, we propose to imagine the digital environment of business ecosystems as an open agent system, and to study the spontaneous composition and adaptation of the different services and software components, by using Dynamic Electronic Institutions, which we have recently presented in our latest works. In this paper we present a brief summary of our previous work on dynamic institutions, and our first ideas on how to enable Digital Business Ecosystems.