ppxscal/embedding_network huggingface dataset:
A Novel Methodology for Web Services Discovery in Gnutella-Like Networks
Authors: Fuyong Yuan, Jian Liu, Chunxia Yin, Yulian Zhang
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

The Web Services technology has been initiated by industry, and lots of large companies are workingon Web Services technology and apply it in real world applications. However, the existing WebService registration and discovery are processed in a centralized approach, which cannot easily scale to a growing number of users. With the advantages of scalability and fault-tolerance, P2P technology is suitable for enhance the scalability of Web Services in nature and can also make it possible to discover them easily. Because the P2P networks can provide the framework for discovery, publication, and registration for Web Services, the central registry is not required when integrating Web Services. So, in this paper, we proposed a methodology, which consist of two parts, to integrate distributed Web Services in Gnutella-like networks, and it makes those services collaborative. One is publishing the information of Web Services to high degree nodes, and then many information chains of Web Service are formed in Gnutella. Another is combining high degree walk and random walk methods to discover the target Web Service. Finally we analyze the performance of the proposed methodology with simulation. The results show that the methodology can achieve high success rate, low traffic and load balance, so that it acquires the integration of Web Services scalable.
Semantic Classes in Czech Valency Lexicon
Authors: Václava Kettnerová, Markéta Lopatková, Klára Hrstková
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

We introduce a project aimed at enhancing a valency lexicon of Czech verbs with coherent semantic classes. For this purpose, we make use of FrameNet, a semantically oriented lexical resource. At the present stage, semantic frames from FrameNet have been mapped to two groups of verbs with divergent semantic and morphosyntactic properties, verbs of communication and verbs of exchange. The feasibility of this task has been proven by the achieved inter-annotator agreement --- 85.9% for the verbs of communication and 78.5% for the verbs of exchange. As a result of our experiment, the verbs of communication have been classified into nine semantic classes and the verbs of exchange into ten classes, based on upper level semantic frames from FrameNet.
An algorithm for partitioning trees augmented with sibling edges
Authors: Rajesh Bordawekar, Oded Shmueli
Venue: Information Processing Letters (2008)

We investigate a special case of the graph partitioning problem: the partitioning of a sibling graph which is an ordered tree augmented with edges connecting consecutive nodes that share a common parent. We describe the algorithm, XS, and present a proof of its correctness.
Entropy and Chaos in a Lattice Gas Cellular Automata
Authors: Franco Bagnoli, Raúl Rechtman
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

We find a simple linear relation between the thermodynamic entropy and the largest Lyapunov exponent (LLE) of an discrete hydrodynamical system, a deterministic, two-dimensional lattice gas automaton (LGCA). This relation can be extended to irreversible processes considering the Boltzmann's H function and the expansion factor of the LLE. The definition of LLE for cellular automata is based on the concept of Boolean derivatives and is formally equivalent to that of continuous dynamical systems.
Breast Density Segmentation: A Comparison of Clustering and Region Based Techniques
Authors: A. Torrent, A. Bardera, A. Oliver, J. Freixenet, I. Boada, M. Feixes, R. Martí, X. Lladó, J. Pont, E. Pérez, S. Pedraza, J. Martí
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

This paper presents a comparison of two clustering based algorithms and one region based algorithm for segmenting fatty and dense tissue in mammographic images. This is a crucial step in order to obtain a quantitative measure of the density of the breast. The first algorithm is a multiple thresholding algorithm based on the excess entropy, the second one is based on the Fuzzy C-Means clustering algorithm, and the third one is based on a statistical analysis of the breast. The performance of the algorithms is exhaustively evaluated using a database of full-field digital mammograms containing 150 CC and 150 MLO images and ROC analysis (ground-truth provided by an expert). Results demonstrate that the use of region information is useful to obtain homogeneous region segmentation, although clustering algorithms obtained better sensitivity.
Authoring Mobile Intelligent Tutoring Systems
Authors: Ramón Zatarain, M. L. Barrón-Estrada, Guillermo A. Sandoval-Sánchez, Carlos A. Reyes-García
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Tailoring material to the individual learner for delivery on handheld computers represents a major challenge. Most of the current work in mobile intelligent tutoring systems is more related with personalized systems because they do not support any artificial intelligent technique for implementing the adaptive part in the applications. In this paper, we present MLTutor, an author tool to facilitate the creation of adaptive learning material to be used in mobile devices applying an artificial intelligence approach.
Contention-Based Polling Efficiency in Broadband Wireless Networks
Authors: Sergey D. Andreev, Andrey M. Turlikov, Alexey V. Vinel
Venue: Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications (2008)

