Query: An evolutionary tic-tac-toe player

Relevant passages:
Evolving neural networks to play checkers without relying on expert knowledge <=SEP=> 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.

Verifying Anaconda's expert rating by competing against Chinook: experiments in co-evolving a neural checkers player <=SEP=> 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.

Decentralized Decision Making in the Game of Tic-tac-toe <=SEP=> 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

A self-learning evolutionary chess program <=SEP=> 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.

Machine learning - an artificial intelligence approach <=SEP=> 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.

Implementing the Chinese Wall Security Model in Workflow Management Systems <=SEP=> 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.

Filter Bank Common Spatial Pattern (FBCSP) in Brain-Computer Interface <=SEP=> 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.

Coping with child sexual abuse among college students and post-traumatic stress disorder: the role of continuity of abuse and relationship with the perpetrator. <=SEP=> 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.

An approch for monitoring and smart planning of urban solid waste management using smart-M3 platform <=SEP=> 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.

A systemic and cognitive view on collaborative knowledge building with wikis <=SEP=> 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.

Evolutionary algorithms for multiobjective optimization: methods and applications <=SEP=> 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,

Wearable Glove-Type Driver Stress Detection Using a Motion Sensor <=SEP=> 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.

The Role of Mental Health Professionals in Gender Reassignment Surgeries: Unjust Discrimination or Responsible Care? <=SEP=> 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 .

Semantics and service technologies for the automatic generation of online MCQ tests <=SEP=> 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.

Solving traveling salesman problems via artificial intelligent search techniques <=SEP=> 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

Profanity in media associated with attitudes and behavior regarding profanity use and aggression. <=SEP=> 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.

Conjunctive representations in learning and memory: principles of cortical and hippocampal function. <=SEP=> 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.

Estimation of Detection Thresholds for Redirected Walking Techniques <=SEP=> 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.

Managing and Mining Graph Data <=SEP=> 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.

Story Cloze Ending Selection Baselines and Data Examination <=SEP=> 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.

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. <=SEP=> 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.

Best practices for missing data management in counseling psychology. <=SEP=> 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.

Dynamic Impact of Online Word-of-Mouth and Advertising on Supply Chain Performance <=SEP=> 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.

Genetic heritability and shared environmental factors among twin pairs with autism. <=SEP=> 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.

A least-squares approach to anomaly detection in static and sequential data <=SEP=> 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.

Online Social Network Dependency: Theoretical Development and Testing of Competing Models <=SEP=> 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.

Map API - scalable decentralized map building for robots <=SEP=> 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.

AMR-to-text Generation with Synchronous Node Replacement Grammar <=SEP=> 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.

PHD: A Probabilistic Model of Hybrid Deep Collaborative Filtering for Recommender Systems <=SEP=> 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.

Compositional dynamic test generation <=SEP=> 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.