ppxscal/embedding_network huggingface dataset:
A Robust Online Sequential Extreme Learning Machine
Authors: Minh-Tuan T. Hoang, Hieu T. Huynh, Nguyen H. Vo, Yonggwan Won
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Online-sequential extreme learning machine (OS-ELM) shows a good solution to online learning using extreme learning machine approach for single-hidden-layer feedforward network. However, the algorithm tends to be data-dependent, i.e. the bias values need to be adjusted depending on each particular problem. In this paper, we propose an enhancement to OS-ELM, which is referred to as robust OS-ELM (ROS-ELM). ROS-ELM has a systematic method to select the bias that allows the bias to be selected following the input weights. Hence, the proposed algorithm works well for every benchmark dataset. ROS-ELM has all the pros of OS-ELM, i.e. the capable of learning one-by-one, chunk-by-chunk with fixed or varying chunk size. Moreover, the performance of the algorithm is higher than OS-ELM and it produces a better generalization performance with benchmark datasets.
Stream Transfer Balancing Scheme Utilizing Multi-path Routing in Networks on Chip
Authors: Piotr Dziurzanski, Tomasz Maka
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

A novel technique for balancing streams of data transferred in every cycle in the wormhole routing dedicated for Networks on Chip architectures is presented in this work. The influence of the traditional and the proposed techniques over the total network flow is computed for popular multimedia stream-based algorithms. The experimental results confirming the proposed approach are provided.
Regularity of Kronecker stratification of families of singular systems under proportional and derivative feedback
Authors: M. Isabel García-Planas
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

We study the partition of the set of singular systems according to the complete set of discrete invariants. We show that it is a constructible stratification and that it is Whitney regular for one input regularizable systems. We give an application to the obtention of bifurcation diagrams for few parameter generic families of singular regularizable systems.
Extending Grid-Based Workflow Tools With Patterns/Operators
Authors: Cecilia Gomes, Omer F. Rana, Jose Cunha
Venue: International Journal of High Performance Computing Applications (2008)

Many grid applications involve combining computational and data access components into complex workflows. A distinction is generally made between mechanisms to compose components (referred to as build-time functions) and subsequent mechanisms to execute these components on distributed resources (referred to as run-time functions). An approach to supporting such build- and run-time functions using specialist patterns and operators is presented. "Structural" patterns may be treated as meta-components within a workflow system, and used within the composition process. Subsequently, such components may be scheduled for execution using "behavioral" patterns via the enactment process. Application examples are presented to demonstrate how such patterns - and subsequently operators - may be used. Their implementation within the Triana Problem Solving Environment is also described.
Automated Book Reader Design for Persons with Blindness
Authors: Lu Wang, Malek Adjouadi
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This research introduces a novel automated book reader as an assistive technology tool for persons with blindness in the reading of books and other bound volumes. This design responds to the main concerns of (a) providing a method of image acquisition that maintains the integrity of the source, (b) overcoming optical character recognition errors created by inherent imaging issues such as curvature effects and lens distortion, and (c) determining a suitable method for accurate recognition of characters that yields an interface with the ability to read from any open book with a high reading accuracy nearing 98%. The theoretical perspective of this research relates to the mathematical developments to resolve both the inherent distortions due to the properties of the camera lens and the anticipated distortions of the changing page curvature as one leafs through the book.
Strategies for advancing the status of women scientists and engineers in Korea
Authors: So Young Sohn, Jong Ha Lee
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

In a knowledge-based society, all scientists and engineers would presumably have an increased role. However, women scientists and engineers are less prominent than men in their respective fields, despite their eminent knowledge and ability. Therefore, we investigate strategies to boost the activities of women scientists and engineers in Korea using data mining techniques such as factor analysis, cluster analysis, and logistic regression analysis. As a result of our analysis, four groups were identified. We propose strategies for improvement based on the strengths and weaknesses of each group.
Classification of Documents Based on the Structure of Their DOM Trees
Authors: Peter Geibel, Olga Pustylnikov, Alexander Mehler, Helmar Gust, Kai-Uwe Kühnberger
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part II (2008)

