ppxscal/embedding_network huggingface dataset:
Distributed Data Mining by Means of SQL Enhancement
Authors: Marcin Gorawski, Ewa Pluciennik
Venue: Proceedings of the OTM Confederated International Workshops and Posters on On the Move to Meaningful Internet Systems: 2008 Workshops: ADI, AWeSoMe, COMBEK, EI2N, IWSSA, MONET, OnToContent + QSI, ORM, PerSys, RDDS, SEMELS, and SWWS (2008)

An analysis of a huge amount of information is feasible only if information systems are used. First, information needs to be accumulated and stored in a persistent structure enabling effective data access and management. The main aspects of nowadays data processing are: storing data in (mostly relational) databases, improving data processing efficiency by parallel analysis [1], distributed processing (necessary for institution consisting of autonomous, geographically distributed departments), query languages (SQL) remain a fundamental way to access data in databases, data analysis often includes data mining (building data models describing data characteristics or predicting some features) [2].Regarding the above mentioned circumstances authors propose an enhancement of SQL for data mining of a distributed data structure. Basic assumption is a complete, horizontal data fragmentation and an explicit model format. Building global data model consists of two stages. In the first one, local models are built in a parallel manner. Second one consists of combining these models into a global data picture. Detailed description of combining methods regarding global classification models authors presented in [3].
Performance implications of fluctuating server capacity
Authors: Jingxiang Luo, Carey Williamson
Venue: Computer Communications (2008)

In this paper, we consider a variant of an M/M/c/c loss system with fluctuating server capacity. To gain insight into the performance implications of such a stochastic capacity system, we start by analyzing a simple, approximate model. Next, we develop a detailed model using MRGP, such that blocking and dropping metrics can be calculated explicitly from a set of primary inputs, such as arrival rate, service rate, and capacity fluctuation rate. We investigate the functional behaviour of the system, using both the approximate model and the detailed model. The results illustrate some tradeoffs between the blocking rate and the dropping rate, and the sensitivities of these performance metrics to various system parameters. The significance of the results in the context of capacity planning and network performance evaluation is highlighted.
A recommender system to provide adaptive and inclusive standard-based support along the elearning life cycle
Authors: Olga C. Santos
Venue: Proceedings of the 2008 ACM conference on Recommender systems (2008)

Dynamic support in adaptive inclusive educational systems depends on properly managing the adaptation in the eLearning life cycle by combining design and runtime adaptations and making a pervasive usage of standards along the eLearning life cycle. My Ph.D research focuses on recommender systems for lifelong learning inclusive scenarios, which have particular differences in their need for personalized recommendations. The research presented here makes a proposal for addressing some of the existing challenges. It goes beyond issues that are usually considered when building recommender systems and focuses also on closing the cycle. In particular, I propose a graphical representation that will help to compare the recommenders' performance in eLearning scenarios.
Reconfigurable ΔΣ modulator topology design through hierarchical mapping and constraint extraction
Authors: Ying Wei, Alex Doboli
Venue: Integration, the VLSI Journal (2009)

This paper presents a novel methodology for designing reconfigurable continuous-time @D@S modulator topologies while considering circuit-level implementation constraints. Topologies are optimized for minimizing their structural complexity, maximizing their robustness with respect to circuit nonidealities, and maximizing the feasibility of their circuit-level implementation. A case study for a three mode reconfigurable @D@S modulator shows that the produced topologies avoid circuit-level implementation difficulties existing in other approaches.
Need for integrated quality of service and quality of protection in mobile systems
Authors: Klara Nahrstedt
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

Recent large scale disasters have awaken governments at home and abroad to their needs for preparedness to support homeland security and public safety. First responders of various agencies are often on the frontline to assist in managing these events to protect lives and property. The effectiveness of their mission is highly dependent on capability of mobile wireless systems available at incident scenes, especially how their mobile infrastructure and devices can handle real-time responses and protection against threads and vulnerabilities in an integrated manner. In this talk, we present challenges to achieve such integration when taking into account resource limitations in mobile systems and possible threats at incident scenes under varying Quality of Service (QoS) and Quality of Protection demands. We will amplify these challenges on three examples: (a) key management issues, (b) alert mechanisms if threats are detected, and (c) trading QoS/QoP issues when streaming multimedia data among mobile devices. In case of the cryptographic key management issues, we will examine combinatorial key solutions within the scopes of symmetric key cryptography and public key cryptography and how they fare under resource limitations and possible threats. In case of alert mechanisms we will discuss solutions such as Mobi-Herald and examine it against resource limitations and possible threats. Trading QoS/QoP algorithms for allowing streaming data will be examined, especially how well they deliver data under end-to-end delay and confidentiality demands in these resource-constrained situations.
Automatic extraction of brushstroke orientation from paintings: POET: prevailing orientation extraction technique
Authors: Igor E. Berezhnoy, Eric O. Postma, H. Jaap van den Herik
Venue: Machine Vision and Applications (2008)

