query: Path Planning through PSO Algorithm in Complex Environments

positive: Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans A mobile robot exploring an unknown environment has no absolute frame of reference for its position, other than features it detects through its sensors. Using distinguishable landmarks is one possible approach, but it requires solving the object recognition problem. In particular, when the robot uses two-dimensional laser range scans for localization, it is di cult to accurately detect and localize landmarks in the environment (such as corners and occlusions) from the range scans. In this paper, we develop two new iterative algorithms to register a range scan to a previous scan so as to compute relative robot positions in an unknown environment, that avoid the above problems. The rst algorithm is based on matching data points with tangent directions in two scans and minimizing a distance function in order to solve the displacement between the scans. The second algorithm establishes correspondences between points in the two scans and then solves the point-to-point least-squares problem to compute the relative pose of the two scans. Our methods work in curved environments and can handle partial occlusions by rejecting outliers.

positive: Autonomous robot path planning in dynamic environment using a new optimization technique inspired by Bacterial Foraging technique Path planning is one of the basic and interesting functions for a mobile robot. This paper explores the application of Bacterial Foraging Optimization to the problem of mobile robot navigation to determine shortest feasible path to move from any current position to target position in unknown environment with moving obstacles. It develops a new algorithm based on Bacterial Foraging Optimization (BFO) technique. This algorithm finds a path towards the target and avoiding the obstacles using particles which are randomly distributed on a circle around a robot. The criterion on which it selects the best particle is the distance to target and the Gaussian cost function of the particle. Then, a high level decision strategy is used for the selection and thus proceeds for the result. It works on local environment by using a simple robot sensor. So, it is free from having generated additional map which adds cost. Furthermore, it can be implemented without requirement to tuning algorithm and complex calculation. To simulate the algorithm, the program is written in C language and the environment is created by OpenGL. To test the efficiency of proposed technique, results are compared with Basic Bacterial Foraging Optimization (BFO) and another well-known algorithm called Particle Swarm Optimization (PSO). From the experimental result it can be told that the proposed method gives better path or optimal path.

positive: Mobile Robot Path Planning with Randomly Moving Obstacles and Goal This article presents the dynamic path planning for a mobile robot to track a randomly moving goal with avoidance of multiple randomly moving obstacles. The main feature of the developed scheme is its capability of dealing with the situation that the paths of both the goal and the obstacles are unknown a priori to the mobile robot. A new mathematical approach that is based on the concepts of 3-D geometry is proposed to generate the path of the mobile robot. The mobile robot decides its path in real time to avoid the randomly moving obstacles and to track the randomly moving goal. The developed scheme results in faster decision-making for successful goal tracking. 3-D simulations using MATLAB validate the developed scheme.

positive: Bacterium-inspired robots for environmental monitoring Locating gradient sources and tracking them over time has important applications to environmental monitoring and studies of the ecosystem. We present an approach, inspired by bacterial chemotaxis, for robots to navigate to sources using gradient measurements and a simple actuation strategy (biasing a random walk). Extensive simulations show the efficacy of the approach in varied conditions including multiple sources, dissipative sources, and noisy sensors and actuators. We also show how such an approach could be used for boundary finding. We validate our approach by testing it on a small robot (the robomote) in a phototaxis experiment. A comparison of our approach with gradient descent shows that while gradient descent is faster, our approach is better suited for boundary coverage, and performs better in the presence of multiple and dissipative sources.

positive: Real-time obstacle avoidance for manipulators and mobile robots

negative: Controlling electromagnetic fields. Using the freedom of design that metamaterials provide, we show how electromagnetic fields can be redirected at will and propose a design strategy. The conserved fields-electric displacement field D, magnetic induction field B, and Poynting vector B-are all displaced in a consistent manner. A simple illustration is given of the cloaking of a proscribed volume of space to exclude completely all electromagnetic fields. Our work has relevance to exotic lens design and to the cloaking of objects from electromagnetic fields.

negative: Brain activation and sexual arousal in healthy, heterosexual males. Despite the brain's central role in sexual function, little is known about relationships between brain activation and sexual response. In this study, we employed functional MRI (fMRI) to examine relationships between brain activation and sexual arousal in a group of young, healthy, heterosexual males. Each subject was exposed to two sequences of video material consisting of explicitly erotic (E), relaxing (R) and sports (S) segments in an unpredictable order. Data on penile turgidity was collected using a custom-built pneumatic pressure cuff. Both traditional block analyses using contrasts between sexually arousing and non-arousing video clips and a regression using penile turgidity as the covariate of interest were performed. In both types of analyses, contrast images were computed for each subject and these images were subsequently used in a random effects analysis. Strong activations specifically associated with penile turgidity were observed in the right subinsular region including the claustrum, left caudate and putamen, right middle occipital/ middle temporal gyri, bilateral cingulate gyrus and right sensorimotor and pre-motor regions. Smaller, but significant activation was observed in the right hypothalamus. Few significant activations were found in the block analyses. Implications of the findings are discussed. Our study demonstrates the feasibility of examining brain activation/sexual response relationships in an fMRI environment and reveals a number of brain structures whose activation is time-locked to sexual arousal.

negative: The Complexity of Relational Query Languages (Extended Abstract) Two complexity measures for query languages are proposed. Data complexity is the complexity of evaluating a query in the language as a function of the size of the database, and expression complexity is the complexity of evaluating a query in the language as a function of the size of the expression defining the query. We study the data and expression complexity of logical languages - relational calculus and its extensions by transitive closure, fixpoint and second order existential quantification - and algebraic languages - relational algebra and its extensions by bounded and unbounded looping. The pattern which will be shown is that the expression complexity of the investigated languages is one exponential higher then their data complexity, and for both types of complexity we show completeness in some complexity class.

negative: The emotional power of music: How music enhances the feeling of affective pictures Music is an intriguing stimulus widely used in movies to increase the emotional experience. However, no brain imaging study has to date examined this enhancement effect using emotional pictures (the modality mostly used in emotion research) and musical excerpts. Therefore, we designed this functional magnetic resonance imaging study to explore how musical stimuli enhance the feeling of affective pictures. In a classical block design carefully controlling for habituation and order effects, we presented fearful and sad pictures (mostly taken from the IAPS) either alone or combined with congruent emotional musical excerpts (classical pieces). Subjective ratings clearly indicated that the emotional experience was markedly increased in the combined relative to the picture condition. Furthermore, using a second-level analysis and regions of interest approach, we observed a clear functional and structural dissociation between the combined and the picture condition. Besides increased activation in brain areas known to be involved in auditory as well as in neutral and emotional visual-auditory integration processes, the combined condition showed increased activation in many structures known to be involved in emotion processing (including for example amygdala, hippocampus, parahippocampus, insula, striatum, medial ventral frontal cortex, cerebellum, fusiform gyrus). In contrast, the picture condition only showed an activation increase in the cognitive part of the prefrontal cortex, mainly in the right dorsolateral prefrontal cortex. Based on these findings, we suggest that emotional pictures evoke a more cognitive mode of emotion perception, whereas congruent presentations of emotional visual and musical stimuli rather automatically evoke strong emotional feelings and experiences.

negative: Low-Power and Area-Efficient Carry Select Adder Carry Select Adder (CSLA) is one of the fastest adders used in many data-processing processors to perform fast arithmetic functions. From the structure of the CSLA, it is clear that there is scope for reducing the area and power consumption in the CSLA. This work uses a simple and efficient gate-level modification to significantly reduce the area and power of the CSLA. Based on this modification 8-, 16-, 32-, and 64-b square-root CSLA (SQRT CSLA) architecture have been developed and compared with the regular SQRT CSLA architecture. The proposed design has reduced area and power as compared with the regular SQRT CSLA with only a slight increase in the delay. This work evaluates the performance of the proposed designs in terms of delay, area, power, and their products by hand with logical effort and through custom design and layout in 0.18-μm CMOS process technology. The results analysis shows that the proposed CSLA structure is better than the regular SQRT CSLA.

negative: Digital Media and Symptoms of Attention-Deficit/Hyperactivity Disorder in Adolescents. In many regards, this trial represents the best of evidence-based quality improvement efforts—the improvement in health outcomes is often greater than what would have been expected from the individual components alone. An outcome of the trial by Wang et al is the proof that effective stroke interventions can be implemented in China where the burden of stroke is the highest in the world. Trials like this one leave a lasting legacy because the coaching and follow-up and the demonstration that data collection can lead to better outcomes with practice change will leave each of the intervention hospitals with a platform of good-quality stroke care and a mechanism to keep improving. Similar to the challenge of providing a novel drug to patients after a trial ends, a new dilemma that arises for the trialists is how to get the nonintervention hospitals up to the same level of care as the intervention hospitals. A major challenge is the sustainability of these kinds of interventions. Intensive quality improvement is just not practical for long periods; lower level embedded improvement needs to be built into the culture of a hospital, written into job descriptions, and identified as a deliverable in employment contracts to make continuous improvement possible and likely. In addition, the finer details of the intervention must be made available to others. A “teach the teacher” model may apply in distributing this kind of intervention widely. Overall, this randomized clinical trial by Wang et al has achieved its broad objective of both providing both stroke evidence and implanting practice change in 20 hospitals. The challenge now is to sustain that level of quality improvement at these hospitals, and expand this approach to other centers providing care for patients with acute stroke.