In this paper, we discuss kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees in which every node might be labeled by a vector of attributes including its XML tag and the textual content. We describe five new kernels suitable for such structures: a kernel based on predefined structural features, a tree kernel derived from the well-known parse tree kernel, the set tree kernel that allows permutations of children, the string tree kernel being an extension of the so-called partial tree kernel, and the soft tree kernel as a more efficient alternative. We evaluate the kernels experimentally on a corpus containing the DOM trees of newspaper articles and on the well-known SUSANNE corpus.
Design and Implementation of Mobile Cobrowsing Service which Supports the Sharing of Web Page Among Mobile Users
Authors: Do-Hyung Kim, Hwan-Gu Lee, Won-Tae Kim, Sun-Ja Kim, Cheol-Hoon Lee
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

This paper describes the design and implementation of Mobile Cobrowsing Service based on embedded Linux Mobile Cobrowsing supports the sharing of same web page among mobile users. For effective web page sharing among mobile users, Mobile Cobrowsing provides the synchronization of web page movement, synchronization of web page scroll, synchronization of annotation, and management of control authority. It also provides the voice chatting function among users. Mobile Cobrowsing is developed on MCC mobile terminal made by ETRI and we verify the Mobile Cobrowsing service using web page contents.
Petri Net-Based Simulation and Analysis of the Software Development Process
Authors: Gordan Topic, Dragan Jevtic, Marijan Kunstic
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

This paper explores improvements which can be achieved by applying Petri nets to the modeling, simulation and analysis of the software development process. The huge complexity of this process, in conjunction with the demand for rapid reaction to market pressure, hard limits on time and cost, and the fluidity of human resource organization can make it considerably difficult to establish a confident software development process. Simulations of such processes using Petri net models show considerable benefits with respect to real factors such as resource requirements, representation of critical borders, the effects of resource deficit, delays in process phases, etc.
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Authors: Frank Höppner, Mirko Böttcher
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algorithm that addresses this problem by exploiting temporal information which is contained in most business data sets. The algorithm enables the detection of local patterns in noisy data sets more reliable compared to the case when the temporal information is ignored. This is achieved by making use of the fact that noise does not reproduce its incidental structure but even small patterns do. In particular, we developed a method to track clusters over time based on an optimal match of data partitions between time periods.
Semantics and analysis of business process models in BPMN
Authors: Remco M. Dijkman, Marlon Dumas, Chun Ouyang
Venue: Information and Software Technology (2008)

The Business Process Modelling Notation (BPMN) is a standard for capturing business processes in the early phases of systems development. The mix of constructs found in BPMN makes it possible to create models with semantic errors. Such errors are especially serious, because errors in the early phases of systems development are among the most costly and hardest to correct. The ability to statically check the semantic correctness of models is thus a desirable feature for modelling tools based on BPMN. Accordingly, this paper proposes a mapping from BPMN to a formal language, namely Petri nets, for which efficient analysis techniques are available. The proposed mapping has been implemented as a tool that, in conjunction with existing Petri net-based tools, enables the static analysis of BPMN models. The formalisation also led to the identification of deficiencies in the BPMN standard specification.
Information Coordination Using Meta-agents in Information Logistics Processes
Authors: Mats Apelkrans, Anne Håkansson
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

In order to coordinate and deliver information in the right time and to the right place, theories from multi-agent systems and information logistics are combined. We use agents to support supply chain by searching for company specific information. Hence, there are a vast number of agents working at the Internet, simultaneously, which requires supervising agents. In this paper, we suggest using meta-agents to control the behaviour of a number of intelligent agents, where the meta-agents are working with coordination of the communication that takes place in a supply chain system. As an example, we look at a manufacturing company receiving orders on items from customers, which need to be produced. The handling of this distributed information flow can be thought of as an Information Logistics Processes and the similarities of the functioning of processes and intelligent agents' behaviour are illuminated.
Formal Representation of Mathematics in a Dependently Typed Set Theory
Authors: Feryal Fulya Horozal, Chad E. Brown
Venue: Proceedings of the 14th symposium on Towards Mechanized Mathematical Assistants: 6th International Conference (2007)

We have formalized material from an introductory real analysis textbook in the proof assistant Scunak. Scunak is a system based on set theory encoded in a dependent type theory. We use the formalized material to illustrate some interesting aspects of the relationship between informal presentations of mathematics and their formal representation. We focus especially on a representative example proved using the system.
Simulating process chain models with OMNeT++
Authors: Falko Bause, Peter Buchholz, Jan Kriege, Sebastian Vastag
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

