ppxscal/embedding_network huggingface dataset:
Array Grammars with Contextual Operations
Authors: K. G. Subramanian, Do Long Van, P. Helen Chandra, Nghiem Do Quyen
Venue: Fundamenta Informaticae (2008)

In this paper, we consider a class of two-dimensional array grammars, called parallel contextual array grammars, that extend the contextual operations on strings to arrays in a naturalway and generate languages of pictures of rectangular arrays. Several classes of these array grammars and the resulting families of picture languages are considered. Necessary conditions for picture languages to be contained in these classes are obtained and the relations between these families are also established.
Using software engineering technology to improve the quality of medical processes
Authors: Lori A. Clarke, George A. Avrunin, Leon J. Osterweil
Venue: Companion of the 30th international conference on Software engineering (2008)

In this paper, we describe some of the key observations resulting from our work on using software engineering technologies to help detect errors in medical processes. In many ways, medical processes are similar to distributed systems in their complexity and proneness to contain errors. We have been investigating the application of a continuous process improvement approach to medical processes in which detailed and semantically rich models of the medical processes are created and then subjected to rigorous analyses. The technologies we applied helped improve understanding about the processes and led to the detection of errors and subsequent improvements to those processes. This work is still preliminary, but is suggesting new research directions for medical process improvement, software engineering technologies, and the applicability of these technologies to other domains involving human-intensive processes.
Estimating the Confidence Interval for Prediction Errors of Support Vector Machine Classifiers
Authors: Bo Jiang, Xuegong Zhang, Tianxi Cai
Venue: The Journal of Machine Learning Research (2008)

Support vector machine (SVM) is one of the most popular and promising classification algorithms. After a classification rule is constructed via the SVM, it is essential to evaluate its prediction accuracy. In this paper, we develop procedures for obtaining both point and interval estimators for the prediction error. Under mild regularity conditions, we derive the consistency and asymptotic normality of the prediction error estimators for SVM with finite-dimensional kernels. A perturbation-resampling procedure is proposed to obtain interval estimates for the prediction error in practice. With numerical studies on simulated data and a benchmark repository, we recommend the use of interval estimates centered at the cross-validated point estimates for the prediction error. Further applications of the proposed procedure in model evaluation and feature selection are illustrated with two examples.
Design and implementation of remote medical information system on ubiquitous environment
Authors: Jaejoon Kim, Layeon An, Kyucheol Cho, Jongwan Kim
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Remote medical information systems (RMIS) are being increasingly used to display and analyze data obtained from different acquisition equipments. This paper describes the application of medical information system in ubiquitous environment. A key requirement in ubiquitous environment is the ability for communication between image viewer realized by DICOM standard and a server supporting medical information to make it possible. In order to apply a remote sensing networking system based RFID for medical information, we designed and realized the server/client networking in mobile terminal environment. In particular, it showed the capability to communicate image based system unlike text based communication.
Schedulability analysis of preemptive and nonpreemptive EDF on partial runtime-reconfigurable FPGAs
Authors: Nan Guan, Qingxu Deng, Zonghua Gu, Wenyao Xu, Ge Yu
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

Field Programmable Gate Arrays (FPGAs) are very popular in today's embedded systems design, and Partial Runtime-Reconfigurable (PRTR) FPGAs allow HW tasks to be placed and removed dynamically at runtime. Hardware task scheduling on PRTR FPGAs brings many challenging issues to traditional real-time scheduling theory, which have not been adequately addressed by the research community compared to software task scheduling on CPUs. In this article, we consider the schedulability analysis problem of HW task scheduling on PRPR FPGAs. We derive utilization bounds for several variants of global preemptive/nonpreemptive EDF scheduling, and compare the performance of different utilization bound tests.
Analog placement based on hierarchical module clustering
Authors: Po-Hung Lin, Shyh-Chang Lin
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In analog layout design, it is very important to reduce the parasitic coupling effects and improve the circuit performance. Consequently, the most important device-level placement constraints are matching, symmetry, and proximity. However, many previous works deal with these constraints separately, and none of them mention how to handle different constraints simultaneously and hierarchically. In this paper, we first give a case study to show the needs of integrating these constraints in a hierarchical manner. Then, we present the first formulation for analog placement based on hierarchical module clustering. Our approach can handle analog placement with various constraint groups including matching, (hierarchical) symmetry, and (hierarchical) proximity groups. To our best knowledge, this is also the first work in the literature to handle floorplanning with the clustering constraint using the B*-tree based representation. Experimental results based on industrial analog designs show that our approach is very effective and efficient.
Durability of replicated distributed storage systems
Authors: Sriram Ramabhadran, Joseph Pasquale
Venue: ACM SIGMETRICS Performance Evaluation Review (2008)

