Most of the past research on problem deadlock avoidance for complex resource allocation systems (RAS) has acknowledged fact that computation maximally permissive policy (DAP) possesses super-polynomial complexity most RAS classes, and therefore, it resorted to solutions trade off maximal permissiveness computational tractability. In this paper, we distinguish between off-line on-line is required effective implementation DAP, seek develop representations will require minimal computation. The...

In this paper we propose a new framework to compare and classify temporal sequences. The proposed approach captures the underlying dynamics of data while avoiding expensive estimation procedures, making it suitable process large numbers main idea is first embed sequences into Riemannian manifold by using positive definite regularized Gram matrices their Hankelets. advantages are: 1) allows for non-Euclidean similarity functions on Positive Definite matrix manifold, which capture better...

<title>Abstract</title> With the development of science and technology, cell phones have become an indispensable part people's daily lives, as a direct link between human–computer interactions, quality user's experience directly affects experience, which is key factor in sales manufacturers. To ensure production high-quality phone screens, process, screen defect detection, surface shallow fine scratch detection difficult, particularly important. The existing algorithms do not high accuracy...

This paper considers the problem of synthesizing output feedback controllers subject to sparsity constraints. is known be generically NP-hard, unless plant satisfies quadratic invariance property. Our main results show that, even if this property does not hold, tractable convex relaxations with optimality certificates can obtained by recasting into a polynomial optimization through use polyhedral Lyapunov functions. Combining these ideas rank minimization tools leads computationally...

Linear Robust Regression (LRR) seeks to find the parameters of a linear mapping from noisy data corrupted outliers, such that number inliers (i.e. pairs points where fitting error model is less than given bound) maximized. While this problem known be NP hard, several tractable relaxations have been recently proposed along with theoretical conditions guaranteeing exact recovery model. However, these may perform poorly in cases for outliers large. In addition, approaches cannot exploit...

The dynamic radio resource management technology is an essential in high throughput satellite (HTS) communications. Aiming at the problem that traditional static allocation difficult to meet traffic, based on meta-heuristic algorithm has been extensively studied. Since wireless channel conditions, differentiated services have stochastic properties, and environment's dynamics are unknown HTS, model-free deep reinforcement learning (DRL) method was used learn optimal policy through...

Ensuring deadlock-free execution of concurrent programs is a notoriously difficult problem, but an increasingly important one as multicore processors compel performance-conscious software developers to parallelize applications. We propose and validate novel methodology for dynamically controlling the in order provably avoid deadlocks. The based on supervisory control discrete event systems modeled by Petri nets. Specifically, we synthesize feedback controllers theory supervision place...

Abstract Reasonable operation of each excavator joint under path constraints directly affects efficiency and energy consumption. Efficiency consumption are considerably important performance indicators, particularly for large equipment, such as excavators. Therefore, we propose a quadratic trajectory optimization method based on time–energy With the pseudo‐path velocity, acceleration, equivalent convex jerk constraints, interior‐point was used to obtain optimal an excavator. The time values...

This paper considers the problem of recovering a subspace arrangement from noisy samples, potentially corrupted with outliers. Our main result shows that this can be formulated as convex semi-definite optimization subject to an additional rank constrain involves only very small number variables. is established by first reducing quadratically constrained quadratic and then using its special structure find conditions guaranteeing suitably built relaxation indeed exact. When combined standard...

This paper considers the problem of optimal sensor selection in a worst-case setup. Our objective is to estimate given quantity based on noisy measurements and using no more than n sensors out total N available, possibly subject additional constraints. Contrary most literature, we consider case where only information available about noise deterministic set-membership description goal minimize estimation error. While principle this hard, combinatorial optimization problem, show that tractable...

With the gradual maturity of artificial intelligence (AI) technology, it is urgent to change and innovate traditional media communication paradigm. Current research application areas include language processing, image recognition, AI systems, intelligent video text recognition. rapid development used in all walks life society. All sectors society have also set off exploration intelligence. In field news communication, technology brings opportunities challenges industry publishing content...

It is generally considered that concurrent transmissions should be avoided in order to reduce collisions wireless sensor networks. Constructive interference (CI) envisions positively interfere at the receiver. CI potentially allows orders of magnitude reductions energy consumptions and improvements on link quality. In this paper, we theoretically introduce a sufficient condition construct with IEEE 802.15.4 radio for first time. Moreover, propose Triggercast, distributed middleware, show it...

Many applications in the field of medical image processing require precise estimation diagnostic parameters anatomical structures to be examined. In this paper, we present a novel two-step three dimensional region statistics based active contours algorithm for automatic segmentation entire coronary arterial trees 3D CT images. first phase, define optimal binary labels extracting tree structure arteries from input This is accomplished by method. The possible outliers, such as touching vessel...

Abstract Detection of the relevant brain regions for characterizing distinction between cognitive conditions is one most sought after objectives in neuroimaging research. A popular approach achieving this goal multivariate pattern analysis which currently conducted through a number approaches such as searchlight procedure. This due to several advantages being automatic and flexible with regards size search region. However, these suffer from limitations can lead misidentification truly...

The coverability of Wireless Sensor Networks (WSNs) is essentially a Quality Service (QoS) problem that measures how well the monitored area covered by one or more sensor nodes. cover-ability WSNs was examined combining existing computational geometry techniques such as Voronoi diagram and Delaunay triangulation with graph theoretical algorithmic techniques. Three new evaluation algorithms, known CRM (Comprehensive Risk Minimization), TWS (Threshold Weight Shortest path), CSM Support...

Computing with trajectories has become an important and practical research topic. In many scenarios, the goal is to find similar trajectories. The Fréchet distance a very promising metric for measuring trajectory similarity yet limited in applications due its expensive computing complexity. this paper, we demonstrate efcicient approach retrieve using distance. Essentially, proposed method builds up set of R-trees indexing thereby enables multi-level positive negative filtering speed queries....