This paper presents an approach to simulate complex hierarchical process chains resulting from large logistics networks in OMNeT++, a discrete event simulation environment designed for communication networks. For this purpose OMNeT++ has been integrated as a new simulation engine into the ProC/B toolset which is designed for the analysis and optimization of large logistics networks. The paper highlights the main steps of the automatic transformation of a hierarchical process chain model into a hierarchical model in OMNeT++. Furthermore it shows how the transformation has been validated and how detailed performance figures can be evaluated with OMNeT++.
MR Compatible Tactile Sensing and Noise Analysis in a 1.5 Tesla MR System
Authors: Abbi Hamed, Zion Tsz Tse, Ian Young, Michael Lamperth
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

Medical technologies have undergone significant development to overcome the problems inherent in Minimally Invasive Surgery (MIS) such as inhibited manual dexterity, reduced visual information and lack of direct touch feedback to make it easier for surgeons to operate. An endoscopic tool incorporating haptic feedback is being developed to increase the effectiveness of diagnostic procedures by providing force feedback. Magnetic Resonance Imaging (MRI) guidance is possible to allow tool localisation, however this enforces the requirement of MR compatibility on the device. This paper describes the work done in developing MR compatible sensing devices using piezoelectric sensor elements in two different formats and how each can be used to locate subsurface inclusions in s mined oft substrates. Results show that the position of a hard inclusion can be deterwith both methods.
A Cooperative Game Theoretic Approach to Prototype Selection
Authors: Narayanan Rama Suri, V. Santosh Srinivas, M. Narasimha Murty
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

In this paper we consider the task of prototype selection whose primary goal is to reduce the storage and computational requirements of the Nearest Neighbor classifier while achieving better classification accuracies. We propose a solution to the prototype selection problem using techniques from cooperative game theory and show its efficacy experimentally.
Plenary lecture II: advanced front-end electronics to extend the pulse height spectroscopy range well beyond
Authors: Gh. Pascovici
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

Using innovative front-end electronics developed for a 36_fold segmented High-Purity Germanium detectors we were able to significantly extend the range of spectroscopic measurements well beyond the fast pipeline ADC limit. To do that above a certain threshold we are switching automatically from a standard pulse height analysis to a Time_over_Threshold [TOT] method (Wilkinson like) and combined we obtain an unprecedented intrinsic dynamic range as large as 100 dB. To achieve that performance the structure of the front-end electronics consists of a very low noise and very high dynamic range charge-sensitive preamplifier followed by a passive pole-zero cancellation circuit including a highly accurate Fast_Reset circuit controlled by a fast comparator and zero crossing detector. A differential buffer Gain/ Anti-Aliasing stage is used to pass the signal to a 14 bit 100MHz pipeline ADC. With a thick HP-Germanium detector we could extend the initial dynamic range measured with a standard pulse height spectroscopic method from 3 keV - 10 MeV to 3 keV - 170 MeV (equivalent gamma energy, measured with large pulser signal). The intrinsic energy resolution (i.e. electronic noise) is 900 eV @ 30 pF detector capacity. The energy resolution above the comparator threshold measured with the present TOT method is below 0.08 % @ 100 MeV (equivalent gamma energy i.e. pulse signals with amplitudes about 10 times higher than the ADC analog input range). The measured energy resolution is in very good agreement with analytical calculation and with inter-comparison measurements with normal pulse height mode only and reduced electronic gain. The new time-variant circuit technique, proposed for nuclear pulse spectroscopy, permits a substantial improvement of the energy measurement dynamic range. This technique can be directly used in many other experimental pulse spectroscopic methods where the sensor is in a first approximation an equivalent capacitance.
Grammar-based random walkers in semantic networks
Authors: Marko A. Rodriguez
Venue: Knowledge-Based Systems (2008)

