Institute for Computer Science and Control

We describe a simple process for the fabrication of ultrathin, transparent, optically homogeneous, electrically conducting films of pure single-walled carbon nanotubes and the transfer of those films to various substrates. For equivalent sheet resistance, the films exhibit optical transmittance comparable to that of commercial indium tin oxide in the visible spectrum, but far superior transmittance in the technologically relevant 2- to 5-micrometer infrared spectral band. These characteristics indicate broad applicability of the films for electrical coupling in photonic devices. In an example application, the films are used to construct an electric field-activated optical modulator, which constitutes an optical analog to the nanotube-based field effect transistor.

A concise tutorial description of the cellular neural network (CNN) paradigm is given, along with a precise taxonomy. The CNN is defined, and the canonical equations are described. The importance of many independent input signal arrays, adaptive templates, and the multilayer capability is emphasized and motivated by examples. It is shown how simply a wave-type partial differential equation can be generated.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

One of the most significant directions in the development of computer science and information and communication technologies is represented by Cyber-Physical Systems (CPSs) which are systems of collaborating computational entities which are in intensive connection with the surrounding physical world and its on-going processes, providing and using, at the same time, data-accessing and data-processing services available on the internet. Cyber-Physical Production Systems (CPPSs), relying on the newest and foreseeable further developments of computer science, information and communication technologies on the one hand, and of manufacturing science and technology, on the other, may lead to the 4th Industrial Revolution, frequently noted as Industry 4.0. The key-note will underline that there are significant roots generally – and particularly in the CIRP community – which point towards CPPSs. Expectations and the related new R&D challenges will be outlined.

Several results appeared that show significant reduction in time for matrix multiplication, singular value decomposition as well as linear (lscr <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> ) regression, all based on data dependent random sampling. Our key idea is that low dimensional embeddings can be used to eliminate data dependence and provide more versatile, linear time pass efficient matrix computation. Our main contribution is summarized as follows. 1) Independent of the results of Har-Peled and of Deshpande and Vempala, one of the first - and to the best of our knowledge the most efficient - relative error (1 + epsi) parA $A <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</sub> par <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">F</sub> approximation algorithms for the singular value decomposition of an m times n matrix A with M non-zero entries that requires 2 passes over the data and runs in time O((M(k/epsi+k log k) + (n+m)(k/epsi+k log k) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> )log (1/sigma)). 2) The first o(nd <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> ) time (1 + epsi) relative error approximation algorithm for n times d linear (lscr <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> ) regression. 3) A matrix multiplication and norm approximation algorithm that easily applies to implicitly given matrices and can be used as a black box probability boosting tool

Deep learning methods for image quality assessment (IQA) are limited due to the small size of existing datasets. Extensive datasets require substantial resources both for generating publishable content and annotating it accurately. We present a systematic and scalable approach to creating KonIQ-10k, the largest IQA dataset to date, consisting of 10,073 quality scored images. It is the first in-the-wild database aiming for ecological validity, concerning the authenticity of distortions, the diversity of content, and quality-related indicators. Through the use of crowdsourcing, we obtained 1.2 million reliable quality ratings from 1,459 crowd workers, paving the way for more general IQA models. We propose a novel, deep learning model (KonCept512), to show an excellent generalization beyond the test set (0.921 SROCC), to the current state-of-the-art database LIVE-in-the-Wild (0.825 SROCC). The model derives its core performance from the InceptionResNet architecture, being trained at a higher resolution than previous models (512 × 384 ). Correlation analysis shows that KonCept512 performs similar to having 9 subjective scores for each test image.

The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm (Besl and McKay, 1992) is presented, called the Trimmed ICP (TrICP). The new algorithm is based on the consistent use of the least trimmed squares (LTS) approach in all phases of the operation. Convergence is proved and an efficient implementation is discussed. TrICP is fast, applicable to overlaps under 50%, robust to erroneous measurements and shape defects, and has easy-to-set parameters. ICP is a special case of TrICP when the overlap parameter is 100%. Results of testing the new algorithm are shown.

Welcome to Budapest and WWW2003, the twelfth of the original conference series organized by the International World Wide Web Conference Committee (IW3C2). WWW2003 is particularly special since it is the first of the series to be held in Central Europe. We are especially excited about having the event in Budapest since Hungary is proving itself to be an area of rapid technology growth in a region that has been under-served as a venue for technology events. This growth has been a part of one of the most dynamically developing economies among the forthcoming members of the European Union. Likewise, Budapest has become an outstanding educational, scientific, economical and cultural center of that part of Europe. We hope that all of these factors will contribute to a productive, entertaining, and memorable experience for you at WWW200.We believe that the WWW2003 Program Co-Chairs, Yih-Farn Robin Chen, Laszlo Kovacs, and Steve Lawrence, along with an exceptional international Program Committee have assembled one of the finest technical programs of this conference series. Despite the numerous issues, political and economic, which challenge the Web research community today, this committee received the largest number of paper submissions for the conference series to date. These submissions were generally of outstanding quality thereby making the Program Committee's task extremely challenging. The diversity of the conference's Refereed Papers Track reflects the research areas highlighted in WWW2003 and the range of interests held by the conference attendees.We hope that these proceedings will help you to reference the paper presentations that you are able to attend as well as still benefit from those you are unable to experience in person. When you return to your home institutions, we hope that as you refer to these proceedings that you will have memories of your attendance at WWW2003 and your visit to Budapest.

