query: An evolutionary tic-tac-toe player

positive: Evolving neural networks to play checkers without relying on expert knowledge An experiment was conducted where neural networks compete for survival in an evolving population based on their ability to play checkers. More specifically, multilayer feedforward neural networks were used to evaluate alternative board positions and games were played using a minimax search strategy. At each generation, the extant neural networks were paired in competitions and selection was used to eliminate those that performed poorly relative to other networks. Offspring neural networks were created from the survivors using random variation of all weights and bias terms. After a series of 250 generations, the best-evolved neural network was played against human opponents in a series of 90 games on an internet website. The neural network was able to defeat two expert-level players and played to a draw against a master. The final rating of the neural network placed it in the "Class A" category using a standard rating system. Of particular importance in the design of the experiment was the fact that no features beyond the piece differential were given to the neural networks as a priori knowledge. The process of evolution was able to extract all of the additional information required to play at this level of competency. It accomplished this based almost solely on the feedback offered in the final aggregated outcome of each game played (i.e., win, lose, or draw). This procedure stands in marked contrast to the typical artifice of explicitly injecting expert knowledge into a game-playing program.

positive: Verifying Anaconda's expert rating by competing against Chinook: experiments in co-evolving a neural checkers player Since the early days of arti5cial intelligence, there has been interest in having a computer teach itself how to play a game of skill, like checkers, at a level that is competitive with human experts. To be truly noteworthy, such e7orts should minimize the amount of human intervention in the learning process. Recently, co-evolution has been used to evolve a neural network (called Anaconda) that, when coupled with a minimax search, can evaluate checker-boards and play to the level of a human expert, as indicated by its rating of 2045 on an international web site for playing checkers. The neural network uses only the location, type, and number of pieces on the board as input. No other features that would require human expertise are included. Experiments were conducted to verify the neural network’s expert rating by competing it in 10 games against a “novice-level” version of Chinook, a world-champion checkers program. The neural network had 2 wins, 4 losses, and 4 draws in the 10-game match. Based on an estimated rating of Chinook at the novice level, the results corroborate Anaconda’s expert rating. c © 2002 Elsevier Science B.V. All rights reserved.

positive: Decentralized Decision Making in the Game of Tic-tac-toe Traditionally, the game of Tic-tac-toe is a pencil and paper game played by two people who take turn to place their pieces on a 3times3 grid with the objective of being the first player to fill a horizontal, vertical, or diagonal row with their pieces. What if instead of having one person playing against another, one person plays against a team of nine players, each of whom is responsible for one cell in the 3times3 grid? In this new way of playing the game, the team has to coordinate its players, who are acting independently based on their limited information. In this paper, we present a solution that can be extended to the case where two such teams play against each other, and also to other board games. Essentially, the solution uses a decentralized decision making, which at first seems to complicate the solution. However, surprisingly, we show that in this mode, an equivalent level of decision making ability comes from simple components that reduce system complexity

positive: A self-learning evolutionary chess program A central challenge of artificial intelligence is to create machines that can learn from their own experience and perform at the level of human experts. Using an evolutionary algorithm, a computer program has learned to play chess by playing games against itself. The program learned to evaluate chessboard configurations by using the positions of pieces, material and positional values, and neural networks to assess specific sections of the chessboard. During evolution, the program improved its play by almost 400 rating points. Testing under simulated tournament conditions against Pocket Fritz 2.0 indicated that the evolved program performs above the master level.

positive: Machine learning - an artificial intelligence approach Research in the area of learning structural descriptions from examples is reviewed, giving primary attention to methods of learning characteristic descrip tions of single concepts. In particular, we examine methods for finding the maximally-specific conjunctive generalizations (MSC-generalizations) that cover all of the training examples of a given concept. Various important aspects of structural learning in general are examined, and several criteria for evaluating structural learning methods are presented. Briefly, these criteria include (i) ade quacy of the representation language, (ii) generalization rules employed, computational efficiency, and (iv) flexibility and extensibility. Selected learning methods developed by Buchanan, et al., Hayes-Roth, Vere, Winston, and the authors are analyzed according to these criteria. Finally, some goals are sug gested for future research.

negative: Implementing the Chinese Wall Security Model in Workflow Management Systems The Chinese wall security model (CWSM) was designed to provide access controls that mitigate conflict of interest in commercial organizations, and is especially important for large-scale interenterprise workflow applications. This paper describes how to implement the CWSM in a WfMS. We first demonstrate situations in which the role-based access control model is not sufficient for this, and we then propose a security policy language to solve this problem, also providing support for the intrinsic dynamic access control mechanism defined in the CWSM (i.e., the dynamic binding of subjects and elements in the company data set). This language can also specify several requirements of the dynamic security policy that arise when applying the CWSM in WfMSs. Finally we discuss how to implement a run-time system to implement CWSM policies specified by this language in a WfMS.

negative: Filter Bank Common Spatial Pattern (FBCSP) in Brain-Computer Interface In motor imagery-based brain computer interfaces (BCI), discriminative patterns can be extracted from the electroencephalogram (EEG) using the common spatial pattern (CSP) algorithm. However, the performance of this spatial filter depends on the operational frequency band of the EEG. Thus, setting a broad frequency range, or manually selecting a subject-specific frequency range, are commonly used with the CSP algorithm. To address this problem, this paper proposes a novel filter bank common spatial pattern (FBCSP) to perform autonomous selection of key temporal-spatial discriminative EEG characteristics. After the EEG measurements have been bandpass-filtered into multiple frequency bands, CSP features are extracted from each of these bands. A feature selection algorithm is then used to automatically select discriminative pairs of frequency bands and corresponding CSP features. A classification algorithm is subsequently used to classify the CSP features. A study is conducted to assess the performance of a selection of feature selection and classification algorithms for use with the FBCSP. Extensive experimental results are presented on a publicly available dataset as well as data collected from healthy subjects and unilaterally paralyzed stroke patients. The results show that FBCSP, using a particular combination feature selection and classification algorithm, yields relatively higher cross-validation accuracies compared to prevailing approaches.

negative:
Coping with child sexual abuse among college students and post-traumatic stress disorder: the role of continuity of abuse and relationship with the perpetrator. OBJECTIVE
The purpose of this study was to examine the effects of child sexual abuse (CSA) on the use of coping strategies and post-traumatic stress disorder (PTSD) scores in young adults, as well as the role of avoidance and approach coping strategies in those PTSD scores in CSA victims. The role of coping strategies was studied by considering their possible interactive effect with the continuity of abuse and the relationship with the perpetrator; the effect of coping strategies on PTSD was also compared between CSA victim and non-CSA victim participants.

METHOD
The sample was comprised of 138 victims of CSA and another 138 participants selected as a comparison group. Data about child sexual abuse were obtained from a questionnaire developed for this purpose. Coping strategies were assessed with the How I Deal with Things Scale (Burt & Katz, 1987), while PTSD scores were assessed with the "Escala de Gravedad de Síntomas del Trastorno de Estrés Postraumático" (Severity of Symptoms of PTSD Scale; Echeburúa et al., 1997).

RESULTS
Participants who had been victims of CSA showed significantly higher PTSD scores and lower approach coping strategies scores. However, differences in avoidance coping strategies between groups were not consistent and did not always follow the expected direction. Only the use of avoidance coping strategies was related to PTSD, participants who used these showing higher scores. The effects of avoidance strategies were stronger in continued than in isolated abuse, in intrafamilial than in extrafamilial abuse and in CSA victims than in non-victims.

CONCLUSIONS
These results confirm the idea of CSA as a high-risk experience that can affect the victim's coping strategies and lead to PTSD to a lesser or greater extent depending on the coping strategy used. Moreover, the role of these strategies varies depending on whether or not the participant is a victim of CSA and on the characteristics of abuse (continuity and relationship with the perpetrator).

PRACTICE IMPLICATIONS
In terms of intervention, a reduction of avoidance-type strategies appears to have a beneficial effect, especially in the case of intrafamilial and/or continued CSA victims. The encouragement of "spontaneous" approach strategies (devised by the victim herself, without counseling) would probably not lead to more positive outcomes in terms of PTSD symptomatology. However, encouraging CSA survivors to engage in therapy aimed at developing effective approach strategies, as other studies have suggested, may help reduce PTSD symptoms.

negative: An approch for monitoring and smart planning of urban solid waste management using smart-M3 platform Solid waste management is one of the most important challenges in urban areas throughout the world and it is becoming a critical issue in developing countries where a rapid increase in population has been observed. Waste collection is a complex process that requires the use of large amount of money and an elaborate management of logistics. In this paper an approch to smart waste collection is proposed able to improve and optimize the handling of solid urban waste. Context of smart waste management requires interconnection among heterogeneous devices and data sharing involving a large amount of people. Smart-M3 platform solves these problems offering a high degree of decoupling and scalability.Waste collection is made by real-time monitoring the level of bin's fullness through sensors placed inside the containers. This method enables to exempt from collecting semi-empty bins. Furthermore, incoming data can be provided to decisional algorithms in order to determine the optimal number of waste vehicles or bins to distribute in the territory. The presented solution gives important advantages for both service providers and consumers. The formers could obtain a sensible cost reduction. On the other hand, users may benefit from a higher level of service quality. In order to make users feel closer to their community, they can interact with the system to be aware about the fulness state of the nearest bins. Finally, a mechanism for collecting “green points” was introduced for encouraging citizens to recycle.