We study the problem of guaranteeing data durability [2] in distributed storage systems based on replication. Our work is motivated by several several recent efforts [3, 5, 1] to build such systems in a peer-to-peer environment. The key features of this environment which make achieving durability difficult are (1) data lifetimes may be several orders of magnitude larger than the lifetimes of individual storage units, and (2) the system may have little or no control over the participation of these storage units in the system. We use a model-based approach to develop engineering principles for designing automated replication and repair mechanisms to implement durability in such systems.
Video Behavior Profiling for Anomaly Detection
Authors: Tao Xiang, Shaogang Gong
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

This paper aims to address the problem of modelling video behaviour captured in surveillancevideos for the applications of online normal behaviour recognition and anomaly detection. A novelframework is developed for automatic behaviour profiling and online anomaly sampling/detectionwithout any manual labelling of the training dataset. The framework consists of the followingkey components: (1) A compact and effective behaviour representation method is developed basedon discrete scene event detection. The similarity between behaviour patterns are measured basedon modelling each pattern using a Dynamic Bayesian Network (DBN). (2) Natural grouping ofbehaviour patterns is discovered through a novel spectral clustering algorithm with unsupervisedmodel selection and feature selection on the eigenvectors of a normalised affinity matrix. (3) Acomposite generative behaviour model is constructed which is capable of generalising from asmall training set to accommodate variations in unseen normal behaviour patterns. (4) A run-timeaccumulative anomaly measure is introduced to detect abnormal behaviour while normal behaviourpatterns are recognised when sufficient visual evidence has become available based on an onlineLikelihood Ratio Test (LRT) method. This ensures robust and reliable anomaly detection and normalbehaviour recognition at the shortest possible time. The effectiveness and robustness of our approachis demonstrated through experiments using noisy and sparse datasets collected from both indoorand outdoor surveillance scenarios. In particular, it is shown that a behaviour model trained usingan unlabelled dataset is superior to those trained using the same but labelled dataset in detectinganomaly from an unseen video. The experiments also suggest that our online LRT based behaviourrecognition approach is advantageous over the commonly used Maximum Likelihood (ML) methodin differentiating ambiguities among different behaviour classes observed online.
Index tuning for parameterized streaming groupby queries
Authors: Luping Ding, Elke A. Rundensteiner
Venue: Proceedings of the 2nd international workshop on Scalable stream processing system (2008)

Similar groupby queries are common in many stream processing applications. We propose the concept of the parameterized streaming groupby query template (PSGB template) as an abstraction for representing potentially infinite number of runtime instantiated groupby queries with customized results. To handle high-speed data streams and large numbers of PSGB queries, the IMP index is proposed for organizing the quickly evolving PSGB operator state to support query workloads. In this paper, we tackle the IMP index tuning problem. We propose the EPrune algorithm that is guaranteed to find the optimal IMP index configuration for a given query workload. To support frequent index tuning required for coping with dynamic stream environments, efficiency of index selection becomes more important than guaranteed optimality. To achieve this, we design a greedy index selection algorithm named RGreedy and equip it with three heuristics - OWL, PCL and Hybrid. Our experiments show that RGreedy finds the optimal IMP configuration in practically all of our extensive test cases. While EPrune takes hours to finish, RGreedy terminates within seconds.
Design and Implementation of Adaptive Streaming Modules for Multipoint Video Communication
Authors: Koji Hashimoto, Yoshitaka Shibata
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

We've developed a middleware system for multipoint video communication on interconnected computer networks, which is able to use several audio video formats and transcode formats as necessary. The system is based on mobile agent technique and able to support multipoint video communication event with consideration of users' communication environments. In this paper, we describe design and implementation of adaptive streaming modules for multipoint video communication in our middleware system. By using the streaming modules in the middleware, it is able to use functions for processing WMV (Windows Media Video), DV (Digital Video) and HDV (High Definition Video) on multipoint video communication.
The variational iteration method: A highly promising method for solving the system of integro-differential equations
Authors: Jafar Saberi-Nadjafi, Mohamadreza Tamamgar
Venue: Computers Mathematics with Applications (2008)

