ppxscal/embedding_network huggingface dataset:
Evaluation of TELEDERM for dermatological services in rural and remote areas
Authors: Monica H. Ou, Geoff A. W. West, Mihai Lazarescu, Chris D. Clay
Venue: Artificial Intelligence in Medicine (2008)

Objective: This paper describes the Web-based decision support system (TELEDERM) that provides medical services to rural and remote general practitioners (GPs), and presents qualitative results on the usefulness and usability of the system obtained from trials in the GoldFields, Western Australia. Methods: Diagnostic methods and other functions were developed to assist medical practitioners, who may not be familiar with aspects of decision support systems, to diagnose patients with dermatological problems. GPs in rural and remote areas took part in a trial to assess the usefulness of TELEDERM in clinical situations. In evaluating and assessing a number of the system's characteristics, questionnaires, seminars and interviews were used. Results and conclusions: Feedback concerning the usefulness of TELEDERM shows that 67% of the GPs found the system useful or very useful, and 25% found the system somewhat useful. In terms of its usability, 83% found the system easy to use. The responses concerning the user interface and interactivity of TELEDERM are encouraging as 92% of the GPs found the text easy to read, 84% were happy with the appearance of the interface, and 84% found the system easy to navigate. 89% indicated that they are likely to use the system again. An issue with such systems is the reluctance of GPs to use them, even given that the development was quite sensitive to the needs of the GPs and the consultants, e.g. by streamlining the query process and emphasising that the system is a support tool and not a replacement.
Sorting Out Dependency Parsing
Authors: Joakim Nivre
Venue: Proceedings of the 6th international conference on Advances in Natural Language Processing (2008)

This paper explores the idea that non-projective dependency parsing can be conceived as the outcome of two interleaved processes, one that sorts the words of a sentence into a canonical order, and one that performs strictly projective dependency parsing on the sorted input. Based on this idea, a parsing algorithm is constructed by combining an online sorting algorithm with an arc-standard transition system for projective dependency parsing.
Can Software Be Tied to Hardware? Part I
Authors: Richard Stern
Venue: IEEE Micro (1983)

Requiring operating system software to be used only with the software proprietor's CPU has been held not to violate the federal antitrust laws. 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
From High Girth Graphs to Hard Instances
Authors: Carlos Ansótegui, Ramón Béjar, César Fernàndez, Carles Mateu
Venue: Proceedings of the 14th international conference on Principles and Practice of Constraint Programming (2008)

In this paper we provide a new method to generate hard k-SAT instances. Basically, we construct the bipartite incidence graph of a k-SAT instance where the left side represents the clauses and the right side represents the literals of our Boolean formula. Then, the clauses are filled by incrementally connecting both sides while keeping the girth of the graph as high as possible. That assures that the expansion of the graph is also high. It has been shown that high expansion implies high resolution width w. The resolution width characterizes the hardness of an instance F of n variables since if every resolution refutation of F has width w then every resolution refutation requires size $2^{\Omega(w^2/n)}$. We have extended this approach to generate hard n-ary CSP instances. Finally, we have also adapted this idea to increase the expansion of the system of linear equations used to generate XOR-SAT instances, being able to produce harder satisfiable instances than former generators.
Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y2 = x5 + ax
Authors: Mitsuru Kawazoe, Tetsuya Takahashi
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

An explicit construction of pairing-friendly hyperelliptic curves with ordinary Jacobians was firstly given by D. Freeman. In this paper, we give other explicit constructions of pairing-friendly hyperelliptic curves with ordinary Jacobians based on the closed formulae for the order of the Jacobian of a hyperelliptic curve of type y 2 = x 5 + ax. We present two methods in this paper. One is an analogue of the Cocks-Pinch method and the other is a cyclotomic method. By using these methods, we construct a pairing-friendly hyperelliptic curve y 2 = x 5 + ax over a finite prime field ${\mathbb F}_p$ whose Jacobian is ordinary and simple over ${\mathbb F}_p$ with a prescribed embedding degree. Moreover, the analogue of the Cocks-Pinch produces curves with ρ ≈ 4 and the cyclotomic method produces curves with 3 ≤ ρ ≤ 4.
A Hybrid Fuzzy Heuristic for Point Data Reduction in Reverse Engineering
Authors: Jianjie Wu, Qifu Wang, Yunbao Huang, Yonglin Li
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

