Query: DeepMem: Learning Graph Neural Network Models for Fast and Robust Memory Forensic Analysis

Relevant passages:
Discriminative Embeddings of Latent Variable Models for Structured Data <=SEP=> Kernel classifiers and regressors designed for structured data, such as sequences, trees and graphs, have significantly advanced a number of interdisciplinary areas such as computational biology and drug design. Typically, kernels are designed beforehand for a data type which either exploit statistics of the structures or make use of probabilistic generative models, and then a discriminative classifier is learned based on the kernels via convex optimization. However, such an elegant two-stage approach also limited kernel methods from scaling up to millions of data points, and exploiting discriminative information to learn feature representations. We propose, structure2vec, an effective and scalable approach for structured data representation based on the idea of embedding latent variable models into feature spaces, and learning such feature spaces using discriminative information. Interestingly, structure2vec extracts features by performing a sequence of function mappings in a way similar to graphical model inference procedures, such as mean field and belief propagation. In applications involving millions of data points, we showed that structure2vec runs 2 times faster, produces models which are 10, 000 times smaller, while at the same time achieving the state-of-the-art predictive performance.

Searching for processes and threads in Microsoft Windows memory dumps <=SEP=> Current tools to analyze memory dumps of systems running Microsoft Windows usually build on the concept of enumerating lists maintained by the kernel to keep track of processes, threads and other objects. Therefore they will frequently fail to detect objects that are already terminated or which have been hidden by Direct Kernel Object Manipulation

GUITAR: Piecing Together Android App GUIs from Memory Images <=SEP=> An Android app's graphical user interface (GUI) displays rich semantic and contextual information about the smartphone's owner and app's execution. Such information provides vital clues to the investigation of crimes in both cyber and physical spaces. In real-world digital forensics however, once an electronic device becomes evidence most manual interactions with it are prohibited by criminal investigation protocols. Hence investigators must resort to "image-and-analyze" memory forensics (instead of browsing through the subject phone) to recover the apps' GUIs. Unfortunately, GUI reconstruction is still largely impossible with state-of-the-art memory forensics techniques, which tend to focus only on individual in-memory data structures. An Android GUI, however, displays diverse visual elements each built from numerous data structure instances. Furthermore, whenever an app is sent to the background, its GUI structure will be explicitly deallocated and disintegrated by the Android framework. In this paper, we present GUITAR, an app-independent technique which automatically reassembles and redraws all apps' GUIs from the multitude of GUI data elements found in a smartphone's memory image. To do so, GUITAR involves the reconstruction of (1) GUI tree topology, (2) drawing operation mapping, and (3) runtime environment for redrawing. Our evaluation shows that GUITAR is highly accurate (80-95% similar to original screenshots) at reconstructing GUIs from memory images taken from a variety of Android apps on popular phones. Moreover, GUITAR is robust in reconstructing meaningful GUIs even when facing GUI data loss.

Evaluation: from Precision, Recall and F-measure to ROC, Informedness, Markedness and Correlation <=SEP=> Commonly used evaluation measures including Recall, Precision, F-Measure and Rand Accuracy are biased and should not be used without clear understanding of the biases, and corresponding identification of chance or base case levels of the statistic. Using these measures a system that performs worse in the objective sense of Informedness, can appear to perform better under any of these commonly used measures. We discuss several concepts and measures that reflect the probability that prediction is informed versus chance. Informedness and introduce Markedness as a dual measure for the probability that prediction is marked versus chance. Finally we demonstrate elegant connections between the concepts of Informedness, Markedness, Correlation and Significance as well as their intuitive relationships with Recall and Precision, and outline the extension from the dichotomous case to the general multi-class case.

The Spectrum Kernel: A String Kernel for SVM Protein Classification <=SEP=> We introduce a new sequence-similarity kernel, the spectrum kernel, for use with support vector machines (SVMs) in a discriminative approach to the protein classification problem. Our kernel is conceptually simple and efficient to compute and, in experiments on the SCOP database, performs well in comparison with state-of-the-art methods for homology detection. Moreover, our method produces an SVM classifier that allows linear time classification of test sequences. Our experiments provide evidence that string-based kernels, in conjunction with SVMs, could offer a viable and computationally efficient alternative to other methods of protein classification and homology detection.

