OpenRaiser/Intern-Atlas huggingface dataset:
An Aiding Tool for Building Design Generation, Thermal Assessment and Optimization -- EnergyPlus Interaction Overview
Venue: arXiv cs.HC 2018
Year: 2018

A building design aiding tool for space allocation and thermal performance optimization is being developed to help practitioners during the building space planning phase, predicting how it will behave regarding energy consumption and thermal comfort. The tool evaluates, ranks, and optimizes generated floor plans according to thermal performance criteria, using the dynamic simulation program EnergyPlus. The tool is currently able to use a wide variety of EnergyPlus objects, allowing for various template and detailed HVAC, DHW, and thermal and electrical energy production systems and components, as well as numerous internal gains types, construction elements and energy saving controls, to be accounted for and simulated in the generated buildings. This paper presents the tool overall concept as well as the main features regarding dynamic simulation. Some performance results are presented for distinct systems to illustrate the use and potential of the tool.
Learning 6-DoF Grasping and Pick-Place Using Attention Focus
Venue: arXiv cs.RO 2018
Year: 2018

We address a class of manipulation problems where the robot perceives the scene with a depth sensor and can move its end effector in a space with six degrees of freedom -- 3D position and orientation. Our approach is to formulate the problem as a Markov decision process (MDP) with abstract yet generally applicable state and action representations. Finding a good solution to the MDP requires adding constraints on the allowed actions. We develop a specific set of constraints called hierarchical $\text{SE}(3)$ sampling (HSE3S) which causes the robot to learn a sequence of gazes to focus attention on the task-relevant parts of the scene. We demonstrate the effectiveness of our approach on three challenging pick-place tasks (with novel objects in clutter and nontrivial places) both in simulation and on a real robot, even though all training is done in simulation.
Semantic Video Segmentation: A Review on Recent Approaches
Venue: arXiv cs.CV 2018
Year: 2018

This paper gives an overview on semantic segmentation consists of an explanation of this field, it's status and relation with other vision fundamental tasks, different datasets and common evaluation parameters that have been used by researchers. This survey also includes an overall review on a variety of recent approaches (RDF, MRF, CRF, etc.) and their advantages and challenges and shows the superiority of CNN-based semantic segmentation systems on CamVid and NYUDv2 datasets. In addition, some areas that is ideal for future work have mentioned.
A New High Performance and Scalable SVD algorithm on Distributed Memory Systems
Venue: arXiv cs.DC 2018
Year: 2018

This paper introduces a high performance implementation of \texttt{Zolo-SVD} algorithm on distributed memory systems, which is based on the polar decomposition (PD) algorithm via the Zolotarev's function (\texttt{Zolo-PD}), originally proposed by Nakatsukasa and Freund [SIAM Review, 2016]. Our implementation highly relies on the routines of ScaLAPACK and therefore it is portable. Compared with the other PD algorithms such as the QR-based dynamically weighted Halley method (\texttt{QDWH-PD}), \texttt{Zolo-PD} is naturally parallelizable and has better scalability though performs more floating-point operations. When using many processes, \texttt{Zolo-PD} is usually 1.20 times faster than \texttt{QDWH-PD} algorithm, and \texttt{Zolo-SVD} can be about two times faster than the ScaLAPACK routine \texttt{\texttt{PDGESVD}}. These numerical experiments are performed on Tianhe-2 supercomputer, one of the fastest supercomputers in the world, and the tested matrices include some sparse matrices from particular applications and some randomly generated dense matrices with different dimensions. Our \texttt{QDWH-SVD} and \texttt{Zolo-SVD} implementations are freely available at https://github.com/shengguolsg/Zolo-SVD.
Advice Complexity of Priority Algorithms
Venue: arXiv cs.DS 2018
Year: 2018