As modeling and visualization applications proliferate, there arises a need to reduce three dimensional unorganized data points in reverse engineering. To meet the demand for both geometric and engineering fidelity of the reduction, a fuzzy-clustering-based reduction method is presented. As an effective extension to the existing pure geometric reduction methods, a hybrid heuristic is introduced. It includes descriptions of samples’ fuzzy imperative attributes and fuzzy geometric attributes. Reduced points favor to gather at regions of high curvature and surface boundaries. Detailed features, which are particularly valuable for machining, can be well preserved. The method works directly on the point cloud, requiring no intermediate tessellation. The algorithm is experimented on different models and show reasonable results.
Unsupervised and Knowledge-Free Morpheme Segmentation and Analysis
Authors: Stefan Bordag
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

This paper presents a revised version of an unsupervised and knowledge-free morpheme boundary detection algorithm based on letter successor variety (LSV) and a trie classifier [1]. Additional knowledge about relatedness of the found morphs is obtained from a morphemic analysis based on contextual similarity. For the boundary detection the challenge of increasing recall of found morphs while retaining a high precision is tackled by adding a compound splitter, iterating the LSV analysis and dividing the trie classifier into two distinctly applied clasifiers. The result is a significantly improved overall performance and a decreased reliance on corpus size. Further possible improvements and analyses are discussed.
Hierarchical, Parameter-Free Community Discovery
Authors: Spiros Papadimitriou, Jimeng Sun, Christos Faloutsos, Philip S. Yu
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

Given a large bipartite graph (like document-term, or userproduct graph), how can we find meaningful communities, quickly, and automatically? We propose to look for community hierarchies, with communities- within-communities. Our proposed method, the Context-specific Cluster Tree (CCT) finds such communities at multiple levels, with no user intervention, based on information theoretic principles (MDL). More specifically, it partitions the graph into progressively more refined subgraphs, allowing users to quickly navigate from the global, coarse structure of a graph to more focused and local patterns. As a fringe benefit, and also as an additional indication of its quality, it also achieves better compression than typical, non-hierarchical methods. We demonstrate its scalability and effectiveness on real, large graphs.
Metadata Management in S-OGSA
Authors: Oscar Corcho, Pinar Alper, Paolo Missier, Sean Bechhofer, Carole Goble, Wei Xing
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

Metadata-intensive applications pose strong requirements for metadata management infrastructures, which need to deal with a large amount of distributed and dynamic metadata. Among the most relevant requirements we can cite those related to access control and authorisation, lifecycle management and notification, and distribution transparency. This paper discusses such requirements and proposes a systematic approach to deal with them in the context of S-OGSA.
Systematic Parallelization of Medical Image Reconstruction for Graphics Hardware
Authors: Maraike Schellmann, Jürgen Vörding, Sergei Gorlatch
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Modern Graphics Processing Units (GPUs) consist of several SIMD-processors and thus provide a high degree of parallelism at low cost. We introduce a new approach to systematically develop parallel image reconstruction algorithms for GPUs from their parallel equivalents for distributed-memory machines. We use High-Level Petri Nets (HLPN) to intuitively describe the parallel implementations for distributed- memory machines. By denoting the functions of the HLPN with memory requirements and information about data distribution, we are able to identify parallel functions that can be implemented efficiently on the GPU. For an important iterative medical image reconstruction algorithm --the list-mode OSEM algorithm--we demonstrate the limitations of its distributed-memory implementation and show how our HLPN-based approach leads to a fast implementation on GPUs, reusable across different medical imaging devices.
Data-Centric Visual Sensor Networks for 3D Sensing
Authors: Mert Akdere, Uğur Çetintemel, Daniel Crispell, John Jannotti, Jie Mao, Gabriel Taubin
Venue: GeoSensor Networks: Second International Conference, GSN 2006, Boston, MA, USA, October 1-3, 2006, Revised Selected and Invited Papers (2008)

Visual Sensor Networks (VSNs) represent a qualitative leap in functionality over existing sensornets. With high data rates and precise calibration requirements, VSNs present challenges not faced by today's sensornets. The power and bandwidth required to transmit video data from hundreds or thousands of cameras to a central location for processing would be enormous.A network of smart cameras should process video data in real time, extracting features and three-dimensional geometry from the raw images of cooperating cameras. These results should be stored and processed in the network, near their origin. New content-routing techniques can allow cameras to find common features--critical for calibration, search, and tracking. We describe a novel query mechanism to mediate access to this distributed datastore, allowing high-level features to be described as compositions in space-time of simpler features.
Problems in the ontology of computer programs
Authors: Amnon H. Eden, Raymond Turner
Venue: Applied Ontology (2007)