Have biopesticides come of age? <=SEP=> Biopesticides based on living microbes and their bioactive compounds have been researched and promoted as replacements for synthetic pesticides for many years. However, lack of efficacy, inconsistent field performance and high cost have generally relegated them to niche products. Recently, technological advances and major changes in the external environment have positively altered the outlook for biopesticides. Significant increases in market penetration have been made, but biopesticides still only make up a small percentage of pest control products. Progress in the areas of activity spectra, delivery options, persistence of effect and implementation have contributed to the increasing use of biopesticides, but technologies that are truly transformational and result in significant uptake are still lacking.

Association of polymorphisms in the cytochrome P450 CYP2C9 with warfarin dose requirement and risk of bleeding complications <=SEP=> BACKGROUND
The cytochrome P450 CYP2C9 is responsible for the metabolism of S-warfarin. Two known allelic variants CYP2C9*2 and CYP2C9*3 differ from the wild type CYP2C9*1 by a single aminoacid substitution in each case. The allelic variants are associated with impaired hydroxylation of S-warfarin in in-vitro expression systems. We have studied the effect of CYP2C9 polymorphism on the in-vivo warfarin dose requirement.


METHODS
Patients with a daily warfarin dose requirement of 1.5 mg or less (low-dose group, n=36), randomly selected patients with a wide range of dose requirements from an anticoagulant clinic in north-east England (clinic control group, n=52), and 100 healthy controls from the community in the same region were studied. Genotyping for the CYP2C9*2 and CYP2C9*3 alleles was done by PCR analysis. Case notes were reviewed to assess the difficulties encountered during the induction of warfarin therapy and bleeding complications in the low-dose and clinic control groups.


FINDINGS
The odds ratio for individuals with a low warfarin dose requirement having one or more CYP2C9 variant alleles compared with the normal population was 6.21 (95% CI 2.48-15.6). Patients in the low-dose group were more likely to have difficulties at the time of induction of warfarin therapy (5.97 [2.26-15.82]) and have increased risk of major bleeding complications (rate ratio 3.68 [1.43-9.50]) when compared with randomly selected clinic controls.


INTERPRETATION
We have shown that there is a strong association between CYP2C9 variant alleles and low warfarin dose requirement. CYP2C9 genotyping may identify a subgroup of patients who have difficulty at induction of warfarin therapy and are potentially at a higher risk of bleeding complications.

Ant System <=SEP=> Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial optimization problems. Yet, its performance, when compared to more fine-tuned algorithms, was rather poor for large instances of traditional benchmark problems like the Traveling Salesman Problem. To show that Ant Colony Optimization algorithms could be good alternatives to existing algorithms for hard combinatorial optimization problems, recent research in this ares has mainly focused on the development of algorithmic variants which achieve better performance than AS. In this article, we present – Ant System, an Ant Colony Optimization algorithm derived from Ant System. – Ant System differs from Ant System in several important aspects, whose usefulness we demonstrate by means of an experimental study. Additionally, we relate one of the characteristics specific to AS — that of using a greedier search than Ant System — to results from the search space analysis of the combinatorial optimization problems attacked in this paper. Our computational results on the Traveling Salesman Problem and the Quadratic Assignment Problem show that – Ant System is currently among the best performing algorithms for these problems.

