title: Automatic Topic Labeling in Asynchronous Conversations

text: Asynchronous conversations are conversations where participants collaborate with each other at different times (e.g., email, blog, forum). The huge amount of textual data generated everyday in these conversations calls for automated methods of conversational text analysis. Topic segmentation and labeling is often considered a prerequisite for higher-level conversation analysis and has been shown to be useful in many NLP applications including summarization, information extraction and conversation visualization. Topic segmentation in asynchronous conversation refers to the task of clustering the sentences into a set of coherent topical clusters. In [6, 7], we presented unsupervised and supervised topic segmentation models for asynchronous conversations, which to our knowledge are the state-of-the-art. This study concerns topic labeling, that is, given a set of topical clusters in a conversation, the task is to assign appropriate topic labels to the clusters. For example, five topic labels in a Slashdot [2] blog conversation about releasing a new game called Daggerfall are game contents and size, game design, bugs/faults, other gaming options and performance/speed issues. Such topic labels can serve as a concise summary of the conversation and can also be used for indexing. Ideally, topic labels should be meaningful, semantically similar to the underlying topic, general (i.e., broad coverage of the topic) and discriminative (or exclusive) when there are multiple topics [10]. Traditionally, the top K terms in a multinomial topic model (e.g., LDA [3]) are used to represent a topic. However, as pointed out by [10], at the word-level, topic labels may become too general that it can impose cognitive difficulties on a user to interpret the meaning of the topic by associating the words together. On the other hand, if the labels are expressed at the sentence-level, they may become too specific to cover the whole theme of the topic. Based on these observations, [10] and other recent studies (e.g., [9]) advocate for phrase-level topic labels. This is also consistent with the monologue corpora built as part of the Topic Detection and Tracking (TDT) project [1] as well as with our own email and blog conversational corpora in which human annotators without specific instructions spontaneously generated labels at the phrase-level. Considering all these factors, we also treat phrase-level as the right level of granularity for a label in this work. Few prior studies have addressed the topic labeling problem in different settings [10, 9]. Common to their approaches is that they first mine topics in the form of topic-word distributions from the whole corpus using topic models like LDA. Then, they try to label the topics (i.e., topic-word distributions) with an appropriate label using the statistical association metrics (e.g., point-wise mutual information, t-test) computed from either the source corpus or an external knowledge base (e.g., Wikipedia). In contrast, our task is to label the topical clusters in a given conversation, where topics are closely related and distributional variations are subtle (e.g., game contents and size, game design). Therefore, corpus-based statistical association metrics are not reliable in our case. Also at the conversation-level, the topics are too specific to find their labels in an external source. To our knowledge, none has studied this problem before. Therefore, there is no standard corpus and no agreed-upon evaluation metrics available. Our contributions aim to remedy these problems. First, we present a blog and an email corpora annotated with topics. Second, we propose to generate topic labels using an extractive approach, that finds the most representative phrases from the text without relying on an external source. Since, graph-based key phrase ranking has proved to be the state-of-the-art (unsupervised) method [11], we adopt the same framework. We propose a novel biased random walk model that exploits the fact that the leading sentences in a topic often carry the most informative clues for its label. However, the phrases extracted only by considering the sentences in a topic may ignore the global aspect of the conversation. As another contribution, we propose to re-rank the phrases extracted from the whole conversation with respect to the individual topics and include the relevant ones. Experimental results show that our approach outperforms other ranking models including a general random walk model (i.e., TextRank) proposed by [11], a leadoriented model and a frequency-based model, and including the relevant conversation-level phrases improves the performance.


title: A framework for facial surgery simulation

text: The accurate prediction of the post-surgical facial shape is of paramount importance for surgical planning in facial surgery. In this paper we present a framework for facial surgery simulation which is based on volumetric finite element modeling. We contrast conventional procedures for surgical planning against our system by accompanying a patient during the entire process of planning, medical treatment and simulation. In various preprocessing steps a 3D physically based facial model is reconstructed from CT and laser range scans. All geometric and topological changes are modeled interactively using Alias.#8482; Applying fully 3D volumetric elasticity allows us to represent important volumetric effects such as incompressibility in a natural and physically accurate way. For computational efficiency, we devised a novel set of prismatic shape functions featuring a globally C1-continuous surface in combination with a C0 interior. Not only is it numerically accurate, but this construction enables us to compute smooth and visually appealing facial shapes.


title: Design of an adaptive sliding mode controller for a novel spherical rolling robot

text: This paper presents a novel spherical rolling robot and the design procedure of an adaptive sliding mode controller for the proposed robot. Towards containing the uncertainties, the sliding mode controller is utilized and simulation tests represent the effectiveness of this method. However, the chattering phenomenon in the robot operation is the main insufficiency of this controller. Hence, in order to present a more accurate controller, sliding mode controller is equipped with an identification method which works in an online manner for identifying the exact model of the robot. The provided identification procedure is based on Recursive Least Square approach, which is one of the most promising approaches toward identifying the model. It should be also noted that, this adaptive controller identify the model without taking into account any data from the derived model.


title: A Memory Soft Error Measurement on Production Systems

text: Memory state can be corrupted by the impact of particles causing single-event upsets (SEUs). Understanding and dealing with these soft (or transient) errors is important for system reliability. Several earlier studies have p rovided field test measurement results on memory soft error rate, but no results were available for recent production computer systems. We believe the measurement results on real production systems are uniquely valuable due to various environmental effects. This paper presents methodologies for memory soft error measurement on production systems where performance impact on existing running applications must be negligible and the system administrativ e control might or might not be available. We conducted measurements in three distinct system environments: a rack-mounted server farm for a popular Internet service (Ask.com search engine), a set of office desktop computers (Univ. of Rochester), and a geographically distributed network testbed (PlanetLab). Our preliminary measurement on over 300 machines for varying multi-month periods finds 2 suspected soft errors. In particular, our result on the Internet servers indicates that, with high probability, the soft error rate is at least two orders of magnitude lower than those reported previously. We provide discussions that attribute the low error rate to several factors in today’s production system environments . As a contrast, our measurement unintentionally discovers permanent (or hard) memory faults on 9 out of 212 Ask.com machines, suggesting the relative commonness of


title: Winding Machine for Automated Production of an Innovative Air-Gap Winding for Lightweight Electric Machines

text: This paper presents a newly developed winding machine, which enables an automated production of stator-mounted air-gap windings with meander structure. This structure has very high accuracy requirements. Therefore, automation is realized by the interaction of 15 actuators and a compound construction with 13 degrees of freedom. The programming works with discrete open-loop motion control to generate the kinematics. Above all, a flexible prototype of the winding machine is developed, manufactured, and tested for a motor with external rotor. Finally, experimental results of the developed automation for air-gap windings with meander structure are presented.


title: Classification of malignant melanoma and benign skin lesions: implementation of automatic ABCD rule

text: The ABCD (asymmetry, border irregularity, colour and dermoscopic structure) rule of dermoscopy is a scoring method used by dermatologists to quantify dermoscopy findings and effectively separate melanoma from benign lesions. Automatic detection of the ABCD features and separation of benign lesions from melanoma could enable earlier detection of melanoma. In this study, automatic ABCD scoring of dermoscopy lesions is implemented. Pre-processing enables automatic detection of hair using Gabor filters and lesion boundaries using geodesic active contours. Algorithms are implemented to extract the characteristics of ABCD attributes. Methods used here combine existing methods with novel methods to detect colour asymmetry and dermoscopic structures. To classify lesions as melanoma or benign nevus, the total dermoscopy score is calculated. The experimental results, using 200 dermoscopic images, where 80 are malignant melanomas and 120 benign lesions, show that the algorithm achieves 91.25% sensitivity of 91.25 and 95.83% specificity. This is comparable to the 92.8% sensitivity and 90.3% specificity reported for human implementation of the ABCD rule. The experimental results show that the extracted features can be used to build a promising classifier for melanoma detection.


title: A Hybrid Framework for News Clustering Based on the DBSCAN-Martingale and LDA

text: Nowadays there is an important need by journalists and media monitoring companies to cluster news in large amounts of web articles, in order to ensure fast access to their topics or events of interest. Our aim in this work is to identify groups of news articles that share a common topic or event, without a priori knowledge of the number of clusters. The estimation of the correct number of topics is a challenging issue, due to the existence of “noise”, i.e. news articles which are irrelevant to all other topics. In this context, we introduce a novel density-based news clustering framework, in which the assignment of news articles to topics is done by the well-established Latent Dirichlet Allocation, but the estimation of the number of clusters is performed by our novel method, called “DBSCAN-Martingale”, which allows for extracting noise from the dataset and progressively extracts clusters from an OPTICS reachability plot. We evaluate our framework and the DBSCAN-Martingale on the 20newsgroups-mini dataset and on 220 web news articles, which are references to specific Wikipedia pages. Among twenty methods for news clustering, without knowing the number of clusters k, the framework of DBSCAN-Martingale provides the correct number of clusters and the highest Normalized Mutual Information.


title: Overview of ImageCLEFcaption 2017 - Image Caption Prediction and Concept Detection for Biomedical Images