This paper addresses the performance of the contention-based polling techniques at the bandwidth reservation stage of IEEE 802.16 standard. A general proposition is proved, which establishes that the grouping of users in the random multiple access system does not change its capacity. Broadcast and multicast polling mechanisms are then considered, for which the throughput and the rate of the truncated binary exponential backoff algorithm are calculated for the lossy and the lossless system types, respectively. It is shown, that subject to proper optimization the performance of the aforementioned algorithm is the same for both system types. The efficiency of the symmetric user grouping is finally studied, which demonstrates that a negligible performance gain may be achieved for the cost of the increased IEEE 802.16 overhead.
Gnort: High Performance Network Intrusion Detection Using Graphics Processors
Authors: Giorgos Vasiliadis, Spiros Antonatos, Michalis Polychronakis, Evangelos P. Markatos, Sotiris Ioannidis
Venue: Proceedings of the 11th international symposium on Recent Advances in Intrusion Detection (2008)

The constant increase in link speeds and number of threats poses challenges to network intrusion detection systems (NIDS), which must cope with higher traffic throughput and perform even more complex per-packet processing. In this paper, we present an intrusion detection system based on the Snort open-source NIDS that exploits the underutilized computational power of modern graphics cards to offload the costly pattern matching operations from the CPU, and thus increase the overall processing throughput. Our prototype system, called Gnort, achieved a maximum traffic processing throughput of 2.3 Gbit/s using synthetic network traces, while when monitoring real traffic using a commodity Ethernet interface, it outperformed unmodified Snort by a factor of two. The results suggest that modern graphics cards can be used effectively to speed up intrusion detection systems, as well as other systems that involve pattern matching operations.
WRITE: Writing Revision Instrument for Teaching English
Authors: Jia-Jiunn Lo, Ying-Chieh Wang, Shiou-Wen Yeh
Venue: Proceedings of the 3rd international conference on Technologies for E-Learning and Digital Entertainment (2008)

Corrective feedback and error correction are important tasks for ESL/EFL (English as a Second Language/English as a Foreign Language) writing instruction. Research findings showed that students' major difficulty in error correction lies in their failure to detect errors. Also, researchers proposed that error analysis can be reinvented in the form of computer-aided error analysis, a new type of computer corpus annotation. Annotations on digital documents can be easily shared among groups of people, making them valuable for a wide variety of tasks, including providing feedback. This study developed a web-based online corrective feedback and error analysis system called WRITE (Writing Revision Instrument for Teaching English). With this system, teachers can make error corrections on digitized documents, on the general web browser such as Microsoft Internet Explorer, with online annotations in the same way as the traditional paper-based correction approach. The WRITE system can feedback correct answers, teachers' comments, and the grammatical error type for each error to students. In addition, this system can provide users the annotation marks subject to different query conditions so that the problem of cognitive overload can be avoided. For error analysis purposes, this system can access the database and analyzes students' errors and displays the results as requested. Students use WRITE will be able to effectively identify more errors. Moreover, the ways that the corrective feedback delivered through the online annotation system can be used by students to develop his/her corrective strategies.
Weak vs. Self vs. Probabilistic Stabilization
Authors: Stéphane Devismes, Sébastien Tixeuil, Masafumi Yamashita
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Self-stabilization is a strong property which guarantees that a network always resume a correct behavior starting from an arbitrary initial state. Weaker guarantees have later been introduced to cope with impossibility results: probabilistic stabilization only gives probabilistic convergence to a correct behavior. Also, weak-stabilization only gives the possibility of convergence. In this paper, we investigate the relative power of weak, self, and probabilistic stabilization, with respect to the set of problems that can be solved. We formally prove that in that sense, weak stabilization is strictly stronger that self-stabilization. Also, we refine previous results on weak stabilization to prove that, for practical schedule instances, a deterministic weak-stabilizing protocol can be turned into a probabilistic self-stabilizing one. This latter result hints at more practical use of weak-stabilization, as such algorithms are easier to design and prove than their (probabilistic) self-stabilizing counterparts.
Special Issue Editorial Introduction: Grids and Geospatial Information Systems
Authors: Marlon E. Pierce
Venue: Concurrency and Computation: Practice Experience (2008)

