ppxscal/embedding_network huggingface dataset:
The Asynchronous Distance Education by Means of Internet: Factors that Influence its Effectiveness. The case of Hellenic Open University
Authors: Kiriakos Patriarcheas, Michalis Xenos
Venue: Proceedings of the 2008 Panhellenic Conference on Informatics (2008)

This article presents the findings of a research conducted in the field of asynchronous distance education by means of Internet. The research is focused on the current environment of the Hellenic Open University (HOU) and tries to identify the factors affecting its efficiency. The research contains an analysis of the environment’s current condition of use, based on the statistical data obtained from HOU Laboratory of Educational Material and Methodology; Furthermore, this article contains the answers from the interviews given by 4 tutors who make use of the specific environment and 24 students. The answers to the relevant questions are presented per category, based on the classification made during the study of international bibliography.
Combining OpenEHR Archetype Definitions with SWRL Rules --- A Translation Approach
Authors: Leonardo Lezcano, Miguel-Angel Sicilia, Pablo Serrano-Balazote
Venue: Proceedings of the 1st world summit on The Knowledge Society: Emerging Technologies and Information Systems for the Knowledge Society (2008)

The interoperability of electronic healthcare information systems is critical for a more effective healthcare management. Several specifications and standards have been created for facilitating such interoperability at different levels. Among them, the OpenEHR initiative emphasizes the sharing of flexible specifications of healthcare information pieces in the form of archetypes. However, the OpenEHR ADL language does not provide support for rules and inference which are important pieces of clinical knowledge. This paper reports on an approach to convert ADL definitions to OWL and then attach rules to the semantic version of the archetypes. This allows for an automated means to reuse knowledge expressed in the form of rules which is also flexible and follows the same philosophy of sharing archetypes.
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches
Authors: Alex Kesselman, Kirill Kogan, Michael Segal
Venue: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity (2008)

The buffered crossbar switch architecture has recently gained considerable research attention. In such a switch, besides normal input and output queues, a small buffer is associated with each crosspoint. Due to the introduction of crossbar buffers, output and input contention is eliminated, and the scheduling process is greatly simplified. We analyze the performance of switch policies by means of competitive analysis, where a uniform guarantee is provided for all traffic patterns. The goal of the switch policy is to maximize the weighted throughput of the switch, that is the total value of packets sent out of the switch. For the case of unit value packets (Best Effort), we present a simple greedy switch policy that is 4-competitive. For the case of variable value packets, we consider the Priority Queueing (PQ) mechanism, which provides better Quality of Service (QoS) guarantees by decreasing the delay of real-time traffic. We propose a preemptive greedy switch policy that achieves a competitve ratio of 18. Our results hold for any value of the switch fabric speedup. Moreover, the presented policies incur low overhead and are amenable to efficient hardware implementation at wire speed. To the best of our knowledge, this is the first work on competitive analysis for the buffered crossbar switch architecture.
Adaptive prototype-based fuzzy classification
Authors: Nicolas Cebron, Michael R. Berthold
Venue: Fuzzy Sets and Systems (2008)

Classifying large datasets without any a priori information poses a problem especially in the field of bioinformatics. In this work, we explore the problem of classifying hundreds of thousands of cell assay images obtained by a high-throughput screening camera. The goal is to label a few selected examples by hand and to automatically label the rest of the images afterwards. Up to now, such images are classified by scripts and classification techniques that are designed to tackle a specific problem. We propose a new adaptive active clustering scheme, based on an initial fuzzy c-means clustering and learning vector quantization. This scheme can initially cluster large datasets unsupervised and then allows for adjustment of the classification by the user. Motivated by the concept of active learning, the learner tries to query the most ''useful'' examples in the learning process and therefore keeps the costs for supervision at a low level. A framework for the classification of cell assay images based on this technique is introduced. We compare our approach to other related techniques in this field based on several datasets.
Tactile Graphics Revised: The Novel BrailleDis 9000 Pin-Matrix Device with Multitouch Input
Authors: Thorsten Völkel, Gerhard Weber, Ulrich Baumann
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

We describe the novel BrailleDis 9000 pin-matrix device. The refreshable device allows to present tactile graphics on a matrix of 60 times 120 pins. The pin-matrix device is made up of a newly developed type of vertical Braille module allowing for a compact assembly of all necessary components. Additionally, the pin-matrix device is touch sensitive and capable of detecting multiple points of contact. Using multitouch features, novel multimodal interaction cycles can be realized with the Braille display, such as a bi-manual sweep.
Four Families of Binary Sequences with Low Correlation and Large Linear Complexity
Authors: Jin-Song Wang, Wen-Feng Qi
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

