ppxscal/embedding_network huggingface dataset:
Bayesian Collaborative Predictors for General User Modeling Tasks
Authors: Jun-Ichiro Hirayama, Masashi Nakatomi, Takashi Takenouchi, Shin Ishii
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

Collaborative approach is of crucial importance in user modeling to improve the individual prediction performance when only insufficient amount of data are available for each user. Existing methods such as collaborative filtering or multitask learning, however, have a limitation that they cannot readily incorporate a situation where individual tasks are required to model a complex dependency structure among the task-related variables, such as one by Bayesian networks. Motivated by this issue, we propose a general approach for collaboration which can be applied to Bayesian networks, based on a simple use of Bayesian principle. We demonstrate that the proposed method can improve both the prediction accuracy and its variance in many cases with insufficient data, in an experiment with a real-world dataset related to user modeling.
Merging changes in XML documents using reliable context fingerprints
Authors: Sebastian Rönnau, Christian Pauli, Uwe M. Borghoff
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

Different dialects of XML have emerged as ubiquitous document exchange formats. For effective collaboration based on such documents, the capability to propagate edit operations performed on a document is indispensable. In order to avoid the transmission of whole documents, deltas are used to describe these edit operations, allowing the construction of a new version of a document. However, patching a document with a delta it was not generated for is error-prone, and any insert or delete operations performed on the document are likely to affect all subsequent paths within that document. In this paper, we present a delta format for XML documents that uses context-aware fingerprints to identify edit operations. This allows our XML patch procedure to find the correct position of an edit operation, even if the document was updated in the meantime. Possible conflicts are detected. Experimental results show the reliability of the presented fingerprinting technique and prove the high quality of the resulting patched documents.
A Task Allocation Optimizer for Software Construction
Authors: Jim Duggan, Jason Byrne, Gerard J. Lyons
Venue: IEEE Software (2004)

The allocation of development tasks within a software project is a complex activity. There are many factors to consider, including the programmers' skill and productivity levels. Furthermore, key project objectives, such as overall cost and number of defects, must be minimized. Multiobjective optimization is based on evolutionary algorithms and can generate a set of optimal solutions to problems with conflicting objectives. This article shows how to successfully apply this technique to allocate tasks within a software development team.
A Comparison of Model-Tracing and Constraint-Based Intelligent Tutoring Paradigms
Authors: Viswanathan Kodaganallur, Rob R. Weitz, David Rosenthal
Venue: International Journal of Artificial Intelligence in Education (2005)

Two approaches to building intelligent tutoring systems are the well-established model-tracing paradigm and the relatively newer constraint-based paradigm. Proponents of the constraint-based paradigm claim that it affords performance at levels comparable to that of model-tracing tutors, but with significantly less development effort. We have built both a model-tracing and constraint-based tutor for the same problem domain (statistical hypothesis testing) and report on our findings with the goals of evaluating proponents' claims, more generally contrasting and comparing the two approaches, and providing guidance for others interested in building intelligent tutoring systems. Principally we conclude that two characteristics of the problem domain are key in distinguishing the appropriateness of the approaches for a given problem domain. First, the constraint-based paradigm is feasible only for domains in which the solution itself is rich in information. There is no such restriction for model tracing. Second, model tracing demonstrates superiority with respect to the ability to provide targeted, high-quality remediation; this superiority increases with the complexity of the solution process goal structure. Finally, we observe that the development effort required to build a model-tracing tutor is greater than that for building a constraint-based tutor. This increased effort is a function of additional design requirements that are responsible for the improved remediation.
Prognostics of machine condition using soft computing
Authors: B. Samanta, C. Nataraj
Venue: Robotics and Computer-Integrated Manufacturing (2008)