negative: A systemic and cognitive view on collaborative knowledge building with wikis Wikis provide new opportunities for learning and for collaborative knowledge building as well as for understanding these processes. This article presents a theoretical framework for describing how learning and collaborative knowledge building take place. In order to understand these processes, three aspects need to be considered: the social processes facilitated by a wiki, the cognitive processes of the users, and how both processes influence each other mutually. For this purpose, the model presented in this article borrows from the systemic approach of Luhmann as well as from Piaget’s theory of equilibration and combines these approaches. The model analyzes processes which take place in the social system of a wiki as well as in the cognitive systems of the users. The model also describes learning activities as processes of externalization and internalization. Individual learning happens through internal processes of assimilation and accommodation, whereas changes in a wiki are due to activities of external assimilation and accommodation which in turn lead to collaborative knowledge building. This article provides empirical examples for these equilibration activities by analyzing Wikipedia articles. Equilibration activities are described as being caused by subjectively perceived incongruities between an individuals’ knowledge and the information provided by a wiki. Incongruities of medium level cause cognitive conflicts which in turn activate the described processes of equilibration and facilitate individual learning and collaborative knowledge building.

negative: Evolutionary algorithms for multiobjective optimization: methods and applications Many real-world problems involve two types of problem difficulty: i) multiple, conflicting objectives and ii) a highly complex search space. On the one hand, instead of a single optimal solution competing goals give rise to a set of compromise solutions, generally denoted as Pareto-optimal. In the absence of preference information, none of the corresponding trade-offs can be said to be better than the others. On the other hand, the search space can be too large and too complex to be solved by exact methods. Thus, efficient optimization strategies are required that are able to deal with both difficulties. Evolutionary algorithms possess several characteristics that are desirable for this kind of problem and make them preferable to classical optimization methods. In fact, various evolutionary approaches to multiobjective optimization have been proposed since 1985, capable of searching for multiple Paretooptimal solutions concurrently in a single simulation run. However, in spite of this variety, there is a lack of extensive comparative studies in the literature. Therefore, it has remained open up to now: • whether some techniques are in general superior to others, • which algorithms are suited to which kind of problem, and • what the specific advantages and drawbacks of certain methods are. The subject of this work is the comparison and the improvement of existing multiobjective evolutionary algorithms and their application to system design problems in computer engineering. In detail, the major contributions are: • An experimental methodology to compare multiobjective optimizers is developed. In particular, quantitative measures to assess the quality of trade-off fronts are introduced and a set of general test problems is defined, which are i) easy to formulate, ii) represent essential aspects of real-world problems, and iii) test for different types of problem difficulty. • On the basis of this methodology, an extensive comparison of numerous evolutionary techniques is performed in which further aspects such as the influence of elitism and the population size are also investigated. • A novel approach to multiobjective optimization, the strength Pareto evolutionary algorithm, is proposed. It combines both established and new techniques in a unique manner. • Two complex multicriteria applications are addressed using evolutionary algorithms: i) the automatic synthesis of heterogeneous hardware/systems and ii) the multidimensional exploration of software implementations for digital signal processors. Zusammenfassung Viele praktische Optimierungsprobleme sind durch zwei Eigenschaften charakterisiert: a) mehrere, teilweise im Konflikt stehende Zielfunktionen sind involviert, und b) der Suchraum ist hochgradig komplex. Einerseits f ̈ uhren widersprüchliche Optimierungskriterien dazu, dass es statt eines klar definierten Optimums eine Menge von Kompromissl ̈ o ungen, allgemein als Pareto-optimal bezeichnet, gibt. Insofern keine Gewichtung der Kriterien vorliegt, m ̈ ussen die entsprechenden Alternativen als gleichwertig betrachtet werden. Andererseits kann der Suchraum eine bestimmte Gr ̈ osse und Komplexit ̈ at überschreiten, so dass exakte Optimierungsverfahren nicht mehr anwendbar sind. Erforderlich sind demnach effiziente Suchstrategien, die beiden Aspekten gerecht werden. Evolutionäre Algorithmen sind aufgrund mehrerer Merkmale f ̈ ur diese Art von Problem besonders geeignet; vor allem im Vergleich zu klassischen Methoden weisen sie gewisse Vorteile auf. Doch obwohl seit 1985 verschiedenste evolutionäre Ansätze entwickelt wurden, die mehrere Pareto-optimale L ̈ osungen in einem einzigen Simulationslauf generieren k ̈ onnen, mangelt es in der Literatur an umfassenden Vergleichsstudien. Folglich blieb bislang ungekl ̈ art, • ob bestimmte Techniken anderen Methoden generell  ̈ ub rlegen sind, • welche Algorithmen f ̈ ur welche Art von Problem geeignet sind und • wo die spezifischen Vorund Nachteile einzelner Verfahren liegen. Die vorliegende Arbeit hat zum Gegenstand, bestehende evolution ̈ are Mehrzieloptimierungsverfahren zu vergleichen, zu verbessern und auf Entwurfsprobleme im Bereich der Technischen Informatik anzuwenden. Im Einzelnen werden folgende Themen behandelt: • Eine Methodik zum experimentellen Vergleich von Mehrzieloptimierungsverfahren wird entwickelt. Unter anderem werden quantitative Qualit ̈ atsmasse für Mengen von Kompromissl ̈ osungen eingef ̈ uhrt und mehrere Testfunktionen definiert, die a) eine einfache Problembeschreibung besitzen, b) wesentliche Merkmale realer Optimierungsprobleme repr ̈ asentieren und c) erlauben, verschiedene Einflussfaktoren separat zu  ̈ uberprüfen. • Auf der Basis dieser Methodik wird ein umfangreicher Vergleich diverser evolutionärer Techniken durchgef ̈ uhrt, wobei auch weitere Aspekte wie die Auswirkungen von Elitism und der Populationsgr ̈ osse auf den Optimierungsprozess untersucht werden. • Ein neues Verfahren, der Strength-Pareto-Evolutionary-Algorithm, wird vorgestellt. Es kombiniert auf spezielle Art und Weise bew ̈ ahrte und neue Konzepte miteinander. • Zwei komplexe Mehrzielprobleme werden auf der Basis evolution ̈ arer Methoden untersucht: a) die automatische Synthese von heterogenen Hardware/Software-Systemen und b) die mehrdimensionale Exploration von Softwareimplementierungen f ̈ ur digitale Signalverarbeitungsprozessoren. I would like to thank Prof. Dr. Lothar Thiele for the valuable discussions concerning this research, Prof. Dr. Kalyanmoy Deb for his willingness to be the co-examiner of my thesis,

negative: Wearable Glove-Type Driver Stress Detection Using a Motion Sensor Increased driver stress is generally recognized as one of the major factors leading to road accidents and loss of life. Even though physiological signals are reported as the most reliable means to measure driver stresses, they often require the use of unique and expensive sensors, which produce dynamic and varying readings within individuals. This paper presents a novel means to predict a driver’s stress level by evaluating the movement pattern of the steering wheel. This is accomplished by using an inertial motion unit sensor, which is placed on a glove worn by the driver. The motion sensor selected for this paper was chosen because for its low cost and the fact that it is least affected by environmental factors as compared with a physiological signal. Experiments were conducted in three different environmental scenarios. The scenarios were classified as “urban,” “highway,” and “rural,” and they were chosen to simulate contrasting stress conditions experienced by the driver. In this paper, skin conductance and driver self-reports served as a reference stress to predict the driver’s stress level. Galvanic skin response, a well-known stress indicator, was captured along the driver’s palm and the readings were transmitted to a mobile device via low energy Bluetooth for further processing. The results revealed that indirect measurement of steering wheel movement with an inertial motion sensor could obtain accuracies up to an average rate of 94.78%. This demonstrates the opportunity for inclusion of motion sensors in wireless driver assistance systems for ambulatory monitoring of stress levels.

negative: The Role of Mental Health Professionals in Gender Reassignment Surgeries: Unjust Discrimination or Responsible Care? Recent literature has raised an important ethical concern relating to the way in which surgeons approach people with gender dysphoria (GD): it has been suggested that referring transsexual patients to mental assessment can constitute a form of unjust discrimination. The aim of this paper is to examine some of the ethical issues concerning the role of the mental health professional in gender reassignment surgeries (GRS). The role of the mental health professional in GRS is analyzed by presenting the Standards of Care by the World Professional Association of Transgender Health, and discussing the principles of autonomy and non-discrimination. Purposes of psychotherapy are exploring gender identity; addressing the negative impact of GD on mental health; alleviating internalized transphobia; enhancing social and peer support; improving body image; promoting resilience; and assisting the surgeons with the preparation prior to the surgery and the patient’s follow-up. Offering or requesting psychological assistance is in no way a form of negative discrimination or an attack to the patient’s autonomy. Contrarily, it might improve transsexual patients’ care, and thus at the most may represent a form of positive discrimination. To treat people as equal does not mean that they should be treated in the same way, but with the same concern and respect, so that their unique needs and goals can be achieved. Offering or requesting psychological assistance to individuals with GD is a form of responsible care, and not unjust discrimination. This journal requires that authors assign a level of evidence to each article. For a full description of these Evidence-Based Medicine ratings, please refer to the Table of Contents or the online Instructions to Authors www.springer.com/00266 .