negative: MobileDeepPill: A Small-Footprint Mobile Deep Learning System for Recognizing Unconstrained Pill Images Correct identification of prescription pills based on their visual appearance is a key step required to assure patient safety and facilitate more effective patient care. With the availability of high-quality cameras and computational power on smartphones, it is possible and helpful to identify unknown prescription pills using smartphones. Towards this goal, in 2016, the U.S. National Library of Medicine (NLM) of the National Institutes of Health (NIH) announced a nationwide competition, calling for the creation of a mobile vision system that can recognize pills automatically from a mobile phone picture under unconstrained real-world settings. In this paper, we present the design and evaluation of such mobile pill image recognition system called MobileDeepPill. The development of MobileDeepPill involves three key innovations: a triplet loss function which attains invariances to real-world noisiness that deteriorates the quality of pill images taken by mobile phones; a multi-CNNs model that collectively captures the shape, color and imprints characteristics of the pills; and a Knowledge Distillation-based deep model compression framework that significantly reduces the size of the multi-CNNs model without deteriorating its recognition performance. Our deep learning-based pill image recognition algorithm wins the First Prize (champion) of the NIH NLM Pill Image Recognition Challenge. Given its promising performance, we believe MobileDeepPill helps NIH tackle a critical problem with significant societal impact and will benefit millions of healthcare personnel and the general public.

negative: Fast-and-Light Stochastic ADMM The alternating direction method of multipliers (ADMM) is a powerful optimization solver in machine learning. Recently, stochastic ADMM has been integrated with variance reduction methods for stochastic gradient, leading to SAG-ADMM and SDCA-ADMM that have fast convergence rates and low iteration complexities. However, their space requirements can still be high. In this paper, we propose an integration of ADMM with the method of stochastic variance reduced gradient (SVRG). Unlike another recent integration attempt called SCAS-ADMM, the proposed algorithm retains the fast convergence benefits of SAG-ADMM and SDCA-ADMM, but is more advantageous in that its storage requirement is very low, even independent of the sample size n. Experimental results demonstrate that it is as fast as SAG-ADMM and SDCA-ADMM, much faster than SCAS-ADMM, and can be used on much bigger data sets.

negative: Low-Cost Printed Chipless RFID Humidity Sensor Tag for Intelligent Packaging This paper presents a fully-printed chipless radio frequency identification sensor tag for short-range item identification and humidity monitoring applications. The tag consists of two planar inductor-capacitor resonators operating wirelessly through inductive coupling. One resonator is used to encode ID data based on frequency spectrum signature, and another one works as a humidity sensor, utilizing a paper substrate as a sensing material. The sensing performances of three paper substrates, including commercial packaging paper, are investigated. The use of paper provides excellent sensitivity and reasonable response time to humidity. The cheap and robust packaging paper, particularly, exhibits the largest sensitivity over the relative humidity range from 20% to 70%, which offers the possibility of directly printing the sensor tag on traditional packages to make the package intelligent at ultralow cost.

negative: 2.1 28Gb/s 560mW multi-standard SerDes with single-stage analog front-end and 14-tap decision-feedback equalizer in 28nm CMOS A high-speed SerDes must meet multiple challenges including high-speed operation, intensive equalization technique, low power consumption, small area and robustness. In order to meet new standards, such a OIF CEI-25G-LR, CEI-28G-MR/SR/VSR, IEEE802.3bj and 32G-FC, data-rates are increased to 25 to 28Gb/s, which is more than 75% higher than the previous generation of SerDes. For SerDes applications with several hundreds of lanes integrated in single chip, power consumption is very important factor while maintaining high performance. There are several previous works at 28Gb/s or higher data-rate [1-2]. They use an unrolled DFE to meet the critical timing margin, but the unrolled DFE structure increases the number of DFE slicers, increasing the overall power and die area. In order to tackle these challenges, we introduce several circuits and architectural techniques. The analog front-end (AFE) uses a single-stage architecture and a compact on-chip passive inductor in the transimpedance amplifier (TIA), providing 15dB boost. The boost is adaptive and its adaptation loop is decoupled from the decision-feedback equalizer (DFE) adaptation loop by the use of a group-delay adaptation (GDA) algorithm. DFE has a half-rate 1-tap unrolled structure with 2 total error latches for power and area reduction. A two-stage sense-amplifier-based slicer achieves a sensitivity of 15mV and DFE timing closure. We also develop a high-speed clock buffer that uses a new active-inductor circuit. This active-inductor circuit has the capability to control output-common-mode voltage to optimize circuit operating points.

negative: Making Decisions about Self-Disclosure in Online Social Networks This paper explores privacy calculus decision making processes for online social networks (OSN). Content analysis method is applied to analyze data obtained from face-to-face interviews and online survey with open-ended questions of 96 OSN users from different countries. The factors users considered before self-disclosing are explored. The perceived benefits and risks of using OSN and their impact on self-disclosure are also identified. We determine that the perceived risks of OSN usage hinder selfdisclosure. It is not clear, however, whether the perceived benefits offset the impact of the risks on selfdisclosure behavior. The findings as a whole do not support privacy calculus in OSN settings.

negative: Deep learning methods and applications - Classification of traffic signs and detection of Alzheimer's disease from images In this thesis, the deep learning method convolutional neural networks (CNNs) has been used in an attempt to solve two classification problems, namely traffic sign recognition and Alzheimer’s disease detection. The two datasets used are from the German Traffic Sign Recognition Benchmark (GTSRB) and the Alzheimer’s Disease Neuroimaging Initiative (ADNI). The final test results on the traffic sign dataset generated a classification accuracy of 98.81 %, almost as high as human performance on the same dataset, 98.84 %. Different parameter settings of the selected CNN structure have also been tested in order to see their impact on the classification accuracy. Trying to distinguish between MRI images of healthy brains and brains afflicted with Alzheimer’s disease gained only about 65 % classification accuracy. These results show that the convolutional neural network approach is very promising for classifying traffic signs, but more work needs to be done when working with the more complex problem of detecting Alzheimer’s disease.

negative: Digital Clock and Data Recovery Circuits for Optical Links Clock and Data Recovery (CDR) circuits perform the function of recovering clock and re-timing received data in optical links. These CDRs must be capable of tolerating large input jitter (high JTOL), filter input jitter (low JTRAN with no jitter peaking) and in burst-mode applications be capable of phase locking in a very short time. In this paper, we elucidate these design tradeoffs and present various CDR architectures that can overcome them. Specifically, D/PLL CDR architecture that achieves high JTOL, low JTRAN, and no jitter peaking is described. A new burst-mode CDR that can lock instantaneously while filtering input jitter is also discussed.

negative: Can Structural Models Price Default Risk ? Evidence from Bond and Credit Derivative Markets ∗ Using a set of structural models, we evaluate the price of default protection for a sample of US corporations. In contrast to previous evidence from corporate bond data, CDS premia are not systematically underestimated. In fact, one of our studied models has little difficulty on average in predicting their level. For robustness, we perform the same exercise for bond spreads by the same issuers on the same trading date. As expected, bond spreads relative to the Treasury curve are systematically underestimated. This is not the case when the swap curve is used as a benchmark, suggesting that previously documented underestimation results may be sensitive to the choice of risk free rate. ∗We are indebted to seminar participants at Wilfrid Laurier University, Carnegie Mellon University, the Bank of Canada, McGill University and Queen’s University for helpful discussions. In addition, we are grateful to participants of the 2005 EFA in Moscow, the 2005 NFA in Vancouver, the 2006 CFP Vallendar conference and the 2006 Moody’s NYU Credit Risk Conference. We are particularly grateful to Stephen Schaefer for comments. †Faculty of Management, McGill University, 1001 Sherbrooke Street West, Montreal QC, H3A 1G5 Canada. Tel +1 514 398-3186, Fax +1 514 398-3876, Email jan.ericsson@mcgill.ca. ‡Stockholm School of Economics, Department of Finance, Box 6501, S-113 83 Stockholm, Sweden. Tel: +46 8 736 9143, fax +46 8 312327. 1