As a first step in the larger project of charting the ontology of computer programs, we pose three central questions: (1) Can programs, hardware, and metaprograms be organized into a meaningful taxonomy? (2) To what ontology are computer programs committed? (3) What explains the proliferation of programming languages and how do they come about? Taking the complementary perspectives software engineering and mathematical logic, we take inventory of programs and related objects and conclude that the notions of abstraction and concretization take a central role in this investigation.
The Behavior of Tutoring Systems
Authors: Kurt Vanlehn
Venue: International Journal of Artificial Intelligence in Education (2006)

Tutoring systems are described as having two loops. The outer loop executes once for each task, where a task usually consists of solving a complex, multi-step problem. The inner loop executes once for each step taken by the student in the solution of a task. The inner loop can give feedback and hints on each step. The inner loop can also assess the student's evolving competence and update a student model, which is used by the outer loop to select a next task that is appropriate for the student. For those who know little about tutoring systems, this description is meant as a demystifying introduction. For tutoring system experts, this description illustrates that although tutoring systems differ widely in their task domains, user interfaces, software structures, knowledge bases, etc., their behaviors are in fact quite similar.
MySpeechWeb: software to facilitate the construction and deployment of speech applications on the web
Authors: Richard A. Frost, Ali Karaki, David A. Dufour, Josh Greig, Rahmatullah Hafiz, Yue Shi, Shawn Daichendt, Shahriar Chandon, Justin Barolak, Randy J. Fortier
Venue: Proceedings of the 10th international ACM SIGACCESS conference on Computers and accessibility (2008)

Few voice-in/voice-out applications are available on the web. One problem appears to be the lack of appropriate open-source tools. More speech applications would increase the functionality of the web for people with visual, cognitive, and motor disabilities. Our research group has developed open-source tools for the creation and deployment of speech applications by non-expert as well as expert users, and an open-source software platform to deploy those applications on the web. In addition, a suite of exemplar speech applications, together with documentation, has been built to facilitate the creation and deployment of similar applications by others.
Research on a Method of Unambiguous Velocity Measurement of the Space Surveillance Low PRF Radars
Authors: Tao Wu, Qiang Qu, Sijie Yuan, Xin Wei
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

General description, mathematical analysis and simulation research results of an unambiguous radial velocity measurement method concerning the space surveillance low pulse repetition frequency (PRF) radars are presented in the paper. The low PRF radars, used primarily for searching and precisely target tracking, obtain target’s accurate range as the primary measured parameter and are ambiguous in radial velocity measurement. In this paper, unambiguous target’s radial velocity values can be obtained in low PRF radars through the digital intermediate frequency locked loop (DIFLL) and spectrum peak search (SPS). The simulation results verify the availability and high practicable value of the method.
Identifying and Improving Reusability Based on Coupling Patterns
Authors: Andrea Capiluppi, Cornelia Boldyreff
Venue: Proceedings of the 10th international conference on Software Reuse: High Confidence Software Reuse in Large Systems (2008)

Open Source Software (OSS) communities have not yet taken full advantage of reuse mechanisms. Typically many OSS projects which share the same application domain and topic, duplicate effort and code, without fully leveraging the vast amounts of available code.This study proposes the empirical evaluation of source code folders of OSS projects in order to determine their actual internal reuse and their potential as shareable, fine-grained and externally reusable software components by future projects.This paper empirically analyzes four OSS systems, identifies which components (in the form of folders) are currently being reused internally and studies their coupling characteristics. Stable components (i.e., those which act as service providers rather than service consumers) are shown to be more likely to be reusable. As a means of supporting replication of these successful instances of OSS reuse, source folders with similar patterns are extracted from the studied systems, and identified as externally reusable components.
Tactical Battlefield Entities Simulation Model Based on Multi-agent Interactions
Authors: Xiong Li, Sheng Dang
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

Tactical warfare process, e.g., engagement between opposite forces, is full of unpredictability and platform-level interactions that result great difficulties in performing battlefield entities simulation. In this paper, modeling and simulation based on multi-agent interactions is applied to solve the problem. Based on the analysis on the requirement and countermeasure, the mapping from tactical warfare system's members, i.e. platform-level tactical battlefield entities, to respective intelligent agents is set up. Thus, the multi-agent platform-level tactical battlefield entities simulation system and its agent model are designed. Tactical battlefield entity agent interactions model is presented to support simulation based on multi-agent interactions by using an improved Contract Net Protocol. The established demonstration system proves the feasibility and efficiency of our model and shows its advantages in realizing platform-level military simulation.
Duality Reconstruction --- Teaching Digital Artifacts from a Socio-technical Perspective
Authors: Carsten Schulte
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