negative: Semantics and service technologies for the automatic generation of online MCQ tests Active learning requires that students receive a continuous feedback about their understanding. Multiple-Choice Questions (MCQ) tests have been frequently used to provide students the required feedback and to measure the effectiveness of this learning model. To construct a test is a challenging task, which is time consuming and requires experience. For these reasons, research efforts have been focused on the automatic generation of well-constructed tests. The semantic technologies have played a relevant role in the implementation of these testgeneration systems. Nevertheless, the existing proposals present a set of drawbacks that restrict their applicability to different learning domains and the type of test to be composed. In this paper, we propose a service-oriented and semantic-based system that solves these drawbacks. The system consists of a dynamic strategy of generating candidate distractors (alternatives to the correct answer), a set of heuristics for scoring the distractors' suitability, and a selection of distractors that considers the difficulty level of tests. Besides, the final version of tests is created using the Google Form service, a de-facto standard for elaborating online questionnaires.

negative: Solving traveling salesman problems via artificial intelligent search techniques The traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics and combinatorial optimization. It is also considered as the class of the NPcomplete combinatorial optimization problems. By literatures, many algorithms and approaches have been launched to solve such the TSP. However, no current algorithms that can provide the exactly optimal solution of the TSP problem are available. This paper proposes the application of AI search techniques to solve the TSP problems. Three AI search methods, i.e. genetic algorithms (GA), tabu search (TS), and adaptive tabu search (ATS), are conducted. They are tested against ten benchmark real-world TSP problems. As results compared with the exactly optimal solutions, the AI search techniques can provide very satisfactory solutions for all TSP problems. Key-Words: Traveling Salesman Problem, Genetic Algorithm, Tabu Search, Adaptive Tabu Search

negative:
Profanity in media associated with attitudes and behavior regarding profanity use and aggression. OBJECTIVE
We hypothesized that exposure to profanity in media would be directly related to beliefs and behavior regarding profanity and indirectly to aggressive behavior.

METHODS
We examined these associations among 223 adolescents attending a large Midwestern middle school. Participants completed a number of questionnaires examining their exposure to media, attitudes and behavior regarding profanity, and aggressive behavior.

RESULTS
Results revealed a positive association between exposure to profanity in multiple forms of media and beliefs about profanity, profanity use, and engagement in physical and relational aggression. Specifically, attitudes toward profanity use mediated the relationship between exposure to profanity in media and subsequent behavior involving profanity use and aggression.

CONCLUSIONS
The main hypothesis was confirmed, and implications for the rating industry and research field are discussed.

negative: Conjunctive representations in learning and memory: principles of cortical and hippocampal function. The authors present a theoretical framework for understanding the roles of the hippocampus and neocortex in learning and memory. This framework incorporates a theme found in many theories of hippocampal function: that the hippocampus is responsible for developing conjunctive representations binding together stimulus elements into a unitary representation that can later be recalled from partial input cues. This idea is contradicted by the fact that hippocampally lesioned rats can learn nonlinear discrimination problems that require conjunctive representations. The authors' framework accommodates this finding by establishing a principled division of labor, where the cortex is responsible for slow learning that integrates over multiple experiences to extract generalities whereas the hippocampus performs rapid learning of the arbitrary contents of individual experiences. This framework suggests that tasks involving rapid, incidental conjunctive learning are better tests of hippocampal function. The authors implement this framework in a computational neural network model and show that it can account for a wide range of data in animal learning.

negative: Estimation of Detection Thresholds for Redirected Walking Techniques In immersive virtual environments (IVEs), users can control their virtual viewpoint by moving their tracked head and walking through the real world. Usually, movements in the real world are mapped one-to-one to virtual camera motions. With redirection techniques, the virtual camera is manipulated by applying gains to user motion so that the virtual world moves differently than the real world. Thus, users can walk through large-scale IVEs while physically remaining in a reasonably small workspace. In psychophysical experiments with a two-alternative forced-choice task, we have quantified how much humans can unknowingly be redirected on physical paths that are different from the visually perceived paths. We tested 12 subjects in three different experiments: (E1) discrimination between virtual and physical rotations, (E2) discrimination between virtual and physical straightforward movements, and (E3) discrimination of path curvature. In experiment E1, subjects performed rotations with different gains, and then had to choose whether the visually perceived rotation was smaller or greater than the physical rotation. In experiment E2, subjects chose whether the physical walk was shorter or longer than the visually perceived scaled travel distance. In experiment E3, subjects estimate the path curvature when walking a curved path in the real world while the visual display shows a straight path in the virtual world. Our results show that users can be turned physically about 49 percent more or 20 percent less than the perceived virtual rotation, distances can be downscaled by 14 percent and upscaled by 26 percent, and users can be redirected on a circular arc with a radius greater than 22 m while they believe that they are walking straight.

negative: Managing and Mining Graph Data Will reading habit influence your life? Many say yes. Reading managing and mining graph data is a good habit; you can develop this habit to be such interesting way. Yeah, reading habit will not only make you have any favourite activity. It will be one of guidance of your life. When reading has become a habit, you will not make it as disturbing activities or as boring activity. You can gain many benefits and importances of reading.

negative: Story Cloze Ending Selection Baselines and Data Examination This paper describes two supervised baseline systems for the Story Cloze Test Shared Task (Mostafazadeh et al., 2016a). We first build a classifier using features based on word embeddings and semantic similarity computation. We further implement a neural LSTM system with different encoding strategies that try to model the relation between the story and the provided endings. Our experiments show that a model using representation features based on average word embedding vectors over the given story words and the candidate ending sentences words, joint with similarity features between the story and candidate ending representations performed better than the neural models. Our best model achieves an accuracy of 72.42, ranking 3rd in the official evaluation.

negative:
Comparison of a 1450-nm diode laser and a 1320-nm Nd:YAG laser in the treatment of atrophic facial scars: a prospective clinical and histologic study. BACKGROUND
Atrophic scar revision techniques, although numerous, have been hampered by inadequate clinical responses and prolonged postoperative recovery periods. Nonablative laser treatment has been shown to effect significant dermal collagen remodeling with minimal posttreatment sequelae. Although many studies have been published regarding the effectiveness of these nonablative lasers on rhytides, there are limited data demonstrating their specific effects on atrophic scars.

OBJECTIVE
To evaluate and compare the efficacy and safety of long-pulsed 1320-nm Nd:YAG and 1450-nm diode lasers in the treatment of atrophic facial scarring.

METHODS
A series of 20 patients (skin phototypes I-V) with mild to moderate atrophic facial acne scars randomly received three successive monthly treatments with a long-pulsed 1320-nm Nd:YAG laser on one facial half and a long-pulsed 1450-nm diode laser on the contralateral facial half. Patients were evaluated using digital photography and three-dimensional in vivo microtopography measurements at each treatment visit and at 1, 3, 6, and 12 months postoperatively. Histologic evaluations of cutaneous biopsies obtained before treatment, immediately after the first treatment, and at 1, 3, 6, and 12 months after the third treatment were performed. Clinical assessment scores were determined at each treatment session and follow-up visit. Patient satisfaction surveys were obtained at the end of the study.

RESULTS
Mild to moderate clinical improvement was observed after the series of three treatments in the majority of patients studied. Patient satisfaction scores and in vivo microtopography measurements paralleled the photographic and histopathologic changes seen. Side effects of treatment were limited to mild transient erythema, edema, and hyperpigmentation. No scarring or adverse textural changes resulted from the use of either laser system.

CONCLUSIONS
Nonablative long-pulsed 1320-nm Nd:YAG and 1450-nm diode lasers each offer clinical improvement for patients with atrophic scarring without significant side effects or complications. The 1450-nm diode laser showed greater clinical scar response at the parameters studied. The use of nonablative laser systems is a good treatment alternative for patients with atrophic scarring who are unable or unwilling to endure the prolonged postoperative recovery process associated with ablative laser skin resurfacing procedures.

negative: Best practices for missing data management in counseling psychology. This article urges counseling psychology researchers to recognize and report how missing data are handled, because consumers of research cannot accurately interpret findings without knowing the amount and pattern of missing data or the strategies that were used to handle those data. Patterns of missing data are reviewed, and some of the common strategies for dealing with them are described. The authors provide an illustration in which data were simulated and evaluate 3 methods of handling missing data: mean substitution, multiple imputation, and full information maximum likelihood. Results suggest that mean substitution is a poor method for handling missing data, whereas both multiple imputation and full information maximum likelihood are recommended alternatives to this approach. The authors suggest that researchers fully consider and report the amount and pattern of missing data and the strategy for handling those data in counseling psychology research and that editors advise researchers of this expectation.

