abstract
stringlengths 8
9.19k
| authors
stringlengths 9
1.96k
| title
stringlengths 8
367
| __index_level_0__
int64 13
1,000k
|
|---|---|---|---|
This study shows a preliminary application of a panorama video device Hypercam in architecture-related supervision of interior renovation. This is a PC-based system that takes 360 degree of scenes for recording or analysis purposes. The setup enables an installation almost at any location. This study proposes the application of the supervision system in three categories: a construction monitoring system, an application pattern, and exemplification. The application can be used in supervision recording, coordination, review, process inspection, and process rebuild in construction. | ['Naai-Jung Shih', 'Yau-Liang Tsai', 'Daniel W. L. Lai', 'Ho-Yu Chang'] | A preliminary application of panoramic supervision system in construction site | 484,850 |
Comparison of Genetic-based Feature Extraction Methods for Facial Recognition. | ['Joseph Shelton', 'Gerry V. Dozier', 'Kelvin Bryant', 'Lasanio Small', 'Joshua Adams', 'Khary Popplewell', 'Tamirat Abegaz', 'Damon L. Woodard', 'Karl Ricanek'] | Comparison of Genetic-based Feature Extraction Methods for Facial Recognition. | 760,998 |
We present a diagrammatic method that allows the determination of all Nash equilibria of 2 × M nonzero sum games, extending thus the well known diagrammatic techniques for 2 × M zero sum and 2 × 2 nonzero sum games. We show its appropriateness for teaching purposes by analyzing modified versions of the prisoners' dilemma, the battle of the sexes, as well as of the zero sum game of matching pennies. We then use the method to give simple proofs for the existence of Nash equilibria in all 2 × M games, for both the nonzero sum (Nash existence theorem) and the zero sum case (Minimax theorem). We also prove in the same spirit the remarkable general fact that in a nondegenerate 2 × M nonzero sum game there is an odd number of equilibria. | ['Evangelos F. Magirou', 'Dimitrios K. Vassilakis', 'Ion Androutsopoulos'] | Teaching Nonzero Sum Games Using a Diagrammatic Determination of Equilibria | 301,543 |
The performance of space-time spreading (STS) transmit diversity is examined in a multiuser direct-sequence code division multiple access (DS-CDMA) system over Nakagami-m slowly-fading channels. The space-time system employs N=2 transmit antennas and L receive antennas at the user side and base-station (BS) receiver, respectively. To combat the effect of multiuser interference, we employ the linear decorrelator multiuser detector. We derive theoretical expression for the bit-error-rate (BER), and assess the performance under different system loads and fading figures m. In particular, these results show that the diversity order of 2 mL is achieved and only a signal- to-noise ratio (SNR) loss is incurred. | ['Ariel Lionel Sacramento', 'Walaa Hamouda'] | Performance of decorrelator detector in space-time CDMA systems over quasi-static and frequency non-selective Nakagami-m fading channels | 533,258 |
Learning Symbols by Neural Network | ['Yoshitsugu Kakemoto', 'Shinichi Nakasuka'] | Learning Symbols by Neural Network | 901,284 |
Caching contents at the network edge is an efficient mean for offloading traffic, reducing latency, and improving users’ quality-of-experience. In this letter, we focus on aspects of storage-bandwidth tradeoffs in which small cell base stations are distributed according to a homogeneous Poisson point process and cache contents according to a given content popularity distribution, subject to storage constraints. We provide a closed-form expression of the cache-miss probability, defined as the probability of not satisfying users requests over a given coverage area, as a function of signal-to-interference ratio, cache size, base stations density, and content popularity. In particular, it is shown that for a given minimum cache size, the popularity-based caching strategy achieves lower outage probability for a given base station density compared to uniform caching. Furthermore, we show that popularity-based caching attains better performance in terms of cache-miss probability for the same amount of spectrum. | ['Syed Tamoor-ul-Hassan', 'Mehdi Bennis', 'Pedro Henrique Juliano Nardelli', 'Matti Latva-aho'] | Caching in Wireless Small Cell Networks: A Storage-Bandwidth Tradeoff | 691,097 |
In the "classical" detection problem, a decision is to be made about the presence or absence of a target based on an observation sequence. Since this data is of a given length, we refer to this as fixed-sample-size testing. A pair of problems that are similar in spirit (but turn out to be considerably different mathematically) is that of quickest detection and transient detection. The former refers to timely notification of a statistical change; the latter, which is the subject of this paper, refers to detection of a temporary change. Much is known about the performance of Page's (1954) test in terms of average run lengths; however, more detailed statistical analysis is required to determine the detectability of a transient change. Techniques to calculate and approximate the probability of detection by Page's test for a transient of a given length and strength are developed through investigation of the probability distribution of the so-called stopping time of Page's test, which is the time between the starting instant of the test and the instant of the first alarm (false- or true-detection). | ['Chunming Han', 'Peter Willett', 'Douglas A. Abraham'] | Some methods to evaluate the performance of Page's test as used to detect transient signals | 354,935 |
A graph is $n$-e.c.$\,$ ($n$-existentially closed) if for every pair of subsets $U$, $W$ of the vertex set $V$ of the graph such that $U\cap W=\emptyset$ and $|U|+|W|=n$, there is a vertex $v\in V-(U\cup W)$ such that all edges between $v$ and $U$ are present and no edges between $v$ and $W$ are present. A graph is strongly regular if it is a regular graph such that the number of vertices mutually adjacent to a pair of vertices $v_1,v_2\in V$ depends only on whether or not $\{v_1,v_2\}$ is an edge in the graph. The only strongly regular graphs that are known to be $n$-e.c. for large $n$ are the Paley graphs. Recently D. G. Fon-Der-Flaass has found prolific constructions of strongly regular graphs using affine designs. He notes that some of these constructions were also studied by Wallis. By taking the affine designs to be Hadamard designs obtained from Paley tournaments, we use probabilistic methods to show that many non-isomorphic strongly regular $n$-e.c. graphs of order $(q+1)^2$ exist whenever $q\geq 16 n^2 2^{2n}$ is a prime power such that $q\equiv 3\!\!\!\pmod{4}$. | ['Peter J. Cameron', 'Dudley Stark'] | A Prolific Construction of Strongly Regular Graphs with the $n$-e.c. Property | 370,063 |
Object Manipulation by Virtual Menu Interaction Using Free-Hand Input in a Desktop Virtual Reality Maritime Situation Display | ['Ronald Meyer', 'Alexander Mertens', 'Jeronimo Dzaack', 'Christopher M. Schlick'] | Object Manipulation by Virtual Menu Interaction Using Free-Hand Input in a Desktop Virtual Reality Maritime Situation Display | 840,601 |
Web services represent a challenge and an opportunity for organizations wishing to expose product and services offerings through the Internet. The Web service technology provides an environment in which service providers and consumers can discover each other and conduct business transactions through the exchange of XML-based documents. However, any organization using XML and Web Services must ensure that only the right users, sending the appropriate XML content, can access their Web Services. Access control policy specification for controlling access to Web services is then becoming an emergent research area due to the rapid development of Web services in modern economy. This paper is an effort to understand the basic concepts for securing Web services and the requirements for implementing secure Web services. We describe the design and implementation of a Web service architecture for enforcing access control policies, the overall rationale and some specific choices of our design are discussed. | ['Claudio Agostino Ardagna', 'Ernesto Damiani', 'Sabrina De Capitani di Vimercati', 'Pierangela Samarati'] | A Web Service Architecture for Enforcing Access Control Policies | 229,051 |
Both the efficient execution of branch intensive code and knowing the bounds on the same are important issues in computing in general and supercomputing in particular. In prior work, it has been suggested that the hardware needed to execute code with branches optimally is exponentially dependent on the total number of dynamic branches executed, this number of branches being proportional at least to the number of iterations of the loop. For classes of code taking at least one cycle per iteration to execute, this is not the case. For loops containing one test (normally in the form of a Boolean recurrence of order one), it is shown that the hardware necessary varies from exponential to polynomial in the length of the dependence cycle L, while execution time varies from one time cycle per iteration to less than L time cycles per iteration; the variation depends on specific code dependences. These results bring the eager evaluation of imperative code closer to fruition. > | ['Augustus K. Uht'] | Requirements for optimal execution of loops with tests | 338,715 |
In the paper, the authors discuss two kinds of consequence operations characterized axiomatically. The first one are consequence operations of the type Cn+ that, in the intuitive sense, are infallible operations, always leading from accepted (true) sentences of a deductive system to accepted (true) sentences of the deductive system (see Tarski in Monatshefte fur Mathematik und Physik 37:361–404, 1930, Comptes Rendus des Seances De la Societe des Sciences et des Lettres de Varsovie 23:22–29, 1930; Pogorzelski and Slupecki in Stud Logic 9:163–176, 1960, Stud Logic 10:77–95, 1960). The second kind are dual consequence operations of the type Cn− that can be regarded as anti-infallible operations leading from non-accepted (rejected, false) sentences of a deductive system to non-accepted (rejected, false) sentences of the system (see Slupecki in Funkcja Łukasiewicza, 33–40, 1959; Wybraniec-Skardowska in Teoria zdan odrzuconych, 5–131, Zeszyty Naukowe Wyzszej Szkoly Inzynierskiej w Opolu, Seria Matematyka 4(81):35–61, 1983, Ann Pure Appl Logic 127:243–266, 2004, in On the notion and function of rejected propositions, 179–202, 2005). The operations of the types Cn+ and Cn− can be ordinary finitistic consequence operations or unit consequence operations. A deductive system can be characterized in two ways by the following triple: #R##N##R##N#$$\begin{array}{ll}{\rm by\,the\,triple}:\hspace{1.4cm} (+ , -)\hspace{0,6cm} \\ {\rm or\,by\,the\,triple}:\hspace{1.0cm} (-, +)\hspace{0,6cm} .\end{array}$$#R##N##R##N#We compare axiom systems for operations of the types Cn+ and Cn−, give some methodological properties of deductive systems defined by means of these operations (e.g. consistency, completeness, decidability in Łukasiewicz’s sense), as well as formulate different metatheorems concerning them. | ['Urszula Wybraniec-Skardowska', 'Jacek Waldmajer'] | On Pairs of Dual Consequence Operations | 428,521 |
Mobile crowd sensing enables large-scale sensing of the physical world at low cost by leveraging the available sensors on the mobile phones. One of the key factors for the success of mobile crowd sensing is uploading the sensing data to the cloud promptly. Traditional data uploading strategies leveraging whenever available networks may incur extra data cost, impact phone performance,, drain battery power significantly. In this paper, we propose an energy-efficient large data uploading framework using only WiFi network. Specifically, we propose to upload data at WiFi Ready Conditions (WRCs), when the WiFi network is connected, no front-end applications are using it. By forecasting the WRCs that will be encountered in a data uploading task, our framework intelligently selects optimal WRCs to minimize the overall energy consumption. Our evaluation results with the Device Analyzer Dataset show that the proposed method can effectively upload large data while consuming 30% less energy than the greedy-based baseline method. | ['Longbiao Chen', 'Leye Wang', 'Daqing Zhang', 'Shijian Li', 'Gang Pan'] | EnUp: Energy-Efficient Data Uploading for Mobile Crowd Sensing Applications | 978,402 |
Estimating Mobile Memory Requirements and Rendering Time for Remote Execution of the Graphics Pipeline | ['Kutty Banerjee', 'Fan Wu', 'Emmanuel Agu'] | Estimating Mobile Memory Requirements and Rendering Time for Remote Execution of the Graphics Pipeline | 647,101 |
The method is developed for multi-objective optimization problems. Its purpose is to evolve an evenly distributed group of solutions to determine the optimum Pareto set for a given problem. The algorithm determines a set of solutions (a population), this population being sorted by its domination properties and a filter is defined in order to retain the Pareto solutions. In most topology design problem volume is in general a constraint of the problem. Due to this constraint, all chromosomes used in the genetic algorithm must generate individuals with the same volume value; in the coding adopted this means that they must preserve the same number of ones and, implicitly, the same number of zeros, along the evolutionary process. It is thus necessary to define these chromosomes and to create corresponding operators of crossover and mutation which preserve volume. To reduce computational effort, optimal solutions of each of the single-objective problems are introduced in the initial population. Results obtained by the evolutionary and classical methods are compared. | ['J. F. Aguilar Madeira', 'H. Rodrigues', 'Heitor Pina'] | Genetic methods in multi-objective optimization of structures with an equality constraint on volume | 893,233 |
An overview of notable ILP areas, focusing on three invited talks at ILP 2015, two best student papers and the panel discussion on "ILP 25 Years". | ['Katsumi Inoue', 'Hayato Ohwada', 'Akihiro Yamamoto'] | Inductive Logic Programming: challenges | 965,287 |
During the design of large technical systems, the use of analytic and simulative models to test and dimension the system before implementation is of practical importance for an efficient and reliable design process. However, setting up the necessary models is time-consuming and therefore often too expensive in practice. Usually most information for modeling is already available in the design tool used to develop such extensive systems and only needs to be extracted for automatic model building. This paper presents an automated modeling approach from an existing design database using the example of a network analysis for building automation fieldbuses. The analysis is based on an analytical decomposition approach that enables fast estimation of performance measures for large-scale networks. The combination of fast analytical algorithms with automatic model generation allows network performance engineering with minimized effort for model generation and analysis. | ['Joern Ploennigs', 'Peter Buchholz', 'Mario Neugebauer', 'Klaus Kabitzsch'] | Automated modeling and analysis of CSMA-type access schemes for building automation networks | 440,079 |
Multi-objective problems with correlated objectives are a class of problems that deserve specific attention. In contrast to typical multi-objective problems, they do not require the identification of trade-offs between the objectives, as (near-) optimal solutions for any objective are (near-) optimal for every objective. Intelligently combining the feedback from these objectives, instead of only looking at a single one, can improve optimization. This class of problems is very relevant in reinforcement learning, as any single-objective reinforcement learning problem can be framed as such a multiobjective problem using multiple reward shaping functions. After discussing this problem class, we propose a solution technique for such reinforcement learning problems, called adaptive objective selection. This technique makes a temporal difference learner estimate the Q-function for each objective in parallel, and introduces a way of measuring confidence in these estimates. This confidence metric is then used to choose which objective's estimates to use for action selection. We show significant improvements in performance over other plausible techniques on two problem domains. Finally, we provide an intuitive analysis of the technique's decisions, yielding insights into the nature of the problems being solved. | ['Tim Brys', 'Ann Nowé', 'Daniel Kudenko', 'Matthew E. Taylor'] | Combining multiple correlated reward and shaping signals by measuring confidence | 388,050 |
The traditional projections onto convex sets super-resolution image reconstruction algorithm leads to the halo effect in reconstructed high resolution image, so we present a super-resolution reconstruction method based on wavelet bicubic interpolation algorithm. The new algorithm utilizes wavelet bi-cubic interpolation algorithm to obtain the initial image of POCS algorithm and introduces bilateral filter to estimate point spread function. Bilateral filtering makes non-edge pixel having minimum influence on the edge region. Algorithm also uses adaptive relaxation parameters to reduce the impact of error motion information. Compared with traditional algorithm, experiment results show that the proposed reconstruction algorithm eliminates the halo effect obviously, thus the reconstructed image can achieve a good visual effect. | ['Zhifei Tang', 'Mike Deng', 'Chuangbai Xiao', 'Jing Yu'] | Projection onto convex sets super-resolution image reconstruction based on wavelet bi-cubic interpolation | 286,128 |
The one-to-one correspondence is adopted to accelerate the speed.The idea of from coarse to fine is employed to prevent local minimum.The proposed approach achieves fast speed and high accuracy. This paper proposes a new probability iterative closest point (ICP) approach with bounded scale based on expectation maximization (EM) estimation for isotropic scaling registration of point sets with noise. The bounded-scale ICP algorithm can handle the case with different scales, but it could not effectively yield the alignment of point sets with noise. Aiming at improving registration precision, a Gaussian probability model is integrated into the bounded-scale registration problem, which is solved by the proposed method. This new method can be solved by the E-step and M-step. In the E-step, the one-to-one correspondence is built up between two point sets. In the M-step, the scale transformation including the rotation matrix, translation vector and scale factor is computed by singular value decomposition (SVD) method and the properties of parabola. Then, the Gaussian model is updated via the distance and variance between transformed point sets. Experimental results demonstrate the proposed method improves the performance significantly with high precision and fast speed. | ['Shaoyi Du', 'Juan Liu', 'Bo Bi', 'Jihua Zhu', 'Jianru Xue'] | New iterative closest point algorithm for isotropic scaling registration of point sets with noise | 660,691 |
Many research efforts have been done in the domain of static scheduling algorithms based on DAG. However, most of these literatures assume that all processors are fully connected and receive communication data concurrently, while ignoring the contentions and delays on network links in real applications, which leads to low efficiency. This paper focuses on the issue of edge scheduling for dependent task set in parallel and distributed environment. Combined with conventionally efficient heuristics, two contention-aware scheduling algorithms are proposed in the paper: OIHSA (Optimal Insertion Hybrid Scheduling Algorithm) and BBSA (Bandwidth Based Scheduling Algorithm). Both the proposed algorithms start from the inherent characteristic of the edge scheduling problem, and select route paths with relatively low network workload to transfer communication data by modified routing algorithm. OISHA optimizes the start time of communication data transferred on links in form of theorems. BBSA exploits bandwidth of network links fully to transfer communication data as soon as possible. Therefore, the makespan yielded by our algorithms can be reduced efficiently. Moreover, the proposed algorithms adapt to not only homogeneous systems but also heterogeneous systems. The experiment results indicate that the proposed algorithms obviously outperform other algorithms so far in terms of makespan. | ['Jian-Jun Han', 'Duoqiang Wang'] | Edge Scheduling Algorithms in Parallel and Distributed Systems | 262,511 |
Schedulability Analysis (SA) approaches that are based on a priori information and use fixed execution times with constant workloads work well in many application domains and allow pre-deployment guarantees of real-time performance such as Rate Monotonic Analysis (RMA [2]). However, certain realtime applications must operate in highly dynamic environments, thereby precluding accurate characterization of workloads by static models. This leads to the notion that a new SA trigger for dynamic environments, in which applications experience large variations in the workload, needs to guarantee real-time performance during run-time. This paper examines the case of periodic, dynamic real-time systems, and describes an efficient SA policing technique which can trigger SA appropriately, and uses a dynamic threshold which becomes sensitive when the quality of service (QoS) of the dynamic real-time application approaches its deadline. | ['Eui-Nam Huh', 'Lonnie R. Welch', 'Barbara Pfarr'] | An efficient schedulability analysis policing technique for periodic, dynamic real-time applications | 289,155 |
Partial differential equations (PDEs) are powerful tools for the generation of free-form surfaces. In this paper, techniques of surface representation using PDEs of different orders are investigated. In order to investigate the real-time performance and capacity of surface generation based on the PDE method, the forms of three types of partial differential equations are put forward, which are the second, mixed and fourth order PDEs. The closed form solutions of these PDEs are derived. The advantages and disadvantages of each of them are discussed. A number of examples are given to demonstrate the use and effectiveness of the techniques. | ['Jian J. Zhang', 'Lihua You'] | Surface representation using second, fourth and mixed order partial differential equations | 108,404 |
License plate recognition (LPR) plays an important role in the application of intelligent transportation system (ITS), while the license plate (LP) location is the most crucial step in it. In this paper, a new and efficient algorithm for vehicle license plate location is proposed. The purpose of this approach is to locate license plate efficiently regardless of the limitation of LP distance, angle of view, illumination conditions as well as background complexity. The contribution of this method is that we combine sliding concentric windows (SCWs) method and mathematical morphology method so as to gain a more fast and robust one. Moreover color information of LP is also employed to locate LP accurately. Compared with other LP location methods, our method is not restricted by many preconditions and can locate more than one LP in an image. Moreover, the processing time is acceptable in real time (only 0.1 second). The algorithm was tested with 200 natural-scene vehicle images of different backgrounds and ambient illumination. Experimental results lend strong support for the robustness and efficiency of the method presented in this paper. | ['Haiqi Huang', 'Ming Gu', 'Hongyang Chao'] | An Efficient Method of License Plate Location in Natural-Scene Image | 507,552 |
This paper is concerned with the problem of designing a two-degree-of-freedom (2-DOF) controller based on data. Without requiring the specific mathematical model of a plant, the parameters of stabilising controller are calculated directly from data for a linear time-invariant system. In fact, using the traditional unity feedback control, the existing results which focus on calculating stabilising PID or first-order controllers have been reported in the literature. However, there exists certain steady-state error in these approaches if the integrators are not added into the controller. In this paper, a 2-DOF controller is designed to ensure no changes in characteristic polynomial of the closed-loop systems, furthermore, in terms of a pre-specified criterion function, by applying the iterative feedback tuning technique, a local optimal performance is achieved. Especially, for the step input, through tuning the parameters of controller, the steady-state error can be reduced to zero. Finally, a numerical exam... | ['Ding Zhai', 'Qingling Zhang', 'Guoyi Liu'] | Data-driven criteria synthesis of system with two-degree-of-freedom controller | 461,223 |
The sliding mode observer is robust to measurement noises. Since the switching signals of the sliding mode observer contain the induced voltages of the motors, it is possible to obtain the position and velocity of the motors directly from the switching signals. Although the estimated position can be used for locating the position of the rotor, the estimated velocity is heavily contaminated by noises from the switching signals. This direct method nullifies the merit of the sliding mode observer. Thus, the authors also present an adaptive scheme for robust estimation of the velocity of brushless DC motors. Stability of the adaptive scheme is assured, and estimation errors due to parameter deviations are analyzed. A method of parameter adjustment is described. > | ['Takeshi Furuhashi', 'Somboon Sangwongwanich', 'Shigeru Okuma'] | A position-and-velocity sensorless control for brushless DC motors using an adaptive sliding mode observer | 270,245 |
Rapid activity prediction of HIV-1 integrase inhibitors: harnessing docking energetic components for empirical scoring by chemometric and artificial neural network approaches | ['Patcharapong Thangsunan', 'Sila Kittiwachana', 'Puttinan Meepowpan', 'Nawee Kungwan', 'Panchika Prangkio', 'Supa Hannongbua', 'Nuttee Suree'] | Rapid activity prediction of HIV-1 integrase inhibitors: harnessing docking energetic components for empirical scoring by chemometric and artificial neural network approaches | 819,931 |
We develop a detection model based on support vector machines (SVMs) and particle swarm optimization (PSO) for gene selection and tumor classification problems. The proposed model consists of two stages: first, the well-known minimum redundancy-maximum relevance (mRMR) method is applied to preselect genes that have the highest relevance with the target class and are maximally dissimilar to each other. Then, PSO is proposed to form a novel weighted SVM (WSVM) to classify samples. In this WSVM, PSO not only discards redundant genes, but also especially takes into account the degree of importance of each gene and assigns diverse weights to the different genes. We also use PSO to find appropriate kernel parameters since the choice of gene weights influences the optimal kernel parameters and vice versa. Experimental results show that the proposed mRMR-PSO-WSVM model achieves highest classification accuracy on two popular leukemia and colon gene expression datasets obtained from DNA microarrays. Therefore, we can conclude that our proposed method is very promising compared to the previously reported results. | ['Mohammad Javad Abdi', 'Seyed Mohammad Hosseini', 'Mansoor Rezghi'] | A Novel Weighted Support Vector Machine Based on Particle Swarm Optimization for Gene Selection and Tumor Classification | 194,783 |
a b s t r a c t A stochastic model of the signaling network responsible for the induction of long-term depression (LTD) at the parallel fiber to Purkinje cell synapse is described. The model includes a PKC-ERK-cPLA2 positive feedback loop and mechanisms of AMPA receptor trafficking. It was tuned to replicate calcium uncaging experiments that cause LTD. The ultrasensitive activation of ERK makes the signaling network activity bistable, causing either LTD or not. Therefore, in single synapses only two discrete stable states (LTD and non-LTD) can be expressed. The stochastic properties of the signaling network causes threshold dithering and probabilistic expression of LTD, which allows at the macroscopic level for many different and stable mean magnitudes of depression. When the volume of a single spine is simulated no thresholds for the calcium input signal are present. Such thresholds appear only when the volume of simulation is increased by a factor 100 or more and the model output is then bistable. Similarly, deterministic solutions of the same model show only bistable behavior. LTD induction requires activation of the PKC-ERK-cPLA2 positive feedback loop but this activity is not constant: the activities of ERK and of cPLA2 fluctuate strongly. This is much less the case for PKC which is more constantly activated and thereby promotes a stable output of the pathway. | ['Erik De Schutter'] | The importance of stochastic signaling processes in the induction of long-term synaptic plasticity | 383,577 |
Software metrics can be used to objectively quantify the quality of software components and systems, alleviating quality and risk concerns and raising assurance in component-based systems. In this paper, we present a graph-based model for component-based software development. We assume that a number of components have been characterized in terms of non-functional metrics of importance to the software system being developed, and that the interfaces connecting various components have been similarly characterized. The emphasis of this work is on cost and quality of the system under development, and reaching an acceptable compromise between the two. | ['Sahra Sedigh-Ali', 'Arif Ghafoor'] | A graph-based model for component-based software development | 453,815 |
Purpose – The purpose of this article is to examine the inter‐war history of the Raffles Library in Singapore with the aim of understanding what the management of the library believed its role should be as well as the role others in that society considered that it should fulfill.Design/methodology/approach – The article is based on historical research using archival sources.Findings – To a great extent the management of the library narrowly construed the institution's mission in terms of appealing to that class of persons likely to become paying members – that is, the European elite and its high‐level local collaborators. Financial constraints, relations between the library and museum as well as prevalent negative attitudes regarding class and race in colonial society are likely reasons for the lack of sustained attention to non‐European populations.Originality/value – The library history of much of Asia remains relatively unexplored, especially from a viewpoint that stresses the importance of social cont... | ['Brendan Luyt'] | The social role of the Raffles Library, Singapore, in the inter-war years | 314,736 |
The recent popularization of social web services has made them one of the primary uses of the World Wide Web. An important concept in social web services is social actions such as making connections and communicating with others and adding annotations to web resources. Predicting social actions would improve many fundamental web applications, such as recommendations and web searches.#R##N##R##N#One remarkable characteristic of social actions is that they involve multiple and heterogeneous objects such as users, documents, keywords, and locations. However, the high-dimensional property of such multinomial relations poses one fundamental challenge, that is, predicting multinomial relations with only a limited amount of data.#R##N##R##N#In this paper, we propose a new multinomial relation prediction method, which is robust to data sparsity. We transform each instance of a multinomial relation into a set of binomial relations between the objects and the multinomial relation of the involved objects. We then apply an extension of a low-dimensional embedding technique to these binomial relations, which results in a generalized eigenvalue problem guaranteeing global optimal solutions. We also incorporate attribute information as side information to address the "cold start" problem in multinomial relation prediction.#R##N##R##N#Experiments with various real-world social web service datasets demonstrate that the proposed method is more robust against data sparseness as compared to several existing methods, which can only find sub-optimal solutions. | ['Nozomi Nori', 'Danushka Bollegala', 'Hisashi Kashima'] | Multinomial relation prediction in social data: a dimension reduction approach | 744,688 |
This paper focuses on accuracy and robustness of parameters inversion in probability integral method by genetic algorithm. For this, uniform design experimental method, subsidence prediction software and genetic algorithm program are used. Result shows that parameters in probability integral method can be retrieved precisely by genetic algorithm with relative errors of the retrieved parameters are less than 1.5%; retrieving parameters by genetic algorithm has a great applicability in different areas such as measuring errors, gross errors, loss of observation stations, etc. | ['Jian_feng Zha', 'Wen Kai Feng', 'Xiao Jun Zhu', 'Li_qian Mi'] | Analysis accuracy and robustness of parameters inversion in probability integral method by genetic algorithm | 572,751 |
We present an approach for evolutionary design of the driving style of an agent, remotely operating a scale model of a car in a human competitive way. The agent perceives the environment from an overhead video camera and conveys its actions to the car via standard radio remote control transmitter. In order to cope with the video feed latency we propose an anticipatory modeling in which the agent considers its current actions based on the anticipated intrinsic (rather than currently available, outdated) state of the car and its surrounding. We formalized the notion of driving style by defining the key parameters, which describe it, and demonstrated the feasibility of applying genetic algorithms to evolve the optimal values of these parameters. The optimized driving style, employed by the agent, is human competitive in that it yields both faster and more consistent lap times than those of a human around a predefined circuit. Presented work can be viewed as a step towards the automated design of the control software of remotely operated vehicles capable to find an optimal solution to various tasks in a priori known environmental situations. Also, the results can be seen as a verification of the feasibility of developing a framework of adaptive racing games in which the human competes against a computerized opponent with matching capabilities, both operating physical, scale models of cars. | ['Ivan Tanev', 'Katsunori Shimohara'] | On human competitiveness of the evolved agent operating a scale model of a car | 107,403 |
Testing interactive systems is notoriously difficult. Not only do we need to ensure that the functionality of the developed system is correct with respect to the requirements and specifications, we also need to ensure that the user interface to the system is correct (enables a user to access the functionality correctly) and is usable. These different requirements of interactive system testing are not easily combined within a single testing strategy. We investigate the use of models of interactive systems, which have been derived from design artefacts, as the basis for generating tests for an implemented system. We give a model-based method for testing interactive systems which has low overhead in terms of the models required and which enables testing of UI and system functionality from the perspective of user interaction. | ['Judy Bowen', 'Steve Reeves'] | UI-Design Driven Model-Based Testing | 679,610 |
In many areas of science and technology, the measurement of impulse trains is an important sampling scheme. For example, wireless data transmission has grown enormously due to the recent developments in ultra wide band technology, where the information is represented as impulse trains. In this letter, we present a new approach for sampling of the impulse train using parallel exponential filters (EFs), whose outputs are measured simultaneously. We show that with parallel EFs, it is possible to reconstruct impulses with different amplitudes and appearance times within one sampling period. The reconstruction algorithm is manageable on microprocessor and VLSI circuits. Several applications of the parallel EF network are outlined. | ['Hannu Olkkonen', 'Juuso T. Olkkonen'] | Measurement and Reconstruction of Impulse Train by Parallel Exponential Filters | 308,274 |
Smart cities play an increasingly important role for the sustainable economic development of a determined area. Smart cities are considered a key element for generating wealth, knowledge and diversity, both economically and socially. A Smart City is the engine to reach the sustainability of its infrastructure and facilitate the sustainable development of its industry, buildings and citizens. The first goal to reach that sustainability is reduce the energy consumption and the levels of greenhouse gases (GHG). For that purpose, it is required scalability, extensibility and integration of new resources in order to reach a higher awareness about the energy consumption, distribution and generation, which allows a suitable modeling which can enable new countermeasure and action plans to mitigate the current excessive power consumption effects. Smart Cities should offer efficient support for global communications and access to the services and information. It is required to enable a homogenous and seamless machine to machine (M2M) communication in the different solutions and use cases. This work presents how to reach an interoperable Smart Lighting solution over the emerging M2M protocols such as CoAP built over REST architecture. This follows up the guidelines defined by the IP for Smart Objects Alliance (IPSO Alliance) in order to implement and interoperable semantic level for the street lighting, and describes the integration of the communications and logic over the existing street lighting infrastructure. | ['Miguel Castro', 'Antonio J. Jara', 'Antonio F. Gómez Skarmeta'] | Smart Lighting Solutions for Smart Cities | 49,707 |
The availability equivalence of different designs for a repairable multi-state series-parallel system (RMSPS) is discussed in this paper. The system components are assumed to be independent, and their failure and repair rates to be constant. The system availability is defined as the ability of the system to satisfy consumer demand. Factor improvement method and standby redundancy method are used to improve the system design. To evaluate availability of the both original and improved systems, a fast technique, based on universal generating function, is adopted. The availability equivalence factor is introduced to compare different system designs. Two types of availability equivalence factors of the system are derived. A numerical example is provided to illustrate how to utilize the obtained results. | ['Linmin Hu', 'Dequan Yue', 'Ruiling Tian'] | Availability equivalence analysis of a repairable multi-state series-parallel system | 867,008 |
Constructing Universal Groebner Bases | ['Volker Weispfenning'] | Constructing Universal Groebner Bases | 385,206 |
Data aggregation is a widely used technique in wireless sensor networks. There has been many related work proposed to address the data aggregation. However less of them pay attention to the property of data integrity. An attacker can simply forge data to affect the decision of base station by compromised nodes. We, therefore, propose a lightweight secure data aggregation protocol to find the compromised nodes and help the base station to verify the final results. Finally, we provide detailed security analyses to verify security of our scheme. | ['Hung-Min Sun', 'Chiung-Hsun Chen', 'Po-Chi Li'] | A Lightweight Secure Data Aggregation Protocol for Wireless Sensor Networks | 6,905 |
Information extraction out of web pages, commonly known as screen scraping, is usually performed through wrapper induction, a technique that is based on the internal structure of HTML documents. As such, the main limitation of these kinds of techniques is that a generated wrapper is only useful for the web page it was designed for. To overcome this, in this paper it is proposed a system that generates first-order logic rules that can be used to extract data from web pages. These rules are based on visual features such as font size, elements positioning or types of contents. Thus, they do not depend on a document's internal structure, and are able to work on different sites. The system has been validated on a set of different web pages, showing very high precision and good recall, which validates the robustness and the generalization capabilities of the approach. | ['José Ignacio Fernández-Villamor', 'Carlos Angel Iglesias', 'Mercedes Ruiz Garijo'] | FIRST-ORDER LOGIC RULE INDUCTION FOR INFORMATION EXTRACTION IN WEB RESOURCES | 477,385 |
This paper studies energy-efficiency (EE) and throughput optimization in the presence of randomly arriving data and quality of service (QoS) constraints. For this purpose, maximum average arrival rates supported by transmitting signals with arbitrary input distributions are initially characterized in closed form by employing the effective bandwidth of time-varying sources (e.g., discrete-time Markov and Markov fluid sources, and discrete-time and continuous-time Markov modulated Poisson sources) and effective capacity of the time-varying wireless channel. Subsequently, EE is formulated as the ratio of the maximum average arrival rate to the total power consumption, in which circuit power is also taken into account. Following these characterizations, the optimal power control policies maximizing the EE or maximizing the throughput under a minimum EE constraint are obtained. Through numerical results, the performance of the optimal power control policies is evaluated for different signal constellations and is also compared with that of constant power transmission. The impact of QoS constraints, source characteristics, circuit power, input distributions on the EE, and the throughput is analyzed. | ['Gozde Ozcan', 'Mustafa Ozmen', 'M. Cenk Gursoy'] | QoS-Driven Energy-Efficient Power Control With Random Arrivals and Arbitrary Input Distributions | 927,478 |
This paper investigates the contract design problem of a producer when he purchases parts from a supplier, and there is incomplete information regarding the quality of the parts. This is the first game-theoretic model of quality control that captures this informational asymmetry. We focus on two compensation schemes embedded in the contract, namely, price rebate when inspection is done upon receipt of the parts and warranty. We show that when a full-price rebate is not possible and the producer and the supplier have to share the damage costs, an optimal contract is such that the supplier compensates the producer by the same amount, regardless of his quality type. However, a supplier with low quality is more likely to be offered a contract with an inspection scheme, while a supplier with high quality is constrained with a warranty scheme. We also show that when the producer need not share the cost in exactly one of the compensation schemes, he may still offer the other compensation scheme to a supplier type depending on the relative costs involved, the maximum compensation cost acceptable by all supplier types, and his ex ante beliefs about the quality level of the supplier. | ['Wei Shi Lim'] | Producer-Supplier Contracts with Incomplete Information | 399,622 |
Augmented Reality (AR) browsers show geo-referenced data in the current view of a user. When the amount of data grows too large, the display quickly becomes cluttered. Clustering items by spatial and semantic attributes can temporarily alleviate the issue, but is not effective against an increasing amount of data. We present an adaptive information density display for AR that balances the amount of presented information against the potential clutter created by placing items on the screen. We use hierarchical clustering to create a level-of-detail structure, in which nodes closer to the root encompass groups of items, while the leaf nodes contain single items. Our method selects items and groups from different levels of this hierarchy based on user-defined preferences and on the amount of visual clutter caused by placing these items. The number of presented items is adapted during user interaction to avoid clutter. We compare our interface to a conventional AR browser interface in a qualitative user study. Users clearly preferred our interface, because it provided a better overview of the data and allowed for easier comparison. In a second study, we evaluated the effect of different degrees of clustering on search and recall tasks. Users generally made fewer errors, when using our interface for a search task, which indicates that the reduced clutter allowed them to stay focused on finding the relevant items. | ['Markus Tatzgern', 'Valeria Orso', 'Denis Kalkofen', 'Giulio Jacucci', 'Luciano Gamberini', 'Dieter Schmalstieg'] | Adaptive information density for augmented reality displays | 822,629 |
Mobile Robot Navigation using a Sensor Network | ['Maxim A. Batalin', 'Sukhatme G. S', 'M and Hattig'] | Mobile Robot Navigation using a Sensor Network | 591,674 |
In a grid computing environment, resources are autonomous, wide-area distributed, and what's more, they are usually not free. These unique characteristics make scheduling in a self-sustainable and market-like grid highly challenging. The goal of our work is to build such a global computational grid that every participant has enough incentive to stay and play in it. There are two parties in the grid: resource consumers and resource providers. Thus the performance objective of scheduling is two-fold: for consumers, high successful execution rate of jobs, and for providers, fair allocation of benefits. We propose an incentive-based grid scheduling, GridIS, which is composed of a P2P decentralized scheduling framework and incentive-based scheduling algorithms. Simulation results show that GridlS guarantees the incentive of every participant to a satisfying extent. | ['Lijuan Xiao', 'Yanmin Zhu', 'Lionel M. Ni', 'Zhiwei Xu'] | GridIS: an incentive-based grid scheduling | 152,885 |
The thermal rate constants for the N +N2 gas-phase reaction have been calculated using the quasiclassical semiclassical and reduced dimensionality quantum methods. The improvement of semiclassical over quasiclassical calculations (with respect to quantum ones) is significant. | ['Noelia Faginas Lago', 'Antonio Laganà', 'Ernesto Garcia', 'Xavier Giménez'] | Thermal rate coefficients for the N + N 2 reaction: quasiclassical, semiclassical and quantum calculations | 329,962 |
In this paper, we propose two novel textural-based features for writer identification: CoHinge and QuadHinge which are based on the spatial and attribute co-occurrence of the Hinge kernel. The CoHinge feature is the joint distribution of the Hinge kernel on two different pixels of writing contours and the QuadHinge feature is the joint distribution of angles and curvature information of contour fragments. We evaluate the proposed features on five benchmark data sets and their combined large set and the experimental results demonstrate the discriminative and powerful of the proposed features. | ['Sheng He', 'Lambertus Schomaker'] | Co-occurrence Features for Writer Identification | 988,645 |
Signature-based network intrusion detection requires fast and reconfigurable pattern matching for deep packet inspection. In our previous work we address this problem with a hardware based pattern matching engine that utilizes a novel state encoding scheme to allow memory efficient use of Deterministic Finite Automata. In this work we expand on these concepts to create a completely software based system, P3FSM, which combines the properties of hardware based systems with the portability and programmability of software. Specifically we introduce two methods, Character Aware and SDFA, for encoding predictive state codes which can forecast the next states of our FSM. The result is software based pattern matching which is fast, reconfigurable, memory-efficient and portable. | ['Lucas Vespa', 'Mini Mathew', 'Ning Weng'] | P3FSM: Portable Predictive Pattern Matching Finite State Machine | 68,980 |
We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies. We use known lower bounds and separation results from circuit complexity to prove similar results for the size of rewritings that do not use non-signature constants. For example, we show that, in the worst case, positive existential and nonrecursive Datalog rewritings are exponentially longer than the original queries; nonrecursive Datalog rewritings are in general exponentially more succinct than positive existential rewritings; while first-order rewritings can be superpolynomially more succinct than positive existential rewritings. | ['Stanislav Kikot', 'Roman Kontchakov', 'Vladimir V. Podolskii', 'Michael Zakharyaschev'] | Exponential lower bounds and separation for query rewriting | 196,373 |
The studies on user and mobile phone interaction have been an important problem in small screen interface design. The present study was intend to investigate the impact of three common mobile phone menu displays: matrix, tree, and page-to-page - and differential organizations of their sub-menus and functions by reaction time experiment. We also used rating scale to investigate users' preference of different mobile phone menu displays. Reaction time for accurately completing these operations was fastest when participants were presented with the matrix menu and fastest when participants were presented organizations emphasizing logical categorization rather than non-logical categorization. The result also showed consistency between users' operating efficiency and mobile phone users' interface preference. Finally, the implications of these findings for mobile phone design are discussed. | ['Xuemin Zhang', 'Wen Shan', 'Qin Xu', 'Bin Yang', 'Yunfeng Zhang'] | An Ergonomics Study of Menu-Operation on Mobile Phone Interface | 1,350 |
The agent technology arises as a solution that provides flexibility and robustness to address dynamic and complex domains. Such flexibility can be achieved by the adoption of existing agent-based approaches, such as the BDI architecture, which provides agents with the mental attitudes of beliefs, desires and intentions. This architecture is highly customisable, leaving gaps to be fulfilled in particular applications. One of these gaps is the plan selection algorithm that is responsible for selecting a plan to be executed by an agent to achieve a goal, having an important influence on the overall agent performance. Thus, in this paper, we propose a plan selection approach, which is able to learn plans that provide possibly best outcomes, based on a current context and agent's preferences. Our approach is composed of a meta-model, which must be instantiated to specify plan metadata, and a technique that uses such metadata to learn and predict plan outcomes. We evaluated our approach experimentally, and results indicate it is effective. | ['João Guilherme Faccin', 'Ingrid Nunes'] | BDI-Agent Plan Selection Based on Prediction of Plan Outcomes | 646,786 |
Pointing movements with the hand were used to control directly a cursor to point to targets on a graphical display with different gain settings. A detailed analysis of both the tumor and hand movements showed how features of the movements scale over a wide range of distances and target widths. Cursor movements showed gain effects, while hand movements were relatively unaffected by gain. The results suggest that considering the behaviour of the hand, rather than the cursor, will lead to more effective modelling of human performance with certain types of pointing devices. | ['Evan D. Graham', 'Christine L. MacKenzie'] | Pointing on a computer display | 332,871 |
Power supply based on an inductive coupled contactless energy transfer system is presented in this paper. The energy is transferred using a rotatable transformer and a power electronic converter. To minimize total losses of the system, a series resonant compensation circuit is applied assuring zero-current switching condition for insulated-gate bipolar transistors. The analytical expression of the transfer dc voltage gain is presented and discussed. The novelty of the system lies in the application of a fully digital field-programmable-gate-array-based controller and a protection system. The resonant frequency is adjusted by a primary peak current regulator. Some simulation and experimental results illustrating the operation of the developed 3-kW 60-kHz laboratory prototype are given. Although the presented power supply with a rotatable transformer is constructed mainly for robotics and manipulators, the described design and control methodology has general validity and can be applied for a wide class of contactless power supply with core or coreless transformers. | ['A. Moradewicz', 'Marian P. Kazmierkowski'] | Contactless Energy Transfer System With FPGA-Controlled Resonant Converter | 344,200 |
This work aims at improving real-time motion control and dead-reckoning of wheeled skid-steer vehicles by considering the effects of slippage, but without introducing the complexity of dynamics computations in the loop. This traction scheme is found both in many off-the-shelf mobile robots due to its mechanical simplicity and in outdoor applications due to its maneuverability. In previous works, we reported a method to experimentally obtain an optimized kinematic model for skid-steer tracked vehicles based on the boundedness of the instantaneous centers of rotation (ICRs) of treads on the motion plane. This paper provides further insight on this method, which is now proposed for wheeled skid-steer vehicles. It has been successfully applied to a popular research robotic platform, pioneer P3-AT, with different kinds of tires and terrain types. | ['Anthony Mandow', 'Jorge L. Martínez', 'Jesús Morales', 'Jose-Luis Blanco', 'A. Garcia-Cerezo', 'Javier Gonzalez'] | Experimental kinematics for wheeled skid-steer mobile robots | 242,738 |
We propose AL/sub SP/ a Declarative Executable Specification Language for Planning Attacks to Security Protocols based on logic programming. In AL/sub SP/ we can give a declarative specification of a protocol with the natural semantics of send and receive actions. We view a protocol trace as a plan to reach a goal, so that attacks are just plans reaching goals that correspond to security violations, which can be also declaratively specified. Building on results from logic programming and planning, we map the existence of an attack to a protocol into the existence of a model for the protocol specification that satisfies the specification of an attack. AL/sub SP/ specifications are executable, as we can automatically search for attacks via any efficient model generator (such as smodels), that implements the stable model semantics of normal logic programs. Thus, we come to a specification language which is easy to use (protocol specifications are expressed at a high level of abstraction, and with an intuitive notation close to their traditional description) still keeping the rigor of a formal specification that, in addition, is executable. | ['Luigia Carlucci Aiello', 'Fabio Massacci'] | An executable specification language for planning attacks to security protocols | 485,050 |
We describe the development and deployment of a system for long-distance remote observation of robotic operations. The system we have developed is targeted to exploration, multi-participant interaction, and tele-learning. In particular, we used this system with a robot deployed in an underwater environment in order to produce interactive web-casts of scientific material. The system used a combination of robotic and networking technologies and was deployed and evaluated in a context where students in a classroom were able to observe and participate to a limited degree in the operation of a distant robot being used for environmental assessment. | ['Ioannis M. Rekleitis', 'Gregory Dudek', 'Yasmina Schoueri', 'Philippe Giguère', 'Junaed Sattar'] | Telepresence across the Ocean | 148,888 |
In this paper, a learning-companion robot based on a Pleo (a dinosaur-robot) is introduced. The learning-companion robot is equipped with a low-cost Web camera, a computer, and an attention monitoring algorithm so that it can not only monitor a learnerpsilas attention status but also detect whether the learner is too close to a computer screen during an on-line learning activity. The motivation of the development of the learning-companion robot is to alleviate parentspsila supervision burdens when they can not personally accompany their children to engage in some learning activities or playing computer games. | ['Mu-Chun Su', 'De-Yuan Huang', 'Shih-Chieh Lin', 'Yi-Zeng Hsieh', 'Gwo-Dong Chen'] | Application of a Learning-Companion Robot in Learning Environments | 179,045 |
Information and communications technologies (ICT) are fostering the appearance of a plethora of new services and applications. On the one hand, ICT will improve the efficiency of a variety of processes (e.g. supply chains, e-commerce, etc.) and they will make easy the development of new services. On the other hand, the massive deployment of these new technologies may lead to the invasion of users privacy. In this article, we analyse four of the main technologies which can put the privacy of their users in jeopardy: Internet browsing, location-based services, RFID technology and statistical databases. | ['Antoni Martínez-Ballesté', 'Agusti Solanas'] | Privacy in the Information and Communications Technologies | 364,803 |
This paper brings together two important developments in forecasting literature; the artificial neural networks and factor models. The paper introduces the factor augmented artificial neural network (FAANN) hybrid model in order to produce a more accurate forecasting. Theoretical and empirical findings have indicated that integration of various models can be an effective way of improving on their predictive performance, especially when the models in the ensemble are quite different. The proposed model is used to forecast three time series variables using large South African monthly panel, namely, deposit rate, gold mining share prices and Long term interest rate, using monthly data over the in-sample period (training set) 1992:1–2006:12. The variables are used to compute out-of-sample (testing set) results for 3, 6 and 12 month-ahead forecasts for the period of 2007:1–2011:12. The out-of-sample root mean square error findings show that the FAANN model yields substantial improvements over the autoregressive AR benchmark model and standard dynamic factor model (DFM). The Diebold–Mariano test results also further confirm the superiority of the FAANN model forecast performance over the AR benchmark model and the DFM model forecasts. The superiority of the FAANN model is due to the ANN flexibility to account for potentially complex nonlinear relationships that are not easily captured by linear models. | ['Ali Babikir', 'Henry Mwambi'] | Factor Augmented Artificial Neural Network Model | 846,027 |
Task demonstration is an effective technique for developing robot motion control policies. As tasks become more complex, however, demonstration can become more difficult. In this work, we introduce an algorithm that uses corrective human feedback to build a policy able to perform a novel task, by combining simpler policies learned from demonstration. While some demonstration-based learning approaches do adapt policies with execution experience, few provide corrections within low-level motion control domains or to enable the linking of multiple of demonstrated policies. Here we introduce Feedback for Policy Scaffolding (FPS) as an algorithm that first evaluates and corrects the execution of motion primitive policies learned from demonstration. The algorithm next corrects and enables the execution of a more complex task constructed from these primitives. Key advantages of building a policy from demonstrated primitives is the potential for primitive policy reuse within multiple complex policies and the faster development of these policies, in addition to the development of complex policies for which full demonstration is difficult. Policy reuse under our algorithm is assisted by human teacher feedback, which also contributes to the improvement of policy performance. Within a simulated robot motion control domain we validate that, using FPS, a policy for a novel task is successfully built from motion primitives learned from demonstration. We show feedback to both aid and enable policy development, improving policy performance in success, speed and efficiency. | ['Brenna D. Argall', 'Brett Browning', 'Manuela M. Veloso'] | Teacher feedback to scaffold and refine demonstrated motion primitives on a mobile robot | 176,242 |
Improving the performance of far-field speaker verification using multi-condition training: the case of GMM-UBM and i-vector systems. | ['Anderson R. Avila', 'Milton Orlando Sarria Paja', 'Francisco J. Fraga', "Douglas D. O'Shaughnessy", 'Tiago H. Falk'] | Improving the performance of far-field speaker verification using multi-condition training: the case of GMM-UBM and i-vector systems. | 798,951 |
Fault detection and isolation schemes are designed to detect the onset of adverse events during operations of complex systems, such as aircraft and industrial processes. The state-of-the-art fault diagnosis systems on aircraft combine an expert-created reference model of the associations between faults and symptoms, and a Naive Bayes reasoner. For complex systems with many dependencies between components, the expert-generated reference models are often incomplete, which hinders timely and accurate fault diagnosis. Mining aircraft flight data is a promising approach to finding these missing relations between symptoms and data. However, mining algorithms generate a multitude of relations, and only a small subset of these relations may be useful for improving diagnoser performance. In this paper, we adopt a knowledge engineering approach that combines data mining methods with human expert input to update an existing reference model and improve the overall diagnostic performance. We discuss three case studies to demonstrate the effectiveness of this method. | ['Daniel L. C. Mack', 'Gautam Biswas', 'Xenofon D. Koutsoukos', 'Dinkar Mylaraswamy'] | Learning Bayesian Network Structures to Augment Aircraft Diagnostic Reference Models | 706,657 |
Polymorphically Typed Logic Programs. | ['Eyal Yardeni', 'Thom W. Frühwirth', 'Ehud Y. Shapiro'] | Polymorphically Typed Logic Programs. | 782,442 |
Since 2000, the Spanish National Institute for Aerospace Technique (INTA) has been developing the so-called OWLS technology (Optical Wireless Links for intra-Spacecraft communications). After a number of ground-demonstrations, technological developments, and in-orbit experiments, the time was ripe for a new step: the transition from the experimental to the “platform” technology. This is where the highest TRL has been achieved. OWLS has been recently applied to (A) the On Board Data Handling subsystem of OPTOS, the first fully wireless satellite, and (B) addressing the communication challenge between a sensor and a meteorological station on the Martian surface, within the Mars MetNet Precursor Mission. | ['I. Arruego', 'J. Rivas', 'J. Martinez', 'A. Martin-Ortega', 'V. Apestigue', 'J.R. de Mingo', 'J.J. Jimenez', 'F. J. Alvarez', 'Miguel Gonzalez-Guerrero', 'Jose A. Dominguez'] | Practical application of the Optical Wireless communication technology (OWLS) in extreme environments | 636,878 |
Despite an intensive and long-lasting effort from the scientific community, the dynamic behavior of a single cache is still hard to model and work around hierarchy or federation of caches has barely started. As a result, it is very difficult to predict the potential benefit that one could gain from a cache in a real setting and network operators lack efficient tools to decide whether or not to deploy a caching architecture. In this paper, we propose a tractable optimization model whose aim is to decide where to deploy caches and to fine-tune the caching parameters and architecture in order to maximize the overall benefit (measured as the difference between the bandwidth saved in the network and the cost of the caching architecture). The dynamic behavior of caches is taken into account in a simple way by considering blocks of contents ordered according to their popularities. The model we propose also allows to include streaming capacity of a cache (a feature that is most often omitted in cache location models). Some results over series of randomly generated instances are reported. | ['Eric Gourdin', 'Pierre-Olivier Bauguion'] | Optimal hierarchical deployment of caches for video streaming | 346,639 |
QUAD is an open source profiling toolset, which is an integral part of the Q2 profiling framework. In this paper, we extend QUAD to introduce the concept of Unique Data Values regarding the data communication among functions. This feature is important to make a proper partitioning of the application. Mapping a well-known feature tracker application onto the multicore heterogeneous platform at hand is presented as a case study to substantiate the usefulness of the added feature. Experimental results show a speedup of 2.24x by utilizing the new QUAD toolset. | ['Imran Ashraf', 'S. Arash Ostadzadeh', 'Roel Meeuws', 'Koen Bertels'] | Communication-aware HW/SW co-design for heterogeneous multicore platforms | 170,308 |
Pedestrian detection has been widely used in many applications, however, it is a challenging task and there are many problems unsolved to be handled. Althougth Histograms of Oriented Gradients (HOG) plus Support Vector Machine (SVM) is the most successful pedestrian detection algorithm, the detection rate is becoming worse when the portions of human partial ocllusions are increasing. We propose an approach of adding the head features based on HOG for improving pedestrian detection rates in the case of body partial occlusions. The experiment demonstrates that our approach is robust to the occlusions. | ['Chenglong Yu', 'Xuan Wang'] | Pedestrian detection based on combinational holistic and partial features | 81,443 |
This letter describes the design, fabrication, and testing of a wireless bladder-pressure-sensing system for chronic, point-of-care applications, such as urodynamics or closed-loop neuromodulation. The system consists of a miniature implantable device and an external RF receiver and wireless battery charger. The implant is small enough to be cystoscopically implanted within the bladder wall, where it is securely held and shielded from the urine stream. The implant consists of a custom application-specific integrated circuit (ASIC), a pressure transducer, a rechargeable battery, and wireless telemetry and recharging antennas. The ASIC includes instrumentation, wireless transmission, and power-management circuitry, and on an average draws less than 9 μA from the 3.6-V battery. The battery charge can be wirelessly replenished with daily 6-h recharge periods that can occur during the periods of sleep. Acute in vivo evaluation of the pressure-sensing system in canine models has demonstrated that the system can accurately capture lumen pressure from a submucosal implant location. | ['Steve Majerus', 'Paul C. Fletter', 'Margot S. Damaser', 'Steven L. Garverick'] | Low-Power Wireless Micromanometer System for Acute and Chronic Bladder-Pressure Monitoring | 314,908 |
Revealing the dynamics of community structure is of great concern for scientists from many fields. Specifically, how to quantify the dynamic details of soft community structure is a very interesting topic. In this paper, the authors propose a novel framework to study the scalable dynamic behavior of the soft community structure. First, the authors model the Potts dynamics to detect community structure using a “soft” Markov process. Then the soft stability of in a multiscale view is proposed to naturally uncover the local uniform behavior of spin values across multiple hierarchical levels. Finally, a new partition index is developed to detect fuzzy communities based on the stability and the dynamical information. Experiments on the both synthetically generated and real-world networks verify that the framework can be used to uncover hierarchical community structures effectively and efficiently. | ['Hui-Jia Li', 'Huiying Li'] | Scalably revealing the dynamics of soft community structure in complex networks | 633,156 |
In this paper a semi-analytical technique for generating quadrotor trajectories using the projection of sub-Riemannian curves on SE(3) onto ℝ 3 is presented. The benefits of using these trajectories are that they have constant speed and acceleration magnitude, are smooth and analytically defined in terms of standard functions. Also, they are sub-optimal with respect to a weighted quadratic cost function of the translational and angular velocities. This paper shows, through simulation, that these curves are also dynamically feasible. In addition, a method for changing the velocity profile along these curves using time parametrisation, allowing for smooth rest-to-rest manoeuvres, is shown. An obstacle avoidance strategy using these analytically defined curves is demonstrated by producing multiple trajectories of different shapes. This is achieved by adding a final velocity perturbation to the error function that is minimised when generating the trajectory. | ['Jonathan Jamieson', 'James Biggs'] | Trajectory generation using sub-Riemannian curves for quadrotor UAVs | 191,891 |
With current VLSI technology it is possible to integrate complex systems in a single chip. Therefore much more efficient design and verification methods are needed especially at system level. The authors are using real-time structured analysis/structured design in logical behaviour specification and design of systems. They have developed automatic transformation from this graphical analysis and specification method to VHDL-hardware description language. The resulting code can be simulated and so the behaviour of system can be verified at an early design phase. This paper presents the transformation principles and also describes the whole design process of ASICs. > | ['Tuomo Tikkanen', 'Timo Lappänen', 'Jorma Kivelä'] | Structured analysis and VHDL in embedded ASIC design and verification | 101,139 |
The emerging vehicular communications will enable a variety of applications for safety, traffic efficiency, driver assistance and infotainment. Due to high vehicular speed, sporadic connection, limited communication range, and large volume of data that need to be transmitted, vehicular communications have the stringent requirement of real-time vehicular communications. This paper presents our tests with 802.11p device and presents its performance evaluation in terms of throughput, loss rate, communication range and resending rate. The experimental results show that the 802.11p device can achieve real-time vehicular communications and is suitable for the applications with medium throughput, and a few hundred meters of communication range. | ['Huaqun Guo', 'Shen Tat Goh', 'Nicholas C. S. Foo', 'Qian Zhang', 'Wai-Choong Wong'] | Performance evaluation of 802.11p device for secure vehicular communication | 359,049 |
The Material Loss and Failure Process in Sugar Production in Indonesia: A Case | ['Henry Yuliando', 'Adi Djoko Guritno', 'Endy Suwondo'] | The Material Loss and Failure Process in Sugar Production in Indonesia: A Case | 796,644 |
We introduce a resource adaptive agent mechanism which supports the user in interactive theorem proving. The mechanism uses a two layered architecture of agent societies to suggest appropriate commands together with possible command argument instantiations. Experiments with this approach show that its effectiveness can be further improved by introducing a resource concept. In this paper we provide an abstract view on the overall mechanism, motivate the necessity of an appropriate resource concept and discuss its realization within the agent architecture. | ['Christoph Benzmueller', 'Volker Sorge'] | Resource Adaptive Agents in Interactive Theorem Proving | 70,987 |
In this study, a collision avoidance method with model predictive control is proposed for a nonlinear model of a four-wheeled vehicle. The C/GMRES algorithm is used for solving the nonlinear model predictive control (NMPC) problem within a short sampling period. A nonlinear tire model is employed to represent the realistic behavior of a vehicle. Here, to consider whether it is possible to avoid an obstacle physically, an unavoidable region (UR) is constructed as the region in which the vehicle cannot avoid the obstacle owing to physical limitations. Even if the distance between the vehicle and the obstacle is short, the vehicle is controlled by NMPC not only to avoid the UR but also to stay on the road. A performance index for satisfying the above constraints is proposed, and control responses are investigated through numerical simulations. | ['Masashi Nanao', 'Toshiyuki Ohtsuka'] | Nonlinear model predictive control for vehicle collision avoidance using C/GMRES algorithm | 359,335 |
Adaptive exploration uses active learning principles to improve the efficiency of autonomous robotic surveys. This work considers an important and understudied aspect of autonomous exploration: in situ validation of remote sensing measurements. We focus on high-dimensional sensor data with a specific case study of spectroscopic mapping. A field robot refines an orbital image by measuring the surface at many wavelengths. We introduce a new objective function based on spectral unmixing that seeks pure spectral signatures to accurately model diluted remote signals. This objective reflects physical properties of the multi-wavelength data. The rover visits locations that jointly improve its model of the environment while satisfying time and energy constraints. We simulate exploration using alternative planning approaches, and show proof of concept results with the canonical spectroscopic map of a mining district in Cuprite, Nevada. | ['David R. Thompson', 'David Wettergreen', 'Greydon T. Foil', 'P. Michael Furlong', 'Anatha Ravi Kiran'] | Spatio-spectral exploration combining in situ and remote measurements | 763,301 |
To make a mobile robot with real-time vision system adapt to the highly dynamic environments and emergencies under the real-time constraints, a significant account of processing power is needed. Instead of pushing the limit of software development and computational resources, and to reduce the system computation time and improve system fault-tolerance, this paper presents an embedded platform which can dynamically reconfigure a mobile robot system on the fly by integrating field programmable gate arrays (FPGA) and embedded processors in a system-on-chip (SOC) environment. The BDI agent model is adopted as the unified agent structure, which significantly simplify the HW/SW partitioning and communication. A self-reconfigurable platform is also proposed to improve the hardware flexibility. This proposed embedded framework has been applied to a real-world mobile robot, and the experimental results demonstrate its feasibility and efficiency | ['Yan Meng'] | An agent-based mobile robot system using configurable SOC technique | 401,985 |
Parameter estimation and model order selection for linear regression models are two classical problems. In this article we derive the minimum mean-square error (MMSE) parameter estimate for a linear regression model with unknown order. We call the so-obtained estimator the Bayesian Parameter estimation Method (BPM). We also derive the model order selection rule which maximizes the probability of selecting the correct model. The rule is denoted BOSS—Bayesian Order Selection Strategy. The estimators have several advantages: They satisfy certain optimality criteria, they are non-asymptotic and they have low computational complexity. We also derive “empirical Bayesian” versions of BPM and BOSS, which do not require any prior knowledge nor do they need the choice of any “user parameters”. We show that our estimators outperform several classical methods, including the AIC and BIC for order selection. | ['Yngve Selén', 'Erik G. Larsson'] | Parameter estimation and order selection for linear regression problems | 474,101 |
Dynamic Data-Driven Avionics Systems (DDDAS) embody ideas from the Dynamic Data- Driven Application Systems paradigm by creating a data-driven feedback loop that analyzes spatio-temporal data streams coming from aircraft sensors and instruments, looks for errors in the data signaling potential failure modes, and corrects for erroneous data when possible. In case of emergency, DDDAS need to provide enough information about the failure to pilots to support their decision making in real-time. We have developed the PILOTS system, which supports data-error tolerant spatio-temporal stream processing, as an initial step to realize the concept of DDDAS. In this paper, we apply the PILOTS system to actual data from the Tuninter 1153 (TU1153) | ['Shigeru Imai', 'Alessandro Galli', 'Carlos A. Varela'] | Dynamic Data-Driven Avionics Systems: Inferring Failure Modes from Data Streams | 119,282 |
In order to train fuzzy neural nets fuzzy number weights have to be adjusted. Because fuzzy arithmetic automatically leads to monotonic increasing outputs a direct fuzzification of the backpropagation method does not work. Therefore, the focus is on other strategies like evolutionary algorithms. In this paper we suggest a backpropagation based method of adjusting the weights. Furthermore we can show that for the proposed method convergence can be guaranteed. | ['Thomas Feuring', 'James J. Buckley', 'Yoichi Hayashi'] | Adjusting fuzzy weights in fuzzy neural nets | 339,783 |
This paper presents a new generalized particle model (GPM) to generate the prediction coding for lossless data compression. Local rules for particle movement in GPM, parallel algorithm and its implementation structure to generate the desired predictive coding are discussed. The proposed GPM approach has advantages in terms of encoding speed, parallelism, scalability, simplicity, and easy hardware implementation over other sequential lossless compression methods. | ['Dianxun Shuai', 'Liangjun Huang'] | A New Particle Model For Prediction Coding of Lossless Data Compression | 280,037 |
This paper proposes an intelligent rate controller for the Internet traffic. Called the IntelRate (Intelligent Rate), it is a router-based controller and uses the fuzzy logic control approach to adjust the source sending rate based on the instantaneous queue size of the router. Unlike other explicit congestion control protocols, the IntelRate controller need not evaluate the link states (such as bottleneck bandwidth or the number of flows in the link) while performing well to the sudden changes in traffic load or bandwidth. Simulation results and comparisons have verified the effectiveness of our scheme, and showed the IntelRate controller is more stable and robust upon large network changes than other existing protocols that rely on the estimation of available bandwidth in order to compute the admissible source sending rate. | ['Jungang Liu', 'Oliver W. W. Yang'] | Design and Evaluation of an Intelligent Rate Controller for Heterogeneous Networks | 7,293 |
Self-optimizing mechatronic systems are a new class of technical system promising new levels of flexibility and utility in electro-mechanical systems. Planning is an important method to realize self-optimization, although today hardly used in mechatronics. In this context, planning is understood as search for a feasible sequence of operations which implements the execution of specific job assigned to a system. This search is a complex and time-consuming task. Hence, it is desirable to decompose the planning task into smaller sub problems according to paradigm of divide & conquer and use problem specific solution methods. Unfortunately, possible planning sub problems in mechatronic systems cannot be considered isolated since sub modules influence each other. This paper introduces the application of a multi-agent-planning model based on cooperative objective functions that enable the coordinated solution of sub problems. | ['Benjamin Klöpper', 'Shinichi Honiden', 'Wilhelm Dangelmaier'] | Divide & conquer in planning for self-optimizing mechatronic systems - A first application example | 400,087 |
Code coverage is a popular test adequacy criterion in practice. Code coverage, however, remains controversial as there is a lack of coherent empirical evidence for its relation with test suite effectiveness. More recently, test suite size has been shown to be highly correlated with effectiveness. However, previous studies treat test methods as the smallest unit of interest, and ignore potential factors influencing this relationship. We propose to go beyond test suite size, by investigating test assertions inside test methods. We empirically evaluate the relationship between a test suite’s effectiveness and the (1) number of assertions, (2) assertion coverage, and (3) different types of assertions. We compose 6,700 test suites in total, using 24,000 assertions of five real-world Java projects. We find that the number of assertions in a test suite strongly correlates with its effectiveness, and this factor directly influences the relationship between test suite size and effectiveness. Our results also indicate that assertion coverage is strongly correlated with effectiveness and different types of assertions can influence the effectiveness of their containing test suites. | ['Yucheng Zhang', 'Ali Mesbah'] | Assertions are strongly correlated with test suite effectiveness | 279,121 |
Recently, one of the problems with the Internet is the is- sue of scalability. To this end, locator/identifier separation protocol (LISP), which separates end-system identifiers and routing locators, has been proposed as a solution. In the LISP deployed network, the ingress and egress nodes of inter-AS traffic is determined by edge router selection (ERS) and endpoint identifier-routing locator mapping assignment (ERMA). In this paper, joint optimizations of ERS and ERMA for stub networks with and without pre- determined link weights are studied and the mixed integer linear programming (MILP) formulations for the problems are given. To make the problem with optimizable link weights tractable, a re- vised local search algorithm is also proposed. Simulation results show that joint optimization of ERS and ERMA enables better net- work performance. | ['Ke Li', 'Sheng Wang', 'Xiong Wang'] | Edge router selection and traffic engineering in LISP-capable networks | 647,523 |
We propose a multi-stream continuous hidden Markov model (MSCHMM) framework that can learn from multiple modalities. We assume that the feature space is partitioned into subspaces generated by different sources of information. In order to fuse the different modalities, the proposed MSCHMM introduces stream relevance weights. First, we modify the probability density function (pdf) that characterizes the standard continuous HMM to include state and component dependent stream relevance weights. The resulting pdf approximate is a linear combination of pdfs characterizing multiple modalities. Second, we formulate the CHMM objective function to allow for the simultaneous optimization of all model parameters including the relevance weights. Third, we generalize the maximum likelihood based Baum-Welch algorithm and the minimum classification error/gradient probabilistic descent (MCE/GPD) learning algorithms to include stream relevance weights. We propose two versions of the MSCHMM. The first one introduces the relevance weights at the state level while the second one introduces the weights at the component level. We illustrate the performance of the proposed MSCHMM structures using synthetic data sets. We also apply them to the problem of landmine detection using ground penetrating radar. We show that when the multiple sources of information are equally relevant across all training data, the performance of the proposed MSCHMM is comparable to the baseline CHMM. However, when the relevance of the sources varies, the MSCHMM outperforms the baseline CHMM because it can learn the optimal relevance weights. We also show that our approach outperforms existing multi-stream HMM because the latter one cannot optimize all model parameters simultaneously. | ['Oualid Missaoui', 'Hichem Frigui', 'Paul D. Gader'] | Multi-stream continuous hidden Markov models with application to landmine detection | 291,077 |
simPATHy: a new method for simulating data from perturbed biological PATHways. | ['Elisa Salviato', 'Vera Djordjilović', 'Monica Chiogna', 'Chiara Romualdi'] | simPATHy: a new method for simulating data from perturbed biological PATHways. | 906,747 |
Introducing Communication in Dis-POMDPs with Locality of Interaction. | ['Makoto Tasaki', 'Yuichi Yabu', 'Yuki Iwanari', 'Makoto Yokoo', 'Milind Tambe', 'Janusz Marecki', 'Pradeep Varakantham'] | Introducing Communication in Dis-POMDPs with Locality of Interaction. | 670,593 |
Concise indexes related to variability of foetal heart rate (FHR) are usually utilised for foetal monitoring; they enrich information provided by cardiotocography (CTG). Most attention is paid to the short term variability (STV), which relates to activity and reaction of autonomic nervous control of foetal heart. There is not a unique method to compute short term variability of the FHR but different formulas have been proposed and are employed in clinical and scientific environments: this leads to different evaluations and makes difficult comparative studies. Nine short term variability indexes: Arduini, Dalton, Organ, Sonicaid 8000, Van Geijn, Yeh, Zugaib a modified version of Arduini index and Standard Deviation were considered and compared to test their robustness in CTG applications. A large set of synthetic foetal heart rate series with known features were used to compare indexes performances. Different amounts of variability, mean foetal heart rate, storage rates, baseline variations were considered. The different indexes were in particular tested for their capability to recognise short term heart rate variability variation, their dependence on heart rate signal storage rate (as those provided by commercial cardiotocographic devices), on mean value of the foetal heart rate and on modifications of the floatingline, such in case of accelerations or decelerations. Concise statistical parameters relative to indexes scores were presented in comparative tables. Results indicate that although the indexes are able to recognise STV variation, they show substantial differences in magnitude and some in sensibility. Results depend on the frequency used to acquire and store FHR data (depending on devices); in general, the lower is data rate the more degraded are the results. Furthermore, results differently depend on FHR mean, some for their intrinsic definition; differences arise also in correspondences of accelerations and decelerations. Our results demonstrate that only indexes which refer directly to differences in FHR values, such as Organ and SD indexes, not show dependence on FHR mean. The use of the Standard Deviation index may provide efficient information while showing independence from the considered variables. Indexes performance in case of real cardiotocographic signals were also presented as examples. | ['Mario Cesarelli', 'Maria Romano', 'Paolo Bifulco'] | Comparison of short term variability indexes in cardiotocographic foetal monitoring | 443,103 |
The NATO research task group IST-118 titled “SOA recommendations for disadvantaged grids in the tactical domain” is addressing the challenge of implementing the Service Oriented Architecture (SOA) paradigm at the tactical level by providing guidance and best practices in the form of a Tactical SOA Profile. The group will conduct identification and feasibility assessments of possible improvements of the Tactical SOA Profile, over a series of live and emulated experiments. In this paper, we describe our first experiments in applying SOA Web services to mobile nodes that are connected using Wireless Broadband Mobile Networks (WBMN) in the tactical domain. The experiments involved components provided by various nations, including radio hardware equipment, the Publish/Subscribe messaging service and NATO Friendly Force Information (NFFI) (as our functional service). We measured the system performance at service and physical (radio) levels in the presence of network disruption. We conclude by presenting the results of the experiments and a view of future work. | ['Marco Manso', 'Jose M. Alcaraz Calero', 'Christoph Barz', 'Trude Hafsøe Bloebaum', 'Kevin S. Chan', 'Norman Jansen', 'Frank T. Johnsen', 'Garik Markarian', 'Peter-Paul Meiler', 'Ian Owens', 'Joanna Sliwa', 'Qi Wang'] | SOA and Wireless Mobile Networks in the tactical domain: Results from experiments | 575,343 |
6LoWPAN (IPv6 based Low-Power Personal Area Network) is a protocol specification that facilitates communication of IPv6 packets on top of IEEE 802.15.4 so that Internet and wireless sensor networks can be inter-connected. This interconnection is especially required in commercial and enterprise applications of sensor networks where reliable and timely data transfers such as multiple code updates are needed from Internet nodes to sensor nodes. For this type of inbound traffic which is mostly bulk, TCP as transport layer protocol is essential, resulting in end-to-end TCP session through a default gateway. In this scenario, a single gateway tends to become the bottleneck because of non-uniform connectivity to all the sensor nodes besides being vulnerable to buffer overflow. We propose SET; a management architecture for multiple split-TCP sessions across a number of serving gateways. SET implements striping and multiple TCP session management through a shim at session layer. Through analytical modeling and ns2 simulations, we show that our proposed architecture optimizes communication for ingress bulk data transfer while providing associated load balancing services. We conclude that multiple split-TCP sessions managed in parallel across a number of gateways result in reduced latency for bulk data transfer and provide robustness against gateway failures. | ['Saima Zafar', 'Ali Hammad Akbar', 'Sana Jabbar', 'Noor M. Sheikh'] | SET: session layer-assisted efficient TCP management architecture for 6LoWPAN with multiple gateways | 37,461 |
This book interconnects two essential disciplines to study the perception of speech: Neuroscience and Quality of Experience, which to date have rarely been used together for the purposes of research on speech quality perception. In five key experiments, the book demonstrates the application of standard clinical methods in neurophysiology on the one hand and of methods used in fields of research concerned with speech quality perception on the other. Using this combination, the book shows that speech stimuli with different lengths and different quality impairments are accompanied by physiological reactions related to quality variations, e.g., a positive peak in an event-related potential. Furthermore, it demonstrates that in most cases quality impairment intensity has an impact on the intensity of physiological reactions. | ['Jan-Niklas Antons'] | Neural Correlates of Quality Perception for Complex Speech Signals | 862,314 |
Today, more and more open data statistics are published by governments, statistical offices and organizations like the United Nations, The World Bank or Eurostat. This data is freely available and can be consumed by end users in interactive visualizations. However, additional information is needed to enable laymen to interpret these statistics in order to make sense of the raw data. In this paper, we present an approach to combine open data statistics with historical events. In a user interface we have integrated interactive visualizations of open data statistics with a timeline of thematically appropriate historical events from Wikipedia. This can help users to explore statistical data in several views and to get related events for certain trends in the timeline. Events include links to Wikipedia articles, where details can be found and the search process can be continued. We have conducted a user study to evaluate if users can use the interface intuitively, if relations between trends in statistics and historical events can be found and if users like this approach for their exploration process. | ['Daniel Hienert', 'Dennis Wegener', 'Siegfried Schomisch'] | Making sense of Open Data Statistics with Information from Wikipedia | 587,129 |
We present the results of a measurement campaign aimed at investigating electromagnetic interference (EMI) phenomena in the interaction between overhead railway power supply lines and pantograph. In order to obtain such data, an experimental setup was assembled in a shielded room, consisting in a short section of overhead line and a full scale pantograph. One of the most interesting results consists in the observation of a very significant (both from the qualitative and the quantitative point of view) difference between the EMI behavior in the switch-on (pantograph going up) and switch-off (pantograph going down) transients. | ['Bernardo Tellini', 'M. Macucci', 'Romano Giannetti', 'G. Antonacci'] | Conducted and radiated interference measurements in the line-pantograph system | 278,429 |
Three-dimensional object representation significantly impacts computations for manipulation, spatial reasoning and vision. This paper introduces a technique called the spherical dual image, derived from Gaussian sphere and dual space concepts. This representation technique will be defined and a number of its properties will be proven, leading to a reconstruction algorithm for convex and concave polyhedra. Finally, the application of this representation for selecting grasping points to manipulate a polyhedron is discussed. | ['John W. Roach', 'Jeffrey S. Wright'] | Spherical dual images: A 3D representation method for solid objects that combines dual space and Gaussian spheres | 449,809 |
Identifying abdominal organs is one of the essential steps in visualizing organ structure to assist in teaching, clinical training, diagnosis, and medical image retrieval. However, due to partial volume effects, gray-level similarities of adjacent organs, contrast media affect, and the relatively high variations of organ position and shape, automatically identifying abdominal organs has always been a high challenging task. To conquer these difficulties, this paper proposes combining a multimodule contextual neural network and spatial fuzzy rules and fuzzy descriptors for automatically identifying abdominal organs from a series of CT image slices. The multimodule contextual neural network segments each image slice through a divide-and-conquer concept, embedded within multiple neural network modules, where the results obtained from each module are forwarded to other modules for integration, in which contextual constraints are enforced. With this approach, the difficulties arising from partial volume effects, gray-level similarities of adjacent organs, and contrast media affect can be reduced to the extreme. To address the issue of high variations in organ position and shape, spatial fuzzy rules and fuzzy descriptors are adopted, along with a contour modification scheme implementing consecutive organ region overlap constraints. This approach has been tested on 40 sets of abdominal CT images, where each set consists of about 40 image slices. We have found that 99% of the organ regions in the test images are correctly identified as its belonging organs, implying the high promise of the proposed method. | ['Chien-Cheng Lee', 'Pau-Choo Chung', 'Hong-Ming Tsai'] | Identifying multiple abdominal organs from CT image series using a multimodule contextual neural network and spatial fuzzy rules | 532,666 |
We describe a linear channel inference system for the TyCO programming language, where channel usage is tracked through method invocations as well as denition instantiations. We then apply linear channel information to optimize code generation for a multithreaded runtime system. The impact in terms of speed and space is analyzed. | ['Francisco Martins', 'Luís M. B. Lopes', 'Vasco Thudichum Vasconcelos'] | The Impact of Linearity Information on the Performance of TyCO | 3,280 |
A Reflection on Fuzzy Conditionals | ['Enric Trillas', 'Itziar García-Honrado'] | A Reflection on Fuzzy Conditionals | 610,697 |
Service-Oriented Architectures Testing: A Survey. | ['Gerardo Canfora', 'Massimiliano Di Penta'] | Service-Oriented Architectures Testing: A Survey. | 733,514 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.