Search results

Filter

Filetype

Your search for "what do you do on the dark web 【Visit Sig8.com】9ZP42K8.5R9I" yielded 103451 hits

No title

This paper presents an adaptive video encoder that can be used to compare the behavior of different adaptation strategies using multiple actuators to steer the encoder towards a global goal, composed of multiple conflicting objectives. A video camera produces frames that the encoder manipulates with the objective of matching some space requirement to fit a given communication channel. A second obj

No title

Self-adaptation provides a principled way to deal with change during operation. As more systems with strict goals require self-adaptation, the need for guarantees in self-adaptive systems is becoming a high-priority concern. Designing adaptive software using principles from control theory has been identified as one of the approaches to provide guarantees. However, current solutions can only handle

No title

The pervasiveness and growing complexity of software systems are challenging software engineering to design systems that can adapt their behavior to withstand unpredictable, uncertain, and continuously changing execution environments. Control theoretical adaptation mechanisms have received growing interest from the software engineering community in the last few years for their mathematical groundi

No title

The chapter focuses on marketing activities of start-up firms. While this is traditionally understood as analyzing the customer needs and how to bridge that gap, for example, through segmentation and branding activities, this chapter has focused on bridging the gaps between industrial actors in order to build networks. The rationale behind this focus relates to the fact that science- and technolog

No title

In the near future, the number of connected mobile devices and data-rates are expected to dramatically increase. Demands exceed the capability of the currently deployed (4G) wireless communication systems. Development of 5G systems is aiming for higher data-rates, better coverage, backward compatibility, and conforming with “green communication” to lower energy consumption. Massive Multiple-Input

No title

The field of robotics offers a wide array of estimation problems, ranging from kinematic and dynamic calibration to pose estimation and computer vision. This thesis presents a set of methods to solve estimation problems encountered in robotics, with an emphasis on industrial robotics. The researched topics are all practically motivated and have found immediate use in applications.Industrial roboti

No title

Online 3D reconstruction has been an active research area for a long time. Since the release of the Microsoft Kinect Camera and publication of KinectFusion [11] attention has been drawn how to acquire dense models in real-time. In this paper we present a method to make online 3D reconstruction which increases robustness for scenes with little structure information and little texture information. I

No title

The focus of this contribution is the estimation of multi-step-ahead linear multivariate predictors of the output making use of finite input-output data sequences. Different strategies will be presented, the common factor being the exploitations of geometric operations on appropriate subspaces spanned by the data. In order to test the capabilities of the proposed methods in predicting new data, a

No title

The concept of dynamical movement primitives (DMPs) has become popular for modeling of motion, commonly applied to robots. This paper presents a framework that allows a robot operator to adjust DMPs in an intuitive way. Given a generated trajectory with a faulty last part, the operator can use lead-through programming to demonstrate a corrective trajectory. A modified DMP is formed, based on the f

No title

Recently, several authors have shown local and global convergence rate results for Douglas–Rachford splitting under strong monotonicity, Lipschitz continuity, and cocoercivity assumptions. Most of these focus on the convex optimization setting. In the more general monotone inclusion setting, Lions and Mercier showed a linear convergence rate bound under the assumption that one of the two operators

No title

We introduce the 'security index' of a discrete-time, linear time-invariant system under sensor attacks as a quantitative representation-free measure on the vulnerability of an observable system. Ideas from linear coding theory are employed in providing conditions for attack detection and correction in terms of a system's security index, along with methods for its computation based on different re

No title

We consider the problem of finding an event-based sampling scheme that optimizes the trade-off between average sampling rate and control performance in a linear-quadratic-Gaussian (LQG) control problem setting with output feedback. Our analysis is based on a recently presented sampled-data controller structure, which remains LQG-optimal for any choice of sampling scheme. We show that optimization

No title

The figure-ground segmentation of humans in images captured in natural environments is an outstanding open problem due to the presence of complex backgrounds, articulation, varying body proportions, partial views and viewpoint changes. In this work we propose classspecific segmentation models that leverage parametric max-flow image segmentation and a large dataset of human shapes. Our contribution

No title

Automatic video captioning is challenging due to the complex interactions in dynamic real scenes. A comprehensive system would ultimately localize and track the objects, actions and interactions present in a video and generate a description that relies on temporal localization in order to ground the visual concepts. However, most existing automatic video captioning systems map from raw video data

No title

Resilience has become a key aspect in the design of contemporary infrastructure networks. This comes as a result of ever-increasing loads, limited physical capacity, and fast-growing levels of interconnectedness and complexity due to the recent technological advancements. The problem has motivated a considerable amount of research within the last few years, particularly focused on the dynamical as

No title

Cloud applications are often subject to unexpected events like flashcrowds and hardware failures. Users that expect a predictable behavior may abandon an unresponsive application when these events occur. Researchers and engineers addressed this problem on two separate fronts: first, they introduced replicas - copies of the application with the same functionality - for redundancy and scalability; s

No title

Numerous auto-scaling strategies have been proposed in the past few years for improving various Quality of Service (QoS) indicators of cloud applications, for example, response time and throughput, by adapting the amount of resources assigned to the application to meet the workload demand. However, the evaluation of a proposed auto-scaler is usually achieved through experiments under specific cond

No title

Gerhard Schurz [2001, Journal for General Philosophy of Science, 32, 65-107] has proposed to reconstruct auxiliary hypothesis addition, e.g., postulation of Neptune to immunize Newtonian mechanics, with concepts from non-monotonous inference to avoid the retention of false predictions that are among the consequence-set of the deductive model. However, the non-monotonous reconstruction retains the

No title

The spot pricing scheme has been considered to be resource-efficient for providers and cost-effective for consumers in the Cloud market. Nevertheless, unlike the static and straightforward strategies of trading on-demand and reserved Cloud services, the market-driven mechanism for trading spot service would be complicated for both implementation and understanding. The largely invisible market acti

No title

Many popular first order algorithms for convex optimization, such as forward-backward splitting, Douglas-Rachford splitting, and the alternating direction method of multipliers (ADMM), can be formulated as averaged iteration of a nonexpansive mapping. In this paper we propose a line search for averaged iteration that preserves the theoretical convergence guarantee, while often accelerating practic