Don't Interrupt Me While I Type: Inferring Text Entered Through Gesture Typing on Android Keyboards <=SEP=> We present a new side-channel attack against soft keyboards that support gesture typing on Android smartphones. An application without any special permissions can observe the number and timing of the screen hardware interrupts and system-wide software interrupts generated during user input, and analyze this information to make inferences about the text being entered by the user. System-wide information is usually considered less sensitive than app-specific information, but we provide concrete evidence that this may be mistaken. Our attack applies to all Android versions, including Android M where the SELinux policy is tightened. We present a novel application of a recurrent neural network as our classifier to infer text. We evaluate our attack against the “Google Keyboard” on Nexus 5 phones and use a real-world chat corpus in all our experiments. Our evaluation considers two scenarios. First, we demonstrate that we can correctly detect a set of pre-defined “sentences of interest” (with at least 6 words) with 70% recall and 60% precision. Second, we identify the authors of a set of anonymous messages posted on a messaging board. We find that even if the messages contain the same number of words, we correctly re-identify the author more than 97% of the time for a set of up to 35 sentences. Our study demonstrates a new way in which systemwide resources can be a threat to user privacy. We investigate the effect of rate limiting as a countermeasure but find that determining a proper rate is error-prone and fails in subtle cases. We conclude that real-time interrupt information should be made inaccessible, perhaps via a tighter SELinux policy in the next Android version.

Testing the significance of a correlation with nonnormal data: comparison of Pearson, Spearman, transformation, and resampling approaches. <=SEP=> It is well known that when data are nonnormally distributed, a test of the significance of Pearson's r may inflate Type I error rates and reduce power. Statistics textbooks and the simulation literature provide several alternatives to Pearson's correlation. However, the relative performance of these alternatives has been unclear. Two simulation studies were conducted to compare 12 methods, including Pearson, Spearman's rank-order, transformation, and resampling approaches. With most sample sizes (n ≥ 20), Type I and Type II error rates were minimized by transforming the data to a normal shape prior to assessing the Pearson correlation. Among transformation approaches, a general purpose rank-based inverse normal transformation (i.e., transformation to rankit scores) was most beneficial. However, when samples were both small (n ≤ 10) and extremely nonnormal, the permutation test often outperformed other alternatives, including various bootstrap tests.

An Autonomous Multi-UAV System for Search and Rescue <=SEP=> This paper proposes and evaluates a modular architecture of an autonomous unmanned aerial vehicle (UAV) system for search and rescue missions. Multiple multicopters are coordinated using a distributed control system. The system is implemented in the Robot Operating System (ROS) and is capable of providing a real-time video stream from a UAV to one or more base stations using a wireless communications infrastructure. The system supports a heterogeneous set of UAVs and camera sensors. If necessary, an operator can interfere and reduce the autonomy. The system has been tested in an outdoor mission serving as a proof of concept. Some insights from these tests are described in the paper.

Examining the benefits and challenges of using audience response systems: A review of the literature <=SEP=> 0360-1315/$ see front matter Crown Copyright 2 doi:10.1016/j.compedu.2009.05.001 * Corresponding author. Tel.: +1 905 721 8668x267 E-mail address: robin.kay@uoit.ca (R.H. Kay). 1 Tel.: +1 905 721 8668x2886. Audience response systems (ARSs) permit students to answer electronically displayed multiple choice questions using a remote control device. All responses are instantly presented, in chart form, then reviewed and discussed by the instructor and the class. A brief history of ARSs is offered including a discussion of the 26 labels used to identify this technology. Next a detailed review of 67 peer-reviewed papers from 2000 to 2007 is offered presenting the benefits and challenges associated with the use of an ARS. Key benefits for using ARSs include improvements to the classroom environment (increases in attendance, attention levels, participation and engagement), learning (interaction, discussion, contingent teaching, quality of learning, learning performance), and assessment (feedback, formative, normative). The biggest challenges for teachers in using ARSs are time needed to learn and set up the ARS technology, creating effective ARS questions, adequate coverage of course material, and ability to respond to instantaneous student feedback. Student challenges include adjusting to a new method of learning, increased confusion when multiple perspectives are discussed, and negative reactions to being monitored. It is concluded that more systematic, detailed research is needed in a broader range of contexts. Crown Copyright 2009 Published by Elsevier Ltd. All rights reserved.