text: This paper presents an overview of the ImageCLEF 2017 caption tasks on the analysis of images from the biomedical literature. Two subtasks were proposed to the participants: a concept detection task and caption prediction task, both using only images as input. The two subtasks tackle the problem of providing image interpretation by extracting concepts and predicting a caption based on the visual information of an image alone. A dataset of 184,000 figure-caption pairs from the biomedical open access literature (PubMed Central) are provided as a testbed with the majority of them as trainign data and then 10,000 as validation and 10,000 as test data. Across two tasks, 11 participating groups submitted 71 runs. While the domain remains challenging and the data highly heterogeneous, we can note some surprisingly good results of the difficult task with a quality that could be beneficial for health applications by better exploiting the visual content of biomedical figures.


title: A Hierarchical Cluster Synchronization Framework of Energy Internet

text: The concept of “Energy Internet” has been recently proposed to improve the efficiency of renewable energy resources. Accordingly, this paper investigates the synchronization of the Energy Internet system. Specifically, an appropriate hierarchical cluster synchronization framework is firstly developed for the Energy Internet, which includes primary synchronization, secondary synchronization, and tertiary synchronization. Furthermore, a secondary synchronization strategy (cluster synchronization) is proposed for the synchronization of multiple microgrid clusters in the Energy Internet, which is based on the consensus algorithm of multiagent networks. The detailed synchronization framework and control scheme are presented in this paper. Finally, some simulation results are provided and discussed to validate the performance and effectiveness of the proposed strategy.


title: Optimal Power Flow by Black Hole Optimization Algorithm

text: In this paper, a black hole optimization algorithm (BH) is utilized to solve the optimal power flow problem considering the generation fuel cost, reduction of voltage deviation and improvement of voltage stability as an objective functions. The black hole algorithm simulate the black hole phenomenon which relay on tow operations, the star absorption and star sucking. The IEEE 30-Bus and IEEE 57-Bus systems are used to illustrate performance of the proposed algorithm and results are compared with those in literatures.


title: Extraction and classification texture of inflammatory cells and nuclei in normal pap smear images

text: The presence of inflammatory cells complicates the process of identifying the nuclei in the early detection of cervical cancer. Inflammatory cells need to be eliminated to assist pathologists in reading Pap smear slides. The texture of Grey-Level Run-Length Matrix (GLRLM) for inflammatory cells and nuclei types are investigated. The inflammatory cells and nuclei have different texture, and it can be used to differentiate them. To extract all of the features, firstly manual cropping of inflammatory cells and nuclei needs to be done. All of extracted features have been analyzed and selected by Decision Tree classifier (J48). Originally there have been eleven features in the direction of 135° which are extracted to classify cropping cells into inflammatory cells and nuclei. Then the eleven features are reduced into eight, namely low gray level run emphasis, gray level non uniformity, run length non-uniformity, long run low gray-level emphasis, short run high gray-level emphasis, short run low gray-level emphasis, long run high gray-level emphasis and run percentage based on the rule of classification. This experiment is applied into 957 cells which were from 50 images. The compositions of these cells were 122 cells of nuclei and 837 cells of inflammatory. The proposed algorithm applied to all of the cells and the result of classification by using these eight texture features obtains the sensitivity rates which show that there are still nuclei of cells that were considered as inflammatory cells. It was in accordance with the conditions of the difficulties faced by the pathologist while the specificity rate suggests that inflammatory cells detected properly and few inflammatory cells are considered as nucleus.


title: Development of Autonomous Car—Part II: A Case Study on the Implementation of an Autonomous Driving System Based on Distributed Architecture

text: Part I of this paper proposed a development process and a system platform for the development of autonomous cars based on a distributed system architecture. The proposed development methodology enabled the design and development of an autonomous car with benefits such as a reduction in computational complexity, fault-tolerant characteristics, and system modularity. In this paper (Part II), a case study of the proposed development methodology is addressed by showing the implementation process of an autonomous driving system. In order to describe the implementation process intuitively, core autonomous driving algorithms (localization, perception, planning, vehicle control, and system management) are briefly introduced and applied to the implementation of an autonomous driving system. We are able to examine the advantages of a distributed system architecture and the proposed development process by conducting a case study on the autonomous system implementation. The validity of the proposed methodology is proved through the autonomous car A1 that won the 2012 Autonomous Vehicle Competition in Korea with all missions completed.


title: Digital Image Processing

text: Image defects which could be caused by the digitization process or by faults in the imaging set-up (for example, bad lighting) can be corrected using Image Enhancement techniques. Once the image is in good condition, the Measurement Extraction operations can be used to obtain useful information from the image. Course Objectives “Introduction to Digital Image Processing” is two-day hands-on course that provide fundamental concepts and techniques for digital image processing and the software principles used in their practical implementation.


title: Real-time computer vision with OpenCV

text: Mobile computer-vision technology will soon become as ubiquitous as touch interfaces.


title: Python for Prototyping Computer Vision Applications

text: Python is a popular language widely adopted by the scientific community due to its clear syntax and an extensive number of specialized packages. For image processing or computer vision development, two libraries are prominently used: NumPy/SciPy and OpenCV with a Python wrapper. In this paper, we present a comparative evaluation of both libraries, assessing their performance and their usability. We also investigate the performance of OpenCV when accessed through a python wrapper versus directly using the native C implementation.


title: Python for Scientific Computing

text: Python is an excellent "steering" language for scientific codes written in other languages. However, with additional basic tools, Python transforms into a high-level language suited for scientific and engineering code that's often fast enough to be immediately useful but also flexible enough to be sped up with additional extensions.


title: Image Alignment and Stitching : A Tutorial 1

text: This tutorial reviews image alignment and image stitching algorithms. Image alignment algorithms can discover the correspondence relationships among images with varying degrees of overlap. They are ideally suited for applications such as video stabilization, summarization, and the creation of panoramic mosaics. Image stitching algorithms take the alignment estimates produced by such registration algorithms and blend the images in a seamless manner, taking care to deal with potential problems such as blurring or ghosting caused by parallax and scene movement as well as varying image exposures. This tutorial reviews the basic motion models underlying alignment and stitching algorithms, describes effective direct (pixel-based) and feature-based alignment algorithms, and describes blending algorithms used to produce seamless mosaics. It closes with a discussion of open research problems in the area.


title: Substrate-Independent Microwave Components in Substrate Integrated Waveguide Technology for High-Performance Smart Surfaces

text: Although all existing air-filled substrate integrated waveguide (AFSIW) topologies yield a substrate-independent electrical performance, they rely on dedicated, expensive, laminates to form air-filled regions that contain the electromagnetic fields. This paper proposes a novel substrate-independent AFSIW manufacturing technology, enabling straightforward integration of high-performance microwave components into a wide range of general-purpose commercially available surface materials by means of standard additive (3-D printing) or subtractive (computer numerically controlled milling/laser cutting) manufacturing processes. First, an analytical formula is derived for the effective permittivity and loss tangent of the AFSIW waveguide. This allows the designer to reduce substrate losses to levels typically encountered in high-frequency laminates. Then, several microwave components are designed and fabricated. Measurements of multiple AFSIW waveguides and a four-way power divider/combiner, both relying on a new coaxial-to-air-filled SIW transition, prove that this novel approach yields microwave components suitable for direct integration into everyday surfaces, with low insertion loss, and excellent matching and isolation over the entire [5.15–5.85] GHz band. Hence, this innovative approach paves the way for a new generation of cost-effective, high-performance, and invisibly integrated smart surface systems that efficiently exploit the area and the materials available in everyday objects.


title: VIPS: a Vision-based Page Segmentation Algorithm

text: A new web content structure analysis based on visual representation is proposed in this paper. Many web applications such as information retrieval, information extraction and automatic page adaptation can benefit from this structure. This paper presents an automatic top-down, tag-tree independent approach to detect web content structure. It simulates how a user understands web layout structure based on his visual perception. Comparing to other existing techniques, our approach is independent to underlying documentation representation such as HTML and works well even when the HTML structure is far different from layout structure. Experiments show satisfactory results.


title: Modality Effects in Deception Detection and Applications in Automatic-Deception-Detection

text: Modality is an important context factor in deception, which is context-dependent. In order to build a reliable and flexible tool for automatic-deception-detection (ADD), we investigated the characteristics of verbal cues to deceptive behavior in three modalities: text, audio and face-to-face communication. Seven categories of verbal cues (21 cues) were studied: quantity, complexity, diversity, verb nonimmediacy, uncertainty, specificity and affect. After testing the interaction effects between modality and condition (deception or truth), we found significance only with specificity and observed that differences between deception and truth were in general consistent across the three modalities. However, modality had strong effects on verbal cues. For example, messages delivered face-to-face were largest in quantity (number of words, verbs, and sentences), followed by the audio modality. Text had the sparsest examples. These modality effects are an important factor in building baselines in ADD tools, because they make it possible to use them to adjust the baseline for an unknown modality according to a known baseline, thereby simplifying the process of ADD. The paper discusses in detail the implications of these findings on modality effects in three modalities.


title: Model-based clustering of high-dimensional data: A review

text: Model-based clustering is a popular tool which is renowned for its probabilistic foundations and its flexibility. However, high-dimensional data are nowadays more and more frequent and, unfortunately, classical model-based clustering techniques show a disappointing behavior in high-dimensional spaces. This is mainly due to the fact that model-based clustering methods are dramatically over-parametrized in this case. However, high-dimensional spaces have specific characteristics which are useful for clustering and recent techniques exploit those characteristics. After having recalled the bases of model-based clustering, this article will review dimension reduction approaches, regularization-based techniques, parsimonious modeling, subspace clustering methods and clustering methods based on variable selection. Existing softwares for model-based clustering of high-dimensional data will be also reviewed and their practical use will be illustrated on real-world data sets.