negative: Dynamic Impact of Online Word-of-Mouth and Advertising on Supply Chain Performance Cooperative (co-op) advertising investments benefit brand goodwill and further improve supply chain performance. Meanwhile, online word-of-mouth (OWOM) can also play an important role in supply chain performance. On the basis of co-op advertising, this paper considers a single supply chain structure led by a manufacturer and examines a fundamental issue concerning the impact of OWOM on supply chain performance. Firstly, by the method of differential game, this paper analyzes the dynamic impact of OWOM and advertising on supply chain performance (i.e., brand goodwill, sales, and profits) under three different supply chain decisions (i.e., only advertising, and manufacturers with and without sharing cost of OWOM with retailers). We compare and analyze the optimal strategies of advertising and OWOM under the above different supply chain decisions. Secondly, the system dynamics model is established to reflect the dynamic impact of OWOM and advertising on supply chain performance. Finally, three supply chain decisions under two scenarios, strong brand and weak brand, are analyzed through the system dynamics simulation. The results show that the input of OWOM can enhance brand goodwill and improve earnings. It further promotes the OWOM reputation and improves the supply chain performance if manufacturers share the cost of OWOM with retailers. Then, in order to eliminate the retailers from word-of-mouth fraud and establish a fair competition mechanism, the third parties (i.e., regulators or e-commerce platforms) should take appropriate punitive measures against retailers. Furthermore, the effect of OWOM on supply chain performance under a strong brand differed from those under a weak brand. Last but not least, if OWOM is improved, there would be more remarkable performance for the weak brand than that for the strong brand in the supply chain.

negative:
Genetic heritability and shared environmental factors among twin pairs with autism. CONTEXT
Autism is considered the most heritable of neurodevelopmental disorders, mainly because of the large difference in concordance rates between monozygotic and dizygotic twins.

OBJECTIVE
To provide rigorous quantitative estimates of genetic heritability of autism and the effects of shared environment.

DESIGN, SETTING, AND PARTICIPANTS
Twin pairs with at least 1 twin with an autism spectrum disorder (ASD) born between 1987 and 2004 were identified through the California Department of Developmental Services.

MAIN OUTCOME MEASURES
Structured diagnostic assessments (Autism Diagnostic Interview-Revised and Autism Diagnostic Observation Schedule) were completed on 192 twin pairs. Concordance rates were calculated and parametric models were fitted for 2 definitions, 1 narrow (strict autism) and 1 broad (ASD).

RESULTS
For strict autism, probandwise concordance for male twins was 0.58 for 40 monozygotic pairs (95% confidence interval [CI], 0.42-0.74) and 0.21 for 31 dizygotic pairs (95% CI, 0.09-0.43); for female twins, the concordance was 0.60 for 7 monozygotic pairs (95% CI, 0.28-0.90) and 0.27 for 10 dizygotic pairs (95% CI, 0.09-0.69). For ASD, the probandwise concordance for male twins was 0.77 for 45 monozygotic pairs (95% CI, 0.65-0.86) and 0.31 for 45 dizygotic pairs (95% CI, 0.16-0.46); for female twins, the concordance was 0.50 for 9 monozygotic pairs (95% CI, 0.16-0.84) and 0.36 for 13 dizygotic pairs (95% CI, 0.11-0.60). A large proportion of the variance in liability can be explained by shared environmental factors (55%; 95% CI, 9%-81% for autism and 58%; 95% CI, 30%-80% for ASD) in addition to moderate genetic heritability (37%; 95% CI, 8%-84% for autism and 38%; 95% CI, 14%-67% for ASD).

CONCLUSION
Susceptibility to ASD has moderate genetic heritability and a substantial shared twin environmental component.

negative: A least-squares approach to anomaly detection in static and sequential data We describe a probabilistic, nonparametric method for anomaly detection, based on a squared-loss objective function which has a simple analytical solution. The method emerges from extending recent work in nonparametric leastsquares classification to include a “none-of-the-above” class which models anomalies in terms of non-anamalous training data. The method shares the flexibility of other kernel-based anomaly detection methods, yet is typically much faster to train and test. It can also be used to distinguish between multiple inlier classes and anomalies. The probabilistic nature of the output makes it straightforward to apply even when test data has structural dependencies; we show how a hidden Markov model framework can be incorporated in order to identify anomalous subsequences in a test sequence. Empirical results on datasets from several domains show the method to have comparable discriminative performance to popular alternatives, but with a clear speed advantage.

negative: Online Social Network Dependency: Theoretical Development and Testing of Competing Models The proliferation of new social media technologies has changed the behavioral patterns of online users. This study aims at investigating the structure and dimensionality of the Online Social Network Dependency (OSN Dependency). We tested the competing models built upon the cognitive-behavioral model and the biopsychogical framework of addiction. Our findings suggested that OSN Dependency can be explained by a higher-order factor model with seven first-order factors (i.e. mood alternation, social benefit, negative outcomes, compulsivity, excessive time, withdrawal, and interpersonal control) and two correlated second-order factors (i.e. social components and intrapersonal components). The model provides a good-fit to the data, reflecting logical consistency. Implications of the current investigation for practice and research are provided.

negative: Map API - scalable decentralized map building for robots Large scale, long-term, distributed mapping is a core challenge to modern field robotics. Using the sensory output of multiple robots and fusing it in an efficient way enables the creation of globally accurate and consistent metric maps. To combine data from multiple agents into a global map, most existing approaches use a central entity that collects and manages the information from all agents. Often, the raw sensor data of one robot needs to be made available to processing algorithms on other agents due to the lack of computational resources on that robot. Unfortunately, network latency and low bandwidth in the field limit the generality of such an approach and make multi-robot map building a tedious task. In this paper, we present a distributed and decentralized back-end for concurrent and consistent robotic mapping. We propose a set of novel approaches that reduce the bandwidth usage and increase the effectiveness of inter-robot communication for distributed mapping. Instead of locking access to the map during operations, we define a version control system which allows concurrent and consistent access to the map data. Updates to the map are then shared asynchronously with agents which previously registered notifications. A technique for data lookup is provided by state-of-the-art algorithms from distributed computing. We validate our approach on real-world datasets and demonstrate the effectiveness of the proposed algorithms.

negative: AMR-to-text Generation with Synchronous Node Replacement Grammar EDUCATION PhD 2001 Computer Science, University of California, Berkeley. Directed by Nelson Morgan, Daniel Jurafsky, Charles Fillmore, Jerome Feldman. Dissertation: Statistical Language Understanding Using Frame Semantics MS 1999 Computer Science, University of California, Berkeley. Thesis: Topic-Based Language Models Using EM BA 1995 Double major in Linguistics and Computer Science, University of California, Berkeley.

negative: PHD: A Probabilistic Model of Hybrid Deep Collaborative Filtering for Recommender Systems Collaborative Filtering (CF), a well-known approach in producing recommender systems, has achieved wide use and excellent performance not only in research but also in industry. However, problems related to cold start and data sparsity have caused CF to attract an increasing amount of attention in efforts to solve these problems. Traditional approaches adopt side information to extract effective latent factors but still have some room for growth. Due to the strong characteristic of feature extraction in deep learning, many researchers have employed it with CF to extract effective representations and to enhance its performance in rating prediction. Based on this previous work, we propose a probabilistic model that combines a stacked denoising autoencoder and a convolutional neural network together with auxiliary side information (i.e, both from users and items) to extract users and items’ latent factors, respectively. Extensive experiments for four datasets demonstrate that our proposed model outperforms other traditional approaches and deep learning models making it state of the art.

negative: Compositional dynamic test generation Dynamic test generation is a form of dynamic program analysis that attempts to compute test inputs to drive a program along a specific program path. Directed Automated Random Testing, or DART for short, blends dynamic test generation with model checking techniques with the goal of systematically executing all feasible program paths of a program while detecting various types of errors using run-time checking tools (like Purify, for instance). Unfortunately, systematically executing all feasible program paths does not scale to large, realistic programs.This paper addresses this major limitation and proposes to perform dynamic test generation compositionally, by adapting known techniques for interprocedural static analysis. Specifically, we introduce a new algorithm, dubbed SMART for Systematic Modular Automated Random Testing, that extends DART by testing functions in isolation, encoding test results as function summaries expressed using input preconditions and output postconditions, and then re-using those summaries when testing higher-level functions. We show that, for a fixed reasoning capability, our compositional approach to dynamic test generation (SMART) is both sound and complete compared to monolithic dynamic test generation (DART). In other words, SMART can perform dynamic test generation compositionally without any reduction in program path coverage. We also show that, given a bound on the maximum number of feasible paths in individual program functions, the number of program executions explored by SMART is linear in that bound, while the number of program executions explored by DART can be exponential in that bound. We present examples of C programs and preliminary experimental results that illustrate and validate empirically these properties.

negative: Player Type Models: Towards Empirical Validation Player type models -- such as the BrainHex model -- are popular approaches for personalizing digital games towards individual preferences of players. Although several player type models have been developed and are currently used in game design projects, there is still a lack of data on their validity. To close this research gap we currently investigate the psychometric properties (factor structure, reliability, stability) and predictive validity (if player type scores can predict player experience) of the player type model BrainHex in an ongoing project. Results of two online studies (n1=592, n2=243) show that the psychometric properties of the BrainHex model could be improved. We suggest to improve the according questionnaire and sketch how the predictive validity could be investigated in future studies.