The priority model of "greedy-like" algorithms was introduced by Borodin, Nielsen, and Rackoff in 2002. We augment this model by allowing priority algorithms to have access to advice, i.e., side information precomputed by an all-powerful oracle. Obtaining lower bounds in the priority model without advice can be challenging and may involve intricate adversary arguments. Since the priority model with advice is even more powerful, obtaining lower bounds presents additional difficulties. We sidestep these difficulties by developing a general framework of reductions which makes lower bound proofs relatively straightforward and routine. We start by introducing the Pair Matching problem, for which we are able to prove strong lower bounds in the priority model with advice. We develop a template for constructing a reduction from Pair Matching to other problems in the priority model with advice -- this part is technically challenging since the reduction needs to define a valid priority function for Pair Matching while respecting the priority function for the other problem. Finally, we apply the template to obtain lower bounds for a number of standard discrete optimization problems.
Information Aging through Queues: A Mutual Information Perspective
Venue: arXiv cs.IT 2018
Year: 2018

In this paper, we propose a new measure for the freshness of information, which uses the mutual information between the real-time source value and the delivered samples at the receiver to quantify the freshness of the information contained in the delivered samples. Hence, the "aging" of the received information can be interpreted as a procedure that the above mutual information reduces as the age grows. In addition, we consider a sampling problem, where samples of a Markov source are taken and sent through a queue to the receiver. In order to optimize the freshness of information, we study the optimal sampling policy that maximizes the time-average expected mutual information. We prove that the optimal sampling policy is a threshold policy and find the optimal threshold exactly. Specifically, a new sample is taken once a conditional mutual information term reduces to a threshold, and the threshold is equal to the optimum value of the time-average expected mutual information that is being maximized. Numerical results are provided to compare different sampling policies.
Mitigating Botnet Attack Using Encapsulated Detection Mechanism (EDM)
Venue: arXiv cs.CR 2018
Year: 2018

Botnet as it is popularly called became fashionable in recent times owing to it embedded force on network servers. Botnet has an exponential growth of about 170, 000 within network server and client infrastructures per day. The networking environment on monthly basis battle over 5 million bots. Nigeria as a country loses above one hundred and twenty five (N125) billion naira to network fraud annually, end users such as Banks and other financial institutions battle daily the botnet threats.
Medium Access Control in Wireless Network-on-Chip: A Context Analysis
Venue: arXiv cs.DC 2018
Year: 2018

Wireless on-chip communication is a promising candidate to address the performance and efficiency issues that arise when scaling current Network-on-Chip (NoC) techniques to manycore processors. A Wireless Network-on-Chip (WNoC) can serve global and broadcast traffic with ultra-low latency even in thousand-core chips, thus acting as a natural complement of conventional and throughput-oriented wireline NoCs. However, the development of Medium Access Control (MAC) strategies needed to efficiently share the wireless medium among the increasing number of cores remains as a considerable challenge given the singularities of the environment and the novelty of the research area. In this position paper, we present a context analysis describing the physical constraints, performance objectives, and traffic characteristics of the on-chip communication paradigm. We summarize the main differences with respect to traditional wireless scenarios, to then discuss their implications on the design of MAC protocols for manycore WNoCs, with the ultimate goal of kickstarting this arguably unexplored research area.
QoE Enhancement Schemes for Video in Converged OFDMA Wireless Networks and EPONs
Venue: arXiv cs.NI 2018
Year: 2018

Bandwidth requirements of both wireless and wired clients in access networks continue to increase rapidly, primarily due to the growth of video traffic. Application awareness can be utilized in access networks to optimize quality of experience (QoE) of end clients. In this study, we utilize information at the client-side application (e.g., video resolution) to achieve superior resource allocation that improves user QoE. We emphasize optimizing QoE of the system rather than quality of service (QoS), as user satisfaction directly relies on QoE and optimizing QoS does not necessarily optimize QoE, as shown in this study. We propose application-aware resource-allocation schemes on an Ethernet passive optical network (EPON), which supports wireless (utilizing orthogonal frequency division multiple access) and wired clients running video-conference applications. Numerical results show that the application-aware resource-allocation schemes improve QoE for video-conference applications for wired and wireless clients.
Utilizing Provenance in Reusable Research Objects
Venue: arXiv cs.DB 2018
Year: 2018

