Optimal Latency Oriented Scheduling in Parallel Queuing Systems

Robustness against disturbances affecting individual links can be obtained by coding the information flow in multiplestreams to be forwarded across parallel transmission links . This approach,however, requires coding and scheduling algorithms that can adapt to the state of links to take full advantage of path diversity and avoid self-inducedcongestion on some links .…

Energy Minimization for IRS aided WPCNs with Non linear Energy Harvesting Model

This paper considers an intelligent reflecting surface(IRS)-aided wireless wirelesspowered communication network (WPCN) Devices first harvest energy from apower station (PS) in the downlink (DL) and then transmit information using non-orthogonal multiple access (NOMA) to a data sink in the uplink (UL) The paper aims to minimizethe total transmit energy consumption at the PS by jointly optimizing theresource allocation and IRS phase shifts over time, subject to the minimumthroughput requirements of all devices .…

Building Time Triggered Schedules for typed DAG Tasks with alternative implementations

HPC-DAG (Heterogeneous Parallel Directed AcyclicGraph) task model has been recently proposed to capture real-time workloadexecution on heterogeneous platforms . We propose a time-table schedulingapproach to allocate and schedule a set of HPC DAG tasks onto a set-of-heterogeneous cores, by the mean of Integer Linear Programming (ILP) We hope to handle heterogeniety of resources, on-line execution costs, and afaster solving time, by exploring gradually the design space .…

Learning Practically Feasible Policies for Online 3D Bin Packing

We tackle the Online 3D Bin Packing Problem, a challenging yet practicallyuseful variant of the classical bin packing problem . We adopt deep reinforcement learning, in particular, the on-policy actor-critic framework, to solve this MDP with constrained action space . To learn apractically feasible packing policy, we propose three critical designs .…

Graphs with minimum degree based entropy

The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees . We characterize the unique extremal graph achieving the minimum value among graphs with a given number of vertices and edges .…

A mixed method for 3D nonlinear elasticity using finite element exterior calculus

This article discusses a mixed FE technique for 3D nonlinear elasticity using a Hu-Washizu (HW) type variational principle . Here, the deformed configurationand sections from its cotangent bundle are taken as additional input arguments . The critical points of the HW functional enforce compatibility of thesesections with the configuration, in addition to mechanical equilibrium andconstitutive relations .…

A review of mobile robot motion planning methods from classical motion planning workflows to reinforcement learning based architectures

Motion planning is critical to realize the autonomous operation of mobilerobots . In recent years, with the development of intelligent computation technology, the deep reinforcement learning (DRL) based motion planning algorithm has gradually become a research hotspot due to its advantageousfeatures such as not relying on the map prior, model-free, and unified global and local planning paradigms .…

Spike time displacement based error backpropagation in convolutional spiking neural networks

We recently proposed the STiDi-BP algorithm for training multi-layer spiking neural networks . The algorithm employs a linearapproximation to compute the derivative of the spike latency with respect to membrane potential . The evaluation results on the image classification task based on two popular benchmarks, MNIST and Fashion-MNISTdatasets with the accuracies of respectively 99.2% and 92.8%, confirm that this algorithm has been applicable in deep SNNs .…

Upper bounds on the length function for covering codes

