Query: Evolving Problems to Learn About Particle Swarm Optimizers and Other Search Algorithms

Relevant passages:
Differential Evolution-A simple and efficient adaptive scheme for global optimization over continuous spaces by <=SEP=> A new heuristic approach for minimizing possibly nonlinear and non differentiable continuous space functions is presented. By means of an extensive testbed, which includes the De Jong functions, it will be demonstrated that the new method converges faster and with more certainty than Adaptive Simulated Annealing as well as the Annealed Nelder&Mead approach, both of which have a reputation for being very powerful. The new method requires few control variables, is robust, easy to use and lends itself very well to parallel computation. ________________________________________ 1)International Computer Science Institute, 1947 Center Street, Berkeley, CA 94704-1198, Suite 600, Fax: 510-643-7684. E-mail: storn@icsi.berkeley.edu. On leave from Siemens AG, ZFE T SN 2, OttoHahn-Ring 6, D-81739 Muenchen, Germany. Fax: 01149-636-44577, Email:rainer.storn@zfe.siemens.de. 2)836 Owl Circle, Vacaville, CA 95687, kprice@solano.community.net.

Comprehensive learning particle swarm optimizer for global optimization of multimodal functions <=SEP=> This paper presents a variant of particle swarm optimizers (PSOs) that we call the comprehensive learning particle swarm optimizer (CLPSO), which uses a novel learning strategy whereby all other particles' historical best information is used to update a particle's velocity. This strategy enables the diversity of the swarm to be preserved to discourage premature convergence. Experiments were conducted (using codes available from http://www.ntu.edu.sg/home/epnsugan) on multimodal test functions such as Rosenbrock, Griewank, Rastrigin, Ackley, and Schwefel and composition functions both with and without coordinate rotation. The results demonstrate good performance of the CLPSO in solving multimodal problems when compared with eight other recent variants of the PSO.

Hybrid Particle Swarm Optimiser with breeding and subpopulations <=SEP=> In this paper we present two hybrid Particle Swarm Optimisers combining the idea of the particle swarm with concepts from Evolutionary Algorithms. The hybrid PSOs combine the traditional velocity and position update rules with the ideas of breeding and subpopulations. Both hybrid models were tested and compared with the standard PSO and standard GA models. This is done to illustrate that PSOs with breeding strategies have the potential to achieve faster convergence and the potential to find a better solution. The objective of this paper is to describe how to make the hybrids benefit from genetic methods and to test their potential and competetiveness on function optimisation.

The particle swarm - explosion, stability, and convergence in a multidimensional complex space <=SEP=> The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though the algorithm, which is based on a metaphor of social interaction, has been shown to perform well, researchers have not adequately explained how it works. Further, traditional versions of the algorithm have had some undesirable dynamical properties, notably the particles’ velocities needed to be limited in order to control their trajectories. The present paper analyzes a particle’s trajectory as it moves in discrete time (the algebraic view), then progresses to the view of it in continuous time (the analytical view). A five-dimensional depiction is developed, which describes the system completely. These analyses lead to a generalized model of the algorithm, containing a set of coefficients to control the system’s convergence tendencies. Some results of the particle swarm optimizer, implementing modifications derived from the analysis, suggest methods for altering the original algorithm in ways that eliminate problems and increase the ability of the particle swarm to find optima of some well-studied test functions.

Simulated annealing: Practice versus theory <=SEP=> Simulated annealing (SA) presents an optimization technique with several striking positive and negative features. Perhaps its most salient feature, statistically promising to deliver an optimal solution, in current practice is often spurned to use instead modified faster algorithms, “simulated quenching” (SQ). Using the author’s Adaptive Simulated Annealing (ASA) code, some examples are given which demonstrate how SQ can be much faster than SA without sacrificing accuracy.

Deep Image Segmentation by Quality Inference <=SEP=> Traditionally, convolutional neural networks are trained for semantic segmentation by having an image given as input and the segmented mask as output. In this work, we propose a neural network trained by being given an image and mask pair, with the output being the quality of that pairing. The segmentation is then created afterwards through backpropagation on the mask. This allows enriching training with semi-supervised synthetic variations on the ground-truth. The proposed iterative segmentation technique allows improving an existing segmentation or creating one from scratch. We compare the performance of the proposed methodology with state-of-the-art deep architectures for image segmentation and achieve competitive results, being able to improve their segmentations.

1 ACO Algorithms for the Traveling Salesman Problemy <=SEP=> Ant algorithms [18, 14, 19] are a recently developed, population-based approach which has been successfully applied to several NP-hard combinatorial optimization problems [6, 13, 17, 23, 34, 40, 49]. As the name suggests, ant algorithms have been inspired by the behavior of real ant colonies, in particular, by their foraging behavior. One of the main ideas of ant algorithms is the indirect communication of a colony of agents, called (artificial) ants, based on pheromone trails (pheromones are also used by real ants for communication). The (artificial) pheromone trails are a kind of distributed numeric information which is modified by the ants to reflect their experience while solving a particular problem. Recently, the Ant Colony Optimization (ACO) metaheuristic has been proposed which provides a unifying framework for most applications of ant algorithms [15, 16] to combinatorial optimization problems. In particular, all the ant algorithms applied to the TSP fit perfectly into the ACO meta-heuristic and, therefore, we will call these algorithms also ACO algorithms. The first ACO algorithm, called Ant System (AS) [18, 14, 19], has been applied to the Traveling Salesman Problem (TSP). Starting from Ant System, several improvements of the basic algorithm have been proposed [21, 22, 17, 51, 53, 7]. Typically, these improved algorithms have been tested again on the TSP. All these improved versions of AS have in common a stronger exploita-

Variational shape approximation <=SEP=> A method for concise, faithful approximation of complex 3D datasets is key to reducing the computational cost of graphics applications. Despite numerous applications ranging from geometry compression to reverse engineering, efficiently capturing the geometry of a surface remains a tedious task. In this paper, we present both theoretical and practical contributions that result in a novel and versatile framework for geometric approximation of surfaces. We depart from the usual strategy by casting shape approximation as a variational geometric partitioning problem. Using the concept of geometric proxies, we drive the distortion error down through repeated clustering of faces into best-fitting regions. Our approach is entirely discrete and error-driven, and does not require parameterization or local estimations of differential quantities. We also introduce a new metric based on normal deviation, and demonstrate its superior behavior at capturing anisotropy.

End-user feature labeling: Supervised and semi-supervised approaches based on locally-weighted logistic regression <=SEP=> When intelligent interfaces, such as intelligent desktop assistants, email classif iers, and recommender systems, customize themselves to a particular end user , such customizations can decrease productivity and increase frustration due to inacc urate predictions—especially in early stages when training data is limited. The end user can improve the learning algorithm by tediously labeling a substantial amoun t of additional training data, but this takes time and is too ad hoc to target a particular area of inaccuracy. To solve this problem, we propose new supervised and semi-supervised learning algorithms based on locally weighted logistic regression for feature labeling by end users , enabling them to point out which features are important for a class, rath er than provide new training instances. We first evaluate our algorithms against other feature labeling algorit hms under idealized conditions using feature labels generated by an oracle . In addition, another of our contributions is an evaluation of feature labeling algorithms under real world conditions using feature labels harvested from actual end users in our user study. Our user study is the first statistical user study for feature labeling invo lvi g a large number of end users (43 participants), all of whom have no background in machine learning. Our supervised and semi-supervised algorithms were among the best perfo rmers when compared to other feature labeling algorithms in the idealized setting and they are also robust to poor quality feature labels provided by ordinary end u sers in our study. We also perform an analysis to investigate the relative gains of incorporatin g the different sources of knowledge available in the labeled training set, the feature labels and the unlabeled data. Together, our results strongly suggest that feature labeling by e d users is both viable and effective for allowing end users to improve the learnin g algorithm behind their customized applicati ons. * Corresponding author E-mail address: dassh@eecs.oregonstate.edu (Shubhomoy Das, 1148 Kelley Engineering Center, Corvallis, OR 97331-5501, USA, Ph: 1-541-908-6949). 1 Early versions of portions of this work appeared in [36, 37] S. Das, T. Moore, W-K. Wong et. al./Artificial Intelligence © 2012 Elsevier B.V. All rights reserved.

On the Kinematic Analysis of Robotic Mechanisms <=SEP=> The kinematic analyses, of manipulators and other robotic devices composed of mechanical links, usually depend on the solution of sets of nonlinear equations. There are a variety of both numerical and algebraic techniques available to solve such systems of equations and to give bounds on the number of solutions. These solution methods have also led to an understanding of how special choices of the various structural parameters of a mechanism influence the number of solutions inherent to the kinematic geometry of a given structure. In this paper, results from studying the kinematic geometry of such systems are reviewed, and the three most useful solution techniques are summarized. The solution techniques are polynomial continuation, Gröbner bases, and elimination. We then discuss the results that have been obtained with these techniques in the solution of two basic problems, namely, the inverse kinematics for serial-chain manipulators, and the direct kinematics of in-parallel platform devices. KEY WORDS—inverse kinematics, direct kinematics, manipulators, in-parallel manipulators, series manipulators, polynomial continuation, characteristic polynomial

The spread of alcohol consumption behavior in a large social network. <=SEP=> Context A person's alcohol use might mirror that of his or her social contacts. Contribution Using the same group of Framingham Heart Study participants who helped to define the associations between social networks and other health behaviors, the researchers found that alcohol use was similar among individuals in a social cluster. Furthermore, changes in a person's alcohol intake over time followed changes in the alcohol intake of their social contacts. Caution Alcohol use was self-reported, and the researchers did not have access to social contacts who were not participating in the study. Implication Changing alcohol use may require intervening with social groups as well as with individuals. The Editors Alcohol use is common in the United States. In 2002, 55% of adults reported having had at least 1 drink in the previous month, and the prevalence of past-month alcohol consumption was somewhat higher for men (62%) than for women (48%) (1). The lifetime prevalence of alcohol use disorders has been measured at 14.6% (1). Excessive alcohol use, either in the form of heavy drinking or binge drinking, increases the risk for numerous health and social problems (2, 3), and approximately 75000 deaths in 2001 were attributable to excessive alcohol use, which makes it the third-leading lifestyle-related cause of death (3). Alcohol consumption behavior has many determinants. Previous studies (3, 4) suggest that biological factors have a significant effect on the progression from experimentation to regular use and that social and cultural factors play a critical role in experimentation with alcohol and the development of drinking patterns over time. Given the social nature of this behavior, it is not surprising that previous work has identified interactions with friends and family members as key factors (48). Although this literature primarily focused on cross-sectional panels, some studies (68) have attempted to test whether social influences act over time. These studies, which focused on peer influence among college students, showed inconsistent results and tended to focus just on pairs of connected persons. The study of social influences on behavior has expanded in recent years to the study of networks of linked individuals over time (9). Recent work in this area has shown that various health-related phenomena, ranging from sexually transmitted diseases to obesity, smoking, and even suicide, may travel along and within social networks (1015). Using a longitudinal, dynamic network of 12067 persons, we analyzed the role of social networks in alcohol use, focusing on 1) whether clusters of heavy drinkers and abstainers existed within the network; 2) whether a person's alcohol consumption behavior was associated with that of his or her social contacts; 3) the extent to which such associations depended on the nature and direction of the social ties (for example, friends of different kinds, siblings, spouses, coworkers, or neighbors); and 4) whether gender affected the spread of alcohol consumption across social ties. Methods Source Data We used data from participants in the Framingham Heart Study (FHS). The FHS is a population-based, longitudinal, observational cohort study that was initiated in 1948 to prospectively investigate risk factors for cardiovascular disease. Four cohorts, who mostly represent different generations linked to an original cohort, are included in the entire FHS. Participant data, collected every 2 to 4 years, includes physical examinations, laboratory tests, noninvasive cardiac and vascular testing, battery testing (such as the Mini-Mental State Examination), questionnaire results, and basic demographic information. For our analyses, we aligned the examination waves for the original cohort with those of the second-generation offspring cohort, which allowed us to treat all participants as having been examined in 7 waves. The offspring cohort, initiated in 1971, is the source of our study's principals, or focal individuals in the network (16). However, we included other FHS participants whom the principals listed as social contacts and refer to them here as contacts. Therefore, even though principals come only from the offspring cohort, contacts are drawn from the entire set of both the original and offspring cohorts. To ascertain social network ties, we created a separate data set that linked individuals through self-described social ties, collected in each of the 7 waves of the study. We could then detect relationships between participants (for example, spouse, sibling, friend, coworker, or neighbor) and observe changes in these ties across time. Either party to a link between 2 people might identify his or her link to the other. This is most relevant to the friend link, which could exist if A nominated B or B nominated A as a friend. We also used complete records of participants' and their contacts' address in each wave since 1971 in our analyses, although we have no information about relationships that participants did not report. For each wave, we could determine who is whose neighbor and the geographic distance between persons (10, 17). Table 1 provides descriptive statistics for the 5124 principals in our sample. Table 1. Summary Statistics for Principals Measures Alcohol consumption was self-reported in all studied waves, with participants reporting their average number of drinks per week over the past year as well as the number of days within the past week during which they consumed alcohol (beer, wine, and liquor). Self-reported data are generally considered a valid and reliable source when assessing alcohol consumption, although recall measures, such as those used in this study, can be subject to recall bias from participants (18). We treated alcohol consumption as a continuous variable in some analyses (for example, number of drinks per day, calculated from participant responses) but conducted others with dichotomous cut-points, defining heavy drinkers as those who averaged more than 1 (for women) or 2 (for men) drinks per day; moderate drinkers as those whose alcohol consumption was less than the cutoff values for heavy drinkers; and abstainers as those who reported no alcohol consumption. We did not use self-reported number of days drinking in the past week as a measure in and of itself but rather as a means to calculate average number of drinks in a day. (These labels do not reflect clinical definitions of alcohol abuse or dependence.) Table 2 shows averages for the study population across time, including age, alcohol consumption, and percentages of abstainers and drinkers. Although the differences in how we measured heavy drinking made it difficult to compare our results with those for other population samples, the other averages for the mean-age groups in each year of the given waves are roughly similar to national averages of alcohol consumption behavior (1, 19, 20). Table 2. Average Age and Alcohol Consumption Behavior, by Examination Statistical Analysis Our first goal was to evaluate whether a person's alcohol consumption behavior was associated with that of his or her social network ties at various degrees of separation. To test this hypothesis, we took an observed clustering of persons (and their alcohol consumption behavior) within the whole network and compared them with 1000 simulated networks with the same topology and overall prevalence of drinking as the observed network, but with the incidence of drinking (for example, at least 1 drink per day) randomly distributed across the nodes (random drinking networks). If clustering occurs in drinking behavior, then the probability that a contact is a drinker given that a principal is a drinker should be higher in the observed network than in the random drinking networks (21). We used the KamadaKawai algorithm, which iteratively repositions nodes to reduce the number of ties that cross each other, to draw the networks (22). Our second goal was to examine the possible determinants of any clustering in alcohol consumption behavior. We considered 3 explanations for nonrandom clustering of alcohol consumption behavior in the network: principals might choose to associate with like contacts (homophily) (23, 24); principals and contacts might share attributes or jointly experience unobserved contemporaneous events that cause their alcohol consumption behavior to covary (omitted variables or confounding); and contacts might exert social influence or peer effects on principals (induction). The availability of dynamic, longitudinal data on both network connections and drinking behavior allowed us to distinguish between interpersonal induction of drinking and homophily (25). Our basic statistical approach involved specifying longitudinal logistic regression models in which a principal's drinking status at time t + 1 is a function of his or her various attributes, such as age, sex, and education; his or her drinking status at time t; and the drinking status of his or her contacts at times t and t + 1 (25). We used generalized estimating equation procedures to account for multiple observations of the same principal across both waves and principalcontact pairings (26). We assumed an independent working correlation structure for the clusters (27). By using a time-lagged dependent variable (lagged to the previous examination) for alcohol consumption, we eliminated serial correlation in the errors (28) (evaluated with a Lagrange multiplier test) and substantially controlled for the principal's genetic endowment and any intrinsic, stable predilection to drink. In addition, the lagged independent variable for a contact's drinking status substantially controlled for homophily (25, 29). The key variable of interest is a contact's alcohol consumption behavior at time t + 1. A significant coefficient on this variable would suggest either that a contact's drinking affects a principal's drinking or that a principal and a contact experience contemporaneous