This paper applies He's variational iteration method for solving two systems of Volterra integro-differential equations. The solution process is illustrated and various physically relevant results are obtained. Comparison of the obtained results with exact solutions shows that the used method is an effective and highly promising method for various classes of both linear and nonlinear integro-differential equations.
Formalizing MDA-Based Refactorings
Authors: Liliana Favre, Claudia Pereira
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

The Model Driven Architecture (MDA) is an initiative proposed by the Object Management Group (OMG) to model centric software development. It is based on the concepts of models, metamodels and automatic transformations. A crucial part of the evolution from abstract models to executable components or applications is accomplished by means of refactoring. MDA-based refactorings can be specified in the Object Constraint Language (OCL) as contracts between metamodels. We propose an alternative formalization based on the NEREUS language that can be viewed as an intermediate notation open to many formal languages. We show how to transform automatically OCL contracts into NEREUS. We propose a uniform treatment of refactoring at platform independent, platform specific and implementation specific abstraction levels.
The carr-benkler wager and its implications for ULS software engineering
Authors: Rick Kazman
Venue: Proceedings of the 2nd international workshop on Ultra-large-scale software-intensive systems (2008)

In this paper, I present the Carr-Benkler wager - a bet over whether free-market/economic or social forces will determine the future of the internet - and discuss its implications for the software engineering practices of Ultra-Large Scale (ULS) systems. As a result of considering the underlying forces behind the wager, I discuss three implications for the software engineering of Ultra-large scale systems. From these implications I suggest a set of topics that describe how we need to think about, teach, and develop software and software-related processes differently.
What dynamic network metrics can tell us about developer roles
Authors: Mathias Pohl, Stephan Diehl
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

Software development is heavily dependent on the participants of the process and their roles within the process. Each developer has his specific skills and interests and hence contributes to the project in a different way. While some programmers work on separate modules, others developers integrate these modules towards the final product. To identify such different groups of people one approach is to work with methods taken from social network analysis. To this end, a social network has to be defined in a suitable way, and appropriate analysis strategies have to be chosen. This paper shows how a network of software developers could be defined based on information in a software repository, and what it can possibly tell about roles of developers (and what not) in the process of the application server Tomcat.
Effects of horizontal field-of-view restriction on manoeuvring performance through complex structured environments
Authors: Sander E. M. Jansen, Alexander Toet, Nico J. Delleman
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

Field-of-view (FOV) restrictions are known to affect human behaviour and to degrade performance for a range of different tasks. A proposed cause for this performance impairment is the predominant activation of the ventral cortical stream as compared to the dorsal stream. This may compromise the ability to control heading as well as degrade the processing of spatial information [Patterson et al. 2006]. Furthermore, the peripheral visual field is important in maintaining postural equilibrium [Turano et al. 1993]. These are all significant factors when manoeuvring through complex structured environments. We discuss here two experiments investigating the influence of horizontal FOV-restriction on manoeuvring performance through real-world structured environments. The results can help determine requirements for the selection and development of FOV limiting devices such as Head-Mounted Displays (HMDs).
A new differential transformation approach for two-dimensional Volterra integral equations
Authors: M. Hadizadeh, N. Moatamedi
Venue: International Journal of Computer Mathematics (2007)

The differential transformation method provides an iterative procedure to obtain the spectrum of analytic solutions. In this paper we extend the differential transformation approach for the solution of two-dimensional integral equations. We give some basic properties and a new differential transformation-type method for the solution of linear and nonlinear two-dimensional Volterra integral equations. By extension of the operations, a two-dimensional integral equation in the domain of interest can be transformed into an algebraic equation in the domain K, H. We show that, after transforming the original equation into an algebraic equation, the coefficients W(k, h) for k, h=1, 2,... are determined and then, by substituting the values of W(k, h) in the transformed equation, the closed form solution of the original equation can be obtained. The reliability and efficiency of the proposed scheme are demonstrated by numerical experiments.
A Lecture Scene Playback System Using Digital Picture-Card Show for Distance Learning
Authors: Nobuo Funabiki, Aki Mouri, Walaa Hassan, Toru Nakanishi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Recently, computer-aided slide presentations have been commonly used at lectures in universities. To improve their educational quality, this paper presents an Web-based lecture scene playback system using the digital picture-card show for distance learning. In this system, fine still images of lecture scenes containing the lecturer, the blackboard, and the screen, are periodically taken by an off-the-shell digital photo camera, and the lecturer voice is recorded into a digital file by a personal computer during a class. Then, the digital picture-card show to play back the lecture scenes is edited by selecting one image and the voice file interval corresponding to one lecture scene defined as the time span of teaching one slide page by the lecturer. The picture-card show is delivered to students through the World-Wide Web system on demand. We have implemented and applied our system to one course for freshmen in our department. The system performance and the questionnaire results from students show that our system is very efficient and practical to improve understandings and motivations of students for study of this course.
Fault tolerant graphs, perfect hash functions and disjoint paths
Authors: M. Ajtai
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