title: Categorical Data Clustering using Frequency and Tf-Idf based Cosine Similarity

text: Clustering is the process of grouping a set of physical objects into classes of similar object. Objects in real world consist of both numerical and categorical data. Categorical data are not analyzed as numerical data due to the lack of inherit ordering. This paper describes Frequency and Tf-Idf Based Categorical Data Clustering (FTCDC) technique based on cosine similarity measure. The FTCDC system consists of four modules, such as data pre-processing, similarity matrix generation, cluster formation and validation. The System architecture of FTCDC is explained and its performance is examined using a simple example scenario. The performance on real world data is measured using accuracy and error rate. The performance of the system much relay on the similarity threshold selected for the clustering process.


title: Transcription Methods for Consistency, Volume and Efficiency

text: This paper describes recent efforts at Linguistic Data Consortium at the University of Pennsylvania to create manual transcripts as a shared resource for human language technology research and evaluation. Speech recognition and related technologies in particular call for substantial volumes of transcribed speech for use in system development, and for human gold standard references for evaluating performance over time. Over the past several years LDC has developed a number of transcription approaches to support the varied goals of speech technology evaluation programs in multiple languages and genres. We describe each transcription method in detail, and report on the results of a comparative analysis of transcriber consistency and efficiency, for two transcription methods in three languages and five genres. Our findings suggest that transcripts for planned speech are generally more consistent than those for spontaneous speech, and that careful transcription methods result in higher rates of agreement when compared to quick transcription methods. We conclude with a general discussion of factors contributing to transcription quality, efficiency and consistency.


title: GraphP: Reducing Communication for PIM-Based Graph Processing with Efficient Data Partition

text: Processing-In-Memory (PIM) is an effective technique that reduces data movements by integrating processing units within memory. The recent advance of “big data” and 3D stacking technology make PIM a practical and viable solution for the modern data processing workloads. It is exemplified by the recent research interests on PIM-based acceleration. Among them, TESSERACT is a PIM-enabled parallel graph processing architecture based on Micron’s Hybrid Memory Cube (HMC), one of the most prominent 3D-stacked memory technologies. It implements a Pregel-like vertex-centric programming model, so that users could develop programs in the familiar interface while taking advantage of PIM. Despite the orders of magnitude speedup compared to DRAM-based systems, TESSERACT generates excessive crosscube communications through SerDes links, whose bandwidth is much less than the aggregated local bandwidth of HMCs. Our investigation indicates that this is because of the restricted data organization required by the vertex programming model. In this paper, we argue that a PIM-based graph processing system should take data organization as a first-order design consideration. Following this principle, we propose GraphP, a novel HMC-based software/hardware co-designed graph processing system that drastically reduces communication and energy consumption compared to TESSERACT. GraphP features three key techniques. 1) “Source-cut” partitioning, which fundamentally changes the cross-cube communication from one remote put per cross-cube edge to one update per replica. 2) “Two-phase Vertex Program”, a programming model designed for the “source-cut” partitioning with two operations: GenUpdate and ApplyUpdate. 3) Hierarchical communication and overlapping, which further improves performance with unique opportunities offered by the proposed partitioning and programming model. We evaluate GraphP using a cycle accurate simulator with 5 real-world graphs and 4 algorithms. The results show that it provides on average 1.7 speedup and 89% energy saving compared to TESSERACT.


title: Architectural optimizations for high performance and energy efficient Smith-Waterman implementation on FPGAs using OpenCL

text: Smith-Waterman is a dynamic programming algorithm that plays a key role in the modern genomics pipeline as it is guaranteed to find the optimal local alignment between two strings of data. The state of the art presents many hardware acceleration solutions that have been implemented in order to exploit the high degree of parallelism available in this algorithm. The majority of these implementations use heuristics to increase the performance of the system at the expense of the accuracy of the result. In this work, we present an implementation of the pure version of the algorithm. We include the key architectural optimizations to achieve highest possible performance for a given platform and leverage the Berkeley roofline model to track the performance and guide the optimizations. To achieve scalability, our custom design comprises of systolic arrays, data compression features and shift registers, while a custom port mapping strategy aims to maximize performance. Our designs are built leveraging an OpenCL-based design entry, namely Xilinx SDAccel, in conjunction with a Xilinx Virtex 7 and Kintex Ultrascale platform. Our final design achieves a performance of 42.47 GCUPS (giga cell updates per second) with an energy efficiency of 1.6988 GCUPS/W. This represents an improvement of 1.72x in performance and energy efficiency over previously published FPGA implementations and 8.49x better in energy efficiency over comparable GPU implementations.


title: An efficient Bayesian inference framework for coalescent-based nonparametric phylodynamics

text:
MOTIVATION
The field of phylodynamics focuses on the problem of reconstructing population size dynamics over time using current genetic samples taken from the population of interest. This technique has been extensively used in many areas of biology but is particularly useful for studying the spread of quickly evolving infectious diseases agents, e.g. influenza virus. Phylodynamic inference uses a coalescent model that defines a probability density for the genealogy of randomly sampled individuals from the population. When we assume that such a genealogy is known, the coalescent model, equipped with a Gaussian process prior on population size trajectory, allows for nonparametric Bayesian estimation of population size dynamics. Although this approach is quite powerful, large datasets collected during infectious disease surveillance challenge the state-of-the-art of Bayesian phylodynamics and demand inferential methods with relatively low computational cost.

RESULTS
To satisfy this demand, we provide a computationally efficient Bayesian inference framework based on Hamiltonian Monte Carlo for coalescent process models. Moreover, we show that by splitting the Hamiltonian function, we can further improve the efficiency of this approach. Using several simulated and real datasets, we show that our method provides accurate estimates of population size dynamics and is substantially faster than alternative methods based on elliptical slice sampler and Metropolis-adjusted Langevin algorithm.

AVAILABILITY AND IMPLEMENTATION
The R code for all simulation studies and real data analysis conducted in this article are publicly available at http://www.ics.uci.edu/∼slan/lanzi/CODES.html and in the R package phylodyn available at https://github.com/mdkarcher/phylodyn.

CONTACT
S.Lan@warwick.ac.uk or babaks@uci.edu

SUPPLEMENTARY INFORMATION
Supplementary data are available at Bioinformatics online.


title: Multiuser Millimeter Wave Communications With Nonorthogonal Beams

text: Recently, millimeter-wave (mmWave) and even terahertz wireless (with higher frequency) networks have attracted significant research interests as alternatives to support the formidable growth of wireless communication services. Normally, directional beamforming (BF) is shown as a promising technique to compensate its high path loss. We focus on mmWave communications and assume that both mmWave base stations (MBSs) and user equipments (UEs) can support directional BF. As mmWave spectrum has short wavelength, massive antenna arrays can be deployed at MBSs to form multiple directional beams through BF training. Then, an MBS can transmit simultaneously to multiple UEs (SUEs) with different beams in the networks. However, the beams that serve different SUEs may transmit (almost) in the same path, especially when SUEs are distributed densely. Thus, they are not in perfect orthogonal beams. Due to the leakage of transmission power, the interference among these beams may be severe. To address this problem, typically the MBS could serve these SUEs in time division multiplex. This will degrade the spectral efficiency. In this context, we investigate the effect of nonorthogonal beam interference and then propose two novel solutions (i.e., dynamic beam switching and static beam selection) to coordinate the transmitting beams effectively. Then, an improved downlink multiuser simultaneous transmission scheme is introduced. In the scheme, an MBS can serve multiple SUEs simultaneously with multiple orthogonal and/or nonorthogonal beams to guarantee SUEs’ Quality of Service. The theoretical and numerical results have shown that our scheme can largely improve the performance of the achievable rate and, meanwhile, can serve lots of SUEs simultaneously.


title: An Adaptive Privacy Protection Method for Smart Home Environments Using Supervised Learning

text: In recent years, smart home technologies have started to be widely used, bringing a great deal of convenience to people’s daily lives. At the same time, privacy issues have become particularly prominent. Traditional encryption methods can no longer meet the needs of privacy protection in smart home applications, since attacks can be launched even without the need for access to the cipher. Rather, attacks can be successfully realized through analyzing the frequency of radio signals, as well as the timestamp series, so that the daily activities of the residents in the smart home can be learnt. Such types of attacks can achieve a very high success rate, making them a great threat to users’ privacy. In this paper, we propose an adaptive method based on sample data analysis and supervised learning (SDASL), to hide the patterns of daily routines of residents that would adapt to dynamically changing network loads. Compared to some existing solutions, our proposed method exhibits advantages such as low energy consumption, low latency, strong adaptability, and effective privacy protection.


title: 65GHz Doppler Sensor with On-Chip Antenna in 0.18μm SiGe BiCMOS

text: A single-chip 65GHz Doppler radar transceiver with on-chip patch antenna is reported. Implemented in a production 0.18mum SiGe BiCMOS process, it features a differential output transmit power of 4.3dBm, 16.5dB single-ended down-conversion gain and a double-sideband noise figure of 12.8dB. The radar includes a 65GHz 2-stage cascode LNA with S 11<-15dB at 50-94GHz and 14dB gain at 65GHz, a double-balanced down-convert mixer, a SiGe HBT IF amplifier with low 1/f noise, a VCO and a 65GHz output buffer. The LO is provided by an integrated varactor-tuned 61-67GHz VCO optimized for low phase noise. The patch antenna is designed to be impedance-matched for dual-band operation at 62.8 and 64.6GHz. The use of lumped inductors in all blocks and a vertically-stacked transformer for single-ended to differential conversion in the receive path help reduce the transceiver area to 1mm times 1mm