Chapter 2 : Game Analytics – The Basics <=SEP=> Take Away Points:  Overview of important key terms in game analytics  Introduction to game telemetry as a source of business intelligence.  In-depth description and discussion of user-derived telemetry and metrics.  Introduction to feature selection in game analytics  Introduction to the knowledge discovery process in game analytics  References to essential further reading. 1 Analytics – a new industry paradigm Developing a profitable game in today's market is a challenging endeavor. Thousands of commercial titles are published yearly, across a number of hardware platforms and distribution channels, all competing for players' time and attention, and the game industry is decidedly competitive. In order to effectively develop games, a variety of tools and techniques from e.g. business practices, project management to user testing have been developed in the game industry, or adopted and adapted from other IT sectors. One of these methods is analytics, which in recent years has decidedly impacted the game industry and game research environment. Analytics is the process of discovering and communicating patterns in data, towards solving problems in business or conversely predictions for supporting enterprise decision management, driving action and/or improving performance. The meth-odological foundations for analytics are statistics, data mining, mathematics, programming and operations research, as well as data visualization in order to communicate insights learned to the relevant stakeholders. Analytics is not just the querying and reporting of BI data, but rests on actual analysis, e.g. statistical analysis, predic-tive modeling, optimization, forecasting, etc. (Davenport and Harris, 2007). Analytics typically relies on computational modeling. There are several branches or domains of analytics, e.g. marketing analytics, risk analytics, web analytics – and game analytics. Importantly, analytics is not the same thing as data analysis. Analytics is an umbrella term, covering the entire methodology of finding and communicating patterns in data, whereas analysis is used for individual applied instances, e.g. running

