Universal Planning Networks-Long Version + Supplementary. A key challenge in complex visuomotor control is learning abstract representations that are effective for specifying goals, planning, and generalization. To this end, we introduce universal planning networks (UPN). UPNs embed differentiable planning within a goal-directed policy. This planning computation unrolls a forward model in a latent space and infers an optimal action plan through gradient descent trajectory optimization. The plan-by-gradient-descent process and its underlying representations are learned end-to-end to directly optimize a supervised imitation learning objective. We find that the representations learned are not only effective for goal-directed visual imitation via gradient-based trajectory optimization, but can also provide a metric for specifying goals using images. The learned representations can be leveraged to specify distance-based rewards to reach new target states for model-free reinforcement learning, resulting in substantially more effective learning when solving new tasks described via image-based goals. We were able to achieve successful transfer of visuomotor planning strategies across robots with significantly different morphologies and actuation capabilities.

Question: How do we learn abstract representations for planning?


Oral stimulation for promoting oral feeding in preterm infants.. BACKGROUND Preterm infants (< 37 weeks' postmenstrual age) are often delayed in attaining oral feeding. Normal oral feeding is suggested as an important outcome for the timing of discharge from the hospital and can be an early indicator of neuromotor integrity and developmental outcomes. A range of oral stimulation interventions may help infants to develop sucking and oromotor co-ordination, promoting earlier oral feeding and earlier hospital discharge.   OBJECTIVES To determine the effectiveness of oral stimulation interventions for attainment of oral feeding in preterm infants born before 37 weeks' postmenstrual age (PMA).To conduct subgroup analyses for the following prespecified subgroups.• Extremely preterm infants born at < 28 weeks' PMA.• Very preterm infants born from 28 to < 32 weeks' PMA.• Infants breast-fed exclusively.• Infants bottle-fed exclusively.• Infants who were both breast-fed and bottle-fed.   SEARCH METHODS We used the standard search strategy of the Cochrane Neonatal Review Group to search the Cochrane Central Register of Controlled Trials (CENTRAL), MEDLINE via PubMed (1966 to 25 February 2016), Embase (1980 to 25 February 2016) and the Cumulative Index to Nursing and Allied Health Literature (CINAHL; 1982 to 25 February 2016). We searched clinical trials databases, conference proceedings and the reference lists of retrieved articles.   SELECTION CRITERIA Randomised and quasi-randomised controlled trials comparing a defined oral stimulation intervention with no intervention, standard care, sham treatment or non-oral intervention in preterm infants and reporting at least one of the specified outcomes.   DATA COLLECTION AND ANALYSIS One review author searched the databases and identified studies for screening. Two review authors screened the abstracts of these studies and full-text copies when needed to identify trials for inclusion in the review. All review authors independently

Question: What is the difference between oral stimulation and oral stimulation interventions?


Self-supervised regrasping using spatio-temporal tactile features and reinforcement learning. We introduce a framework for learning regrasping behaviors based on tactile data. First, we present a grasp stability predictor that uses spatio-temporal tactile features collected from the early-object-lifting phase to predict the grasp outcome with a high accuracy. Next, the trained predictor is used to supervise and provide feedback to a reinforcement learning algorithm that learns the required grasp adjustments based on tactile feedback. Our results gathered over more than 50 hours of real robot experiments indicate that the robot is able to predict the grasp outcome with 93% accuracy. In addition, the robot is able to improve the grasp success rate from 42% when randomly grasping an object to up to 97% when allowed to regrasp the object in case of a predicted failure.

Question: How to predict the grasp outcome?


OpenFlow: enabling innovation in campus networks. This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. OpenFlow is based on an Ethernet switch, with an internal flow-table, and a standardized interface to add and remove flow entries. Our goal is to encourage networking vendors to add OpenFlow to their switch products for deployment in college campus backbones and wiring closets. We believe that OpenFlow is a pragmatic compromise: on one hand, it allows researchers to run experiments on heterogeneous switches in a uniform way at line-rate and with high port-density; while on the other hand, vendors do not need to expose the internal workings of their switches. In addition to allowing researchers to evaluate their ideas in real-world traffic settings, OpenFlow could serve as a useful campus component in proposed large-scale testbeds like GENI. Two buildings at Stanford University will soon run OpenFlow networks, using commercial Ethernet switches and routers. We will work to encourage deployment at other schools; and We encourage you to consider deploying OpenFlow in your university network too

Question: What is the difference between a line-rate and a gigabit switch?


Robot navigation: Review of techniques and research challenges. Robot navigation has multi-spectral applications across a plethora of industries. Being one of the fastest evolving field of Artificial intelligence, it has garnered a lot of speculation and the problem of efficient Robot navigation has become a talking point in the "Artificial Intelligence research community". Robot Navigation can be thought of as a collection of sub-problems that when solved efficiently will (most likely) give the complete and the most efficient solution. While the main Navigation problem can be divided into numerous smaller ones some of the prevalent (sub)-tasks associated with Robot Navigation are Path Planning, Collision Prevention, Search Algorithm and an appropriate pictorial (graphical) representation of the given environment. Path Planning gives us the most optimal path finding approach while keeping the dynamism of the environment and the objects in mind. Collision Prevention ensures the Robot reaches its goal without colliding with any of the objects present in the environment. Collision Prevention techniques' vitality increases considerably when the number of objects in the input space is large (>10, approximately). Search Algorithms are the functional units of this problem as they determine the path the Robot follows while traveling to its destination. Since the environment greatly affects the choice of technique for all the other tasks it is vital to have a clear, concise and a non-ambiguous representation of the same. The main aim of the paper is to summarise the development of various techniques in the multiple domains of the Robot Navigation problem in the last fifteen years (2000-2015) while stating the scope and the restriction of each of them.

Question: What is the scope of the paper?


Deep Learning for the Classification of Lung Nodules. Deep learning, as a promising new area of machine learning, has attracted a rapidly increasing attention in the field of medical imaging. Compared to the conventional machine learning methods, deep learning requires no hand-tuned feature extractor, and has shown a superior performance in many visual object recognition applications. In this study, we develop a deep convolutional neural network (CNN) and apply it to thoracic CT images for the classification of lung nodules. We present the CNN architecture and classification accuracy for the original images of lung nodules. In order to understand the features of lung nodules, we further construct new datasets, based on the combination of artificial geometric nodules and some transformations of the original images, as well as a stochastic nodule shape model. It is found that simplistic geometric nodules cannot capture the important features of lung nodules.

Question: What is a deep learning algorithm?


SphereFlow: 6 DoF Scene Flow from RGB-D Pairs. We take a new approach to computing dense scene flow between a pair of consecutive RGB-D frames. We exploit the availability of depth data by seeking correspondences with respect to patches specified not as the pixels inside square windows, but as the 3D points that are the inliers of spheres in world space. Our primary contribution is to show that by reasoning in terms of such patches under 6 DoF rigid body motions in 3D, we succeed in obtaining compelling results at displacements large and small without relying on either of two simplifying assumptions that pervade much of the earlier literature: brightness constancy or local surface planarity. As a consequence of our approach, our output is a dense field of 3D rigid body motions, in contrast to the 3D translations that are the norm in scene flow. Reasoning in our manner additionally allows us to carry out occlusion handling using a 6 DoF consistency check for the flow computed in both directions and a patchwise silhouette check to help reason about alignments in occlusion areas, and to promote smoothness of the flow fields using an intuitive local rigidity prior. We carry out our optimization in two steps, obtaining a first correspondence field using an adaptation of PatchMatch, and subsequently using alpha-expansion to jointly handle occlusions and perform regularization. We show attractive flow results on challenging synthetic and real-world scenes that push the practical limits of the aforementioned assumptions.

Question: What is the difference between a 6 DoF rigid body motion and a 3D translation?


The Impact of Training and Social Norms on Information Security Compliance: A Pilot Study. Security training has been shown to be an important factor that impacts employees' intentions to comply with organization's security policies. In this study, we define and then study the impact of two sub-constructs of security training, threat appraisal and policy awareness, on intentions to comply with organizational security policies. Injunctive and descriptive norms, which are standards of behavior that recommends and forbids behavior in specific circumstances, have been hypothesized as mediators between training constructs and behavioral intention to comply. We pilot-tested our proposed set of hypotheses with survey data collected from 69 employees in a higher education institute. Results supported our proposed model. Based on the findings, implications for theory and practices are discussed.

Question: What is the impact of training on information security compliance?


Through mold vias for stacking of mold embedded packages. The constant drive towards further miniaturization and heterogeneous system integration leads to a need for new packaging technologies which also allow large area processing and 3D integration with potential for low cost applications. Large area mold embedding technologies and embedding of active components into printed circuit boards (Chip-in-Polymer) are two major packaging trends in this area. This paper describes the use of a novel S2iP (Stacked System in Package) interconnect technique using advanced molding process for multi chip embedding in combination with large area and low cost redistribution technology derived from printed circuit board manufacturing with a focus on integration of through mold vias for package stacking. The use of compression molding equipment with liquid or granular epoxy molding compounds for the targeted integration process flow is a new technology that has been especially developed to allow large area embedding of single chips but also of multiple chips or heterogeneous systems on wafer scale, typically 8" to 12". Future developments will deal with panel sizes up to 470 × 370 mm². The wiring of the embedded components in this novel type of SiP is done using PCB manufacturing technologies, i.e. a resin coated copper (RCC) film is laminated over the embedded components — whichever no matter which shape they are: a compression molded wafer or a larger rectangular area of a Molded Array Package (MAP). Interconnects are formed by laser drilling to die pads and electroplating — all of them making use of standard PCB processes. Thus, through vias which are standard features in PCB manufacturing and can be also integrated in the proposed process flow for mold embedding in combination with RCC based redistribution. Vias were drilled by laser or mechanically after RCC lamination and were metalized together with the vias for chip interconnection. Within this study different liquid and gr

Question: What is the difference between a mold embedded package and a stacked system in package?


Interaction in the segmentation of medical images: A survey. Segmentation of the object of interest is a difficult step in the analysis of digital images. Fully automatic methods sometimes fail, producing incorrect results and requiring the intervention of a human operator. This is often true in medical applications, where image segmentation is particularly difficult due to restrictions imposed by image acquisition, pathology and biological variation. In this paper we present an early review of the largely unknown territory of human-computer interaction in image segmentation. The purpose is to identify patterns in the use of interaction and to develop qualitative criteria to evaluate interactive segmentation methods. We discuss existing interactive methods with respect to the following aspects: the type of information provided by the user, how this information affects the computational part, and the purpose of interaction in the segmentation process. The discussion is based on the potential impact of each strategy on the accuracy, repeatability and interaction efficiency. Among others, these are important aspects to characterise and understand the implications of interaction to the results generated by an interactive segmentation method. This survey is focused on medical imaging, however similar patterns are expected to hold for other applications as well.

Question: What is the purpose of interaction in image segmentation?


DDoS: threats and mitigation. According to a report from Prolexic, one of the first and largest companies offering DDoS mitigation services,  attack traffic rose 66% over the course of a year (to Q3 2011). 1 Network-layer attacks accounted for 83%, the rest being application-layer attacks. The average duration was 1.4 days and the average bandwidth consumed was 1.5Gbps. The size of attacks is getting bigger, too. In July 2011, Prolexic announced it had mitigated what it believed to be the largest packet-per-second DDoS attack ever seen in Asia. Consisting of SYN and ICMP floods, the attack deployed 176,000 bots (compared to the 5,000-10,000 bots more normally seen by Prolexic) to generate 25 million packets per second. According to the company, the majority of high-end border rout-ers typically forward 70,000 packets per second. It mitigated the attack by distributing traffic among its Tier 1 carrier partners and scrubbing centres. Ben Petro, senior VP network intelligence & availability at Verisign, traces the rise of DDoS attacks back another year. He says that for years there was little awareness of the problem but that, " 2010 was a dramatic shift – not only in the size, scale and trajectory of DDoS, but also in its proliferation and the number of different types of organisation that were hit. " In the years 2006-2008, he adds, the average attack was somewhere around 40Mbps. " And then, all of a sudden, coming in 2010 we started to see 2Gbps, then 5Gbps, then 8Gbps and 15Gbps attacks, culminating in the largest that we've seen coming in at 84Gbps sustained for a week and a half. That is an incredible amount of traffic when you get down to packets or queries per second – you're over the hundreds of thousands of queries per second per location for Verisign, and we have 165 locations. So it's an enormous volume. " The rising popularity of DDoS attacks may be connected directly to their effectiveness. Paul Sop, CTO at Prolexic, says, " people get creative and they

Question: What is the largest DDoS attack ever?


Modular joint design for performance enhanced humanoid robot LOLA. The paper presents the performance enhanced humanoid robot LOLA which is currently being manufactured. The goal of the project is the realization of a fast, human-like walking motion. The robot is characterized by its lightweight construction, a modular, multi-sensory joint design with brushless motors and an electronics architecture using decentralized joint controllers. The fusion of motor, gear and sensors into a highly integrated, mechatronic joint module has several advantages for the whole system, including high power density, good dynamic performance and reliability. Additional degrees of freedom are introduced in elbow, waist and toes. Linear actuators are employed for the knee joints for a better mass distribution in the legs

Question: What is the goal of the project?


Stable Proportional-Derivative Controllers. In computer animation, the proportional-derivative (PD) controller is a common technique for tracking characters' motion. A new formulation of the PD controller-stable PD (SPD)-allows arbitrarily high gains, even at large time steps. The key is to determine joint forces and torques while taking into account the character's positions and velocities in the next time step. SPD is stable even when combined with a physics simulator that uses simple Euler integration. SPD controllers have a variety of uses, including motion tracking in a physics simulator, keyframe interpolation with secondary motion, and constraint satisfaction for simulation.

Question: What is a stable proportional-derivative controller?


Side-channel leakage aware instruction scheduling. Speed-optimized side-channel protected software implementations of block ciphers are important for the security of embedded IoT devices based on general-purpose microcontrollers. The recent work of Schwabe et al. published at SAC 2016 introduced a bit-sliced implementation of AES and a first-order Boolean-masked version of it, targeting ARM Cortex-M CPU cores. The authors claim to be secure against timing as well as first-order power and electromagnetic side-channel attacks. However, the author's security claims are not taking the actual leakage characteristics of the underlying CPU architecture into account, hence making the scheme potentially vulnerable to first-order attacks in practice. In this work we show indeed that such a masking scheme can be attacked very easily by first-order electromagnetic side-channel attacks. In order to fix the issue and provide practical first-order security, we provide a strategy to schedule program instructions in way that the specific leakage of the CPU does not impair the side-channel countermeasure.

Question: What is the first-order side-channel attack?


A novel tri-state boost PFC converter with fast dynamic performance. Dynamic response of boost power factor correction (PFC) converter operating in continuous-conduction mode (CCM) is heavily influenced by low-bandwidth of voltage control loop. A novel tri-state boost PFC converter operating in pseudo-continuous-conduction mode (PCCM) is proposed in this paper. An additional degree of control-freedom introduced by a freewheeling switching control interval helps to achieve PFC control. A simple and fast voltage control loop can be used to maintain a constant output voltage. Furthermore, compared with boost PFC converter operating in conventional discontinuous-conduction mode (DCM), boost PFC converter operating in PCCM demonstrates greatly improved current handling capability with reduced current and voltage ripples. Analytical and simulation results of the tri-state boost PFC converter have been presented and compared with those of the boost PFC converter operating in conventional CCM and DCM. Simulation results show excellent dynamic performance of the tri-state boost PFC converter.

Question: What is the difference between boost PFC converter operating in CCM and DCM?


Class Noise vs. Attribute Noise: A Quantitative Study. Real-world data is never perfect and can often suffer from corruptions (noise) that may impact interpretations of the data, models created from the data and decisions made based on the data. Noise can reduce system performance in terms of classification accuracy, time in building a classifier and the size of the classifier. Accordingly, most existing learning algorithms have integrated various approaches to enhance their learning abilities from noisy environments, but the existence of noise can still introduce serious negative impacts. A more reasonable solution might be to employ some preprocessing mechanisms to handle noisy instances before a learner is formed. Unfortunately, rare research has been conducted to systematically explore the impact of noise, especially from the noise handling point of view. This has made various noise processing techniques less significant, specifically when dealing with noise that is introduced in attributes. In this paper, we present a systematic evaluation on the effect of noise in machine learning. Instead of taking any unified theory of noise to evaluate the noise impacts, we differentiate noise into two categories: class noise and attribute noise, and analyze their impacts on the system performance separately. Because class noise has been widely addressed in existing research efforts, we concentrate on attribute noise. We investigate the relationship between attribute noise and classification accuracy, the impact of noise at different attributes, and possible solutions in handling attribute noise. Our conclusions can be used to guide interested readers to enhance data quality by designing various noise handling mechanisms.

Question: What is the impact of noise on classification accuracy?


A 240 G-ops/s Mobile Coprocessor for Deep Neural Networks. Deep networks are state-of-the-art models used for understanding the content of images, videos, audio and raw input data. Current computing systems are not able to run deep network models in real-time with low power consumption. In this paper we present nn-X: a scalable, low-power coprocessor for enabling real-time execution of deep neural networks. nn-X is implemented on programmable logic devices and comprises an array of configurable processing elements called collections. These collections perform the most common operations in deep networks: convolution, subsampling and non-linear functions. The nn-X system includes 4 high-speed direct memory access interfaces to DDR3 memory and two ARM Cortex-A9 processors. Each port is capable of a sustained throughput of 950 MB/s in full duplex. nn-X is able to achieve a peak performance of 227 G-ops/s, a measured performance in deep learning applications of up to 200 G-ops/s while consuming less than 4 watts of power. This translates to a performance per power improvement of 10 to 100 times that of conventional mobile and desktop processors.

Question: What is a deep neural network?


An Improved Approach for Text-Independent Speaker Recognition. This paper presents new Speaker Identification and Speaker Verification systems based on the use of new feature vectors extracted from the speech signal. The proposed structure combine between the most successful Mel Frequency Cepstral Coefficients and new features which are the Short Time Zero Crossing Rate of the signal. A comparison between speaker recognition systems based on Gaussian mixture models using the well known Mel Frequency Cepstral Coefficients and the novel systems based on the use of a combination between both reduced Mel Frequency Cepstral Coefficients features vectors and Short Time Zero Crossing Rate features is given. This comparison proves that the use of the new reduced feature vectors help to improve the system's performance and also help to reduce the time and memory complexity of the system which is required for realistic applications that suffer from computational resource limitation. The experiments were performed on speakers from TIMIT database for different training durations. The suggested systems performances are evaluated against the baseline systems. The increase of the proposed systems performances are well observed for identification experiments and the decrease of Equal Error Rates are also remarkable for verification experiments. Experimental results demonstrate the effectiveness of the new approach which avoids the use of more complex algorithms or the combination of different approaches requiring lengthy calculation. Keywords—GMM; speaker verification; speaker recognition; speaker identification

Question: How to improve the performance of speaker recognition systems?


PSO-based optimization for isolated intersections signal timings and simulation. In this paper, based on the analyzing the signal control problem of single intersections, a kind of real-time optimization method with PSO (particle swarm optimization) solving signal timings for single intersection is put forward. On detecting the flow of current cycle and the cycle before, estimating the flow of next circle is proceeded. Setting least delay as performance index, we get each phase time for the next cycle. A simulation experiment for the traffic model at a four-phase intersection is also performed. The result shows that the method is efficient.

Question: What is PSO?


Universal construction based on 3D printing electric motors: Steps towards self-replicating robots to transform space exploration. Through a recent confluence of technological capacities, self-replicating robots have become a potentially nearterm rather than speculative technology. In a practical sense, self-replicating robots can never become obsolete — the first self- replicating robots will spawn all future generations of robots, subject to deliberate upgrading and/or evolutionary change. Furthermore, this technology promises to revolutionise space exploration by bypassing the apparently-insurmountable problem of high launch costs. We present recent efforts in 3D printing the key robotic components required for any such self- replicating machine.

Question: What is the first self-replicating robot?


Comorbidity of anxiety and unipolar mood disorders.. Research on relationships between anxiety and depression has proceeded at a rapid pace since the 1980s. The similarities and differences between these two conditions, as well as many of the important features of the comorbidity of these disorders, are well understood. The genotypic structure of anxiety and depression is also fairly well documented. Generalized anxiety and major depression share a common genetic diathesis, but the anxiety disorders themselves are genetically hetergeneous. Sophisticated phenotypic models have also emerged, with data converging on an integrative hierarchical model of mood and anxiety disorders in which each individual syndrome contains both a common and a unique component. Finally, considerable progress has been made in understanding cognitive aspects of these disorders. This work has focused on both the cognitive content of anxiety and depression and on the effects that anxiety and depression have on information processing for mood-congruent material.

Question: What is the difference between anxiety and depression?


Peephole: Predicting Network Performance Before Training. The quest for performant networks has been a significant force that drives the advancements of deep learning in recent years. While rewarding, improving network design has never been an easy journey. The large design space combined with the tremendous cost required for network training poses a major obstacle to this endeavor. In this work, we propose a new approach to this problem, namely, predicting the performance of a network before training, based on its architecture. Specifically, we develop a unified way to encode individual layers into vectors and bring them together to form an integrated description via LSTM. Taking advantage of the recurrent network's strong expressive power, this method can reliably predict the performances of various network architectures. Our empirical studies showed that it not only achieved accurate predictions but also produced consistent rankings across datasets – a key desideratum in performance prediction.

Question: What is the quest for performant networks?


Teaching a Machine to Read Maps With Deep Reinforcement Learning. The ability to use a 2D map to navigate a complex 3D environment is quite remarkable, and even difficult for many humans. Localization and navigation is also an important problem in domains such as robotics, and has recently become a focus of the deep reinforcement learning community. In this paper we teach a reinforcement learning agent to read a map in order to find the shortest way out of a random maze it has never seen before. Our system combines several state-of-theart methods such as A3C and incorporates novel elements such as a recurrent localization cell. Our agent learns to localize itself based on 3D first person images and an approximate orientation angle. The agent generalizes well to bigger mazes, showing that it learned useful localization and naviga-

Question: How to teach a machine to read maps?


Mapping continued brain growth and gray matter density reduction in dorsal frontal cortex: Inverse relationships during postadolescent brain maturation.. Recent in vivo structural imaging studies have shown spatial and temporal patterns of brain maturation between childhood, adolescence, and young adulthood that are generally consistent with postmortem studies of cellular maturational events such as increased myelination and synaptic pruning. In this study, we conducted detailed spatial and temporal analyses of growth and gray matter density at the cortical surface of the brain in a group of 35 normally developing children, adolescents, and young adults. To accomplish this, we used high-resolution magnetic resonance imaging and novel computational image analysis techniques. For the first time, in this report we have mapped the continued postadolescent brain growth that occurs primarily in the dorsal aspects of the frontal lobe bilaterally and in the posterior temporo-occipital junction bilaterally. Notably, maps of the spatial distribution of postadolescent cortical gray matter density reduction are highly consistent with maps of the spatial distribution of postadolescent brain growth, showing an inverse relationship between cortical gray matter density reduction and brain growth primarily in the superior frontal regions that control executive cognitive functioning. Inverse relationships are not as robust in the posterior temporo-occipital junction where gray matter density reduction is much less prominent despite late brain growth in these regions between adolescence and adulthood. Overall brain growth is not significant between childhood and adolescence, but close spatial relationships between gray matter density reduction and brain growth are observed in the dorsal parietal and frontal cortex. These results suggest that progressive cellular maturational events, such as increased myelination, may play as prominent a role during the postadolescent years as regressi

Question: What is the difference between the brain of a child and an adult?


Multi-resolution texture analysis for fingerprint based age-group estimation. In this paper the possibility of using digital fingerprints to estimate age-groups of human being, particularly children is investigated. To our knowledge, age-group estimation in humans, using digital fingerprints have not been addressed formally. Age-group estimation can be applied in many areas like on-line child protection, access control and customized internet services etc. Motivated by the fact that human digital fingerprint vary in texture as the person ages, a multi-resolution texture approach for automatic age-group estimation has been presented in this paper. Three standard classifiers were used to judge the accuracy of the proposed method. In the process of this research study, a novel method for digital fingerprint reference point generation was developed, which provides reference point for very poor quality images also. The proposed reference point generation method is compared with core-point method using FG-NET DB1 dataset. Experimental results proves that a digital fingerprint can be used to identify age-groups, particularly children. A classification accuracy of 80 percent was achieved for children below the age of 14 by using the aforesaid method.

Question: How old is the person?


Autonomous NAT Traversal. Traditional NAT traversal methods require the help of a third party for signalling. This paper investigates a new autonomous method for establishing connections to peers behind NAT. The proposed method for autonomous NAT traversal uses fake ICMP messages to initially contact the NATed peer. This paper presents how the method is supposed to work in theory, discusses some possible variations, introduces various concrete implementations of the proposed approach and evaluates empirical results of a measurement study designed to evaluate the efficacy of the idea in practice.

Question: How to establish a connection to a peer behind NAT?


AnySee: Peer-to-Peer Live Streaming. Efficient and scalable live-streaming overlay construction has become a hot topic recently. In order to improve the performance metrics, such as startup delay, source-to-end delay, and playback continuity, most previous studies focused on intra-overlay optimization. Such approaches have drawbacks including low resource utilization, high startup and source-to-end delay, and unreasonable resource assignment in global P2P networks. Anysee is a peer-to-peer live streaming system and adopts an inter-overlay optimization scheme, in which resources can join multiple overlays, so as to (1) improve global resource utilization and distribute traffic to all physical links evenly; (2) assign resources based on their locality and delay; (3) guarantee streaming service quality by using the nearest peers, even when such peers might belong to different overlays; and (4) balance the load among the group members. We compare the performance of our design with existing approaches based on comprehensive trace driven simulations. Results show that AnySee outperforms previous schemes in resource utilization and the QoS of streaming services. AnySee has been implemented as an Internet based live streaming system, and was successfully released in the summer of 2004 in CERNET of China. Over 60,000 users enjoy massive entertainment programs, including TV programs, movies, and academic conferences. Statistics prove that this design is scalable and robust, and we believe that the wide deployment of AnySee will soon benefit many more Internet users.

Question: What is the size of the canadian military?


Towards Internet of Things (IOTS): Integration of Wireless Sensor Network to Cloud Services for Data Collection and Sharing. Cloud computing provides great benefits for applications hosted on the Web that also have special computational and storage requirements. This paper proposes an extensible and flexible architecture for integrating Wireless Sensor Networks with the Cloud. We have used REST based Web services as an interoperable application layer that can be directly integrated into other application domains for remote monitoring such as e-health care services, smart homes, or even vehicular area networks (VAN). For proof of concept, we have implemented a REST based Web services on an IP based low power WSN test bed, which enables data access from anywhere. The alert feature has also been implemented to notify users via email or tweets for monitoring data when they exceed values and events of interest.

Question: What is the difference between cloud computing and internet of things?


Incentive mechanism for peer-to-peer media streaming. We propose a rank-based peer-selection mechanism for peer-to-peer media streaming systems. The mechanism provides incentives for cooperation through service differentiation. Contributors to the system are rewarded with flexibility and choice in peer selection, resulting in high quality streaming sessions. Free-riders are given limited options in peer selection, if any, and hence receive low quality streaming. Through simulation and wide-area measurement studies, we verify that the mechanism can provide near optimal streaming quality to the cooperative users until the bottleneck shifts from the sources to the network.

Question: What is a rank-based peer-selection mechanism?


Unsupervised Learning without Overfitting: Empirical Risk Approximation as an Induction Principle for Reliable Clustering. Unsupervised learning algorithms are designed to extract structure from data s amples on the basis of a cost function for structures. For a reliable and robust inference proce ss, th unsupervised learning algorithm has to guarantee that the extracted structures ar e typical for the data source. In particular, it has to reject all structures where the infe renc is dominated by the arbitrariness of the sample noise and which, consequently, can be characterize d as overfitting in unsupervised learning. This paper summarizes an inference principle called Empirical Risk Approximationwhich allows us to quantitatively measure the overfitting effect and to derive a criterion as a saveguard against it. The crucial condition for learning is me t if (i) the empirical risk of learning uniformly converges towards the expected risk and if ( ii) the hypothesis class retains a minimal variety for consistent inference. Parameter s l ction of learnable data structures is demonstrated for the case of k-means clustering and Monte Carlo simulations are presented to support the selection principle. 1 PHILOSOPHY OF UNSUPERVISED LEARNING Learning algorithms are designed to extract structure from data. Two class es of algorithms have been widely discussed in the literature – supervised andunsupervised learning. The distinction between the two classes depends on supervision or teacher informati on which is either available to the learning algorithm or missing in the learning process. T hi paper describes a statistical learning theory of unsupervised learning. We summarize an induct ion principle for unsupervised learning which is refered to as Empirical Risk Approximation[1]. This principle is based on the optimization of a quality functional for structures in data and, most i portantly, it contains a safeguard against overfitting of structure to the noise in a sampl e s

Question: What is the difference between supervised and unsupervised learning?


RACOG and wRACOG: Two Probabilistic Oversampling Techniques. As machine learning techniques mature and are used to tackle complex scientific problems, challenges arise such as the imbalanced class distribution problem, where one of the target class labels is under-represented in comparison with other classes. Existing oversampling approaches for addressing this problem typically do not consider the probability distribution of the minority class while synthetically generating new samples. As a result, the minority class is not represented well which leads to high misclassification error. We introduce two probabilistic oversampling approaches, namely RACOG and wRACOG, to synthetically generating and strategically selecting new minority class samples. The proposed approaches use the joint probability distribution of data attributes and Gibbs sampling to generate new minority class samples. While RACOG selects samples produced by the Gibbs sampler based on a predefined lag, wRACOG selects those samples that have the highest probability of being misclassified by the existing learning model. We validate our approach using nine UCI data sets that were carefully modified to exhibit class imbalance and one new application domain data set with inherent extreme class imbalance. In addition, we compare the classification performance of the proposed methods with three other existing resampling techniques.

Question: What is the difference between RACOG and wRACOG?


Unified Model for Contrast Enhancement and Denoising. In this paper, we attempt a challenging task to unify two important complementary operations, i.e. contrast enhancement and denoising, that is required in most image processing applications. The proposed method is implemented using practical analog circuit configurations that can lead to near real-time processing capabilities useful to be integrated with vision sensors. Metrics used for performance includes estimation of Residual Noise Level (RNL), Structural Similarity Index Measure (SSIM), Output-to-Input Contrast Ratio (CRo_i), and its combined score (SCD). The class of contrast stretching methods has resulted in higher noise levels (RNL ≥ 7) along with increased contrast measures (CRo-i ≥ eight times than that of the input image) and SSIM ≤ 0.52. Denoising methods generates images with lesser noise levels (RNL ≤ 0.2308), poor contrast enhancements (CRo-i ≤ 1.31) and with best structural similarity (SSIM ≥ 0.85). In contrast, the proposed model offers best contrast stretching (CRo-i = 5.83), least noise (RNL = 0.02), a descent structural similarity (SSIM = 0.6453) and the highest combined score (SCD = 169).

Question: What is the unified model for contrast enhancement and denoising?


Prototypical Networks for Few-shot Learning. We propose Prototypical Networks for the problem of few-shot classification, where a classifier must generalize to new classes not seen in the training set, given only a small number of examples of each new class. Prototypical Networks learn a metric space in which classification can be performed by computing distances to prototype representations of each class. Compared to recent approaches for few-shot learning, they reflect a simpler inductive bias that is beneficial in this limited-data regime, and achieve excellent results. We provide an analysis showing that some simple design decisions can yield substantial improvements over recent approaches involving complicated architectural choices and meta-learning. We further extend Prototypical Networks to zero-shot learning and achieve state-ofthe-art results on the CU-Birds dataset.

Question: What is the inductive bias of prototypical networks?


Clinical applications of the Miniscrew Anchorage System..

Question: What is the miniscrew anchorage system?


Computational Complexity of Linear Large Margin Classification With Ramp Loss. Minimizing the binary classification error with a linear model leads to an NP-hard problem. In practice, surrogate loss functions are used, in particular loss functions leading to large margin classification such as the hinge loss and the ramp loss. The intuitive large margin concept is theoretically supported by generalization bounds linking the expected classification error to the empirical margin error and the complexity of the considered hypotheses class. This article addresses the fundamental question about the computational complexity of determining whether there is a hypotheses class with a hypothesis such that the upper bound on the generalization error is below a certain value. Results of this type are important for model comparison and selection. This paper takes a first step and proves that minimizing a basic margin-bound is NP-hard when considering linear hypotheses and the ρmargin loss function, which generalizes the ramp loss. This result directly implies the hardness of ramp loss minimization.

Question: What is the computational complexity of linear large margin classification?


Executing SQL over encrypted data in the database-service-provider model. Rapid advances in networking and Internet technologies have fueled the emergence of the "software as a service" model for enterprise computing. Successful examples of commercially viable software services include rent-a-spreadsheet, electronic mail services, general storage services, disaster protection services. "Database as a Service" model provides users power to create, store, modify, and retrieve data from anywhere in the world, as long as they have access to the Internet. It introduces several challenges, an important issue being data privacy. It is in this context that we specifically address the issue of data privacy.There are two main privacy issues. First, the owner of the data needs to be assured that the data stored on the service-provider site is protected against data thefts from outsiders. Second, data needs to be protected even from the service providers, if the providers themselves cannot be trusted. In this paper, we focus on the second challenge. Specifically, we explore techniques to execute SQL queries over encrypted data. Our strategy is to process as much of the query as possible at the service providers' site, without having to decrypt the data. Decryption and the remainder of the query processing are performed at the client site. The paper explores an algebraic framework to split the query to minimize the computation at the client site. Results of experiments validating our approach are also presented.

Question: How to execute SQL over encrypted data?


PROBABILISTIC NEURAL NETWORK. This paper reports results of artificial neural network for robot navigation tasks. Machine learning methods have proven usability in many complex problems concerning mobile robots control. In particular we deal with the well-known strategy of navigating by "wall-following". In this study, probabilistic neural network (PNN) structure was used for robot navigation tasks. The PNN result was compared with the results of the Logistic Perceptron, Multilayer Perceptron, Mixture of Experts and Elman neural networks and the results of the previous studies reported focusing on robot navigation tasks and using same dataset. It was observed the PNN is the best classification accuracy with 99,635% accuracy using same dataset.

Question: What is the best neural network for robot navigation?


Forgetting Is Regulated through Rac Activity in Drosophila. Initially acquired memory dissipates rapidly if not consolidated. Such memory decay is thought to result either from the inherently labile nature of newly acquired memories or from interference by subsequently attained information. Here we report that a small G protein Rac-dependent forgetting mechanism contributes to both passive memory decay and interference-induced forgetting in Drosophila. Inhibition of Rac activity leads to slower decay of early memory, extending it from a few hours to more than one day, and to blockade of interference-induced forgetting. Conversely, elevated Rac activity in mushroom body neurons accelerates memory decay. This forgetting mechanism does not affect memory acquisition and is independent of Rutabaga adenylyl cyclase-mediated memory formation mechanisms. Endogenous Rac activation is evoked on different time scales during gradual memory loss in passive decay and during acute memory removal in reversal learning. We suggest that Rac's role in actin cytoskeleton remodeling may contribute to memory erasure.

Question: How does forgetting work?


Millimeter-Wave Compact EBG Structure for Mutual Coupling Reduction Applications. A new millimeter-wave (MMW), electromagnetic band-gap (EBG) structure is presented. The proposed EBG structure without the use of metallic vias or vertical components is formed by etching two slots and adding two connecting bridges to a conventional uniplanar EBG unit-cell. The transmission characteristics of the proposed EBG structure are measured. Results show that the proposed EBG structure has a wide bandgap around the 60 GHz band. The size of the proposed EBG unit-cell is 78% less than a conventional uniplanar EBG, and 72% less than a uniplanar-compact EBG (UC-EBG) operating at the same frequency band. Moreover, and despite the fabrication limitations at the 60 GHz band, the proposed EBG unit-cell provides at least 12% more size reduction than any other planar EBG structures at microwave frequencies. Its enhanced performance and applicability to reduce mutual coupling in antenna arrays are then investigated. Results show a drastic decrease in the mutual coupling level. This EBG structure can find its applications in MMW wireless communication systems.

Question: What is the size of the proposed EBG structure?


Electromigration and its impact on physical design in future technologies. Electromigration (EM) is one of the key concerns going forward for interconnect reliability in integrated circuit (IC) design. Although analog designers have been aware of the EM problem for some time, digital circuits are also being affected now. This talk addresses basic design issues and their effects on electromigration during interconnect physical design. The intention is to increase current density limits in the interconnect by adopting electromigration-inhibiting measures, such as short-length and reservoir effects. Exploitation of these effects at the layout stage can provide partial relief of EM concerns in IC design flows in future.

Question: What is electromigration?


A Game of Things: Strategic Allocation of Security Resources for IoT. In many Internet of Thing (IoT) application domains security is a critical requirement, because malicious parties can undermine the effectiveness of IoT-based systems by compromising single components and/or communication channels. Thus, a security infrastructure is needed to ensure the proper functioning of such systems even under attack. However, it is also critical that security be at a reasonable resource and energy cost, as many IoT devices may not have sufficient resources to host expensive security tools. In this paper, we focus on the problem of efficiently and effectively securing IoT networks by carefully allocating security tools. We model our problem according to game theory, and provide a Pareto-optimal solution, in which the cost of the security infrastructure, its energy consumption, and the probability of a successful attack, are minimized. Our experimental evaluation shows that our technique improves the system robustness in terms of packet delivery rate for different network topologies.

Question: How to secure IoT devices?


Authorship attribution based on Life-Like Network Automata. The authorship attribution is a problem of considerable practical and technical interest. Several methods have been designed to infer the authorship of disputed documents in multiple contexts. While traditional statistical methods based solely on word counts and related measurements have provided a simple, yet effective solution in particular cases; they are prone to manipulation. Recently, texts have been successfully modeled as networks, where words are represented by nodes linked according to textual similarity measurements. Such models are useful to identify informative topological patterns for the authorship recognition task. However, there is no consensus on which measurements should be used. Thus, we proposed a novel method to characterize text networks, by considering both topological and dynamical aspects of networks. Using concepts and methods from cellular automata theory, we devised a strategy to grasp informative spatio-temporal patterns from this model. Our experiments revealed an outperformance over structural analysis relying only on topological measurements, such as clustering coefficient, betweenness and shortest paths. The optimized results obtained here pave the way for a better characterization of textual networks.

Question: What is the authorship attribution based on life-like network automata?


The McGill pain questionnaire: from description to measurement.. On the language of pain. By Ronald Melzack, Warren S. Torgerson. Anesthesiology 1971; 34:50-9. Reprinted with permission. The purpose of this study was to develop new approaches to the problem of describing and measuring pain in human subjects. Words used to describe pain were brought together and categorized, and an attempt was made to scale them on a common intensity dimension. The data show that: 1) there are many words in the English language to describe the varieties of pain experience; 2) there is a high level of agreement that the words fall into classes and subclasses that represent particular dimensions or properties of pain experience; 3) substantial portions of the words have approximately the same relative positions on a common intensity scale for people who have widely divergent backgrounds. The word lists provide a basis for a questionnaire to study the effects of anesthetic and analgesic agents on the experience of pain.