title: In-class distractions: The role of Facebook and the primary learning task

text: While laptops and other Internet accessible technologies facilitate student learning in the classroom, they also increase opportunities for interruptions from off-task social networking sites such as Facebook (FB). A small number of correlational studies have suggested that FB has a detrimental effect on learning performance, however; these studies had neglected to investigate student-engagement in the primary learning task and how this affects task-switching to goal-irrelevant FB intrusions (distractions); and how purposeful deployment of attention to FB (goal-relevant interruptions) affect lecture comprehension on such tasks. This experiment fills a gap in the literature by manipulating lecture interest-value and controls for duration of FB exposure, time of interruption, FB material and the order of FB posts. One hundred and fifty participants were randomly allocated to one of six conditions: (A) no FB intrusions, high-interest (HI) lecture; (B) no FB intrusions, low-interest (LI) lecture (C) goal-relevant FB intrusions, HI lecture (D) goal-relevant FB intrusions, LI lecture (E) goal-irrelevant FB intrusions, HI lecture (F) goal-irrelevant FB intrusions, LI lecture. As predicted, participants were more susceptible to FB distractions when the primary learning task was of low-interest. The study also found that goal-relevant FB intrusions significantly reduced HI lecture comprehension compared to the control condition (A). The results highlight the need for recourses that will help educators increase student engagement with their learning task. Implications for future research are discussed. 2014 Elsevier Ltd. All rights reserved.


Guidelines for human electromyographic research.


title: Design and experimental validation of HyTAQ, a Hybrid Terrestrial and Aerial Quadrotor

text: This paper details the design, modeling, and experimental validation of a novel mobile robot capable of both aerial and terrestrial locomotion. Flight is achieved through a quadrotor configuration; four actuators provide the required thrust. Adding a rolling cage to the quadrotor makes terrestrial locomotion possible using the same actuator set and control system. Thus, neither the mass nor the system complexity is increased by inclusion of separate actuators for terrestrial and aerial locomotion. An analysis of the system's energy consumption demonstrates that during terrestrial locomotion, the robot only needs to overcome rolling resistance and consumes much less energy compared to the aerial mode. This solves one of the most vexing problems of quadrotors and rotorcraft in general - their short operation time. Experimental results show that the hybrid robot can travel a distance four times greater and operate almost six times longer than an aerial only system. It also solves one of the most challenging problems in terrestrial robot design - obstacle avoidance. When an obstacle is encountered, the system simply flies over it.


title: Inference and Analysis of Population Structure Using Genetic Data and Network Theory.

text: Clustering individuals to subpopulations based on genetic data has become commonplace in many genetic studies. Inference about population structure is most often done by applying model-based approaches, aided by visualization using distance-based approaches such as multidimensional scaling. While existing distance-based approaches suffer from a lack of statistical rigor, model-based approaches entail assumptions of prior conditions such as that the subpopulations are at Hardy-Weinberg equilibria. Here we present a distance-based approach for inference about population structure using genetic data by defining population structure using network theory terminology and methods. A network is constructed from a pairwise genetic-similarity matrix of all sampled individuals. The community partition, a partition of a network to dense subgraphs, is equated with population structure, a partition of the population to genetically related groups. Community-detection algorithms are used to partition the network into communities, interpreted as a partition of the population to subpopulations. The statistical significance of the structure can be estimated by using permutation tests to evaluate the significance of the partition's modularity, a network theory measure indicating the quality of community partitions. To further characterize population structure, a new measure of the strength of association (SA) for an individual to its assigned community is presented. The strength of association distribution (SAD) of the communities is analyzed to provide additional population structure characteristics, such as the relative amount of gene flow experienced by the different subpopulations and identification of hybrid individuals. Human genetic data and simulations are used to demonstrate the applicability of the analyses. The approach presented here provides a novel, computationally efficient model-free method for inference about population structure that does not entail assumption of prior conditions. The method is implemented in the software NetStruct (available at https://giligreenbaum.wordpress.com/software/).


title: A comprehensive review of firefly algorithms

text: The firefly algorithm has become an increasingly important tool of Swarm Intelligence that has been applied in almost all areas of optimization, as well as engineering practice. Many problems from various areas have been successfully solved using the firefly algorithm and its variants. In order to use the algorithm to solve diverse problems, the original firefly algorithm needs to be modified or hybridized. This paper carries out a comprehensive review of this living and evolving discipline of Swarm Intelligence, in order to show that the firefly algorithm could be applied to every problem arising in practice. On the other hand, it encourages new researchers and algorithm developers to use this simple and yet very efficient algorithm for problem solving. It often guarantees that the obtained results will meet the expectations. & 2013 Elsevier Ltd. All rights reserved.


title: Third-wave livestreaming: teens' long form selfie

text: Mobile livestreaming is now well into its third wave. From early systems such as Bambuser and Qik, to more popular apps Meerkat and Periscope, to today's integrated social streaming features in Facebook and Instagram, both technology and usage have changed dramatically. In this latest phase of livestreaming, cameras turn inward to focus on the streamer, instead of outwards on the surroundings. Teens are increasingly using these platforms to entertain friends, meet new people, and connect with others on shared interests. We studied teens' livestreaming behaviors and motivations on these new platforms through a survey completed by 2,247 American livestreamers and interviews with 20 teens, highlighting changing practices, teens' differences from the broader population, and implications for designing new livestreaming services.


title: State-space solutions to standard H2 and H∞ control problems

text: Simple state-space formulas are presented for a controller solving a standard H∞-problem. The controller has the same state-dimension as the plant, its computation involves only two Riccati equations, and it has a separation structure reminiscent of classical LQG (i.e., H2) theory. This paper is also intended to be of tutorial value, so a standard H2-solution is developed in parallel.


title: What Makes a Great Software Engineer?

text: Good software engineers are essential to the creation of good software. However, most of what we know about software-engineering expertise are vague stereotypes, such as 'excellent communicators' and 'great teammates'. The lack of specificity in our understanding hinders researchers from reasoning about them, employers from identifying them, and young engineers from becoming them. Our understanding also lacks breadth: what are all the distinguishing attributes of great engineers (technical expertise and beyond)? We took a first step in addressing these gaps by interviewing 59 experienced engineers across 13 divisions at Microsoft, uncovering 53 attributes of great engineers. We explain the attributes and examine how the most salient of these impact projects and teams. We discuss implications of this knowledge on research and the hiring and training of engineers.


title: TF.Learn: TensorFlow's High-level Module for Distributed Machine Learning

text: TF.Learn is a high-level Python module for distributed machine learning inside TensorFlow (Abadi et al., 2015). It provides an easy-to-use Scikit-learn (Pedregosa et al., 2011) style interface to simplify the process of creating, configuring, training, evaluating, and experimenting a machine learning model. TF.Learn integrates a wide range of state-ofart machine learning algorithms built on top of TensorFlow’s low level APIs for small to large-scale supervised and unsupervised problems. This module focuses on bringing machine learning to non-specialists using a general-purpose high-level language as well as researchers who want to implement, benchmark, and compare their new methods in a structured environment. Emphasis is put on ease of use, performance, documentation, and API consistency.


title: Drunk person identification using thermal infrared images

text: Drunk person identification is carried out using thermal infrared images. The features used for this purpose are simply the pixel values on specific points on the face of the person. It is proved that for a drunk person, the corresponding cluster in the feature space moves far away from its original position for the sober person. The concept behind the proposed approach is based on the physiology-based face identification. For demonstration purposes, Fisher Linear Discriminant approach is used for space dimensionality reduction. The feature space is found to be of very low dimensionality.


title: Big Data , Digital Media , and Computational Social Science : Possibilities and Perils

text: We live life in the network. We check our e-mails regularly, make mobile phone calls from almost any location ... make purchases with credit cards ... [and] maintain friendships through online social networks. ... These transactions leave digital traces that can be compiled into comprehensive pictures of both individual and group behavior, with the potential to transform our understanding of our lives, organizations, and societies.


title: A combinatorial strongly polynomial algorithm for minimizing submodular functions

text: This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question posed in 1981 by Grötschel, Lovász, and Schrijver. The algorithm employs a scaling scheme that uses a flow in the complete directed graph on the underlying set with each arc capacity equal to the scaled parameter. The resulting algorithm runs in time bounded by a polynomial in the size of the underlying set and the length of the largest absolute function value. The paper also presents a strongly polynomial version in which the number of steps is bounded by a polynomial in the size of the underlying set, independent of the function values.


title: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes

text:
Impossibility theorems suggest that the only efficient and strategyproof mechanisms for the problem of combinatorial assignment - e.g., assigning schedules of courses to students - are dictatorships. Dictatorships are mostly rejected as unfair: for any two agents, one chooses all their objects before the other chooses any. Any solution will involve compromise amongst efficiency, incentive and fairness considerations.
 This paper proposes a solution to the combinatorial assignment problem. It is developed in four steps. First, I propose two new criteria of outcome fairness, the maximin share guarantee and envy bounded by a single good, which weaken well-known criteria to accommodate indivisibilities; the criteria formalize why dictatorships are unfair. Second, I prove existence of an approximation to Competitive Equilibrium from Equal Incomes in which (i) incomes are unequal but arbitrarily close together; (ii) the market clears with error, which approaches zero in the limit and is small for realistic problems. Third, I show that this Approximate CEEI satisfies the fairness criteria. Last, I define a mechanism based on Approximate CEEI that is strategyproof for the zero-measure agents economists traditionally regard as price takers. The proposed mechanism is calibrated on real data and is compared to alternatives from theory and practice: all other known mechanisms are either manipulable by zero-measure agents or unfair ex-post, and most are both manipulable and unfair.