negative: Assessing the Potential of Classical Q-learning in General Game Playing After the recent groundbreaking results of AlphaGo and AlphaZero, we have seen strong interests in deep reinforcement learning and artificial general intelligence (AGI) in game playing. However, deep learning is resource-intensive and the theory is not yet well developed. For small games, simple classical table-based Q-learning might still be the algorithm of choice. General Game Playing (GGP) provides a good testbed for reinforcement learning to research AGI. Q-learning is one of the canonical reinforcement learning methods, and has been used by (Banerjee & Stone, IJCAI 2007) in GGP. In this paper we implement Q-learning in GGP for three small-board games (Tic-Tac-Toe, Connect Four, Hex), to allow comparison to Banerjee et al.. We find that Q-learning converges to a high win rate in GGP. For the -greedy strategy, we propose a first enhancement, the dynamic algorithm. In addition, inspired by (Gelly & Silver, ICML 2007) we combine online search (Monte Carlo Search) to enhance offline learning, and propose QM-learning for GGP. Both enhancements improve the performance of classical Q-learning. In this work, GGP allows us to show, if augmented by appropriate enhancements, that classical table-based Q-learning can perform well in small games.

negative: The coevolution of cultural groups and ingroup favoritism. Cultural boundaries have often been the basis for discrimination, nationalism, religious wars, and genocide. Little is known, however, about how cultural groups form or the evolutionary forces behind group affiliation and ingroup favoritism. Hence, we examine these forces experimentally and show that arbitrary symbolic markers, though initially meaningless, evolve to play a key role in cultural group formation and ingroup favoritism because they enable a population of heterogeneous individuals to solve important coordination problems. This process requires that individuals differ in some critical but unobservable way and that their markers be freely and flexibly chosen. If these conditions are met, markers become accurate predictors of behavior. The resulting social environment includes strong incentives to bias interactions toward others with the same marker, and subjects accordingly show strong ingroup favoritism. When markers do not acquire meaning as accurate predictors of behavior, players show a markedly reduced taste for ingroup favoritism. Our results support the prominent evolutionary hypothesis that cultural processes can reshape the selective pressures facing individuals and so favor the evolution of behavioral traits not previously advantaged.

negative: Evolving Personalized Content for Super Mario Bros Using Grammatical Evolution Adapting game content to a particular player’s needs and expertise constitutes an important aspect in game design. Most research in this direction has focused on adapting game difficulty to keep the player engaged in the game. Dynamic difficulty adjustment, however, focuses on one aspect of the gameplay experience by adjusting the content to increase or decrease perceived challenge. In this paper, we introduce a method for automatic level generation for the platform game Super Mario Bros using grammatical evolution. The grammatical evolution-based level generator is used to generate player-adapted content by employing an adaptation mechanism as a fitness function in grammatical evolution to optimize the player experience of three emotional states: engagement, frustration and challenge. The fitness functions used are models of player experience constructed in our previous work from crowd-sourced gameplay data collected from over 1500 game sessions.

negative: Evolutionary Function Approximation for Reinforcement Learning Temporal difference methods are theoretically grounded and empirically effective methods for addressing reinforcement learning problems. In most real-world reinforcement learning tasks, TD methods require a function approximator to represent the value function. However, using function approximators requires manually making crucial representational decisions. This thesis investigates evolutionary function approximation, a novel approach to automatically selecting function approximator representations that enable efficient individual learning. This method evolves individuals that are better able to learn. I present a fully implemented instantiation of evolutionary function approximation which combines NEAT, a neuroevolutionary optimization technique, with Q-learning, a popular TD method. The resulting NEAT+Q algorithm automatically discovers effective representations for neural network function approximators. This thesis also presents on-line evolutionary computation, which improves the on-line performance of evolutionary computation by borrowing selection mechanisms used in TD methods to choose individual actions and using them in evolutionary computation to select policies for evaluation. I evaluate these contributions with extended empirical studies in two domains: 1) the mountain car task, a standard reinforcement learning benchmark on which neural network function approximators have previously performed poorly and 2) server job scheduling, a large probabilistic domain drawn from the field of autonomic computing. The results demonstrate that evolutionary function approximation can significantly improve the performance of TD methods and on-line evolutionary computation can significantly improve evolutionary methods.

negative: Bidding algorithms for simultaneous auctions This paper introduces RoxyBot, one of the top-scoring agents in the First International Trading Agent Competition. A TAC agent simulates one vision of future travel agents: it represents a set of clients in simultaneous auctions, trading complementary (e.g., airline tickets and hotel reservations) and substitutable (e.g., symphony and theater tickets) goods. RoxyBot faced two key technical challenges in TAC: (i) allocation---assigning purchased goods to clients at the end of a game instance so as to maximize total client utility, and (ii) completion---determining the optimal quantity of each resource to buy and sell given client preferences, current holdings, and market prices. For the dimensions of TAC, an optimal solution to the allocation problem is tractable, and RoxyBot uses a search algorithm based on A* to produce optimal allocations. An optimal solution to the completion problem is also tractable, but in the interest of minimizing bidding cycle time, RoxyBot solves the completion problem using beam search, producing approximately optimal completions. RoxyBot's completer relies on an innovative data structure called a priceline.

negative: The Columbia-GWU System at the 2016 TAC KBP BeSt Evaluation We present the components of the ColumbiaGWU contribution to the 2016 TAC KBP BeSt Evaluation.


query: Combining concept hierarchies and statistical topic models

positive: A Topic Model for Word Sense Disambiguation We develop latent Dirichlet allocation with WORDNET (LDAWN), an unsupervised probabilistic topic model that includes word sense as a hidden variable. We develop a probabilistic posterior inference algorithm for simultaneously disambiguating a corpus and learning the domains in which to consider each word. Using the WORDNET hierarchy, we embed the construction of Abney and Light (1999) in the topic model and show that automatically learned domains improve WSD accuracy compared to alternative contexts.

positive: Probabilistic author-topic models for information discovery We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic process. Each author is represented by a probability distribution over topics, and each topic is represented as a probability distribution over words for that topic. The words in a multi-author paper are assumed to be the result of a mixture of each authors' topic mixture. The topic-word and author-topic distributions are learned from data in an unsupervised manner using a Markov chain Monte Carlo algorithm. We apply the methodology to a large corpus of 160,000 abstracts and 85,000 authors from the well-known CiteSeer digital library, and learn a model with 300 topics. We discuss in detail the interpretation of the results discovered by the system including specific topic and author models, ranking of authors by topic and topics by author, significant trends in the computer science literature between 1990 and 2002, parsing of abstracts by topics and authors and detection of unusual papers by specific authors. An online query interface to the model is also discussed that allows interactive exploration of author-topic models for corpora such as CiteSeer.

positive: Latent Dirichlet Allocation We propose a generative model for text and other collections of discrete data that generalizes or improves on several previous models including naive Bayes/unigram, mixture of unigrams [6], and Hofmann's aspect model , also known as probabilistic latent semantic indexing (pLSI) [3]. In the context of text modeling, our model posits that each document is generated as a mixture of topics, where the continuous-valued mixture proportions are distributed as a latent Dirichlet random variable. Inference and learning are carried out efficiently via variational algorithms. We present empirical results on applications of this model to problems in text modeling, collaborative filtering, and text classification.

positive: Finding scientific topics. A first step in identifying the content of a document is determining which topics that document addresses. We describe a generative model for documents, introduced by Blei, Ng, and Jordan [Blei, D. M., Ng, A. Y. & Jordan, M. I. (2003) J. Machine Learn. Res. 3, 993-1022], in which each document is generated by choosing a distribution over topics and then choosing each word in the document from a topic selected according to this distribution. We then present a Markov chain Monte Carlo algorithm for inference in this model. We use this algorithm to analyze abstracts from PNAS by using Bayesian model selection to establish the number of topics. We show that the extracted topics capture meaningful structure in the data, consistent with the class designations provided by the authors of the articles, and outline further applications of this analysis, including identifying "hot topics" by examining temporal dynamics and tagging abstracts to illustrate semantic content.

positive: Mixtures of hierarchical topics with Pachinko allocation The four-level pachinko allocation model (PAM) (Li & McCallum, 2006) represents correlations among topics using a DAG structure. It does not, however, represent a nested hierarchy of topics, with some topical word distributions representing the vocabulary that is shared among several more specific topics. This paper presents hierarchical PAM---an enhancement that explicitly represents a topic hierarchy. This model can be seen as combining the advantages of hLDA's topical hierarchy representation with PAM's ability to mix multiple leaves of the topic hierarchy. Experimental results show improvements in likelihood of held-out documents, as well as mutual information between automatically-discovered topics and humangenerated categories such as journals.

negative: A Condensation Approach to Privacy Preserving Data Mining In recent years, privacy preserving data mining has become an important problem because of the large amount of personal data which is tracked by many business applications. In many cases, users are unwilling to provide personal information unless the privacy of sensitive information is guaranteed. In this paper, we propose a new framework for privacy preserving data mining of multi-dimensional data. Previous work for privacy preserving data mining uses a perturbation approach which reconstructs data distributions in order to perform the mining. Such an approach treats each dimension independently and therefore ignores the correlations between the different dimensions. In addition, it requires the development of a new distribution based algorithm for each data mining problem, since it does not use the multi-dimensional records, but uses aggregate distributions of the data as input. This leads to a fundamental re-design of data mining algorithms. In this paper, we will develop a new and flexible approach for privacy preserving data mining which does not require new problem-specific algorithms, since it maps the original data set into a new anonymized data set. This anonymized data closely matches the characteristics of the original data including the correlations among the different dimensions. We present empirical results illustrating the effectiveness of the method.