Science is conducted collaboratively, often requiring the sharing of knowledge about computational experiments. When experiments include only datasets, they can be shared using Uniform Resource Identifiers (URIs) or Digital Object Identifiers (DOIs). An experiment, however, seldom includes only datasets, but more often includes software, its past execution, provenance, and associated documentation. The Research Object has recently emerged as a comprehensive and systematic method for aggregation and identification of diverse elements of computational experiments. While a necessary method, mere aggregation is not sufficient for the sharing of computational experiments. Other users must be able to easily recompute on these shared research objects. Computational provenance is often the key to enable such reuse. In this paper, we show how reusable research objects can utilize provenance to correctly repeat a previous reference execution, to construct a subset of a research object for partial reuse, and to reuse existing contents of a research object for modified reuse. We describe two methods to summarize provenance that aid in understanding the contents and past executions of a research object. The first method obtains a process-view by collapsing low-level system information, and the second method obtains a summary graph by grouping related nodes and edges with the goal to obtain a graph view similar to application workflow. Through detailed experiments, we show the efficacy and efficiency of our algorithms.
Privacy Preserving Analytics on Distributed Medical Data
Venue: arXiv cs.CR 2018
Year: 2018

Objective: To enable privacy-preserving learning of high quality generative and discriminative machine learning models from distributed electronic health records. Methods and Results: We describe general and scalable strategy to build machine learning models in a provably privacy-preserving way. Compared to the standard approaches using, e.g., differential privacy, our method does not require alteration of the input biomedical data, works with completely or partially distributed datasets, and is resilient as long as the majority of the sites participating in data processing are trusted to not collude. We show how the proposed strategy can be applied on distributed medical records to solve the variables assignment problem, the key task in exact feature selection and Bayesian networks learning. Conclusions: Our proposed architecture can be used by health care organizations, spanning providers, insurers, researchers and computational service providers, to build robust and high quality predictive models in cases where distributed data has to be combined without being disclosed, altered or otherwise compromised.
A unified strategy for implementing curiosity and empowerment driven reinforcement learning
Venue: arXiv cs.AI 2018
Year: 2018

Although there are many approaches to implement intrinsically motivated artificial agents, the combined usage of multiple intrinsic drives remains still a relatively unexplored research area. Specifically, we hypothesize that a mechanism capable of quantifying and controlling the evolution of the information flow between the agent and the environment could be the fundamental component for implementing a higher degree of autonomy into artificial intelligent agents. This paper propose a unified strategy for implementing two semantically orthogonal intrinsic motivations: curiosity and empowerment. Curiosity reward informs the agent about the relevance of a recent agent action, whereas empowerment is implemented as the opposite information flow from the agent to the environment that quantifies the agent's potential of controlling its own future. We show that an additional homeostatic drive is derived from the curiosity reward, which generalizes and enhances the information gain of a classical curious/heterostatic reinforcement learning agent. We show how a shared internal model by curiosity and empowerment facilitates a more efficient training of the empowerment function. Finally, we discuss future directions for further leveraging the interplay between these two intrinsic rewards.
HitNet: a neural network with capsules embedded in a Hit-or-Miss layer, extended with hybrid data augmentation and ghost capsules
Venue: arXiv cs.CV 2018
Year: 2018