Spatial characteristics play a major role in the human analysis of paintings. One of the main spatial characteristics is the pattern of brushstrokes. The orientation, shape, and distribution of brushstrokes are important clues for analysis. This paper focuses on the automatic extraction of the orientation of brushstrokes from digital reproductions of paintings. We present a novel technique called the (prevailing orientation extraction technique (POET)). The technique is based on a straightforward circular filter and a dedicated orientation extraction phase; it performs at a level that is undistinguishable from that of humans. From our experimental results we may conclude that POET supports the automatic extraction of the spatial distribution of oriented brushstrokes. Such an automatic extraction will aid art experts in their analysis of paintings.
Complex adaptive filtering user profile using graphical models
Authors: Yi Zhang
Venue: Information Processing and Management: an International Journal (2008)

This article explores how to develop complex data driven user models that go beyond the bag of words model and topical relevance. We propose to learn from rich user specific information and to satisfy complex user criteria under the graphical modelling framework. We carried out a user study with a web based personal news filtering system, and collected extensive user information, including explicit user feedback, implicit user feedback and some contextual information. Experimental results on the data set collected demonstrate that the graphical modelling approach helps us to better understand the complex domain. The results also show that the complex data driven user modelling approach can improve the adaptive information filtering performance. We also discuss some practical issues while learning complex user models, including how to handle data noise and the missing data problem.
Flexible Process Graph: A Prologue
Authors: Artem Polyvyanyy, Mathias Weske
Venue: Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part I on On the Move to Meaningful Internet Systems: (2008)

Businesses document their operational processes as process models. The common practice is to represent process models as directed graphs. The nodes of a process graph represent activities and directed edges constitute activity ordering constraints. A flexible process graph modeling approach proposes to generalize process graph structure to a hypergraph. Obtained process structure aims at formalization of ad-hoc process control flow. In this paper we discuss aspects relevant to concurrent execution of process activities in a collaborative manner organized as a flexible process graph. We provide a real world flexible process scenario to illustrate the approach.
Efficient quantization algorithm for real-time MP-3 encoders
Authors: Shingchern D. You, Woei-Kae Chen
Venue: Multimedia Tools and Applications (2008)

This paper reports an efficient quantization algorithm for the implementation of a real-time MP-3 encoder based on a low-cost digital signal processor. Unlike the well-known nested-loop quantization algorithm, which requires a large and unpredictable amount of iterations, the proposed algorithm uses a single loop with only three iterations to reduce the computational complexity. Since most of the existing quantization algorithms reported in the literature require peak number of iterations higher than three, our approach can effectively reduce the peak computing demand for a real-time encoder. We conduct several experiments (including the ODG rating) to validate the performance of the proposed algorithm, and the results are acceptable. We implement the proposed algorithm on a 16-bit fixed-point digital signal processor, and the encoder requires 35 MIPS of computation for encoding stereo music at 128 kbps.
Fast-response low-ripple envelope follower
Authors: J. P. Alegre, S. Celma, J. M. García del Pozo, N. Medrano
Venue: Integration, the VLSI Journal (2009)