[POSTER] Realtime Shape-from-Template: System and Applications <=SEP=> An important yet unsolved problem in computer vision and Augmented Reality (AR) is to compute the 3D shape of nonrigid objects from live 2D videos. When the object's shape is provided in a rest pose, this is the Shape-from-Template (SfT) problem. Previous realtime SfT methods require simple, smooth templates, such as flat sheets of paper that are densely textured, and which deform in simple, smooth ways. We present a realtime SfT framework that handles generic template meshes, complex deformations and most of the difficulties present in real imaging conditions. Achieving this has required new, fast solutions to the two core sub-problems: robust registration and 3D shape inference. Registration is achieved with what we call Deformable Render-based Block Matching (DRBM): a highly-parallel solution which densely matches a time-varying render of the object to each video frame. We then combine matches from DRBM with physical deformation priors and perform shape inference, which is done by quickly solving a sparse linear system with a Geometric Multi-Grid (GMG)-based method. On a standard PC we achieve up to 21fps depending on the object. Source code will be released.

Building an Intrusion Detection System Using a Filter-Based Feature Selection Algorithm <=SEP=> Redundant and irrelevant features in data have caused a long-term problem in network traffic classification. These features not only slow down the process of classification but also prevent a classifier from making accurate decisions, especially when coping with big data. In this paper, we propose a mutual information based algorithm that analytically selects the optimal feature for classification. This mutual information based feature selection algorithm can handle linearly and nonlinearly dependent data features. Its effectiveness is evaluated in the cases of network intrusion detection. An Intrusion Detection System (IDS), named Least Square Support Vector Machine based IDS (LSSVM-IDS), is built using the features selected by our proposed feature selection algorithm. The performance of LSSVM-IDS is evaluated using three intrusion detection evaluation datasets, namely KDD Cup 99, NSL-KDD and Kyoto 2006+ dataset. The evaluation results show that our feature selection algorithm contributes more critical features for LSSVM-IDS to achieve better accuracy and lower computational cost compared with the state-of-the-art methods.

