ppxscal/embedding_network huggingface dataset:
Classification of Biomedical Signals Using a Haar 4 Wavelet Transform and a Hamming Neural Network
Authors: Orlando José Arévalo Acosta, Matilde Santos Peñas
Venue: Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II (2007)

This contribution consists on the application of a hybrid technique of signals digital processing and artificial intelligence, to classify two kinds of biomedical spectra, normal brain and meningioma tumor. Each signal is processed to extract the relevant information within the range of interest. Then, a Haar 4 wavelet transform is applied to reduce the size of the spectrum without loosing its main features. This signal approximation is coded in a binary set which keeps the frequencies that could have representative amplitude peaks of each signal. The coding is input in a recursive Hamming neural network previously trained, which is able to classify it by comparing it with patterns. The results of the classification are shown for a group of signals that corresponds to human brain tissue. The advantages and disadvantages of the implemented method are discussed.
Structure Analysis of Fuzzy Node Fuzzy Graph and Its Application to Sociometry Analysis
Authors: Hiroaki Uesu
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

We could generally analyze the inexact information efficiently and investigate the fuzzy relation by applying the fuzzy graph theory. We would extend the fuzzy graph theory, and propose a fuzzy node fuzzy graph. And we transform it to a fuzzy graph by using T-norm family. In this paper, we would discuss about four subjects, (1) fuzzy node fuzzy graph, (2) new T-norm "quasi logical product", (3) decision analysis of the optimal fuzzy graph $G_{\lambda_0}$in the fuzzy graph sequence {G ¿ }. By using the fuzzy node fuzzy graph theory and this new T-norm, we could clarify the relational structure of fuzzy information, and by using the decision of an optimal level on a partition tree, we could analyze the clustering relation among nodes. Moreover, we would illustrate its practical effectiveness with the case study concerning sociometry analysis.
Perception Model for People with Visual Impairments
Authors: Pradipta Biswas, Tevfik Metin Sezgin, Peter Robinson
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

Scientists from many different disciplines (including physiology, psychology, and engineering) have worked on modelling visual perception. However this field has been less extensively studied in the context of computer science, as most existing perception models work only for very specific domains such as menu searching or icon searching tasks. We are developing a perception model that works for any application. It takes a list of mouse events, a sequence of bitmap images of an interface and locations of different objects in the interface as input, and produces a sequence of eye-movements as output. We have identified a set of features to differentiate among different screen objects and using those features, our model has reproduced the results of previous experiments on visual perception in the context of HCI. It can also simulate the effects of different visual impairments on interaction. In this paper we discuss the design, implementation and two pilot studies to demonstrate the model.
Automated repurposing of implicitly structured documents
Authors: Helen Balinsky, Anthony Wiley, Michael Rhodes, Alfie Abdul-Rahman
Venue: Proceeding of the eighth ACM symposium on Document engineering (2008)

The different visual cues present in a document - such as spatial intervals and positions, contrast in font families, sizes and weights - combine to form the document's visual hierarchy. This hierarchy is essential to the reader, allowing scanning and comprehension; in contrast, this information is often ignored by machine processing. At the same time, the document structure is often not available in a machine readable form due to the ways documents were originally created or later transformed. This paper addresses the challenge of automatic document repurposing - applying styling and formatting from one 'implicitly' structured document to another, whilst preserving the underlying visual hierarchy. Using visual perception analysis, the proportionality mapping is established, according to which the original document content is transformed into the new style without breaking the original hierarchical structure. Spatial relationships, location and frequency analysis are then used to fine-tune the transformation.
News
Authors: Pam Frost Gorder, Lissa E. Harris
Venue: Computing in Science and Engineering (2004)

Simulated Bite MarksThough real Sabertooth cats are long extinct, anatomist Frank Mendel and his team plan to build a scale model of the head and jaws of a 700-pound Smilodon fatalis to reproduce the predator's deadly bite. They want to measure the forces necessary for the teeth to penetrate the skin, muscle, and other tissues of a recently dead herbivore, and use the data in a new computer-aided design (CAD) program they're developing. New Cloud Animation Software on the Horizon Swell and Prime--two new programs that render animated, three-dimensional (3D) clouds--are the Purdue University Rendering and Perceptualization Lab's latest innovations. At the lab, directed by David Ebert, researchers are developing software that brings scientific and medical data sets to life as 3D models, computer-generated illustrations, and photorealistic images.
Application Research of Support Vector Machines in Dynamical System State Forecasting
Authors: Guangrui Wen, Jianan Yin, Xining Zhang, Ying Jin
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