In this paper, four new families S 1, S 2, S 3 and S 4 of binary sequences of period 2 n ¿ 1 with low correlation are presented, where S 1, S 3 are defined for odd n, and S 2, S 4 for even n. The family S 1 has six-valued correlations, while S 2 and S 3 have either six-valued correlations or eight-valued correlations, and S 4 has either eight-valued or ten-valued, depending on the choice of parameters.
A Fault-Tolerant Multimicroprocessor-Based Computer System for Space-Based Signal Processing
Authors: Cedric W. Armstrong, Eli Fathi
Venue: IEEE Micro (1984)

Ensuring the reliability of processing modules on board a satellite would mean a significant reduction in communication bandwidth. The FASP system incorporates a number of software and hardware levels in a fault-tolerantdesign for high-performance applications.
On Generating Backbone Trees through Robust Multi-hop Clusters in Wireless Sensor Networks
Authors: Inyoung Shin, Moonseong Kim, Hyunseung Choo
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

Routing through a backbone, which is responsible for performing and managing multipoint communication, reduces the communication overhead and overall energy consumption in wireless sensor networks. However, the backbone nodes will need extra functionality and therefore consume more energy compared to the other nodes. The unbalanced power consumption among sensor nodes may cause a network partition and failures. Hence optimal construction of the backbone is one of the pivotal problems in sensor network applications. In this paper a distributed algorithm is proposed to generate backbone trees through robust multi-hop clusters in wireless sensor networks. The main objective is to form a properly designed backbone through multi-hop clusters by considering energy level and degree of each node. Comprehensive computer simulations have indicated that the newly proposed scheme gives approximately 58.6% and 79.42% improvements in the performances related to the residual energy level and the degree of the cluster heads respectively.
Semantic Web Approach in Designing a Collaborative E-Item Bank System
Authors: Heung-Nam Kim, Ae-Ttie Ji, Soon-Geun Lee, Geun-Sik Jo
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

Existing item bank systems present a variety of assessments for data management and integration with individual learning evaluation systems. However, as the data in these established item bank systems do not include semantics, the bank systems cannot analyze implications and perform accurate searches such as for synonymous words. Therefore, both learners and teachers can access only simple text data using the item bank system and often waste time checking unnecessary search results and extracting information from data repeatedly. Moreover, since there is no clear definition of the relationship between items and teachers or learners, or between data and units, it is difficult to use and share extra-item information. In order to solve these problems, this research describes the definition of conception and organization by constructing the Ontology of an E-Item Bank system using OWL, which is a form of semantic web technology. Furthermore, on the basis of Ontology, OWL metadata, individuals, are built, semantic factors are then extracted using OWLJessKB. We do not only use this extracted semantic factors as a fact, but also domain rules using SWRL for the JESS inferencing engine. As such, it is possible to make inferences and provide reasoning in web data structures. As a result, it is possible to combine all the data of the E-Item bank system and facilitate understanding of the meanings of concepts by the computer. In addition, a search service with inference can be applied to education and can lead to cooperative study between teachers and students.
The National Bureau of Standards Western Automatic Computer (SWAC)
Authors: Harry D. Huskey
Venue: IEEE Annals of the History of Computing (1980)

The involvement of the National Bureau of Standards in automatic computing prior to 1949 is explained in some detail in order to describe the initiation of the SWAC project at the Institute for Numerical Analysis at UCLA. The status of automatic computing in 1948 and 1949 is presented from contemporary documents. Finally, some details of the SWAC design and an extensive bibliography are given.
Chain-computerisation for better privacy protection: A new approach to developing non-intrusive information infrastructures that improve privacy protection
Authors: Jan Grijpink
Venue: Information Polity (1999)