negative: Nonlinear dimensionality reduction by locally linear embedding. Many areas of science depend on exploratory data analysis and visualization. The need to analyze large amounts of multivariate data raises the fundamental problem of dimensionality reduction: how to discover compact representations of high-dimensional data. Here, we introduce locally linear embedding (LLE), an unsupervised learning algorithm that computes low-dimensional, neighborhood-preserving embeddings of high-dimensional inputs. Unlike clustering methods for local dimensionality reduction, LLE maps its inputs into a single global coordinate system of lower dimensionality, and its optimizations do not involve local minima. By exploiting the local symmetries of linear reconstructions, LLE is able to learn the global structure of nonlinear manifolds, such as those generated by images of faces or documents of text.

negative: Influence of External Currents in Sensors Based on PCB Rogowski Coils A current sensor based in the Rogowski coil is an innovative measuring system that gives advantages with respect to conventional measuring systems based in current transformers with magnetic core [1], [2].and [3]. Their main advantages are: the linearity, the span and the bandwidth. Different kinds of manufacturing allow to obtain an important variety of Rogowski coils with different properties. One way of manufacturing is using the same method as for producing printed circuit boards, so by this way is possible to produce coils very similar and with a high precision. The authors are working in current measurement with Rogowski coils or Hall effect sensors and in particular in the realization of good and accurate coils [4] and [5]. In this work, the influence of external currents to the coil in the measured current by the coil has been evaluated.

negative:
Identifying quantitative trait loci via group-sparse multitask regression and feature selection: an imaging genetics study of the ADNI cohort MOTIVATION
Recent advances in high-throughput genotyping and brain imaging techniques enable new approaches to study the influence of genetic variation on brain structures and functions. Traditional association studies typically employ independent and pairwise univariate analysis, which treats single nucleotide polymorphisms (SNPs) and quantitative traits (QTs) as isolated units and ignores important underlying interacting relationships between the units. New methods are proposed here to overcome this limitation.

RESULTS
Taking into account the interlinked structure within and between SNPs and imaging QTs, we propose a novel Group-Sparse Multi-task Regression and Feature Selection (G-SMuRFS) method to identify quantitative trait loci for multiple disease-relevant QTs and apply it to a study in mild cognitive impairment and Alzheimer's disease. Built upon regression analysis, our model uses a new form of regularization, group ℓ(2,1)-norm (G(2,1)-norm), to incorporate the biological group structures among SNPs induced from their genetic arrangement. The new G(2,1)-norm considers the regression coefficients of all the SNPs in each group with respect to all the QTs together and enforces sparsity at the group level. In addition, an ℓ(2,1)-norm regularization is utilized to couple feature selection across multiple tasks to make use of the shared underlying mechanism among different brain regions. The effectiveness of the proposed method is demonstrated by both clearly improved prediction performance in empirical evaluations and a compact set of selected SNP predictors relevant to the imaging QTs.

AVAILABILITY
Software is publicly available at: http://ranger.uta.edu/%7eheng/imaging-genetics/.

negative: Security Against Hardware Trojan Attacks Using Key-Based Design Obfuscation Malicious modification of hardware in untrusted fabrication facilities, referred to as hardware Trojan, has emerged as a major security concern. Comprehensive detection of these Trojans during postmanufacturing test has been shown to be extremely difficult. Hence, it is important to develop design techniques that provide effective countermeasures against hardware Trojans by either preventing Trojan attacks or facilitating detection during test. Obfuscation is a technique that is conventionally employed to prevent piracy of software and hardware intellectual property (IP). In this work, we propose a novel application of key-based circuit structure and functionality obfuscation to achieve protection against hardware Trojans triggered by rare internal circuit conditions. The proposed obfuscation scheme is based on judicious modification of the state transition function, which creates two distinct functional modes: normal and Responsible Editor: S. T. Chakradhar A preliminary version of this work has been published in the International Conference on Computer Aided Design (ICCAD), 2009. R. S. Chakraborty (B) Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, West Bengal 721302, India e-mail: rschakraborty@cse.iitkgp.ernet.in S. Bhunia Department of Electrical Engineering and Computer Science, Case Western Reserve University, Cleveland, OH 44106, USA e-mail: skb21@case.edu obfuscated. A circuit transitions from the obfuscated to the normal mode only upon application of a specific input sequence, which defines the key. We show that it provides security against Trojan attacks in two ways: (1) it makes some inserted Trojans benign, i.e. they become effective only in the obfuscated mode; and (2) it prevents an adversary from exploiting the true rare events in a circuit to insert hard-to-detect Trojans. The proposed design methodology can thus achieve simultaneous protection from hardware Trojans and hardware IP piracy. Besides protecting ICs against Trojan attacks in foundry, we show that it can also protect against malicious modifications by untrusted computeraided design (CAD) tools in both SoC and FPGA design flows. Simulation results for a set of benchmark circuits show that the scheme is capable of achieving high levels of security against Trojan attacks at modest area, power and delay overhead.

negative: Combining Neural Networks and Log-linear Models to Improve Relation Extraction The last decade has witnessed the success of traditional feature-based methods for exploiting the discrete structures such as words or lexical patterns to extract relations from text. Recently, convolutional and recurrent neural networks have been shown to capture effective hidden structures within sentences via continuous representations, thereby significantly advancing the performance of relation extraction. The advantage of convolutional neural networks is their capacity to generalize the consecutive k-grams in the sentences while recurrent neural networks are effective to encode long range sentence context. This paper proposes to combine the traditional feature-based method, the convolutional and recurrent neural networks to simultaneously benefit from their advantages. Our systematic evaluation of different network architectures and combination methods demonstrates the effectiveness of this approach and results in the state-ofthe-art performance on the ACE 2005 and SemEval datasets.

negative: A second generation computer forensic analysis system The architecture of existing – first generation – computer forensic tools, including the widely used EnCase and FTK products, is rapidly becoming outdated. Tools are not keeping pace with increased complexity and data volumes of modern investigations. This paper discuses the limitations of first generation computer forensic tools. Several metrics for measuring the efficacy and performance of computer forensic tools are introduced. A set of requirements for second generation tools are proposed. A high-level design for a (work in progress) second generation computer forensic analysis system is presented. a 2009 Digital Forensic Research workshop. Published by Elsevier Ltd. All rights reserved.

negative: A Low-Power 32-Channel Digitally Programmable Neural Recording Integrated Circuit We report the design of an ultra-low-power 32-channel neural-recording integrated circuit (chip) in a 0.18 μ m CMOS technology. The chip consists of eight neural recording modules where each module contains four neural amplifiers, an analog multiplexer, an A/D converter, and a serial programming interface. Each amplifier can be programmed to record either spikes or LFPs with a programmable gain from 49-66 dB. To minimize the total power consumption, an adaptive-biasing scheme is utilized to adjust each amplifier's input-referred noise to suit the background noise at the recording site. The amplifier's input-referred noise can be adjusted from 11.2 μVrms (total power of 5.4 μW) down to 5.4 μVrms (total power of 20 μW) in the spike-recording setting. The ADC in each recording module digitizes the a.c. signal input to each amplifier at 8-bit precision with a sampling rate of 31.25 kS/s per channel, with an average power consumption of 483 nW per channel, and, because of a.c. coupling, allows d.c. operation over a wide dynamic range. It achieves an ENOB of 7.65, resulting in a net efficiency of 77 fJ/State, making it one of the most energy-efficient designs for neural recording applications. The presented chip was successfully tested in an in vivo wireless recording experiment from a behaving primate with an average power dissipation per channel of 10.1 μ W. The neural amplifier and the ADC occupy areas of 0.03 mm2 and 0.02 mm2 respectively, making our design simultaneously area efficient and power efficient, thus enabling scaling to high channel-count systems.

negative: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae D New algorithms for deciding whether a (propositional) Horn formula is satisfiable are presented. If the Horn formula A contains K distinct propositional letters and if it is assumed that they are exactly Pi,. . . , PK, the two algorithms presented in this paper run in time O(N), where N is the total number of occurrences of literals in A. By representing a Horn proposition as a graph, the satisfiability problem can be formulated as a data flow problem, a certain type of pebbling. The difference between the two algorithms presented here is the strategy used for pebbling the graph. The first algorithm is based on the principle used for finding the set of nonterminals of a context-free grammar from which the empty string can be derived. The second algorithm is a graph traversal and uses a “call-by-need” strategy. This algorithm uses an attribute grammar to translate a propositional Horn formula to its corresponding graph in linear time. Our formulation of the satisfiability problem as a data flow problem appears to be new and suggests the possibility of improving efficiency using parallel processors. a