title: On approximately fair allocations of indivisible goods

text: We study the problem of fairly allocating a set of indivisible goods to a set of people from an algorithmic perspective. fair division has been a central topic in the economic literature and several concepts of fairness have been suggested. The criterion that we focus on is envy-freeness. In our model, a monotone utility function is associated with every player specifying the value of each subset of the goods for the player. An allocation is envy-free if every player prefers her own share than the share of any other player. When the goods are divisible, envy-free allocations always exist. In the presence of indivisibilities, we show that there exist allocations in which the envy is bounded by the maximum marginal utility, and present a simple algorithm for computing such allocations. We then look at the optimization problem of finding an allocation with minimum possible envy. In the general case the problem is not solvable or approximable in polynomial time unless P = NP. We consider natural special cases (e.g.additive utilities) which are closely related to a class of job scheduling problems. Approximation algorithms as well as inapproximability results are obtained. Finally we investigate the problem of designing truthful mechanisms for producing allocations with bounded envy.


title: Allocating indivisible goods

text: The problem of allocating divisible goods has enjoyed a lot of attention in both mathematics (e.g. the cake-cutting problem) and economics (e.g. market equilibria). On the other hand, the natural requirement of indivisible goods has been somewhat neglected, perhaps because of its more complicated nature. In this work we study a fairness criterion, called the Max-Min Fairness problem, for k players who want to allocate among themselves m indivisible goods. Each player has a specified valuation function on the subsets of the goods and the goal is to split the goods between the players so as to maximize the minimum valuation. Viewing the problem from a game theoretic perspective, we show that for two players and additive valuations the expected minimum of the (randomized) cut-and-choose mechanism is a 1/2-approximation of the optimum. To complement this result we show that no truthful mechanism can compute the exact optimum.We also consider the algorithmic perspective when the (true) additive valuation functions are part of the input. We present a simple 1/(m - k + 1) approximation algorithm which allocates to every player at least 1/k fraction of the value of all but the k - 1 heaviest items. We also give an algorithm with additive error against the fractional optimum bounded by the value of the largest item. The two approximation algorithms are incomparable in the sense that there exist instances when one outperforms the other.


A polynomial-time approximation scheme for maximizing the minimum machine completion time


title: Design Considerations and Performance Evaluation of Single-Stage TAIPEI Rectifier for HVDC Distribution Applications

text: Design considerations and performance evaluations of a three-phase, four-switch, single-stage, isolated zero-voltage-switching (ZVS) rectifier are presented. The circuit is obtained by integrating the three-phase, two-switch, ZVS, discontinuous-current-mode (DCM), boost power-factorcorrection (PFC) rectifier, named for short the TAIPEI rectifier, with the ZVS full-bridge (FB) phase-shift dc/dc converter. The performance was evaluated on a three-phase 2.7-kW prototype designed for HVDC distribution applications with the line-toline voltage range from 180 VRMS to 264 VRMS and with a tightly regulated variable dc output voltage from 200 V to 300 V. The prototype operates with ZVS over the entire input-voltage and load-current range and achieves less than 5% input-current THD with the efficiency in the 95% range.


title: The induction of apoptosis and autophagy by Wasabia japonica extract in colon cancer.

text:
PURPOSE
Wasabia japonica (wasabi) has been shown to exhibit properties of detoxification, anti-inflammation and the induction of apoptosis in cancer cells. This study aimed to investigate the molecular mechanism of the cytotoxicity of wasabi extract (WE) in colon cancer cells to evaluate the potential of wasabi as a functional food for chemoprevention.

METHODS
Colo 205 cells were treated with different doses of WE, and the cytotoxicity was analyzed by 3-(4,5-dimethylthiazol-2-yl)-2,5-diphenyl tetrazolium bromide. Apoptosis and autophagy were detected by 4',6-diamidino-2-phenylindole, 5,5',6,6'-tetrachloro-1,1',3,3'-tetraethyl-imidacarbo-yanine iodide and staining for acidic vascular organelles (AVOs), along with Western blotting.

RESULTS
The results demonstrated that WE induced the extrinsic pathway and mitochondrial death machinery through the activation of TNF-α, Fas-L, caspases, truncated Bid and cytochrome C. WE also induced autophagy by decreasing the phosphorylation of Akt and mTOR and promoting the expression of microtubule-associated protein 1 light chain 3-II and AVO formation. An in vivo xenograft model verified that tumor growth was delayed by WE treatment.

CONCLUSION
Our studies revealed that WE exhibits anti-colon cancer properties through the induction of apoptosis and autophagy. These results provide support for the application of WE as a chemopreventive functional food and as a prospective treatment of colon cancer.


title: Detecting Image Splicing using Geometry Invariants and Camera Characteristics Consistency

text: Recent advances in computer technology have made digital image tampering more and more common. In this paper, we propose an authentic vs. spliced image classification method making use of geometry invariants in a semi-automatic manner. For a given image, we identify suspicious splicing areas, compute the geometry invariants from the pixels within each region, and then estimate the camera response function (CRF) from these geometry invariants. The cross-fitting errors are fed into a statistical classifier. Experiments show a very promising accuracy, 87%, over a large data set of 363 natural and spliced images. To the best of our knowledge, this is the first work detecting image splicing by verifying camera characteristic consistency from a single-channel image


title: Internet Reflections on Teenagers

text: The Internet is a piece of today's way of life that numerous young people can't envision what the world resembled before the Internet existed. The Internet is fun, enlightening and an extraordinary wellspring of correspondence with others. It's an instructive device and clients can find out about just about anything. Sharing data through Internet is simple, shoddy and quick. Young people have admittance to billions of sites containing data as content, pictures and recordings [1-10].


title: Optimal Mass Transport for Registration and Warping

text: Image registration is the process of establishing a common geometric reference frame between two or more image data sets possibly taken at different times. In this paper we present a method for computing elastic registration and warping maps based on the Monge–Kantorovich theory of optimal mass transport. This mass transport method has a number of important characteristics. First, it is parameter free. Moreover, it utilizes all of the grayscale data in both images, places the two images on equal footing and is symmetrical: the optimal mapping from image A to image B being the inverse of the optimal mapping from B to A. The method does not require that landmarks be specified, and the minimizer of the distance functional involved is unique; there are no other local minimizers. Finally, optimal transport naturally takes into account changes in density that result from changes in area or volume. Although the optimal transport method is certainly not appropriate for all registration and warping problems, this mass preservation property makes the Monge–Kantorovich approach quite useful for an interesting class of warping problems, as we show in this paper. Our method for finding the registration mapping is based on a partial differential equation approach to the minimization of the L 2 Kantorovich–Wasserstein or “Earth Mover's Distance” under a mass preservation constraint. We show how this approach leads to practical algorithms, and demonstrate our method with a number of examples, including those from the medical field. We also extend this method to take into account changes in intensity, and show that it is well suited for applications such as image morphing.


title: Formation and suppression of acoustic memories during human sleep

text: Sleep and memory are deeply related, but the nature of the neuroplastic processes induced by sleep remains unclear. Here, we report that memory traces can be both formed or suppressed during sleep, depending on sleep phase. We played samples of acoustic noise to sleeping human listeners. Repeated exposure to a novel noise during Rapid Eye Movements (REM) or light non-REM (NREM) sleep leads to improvements in behavioral performance upon awakening. Strikingly, the same exposure during deep NREM sleep leads to impaired performance upon awakening. Electroencephalographic markers of learning extracted during sleep confirm a dissociation between sleep facilitating memory formation (light NREM and REM sleep) and sleep suppressing learning (deep NREM sleep). We can trace these neural changes back to transient sleep events, such as spindles for memory facilitation and slow waves for suppression. Thus, highly selective memory processes are active during human sleep, with intertwined episodes of facilitative and suppressive plasticity. Though memory and sleep are related, it is still unclear whether new memories can be formed during sleep. Here, authors show that people could learn new sounds during REM or light non-REM sleep, but that learning was suppressed when sounds were played during deep NREM sleep.


title: Shape Segmentation by Approximate Convexity Analysis

text: We present a shape segmentation method for complete and incomplete shapes. The key idea is to directly optimize the decomposition based on a characterization of the expected geometry of a part in a shape. Rather than setting the number of parts in advance, we search for the smallest number of parts that admit the geometric characterization of the parts. The segmentation is based on an intermediate-level analysis, where first the shape is decomposed into approximate convex components, which are then merged into consistent parts based on a nonlocal geometric signature. Our method is designed to handle incomplete shapes, represented by point clouds. We show segmentation results on shapes acquired by a range scanner, and an analysis of the robustness of our method to missing regions. Moreover, our method yields results that are comparable to state-of-the-art techniques evaluated on complete shapes.


title: A Survey Paper : Areas , Techniques and Challenges of Opinion Mining