negative: To ban or not to ban: Differences in mobile phone policies at elementary, middle, and high schools The present study was to examine differences in mobile phone policies at elementary, middle and high schools. We surveyed 245 elementary, middle and high schools teachers in Shenzhen of China, using a specially designed 18-item questionnaire. Teachers’ responses indicate that, across elementary, middle and high schools, significant differences exist in (1) students’ percentages of using mobile phones among students, (2) students’ dependence of mobile phones, (3) the number of schools banning students’ mobile phone use, (4) oral and written forms used by schools to ban students’ mobile phone use, and (5) policy reinforcement strategies used by schools. However, no school-level differences was found in (1) students’ fondness of using mobile phones, (2) teachers’ assessment of low-level effectiveness of mobile phone policies, and (3) teachers’ policy improvement recommendations. Significance and implications of the findings are discussed. 2014 Elsevier Ltd. All rights reserved.

negative: Modeling and yield estimation of SRAM sub-system for different capacities subjected to parametric variations Process variations have become a major challenge with the advancement in CMOS technologies. The performance of memory sub-systems such as Static Random Access Memory (SRAMs) is heavily dependent on these variations. Also, the VLSI industry requires the SRAM bit cell to qualify in the order of less than 0.1ppb to achieve higher Yield (Y). This paper proposes an efficient qualitative statistical analysis and Yield estimation method of SRAM sub-system which considers deviations due to variations in process parameters in bit line differential and input offset of sense amplifier (SA) all together. The Yield of SRAM is predicted for different capacities of SRAM array by developing a statistical model of memory sub-system in 65nm bulk CMOS technology. For the sub-system with 64 bit cells, it is estimated that the probability of failure is 4.802 ∗ 10−13 in a read cycle of frequency 1GHz. Furthermore, the probability of failure for 8MB capacity is 5.035 ∗ 10−7 while for 2GB capacity it increases to 1.289 ∗ 10−5. It is also observed that as the load on one SA per column is doubled, the probability of failure of memory slice increases by 70%. The proposed technique estimates the Yield(Y) for SRAM array to be more than 99.9999.

negative:
BigDebug: Debugging Primitives for Interactive Big Data Processing in Spark Developers use cloud computing platforms to process a large quantity of data in parallel when developing big data analytics. Debugging the massive parallel computations that run in today's datacenters is time consuming and error-prone. To address this challenge, we design a set of interactive, real-time debugging primitives for big data processing in Apache Spark, the next generation data-intensive scalable cloud computing platform. This requires rethinking the notion of step-through debugging in a traditional debugger such as gdb, because pausing the entire computation across distributed worker nodes causes significant delay and naively inspecting millions of records using a watchpoint is too time consuming for an end user.
 First, BigDebug's simulated breakpoints and on-demand watchpoints allow users to selectively examine distributed, intermediate data on the cloud with little overhead. Second, a user can also pinpoint a crash-inducing record and selectively resume relevant sub-computations after a quick fix. Third, a user can determine the root causes of errors (or delays) at the level of individual records through a fine-grained data provenance capability. Our evaluation shows that BigDebug scales to terabytes and its record-level tracing incurs less than 25% overhead on average. It determines crash culprits orders of magnitude more accurately and provides up to 100% time saving compared to the baseline replay debugger. The results show that BigDebug supports debugging at interactive speeds with minimal performance impact.

negative: The effect of different types of corrective feedback on ESL student writing Debate about the value of providing corrective feedback on L2 writing has been prominent in recent years as a result of Truscott’s [Truscott, J. (1996). The case against grammar correction in L2 writing classes. Language Learning, 46, 327–369] claim that it is both ineffective and harmful and should therefore be abandoned. A growing body of empirical research is now investigating the agenda proposed by Ferris [Ferris, D.R. (1999). The case for grammar correction in L2 writing classes. A response to Truscott (1996). Journal of Second Language Writing, 8, 1–10, Ferris, D.R. (2004). The ‘‘Grammar Correction’’ debate in L2 writing: Where are we, and where do we go from here? (and what do we do in the meantime. . .?). Journal of Second Language Writing, 13, 49–62.]. Contributing to this research base, the study reported in this article investigated whether the type of feedback (direct, explicit written feedback and student–researcher 5 minute individual conferences; direct, explicit written feedback only; no corrective feedback) given to 53 adult migrant students on three types of error (prepositions, the past simple tense, and the definite article) resulted in improved accuracy in new pieces of writing over a 12 week period. The study found a significant effect for the combination of written and conference feedback on accuracy levels in the use of the past simple tense and the definite article in new pieces of writing but no overall effect on accuracy improvement for feedback types when the three error categories were considered as a single group. Significant variations in accuracy across the four pieces of writing support earlier SLA discoveries that L2 learners, in the process of acquiring new linguistic forms, may perform them with accuracy on one occasion but fail to do so on other similar occasions. # 2005 Elsevier Inc. All rights reserved.

negative: Gut microbes and the brain: paradigm shift in neuroscience. The discovery of the size and complexity of the human microbiome has resulted in an ongoing reevaluation of many concepts of health and disease, including diseases affecting the CNS. A growing body of preclinical literature has demonstrated bidirectional signaling between the brain and the gut microbiome, involving multiple neurocrine and endocrine signaling mechanisms. While psychological and physical stressors can affect the composition and metabolic activity of the gut microbiota, experimental changes to the gut microbiome can affect emotional behavior and related brain systems. These findings have resulted in speculation that alterations in the gut microbiome may play a pathophysiological role in human brain diseases, including autism spectrum disorder, anxiety, depression, and chronic pain. Ongoing large-scale population-based studies of the gut microbiome and brain imaging studies looking at the effect of gut microbiome modulation on brain responses to emotion-related stimuli are seeking to validate these speculations. This article is a summary of emerging topics covered in a symposium and is not meant to be a comprehensive review of the subject.

negative: A Combined Model- and Learning-Based Framework for Interaction-Aware Maneuver Prediction This paper presents a novel online-capable interaction-aware intention and maneuver prediction framework for dynamic environments. The main contribution is the combination of model-based interaction-aware intention estimation with maneuver-based motion prediction based on supervised learning. The advantages of this framework are twofold. On one hand, expert knowledge in the form of heuristics is integrated, which simplifies the modeling of the interaction. On the other hand, the difficulties associated with the scalability and data sparsity of the algorithm due to the so-called curse of dimensionality can be reduced, as a reduced feature space is sufficient for supervised learning. The proposed algorithm can be used for highly automated driving or as a prediction module for advanced driver assistance systems without the need of intervehicle communication. At the start of the algorithm, the motion intention of each driver in a traffic scene is predicted in an iterative manner using the game-theoretic idea of stochastic multiagent simulation. This approach provides an interpretation of what other drivers intend to do and how they interact with surrounding traffic. By incorporating this information into a Bayesian network classifier, the developed framework achieves a significant improvement in terms of reliable prediction time and precision compared with other state-of-the-art approaches. By means of experimental results in real traffic on highways, the validity of the proposed concept and its online capability is demonstrated. Furthermore, its performance is quantitatively evaluated using appropriate statistical measures.

negative: Running on the bare metal with GeekOS Undergraduate operating systems courses are generally taught using one of two approaches: abstract or concrete. In the abstract approach, students learn the concepts underlying operating systems theory, and perhaps apply them using user-level threads in a host operating system. In the concrete approach, students apply concepts by working on a real operating system kernel. In the purest manifestation of the concrete approach, students implement operating system projects that run on real hardware.GeekOS is an instructional operating system kernel which runs on real hardware. It provides the minimum functionality needed to schedule threads and control essential devices on an x86 PC. On this foundation, we have developed projects in which students build processes, semaphores, a multilevel feedback scheduler, paged virtual memory, a filesystem, and inter-process communication. We use the Bochs emulator for ease of development and debugging. While this approach (tiny kernel run on an emulator) is not new, we believe GeekOS goes further towards the goal of combining realism and simplicity than previous systems have.

negative: The Reorganization of Human Brain Networks Modulated by Driving Mental Fatigue The organization of the brain functional network is associated with mental fatigue, but little is known about the brain network topology that is modulated by the mental fatigue. In this study, we used the graph theory approach to investigate reconfiguration changes in functional networks of different electroencephalography (EEG) bands from 16 subjects performing a simulated driving task. Behavior and brain functional networks were compared between the normal and driving mental fatigue states. The scores of subjective self-reports indicated that 90 min of simulated driving-induced mental fatigue. We observed that coherence was significantly increased in the frontal, central, and temporal brain regions. Furthermore, in the brain network topology metric, significant increases were observed in the clustering coefficient (<italic>Cp</italic>) for beta, alpha, and delta bands and the character path length (<italic> Lp</italic>) for all EEG bands. The normalized measures <inline-formula><tex-math notation="LaTeX"> $\boldsymbol{\gamma}$</tex-math></inline-formula> showed significant increases in beta, alpha, and delta bands, and <inline-formula><tex-math notation="LaTeX">$\boldsymbol{\lambda}$</tex-math></inline-formula> showed similar patterns in beta and theta bands. These results indicate that functional network topology can shift the network topology structure toward a more economic but less efficient configuration, which suggests low wiring costs in functional networks and disruption of the effective interactions between and across cortical regions during mental fatigue states. Graph theory analysis might be a useful tool for further understanding the neural mechanisms of driving mental fatigue.