negative: The architecture of virtual machines A virtual machine can support individual processes or a complete system depending on the abstraction level where virtualization occurs. Some VMs support flexible hardware usage and software isolation, while others translate from one instruction set to another. Virtualizing a system or component -such as a processor, memory, or an I/O device - at a given abstraction level maps its interface and visible resources onto the interface and resources of an underlying, possibly different, real system. Consequently, the real system appears as a different virtual system or even as multiple virtual systems. Interjecting virtualizing software between abstraction layers near the HW/SW interface forms a virtual machine that allows otherwise incompatible subsystems to work together. Further, replication by virtualization enables more flexible and efficient and efficient use of hardware resources.

negative: ECNUCS: Measuring Short Text Semantic Equivalence Using Multiple Similarity Measurements This paper reports our submissions to the Semantic Textual Similarity (STS) task in SemEval 2013 (Task 6). We submitted three Support Vector Regression (SVR) systems in core task, using 6 types of similarity measures, i.e., string similarity, number similarity, knowledge-based similarity, corpus-based similarity, syntactic dependency similarity and machine translation similarity. Our third system with different training data and different feature sets for each test data set performs the best and ranks 35 out of 90 runs. We also submitted two systems in typed task using string based measure and Named Entity based measure. Our best system ranks 5 out of 15 runs.

negative: Thin-Slicing for Pose: Learning to Understand Pose without Explicit Pose Estimation We address the problem of learning a pose-aware, compact embedding that projects images with similar human poses to be placed close-by in the embedding space. The embedding function is built on a deep convolutional network, and trained with triplet-based rank constraints on real image data. This architecture allows us to learn a robust representation that captures differences in human poses by effectively factoring out variations in clothing, background, and imaging conditions in the wild. For a variety of pose-related tasks, the proposed pose embedding provides a cost-efficient and natural alternative to explicit pose estimation, circumventing challenges of localizing body joints. We demonstrate the efficacy of the embedding on pose-based image retrieval and action recognition problems.

negative: Protocol for developing ANN models and its application to the assessment of the quality of the ANN model development process in drinking water quality modelling The application of Artificial Neural Networks (ANNs) in the field of environmental and water resources modelling has become increasingly popular since early 1990s. Despite the recognition of the need for a consistent approach to the development of ANN models and the importance of providing adequate details of the model development process, there is no systematic protocol for the development and documentation of ANN models. In order to address this shortcoming, such a protocol is introduced in this paper. In addition, the protocol is used to critically review the quality of the ANN model development and reporting processes employed in 81 journal papers since 2000 in which ANNs have been used for drinking water quality modelling. The results show that model architecture selection is the best implemented step, while greater focus should be given to input selection considering input independence and model validation considering replicative and structural validity. 2014 Elsevier Ltd. All rights reserved.

negative: Micro-synchrophasors for distribution systems This paper describes a research project to develop a network of high-precision phasor measurement units, termed micro-synchrophasors or μPMUs, and explore the applications of μPMU data for electric power distribution systems.

negative: From the ephemeral to the enduring: how approach-oriented mindsets lead to greater status. We propose that the psychological states individuals bring into newly formed groups can produce meaningful differences in status attainment. Three experiments explored whether experimentally created approach-oriented mindsets affected status attainment in groups, both immediately and over time. We predicted that approach-oriented states would lead to greater status attainment by increasing proactive behavior. Furthermore, we hypothesized that these status gains would persist longitudinally, days after the original mindsets had dissipated, due to the self-reinforcing behavioral cycles the approach-oriented states initiated. In Experiment 1, individuals primed with a promotion focus achieved higher status in their newly formed groups, and this was mediated by proactive behavior as rated by themselves and their teammates. Experiment 2 was a longitudinal experiment and revealed that individuals primed with power achieved higher status, both immediately following the prime and when the groups were reassembled 2 days later to work on new tasks. These effects were mediated by independent coders' ratings of proactive behavior during the first few minutes of group interaction. Experiment 3 was another longitudinal experiment and revealed that priming happiness led to greater status as well as greater acquisition of material resources. Importantly, these immediate and longitudinal effects were independent of the effects of a number of stable dispositional traits. Our results establish that approach-oriented psychological states affect status attainment, over and above the more stable characteristics emphasized in prior research, and provide the most direct test yet of the self-reinforcing nature of status hierarchies. These findings depict a dynamic view of status organization in which the same group may organize itself differently depending on members' incoming psychological states.

negative: Relating reinforcement learning performance to classification performance We prove a quantitative connection between the expected sum of rewards of a policy and binary classification performance on created subproblems. This connection holds without any unobservable assumptions (no assumption of independence, small mixing time, fully observable states, or even hidden states) and the resulting statement is independent of the number of states or actions. The statement is critically dependent on the size of the rewards and prediction performance of the created classifiers.We also provide some general guidelines for obtaining good classification performance on the created subproblems. In particular, we discuss possible methods for generating training examples for a classifier learning algorithm.

negative: Semantic Labeling of Aerial and Satellite Imagery Inspired by the recent success of deep convolutional neural networks (CNNs) and feature aggregation in the field of computer vision and machine learning, we propose an effective approach to semantic pixel labeling of aerial and satellite imagery using both CNN features and hand-crafted features. Both CNN and hand-crafted features are applied to dense image patches to produce per-pixel class probabilities. Conditional random fields (CRFs) are applied as a postprocessing step. The CRF infers a labeling that smooths regions while respecting the edges present in the imagery. The combination of these factors leads to a semantic labeling framework which outperforms all existing algorithms on the International Society of Photogrammetry and Remote Sensing (ISPRS) two-dimensional Semantic Labeling Challenge dataset. We advance state-of-the-art results by improving the overall accuracy to 88% on the ISPRS Semantic Labeling Contest. In this paper, we also explore the possibility of applying the proposed framework to other types of data. Our experimental results demonstrate the generalization capability of our approach and its ability to produce accurate results.

negative: Are Faculty Members Ready? Individual Factors Affecting Knowledge Management Readiness in Universities Knowledge Management (KM) provides a systematic process to help in the creation, transfer and use of knowledge across the university, leading to increased productivity. While KM has been successfully used elsewhere, universities have been late in adopting it. Before a university can initiate KM, it needs to determine if it is ready for KM or not. Through a web-based survey sent to 1263 faculty members from 59 accredited Library and Information Science programs in universities across North America, this study investigated the e®ect of individual factors of trust, knowledge self-e±cacy, collegiality, openness to change and reciprocity on individual readiness to participate in a KM initiative, and the degree to which this a®ects perceived organisational readiness to adopt KM. 157 valid responses were received. Using structural equation modeling, the study found that apart from trust, all other factors positively a®ected individual readiness, which was found to a®ect organisational readiness. Findings should help universities identify opportunities and barriers before they can adopt KM. It should be a useful contribution to the KM literature, especially in the university context.

negative: Overview of Virtual Reality Technologies The promise of being able to be inside another world might be resolved by Virtual Reality. It wouldn’t be naïve to assume that we will be able to enter and completely feel another world at some point in the future; be able to interact with knowledge and entertainment in a totally immersive state. Advancements are becoming more frequent, and with the recent popularity of technology in this generation, a lot of investment is being made. Prototypes of head displays that completely cover the user’s view and movement recognition which doesn’t need an intermediate device for input of data are already Virtual Reality devices available to developers and even to the public. From time to time, the way we interact with computers change, and virtual reality promises to make this interaction as real as possible. Although scenes like flying a jet or tank, are already tangible, another scenes, such as being able to feel the dry air of the Sahara in geography classes or feel the hard, cold scales of a dragon in a computer game seem to be in a long w a y f r o m n o w. H o w e v e r , t e c h n o l o g i c advancements and increase in the popularity of these technologies point to the possibility of such amazing scenes coming true.

negative: Ranking with local regression and global alignment for cross media retrieval Rich multimedia content including images, audio and text are frequently used to describe the same semantics in E-Learning and Ebusiness web pages, instructive slides, multimedia cyclopedias, and so on. In this paper, we present a framework for cross-media retrieval, where the query example and the retrieved result(s) can be of different media types. We first construct Multimedia Correlation Space (MMCS) by exploring the semantic correlation of different multimedia modalities, during which multimedia content and co-occurrence information is utilized. We propose a novel ranking algorithm, namely ranking with Local Regression and Global Alignment (LRGA), which learns a robust Laplacian matrix for data ranking. In LRGA, for each data point, a local linear regression model is used to predict the ranking values of its neighboring points. We propose a unified objective function to globally align the local models from all the data points so that an optimal ranking value can be assigned to each data point. LRGA is insensitive to parameters, making it particularly suitable for data ranking. A relevance feedback algorithm is proposed to improve the retrieval performance. Comprehensive experiments have demonstrated the effectiveness of our methods.

negative: Using Smart City Technology to Make Healthcare Smarter Smart cities use information and communication technologies (ICTs) to scale services include utilities and transportation to a growing population. In this paper, we discuss how smart city ICTs can also improve healthcare effectiveness and lower healthcare cost for smart city residents. We survey current literature and introduce original research to offer an overview of how smart city infrastructure supports strategic healthcare using both mobile and ambient sensors combined with machine learning. Finally, we consider challenges that will be faced as healthcare providers make use of these opportunities.