This paper presents a duality perspective for teaching everyday software products. The concept includes didactical lenses as a means to teach students conceptual models of such digital artifacts. The duality of structure and function is proposed as a didactic category to educationally reconstruct digital artifacts from different perspectives (lenses). A comparison of teaching concepts for word processors serves to illustrate the proposed concept of duality reconstruction.
Rule-Based Modeling of Assembly Constraints for Line Balancing
Authors: Latif Salum, Aliye Ayca Supciller
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

The assembly line balancing problem employs traditional precedence diagrams to model precedence relations among assembly tasks. Yet they cannot address alternative ways of assembling a product. That is, they only model conjunctions (AND relations), not disjunctions (OR relations). However, there may be some alternative assembly plans for a product. Moreover, some complicated constraints need also to be considered, but these constraints cannot be modeled effectively through traditional precedence diagrams. This paper proposes a rule-based representation to address these issues. The rule-base alone can model any constraint effectively. The paper also shows that the rule-base can easily be employed by heuristics used for line balancing problems.
Detect Information-Hiding Type and Length in JPEG Images by Using Neuro-fuzzy Inference Systems
Authors: Qingzhong Liu, Andrew H. Sung
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 5 - Volume 05 (2008)

In this paper, we present a scheme of steganalysis of JPEG images with the use of polynomial fitting and computational intelligence techniques. Based on the Generalized Gaussian Distribution (GGD) model in the quantized DCT coefficients, the errors between the logarithmic domain of the histogram of the DCT coefficients and the polynomial fitting are extracted as features to detect the adulterated JPEG images and the untouched ones. Computational intelligence techniques such as Support Vector Machines (SVM), neuro-fuzzy inference system, etc. are utilized. Results show that, the designed method is successful in detecting the information-hiding types and the information-hiding length in the multi-class JPEG images.
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
Venue: International Conference on Mobile Computing and Networking (2008)

Welcome to the Fifth ACM International Workshop on VehiculAr InterNETworking (VANET 2008) in beautiful San Francisco! After the success of the previous four events, 2008 is a great year to continue this exciting workshop. The application of short- to medium-range vehicle communication systems (vehicle-to- vehicle as well as vehicle-to-roadside) technologies is closer to reality than ever before and the widespread deployment of a communications infrastructure on the roadways and in production vehicles has the potential to improve transportation and the quality of life in ways not imagined a generation ago. VANET technology is entering a critical phase where academia, industry and governments worldwide are investing significant time and resources to either prepare for a larger scale deployment decision or to already deploy this technology so that its many benefits in the areas of safety, improvement of traffic flow and convenience can be leveraged. As the change in the name (but not the acronym) of the workshop witnesses, this year we have made a particular effort in broadening VANET scope, both from a horizontal and vertical perspective. Horizontally, the workshop focuses not only on "ad hoc" type of networks (i.e., car-to-car communications), but on vehicular networks in general (including car-to-infrastructure communications). Vertically, the workshop focuses on issues ranging from physical up to the application layer. The technical program committee composition has been adapted to reflect the broadened VANET scope. This year we received 35 submissions for the regular program of the VANET workshop. Each paper was assigned to three TPC members and received at least three reviews. While for most papers the final decision was straight forward, some papers with heterogeneous reviews were discussed thoroughly by the TPC members. In the end we accepted nine submissions as full papers while the authors of seven additional submissions where invited to present their work as a poster. Due to space constraints and given the excellent quality of this year's submissions, we had to make very tough decisions during this selection process.
An Improvement of the Ateniese's Verifiable Encryption Protocol
Authors: Constantin Popescu
Venue: Informatica (2005)

Verifiable encryption is a primitive that can be used to build extremely efficient fair exchange protocols where the items exchanged represent digital signatures. Such protocols may be used to digitally sign contracts on the Internet. This paper presents an efficient protocol for verifiable encryption of digital signatures that improves the security and efficiency of the verifiable encryption scheme of Ateniese. Our protocol can be applied to group signatures, key escrow and publicly verifiable secret and signature sharing to prove the fairness. The author is presently at &ldquo;Centre for Quantifiable Quality of Service in Communication Systems&rdquo; (Q2S), NTNU, Trondheim, Norway. The centre is appointed Centre of Excellence by The Research Council of Norway. It is financed by the Research Council, NTNU and UNINETT, and supported by Telenor.