Updating freeze: Aligning animal and human research <=SEP=> Freezing is widely used as the main outcome measure for fear in animal studies. Freezing is also getting attention more frequently in human stress research, as it is considered to play an important role in the development of psychopathology. Human models on defense behavior are largely based on animal models. Unfortunately, direct translations between animal and human studies are hampered by differences in definitions and methods. The present review therefore aims to clarify the conceptualization of freezing. Neurophysiological and neuroanatomical correlates are discussed and a translational model is proposed. We review the upcoming research on freezing in humans that aims to match animal studies by using physiological indicators of freezing (bradycardia and objective reduction in movement). Finally, we set the agenda for future research in order to optimize mutual animal-human translations and stimulate consistency and systematization in future empirical research on the freezing phenomenon.

Child abuse, neglect, and adult behavior: research design and findings on criminality, violence, and child abuse. <=SEP=> Using a prospective cohorts design, a large sample of physical and sexual abuse cases was compared to a matched control group. Overall, abused and neglected subjects had higher rates than did controls for adult criminality and arrests for violent offenses, but not for adult arrests for child abuse or neglect. Findings are discussed in the context of intergenerational transmission of violence, and directions for future research are suggested.

An approach for selecting seed URLs of focused crawler based on user-interest ontology <=SEP=> Seed URLs selection for focused Web crawler intends to guide related and valuable information that meets a user’s personal information requirement and provide more effective information retrieval. In this paper, we propose a seed URLs selection approach based on user-interest ontology. In order to enrich semantic query, we first intend to apply Formal Concept Analysis to construct user-interest concept lattice with user log profile. By using concept lattice merger, we construct the user-interest ontology which can describe the implicit concepts and relationships between them more appropriately for semantic representation eed URLs ormal concept analysis ser-interest ontology ipartite graph eb crawler and query match. On the other hand, we make full use of the user-interest ontology for extracting the user interest topic area and expanding user queries to receive the most related pages as seed URLs, which is an entrance of the focused crawler. In particular, we focus on how to refine the user topic area using the bipartite directed graph. The experiment proves that the user-interest ontology can be achieved effectively by merging concept lattices and that our proposed approach can select high quality seed URLs collection and improve the average precision of focused Web crawler.

Compact arrays fed by substrate integrated waveguides <=SEP=> In this paper, we compare three different concepts of compact antenna arrays fed by substrate integrated waveguides (SIW). Antenna concepts differ in the type of radiators. Slots represent magnetic linear radiators, patches are electric surface radiators, and Vivaldi slots belong to travelling-wave antennas. Hence, the SIW feeders have to exploit different mechanisms of exciting antenna elements. Impedance and radiation properties of studied antenna arrays have been related to the normalized frequency. Antenna arrays have been mutually compared to show fundamental dependencies of final parameters of the designed antennas on state variables of antennas, on SIW feeder architectures and on related implementation details.

SmartPort: A Platform for Sensor Data Monitoring in a Seaport Based on FIWARE <=SEP=> Seaport monitoring and management is a significant research area, in which infrastructure automatically collects big data sets that lead the organization in its multiple activities. Thus, this problem is heavily related to the fields of data acquisition, transfer, storage, big data analysis and information visualization. Las Palmas de Gran Canaria port is a good example of how a seaport generates big data volumes through a network of sensors. They are placed on meteorological stations and maritime buoys, registering environmental parameters. Likewise, the Automatic Identification System (AIS) registers several dynamic parameters about the tracked vessels. However, such an amount of data is useless without a system that enables a meaningful visualization and helps make decisions. In this work, we present SmartPort, a platform that offers a distributed architecture for the collection of the port sensors' data and a rich Internet application that allows the user to explore the geolocated data. The presented SmartPort tool is a representative, promising and inspiring approach to manage and develop a smart system. It covers a demanding need for big data analysis and visualization utilities for managing complex infrastructures, such as a seaport.