A novel envelope detector structure is proposed in this paper that overcomes the traditional trade-off required in these circuits. It improves both the tracking and keeping of the signal and thereby obtains great savings of capacitor area. At the same time, it cancels nonlinearities due to the use of switches when this technique is employed, such as nonlinearities caused by charge injection and, tenders high performance with small ripple (
Fast distributed algorithms to make mutually coordinated decisions in stringent real time
Authors: G. G. Stetsyura
Venue: Automation and Remote Control (2008)

Algorithms for fast detection and elimination of false results of computations in the stringent real-time multiprocessor and multicomputer systems based on combined calculation and data transmission were proposed.
Application of support vector machine for the detection of P- and T-waves in 12-lead electrocardiogram
Authors: S. S. Mehta, N. S. Lingayat
Venue: Computer Methods and Programs in Biomedicine (2009)

Electrocardiogram (ECG) is characterized by a recurrent wave sequence of P, QRS and T-wave associated with each beat. The performance of the computer-aided ECG analysis systems depends heavily upon the accurate and reliable detection of these component waves. This paper presents an efficient method for the detection of P- and T-waves in 12-lead ECG using support vector machine (SVM). Digital filtering techniques are used to remove power line interference and base line wander. SVM is used as a classifier for the detection of P- and T-waves. The algorithm is validated using original simultaneously recorded 12-lead ECG recordings from the standard CSE ECG database. Significant detection rate of 95.43% is achieved for P-wave detection and 96.89% for T-wave detection. The method successfully detects all kind of morphologies of P- and T-waves. The on-sets and off-sets of the detected P- and T-waves are found to be within the tolerance limits given in CSE library.
PhyloDetect
Authors: Hubert Rehrauer, Susan Schönmann, Leo Eberl, Ralph Schlapbach
Venue: Bioinformatics (2008)

Motivation: Detection and identi.cation of microbes using diagnostic arrays is still subject of ongoing research. Existing signi.cance-based algorithms consider an organism detected even if a signi.cant number of the microarray probes that match the organism are called absent in a hybridization. Further, they do generate redundant results if the target organisms show high sequence similarity and the microarray probes cannot discriminate all of them. Results: We propose a new analysis strategy that considers organism similarities and calls organisms only present if the probes that match the organism but are absent in a hybridization can be explained by random events. In our strategy, we.rst identify the groups of target organisms that are actually distinguishable by the array. Subsequently, these organism groups are placed in a hierarchical tree such that groups matching only less speci.c probes are closer to the tree root, and groups that are discriminated only by few probes are close to each other. Finally, we compute for each group a likelihood score that is based on a hypothesis test with the null hypothesis that the group was actually present in the hybridized sample. We have validated our strategy using datasets from two different array types and implemented it as an easy-to-use web application. Availability: http://www.fgcz.ethz.ch/PhyloDetect Contact: Hubert.Rehrauer@fgcz.uzh.ch Supplementary information: Example data is available at http://www.fgcz.ethz.ch/PhyloDetect
gBFlavor: a new tool for fast and automatic generation of generic bitstream syntax descriptions
Authors: Davy Deursen, Wesley Neve, Davy Schrijver, Rik Walle
Venue: Multimedia Tools and Applications (2008)

The efficient adaptation of scalable media resources is a major point of interest, due to today's tremendous heterogeneity in terms of end-user terminals, network technologies, and coding formats. In order to create a media resource adaptation engine supporting current and future coding formats, a generic (i.e., format-independent) solution is needed. One way to realize this goal is to rely on automatically created textual descriptions of the high-level syntax of binary media resources. MPEG-21 generic Bitstream Syntax Schema (gBS Schema) is a tool that is part of the MPEG-21 Multimedia Framework. It enables the use of generic Bitstream Syntax Descriptions (gBSDs), i.e., textual descriptions in XML, to steer the adaptation of a binary media resource, using format-independent adaptation logic. The major contribution of this paper is the introduction of gBFlavor. It is a novel solution for the automatic and format-agnostic generation of gBSDs. gBFlavor offers the possibility to automatically create a format-specific parser that is able to produce a gBSD, taking as input a particular media resource compliant to the coding format described by the parser. This paper provides an overview of the gBFlavor language, which allows describing the high-level structure of a coding format. The overall functioning of a gBFlavor-enabled adaptation framework is discussed as well. Performance results for two scalable coding formats, in particular H.264/AVC Scalable Video Coding and JPEG2000, show that our proposed solution outperforms existing techniques in terms of execution speed.
iFoldRNA
Authors: Shantanu Sharma, Feng Ding, Nikolay V. Dokholyan
Venue: Bioinformatics (2008)

Summary: Three-dimensional RNA structure prediction and folding is of significant interest in the biological research community. Here, we present iFoldRNA, a novel web-based methodology for RNA structure prediction with near atomic resolution accuracy and analysis of RNA folding thermodynamics. iFoldRNA rapidly explores RNA conformations using discrete molecular dynamics simulations of input RNA sequences. Starting from simplified linear-chain conformations, RNA molecules (<50 nt) fold to native-like structures within half an hour of simulation, facilitating rapid RNA structure prediction. All-atom reconstruction of energetically stable conformations generates iFoldRNA predicted RNA structures. The predicted RNA structures are within 2–5 Å root mean squre deviations (RMSDs) from corresponding experimentally derived structures. RNA folding parameters including specific heat, contact maps, simulation trajectories, gyration radii, RMSDs from native state, fraction of native-like contacts are accessible from iFoldRNA. We expect iFoldRNA will serve as a useful resource for RNA structure prediction and folding thermodynamic analyses. Availability: http://iFoldRNA.dokhlab.org. Contact: dokh@med.unc.edu Supplementary information:Supplementary data are available at Bioinformatics online.
Synchronous versus asynchronous modeling of gene regulatory networks
Authors: Abhishek Garg, Alessandro Di Cara, Ioannis Xenarios, Luis Mendoza, Giovanni De Micheli
Venue: Bioinformatics (2008)

Motivation:In silico modeling of gene regulatory networks has gained some momentum recently due to increased interest in analyzing the dynamics of biological systems. This has been further facilitated by the increasing availability of experimental data on gene–gene, protein–protein and gene–protein interactions. The two dynamical properties that are often experimentally testable are perturbations and stable steady states. Although a lot of work has been done on the identification of steady states, not much work has been reported on in silico modeling of cellular differentiation processes. Results: In this manuscript, we provide algorithms based on reduced ordered binary decision diagrams (ROBDDs) for Boolean modeling of gene regulatory networks. Algorithms for synchronous and asynchronous transition models have been proposed and their corresponding computational properties have been analyzed. These algorithms allow users to compute cyclic attractors of large networks that are currently not feasible using existing software. Hereby we provide a framework to analyze the effect of multiple gene perturbation protocols, and their effect on cell differentiation processes. These algorithms were validated on the T-helper model showing the correct steady state identification and Th1–Th2 cellular differentiation process. Availability: The software binaries for Windows and Linux platforms can be downloaded from http://si2.epfl.ch/~garg/genysis.html. Contact: abhishek.garg@epfl.ch
Data mining for large scale 3D seismic data analysis
Authors: M. Deighton, M. Petrou
Venue: Machine Vision and Applications (2008)

The automation of the analysis of large volumes of seismic data is a data mining problem, where a large database of 3D images is searched by content, for the identification of the regions that are of most interest to the oil industry. In this paper we perform this search using the 3D orientation histogram as a texture analysis tool to represent and identify regions within the data, which are compatible with a query texture.
Bioimage informatics
Authors: Hanchuan Peng
Venue: Bioinformatics (2008)

In recent years, the deluge of complicated molecular and cellular microscopic images creates compelling challenges for the image computing community. There has been an increasing focus on developing novel image processing, data mining, database and visualization techniques to extract, compare, search and manage the biological knowledge in these data-intensive problems. This emerging new area of bioinformatics can be called ‘bioimage informatics’. This article reviews the advances of this field from several aspects, including applications, key techniques, available tools and resources. Application examples such as high-throughput/high-content phenotyping and atlas building for model organisms demonstrate the importance of bioimage informatics. The essential techniques to the success of these applications, such as bioimage feature identification, segmentation and tracking, registration, annotation, mining, image data management and visualization, are further summarized, along with a brief overview of the available bioimage databases, analysis tools and other resources. Contact: pengh@janelia.hhmi.org Supplementary information: Supplementary data are available at Bioinformatics online.
Development of a novel contactless mechanocardiograph device
Authors: Kouhyar Tavakolian, Faranak M. Zadeh, Yindar Chuo, Ali Vaseghi, Bozena Kaminska
Venue: International Journal of Telemedicine and Applications (2008)

A novel method of detecting mechanical movement of the heart, Mechanocardiography (MCG), with no connection to the subject's body is presented. This measurement is based on radar technology and it has been proven through this research work that the acquired signal is highly correlated to the phonocardiograph signal and acceleration-based ballistocardiograph signal (BCG) recorded directly from the sternum. The heart rate and respiration rate have been extracted from the acquired signal as two possible physiological monitoring applications of the radar-based MCG device.
PK/DB
Authors: Tiago L. Moda, Leonardo G. Torres, Alexandre E. Carrara, Adriano D. Andricopulo
Venue: Bioinformatics (2008)

Summary: The study of pharmacokinetic properties (PK) is of great importance in drug discovery and development. In the present work, PK/DB (a new freely available database for PK) was designed with the aim of creating robust databases for pharmacokinetic studies and in silico absorption, distribution, metabolism and excretion (ADME) prediction. Comprehensive, web-based and easy to access, PK/DB manages 1203 compounds which represent 2973 pharmacokinetic measurements, including five models for in silico ADME prediction (human intestinal absorption, human oral bioavailability, plasma protein binding, blood–brain barrier and water solubility). Availability: http://www.pkdb.ifsc.usp.br Contact: aandrico@if.sc.usp.br
Itinerary determination of imprecise mobile agents with firm deadline
Authors: Luciana Rech, Carlos Montez Rômulo Silva de Oliveira
Venue: Web Intelligence and Agent Systems (2008)

In some applications, as part of a mobile agent mission, there may be the necessity of meeting a firm end-to-end deadline, although with some itinerary flexibility due to optional resources. This paper proposes an execution model based on the concept of imprecise mobile agents with timing constraints. In this paper it is considered an execution model where agents do not previously know their itineraries. The imprecise mobile agent may choose among alternative and/or optional resources. The objective is to propose and to evaluate heuristics to be used individually or in pairs by imprecise mobile agents that must accomplish a mission within a firm deadline.