Small form factor PIFA antenna design at 28 GHz for 5G applications <=SEP=> This paper presents the design and analysis of lowest form factor planar inverted-F Antenna at 28GHz for 5G Mobile applications. Feeding and shorting of the antenna is done using metallic strips. The Important properties of this antenna are its small footprint (0.25λg), good gain of 4.5dBi, 10dB impedance bandwidth of 1.55 GHz and radiation efficiency of 94%. The total size of the PIFA antenna is 0.25λg. PIFA antenna is one of the antennas whose performance greatly depends on ground plane size and its position on the ground plane. It shows good radiation pattern when placed at the corner or edge.

Amharic-English Speech Translation in Tourism Domain <=SEP=> This paper describes speech translation from Amharic-to-English, particularly Automatic Speech Recognition (ASR) with post-editing feature and AmharicEnglish Statistical Machine Translation (SMT). ASR experiment is conducted using morpheme language model (LM) and phoneme acoustic model (AM). Likewise, SMT conducted using word and morpheme as unit. Morpheme based translation shows a 6.29 BLEU score at a 76.4% of recognition accuracy while word based translation shows a 12.83 BLEU score using 77.4% word recognition accuracy. Further, after post-edit on Amharic ASR using corpus based n-gram, the word recognition accuracy increased by 1.42%. Since post-edit approach reduces error propagation, the word based translation accuracy improved by 0.25 (1.95%) BLEU score. We are now working towards further improving propagated errors through different algorithms at each unit of speech translation cascading component.