This paper presents a system for monitoring and prognostics of machine conditions using soft computing (SC) techniques. The machine condition is assessed through a suitable 'monitoring index' extracted from the vibration signals. The progression of the monitoring index is predicted using an SC technique, namely adaptive neuro-fuzzy inference system (ANFIS). Comparison with a machine learning method, namely support vector regression (SVR), is also presented. The proposed prediction procedures have been evaluated through benchmark data sets. The prognostic effectiveness of the techniques has been illustrated through previously published data on several types of faults in machines. The performance of SVR was found to be better than ANFIS for the data sets used. The results are helpful in understanding the relationship of machine conditions, the corresponding indicating features, the level of damage/degradation and their progression.
Face Detection on Embedded Systems
Authors: Abbas Bigdeli, Colin Sim, Morteza Biglari-Abhari, Brian C. Lovell
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Over recent years automated face detection and recognition (FDR) have gained significant attention from the commercial and research sectors. This paper presents an embedded face detection solution aimed at addressing the real-time image processing requirements within a wide range of applications. As face detection is a computationally intensive task, an embedded solution would give rise to opportunities for discrete economical devices that could be applied and integrated into a vast majority of applications. This work focuses on the use of FPGAs as the embedded prototyping technology where the thread of execution is carried out on an embedded soft-core processor. Custom instructions have been utilized as a means of applying software/hardware partitioning through which the computational bottlenecks are moved to hardware. A speedup by a factor of 110 was achieved from employing custom instructions and software optimizations.
End-to-end congestion control protocols for remote programming of robots, using heterogeneous networks: A comparative analysis
Authors: Raul Wirz, Raul Marín, José M. Claver, Manuel Ferre, Rafael Aracil, Josep Fernández
Venue: Robotics and Autonomous Systems (2008)

There are many interesting aspects of Internet Telerobotics within the network robotics context, such as variable bandwidth and time-delays. Some of these aspects have been treated in the literature from the control point of view. Moreover, only a little work is related to the way Internet protocols can help to minimize the effect of delay and bandwidth fluctuation on network robotics. In this paper, we present the capabilities of TCP, UDP, TCP Las Vegas, TEAR, and Trinomial protocols, when performing a remote experiment within a network robotics application, the UJI Industrial Telelaboratory. Comparative analysis is presented through simulations within the NS2 platform. Results show how these protocols perform in two significant situations within the network robotics context, using heterogeneous wired networks: (1) an asymmetric network when controlling the system through a ADSL connection, and (2) a symmetric network using the system on Campus. Conclusions show a set of characteristics the authors of this paper consider very important when designing an End-to-End Congestion Control transport protocol for Internet Telerobotics.
Eiffel as a Framework for Verification
Authors: Bertrand Meyer
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)

The Eiffel method and language integrate a number of ideas originating from work on program verification. This position paper describes the goals of the Eiffel approach, presents current Eiffel-based verification techniques using contracts for run-time checks for testing and debugging, and outlines ongoing work on static verification.
Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
Authors: Ali Bagherzandi, Stanisław Jarecki
Venue: Proceedings of the 6th international conference on Security and Cryptography for Networks (2008)

A multisignature scheme allows a group of n players to produce a short string which is equivalent to n separate signatures on the same message. Assuming the Random Oracle Model (ROM), the aggregate signature schemes of Boneh et al. [BGLS03] and Bellare and Neven [BN06] provide multisignatures secure in the standard public key setting, but their multisignature verification algorithms involve respectively O(n) bilinear maps and O(n) exponentiations. Ristenpart and Yilek [RY07] recently showed two multisignature schemes relying on groups with bilinear maps, with just O(1) bilinear maps in multisignature verification, which are secure if each public key is accompanied by so-called "proof of (secret key) possession" (POP). We show how to achieve secure multisignatures in the POP model using any group where CDH or DDH problems are hard. Both schemes have multisignature verification with O(1) exponentiations, and their POP messages take O(1) group elements and require O(1) exponentiations to verify. Moreover, the security of the proposed schemes is tightly related to the CDH and DDH problems, in ROM.
On Kabatianskii-Krouk-Smeets Signatures
Authors: Pierre-Louis Cayrel, Ayoub Otmani, Damien Vergnaud
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on random error-correcting codes. In this paper we investigate the security and the efficiency of their proposal. We show that a passive attacker who may intercept just a few signatures can recover the private key. We give precisely the number of signatures required to achieve this goal. This enables us to prove that all the schemes given in the original paper can be broken with at most 20 signatures. We improve the efficiency of these schemes by firstly providing parameters that enable to sign about 40 messages, and secondly, by describing a way to extend these few-times signatures into classical multi-time signatures. We finally study their key sizes and a mean to reduce them by means of more compact matrices.
Interacting Agents for the Risk Assessment of Allergies in Newborn Babies
Authors: Giorgio Leonardi, Silvana Quaglini, Mara Amici, Mario Stefanelli, Cristina Torre, Giorgio Ciprandi
Venue: Proceedings of the 11th conference on Artificial Intelligence in Medicine (2007)

