title: Functorial Boxes in String Diagrams

text: String diagrams were introduced by Roger Penrose as a handy notation to manipulate morphisms in a monoidal category. In principle, this graphical notation should encompass the various pictorial systems introduced in proof-theory (like Jean-Yves Girard’s proof-nets) and in concurrency theory (like Robin Milner’s bigraphs). This is not the case however, at least because string diagrams do not accomodate boxes — a key ingredient in these pictorial systems. In this short tutorial, based on our accidental rediscovery of an idea by Robin Cockett and Robert Seely, we explain how string diagrams may be extended with a notion of functorial box to depict a functor separating an inside world (its source category) from an outside world (its target category). We expose two elementary applications of the notation: first, we characterize graphically when a faithful balanced monoidal functor F : C −→ D transports a trace operator from the category D to the category C, and we then exploit this to construct well-behaved fixpoint operators in cartesian closed categories generated by models of linear logic; second, we explain how the categorical semantics of linear logic induces that the exponential box of proof-nets decomposes as two enshrined functorial boxes. ∗Invited paper at the conference Computer Science Logic 2006 in Szeged, Hungary. To appear in the proceedings of the conference. c © Springer Verlag. This research was partially supported by the ANR Project INVAL “Invariants algébriques des systèmes informatiques”.


title: A survey of graphical languages for monoidal categories

text: This article is intended as a reference guide to various notions of monoidal categories and their associated string diagrams. It is hoped that this will be useful not just to mathematicians, but also to physicists, computer scientists, and others who use diagrammatic reasoning. We have opted for a somewhat informal treatment of topological notions, and have omitted most proofs. Nevertheless, the exposition is sufficiently detailed to make it clear what is presently known, and to serve as a starting place for more in-depth study. Where possible, we provide pointers to more rigorous treatments in the literature. Where we include results that have only been proved in special cases, we indicate this in the form of caveats.


title: Diagram Rewriting for Orthogonal Matrices: A Study of Critical Peaks