Optimal management of shoulder impingement syndrome <=SEP=> Shoulder impingement is a progressive orthopedic condition that occurs as a result of altered biomechanics and/or structural abnormalities. An effective nonoperative treatment for impingement syndrome is aimed at addressing the underlying causative factor or factors that are identified after a complete and thorough evaluation. The clinician devises an effective rehabilitation program to regain full glenohumeral range of motion, reestablish dynamic rotator cuff stability, and implement a progression of resistive exercises to fully restore strength and local muscular endurance in the rotator cuff and scapular stabilizers. The clinician can introduce stresses and forces via sport-specific drills and functional activities to allow a return to activity.

Usefulness of altmetrics for measuring the broader impact of research: A case study using data from PLOS and F1000Prime <=SEP=> Purpose: The present case study investigates the usefulness of altmetrics for measuring the broad impact of research. Methods: This case study is based on a sample of 1,082 PLOS (the Public Library of Science) journal articles recommended in F1000. The dataset includes altmetrics which were provided by PLOS. The F1000 dataset contains tags on papers which were assigned by experts to characterise them. Findings: Results from the Facebook and Twitter models show higher predicted numbers of counts for "good for teaching" papers than for those papers where the tag is not set. Further model estimations show that saves by Mendeley users are particularly to be expected when a paper introduces a new practical/ theoretical technique (tag: "technical advance"). The tag "New finding" is statistically significant in the model with which the Facebook counts are evaluated. Conclusions: The "good for teaching" is assigned to papers which could be of interest to a wider circle of readers than the peers in a specialized area. Thus, the results of the current study indicate that Facebook and Twitter, but not Figshare or Mendeley, might provide an indication of which papers are of interest to a broader circle of readers (and not only for the peers in a specialist area), and could therefore be useful for the measurement of the social impact of research.