Modeling textual entailment with role semantic information <=SEP=> In this thesis, we present a novel approach for modeling textual entailment using lexicalsemantic information on the level of predicate-argument structure. To this end, we adopt information provided by the Berkeley FrameNet repository and embed it into an implemented end-to-end system. The two main goals of this thesis are the following: (i) to provide an analysis of the potential contribution of frame semantic information to the recognition textual entailment and (ii) to present a robust system architecture that can serve as basis for future experiments, research, and improvement. Our work was carried out in the context of the textual entailment initiative, which since 2005 has set the stage for the broad investigation of inference in natural-language processing tasks, including empirical evaluation of its coverage and reliability. In short, textual entailment describes inferential relations between (entailing) texts and (entailed) hypotheses as interpreted by typical language users. This pre-theoretic notion captures a natural range of inferences as compared to logical entailment, which has traditionally been used within theoretical approaches to natural language semantics. Various methods for modeling textual entailment have been proposed in the literature, ranging from shallow techniques like lexical overlap to shallow syntactic parsing and the exploitation of WordNet relations. Recently, there has been a move towards more structured meaning representations. In particular, the level of predicate-argument structure has gained much attention, which seems to be a natural and straightforward choice. Predicate-argument structure allows annotating sentences or texts with nuclear meaning representations (“who did what to whom”), which are of obvious relevance for this task. For example, it can account for paraphrases like “Ghosts scare John” vs. “John is scared by ghosts”. In this thesis, we present an approach to textual entailment that is centered around the analysis of predicate-argument structure. It combines LFG grammatical analysis, predicate-argument structure in the FrameNet paradigm, and taxonomic information from WordNet into tripartite graph structures. By way of a declarative graph matching algorithm, the “structural and semantic” similarity of hypotheses and texts is computed and the result is represented as feature vectors. A supervised machine learning architecture trained on entailment corpora is used to check textual entailment for new text/hypothesis pairs. The approach is implemented in the SALSA RTE system, which successfully participated in the second and third RTE challenge. While system performance is on a par with that of comparable systems, the intuitively expected strong positive effect of using FrameNet information has not yet been confirmed. In order to evaluate different system components and to assess the potential contribution of FrameNet information for checking textual entailment, we conducted a number of experiments. For example, with the help of a gold-standard corpus, we

An algorithm for treatment of the drooping nose. <=SEP=> UNLABELLED
Nasal tip ptosis ("drooping" or long nose) occurs when the tip of the nose is more caudal than what is deemed ideal. Intrinsic factors, such as elongated or caudally-rotated lower lateral cartilages, can lead to nasal tip ptosis. Extrinsic factors, such as elongated upper lateral cartilages or excessive caudal anterior septum and heavy nasal skin, can push the nasal tip caudally and lead to drooping of the nasal tip. The loss of maxillary or nasal spine support may enhance the potential for tip ptosis. In addition, a hyperactive depressor nasi septi could, as a result of continuous pull on the tip, result in tip ptosis. Aging or previous nasal procedures (such as the Goldman-type tip surgery) where the continuity of the lateral and medial crura of the lower lateral cartilages have been violated may cause a weakening of the tip-supporting mechanisms and de-rotation of the nasal tip. Correction of this deformity is challenging and rewarding; it can resolve both the cosmetic deformity and nasal obstruction symptoms related to this entity. The goal of this article is to present our current principles of diagnosis and treatment of nasal tip ptosis, as well as to introduce and algorithm of preferred methods and techniques for its reliable and stable correction.


RESULTS
Correction of the nasal tip ptosis requires accurate diagnosis, a recognition of the interplay between various anatomic components, specific strategy planning, and a correction of anatomic abnormalities.

Emerging
Applications of Liquid Metals Featuring Surface Oxides <=SEP=> Gallium and several of its alloys are liquid metals at or near room temperature. Gallium has low toxicity, essentially no vapor pressure, and a low viscosity. Despite these desirable properties, applications calling for liquid metal often use toxic mercury because gallium forms a thin oxide layer on its surface. The oxide interferes with electrochemical measurements, alters the physicochemical properties of the surface, and changes the fluid dynamic behavior of the metal in a way that has, until recently, been considered a nuisance. Here, we show that this solid oxide "skin" enables many new applications for liquid metals including soft electrodes and sensors, functional microcomponents for microfluidic devices, self-healing circuits, shape-reconfigurable conductors, and stretchable antennas, wires, and interconnects.