text: Opinion Mining is a promising discipline, defined as an intersection of information retrieval and computational linguistic techniques to deal with the opinions expressed in a document. The field aims at solving the problems related to opinions about products, Politian in newsgroup posts, review sites, comments on Facebook posts and twitter etc. This paper is about to covers the techniques, applications, long and short future research areas, Research gaps and future challenges in opinion mining. Further, an attempt has been made to discuss in detail the use of supervised, unsupervised, machine learning and case based reasoning techniques in opinion mining to perform computational treatment of sentiments.


title: A Study of Influencing Factors for Repurchase Intention in Internet Shopping Malls

text: This research studied the effect of 15 variables on the consumers' overall satisfaction and repurchase intention in Internet shopping malls. As the value of loyal customers is incomparably high in Electronic Commerce, winning customers’ loyalty is vital to success of shopping malls. In this study, a customer is defined as one who has purchased goods or services at least once from Internet shopping malls. The research variables are demographic factors, product perceptions, customer service, perceived ease of use, site image, promotion, perceived consumer risk, personal characteristics and Internet communications environments. The outcome of the research is as follows: Perceived consumer risk shows a negative relationship with the repurchase intention, and all the other variables product perceptions, customer service, perceived ease of use, site image, promotion, communications environments are positively related with the repurchase intention. Also, the overall satisfaction level of customers for the Internet shopping malls positively influences repurchase intention.


title: Adding Chinese Captions to Images

text: This paper extends research on automated image captioning in the dimension of language, studying how to generate Chinese sentence descriptions for unlabeled images. To evaluate image captioning in this novel context, we present Flickr8k-CN, a bilingual extension of the popular Flickr8k set. The new multimedia dataset can be used to quantitatively assess the performance of Chinese captioning and English-Chinese machine translation. The possibility of re-using existing English data and models via machine translation is investigated. Our study reveals to some extent that a computer can master two distinct languages, English and Chinese, at a similar level for describing the visual world. Data is publicly available at http://tinyurl.com/flickr8kcn


title: MAGAN: Margin Adaptation for Generative Adversarial Networks

text: We propose a novel training procedure for Generative Adversarial Networks (GANs) to improve stability and performance by using an adaptive hinge loss objective function. We estimate the appropriate hinge loss margin with the expected energy of the target distribution, and derive both a principled criterion for updating the margin and an approximate convergence measure. The resulting training procedure is simple yet robust on a diverse set of datasets. We evaluate the proposed training procedure on the task of unsupervised image generation, noting both qualitative and quantitative performance improvements.


title: Efficient and fast multi-modal foreground-background segmentation using RGBD data

text: This paper addresses the problem of foreground and background segmentation. Multi-modal data specifically RGBD data has gain many tasks in computer vision recently. However, techniques for background subtraction based only on single-modality still report state-of-the-art results in many benchmarks. Succeeding the fusion of depth and color data for this task requires a robust formalization allowing at the same time higher precision and faster processing. To this end, we propose to make use of kernel density estimation technique to adapt multi-modal data. To speed up kernel density estimation, we explore the fast Gauss transform which allows the summation of a mixture of M kernel at N evaluation points in O(M+N) time as opposed to O(MN) time for a direct evaluation. Extensive experiments have been carried out on four publicly available RGBD foreground/background datasets. Results demonstrate that our proposal outperforms state-of-the-art methods for almost all of the sequences acquired in challenging indoor and outdoor contexts with a fast and non-parametric operation. c © 2017 Elsevier Ltd. All rights reserved.


title: Semi-Supervised Ensemble Ranking

text: Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance by combining the outputs from multiple ranking algorithms. Many ensemble ranking approaches employ supervised learning techniques to learn appropriate weights for combining multiple rankers. The main shortcoming with these approaches is that the learned weights for ranking algorithms are query independent. This is suboptimal since a ranking algorithm could perform well for certain queries but poorly for others. In this paper, we propose a novel semi-supervised ensemble ranking (SSER) algorithm that learns query-dependent weights when combining multiple rankers in document retrieval. The proposed SSER algorithm is formulated as an SVM-like quadratic program (QP), and therefore can be solved efficiently by taking advantage of optimization techniques that were widely used in existing SVM solvers. We evaluated the proposed technique on a standard document retrieval testbed and observed encouraging results by comparing to a number of state-of-the-art techniques.


title: Comparative evaluation of text- and citation-based plagiarism detection approaches using guttenplag

text: Various approaches for plagiarism detection exist. All are based on more or less sophisticated text analysis methods such as string matching, fingerprinting or style comparison. In this paper a new approach called Citation-based Plagiarism Detection is evaluated using a doctoral thesis, in which a volunteer crowd-sourcing project called GuttenPlag identified substantial amounts of plagiarism through careful manual inspection. This new approach is able to identify similar and plagiarized documents based on the citations used in the text. It is shown that citation-based plagiarism detection performs significantly better than text-based procedures in identifying strong paraphrasing, translation and some idea plagiarism. Detection rates can be improved by combining citation-based with text-based plagiarism detection.


title: Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms

text: Wireless Mesh networks (WMNs) can partially replace the wired backbone of traditional wireless access networks and, similarly, they require to carefully plan radio resource assignment in order to provide the same quality guarantees to traffic flows. In this paper we study the radio resource assignment optimization problem in Wireless Mesh Networks assuming a time division multiple access (TDMA) scheme, a dynamic power control able to vary emitted power slot-by-slot, and a rate adaptation mechanism that sets transmission rates according to the signalto-interference-and-noise ratio (SINR). The proposed optimization framework includes routing, scheduling and channel assignment. Quality requirements of traffic demands are expressed in terms of minimum bandwidth and modeled with constraints defining the number of information units (packets) that must be delivered per frame. We consider an alternative problem formulation where decision variables represent compatible sets of links active in the same slot and channel, called configurations. We propose a two phases solution approach where a set of configurations is first selected to meet traffic requirements along the best available paths, and then configurations are assigned to channels according to device characteristics and constraints. The optimization goal is to minimize the number of used slots, which is directly related to the global resource allocation efficiency. We provide a lower bound of the optimal solution solving the continuous relaxation of problem formulation. Moreover, we propose a heuristic approach to determine practical integer solutions (upper bound). Since configuration variables are exponentially many, our solution approaches are based on the Column Generation technique. In order to assess the effectiveness of the proposed algorithms we show the numerical results obtained on a set of realistic-size randomly generated instances.


title: A high performance 76.5 GHz FMCW RADAR for advanced driving assistance system

text: Frequency modulated Continuous Wave (FMCW) is continuous wave RADAR widely used for Intelligent Adaptive Cruise Control (ACC) and Collision Warning System (CWS). The paper presents a design and simulation of millimeter wave FMCW RADAR. Paper introduces a mathematical modeling of a FMCW RADAR including its target model. Design of a 76.5 GHz FMCW RADAR & its target model by using Advanced Design System (ADS) software and target range & velocity at various conditions are employed in the simulated FMCW RADAR system to verify the operation of the system.


title: CANAuth - A Simple, Backward Compatible Broadcast Authentication Protocol for CAN bus

text: The Controller-Area Network (CAN) bus protocol [1] is a bus protocol invented in 1986 by Robert Bosch GmbH, originally intended for automotive use. By now, the bus can be found in devices ranging from cars and trucks, over lightning setups to industrial looms. Due to its nature, it is a system very much focused on safety, i.e., reliability. Unfortunately, there is no build-in way to enforce security, such as encryption or authentication. In this paper, we investigate the problems associated with implementing a backward compatible message authentication protocol on the CAN bus. We show which constraints such a protocol has to meet and why this eliminates, to the best of our knowledge, all the authentication protocols published so far. Furthermore, we present a message authentication protocol, CANAuth, that meets all of the requirements set forth and does not violate any constraint of the CAN bus. Keywords—CAN bus, embedded networks, broadcast authentication, symmetric cryptography


title: Finding social roles in Wikipedia

text: This paper investigates some of the social roles people play in the online community of Wikipedia. We start from qualitative comments posted on community oriented pages, wiki project memberships, and user talk pages in order to identify a sample of editors who represent four key roles: substantive experts, technical editors, vandal fighters, and social networkers. Patterns in edit histories and egocentric network visualizations suggest potential "structural signatures" that could be used as quantitative indicators of role adoption. Using simple metrics based on edit histories we compare two samples of Wikipedians: a collection of long term dedicated editors, and a cohort of editors from a one month window of new arrivals. According to these metrics, we find that the proportions of editor types in the new cohort are similar those observed in the sample of dedicated contributors. The number of new editors playing helpful roles in a single month's cohort nearly equal the number found in the dedicated sample. This suggests that informal socialization has the potential provide sufficient role related labor despite growth and change in Wikipedia. These results are preliminary, and we describe several ways that the method can be improved, including the expansion and refinement of role signatures and identification of other important social roles.


title: Active Magnetic Anomaly Detection Using Multiple Micro Aerial Vehicles

text: Magnetic anomaly detection (MAD) is an important problem in applications ranging from geological surveillance to military reconnaissance. MAD sensors detect local disturbances in the magnetic field, which can be used to detect the existence of and to estimate the position of buried, hidden, or submerged objects, such as ore deposits or mines. These sensors may experience false positive and false negative detections and, without prior knowledge of the targets, can only determine proximity to a target. The uncertainty in the sensors, coupled with a lack of knowledge of even the existence of targets, makes the estimation and control problems challenging. We utilize a hierarchical decomposition of the environment, coupled with an estimation algorithm based on random finite sets, to determine the number of and the locations of targets in the environment. The small team of robots follow the gradient of mutual information between the estimated set of targets and the future measurements, locally maximizing the rate of information gain. We present experimental results of a team of quadrotor micro aerial vehicles discovering and localizing an unknown number of permanent magnets.