Introduction of the automated assessment of homework assignments in a university-level programming course <=SEP=> Modern teaching paradigms promote active student participation, encouraging teachers to adapt the teaching process to involve more practical work. In the introductory programming course at the Faculty of Computer and Information Science, University of Ljubljana, Slovenia, homework assignments contribute approximately one half to the total grade, requiring a significant investment of time and human resources in the assessment process. This problem was alleviated by the automated assessment of homework assignments. In this paper, we introduce an automated assessment system for programming assignments that includes dynamic testing of student programs, plagiarism detection, and a proper presentation of the results. We share our experience and compare the introduced system with the manual assessment approach used before.

Sediment quality criteria in use around the world <=SEP=> There have been numerous sediment quality guidelines (SQGs) developed during the past 20 years to assist regulators in dealing with contaminated sediments. Unfortunately, most of these have been developed in North America. Traditionally, sediment contamination was determined by assessing the bulk chemical concentrations of individual compounds and often comparing them with background or reference values. Since the 1980s, SQGs have attempted to incorporate biological effects in their derivation approach. These approaches can be categorized as empirical, frequency-based approaches to establish the relationship between sediment contamination and toxic response, and theoretically based approaches that attempt to account for differences in bioavailability through equilibrium partitioning (EqP) (i.e., using organic carbon or acid volatile sulfides). Some of these guidelines have been adopted by various regulatory agencies in several countries and are being used as cleanup goals in remediation activities and to identify priority polluted sites. The original SQGs, which compared bulk chemical concentrations to a reference or to background, provided little insight into the ecosystem impact of sediment contaminants. Therefore, SQGs for individual chemicals were developed that relied on field sediment chemistry paired with field or laboratory-based biological effects data. Although some SQGs have been found to be relatively good predictors of significant site contamination, they also have several limitations. False positive and false negative predictions are frequently in the 20% to 30% range for many chemicals and higher for others. The guidelines are chemical specific and do not establish causality where chemical mixtures occur. Equilibrium-based guidelines do not consider sediment ingestion as an exposure route. The guidelines do not consider spatial and temporal variability, and they may not apply in dynamic or larger-grained sediments. Finally, sediment chemistry and bioavailability are easily altered by sampling and subsequent manipulation processes, and therefore, measured SQGs may not reflect in situ conditions. All the assessment tools provide useful information, but some (such as SQGs, laboratory toxicity and bioaccumulation, and benthic indices) are prone to misinterpretation without the availability of specific in situ exposure and effects data. SQGs should be used only in a “screening” manner or in a “weight-of-evidence” approach. Aquatic ecosystems (including sediments) must be assessed in a “holistic” manner in which multiple components are assessed (e.g., habitat, hydrodynamics, resident biota, toxicity, and physicochemistry, including SQGs) by using integrated approaches.