negative: A Study on Knowledge , Perceptions and Attitudes about Screening and Diagnosis of Diabetes in Saudi Population Introduction: Timely screening and treatment of diabetes can considerably reduce associated health adverse effects. The purpose of the study was to evaluate the knowledge about diabetes and perceptions and attitude about screening and early diagnosis of diabetes among the population. Methods: A cross-sectional questionnaire-based study conducted among non-diabetes adult people attending primary health care centers in Jeddah, Saudi Arabia. Participants’ knowledge about diabetes risk factors and complications and perceptions and attitude regarding screening and early diagnosis of diabetes was assessed and different scores were calculated. Results: Total 202 patients were included: mean (SD) age was 38.19 (13.25) years and 55.0% were females. Knowledge about diabetes risk factors and complications was 60.41%84.77% and 44.67%-67.51%, respectively, depending on the item. Perceptions about screening and early diagnosis showed that 81.19% believed that screening tests exist and 75.14% believed that it is possible to diagnose diabetes before complication stage; while 84.16% believed that early diagnosis increases treatment efficacy, decreases incidence of complications (83.66%), and allows early treatment (83.66%). Regarding attitude, 86.14% agreed to undergo diabetes screening if advised by the physician and 60.40% would do on their own initiative. Linear regression showed a positive correlation of attitude score with knowledge about diabetes risk factors (OR=1.87; p<0.0001) and complications (OR=1.46; p<0.0001); perception about feasibility of screening (OR=1.93; p<0.0001) and benefits of early diagnosis (OR=1.69; p<0.0001). Conclusions: The improvement of knowledge about diabetes risk factors and complications as well as the perception about feasibility and benefits of screening are prerequisites for the promotion of diabetes screening among the population.

negative: The Evidence Framework Applied to Classification Networks Three Bayesian ideas are presented for supervised adaptive classifiers. First, it is argued that the output of a classifier should be obtained by marginalizing over the posterior distribution of the parameters; a simple approximation to this integral is proposed and demonstrated. This involves a "moderation" of the most probable classifier's outputs, and yields improved performance. Second, it is demonstrated that the Bayesian framework for model comparison described for regression models in MacKay (1992a,b) can also be applied to classification problems. This framework successfully chooses the magnitude of weight decay terms, and ranks solutions found using different numbers of hidden units. Third, an information-based data selection criterion is derived and demonstrated within this framework.

negative: Internet Scale User-Generated Live Video Streaming: The Twitch Case Twitch is a live video streaming platform used for broadcasting video gameplay, ranging from amateur players to eSports tournaments. This platform has gathered a substantial world wide community, reaching more than 1.7 million broadcasters and 100 million visitors every month. Twitch is fundamentally different from “static” content distribution platforms such as YouTube and Netflix, as streams are generated and consumed in real time. In this paper, we explore the Twitch infrastructure to understand how it manages live streaming delivery to an Internet-wide audience. We found Twitch manages a geo-distributed infrastructure, with presence in four continents. Our findings show that Twitch dynamically allocates servers to channels depending on their popularity. Additionally, we explore the redirection strategy of clients to servers depending on their region and the specific channel.

negative: Predicting Stock Price Direction using Support Vector Machines Support Vector Machine is a machine learning technique used in recent studies to forecast stock prices. This study uses daily closing prices for 34 technology stocks to calculate price volatility and momentum for individual stocks and for the overall sector. These are used as parameters to the SVM model. The model attempts to predict whether a stock price sometime in the future will be higher or lower than it is on a given day. We find little predictive ability in the short-run but definite predictive ability in the long-run.

negative: Improving Text Classification by Shrinkage in a Hierarchy of Classes When documents are organized in a large number of topic categories, the categories are often arranged in a hierarchy. The U.S. patent database and Yahoo are two examples. This paper shows that the accuracy of a naive Bayes text classi er can be signi cantly improved by taking advantage of a hierarchy of classes. We adopt an established statistical technique called shrinkage that smoothes parameter estimates of a data-sparse child with its parent in order to obtain more robust parameter estimates. The approach is also employed in deleted interpolation, a technique for smoothing n-grams in language modeling for speech recognition. Our method scales well to large data sets, with numerous categories in large hierarchies. Experimental results on three real-world data sets from UseNet, Yahoo, and corporate web pages show improved performance, with a reduction in error up to 29% over the traditional at classi er.

negative: Evaluation Techniques for Storage Hierarchies This paper introduces an efficient technique called “stack processing” that can be used in the cost-performance evaluation of a large class of storage hierarchies. The technique depends on a classification of page replacement algorithms as “stack algorithms” for which various properties are derived. These properties may be of use in the general areas of program modeling and system analysis, as well as in the evaluation of storage hierarchies. For a better understanding of storage hierarchies, we briefly review some basic concepts of their design.

negative: Interpretation and trust: designing model-driven visualizations for text analysis Statistical topic models can help analysts discover patterns in large text corpora by identifying recurring sets of words and enabling exploration by topical concepts. However, understanding and validating the output of these models can itself be a challenging analysis task. In this paper, we offer two design considerations - interpretation and trust - for designing visualizations based on data-driven models. Interpretation refers to the facility with which an analyst makes inferences about the data through the lens of a model abstraction. Trust refers to the actual and perceived accuracy of an analyst's inferences. These considerations derive from our experiences developing the Stanford Dissertation Browser, a tool for exploring over 9,000 Ph.D. theses by topical similarity, and a subsequent review of existing literature. We contribute a novel similarity measure for text collections based on a notion of "word-borrowing" that arose from an iterative design process. Based on our experiences and a literature review, we distill a set of design recommendations and describe how they promote interpretable and trustworthy visual analysis tools.

negative: Statistics: a brief overview. The Accreditation Council for Graduate Medical Education sets forth a number of required educational topics that must be addressed in residency and fellowship programs. We sought to provide a primer on some of the important basic statistical concepts to consider when examining the medical literature. It is not essential to understand the exact workings and methodology of every statistical test encountered, but it is necessary to understand selected concepts such as parametric and nonparametric tests, correlation, and numerical versus categorical data. This working knowledge will allow you to spot obvious irregularities in statistical analyses that you encounter.

negative: Modeling Visual Attention via Selective Tuning A model for aspects of visual attention based on the concept of selective tuning is presented. It provides for a solution to the problems of selection in an image, information routing through the visual processing hierarchy and task-specific attentional bias. The central thesis is that attention acts to optimize the search procedure inherent in a solution to vision. It does so by selectively tuning the visual processing network which is accomplished by a top-down hierarchy of winner-take-all processes embedded within the visual processing pyramid. Comparisons to other major computational models of attention and to the relevant neurobiology are included in detail throughout the paper. The model has been implemented; several examples of its performance are shown. This model is a hypothesis for primate visual attention, but it also outperforms existing computational solutions for attention in machine vision and is highly appropriate to solving the problem in a robot vision system.

negative: Visualizing Topic Models Managing large collections of documents is an important problem for many areas of science, industry, and culture. Probabilistic topic modeling offers a promising solution. Topic modeling is an unsupervised machine learning method that learns the underlying themes in a large collection of otherwise unorganized documents. This discovered structure summarizes and organizes the documents. However, topic models are high-level statistical tools—a user must scrutinize numerical distributions to understand and explore their results. In this paper, we present a method for visualizing topic models. Our method creates a navigator of the documents, allowing users to explore the hidden structure that a topic model discovers. These browsing interfaces reveal meaningful patterns in a collection, helping end-users explore and understand its contents in new ways. We provide open source software of our method. Understanding and navigating large collections of documents has become an important activity in many spheres. However, many document collections are not coherently organized and organizing them by hand is impractical. We need automated ways to discover and visualize the structure of a collection in order to more easily explore its contents. Probabilistic topic modeling is a set of machine learning tools that may provide a solution (Blei and Lafferty 2009). Topic modeling algorithms discover a hidden thematic structure in a collection of documents; they find salient themes and represent each document as a combination of themes. However, topic models are high-level statistical tools. A user must scrutinize numerical distributions to understand and explore their results; the raw output of the model is not enough to create an easily explored corpus. We propose a method for using a fitted topic model to organize, summarize, visualize, and interact with a corpus. With our method, users can explore the corpus, moving between high level discovered summaries (the “topics”) and the documents themselves, as Figure 1 illustrates. Our design is centered around the idea that the model both summarizes and organizes the collection. Our method translates these representations into a visual system for exploring a collection, but visualizing this structure is not enough. The discovered structure induces relationships—between topics and articles, and between articles and articles—which lead to interactions in the visualization. Copyright c © 2012, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. Thus, we have three main goals in designing the visualization: summarize the corpus for the user; reveal the relationships between the content and summaries; and, reveal the relationships across content. We aim to present these in a ways that are accessible and useful to a spectrum of users, not just machine learning experts.

negative: A Frame of Mind: Using Statistical Models for Detection of Framing and Agenda Setting Campaigns Framing is a sophisticated form of discourse in which the speaker tries to induce a cognitive bias through consistent linkage between a topic and a specific context (frame). We build on political science and communication theory and use probabilistic topic models combined with time series regression analysis (autoregressive distributed-lag models) to gain insights about the language dynamics in the political processes. Processing four years of public statements issued by members of the U.S. Congress, our results provide a glimpse into the complex dynamic processes of framing, attention shifts and agenda setting, commonly known as ‘spin’. We further provide new evidence for the divergence in party discipline in U.S. politics.