This paper deals with the application of a novel neural network technique, support vector machines (SVMs) and its extension support vector regression (SVR), in state forecasting of dynamical system. The objective of this paper is to examine the feasibility of SVR in state forecasting by comparing it with a traditional BP neural network model. Logistic time series are used as the experiment data sets to validate the performance of SVR model. The experiment results show that SVR model outperforms the BP neural network based on the criteria of normalized mean square error (NMSE). Finally, application results of practical vibration data state forecasting measured from some CO2 compressor company proved that it is advantageous to apply SVR to forecast state time series and it can capture system dynamic behavior quickly, and track system responses accurately.
Network search games, with arbitrary searcher starting point
Authors: Arnon Dagan, Shmuel Gal
Venue: Networks (2008)

We analyze a zero-sum game between a blind unit-speed searcher and a stationary hider on a given network Q, where the payoff is the time for the searcher to reach the hider. In contrast to the standard game studied in the literature, we do not assume that the searcher has to start from a fixed point (known to the hider) but can choose his starting point. We show that for some networks, including trees, the optimal searcher, and hider strategies have a simple structure. &copy; 2008 Wiley Periodicals, Inc. NETWORKS, 2008
A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production
Authors: Nicolas Beldiceanu, Emmanuel Poder
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

This article first introduces an extension of the classical cumulative constraint: each task is no more a rectangle but rather a sequence of contiguous trapezoid sub-tasks with variable duration and heights. The resource function is no more constant but is a positive or negative piecewise linear function of time. Finally, a task is no more pre-assigned to one resource, but to a task corresponds a set of possible resource assignments. In this context, this article provides an O(p ·(logp + q)) for computing all the cumulated resource profiles where q is the number of resources and p is the total number of trapezoid sub-tasks of all the tasks.
On Constructions of Optimal Double-Loop Networks
Authors: Jianqin Zhou, Wenjuan Wang
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

A double-loop digraph G(N; s 1, s 2 ) has N vertices 0, 1,...,N ¿ 1 and 2N edges of two types: s 1-edge: $v\rightarrow v + s_1 (\mod N)$, and s 2-edge: $v\rightarrow v + s_2 (\mod N), v=0, 1,\ldots , N-1$, for some fixed steps 1 ≤ s 1 < s 2 < N with $\gcd(N; s_1 , s_2 ) = 1$. Let D(N; s 1 , s 2) be the diameter of G and let us define: D(N) = min {D(N; s 1, s 2)| 1 ≤ s 1 < s 2 < N and $\gcd(N; s_1 , s_2 ) = 1$ }. Given a fixed number of vertices N, the general problem is to find steps s 1 and s 2, such that the digraph G(N; s 1, s 2 ) has minimum diameter D(N). A lower bound of this diameter is known to be $lb(N)= \lceil \sqrt{3N} \ \rceil-2.$ In this work, we give a simple and efficient algorithmic solution of the problem by using a geometrical approach. Given N, the algorithm find the minimum integer k = k(N), such that D(N) = lb(N) + k. The running time complexity of the algorithm is O(k 2)O(N 1/4logN). With a new approach, we prove that infinite families of k-tight optimal double-loop networks can be constructed for any k ¿ 0.
DDDAS/ITR: A Data Mining and Exploration Middleware for Grid and Distributed Computing
Authors: Jon B. Weissman, Vipin Kumar, Varun Chandola, Eric Eilertson, Levent Ertoz, Gyorgy Simon, Seonho Kim, Jinoh Kim
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

We describe our project that marries data mining together with Grid computing. Specifically, we focus on one data mining application - the Minnesota Intrusion Detection System (MINDS), which uses a suite of data mining based algorithms to address different aspects of cyber security including malicious activities such as denial-of-service (DoS) traffic, worms, policy violations and inside abuse. MINDS has shown great operational success in detecting network intrusions in several real deployments. In sophisticated distributed cyber attacks using a multitude of wide-area nodes, combining the results of several MINDS instances can enable additional early-alert cyber security. We also describe a Grid service system that can deploy and manage multiple MINDS instances across a wide-area network.
Portal oriented integration in public institutions
Authors: Diaconita Vlad, Botha Iuliana, Bara Adela, Lungu Ion, Velicanu Manole
Venue: Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases (2008)

In time, portals have evolved to meet the integration needs of companies. Even though not taken very seriously, they have slowly become leaders in turning new principles into practical experiences. In the beginning, portals focused on aggregating, organizing, and indexing unstructured data, but modern portals now do much more. Portal software continues to offer one of the few infrastructure frameworks that truly embrace open and flexible computing. A portal is a point of integration, useful to the organization by integrating internal business processes and by offering information to the outside world.
CSIsat: Interpolation for LA+EUF
Authors: Dirk Beyer, Damien Zufferey, Rupak Majumdar
Venue: Proceedings of the 20th international conference on Computer Aided Verification (2008)