Allergic diseases are increasing all over the world. Therefore, the risk assessment of allergy in newborns is a key issue for prevention purposes. The risk can be assessed at the birth by combining information about familiarity with results of blood examination. Then, the individual must be monitored, particularly in the fist months of life, in order to better define the type of allergy and the risk. The monitoring is carried on by different professionals (agents), therefore the communication and collaboration between these agents must be supported in order to obtain the best treatment strategy for the baby. This paper presents a new project which allows the cooperation between the agents involved in the risk assessment of allergy in newborn babies, and presents the main technologies which will be used to develop it.
Defects Detection on Aged Films
Authors: Yang-Ta Kao, Timothy K. Shih, Hsing-Ying Zhong, Ben C. Tsai, Wen-Ju Tsai
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Aged motion pictures may contain different types of defects, such as spikes and scratch lines. Each type of defect has its different properties. It is relatively hard to precisely detect these defects on aged films by using only a single solution. This paper proposes two techniques to detect spikes and scratch lines on aged films. The results of defect detection have good accuracy as compared to two well-known approaches. Application of our technique can be used in the recovery of damaged aged films.
A Comparison of Interactive and Ad-Hoc Relevance Assessments
Authors: Birger Larsen, Saadia Malik, Anastasios Tombros
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

In this paper we report an initial comparison of relevance assessments made as part of the INEX 2006 Interactive Track (itrack'06) to those made for the topic assessment phase of the INEX 2007 ad-hoc track. The results indicate that that there are important differences in what information was assessed under the two different conditions, but it also suggests a certain level of agreement in what constitutes relevant and non-relevant information. In addition, there are indications that the task type has an influence on the distribution of relevance assessments.
An Algorithm for Object Function Optimization in Mutual Information-Based Image Registration
Authors: Zhiguo Cao, Yi Zheng, Yong Wang, RuiCheng Yan
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 4 - Volume 04 (2008)

Image registration is widely used in remote sensing image processing, medical image analysis and many other fields. Mutual information-based image registration technique gained much attention recently. However, during the optimization procedure, because of the influence of interpolation and the changes of overlapping areas in the images, the object function of the mutual information method may converge at local maximums so that wrong transformation parameters are generated as a result. In this paper, an improved simulated annealing–simplex method is proposed to solve this problem. Experiment results show that registration precision can reach to the sub-pixel level.
Methods for complex single-mind architecture designs
Authors: Kristinn R. Thórisson, Gudny Ragna Jonsdottir, Eric Nivel
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

The implementation of software systems with large numbers of heterogeneous components calls for a powerful design methodology. Although several such methodologies have been proposed, many lack application to construction of single-mind systems. We have employed the Constructionist Design Methodology (CDM) in building several such systems, including an autonomous radio show host. Proposing modules communicating through messages via blackboards as key building blocks for interactive intelligences, the methodology has been of considerable help in the early stages of designing several large architectures. This paper describes efforts to extend the CDM with more detailed support for the modularization process. We detail our use of a combination of abstraction and finite state machines in modularizing the realtime turntaking system of the radio show host. Our experience shows considerable benefits and added flexibility in the creation of large architectures when using the new modularization principles.
Execution of distributed queries in the web environment
Authors: Gongzhu Hu, David Zhang
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

Database query processing is one of the fundamental issues in data engineering, particularly when more and more databases become distributed over the Internet in the last decade. There have been several approaches to the problem of distributed query processing (DQP), some were successful in the client-server environment but not so in an environment with heterogeneous and autonomous databases. The challenge relies on the nature of the Internet and the Web that pose many difficulties to the problem in hand. In this paper, we propose a model that uses an XML standard and its equivalent in-memory data structure to achieve data sharing, and invokes XML Web services in asynchronous mode to allow local database management systems to efficiently process local data. This approach, like XJoin, allows progress to be made even when data sources experience delays. It builds a layer on top of existing database management systems to minimize the complexity and cost for processing distributed queries that is critical for making such a method practical.
Towards a Collaborative Reputation Based Service Provider Selection in Ubiquitous Computing Environments
Authors: Malamati Louta
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

From a market based perspective, entities composing dynamic ubiquitous computing environments may be classified into two main categories that are, in principle, in conflict. These are the Service Resource Requestors (SRRs) wishing to use services and/or exploit resources offered by other system entities and the Service Resource Providers (SRPs) that offer the services/resources requested. Under the assumption that a number of SRPs may handle the SRRs requests, the SRRs may decide on the most appropriate SRP for the service / resource requested on the basis of a weighted combination of the evaluation of the quality of their offer (performance related factor) and of their reputation rating (reliability related factor). In this context, a reputation mechanism is proposed, which rates SRPs with respect to whether they honoured or not the agreements they have established with the SRRs. The reputation mechanism is collaborative, distributed and robust against false and spurious ratings.
Monotonic Behavior of Entropies and Co---entropies for Coverings with Respect to Different Quasi---orderings
Authors: Daniela Bianucci, Gianpiero Cattaneo
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

Some quasi---ordering for coverings are here defined. Different definitions of entropies and co---entropies for coveringsare examined, also focusing on the distinction between the here called global and pointwise approaches to co---entropies. The entropies and co---entropies are defined both for coverings generated from an information system via a similarity relation and for generic coverings of a universe X (i.e., coverings not necessarily generated from an information system via a similarity relation). The behavior of the entropies and co---entropies for coverings with respect to the defined quasi---orderings is thus explored.
oDect: an RFID-based object detection API to support applications development on mobile devices
Authors: Francesco Bellotti, Riccardo Berta, Massimiliano Margarone, Alessandro De Gloria
Venue: Software&mdash;Practice Experience (2008)

The RFID technology is becoming ever more popular in the development of ubiquitous computing applications. A full exploitation of the RFID potential requires the study and implementation of human&ndash;computer interaction (HCI) modalities to be able to support wide usability by the target audience. This implies the need for programming methodologies specifically dedicated to support the easy and efficient prototyping of applications to have feedback from early tests with users. On the basis of our field-working experience, we have designed oDect, a high-level language and platform-independent application programming interface (API), ad hoc designed to meet the needs of typical applications for mobile devices (smart phones and PDAs). oDect aims at allowing application developers to create their prototypes focusing on the needs of the final users, without having to care about the low-level software that interacts with the RFID hardware. Further, in an end-user developing (EUD) approach, oDect provides specific support for the application end-user herself to cope with typical problems of RFID applications in detecting objects. We describe in detail the features of the API and discuss the findings of a test with four programmers, where we analyse and evaluate the use of the API in four sample applications. We also present results of an end-user test, which investigated strengths and weaknesses of the territorial agenda (TA) concept. The TA is an RFID-based citizen guide that aids&mdash;through time- and location-based reminders&mdash;users in their daily activities in a city. The TA directly exploits EUD features of oDect, in particular concerning the possibility of linking detected objects with custom actions. Copyright &copy; 2008 John Wiley & Sons, Ltd.
An Enhanced SNTP (ESNTP) Clock Synchronization for High-Precision Network QoS Measurements
Authors: Jeong-Ki Park, Young-Tak Kim
Venue: Proceedings of the 8th IEEE international workshop on IP Operations and Management (2008)

In order to assess the performance of QoS provisioning for realtime multimedia services that require end-to-end delay within 100 ms and jitter within 50 ms, the server and client are required to be synchronized with near sub-millisecond clock offset for high-precision QoS-performance measurements. In this paper we propose an enhanced SNTP (ESNTP) that provides sub-millisecond clock synchronization based on the selection of minimum round-trip delay and high-resolution local clock reading with clock drift compensation. Throughout the experiments of varying traffic congestion in public Internet environment, the proposed clock synchronization scheme maintained within 0.5 ms offset between NTP servers and the ESNTP client, where the SNTPv4 maintained 3.7 ms average clock offset in the same environment. The proposed clock synchronization scheme provides higher precision with smaller clock offset error compared to the NTPv4 that is reported to provide clock offset of 10 ms in public Internet.
A Web Document Classification Method Based on Shuffled Frog Leaping Algorithm
Authors: Xia Sun, Ziqiang Wang, Dexian Zhang
Venue: Proceedings of the 2008 Second International Conference on Genetic and Evolutionary Computing (2008)

To efficiently deal with Web document classification problem, a novel document classification algorithm based on shuffled frog leaping (SFL) algorithm is proposed in this paper. The SFL algorithm combines the benefits of the genetic-based memetic algorithms and the social behavior-based particle swarm optimization algorithms. The experimental results indicate that the proposed SFL algorithm yields much better performance than other conventional algorithms.
Locally Expandable Allocation of Folksonomy Tags in a Directed Acyclic Graph
Authors: Takeharu Eda, Masatoshi Yoshikawa, Masashi Yamamuro
Venue: Proceedings of the 9th international conference on Web Information Systems Engineering (2008)

We propose a new classification system based on an analysis of folksonomy data. To find valuable resources from current social bookmark services, users need to specify search terms or tags, or to discover people with similar interests. Our system uses semantic relationships extracted from the co-occurrences of folksonomy data using PLSI and allocates folksonomy tags in a directed acyclic graph. Compared to the hierarchical allocation method of a tree, our method guarantees the number of children nodes and increases the number of available paths to an objective node, enabling users to navigate the resources using tags.