text: One of the rules, which is similar to the Yang-Baxter equatio n, nvolves a map h : [0, π[ → [0, π[. To study the algebraic properties of h, we use the confluence of critical peaks in our rewrite system, and we introduce parametric diagramsdescribing the calculation of angles of rotations generated b y rewriting. In particular, h satisfies thetetrahedron equation(also called Zamolodchikov equation).


Term rewriting and all that


title: An Extensive Empirical Evaluation of Character-Based Morphological Tagging for 14 Languages

text: This paper investigates neural characterbased morphological tagging for languages with complex morphology and large tag sets. Character-based approaches are attractive as they can handle rarelyand unseen words gracefully. We evaluate on 14 languages and observe consistent gains over a state-of-the-art morphological tagger across all languages except for English and French, where we match the state-of-the-art. We compare two architectures for computing characterbased word vectors using recurrent (RNN) and convolutional (CNN) nets. We show that the CNN based approach performs slightly worse and less consistently than the RNN based approach. Small but systematic gains are observed when combining the two architectures by ensembling.


title: Understanding Citizen ’ s Continuance Intention to Use e-Government Website : a Composite View of Technology Acceptance Model and Computer Self-Efficacy

text: This study aims to understand the fundamental factors influencing the citizen’s continuance intention to use eGovernment websites by using the Technology Acceptance Model (TAM) as a based theoretical model. Computer selfefficacy is adopted as an additional factor that influences the citizen’s continuance intention to use e-Government websites. To empirically test the proposed research model, the web-based survey was employed. The participants consisted of 614 country-wide citizens with at least a bachelor’s degree and an experience with e-Government websites. Regression analysis was conducted to test the model. The results revealed that perceived usefulness and perceived ease of use of e-Government websites and citizen’s computer self-efficacy directly enhanced citizen’s continuance intention to use e-Government websites. In addition, perceived ease of use of e-Government websites indirectly enhanced citizen’s continuance intention through perceived usefulness.


title: Common Sense Knowledge Based Personality Recognition from Text

text: Past works on personality detection has shown that psycho-linguistic features, frequency based analysis at lexical level , emotive words and other lexical clues such as number of first person or sec ond person words carry major role to identify personality associated with the te xt. In this work, we propose a new architecture for the same task using common sen se knowledge with associated sentiment polarity and affective labels. To extract the common sense knowledge with sentiment polarity scores and affect iv labels we used Senticnet which is one of the most useful resources for opinion mining and sentiment analysis. In particular, we combined comm n sense knowledge based features with phycho-linguistic features and freque ncy based features and later the features were employed in supervised classifier . We designed five SMO based supervised classifiers for five personality t raits. We observe that the use of common sense knowledge with affective and sentim ent information enhances the accuracy of the existing frameworks which use o nly psycho-linguistic features and frequency based analysis at lexical le ve .


title: Fascia lliaca block for analgesia after hip arthroplasty: a randomized double-blind, placebo-controlled trial.

text:
BACKGROUND AND OBJECTIVES
Fascia iliaca block (FIB) is often used to treat pain after total hip arthroplasty (THA), despite a lack of randomized trials to evaluate its efficacy for this indication. The objective of this study was to assess the analgesic benefit of FIB after THA. Our primary hypothesis was administration of FIB decreases the intensity of postoperative pain (numeric rating scale [NRS-11] score) compared with sham block (SB) in patients after THA.

METHODS
After institutional review board approval and informed consent, 32 eligible patients having THA were recruited. In the postoperative care unit, although all patients received intravenous morphine sulfate patient-controlled analgesia, patients reporting pain of 3 or greater on the NRS-11 scale were randomized to receive ultrasound-guided fascia iliaca (30 mL 0.5% ropivacaine) or SB (30 mL 0.9% NaCl) using identical technique, below fascia iliaca. The primary outcome was pain intensity (NRS-11) after FIB.

RESULTS
Thirty-two patients (16 in each group) completed the study; all patients received an FIB. There was no difference in pain intensity (NRS-11 = 5.0 ± 0.6 vs 4.7 ± 0.6, respectively) after FIB versus SB or in opioid consumption (8.97 ± 1.6 vs 5.7 ± 1.6 mg morphine, respectively) between the groups at 1 hour. The morphine consumption after 24 hours was similar in both groups (49.0 ± 29.9 vs 50.4 ± 34.5 mg, P = 0.88, respectively).

CONCLUSIONS
The evidence in these data suggests that the difference in average pain intensity after FIB versus SB was not significant (95% confidence interval, -2.2-1.4 NRS units).


title: A (sub)graph isomorphism algorithm for matching large graphs

text: We present an algorithm for graph isomorphism and subgraph isomorphism suited for dealing with large graphs. A first version of the algorithm has been presented in a previous paper, where we examined its performance for the isomorphism of small and medium size graphs. The algorithm is improved here to reduce its spatial complexity and to achieve a better performance on large graphs; its features are analyzed in detail with special reference to time and memory requirements. The results of a testing performed on a publicly available database of synthetically generated graphs and on graphs relative to a real application dealing with technical drawings are presented, confirming the effectiveness of the approach, especially when working with large graphs.


title: Image-based visual navigation for mobile robots

text: We introduce a new image-based visual navigation algorithm that allows the Cartesian velocity of a robot to be defined with respect to a set of visually observed features corresponding to previously unseen and unmapped world points. The technique is well suited to mobile robot tasks such as moving along a road or flying over the ground. We describe the algorithm in general form and present detailed simulation results for an aerial robot scenario using a spherical camera and a wide angle perspective camera, and present experimental results for a mobile ground robot.


title: Knowledge sharing behavior of physicians in hospitals

text: Sharing knowledge of Physicians within hospitals can realize potential gains enormously and is critical to be successful and survive in competitive environments. There is a need for empirical research to identify the factors that determine physician's behavior to share knowledge. This study investigates the factors that determine the physician's individual knowledge sharing behavior in his/her department. The purpose of this study is to examine empirically the physicians' knowledge sharing behavior The research models under investigation are the Theory of Reasoned Action (TRA) model and the Theory of Planned Behavior (TPBI model. These models are empirically examined and compared, using the survey results on physicians' knowledge sharing behavior collected from 286 physicians practicing in 28 departments in 13 tertiary hospitals in Korea. TPB model exhibited a good fit with the data and appeared to be superior to TRA in explaining physicians' intentions to share knowledge. Amended TPB model provided an important improvement In fit over that of original TPB model. In amended TPB model, subjective norms were found to have the strongest total effects on behavioral intentions to share knowledge of physicians through direct and indirect path by attitude. Attitude was found to be the second important factor influencing physicians' intentions. Perceived behavioral control was also found to have effect on the intentions to share knowledge though it was weaker than that of subjective norms or attitude. The implications for physician's knowledge sharing activities are discussed


title: vTPM: Virtualizing the Trusted Platform Module

text: We present the design and implementation of a system that enables trusted computing for an unlimited number of virtual machines on a single hardware platform. To this end, we virtualized the Trusted Platform Module (TPM). As a result, the TPM’s secure storage and cryptographic functions are available to operating systems and applications running in virtual machines. Our new facility supports higher-level services for establishing trust in virtualized environments, for example remote attestation of software integrity. We implemented the full TPM specification in software and added functions to create and destroy virtual TPM instances. We integrated our software TPM into a hypervisor environment to make TPM functions available to virtual machines. Our virtual TPM supports suspend and resume operations, as well as migration of a virtual TPM instance with its respective virtual machine across platforms. We present four designs for certificate chains to link the virtual TPM to a hardware TPM, with security vs. efficiency trade-offs based on threat models. Finally, we demonstrate a working system by layering an existing integrity measurement application on top of our virtual TPM facility.


title: Action recognition from a distributed representation of pose and appearance

text: We present a distributed representation of pose and appearance of people called the “poselet activation vector”. First we show that this representation can be used to estimate the pose of people defined by the 3D orientations of the head and torso in the challenging PASCAL VOC 2010 person detection dataset. Our method is robust to clutter, aspect and viewpoint variation and works even when body parts like faces and limbs are occluded or hard to localize. We combine this representation with other sources of information like interaction with objects and other people in the image and use it for action recognition. We report competitive results on the PASCAL VOC 2010 static image action classification challenge.


title: A Review of Sleep EEG Patterns . Part I : A Compilation of Amended Rules for Their Visual Recognition according to Rechtschaffen and Kales

text: Task Force ‘Scoring of Polysomnographic Recordings’ of the German Sleep Society (DGSM): Andrea Rodenbeck, Ralf Binder, Peter Geisler, Heidi Danker-Hopfe, Reimer Lund, Friedhart Raschke, Hans-Günther Weeß, and Hartmut Schulz (Chairman) Department of Psychiatry, University of Göttingen, Göttingen, Germany Department of Psychiatry, Pfalzklinikum, Klingenmünster, Germany Department of Psychiatry, University of Regensburg, Regensburg, Germany Department of Psychiatry, Charité-CBF, Berlin, Germany Grüntenstr. 11, 80686 München (formerly Dept. of Pneumology, ASKLEPIOS Clinic Gauting, Germany) Institute of Rehabilitation Norderney, Norderney, Germany Department of Neurology, HELIOS-Klinikum Erfurt, and Free University of Berlin, Biopsychology, Germany


title: Surveys on attitudes towards legalisation of euthanasia: importance of question phrasing.

text:
AIM
To explore whether the phrasing of the questions and the response alternatives would influence the answers to questions about legalisation of euthanasia.

METHODS
Results were compared from two different surveys in populations with similar characteristics. The alternatives "positive", "negative", and "don't know" (first questionnaire) were replaced with an explanatory text, "no legal sanction", four types of legal sanctions, and no possibility to answer "don't know" (second questionnaire). Four undergraduate student groups (engineering, law, medicine, and nursing) answered.

RESULTS
In the first questionnaire (n = 684) 43% accepted euthanasia (range 28-50%), 14% (8-33%) did not, and 43% (39-59%) answered "don't know". Two per cent of the respondents declined to answer. In comparison with previous surveys on attitudes to euthanasia the proportion of "don't know" was large. The results of the second questionnaire (n = 639), showed that 38% favoured "no legal prosecution" (26-50%). However, 62% (50-74%) opted for different kinds of legal sanctions, and two of four groups expressed significantly different views in the two surveys. A proportion of 10% declined to answer the second questionnaire.

CONCLUSION
An introduction of an explanatory text and a wider range of response alternatives produced differences between the results of the two surveys conducted.


title: Knowledge Bases in the Age of Big Data Analytics

text: This tutorial gives an overview on state-of-the-art methods for the automatic construction of large knowledge bases and harnessing them for data and text analytics. It covers both big-data methods for building knowledge bases and knowledge bases being assets for big-data applications. The tutorial also points out challenges and research opportunities. 1. MOTIVATION AND SCOPE Comphrehensive machine-readable knowledge bases (KB’s) have been pursued since the seminal projects Cyc [19, 20] and WordNet [12]. In contrast to these manually created KB’s, great advances have recently been made on automating the building and curation of large KB’s [1, 16], using information extraction (IE) techniques and harnessing highquality Web sources like Wikipedia. Prominent endeavors of this kind include academic research projects such as DBpedia [3], KnowItAll [10], NELL [5] and YAGO [29], as well as industrial ones such as Freebase. These projects provide automatically constructed KB’s of facts about named entities, their semantic classes, and their mutual relationships. They contain millions of entities and billions of facts about them. Moreover, several KB’s are interlinked at the entity level, forming the backbone of the Web of Linked Data [14]. Such world knowledge in turn enables cognitive applications and knowledge-centric services like disambiguating natural-language text, entity linking, text summarization, deep question answering, and semantic search and analytics over entities and relations in Web and enterprise data (e.g., [2, 6, 8, 13]). Prominent examples of how KB’s can be harnessed include the Google Knowledge Graph [27] and the IBM Watson question answering system [17]. This tutorial presents state-of-the-art methods, recent advances, research opportunities, and open challenges along this avenue of knowledge harvesting and its applications. Particular emphasis is on the twofold role of KB’s for bigdata analytics: using scalable distributed algorithms for harvesting knowledge from Web and text sources, and leveraging entity-centric knowledge for deeper interpretation of and This work is licensed under the Creative Commons AttributionNonCommercial-NoDerivs 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc-nd/3.0/. Obtain permission prior to any use beyond those covered by the license. Contact copyright holder by emailing info@vldb.org. Articles from this volume were invited to present their results at the 40th International Conference on Very Large Data Bases, September 1st 5th 2014, Hangzhou, China. Proceedings of the VLDB Endowment, Vol. 7, No. 13 Copyright 2014 VLDB Endowment 2150-8097/14/08. better intelligence with big data. The following sections outline the structure of the tutorial. An extensive bibliography on this theme is given in [30]. 2. BUILDING KNOWLEDGE BASES Digital Knowledge: Today’s KB’s represent their data mostly in RDF-style SPO (subject-predicate-object) triples. We introduce this data model and the most salient KB projects, which include KnowItAll [10, 11], BabelNet [22], ConceptNet [28], DBpedia [3, 18], DeepDive [24], Freebase [4], ImageNet [7], NELL [5], Wikidata [31], WikiNet [21], WikiTaxonomy [26], and YAGO [29, 15]. We briefly discuss industrial projects like the Google Knowledge Graph and related work at Google [9, 13, 25], the EntityCube and Probase projects at Microsoft Research [23, 32], and IBM’s Watson project [17]. Harvesting Knowledge on Entities and Classes: Every entity in a KB (e.g., Steve Jobs) belongs to one or multiple classes (e.g., computer pioneer, entrepreneur). These classes are organized into a taxonomy, where more special classes are subsumed by more general classes (e.g., person). We discuss two families of methods to harvest such information: Wikipedia-based approaches that analyze the category system, and Web-based approaches that use techniques like set expansion. 3. HARVESTING FACTS AT WEB SCALE Harvesting Relational Facts: Relational facts express properties of and relationships between entities. There is a large spectrum of methods to extract such facts from Web documents. We give an overview on methods from pattern matching (e.g., regular expressions), computational linguistics (e.g., dependency parsing), statistical learning (e.g., factor graphs and MLN’s), and logical consistency reasoning (e.g., weighted MaxSat or ILP solvers). We also discuss to what extent these approaches scale to handle big data. Open Information Extraction: Alternatively to methods that operate on a pre-specified set of relations and entities, open information extraction harvests arbitrary SPO triples from natural language documents. It aggressively taps into noun phrases as entity candidates and verbal phrases as prototypic patterns for relations. We discuss recent methods that follow this direction. Some methods along these lines make clever use of big-data techniques like frequent sequence mining and map-reduce computation. Temporal and Multilingual Knowledge: Properly interpreting entities and facts in a KB often requires additional meta-information like entity names in different languages and the temporal scope of facts. We discuss tech-


title: LOGO MATCHING ALGORITHM FEATURE‐BASED MATCHING RESULTS IMRESTAURANT(): MATLAB FOR FEATURE‐BASED RESTAURANT LOGO RECOGNITION

text: This paper discusses the implementation of imrestaurant(), a MATLAB function for feature-based restaurant logo recognition. The algorithm works by first applying SIFT to a logo database and then creating a hierarchical vocabulary tree using K-means clustering. The input to the algorithm is a photograph of an image logo, which is first filtered to reduce noise. Then SIFT is applied to the input image, and the output descriptors are pushed to the vocabulary tree. Each image in the logo database is scored using TF-IDF weights and the ten highest scoring database logos are pairwise matched using the ratio test and RANSAC. The restaurant database image with the largest consensus set is searched for on yelp.com. This algorithm was shown to be robust against input image size, background noise, and shearing. Finally, future work in increasing the accuracy of feature detection as well as optical character recognition is discussed.


title: Ensemble of jointly trained deep neural network-based acoustic models for reverberant speech recognition

text: Distant speech recognition is a challenge, particularly due to the corruption of speech signals by reverberation caused by large distances between the speaker and microphone. In order to cope with a wide range of reverberations in real-world situations, we present novel approaches for acoustic modeling including an ensemble of deep neural networks (DNNs) and an ensemble of jointly trained DNNs. First, multiple DNNs are established, each of which corresponds to a different reverberation time 60 (RT60) in a setup step. Also, each model in the ensemble of DNN acoustic models is further jointly trained, including both feature mapping and acoustic modeling, where the feature mapping is designed for the dereverberation as a front-end. In a testing phase, the two most likely DNNs are chosen from the DNN ensemble using maximum a posteriori (MAP) probabilities, computed in an online fashion by using maximum likelihood (ML)-based blind RT60 estimation and then the posterior probability outputs from two DNNs are combined using the ML-based weights as a simple average. Extensive experiments demonstrate that the proposed approach leads to substantial improvements in speech recognition accuracy over the conventional DNN baseline systems under diverse reverberant conditions.


title: We Can "See" You via Wi-Fi - WiFi Action Recognition via Vision-based Methods

text: Recently, Wi-Fi has caught tremendous attention for its ubiquity. Motivated by Wi-Fi’s low cost and privacy preservation, researchers have been putting lots of investigation into its potential on action recognition and even person identification. In this paper, for bringing a new modality for multimedia community, we offer an comprehensive overview on these two topics in Wi-Fi. Also, through looking at these two topics from an unprecedented perspective, we could achieve generality instead of designing specific ad-hoc features for each scenario. Observing the great resemblance of Channel State Information (CSI, a finegrained information captured from the received Wi-Fi signal) to texture, we propose a brand-new framework based on computer vision methods. To minimize the effect of location dependency embedded in CSI, we propose a novel de-noising method based on Singular Value Decomposition (SVD) to eliminate the background energy and effectively extract the channel information of signals reflected by human bodies. From the experiments conducted, we demonstrate the feasibility and efficacy of the proposed methods. Also, we conclude the factors that would affect the performance and highlight a few potential issues that require further deliberations.


title: Face Photo-Sketch Synthesis and Recognition

text: Today in Modern Society Face Recognition has gained much attention in the field of network multimedia access. After the 9/11 tragedy in India, the need for technologies for identification, detection and recognition of suspects has increased. One of the most common biometric recognition techniques is face recognition since face is the convenient way used by the people to identify each other. In this paper we are going to study a method for representing face which is based on the features which uses geometric relationship among the facial features like mouth, nose and eyes .Feature based face representation is done by independently matching templates of three facial regions i.e eyes, mouth and nose .Principal Component Analysis method which is also called Eigen faces is appearance based technique used widely for the dimensionality reduction and recorded a greater performance in face recognition. Here we are going to study about PCA followed by Feed Forward Neural Network called PCA-NN.


title: X-band 1kW SSPA using 20-way Hybrid Radial combiner for accelerator

text: The X-band pulsed 1kW SSPA for XFEL has been designed and manufactured. Amplifier modules were combined by a 20-way Hybrid Radial combiner in order to reduce output loss. The manufactured 20-Way Hybrid Radial Combiner is capable of high output with a combining efficiency of 95%. The entire system is driven by Pulse and results in a Power Gain of 60dB with an Output Power of 1kW.


title: Applying QR code in augmented reality applications

text:
In this paper we present an augmented reality (AR) application based on the QR Code. The system can extract the information embedded in a QR Code and show the information in an extended 3D form with the QR Code being the traditional AR marker. Traditional AR systems often use a particularly designed pattern (the marker) to recover the 3D scene structure and identify the object to be displayed on the scene. In these systems, the marker is used only for tracking and identification. They do not convey any other information. Consequently, the applications of these systems are limited and often a registration procedure is required for a new marker.
 QR Code has the advantage of large information capacity and is similar to an AR marker in appearance. Thus, more interesting and useful applications can be developed by combining the QR Code with the traditional AR system. In this paper, we combine these two techniques to develop a product demo system. A QR Code is pasted on the package of a product and then a 3D virtual object is displayed on the QR Code. This system allows the customer to visualize the product via a more direct and interactive way. Our system demonstrates the success of using QR Code as the AR marker to a particular application and we believe it can bring more convenient to our life in the future.


title: Combining CPU and GPU architectures for fast similarity search

text: The Signature Quadratic Form Distance on feature signatures represents a flexible distance-based similarity model for effective content-based multimedia retrieval. Although metric indexing approaches are able to speed up query processing by two orders of magnitude, their applicability to large-scale multimedia databases containing billions of images is still a challenging issue. In this paper, we propose a parallel approach that balances the utilization of CPU and many-core GPUs for efficient similarity search with the Signature Quadratic Form Distance. In particular, we show how to process multiple distance computations and other parts of the search procedure in parallel, achieving maximal performance of the combined CPU/GPU system. The experimental evaluation demonstrates that our approach implemented on a common workstation with 2 GPU cards outperforms traditional parallel implementation on a high-end 48-core NUMA server in terms of efficiency almost by an order of magnitude. If we consider also the price of the high-end server that is ten times higher than that of the GPU workstation then, based on price/performance ratio, the GPU-based similarity search beats the CPU-based solution by almost two orders of magnitude. Although proposed for the SQFD, our approach of fast GPU-based similarity search is applicable for any distance function that is efficiently parallelizable in the SIMT execution model.


title: Aircraft angle of attack and air speed detection by redundant strip pressure sensors

text: Air speed and angle of attack are fundamental parameters in the control of flying bodies. Conventional detection techniques use sensors that may protrude outside the aircraft, be too bulky for installation on small UAVs, or be excessively intrusive. We propose a novel readout methodology where flight parameters are inferred from redundant pressure readings made by capacitive strip sensors directly applied on the airfoil skin. Redundancy helps lower the accuracy requirements on the individual sensors. A strategy for combining sensor data is presented with an error propagation analysis. The latter enables foreseeing the precision by which the flight parameters can be detected. The methodology has been validated by fluid dynamic simulation and a sample case is illustrated.


title: Visual saliency based on multiscale deep features

text: Visual saliency is a fundamental problem in both cognitive and computational sciences, including computer vision. In this paper, we discover that a high-quality visual saliency model can be learned from multiscale features extracted using deep convolutional neural networks (CNNs), which have had many successes in visual recognition tasks. For learning such saliency models, we introduce a neural network architecture, which has fully connected layers on top of CNNs responsible for feature extraction at three different scales. We then propose a refinement method to enhance the spatial coherence of our saliency results. Finally, aggregating multiple saliency maps computed for different levels of image segmentation can further boost the performance, yielding saliency maps better than those generated from a single segmentation. To promote further research and evaluation of visual saliency models, we also construct a new large database of 4447 challenging images and their pixelwise saliency annotations. Experimental results demonstrate that our proposed method is capable of achieving state-of-the-art performance on all public benchmarks, improving the F-Measure by 5.0% and 13.2% respectively on the MSRA-B dataset and our new dataset (HKU-IS), and lowering the mean absolute error by 5.7% and 35.1% respectively on these two datasets.


title: Deep Saliency with Encoded Low Level Distance Map and High Level Features

text: Recent advances in saliency detection have utilized deep learning to obtain high level features to detect salient regions in a scene. These advances have demonstrated superior results over previous works that utilize hand-crafted low level features for saliency detection. In this paper, we demonstrate that hand-crafted features can provide complementary information to enhance performance of saliency detection that utilizes only high level features. Our method utilizes both high level and low level features for saliency detection under a unified deep learning framework. The high level features are extracted using the VGG-net, and the low level features are compared with other parts of an image to form a low level distance map. The low level distance map is then encoded using a convolutional neural network(CNN) with multiple 1 1 convolutional and ReLU layers. We concatenate the encoded low level distance map and the high level features, and connect them to a fully connected neural network classifier to evaluate the saliency of a query region. Our experiments show that our method can further improve the performance of state-of-the-art deep learning-based saliency detection methods.


title: ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Design

text: Currently, the neural network architecture design is mostly guided by the indirect metric of computation complexity, i.e., FLOPs. However, the direct metric, e.g., speed, also depends on the other factors such as memory access cost and platform characterics. Thus, this work proposes to evaluate the direct metric on the target platform, beyond only considering FLOPs. Based on a series of controlled experiments, this work derives several practical guidelines for efficient network design. Accordingly, a new architecture is presented, called ShuffleNet V2. Comprehensive ablation experiments verify that our model is the stateof-the-art in terms of speed and accuracy tradeoff.


title: Symbiotic Segmentation and Part Localization for Fine-Grained Categorization

text: We propose a new method for the task of fine-grained visual categorization. The method builds a model of the base-level category that can be fitted to images, producing high-quality foreground segmentation and mid-level part localizations. The model can be learnt from the typical datasets available for fine-grained categorization, where the only annotation provided is a loose bounding box around the instance (e.g. bird) in each image. Both segmentation and part localizations are then used to encode the image content into a highly-discriminative visual signature. The model is symbiotic in that part discovery/localization is helped by segmentation and, conversely, the segmentation is helped by the detection (e.g. part layout). Our model builds on top of the part-based object category detector of Felzenszwalb et al., and also on the powerful Grab Cut segmentation algorithm of Rother et al., and adds a simple spatial saliency coupling between them. In our evaluation, the model improves the categorization accuracy over the state-of-the-art. It also improves over what can be achieved with an analogous system that runs segmentation and part-localization independently.


title: Overhead line fault detection using GSM technology

text: In this paper, a novel technique for the fault detection, classification & protection of transmission lines is proposed. The proposed system uses different protective equipment's, voltage sense section, microcontroller section, LED display section & GSM (global system for mobile communication) module. The faults like all series (1LO, 2LO, 3LO etc.) & shunt faults (L-G, L-L, L-L-G, L-L-L, L-L-L-G) get detected & classified according to characteristics condition of current & voltage at the occurrence of fault in the three phase overhead lines. The sensed signals are given to microcontroller for detection & classification of faults. Also wireless mobile communication technique i.e. GSM is used simultaneously to send message to responsible person on mobile. Type of fault gets displayed on fault display section. Simultaneously fault gets interrupted using protective devices. (fuse, circuit breakers etc.)


title: Complete 3D Scene Parsing from an RGBD Image

text: One major goal of vision is to infer physical models of objects, surfaces, and their layout from sensors. In this paper, we aim to interpret indoor scenes from one RGBD image. Our representation encodes the layout of orthogonal walls and the extent of objects, modeled with CAD-like 3D shapes. We parse both the visible and occluded portions of the scene and all observable objects, producing a complete 3D parse. Such a scene interpretation is useful for robotics and visual reasoning, but difficult to produce due to the well-known challenge of segmentation, the high degree of occlusion, and the diversity of objects in indoor scenes. We take a data-driven approach, generating sets of potential object regions, matching to regions in training images, and transferring and aligning associated 3D models while encouraging fit to observations and spatial consistency. We use support inference to aid interpretation and propose a retrieval scheme that uses convolutional neural networks to classify regions and retrieve objects with similar shapes. We demonstrate the performance of our method on our newly annotated NYUd v2 dataset (Silberman et al., in: Computer vision-ECCV, 2012, pp 746–760, 2012) with detailed 3D shapes.


title: CertiCoq : A verified compiler for Coq

text: CertiCoq is a mechanically verified, optimizing compiler for Coq that bridges the gap between certified high-level programs and their translation to machine language. We outline its design as well as the main foundational and engineering challenges involved in building and certifying a compiler for Coq in Coq.


title: Compaction Management in Distributed Key-Value Datastores

text: Compactions are a vital maintenance mechanism used by datastores based on the log-structured merge-tree to counter the continuous buildup of data files under update-intensive workloads. While compactions help keep read latencies in check over the long run, this comes at the cost of significantly degraded read performance over the course of the compaction itself. In this paper, we offer an in-depth analysis of compaction-related performance overheads and propose techniques for their mitigation. We offload large, expensive compactions to a dedicated compaction server to allow the datastore server to better utilize its resources towards serving the actual workload. Moreover, since the newly compacted data is already cached in the compaction server’s main memory, we fetch this data over the network directly into the datastore server’s local cache, thereby avoiding the performance penalty of reading it back from the filesystem. In fact, pre-fetching the compacted data from the remote cache prior to switching the workload over to it can eliminate local cache misses altogether. Therefore, we implement a smarter warmup algorithm that ensures that all incoming read requests are served from the datastore server’s local cache even as it is warming up. We have integrated our solution into HBase, and using the YCSB and TPC-C benchmarks, we show that our approach significantly mitigates compaction-related performance problems. We also demonstrate the scalability of our solution by distributing compactions across multiple compaction servers.


title: Massively Parallel A* Search on a GPU

text: A* search is a fundamental topic in artificial intelligence. Recently, the general purpose computation on graphics processing units (GPGPU) has been widely used to accelerate numerous computational tasks. In this paper, we propose the first parallel variant of the A* search algorithm such that the search process of an agent can be accelerated by a single GPU processor in a massively parallel fashion. Our experiments have demonstrated that the GPU-accelerated A* search is efficient in solving multiple real-world search tasks, including combinatorial optimization problems, pathfinding and game solving. Compared to the traditional sequential CPU-based A* implementation, our GPU-based A* algorithm can achieve a significant speedup by up to 45x on largescale search problems.


title: Portable and Efficient Auto-vectorized Bytecode: a Look at the Interaction between Static and JIT Compilers

text: Heterogeneity is a confirmed trend of computing systems. Bytecode formats and just-in-time compilers have been proposed to deal with the diversity of the platforms. By hiding architectural details and giving software developers a unified view of the machine, they help improve portability and manage the complexity of large software. Independently, careful exploitation of SIMD instructions has become crucial for the performance of many applications. However, auto-vectorizing compilers need detailed information about the architectural features of the processor to generate efficient code. We propose to reconcile the use of architecture neutral bytecode formats with the need to generate highly efficient vectorized native code. We make three contributions. 1) We show that vectorized bytecode is a viable approach that can deliver portable performance in the presence of SIMD extensions, while incurring only minor penalty when SIMD is not supported. In other words, the information that a loop can be vectorized is the vectorized loop itself. 2) We analyze the interaction between the static and just-in-time compilers and we derive conditions to deliver performance. 3) We add vectorization capabilities to the CLI port of the GCC compiler.


title: Real-time 3D Walking Pattern Generation for a Biped Robot with Telescopic Legs

text: Meltran V, a new biped robot with telescopic legs, is introduced. For 3D walking control of the robot we analyze the dynamics of a three-dimensional inverted pendulum in which motion is constrained to move along an arbitrarily de ned plane. From this analysis we obtain simple linear dynamics, the ThreeDimensional Linear Inverted Pendulum Mode (3DLIPM). Using a real-time control method based on 3DLIPM, the Meltran V robot successfully demonstrated 3D dynamic walking without the use of any prepared trajectories.


title: Review on cyber-physical systems

text: Cyber-physical systems U+0028 CPS U+0029 are complex systems with organic integration and in-depth collaboration of computation, communications and control U+0028 3C U+0029 technology. Subject to the theory and technology of existing network systems and physical systems, the development of CPS is facing enormous challenges. This paper first introduces the concept and characteristics of CPS and analyzes the present situation of CPS researches. Then the development of CPS is discussed from perspectives of system model, information processing technology and software design. At last it analyzes the main obstacles and key researches in developing CPS.


title: {\Omega}-Net (Omega-Net): Fully Automatic, Multi-View Cardiac MR Detection, Orientation, and Segmentation with Deep Neural Networks

text: Pixelwise segmentation of the left ventricular (LV) myocardium and the four cardiac chambers in 2-D steady state free precession (SSFP) cine sequences is an essential preprocessing step for a wide range of analyses. Variability in contrast, appearance, orientation, and placement of the heart between patients, clinical views, scanners, and protocols makes fully automatic semantic segmentation a notoriously difficult problem. Here, we present Ω-Net (Omega-Net): a novel convolutional neural network (CNN) architecture for simultaneous localization, transformation into a canonical orientation, and semantic segmentation. First, an initial segmentation is performed on the input image; second, the features learned during this initial segmentation are used to predict the parameters needed to transform the input image into a canonical orientation; and third, a final segmentation is performed on the transformed image. In this work, Ω-Nets of varying depths were trained to detect five foreground classes in any of three clinical views (short axis, SA; four-chamber, 4C; two-chamber, 2C), without prior knowledge of the view being segmented. This constitutes a substantially more challenging problem compared with prior work. The architecture was trained on a cohort of patients with hypertrophic cardiomyopathy (HCM, N = 42) and healthy control subjects (N = 21). Network performance, as measured by weighted foreground intersection-over-union (IoU), was substantially improved for the best-performing Ω-Net compared with U-Net segmentation without localization or orientation (0.858 vs 0.834). In addition, to be comparable with other works, Ω-Net was retrained from scratch on the publicly available 2017 MICCAI Automated Cardiac Diagnosis Challenge (ACDC) dataset. The Ω-Net outperformed the state-of-the-art method in segmentation of the LV and RV bloodpools, and performed slightly worse in segmentation of the LV myocardium. We conclude that this architecture represents a substantive advancement over prior approaches, with implications for biomedical image segmentation more generally.


title: Two cases of hymenal scars occurred by child rape

text: Children who have been raped some years back may have hymenal scars. However, medical professionals are not accustomed in assessing these scars because of the lack of experience in performing physical examinations of the external genitalia of children who suffered from rape some years back. Moreover, the importance of physical examination of the victim's external genitalia is sometimes overlooked. Two cases of rape victims with hymenal scars who visited Daegu Child Sexual Abuse Response Center several years after their first sexual abuse along with a literature review are presented here.


title: Distributed Power Control for the Downlink of Multi-Cell NOMA Systems

text: This paper investigates the power control problem for the downlink of a multi-cell non-orthogonal multiple access system. The problem, called P-OPT, aims to minimize the total transmit power of all the base stations subject to the data rate requirements of the users. The feasibility and optimality properties of P-OPT are characterized through a related optimization problem, called Q-OPT, which is constituted by some relevant power control subproblems. First, we characterize the feasibility of Q-OPT and prove the uniqueness of its optimal solution. Next, we prove that the feasibility of P-OPT can be characterized by the Perron-Frobenius eigenvalues of the matrices arising from the power control subproblems. Subsequently, the relationship between the optimal solutions to P-OPT and that to Q-OPT is presented, which motivates us to obtain the optimal solution to P-OPT through solving the corresponding Q-OPT. Furthermore, a distributed algorithm to solve Q-OPT is designed, and the underlying iteration is shown to be a standard interference function. According to Yates’s power control framework, the algorithm always converges to the optimal solution if exists. Numerical results validate the convergence of the distributed algorithm and quantify the improvement of our proposed method over fractional transmit power control and orthogonal multiple access schemes in terms of power consumption and outage probability.


title: MANUFACTURE OF ARBITRARY CROSS-SECTION COMPOSITE HONEYCOMB CORES BASED ON ORIGAMI TECHNIQUES

text: In recent years, as space structures have become large and require higher accuracy, composite honeycombs, which can reduce weight and have low thermal expansion, are in increasing demand. As observed in the design of antenna reflectors and rocket bodies, both flat and 3D-shaped cores are used in this field. However, these special honeycombs have high manufacturing costs and limited applications. This study illustrates a new strategy to fabricate arbitrary cross-section honeycombs with applications of advanced composite materials. These types of honeycombs are usually manufactured from normal flat honeycombs by curving or carving, but the proposed method enables us to construct objective shaped honeycombs directly. The authors first introduce the concept of the kirigami honeycomb, which is made from single flat sheets and has periodical slits resembling origami. In previous studies, honeycombs having various shapes were made using this method, and were realized by only changing folding line diagrams (FLDs). In this study, these 3D kirigami honeycombs are generalized by numerical parameters and fabricated using a newly proposed FLD design method, which enables us to draw the FLD of arbitrary cross-section honeycombs. Next, the authors describe a method of applying this technique to advanced composite materials. Applying the partially soft composite techniques, folding lines are materialized by silicon rubber hinges on carbon fiber reinforced plastic. Complex FLD patterns are then printed using masks on carbon fabrics. Finally, these foldable composites that are cured in corrugated shapes in autoclaves are folded into honeycomb shapes, and some typical samples are shown with their FLDs. INTRODUCTION In the construction of aerospace components, lightweight, rigid, and strong honeycomb sandwich panels are required. In recent years, the use of composite materials has drastically increased in this field. In the case of sandwich panels, carbon fiber reinforced plastic (CFRP) face sheets are typically combined with an aluminum honeycomb. Currently, space structures are increasing in size and require greater degrees of accuracy; hence, the use of composites as a core material is a natural progression. It is promising for further reducing the weight of the body of satellites and enhancing the accuracy of their on-board equipment because of their low coefficients of thermal expansion (CTE). Furthermore, use of the same material for both the face sheet and the core prevents certain problems that would otherwise arise when combining materials that have different CTEs, such as CFRP-face aluminum honeycomb [1]. Various types of composite honeycombs [2-4] are commercially available, in addition to aluminum or nomex honeycombs. A comparable product is the CFRP honeycomb that has recently been used in antenna reflectors for high frequencies [5,6]. Other composites such as Kevlar honeycombs are also manufactured and used in floor panels of the latest airplane model. Quartz fiber, which has superior electrical properties has found the application in radome. 1 Copyright © 2013 by ASME DETC2013-12743 Proceedings of the ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference IDETC/CIE 2013 August 4-7, 2013, Portland, Oregon, USA Many studies on various types of core configurations that do not include hexagonal honeycombs have been reported. The main examples include lattice materials consisting of webs and struts [7-9]. Several configurations have already been proposed in this research area: octet-truss, the 2D and 3D Kagome structure, and the tetrahedral lattice. Square composite honeycombs, which are expected to show high in-plane stretching rigidity, have also been researched [10]. These square honeycombs are fabricated by assembling slotted rectangular composite sheets. The Z-fiber and X-Cor are truss structures that are fabricated by angled carbon fiber rods embedded in polymeric foam, and they are typical examples of composite sandwich panels [11] that have potential commercial applications. However, these composite core materials are not regularly used in sandwich construction. Compared to standard aluminum or nomex honeycombs, their manufacturing costs are very high and they have limited applications. Another problem is difficulty of machining. In the manufacture of complex-shaped parts, the cores must have some degree of curvature. For aluminum honeycombs, this can be done using a contour cutter, a 3-D tracer, and numerically controlled machines. However, burrs and buckling of cell walls present a difficult problem for surface accuracy. It is clear that the machining of composite cores requires more expensive and sophisticated systems. Realizing curvatures in honeycombs is also difficult because they deform a saddle shape when bent. It requires special cell shapes such as flexcore [2] or cells having auxetic behavior [12,13] for a large and accurate curvature. This study proposes a novel method to construct arbitrary cross-section composite honeycombs. The basic idea originates from the fold-made paper honeycombs proposed by Nojima and Saito in 2007 [14], in which they attempted to apply origami and kirigami techniques to the creation of sandwich structures. Origami is the traditional Japanese art of paper folding and has received widespread attention from artists, architects, and mathematicians. Kirigami is a variation of origami. While traditional origami prohibits the cutting of paper, it is permissible in kirigami. Kirigami artists create remarkable patterns on paper using a combination of cutting and folding. Figure 1 shows the basic concept of kirigami (or origami) honeycombs. The advantage of this method is that it can be extended to manufacture 3D (non-flat) honeycomb. This is achieved only by changing the folding line patterns. Some paper samples and their folding line diagrams (FLDs) are shown in Fig. 2. However, these previous studies [14] have not included non-convex-shaped cross-sections. Because of geometrical restrictions, their FLDs cannot be drawn on single sheets of flat paper. Generalized FLD design methods have also remained a challenge. In this study, these 3D kirigami honeycombs are generalized by numerical parameters, and a new FLD design method is devised. This study also includes non-convex-shaped crosssections that have not been possible to realize in previous studies. The outline of the paper is as follows. First, the design method of the FLD is devised. This involves the calculation of the position of the folding lines and slits from given crosssectional shapes. The second part describes the condition pertaining to foldability and propose a modified method for unfoldable cross-sections. This approach enabled us to fold arbitrary cross-section honeycombs (including non-convex honeycombs) by folding single sheets. The third part describes a method of applying this technique to advanced composite materials. As an exapmle of kirigami composite honeycombs, a wingbox was already manufactured in autoclave-cured woven Kevlar fabric using the FLD around an airfoil profile[15]. In Ref.15, a dashed line cutting is used on a folding line. This study proposes a new method to introduce folding lines on CFRP; Silicon rubber is used as the matrix for hinge areas. Finally, these foldable composites that are cured in corrugated shapes in autoclaves are folded into honeycomb shapes, and some typical samples are shown with their FLDs. Fig. 1 Concept of kirigami honeycomb core. (a) Basic folding lines diagram. Thick lines: Slits. Fine lines: mountain folding lines. Dashed lines: valley folding lines. (b)–(d) The folding process for realizing a honeycomb shape. Fig. 2 Examples of 3D folded honeycombs and their folding line diagrams (FLDs). Upper: Tapered honeycomb. Lower: Convex curved honeycomb. Black lines and areas: Slits or cutouts. Gray lines: Folding lines. (a) (d) c'


title: Software-based resolver-to-digital converter using the PLL tracking algorithm

text: In this paper, an all-digital resolver-to-digital conversion (RDC) system using phase-locked loop (PLL) tracking algorithm is proposed. Excitation signal is obtained from PWM module of a TMS320F2812 digital signal processor (DSP). According to the excitation signal, the resolver outputs differential sine and cosine signals, which are sampled by a 16-bit peripheral AD7606 module. The rotor angle position is estimated with the PLL tracking algorithm based on DSP. The proposed RDC system is applied to a servo synchronous motor with a resolver coupled to the shaft, and the electrical error of the resolver is ±10'. Finally, responding simulations and experiments are carried out. The results demonstrate that the RDC system has the features with simple hardware structure and low cost, and high-precision resolver-to-digital conversion is achieved.


title: Adopting the Cognitive Complexity Measure for Business Process Models

text: Business process models, often modelled using graphical languages like UML, serve as a base for communication between the stakeholders in the software development process. To fulfil this purpose, they should be easy to understand and easy to maintain. For this reason, it is useful to have measures that can give us some information about understandability, analyzability and maintainability of a business process model. Shao and Wang (2003) have proposed a cognitive complexity measure. It can be used to estimate the comprehension effort for understanding software. This paper discusses how these research results can be extended in order to analyze the cognitive complexity of graphical business process models


title: Challenges in Exploiting Conversational Memory in Human-Agent Interaction

text: In human interactions, language is used to project and maintain a social identity over time. The way people speak with others and revisit language across repeated interactions helps to create rapport and develop a feeling of coordination between conversational partners. Memory of past conversations is the main mechanism that allows us to exploit and explore ways of speaking, given knowledge acquired in previous encounters. As such, we introduce an agent that uses its conversational memory to revisit shared history with users to maintain a coherent social relationship over time. In this paper, we describe the dialog management mechanisms to achieve these goals when applied to a robot that engages in social chit-chat. In a study lasting 14 days with 28 users, totaling 474 interactions, we find that it is difficult to leverage the shared history with individual users and to also accommodate to expected conversational coordination patterns. We discuss the implications of this finding for long-term human-agent interaction. In particular, we highlight the importance of topic modeling and signaling explicit recall of previous episodes. Moreover, the way that users contribute to interactions requires additional adaptation, indicating a significant challenge for language interaction designers.


title: Are leader stereotypes masculine? A meta-analysis of three research paradigms.

text: This meta-analysis examined the extent to which stereotypes of leaders are culturally masculine. The primary studies fit into 1 of 3 paradigms: (a) In Schein's (1973) think manager-think male paradigm, 40 studies with 51 effect sizes compared the similarity of male and leader stereotypes and the similarity of female and leader stereotypes; (b) in Powell and Butterfield's (1979) agency-communion paradigm, 22 studies with 47 effect sizes compared stereotypes of leaders' agency and communion; and (c) in Shinar's (1975) masculinity-femininity paradigm, 7 studies with 101 effect sizes represented stereotypes of leadership-related occupations on a single masculinity-femininity dimension. Analyses implemented appropriate random and mixed effects models. All 3 paradigms demonstrated overall masculinity of leader stereotypes: (a) In the think manager-think male paradigm, intraclass correlation = .25 for the women-leaders similarity and intraclass correlation = .62 for the men-leaders similarity; (b) in the agency-communion paradigm, g = 1.55, indicating greater agency than communion; and (c) in the masculinity-femininity paradigm, g = 0.92, indicating greater masculinity than the androgynous scale midpoint. Subgroup and meta-regression analyses indicated that this masculine construal of leadership has decreased over time and was greater for male than female research participants. In addition, stereotypes portrayed leaders as less masculine in educational organizations than in other domains and in moderate- than in high-status leader roles. This article considers the relation of these findings to Eagly and Karau's (2002) role congruity theory, which proposed contextual influences on the incongruity between stereotypes of women and leaders. The implications for prejudice against women leaders are also considered.


title: Design and Characterization of Miniaturized Patch Antennas Loaded With Complementary Split-Ring Resonators

text: An investigation into the design of compact patch antennas loaded with complementary split-ring resonators (CSRRs) and reactive impedance surface (RIS) is presented in this study. The CSRR is incorporated on the patch as a shunt LC resonator providing a low resonance frequency and the RIS is realized using the two-dimensional metallic patches printed on a metal-grounded substrate. Both the meta-resonator (CSRR) and the meta-surface (RIS) are able to miniaturize the antenna size. By changing the configuration of the CSRRs, multi-band operation with varied polarization states can be obtained. An equivalent circuit has been developed for the CSRR-loaded patch antennas to illustrate their working principles. Six antennas with different features are designed and compared, including a circularly-polarized antenna, which validate their versatility for practical applications. These antennas are fabricated and tested. The measured results are in good agreement with the simulation.


title: Semi-Supervised Neural Machine Translation with Language Models

text: Training neural machine translation models is notoriously slow and requires abundant parallel corpora and computational power. In this work we propose an approach of transferring knowledge from separately trained language models to translation systems, also we investigate several techniques to improve translation quality when there is a lack of parallel data and computational resources. Our method is based on fusion between translation system and language model, and initialization of translation system with weights from pretrained language models. We show that this technique gives +2.2 BLEU score on En–Fr pair of WMT europarl-7 dataset and allows us to reach 20.7 BLEU on 20k parallel sentences in less than 8 hours of training on a single NVIDIA GeForce GTX 1080 Ti. We specifically note, that for this advance we use nothing but monolingual corpora for source and target languages. Significant part of presented results was obtained during DeepHack.Babel hackathon on low-resource machine translation organized by iPavlov Lab.


title: Non-specific effects of methylphenidate (Ritalin) on cognitive ability and decision-making of ADHD and healthy adults

text: The effect of a single dose of methylphenidate (MPH) on cognitive measures and decision-making processes was assessed in a sample of adults with ADHD and in a control sample. Thirty-two adults satisfying DSM-IV criteria for ADHD and 26 healthy controls performed several cognitive tasks. Half of the participants received MPH prior to performing the tasks, and the other half received placebo in a randomized, double-blind manner. The average digit-span test score was higher in the groups receiving MPH compared to the groups receiving placebo, while diagnosis did not have an effect upon scores. In decision-making tasks, however, MPH did not have an effect upon performance, whereas in one of the tasks the average proportion of risky choices was higher in ADHD adults compared to controls. Our data therefore demonstrates that (a) MPH is capable of enhancing specific aspects of cognitive performance and (b) this enhancement is not specific to ADHD.


title: Evaluating Window Joins over Unbounded Streams

text: We investigate algorithms for evaluating sliding window joins over pairs of unbounded streams. We introduce a unittime-basis cost model to analyze the expected performance of these algorithms. Using this cost model, we propose strategies for maximizing the efficiency of processing joins in three scenarios. First, we consider the case where one stream is much faster than the other. We show that asymmetric combinations of join algorithms, (e.g., hash join on one input, nested-loops join on the other) can outperform symmetric join algorithm implementations. Second, we investigate the case where system resources are insufficient to keep up with the input streams. We show that we can maximize the number of join result tuples produced in this case by properly allocating computing resources across the two input streams. Finally, we investigate strategies for maximizing the number of result tuples produced when memory is limited, and show that proper memory allocation across the two input streams can result in significantly lower resource usage and/or more result tuples produced.


title: Reconfigurable Multiband Antenna Designs for Wireless Communication Devices

text: New designs for compact reconfigurable antennas are introduced for mobile communication devices. The uniqueness of the antenna designs are that they allow various groups of their operating frequency bands to be selected electronically. In particular, each group of frequency bands, or mode, can be made to serve several different communication systems simultaneously. These systems may include various combinations of GSM, DCS, PCS, UMTS, Bluetooth, and wireless local-area network (LAN). Therefore, by electronically selecting different antenna modes, a variety of communication systems can be conveniently served by only one antenna. One advantage is that through the different operational modes, the total antenna volume can be reused, and therefore the overall antenna can be made compact. In these designs, the selection of the different modes is achieved by either i) switching different feeding locations of the antenna (switched feed) or ii) switching or breaking of the antenna's connection to the ground (switched ground). This paper demonstrates these two designs. For the first design of switched feed, it can support GSM, DCS, PCS, and UMTS. In the second design, the antenna makes use of a switched-ground technique, which can cover GSM, DCS, PCS, UMTS, Bluetooth, and 2.4 GHz wireless LAN. The designs are investigated when ideal switches and also various realistic active switches based on PIN diodes, GaAs field effect transistor, and MEMs configurations. The designs are verified through both numerical simulations and measurement of an experimental prototype. The results confirm good performance of the two multiband reconfigurable antenna designs.