A pulse-based programmable memristor circuit for implementing synaptic weights for artificial neural networks is proposed. In the memristor weighting circuit, both positive and negative multiplications are performed via a charge-dependent Ohm's law (). The circuit is composed of five memristors with bridge-like connections and operates like an artificial synapse with pulse-based processing and adjustability. The sign switching pulses, weight setting pulses and synaptic processing pulses are applied through a shared input terminal. Simulations are done with both linear memristor and window-based nonlinear memristor models.

The main objective of this paper is to propose a numerical controller design methodology. This methodology has two steps. In the first step, tensor product (TP) model transformation is applied, which is capable of transforming a dynamic system model, given over a bounded domain, into TP model form, including polytopic or Takagi-Sugeno model forms. Then, in the second step, Lyapunov's controller design theorems are utilized in the form of linear matrix inequalities (LMIs). The main novelty of this paper is the development of the TP model transformation of the first step. It does not merely transform to TP model form, but it automatically prepares the transformed model to all the specific conditions required by the LMI design. The LMI design can, hence, be immediately executed on the result of the TP model transformation. The secondary objective of this paper is to discuss that representing a dynamic model in TP model form needs to consider the tradeoff between the modeling accuracy and computational complexity. Having a controller with low computational cost is highly desired in many cases of real implementations. The proposed TP model transformation is developed and specialized for finding a complexity minimized model according to a given modeling accuracy. Detailed control design examples are given.

Halting a computer or biological virus outbreak requires a detailed understanding of the timing of the interactions between susceptible and infected individuals. While current spreading models assume that users interact uniformly in time, following a Poisson process, a series of recent measurements indicates that the intercontact time distribution is heavy tailed, corresponding to a temporally inhomogeneous bursty contact process. Here we show that the non-Poisson nature of the contact dynamics results in prevalence decay times significantly larger than predicted by the standard Poisson process based models. Our predictions are in agreement with the detailed time resolved prevalence data of computer viruses, which, according to virus bulletins, show a decay time close to a year, in contrast with the 1 day decay predicted by the standard Poisson process based models.

Quality of service (QoS) can be a critical element for achieving the business goals of a service provider, for the acceptance of a service by the user, or for guaranteeing service characteristics in a composition of services, where a service is defined as either a software or a software-support (i.e., infrastructural) service which is available on any type of network or electronic channel. The goal of this article is to compare the approaches to QoS description in the literature, where several models and metamodels are included. consider a large spectrum of models and metamodels to describe service quality, ranging from ontological approaches to define quality measures, metrics, and dimensions, to metamodels enabling the specification of quality-based service requirements and capabilities as well as of SLAs (Service-Level Agreements) and SLA templates for service provisioning. Our survey is performed by inspecting the characteristics of the available approaches to reveal which are the consolidated ones and which are the ones specific to given aspects and to analyze where the need for further research and investigation lies. The approaches here illustrated have been selected based on a systematic review of conference proceedings and journals spanning various research areas in computer science and engineering, including: distributed, information, and telecommunication systems, networks and security, and service-oriented and grid computing.

The adoption of machine learning and deep learning is on the rise in the cybersecurity domain where these AI methods help strengthen traditional system monitoring and threat detection solutions. However, adversaries too are becoming more effective in concealing malicious behavior amongst large amounts of benign behavior data. To address the increasing time-to-detection of these stealthy attacks, interconnected and federated learning systems can improve the detection of malicious behavior by joining forces and pooling together monitoring data. The major challenge that we address in this work is that in a federated learning setup, an adversary has many more opportunities to poison one of the local machine learning models with malicious training samples, thereby influencing the outcome of the federated learning and evading detection. We present a solution where contributing parties in federated learning can be held accountable and have their model updates audited. We describe a permissioned blockchain-based federated learning method where incremental updates to an anomaly detection machine learning model are chained together on the distributed ledger. By integrating federated learning with blockchain technology, our solution supports the auditing of machine learning models without the necessity to centralize the training data. Experiments with a realistic intrusion detection use case and an autoencoder for anomaly detection illustrate that the increased complexity caused by blockchain technology has a limited performance impact on the federated learning, varying between 5 and 15%, while providing full transparency over the distributed training process of the neural network. Furthermore, our blockchain-based federated learning solution can be generalized and applied to more sophisticated neural network architectures and other use cases.

The study of travelling waves or fronts has become an essential part of the mathematical analysis of nonlinear diffusion-convection-reaction processes. Whether or not a nonlinear second-order scalar reaction-convection-diffusion equation admits a travelling-wave solution can be determined by the study of a singular nonlinear integral equation. This article is devoted to demonstrating how this correspondence unifies and generalizes previous results on the occurrence of travelling-wave solutions of such partial differential equations. The detailed comparison with earlier results simultaneously provides a survey of the topic. It covers travelling-wave solutions of generalizations of the Fisher, Newell-Whitehead, Zeldovich, KPP and Nagumo equations, the Burgers and nonlinear Fokker-Planck equations, and extensions of the porous media equation.

