On pattern classification algorithms - Introduction and survey

Pattern recognition algorithms, and mathematical techniques of estimation, decision making, and optimization theor

Two conversational languages for control theoretical computations in the time sharing mode

Two conversational languages for control theory applications on direct-access time sharing compute

Learning with a probabilistic teacher

Learning scheme for solving unsupervised learning problems with correct estimate convergence and for state estimates of Gauss-Markov sequences with additive and multiplicative observed nois

Text-based Editing of Talking-head Video

Editing talking-head video to change the speech content or to remove filler words is challenging. We propose a novel method to edit talking-head video based on its transcript to produce a realistic output video in which the dialogue of the speaker has been modified, while maintaining a seamless audio-visual flow (i.e. no jump cuts). Our method automatically annotates an input talking-head video with phonemes, visemes, 3D face pose and geometry, reflectance, expression and scene illumination per frame. To edit a video, the user has to only edit the transcript, and an optimization strategy then chooses segments of the input corpus as base material. The annotated parameters corresponding to the selected segments are seamlessly stitched together and used to produce an intermediate video representation in which the lower half of the face is rendered with a parametric face model. Finally, a recurrent video generation network transforms this representation to a photorealistic video that matches the edited transcript. We demonstrate a large variety of edits, such as the addition, removal, and alteration of words, as well as convincing language translation and full sentence synthesis

A Dual intepretation of Standard Constraints in Parametric Scheduling

The problem of parametric scheduling in hard real-time systems, ( in the presence of linear relative constraints between the start and execution times of tasks ) was posed in the litreature. In an earlier paper, a polynomial time algorithm is presented for the case when the constraints are restricted to be standard ( defined in paper ) and the execution time vectors belong to an axis-parallel hyper-rectangle. In this paper, we extend their results in two directions. We first present a polynomial time algorithm for the case when the execution time vectors belong to arbitrary convex domains. We then show that the set of standard constraints can be extended to include arbitrary network constraints. Our insights into the problem occur primarily as a result of studying the dual polytope of the constraint system. (Also cross-refernced as UMIACS-TR-2000-11

Energy Efficient IP-Connectivity with IEEE 802.11 for Home M2M Networks

Machine-to-machine communication (M2M) technology enables large-scale device communication and networking, including home devices and appliances. A critical issue for home M2M networks is how to efficiently integrate existing home consumer devices and appliances into an IP-based wireless M2M network with least modifications. Due to its popularity and widespread use in closed spaces, Wi-Fi is a good alternative as a wireless technology to enable M2M networking for home devices. This paper addresses the energy-efficient integration of home appliances into a Wi-Fi- and IP-based home M2M network. Toward this goal, we first propose an integration architecture that requires least modifications to existing components. Then, we propose a novel long-term sleep scheduling algorithm to be applied with the existing 802.11 power save mode. The proposed scheme utilizes the multicast DNS protocol to maintain device and service availability when devices go into deep sleep mode. We prototyped our proposed architecture and algorithm to build a M2M network testbed of home appliances. We performed various experiments on this testbed to evaluate the operation and energy savings of our proposal. We also did simulation experiments for larger scale scenarios. As a result of our test-bed and simulation experiments, we observed significant energy savings compared to alternatives while also ensuring device and service availability. © The British Computer Society 2017. All rights reserved

The Overlapped K-hop (OK) Clustering Algorithm

Clustering is a standard approach for achieving efficient and scalable performance in wireless sensor networks. Clustering algorithms are mostly heuristic in nature and aim at generating the minimum number of disjoint clusters. In this report, we formulate the overlapping multi-hop clustering problem as an extension to the k-dominating set problem. Then we propose a fast, randomized, distributed multi-hop clustering algorithm (OK) for organizing the sensors in a wireless sensor network into overlapping clusters with the goal of minimizing the overall communication overhead, and processing complexity. OK assumes a quasi-stationary network where nodes are location-unaware and have equal significance. No synchronization is needed between nodes. OK is scalable; the clustering formation terminates in a constant time regardless of the network topology or size. The protocol incurs low overhead in terms of processing cycles and messages exchanged. We analyze the effect of different parameters (e.g. node density, network connectivity) on the performance of the clustering algorithm in terms of communication overhead, node coverage, and average cluster size. The results show that although we have overlapped clusters, the OK clustering algorithm still produces approximately equal-sized clusters

Emergence of hyperons in failed supernovae: trigger of the black hole formation

We investigate the emergence of strange baryons in the dynamical collapse of a non-rotating massive star to a black hole by the neutrino-radiation hydrodynamical simulations in general relativity. By following the dynamical formation and collapse of nascent proto-neutron star from the gravitational collapse of a 40Msun star adopting a new hyperonic EOS table, we show that the hyperons do not appear at the core bounce but populate quickly at ~0.5-0.7 s after the bounce to trigger the re-collapse to a black hole. They start to show up off center owing to high temperatures and later prevail at center when the central density becomes high enough. The neutrino emission from the accreting proto-neutron star with the hyperonic EOS stops much earlier than the corresponding case with a nucleonic EOS while the average energies and luminosities are quite similar between them. These features of neutrino signal are a potential probe of the emergence of new degrees of freedom inside the black hole forming collapse.Comment: 11 pages, 3 figures, accepted for publication in ApJ

AD (Attacker Defender) Game

Information Dynamics is a framework for agent-based systems that gives a central position to the role of information, time, and the value of information. We illustrate system design in the Information Dynamics Framework by developing an intelligence game called AD involving attackers, defenders and targets operating in some space of locations. The goal of the attackers is to destroy all targets. Target destruction takes place when the number of attackers in the target's neighborhood exceeds the number of defenders in this neighborhood by a value WINNING_DIFFERENCE. The goal of defenders is to prevent attackers from achieving their goal. (Also UMIACS-TR-2001-45