Neural networks designed for the task of classification have become a commodity in recent years. Many works target the development of better networks, which results in a complexification of their architectures with more layers, multiple sub-networks, or even the combination of multiple classifiers. In this paper, we show how to redesign a simple network to reach excellent performances, which are better than the results reproduced with CapsNet on several datasets, by replacing a layer with a Hit-or-Miss layer. This layer contains activated vectors, called capsules, that we train to hit or miss a central capsule by tailoring a specific centripetal loss function. We also show how our network, named HitNet, is capable of synthesizing a representative sample of the images of a given class by including a reconstruction network. This possibility allows to develop a data augmentation step combining information from the data space and the feature space, resulting in a hybrid data augmentation process. In addition, we introduce the possibility for HitNet, to adopt an alternative to the true target when needed by using the new concept of ghost capsules, which is used here to detect potentially mislabeled images in the training data.
Deque languages, automata and planar graphs
Venue: arXiv cs.FL 2018
Year: 2018

The memory of a deque (double ended queue) automaton is more general than a queue or two stacks; to avoid overgeneralization, we consider quasi-real-time operation. Normal forms of such automata are given. Deque languages form an AFL but not a full one. We define the characteristic deque language, CDL, which combines Dyck and AntiDyck (or FIFO) languages, and homomorphically characterizes the deque languages. The notion of deque graph, from graph theory, well represents deque computation by means of a planar hamiltonian graph on a cylinder, with edges visualizing producer-consumer relations for deque symbols. We give equivalent definitions of CDL by labelled deque graphs, by cancellation rules, and by means of shuffle and intersection of simpler languages. The labeled deque graph of a sentence generalizes traditional syntax trees. The layout of deque computations on a cylinder is remindful of 3D models used in theoretical (bio)chemistry.
Optimal Resource Allocation in Full-Duplex Ambient Backscatter Communication Networks for Wireless-Powered IoT
Venue: arXiv cs.IT 2018
Year: 2018

This paper considers an ambient backscatter communication (AmBC) network in which a full-duplex access point (FAP) simultaneously transmits downlink orthogonal frequency division multiplexing (OFDM) signals to its legacy user (LU) and receives uplink signals backscattered from multiple BDs in a time-division-multiple-access manner. To maximize the system throughput and ensure fairness, we aim to maximize the minimum throughput among all BDs by jointly optimizing the backscatter time and reflection coefficients of the BDs, and the FAP's subcarrier power allocation, subject to the LU's throughput constraint, the BDs' harvested-energy constraints, and other practical constraints. For the case with a single BD, we obtain closed-form solutions and propose an efficient algorithm by using the Lagrange duality method. For the general case with multiple BDs, we propose an iterative algorithm by leveraging the block coordinated decent and successive convex optimization techniques. We further show the convergence performances of the proposed algorithms and analyze their complexities. In addition, we study the throughput region which characterizes the Pareto-optimal throughput trade-offs among all BDs. Finally, extensive simulation results show that the proposed joint design achieves significant throughput gain as compared to the benchmark schemes.
Source Printer Classification using Printer Specific Local Texture Descriptor
Venue: arXiv cs.MM 2018
Year: 2018

The knowledge of source printer can help in printed text document authentication, copyright ownership, and provide important clues about the author of a fraudulent document along with his/her potential means and motives. Development of automated systems for classifying printed documents based on their source printer, using image processing techniques, is gaining a lot of attention in multimedia forensics. Currently, state-of-the-art systems require that the font of letters present in test documents of unknown origin must be available in those used for training the classifier. In this work, we attempt to take the first step towards overcoming this limitation. Specifically, we introduce a novel printer specific local texture descriptor. The highlight of our technique is the use of encoding and regrouping strategy based on small linear-shaped structures composed of pixels having similar intensity and gradient. The results of experiments performed on two separate datasets show that: 1) on a publicly available dataset, the proposed method outperforms state-of-the-art algorithms for characters printed in the same font, and 2) on another dataset\footnote{Code and dataset will be made publicly available with published version of this paper.} having documents printed in four different fonts, the proposed method correctly classifies all test samples when sufficient training data is available in same font setup. In addition, it outperforms state-of-the-art methods for cross font experiments. Moreover, it reduces the confusion between the printers of same brand and model.
Assessing robustness of radiomic features by image perturbation
Venue: arXiv cs.CV 2018
Year: 2018