title: An Efficient Multiplication Algorithm Using Nikhilam Method

text: Multiplication is one of the most important operation in computer arithmetic. Many integer operations such as squaring, division and computing reciprocal require same order of time as multiplication whereas some other operations such as computing GCD and residue operation require at most a factor of logn time more than multiplication. We propose an integer multiplication algorithm using Nikhilam method of Vedic mathematics which can be used to multiply two binary numbers efficiently.


title: Comparison of eSports and Traditional Sports Consumption Motives

text: With recognition of the need for studying eSports in this interactive digital communication era, this study explored 14 motivational factors affecting the time spent on eSports gaming. Using a sample of 515 college students and athletic event attendees, we further compared eSports game patterns to their non-eSport or traditional sport involvements (game participation, game attendance, sports viewership, sports readership, sports listenership, Internet usage specific to sports, and purchase of team merchandise). Multiple regression results indicated that competition and skill had a statistically significant impact on the time spent on eSports games while peer pressure had marginal significance. Related to the overall findings, developing tailored messages that drives consumption behaviors of target audiences to specific eSports games will provide a better chance for marketers to fulfill their strategic goals of increased purchasing and larger market shares. Understanding that the interest in competition and skill are critical to eSports gamers may influence marketers to focus on creating games and opportunities for gamers to compete against each other and give tangible rewards to the winner. The use of peer pressure may be another motivational factor for playing. Consequently, those marketing dollars could be spent more on the interactive nature of game design. The subsequent analysis on cross-validation check suggests that the results of the regression analysis could be generalized.