In this paper, we propose a memristor bridge circuit consisting of four identical memristors that is able to perform zero, negative, and positive synaptic weightings. Together with three additional transistors, the memristor bridge weighting circuit is able to perform synaptic operation for neural cells. It is compact as both weighting and weight programming are performed in a memristor bridge synapse. It is power efficient, since the operation is based on pulsed input signals. Its input terminals are utilized commonly for applying both weight programming and weight processing signals via time sharing. In this paper, features of the memristor bridge synapses are investigated using the TiO memristor model via simulations.

Abstract In this paper, we discuss a real‐world application scenario that uses three distinct types of workflow within the Triana problem‐solving environment: serial scientific workflow for the data processing of gravitational wave signals; job submission workflows that execute Triana services on a testbed; and monitoring workflows that examine and modify the behaviour of the executing application. We briefly describe the Triana distribution mechanisms and the underlying architectures that we can support. Our middleware independent abstraction layer, called the Grid Application Prototype (GAP), enables us to advertise, discover and communicate with Web and peer‐to‐peer (P2P) services. We show how gravitational wave search algorithms have been implemented to distribute both the search computation and data across the European GridLab testbed, using a combination of Web services, Globus interaction and P2P infrastructures. Copyright © 2005 John Wiley &amp; Sons, Ltd.

ABSTRACT This paper presents new tuning rules for PI control of processes with essentially monotone step response that are typically encountered in process control. The rules are based on characterization of process dynamics by three parameters that can be obtained from a step response experiment. The rules are obtained by maximizing integral gain subject to a constraint on the maximum sensitivity. They are almost as simple as the Ziegler Nichols tuning rules but they give substantially better performance.

Introduces a singular value-based method for reducing a given fuzzy rule set. The method conducts singular value decomposition of the rule consequents and generates certain linear combinations of the original membership functions to form new ones for the reduced set. The present work characterizes membership functions by the conditions of sum normalization (SN), nonnegativeness (NN), and normality (NO). Algorithms to preserve the SN and NN conditions in the new membership functions are presented. Preservation of the NO condition relates to a high-dimensional convex hull problem and is not always feasible in which case a closed-to-NO solution may be sought. The proposed method is applicable regardless of the adopted inference paradigms. With product-sum-gravity inference and singleton support fuzzy rule base, output errors between the full and reduced fuzzy set are bounded by the sum of the discarded singular values. The work discusses three specific applications of fuzzy reduction: fuzzy rule base with singleton support, fuzzy rule base with nonsingleton support (which includes the case of missing rules), and the Takagi-Sugeno-Kang (TSK) model. Numerical examples are presented to illustrate the reduction process.

In this work we study the dynamical features of editorial wars in Wikipedia (WP). Based on our previously established algorithm, we build up samples of controversial and peaceful articles and analyze the temporal characteristics of the activity in these samples. On short time scales, we show that there is a clear correspondence between conflict and burstiness of activity patterns, and that memory effects play an important role in controversies. On long time scales, we identify three distinct developmental patterns for the overall behavior of the articles. We are able to distinguish cases eventually leading to consensus from those cases where a compromise is far from achievable. Finally, we analyze discussion networks and conclude that edit wars are mainly fought by few editors only.

While current studies on complex networks focus on systems that change relatively slowly in time, the structure of the most visited regions of the web is altered at the time scale from hours to days. Here we investigate the dynamics of visitation of a major news portal, representing the prototype for such a rapidly evolving network. The nodes of the network can be classified into stable nodes, which form the time-independent skeleton of the portal, and news documents. The visitations of the two node classes are markedly different, the skeleton acquiring visits at a constant rate, while a news document's visitation peaks after a few hours. We find that the visitation pattern of a news document decays as a power law, in contrast with the exponential prediction provided by simple models of site visitation. This is rooted in the inhomogeneous nature of the browsing pattern characterizing individual users: the time interval between consecutive visits by the same user to the site follows a power-law distribution, in contrast to the exponential expected for Poisson processes. We show that the exponent characterizing the individual user's browsing patterns determines the power-law decay in a document's visitation. Finally, our results document the fleeting quality of news and events: while fifteen minutes of fame is still an exaggeration in the online media, we find that access to most news items significantly decays after 36 hours of posting.

In this paper, we propose a probabilistic model for detecting relevant changes in registered aerial image pairs taken with the time differences of several years and in different seasonal conditions. The introduced approach, called the conditional mixed Markov model, is a combination of a mixed Markov model and a conditionally independent random field of signals. The model integrates global intensity statistics with local correlation and contrast features. A global energy optimization process ensures simultaneously optimal local feature selection and smooth observation-consistent segmentation. Validation is given on real aerial image sets provided by the Hungarian Institute of Geodesy, Cartography and Remote Sensing and Google Earth.