Length function $ell_q(r,R) is the smallest length of a $ q $-arylinear code with codimension (redundancy) $r$ and covering radius $R$ In thiswork, we use a one-to-one correspondence between $[n,n-(R+1)$ codes and $n-saturating $n$-sets in the projective space $mathrm{PG}(R,q)$ is the new upper bounds on $q=1$ are better than the known ones for $q=(q’)^R$ with $q’$ a prime power, but when $q$ is an arbitraryprime power, the bounds of this paper are better .…

BotNet A Simulator for Studying the Effects of Accurate Communication Models on Multi agent and Swarm Control

Decentralized control in multi-robot systems is dependent on accurate and reliable communication between agents . We present a new open sourceswarm robotics simulator, BotNet, with an embedded standards-complianttime-synchronized channel hopping (6TiSCH) RF mesh network simulator . Using this simulator we show how more accurate communications models can limit even simple control tasks such as flocking and formation control, with agent counts ranging from 10 up to 2500 agents .…

Development of User friendly Smart Grid Architecture

Cyber-Physicalsystems deals with the study of techniques that are committed to modeling,simulating and solving the problems that emerge from a multi-disciplinary outlook towards futuristic systems . This thesis is mainly concerned with the development of user-friendly cyber-physical frameworks that can tackle various issues faced by the utilities and users of smart grid through a suitable choice of smart microgrid architecture .…

Through the Looking Glass Diminishing Occlusions in Robot Vision Systems with Mirror Reflections

The quality of robot vision greatly affects the performance of automationsystems, where occlusions stand as one of the biggest challenges . We propose the first robot vision system withtilt-type mirror reflection sensing . By instantly tilting the sensor itself, weobtain two sensing results with different views: conventional directline-of-sight sensing and non-line of sight sensing via mirror reflections .…

Beyond Value Iteration for Parity Games Strategy Iteration with Universal Trees

Parity games have witnessed several new quasi-polynomial algorithms since Calude et al. (2017) The central combinatorial object underlying these approaches is a universal tree . We propose a strategy iterationframework which can be applied on any universal tree. It is at least as fast as its value iteration counterparts, while allowing one to take bigger leaps inthe universal tree, asymptotically the fastest known algorithm for parity games .…

Autonomous Rollator A Case Study in the Agebots Project

In this paper, we present an iterative development process for an autonomous, location-orienting rollator . An interdisciplinary team was involved in the development, working closely with the end-users . This example shows that the design thinking method is suitable for the development of frontier technology devices in the care sector .…

Towards Observability for Machine Learning Pipelines

A lack of end-to-end ML pipeline visibility makes it hard to address any issues that mayarise after a production deployment . We propose a system that wraps around existing tools in the ML development stack . We introduce our prototype and our vision for mltrace, a platform-agnosticsystem that provides observability to ML practitioners by (1) executing predefined tests and monitoring ML-specific metrics at component runtime, (2)tracking end to-end data flow, and (3) allowing users to ask arbitrary post-hocquestions about pipeline health.…

Triple Structured Compressive Sensing based Channel Estimation for RIS aided MU MIMO Systems

Reconfigurable intelligent surface (RIS) has been recognized as a potential technology for 5G beyond and attracted tremendous research attention . Channel estimation in RIS-aided system is still a critical challenge due to theexcessive amount of parameters in cascaded channel . The existing compressivesensing (CS)-based RIS estimation schemes only adopt incomplete sparsity, whichinduces redundant pilot consumption .…

Musical Tempo Estimation Using a Multi scale Network

A multi-scale structure is introduced as the overall network architecture where information from different scales is aggregated to strengthen contextual feature learning . The proposed module separates the input feature into several groups along thefrequency axis, which makes it capable of capturing long-range dependencies from different frequency positions on the spectrogram .…

Robust Privacy Preserving Motion Detection and Object Tracking in Encrypted Streaming Video

Video privacy leakage is becoming an increasingly severe public problem, especially in cloud-based video surveillance systems . The proposed scheme does not require videodecryption or full decompression and has a very low computation load . Our scheme can be effectively used in complex surveillancescenarios with different challenges, such as camera movement/jitter, dynamicbackground, and shadows, says the researchers .…

Successful Recovery Performance Guarantees of Noisy SOMP

The simultaneous orthogonal matching pursuit (SOMP) is a popular, greedyapproach for common support recovery of a row-sparse matrix . The supportrecovery guarantee of SOMP has been extensively studied under the noiseless scenario . In this paper, we present the mutualincoherence property (MIP)-based study for performance analysis of noisy SOMP .…

Adaptive Controllers for Quadrotors Carrying Unknown Payloads

Two control solutions are proposed to solve two specific problems in aerial transportation of payload . Adaptive control solution for quadrotors does not require a priori knowledge of the parameters of quadrotor dynamics and externaldisturbances . The stability of the closed-loop system is studied analytically and the effectiveness of the proposed solution is verified via simulations.…

Absent Subsequences in Words

An absent factor of a string $w$ is a string which does not occur as acontiguous substring (a.k.a. factor) inside $w$. We extend this well-studiednotion and define absent subsequences . We show a series of combinatorial and algorithmic results regarding these two notions .…

Open stub based spurious harmonic suppression method for Microstrip Coupled Line Filter

In this paper, we review a straightforward analytical technique based on image impedance concept for designing traditional microwave microstripcoupled line filters using distributed elements . In the introduced approach, wecharacterize a quarter-wave coupled line section, and then these discretesections can be connected in series to synthesis the final desired frequencyresponse .…

Hierarchical Bitmap Indexing for Range and Membership Queries on Multidimensional Arrays

Traditional indexing techniques commonly employed in da\-ta\-ba\-se systems perform poorly on multidimensional array scientific data . The hierarchical indexing method isbased on $n$-di\-men\-sional sparse trees for dimension partitioning, withbound number of individual, adaptively binned indices for attributing . This indexing performs well on range involving both dimensionsand attributes, as it prunes the search space early, avoids reading entire index data, and does at most a single index traversal .…

TNNT The Named Entity Recognition Toolkit

TNNT integrates 21 different NER models as part of a Knowledge Graph Construction Pipeline (KGCP) that takes a document set as input and processes it based on the defined settings . The toolkit generates all resultswith an integrated summary of the extracted entities, enabling enhanced dataanalysis to support the KGCP, and also, to aid further NLP tasks .…

The Approximation Ratio of the k Opt Heuristic for the Euclidean Traveling Salesman Problem

The $k$-Opt heuristic is a simple improvement heuristic for the TravelingSalesman Problem . It starts with an arbitrary tour and then repeatedly replaces$k$ edges of the tour by $k# other edges . This improves the upper bound of $O(\log n)$ given by Chandra, Karloff, and Tovey in 1999 and provides for the first time anon-trivial lower bound for the case $k\ge 3$ We prove that for 2-dimensional Euclidean Traveling SalesmanProblems with $n$ cities the approximation ratio of the $k/n approximation ratio is $Theta…

Robotic Lime Picking by Considering Leaves as Permeable Obstacles

The problem of robotic lime picking is challenging . We focus on reaching a lime in the presence of dense foliage by considering the leaves of a plant as ‘permeable obstacles’ with a collision cost . We then adapt the rapidly exploring random tree star(RRT* algorithm for the problem of fruit harvesting by incorporating the cost of collision with leaves into the path cost .…