title: Protocols for Public Key Cryptosystems

text: New Cryptographic protocols which take full advantage of the unique properties of public key cryptosystems are now evolving. Several protocols for public key distribution and for digital signatures are briefly compared with each other and with the conventional alternative.


title: Friends and neighbors on the Web

text: The Internet has become a rich and large repository of information about us as individuals. Anything from the links and text on a user's homepage to the mailing lists the user subscribes to are reflections of social interactions a user has in the real world. In this paper we devise techniques to mine this information in order to predict relationships between individuals. Further we show that some pieces of information are better indicators of social connections than others, and that these indicators vary between user populations and provide a glimpse into the social lives of individuals in different communities. Our techniques provide potential applications in automatically inferring real-world connections and discovering, labeling, and characterizing communities.


title: Consumer Decision Making in Online Shopping Environments: The Effects of Interactive Decision Aids

text: Despite the explosive growth of electronic commerce and the rapidly increasing number of consumers who use interactive media (such as the World Wide Web) for prepurchase information search and online shopping, very little is known about how consumers make purchase decisions in such settings. A unique characteristic of online shopping environments is that they allow vendors to create retail interfaces with highly interactive features. One desirable form of interactivity from a consumer perspective is the implementation of sophisticated tools to assist shoppers in their purchase decisions by customizing the electronic shopping environment to their individual preferences. The availability of such tools, which we refer to as interactive decision aids for consumers, may lead to a transformation of the way in which shoppers search for product information and make purchase decisions. The primary objective of this paper is to investigate the nature of the effects that interactive decision aids may have on consumer decision making in online shopping environments. While making purchase decisions, consumers are often unable to evaluate all available alternatives in great depth and, thus, tend to use two-stage processes to reach their decisions. At the first stage, consumers typically screen a large set of available products and identify a subset of the most promising alternatives. Subsequently, they evaluate the latter in more depth, perform relative comparisons across products on important attributes, and make a purchase decision. Given the different tasks to be performed in such a two-stage process, interactive tools that provide support to consumers in the following respects are particularly valuable: (1) the initial screening of available products to determine which ones are worth considering further, and (2) the in-depth comparison of selected products before making the actual purchase decision. This paper examines the effects of two decision aids, each designed to assist consumers in performing one of the above tasks, on purchase decision making in an online store. The first interactive tool, a recommendation agent (RA), allows consumers to more efficiently screen the (potentially very large) set of alternatives available in an online shopping environment. Based on self-explicated information about a consumer’s own utility function (attribute importance weights and minimum acceptable attribute levels), the RA generates a personalized list of recommended alternatives. The second decision aid, a comparison matrix (CM), is designed to help consumers make in-depth comparisons among selected alternatives. The CM allows consumers to organize attribute information about multiple products in an alternatives attributes matrix and to have alternatives sorted by any attribute. Based on theoretical and empirical work in marketing, judgment and decision making, psychology, and decision support systems, we develop a set of hypotheses pertaining to the effects of these two decision aids on various aspects of consumer decision making. In particular, we focus on how use of the RA and CM affects consumers’ search for product information, the size and quality of their consideration sets, and the quality of their purchase decisions in an online shopping environment. A controlled experiment using a simulated online store was conducted to test the hypotheses. The results indicate that both interactive decision aids have a substantial impact on consumer decision making. As predicted, use of the RA reduces consumers’ search effort for product information, decreases the size but increases the quality of their consideration sets, and improves the quality of their purchase decisions. Use of the CM also leads to a decrease in the size but an increase in the quality of consumers’ consideration sets, and has a favorable effect on some indicators of decision quality. In sum, our findings suggest that interactive tools designed to assist consumers in the initial screening of available alternatives and to facilitate in-depth comparisons among selected alternatives in an online shopping environment may have strong favorable effects on both the quality and the efficiency of purchase decisions—shoppers can make much better decisions while expending substantially less effort. This suggests that interactive decision aids have the potential to drastically transform the way in which consumers search for product information and make purchase decisions. (Decision Making; Online Shopping; Electronic Commerce; Decision Aids; Recommendation Agents; Consumer Behavior; Information Search; Consideration Sets; Information Processing)