negative: Automatic Image Annotation using Deep Learning Representations We propose simple and effective models for the image annotation that make use of Convolutional Neural Network (CNN) features extracted from an image and word embedding vectors to represent their associated tags. Our first set of models is based on the Canonical Correlation Analysis (CCA) framework that helps in modeling both views - visual features (CNN feature) and textual features (word embedding vectors) of the data. Results on all three variants of the CCA models, namely linear CCA, kernel CCA and CCA with k-nearest neighbor (CCA-KNN) clustering, are reported. The best results are obtained using CCA-KNN which outperforms previous results on the Corel-5k and the ESP-Game datasets and achieves comparable results on the IAPRTC-12 dataset. In our experiments we evaluate CNN features in the existing models which bring out the advantages of it over dozens of handcrafted features. We also demonstrate that word embedding vectors perform better than binary vectors as a representation of the tags associated with an image. In addition we compare the CCA model to a simple CNN based linear regression model, which allows the CNN layers to be trained using back-propagation.

negative: A round- and computation-efficient three-party authenticated key exchange protocol In three-party authenticated key exchange protocols, each client shares a secret only with a trusted server with assists in generating a session key used for securely sending messages between two communication clients. Compared with two-party authenticated key exchange protocols where each pair of parties must share a secret with each other, a three-party protocol does not cause any key management problem for the parties. In the literature, mainly there exist three issues in three-party authenticated key exchange protocols are discussed that need to be further improved: (1) to reduce latency, communication steps in the protocol should be as parallel as possible; (2) as the existence of a security-sensitive table on the server side may cause the server to become compromised, the table should be removed; (3) resources required for computation should be as few as possible to avoid the protocol to become an efficiency bottleneck. In various applications over networks, a quick response is required especially by light-weight clients in the mobile e-commerce. In this paper, a roundand computation-efficient three-party authenticated key exchange protocol is proposed which fulfils all of the above mentioned requirements. 2007 Elsevier Inc. All rights reserved.

negative: From eye movements to actions: how batsmen hit the ball In cricket, a batsman watches a fast bowler's ball come toward him at a high and unpredictable speed, bouncing off ground of uncertain hardness. Although he views the trajectory for little more than half a second, he can accurately judge where and when the ball will reach him. Batsmen's eye movements monitor the moment when the ball is released, make a predictive saccade to the place where they expect it to hit the ground, wait for it to bounce, and follow its trajectory for 100–200 ms after the bounce. We show how information provided by these fixations may allow precise prediction of the ball's timing and placement. Comparing players with different skill levels, we found that a short latency for the first saccade distinguished good from poor batsmen, and that a cricket player's eye movement strategy contributes to his skill in the game.

negative: Path-guided artificial potential fields with stochastic reachable sets for motion planning in highly dynamic environments Highly dynamic environments pose a particular challenge for motion planning due to the need for constant evaluation or validation of plans. However, due to the wide range of applications, an algorithm to safely plan in the presence of moving obstacles is required. In this paper, we propose a novel technique that provides computationally efficient planning solutions in environments with static obstacles and several dynamic obstacles with stochastic motions. Path-Guided APF-SR works by first applying a sampling-based technique to identify a valid, collision-free path in the presence of static obstacles. Then, an artificial potential field planning method is used to safely navigate through the moving obstacles using the path as an attractive intermediate goal bias. In order to improve the safety of the artificial potential field, repulsive potential fields around moving obstacles are calculated with stochastic reachable sets, a method previously shown to significantly improve planning success in highly dynamic environments. We show that Path-Guided APF-SR outperforms other methods that have high planning success in environments with 300 stochastically moving obstacles. Furthermore, planning is achievable in environments in which previously developed methods have failed.

negative: Feature selection based on rough sets and particle swarm optimization We propose a new feature selection strategy based on rough sets and Particle Swarm Optimization (PSO). Rough sets has been used as a feature selection method with much success, but current hill-climbing rough set approaches to feature selection are inadequate at finding optimal reductions as no perfect heuristic can guarantee optimality. On the other hand, complete searches are not feasible for even medium-sized datasets. So, stochastic approaches provide a promising feature selection mechanism. Like Genetic Algorithms, PSO is a new evolutionary computation technique, in which each potential solution is seen as a particle with a certain velocity flying through the problem space. The Particle Swarms find optimal regions of the complex search space through the interaction of individuals in the population. PSO is attractive for feature selection in that particle swarms will discover best feature combinations as they fly within the subset space. Compared with GAs, PSO does not need complex operators such as crossover and mutation, it requires only primitive and simple mathematical operators, and is computationally inexpensive in terms of both memory and runtime. Experimentation is carried out, using UCI data, which compares the proposed algorithm with a GA-based approach and other deterministic rough set reduction algorithms. The results show that PSO is efficient for rough set-based feature selection.

negative: A Hybrid Ant Colony Optimization Algorithm for Path Planning of Robot in Dynamic Environment Ant colony optimization and artificial potential field were used respectively as global path planning and local path planning methods in this paper. Some modifications were made to accommodate ant colony optimization to path planning. Pheromone generated by ant colony optimization was also utilized to prevent artificial potential field from getting local minimum. Simulation results showed that the hybrid algorithm could satisfy the real-time demand. The comparison between ant colony optimization and genetic algorithm was also made in this paper.

negative: Path planning for UAV based on improved heuristic A∗ algorithm A 3D vehicle path planning method based on heuristic A∗ algorithm is proposed and simulated which makes the UAV's path planning for low altitude penetration more real-time, effective and engineering-oriented. The digital terrain information is processed with the integrated terrain elevation smoothing algorithm at first, and then, the safe flight surface which integrates the maneuverability of vehicle is built, At last, the mathematical models of the threats are established. An improved A∗ algorithm is used to plan 3D vehicle path on the safe surface, and the planned path is optimized and smoothed. Simulation results indicate that the method has a good performance in creating optimal path in 3D environment and what's more, the path planning algorithm is simple, efficient and easily realized in engineering field, thus adapting to the different missions of the UAV.

negative: Path Planning with Real Time Obstacle Avoidance One of the most important areas of research on mobile robots is that of their moving from one point in a space to the other and that too keeping aloof from the different objects in their path i. e. real time obstacle detection. This is the basic problem of path planning through a continuous domain. For this a large number of algorithms have been proposed of which only a few are really good as far as local and global path planning are concerned as to some extent a trade of has to be made between the efficiency of the algorithm and its accuracy. In this project an integrated approach for both local as well as global path planning of a robot has been proposed. The primary algorithm that has been used for path planning is the artificial Potential field approach [1] and a* search algorithm has been used for finding the most optimum path for the robot. Obstacle detection for collision avoidance (a high level planning problem) can be effectively done by doing complex robot operations in real time and distributing the whole problem between different control levels. This project proposes the artificial potential field algorithm not only for static but also for moving obstacles using real time potential field values by creating sub-goals which eventually lead to the main goal of the most optimal complete path found by the A* search algorithm. Apart from these scan line and convex hull techniques have been used to improve the robustness of the algorithm. To some extent the shape and size of a robot has also been taken into consideration. The effectiveness of these algorithms has been

negative: A Novel Global Path Planning Method for Mobile Robots Based on Teaching-Learning-Based Optimization The Teaching-Learning-Based Optimization (TLBO) algorithm has been proposed in recent years. It is a new swarm intelligence optimization algorithm simulating the teaching-learning phenomenon of a classroom. In this paper, a novel global path planning method for mobile robots is presented, which is based on an improved TLBO algorithm called Nonlinear Inertia Weighted Teaching-Learning-Based Optimization (NIWTLBO) algorithm in our previous work. Firstly, the NIWTLBO algorithm is introduced. Then, a new map model of the path between start-point and goal-point is built by coordinate system transformation. Lastly, utilizing the NIWTLBO algorithm, the objective function of the path is optimized; thus, a global optimal path is obtained. The simulation experiment results show that the proposed method has a faster convergence rate and higher accuracy in searching for the path than the basic TLBO and some other algorithms as well, and it can effectively solve the optimization problem for mobile robot global path planning.