This is the second1 of a series of two articles in which the author presents some key elements from his recently completed thesis about functional, non-intrusive information infrastructures for interorganisational public policy implementation. The development of these information infrastructures requires a new approach - chain-computerisation - based on new concepts and practices. This methodology is vital for public administration if the problems associated with interorganisational policy implementation are to be overcome. Chain-computerisation recognises the impossibility in many interorganisational settings of implementing government policy, because no single organisational actor has authority over the system. The methodology of chain-computerisation can be applied to many situations where public policy is to be implemented under close co-operation between many autonomous public and private organisations. The first article gave a brief description of the new approach, chain-computerisation, on the basis of some examples. The emphasis was placed on the management aspect&colon; the streamlining of information exchange within and between value chains. In this second article the emphasis is placed on the social significance of chain-computerisation, which brings about information infrastructures with which privacy and anonymous legal transactions can better be supported. System concepts for the organisational border-transgressing exchange of information are not merely a question of technology, but also determine the quality of the information society through the way in which the computerisation of society takes place. It is for this reason that policy makers will have to involve themselves more in those system concepts. To them, the new chain-computerisation approach incorporates an alternative to traditional system concepts. This alternative at the same time clarifies implicit social choices in the traditional system concepts. It will be clear that the examples used here reflect the legal context of the Netherlands or the European Union, but the insights described can also be applied to other governmental and legal cultures. J.H.A.M. Grijpink (1946) studied Economics (1969) and Law (1971) at the University of Groningen, The Netherlands. He received his doctor&rsquo;s degree (1997) at the Technical University of Eindhoven, The Netherlands. He is Principal Adviser at the Dutch Ministry of Justice. He is a Certified Management Consultant (CMC) and a Registered Information Expert (RI). 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
Outer valence orbital response to proton positions in prototropic tautomers of adenine
Authors: Saumitra Saha, Feng Wang, Célia Fonseca Guerra, F. Matthias Bickelhaupt
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