title: Efficient identification of Web communities

text: "# %$& $' & )(*$' $+ , .-/ 0 %1 !23 3 45$768 3 + 91: 1 3 ;< * ="> 1 $? )(> 0 % +@ 3 A % B C @ ="> 1 $ D*EA ="> 91 $F %(:$' G H % = @ I . % A"> * J 3 K 2 L K . 3 = & ,M 3 ON . QP 3 @ R S(T1G % 9 ! %1 4>U) 7 1 V W$' 1 ! 3$? X> %$' . Y %( 45 , 7 ="> 1 $ U% % :$' L 4Y $' L$Z $V %( ! 232 @[4 . 7 + % @[ ="> 91 $ D \ (] K $' . A 91G . 723 17 ) 0 1G 723$7 = Y M . X C . ) A )X X 1 ,M @ & , ^ 3 & ="> 91 $' 3XA"K A % _% K 3 _= ^_%1G %X B 3 @ ="K ` ! 1G 72 7 23 3 45$< ^ *-5 1' %2 $' 3 4Y 5 Dba! c 9(T@ (T 3-/ $'$7 %(< * %X X 1 .M 3 & ) 3 A %23_ )1 3 d L$c $Z '1G ) . 7 R$' -/ 1G )2* 1G 72*1 $' 23 $C ) C L K (T e " $ UF % %1 3 $ U : "A1 3 _%$ U ) A ) 1723 3 4 %X> 23 _% L $f , c )1 ^ $' (] 2g" 7 ) %$' 32 A . , _ )1 3h . iD \ X X 23 3 . ) 3 % $7 %(< % 1c )X X 1 % G A 3 2L F(T %@ $' . A 91G . 723 1 $F % C$' . ,1 9 B _ 3 $ U> % & , L ^X> %X 2j , 3 )( X> )1' G %2g . ) _% %1 3 $ Uk ) L X 1 ,-/ . 2 1 3 _ D Categories and Subject Descriptors l`D m5D n o pCq r q sSq t u vQq wSq x u yzu wir9{[|i}^ , G %" %$' \ X X 2L 3 . , 3 $I~  %[F=] ]5  l D 5D ^o  wg  %yzq r.T>wzir  ,q x u`q w?A&u5r )Tu5 q j{|  (T %1 & ) 3 % 5 . )1 G % f 9 '1 L )2 ~  5  99]K%^].  %9+%8 % ¡   99T5 5¢ D m5D m o pATt.£ ,u r u vQq r ¤Su yzq r.T£/t {| ¢ 1G %X =a! %1' K~ >98¥W % ¦^§ ' / ̈  9


