Search results for "Theoretical Computer Science"
showing 10 items of 1151 documents
Semiactive vibration control of nonlinear structures through adaptive backstepping techniques withH∞performance
2011
This article presents a new approach to the vibration mitigation problem in structures subject to seismic motions. These kinds of structures are characterised by the uncertainties of the parameters that describe their dynamics, such as stiffness and damping coefficients. Moreover, the dampers used to mitigate the vibrations caused by earthquakes are usually nonlinear devices with frictional or hysteretic dynamics. We propose an adaptive backstepping controller to account for the uncertainties and the nonlinearities. The controller is formulated in such a way that it satisfies an H∞ performance. It is designed for a 10-storey building whose base is isolated with a frictional damper (passive …
Fifth Generation Networking Principles for a Service Driven Future Internet Architecture
2010
Published version of an article published in Wireless Personal Communications, vol. 57:393-411. Also available from the publisher at: http://dx.doi.org/10.1007/s11277-010-0076-7 The vision of all-IP networks where IP forms the simple common layer understandable across the whole network has undeniable advantages. However, such simplicity comes as a major hurdle to flexibility and functionality to the architecture. This is evident from the increasingly numerous and complex engineering solutions and optimizations required to accommodate essential qualities like mobility, security, realtime communication support etc or to mitigate the shortcomings inherent in the 'traditional Internet' architec…
About Supergraphs. Part III
2019
Summary The previous articles [5] and [6] introduced formalizations of the step-by-step operations we use to construct finite graphs by hand. That implicitly showed that any finite graph can be constructed from the trivial edgeless graph K 1 by applying a finite sequence of these basic operations. In this article that claim is proven explicitly with Mizar[4].
Agent's actions as a classification criteria for the state space in a learning from rewards system
2008
We focus in this paper on the problem of learning an autonomous agent's policy when the state space is very large and the set of actions available is comparatively short. To this end, we use a non-parametric decision rule (concretely, a nearest-neighbour strategy) in order to cluster the state space by means of the action that leads to a successful situation. Using an exploration strategy to avoid greedy behaviour, the agent builds clusters of positively-classified states through trial and error learning. In this paper, we implement a 3D synthetic agent which plays an 'avoid the asteroid' game that suits our assumptions. Using as the state space a feature vector space extracted from a visua…
A Push Forward Construction and the Comprehensive Factorization for Internal Crossed Modules
2014
In a semi-abelian category, we give a categorical construction of the push forward of an internal pre-crossed module, generalizing the pushout of a short exact sequence in abelian categories. The main properties of the push forward are discussed. A simplified version is given for action accessible categories, providing examples in the categories of rings and Lie algebras. We show that push forwards can be used to obtain the crossed module version of the comprehensive factorization for internal groupoids.
AIOC2: A deep Q-learning approach to autonomic I/O congestion control in Lustre
2021
Abstract In high performance computing systems, I/O congestion is a common problem in large-scale distributed file systems. However, the current implementation mainly requires administrator to manually design low-level implementation and optimization, we proposes an adaptive I/O congestion control framework, named AIOC 2 , which can not only adaptively tune the I/O congestion control parameters, but also exploit the deep Q-learning method to start the training parameters and optimize the tuning for different types of workloads from the server and the client at the same time. AIOC 2 combines the feedback-based dynamic I/O congestion control and deep Q-learning parameter tuning technology to …
Evaluating the impact of friends in predicting user’s availability in online social networks
2017
In recent years, Online Social Networks (OSNs) have changed the way people connect and interact with each other. Indeed, most people have registered an account on some popular OSNs (such as Facebook, or Google+) which is used to access the system at different times of the days, depending on their life and habits. In this context, understanding how users connect to the OSNs is of paramount importance for both the protection of their privacy and the OSN’s provider (or third-party applications) that want to exploit this information. In this paper, we study the task of predicting the availability status (online/offline) of the OSNs’ users by exploiting the availability information of their frie…
Strategies for accelerating ant colony optimization algorithms on graphical processing units
2007
Ant colony optimization (ACO) is being used to solve many combinatorial problems. However, existing implementations fail to solve large instances of problems effectively. In this paper we propose two ACO implementations that use graphical processing units to support the needed computation. We also provide experimental results by solving several instances of the well-known orienteering problem to show their features, emphasizing the good properties that make these implementations extremely competitive versus parallel approaches.
On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals
2015
We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings $S$ is sought containing as a factor every string of $S$ or its reversal. We call this problem Shortest Common Superstring with Reversals (SCS-R). This problem has been introduced by Jiang et al., who designed a greedy-like algorithm with length approximation ratio $4$. In this paper, we show that a natural adaptation of the classical greedy algorithm for SCS has (optimal) compression ratio $\frac12$, i.e., the sum of the overlaps in the output string is at least half the sum of the overlaps in an optimal solution. We also provide a linear-time implement…
Scheduling on Two Types of Resources: a Survey
2020
International audience; We study the problem of executing an application represented by a precedence task graph on a parallel machine composed of standard computing cores and accelerators. Contrary to most existing approaches, we distinguish the allocation and the scheduling phases and we mainly focus on the allocation part of the problem: choose the most appropriate type of computing unit for each task. We address both off-line and on-line settings and design generic scheduling approaches. In the first case, we establish strong lower bounds on the worst-case performance of a known approach based on Linear Programming for solving the allocation problem. Then, we refine the scheduling phase …