A Personalized Graph-Based Document Ranking Model Using a Semantic User Profile <=SEP=> The overload of the information available on the web, held with the diversity of the user information needs and the ambiguity of their queries have led the researchers to develop personalized search tools that return only documents that meet the user profile representing his main interests and needs. We present in this paper a personalized document ranking model based on an extended graph-based distance measure that exploits a semantic user profile derived from a predefined web ontology (ODP). The measure is based on combining Minimum Common Supergraph (MCS) and Maximum Common Subgraph (mcs) between graphs representing respectively the document and the user profile. We extend this measure in order to take into account a semantic recovery between the document and the user profile through common concepts and cross links connecting the two graphs. Results show the effectiveness of our personalized graph-based ranking model compared to Yahoo search results.

A Multilayer Convolutional Encoder-Decoder Neural Network for Grammatical Error Correction <=SEP=> We improve automatic correction of grammatical, orthographic, and collocation errors in text using a multilayer convolutional encoder-decoder neural network. The network is initialized with embeddings that make use of character Ngram information to better suit this task. When evaluated on common benchmark test data sets (CoNLL-2014 and JFLEG), our model substantially outperforms all prior neural approaches on this task as well as strong statistical machine translation-based systems with neural and task-specific features trained on the same data. Our analysis shows the superiority of convolutional neural networks over recurrent neural networks such as long short-term memory (LSTM) networks in capturing the local context via attention, and thereby improving the coverage in correcting grammatical errors. By ensembling multiple models, and incorporating an N-gram language model and edit features via rescoring, our novel method becomes the first neural approach to outperform the current state-of-the-art statistical machine translation-based approach, both in terms of grammaticality and fluency.

A self-steering I/Q receiver array in 45-nm CMOS SOI <=SEP=> A novel I/Q receiver array is demonstrated that adapts phase shifts in each receive channel to point a receive beam toward an incident RF signal. The measured array operates at 8.1 GHz and covers steering angles of +/-35 degrees for a four element array. Additionally, the receiver incorporates an I/Q down-converter and demodulates 64QAM with EVM less than 4%. The chip is fabricated in 45 nm CMOS SOI process and occupies an area of 3.45 mm2 while consuming 143 mW dc power.

A Technical Approach to the Energy Blockchain in Microgrids <=SEP=> The present paper considers some technical issues related to the “energy blockchain” paradigm applied to microgrids. In particular, what appears from the study is that the superposition of energy transactions in a microgrid creates a variation of the power losses in all the branches of the microgrid. Traditional power losses allocation in distribution systems takes into account only generators while, in this paper, a real-time attribution of power losses to each transaction involving one generator and one load node is done by defining some suitable indices. Besides, the presence of P–V nodes increases the level of reactive flows and provides a more complex technical perspective. For this reason, reactive power generation for voltage support at P–V nodes poses a further problem of reactive power flow exchange, which is worth of investigation in future works in order to define a possible way of remuneration. The experimental section of the paper considers a medium voltage microgrid and two different operational scenarios.

Aspect extraction in sentiment analysis: comparative analysis and survey <=SEP=> Sentiment analysis (SA) has become one of the most active and progressively popular areas in information retrieval and text mining due to the expansion of the World Wide Web (WWW). SA deals with the computational treatment or the classification of user’s sentiments, opinions and emotions hidden within the text. Aspect extraction is the most vital and extensively explored phase of SA to carry out the classification of sentiments in precise manners. During the last decade, enormous number of research has focused on identifying and extracting aspects. Therefore, in this survey, a comprehensive overview has been attempted for different aspect extraction techniques and approaches. These techniques have been categorized in accordance with the adopted approach. Despite being a traditional survey, a comprehensive comparative analysis is conducted among different approaches of aspect extraction, which not only elaborates the performance of any technique but also guides the reader to compare the accuracy with other state-of-the-art and most recent approaches.