title: Reducing Buyer Search Costs : Implications for Electronic Marketplaces

text: Information systems can serve as intermediaries between the buyers and the sellers in a market, creating an “electronic marketplace” that lowers the buyers' cost to acquire information about seller prices and product offerings. As a result, electronic marketplaces reduce the inefficiencies caused by buyer search costs, in the process reducing the ability of sellers to extract monopolistic profits while increasing the ability of markets to optimally allocate productive resources. This article models the role of buyer search costs in markets with differentiated product offerings. The impact of reducing these search costs is analyzed in the context of an electronic marketplace, and the allocational efficiencies such a reduction can bring to a differentiated market are formalized. The resulting implications for the incentives of buyers, sellers and independent intermediaries to invest in electronic marketplaces are explored. Finally, the possibility to separate price information from product attribute information is introduced, and the implications of designing markets promoting competition along each of these dimensions are discussed. Copyright © 1997 by The Institute of Management Sciences


title: Learning Probabilistic Models of Link Structure

text: Most real-world data is heterogeneous and richly interconnected. Examples include the Web, hypertext, bibliometric data and social networks. In contrast, most statistical learning methods work with “flat” data representations, forcing us to convert our data into a form that loses much of the link structure. The recently introduced framework of probabilistic relational models(PRMs) embraces the object-relational nature of structured data by capturing probabilistic interactions between attributes of related entities. In this paper, we extend this framework by modeling interactions between the attributes and the link structure itself. An advantage of our approach is a unified generative model for both content and relational structure. We propose two mechanisms for representing a probabilistic distribution over link structures: reference uncertaintyandexistence uncertainty . We describe the appropriate conditions for using each model and present learning algorithms for each. We present experimental results showing that the learned models can be used to predict link structure and, moreover, the observed link structure can be used to provide better predictions for the attributes in the model.