Grids and Geospatial Information Systems (GIS) are both based on distributed service architectures and have complementary capabilities. GIS systems provide a comprehensive set of services for managing maps, geospatial data sets, and geospatial information that can be applied to areas ranging from access to scientific data by researchers to disaster planning and emergency management. The data and information focus of GIS are being augmented with the computational and virtual organization capabilities of Grid computing by many projects, including the ones by the contributors to this special issue. This editorial introduction serves as an overview of the issues discussed at the GIS-Grid Workshop in the Open Grid Forum and the follow-on papers of this special issue. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Equitable Specialized Block-Colourings for Steiner Triple Systems
Authors: Mario Gionfriddo, Peter Hor&#x00e1;k, Lorenzo Milazzo, Alex Rosa
Venue: Graphs and Combinatorics (2008)

We continue the study of specialized block-colourings of Steiner triple systems initiated in [2] in which the triples through any element are coloured according to a given partition &#x03c0; of the replication number. Such colourings are equitable if &#x03c0; is an equitable partition (i.e., the difference between any two parts of &#x03c0; is at most one). Our main results deal with colourings according to equitable partitions into two, and three parts, respectively.
Optimization of distributed software
Authors: Ion Ivan, Catalin Boja, Adrian Visoiu, Mihai Doinea
Venue: Proceedings of the 7th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems (2008)

The paper analyses the software optimization process from the point of view of distributed applications. There are taken into consideration optimum criteria for this type of applications, structure optimization, source code optimization and maximizing the user satisfaction. The paper focuses on a particular type of distributed applications, one that is developed using Web technologies.
Steering a Leader-Follower Team Via Linear Consensus
Authors: Fabio Pasqualetti, Simone Martini, Antonio Bicchi
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

The paper considers the problem of driving a formation of autonomous mobile agents. The group of mobile devices is represented by a leader-follower network, where the followers update their position using a simple local consensus procedure, while the leaders, whose positions represent the control inputs of the network, are free to move. We characterize the transient behavior of the network, and we solve the containment problem without relying on auxiliary sensors.
Distributed Data Mining in a Ubiquitous Healthcare Framework
Authors: Murlikrishna Viswanathan
Venue: Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence (2007)

Ubiquitous Healthcare (u-healthcare) which focuses on automated applications that can provide healthcare to citizens anywhere/anytime using wired and wireless mobile technologies is becoming increasingly important. Ubiquitous healthcare data provides a mine of hidden knowledge which can be exploited in preventive care and "wellness" recommendations. Data mining is therefore a significant aspect of such systems. Distributed Data mining (DDM) techniques for knowledge discovery from databases help in the thorough analysis of data collected from healthcare facilities enabling efficient decision-making and strategic planning. This paper presents and discusses the development of a prototype ubiquitous healthcare system. The prospects for integrating data mining into this framework are studied using a distributed data mining system. The DDM system employs a mixture modelling mechanism for data partitioning. Initial results with some standard medical databases offer a plausible outlook for future integration.
Recognition and Tracking of 3D Objects
Authors: Christian Wiedemann, Markus Ulrich, Carsten Steger
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

This paper describes a method for recognizing and tracking 3D objects in a single camera image and for determining their 3D poses. A model is trained solely based on the geometry information of a 3D CAD model of the object. We do not rely on texture or reflectance information of the object's surface, making this approach useful for a wide range of object types and complementary to descriptor-based approaches.An exhaustive search, which ensures that the globally best matches are always found, is combined with an efficient hierarchical search, a high percentage of which can be computed offline, making our method suitable even for time-critical applications. The method is especially suited for, but not limited to, the recognition and tracking of untextured objects like metal parts, which are often used in industrial environments.
Investigation of Propane and Methane Bulk Properties Structure Using Two Different Force Fields
Authors: Alessandro Costantini, Antonio Laganà
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Some structural properties of propane and methane bulk system in liquid phase have been estimated using molecular dynamics calculations on the EGEE Grid infrastucture. The effect of adopting two different force fields, OPLS/AMBER and Dreiding, has been analysed and discussed.
Automatic Semantic Annotation of Polish Dialogue Corpus
Authors: Agnieszka Mykowiecka, Małgorzata Marciniak, Katarzyna Głowińska
Venue: Proceedings of the 11th international conference on Text, Speech and Dialogue (2008)