negative: Autonomous local path planning for a mobile robot using a genetic algorithm This work presents results of our work in development of a genetic algorithm based path-planning algorithm for local obstacle avoidance (local feasible path) of a mobile robot in a given search space. The method tries to find not only a valid path but also an optimal one. The objectives are to minimize the length of the path and the number of turns. The proposed path-planning method allows a free movement of the robot in any direction so that the path-planner can handle complicated search spaces.


query: Conditional proxy re-encryption secure against chosen-ciphertext attack

positive: Divertible Protocols and Atomic Proxy Cryptography First, we introduce the notion of divertibility as a protocol property as opposed to the existing notion as a language property (see Okamoto, Ohta [OO90]). We give a definition of protocol divertibility that applies to arbitrary 2-party protocols and is compatible with Okamoto and Ohta’s definition in the case of interactive zero-knowledge proofs. Other important examples falling under the new definition are blind signature protocols. We propose a sufficiency criterion for divertibility that is satisfied by many existing protocols and which, surprisingly, generalizes to cover several protocols not normally associated with divertibility (e.g., Diffie-Hellman key exchange). Next, we introduce atomic proxy cryptography, in which an atomic proxy function, in conjunction with a public proxy key, converts ciphertexts (messages or signatures) for one key into ciphertexts for another. Proxy keys, once generated, may be made public and proxy functions applied in untrusted environments. We present atomic proxy functions for discrete-log-based encryption, identification, and signature schemes. It is not clear whether atomic proxy functions exist in general for all public-key cryptosystems. Finally, we discuss the relationship between divertibility and proxy cryptography.

positive: Proxy Cryptography Revisited In this work we revisit and formally study the notion of proxy cryptography. Intuitively, various proxy functions allow two cooperating parties F (the “FBI”) and P (the “proxy”) to duplicate the functionality available to t he third party U (the “user”), without being able to perform this functionality on their own (without cooperation). The concept is closely related to the notion of threshold cryptography, except we deal with only two parties P andF , and place very strict restrictions on the way the operations are performed (which is done for the sake of efficiency, usability and scalability). For example, for decryption (res p. signature)P (F ) sends a single message to F (P ), after which the latter can decrypt (sign) the message. Our formal modeling of proxy cryptography significantly generalizes, simplifies and simultaneously clarifies the model of “atomic proxy” suggested by Blaze and Strauss [4]. In particular, we define bidirectional and unidirectional var iants of our model 1, and show extremely simple generic solutions for proxy signature and encryption in these models. We also give more efficient solutions for several specific schemes. We conclude that proxy cryptography is a relatively simple concept to satisfy when looked from the correct and formal standpoint.

positive:
A Hard-Core Predicate for all One-Way Functions A central tool in constructing pseudorandom generators, secure encryption functions, and in other areas are “hard-core” predicates <italic>b</italic> of functions (permutations) ƒ, discovered in [Blum Micali 82]. Such <italic>b</italic>(<italic>x</italic>) cannot be efficiently guessed (substantially better than 50-50) given only ƒ(<italic>x</italic>). Both <italic>b</italic>, ƒ are computable in polynomial time.
[Yao 82] transforms any one-way function ƒ into a more complicated one, ƒ<supscrpt>*</supscrpt>, which has a hard-core predicate. The construction applies the original ƒ to many small pieces of the input to ƒ<supscrpt>*</supscrpt> just to get one “hard-core” bit. The security of this bit may be smaller than any constant positive power of the security of ƒ. In fact, for inputs (to ƒ<supscrpt>*</supscrpt>) of practical size, the pieces effected by ƒ are so small that ƒ can be inverted (and the “hard-core” bit computed) by exhaustive search.
In this paper we show that every one-way function, padded to the form ƒ(<italic>p</italic>, <italic>x</italic>) = (<italic>p</italic>, <italic>g</italic>(<italic>x</italic>)), ‖‖<italic>p</italic>‖‖ = ‖<italic>x</italic>‖, has by itself a hard-core predicate of the same (within a polynomial) security. Namely, we prove a conjecture of [Levin 87, sec. 5.6.2] that the scalar product of Boolean vectors <italic>p</italic>, <italic>x</italic> is a hard-core of every one-way function ƒ(<italic>p</italic>, <italic>x</italic>) = (<italic>p</italic>, <italic>g</italic>(<italic>x</italic>)). The result extends to multiple (up to the logarithm of security) such bits and to any distribution on the <italic>x</italic>'s for which ƒ is hard to invert.

positive: Zero-knowledge proofs of identity In this paper we extend the notion of zero knowledge proofs of membership (which reveal one bit of information) to zero knowledge proofs of knowledge (which reveal no information whatsoever). After formally defining this notion, we show its relevance to identification schemes, in which parties prove their identity by demonstrating their knowledge rather than by proving the validity of assertions. We describe a novel scheme which is provably secure if factoring is difficult and whose practical implementations are about two orders of magnitude faster than RSA-based identification schemes. In the last part of the paper we consider the question of sequential versus parallel executions of zero knowledge protocols, define a new notion of “transferable information”, and prove that the parallel version of our identification scheme (which is not known to be zero knowledge) is secure since it reveals no transferable information.

negative: Adversarial Localization Network We propose the Adversarial Localization Network, a novel weakly supervised approach to generate object masks in an image. We train a corruption net to mask out regions of the image to reduce prediction confidence of the classifier. To avoid generating adversarial artifacts due to vulnerability of deep networks to adversarial perturbation, we also co-train the classifier to correctly predict the corrupted images. Our approach could efficiently produce reasonable object masks with a simple architecture and few hyper-parameters. We achieve competitive results on the ILSVRC2012 dataset for object localization with only image level labels and no bounding boxes for training.

negative: Essential communication practices for Extreme Programming in a global software development team We conducted an industrial case study of a distributed team in the USA and the Czech Republic that used Extreme Programming. Our goal was to understand how this globally-distributed team created a successful project in a new problem domain using a methodology that is dependent on informal, face-to-face communication. We collected quantitative and qualitative data and used grounded theory to identify four key factors for communication in globally-distributed XP teams working within a new problem domain. Our study suggests that, if these critical enabling factors are addressed, methodologies dependent on informal communication can be used on global software development projects.

negative: A Multi-Modal Approach to Infer Image Affect e group aect or emotion in an image of people can be inferred by extracting features about both the people in the picture and the overall makeup of the scene. e state-of-the-art on this problem investigates a combination of facial features, scene extraction and even audio tonality. is paper combines three additional modalities, namely, human pose, text-based tagging and CNN extracted features / predictions. To the best of our knowledge, this is the rst time all of the modalities were extracted using deep neural networks. We evaluate the performance of our approach against baselines and identify insights throughout this paper.

negative: Privacy by BlockChain Design: A BlockChain-enabled GDPR-compliant Approach for Handling Personal Data This paper takes an initial step forward in bringing to life the certification mechanisms according to Art. 42 of the General Data Protection Regulation (GDPR). These newly established methods of legal specification act not only as a central vehicle for overcoming widely articulated and discussed legal challenges, but also as a sandbox for the much needed close collaboration between computer sciences and legal studies. In order to illustrate, for example, what data protection seals could look like in the future, the authors propose a methodology for "translating" legal requirements into technical guidelines: architectural blueprints designed using legal requirements. The purpose of these blueprints is to show developers how their solutions might comply with the principle of Privacy by Design (Art. 25 GDPR). To demonstrate this methodology, the authors propose an architectural blueprint that embodies the legal concept of the data subject’s consent (Art. 6 sec. 1 lit. a GDPR) and elevates best practice to a high standard of Privacy by Design. Finally, the authors highlight further legal problems concerning blockchain technology under the GDPR that will have to be addressed in order to achieve a comprehensive certification mechanism for Privacy by Blockchain Design in the future. ACM Classification

negative: Systematic literature reviews in software engineering - A systematic literature review Background: In 2004 the concept of evidence-based software engineering (EBSE) was introduced at the ICSE04 conference. Aims: This study assesses the impact of systematic literature reviews (SLRs) which are the recommended EBSE method for aggregating evidence. Method: We used the standard systematic literature review method employing a manual search of 10 journals and 4 conference proceedings. Results: Of 20 relevant studies, eight addressed research trends rather than technique evaluation. Seven SLRs addressed cost estimation. The quality of SLRs was fair with only three scoring less than 2 out of 4. Conclusions: Currently, the topic areas covered by SLRs are limited. European researchers, particularly those at the Simula Laboratory appear to be the leading exponents of systematic literature reviews. The series of cost estimation SLRs demonstrate the potential value of EBSE for synthesising evidence and making it available to practitioners. ! 2008 Elsevier B.V. All rights reserved.