title: A 2.1 MHz Crystal Oscillator Time Base with a Current Consumption under 500 nA

text: A micro-power circuit is encapsulated with a 2.1 MHz ZT-cut quartz in a vacuum package. The oscillator core has 2 complementary active MOSFETS and amplitude stabilization. New coupling and biasing circuits, and dynamic frequency dividers allow to achieve ±2 ppm frequency stability down to 1.8 V with a current under 0.5 ¿A.


title: Partial Image Encryption based on Block wise Shuffling using Arnold Map

text: To prevent image from unauthorized access, Encryption techniques of digital images play a very important role . The Fully image encryption techniques is very complex in nature and takes a lot of computational time. But, certain applications do not require total encryption; it requires a part of the multimedia data to be transparent to all users, like Pay-TV or Payable Internet Imaging Albums which involves encrypting the most meaningful parts of an image. In this paper we focus on a partial image encryption technique based on block wise shuffling with the help of Arnold map . Firstly image is divided into blocks then Blocks within the image are permuted by using Arnold map and final permuted block are combined that yields partial encrypted images . This process is repeated for different block size. The PSNR and NPCR obtained by our technique shows that the proposed technique gives better result than the existing techniques.


title: Solid lipid nanoparticles: production, characterization and applications.

text: Solid lipid nanoparticles (SLN) have attracted increasing attention during recent years. This paper presents an overview about the selection of the ingredients, different ways of SLN production and SLN applications. Aspects of SLN stability and possibilities of SLN stabilization by lyophilization and spray drying are discussed. Special attention is paid to the relation between drug incorporation and the complexity of SLN dispersions, which includes the presence of alternative colloidal structures (liposomes, micelles, drug nanosuspensions, mixed micelles, liquid crystals) and the physical state of the lipid (supercooled melts, different lipid modifications). Appropriate analytical methods are needed for the characterization of SLN. The use of several analytical techniques is a necessity. Alternative structures and dynamic phenomena on the molecular level have to be considered. Aspects of SLN administration and the in vivo fate of the carrier are discussed.


title: School-based interventions for aggressive and disruptive behavior: update of a meta-analysis.

text:
BACKGROUND
Research about the effectiveness of school-based psychosocial prevention programs for reducing aggressive and disruptive behavior was synthesized using meta-analysis. This work updated previous work by the authors and further investigated which program and student characteristics were associated with the most positive outcomes.

METHODS
Two hundred forty-nine experimental and quasi-experimental studies of school-based programs with outcomes representing aggressive and/or disruptive behavior were obtained. Effect sizes and study characteristics were coded from these studies and analyzed.

RESULTS
Positive overall intervention effects were found on aggressive and disruptive behavior and other relevant outcomes. The most common and most effective approaches were universal programs and targeted programs for selected/indicated children. The mean effect sizes for these types of programs represent a decrease in aggressive/disruptive behavior that is likely to be of practical significance to schools. Multicomponent comprehensive programs did not show significant effects and those for special schools or classrooms were marginal. Different treatment modalities (e.g., behavioral, cognitive, social skills) produced largely similar effects. Effects were larger for better-implemented programs and those involving students at higher risk for aggressive behavior.

CONCLUSIONS
Schools seeking prevention programs may choose from a range of effective programs with some confidence that whatever they pick will be effective. Without the researcher involvement that characterizes the great majority of programs in this meta-analysis, schools might be well-advised to give priority to those that will be easiest to implement well in their settings.


title: The Dark Side(-Channel) of Mobile Devices: A Survey on Network Traffic Analysis

text: In recent years, mobile devices (e.g., smartphones and tablets) have met an increasing commercial success and have become a fundamental element of the everyday life for billions of people all around the world. Mobile devices are used not only for traditional communication activities (e.g., voice calls and messages) but also for more advanced tasks made possible by an enormous amount of multi-purpose applications (e.g., finance, gaming, and shopping). As a result, those devices generate a significant network traffic (a consistent part of the overall Internet traffic). For this reason, the research community has been investigating security and privacy issues that are related to the network traffic generated by mobile devices, which could be analyzed to obtain information useful for a variety of goals (ranging from fine-grained user profiling to device security and network optimization). In this paper, we review the works that contributed to the state of the art of network traffic analysis targeting mobile devices. In particular, we present a systematic classification of the works in the literature according to three criteria: 1) the goal of the analysis; 2) the point where the network traffic is captured; and 3) the targeted mobile platforms. In this survey, we consider points of capturing such as Wi-Fi access points, software simulation, and inside real mobile devices or emulators. For the surveyed works, we review and compare analysis techniques, validation methods, and achieved results. We also discuss possible countermeasures, challenges, and possible directions for future research on mobile traffic analysis and other emerging domains (e.g., Internet of Things). We believe our survey will be a reference work for researchers and practitioners in this research field.


title: Proportions of Hand Segments

text: Such investigation methods as thermography or isotope scanning allow visualizing inflammation, neoplastic and some other pathological processes, and their location in the body. But the knowledge of regional topography is necessary for exact localization of the process. Such external anatomical landmarks of the hand as bone prominences and creases help to localize its joints and other structures during the clinical examination. On X-ray pictures, MRIs and CT images or during ultrasonography, anatomical structures are well visualized and their localization is not a problem. However, thermography and isotope scanning allow us to see only the shape and outlines of the anatomical region. So the identification of anatomical structures, particularly hand joints, on thermograms and bone scans is often difficult.


title: Removing rolling shutter wobble

text: We present an algorithm to remove wobble artifacts from a video captured with a rolling shutter camera undergoing large accelerations or jitter. We show how estimating the rapid motion of the camera can be posed as a temporal super-resolution problem. The low-frequency measurements are the motions of pixels from one frame to the next. These measurements are modeled as temporal integrals of the underlying high-frequency jitter of the camera. The estimated high-frequency motion of the camera is then used to re-render the sequence as though all the pixels in each frame were imaged at the same time. We also present an auto-calibration algorithm that can estimate the time between the capture of subsequent rows in the camera.


title: A Multi-ESD-Path Low-Noise Amplifier With a 4.3-A TLP Current Level in 65-nm CMOS

text: This paper studies the electrostatic discharge (ESD)-protected RF low-noise amplifiers (LNAs) in 65-nm CMOS technology. Three different ESD designs, including double-diode, modified silicon-controlled rectifier (SCR), and modified-SCR with double-diode configurations, are employed to realize ESD-protected LNAs at 5.8 GHz. By using the modified-SCR in conjunction with double-diode, a 5.8-GHz LNA with multiple ESD current paths demonstrates a 4.3-A transmission line pulse (TLP) failure level, corresponding to a ~ 6.5-kV Human-Body-Mode (HBM) ESD protection level. Under a supply voltage of 1.2 V and a drain current of 6.5 mA, the proposed ESD-protected LNA demonstrates a noise figure of 2.57 dB with an associated power gain of 16.7 dB. The input third-order intercept point (IIP3) is - 11 dBm, the input and output return losses are greater than 15.9 and 20 dB, respectively.