Mapping science through bibliometric triangulation: An experimental approach applied to water research <=SEP=> The idea of constructing science maps based on bibliographic data has intrigued researchers for decades, and various techniques have been developed to map the structure of research disciplines. Most science mapping studies use a single method. However, as research fields have various properties, a valid map of a field should actually be composed of a set of maps derived from a series of investigations using different methods. That leads to the question what can be learned from a combination – triangulation – of these different science maps. In this paper, we propose a method for triangulation, using the example of water science. We combine three different mapping approaches: journal-journal citation relations (JJCR), shared author keywords (SAK), and title word-cited reference co-occurrence (TWRC). Our results demonstrate that triangulation of JJCR, SAK, and TWRC produces a more comprehensive picture than each method does individually. The outcomes from the three different approaches are associated with each other and can be systematically interpreted, and provide insights into the complex multidisciplinary structure of the field of water

Iterative Document Representation Learning Towards Summarization with Polishing <=SEP=> In this paper, we introduce Iterative Text Summarization (ITS), an iteration-based model for supervised extractive text summarization, inspired by the observation that it is often necessary for a human to read an article multiple times in order to fully understand and summarize its contents. Current summarization approaches read through a document only once to generate a document representation, resulting in a sub-optimal representation. To address this issue we introduce a model which iteratively polishes the document representation on many passes through the document. As part of our model, we also introduce a selective reading mechanism that decides more accurately the extent to which each sentence in the model should be updated. Experimental results on the CNN/DailyMail and DUC2002 datasets demonstrate that our model significantly outperforms state-of-the-art extractive systems when evaluated by machines and by humans.

TouchIn: Sightless two-factor authentication on multi-touch mobile devices <=SEP=> Mobile authentication is indispensable for preventing unauthorized access to multi-touch mobile devices. Existing mobile authentication techniques are often cumbersome to use and also vulnerable to shoulder-surfing and smudge attacks. This paper focuses on designing, implementing, and evaluating TouchIn, a two-factor authentication system on multi-touch mobile devices. TouchIn works by letting a user draw on the touchscreen with one or multiple fingers to unlock his mobile device, and the user is authenticated based on the geometric properties of his drawn curves as well as his behavioral and physiological characteristics. TouchIn allows the user to draw on arbitrary regions on the touchscreen without looking at it. This nice sightless feature makes TouchIn very easy to use and also robust to shoulder-surfing and smudge attacks. Comprehensive experiments on Android devices confirm the high security and usability of TouchIn.

Understanding and Using Patterns in Software Development <=SEP=> Patterns have shown to be an effective means of capturing and communicating software design experience. However, there is more to patterns than software design patterns: We believe that patterns work for software development on several levels. In this paper we explore what we have come to understand as crucial aspects of the pattern concept, relate patterns to the different models built during software design, discuss pattern forms and how we think that patterns can form larger wholes like pattern handbooks.