We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementation combines the efficiency of linear programming for solving the arithmetic part with the efficiency of a SAT solver to reason about the boolean structure. We evaluate the efficiency of our tool on benchmarks from software verification. Binaries and the source code of CSIsat are publicly available as free software.
Cellular Census: Explorations in Urban Data Collection
Authors: Jonathan Reades, Francesco Calabrese, Andres Sevtsuk, Carlo Ratti
Venue: IEEE Pervasive Computing (2007)

Cellular networks hold out the promise of a continuously updated locational data stream for a very large sample of a city's residents and visitors. As a complement to traditional methods of data collection to support planning and policy making, data generated as a byproduct of network operations can provide us with a dynamic view of urban activity, greatly augmenting our understanding of the urban environment at low cost and with little latency. This exploratory article assesses the feasibility of various analytical approaches through a small sample of points from across the city of Rome. The results highlight directions for future study and demonstrate some shortcomings of the existing data sets and analysis. This article is part of a special issue on Urban Computing.
Formal Concept Analysis: A Unified Framework for Building and Refining Ontologies
Authors: Rokia Bendaoud, Amedeo Napoli, Yannick Toussaint
Venue: Proceedings of the 16th international conference on Knowledge Engineering: Practice and Patterns (2008)

Building a domain ontology usually requires several resources of different types, e.g. thesaurus, object taxonomies, terminologies, databases, sets of documents, etc, where objects are described in terms of attributes and relations with other objects. One important and hard problem is to be able to combine and merge knowledge units extracted from these different resources within an homogeneous formal representation (such as a description logic or OWL). The purpose of this article is to show which kinds of resources should be available for designing a real-world ontology in a given application domain, and then how Formal Concept Analysis and its extension - Relational Concept Analysis- can be used for materializing an associated ontology. This resulting target ontology can then be encoded within OWL or a description logic formalism, allowing classification-based reasoning. A real-world example in microbiology is detailed. Finally, an evaluation including tests on recall and precision shows how source resources can be completed with other existing domain resources using a semi-automatic analysis process.
Mint: a reconfigurable mobile multi-hop wireless network testbed
Authors: Tzi-Cker Chiueh
Venue:  (2007)

Academic research in mobile wireless networks relies largely on simulation. However, fidelity of simulation results has always been a concern, especially when the protocols being studied are affected by the propagation and interference characteristics of the radio channels. Inherent difficulty in faithfully modeling the wireless channel behaviors has encouraged several researchers to build wireless testbeds. One key difficulty of setting up a multi-hop wireless testbed is that it must be spread over a large physical space to introduce non-overlapping collision domains. This makes the setup, management and configuration of these testbeds challenging. In this thesis we focus on alleviating the space problem by designing a miniaturized 802.11b based, multi-hop wireless network testbed, called MiNT. MiNT occupies significantly smaller space compared to existing testbeds in use for mobile wireless experiments. Engineered completely from off-the-shelf components, each node in MINT supports untethered mobility that is controlled remotely. We also present solutions for problems associated with node mobility, namely node tracking in the testbed arena, and collision free node movement. In order to provide flexibility in terms of setup, management and reconfigurability, MiNT provides a graphical interface for getting complete view of the testbed. Mint cOntrol and Visualization InterfacE (MOVIE) provides a suite of necessary controls for configuring each node, the entire topology, as well as, collects and displays experiment related statistics in real-time as well as offline. In addition to supporting the regular features for remotely operating the testhed, MiNT also supports two novel features: (i) hybrid simulation capability, and (ii) a fault injection and analysis tool (FIAT). Hybrid simulation allows execution of simulation experiments on MiNT with the modeled link, MAC and physical layer replaced by real hardware. Our results show that hybrid simulation provides more accurate results compared to pure simulation. Our hybrid simulation technique implemented on top of ns-2 has rich functionalities, like execution rollback, pause and breakpointing execution on flagged events, that makes debugging easier. The fault injection and analysis tool helps in debugging implementations of network protocols by introducing user-specified network faults without requiring any code instrumentation. In the thesis we demonstrate the fidelity of our miniaturization approach by comparing experimental results on it with similar experiments conducted on a non-miniaturized testbed. Evaluations of hybrid simulation results against pure simulation results show the efficacy of the new approach in evaluating wireless protocols and applications. Evaluations of MOVIE and FIAT is intended to highlight the correctness and usability of the tools. Finally, we also a present a case study to underline the usefulness of MiNT, and a critique on remote usability of MiNT.
A Path Cover Technique for LCAs in Dags
Authors: Mirosław Kowaluk, Andrzej Lingas, Johannes Nowak
Venue: Proceedings of the 11th Scandinavian workshop on Algorithm Theory (2008)

