Generally, there is a tradeoff between quality and computational workload required to obtain that quality. In this paper, we focus on practical issues in implementing a pig activity monitoring system. We first propose a method for evaluating the quality-workload tradeoff in the activity monitoring application. Then, we derive the cost-effective solution within the acceptable range of quality fo...

A finite horizon optimal tracking problem is considered for linear dynamical systems subject to parametric uncertainties in the state-space matrices and exogenous disturbances. suboptimal solution proposed using a model predictive control (MPC) based explicit dual approach, which enables active uncertainty learning. novel algorithm design of robustly invariant online terminal sets controllers p...

By decoupling network functions from the underlying physical machines (PMs) at edge of networks, virtualized multi-access computing (MEC) enables deployment new services and elastic scaling to reduce maintenance costs in a more flexible, scalable cost-effective manner. Although there are appealing performance gains be achieved, placement virtual (VMs) on top sharing PMs support computation-inte...

Abstract. Most of the results to date in discrete event supervisory control assume a "zero-or-infinity" structure for the cost of controlling a discrete event system, in the sense that it costs nothing to disable controllable events while uncontrollable events cannot be disabled (i.e., their disablement entails infinite cost). In several applications however, a more refined structure of the con...

We study a new optimization problem that minimizes the ratio of two monotone k-submodular functions. The has applications in sensor placement, influence maximization, and feature selection among many others where one wishes to make tradeoff between objectives, measured as functions (e.g., solution cost vs. quality). develop three greedy based algorithms for problem, with approximation ratios de...

Hardware square-root units require large numbers of gates even for iterative implementations. In this paper, we present four low-cost high-performance fullypipelined n-select implementations (nS-Root) based on a non-restoring-remainder square root algorithm. The nSRoot uses a parallel array of carry-save adders (CSAs). For a square root bit calculation, a CSA is used once. This means that the c...

Let G = (V, E) be a network for an assignment problem with 2n nodes and m edges, in which the largest edge cost is C. Recently the class of instances of bipartite matching problems has been shown to be in RNC provided that C is O(logk n) for some fixed k. We show how to use scaling so as to develop an improved parallel algorithm and show that bipartite matching problems are in the class RNC pro...