Orbital response to proton positions in the prototropic tautomers of adenine (Ade-N1, Ade-N3, Ade-N7 and Ade-N9) has been studied in position space and momentum space using dual space analysis (DSA). Based on the electronic structures of our previous density functional theory (DFT-BP86/TZ2P and BP86/QZ4P) study of adenine tautomers (J. Phys. Chem. A, 110(2006)4012), variations in properties such as ring perimeters, dipole moments, Hirshfeld charges, vertical ionization spectra and orbital theoretical momentum distributions (MDs) of these tautomers are compared, in order to understand the impact of the mobile proton positions in the purine ring. It is found that the proton relocation causes only small perturbations in isotropic properties such as geometries and vertical ionization energies in the outer valence space of adenine. Molecular polarity and dipole moments differentiate the tautomers. Hirshfeld charges divide the nitrogen sites of the tautomers into amino (single bonds) and imino (at least one double bond) nitrogen sites. Adenine tautomerization is essentially a &sigma;-bonding phenomenon with little perturbation to the &pi;-bonding framework. That is, the &pi; (or a'') orbitals, including the frontier orbitals such as the highest occupied molecular orbital (HOMO), 6a'', and the third HOMO (HOMO-2), 5a'', do not respond apparently to the proton relocation (note that the next HOMO (HOMO-1) is 29a', a &sigma; orbital). Only relevant &sigma; or a' orbitals residing within the purine plane, such as 21a'-24a' and orbital 27a', respond significantly to the proton positions. The present study demonstrates that the tautomer electronic structures depend not only on three dimensional geometries but also on the electron density distributions.
A Neural-Fuzzy Pattern Recognition Algorithm Based Cutting Tool Condition Monitoring Procedure
Authors: Pan Fu, A. D. Hope
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

An intelligent tool wear monitoring system for metal cutting process will be introduced in this paper. The system is equipped with four kinds of sensors, signal transforming and collecting apparatus and a micro computer. A knowledge based intelligent pattern recognition algorithm has been developed. The fuzzy driven neural network can carry out the integration and fusion of multi-sensor information. The weighted approaching degree can measure the difference of signal features accurately and ANNs successfully recognize the tool wear states. The algorithm has strong learning and noise suppression ability. This leads to successful tool wear classification under a range of machining conditions.
Texture Classification with Generalized Fourier Descriptors in Dimensionality Reduction Context: An Overview Exploration
Authors: Ludovic Journaux, Marie-France Destain, Johel Miteran, Alexis Piron, Frederic Cointault
Venue: Proceedings of the 3rd IAPR workshop on Artificial Neural Networks in Pattern Recognition (2008)

In the context of texture classification, this article explores the capacity and the performance of some combinations of feature extraction, linear and nonlinear dimensionality reduction techniques and several kinds of classification methods. The performances are evaluated and compared in term of classification error. In order to test our texture classification protocol, the experiment carried out images from two different sources, the well known Brodatz database and our leaf texture images database.
Product information visualization and augmentation in collaborative design
Authors: Y. Shen, S. K. Ong, A. Y. C. Nee
Venue: Computer-Aided Design (2008)

In this paper, a collaborative system for product information visualization and augmentation is presented. The developed system allows the users, who can be remotely distributed, to view a product model, which is a geometric representation of the product, from different perspectives. They can choose to view design and product history, such as previous modification processes and feature information of the product independently. The product models displayed to the users are immediately updated after any design modifications have been made to the CAD model. Product features being discussed can be highlighted to draw the users' attention. In addition, modifications can be displayed dynamically for the users to evaluate the design effect. The product history document module in the system provides a user-friendly interface for retrieving design records. After a specific record has been chosen, the related product model is displayed, and it can be aligned with the current product model for the ease of comparison and evaluation. The feature information of the product is displayed using virtual ''floating'' annotations linked to the related features. A user interface to enter annotations is provided, and the annotations entered by different users can be shared in real time. A cluster-based greedy algorithm is implemented to avoid overlapping annotations in the field of view.
Pareto-Optimality of Cognitively Preferred Polygonal Hulls for Dot Patterns
Authors: Antony Galton
Venue: Proceedings of the international conference on Spatial Cognition VI: Learning, Reasoning, and Talking about Space (2008)

In several areas of research one encounters the problem of generating an outline that is in some way representative of the spatial distribution of a pattern of dots. Several different algorithms have been published which can generate such outlines, but the detailed evaluation of such algorithms has mostly concentrated on their computational and mathematical properties, while the adequacy of the resulting outlines themselves has been left as a matter of informal human judgment. In this paper it is proposed to investigate the perceptual acceptability of outlines independently of any particular algorithm for generating them, in order to determine objective criteria for evaluating outlines from the full range of possibilities in a way that is conformable to human intuitive assessments. For the sake of definiteness it is assumed that the outline to be produced is a simple closed polygon whose vertices are elements of the given dot pattern, all remaining elements of the dot pattern being in the interior of the polygon. It is hypothesised that to produce a cognitively acceptable outline one should seek simultaneously to minimise both the area and perimeter of the polygon, and that therefore the points in area-perimeter space corresponding to cognitively optimal outlines will lie on or close to the Pareto front. A small pilot study was conducted, the results of which lend strong support to the hypothesis. The paper concludes with some suggestions for further more detailed investigations.
Macro Adjustment Based Task Scheduling in Hierarchical Grid Market
Authors: Peijie Huang, Hong Peng, Xuezhen Li
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Hierarchical organization is suitable for computational Grid. Although a number of Grid systems adopt this organization, few of them have dealt with the task scheduling for the hierarchical architecture. In this paper, we introduce a hierarchical Grid market model, which maintains the autonomy of the Grid end users, but incorporates macro adjustment of Grid information center into hierarchical Grid task scheduling. Simulation experiments show that the proposed method can improve the inquiry efficiency for resource consumers and get better load balancing of the whole hierarchical Grid market.
Proposal for a Multiagent Architecture for Self-Organizing Systems (MA-SOS)
Authors: Niriaska Perozo, Jose Aguilar, Oswaldo Terán
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

This work investigates the trade-off between individual and collective behavior, to dynamically satisfy the requirements of the system through self-organization of its activities and individual (agent) adaptability. For this purpose, it is considered that each agent varies its behavioral laws (behavior-switching) dynamically, guided by its emotional state in a certain time instant.
Identifying Single Source Data for Mixing Matrix Estimation in Instantaneous Blind Source Separation
Authors: Pau Bofill
Venue: Proceedings of the 18th international conference on Artificial Neural Networks, Part I (2008)

This paper presents a simple yet effective way of improving the estimate of the mixing matrix, in instantaneous blind source separation, by using only reliable data.The paper describes how the idea of detecting single source data is implemented by selecting only the data which remain for two consecutive frames in the same spatial signature. Such data, which are most likely to belong to a single source, are then used to accurately identify the spatial directions of the sources and, hence, the mixing matrix.The paper also presents a refined histogram procedure which improves on the potential function method to estimate the mixing matrix, in the two dimensional case (two sensors).The approach was experimentally evaluated and submitted to the first Stereo Audio Source Separation Evaluation Campaign (SASSEC), with good results in matrix estimation both for development and test data.