title: High-performance carbon nanotube field-effect transistor with tunable polarities

text: State-of-the-art carbon nanotube field-effect transistors (CNFETs) behave as Schottky-barrier-modulated transistors. It is known that vertical scaling of the gate oxide significantly improves the performance of these devices. However, decreasing the oxide thickness also results in pronounced ambipolar transistor characteristics and increased drain leakage currents. Using a novel device concept, we have fabricated high-performance enhancement-mode CNFETs exhibiting n- or p-type unipolar behavior, tunable by electrostatic and/or chemical doping, with excellent OFF-state performance and a steep subthreshold swing (S=63 mV/dec). The device design allows for aggressive oxide thickness and gate-length scaling while maintaining the desired device characteristics.


title: Reduced Number of Hypocretin Neurons in Human Narcolepsy

text: Murine and canine narcolepsy can be caused by mutations of the hypocretin (Hcrt) (orexin) precursor or Hcrt receptor genes. In contrast to these animal models, most human narcolepsy is not familial, is discordant in identical twins, and has not been linked to mutations of the Hcrt system. Thus, the cause of human narcolepsy remains unknown. Here we show that human narcoleptics have an 85%-95% reduction in the number of Hcrt neurons. Melanin-concentrating hormone (MCH) neurons, which are intermixed with Hcrt cells in the normal brain, are not reduced in number, indicating that cell loss is relatively specific for Hcrt neurons. The presence of gliosis in the hypocretin cell region is consistent with a degenerative process being the cause of the Hcrt cell loss in narcolepsy.


title: Enhancing Reliability of Workflow Execution Using Task Replication and Spot Instances

text: Cloud environments offer low-cost computing resources as a subscription-based service. These resources are elastically scalable and dynamically provisioned. Furthermore, cloud providers have also pioneered new pricing models like spot instances that are cost-effective. As a result, scientific workflows are increasingly adopting cloud computing. However, spot instances are terminated when the market price exceeds the users bid price. Likewise, cloud is not a utopian environment. Failures are inevitable in such large complex distributed systems. It is also well studied that cloud resources experience fluctuations in the delivered performance. These challenges make fault tolerance an important criterion in workflow scheduling. This article presents an adaptive, just-in-time scheduling algorithm for scientific workflows. This algorithm judiciously uses both spot and on-demand instances to reduce cost and provide fault tolerance. The proposed scheduling algorithm also consolidates resources to further minimize execution time and cost. Extensive simulations show that the proposed heuristics are fault tolerant and are effective, especially under short deadlines, providing robust schedules with minimal makespan and cost.


title: Automatic Tongue Diagnosis Using a Smart Phone

text: An automatic tongue diagnosis framework is proposed to analyzing tongue images taken by smart phones. Different from conventional tongue diagnosis systems, our input tongue images are usually in low resolution and taken under unknown lighting conditions. Consequently, existing tongue diagnosis methods cannot be directly applied to give accurate results. We propose a lighting condition estimation method based on the SVM classifier to predict the color correction matrix according to color difference of images taken with and without flashlight. We also modify the state of the art work of fur and fissure detection and successfully improve the detection accuracy by taking hue information into consideration and adding a de-noising step.


title: Visual scanning of faces in autism.

text: The visual scanpaths of five high-functioning adult autistic males and five adult male controls were recorded using an infrared corneal reflection technique as they viewed photographs of human faces. Analyses of the scanpath data revealed marked differences in the scanpaths of the two groups. The autistic participants viewed nonfeature areas of the faces significantly more often and core feature areas of the faces (i.e., eyes, nose, and mouth) significantly less often than did control participants. Across both groups of participants, scanpaths generally did not differ as a function of the instructions given to the participants (i.e., "Please look at the faces in any manner you wish." vs. "Please identify the emotions portrayed in these faces."). Autistic participants showed a deficit in emotion recognition, but this effect was driven primarily by deficits in the recognition of fear. Collectively, these results indicate disorganized processing of face stimuli in autistic individuals and suggest a mechanism that may subserve the social information processing deficits that characterize autism spectrum disorders.


title: Adaptive block truncation filter for MVC depth image enhancement

text: In Multiview Video plus Depth (MVD) format, virtual views are generated from decoded texture videos with decoded depth images through Depth Image based Rendering (DIBR). 3DV-ATM is a reference model for H.264/AVC based Multiview Video Coding (MVC) and aims at achieving high coding efficiency for 3D video in MVD format. Depth images are first downsampled then coded by 3DV-ATM. However, sharp object boundary characteristic of depth images does not well match with the transform coding of 3DV-ATM. Depth boundaries are often blurred with ringing artifacts in the decoded depth images that result in noticeable artifacts in synthesized views. This paper presents a low complexity adaptive block truncation filter to recover the sharp object boundaries of depth images using adaptive block repositioning and expansion for increasing the depth values refinement accuracy. This new approach is very efficient and can avoid false depth boundary refinement when block boundaries lie around the depth edge regions and ensure sufficient information within the processing block for depth layers classification. Experimental results show that sharp depth edges can be recovered using the proposed filter and boundary artifacts in the synthesized views can be removed. The proposed method can provide improvement up to 3.25dB in the depth map enhancement and bitrate reduction of 3.06% in the synthesized views.


title: A novel topology design approach using an integrated deep learning network architecture

text: Topology design optimization offers tremendous oppo rtunity in design and manufacturing freedoms by designing and producing a part from the ground-up without a meaningful initial design as required by conventional shape design opt imization approaches. Ideally, with adequate problem statements, to formulate and solve the topo logy design problem using a standard topology optimization process, such as SIMP (Simpli fied Isotropic Material with Penalization) is possible. In reality, an estimated over thousands o f design iterations is often required for just a few design variables, the conventional optimization approach is in general impractical or computationally unachievable for real world applica tions significantly diluting the development of the topology optimization technology. There is, therefore, a need for a different approach that will be able to optimize the initial design topolog y effectively and rapidly. Therefore, this work presents a new topology design procedure to generat e optimal structures using an integrated Generative Adversarial Networks (GANs) and convolut i nal neural network architecture. The discriminator in the GANs as well as the convolutio nal network are initially trained through the dataset of 3024 true optimized planner structure im ages generated from a conventional topology design approach (SIMP). The convolutional network m aps the optimized structure to the volume fraction, penalty and radius of the smoothening fil ter. Once the GAN is trained, the generator produced a large number of new unseen structures sa ti fying the design requirements. The corresponding input variables of these new structur es can be evaluated using the trained convolutional network. The structures generated by the GANs are also minutely post-processed to aberrations. Validation of the results is made b y generating the images with same conditions using existing topology optimization algorithms. T his paper presents a proof of concept which 1 Corresponding Author, email: shen.1@osu.edu


title: Networks and the Epidemiology of Infectious Disease

text: The science of networks has revolutionised research into the dynamics of interacting elements. It could be argued that epidemiology in particular has embraced the potential of network theory more than any other discipline. Here we review the growing body of research concerning the spread of infectious diseases on networks, focusing on the interplay between network theory and epidemiology. The review is split into four main sections, which examine: the types of network relevant to epidemiology; the multitude of ways these networks can be characterised; the statistical methods that can be applied to infer the epidemiological parameters on a realised network; and finally simulation and analytical methods to determine epidemic dynamics on a given network. Given the breadth of areas covered and the ever-expanding number of publications, a comprehensive review of all work is impossible. Instead, we provide a personalised overview into the areas of network epidemiology that have seen the greatest progress in recent years or have the greatest potential to provide novel insights. As such, considerable importance is placed on analytical approaches and statistical methods which are both rapidly expanding fields. Throughout this review we restrict our attention to epidemiological issues.


title: Exploiting Visibility Information in Surface Reconstruction to Preserve Weakly Supported Surfaces

text: We present a novel method for 3D surface reconstruction from an input cloud of 3D points augmented with visibility information. We observe that it is possible to reconstruct surfaces that do not contain input points. Instead of modeling the surface from input points, we model free space from visibility information of the input points. The complement of the modeled free space is considered full space. The surface occurs at interface between the free and the full space. We show that under certain conditions a part of the full space surrounded by the free space must contain a real object also when the real object does not contain any input points; that is, an occluder reveals itself through occlusion. Our key contribution is the proposal of a new interface classifier that can also detect the occluder interface just from the visibility of input points. We use the interface classifier to modify the state-of-the-art surface reconstruction method so that it gains the ability to reconstruct weakly supported surfaces. We evaluate proposed method on datasets augmented with different levels of noise, undersampling, and amount of outliers. We show that the proposed method outperforms other methods in accuracy and ability to reconstruct weakly supported surfaces.


title: Zero-Knowledge Proof of Decryption for FHE Ciphertexts

text: Zero-knowledge proofs of knowledge and fully-homomorphic encryption are two areas that have seen considerable advances in recent years, and these two techniques are used in conjunction in the context of verifiable decryption. Existing solutions for verifiable decryption are aimed at the batch setting, however there are many applications in which there will only be one ciphertext that requires a proof of decryption. The purpose of this paper is to provide a zero-knowledge proof of correct decryption on an FHE ciphertext, which for instance could hold the result of a cryptographic election. We give two main contributions. Firstly, we present a bootstrapping-like protocol to switch from one FHE scheme to another. The first scheme has efficient homomorphic capabilities; the second admits a simple zero-knowledge protocol. To illustrate this, we use the Brakerski et al. (ITCS, 2012) scheme for the former, and Gentry’s original scheme (STOC, 2009) for the latter. Secondly, we present a simple one-shot zero-knowledge protocol for verifiable decryption using Gentry’s original FHE scheme.