Semantic networks qualify the meaning of an edge relating any two vertices. Determining which vertices are most ''central'' in a semantic network is difficult because one relationship type may be deemed subjectively more important than another. For this reason, research into semantic network metrics has focused primarily on context-based rankings (i.e. user prescribed contexts). Moreover, many of the current semantic network metrics rank semantic associations (i.e. directed paths between two vertices) and not the vertices themselves. This article presents a framework for calculating semantically meaningful primary eigenvector-based metrics such as eigenvector centrality and PageRank in semantic networks using a modified version of the random walker model of Markov chain analysis. Random walkers, in the context of this article, are constrained by a grammar, where the grammar is a user-defined data structure that determines the meaning of the final vertex ranking. The ideas in this article are presented within the context of the Resource Description Framework (RDF) of the Semantic Web initiative.
Self-interference in Multi-hop Wireless Chains: Geometric Analysis and Performance Study
Authors: Saquib Razak, Nael B. Abu-Ghazaleh
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

In the presence of interference, two single hop links can interact in a number of different ways, exhibiting significantly different behavior. In this paper, we consider the impact of these two-flow interactions on multi-hop chains. Specifically, we characterize the different types of interactions that arise in chains between hops that do not share a common node. We develop closed formed expressions to estimate the probability of occurrence of these interaction combinations. We use simulation to characterize the performance of the most common types of chains. We make a number of interesting observations: (1) the most destructive types of two-flow interactions do not arise commonly in chains; (2) the throughput of chains does not vary significantly with the types of arising interactions, because of the self-regulating effect of packets in the chain (later hops can only transmit when they receive packets from earlier ones); however, (3) the chains exhibiting destructive interactions suffer frequent collisions and require many more retransmissions. As such, in general scenarios, such chains reduce the available bandwidth within the network.
Convergence Analysis of Evolution Strategies with Random Numbers of Offspring
Authors: Olivier François
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

Hitting times of the global optimum for evolutionary algorithms are usually available for simple unimodal problems or for simplified algorithms. In discrete problems, the number of results that relate the convergence rate of evolution strategies to the geometry of the optimisation landscape is restricted to a few theoretical studies. This article introduces a variant of the canonical (μ + ¿)-ES, called the Poisson-ES, for which the number of offspring is not deterministic, but is instead sampled from a Poisson distribution with mean ¿. After a slight change on the rank-based selection for the μ parents, and assuming that the number of offspring is small, we show that the convergence rate of the new algorithm is dependent on a geometric quantity that measures the maximal width of adaptive valleys. The argument of the proof is based on the analogy of the Poisson-ES with a basic Mutation-or-Selection evolutionary strategy introduced in a previous work.
Neural Computations by Asymmetric Networks with Nonlinearities
Authors: Naohiro Ishii, Toshinori Deguchi, Masashi Kawaguchi
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

Nonlinearity is an important factor in the biological visual neural networks. Among prominent features of the visual networks, movement detections are carried out in the visual cortex. The visual cortex for the movement detection, consist of two layered networks, called the primary visual cortex (V1),followed by the middle temporal area (MT), in which nonlinear functions will play important roles in the visual systems. These networks will be decomposed to asymmetric sub-networks with nonlinearities. In this paper, the fundamental characteristics in asymmetric neural networks with nonlinearities, are discussed for the detection of the changing stimulus or the movement detection in these neural networks. By the optimization of the asymmetric networks, movement detection equations are derived. Then, it was clarified that the even-odd nonlinearity combined asymmetric networks, has the ability in the stimulus change detection and the direction of movement or stimulus, while symmetric networks need the time memory to have the same ability. These facts are applied to two layered networks, V1 and MT.
The Role of AI in Shaping Smart Services and Smart Systems
Authors: Sahin Albayrak
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

Services and Systems must include a set of features to remain competent and future conform: intelligent behaviour, personalisation, adaptivity, scalability, manageability, ease of use and user friendliness, security, and self-healing capabilities. As a consequence, new architectural models are needed, which provide the users with access to a cognitive behaviour aspect of the system, and which may draw inspiration from the brain sciences. On the other hand, we have to use knowledge representation and semantic modeling, e.g., ontologies for representing our environment or basic properties of services and systems. This would naturally involve Agent Technology, AI, and Software Technology. So, approaches from many different disciplines have to work in integration.
Evaluation of the Effectiveness of Prolog for a CAD Application
Authors: J. Gonzalez, M. Williams, I. Aitchison
Venue: IEEE Computer Graphics and Applications (1984)

Fifth-generation computers will probably be based on logic programming languages like Prolog rather than on Fortran-type languages. Are such languages suitable to 3-D CAD applications?