Image features need to be robust against differences in positioning, acquisition and segmentation to ensure reproducibility. Radiomic models that only include robust features can be used to analyse new images, whereas models with non-robust features may fail to predict the outcome of interest accurately. Test-retest imaging is recommended to assess robustness, but may not be available for the phenotype of interest. We therefore investigated 18 methods to determine feature robustness based on image perturbations. Test-retest and perturbation robustness were compared for 4032 features that were computed from the gross tumour volume in two cohorts with computed tomography imaging: I) 31 non-small-cell lung cancer (NSCLC) patients; II): 19 head-and-neck squamous cell carcinoma (HNSCC) patients. Robustness was measured using the intraclass correlation coefficient (1,1) (ICC). Features with ICC$\geq0.90$ were considered robust. The NSCLC cohort contained more robust features for test-retest imaging than the HNSCC cohort ($73.5\%$ vs. $34.0\%$). A perturbation chain consisting of noise addition, affine translation, volume growth/shrinkage and supervoxel-based contour randomisation identified the fewest false positive robust features (NSCLC: $3.3\%$; HNSCC: $10.0\%$). Thus, this perturbation chain may be used to assess feature robustness.
Lambda-calculus and Reversible Automatic Combinators
Venue: arXiv cs.LO 2018
Year: 2018

In 2005, Abramsky introduced various linear/affine combinatory algebras of partial involutions over a suitable formal language, to discuss reversible computation in a game-theoretic setting. These algebras arise as instances of the general paradigm explored by Haghverdi (Abramsky's Programme), which amounts to defining a lambda-algebra starting from a GoI Situation in a traced symmetric monoidal category. We investigate this construction from the point of view of the model theory of lambda-calculus. We focus on the strictly linear and affine parts of Abramsky's Affine Combinatory Algebras, sketching how to encompass the full algebra. The gist of our approach is that the GoI interpretation of a term based on involutions is dual to the principal type of the term, w.r.t. the type discipline for a linear/affine lambda-calculus. In the general case the type discipline and the calculus need to be extended, resp., with intersection, !-types, and !-abstractions. Our analysis unveils three conceptually independent, but ultimately equivalent, accounts of application in the lambda-calculus: beta-reduction, the GoI application of involutions based on symmetric feedback (Girard's Execution Formula), and unification of principal types. Thus we provide an answer, in the strictly affine case, to the question raised in [1] of characterising the partial involutions arising from bi-orthogonal pattern matching automata, which are denotations of affine combinators, and we point to the answer to the full question. Furthermore, we prove that the strictly linear combinatory algebra of partial involutions is a strictly linear lambda-algebra, albeit not a combinatory model, while both the strictly affine combinatory algebra and the full affine combinatory algebra are not. To check all the equations involved in the definition of affine lambda-algebra, we implement in Erlang application of involutions.
Kid-Net: Convolution Networks for Kidney Vessels Segmentation from CT-Volumes
Venue: arXiv cs.CV 2018
Year: 2018

Semantic image segmentation plays an important role in modeling patient-specific anatomy. We propose a convolution neural network, called Kid-Net, along with a training schema to segment kidney vessels: artery, vein and collecting system. Such segmentation is vital during the surgical planning phase in which medical decisions are made before surgical incision. Our main contribution is developing a training schema that handles unbalanced data, reduces false positives and enables high-resolution segmentation with a limited memory budget. These objectives are attained using dynamic weighting, random sampling and 3D patch segmentation. Manual medical image annotation is both time-consuming and expensive. Kid-Net reduces kidney vessels segmentation time from matter of hours to minutes. It is trained end-to-end using 3D patches from volumetric CT-images. A complete segmentation for a 512x512x512 CT-volume is obtained within a few minutes (1-2 mins) by stitching the output 3D patches together. Feature down-sampling and up-sampling are utilized to achieve higher classification and localization accuracies. Quantitative and qualitative evaluation results on a challenging testing dataset show Kid-Net competence.