Question: What is the McGill pain questionnaire?


Web-based models for natural language processing. Previous work demonstrated that Web counts can be used to approximate bigram counts, suggesting that Web-based frequencies should be useful for a wide variety of Natural Language Processing (NLP) tasks. However, only a limited number of tasks have so far been tested using Web-scale data sets. The present article overcomes this limitation by systematically investigating the performance of Web-based models for several NLP tasks, covering both syntax and semantics, both generation and analysis, and a wider range of n-grams and parts of speech than have been previously explored. For the majority of our tasks, we find that simple, unsupervised models perform better when n-gram counts are obtained from the Web rather than from a large corpus. In some cases, performance can be improved further by using backoff or interpolation techniques that combine Web counts and corpus counts. However, unsupervised Web-based models generally fail to outperform supervised state-of-the-art models trained on smaller corpora. We argue that Web-based models should therefore be used as a baseline for, rather than an alternative to, standard supervised models.

Question: What is the difference between unsupervised and supervised models?


Graph Drawing by Stress Majorization. One of the most popular graph drawing methods is based of achieving graphtheoretic target ditsances. This method was used by Kamada and Kawai [15], who formulated it as an energy optimization problem. Their energy is known in the multidimensional scaling (MDS) community as the stress function. In this work, we show how to draw graphs by stress majorization, adapting a technique known in the MDS community for more than two decades. It appears that majorization has advantages over the technique of Kamada and Kawai in running time and stability. We also present a few extensions to the basic energy model which can improve layout quality and computation speed in practice. Majorization-based optimization is essential to these extensions.