Korean pop takes off! Social media strategy of Korean entertainment industry <=SEP=> The Korean Wave (K-wave), or Hallyu, referred as “the phenomenon of Korean pop culture, such as TV dramas, films, pop music, fashion, and online games being widely embraced and shared among the people of Japan, China, Hong Kong, Taiwan, and other Asian countries”. After the drama-oriented craze of the first K-wave, Korean pop music (shortly K-pop) took the integral part of the second K-wave. In addition, with the rapid spread of social media like YouTube and Twitter, K-pop has expanded its fandom outside of Asia to the West. The world-wide success of K-pop contributes to improve the `Korea' image and make a positive impact on Korean economy. It is reported that around 1,000 entertainment agencies are active in Korea, while there exist the “big three” record labels and entertainment agencies: SM Entertainment, YG Entertainment and JYP Entertainment. In this case, we address the world-wide phenomenon of K-pop popularity and the role of social media on recent boom of K-pop. Focusing the major agencies above, we present lessons on how to manage social media strategically: align strategic business model with social media; maximize various social media channels; engage customers with on-and offline promotions; and stimulate audience with exclusive contents.

Performance Evaluation of Channel Decoding with Deep Neural Networks <=SEP=> With the demand of high data rate and low latency in fifth generation (5G), deep neural network decoder (NND) has become a promising candidate due to its capability of one-shot decoding and parallel computing. In this paper, three types of NND, i.e., multi-layer perceptron (MLP), convolution neural network (CNN) and recurrent neural network (RNN), are proposed with the same parameter magnitude. The performance of these deep neural networks are evaluated through extensive simulation. Numerical results show that RNN has the best decoding performance, yet at the price of the highest computational overhead. Moreover, we find there exists a saturation length for each type of neural network, which is caused by their restricted learning abilities.

Impact Analysis of Flow Shaping in Ethernet-AVB/TSN and AFDX from Network Calculus and Simulation Perspective <=SEP=> Ethernet-AVB/TSN (Audio Video Bridging/Time-Sensitive Networking) and AFDX (Avionics Full DupleX switched Ethernet) are switched Ethernet technologies, which are both candidates for real-time communication in the context of transportation systems. AFDX implements a fixed priority scheduling strategy with two priority levels. Ethernet-AVB/TSN supports a similar fixed priority scheduling with an additional Credit-Based Shaper (CBS) mechanism. Besides, TSN can support time-triggered scheduling strategy. One direct effect of CBS mechanism is to increase the delay of its flows while decreasing the delay of other priority ones. The former effect can be seen as the shaping restriction and the latter effect can be seen as the shaping benefit from CBS. The goal of this paper is to investigate the impact of CBS on different priority flows, especially on the intermediate priority ones, as well as the effect of CBS bandwidth allocation. It is based on a performance comparison of AVB/TSN and AFDX by simulation in an automotive case study. Furthermore, the shaping benefit is modeled based on integral operation from network calculus perspective. Combing with the analysis of shaping restriction and shaping benefit, some configuration suggestions on the setting of CBS bandwidth are given. Results show that the effect of CBS depends on flow loads and CBS configurations. A larger load of high priority flows in AVB tends to a better performance for the intermediate priority flows when compared with AFDX. Shaping benefit can be explained and calculated according to the changing from the permitted maximum burst.

The empathic brain: how, when and why? <=SEP=> Recent imaging results suggest that individuals automatically share the emotions of others when exposed to their emotions. We question the assumption of the automaticity and propose a contextual approach, suggesting several modulatory factors that might influence empathic brain responses. Contextual appraisal could occur early in emotional cue evaluation, which then might or might not lead to an empathic brain response, or not until after an empathic brain response is automatically elicited. We propose two major roles for empathy; its epistemological role is to provide information about the future actions of other people, and important environmental properties. Its social role is to serve as the origin of the motivation for cooperative and prosocial behavior, as well as help for effective social communication.

Marine animal classification using UMSLI in HBOI optical test facility <=SEP=> Environmental monitoring is a critical aspect of marine renewable energy project success. A new system called Unobtrusive Multistatic Serial LiDAR Imager (UMSLI) has been prepared to capture and classify marine life interaction with electrical generation equipment. We present both hardware and software innovations of the UMSLI system. Underwater marine animal imagery has been captured for the first time using red laser diode serial LiDAR, which has advantages over conventional optical cameras in many areas. Moreover, given the scarcity of existing underwater LiDAR data, a shape matching based classification algorithm is proposed which requires few training data. On top of applying shape descriptors, the algorithm also adopts information theoretical learning based affine shape registration, improving point correspondences found by shape descriptors as well as the final similarity measure. Within Florida Atlantic University’s Harbor Branch Oceanographic Institute optical test facility, experimental LiDAR data are collected through the front end of the UMSLI prototype, on which the classification algorithm is validated.

“The Internet is a Mask”: High School Students' Suggestions for Preventing Cyberbullying <=SEP=> INTRODUCTION
Interactions through technology have an important impact on today's youth. While some of these interactions are positive, there are concerns regarding students engaging in negative interactions like cyberbullying behaviors and the negative impact these behaviors have on others. The purpose of the current study was to explore participant suggestions for both students and adults for preventing cyberbullying incidents.


METHODS
Forty high school students participated in individual, semi-structured interviews. Participant experiences and perceptions were coded using constant comparative methods to illustrate ways in which students and adults may prevent cyberbullying from occurring within their school and community.


RESULTS
Students reported that peers would benefit from increasing online security, as well as becoming more aware of their cyber-surroundings. Regarding adult-provided prevention services, participants often discussed that there is little adults can do to reduce cyberbullying. Reasons included the difficulties in restricting online behaviors or providing effective consequences. However, some students did discuss the use of in-school curricula while suggesting that adults blame people rather than technology as potential ways to prevent cyberbullying.


CONCLUSION
Findings from the current study indicate some potential ways to improve adult efforts to prevent cyberbullying. These strategies include parent/teacher training in technology and cyberbullying, interventions focused more on student behavior than technology restriction, and helping students increase their online safety and awareness.