title: Demand Side Management in Smart Grid Using Heuristic Optimization

text: Demand side management (DSM) is one of the important functions in a smart grid that allows customers to make informed decisions regarding their energy consumption, and helps the energy providers reduce the peak load demand and reshape the load profile. This results in increased sustainability of the smart grid, as well as reduced overall operational cost and carbon emission levels. Most of the existing demand side management strategies used in traditional energy management systems employ system specific techniques and algorithms. In addition, the existing strategies handle only a limited number of controllable loads of limited types. This paper presents a demand side management strategy based on load shifting technique for demand side management of future smart grids with a large number of devices of several types. The day-ahead load shifting technique proposed in this paper is mathematically formulated as a minimization problem. A heuristic-based Evolutionary Algorithm (EA) that easily adapts heuristics in the problem was developed for solving this minimization problem. Simulations were carried out on a smart grid which contains a variety of loads in three service areas, one with residential customers, another with commercial customers, and the third one with industrial customers. The simulation results show that the proposed demand side management strategy achieves substantial savings, while reducing the peak load demand of the smart grid.


title: Cookie Hijacking in the Wild : Security and Privacy Implications

text: The widespread demand for online privacy, also fueled by widely-publicized demonstrations of session hijacking attacks against popular websites, has spearheaded the increasing deployment of HTTPS. However, many websites still avoid ubiquitous encryption due to performance or compatibility issues. The prevailing approach in these cases is to force critical functionality and sensitive data access over encrypted connections, while allowing more innocuous functionality to be accessed over HTTP. In practice, this approach is prone to flaws that can expose sensitive information or functionality to third parties. In this work, we conduct an in-depth assessment of a diverse set of major websites and explore what functionality and information is exposed to attackers that have hijacked a user’s HTTP cookies. We identify a recurring pattern across websites with partially deployed HTTPS; service personalization inadvertently results in the exposure of private information. The separation of functionality across multiple cookies with different scopes and inter-dependencies further complicates matters, as imprecise access control renders restricted account functionality accessible to non-session cookies. Our cookie hijacking study reveals a number of severe flaws; attackers can obtain the user’s home and work address and visited websites from Google, Bing and Baidu expose the user’s complete search history, and Yahoo allows attackers to extract the contact list and send emails from the user’s account. Furthermore, e-commerce vendors such as Amazon and Ebay expose the user’s purchase history (partial and full respectively), and almost every website exposes the user’s name and email address. Ad networks like Doubleclick can also reveal pages the user has visited. To fully evaluate the practicality and extent of cookie hijacking, we explore multiple aspects of the online ecosystem, including mobile apps, browser security mechanisms, extensions and search bars. To estimate the extent of the threat, we run IRB-approved measurements on a subset of our university’s public wireless network for 30 days, and detect over 282K accounts exposing the cookies required for our hijacking attacks. We also explore how users can protect themselves and find that, while mechanisms such as the EFF’s HTTPS Everywhere extension can reduce the attack surface, HTTP cookies are still regularly exposed. The privacy implications of these attacks become even more alarming when considering how they can be used to deanonymize Tor users. Our measurements suggest that a significant portion of Tor users may currently be vulnerable to cookie hijacking.


title: Learning Profiles in Duplicate Question Detection

text: This paper presents the results of systematic and comparative experimentation with major types of methodologies for automatic duplicate question detection when these are applied to datasets of progressively larger sizes, thus allowing to study the learning profiles of this task under these different approaches and evaluate their merits. This study was made possible by resorting to the recent release for research purposes, by the Quora online question answering engine, of a new dataset with over 400,000 pairs labeled with respect to their elements being duplicate interrogative segments.


title: Neurobiology of Schizophrenia

text: With its hallucinations, delusions, thought disorder, and cognitive deficits, schizophrenia affects the most basic human processes of perception, emotion, and judgment. Evidence increasingly suggests that schizophrenia is a subtle disorder of brain development and plasticity. Genetic studies are beginning to identify proteins of candidate genetic risk factors for schizophrenia, including dysbindin, neuregulin 1, DAOA, COMT, and DISC1, and neurobiological studies of the normal and variant forms of these genes are now well justified. We suggest that DISC1 may offer especially valuable insights. Mechanistic studies of the properties of these candidate genes and their protein products should clarify the molecular, cellular, and systems-level pathogenesis of schizophrenia. This can help redefine the schizophrenia phenotype and shed light on the relationship between schizophrenia and other major psychiatric disorders. Understanding these basic pathologic processes may yield novel targets for the development of more effective treatments.


title: The design and implementation of microdrivers

text:
Device drivers commonly execute in the kernel to achieve high performance and easy access to kernel services. However, this comes at the price of decreased reliability and increased programming difficulty. Driver programmers are unable to use user-mode development tools and must instead use cumbersome kernel tools. Faults in kernel drivers can cause the entire operating system to crash. User-mode drivers have long been seen as a solution to this problem, but suffer from either poor performance or new interfaces that require a rewrite of existing drivers.
 This paper introduces the Microdrivers architecture that achieves high performance and compatibility by leaving critical path code in the kernel and moving the rest of the driver code to a user-mode process. This allows data-handling operations critical to I/O performance to run at full speed, while management operations such as initialization and configuration run at reduced speed in user-level. To achieve compatibility, we present DriverSlicer, a tool that splits existing kernel drivers into a kernel-level component and a user-level component using a small number of programmer annotations. Experiments show that as much as 65% of driver code can be removed from the kernel without affecting common-case performance, and that only 1-6 percent of the code requires annotations.


title: XFI: Software Guards for System Address Spaces

text: XFI is a comprehensive protection system that offers both flexible access control and fundamental integrity guarantees, at any privilege level and even for legacy code in commodity systems. For this purpose, XFI combines static analysis with inline software guards and a two-stack execution model. We have implemented XFI for Windows on the x86 architecture using binary rewriting and a simple, stand-alone verifier; the implementation's correctness depends on the verifier, but not on the rewriter. We have applied XFI to software such as device drivers and multimedia codecs. The resulting modules function safely within both kernel and user-mode address spaces, with only modest enforcement overheads.


title: CuriOS: Improving Reliability through Operating System Structure

text: An error that occurs in a microkernel operating system service can potentially result in state corruption and service failure. A simple restart of the failed service is not always the best solution for reliability. Blindly restarting a service which maintains client-related state such as session information results in the loss of this state and affects all clients that were using the service. CuriOS represents a novel OS design that uses lightweight distribution, isolation and persistence of OS service state to mitigate the problem of state loss during a restart. The design also significantly reduces error propagation within client-related state maintained by an OS service. This is achieved by encapsulating services in separate protection domains and granting access to client-related state only when required for request processing. Fault injection experiments show that it is possible to recover from between 87% and 100% of manifested errors in OS services such as the file system, network, timer and scheduler while maintaining low performance overheads.


title: CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs

text: This paper describes the C Intermediate Language: a highlevel representation along with a set of tools that permit easy analysis and source-to-source transformation of C programs. Compared to C, CIL has fewer constructs. It breaks down certain complicated constructs of C into simpler ones, and thus it works at a lower level than abstract-syntax trees. But CIL is also more high-level than typical intermediate languages (e.g., three-address code) designed for compilation. As a result, what we have is a representation that makes it easy to analyze and manipulate C programs, and emit them in a form that resembles the original source. Moreover, it comes with a front-end that translates to CIL not only ANSI C programs but also those using Microsoft C or GNU C extensions. We describe the structure of CIL with a focus on how it disambiguates those features of C that we found to be most confusing for program analysis and transformation. We also describe a whole-program merger based on structural type equality, allowing a complete project to be viewed as a single compilation unit. As a representative application of CIL, we show a transformation aimed at making code immune to stack-smashing attacks. We are currently using CIL as part of a system that analyzes and instruments C programs with run-time checks to ensure type safety. CIL has served us very well in this project, and we believe it can usefully be applied in other situations as well.


title: Thorough static analysis of device drivers

text: Bugs in kernel-level device drivers cause 85% of the system crashes in the Windows XP operating system [44]. One of the sources of these errors is the complexity of the Windows driver API itself: programmers must master a complex set of rules about how to use the driver API in order to create drivers that are good clients of the kernel. We have built a static analysis engine that finds API usage errors in C programs. The Static Driver Verifier tool (SDV) uses this engine to find kernel API usage errors in a driver. SDV includes models of the OS and the environment of the device driver, and over sixty API usage rules. SDV is intended to be used by driver developers "out of the box." Thus, it has stringent requirements: (1) complete automation with no input from the user; (2) a low rate of false errors. We discuss the techniques used in SDV to meet these requirements, and empirical results from running SDV on over one hundred Windows device drivers.


title: Why We Need New Evaluation Metrics for NLG

text: The majority of NLG evaluation relies on automatic metrics, such as BLEU. In this paper, we motivate the need for novel, systemand data-independent automatic evaluation methods: We investigate a wide range of metrics, including state-of-the-art word-based and novel grammar-based ones, and demonstrate that they only weakly reflect human judgements of system outputs as generated by data-driven, end-to-end NLG. We also show that metric performance is dataand system-specific. Nevertheless, our results also suggest that automatic metrics perform reliably at system-level and can support system development by finding cases where a system performs poorly.