Question: How to draw graphs by stress majorization?


Improving Interactional Organizational Research : A Model of Person-Organization Fit. In order for researchers to understand and predict behavior, they must consider both person and situation factors and how these factors interact. Even though organization researchers have developed interactional models, many have overemphasized either person or situation components, and most have failed to consider the effects that persons have on situations. This paper presents criteria for improving interactional models and a model of person-organization fit, which satisfies these criteria. Using a Q-sort methodology, individual value profiles are compared to organizational value profiles to determine fit and to predict changes in values, norms, and behaviors.

Question: What is the difference between person and situation factors?


Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2 in the worst case for infinite languages, and for finite languages it is n log n) and n , if the alphabet size grows with the number of states n of the given automaton. A new lower bound method based on communication complexity for regular expression size is developed to show that the required size is indeed n . For constant alphabet size the best lower bound known to date is Ω(n), even when allowing infinite languages and nondeterministic finite automata. As the technique developed here works equally well for deterministic finite automata over binary alphabets, the lower bound is improved to n .

Question: What is the lower bound on regular expression size?


3D positional integration from image sequences. An explicit three-dimensional representation is constructed from feature-points extracted from a sequence of images taken by a moving camera. The points are tracked through the sequence, and their 3D locations accurately determined by use of Kalman Filters. The ego-motion of the camera is also solved for.