negative: Generating Sentence Planning Variations for Story Telling There has been a recent explosion in applications for dialogue interaction ranging from direction-giving and tourist information to interactive story systems. Yet the natural language generation (NLG) component for many of these systems remains largely handcrafted. This limitation greatly restricts the range of applications; it also means that it is impossible to take advantage of recent work in expressive and statistical language generation that can dynamically and automatically produce a large number of variations of given content. We propose that a solution to this problem lies in new methods for developing language generation resources. We describe the ES-TRANSLATOR, a computational language generator that has previously been applied only to fables, and quantitatively evaluate the domain independence of the EST by applying it to personal narratives from weblogs. We then take advantage of recent work on language generation to create a parameterized sentence planner for story generation that provides aggregation operations, variations in discourse and in point of view. Finally, we present a user evaluation of different personal narrative retellings.

negative: Persecutory delusions and catastrophic worry in psychosis: developing the understanding of delusion distress and persistence. In a recent theoretical account of persecutory delusions, it is suggested that anxiety and worry are important factors in paranoid experience [Freeman, D., Garety, P. A., Kuipers, E., Fowler, D., & Bebbington, P. E. (2002). A cognitive model of persecutory delusions. British Journal of Clinical Psychology, 41(4), 331-347]. In emotional disorders worry has been understood in terms of catastrophising. In the current study, the concept of catastrophising is applied for the first time with persecutory delusions. Thirty individuals with current persecutory delusions and 30 non-clinical controls participated in a cross-sectional study. The group with persecutory delusions was also followed up at 3 months to assess predictors of delusion persistence. At its most severe, 21% of individuals with persecutory delusions had clinical worry, 68% had levels of worry comparable with treatment seeking GAD patients. Further, high levels of anxiety, worry and catastrophising were associated with high levels of persecutory delusion distress and with the persistence of delusions over 3 months. If future research replicates these findings, worry reduction interventions for individuals with persecutory delusions may be warranted.

negative: Resilience and Sustainable Development : Theory of resilience , systems thinking and adaptive governance  Basic information on SD  Country profiles  Quarterly reports  Policy briefs  Case studies  Conference papers  Workshop papers  Getting in touch with us The European Sustainable Development Network (ESDN) is an informal network of public administrators and other experts who deal with sustainable development strategies and policies. The network covers all 27 EU Member States, plus other European countries. The ESDN is active in promoting sustainable development and facilitating the exchange of good practices in Europe and gives advice to policy-makers at the European and national levels. This ESDN Quarterly Report (QR) provides a condensed overview of the concept of resilience. Despite the complexity of the theory behind resilience, this QR tries to communicate the main notions behind this concept in a way that is understandable and not overly technical. The intention of this QR is to serve as a guide through the concept of resilience. The report does not aim at being exhaustive but intends to provide an overview on the links which are particularly relevant for sustainable development (SD) in general and SD governance in particular. A multitude of diverse sources have been used, mainly from the academic literature. It has to be mentioned the significant and decisive role that the Resilience Alliance has in providing extensive knowledge: the website that they are running, is an exceptionally good source of information for those who are interested and want to deepen their knowledge of resilience. Additionally, among all the scientific publications cited throughout the report, a special mention goes to the book by Walker and Salt (2006) entitled " Resilience thinking: sustaining ecosystems and people in a changing world " , which is very much suggested as a practical source of information on resilience. As a first chapter, an executive summary is provided with a short overview of the report with the essential notions that are depicted throughout the QR. The second chapter then introduces the concept of resilience and gives an extensive background on the notions behind it. It intends to provide guidance, especially to understand the linkages between the concept of resilience and sustainable development, and the importance of resilience and systems thinking for policy-makers and for those who work on SD governance. The third chapter summarizes the relationships among resilience, society, governance and policy. Therefore, the concept of 'adaptive governance' is advanced as a more appropriate way to deal with …

negative: Structured light in scattering media Virtually all structured light methods assume that the scene and the sources are immersed in pure air and that light is neither scattered nor absorbed. Recently, however, structured lighting has found growing application in underwater and aerial imaging, where scattering effects cannot be ignored. In this paper, we present a comprehensive analysis of two representative methods - light stripe range scanning and photometric stereo - in the presence of scattering. For both methods, we derive physical models for the appearances of a surface immersed in a scattering medium. Based on these models, we present results on (a) the condition for object detectability in light striping and (b) the number of sources required for photometric stereo. In both cases, we demonstrate that while traditional methods fail when scattering is significant, our methods accurately recover the scene (depths, normals, albedos) as well as the properties of the medium. These results are in turn used to restore the appearances of scenes as if they were captured in clear air. Although we have focused on light striping and photometric stereo, our approach can also be extended to other methods such as grid coding, gated and active polarization imaging.

negative: Multigranulation decision-theoretic rough sets Article history: Available online 23 March 2013

negative: Perfectly Matched Layers for Elastodynamics : A New Absorbing Boundary The use of perfectly matched layers (PML) has recently been introduced by Berenger as a material absorbing boundary condition (ABC) for electromagnetic waves. In this paper, we will rst prove that a ctitious elastodynamic material half-space exists that will absorb an incident wave for all angles and all frequencies. Moreover, the wave is attenuative in the second half-space. As a consequence, layers of such material could be designed at the edge of a computer simulation region to absorb outgoing waves. Since this is a material ABC, only one set of computer codes is needed to simulate an open region. Hence, it is easy to parallelize such codes on multiprocessor computers. For instance, it is easy to program massively parallel computers on the SIMD (single instruction multiple data) mode for such codes. We will show two and three dimensional computer simulations of the PML for the linearized equations of elastodyanmics. Comparison with Liao's ABC will be given.

negative: Mitigating IoT security threats with a trusted Network element Securing the growing amount of IoT devices is a challenge for both the end-users bringing IoT devices into their homes, as well as the corporates and industries exposing these devices into the Internet as part of their service or operations. The exposure of these devices, often poorly configured and secured, offers malicious actors an easy access to the private information of their users, or potential to utilize the devices in further activities, e.g., attacks on other devices via Distributed Denial of Service. This paper discusses the current security challenges of IoT devices and proposes a solution to secure these devices via a trusted Network Edge Device. NED offloads the security countermeasures of the individual devices into the trusted network elements. The major benefit of this approach is that the system can protect the IoT devices with user-defined policies, which can be applied to all devices regardless of the constraints of computing resources in the IoT tags. Additional benefit is the possibility to manage the countermeasures of multiple IoT devices/gateways at once, via a shared interface, thus largely avoiding the per-device maintenance operations.

negative: The All Relevant Feature Selection using Random Forest In this paper we examine the application of the random forest classifier for the all relevant feature selection problem. To this end we first examine two recently proposed all relevant feature selection algorithms, both being a random forest wrappers, on a series of synthetic data sets with varying size. We show that reasonable accuracy of predictions can be achieved and that heuristic algorithms that were designed to handle the all relevant problem, have performance that is close to that of the reference ideal algorithm. Then, we apply one of the algorithms to four families of semi-synthetic data sets to assess how the properties of particular data set influence results of feature selection. Finally we test the procedure using a well-known gene expression data set. The relevance of nearly all previously established important genes was confirmed, moreover the relevance of several new ones is discovered.

negative: Using Indirect Encoding of Multiple Brains to Produce Multimodal Behavior An important challenge in neuroevolution is to evolve complex neural networks with multiple modes of behavior. Indirect encodings can potentially answer this challenge. Yet in practice, indirect encodings do not yield effective multimodal controllers. Thus, this paper introduces novel multimodal extensions to HyperNEAT, a popular indirect encoding. A previous multimodal HyperNEAT approach called situational policy geometry assumes that multiple brains benefit from being embedded within an explicit geometric space. However, experiments here illustrate that this assumption unnecessarily constrains evolution, resulting in lower performance. Specifically, this paper introduces HyperNEAT extensions for evolving many brains without assuming geometric relationships between them. The resulting MultiBrain HyperNEAT can exploit human-specified task divisions to decide when each brain controls the agent, or can automatically discover when brains should be used, by means of preference neurons. A further extension called module mutation allows evolution to discover the number of brains, enabling multimodal behavior with even less expert knowledge. Experiments in several multimodal domains highlight that multi-brain approaches are more effective than HyperNEAT without multimodal extensions, and show that brains without a geometric relation to each other outperform situational policy geometry. The conclusion is that Multi-Brain HyperNEAT provides several promising techniques for evolving complex multimodal behavior.

negative: Securing distributed storage: challenges, techniques, and systems The rapid increase of sensitive data and the growing number of government regulations that require longterm data retention and protection have forced enterprises to pay serious attention to storage security. In this paper, we discuss important security issues related to storage and present a comprehensive survey of the security services provided by the existing storage systems. We cover a broad range of the storage security literature, present a critical review of the existing solutions, compare them, and highlight potential research issues.