Given a graph G on n nodes the authors say that a graph T on n + k nodes is a k-fault tolerant version of G, if one can embed G in any n node induced subgraph of T. Thus T can sustain k faults and still emulate G without any performance degradation. They show that for a wide range of values of n, k and d, for any graph on n nodes with maximum degree d there is a k-fault tolerant graph with maximum degree O(kd). They provide lower bounds as well: there are graphs G with maximum degree d such that any k-fault tolerant version of them has maximum degree at least Omega (d square root k).
A Formal Behavioral Semantics for TestML
Authors: Jürgen Grossmann, Wolfgang Müller
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

TestML is an XML-based language for the exchange of test descriptions in automotive systems design and mainly introduced through the structural definition of an XML schema as an independent exchange format for existing tools and methods covering a wide range of different test technologies. In this paper, we present a rigorous formal behavioral semantics for TestML by means of Abstract State Machines (ASMs). Our semantics is a concise, unambiguous, high-level specification for TestML-based implementations and serves as a basis to define exact and well-defined mappings between existing test languages and TestML.
Modelling geometric and misregistration error in airborne sensor data to enhance change detection
Authors: K. M. Brown, G. M. Foody, P. M. Atkinson
Venue: International Journal of Remote Sensing (2007)

One of the major goals of remote sensing is to carry out monitoring programmes such as land-cover change detection. However, the accuracy of such change detection activities can be limited by several factors. A key variable that can limit the accuracy of change detection is the misregistration error between the images used. Although the impacts of misregistration on change detection have been considered in various studies, a single global value for misregistration has typically been applied across the whole scene. The effect of misregistration, however, varies spatially and its effects on change detection could be more accurately predicted and ultimately removed if this spatial variation in error were modelled. The current study aimed to develop a model that described the spatial variation of misregistration for airborne image data. As misregistration is a function of geometric error, the geometric errors associated with the airborne data were modelled and this geometric error model was used to derive a model of misregistration. The impacts of various navigational variables on the accuracy of the automated geocorrection of compact airborne spectrographic imager (CASI) data were evaluated. A significant relationship was found between geometric error and angular acceleration (adjusted r 2 = 0.651; p = 0.017). The relationship between geometric error and angular acceleration together with a model of orthometric errors was used to derive an error model that described the spatial variation in geometric errors associated with the automated geocorrection of the CASI data. This model gave a probabilistic description of the spatial variation in geometric error. From the geometric error model, a model of misregistration between CASI images from two times was derived. This model was tested using data from an urban test site and a significant correlation, at 95% confidence, was found between predicted and measured misregistration. The models derived could be used in change detection, potentially reducing the impact of geometric errors and so misregistration in airborne sensor data, which is a major limitation in the use of remote sensing for environmental monitoring.
Settlement of embankment fills constructed of granite fines
Authors: Vicente Navarro, Víctor Barrientos, Ángel Yustres, Jorge Delgado
Venue: Computers Geosciences (2008)

This paper presents a study on the application of granite fines (GF) originating from the granite industry in the Northwest of Spain for the construction of embankment fills. A numerical solver was developed to simulate the unsaturated consolidation of a compacted earthfill (water content close to saturation), introducing the effect of secondary compression, and reproducing the construction process to be followed. The results obtained are quite encouraging, since settlements were found to be within an acceptable range. Nevertheless, the results also showed the need to improve the experimental characterization of the ''in-situ'' preconsolidation of the GF before using them in real applications.