Question: How do you solve for the ego-motion of the camera?


Knowledge Discovery in Manufacturing Simulations. Discrete event simulation studies in a manufacturing context are a powerful instrument when modeling and evaluating processes of various industries. Usually simulation experts conduct simulation experiments for a predetermined system specification by manually varying parameters through educated assumptions and according to a prior defined goal. Moreover, simulation experts try to reduce complexity and number of simulation runs by excluding parameters that they consider as not influential regarding the simulation project scope. On the other hand, today's world of big data technology enables us to handle huge amounts of data. We therefore investigate the potential benefits of designing large scale experiments with a much broader coverage of possible system behavior. In this paper, we propose an approach for applying data mining methods on simulation data in combination with suitable visualization methods in order to uncover relationships in model behavior to discover knowledge that otherwise would have remained hidden. For a prototypical demonstration we used a clustering algorithm to divide large amounts of simulation output datasets into groups of similar performance values and depict those groups through visualizations to conduct a visual investigation process of the simulation data.

Question: What is a prototypical demonstration?


Clinical practice guidelines for the management of pain, agitation, and delirium in adult patients in the intensive care unit.. OBJECTIVE To revise the "Clinical Practice Guidelines for the Sustained Use of Sedatives and Analgesics in the Critically Ill Adult" published in Critical Care Medicine in 2002.   METHODS The American College of Critical Care Medicine assembled a 20-person, multidisciplinary, multi-institutional task force with expertise in guideline development, pain, agitation and sedation, delirium management, and associated outcomes in adult critically ill patients. The task force, divided into four subcommittees, collaborated over 6 yr in person, via teleconferences, and via electronic communication. Subcommittees were responsible for developing relevant clinical questions, using the Grading of Recommendations Assessment, Development and Evaluation method (http://www.gradeworkinggroup.org) to review, evaluate, and summarize the literature, and to develop clinical statements (descriptive) and recommendations (actionable). With the help of a professional librarian and Refworks database software, they developed a Web-based electronic database of over 19,000 references extracted from eight clinical search engines, related to pain and analgesia, agitation and sedation, delirium, and related clinical outcomes in adult ICU patients. The group also used psychometric analyses to evaluate and compare pain, agitation/sedation, and delirium assessment tools. All task force members were allowed to review the literature supporting each statement and recommendation and provided feedback to the subcommittees. Group consensus was achieved for all statements and recommendations using the nominal group technique and the modified Delphi method, with anonymous voting by all task force members using E-Survey (http://www.esurvey.com). All voting was completed in December 2010. Relevant studies published after this date and prior to publication of these guidelines were refere

Question: What is the difference between a clinical practice guideline and a clinical practice statement?


What maintains parental support for vaccination when challenged by anti-vaccination messages? A qualitative study.. This study sought to explore how parents respond to competing media messages about vaccine safety. Six focus groups with mothers of infants were shown television vignettes of typical pro- and anti-vaccination claims. Thematic analysis of transcripts was undertaken. Mothers expressed surprise and concern about alleged vaccine risks but quickly reinstated their support for vaccination by deference to authority figures; type-casting immunisation opponents; and notions of anticipatory regret, good parenting and social responsibility. We conclude that personal experiences, value systems and level of trust in health professionals are fundamental to parental decision making about vaccination. Vaccination advocacy should increase the focus on matters of process such as maintaining trust and public confidence, particularly in health professionals. Stories about people affected by vaccine-preventable diseases need to re-enter the public discourse.

Question: What are the factors that maintain parental support for vaccination when challenged by anti-vaccination messages?


Reconsidering Research on Learning from Media. Recent meta-analyses and other studies of media's influence on learning are reviewed, Consistent evidence is found for the generalization that there are no learning benefits to be gained from employing any specific medium to deliver instruction. Research showing performance or timesaving gains from one or another medium are shown to be vulnerable to compelling rival hypotheses concerning the uncontrolled effects of instructional method and novelty. Problems with current media attribute and symbol system theories are described and suggestions made for more promising research directions. Studies of the influence of media on learning have ken a fixed feature of educational research since Thorndike (1912) recommended pictures as a laborsaving device in instruction, Most of this research is buttressed by the hope that learning will be enhanced with the proper mix of medium, student, subject matter content, and learning task. A typical study compares the relative achievement of groups who have received similar subject matter from different media. This research has led to so-called 'media selection" schemes or models 1982). These models generally promise to incorporate existing research and practice into procedures for selecting the best medium or mix of media to deliver instruction. Most of these models base many of their prescriptions on presumed learning benefits from media (Jamison, Suppes, & Welles, 1974). However, this article will argue that most current summaries and meta-analyses of media comparison studies clearly suggest that media do not influence learning under any conditions. Even in the few cases where dramatic changes in achievement or ability have followed the introduction of a medium, as was the case with television in El Salvador (Schramm, 1977), it was not the medium that caused the change but rather a curricular reform that accompanied the change. The best current evidence is that media are mere vehicles t

Question: What is the best way to learn?


Learning to dress: synthesizing human dressing motion via deep reinforcement learning. Creating animation of a character putting on clothing is challenging due to the complex interactions between the character and the simulated garment. We take a model-free deep reinforcement learning (deepRL) approach to automatically discovering robust dressing control policies represented by neural networks. While deepRL has demonstrated several successes in learning complex motor skills, the data-demanding nature of the learning algorithms is at odds with the computationally costly cloth simulation required by the dressing task. This paper is the first to demonstrate that, with an appropriately designed input state space and a reward function, it is possible to incorporate cloth simulation in the deepRL framework to learn a robust dressing control policy. We introduce a salient representation of haptic information to guide the dressing process and utilize it in the reward function to provide learning signals during training. In order to learn a prolonged sequence of motion involving a diverse set of manipulation skills, such as grasping the edge of the shirt or pulling on a sleeve, we find it necessary to separate the dressing task into several subtasks and learn a control policy for each subtask. We introduce a policy sequencing algorithm that matches the distribution of output states from one task to the input distribution for the next task in the sequence. We have used this approach to produce character controllers for several dressing tasks: putting on a t-shirt, putting on a jacket, and robot-assisted dressing of a sleeve.

Question: How to dress a character?


TensorFlow: Large-Scale Machine Learning on Heterogeneous Distributed Systems. Martı́n Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S. Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Ian Goodfellow, Andrew Harp, Geoffrey Irving, Michael Isard, Yangqing Jia, Rafal Jozefowicz, Lukasz Kaiser, Manjunath Kudlur, Josh Levenberg, Dan Mané, Rajat Monga, Sherry Moore, Derek Murray, Chris Olah, Mike Schuster, Jonathon Shlens, Benoit Steiner, Ilya Sutskever, Kunal Talwar, Paul Tucker, Vincent Vanhoucke, Vijay Vasudevan, Fernanda Viégas, Oriol Vinyals, Pete Warden, Martin Wattenberg, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng Google Research∗ Abstract

Question: What is the tensorflow?


A signal processing approach to fair surface design. In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals – functions defined on polyhedral surfaces of arbitrary topology –, we reduce the problem of surface smoothing, or fairing, to low-pass filtering. We describe a very simple surface signal low-pass filter algorithm that applies to surfaces of arbitrary topology. As opposed to other existing optimization-based fairing methods, which are computationally more expensive, this is a linear time and space complexity algorithm. With this algorithm, fairing very large surfaces, such as those obtained from volumetric medical data, becomes affordable. By combining this algorithm with surface subdivision methods we obtain a very effective fair surface design technique. We then extend the analysis, and modify the algorithm accordingly, to accommodate different types of constraints. Some constraints can be imposed without any modification of the algorithm, while others require the solution of a small associated linear system of equations. In particular, vertex location constraints, vertex normal constraints, and surface normal discontinuities across curves embedded in the surface, can be imposed with this technique. CR

Question: What is a fair surface?


Detecting Driver Drowsiness Based on Sensors: A Review. In recent years, driver drowsiness has been one of the major causes of road accidents and can lead to severe physical injuries, deaths and significant economic losses. Statistics indicate the need of a reliable driver drowsiness detection system which could alert the driver before a mishap happens. Researchers have attempted to determine driver drowsiness using the following measures: (1) vehicle-based measures; (2) behavioral measures and (3) physiological measures. A detailed review on these measures will provide insight on the present systems, issues associated with them and the enhancements that need to be done to make a robust system. In this paper, we review these three measures as to the sensors used and discuss the advantages and limitations of each. The various ways through which drowsiness has been experimentally manipulated is also discussed. We conclude that by designing a hybrid drowsiness detection system that combines non-intrusive physiological measures with other measures one would accurately determine the drowsiness level of a driver. A number of road accidents might then be avoided if an alert is sent to a driver that is deemed drowsy.

Question: What is the difference between a driver and a driver drowsiness?


Designing an annotation scheme for summarizing Japanese judgment documents. We propose an annotation scheme for the summarization of Japanese judgment documents. This paper reports the details of the development of our annotation scheme for this task. We also conduct a human study where we compare the annotation of independent annotators. The end goal of our work is summarization, and our categories and the link system is a consequence of this. We propose three types of generic summaries which are focused on specific legal issues relevant to a given legal case.

Question: What is the end goal of this work?


A Survey of Secure Routing Protocols in Multi-Hop Cellular Networks. Multi-hop networks are expected to be an important part of 5G mobile systems. In a multi-hop cellular network (MCN), the nodes assist each other in relaying packets towards their destinations. The structures and operations of multi-hop networks make them particularly vulnerable to certain types of attack. Hence, security measures to counter these attacks are necessary. In this paper, we provide an overview of the secure routing protocols for multi-hop networks and classify them into MCN Type-1 and Type-0 categories for device-to-device communications, and the Internet-of-Things category for machine-to-machine communications. Our focus is on the applied cryptographic techniques and the security mechanisms in secure routing protocols. We propose an evaluation framework incorporating different security aspects, vulnerabilities, and levels of deployability to compare a number of secure routing protocols. Moreover, we review the secure routing paths in software-defined networking as a solution for existing challenges in multi-hop networks. Some open research problems are highlighted as possible directions for future studies.

Question: What is the difference between a multi-hop network and a mesh network?


RETOS: Resilient, Expandable, and Threaded Operating System for Wireless Sensor Networks. This paper presents the design principles, implementation, and evaluation of the RETOS operating system which is specifically developed for micro sensor nodes. RETOS has four distinct objectives, which are to provide (1) a multithreaded programming interface, (2) system resiliency, (3) kernel extensibility with dynamic reconfiguration, and (4) WSN-oriented network abstraction. RETOS is a multithreaded operating system, hence it provides the commonly used thread model of programming interface to developers. We have used various implementation techniques to optimize the performance and resource usage of multithreading. RETOS also provides software solutions to separate kernel from user applications, and supports their robust execution on MMU-less hardware. The RETOS kernel can be dynamically reconfigured, via loadable kernel framework, so a application-optimized and resource-efficient kernel is constructed. Finally, the networking architecture in RETOS is designed with a layering concept to provide WSN-specific network abstraction. RETOS currently supports Atmel ATmega128, TI MSP430, and Chipcon CC2430 family of microcontrollers. Several real-world WSN applications are developed for RETOS and the overall evaluation of the systems is described in the paper.

Question: What is the difference between a microcontroller and a microprocessor?


S-CNN: Subcategory-Aware Convolutional Networks for Object Detection. The marriage between the deep convolutional neural network (CNN) and region proposals has made breakthroughs for object detection in recent years. While the discriminative object features are learned via a deep CNN for classification, the large intra-class variation and deformation still limit the performance of the CNN based object detection. We propose a subcategory-aware CNN (S-CNN) to solve the object intra-class variation problem. In the proposed technique, the training samples are first grouped into multiple subcategories automatically through a novel instance sharing maximum margin clustering process. A multi-component Aggregated Channel Feature (ACF) detector is then trained to produce more latent training samples, where each ACF component corresponds to one clustered subcategory. The produced latent samples together with their subcategory labels are further fed into a CNN classifier to filter out false proposals for object detection. An iterative learning algorithm is designed for the joint optimization of image subcategorization, multi-component ACF detector, and subcategory-aware CNN classifier. Experiments on INRIA Person dataset, Pascal VOC 2007 dataset and MS COCO dataset show that the proposed technique clearly outperforms the state-of-the-art methods for generic object detection.

Question: What is the difference between the deep convolutional neural network and the region proposals?


Autonomous Vehicles for Smart and Sustainable Cities: An In-Depth Exploration of Privacy and Cybersecurity Implications. Amidst rapid urban development, sustainable transportation solutions are required to meet the increasing demands for mobility whilst mitigating the potentially negative social, economic, and environmental impacts. This study analyses autonomous vehicles (AVs) as a potential transportation solution for smart and sustainable development. We identified privacy and cybersecurity risks of AVs as crucial to the development of smart and sustainable cities and examined the steps taken by governments around the world to address these risks. We highlight the literature that supports why AVs are essential for smart and sustainable development. We then identify the aspects of privacy and cybersecurity in AVs that are important for smart and sustainable development. Lastly, we review the efforts taken by federal governments in the US, the UK, China, Australia, Japan, Singapore, South Korea, Germany, France, and the EU, and by US state governments to address AV-related privacy and cybersecurity risks in-depth. Overall, the actions taken by governments to address privacy risks are mainly in the form of regulations or voluntary guidelines. To address cybersecurity risks, governments have mostly resorted to regulations that are not specific to AVs and are conducting research and fostering research collaborations with the private sector.

Question: What are the privacy and cybersecurity risks of autonomous vehicles?


Personality Based E-Recruitment System. Nodes in Mobile Ad Hoc Networks (MANETs) are limited battery powered. That's why energy efficient routing has become an important optimization criterion in MANETs. The conventional routing protocols do not consider energy of the nodes while selecting routes which leads to early exhaustion of nodes and partitioning of the network. This paper attempts to provide an energy aware routing algorithm. The proposed algorithm finds the transmission energy between the nodes relative to the distance and the performance of the algorithm is analyzed between two metrics Total Transmission energy of a route and Maximum Number of Hops. The proposed algorithm shows efficient energy utilization and increased network lifetime with total transmission energy metric.

Question: What is the energy efficient routing algorithm?


METRIC AND TOPO-GEOMETRIC PROPERTIES OF URBAN STREET NETWORKS : some convergences , divergences , and new results. The theory of cities, which has grown out of the use of space syntax techniques in urban studies, proposes a curious mathematical duality: that urban space is locally metric but globally topo-geometric. Evidence for local metricity comes from such generic phenomena as grid intensification to reduce mean trip lengths in live centres, the fall of movement from attractors with metric distance, and the commonly observed decay of shopping with metric distance from an intersection. Evidence for global topo-geometry come from the fact that we need to utilise both the geometry and connectedness of the larger scale space network to arrive at configurational measures which optimally approximate movement patterns in the urban network. It might be conjectured that there is some threshold above which human being use some geometrical and topological representation of the urban grid rather than the sense of bodily distance to making movement decisions, but this is unknown. The discarding of metric properties in the large scale urban grid has, however, been controversial. Here we cast a new light on this duality. We show first some phenomena in which metric and topo-geometric measures of urban space converge and diverge, and in doing so clarify the relation between the metric and topo-geometric properties of urban spatial networks. We then show how metric measures can be used to create a new urban phenomenon: the partitioning of the background network of urban space into a network of semi-discrete patches by applying metric universal distance measures at different metric radii, suggesting a natural spatial area-isation of the city at all scales. On this basis we suggest a key clarification of the generic structure of cities: that metric universal distance captures exactly the formally and functionally local patchwork properties of the network, most notably the spatial

Question: What is the difference between metric and topo-geometric properties of urban space?


Single Image Shadow Removal via Neighbor-Based Region Relighting. In this paper we present a novel method for shadow removal in single images. For each shadow region we use a trained classifier to identify a neighboring lit region of the same material. Given a pair of lit-shadow regions we perform a region relighting transformation based on histogram matching of luminance values between the shadow region and the lit region. Then, we adjust the CIELAB a and b channels of the shadow region by adding constant offsets based on the difference of the median shadow and lit pixel values. We demonstrate that our approach produces results that outperform the state of the art by evaluating our method using a publicly available benchmark dataset.

Question: How to remove shadows in a single image?


The Role of Search Engine Optimization in Search Marketing. Web sites invest significant resources in trying to influence their visibility among online search results. In addition to paying for sponsored links, they invest in methods known as search engine optimization (SEO) that improve the ranking of a site among the search results without improving its quality. We study the economic incentives of Web sites to invest in SEO and its implications on search engine and advertiser payoffs. We find that the process is equivalent to an all-pay auction with noise and headstarts. Our results show that, under certain conditions, a positive level of search engine optimization improves the search engine's ranking quality and thus the satisfaction of its visitors. In particular, if the quality of sites coincides with their valuation for visitors then search engine optimization serves as a mechanism that improves the ranking by correcting measurement errors. While this benefits consumers and increases traffic to the search engine, sites participating in search engine optimization could be worse off due to wasteful spending unless their valuation for traffic is very high. We also investigate how search engine optimization affects the revenues from sponsored links. Surprisingly, we find that in many cases search engine revenues are increased by SEO.

Question: What is the role of search engine optimization in search marketing?


Impact of carboplatin plus paclitaxel combined with endostar against A375 melanoma cells: An in vitro and in vivo analysis.. PURPOSE The aim of the present study was to investigate the efficacy of carboplatin plus paclitaxel (CP) combined with endostar against A375 melanoma cells in vitro and in vivo.   METHODS Effects on the cell viability and apoptosis induction were estimated with the Cell counting Kit-8 assay and Annexin V-FITC/Propidium Iodide staining. Fifty female BALB/c-nude mice with subcutaneous injection of A375 cells were randomized to be treated with normal saline, dacarbazine alone, dacarbazine plus endostar, carboplatin plus paclitaxel, and CP plus endostar. Tumor volume of mice was monitored after injection and survival time was adopted for survival analysis.   RESULTS CP plus endostar significantly decreased the cell survival rate compared with CP (P<0.01). Combination of CP and endostar showed higher cytotoxicity to A375 cells in vitro than endostar plus dacarbazine (P<0.01). The percentage of apoptotic cells in A375 cells treated with CP plus endostar was appreciably higher when compared to CP group (P<0.05). The mean relative tumor size in CP group was definitely larger (p<0.05) than CP plus endostar group. In addition, the mean survival time in CP plus endostar group was notably elevated compared with the CP group (P<0.05).   CONCLUSIONS Our data indicated that treatment with CP plus endostar significantly reduced cell growth and induced a high rate of apoptotic cells in the A375 melanoma cell line. CP and endostar exhibited synergistic anti-tumor activities in A375 melanoma cells in vitro. CP plus endostar suppressed the growth of xenograft tumors and prolonged the survival time of mice with xenograft tumors. Combination of CP and endostar may be a promising treatment for melanoma.

Question: What is the difference between carboplatin and cisplatin?


Web Credibility: Features Exploration and Credibility Prediction. The open nature of the World Wide Web makes evaluating webpage credibility challenging for users. In this paper, we aim to automatically assess web credibility by investigating various characteristics of webpages. Specifically, we first identify features from textual content, link structure, webpages design, as well as their social popularity learned from popular social media sites (e.g., Facebook, Twitter). A set of statistical analyses methods are applied to select the most informative features, which are then used to infer webpages credibility by employing supervised learning algorithms. Real dataset-based experiments under two application settings show that we attain an accuracy of 75% for classification, and an improvement of 53% for the mean absolute error (MAE), with respect to the random baseline approach, for regression.

Question: What is the accuracy of the web credibility prediction?


A Knowledge Hunting Framework for Common Sense Reasoning. We introduce an automatic system that achieves state-of-the-art results on the Winograd Schema Challenge (WSC), a common sense reasoning task that requires diverse, complex forms of inference and knowledge. Our method uses a knowledge hunting module to gather text from the web, which serves as evidence for candidate problem resolutions. Given an input problem, our system generates relevant queries to send to a search engine, then extracts and classifies knowledge from the returned results and weighs them to make a resolution. Our approach improves F1 performance on the full WSC by 0.21 over the previous best and represents the first system to exceed 0.5 F1. We further demonstrate that the approach is competitive on the Choice of Plausible Alternatives (COPA) task, which suggests that it is generally applicable.

Question: What is the winograd schema challenge?


Image-based reconstruction of wire art. Objects created by connecting and bending wires are common in furniture design, metal sculpting, wire jewelry, etc. Reconstructing such objects with traditional depth and image based methods is extremely difficult due to their unique characteristics such as lack of features, thin elements, and severe self-occlusions. We present a novel image-based method that reconstructs a set of continuous 3D wires used to create such an object, where each wire is composed of an ordered set of 3D curve segments. Our method exploits two main observations: simplicity - wire objects are often created using only a small number of wires, and smoothness - each wire is primarily smoothly bent with sharp features appearing only at joints or isolated points. In light of these observations, we tackle the challenging image correspondence problem across featureless wires by first generating multiple candidate 3D curve segments and then solving a global selection problem that balances between image and smoothness cues to identify the correct 3D curves. Next, we recover a decomposition of such curves into a set of distinct and continuous wires by formulating a multiple traveling salesman problem, which finds smooth paths, i.e., wires, connecting the curves. We demonstrate our method on a wide set of real examples with varying complexity and present high-fidelity results using only 3 images for each object. We provide the source code and data for our work in the project website.

Question: How to reconstruct wire art?


PEDOT:PSS "Wires" Printed on Textile for Wearable Electronics.. Herein, the fabrication of all-organic conductive wires is demonstrated by utilizing patterning techniques such as inkjet printing and sponge stencil to apply poly(3,4-ethylenedioxythiophene) polystyrenesulfonate (PEDOT:PSS) onto nonwoven polyethylene terephthalate (PET) fabric. The coating of the conducting polymer is only present on the surface of the substrate (penetration depth ∼ 200 μm) to retain the functionality and wearability of the textile. The wires fabricated by different patterning techniques provide a wide range of resistance, i.e., tens of kΩ/□ to less than 2 Ω/□ that allows the resistance to be tailored to a specific application. The sheet resistance is measured to be as low as 1.6 Ω/□, and the breakdown current is as high as 0.37 A for a 1 mm wide line. The specific breakdown current exceeds the previously reported values of macroscopic carbon nanotube based materials. Simple circuits composed of the printed wires are demonstrated, and resistance of the circuit from the measurement agrees with the calculated value based on Kirchhoff's rules. Additionally, the printed PEDOT:PSS wires show less than 6.2% change in sheet resistance after three washing and drying cycles using detergent.

Question: What is the breakdown current of the printed wires?


Anatomical Variants in Prostate Artery Embolization: A Pictorial Essay. Prostate artery embolization (PAE) has emerged as a new treatment option for patients with symptomatic benign prostatic hyperplasia. The main challenges related to this procedure are navigating arteries with atherosclerosis and anatomical variations, and the potential risk of non-target embolization to pelvic structures due to the presence of collateral shunts and reflux of microparticles. Knowledge of classical vascular anatomy and the most common variations is essential for safe embolization, good clinical practice, and optimal outcomes. The aim of this pictorial essay is to illustrate the pelvic vascular anatomy relevant to PAE in order to provide a practical guide that includes the most common anatomical variants as well as to discuss the technical details related to each.

Question: What is the most common anatomical variation in the prostate artery?


The back squat: A proposed assessment of functional deficits and technical factors that limit performance.. Fundamental movement competency is essential for participation in physical activity and for mitigating the risk of injury, which are both key elements of health throughout life. The squat movement pattern is arguably one of the most primal and critical fundamental movements necessary to improve sport performance, to reduce injury risk and to support lifelong physical activity. Based on current evidence, this first (1 of 2) report deconstructs the technical performance of the back squat as a foundation training exercise and presents a novel dynamic screening tool that incorporates identification techniques for functional deficits that limit squat performance and injury resilience. The follow-up report will outline targeted corrective methodology for each of the functional deficits presented in the assessment tool.

Question: What is a fundamental movement competency?


Does visual attention select objects or locations?. Much research supports location-based attentional selection, but J. Duncan (1984) presented data favoring object-based selection in a shape discrimination task. Does attention select objects or locations? We confirmed that Duncan's task elicits selection from spatially invariant object representations rather than from a grouped location-based representation. We next asked whether this finding was due to location-based filtering; the results again supported object-based selection. Finally, we demonstrated that when Duncan's objects were used in a cued detection task the results were consistent with location-based selection. These results suggest that there may not be a single attention mechanism, consistent with Duncan's original claim that object-based and location-based attentional selection are not mutually exclusive. Rather, attentional limitations may depend on the type of stimulus representation used in performing a given task.

Question: What is the difference between location-based and object-based attention?


SPROUT: Lazy vs. Eager Query Plans for Tuple-Independent Probabilistic Databases. A paramount challenge in probabilistic databases is the scalable computation of confidences of tuples in query results. This paper introduces an efficient secondary-storage operator for exact computation of queries on tuple-independent probabilistic databases. We consider the conjunctive queries without self-joins that are known to be tractable on any tuple-independent database, and queries that are not tractable in general but become tractable on probabilistic databases restricted by functional dependencies. Our operator is semantically equivalent to a sequence of aggregations and can be naturally integrated into existing relational query plans. As a proof of concept, we developed an extension of the PostgreSQL 8.3.3 query engine called SPROUT. We study optimizations that push or pull our operator or parts thereof past joins. The operator employs static information, such as the query structure and functional dependencies, to decide which constituent aggregations can be evaluated together in one scan and how many scans are needed for the overall confidence computation task. A case study on the TPC-H benchmark reveals that most TPC-H queries obtained by removing aggregations can be evaluated efficiently using our operator. Experimental evaluation on probabilistic TPC-H data shows substantial efficiency improvements when compared to the state of the art.

Question: What is the lazy vs. eager query plans for tuple-independent probabilistic databases?


Data-Intensive Question Answering. Microsoft Research Redmond participated for the first time in TREC this year, focusing on the question answering track. There is a separate report in this volume on the Microsoft Research Cambridge submissions for the filtering and Web tracks (Robertson et al., 2002). We have been exploring data-driven techniques for Web question answering, and modified our system somewhat for participation in TREC QA. We submitted two runs for the main QA track (AskMSR and AskMSR2).

Question: What is the first large-scale Canadian peacekeeping mission?


Deep Unsupervised Learning of Visual Similarities. Exemplar learning of visual similarities in an unsupervised manner is a problem of paramount importance to Computer Vision. In this context, however, the recent breakthrough in deep learning could not yet unfold its full potential. With only a single positive sample, a great imbalance between one positive and many negatives, and unreliable relationships between most samples, training of Convolutional Neural networks is impaired. In this paper we use weak estimates of local similarities and propose a single optimization problem to extract batches of samples with mutually consistent relations. Conflicting relations are distributed over different batches and similar samples are grouped into compact groups. Learning visual similarities is then framed as a sequence of categorization tasks. The CNN then consolidates transitivity relations within and between groups and learns a single representation for all samples without the need for labels. The proposed unsupervised approach has shown competitive performance on detailed posture analysis and object classification.

Question: What is deep learning?


Learning to trade via direct reinforcement. We present methods for optimizing portfolios, asset allocations, and trading systems based on direct reinforcement (DR). In this approach, investment decision-making is viewed as a stochastic control problem, and strategies are discovered directly. We present an adaptive algorithm called recurrent reinforcement learning (RRL) for discovering investment policies. The need to build forecasting models is eliminated, and better trading performance is obtained. The direct reinforcement approach differs from dynamic programming and reinforcement algorithms such as TD-learning and Q-learning, which attempt to estimate a value function for the control problem. We find that the RRL direct reinforcement framework enables a simpler problem representation, avoids Bellman's curse of dimensionality and offers compelling advantages in efficiency. We demonstrate how direct reinforcement can be used to optimize risk-adjusted investment returns (including the differential Sharpe ratio), while accounting for the effects of transaction costs. In extensive simulation work using real financial data, we find that our approach based on RRL produces better trading strategies than systems utilizing Q-learning (a value function method). Real-world applications include an intra-daily currency trader and a monthly asset allocation system for the S&P 500 Stock Index and T-Bills.

Question: What is the differential Sharpe ratio?


Formal Verification With Frama-C: A Case Study in the Space Software Domain. With the increasing importance of software in the aerospace field, as evidenced by its growing size and complexity, a rigorous and reliable software verification and validation process must be applied to ensure conformance with the strict requirements of this software. Although important, traditional validation activities such as testing and simulation can only provide a partial verification of behavior in critical real-time software systems, and thus, formal verification is an alternative to complement these activities. Two useful formal software verification approaches are deductive verification and abstract interpretation, which analyze programs statically to identify defects. This paper explores abstract interpretation and deductive verification by employing Frama-C's value analysis and Jessie plug-ins to verify embedded aerospace control software. The results indicate that both approaches can be employed in a software verification process to make software more reliable.

Question: What is the size of the canadian military?


Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report). The isomorphism problem for graphs G1 and G2 is to determine if there exists a one-to-one mapping of the vertices of G1 onto the vertices of G2 such that two vertices of G1 are adjacent if and only if their images in G2 are adjacent. In addition to determining the existence of such an isomorphism, it is useful to be able to produce an isomorphism-inducing mapping in the case where one exists.  The isomorphism problem for triconnected planar graphs is particularly simple since a triconnected planar graph has a unique embedding on a sphere [6]. Weinberg [5] exploited this fact in developing an algorithm for testing isomorphism of triconnected planar graphs in O(|V|2) time where V is the set consisting of the vertices of both graphs. The result has been extended to arbitrary planar graphs and improved to O(|V|log|V|) steps by Hopcroft and Tarjan [2,3]. In this paper, the time bound for planar graph isomorphism is improved to O(|V|). In addition to determining the isomorphism of two planar graphs, the algorithm can be easily extended to partition a set of planar graphs into equivalence classes of isomorphic graphs in time linear in the total number of vertices in all graphs in the set. A random access model of computation (see Cook [1]) is assumed. Although the proposed algorithm has a linear asymptotic growth rate, at the present stage of development it appears to be inefficient on account of a rather large constant. This paper is intended only to establish the existence of a linear algorithm which subsequent work might make truly efficient.

Question: What is the linear time algorithm for isomorphism of planar graphs?


UFMC system performance analysis for discrete narrow-band private networks. In this paper, the performance of universal-filtered multi-carrier (UFMC) system is analyzed. Specifically, the UFMC signals are generated with Dolph-Chebyshev, Hamming and Hanning filtering. The characteristics of UFMC signals are also compared with OFDM signal, in both software and hardware-in-the-loop simulations. Experimental results show that UFMC signals have better performance than OFDM signal, by means of side-lobe attenuation, bit-error-ratio (BER) and Error Vector Magnitude (EVM). The results indicate that the UFMC signal is more suitable than OFDM signal for discrete narrow-band private networks. The results can provide useful information on the design of multi-carrier radio systems.

Question: What is the difference between UFMC and OFDM?