negative: The YouTube Lens: Crowdsourced Personality Impressions and Audiovisual Analysis of Vlogs Despite an increasing interest in understanding human perception in social media through the automatic analysis of users' personality, existing attempts have explored user profiles and text blog data only. We approach the study of personality impressions in social media from the novel perspective of crowdsourced impressions, social attention, and audiovisual behavioral analysis on slices of conversational vlogs extracted from YouTube. Conversational vlogs are a unique case study to understand users in social media, as vloggers implicitly or explicitly share information about themselves that words, either written or spoken cannot convey. In addition, research in vlogs may become a fertile ground for the study of video interactions, as conversational video expands to innovative applications. In this work, we first investigate the feasibility of crowdsourcing personality impressions from vlogging as a way to obtain judgements from a variate audience that consumes social media video. Then, we explore how these personality impressions mediate the online video watching experience and relate to measures of attention in YouTube. Finally, we investigate on the use of automatic nonverbal cues as a suitable lens through which impressions are made, and we address the task of automatic prediction of vloggers' personality impressions using nonverbal cues and machine learning techniques. Our study, conducted on a dataset of 442 YouTube vlogs and 2210 annotations collected in Amazon's Mechanical Turk, provides new findings regarding the suitability of collecting personality impressions from crowdsourcing, the types of personality impressions that emerge through vlogging, their association with social attention, and the level of utilization of nonverbal cues in this particular setting. In addition, it constitutes a first attempt to address the task of automatic vlogger personality impression prediction using nonverbal cues, with promising results.

negative: Analysis of Ethernet AVB for automotive networks using Network Calculus Future functions of vehicles to make driving safer, more comfortable and more exciting rely on suitable in-vehicle networks. Legacy Ethernet extended by AVB to meet recent and future requirements is discussed as a proper candidate. Investigation of its forwarding, synchronization and resource reservation mechanisms are an important prerequisite for the object: The progressive vehicle integration unleashing its whole potential as an in-vehicle network. This paper focuses on AVB's forwarding policy by using Network Calculus as a theory for calculating worst case delays.

negative: Low-Quality Product Review Detection in Opinion Summarization Product reviews posted at online shopping sites vary greatly in quality. This paper addresses the problem of detecting lowquality product reviews. Three types of biases in the existing evaluation standard of product reviews are discovered. To assess the quality of product reviews, a set of specifications for judging the quality of reviews is first defined. A classificationbased approach is proposed to detect the low-quality reviews. We apply the proposed approach to enhance opinion summarization in a two-stage framework. Experimental results show that the proposed approach effectively (1) discriminates lowquality reviews from high-quality ones and (2) enhances the task of opinion summarization by detecting and filtering lowquality reviews.

negative: Normative data stratified by age and education for two measures of verbal fluency: FAS and animal naming. Normative data stratified by three levels of age (16-59, 60-79, and 80-95 years) and three levels of education (0-8, 9-12, and 13-21 years) are presented for phonemic verbal fluency (FAS) and categorical verbal fluency (Animal Naming). The normative sample, aged 16 to 95 years, consisted of 1,300 cognitively intact individuals who resided in the community. Years of education ranged from 0 to 21. The total number of words in 1 minute for each of the letters F, A, and S was correlated r =.52 with the number of animal names generated in 1 minute. Regression analyses showed that FAS was more sensitive to the effects of education (18.6% of the variance) than age (11.0% of the variance). The opposite relationship occurred for Animal Naming, where age accounted for 23.4% of the variance and education accounted only for 13.6%. Gender accounted for less than 1% of variance for FAS and Animal Naming. The clinical utility of these norms is discussed.

negative: Application of the Laminar Navier-Stokes Equations for Solving 2D and 3D Pathfinding Problems with Static and Dynamic Spatial Constraints: Implementation and Validation in Comsol Multiphysics Pathfinding problems consist in determining the optimal shortest path, or at least one path, between two points in the space. In this paper, we propose a particular approach, based on methods used in Computational Fluid Dynamics, that intends to solve such problems. In particular, we reformulate pathfinding problems as the motion of a viscous fluid via the use of the laminar Navier-Stokes equations completed with suitable boundary conditions corresponding to some characteristics of the considered problem: position of the initial and final points, a-priori information of the terrain, One-way routes and dynamic spatial configuration. The advantages of this technique, regarding existing ones (e.g., A* algorithm) is that it does not require a pre-processing method (e.g., graph conversion) of the environment and can manage complex geometries. Then, we propose a particular numerical implementation of this methodology by using Comsol Multiphysics (i.e., a modeling software based on Finite Element Methods). Finally, we validate our approach by considering several 2D and 3D benchmark cases. Results are compared with the ones returned by a simple A* algorithm. From those numerical tests, we deduce that our algorithms generate suitable routes (but not the shortest ones) for the studied problems in a computational time similar to the considered A*.

negative: One-shot learning for fine-grained relation extraction via convolutional siamese neural network Extracting fine-grained relations between entities of interest is of great importance to information extraction and large-scale knowledge graph construction. Conventional approaches on relation extraction require an existing knowledge graph to start with or sufficient observed samples from each relation type in the training process. However, such resources are not always available, and fine-grained manual labeling is extremely time-consuming and requires extensive expertise for specific domains such as healthcare and bioinformatics. Additionally, the distribution of fine-grained relations is often highly imbalanced in practice. We tackle this label scarcity and distribution imbalance issue from a one-shot classification perspective via a convolutional siamese neural network which extracts discriminative semantic-aware features to verify the relations between a pair of input samples. The proposed siamese network effectively extracts uncommon relations with only limited observed samples on the tasks of 1-shot and few-shot classification, demonstrating significant benefits to domain-specific information extraction in practical applications.

negative: Fault classification and fault signature production for rolling element bearings in electric machines Most condition monitoring techniques for rolling element bearings are designed to detect the four characteristic fault frequencies. This has lead to the common practice of categorizing bearing faults according to fault location (i.e., inner race, outer race, ball, or cage fault). While the ability to detect the four characteristic fault frequencies is necessary, this approach neglects another important class of faults that arise in many industrial settings. This research introduces the notion of categorizing bearing faults as either single-point defects or generalized roughness. These classes separate bearing faults according to the fault signatures that are produced rather than by the physical location of the fault. Specifically, single-point defects produce the four predictable characteristic fault frequencies while faults categorized as generalized roughness produce unpredictable broadband changes in the machine vibration and stator current. Experimental results are provided from bearings failed in situ via a shaft current. These results illustrate the unpredictable and broadband nature of the effects produced by generalized roughness bearing faults. This issue is significant because a successful bearing condition monitoring scheme must be able to reliably detect both classes of faults.

negative: DCA for bot detection Ensuring the security of computers is a non-trivial task, with many techniques used by malicious users to compromise these systems. In recent years a new threat has emerged in the form of networks of hijacked zombie machines used to perform complex distributed attacks such as denial of service and to obtain sensitive data such as password information. These zombie machines are said to be infected with a dasiahotpsila - a malicious piece of software which is installed on a host machine and is controlled by a remote attacker, termed the dasiabotmaster of a botnetpsila. In this work, we use the biologically inspired dendritic cell algorithm (DCA) to detect the existence of a single hot on a compromised host machine. The DCA is an immune-inspired algorithm based on an abstract model of the behaviour of the dendritic cells of the human body. The basis of anomaly detection performed by the DCA is facilitated using the correlation of behavioural attributes such as keylogging and packet flooding behaviour. The results of the application of the DCA to the detection of a single hot show that the algorithm is a successful technique for the detection of such malicious software without responding to normally running programs.

negative: Neural systems behind word and concept retrieval Using both the lesion method and functional imaging (positron emission tomography) in large cohorts of subjects investigated with the same experimental tasks, we tested the following hypotheses: (A) that the retrieval of words which denote concrete entities belonging to distinct conceptual categories depends upon partially segregated regions in higher-order cortices of the left temporal lobe; and (B) that the retrieval of conceptual knowledge pertaining to the same concrete entities also depends on partially segregated regions; however, those regions will be different from those postulated in hypothesis A, and located predominantly in the right hemisphere (the second hypothesis tested only with the lesion method). The analyses provide support for hypothesis A in that several regions outside the classical Broca and Wernicke language areas are involved in name retrieval of concrete entities, and that there is a partial segregation in the temporal lobe with respect to the conceptual category to which the entities belong, and partial support for hypothesis B in that retrieval of conceptual knowledge is partially segregated from name retrieval in the lesion study. Those regions identified here are seen as parts of flexible, multi-component systems serving concept and word retrieval for concrete entities belonging to different conceptual categories. By comparing different approaches the article also addresses a number of method issues that have surfaced in recent studies in this field.