We develop a path cover technique to solve lowest common ancestor (LCA for short) problems in a directed acyclic graph (dag).Our method yields improved upper bounds for two recently studied problem variants, computing one (representative) LCA for all pairs of vertices and computing all LCAs for all pairs of vertices. The bounds are expressed in terms of the number n of vertices and the so called width w(G) of the input dag G. For the first problem we achieve $\widetilde{O}(n^2 w(G))$ time which improves the upper bound of [18] for dags with w(G) = O( n 0.376 ¿ ¿ ) for a constant ¿> 0. For the second problem our $\widetilde{O}(n^2 w(G)^2)$ upper time bound subsumes the O(n 3.334) bound established in [11] for w(G) = O(n 0.667 ¿ ¿ ).As a second major result we show how to combine the path cover technique with LCA solutions for dags with small depth [9]. Our algorithm attains the best known upper time bound for this problem of O(n 2.575). However, most notably, the algorithm performs better on a vast amount of input dags, i.e. dags that do not have an almost linear-sized subdag of extremely regular structure.Finally, we apply our technique to improve the general upper time bounds on the worst case time complexity for the problem of reporting LCAs for each triple of vertices recently established by Yuster[26].
WaterMed: A watermarking method for medical digital images
Authors: Syrine Karoui, Nabil El Kadhi
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

In this paper, we present a technique about digital documents protection, known under the term watermarking. The main idea is to illustrate a new and useful application of watermarking technique in medical field. We mainly focus on mammography images and diagnosis. In fact, mammography analysis necessitates more than one diagnosis. Experts are in general a bit influenced by any colleague point of view. Our WaterMed solution is used to insert a diagnosis in a digital mammography in order to protect both the diagnosis and the mammography. We particularly focus on printing and scanning effects protection due to the fact that medical images are exposed to such processes.
A powerful tool-chain for setup, distributed processing, analysis and debugging of OMNeT++ simulations
Authors: Thomas Dreibholz, Erwin P. Rathgeb
Venue: Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops (2008)

In this paper, we introduce our Open Source tool-chain providing the parametrization, distributed execution, results post-processing and debugging for OMNET++-based simulations. While the initial motivation of these tools has been the support of our simulation model of the Reliable Server Pooling (RSerPool) framework, it has been particularly designed with model-independence in mind. That is, it can be easily adapted to other simulation models and therefore may be useful for other users of OMNET++-based simulation models as well.
A Method to Find Learner's Key Characteristic in Wed-Based Learning
Authors: Xiyuan Wu, Qinghua Zheng, Haifei Li, Guangdong Liu
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

One of the challenges in personalized e-learning research field is how to meet the unique learning strategies according to a learner's personality characteristic. But a learner's characteristic may have many attributes, and some of them have not equal value for personalized e-learning. This paper exploits the aspect to evaluate the important attributes, puts forward the concept of key personality characteristic and an improved algorithm basing on rough set theory to find the key attributes. Systematic experiments and their results are reported and shows the dimensions of personality characteristic can be decreased to below one-quarter.
Verifying a Semantic βη-Conversion Test for Martin-Löf Type Theory
Authors: Andreas Abel, Thierry Coquand, Peter Dybjer
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

Type-checking algorithms for dependent type theories often rely on the interpretation of terms in some semantic domain of values when checking equalities. Here we analyze a version of Coquand's algorithm for checking the &beta;&eta;-equality of such semantic values in a theory with a predicative universe hierarchy and large elimination rules. Although this algorithm does not rely on normalization by evaluation explicitly, we show that similar ideas can be employed for its verification. In particular, our proof uses the new notions of contextual reification and strong semantic equality. The algorithm is part of a bi-directional type checking algorithm which checks whether a normal term has a certain semantic type, a technique used in the proof assistants Agda and Epigram. We work with an abstract notion of semantic domain in order to accommodate a variety of possible implementation techniques, such as normal forms, weak head normal forms, closures, and compiled code. Our aim is to get closer than previous work to verifying the type-checking algorithms which are actually used in practice.
The role data model revisited
Authors: Friedrich Steimann
Venue: Applied Ontology (2007)

While Bachman's role data model is often cited, it appears that its contribution, the introduction of role types and their conception as unions of entity types that occupy the places of relationship types, has mostly been ignored. This is unfortunate since it has led to countless reinventions of the wheel, and sometimes even to regress. With this homage, the author wishes to shed some light on the natural elegance of Bachman's role concept, and to make clear why he believes that it is valid until this day.