In the paper we present a method of automatic annotation of transliterated spontaneous human-human dialogues on the level of domain attributes. It has been used for the preparation of an annotated corpus of dialogs within LUNA project. We describe the domain ontology, process of manual creation of rules, annotation schema and evaluation.
EnACT: A Software Tool for Creating Animated Text Captions
Authors: Quoc V. Vy, Jorge A. Mori, David W. Fourney, Deborah I. Fels
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Music in captioning is often represented by only its title and/or a music note. This representation provides little to no information of the intended effect or emotion of the music. In this paper, we present a software tool that was created to enable users to mark emotions in a script or lyrics and then render those marks into animated text for display as captions. A pilot study was conducted to collect initial responses to, preferences and understanding of the animated lyrics of one song by a deaf and hard of hearing audience. Participants were able to identify the animated lyrics as belonging to a song and found that the animations helped them understand the portrayed emotions. They also identified the shaking style of animation portraying fear as least preferable.
The Charles Babbage Institute for the History of Information Processing
Venue: IEEE Annals of the History of Computing (1980)

The Charles Babbage Institute for the History of Information Processing (CBI), with AFIPS as a major supporter and participant, has undertaken to continue the task of conducting and otherwise promoting historical research in the field of data processing. And many pioneers in this young field are not only still alive, but are participating in the development of the institute and its programs. 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
The use and management of geographic information in local e-government in the UK
Authors: Phil Turner, Gary Higgs
Venue: Information Polity (2003)

The modernisation of public services in the Information age has placed the use, management and exchange of information at the centre of the work of local government. As much of the information held by councils is location based, the use of Geographic Information Systems (GIS) in these organisations is set to take on a far greater corporate significance. The UK Government's promotion of "joined-up" initiatives in key sectors such as health, education and crime prevention, has focused attention on the types of factors that may influence the exchange and analysis of such data, much of which is held by local authorities. Despite a number of studies that have demonstrated the potential of data sharing, there has been a lack of published research into the relationship between the e-Government programme and the management and use of geographic information (GI) in local authorities. This paper describes the results of a national survey of local authorities that has examined the degree to which councils have included provision for the use and management of geographic information and GIS in their formal visions for e-government. It is clear from the survey that GI(S) are seen as very important to the e-government process with almost ninety per cent of respondents stating that GI(S) features in their e-government strategies. However, if full advantage is to be taken of the integrating ability of geographic information, then effective and efficient management of this information must be undertaken at a corporate level.
Dynamically Delayed Postdictive Completeness and Consistency in Learning
Authors: John Case, Timo Kötzing
Venue: Proceedings of the 19th international conference on Algorithmic Learning Theory (2008)

In computational function learning in the limit, an algorithmic learner tries to find a program for a computable function g given successively more values of g, each time outputting a conjectured program for g. A learner is called postdictively complete iff all available data is correctly postdicted by each conjecture.Akama and Zeugmann presented, for each choice of natural number ¿, a relaxation to postdictive completeness: each conjecture is required to postdict only all except the last ¿ seen data points.This paper extends this notion of delayed postdictive completeness from constant delays to dynamically computed delays. On the one hand, the delays can be different for different data points. On the other hand, delays no longer need to be by a fixed finite number, but any type of computable countdown is allowed, including, for example, countdown in a system of ordinal notations and in other graphs disallowing computable infinitely descending counts.We extend many of the theorems of Akama and Zeugmann and provide some feasible learnability results. Regarding fairness in feasible learning, one needs to limit use of tricks that postpone output hypotheses until there is enough time to "think" about them. We see, for polytime learning, postdictive completeness (and delayed variants): 1. allows some but not all postponement tricks, and 2. there is a surprisingly tight boundary, for polytime learning, between what postponement is allowed and what is not. For example: 1. the set of polytime computable functions is polytime postdictively completely learnable employing some postponement, but 2. the set of exptime computable functions, while polytime learnable with a little more postponement, is not polytime postdictively completely learnable! We have that, for w a notation for ¿, the set of exptime functions is polytime learnable with w-delayed postdictive completeness. Also provided are generalizations to further, small constructive limit ordinals.
Teaching Information Technology and Elements of Informatics in Lower Secondary Schools: Curricula, Didactic Provision and Implementation
Authors: Valentina Dagienė
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

In Lithuania, teaching and learning informatics in general education has more than twenty years of history. Starting from a theoretical informatics subject now we have a combination of using information and communication technologies (ICT) while learning many subjects with some basic elements of informatics (computer science). The general curricula of information technologies (IT) for lower secondary schools in Lithuania were essentially revised and renewed. The paper deals with the goals and approach of introducing ICT into general education. It discusses the competencies and values to be developed while teaching and learning IT and with IT. The links with other school subjects and the relationship between the compulsory IT course and the integrated parts as well as optional modules are described. Educational standards on IT for lower secondary schools are presented.