negative: CortexNet: a Generic Network Family for Robust Visual Temporal Representations In the past five years we have observed the rise of incredibly well performing feed-forward neural networks trained supervisedly for vision related tasks. These models have achieved super-human performance on object recognition, localisation, and detection in still images. However, there is a need to identify the best strategy to employ these networks with temporal visual inputs and obtain a robust and stable representation of video data. Inspired by the human visual system, we propose a deep neural network family, CortexNet, which features not only bottom-up feedforward connections, but also it models the abundant top-down feedback and lateral connections, which are present in our visual cortex. We introduce two training schemes — the unsupervised MatchNet and weakly supervised TempoNet modes — where a network learns how to correctly anticipate a subsequent frame in a video clip or the identity of its predominant subject, by learning egomotion clues and how to automatically track several objects in the current scene. Find the project website at tinyurl.com/CortexNet.

negative: Proving the TLS Handshake Secure (As It Is) The TLS Internet Standard features a mixed bag of cryptographic algorithms and constructions, letting clients and servers negotiate their use for each run of the handshake. Although many ciphersuites are now well-understood in isolation, their composition remains problematic, and yet it is critical to obtain practical security guarantees for TLS. We experimentally confirm that all mainstream implementations of TLS share key materials between different algorithms, some of them of dubious strength. We outline attacks in their handling of resumption and renegotiation, stressing the need to model multiple related instances of the handshake. We study the provable security of the TLS handshake, as it is implemented and deployed. To capture the details of the standard and its main extensions, we rely on miTLS, a verified reference implementation of the protocol. miTLS inter-operates with mainstream browsers and servers for many protocol versions, configurations, and ciphersuites; and it provides application-level, provable security for some. We propose new agile security definitions and assumptions for the signatures, key encapsulation mechanisms (KEM), and key derivation algorithms used by the TLS handshake. By necessity, our definitions are stronger than those expected with simple modern protocols. To validate our model of key encapsulation, we prove that both RSA and Diffie-Hellman ciphersuites satisfy our definition for the KEM. In particular, we formalize the use of PKCS#1v1.5 encryption in TLS, including recommended countermeasures against Bleichenbacher attacks, and build a 3,000-line EasyCrypt proof of the security of the resulting master secret KEM against replayable chosen-ciphertext attacks under the assumption that ciphertexts are hard to re-randomize. Based on our new agile definitions, we construct a modular proof of security for the miTLS reference implementation of the handshake, including ciphersuite negotiation, key exchange, renegotiation, and resumption, treated as a detailed 3,600-line executable model. We present our main definitions, constructions, and proofs for an abstract model of the protocol, featuring series of related runs of the handshake with different ciphersuites. We also describe its refinement to account for the whole reference implementation, based on automated verification tools.

negative: P-MOD: Secure Privilege-Based Multilevel Organizational Data-Sharing in Cloud Computing Cloud computing has changed the way enterprises store, access and share data. Data is constantly being uploaded to the cloud and shared within an organization built on a hierarchy of many different individuals that are given certain data access privileges. With more data storage needs turning over to the cloud, finding a secure and efficient data access structure has become a major research issue. With different access privileges, individuals with more privileges (at higher levels of the hierarchy) are granted access to more sensitive data than those with fewer privileges (at lower levels of the hierarchy). In this paper, a Privilege-based Multilevel Organizational Data-sharing scheme (P-MOD) is proposed that incorporates a privilege-based access structure into an attribute-based encryption mechanism to handle these concerns. Each level of the privilege-based access structure is affiliated with an access policy that is uniquely defined by specific attributes. Data is then encrypted under each access policy at every level to grant access to specific data users based on their data access privileges. An individual ranked at a certain level can decrypt the ciphertext (at that specific level) if and only if that individual owns a correct set of attributes that can satisfy the access policy of that level. The user may also decrypt the ciphertexts at the lower levels with respect to the user’s level. Security analysis shows that P-MOD is secure against adaptively chosen plaintext attack assuming the DBDH assumption holds. The comprehensive performance analysis demonstrates that PMOD is more efficient in computational complexity and storage space than the existing schemes in secure data sharing within an organization.

negative: Secure Fine-Grained Access Control and Data Sharing for Dynamic Groups in the Cloud Cloud computing is an emerging computing paradigm that enables users to store their data in a cloud server to enjoy scalable and on-demand services. Nevertheless, it also brings many security issues, since cloud service providers (CSPs) are not in the same trusted domain as users. To protect data privacy against untrusted CSPs, existing solutions apply cryptographic methods (e.g., encryption mechanisms) and provide decryption keys only to authorized users. However, sharing cloud data among authorized users at a fine-grained level is still a challenging issue, especially when dealing with dynamic user groups. In this paper, we propose a secure and efficient fine-grained access control and data sharing scheme for dynamic user groups by: 1) defining and enforcing access policies based on the attributes of the data; 2) permitting the key generation center to efficiently update user credentials for dynamic user groups; and 3) allowing some expensive computation tasks to be performed by untrusted CSPs without requiring any delegation key. Specifically, we first design an efficient revocable attribute-based encryption (ABE) scheme with the property of ciphertext delegation by exploiting and uniquely combining techniques of identity-based encryption, ABE, subset-cover framework, and ciphertext encoding mechanism. We then present a fine-grained access control and data sharing system for on-demand services with dynamic user groups in the cloud. The experimental data show that our proposed scheme is more efficient and scalable than the state-of-the-art solution.

negative: On the Impossibility of Basing Identity Based Encryption on Trapdoor Permutations We ask whether an identity based encryption (IBE) system can be built from simpler public-key primitives. We show that there is no black-box construction of IBE from trapdoor permutations (TDP) or even from chosen ciphertext secure public key encryption (CCA-PKE). These black-box separation results are based on an essential property of IBE, namely that an IBE system is able to compress exponentially many public-keys into a short public parameters string.

negative: Searchable Encryption over Feature-Rich Data Storage services allow data owners to store their huge amount of potentially sensitive data, such as audios, images, and videos, on remote cloud servers in encrypted form. To enable retrieval of encrypted files of interest, searchable symmetric encryption (SSE) schemes have been proposed. However, many schemes construct indexes based on keyword-file pairs and focus on boolean expressions of exact keyword matches. Moreover, most dynamic SSE schemes cannot achieve forward privacy and reveal unnecessary information when updating the encrypted databases. We tackle the challenge of supporting large-scale similarity search over encrypted feature-rich multimedia data, by considering the search criteria as a high-dimensional feature vector instead of a keyword. Our solutions are built on carefully-designed fuzzy Bloom filters which utilize locality sensitive hashing (LSH) to encode an index associating the file identifiers and feature vectors. Our schemes are proven to be secure against adaptively chosen query attack and forward private in the standard model. We have evaluated the performance of our scheme on real-world high-dimensional datasets, and achieved a search quality of 99 percent recall with only a few number of hash tables for LSH. This shows that our index is compact and searching is not only efficient but also accurate.

negative: Cloaking Malware with the Trusted Platform Module The Trusted Platform Module (TPM) is commonly thought of as hardware that can increase platform security. However, it can also be used for malicious purposes. The TPM, along with other hardware, can implement acloaked computation , whose memory state cannot be observed by any other software, including the operating system and hypervisor. We show that malware can use cloaked computations to hide essential secrets (like the target of an attack) from a malware analyst. We describe and implement a protocol that establishes an encryption key under control of the TPM that can only be used by a specific infection program. An infected host then proves the legitimacy of this key to a remote malware distribution platform, and receives and executes an encrypted payload in a way that prevents software visibility of the decrypted payload. We detail how malware can benefit from cloaked computations and discuss defenses against our protocol. Hardening legitimate uses of the TPM against attack improves the resilience of our malware, creating a Catch-22 for secure computing technology.

negative:
Updatable Block-Level Message-Locked Encryption Deduplication is a widely used technique for reducing storage space of cloud service providers. Yet, it is unclear how to support deduplication of encrypted data securely until the study of Bellareetal on message-locked encryption (Eurocrypt 2013). Since then, there are many improvements such as strengthening its security, reducing client storage, etc. While updating a (shared) file is common, there is little attention on how to efficiently update large encrypted files in a remote storage with deduplication. To modify even a single bit, existing solutions require the trivial and expensive way of downloading and decrypting the large ciphertext.
 We initiate the study of updatable block-level message-locked encryption. We propose a provably secure construction that is efficiently updatable with O(log|F|) computational cost, where |F| is the file size. It also supports proof-of-ownership, a nice feature which protects storage providers from being abused as a free content distribution network.