title: Living in two homes-a Swedish national survey of wellbeing in 12 and 15 year olds with joint physical custody

text:
BACKGROUND
The practice of joint physical custody, where children spend equal time in each parent's home after they separate, is increasing in many countries. It is particularly common in Sweden, where this custody arrangement applies to 30 per cent of children with separated parents. The aim of this study was to examine children's health-related quality of life after parental separation, by comparing children living with both parents in nuclear families to those living in joint physical custody and other forms of domestic arrangements.

METHODS
Data from a national Swedish classroom study of 164,580 children aged 12 and 15-years-old were analysed by two-level linear regression modelling. Z-scores were used to equalise scales for ten dimensions of wellbeing from the KIDSCREEN-52 and the KIDSCREEN-10 Index and analysed for children in joint physical custody in comparison with children living in nuclear families and mostly or only with one parent.

RESULTS
Living in a nuclear family was positively associated with almost all aspects of wellbeing in comparison to children with separated parents. Children in joint physical custody experienced more positive outcomes, in terms of subjective wellbeing, family life and peer relations, than children living mostly or only with one parent. For the 12-year-olds, beta coefficients for moods and emotions ranged from -0.20 to -0.33 and peer relations from -0.11 to -0.20 for children in joint physical custody and living mostly or only with one parent. The corresponding estimates for the 15-year-olds varied from -0.08 to -0.28 and from -0.03 to -0.13 on these subscales. The 15-year-olds in joint physical custody were more likely than the 12-year-olds to report similar wellbeing levels on most outcomes to the children in nuclear families.

CONCLUSIONS
Children who spent equal time living with both parents after a separation reported better wellbeing than children in predominantly single parent care. This was particularly true for the 15-year-olds, while the reported wellbeing of 12-years-olds was less satisfactory. There is a need for further studies that can account for the pre and post separation context of individual families and the wellbeing of younger age groups in joint physical custody.


title: Reaching Agreement in the Presence of Faults

text:
The problem addressed here concerns a set of isolated processors, some unknown subset of which may be faulty, that communicate only by means of two-party messages. Each nonfaulty processor has a private value of information that must be communicated to each other nonfaulty processor. Nonfaulty processors always communicate honestly, whereas faulty processors may lie. The problem is to devise an algorithm in which processors communicate their own values and relay values received from others that allows each nonfaulty processor to infer a value for each other processor. The value inferred for a nonfaulty processor must be that processor's private value, and the value inferred for a faulty one must be consistent with the corresponding value inferred by each other nonfaulty processor.
It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number. It is also shown that if faulty processors can refuse to pass on information but cannot falsely relay information, the problem is solvable for arbitrary n ≥ m ≥ 0. This weaker assumption can be approximated in practice using cryptographic methods.


title: User privacy risk calculator

text: User privacy is becoming an issue on the Internet due to common data breaches and various security threats. Services tend to require private user data in order to provide more personalized content and users are typically unaware of potential risks to their privacy. This paper proposes a risk calculator based on a feedforward neural network that will provide users with an ability to calculate risks to their privacy. The proposed calculator is evaluated on a set of real world example scenarios. Furthermore, to give more insight into privacy issues, each estimated risk is explained by several real life scenarios that might happen if the observed parameters are obtained by an attacker. In turn, this should raise user awareness and knowledge about privacy issues on the Internet.


title: VALUE , RARENESS , COMPETITIVE ADVANTAGE , AND PERFORMANCE : A CONCEPTUAL-LEVEL EMPIRICAL INVESTIGATION OF THE RESOURCE-BASED VIEW OF THE FIRM

text: The resource-based view of the firm (RBV) hypothesizes that the exploitation of valuable, rare resources and capabilities contributes to a firm’s competitive advantage, which in turn contributes to its performance. Despite this notion, few empirical studies test these hypotheses at the conceptual level. In response to this gap, this study empirically examines the relationships between value, rareness, competitive advantage, and performance. The results suggest that value and rareness are related to competitive advantage, that competitive advantage is related to performance, and that competitive advantage mediates the rareness-performance relationship. These findings have important academic and practitioner implications which are then discussed. Copyright  2008 John Wiley & Sons, Ltd.


title: A Configurable 12–237 kS/s 12.8 mW Sparse-Approximation Engine for Mobile Data Aggregation of Compressively Sampled Physiological Signals

text: Compressive sensing (CS) is a promising technology for realizing low-power and cost-effective wireless sensor nodes (WSNs) in pervasive health systems for 24/7 health monitoring. Due to the high computational complexity (CC) of the reconstruction algorithms, software solutions cannot fulfill the energy efficiency needs for real-time processing. In this paper, we present a 12-237 kS/s 12.8 mW sparse-approximation (SA) engine chip that enables the energy-efficient data aggregation of compressively sampled physiological signals on mobile platforms. The SA engine chip integrated in 40 nm CMOS can support the simultaneous reconstruction of over 200 channels of physiological signals while consuming (1% of a smartphone's power budget. Such energyefficient reconstruction enables two-to-three times energy saving at the sensor nodes in a CS-based health monitoring system as compared to traditional Nyquist-based systems, while providing timely feedback and bringing signal intelligence closer to the user.


title: Dragonfly wing nodus: A one-way hinge contributing to the asymmetric wing deformation.

text:
Dragonfly wings are highly specialized locomotor systems, which are formed by a combination of several structural components. The wing components, also known as structural elements, are responsible for the various aspects of the wing functionality. Considering the complex interactions between the wing components, modelling of the wings as a whole is only possible with inevitable huge oversimplifications. In order to overcome this difficulty, we have recently proposed a new approach to model individual components of complex wings comparatively. Here, we use this approach to study nodus, a structural element of dragonfly wings which has been less studied to date. Using a combination of several imaging techniques including scanning electron microscopy (SEM), wide-field fluorescence microscopy (WFM), confocal laser scanning microscopy (CLSM) and micro-computed tomography (micro-CT) scanning, we aim to characterize the spatial morphology and material composition of fore- and hindwing nodi of the dragonfly Brachythemis contaminata. The microscopy results show the presence of resilin in the nodi, which is expected to help the deformability of the wings. The computational results based on three-dimensional (3D) structural data suggest that the specific geometry of the nodus restrains its displacements when subjected to pressure on the ventral side. This effect, resulting from an interlocking mechanism, is expected to contribute to the dorso-ventral asymmetry of wing deformation and to provide a higher resistance to aerodynamic forces during the downstroke. Our results provide an important step towards better understanding of the structure-property-function relationship in dragonfly wings.

STATEMENT OF SIGNIFICANCE
In this study, we investigate the wing nodus, a specialized wing component in dragonflies. Using a combination of modern imaging techniques, we demonstrate the presence of resilin in the nodus, which is expected to facilitate the wing deformability in flight. The specific geometry of the nodus, however, seems to restrain its displacements when subjected to pressure on the ventral side. This effect, resulting from an interlocking mechanism, is suggested to contribute to dorso-ventral asymmetry of wing deformations and to provide a higher resistance to aerodynamic forces during the downstroke. Our results provide an important step towards better understanding of the structure-property-function relationship in dragonfly wings and might help to design more efficient wings for biomimetic micro-air vehicles.


title: Single-stage 6.78 MHz power-amplifier design using high-voltage GaN power ICs for wireless charging applications

text: Traditional power amplifiers for wireless power transfer require a low voltage dc power supply generated by a power adapter. This multi-stage power conversion solution reduces the overall efficiency. A single-stage “AC-RF” power amplifier architecture using a phase-modulated full-bridge topology and high voltage GaN Power ICs is proposed to directly generate 6.78 MHz wireless power from a rectified ac source. A 50W power amplifier is built and achieves 90% ac-to-coil efficiency, which reduces overall power loss by half, comparing to existing multi-stage solutions. The operating principle of a phase-shifted full bridge power amplifier is discussed, and analytical equations are provided for the passive filter network design. A coupled ZVS-tank scheme is also proposed to improve efficiency.


title: Batch Mode Active Learning for Regression With Expected Model Change

text: While active learning (AL) has been widely studied for classification problems, limited efforts have been done on AL for regression. In this paper, we introduce a new AL framework for regression, expected model change maximization (EMCM), which aims at choosing the unlabeled data instances that result in the maximum change of the current model once labeled. The model change is quantified as the difference between the current model parameters and the updated parameters after the inclusion of the newly selected examples. In light of the stochastic gradient descent learning rule, we approximate the change as the gradient of the loss function with respect to each single candidate instance. Under the EMCM framework, we propose novel AL algorithms for the linear and nonlinear regression models. In addition, by simulating the behavior of the sequential AL policy when applied for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> iterations, we further extend the algorithms to batch mode AL to simultaneously choose a set of <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> most informative instances at each query time. Extensive experimental results on both UCI and StatLib benchmark data sets have demonstrated that the proposed algorithms are highly effective and efficient.


title: End-to-End Sound Source Separation Conditioned On Instrument Labels

text: Can we perform an end-to-end sound source separation (SSS) with a variable number of sources using a deep learning model? This paper presents an extension of the WaveU-Net [1] model which allows end-to-end monaural source separation with a non-fixed number of sources. Furthermore, we propose multiplicative conditioning with instrument labels at the bottleneck of the Wave-U-Net and show its effect on the separation results. This approach can be further extended to other types of conditioning such as audio-visual SSS and score-informed SSS.