An incremental deployment algorithm for mobile robot teams <=SEP=> This paper describes an algorithm for deploying the members of a mobile robot team into an unknown environment. The algorithm deploys robots one-at-a-time, with each robot making use of information gathered by the previous robots to determine the next deployment location. The deployment pattern is designed to maximize the area covered by the robots’ sensors, while simultaneously ensuring that the robots maintain line-of-sight contact with one another. This paper describes the basic algorithm and presents results obtained from a series of experiments conducted using both real and simulated

RABAC: Role-Centric Attribute-Based Access Control <=SEP=> Role-based access control (RBAC) is a commercially dominant model, standardized by the National Institute of Standards and Technology (NIST). Although RBAC provides compelling benefits for security management it has several known deficiencies such as role explosion, wherein multiple closely related roles are required (e.g., attendingdoctor role is separately defined for each patient). Numerous extensions to RBAC have been proposed to overcome these shortcomings. Recently NIST announced an initiative to unify and standardize these extensions by integrating roles with attributes, and identified three approaches: use attributes to dynamically assign users to roles, treat roles as just another attribute, and constrain the permissions of a role via attributes. The first two approaches have been previously studied. This paper presents a formal model for the third approach for the first time in the literature. We propose the novel role-centric attribute-based access control (RABAC) model which extends the NIST RBAC model with permission filtering policies. Unlike prior proposals addressing the role-explosion problem, RABAC does not fundamentally modify the role concept and integrates seamlessly with the NIST RBAC model. We also define an XACML profile for RABAC based on the existing XACML profile for RBAC.

A throwable miniature robotic system <=SEP=> Before the soldiers or police take actions, a fast and real-time detection in dangerous places, such as indoor, passageway and underpass, can both guarantee the soldiers' safety and increase the battle's accuracy, so it is significative and necessary to design a kind of scout robot which is able to arrive in the target region to acquire the message fast by the ways of thrown, shot or airdrop. This kind of robot should be small, easy to hide and have the ability of anti-impact and semi-autonomous. This paper mainly proposes a design method of the throwable miniature scout robot, analyses the anti-pact mechanism and autonomous strategy, and shows that the anti-impact mechanism is useful to attenuate the impact and the semi-autonomous control strategy can be fit for the robot's application through several experiments at last.

Evidence for a common representation of decision values for dissimilar goods in human ventromedial prefrontal cortex. <=SEP=> To make economic choices between goods, the brain needs to compute representations of their values. A great deal of research has been performed to determine the neural correlates of value representations in the human brain. However, it is still unknown whether there exists a region of the brain that commonly encodes decision values for different types of goods, or if, in contrast, the values of different types of goods are represented in distinct brain regions. We addressed this question by scanning subjects with functional magnetic resonance imaging while they made real purchasing decisions among different categories of goods (food, nonfood consumables, and monetary gambles). We found activity in a key brain region previously implicated in encoding goal-values: the ventromedial prefrontal cortex (vmPFC) was correlated with the subjects' value for each category of good. Moreover, we found a single area in vmPFC to be correlated with the subjects' valuations for all categories of goods. Our results provide evidence that the brain encodes a "common currency" that allows for a shared valuation for different categories of goods.

Sentiment Identification in Code-Mixed Social Media Text <=SEP=> Sentiment analysis is the Natural Language Processing (NLP) task dealing with the detection and classification of sentiments in texts. While some tasks deal with identifying presence of sentiment in text (Subjectivity analysis), other tasks aim at determining the polarity of the text categorizing them as positive, negative and neutral. Whenever there is presence of sentiment in text, it has a source (people, group of people or any entity) and the sentiment is directed towards some entity, object, event or person. Sentiment analysis tasks aim to determine the subject, the target and the polarity or valence of the sentiment. In our work, we try to automatically extract sentiment (positive or negative) from Facebook posts using a machine learning approach. While some works have been done in code-mixed social media data and in sentiment analysis separately, our work is the first attempt (as of now) which aims at performing sentiment analysis of code-mixed social media text. We have used extensive pre-processing to remove noise from raw text. Multilayer Perceptron model has been used to determine the polarity of the sentiment. We have also developed the corpus for this task by manually labelling Facebook posts with their associated sentiments.