WorldWideScience

Sample records for modeling multi-robot search

  1. Multi-Robot Search for a Moving Target: Integrating World Modeling, Task Assignment and Context

    Science.gov (United States)

    2016-12-01

    Gemignani1, Daniele Nardi1 Abstract— In this paper, we address coordination within a team of cooperative autonomous robots that need to accomplish a common... cooperate to achieve a common goal. During the last years, the approaches to Multi-Robot Systems have been noticed and categorized in different survey...the environment). To highlight how our contribution compares to existing approaches, we categorize existing works on Fig. 2 by con - sidering their

  2. Multi-robot Task Allocation for Search and Rescue Missions

    International Nuclear Information System (INIS)

    Hussein, Ahmed; Adel, Mohamed; Bakr, Mohamed; Shehata, Omar M; Khamis, Alaa

    2014-01-01

    Many researchers from academia and industry are attracted to investigate how to design and develop robust versatile multi-robot systems by solving a number of challenging and complex problems such as task allocation, group formation, self-organization and much more. In this study, the problem of multi-robot task allocation (MRTA) is tackled. MRTA is the problem of optimally allocating a set of tasks to a group of robots to optimize the overall system performance while being subjected to a set of constraints. A generic market-based approach is proposed in this paper to solve this problem. The efficacy of the proposed approach is quantitatively evaluated through simulation and real experimentation using heterogeneous Khepera-III mobile robots. The results from both simulation and experimentation indicate the high performance of the proposed algorithms and their applicability in search and rescue missions

  3. Multi-Robot, Multi-Target Particle Swarm Optimization Search in Noisy Wireless Environments

    Energy Technology Data Exchange (ETDEWEB)

    Kurt Derr; Milos Manic

    2009-05-01

    Multiple small robots (swarms) can work together using Particle Swarm Optimization (PSO) to perform tasks that are difficult or impossible for a single robot to accomplish. The problem considered in this paper is exploration of an unknown environment with the goal of finding a target(s) at an unknown location(s) using multiple small mobile robots. This work demonstrates the use of a distributed PSO algorithm with a novel adaptive RSS weighting factor to guide robots for locating target(s) in high risk environments. The approach was developed and analyzed on multiple robot single and multiple target search. The approach was further enhanced by the multi-robot-multi-target search in noisy environments. The experimental results demonstrated how the availability of radio frequency signal can significantly affect robot search time to reach a target.

  4. Cooperative Multi-robot Patrolling: A study of distributed approaches based on mathematical models of game theory to protect infrastructures

    OpenAIRE

    Hernandez Serrato, Erik

    2015-01-01

    El principio de Teoría de Juegos permite desarrollar modelos estocásticos de patrullaje multi-robot para proteger infraestructuras criticas. La protección de infraestructuras criticas representa un gran reto para los países al rededor del mundo, principalmente después de los ataques terroristas llevados a cabo la década pasada. En este documento el termino infraestructura hace referencia a aeropuertos, plantas nucleares u otros instalaciones. El problema de patrullaje se define como la activi...

  5. Multi-robot caravanning

    KAUST Repository

    Denny, Jory

    2013-11-01

    We study multi-robot caravanning, which is loosely defined as the problem of a heterogeneous team of robots visiting specific areas of an environment (waypoints) as a group. After formally defining this problem, we propose a novel solution that requires minimal communication and scales with the number of waypoints and robots. Our approach restricts explicit communication and coordination to occur only when robots reach waypoints, and relies on implicit coordination when moving between a given pair of waypoints. At the heart of our algorithm is the use of leader election to efficiently exploit the unique environmental knowledge available to each robot in order to plan paths for the group, which makes it general enough to work with robots that have heterogeneous representations of the environment. We implement our approach both in simulation and on a physical platform, and characterize the performance of the approach under various scenarios. We demonstrate that our approach can successfully be used to combine the planning capabilities of different agents. © 2013 IEEE.

  6. Multi-Robot Item Delivery and Foraging: Two Sides of a Coin

    Directory of Open Access Journals (Sweden)

    Somchaya Liemhetcharat

    2015-09-01

    Full Text Available Multi-robot foraging has been widely studied in the literature, and the general assumption is that the robots are simple, i.e., with limited processing and carrying capacity. We previously studied continuous foraging with slightly more capable robots, and in this article, we are interested in using similar robots for item delivery. Interestingly, item delivery and foraging are two sides of the same coin: foraging an item from a location is similar to satisfying a demand. We formally define the multi-robot item delivery problem and show that the continuous foraging problem is a special case of it. We contribute distributed multi-robot algorithms that solve the item delivery and foraging problems and describe how our shared world model is synchronized across the multi-robot team. We performed extensive experiments on simulated robots using a Java simulator, and we present our results to demonstrate that we outperform benchmark algorithms from multi-robot foraging.

  7. Multi-Robot Remote Interaction with FS-MAS

    Directory of Open Access Journals (Sweden)

    Yunliang Jiang

    2013-02-01

    Full Text Available The need to reduce bandwidth, improve productivity, autonomy and the scalability in multi-robot teleoperation has been recognized for a long time. In this article we propose a novel finite state machine mobile agent based on the network interaction service model, namely FS-MAS. This model consists of three finite state machines, namely the Finite State Mobile Agent (FS-Agent, which is the basic service module. The Service Content Finite State Machine (Content-FS, using the XML language to define workflow, to describe service content and service computation process. The Mobile Agent computation model Finite State Machine (MACM-FS, used to describe the service implementation. Finally, we apply this service model to the multi-robot system, the initial realization completing complex tasks in the form of multi-robot scheduling. This demonstrates that the robot has greatly improved intelligence, and provides a wide solution space for critical issues such as task division, rational and efficient use of resource and multi-robot collaboration.

  8. Multi-robot control interface

    Science.gov (United States)

    Bruemmer, David J [Idaho Falls, ID; Walton, Miles C [Idaho Falls, ID

    2011-12-06

    Methods and systems for controlling a plurality of robots through a single user interface include at least one robot display window for each of the plurality of robots with the at least one robot display window illustrating one or more conditions of a respective one of the plurality of robots. The user interface further includes at least one robot control window for each of the plurality of robots with the at least one robot control window configured to receive one or more commands for sending to the respective one of the plurality of robots. The user interface further includes a multi-robot common window comprised of information received from each of the plurality of robots.

  9. On Open- source Multi-robot simulators

    CSIR Research Space (South Africa)

    Namoshe, M

    2008-07-01

    Full Text Available Open source software simulators play a major role in robotics design and research as platforms for developing, testing and improving architectures, concepts and algorithms for cooperative/multi-robot systems. Simulation environment enables control...

  10. Multi-Robot Assembly Strategies and Metrics

    Science.gov (United States)

    MARVEL, JEREMY A.; BOSTELMAN, ROGER; FALCO, JOE

    2018-01-01

    We present a survey of multi-robot assembly applications and methods and describe trends and general insights into the multi-robot assembly problem for industrial applications. We focus on fixtureless assembly strategies featuring two or more robotic systems. Such robotic systems include industrial robot arms, dexterous robotic hands, and autonomous mobile platforms, such as automated guided vehicles. In this survey, we identify the types of assemblies that are enabled by utilizing multiple robots, the algorithms that synchronize the motions of the robots to complete the assembly operations, and the metrics used to assess the quality and performance of the assemblies. PMID:29497234

  11. Multi-Robot Assembly Strategies and Metrics.

    Science.gov (United States)

    Marvel, Jeremy A; Bostelman, Roger; Falco, Joe

    2018-02-01

    We present a survey of multi-robot assembly applications and methods and describe trends and general insights into the multi-robot assembly problem for industrial applications. We focus on fixtureless assembly strategies featuring two or more robotic systems. Such robotic systems include industrial robot arms, dexterous robotic hands, and autonomous mobile platforms, such as automated guided vehicles. In this survey, we identify the types of assemblies that are enabled by utilizing multiple robots, the algorithms that synchronize the motions of the robots to complete the assembly operations, and the metrics used to assess the quality and performance of the assemblies.

  12. Cognitive Coordination for Cooperative Multi-Robot Teamwork

    NARCIS (Netherlands)

    Wei, C.

    2015-01-01

    Multi-robot teams have potential advantages over a single robot. Robots in a team can serve different functionalities, so a team of robots can be more efficient, robust and reliable than a single robot. In this dissertation, we are in particular interested in human level intelligent multi-robot

  13. Towards Coordination and Control of Multi-robot Systems

    DEFF Research Database (Denmark)

    Quottrup, Michael Melholt

    This thesis focuses on control and coordination of mobile multi-robot systems (MRS). MRS can often deal with tasks that are difficult to be accomplished by a single robot. One of the challenges is the need to control, coordinate and synchronize the operation of several robots to perform some...... specified task. This calls for new strategies and methods which allow the desired system behavior to be specified in a formal and succinct way. Two different frameworks for the coordination and control of MRS have been investigated. Framework I - A network of robots is modeled as a network of multi...... a requirement specification in Computational Tree Logic (CTL) for a network of robots. The result is a set of motion plans for the robots which satisfy the specification. Framework II - A framework for controller synthesis for a single robot with respect to requirement specification in Linear-time Temporal...

  14. A proposal toward a possibilistic multi-robot task allocation

    Energy Technology Data Exchange (ETDEWEB)

    Guerrero, J.

    2017-07-01

    One of the main problems to solve in multi-agent (or multi-robot) systems is to select the best robot or group of robots to carry out a specific task. This problem, referenced as Multi-Agent (robot) task allocation (MRTA), is still an open issue in real environments. Swarm intelligence methods provide very simple solutions for the MRTA problem. One of the most widely used swarm methods are the so-called Response Threshold algorithms, where the behavior of the systems is modeled as a Markov chain and the robots in each time step select the next task to execute according to a transition probability function. Among other factors, this probability depends on a stimulus (for example the distance between the robot and the task). This classical probabilistic approach presents a lot of disadvantages:the transition function must meet constraints of a probabilistic distribution, the system only convergences to a stationary asymptotically, and so on. In order to overcome these problems, a new theoretical framework based on fuzzy (possibilistic) Markov chains was proposed [2]. As was proved, the possibilistic Markov chains outperform the classical probabilistic when a Max-Min algebra is considered for matrix composition. For example, fuzzy Markov chains convergence to a stable state in a finite number of steps 10 times faster than its probability counter part. Moreover, they improve the predictions of the system under imprecise information. Firstly, this paper will review relevant work in MRTA, from theoretical and experimental point of view. Then it will be summarized the aforementioned recent advances given toward a new possibilistic swarm multi-robot task allocation framework. It will be seen how the possibilistic Markov chains behave when other algebras are considered for matrix composition [1] and how the possibility transition function impacts on the system's performance [3]. Finally, it will be proposed new future works in this field. (Author)

  15. A proposal toward a possibilistic multi-robot task allocation

    International Nuclear Information System (INIS)

    Guerrero, J.

    2017-01-01

    One of the main problems to solve in multi-agent (or multi-robot) systems is to select the best robot or group of robots to carry out a specific task. This problem, referenced as Multi-Agent (robot) task allocation (MRTA), is still an open issue in real environments. Swarm intelligence methods provide very simple solutions for the MRTA problem. One of the most widely used swarm methods are the so-called Response Threshold algorithms, where the behavior of the systems is modeled as a Markov chain and the robots in each time step select the next task to execute according to a transition probability function. Among other factors, this probability depends on a stimulus (for example the distance between the robot and the task). This classical probabilistic approach presents a lot of disadvantages:the transition function must meet constraints of a probabilistic distribution, the system only convergences to a stationary asymptotically, and so on. In order to overcome these problems, a new theoretical framework based on fuzzy (possibilistic) Markov chains was proposed [2]. As was proved, the possibilistic Markov chains outperform the classical probabilistic when a Max-Min algebra is considered for matrix composition. For example, fuzzy Markov chains convergence to a stable state in a finite number of steps 10 times faster than its probability counter part. Moreover, they improve the predictions of the system under imprecise information. Firstly, this paper will review relevant work in MRTA, from theoretical and experimental point of view. Then it will be summarized the aforementioned recent advances given toward a new possibilistic swarm multi-robot task allocation framework. It will be seen how the possibilistic Markov chains behave when other algebras are considered for matrix composition [1] and how the possibility transition function impacts on the system's performance [3]. Finally, it will be proposed new future works in this field. (Author)

  16. Rendezvous with connectivity preservation for multi-robot systems with an unknown leader

    Science.gov (United States)

    Dong, Yi

    2018-02-01

    This paper studies the leader-following rendezvous problem with connectivity preservation for multi-agent systems composed of uncertain multi-robot systems subject to external disturbances and an unknown leader, both of which are generated by a so-called exosystem with parametric uncertainty. By combining internal model design, potential function technique and adaptive control, two distributed control strategies are proposed to maintain the connectivity of the communication network, to achieve the asymptotic tracking of all the followers to the output of the unknown leader system, as well as to reject unknown external disturbances. It is also worth to mention that the uncertain parameters in the multi-robot systems and exosystem are further allowed to belong to unknown and unbounded sets when applying the second fully distributed control law containing a dynamic gain inspired by high-gain adaptive control or self-tuning regulator.

  17. Multi-robot Cooperation Behavior Decision Based on Psychological Values

    Directory of Open Access Journals (Sweden)

    Jian JIANG

    2014-01-01

    Full Text Available The method based on psychology concept has been proved to be a successful tool used for human-robot interaction. But its related research in multi-robot cooperation has remained scarce until recent studies. To solve the problem, a decision-making mechanism based on psychological values is presented to be regarded as the basis of the multi-robot cooperation. Robots give birth to psychological values based on the estimations of environment, teammates and themselves. The mapping relationship between psychological values and cooperation tendency threshold values is set up with artificial neural network. Robots can make decision on the bases of these threshold values in cooperation scenes. Experiments show that the multi-robot cooperation method presented in the paper not only can ensure the rationality of robots’ decision-making, but also can ensure the speediness of robots’ decision-making.

  18. Interacting with Multi-Robot Systems Using BML

    Science.gov (United States)

    2013-06-01

    presented to the operator. 1. Introduction There are many operations in which a multi-robot system (MRS) can be deployed to support the human forces...within the MRS easily. © Fraunhofer FKIE Communication Architecture ~ ~ Fraunhofer FKIE © Fraunhofer FKIE Battle Mangement Language BML...Fraunhofer FKIE Battle Mangement Language Orders Orders move patrol observe distribute guard recce imagery intelligence gathering

  19. Scalable Task Assignment for Heterogeneous Multi-Robot Teams

    Directory of Open Access Journals (Sweden)

    Paula García

    2013-02-01

    Full Text Available This work deals with the development of a dynamic task assignment strategy for heterogeneous multi-robot teams in typical real world scenarios. The strategy must be efficiently scalable to support problems of increasing complexity with minimum designer intervention. To this end, we have selected a very simple auction-based strategy, which has been implemented and analysed in a multi-robot cleaning problem that requires strong coordination and dynamic complex subtask organization. We will show that the selection of a simple auction strategy provides a linear computational cost increase with the number of robots that make up the team and allows the solving of highly complex assignment problems in dynamic conditions by means of a hierarchical sub-auction policy. To coordinate and control the team, a layered behaviour-based architecture has been applied that allows the reusing of the auction-based strategy to achieve different coordination levels.

  20. Distributed consensus with visual perception in multi-robot systems

    CERN Document Server

    Montijano, Eduardo

    2015-01-01

    This monograph introduces novel responses to the different problems that arise when multiple robots need to execute a task in cooperation, each robot in the team having a monocular camera as its primary input sensor. Its central proposition is that a consistent perception of the world is crucial for the good development of any multi-robot application. The text focuses on the high-level problem of cooperative perception by a multi-robot system: the idea that, depending on what each robot sees and its current situation, it will need to communicate these things to its fellows whenever possible to share what it has found and keep updated by them in its turn. However, in any realistic scenario, distributed solutions to this problem are not trivial and need to be addressed from as many angles as possible. Distributed Consensus with Visual Perception in Multi-Robot Systems covers a variety of related topics such as: ·         distributed consensus algorithms; ·         data association and robustne...

  1. Research status of multi - robot systems task allocation and uncertainty treatment

    Science.gov (United States)

    Li, Dahui; Fan, Qi; Dai, Xuefeng

    2017-08-01

    The multi-robot coordination algorithm has become a hot research topic in the field of robotics in recent years. It has a wide range of applications and good application prospects. This paper analyzes and summarizes the current research status of multi-robot coordination algorithms at home and abroad. From task allocation and dealing with uncertainty, this paper discusses the multi-robot coordination algorithm and presents the advantages and disadvantages of each method commonly used.

  2. A Spatial Queuing-Based Algorithm for Multi-Robot Task Allocation

    Directory of Open Access Journals (Sweden)

    William Lenagh

    2015-08-01

    Full Text Available Multi-robot task allocation (MRTA is an important area of research in autonomous multi-robot systems. The main problem in MRTA is to allocate a set of tasks to a set of robots so that the tasks can be completed by the robots while ensuring that a certain metric, such as the time required to complete all tasks, or the distance traveled, or the energy expended by the robots is reduced. We consider a scenario where tasks can appear dynamically and a task needs to be performed by multiple robots to be completed. We propose a new algorithm called SQ-MRTA (Spatial Queueing-MRTA that uses a spatial queue-based model to allocate tasks between robots in a distributed manner. We have implemented the SQ-MRTA algorithm on accurately simulated models of Corobot robots within the Webots simulator for different numbers of robots and tasks and compared its performance with other state-of-the-art MRTA algorithms. Our results show that the SQ-MRTA algorithm is able to scale up with the number of tasks and robots in the environment, and it either outperforms or performs comparably with respect to other distributed MRTA algorithms.

  3. Cooperative multi-robot observation of multiple moving targets

    International Nuclear Information System (INIS)

    Parker, L.E.; Emmons, B.A.

    1997-01-01

    An important issue that arises in the automation of many security, surveillance, and reconnaissance tasks is that of monitoring, or observing, the movements of targets navigating in a bounded area of interest. A key research issue in these problems is that of sensor placement--determining where sensors should be located to maintain the targets in view. In complex applications of this type, the use of multiple sensors dynamically moving over time is required. In this paper, the authors investigate the sue of a cooperative team of autonomous sensor-based robots for multi-robot observation of multiple moving targets. They focus primarily on developing the distributed control strategies that allow the robot team to attempt to maximize the collective tie during which each object is being observed by at least one robot in the area of interest. The initial efforts in this problem address the aspects of distributed control in homogeneous robot teams with equivalent sensing and movement capabilities working in an uncluttered, bounded area. This paper first formalizes the problem, discusses related work, and then shows that this problem is NP-hard. They then present a distributed approximate approach to solving this problem that combines low-level multi-robot control with higher-level control

  4. Multi-robot team design for real-world applications

    Energy Technology Data Exchange (ETDEWEB)

    Parker, L.E.

    1996-10-01

    Many of these applications are in dynamic environments requiring capabilities distributed in functionality, space, or time, and therefore often require teams of robots to work together. While much research has been done in recent years, current robotics technology is still far from achieving many of the real world applications. Two primary reasons for this technology gap are that (1) previous work has not adequately addressed the issues of fault tolerance and adaptivity in multi-robot teams, and (2) existing robotics research is often geared at specific applications and is not easily generalized to different, but related, applications. This paper addresses these issues by first describing the design issues of key importance in these real-world cooperative robotics applications: fault tolerance, reliability, adaptivity, and coherence. We then present a general architecture addressing these design issues (called ALLIANCE) that facilities multi-robot cooperation of small- to medium-sized teams in dynamic environments, performing missions composed of loosely coupled subtasks. We illustrate an implementation of ALLIANCE in a real-world application, called Bounding Overwatch, and then discuss how this architecture addresses our key design issues.

  5. IMPERA: Integrated Mission Planning for Multi-Robot Systems

    Directory of Open Access Journals (Sweden)

    Daniel Saur

    2015-10-01

    Full Text Available This paper presents the results of the project IMPERA (Integrated Mission Planning for Distributed Robot Systems. The goal of IMPERA was to realize an extraterrestrial exploration scenario using a heterogeneous multi-robot system. The main challenge was the development of a multi-robot planning and plan execution architecture. The robot team consists of three heterogeneous robots, which have to explore an unknown environment and collect lunar drill samples. The team activities are described using the language ALICA (A Language for Interactive Agents. Furthermore, we use the mission planning system pRoPhEt MAS (Reactive Planning Engine for Multi-Agent Systems to provide an intuitive interface to generate team activities. Therefore, we define the basic skills of our team with ALICA and define the desired goal states by using a logic description. Based on the skills, pRoPhEt MAS creates a valid ALICA plan, which will be executed by the team. The paper describes the basic components for communication, coordinated exploration, perception and object transportation. Finally, we evaluate the planning engine pRoPhEt MAS in the IMPERA scenario. In addition, we present further evaluation of pRoPhEt MAS in more dynamic environments.

  6. Towards Real-Time Distributed Planning in Multi-Robot Systems

    KAUST Repository

    Abdelkader, Mohamed

    2018-04-01

    Recently, there has been an increasing interest in robotics related to multi-robot applications. Such systems can be involved in several tasks such as collaborative search and rescue, aerial transportation, surveillance, and monitoring, to name a few. There are two possible architectures for the autonomous control of multi-robot systems. In the centralized architecture, a master controller communicates with all the robots to collect information. It uses this information to make decisions for the entire system and then sends commands to each robot. In contrast, in the distributed architecture, each robot makes its own decision independent from a central authority. While distributed architecture is a more portable solution, it comes at the expense of extensive information exchange (communication). The extensive communication between robots can result in decision delays because of which distributed architecture is often impractical for systems with strict real-time constraints, e.g. when decisions have to be taken in the order of milliseconds. In this thesis, we propose a distributed framework that strikes a balance between limited communicated information and reasonable system-wide performance while running in real-time. We implement the proposed approach in a game setting of two competing teams of drones, defenders and attackers. Defending drones execute a proposed linear program algorithm (using only onboard computing modules) to obstruct attackers from infiltrating a defense zone while having minimal local message passing. Another main contribution is that we developed a realistic simulation environment as well as lab and outdoor hardware setups of customized drones for testing the system in realistic scenarios. Our software is completely open-source and fully integrated with the well-known Robot Operating System (ROS) in hopes to make our work easily reproducible and for rapid future improvements.

  7. A Search Model of Discouragement

    DEFF Research Database (Denmark)

    Rosholm, Michael; Toomet, Ott

    Discouragement is a process occurring during an unemployment spell. As the spell prolongs, an individual gradually realises that the returns to search can no longer outweigh search costs, and hence she may eventually leave the labour force. This is analysed theoretically in a framework...... of unemployed search. We construct a search model, which is stationary from the point of view of the individual, but which has nonstationary features. Namely, the unemployed worker is occasionally hit by shocks leading to a decline in job offer arrival rates. These shocks can be due to stigmatisation...... or to psychological consequences of unemployement affecting search effectiveness. This model enables us to analyse the issue of discouragement, as the returns to search will gradually decline. Even so, the model is actually stationary from the point of view of the individual, which implies that many interesting...

  8. COMPARISON OF CLASSICAL AND INTERACTIVE MULTI-ROBOT EXPLORATION STRATEGIES IN POPULATED ENVIRONMENTS

    Directory of Open Access Journals (Sweden)

    Nassim Kalde

    2015-06-01

    Full Text Available Multi-robot exploration consists in coordinating robots for mapping an unknown environment. It raises several issues concerning task allocation, robot control, path planning and communication. We study exploration in populated environments, in which pedestrian flows can severely impact performances. However, humans have adaptive skills for taking advantage of these flows while moving. Therefore, in order to exploit these human abilities, we propose a novel exploration strategy that explicitly allows for human-robot interactions. Our model for exploration in populated environments combines the classical frontier-based strategy with our interactive approach. We implement interactions where robots can locally choose a human guide to follow and define a parametric heuristic to balance interaction and frontier assignments. Finally, we evaluate to which extent human presence impacts our exploration model in terms of coverage ratio, travelled distance and elapsed time to completion.

  9. Multi-robot system using low-cost infrared sensors

    Directory of Open Access Journals (Sweden)

    Anubhav Kakkar

    2013-03-01

    Full Text Available This paper presents a proposed set of the novel technique, methods, and algorithm for simultaneous path planning, area exploration, area retrieval, obstacle avoidance, object detection, and object retrieval   autonomously by a multi-robot system. The proposed methods and algorithms are built considering the use of low cost infrared sensors with the ultimate function of efficiently exploring the given unknown area and simultaneously identifying desired objects by analyzing the physical characteristics of several of the objects that come across during exploration. In this paper, we have explained the scenario by building a coordinative multi-robot system consisting of two autonomously operated robots equipped with low-cost and low-range infrared sensors to perform the assigned task by analyzing some of the sudden changes in their environment. Along with identifying and retrieving the desired object, the proposed methodology also provide an inclusive analysis of the area being explored. The novelties presented in the paper may significantly provide a cost-effective solution to the problem of area exploration and finding a known object in an unknown environment by demonstrating an innovative approach of using the infrared sensors instead of high cost long range sensors and cameras. Additionally, the methodology provides a speedy and uncomplicated method of traversing a complicated arena while performing all the necessary and inter-related tasks of avoiding the obstacles, analyzing the area as well as objects, and reconstructing the area using all these information collected and interpreted for an unknown environment. The methods and algorithms proposed are simulated over a complex arena to depict the operations and manually tested over a physical environment which provided 78% correct results with respect to various complex parameters set randomly.

  10. Dynamical Behavior of Multi-Robot Systems Using Lattice Gas Automata

    Energy Technology Data Exchange (ETDEWEB)

    Cameron, S.M.; Robinett, R.; Stantz, K.M.; Trahan, M.W.; Wagner, J.S.

    1999-03-11

    Recent attention has been given to the deployment of an adaptable sensor array realized by multi-robotic systems. Our group has been studying the collective behavior of autonomous, multi-agent systems and their applications in the area of remote-sensing and emerging threats. To accomplish such tasks, an interdisciplinary research effort at Sandia National Laboratories are conducting tests in the fields of sensor technology, robotics, and multi-robotic and multi-agents architectures. Our goal is to coordinate a constellation of point sensors that optimizes spatial coverage and multivariate signal analysis using unmanned robotic vehicles (e.g., RATLERs, Robotic All-ten-sin Lunar Exploration Rover-class vehicles). Overall design methodology is to evolve complex collective behaviors realized through simple interaction (kinetic) physics and artificial intelligence to enable real-time operational responses to emerging threats. This paper focuses on our recent work understanding the dynamics of many-body systems using the physics-based hydrodynamic model of lattice gas automata. Three design features are investigated. One, for single-speed robots, a hexagonal nearest-neighbor interaction topology is necessary to preserve standard hydrodynamic flow. Two, adaptability, defined by the swarm's deformation rate, can be controlled through the hydrodynamic viscosity term, which, in turn, is defined by the local robotic interaction rules. Three, due to the inherent non-linearity of the dynamical equations describing large ensembles, development of stability criteria ensuring convergence to equilibrium states is developed by scaling information flow rates relative to a swarm's hydrodynamic flow rate. An initial test case simulates a swarm of twenty-five robots that maneuvers past an obstacle while following a moving target. A genetic algorithm optimizes applied nearest-neighbor forces in each of five spatial regions distributed over the simulation domain. Armed with

  11. L-ALLIANCE: a mechanism for adaptive action selection in heterogeneous multi-robot teams

    Energy Technology Data Exchange (ETDEWEB)

    Parker, L.E.

    1995-11-01

    In practical applications of robotics, it is usually quite difficult, if not impossible, for the system designer to fully predict the environmental states in which the robots will operate. The complexity of the problem is further increased when dealing with teams of robots which themselves may be incompletely known and characterized in advance. It is thus highly desirable for robot teams to be able to adapt their performance during the mission due to changes in the environment, or to changes in other robot team members. In previous work, we introduced a behavior-based mechanism called the ALLIANCE architecture -- that facilitates the fault tolerant cooperative control of multi-robot teams. However, this previous work did not address the issue of how to dynamically update the control parameters during a mission to adapt to ongoing changes in the environment or in the robot team, and to ensure the efficiency of the collective team actions. In this paper, we address this issue by proposing the L-ALLIANCE mechanism, which defines an automated method whereby robots can use knowledge learned from previous experience to continually improve their collective action selection when working on missions composed of loosely coupled, discrete subtasks. This ability to dynamically update robotic control parameters provides a number of distinct advantages: it alleviates the need for human tuning of control parameters, it facilitates the use of custom-designed multi-robot teams for any given application, it improves the efficiency of the mission performance, and It allows robots to continually adapt their performance over time due to changes in the robot team and/or the environment. We describe the L-ALLIANCE mechanism, present the results of various alternative update strategies we investigated, present the formal model of the L-ALLIANCE mechanism, and present the results of a simple proof of concept implementation on a small team of heterogeneous mobile robots.

  12. Scheduling with Group Dynamics: a Multi-Robot Task Allocation Algorithm based on Vacancy Chains

    National Research Council Canada - National Science Library

    Dahl, Torbjorn S; Mataric, Maja J; Sukhatme, Gaurav S

    2002-01-01

    .... We present a multi-robot task allocation algorithm that is sensitive to group dynamics. Our algorithm is based on vacancy chains, a resource distribution process common in human and animal societies...

  13. The Control Based on Internal Average Kinetic Energy in Complex Environment for Multi-robot System

    Science.gov (United States)

    Yang, Mao; Tian, Yantao; Yin, Xianghua

    In this paper, reference trajectory is designed according to minimum energy consumed for multi-robot system, which nonlinear programming and cubic spline interpolation are adopted. The control strategy is composed of two levels, which lower-level is simple PD control and the upper-level is based on the internal average kinetic energy for multi-robot system in the complex environment with velocity damping. Simulation tests verify the effectiveness of this control strategy.

  14. Multi-Robot Systems in Military Domains (Les Systemes Multi-Robots Dans les Domaines Militaires)

    Science.gov (United States)

    2008-12-01

    IST-032 Middleware G-6 Object Request Brokers (ORBs) G-8 DCOM G-10 CORBA G-11 Java RMI G-14 Java RMI-IIOP G-16 Jini G-16 Comparison... hibernating since 2003 but might be continued in the future. 2.4.3 USA The RTG would like to thank Alan C. Schulz from the NRL (the US...messages, threads, synchronisation, timer). • Language (C,C++, Java , ...) and programming model (OO, binary model-COM, CORBA, DCOM). At the higher

  15. Multi-robot motion control for cooperative observation

    International Nuclear Information System (INIS)

    Parker, L.E.

    1997-01-01

    An important issue that arises in the automation of many security, surveillance, and reconnaissance tasks is that of monitoring (or observing) the movements of targets navigating in a bounded area of interest. A key research issue in these problems is that of sensor placement--determining where sensors should be located to maintain the targets in view. In complex applications involving limited-range sensors, the use of multiple sensors dynamically moving over time is required. In this paper, the authors investigate the use of a cooperative team of autonomous sensor-based robots for the observation of multiple moving targets. They focus primarily on developing the distributed control strategies that allow the robot team to attempt to minimize the total time in which targets escape observation by some robot team member in the area of interest. This paper first formalizes the problem and discusses related work. The authors then present a distributed approximate approach to solving this problem that combines low-level multi-robot control with higher-level reasoning control based on the ALLIANCE formalism. They analyze the effectiveness of the approach by comparing it to 3 other feasible algorithms for cooperative control, showing the superiority of the approach for a large class of problems

  16. Multi-robot motion control for cooperative observation

    Energy Technology Data Exchange (ETDEWEB)

    Parker, L.E. [Oak Ridge National Lab., TN (United States). Center for Engineering Systems Advanced Research

    1997-06-01

    An important issue that arises in the automation of many security, surveillance, and reconnaissance tasks is that of monitoring (or observing) the movements of targets navigating in a bounded area of interest. A key research issue in these problems is that of sensor placement--determining where sensors should be located to maintain the targets in view. In complex applications involving limited-range sensors, the use of multiple sensors dynamically moving over time is required. In this paper, the authors investigate the use of a cooperative team of autonomous sensor-based robots for the observation of multiple moving targets. They focus primarily on developing the distributed control strategies that allow the robot team to attempt to minimize the total time in which targets escape observation by some robot team member in the area of interest. This paper first formalizes the problem and discusses related work. The authors then present a distributed approximate approach to solving this problem that combines low-level multi-robot control with higher-level reasoning control based on the ALLIANCE formalism. They analyze the effectiveness of the approach by comparing it to 3 other feasible algorithms for cooperative control, showing the superiority of the approach for a large class of problems.

  17. Modified bug-1 algorithm based strategy for obstacle avoidance in multi robot system

    Directory of Open Access Journals (Sweden)

    Kandathil Jom J.

    2018-01-01

    Full Text Available One of the primary ability of an intelligent mobile robot system is obstacle avoidance. BUG algorithms are classic examples of the algorithms used for achieving obstacle avoidance. Unlike many other planning algorithms based on global knowledge, BUG algorithms assume only local knowledge of the environment and a global goal. Among the variations of the BUG algorithms that prevail, BUG-0, BUG-1 and BUG-2 are the more prominent versions. The exhaustive search algorithm present in BUG-1 makes it more reliable and safer for practical applications. Overall, this provides a more predictable and dependable performance. Hence, the essential focus in this paper is on implementing the BUG-1 algorithm across a group of robots to move them from a start location to a target location. The results are compared with the results from BUG-1 algorithm implemented on a single robot. The strategy developed in this work reduces the time involved in moving the robots from starting location to the target location. Further, the paper shows that the total distance covered by each robot in a multi robot-system is always lesser than or equal to that travelled by a single robot executing the same problem.

  18. A formation control strategy with coupling weights for the multi-robot system

    Science.gov (United States)

    Liang, Xudong; Wang, Siming; Li, Weijie

    2017-12-01

    The distributed formation problem of the multi-robot system with general linear dynamic characteristics and directed communication topology is discussed. In order to avoid that the multi-robot system can not maintain the desired formation in the complex communication environment, the distributed cooperative algorithm with coupling weights based on zipf distribution is designed. The asymptotic stability condition for the formation of the multi-robot system is given, and the theory of the graph and the Lyapunov theory are used to prove that the formation can converge to the desired geometry formation and the desired motion rules of the virtual leader under this condition. Nontrivial simulations are performed to validate the effectiveness of the distributed cooperative algorithm with coupling weights.

  19. A Novel Personalized Web Search Model

    Institute of Scientific and Technical Information of China (English)

    ZHU Zhengyu; XU Jingqiu; TIAN Yunyan; REN Xiang

    2007-01-01

    A novel personalized Web search model is proposed.The new system, as a middleware between a user and a Web search engine, is set up on the client machine. It can learn a user's preference implicitly and then generate the user profile automatically. When the user inputs query keywords, the system can automatically generate a few personalized expansion words by computing the term-term associations according to the current user profile, and then these words together with the query keywords are submitted to a popular search engine such as Yahoo or Google.These expansion words help to express accurately the user's search intention. The new Web search model can make a common search engine personalized, that is, the search engine can return different search results to different users who input the same keywords. The experimental results show the feasibility and applicability of the presented work.

  20. A New Approach of Multi-robot Cooperative Pursuit Based on Association Rule Data Mining

    Directory of Open Access Journals (Sweden)

    Jun Li

    2010-02-01

    Full Text Available An approach of cooperative hunting for multiple mobile targets by multi-robot is presented, which divides the pursuit process into forming the pursuit teams and capturing the targets. The data sets of attribute relationship is built by consulting all of factors about capturing evaders, then the interesting rules can be found by data mining from the data sets to build the pursuit teams. Through doping out the positions of targets, the pursuit game can be transformed into multi-robot path planning. Reinforcement learning is used to find the best path. The simulation results show that the mobile evaders can be captured effectively and efficiently, and prove the feasibility and validity of the given algorithm under a dynamic environment.

  1. A New Approach of Multi-Robot Cooperative Pursuit Based on Association Rule Data Mining

    Directory of Open Access Journals (Sweden)

    Jun Li

    2009-12-01

    Full Text Available An approach of cooperative hunting for multiple mobile targets by multi-robot is presented, which divides the pursuit process into forming the pursuit teams and capturing the targets. The data sets of attribute relationship is built by consulting all of factors about capturing evaders, then the interesting rules can be found by data mining from the data sets to build the pursuit teams. Through doping out the positions of targets, the pursuit game can be transformed into multi-robot path planning. Reinforcement learning is used to find the best path. The simulation results show that the mobile evaders can be captured effectively and efficiently, and prove the feasibility and validity of the given algorithm under a dynamic environment.

  2. Geometric Models for Collaborative Search and Filtering

    Science.gov (United States)

    Bitton, Ephrat

    2011-01-01

    This dissertation explores the use of geometric and graphical models for a variety of information search and filtering applications. These models serve to provide an intuitive understanding of the problem domains and as well as computational efficiencies to our solution approaches. We begin by considering a search and rescue scenario where both…

  3. The Talent Search Model of Gifted Identification

    Science.gov (United States)

    Assouline, Susan G.; Lupkowski-Shoplik, Ann

    2012-01-01

    The Talent Search model, founded at Johns Hopkins University by Dr. Julian C. Stanley, is fundamentally an above-level testing program. This simplistic description belies the enduring impact that the Talent Search model has had on the lives of hundreds of thousands of gifted students as well as their parents and teachers. In this article, we…

  4. Distributed Circumnavigation Control with Dynamic Spacings for a Heterogeneous Multi-robot System

    OpenAIRE

    Yao, Weijia; Luo, Sha; Lu, Huimin; Xiao, Junhao

    2018-01-01

    Circumnavigation control is useful in real-world applications such as entrapping a hostile target. In this paper, we consider a heterogeneous multi-robot system where robots have different physical properties, such as maximum movement speeds. Instead of equal-spacings, dynamic spacings according to robots' properties, which are termed utilities in this paper, will be more desirable in a scenario such as target entrapment. A distributed circumnavigation control algorithm based on utilities is ...

  5. Multi-Robot Interfaces and Operator Situational Awareness: Study of the Impact of Immersion and Prediction

    Science.gov (United States)

    Peña-Tapia, Elena; Martín-Barrio, Andrés; Olivares-Méndez, Miguel A.

    2017-01-01

    Multi-robot missions are a challenge for operators in terms of workload and situational awareness. These operators have to receive data from the robots, extract information, understand the situation properly, make decisions, generate the adequate commands, and send them to the robots. The consequences of excessive workload and lack of awareness can vary from inefficiencies to accidents. This work focuses on the study of future operator interfaces of multi-robot systems, taking into account relevant issues such as multimodal interactions, immersive devices, predictive capabilities and adaptive displays. Specifically, four interfaces have been designed and developed: a conventional, a predictive conventional, a virtual reality and a predictive virtual reality interface. The four interfaces have been validated by the performance of twenty-four operators that supervised eight multi-robot missions of fire surveillance and extinguishing. The results of the workload and situational awareness tests show that virtual reality improves the situational awareness without increasing the workload of operators, whereas the effects of predictive components are not significant and depend on their implementation. PMID:28749407

  6. Heterogeneous Multi-Robot System for Mapping Environmental Variables of Greenhouses.

    Science.gov (United States)

    Roldán, Juan Jesús; Garcia-Aunon, Pablo; Garzón, Mario; de León, Jorge; Del Cerro, Jaime; Barrientos, Antonio

    2016-07-01

    The productivity of greenhouses highly depends on the environmental conditions of crops, such as temperature and humidity. The control and monitoring might need large sensor networks, and as a consequence, mobile sensory systems might be a more suitable solution. This paper describes the application of a heterogeneous robot team to monitor environmental variables of greenhouses. The multi-robot system includes both ground and aerial vehicles, looking to provide flexibility and improve performance. The multi-robot sensory system measures the temperature, humidity, luminosity and carbon dioxide concentration in the ground and at different heights. Nevertheless, these measurements can be complemented with other ones (e.g., the concentration of various gases or images of crops) without a considerable effort. Additionally, this work addresses some relevant challenges of multi-robot sensory systems, such as the mission planning and task allocation, the guidance, navigation and control of robots in greenhouses and the coordination among ground and aerial vehicles. This work has an eminently practical approach, and therefore, the system has been extensively tested both in simulations and field experiments.

  7. Heterogeneous Multi-Robot System for Mapping Environmental Variables of Greenhouses

    Directory of Open Access Journals (Sweden)

    Juan Jesús Roldán

    2016-07-01

    Full Text Available The productivity of greenhouses highly depends on the environmental conditions of crops, such as temperature and humidity. The control and monitoring might need large sensor networks, and as a consequence, mobile sensory systems might be a more suitable solution. This paper describes the application of a heterogeneous robot team to monitor environmental variables of greenhouses. The multi-robot system includes both ground and aerial vehicles, looking to provide flexibility and improve performance. The multi-robot sensory system measures the temperature, humidity, luminosity and carbon dioxide concentration in the ground and at different heights. Nevertheless, these measurements can be complemented with other ones (e.g., the concentration of various gases or images of crops without a considerable effort. Additionally, this work addresses some relevant challenges of multi-robot sensory systems, such as the mission planning and task allocation, the guidance, navigation and control of robots in greenhouses and the coordination among ground and aerial vehicles. This work has an eminently practical approach, and therefore, the system has been extensively tested both in simulations and field experiments.

  8. Multi-Robot Interfaces and Operator Situational Awareness: Study of the Impact of Immersion and Prediction.

    Science.gov (United States)

    Roldán, Juan Jesús; Peña-Tapia, Elena; Martín-Barrio, Andrés; Olivares-Méndez, Miguel A; Del Cerro, Jaime; Barrientos, Antonio

    2017-07-27

    Multi-robot missions are a challenge for operators in terms of workload and situational awareness. These operators have to receive data from the robots, extract information, understand the situation properly, make decisions, generate the adequate commands, and send them to the robots. The consequences of excessive workload and lack of awareness can vary from inefficiencies to accidents. This work focuses on the study of future operator interfaces of multi-robot systems, taking into account relevant issues such as multimodal interactions, immersive devices, predictive capabilities and adaptive displays. Specifically, four interfaces have been designed and developed: a conventional, a predictive conventional, a virtual reality and a predictive virtual reality interface. The four interfaces have been validated by the performance of twenty-four operators that supervised eight multi-robot missions of fire surveillance and extinguishing. The results of the workload and situational awareness tests show that virtual reality improves the situational awareness without increasing the workload of operators, whereas the effects of predictive components are not significant and depend on their implementation.

  9. Multi-Robot Interfaces and Operator Situational Awareness: Study of the Impact of Immersion and Prediction

    Directory of Open Access Journals (Sweden)

    Juan Jesús Roldán

    2017-07-01

    Full Text Available Multi-robot missions are a challenge for operators in terms of workload and situational awareness. These operators have to receive data from the robots, extract information, understand the situation properly, make decisions, generate the adequate commands, and send them to the robots. The consequences of excessive workload and lack of awareness can vary from inefficiencies to accidents. This work focuses on the study of future operator interfaces of multi-robot systems, taking into account relevant issues such as multimodal interactions, immersive devices, predictive capabilities and adaptive displays. Specifically, four interfaces have been designed and developed: a conventional, a predictive conventional, a virtual reality and a predictive virtual reality interface. The four interfaces have been validated by the performance of twenty-four operators that supervised eight multi-robot missions of fire surveillance and extinguishing. The results of the workload and situational awareness tests show that virtual reality improves the situational awareness without increasing the workload of operators, whereas the effects of predictive components are not significant and depend on their implementation.

  10. Exploring Contextual Models in Chemical Patent Search

    Science.gov (United States)

    Urbain, Jay; Frieder, Ophir

    We explore the development of probabilistic retrieval models for integrating term statistics with entity search using multiple levels of document context to improve the performance of chemical patent search. A distributed indexing model was developed to enable efficient named entity search and aggregation of term statistics at multiple levels of patent structure including individual words, sentences, claims, descriptions, abstracts, and titles. The system can be scaled to an arbitrary number of compute instances in a cloud computing environment to support concurrent indexing and query processing operations on large patent collections.

  11. Genetic search feature selection for affective modeling

    DEFF Research Database (Denmark)

    Martínez, Héctor P.; Yannakakis, Georgios N.

    2010-01-01

    Automatic feature selection is a critical step towards the generation of successful computational models of affect. This paper presents a genetic search-based feature selection method which is developed as a global-search algorithm for improving the accuracy of the affective models built....... The method is tested and compared against sequential forward feature selection and random search in a dataset derived from a game survey experiment which contains bimodal input features (physiological and gameplay) and expressed pairwise preferences of affect. Results suggest that the proposed method...

  12. Simplified Models for LHC New Physics Searches

    International Nuclear Information System (INIS)

    Alves, Daniele; Arkani-Hamed, Nima; Arora, Sanjay; Bai, Yang; Baumgart, Matthew; Berger, Joshua; Butler, Bart; Chang, Spencer; Cheng, Hsin-Chia; Cheung, Clifford; Chivukula, R. Sekhar; Cho, Won Sang; Cotta, Randy; D'Alfonso, Mariarosaria; El Hedri, Sonia; Essig, Rouven; Fitzpatrick, Liam; Fox, Patrick; Franceschini, Roberto

    2012-01-01

    This document proposes a collection of simplified models relevant to the design of new-physics searches at the LHC and the characterization of their results. Both ATLAS and CMS have already presented some results in terms of simplified models, and we encourage them to continue and expand this effort, which supplements both signature-based results and benchmark model interpretations. A simplified model is defined by an effective Lagrangian describing the interactions of a small number of new particles. Simplified models can equally well be described by a small number of masses and cross-sections. These parameters are directly related to collider physics observables, making simplified models a particularly effective framework for evaluating searches and a useful starting point for characterizing positive signals of new physics. This document serves as an official summary of the results from the 'Topologies for Early LHC Searches' workshop, held at SLAC in September of 2010, the purpose of which was to develop a set of representative models that can be used to cover all relevant phase space in experimental searches. Particular emphasis is placed on searches relevant for the first ∼ 50-500 pb -1 of data and those motivated by supersymmetric models. This note largely summarizes material posted at http://lhcnewphysics.org/, which includes simplified model definitions, Monte Carlo material, and supporting contacts within the theory community. We also comment on future developments that may be useful as more data is gathered and analyzed by the experiments.

  13. Simplified Models for LHC New Physics Searches

    Energy Technology Data Exchange (ETDEWEB)

    Alves, Daniele; /SLAC; Arkani-Hamed, Nima; /Princeton, Inst. Advanced Study; Arora, Sanjay; /Rutgers U., Piscataway; Bai, Yang; /SLAC; Baumgart, Matthew; /Johns Hopkins U.; Berger, Joshua; /Cornell U., Phys. Dept.; Buckley, Matthew; /Fermilab; Butler, Bart; /SLAC; Chang, Spencer; /Oregon U. /UC, Davis; Cheng, Hsin-Chia; /UC, Davis; Cheung, Clifford; /UC, Berkeley; Chivukula, R.Sekhar; /Michigan State U.; Cho, Won Sang; /Tokyo U.; Cotta, Randy; /SLAC; D' Alfonso, Mariarosaria; /UC, Santa Barbara; El Hedri, Sonia; /SLAC; Essig, Rouven, (ed.); /SLAC; Evans, Jared A.; /UC, Davis; Fitzpatrick, Liam; /Boston U.; Fox, Patrick; /Fermilab; Franceschini, Roberto; /LPHE, Lausanne /Pittsburgh U. /Argonne /Northwestern U. /Rutgers U., Piscataway /Rutgers U., Piscataway /Carleton U. /CERN /UC, Davis /Wisconsin U., Madison /SLAC /SLAC /SLAC /Rutgers U., Piscataway /Syracuse U. /SLAC /SLAC /Boston U. /Rutgers U., Piscataway /Seoul Natl. U. /Tohoku U. /UC, Santa Barbara /Korea Inst. Advanced Study, Seoul /Harvard U., Phys. Dept. /Michigan U. /Wisconsin U., Madison /Princeton U. /UC, Santa Barbara /Wisconsin U., Madison /Michigan U. /UC, Davis /SUNY, Stony Brook /TRIUMF; /more authors..

    2012-06-01

    This document proposes a collection of simplified models relevant to the design of new-physics searches at the LHC and the characterization of their results. Both ATLAS and CMS have already presented some results in terms of simplified models, and we encourage them to continue and expand this effort, which supplements both signature-based results and benchmark model interpretations. A simplified model is defined by an effective Lagrangian describing the interactions of a small number of new particles. Simplified models can equally well be described by a small number of masses and cross-sections. These parameters are directly related to collider physics observables, making simplified models a particularly effective framework for evaluating searches and a useful starting point for characterizing positive signals of new physics. This document serves as an official summary of the results from the 'Topologies for Early LHC Searches' workshop, held at SLAC in September of 2010, the purpose of which was to develop a set of representative models that can be used to cover all relevant phase space in experimental searches. Particular emphasis is placed on searches relevant for the first {approx} 50-500 pb{sup -1} of data and those motivated by supersymmetric models. This note largely summarizes material posted at http://lhcnewphysics.org/, which includes simplified model definitions, Monte Carlo material, and supporting contacts within the theory community. We also comment on future developments that may be useful as more data is gathered and analyzed by the experiments.

  14. Multi-Robot Motion Planning: A Timed Automata Approach

    OpenAIRE

    Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh

    2004-01-01

    This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar grid. The automata formalism merely presents a high-level model of environment, robots and control, but allows composition and formal symbolic reasoning about coordinated solutions. Composition is achi...

  15. Simplified Models for LHC New Physics Searches

    CERN Document Server

    Alves, Daniele; Arora, Sanjay; Bai, Yang; Baumgart, Matthew; Berger, Joshua; Buckley, Matthew; Butler, Bart; Chang, Spencer; Cheng, Hsin-Chia; Cheung, Clifford; Chivukula, R.Sekhar; Cho, Won Sang; Cotta, Randy; D'Alfonso, Mariarosaria; El Hedri, Sonia; Essig, Rouven; Evans, Jared A.; Fitzpatrick, Liam; Fox, Patrick; Franceschini, Roberto; Freitas, Ayres; Gainer, James S.; Gershtein, Yuri; Gray, Richard; Gregoire, Thomas; Gripaios, Ben; Gunion, Jack; Han, Tao; Haas, Andy; Hansson, Per; Hewett, JoAnne; Hits, Dmitry; Hubisz, Jay; Izaguirre, Eder; Kaplan, Jared; Katz, Emanuel; Kilic, Can; Kim, Hyung-Do; Kitano, Ryuichiro; Koay, Sue Ann; Ko, Pyungwon; Krohn, David; Kuflik, Eric; Lewis, Ian; Lisanti, Mariangela; Liu, Tao; Liu, Zhen; Lu, Ran; Luty, Markus; Meade, Patrick; Morrissey, David; Mrenna, Stephen; Nojiri, Mihoko; Okui, Takemichi; Padhi, Sanjay; Papucci, Michele; Park, Michael; Park, Myeonghun; Perelstein, Maxim; Peskin, Michael; Phalen, Daniel; Rehermann, Keith; Rentala, Vikram; Roy, Tuhin; Ruderman, Joshua T.; Sanz, Veronica; Schmaltz, Martin; Schnetzer, Stephen; Schuster, Philip; Schwaller, Pedro; Schwartz, Matthew D.; Schwartzman, Ariel; Shao, Jing; Shelton, Jessie; Shih, David; Shu, Jing; Silverstein, Daniel; Simmons, Elizabeth; Somalwar, Sunil; Spannowsky, Michael; Spethmann, Christian; Strassler, Matthew; Su, Shufang; Tait, Tim; Thomas, Brooks; Thomas, Scott; Toro, Natalia; Volansky, Tomer; Wacker, Jay; Waltenberger, Wolfgang; Yavin, Itay; Yu, Felix; Zhao, Yue; Zurek, Kathryn

    2012-01-01

    This document proposes a collection of simplified models relevant to the design of new-physics searches at the LHC and the characterization of their results. Both ATLAS and CMS have already presented some results in terms of simplified models, and we encourage them to continue and expand this effort, which supplements both signature-based results and benchmark model interpretations. A simplified model is defined by an effective Lagrangian describing the interactions of a small number of new particles. Simplified models can equally well be described by a small number of masses and cross-sections. These parameters are directly related to collider physics observables, making simplified models a particularly effective framework for evaluating searches and a useful starting point for characterizing positive signals of new physics. This document serves as an official summary of the results from the "Topologies for Early LHC Searches" workshop, held at SLAC in September of 2010, the purpose of which was to develop a...

  16. Probabilistic Verification of Multi-Robot Missions in Uncertain Environments

    Science.gov (United States)

    2015-11-01

    has been used to measure the environment, including any dynamic obstacles. However, no matter how the model originates, this approach is based on...modeled as bivariate Gaussian distributions and estimated by calibration measurements . The Robot process model is described in prior work [13...sn〉 (pR,pE)(obR) = In〈pR〉〈p〉 ; In〈pE〉〈e〉 ; ( Gtr〈 d(p,e), sr〉〈p1〉 ; Out〈obR,p1〉 | Lte 〈 d(p,e), sr〉〈p2〉 ; Out〈obR, sn+p2 〉 ) ; Sensors

  17. Multi-Robot Motion Planning: A Timed Automata Approach

    DEFF Research Database (Denmark)

    Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh

    2004-01-01

    This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar...... grid. The automata formalism merely presents a high-level model of environment, robots and control, but allows composition and formal symbolic reasoning about coordinated solutions. Composition is achieved through synchronization, and the verification software UPPAAL is used for a symbolic verification...... then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research....

  18. Multi-Robot Motion Planning: A Timed Automata Approach

    DEFF Research Database (Denmark)

    Quottrup, Michael Melholt; Bak, Thomas; Izadi-Zamanabadi, Roozbeh

    This paper describes how a network of interacting timed automata can be used to model, analyze, and verify motion planning problems in a scenario with multiple robotic vehicles. The method presupposes an infra-structure of robots with feed-back controllers obeying simple restriction on a planar...... grid. The automata formalism merely presents a high-level model of environment, robots and control, but allows composition and formal symbolic reasoning about coordinated solutions. Composition is achieved through synchronization, and the verification software UPPAAL is used for a symbolic verification...... then subsequently be used as a high-level motion plan for the robots. This paper reports on the timed automata framework, results of two verification experiments, promise of the approach, and gives a perspective for future research....

  19. Automatic approach to stabilization and control for multi robot teams by multilayer network operator

    Directory of Open Access Journals (Sweden)

    Diveev Askhat

    2016-01-01

    Full Text Available The paper describes a novel methodology for synthesis a high-level control of autonomous multi robot teams. The approach is based on multilayer network operator method that belongs to a symbolic regression class. Synthesis is accomplished in three steps: stabilizing robots about some given position in a state space, finding optimal trajectories of robots’ motion as sets of stabilizing points and then approximating all the points of optimal trajectories by some multi-dimensional function of state variables. The feasibility and effectiveness of the proposed approach is verified on simulations of the task of control synthesis for three mobile robots parking in the constrained space.

  20. Motion Planning in Multi-robot Systems using Timed Automata

    DEFF Research Database (Denmark)

    Andersen, Michael. S.; Jensen, Rune S.; Bak, Thomas

    This paper dscribes how interacting timed automata can be used to model, analyze, and verify motion planning problems for systems with multiple mobile robots. The method assumes an infra-structure of simple unicycle type robots, moving om a planar grid. The motion of the robots, including simple...... kinematics, is captured in an automata formalism that allows formal composition and symbolic reasoning. The verification software UppAal is used to verify specification requirements formulated in computational tree logic (CTL), generating all feasible trajectories that satisfy specifications. The results...... of the planning are demonstrateted in a testbed that allows execution of the planned paths and motion primitives by synchronizing the planning results from UppAal with actual robotic vehicles. The planning problem may be modified online by moving obstacles in the physical environment, which causes a re...

  1. ALLIANCE: An architecture for fault tolerant multi-robot cooperation

    Energy Technology Data Exchange (ETDEWEB)

    Parker, L.E.

    1995-02-01

    ALLIANCE is a software architecture that facilitates the fault tolerant cooperative control of teams of heterogeneous mobile robots performing missions composed of loosely coupled, largely independent subtasks. ALLIANCE allows teams of robots, each of which possesses a variety of high-level functions that it can perform during a mission, to individually select appropriate actions throughout the mission based on the requirements of the mission, the activities of other robots, the current environmental conditions, and the robot`s own internal states. ALLIANCE is a fully distributed, behavior-based architecture that incorporates the use of mathematically modeled motivations (such as impatience and acquiescence) within each robot to achieve adaptive action selection. Since cooperative robotic teams usually work in dynamic and unpredictable environments, this software architecture allows the robot team members to respond robustly, reliably, flexibly, and coherently to unexpected environmental changes and modifications in the robot team that may occur due to mechanical failure, the learning of new skills, or the addition or removal of robots from the team by human intervention. The feasibility of this architecture is demonstrated in an implementation on a team of mobile robots performing a laboratory version of hazardous waste cleanup.

  2. ALLIANCE: An architecture for fault tolerant multi-robot cooperation

    International Nuclear Information System (INIS)

    Parker, L.E.

    1995-02-01

    ALLIANCE is a software architecture that facilitates the fault tolerant cooperative control of teams of heterogeneous mobile robots performing missions composed of loosely coupled, largely independent subtasks. ALLIANCE allows teams of robots, each of which possesses a variety of high-level functions that it can perform during a mission, to individually select appropriate actions throughout the mission based on the requirements of the mission, the activities of other robots, the current environmental conditions, and the robot's own internal states. ALLIANCE is a fully distributed, behavior-based architecture that incorporates the use of mathematically modeled motivations (such as impatience and acquiescence) within each robot to achieve adaptive action selection. Since cooperative robotic teams usually work in dynamic and unpredictable environments, this software architecture allows the robot team members to respond robustly, reliably, flexibly, and coherently to unexpected environmental changes and modifications in the robot team that may occur due to mechanical failure, the learning of new skills, or the addition or removal of robots from the team by human intervention. The feasibility of this architecture is demonstrated in an implementation on a team of mobile robots performing a laboratory version of hazardous waste cleanup

  3. Multi-robot task allocation based on two dimensional artificial fish swarm algorithm

    Science.gov (United States)

    Zheng, Taixiong; Li, Xueqin; Yang, Liangyi

    2007-12-01

    The problem of task allocation for multiple robots is to allocate more relative-tasks to less relative-robots so as to minimize the processing time of these tasks. In order to get optimal multi-robot task allocation scheme, a twodimensional artificial swarm algorithm based approach is proposed in this paper. In this approach, the normal artificial fish is extended to be two dimension artificial fish. In the two dimension artificial fish, each vector of primary artificial fish is extended to be an m-dimensional vector. Thus, each vector can express a group of tasks. By redefining the distance between artificial fish and the center of artificial fish, the behavior of two dimension fish is designed and the task allocation algorithm based on two dimension artificial swarm algorithm is put forward. At last, the proposed algorithm is applied to the problem of multi-robot task allocation and comparer with GA and SA based algorithm is done. Simulation and compare result shows the proposed algorithm is effective.

  4. Development of a Survivable Cloud Multi-Robot Framework for Heterogeneous Environments

    Directory of Open Access Journals (Sweden)

    Isaac Osunmakinde

    2014-10-01

    Full Text Available Cloud robotics is a paradigm that allows for robots to offload computationally intensive and data storage requirements into the cloud by providing a secure and customizable environment. The challenge for cloud robotics is the inherent problem of cloud disconnection. A major assumption made in the development of the current cloud robotics frameworks is that the connection between the cloud and the robot is always available. However, for multi-robots working in heterogeneous environments, the connection between the cloud and the robots cannot always be guaranteed. This work serves to assist with the challenge of disconnection in cloud robotics by proposing a survivable cloud multi-robotics (SCMR framework for heterogeneous environments. The SCMR framework leverages the combination of a virtual ad hoc network formed by robot-to-robot communication and a physical cloud infrastructure formed by robot-to-cloud communications. The quality of service (QoS on the SCMR framework was tested and validated by determining the optimal energy utilization and time of response (ToR on drivability analysis with and without cloud connection. The design trade-off, including the result, is between the computation energy for the robot execution and the offloading energy for the cloud execution.

  5. Accurate multi-robot targeting for keyhole neurosurgery based on external sensor monitoring.

    Science.gov (United States)

    Comparetti, Mirko Daniele; Vaccarella, Alberto; Dyagilev, Ilya; Shoham, Moshe; Ferrigno, Giancarlo; De Momi, Elena

    2012-05-01

    Robotics has recently been introduced in surgery to improve intervention accuracy, to reduce invasiveness and to allow new surgical procedures. In this framework, the ROBOCAST system is an optically surveyed multi-robot chain aimed at enhancing the accuracy of surgical probe insertion during keyhole neurosurgery procedures. The system encompasses three robots, connected as a multiple kinematic chain (serial and parallel), totalling 13 degrees of freedom, and it is used to automatically align the probe onto a desired planned trajectory. The probe is then inserted in the brain, towards the planned target, by means of a haptic interface. This paper presents a new iterative targeting approach to be used in surgical robotic navigation, where the multi-robot chain is used to align the surgical probe to the planned pose, and an external sensor is used to decrease the alignment errors. The iterative targeting was tested in an operating room environment using a skull phantom, and the targets were selected on magnetic resonance images. The proposed targeting procedure allows about 0.3 mm to be obtained as the residual median Euclidean distance between the planned and the desired targets, thus satisfying the surgical accuracy requirements (1 mm), due to the resolution of the diffused medical images. The performances proved to be independent of the robot optical sensor calibration accuracy.

  6. Towards Human-Friendly Efficient Control of Multi-Robot Teams

    Science.gov (United States)

    Stoica, Adrian; Theodoridis, Theodoros; Barrero, David F.; Hu, Huosheng; McDonald-Maiers, Klaus

    2013-01-01

    This paper explores means to increase efficiency in performing tasks with multi-robot teams, in the context of natural Human-Multi-Robot Interfaces (HMRI) for command and control. The motivating scenario is an emergency evacuation by a transport convoy of unmanned ground vehicles (UGVs) that have to traverse, in shortest time, an unknown terrain. In the experiments the operator commands, in minimal time, a group of rovers through a maze. The efficiency of performing such tasks depends on both, the levels of robots' autonomy, and the ability of the operator to command and control the team. The paper extends the classic framework of levels of autonomy (LOA), to levels/hierarchy of autonomy characteristic of Groups (G-LOA), and uses it to determine new strategies for control. An UGVoriented command language (UGVL) is defined, and a mapping is performed from the human-friendly gesture-based HMRI into the UGVL. The UGVL is used to control a team of 3 robots, exploring the efficiency of different G-LOA; specifically, by (a) controlling each robot individually through the maze, (b) controlling a leader and cloning its controls to followers, and (c) controlling the entire group. Not surprisingly, commands at increased G-LOA lead to a faster traverse, yet a number of aspects are worth discussing in this context.

  7. FRAMEWORK FOR AD HOC NETWORK COMMUNICATION IN MULTI-ROBOT SYSTEMS

    Directory of Open Access Journals (Sweden)

    Khilda Slyusar

    2016-11-01

    Full Text Available Assume a team of mobile robots operating in environments where no communication infrastructure like routers or access points is available. The robots have to create a mobile ad hoc network, in that case, it provides communication on peer-to-peer basis. The paper gives an overview of existing solutions how to route messages in such ad hoc networks between robots that are not directly connected and introduces a design of a software framework for realization of such communication. Feasibility of the proposed framework is shown on the example of distributed multi-robot exploration of an a priori unknown environment. Testing of developed functionality in an exploration scenario is based on results of several experiments with various input conditions of the exploration process and various sizes of a team and is described herein.

  8. Distributed Fault Detection and Isolation for Flocking in a Multi-robot System with Imperfect Communication

    Directory of Open Access Journals (Sweden)

    Shao Shiliang

    2014-06-01

    Full Text Available In this paper, we focus on distributed fault detection and isolation (FDI for a multi-robot system where multiple robots execute a flocking task. Firstly, we propose a fault detection method based on the local-information-exchange and sensor-measurement technologies to cover cases of both perfect communication and imperfect communication. The two detection technologies can be adaptively selected according to the packet loss rate (PLR. Secondly, we design a fault isolation method, considering a situation in which faulty robots still influence the behaviours of other robots. Finally, a complete FDI scheme, based on the proposed detection and isolation methods, is simulated in various scenarios. The results demonstrate that our FDI scheme is effective.

  9. Finger Search in the Implicit Model

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Nielsen, Jesper Asbjørn Sindahl; Truelsen, Jakob

    2012-01-01

    We address the problem of creating a dictionary with the finger search property in the strict implicit model, where no information is stored between operations, except the array of elements. We show that for any implicit dictionary supporting finger searches in q(t) = Ω(logt) time, the time to move...... the finger to another element is Ω(q− 1(logn)), where t is the rank distance between the query element and the finger. We present an optimal implicit static structure matching this lower bound. We furthermore present a near optimal implicit dynamic structure supporting search, change-finger, insert......, and delete in times $\\mathcal{O}(q(t))$, $\\mathcal{O}(q^{-1}(\\log n)\\log n)$, $\\mathcal{O}(\\log n)$, and $\\mathcal{O}(\\log n)$, respectively, for any q(t) = Ω(logt). Finally we show that the search operation must take Ω(logn) time for the special case where the finger is always changed to the element...

  10. Induced subgraph searching for geometric model fitting

    Science.gov (United States)

    Xiao, Fan; Xiao, Guobao; Yan, Yan; Wang, Xing; Wang, Hanzi

    2017-11-01

    In this paper, we propose a novel model fitting method based on graphs to fit and segment multiple-structure data. In the graph constructed on data, each model instance is represented as an induced subgraph. Following the idea of pursuing the maximum consensus, the multiple geometric model fitting problem is formulated as searching for a set of induced subgraphs including the maximum union set of vertices. After the generation and refinement of the induced subgraphs that represent the model hypotheses, the searching process is conducted on the "qualified" subgraphs. Multiple model instances can be simultaneously estimated by solving a converted problem. Then, we introduce the energy evaluation function to determine the number of model instances in data. The proposed method is able to effectively estimate the number and the parameters of model instances in data severely corrupted by outliers and noises. Experimental results on synthetic data and real images validate the favorable performance of the proposed method compared with several state-of-the-art fitting methods.

  11. Generalized Jaynes-Cummings model as a quantum search algorithm

    International Nuclear Information System (INIS)

    Romanelli, A.

    2009-01-01

    We propose a continuous time quantum search algorithm using a generalization of the Jaynes-Cummings model. In this model the states of the atom are the elements among which the algorithm realizes the search, exciting resonances between the initial and the searched states. This algorithm behaves like Grover's algorithm; the optimal search time is proportional to the square root of the size of the search set and the probability to find the searched state oscillates periodically in time. In this frame, it is possible to reinterpret the usual Jaynes-Cummings model as a trivial case of the quantum search algorithm.

  12. Standard Model Higgs Searches at the Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    Knoepfel, Kyle J.

    2012-06-01

    We present results from the search for a standard model Higgs boson using data corresponding up to 10 fb{sup -1} of proton-antiproton collision data produced by the Fermilab Tevatron at a center-of-mass energy of 1.96 TeV. The data were recorded by the CDF and D0 detectors between March 2001 and September of 2011. A broad excess is observed between 105 < m{sub H} < 145 GeV/c{sup 2} with a global significance of 2.2 standard deviations relative to the background-only hypothesis.

  13. Search for the standard model Higgs boson

    Science.gov (United States)

    Buskulic, D.; de Bonis, I.; Decamp, D.; Ghez, P.; Goy, C.; Lees, J.-P.; Minard, M.-N.; Pietrzyk, B.; Ariztizabal, F.; Comas, P.; Crespo, J. M.; Delfino, M.; Efthymiopoulos, I.; Fernandez, E.; Fernandez-Bosman, M.; Gaitan, V.; Garrido, Ll.; Mattison, T.; Pacheco, A.; Padilla, C.; Pascual, A.; Creanza, D.; de Palma, M.; Farilla, A.; Iaselli, G.; Maggi, G.; Natali, S.; Nuzzo, S.; Quattromini, M.; Ranieri, A.; Raso, G.; Romano, F.; Ruggieri, F.; Selvaggi, G.; Silvestris, L.; Tempesta, P.; Zito, G.; Chai, Y.; Hu, H.; Huang, D.; Huang, X.; Lin, J.; Wang, T.; Xie, Y.; Xu, D.; Xu, R.; Zhang, J.; Zhang, L.; Zhao, W.; Blucher, E.; Bonvicini, G.; Boudreau, J.; Casper, D.; Drevermann, H.; Forty, R. W.; Ganis, G.; Gay, C.; Hagelberg, R.; Harvey, J.; Hilgart, J.; Jacobsen, R.; Jost, B.; Knobloch, J.; Lehraus, I.; Lohse, T.; Maggi, M.; Markou, C.; Martinez, M.; Mato, P.; Meinhard, H.; Minten, A.; Miotto, A.; Miguel, R.; Moser, H.-G.; Palazzi, P.; Pater, J. R.; Perlas, J. A.; Pusztaszeri, J.-F.; Ranjard, F.; Redlinger, G.; Rolandi, L.; Rothberg, J.; Ruan, T.; Saich, M.; Schlatter, D.; Schmelling, M.; Sefkow, F.; Tejessy, W.; Tomalin, I. R.; Veenhof, R.; Wachsmuth, H.; Wasserbaech, S.; Wiedenmann, W.; Wildish, T.; Witzeling, W.; Wotschack, J.; Ajaltouni, Z.; Badaud, F.; Bardadin-Otwinowska, M.; El Fellous, R.; Falvard, A.; Gay, P.; Guicheney, C.; Henrard, P.; Jousset, J.; Michel, B.; Montret, J.-C.; Pallin, D.; Perret, P.; Podlyski, F.; Proriol, J.; Prulhière, F.; Saadi, F.; Fearnley, T.; Hansen, J. B.; Hansen, J. D.; Hansen, J. R.; Hansen, P. H.; Møllerud, R.; Nilsson, B. S.; Kyriakis, A.; Simopoulou, E.; Siotis, I.; Vayaki, A.; Zachariadou, K.; Badier, J.; Blondel, A.; Bonneaud, G.; Brient, J. C.; Fouque, G.; Orteu, S.; Rougé, A.; Rumpf, M.; Tanaka, R.; Verderi, M.; Videau, H.; Candlin, D. J.; Parsons, M. I.; Veitch, E.; Focardi, E.; Moneta, L.; Parrini, G.; Corden, M.; Georgiopoulos, C.; Ikeda, M.; Levinthal, D.; Antonelli, A.; Baldini, R.; Bencivenni, G.; Bologna, G.; Bossi, F.; Campana, P.; Capon, G.; Cerutti, F.; Chiarella, V.; D'Ettorre-Piazzoli, B.; Felici, G.; Laurelli, P.; Mannocchi, G.; Murtas, F.; Murtas, G. P.; Passalacqua, L.; Pepe-Altarelli, M.; Picchi, P.; Colrain, P.; Ten Have, I.; Lynch, J. G.; Maitland, W.; Morton, W. T.; Raine, C.; Reeves, P.; Scarr, J. M.; Smith, K.; Thompson, A. S.; Turnbull, R. M.; Brandl, B.; Braun, O.; Geweniger, C.; Hanke, P.; Hepp, V.; Kluge, E. E.; Maumary, Y.; Putzer, A.; Rensch, B.; Stahl, A.; Tittel, K.; Wunsch, M.; Beuselinck, R.; Binnie, D. M.; Cameron, W.; Cattaneo, M.; Colling, D. J.; Dornan, P. J.; Greene, A. M.; Hassard, J. F.; Lieske, N. M.; Moutoussi, A.; Nash, J.; Patton, S.; Payne, D. G.; Phillips, M. J.; San Martin, G.; Sedgbeer, J. K.; Wright, A. G.; Girtler, P.; Kuhn, D.; Rudolph, G.; Vogl, R.; Bowdery, C. K.; Brodbeck, T. J.; Finch, A. J.; Foster, F.; Hughes, G.; Jackson, D.; Keemer, N. R.; Nuttall, M.; Patel, A.; Sloan, T.; Snow, S. W.; Whelan, E. P.; Kleinknecht, K.; Raab, J.; Renk, B.; Sander, H.-G.; Schmidt, H.; Steeg, F.; Walther, S. M.; Wanke, R.; Wolf, B.; Bencheikh, A. M.; Benchouk, C.; Bonissent, A.; Carr, J.; Coyle, P.; Drinkard, J.; Etienne, F.; Nicod, D.; Papalexiou, S.; Payre, P.; Roos, L.; Rousseau, D.; Schwemling, P.; Talby, M.; Adlung, S.; Assmann, R.; Bauer, C.; Blum, W.; Brown, D.; Cattaneo, P.; Dehning, B.; Dietl, H.; Dydak, F.; Frank, M.; Halley, A. W.; Jakobs, K.; Lauber, J.; Lütjens, G.; Lutz, G.; Männer, W.; Richter, R.; Schröder, J.; Schwarz, A. S.; Settles, R.; Seywerd, H.; Stierlin, U.; Stiegler, U.; Dennis, R. St.; Wolf, G.; Alemany, R.; Boucrot, J.; Callot, O.; Cordier, A.; Davier, M.; Duflot, L.; Grivaz, J.-F.; Heusse, Ph.; Jaffe, D. E.; Janot, P.; Kim, D. W.; Le Diberder, F.; Lefrançois, J.; Lutz, A.-M.; Schune, M.-H.; Veillet, J.-J.; Videau, I.; Zhang, Z.; Abbaneo, D.; Bagliesi, G.; Batignani, G.; Bottigli, U.; Bozzi, C.; Calderini, G.; Carpinelli, M.; Ciocci, M. A.; Dell'Orso, R.; Ferrante, I.; Fidecaro, F.; Foà, L.; Forti, F.; Giassi, A.; Giorgi, M. A.; Gregorio, A.; Ligabue, F.; Lusiani, A.; Manneli, E. B.; Marrocchesi, P. S.; Messineo, A.; Palla, F.; Rizzo, G.; Sanguinetti, G.; Spagnolo, P.; Steinberger, J.; Techini, R.; Tonelli, G.; Triggiani, G.; Vannini, C.; Venturi, A.; Verdini, P. G.; Walsh, J.; Betteridge, A. P.; Gao, Y.; Green, M. G.; March, P. V.; Mir, Ll. M.; Medcalf, T.; Quazi, I. S.; Strong, J. A.; West, L. R.; Botterill, D. R.; Clifft, R. W.; Edgecock, T. R.; Haywood, S.; Norton, P. R.; Thompson, J. C.; Bloch-Devaux, B.; Colas, P.; Duarte, H.; Emery, S.; Kozanecki, W.; Lançon, E.; Lemaire, M. C.; Locci, E.; Marx, B.; Perez, P.; Rander, J.; Renardy, J.-F.; Rosowsky, A.; Roussarie, A.; Schuller, J.-P.; Schwindling, J.; Si Mohand, D.; Vallage, B.; Johnson, R. P.; Litke, A. M.; Taylor, G.; Wear, J.; Ashman, J. G.; Babbage, W.; Booth, C. N.; Buttar, C.; Cartwright, S.; Combley, F.; Dawson, I.; Thompson, L. F.; Barberio, E.; Böhrer, A.; Brandt, S.; Cowan, G.; Grupen, C.; Lutters, G.; Rivera, F.; Schäfer, U.; Smolik, L.; Bosisio, L.; Della Marina, R.; Giannini, G.; Gobbo, B.; Ragusa, F.; Bellantoni, L.; Chen, W.; Conway, J. S.; Feng, Z.; Ferguson, D. P. S.; Gao, Y. S.; Grahl, J.; Harton, J. L.; Hayes, O. J.; Nachtman, J. M.; Pan, Y. B.; Saadi, Y.; Schmitt, M.; Scott, I.; Sharma, V.; Shi, Z. H.; Turk, J. D.; Walsh, A. M.; Weber, F. V.; Sau Lan Wu; Wu, X.; Zheng, M.; Zobernig, G.; Aleph Collaboration

    1993-08-01

    Using a data sample corresponding to about 1 233 000 hadronic Z decays collected by the ALEPH experiment at LEP, the reaction e+e- → HZ∗ has been used to search for the standard model Higgs boson, in association with missing energy when Z∗ → v v¯, or with a pair of energetic leptons when Z∗ → e+e-or μ +μ -. No signal was found and, at the 95% confidence level, mH exceeds 58.4 GeV/ c2.

  14. Measuring productivity differences in equilibrium search models

    DEFF Research Database (Denmark)

    Lanot, Gauthier; Neumann, George R.

    1996-01-01

    Equilibrium search models require unobserved heterogeneity in productivity to fit observed wage distribution data, but provide no guidance about the location parameter of the heterogeneity. In this paper we show that the location of the productivity heterogeneity implies a mode in a kernel density...... estimate of the wage distribution. The number of such modes and their location are identified using bump hunting techniques due to Silverman (1981). These techniques are applied to Danish panel data on workers and firms. These estimates are used to assess the importance of employer wage policy....

  15. Advertising for attention in a consumer search model

    NARCIS (Netherlands)

    Haan, M.A.; Moraga González, J.L.

    We model the idea that when consumers search for products, they first visit the firm whose advertising is most salient. The gains a firm derives from being visited early increase in search costs, so equilibrium advertising increases as search costs rise. As a result, higher search costs may decrease

  16. A Model of Price Search Behavior in Electronic Marketplace.

    Science.gov (United States)

    Jiang, Pingjun

    2002-01-01

    Discussion of online consumer behavior focuses on the development of a conceptual model and a set of propositions to explain the main factors influencing online price search. Integrates the psychological search literature into the context of online searching by incorporating ability and cost to search for information into perceived search…

  17. LEP Higgs boson searches beyond the standard model

    Indian Academy of Sciences (India)

    These include the searches for charged Higgs bosons, models with two Higgs field doublets, searches for 'fermiophobic' Higgs decay, invisible Higgs boson decays, decay-mode independent searches, and limits on Yukawa and anomalous Higgs couplings. I review the searches done by the four LEP experiments and ...

  18. Development and human factors analysis of an augmented reality interface for multi-robot tele-operation and control

    Science.gov (United States)

    Lee, Sam; Lucas, Nathan P.; Ellis, R. Darin; Pandya, Abhilash

    2012-06-01

    This paper presents a seamlessly controlled human multi-robot system comprised of ground and aerial robots of semiautonomous nature for source localization tasks. The system combines augmented reality interfaces capabilities with human supervisor's ability to control multiple robots. The role of this human multi-robot interface is to allow an operator to control groups of heterogeneous robots in real time in a collaborative manner. It used advanced path planning algorithms to ensure obstacles are avoided and that the operators are free for higher-level tasks. Each robot knows the environment and obstacles and can automatically generate a collision-free path to any user-selected target. It displayed sensor information from each individual robot directly on the robot in the video view. In addition, a sensor data fused AR view is displayed which helped the users pin point source information or help the operator with the goals of the mission. The paper studies a preliminary Human Factors evaluation of this system in which several interface conditions are tested for source detection tasks. Results show that the novel Augmented Reality multi-robot control (Point-and-Go and Path Planning) reduced mission completion times compared to the traditional joystick control for target detection missions. Usability tests and operator workload analysis are also investigated.

  19. Performance impact of mutation operators of a subpopulation-based genetic algorithm for multi-robot task allocation problems.

    Science.gov (United States)

    Liu, Chun; Kroll, Andreas

    2016-01-01

    Multi-robot task allocation determines the task sequence and distribution for a group of robots in multi-robot systems, which is one of constrained combinatorial optimization problems and more complex in case of cooperative tasks because they introduce additional spatial and temporal constraints. To solve multi-robot task allocation problems with cooperative tasks efficiently, a subpopulation-based genetic algorithm, a crossover-free genetic algorithm employing mutation operators and elitism selection in each subpopulation, is developed in this paper. Moreover, the impact of mutation operators (swap, insertion, inversion, displacement, and their various combinations) is analyzed when solving several industrial plant inspection problems. The experimental results show that: (1) the proposed genetic algorithm can obtain better solutions than the tested binary tournament genetic algorithm with partially mapped crossover; (2) inversion mutation performs better than other tested mutation operators when solving problems without cooperative tasks, and the swap-inversion combination performs better than other tested mutation operators/combinations when solving problems with cooperative tasks. As it is difficult to produce all desired effects with a single mutation operator, using multiple mutation operators (including both inversion and swap) is suggested when solving similar combinatorial optimization problems.

  20. Model of intelligent information searching system

    International Nuclear Information System (INIS)

    Yastrebkov, D.I.

    2004-01-01

    A brief description of the technique to search for electronic documents in large archives as well as drawbacks is presented. A solution close to intelligent information searching systems is proposed. (author)

  1. An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning

    Directory of Open Access Journals (Sweden)

    Nizar Hadi Abbas

    2016-07-01

    Full Text Available This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In order to evaluate the proposed algorithm in term of finding the best solution, six benchmark test functions are used to make a comparison between AMOPSO and the standard MOPSO. The results show that the AMOPSO has a better ability to get away from local optimums with a quickest convergence than the MOPSO. The simulation results using Matlab 2014a, indicate that this methodology is extremely valuable for every robot in multi-robot framework to discover its own particular proper pa‌th from the start to the destination position with minimum distance and time.

  2. MÓDULO CONDUCTUAL INMERSO EN UNA ARQUITECTURA DE CONTROL PARA SISTEMAS MULTI-ROBOTS

    Directory of Open Access Journals (Sweden)

    Ángel Eduardo Gil Pérez

    2016-03-01

    Full Text Available El presente trabajo describe el diseño de un módulo conductual para robots de propósito general, implementado en el marco de una arquitectura de control para sistemas multi-robots.El mismo está estructurado en cuatro capas: reactiva, cognitiva, social, y una capa transversal que gestiona un conjunto de emociones básicas, que afectan de forma directael comportamiento del robot y su disposición hacia la ejecución de las tareas y hacia la interrelación con los otros individuos del sistema (es decir, a las otras capas. El objetivo de la arquitectura es brindar una plataforma que facilite los procesos de auto-organización y emergencia del sistema.Se propone un modelo emocional, que toma en consideración cuatro emociones básicas y un estado neutro; esto con el fin de dotar a los robots de un factor adicional que influya en su funcionamiento, que puede ser determinante cuando estos enfrentan situaciones donde la incertidumbre se hace presente. De esta forma, se busca mejorar su proceso de toma de decisión y su adaptación a las dinámicas presentes en el entorno, en particular analizando la influencia de las emociones en sistemas de este tipo.

  3. Top partners searches and composite Higgs models

    International Nuclear Information System (INIS)

    Matsedonskyi, Oleksii; Panico, Giuliano; Wulzer, Andrea

    2016-01-01

    Colored fermionic partners of the top quark are well-known signatures of the Composite Higgs scenario and for this reason they have been and will be subject of an intensive experimental study at the LHC. Performing an assessment of the theoretical implications of this experimental effort is the goal of the present paper. We proceed by analyzing a set of simple benchmark models, characterized by simple two-dimensional parameter spaces where the results of the searches are conveniently visualized and their impact quantified. We only draw exclusion contours, in the hypothesis of no signal, but of course our formalism could equally well be used to report discoveries in a theoretically useful format.

  4. Advertising for Attention in a Consumer Search Model

    OpenAIRE

    Marco A. Haan; Jose Luis Moraga-Gonzalez

    2009-01-01

    We model the idea that when consumers search for products, they first visit the firm whose advertising is more salient. The gains a firm derives from being visited early increase in search costs, so equilibrium advertising increases as search costs rise. This may result in lower firm profits when search costs increase. We extend the basic model by allowing for firm heterogeneity in advertising costs. Firms whose advertising is more salient and therefore raise attention more easily charge lowe...

  5. Modeling User Behavior and Attention in Search

    Science.gov (United States)

    Huang, Jeff

    2013-01-01

    In Web search, query and click log data are easy to collect but they fail to capture user behaviors that do not lead to clicks. As search engines reach the limits inherent in click data and are hungry for more data in a competitive environment, mining cursor movements, hovering, and scrolling becomes important. This dissertation investigates how…

  6. Neural field model of memory-guided search.

    Science.gov (United States)

    Kilpatrick, Zachary P; Poll, Daniel B

    2017-12-01

    Many organisms can remember locations they have previously visited during a search. Visual search experiments have shown exploration is guided away from these locations, reducing redundancies in the search path before finding a hidden target. We develop and analyze a two-layer neural field model that encodes positional information during a search task. A position-encoding layer sustains a bump attractor corresponding to the searching agent's current location, and search is modeled by velocity input that propagates the bump. A memory layer sustains persistent activity bounded by a wave front, whose edges expand in response to excitatory input from the position layer. Search can then be biased in response to remembered locations, influencing velocity inputs to the position layer. Asymptotic techniques are used to reduce the dynamics of our model to a low-dimensional system of equations that track the bump position and front boundary. Performance is compared for different target-finding tasks.

  7. Neural field model of memory-guided search

    Science.gov (United States)

    Kilpatrick, Zachary P.; Poll, Daniel B.

    2017-12-01

    Many organisms can remember locations they have previously visited during a search. Visual search experiments have shown exploration is guided away from these locations, reducing redundancies in the search path before finding a hidden target. We develop and analyze a two-layer neural field model that encodes positional information during a search task. A position-encoding layer sustains a bump attractor corresponding to the searching agent's current location, and search is modeled by velocity input that propagates the bump. A memory layer sustains persistent activity bounded by a wave front, whose edges expand in response to excitatory input from the position layer. Search can then be biased in response to remembered locations, influencing velocity inputs to the position layer. Asymptotic techniques are used to reduce the dynamics of our model to a low-dimensional system of equations that track the bump position and front boundary. Performance is compared for different target-finding tasks.

  8. Searches for Beyond Standard Model Physics with ATLAS and CMS

    CERN Document Server

    Rompotis, Nikolaos; The ATLAS collaboration

    2017-01-01

    The exploration of the high energy frontier with ATLAS and CMS experiments provides one of the best opportunities to look for physics beyond the Standard Model. In this talk, I review the motivation, the strategy and some recent results related to beyond Standard Model physics from these experiments. The review will cover beyond Standard Model Higgs boson searches, supersymmetry and searches for exotic particles.

  9. Model unspecific search in CMS. Model unspecific limits

    Energy Technology Data Exchange (ETDEWEB)

    Knutzen, Simon; Albert, Andreas; Duchardt, Deborah; Hebbeker, Thomas; Lieb, Jonas; Meyer, Arnd; Pook, Tobias; Roemer, Jonas [III. Physikalisches Institut A, RWTH Aachen University (Germany)

    2016-07-01

    The standard model of particle physics is increasingly challenged by recent discoveries and also by long known phenomena, representing a strong motivation to develop extensions of the standard model. The amount of theories describing possible extensions is large and steadily growing. In this presentation a new approach is introduced, verifying if a given theory beyond the standard model is consistent with data collected by the CMS detector without the need to perform a dedicated search. To achieve this, model unspecific limits on the number of additional events above the standard model expectation are calculated in every event class produced by the MUSiC algorithm. Furthermore, a tool is provided to translate these results into limits on the signal cross section of any theory. In addition to the general procedure, first results and examples are shown using the proton-proton collision data taken at a centre of mass energy of 8 TeV.

  10. Ringed Seal Search for Global Optimization via a Sensitive Search Model.

    Directory of Open Access Journals (Sweden)

    Younes Saadi

    Full Text Available The efficiency of a metaheuristic algorithm for global optimization is based on its ability to search and find the global optimum. However, a good search often requires to be balanced between exploration and exploitation of the search space. In this paper, a new metaheuristic algorithm called Ringed Seal Search (RSS is introduced. It is inspired by the natural behavior of the seal pup. This algorithm mimics the seal pup movement behavior and its ability to search and choose the best lair to escape predators. The scenario starts once the seal mother gives birth to a new pup in a birthing lair that is constructed for this purpose. The seal pup strategy consists of searching and selecting the best lair by performing a random walk to find a new lair. Affected by the sensitive nature of seals against external noise emitted by predators, the random walk of the seal pup takes two different search states, normal state and urgent state. In the normal state, the pup performs an intensive search between closely adjacent lairs; this movement is modeled via a Brownian walk. In an urgent state, the pup leaves the proximity area and performs an extensive search to find a new lair from sparse targets; this movement is modeled via a Levy walk. The switch between these two states is realized by the random noise emitted by predators. The algorithm keeps switching between normal and urgent states until the global optimum is reached. Tests and validations were performed using fifteen benchmark test functions to compare the performance of RSS with other baseline algorithms. The results show that RSS is more efficient than Genetic Algorithm, Particles Swarm Optimization and Cuckoo Search in terms of convergence rate to the global optimum. The RSS shows an improvement in terms of balance between exploration (extensive and exploitation (intensive of the search space. The RSS can efficiently mimic seal pups behavior to find best lair and provide a new algorithm to be

  11. Professional Education in Expert Search: A Content Model

    Science.gov (United States)

    Smith, Catherine L.; Roseberry, Martha I.

    2013-01-01

    This paper presents a descriptive model of the subject matter taught in courses on expert search in ALA-accredited programs, answering the question: What is taught in formal professional education on search expertise? The model emerged from a grounded content analysis of 44 course descriptions and 16 syllabi, and was validated via a review of…

  12. A stochastic model for intermittent search strategies

    International Nuclear Information System (INIS)

    Benichou, O; Coppey, M; Moreau, M; Suet, P H; Voituriez, R

    2005-01-01

    It is often necessary, in scientific or everyday life problems, to find a randomly hidden target. What is then the optimal strategy to reach it as rapidly as possible? In this article, we develop a stochastic theory for intermittent search behaviours, which are often observed: the searcher alternates phases of intensive search and slow motion with fast displacements. The first results of this theory have already been announced recently. Here we provide a detailed presentation of the theory, as well as the full derivation of the results. Furthermore, we explicitly discuss the minimization of the time needed to find the target

  13. Similarity search of business process models

    NARCIS (Netherlands)

    Dumas, M.; García-Bañuelos, L.; Dijkman, R.M.

    2009-01-01

    Similarity search is a general class of problems in which a given object, called a query object, is compared against a collection of objects in order to retrieve those that most closely resemble the query object. This paper reviews recent work on an instance of this class of problems, where the

  14. Diseño de modelo de patrullaje multi-robot basado en Teoría de Juegos para la protección de grandes infraestructuras

    OpenAIRE

    Alberte Rey, Marta

    2015-01-01

    Los sistemas multi-robot han sido objeto de numerosos estudios en los últimos años debido, entre otras razones, a su potencial aplicación en diferentes escenarios o misiones. Una de estas misiones, donde el uso de los sistemas multi-robot es de especial interés, es el desarrollo de tareas de seguridad y vigilancia en las denominadas “grandes infraestructuras críticas exteriores” que, entre otras necesidades, precisan tener bajo vigilancia áreas o puntos sensibles (accesos, zonas de mando, aco...

  15. Building a ROS-Based Testbed for Realistic Multi-Robot Simulation: Taking the Exploration as an Example

    Directory of Open Access Journals (Sweden)

    Zhi Yan

    2017-09-01

    Full Text Available While the robotics community agrees that the benchmarking is of high importance to objectively compare different solutions, there are only few and limited tools to support it. To address this issue in the context of multi-robot systems, we have defined a benchmarking process based on experimental designs, which aimed at improving the reproducibility of experiments by making explicit all elements of a benchmark such as parameters, measurements and metrics. We have also developed a ROS (Robot Operating System-based testbed with the goal of making it easy for users to validate, benchmark, and compare different algorithms including coordination strategies. Our testbed uses the MORSE (Modular OpenRobots Simulation Engine simulator for realistic simulation and a computer cluster for decentralized computation. In this paper, we present our testbed in details with the architecture and infrastructure, the issues encountered in implementing the infrastructure, and the automation of the deployment. We also report a series of experiments on multi-robot exploration, in order to demonstrate the capabilities of our testbed.

  16. Finger Search in the Implicit Model

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Nielsen, Jesper Asbjørn Sindahl; Truelsen, Jakob

    2012-01-01

    , and delete in times $\\mathcal{O}(q(t))$, $\\mathcal{O}(q^{-1}(\\log n)\\log n)$, $\\mathcal{O}(\\log n)$, and $\\mathcal{O}(\\log n)$, respectively, for any q(t) = Ω(logt). Finally we show that the search operation must take Ω(logn) time for the special case where the finger is always changed to the element...

  17. A Model for Teaching Critical Thinking through Online Searching.

    Science.gov (United States)

    Crane, Beverley; Markowitz, Nancy Lourie

    1994-01-01

    Presents a model that uses online searching to teach critical thinking skills in elementary and secondary education based on Bloom's taxonomy. Three levels of activity are described: analyzing a search statement; defining and clarifying a problem; and focusing an information need. (Contains 13 references.) (LRW)

  18. Search strategies for top partners in composite Higgs models

    Science.gov (United States)

    Gripaios, Ben; Müller, Thibaut; Parker, M. A.; Sutherland, Dave

    2014-08-01

    We consider how best to search for top partners in generic composite Higgs models. We begin by classifying the possible group representations carried by top partners in models with and without a custodial SU(2) × SU(2) ⋊ 2 symmetry protecting the rate for Z → decays. We identify a number of minimal models whose top partners only have electric charges of , , or and thus decay to top or bottom quarks via a single Higgs or electroweak gauge boson. We develop an inclusive search for these based on a top veto, which we find to be more effective than existing searches. Less minimal models feature light states that can be sought in final states with like-sign leptons and so we find that 2 straightforward LHC searches give a reasonable coverage of the gamut of composite Higgs models.

  19. Advanced language modeling approaches, case study: Expert search

    NARCIS (Netherlands)

    Hiemstra, Djoerd

    2008-01-01

    This tutorial gives a clear and detailed overview of advanced language modeling approaches and tools, including the use of document priors, translation models, relevance models, parsimonious models and expectation maximization training. Expert search will be used as a case study to explain the

  20. Model Justified Search Algorithms for Scheduling Under Uncertainty

    National Research Council Canada - National Science Library

    Howe, Adele; Whitley, L. D

    2008-01-01

    .... We also identified plateaus as a significant barrier to superb performance of local search on scheduling and have studied several canonical discrete optimization problems to discover and model the nature of plateaus...

  1. Standard model status (in search of ''new physics'')

    International Nuclear Information System (INIS)

    Marciano, W.J.

    1993-03-01

    A perspective on successes and shortcomings of the standard model is given. The complementarity between direct high energy probes of new physics and lower energy searches via precision measurements and rare reactions is described. Several illustrative examples are discussed

  2. Sistema multi-robot para localización e identificación de vehículos

    Directory of Open Access Journals (Sweden)

    C. Sagues

    2012-01-01

    Full Text Available Resumen: En este trabajo se presenta un sistema multi-robot para localización e identificación de vehículos que están estacionados en un recinto abierto o cerrado. El sistema realiza una planificación a priori y una asignación de tareas a los miembros del equipo optimizando el tiempo de la misión. El equipo de robots está dotado de sensores de visión que permiten la localización de los vehículos y la identificación de su matrícula. El controlador de movimiento de cada robot utiliza un sensor láser para el posicionamiento frente al vehículo a identificar y un sistema de control basado en visión realiza el posicionamiento preciso para la adquisición de la imagen de la matrícula que permita su posterior identificación. El sistema multi-robot dispone de capacidad de comunicaciones entre ellos y con una estación central de mando, con la que se intercambian comandos e incidencias y eventualmente datos, con restricciones de tiempo real. Los sensores utilizados están comercialmente disponibles y los algoritmos han sido desarrollados por el grupo Robótica, Percepción y Tiempo Real de la Universidad de Zaragoza en el marco de proyectos financiados por el Ministerio de Ciencia e Innovación. Integra diversas tecnologías de planificación, navegación, percepción y comunicaciones, adaptadas en el proyecto a la aplicación concreta. Palabras clave: Sistemas multi-robot, Robótica móvil, Navegación, Planificación y asignación de tareas, Protocolos de comunicación, Visión porcomputador, Tiempo real

  3. Research on the User Interest Modeling of Personalized Search Engine

    Institute of Scientific and Technical Information of China (English)

    LI Zhengwei; XIA Shixiong; NIU Qiang; XIA Zhanguo

    2007-01-01

    At present, how to enable Search Engine to construct user personal interest model initially, master user's personalized information timely and provide personalized services accurately have become the hotspot in the research of Search Engine area.Aiming at the problems of user model's construction and combining techniques of manual customization modeling and automatic analytical modeling, a User Interest Model (UIM) is proposed in the paper. On the basis of it, the corresponding establishment and update algorithms of User Interest Profile (UIP) are presented subsequently. Simulation tests proved that the UIM proposed and corresponding algorithms could enhance the retrieval precision effectively and have superior adaptability.

  4. Passage relevance models for genomics search

    Directory of Open Access Journals (Sweden)

    Frieder Ophir

    2009-03-01

    Full Text Available Abstract We present a passage relevance model for integrating syntactic and semantic evidence of biomedical concepts and topics using a probabilistic graphical model. Component models of topics, concepts, terms, and document are represented as potential functions within a Markov Random Field. The probability of a passage being relevant to a biologist's information need is represented as the joint distribution across all potential functions. Relevance model feedback of top ranked passages is used to improve distributional estimates of query concepts and topics in context, and a dimensional indexing strategy is used for efficient aggregation of concept and term statistics. By integrating multiple sources of evidence including dependencies between topics, concepts, and terms, we seek to improve genomics literature passage retrieval precision. Using this model, we are able to demonstrate statistically significant improvements in retrieval precision using a large genomics literature corpus.

  5. An extended dual search space model of scientific discovery learning

    NARCIS (Netherlands)

    van Joolingen, Wouter; de Jong, Anthonius J.M.

    1997-01-01

    This article describes a theory of scientific discovery learning which is an extension of Klahr and Dunbar''s model of Scientific Discovery as Dual Search (SDDS) model. We present a model capable of describing and understanding scientific discovery learning in complex domains in terms of the SDDS

  6. Characterizing economic trends by Bayesian stochastic model specification search

    DEFF Research Database (Denmark)

    Grassi, Stefano; Proietti, Tommaso

    We extend a recently proposed Bayesian model selection technique, known as stochastic model specification search, for characterising the nature of the trend in macroeconomic time series. In particular, we focus on autoregressive models with possibly time-varying intercept and slope and decide on ...

  7. Searches for non-Standard Model Higgs bosons

    CERN Document Server

    Dumitriu, Ana Elena; The ATLAS collaboration

    2018-01-01

    This presentation focuses on the Searches for non-Standard Model Higgs bosons using 36.1 fb of data collected by the ATLAS experiment. There are several theoretical models with an extended Higgs sector considered: 2 Higgs Doublet Models (2HDM), Supersymmetry (SUSY), which brings along super-partners of the SM particles (+ The Minimal Supersymmetric Standard Model (MSSM), whose Higgs sector is equivalent to the one of a constrained 2HDM of type II and the next-to MSSM (NMSSM)), General searches and Invisible decaying Higgs boson.

  8. Protein Folding: Search for Basic Physical Models

    Directory of Open Access Journals (Sweden)

    Ivan Y. Torshin

    2003-01-01

    Full Text Available How a unique three-dimensional structure is rapidly formed from the linear sequence of a polypeptide is one of the important questions in contemporary science. Apart from biological context of in vivo protein folding (which has been studied only for a few proteins, the roles of the fundamental physical forces in the in vitro folding remain largely unstudied. Despite a degree of success in using descriptions based on statistical and/or thermodynamic approaches, few of the current models explicitly include more basic physical forces (such as electrostatics and Van Der Waals forces. Moreover, the present-day models rarely take into account that the protein folding is, essentially, a rapid process that produces a highly specific architecture. This review considers several physical models that may provide more direct links between sequence and tertiary structure in terms of the physical forces. In particular, elaboration of such simple models is likely to produce extremely effective computational techniques with value for modern genomics.

  9. A Search Model with a Quasi-Network

    DEFF Research Database (Denmark)

    Ejarque, Joao Miguel

    This paper adds a quasi-network to a search model of the labor market. Fitting the model to an average unemployment rate and to other moments in the data implies the presence of the network is not noticeable in the basic properties of the unemployment and job finding rates. However, the network...

  10. Fitting Equilibrium Search Models to Labour Market Data

    DEFF Research Database (Denmark)

    Bowlus, Audra J.; Kiefer, Nicholas M.; Neumann, George R.

    1996-01-01

    Specification and estimation of a Burdett-Mortensen type equilibrium search model is considered. The estimation is nonstandard. An estimation strategy asymptotically equivalent to maximum likelihood is proposed and applied. The results indicate that specifications with a small number of productiv...... of productivity types fit the data well compared to the homogeneous model....

  11. Standard Model Higgs boson searches with the ATLAS detector

    Indian Academy of Sciences (India)

    The experimental results on the search of the Standard Model Higgs boson with 1 to 2 fb-1 of proton–proton collision data at s = 7 TeV recorded by the ATLAS detector are presented and discussed. No significant excess of events is found with respect to the expectations from Standard Model processes, and the production ...

  12. Investigating Individual Differences in Toddler Search with Mixture Models

    Science.gov (United States)

    Berthier, Neil E.; Boucher, Kelsea; Weisner, Nina

    2015-01-01

    Children's performance on cognitive tasks is often described in categorical terms in that a child is described as either passing or failing a test, or knowing or not knowing some concept. We used binomial mixture models to determine whether individual children could be classified as passing or failing two search tasks, the DeLoache model room…

  13. Tax Policy in a Model of Search with Training

    NARCIS (Netherlands)

    Boone, J.; de Mooij, R.A.

    2000-01-01

    This paper develops a model of search on the labour market with training. The model reveals how the tax system can restore the social optimum if the Hosios condition is not satisfied in the private equilibrium. Furthermore, the effects are explored of a second-best reform from average to marginal

  14. How Users Search the Mobile Web: A Model for Understanding the Impact of Motivation and Context on Search Behaviors

    Directory of Open Access Journals (Sweden)

    Dan Wu

    2016-03-01

    Full Text Available Purpose: This study explores how search motivation and context influence mobile Web search behaviors. Design/methodology/approach: We studied 30 experienced mobile Web users via questionnaires, semi-structured interviews, and an online diary tool that participants used to record their daily search activities. SQLite Developer was used to extract data from the users' phone logs for correlation analysis in Statistical Product and Service Solutions (SPSS. Findings: One quarter of mobile search sessions were driven by two or more search motivations. It was especially difficult to distinguish curiosity from time killing in particular user reporting. Multi-dimensional contexts and motivations influenced mobile search behaviors, and among the context dimensions, gender, place, activities they engaged in while searching, task importance, portal, and interpersonal relations (whether accompanied or alone when searching correlated with each other. Research limitations: The sample was comprised entirely of college students, so our findings may not generalize to other populations. More participants and longer experimental duration will improve the accuracy and objectivity of the research. Practical implications: Motivation analysis and search context recognition can help mobile service providers design applications and services for particular mobile contexts and usages. Originality/value: Most current research focuses on specific contexts, such as studies on place, or other contextual influences on mobile search, and lacks a systematic analysis of mobile search context. Based on analysis of the impact of mobile search motivations and search context on search behaviors, we built a multi-dimensional model of mobile search behaviors.

  15. Autonomous change of behavior for environmental context: An intermittent search model with misunderstanding search pattern

    Science.gov (United States)

    Murakami, Hisashi; Gunji, Yukio-Pegio

    2017-07-01

    Although foraging patterns have long been predicted to optimally adapt to environmental conditions, empirical evidence has been found in recent years. This evidence suggests that the search strategy of animals is open to change so that animals can flexibly respond to their environment. In this study, we began with a simple computational model that possesses the principal features of an intermittent strategy, i.e., careful local searches separated by longer steps, as a mechanism for relocation, where an agent in the model follows a rule to switch between two phases, but it could misunderstand this rule, i.e., the agent follows an ambiguous switching rule. Thanks to this ambiguity, the agent's foraging strategy can continuously change. First, we demonstrate that our model can exhibit an optimal change of strategy from Brownian-type to Lévy-type depending on the prey density, and we investigate the distribution of time intervals for switching between the phases. Moreover, we show that the model can display higher search efficiency than a correlated random walk.

  16. Highlights on searches for supersymmetry and exotic models

    International Nuclear Information System (INIS)

    Clerbaux, B.

    2015-01-01

    In this review, we present highlight results of the first three years of the LHC running on searches for new physics beyond the Standard Model (BSM). The excellent performance of the LHC machine and detectors has provided a large, high-quality dataset, mainly proton-proton interactions at a centre of mass energy of 7 TeV (collected in 2010 and 2011) and 8 TeV (collected in 2012). This allowed the experiments to test the Standard Model (SM) at the highest available energy and to search for new phenomena in a considerably enlarged phase space compared to previous colliders. The present review is organised as follows. Section 2 gives motivations to search for new physics beyond the SM, and a brief description of the main classes of BSM theory candidates is reported in Section 3. Section 4 summarises the characteristics of the 3-year LHC dataset, called in the following the Run 1 dataset. Precise tests of the SM are reported in Section 5. The following next sections are the core of the review and present a selection of results from the ATLAS and CMS experiments on BSM searches, gathered in four parts: the search for new physics in the scalar sector in Section 6, the search for supersymmetric particles in Section 7, the search for dark matter candidates in Section 8, and a non-exhaustive list of other exotics BSM (heavy resonances, excited fermions, leptoquarks and vector-like quarks) searches in Section 9. Future plans of the LHC running are reported in Section 10

  17. Characterizing economic trends by Bayesian stochastic model specifi cation search

    OpenAIRE

    Grassi, Stefano; Proietti, Tommaso

    2010-01-01

    We apply a recently proposed Bayesian model selection technique, known as stochastic model specification search, for characterising the nature of the trend in macroeconomic time series. We illustrate that the methodology can be quite successfully applied to discriminate between stochastic and deterministic trends. In particular, we formulate autoregressive models with stochastic trends components and decide on whether a specific feature of the series, i.e. the underlying level and/or the rate...

  18. ON range searching in the group model and combinatorial discrepancy

    DEFF Research Database (Denmark)

    Larsen, Kasper Green

    2014-01-01

    In this paper we establish an intimate connection between dynamic range searching in the group model and combinatorial discrepancy. Our result states that, for a broad class of range searching data structures (including all known upper bounds), it must hold that $t_u t_q=\\Omega(\\mbox{disc}^2......)$, where $t_u$ is the worst case update time, $t_q$ is the worst case query time, and disc is the combinatorial discrepancy of the range searching problem in question. This relation immediately implies a whole range of exceptionally high and near-tight lower bounds for all of the basic range searching...... problems. We list a few of them in the following: (1) For $d$-dimensional halfspace range searching, we get a lower bound of $t_u t_q=\\Omega(n^{1-1/d})$. This comes within an lg lg $n$ factor of the best known upper bound. (2) For orthogonal range searching, we get a lower bound of $t_u t...

  19. Search-based model identification of smart-structure damage

    Science.gov (United States)

    Glass, B. J.; Macalou, A.

    1991-01-01

    This paper describes the use of a combined model and parameter identification approach, based on modal analysis and artificial intelligence (AI) techniques, for identifying damage or flaws in a rotating truss structure incorporating embedded piezoceramic sensors. This smart structure example is representative of a class of structures commonly found in aerospace systems and next generation space structures. Artificial intelligence techniques of classification, heuristic search, and an object-oriented knowledge base are used in an AI-based model identification approach. A finite model space is classified into a search tree, over which a variant of best-first search is used to identify the model whose stored response most closely matches that of the input. Newly-encountered models can be incorporated into the model space. This adaptativeness demonstrates the potential for learning control. Following this output-error model identification, numerical parameter identification is used to further refine the identified model. Given the rotating truss example in this paper, noisy data corresponding to various damage configurations are input to both this approach and a conventional parameter identification method. The combination of the AI-based model identification with parameter identification is shown to lead to smaller parameter corrections than required by the use of parameter identification alone.

  20. Measurement Axis Searching Model for Terrestrial Laser Scans Registration

    Directory of Open Access Journals (Sweden)

    Shaoxing Hu

    2016-01-01

    Full Text Available Nowadays, terrestrial Lidar scans can cover rather a large area; the point densities are strongly varied because of the line-of-sight measurement principle in potential overlaps with scans taken from different viewpoints. Most of the traditional methods focus on registration algorithm and ignore searching model. Sometimes the traditional methods are directly used to align two point clouds; a large critically unsolved problem of the large biases will be created in areas distant from the overlaps while the local overlaps are often aligned well. So a novel measurement axis searching model (MASM has been proposed in this paper. The method includes four steps: (1 the principal axis fitting, (2 the measurement axis generation, (3 low-high-precision search, and (4 result generation. The principal axis gives an orientation to the point cloud; the search scope is limited by the measurement axis. The point cloud orientation can be adjusted gradually until the achievement of the global optimum using low- and high-precision search. We perform some experiments with simulated point clouds and real terrestrial laser scans. The results of simulated point clouds have shown the processing steps of our method, and the results of real terrestrial laser scans have shown the sensitivity of the approach with respect to the indoor and outdoor scenes.

  1. Selection of rendezvous points for multi-robot exploration in dynamic environments

    NARCIS (Netherlands)

    de Hoog, J.; Cameron, S.; Visser, A.; Visser, U.; Asadi, S.; Laue, T.; Mayer, N.M.

    2010-01-01

    For many robotics applications (such as robotic search and rescue), information about the environment must be gathered by a team of robots and returned to a single, specific location. Coordination of robots and sharing of information is vital, and when environments have severe communication

  2. Searches for phenomena beyond the Standard Model at the Large ...

    Indian Academy of Sciences (India)

    metry searches at the LHC is thus the channel with large missing transverse momentum and jets of high transverse momentum. No excess above the expected SM background is observed and limits are set on supersymmetric models. Figures 1 and 2 show the limits from ATLAS [11] and CMS [12]. In addition to setting limits ...

  3. Searches for Physics Beyond Standard Model at LHC with ATLAS

    CERN Document Server

    Soni, N; The ATLAS collaboration

    2013-01-01

    This contribution summarises some of the recent results on the searches for physics beyond the Standard Model using the pp-collision data collected at Large Hadron Collider (LHC) with ATLAS detector at centre-of-mass energy of sqrt{s} = 8 TeV. The search for supersymmetry (SUSY) is carried out in a large variety of production modes such as strong production of squarks and gluinos, weak production of sleptons and gauginos os production of massive long-lived particles through R-parity violation. No excess above the Standard Model background expectation is observed and exclusion limits are derived on the production of new physics. The results are interpreted as lower limits on sparticle masses in SUSY breaking scenarios. Searches for new exotic phenomena such as dark matter, large extra dimensions and black holes are also performed at ATLAS. As in the case of SUSY searches, no new exotic phenomena is observed and results are presented as upper limits on event yields from non-Standard-Model processes in a model i...

  4. Advertising and Consumer Search in a Duopoly Model

    NARCIS (Netherlands)

    M.C.W. Janssen (Maarten); M.C. Non (Marielle)

    2005-01-01

    textabstractWe consider a duopoly in a homogenous goods market where part of the consumers are ex ante uninformed about prices. Information can come through two different channels: advertising and sequential consumer search. The model is similar to that of Robert and Stahl (1993) with two major (and

  5. Searches for phenomena beyond the Standard Model at the Large

    Indian Academy of Sciences (India)

    The LHC has delivered several fb-1 of data in spring and summer 2011, opening new windows of opportunity for discovering phenomena beyond the Standard Model. A summary of the searches conducted by the ATLAS and CMS experiments based on about 1 fb-1 of data is presented.

  6. Search for Higgs boson in beyond standard model scenarios

    Indian Academy of Sciences (India)

    The principal physics motivation of the LHC experiments is to search for the Higgs boson and to probe the physics of TeV energy scale. Potential of discovery for Higgs bosons in various scenarios beyond standard model have been estimated for both CMS and ATLAS experiments through detailed detector simulations.

  7. Minimum Price Guarantees In a Consumer Search Model

    NARCIS (Netherlands)

    M.C.W. Janssen (Maarten); A. Parakhonyak (Alexei)

    2009-01-01

    textabstractThis paper is the first to examine the effect of minimum price guarantees in a sequential search model. Minimum price guarantees are not advertised and only known to consumers when they come to the shop. We show that in such an environment, minimum price guarantees increase the value of

  8. Simplified Models for Dark Matter Searches at the LHC

    CERN Document Server

    Abdallah, Jalal; Arbey, Alexandre; Ashkenazi, Adi; Belyaev, Alexander; Berger, Joshua; Boehm, Celine; Boveia, Antonio; Brennan, Amelia; Brooke, Jim; Buchmueller, Oliver; Buckley, Matthew; Busoni, Giorgio; Calibbi, Lorenzo; Chauhan, Sushil; Daci, Nadir; Davies, Gavin; De Bruyn, Isabelle; de Jong, Paul; De Roeck, Albert; de Vries, Kees; del Re, Daniele; De Simone, Andrea; Di Simone, Andrea; Doglioni, Caterina; Dolan, Matthew; Dreiner, Herbi K.; Ellis, John; Eno, Sarah; Etzion, Erez; Fairbairn, Malcolm; Feldstein, Brian; Flaecher, Henning; Feng, Eric; Fox, Patrick; Genest, Marie-Hélène; Gouskos, Loukas; Gramling, Johanna; Haisch, Ulrich; Harnik, Roni; Hibbs, Anthony; Hoh, Siewyan; Hopkins, Walter; Ippolito, Valerio; Jacques, Thomas; Kahlhoefer, Felix; Khoze, Valentin V.; Kirk, Russell; Korn, Andreas; Kotov, Khristian; Kunori, Shuichi; Landsberg, Greg; Liem, Sebastian; Lin, Tongyan; Lowette, Steven; Lucas, Robyn; Malgeri, Luca; Malik, Sarah; McCabe, Christopher; Mete, Alaettin Serhan; Morgante, Enrico; Mrenna, Stephen; Nakahama, Yu; Newbold, Dave; Nordstrom, Karl; Pani, Priscilla; Papucci, Michele; Pataraia, Sophio; Penning, Bjoern; Pinna, Deborah; Polesello, Giacomo; Racco, Davide; Re, Emanuele; Riotto, Antonio Walter; Rizzo, Thomas; Salek, David; Sarkar, Subir; Schramm, Steven; Skubic, Patrick; Slone, Oren; Smirnov, Juri; Soreq, Yotam; Sumner, Timothy; Tait, Tim M.P.; Thomas, Marc; Tomalin, Ian; Tunnell, Christopher; Vichi, Alessandro; Volansky, Tomer; Weiner, Neal; West, Stephen M.; Wielers, Monika; Worm, Steven; Yavin, Itay; Zaldivar, Bryan; Zhou, Ning; Zurek, Kathryn

    2015-01-01

    This document outlines a set of simplified models for dark matter and its interactions with Standard Model particles. It is intended to summarize the main characteristics that these simplified models have when applied to dark matter searches at the LHC, and to provide a number of useful expressions for reference. The list of models includes both s-channel and t-channel scenarios. For s-channel, spin-0 and spin-1 mediation is discussed, and also realizations where the Higgs particle provides a portal between the dark and visible sectors. The guiding principles underpinning the proposed simplified models are spelled out, and some suggestions for implementation are presented.

  9. Simplified models for dark matter searches at the LHC

    Energy Technology Data Exchange (ETDEWEB)

    Abdallah, Jalal; Araujo, Henrique; Arbey, Alexandre; Ashkenazi, Adi; Belyaev, Alexander; Berger, Joshua; Boehm, Celine; Boveia, Antonio; Brennan, Amelia; Brooke, Jim; Buchmueller, Oliver; Buckley, Matthew; Busoni, Giorgio; Calibbi, Lorenzo; Chauhan, Sushil; Daci, Nadir; Davies, Gavin; De Bruyn, Isabelle; De Jong, Paul; De Roeck, Albert; de Vries, Kees; Del Re, Daniele; De Simone, Andrea; Di Simone, Andrea; Doglioni, Caterina; Dolan, Matthew; Dreiner, Herbi K.; Ellis, John; Eno, Sarah; Etzion, Erez; Fairbairn, Malcolm; Feldstein, Brian; Flaecher, Henning; Feng, Eric; Fox, Patrick; Genest, Marie-Hélène; Gouskos, Loukas; Gramling, Johanna; Haisch, Ulrich; Harnik, Roni; Hibbs, Anthony; Hoh, Siewyan; Hopkins, Walter; Ippolito, Valerio; Jacques, Thomas; Kahlhoefer, Felix; Khoze, Valentin V.; Kirk, Russell; Korn, Andreas; Kotov, Khristian; Kunori, Shuichi; Landsberg, Greg; Liem, Sebastian; Lin, Tongyan; Lowette, Steven; Lucas, Robyn; Malgeri, Luca; Malik, Sarah; McCabe, Christopher; Mete, Alaettin Serhan; Morgante, Enrico; Mrenna, Stephen; Nakahama, Yu; Newbold, Dave; Nordstrom, Karl; Pani, Priscilla; Papucci, Michele; Pataraia, Sophio; Penning, Bjoern; Pinna, Deborah; Polesello, Giacomo; Racco, Davide; Re, Emanuele; Riotto, Antonio Walter; Rizzo, Thomas; Salek, David; Sarkar, Subir; Schramm, Steven; Skubic, Patrick; Slone, Oren; Smirnov, Juri; Soreq, Yotam; Sumner, Timothy; Tait, Tim M. P.; Thomas, Marc; Tomalin, Ian; Tunnell, Christopher; Vichi, Alessandro; Volansky, Tomer; Weiner, Neal; West, Stephen M.; Wielers, Monika; Worm, Steven; Yavin, Itay; Zaldivar, Bryan; Zhou, Ning; Zurek, Kathryn

    2015-09-01

    This document a outlines a set of simplified models for dark matter and its interactions with Standard Model particles. It is intended to summarize the main characteristics that these simplified models have when applied to dark matter searches at the LHC, and to provide a number of useful expressions for reference. The list of models includes both s-channel and t-channel scenarios. For s-channel, spin-0 and spin-1 mediations are discussed, and also realizations where the Higgs particle provides a portal between the dark and visible sectors. The guiding principles underpinning the proposed simplified models are spelled out, and some suggestions for implementation are presented.

  10. High Mass Standard Model Higgs searches at the Tevatron

    Directory of Open Access Journals (Sweden)

    Petridis Konstantinos A.

    2012-06-01

    Full Text Available We present the results of searches for the Standard Model Higgs boson decaying predominantly to W+W− pairs, at a center-of-mass energy of √s = 1.96 TeV, using up to 8.2 fb−1 of data collected with the CDF and D0 detectors at the Fermilab Tevatron collider. The analysis techniques and the various channels considered are discussed. These searches result in exclusions across the Higgs mass range of 156.5< mH <173.7 GeV for CDF and 161< mH <170 GeV for D0.

  11. Spatial capture-recapture models for search-encounter data

    Science.gov (United States)

    Royle, J. Andrew; Kery, Marc; Guelat, Jerome

    2011-01-01

    1. Spatial capture–recapture models make use of auxiliary data on capture location to provide density estimates for animal populations. Previously, models have been developed primarily for fixed trap arrays which define the observable locations of individuals by a set of discrete points. 2. Here, we develop a class of models for 'search-encounter' data, i.e. for detections of recognizable individuals in continuous space, not restricted to trap locations. In our hierarchical model, detection probability is related to the average distance between individual location and the survey path. The locations are allowed to change over time owing to movements of individuals, and individual locations are related formally by a model describing individual activity or home range centre which is itself regarded as a latent variable in the model. We provide a Bayesian analysis of the model in WinBUGS, and develop a custom MCMC algorithm in the R language. 3. The model is applied to simulated data and to territory mapping data for the Willow Tit from the Swiss Breeding Bird Survey MHB. While the observed density was 15 territories per nominal 1 km2 plot of unknown effective sample area, the model produced a density estimate of 21∙12 territories per square km (95% posterior interval: 17–26). 4. Spatial capture–recapture models are relevant to virtually all animal population studies that seek to estimate population size or density, yet existing models have been proposed mainly for conventional sampling using arrays of traps. Our model for search-encounter data, where the spatial pattern of searching can be arbitrary and may change over occasions, greatly expands the scope and utility of spatial capture–recapture models.

  12. Model Independent Search For New Physics At The Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    Choudalakis, Georgios [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States)

    2008-04-01

    The Standard Model of elementary particles can not be the final theory. There are theoretical reasons to expect the appearance of new physics, possibly at the energy scale of few TeV. Several possible theories of new physics have been proposed, each with unknown probability to be confirmed. Instead of arbitrarily choosing to examine one of those theories, this thesis is about searching for any sign of new physics in a model-independent way. This search is performed at the Collider Detector at Fermilab (CDF). The Standard Model prediction is implemented in all final states simultaneously, and an array of statistical probes is employed to search for significant discrepancies between data and prediction. The probes are sensitive to overall population discrepancies, shape disagreements in distributions of kinematic quantities of final particles, excesses of events of large total transverse momentum, and local excesses of data expected from resonances due to new massive particles. The result of this search, first in 1 fb-1 and then in 2 fb-1, is null, namely no considerable evidence of new physics was found.

  13. Experiments Toward the Application of Multi-Robot Systems to Disaster-Relief Scenarios

    Science.gov (United States)

    2015-09-01

    EW LiDAR15 with a Dynamixel servo . This Hokuyo LiDAR has a 270◦ field of view, 30-m range, and 1-mm resolution. Accurate state information is achieved...in disaster-relief scenarios. 28 8. References 1. Murphy RR. Disaster robotics. MIT Press ; 2014. 2. Guizzo E. Fukushima robot operator writes tell-all...Control Conference; 28. LaValle SM. Planning algorithms. Cambridge university press ; 2006. 29. Likhachev M. Search-Based Planning Library. https

  14. A Model Independent General Search for new physics in ATLAS

    CERN Document Server

    Amoroso, S; The ATLAS collaboration

    2016-01-01

    We present results of a model-independent general search for new phenomena in proton-proton collisions at a centre-of-mass energy of 8 TeV with the ATLAS detector at the LHC. The data set corresponds to a total integrated luminosity of 20.3~\\ifb. Event topologies involving isolated electrons, photons and muons, as well as jets, including those identified as originating from \\textit{b}-quarks (\\textit{b}-jets) and missing transverse momentum are investigated. The events are subdivided according to their final states into exclusive event classes. For the 697 classes with a Standard Model expectation greater than 0.1 events, a search algorithm tests the compatibility of data against the Monte Carlo simulated background in three kinematic variables sensitive to new physics effects. No significant deviation is found in data. The number and size of the observed deviations follow the Standard Model expectation obtained from simulated pseudo-experiments.

  15. A Model Independent General Search for new physics in ATLAS

    Science.gov (United States)

    Amoroso, S.; ATLAS Collaboration

    2016-04-01

    We present results of a model-independent general search for new phenomena in proton-proton collisions at a centre-of-mass energy of 8 TeV with the ATLAS detector at the LHC. The data set corresponds to a total integrated luminosity of 20.3 fb-1. Event topologies involving isolated electrons, photons and muons, as well as jets, including those identified as originating from b-quarks (b-jets) and missing transverse momentum are investigated. The events are subdivided according to their final states into exclusive event classes. For the 697 classes with a Standard Model expectation greater than 0.1 events, a search algorithm tests the compatibility of data against the Monte Carlo simulated background in three kinematic variables sensitive to new physics effects. No significant deviation is found in data. The number and size of the observed deviations follow the Standard Model expectation obtained from simulated pseudo-experiments.

  16. Semantic Models for Scalable Search in the Internet of Things

    Directory of Open Access Journals (Sweden)

    Dennis Pfisterer

    2013-03-01

    Full Text Available The Internet of Things is anticipated to connect billions of embedded devices equipped with sensors to perceive their surroundings. Thereby, the state of the real world will be available online and in real-time and can be combined with other data and services in the Internet to realize novel applications such as Smart Cities, Smart Grids, or Smart Healthcare. This requires an open representation of sensor data and scalable search over data from diverse sources including sensors. In this paper we show how the Semantic Web technologies RDF (an open semantic data format and SPARQL (a query language for RDF-encoded data can be used to address those challenges. In particular, we describe how prediction models can be employed for scalable sensor search, how these prediction models can be encoded as RDF, and how the models can be queried by means of SPARQL.

  17. Beyond the Standard Model Higgs searches at the LHC

    CERN Document Server

    Meridiani, P

    2015-01-01

    The Run I at the LHC marks the birth of the "Higgs physics", a path which will be followed at its full extent in the future runs of the LHC. Indeed there are two complementary paths to be followed to new physics in the Higgs sector: precision measurements of the Higgs properties (couplings, mass, spin and parity), where new physics can manifest as deviation from the Standard Model, or direct search for processes not foreseen in the Standard Model (Higgs decays not foreseen in the Standard Model, additional scalars which would indicate an extended Higgs sector). The current status of these studies at the LHC is presented, focussing in particular on the direct searches for rare or invisible Higgs decays or for an extended Higgs sector. The results are based on the analysis of the proton-proton collisions at 7 and 8 TeV center-of-mass energy at the LHC by the ATLAS and CMS collaborations.

  18. An information search model for online social Networks - MOBIRSE

    Directory of Open Access Journals (Sweden)

    Miguel Angel Niño Zambrano

    2015-09-01

    Full Text Available Online Social Networks (OSNs have been gaining great importance among Internet users in recent years.  These are sites where it is possible to meet people, publish, and share content in a way that is both easy and free of charge. As a result, the volume of information contained in these websites has grown exponentially, and web search has consequently become an important tool for users to easily find information relevant to their social networking objectives. Making use of ontologies and user profiles can make these searches more effective. This article presents a model for Information Retrieval in OSNs (MOBIRSE based on user profile and ontologies which aims to improve the relevance of retrieved information on these websites. The social network Facebook was chosen for a case study and as the instance for the proposed model. The model was validated using measures such as At-k Precision and Kappa statistics, to assess its efficiency.

  19. Connections between the seesaw model and dark matter searches

    International Nuclear Information System (INIS)

    Adulpravitchai, Adisorn; Gu Peihong; Lindner, Manfred

    2010-01-01

    In some dark matter models, the coupling of the dark matter particle to the standard model Higgs determines the dark matter relic density while it is also consistent with dark matter direct-detection experiments. On the other hand, the seesaw model for generating the neutrino masses probably arises from a spontaneous symmetry breaking of global lepton number. The dark matter particle thus can significantly annihilate into massless Majorons when the lepton number-breaking scale and hence the seesaw scale are near the electroweak scale. This leads to an interesting interplay between neutrino physics and dark matter physics, and the annihilation mode has an interesting implication on dark matter searches.

  20. Search for the Standard Model Higgs Boson at LEP

    CERN Document Server

    Barate, R.; De Bonis, I.; Decamp, D.; Goy, C.; Jezequel, S.; Lees, J.P.; Martin, F.; Merle, E.; Minard, M.N.; Pietrzyk, B.; Trocme, B.; Boix, G.; Bravo, S.; Casado, M.P.; Chmeissani, M.; Crespo, J.M.; Fernandez, E.; Fernandez-Bosman, M.; Garrido, L.; Grauges, E.; Lopez, J.; Martinez, M.; Merino, G.; Miquel, R.; Mir, L.M.; Pacheco, A.; Paneque, D.; Ruiz, H.; Heister, A.; Schael, S.; Colaleo, A.; Creanza, D.; De Filippis, N.; de Palma, M.; Iaselli, G.; Maggi, G.; Maggi, M.; Nuzzo, S.; Ranieri, A.; Raso, G.; Ruggieri, F.; Selvaggi, G.; Silvestris, L.; Tempesta, P.; Tricomi, A.; Zito, G.; Huang, X.; Lin, J.; Quyang, Q.; Wang, T.; Xie, Y.; Xu, R.; Xue, S.; Zhang, J.; Zhang, L.; Zhao, W.; Abbaneo, D.; Azzurri, P.; Barklow, T.; Buchmuller, O.; Cattaneo, M.; Cerutti, F.; Clerbaux, B.; Drevermann, H.; Forty, R.W.; Frank, M.; Gianotti, F.; Greening, T.C.; Hansen, J.B.; Harvey, J.; Hutchcroft, D.E.; Janot, P.; Jost, B.; Kado, M.; Maley, P.; Mato, P.; Moutoussi, A.; Ranjard, F.; Rolandi, Gigi; Schlatter, D.; Sguazzoni, G.; Tejessy, W.; Teubert, F.; Valassi, A.; Videau, I.; Ward, J.J.; Badaud, F.; Dessagne, S.; Falvard, A.; Fayolle, D.; Gay, P.; Jousset, J.; Michel, B.; Monteil, S.; Pallin, D.; Pascolo, J.M.; Perret, P.; Hansen, J.D.; Hansen, J.R.; Hansen, P.H.; Nilsson, B.S.; Waananen, A.; Kyriakis, A.; Markou, C.; Simopoulou, E.; Vayaki, A.; Zachariadou, K.; Blondel, A.; Brient, J.C.; Machefert, F.; Rouge, A.; Swynghedauw, M.; Tanaka, R.; Videau, H.; Ciulli, V.; Focardi, E.; Parrini, G.; Antonelli, A.; Antonelli, M.; Bencivenni, G.; Bologna, G.; Bossi, F.; Campana, P.; Capon, G.; Chiarella, V.; Laurelli, P.; Mannocchi, G.; Murtas, F.; Murtas, G.P.; Passalacqua, L.; Pepe-Altarelli, M.; Spagnolo, P.; Kennedy, J.; Lynch, J.G.; Negus, P.; O'Shea, V.; Smith, D.; Thompson, A.S.; Wasserbaech, S.; Cavanaugh, R.; Dhamotharan, S.; Geweniger, C.; Hanke, P.; Hepp, V.; Kluge, E.E.; Leibenguth, G.; Putzer, A.; Stenzel, H.; Tittel, K.; Werner, S.; Wunsch, M.; Beuselinck, R.; Binnie, D.M.; Cameron, W.; Davies, G.; Dornan, P.J.; Girone, M.; Hill, R.D.; Marinelli, N.; Nowell, J.; Przysiezniak, H.; Rutherford, S.A.; Sedgbeer, J.K.; Thompson, J.C.; White, R.; Ghete, V.M.; Girtler, P.; Kneringer, E.; Kuhn, D.; Rudolph, G.; Bouhova-Thacker, E.; Bowdery, C.K.; Clarke, D.P.; Ellis, G.; Finch, A.J.; Foster, F.; Hughes, G.; Jones, R.W.L.; Pearson, M.R.; Robertson, N.A.; Smizanska, M.; Lemaitre, V.; Blumenschein, U.; Holldorfer, F.; Jakobs, K.; Kayser, F.; Kleinknecht, K.; Muller, A.S.; Quast, G.; Renk, B.; Sander, H.G.; Schmeling, S.; Wachsmuth, H.; Zeitnitz, C.; Ziegler, T.; Bonissent, A.; Carr, J.; Coyle, P.; Curtil, C.; Ealet, A.; Fouchez, D.; Leroy, O.; Kachelhoffer, T.; Payre, P.; Rousseau, D.; Tilquin, A.; Ragusa, F.; David, A.; Dietl, H.; Ganis, G.; Huttmann, K.; Lutjens, G.; Mannert, C.; Manner, W.; Moser, H.G.; Settles, R.; Wolf, G.; Boucrot, J.; Callot, O.; Davier, M.; Duflot, L.; Grivaz, J.F.; Heusse, P.; Jacholkowska, A.; Loomis, C.; Serin, L.; Veillet, J.J.; de Vivie de Regie, J.B.; Yuan, C.; Bagliesi, Giuseppe; Boccali, T.; Foa, L.; Giammanco, A.; Giassi, A.; Ligabue, F.; Messineo, A.; Palla, F.; Sanguinetti, G.; Sciaba, A.; Tenchini, R.; Venturi, A.; Verdini, P.G.; Awunor, O.; Blair, G.A.; Coles, J.; Cowan, G.; Garcia-Bellido, A.; Green, M.G.; Jones, L.T.; Medcalf, T.; Misiejuk, A.; Strong, J.A.; Teixeira-Dias, P.; Clifft, R.W.; Edgecock, T.R.; Norton, P.R.; Tomalin, I.R.; Bloch-Devaux, Brigitte; Boumediene, D.; Colas, P.; Fabbro, B.; Lancon, E.; Lemaire, M.C.; Locci, E.; Perez, P.; Rander, J.; Renardy, J.F.; Rosowsky, A.; Seager, P.; Trabelsi, A.; Tuchming, B.; Vallage, B.; Konstantinidis, N.; Litke, A.M.; Taylor, G.; Booth, C.N.; Cartwright, S.; Combley, F.; Hodgson, P.N.; Lehto, M.; Thompson, L.F.; Affholderbach, K.; Boehrer, Armin; Brandt, S.; Grupen, C.; Hess, J.; Ngac, A.; Prange, G.; Sieler, U.; Borean, C.; Giannini, G.; He, H.; Putz, J.; Rothberg, J.; Armstrong, S.R.; Berkelman, Karl; Cranmer, K.; Ferguson, D.P.S.; Gao, Y.; Gonzalez, S.; Hayes, O.J.; Hu, H.; Jin, S.; Kile, J.; McNamara, P.A., III; Nielsen, J.; Pan, Y.B.; von Wimmersperg-Toeller, J.H.; Wiedenmann, W.; Wu, J.; Wu, S.L.; Wu, X.; Zobernig, G.; Dissertori, G.; Abdallah, J.; Abreu, P.; Adam, W.; Adzic, P.; Albrecht, T.; Alderweireld, T.; Alemany-Fernandez, R.; Allmendinger, T.; Allport, P.P.; Amaldi, U.; Amapane, N.; Amato, S.; Anashkin, E.; Andreazza, A.; Andringa, S.; Anjos, N.; Antilogus, P.; Apel, W.D.; Arnoud, Y.; Ask, S.; Asman, B.; Augustin, J.E.; Augustinus, A.; Baillon, P.; Ballestrero, A.; Bambade, P.; Barbier, R.; Bardin, D.; Barker, G.J.; Baroncelli, A.; Battaglia, M.; Baubillier, M.; Becks, K.H.; Begalli, M.; Behrmann, A.; Ben-Haim, E.; Benekos, N.; Benvenuti, A.; Berat, C.; Berggren, M.; Berntzon, L.; Bertrand, D.; Besancon, M.; Besson, N.; Bloch, D.; Blom, M.; Bluj, M.; Bonesini, M.; Boonekamp, M.; Booth, P.S.L.; Borisov, G.; Botner, O.; Bouquet, B.; Bowcock, T.J.V.; Boyko, I.; Bracko, M.; Brenner, R.; Brodet, E.; Bruckman, P.; Brunet, J.M.; Bugge, L.; Buschmann, P.; Calvi, M.; Camporesi, T.; Canale, V.; Carena, F.; Castro, Nuno Filipe; Cavallo, F.; Chapkin, M.; Charpentier, P.; Checchia, P.; Chierici, R.; Chliapnikov, P.; Chudoba, J.; Chung, S.U.; Cieslik, K.; Collins, P.; Contri, R.; Cosme, G.; Cossutti, F.; Costa, M.J.; Crawley, B.; Crennell, D.; Cuevas, J.; DHondt, J.; Dalmau, J.; da Silva, T.; Da Silva, W.; Della Ricca, G.; De Angelis, A.; De Boer, W.; De Clercq, C.; De Lotto, B.; De Maria, N.; De Min, A.; de Paula, L.; Di Ciaccio, L.; Di Simone, A.; Doroba, K.; Drees, J.; Dris, M.; Eigen, G.; Ekelof, T.; Ellert, M.; Elsing, M.; Espirito Santo, M.C.; Fanourakis, G.; Fassouliotis, D.; Feindt, M.; Fernandez, J.; Ferrer, A.; Ferro, F.; Flagmeyer, U.; Foeth, H.; Fokitis, E.; Fulda-Quenzer, F.; Fuster, J.; Gandelman, M.; Garcia, C.; Gavillet, P.; Gazis, Evangelos; Gokieli, R.; Golob, B.; Gomez-Ceballos, G.; Goncalves, P.; Graziani, E.; Grosdidier, G.; Grzelak, K.; Guy, J.; Haag, C.; Hallgren, A.; Hamacher, K.; Hamilton, K.; Hansen, J.; Haug, S.; Hauler, F.; Hedberg, V.; Hennecke, M.; Herr, H.; Hoffman, J.; Holmgren, S.O.; Holt, P.J.; Houlden, M.A.; Hultqvist, K.; Jackson, John Neil; Jarlskog, G.; Jarry, P.; Jeans, D.; Johansson, Erik Karl; Johansson, P.D.; Jonsson, P.; Joram, C.; Jungermann, L.; Kapusta, Frederic; Katsanevas, S.; Katsoufis, E.; Kernel, G.; Kersevan, B.P.; Kiiskinen, A.; King, B.T.; Kjaer, N.J.; Kluit, P.; Kokkinias, P.; Kourkoumelis, C.; Kouznetsov, O.; Krumstein, Z.; Kucharczyk, M.; Lamsa, J.; Leder, G.; Ledroit, Fabienne; Leinonen, L.; Leitner, R.; Lemonne, J.; Lepeltier, V.; Lesiak, T.; Liebig, W.; Liko, D.; Lipniacka, A.; Lopes, J.H.; Lopez, J.M.; Loukas, D.; Lutz, P.; Lyons, L.; MacNaughton, J.; Malek, A.; Maltezos, S.; Mandl, F.; Marco, J.; Marco, R.; Marechal, B.; Margoni, M.; Marin, J.C.; Mariotti, C.; Markou, A.; Martinez-Rivero, C.; Masik, J.; Mastroyiannopoulos, N.; Matorras, F.; Matteuzzi, C.; Mazzucato, F.; Mazzucato, M.; McNulty, R.; Meroni, C.; Meyer, W.T.; Migliore, E.; Mitaroff, W.; Mjoernmark, U.; Moa, T.; Moch, M.; Monig, Klaus; Monge, R.; Montenegro, J.; Moraes, D.; Moreno, S.; Morettini, P.; Mueller, U.; Muenich, K.; Mulders, M.; Mundim, L.; Murray, W.; Muryn, B.; Myatt, G.; Myklebust, T.; Nassiakou, M.; Navarria, F.; Nawrocki, K.; Nicolaidou, R.; Nikolenko, M.; Oblakowska-Mucha, A.; Obraztsov, V.; Olshevski, A.; Onofre, A.; Orava, R.; Osterberg, K.; Ouraou, A.; Oyanguren, A.; Paganoni, M.; Paiano, S.; Palacios, J.P.; Palka, H.; Papadopoulou, T.D.; Pape, L.; Parkes, C.; Parodi, F.; Parzefall, U.; Passeri, A.; Passon, O.; Peralta, L.; Perepelitsa, V.; Perrotta, A.; Petrolini, A.; Piedra, J.; Pieri, L.; Pierre, F.; Pimenta, M.; Piotto, E.; Podobnik, T.; Poireau, V.; Pol, M.E.; Polok, G.; Poropat, P.; Pozdniakov, V.; Pukhaeva, N.; Pullia, A.; Rames, J.; Ramler, L.; Read, Alexander L.; Rebecchi, P.; Rehn, J.; Reid, D.; Reinhardt, R.; Renton, P.; Richard, F.; Ridky, J.; Rivero, M.; Rodriguez, D.; Romero, A.; Ronchese, P.; Rosenberg, E.; Roudeau, P.; Rovelli, T.; Ruhlmann-Kleider, V.; Ryabtchikov, D.; Sadovsky, A.; Salmi, L.; Salt, J.; Savoy-Navarro, A.; Schwickerath, U.; Segar, A.; Sekulin, R.; Siebel, M.; Sisakian, A.; Smadja, G.; Smirnova, O.; Sokolov, A.; Sopczak, A.; Sosnowski, R.; Spassov, T.; Stanitzki, M.; Stocchi, A.; Strauss, J.; Stugu, B.; Szczekowski, M.; Szeptycka, M.; Szumlak, T.; Tabarelli, T.; Taffard, A.C.; Tegenfeldt, F.; Timmermans, Jan; Tkatchev, L.; Tobin, M.; Todorovova, S.; Tome, B.; Tonazzo, A.; Tortosa, P.; Travnicek, P.; Treille, D.; Tristram, G.; Trochimczuk, M.; Troncon, C.; Turluer, M.L.; Tyapkin, I.A.; Tyapkin, P.; Tzamarias, S.; Uvarov, V.; Valenti, G.; Van Dam, Piet; Van Eldik, J.; Van Lysebetten, A.; Van Remortel, N.; Van Vulpen, I.; Vegni, G.; Veloso, F.; Venus, W.; Verbeure, F.; Verdier, P.; Verzi, V.; Vilanova, D.; Vitale, L.; Vrba, V.; Wahlen, H.; Washbrook, A.J.; Weiser, C.; Wicke, D.; Wickens, J.; Wilkinson, G.; Winter, M.; Witek, M.; Yushchenko, O.; Zalewska, A.; Zalewski, P.; Zavrtanik, D.; Zhuravlov, V.; Zimine, N.I.; Zintchenko, A.; Zupan, M.; Achard, P.; Adriani, O.; Aguilar-Benitez, M.; Alcaraz, J.; Alemanni, G.; Allaby, J.; Aloisio, A.; Alviggi, M.G.; Anderhub, H.; Andreev, Valery P.; Anselmo, F.; Arefiev, A.; Azemoon, T.; Aziz, T.; Baarmand, M.; Bagnaia, P.; Bajox, A.; Baksay, G.; Baksay, L.; Baldew, S.V.; Banerjee, S.; Barczyk, A.; Barillere, R.; Bartalini, P.; Basile, M.; Batalova, N.; Battiston, R.; Bay, A.; Becattini, F.; Becker, U.; Behner, F.; Bellucci, L.; Berbeco, R.; Berdugo, J.; Berges, P.; Bertucci, B.; Betev, B.L.; Biasini, M.; Biglietti, M.; Biland, A.; Blaising, J.J.; Blyth, S.C.; Bobbink, G.J.; Bohm, A.; Boldizsar, L.; Borgia, B.; Bourilkov, D.; Bourquin, M.; Braccini, S.; Branson, J.G.; Brochu, F.; Buijs, A.; Burger, J.D.; Burger, W.J.; Cai, X.D.; Capell, M.; Cara Romeo, G.; Carlino, G.; Cartacci, A.; Casau, J.; Cavallari, F.; Cavallo, N.; Cecchi, C.; Cerrada, M.; Chamizo, M.; Chang, Y.H.; Chemarin, M.; Chen, A.; Chen, G.; Chen, G.M.; Chen, H.F.; Chen, H.S.; Chiefari, G.; Cifarelli, L.; Cindolo, F.; Clare, I.; Clare, R.; Coignet, G.; Colino, N.; Costantini, S.; de la Cruz, B.; Cucciarelli, S.; Dai, T.S.; van Dalen, J.A.; de Asmundis, R.; Deglont, P.; Debreczeni, J.; Degre, A.; Deiters, K.; della Volpe, D.; Delmeire, E.; Denes, P.; De Notaristefani, F.; De Salvo, A.; Diemoz, M.; Dierckxsens, M.; van Dierendonck, D.; Dionisi, C.; Dittmar, M.; Doria, A.; Dova, M.T.; Duchesneau, D.; Duinker, P.; Echenard, B.; Eline, A.; El Mamouni, H.; Engler, A.; Eppling, F.J.; Ewers, A.; Extermann, P.; Falagan, M.A.; Falciano, S.; Favara, A.; Fay, J.; Fedin, O.; Felcini, M.; Ferguson, T.; Fesefeldt, H.; Fiandrini, E.; Field, J.H.; Filthaut, F.; Fisher, P.H.; Fisher, W.; Fisk, I.; Forconi, G.; Freudenreich, K.; Furetta, C.; Galaktionov, Iouri; Ganguli, S.N.; Garcia-Abia, Pablo; Gataullin, M.; Gentile, S.; Giagu, S.; Gong, Z.F.; Grenier, Gerald Jean; Grimm, O.; Gruenewald, M.W.; Guida, M.; van Gulik, R.; Gupta, V.K.; Gurtu, A.; Gutay, L.J.; Haas, D.; Hatzifotiadou, D.; Hebbeker, T.; Herve, Alain; Hirschfelder, J.; Hofer, H.; Holzner, G.; Hou, S.R.; Hu, Y.; Jin, B.N.; Jones, Lawrence W.; de Jong, P.; Josa-Mutuberria, I.; Kafer, D.; Kaur, M.; Kienzle-Focacci, M.N.; Kim, J.K.; Kirkby, Jasper; Kittel, W.; Klimentov, A.; Konig, A.C.; Kopal, M.; Koutsenko, V.; Kraber, M.; Kraemer, R.W.; Krenz, W.; Kruger, A.; Kunin, A.; Ladron de Guevara, P.; Laktineh, I.; Landi, G.; Lebeau, M.; Lebedev, A.; Lebrun, P.; Lecomte, P.; Lecoq, P.; Le Coultre, P.; Lee, H.J.; Le Goff, J.M.; Leiste, R.; Levtchenko, P.; Li, C.; Likhoded, S.; Lin, C.H.; Lin, W.T.; Linde, F.L.; Lista, L.; Liu, Z.A.; Lohmann, W.; Longo, E.; Lu, Y.S.; Lubelsmeyer, K.; Luci, C.; Luckey, David; Luminari, L.; Lustermann, W.; Ma, W.G.; Malgeri, L.; Malinin, A.; Mana, C.; Mangeol, D.; Mans, J.; Martin, J.P.; Marzano, F.; Mazumdar, K.; McNeil, R.R.; Mele, S.; Merola, L.; Meschini, M.; Metzger, W.J.; Mihul, A.; Milcent, H.; Mirabelli, G.; Mnich, J.; Mohanty, G.B.; Muanza, G.S.; Muijs, A.J.M.; Musicar, B.; Musy, M.; Nagy, S.; Napolitano, M.; Nessi-Tedaldi, F.; Newman, H.; Niessen, T.; Nisati, A.; Kluge, Hannelies; Ofierzynski, R.; Organtini, G.; Palomares, C.; Pandoulas, D.; Paolucci, P.; Paramatti, R.; Passaleva, G.; Patricelli, S.; Paul, Thomas Cantzon; Pauluzzi, M.; Paus, C.; Pauss, F.; Pedace, M.; Pensotti, S.; Perret-Gallix, D.; Petersen, B.; Piccolo, D.; Pierella, F.; Piroue, P.A.; Pistolesi, E.; Plyaskin, V.; Pohl, M.; Pojidaev, V.; Postema, H.; Pothier, J.; Prokofiev, D.O.; Prokofiev, D.; Quartieri, J.; Rahal-Callot, G.; Rahaman, Mohammad Azizur; Raics, P.; Raja, N.; Ramelli, R.; Rancoita, P.G.; Ranieri, R.; Raspereza, A.; Razis, P.; Ren, D.; Rescigno, M.; Reucroft, S.; Riemann, S.; Riles, Keith; Roe, B.P.; Romero, L.; Rosca, A.; Rosier-Lee, S.; Roth, Stefan; Rosenbleck, C.; Roux, B.; Rubio, J.A.; Ruggiero, G.; Rykaczewski, H.; Sakharov, A.; Saremi, S.; Sarkar, S.; Salicio, J.; Sanchez, E.; Sanders, M.P.; Schafer, C.; Schegelsky, V.; Schmidt-Kaerst, S.; Schmitz, D.; Schopper, H.; Schotanus, D.J.; Schwering, G.; Sciacca, C.; Servoli, L.; Shevchenko, S.; Shivarov, N.; Shoutko, V.; Shumilov, E.; Shvorob, A.; Siedenburg, T.; Son, D.; Spillantini, P.; Steuer, M.; Stickland, D.P.; Stoyanov, B.; Straessner, A.; Sudhakar, K.; Sultanov, G.; Sun, L.Z.; Sushkov, S.; Suter, H.; Swain, J.D.; Szillasi, Z.; Tang, X.W.; Tarjan, P.; Tauscher, L.; Taylor, L.; Tellili, B.; Teyssier, D.; Timmermans, Charles; Ting, Samuel C.C.; Ting, S.M.; Tonwar, S.C.; Toth, J.; Tully, C.; Tung, K.L.; Uchida, Y.; Ulbricht, J.; Valente, E.; Van de Walle, R.T.; Veszpremi, V.; Vesztergombi, G.; Vetlitsky, I.; Vicinanza, D.; Viertel, G.; Villa, S.; Vivargent, M.; Vlachos, S.; Vodopianov, I.; Vogel, H.; Vogt, H.; Vorobiev, I.; Vorobyov, A.A.; Wadhwa, M.; Wallraff, W.; Wang, M.; Wang, X.L.; Wang, Z.M.; Weber, M.; Wienemann, P.; Wilkens, H.; Wu, S.X.; Wynhoff, S.; Xia, L.; Xu, Z.Z.; Yamamoto, J.; Yang, B.Z.; Yang, C.G.; Yang, H.J.; Yang, M.; Yeh, S.C.; Zalite, A.; Zalite, Yu.; Zhang, Z.P.; Zhao, J.; Zhu, G.Y.; Zhu, R.Y.; Zhuang, H.L.; Zichichi, A.; Zilizi, G.; Zimmermann, B.; Zoller, M.; Abbiendi, G.; Ainsley, C.; Akesson, P.F.; Alexander, G.; Allison, John; Amaral, P.; Anagnostou, G.; Anderson, K.J.; Arcelli, S.; Asai, S.; Axen, D.; Azuelos, G.; Bailey, I.; Barberio, E.; Barlow, R.J.; Batley, R.J.; Bechtle, P.; Behnke, T.; Bell, Kenneth Watson; Bell, P.J.; Bella, G.; Bellerive, A.; Benelli, G.; Bethke, S.; Biebel, O.; Bloodworth, I.J.; Boeriu, O.; Bock, P.; Bonacorsi, D.; Boutemeur, M.; Braibant, S.; Brigliadori, L.; Brown, Robert M.; Buesser, K.; Burckhart, H.J.; Campana, S.; Carnegie, R.K.; Caron, B.; Carter, A.A.; Carter, J.R.; Chang, C.Y.; Charlton, David G.; Csilling, A.; Cuffiani, M.; Dado, S.; Dallavalle, G.Marco; Dallison, S.; De Roeck, A.; De Wolf, E.A.; Desch, K.; Dienes, B.; Donkers, M.; Dubbert, J.; Duchovni, E.; Duckeck, G.; Duerdoth, I.P.; Elfgren, E.; Etzion, E.; Fabbri, F.; Feld, L.; Ferrari, P.; Fiedler, F.; Fleck, I.; Ford, M.; Frey, A.; Furtjes, A.; Gagnon, P.; Gary, John William; Gaycken, G.; Geich-Gimbel, C.; Giacomelli, G.; Giacomelli, P.; Giunta, Marina; Goldberg, J.; Gross, E.; Grunhaus, J.; Gruwe, M.; Gunther, P.O.; Gupta, A.; Hajdu, C.; Hamann, M.; Hanson, G.G.; Harder, K.; Harel, A.; Harin-Dirac, M.; Hauschild, M.; Hauschildt, J.; Hawkes, C.M.; Hawkings, R.; Hemingway, R.J.; Hensel, C.; Herten, G.; Heuer, R.D.; Hill, J.C.; Hoffman, Kara Dion; Homer, R.J.; Horvath, D.; Howard, R.; Huntemeyer, P.; Igo-Kemenes, P.; Ishii, K.; Jeremie, H.; Jovanovic, P.; Junk, T.R.; Kanaya, N.; Kanzaki, J.; Karapetian, G.; Karlen, D.; Kartvelishvili, V.; Kawagoe, K.; Kawamoto, T.; Keeler, R.K.; Kellogg, R.G.; Kennedy, B.W.; Kim, D.H.; Klein, K.; Klier, A.; Kluth, S.; Kobayashi, T.; Kobel, M.; Komamiya, S.; Kormos, Laura L.; Kowalewski, Robert V.; Kramer, T.; Kress, T.; Krieger, P.; von Krogh, J.; Krop, D.; Kruger, K.; Kupper, M.; Lafferty, G.D.; Landsman, H.; Lanske, D.; Layter, J.G.; Leins, A.; Lellouch, D.; Letts, J.; Levinson, L.; Lillich, J.; Lloyd, S.L.; Loebinger, F.K.; Lu, J.; Ludwig, J.; Macpherson, A.; Mader, W.; Marcellini, S.; Marchant, T.E.; Martin, A.J.; Masetti, G.; Mashimo, T.; Mattig, Peter; McDonald, W.J.; McKenna, J.; McMahon, T.J.; McPherson, R.A.; Meijers, F.; Mendez-Lorenzo, P.; Menges, W.; Merritt, F.S.; Mes, H.; Michelini, A.; Mihara, S.; Mikenberg, G.; Miller, D.J.; Moed, S.; Mohr, W.; Mori, T.; Mutter, A.; Nagai, K.; Nakamura, I.; Neal, H.A.; Nisius, R.; ONeale, S.W.; Oh, A.; Okpara, A.; Oreglia, M.J.; Orito, S.; Pahl, C.; Pasztor, G.; Pater, J.R.; Patrick, G.N.; Pilcher, J.E.; Pinfold, J.; Plane, David E.; Poli, B.; Polok, J.; Pooth, O.; Przybycien, M.; Quadt, A.; Rabbertz, K.; Rembser, C.; Renkel, P.; Rick, H.; Roney, J.M.; Rosati, S.; Rozen, Y.; Runge, K.; Sachs, K.; Saeki, T.; Sahr, O.; Sarkisyan, E.K.G.; Schaile, A.D.; Schaile, O.; Scharff-Hansen, P.; Schieck, J.; Schoerner-Sadenius, Thomas; Schroder, Matthias; Schumacher, M.; Schwick, C.; Scott, W.G.; Seuster, R.; Shears, T.G.; Shen, B.C.; Shepherd-Themistocleous, C.H.; Sherwood, P.; Siroli, G.; Skuja, A.; Smith, A.M.; Sobie, R.; Soldner-Rembold, S.; Spagnolo, S.; Spano, F.; Stahl, A.; Stephens, K.; Strom, David M.; Strohmer, R.; Tarem, S.; Tasevsky, M.; Taylor, R.J.; Teuscher, R.; Thomson, M.A.; Torrence, E.; Toya, D.; Tran, P.; Trefzger, T.; Tricoli, A.; Trigger, I.; Trocsanyi, Z.; Tsur, E.; Turner-Watson, M.F.; Ueda, I.; Ujvari, B.; Vachon, B.; Vollmer, C.F.; Vannerem, P.; Verzocchi, M.; Voss, H.; Vossebeld, J.; Waller, D.; Ward, C.P.; Ward, D.R.; Watkins, P.M.; Watson, A.T.; Watson, N.K.; Wells, P.S.; Wengler, T.; Wermes, N.; Wetterling, D.; Wilson, G.W.; Wilson, J.A.; Wyatt, T.R.; Yamashita, S.; Zer-Zion, D.; Zivkovic, Lidija; Heinemeyer, S.; Weiglein, G.

    2003-01-01

    The four LEP collaborations, ALEPH, DELPHI, L3 and OPAL, have collected a total of 2461 pb-1 of e+e- collision data at centre-of-mass energies between 189 and 209 GeV. The data are used to search for the Standard Model Higgs boson. The search results of the four collaborations are combined and examined in a likelihood test for their consistency with two hypotheses: the background hypothesis and the signal plus background hypothesis. The corresponding confidences have been computed as functions of the hypothetical Higgs boson mass. A lower bound of 114.4 GeV/c2 is established, at the 95% confidence level, on the mass of the Standard Model Higgs boson. The LEP data are also used to set upper bounds on the HZZ coupling for various assumptions concerning the decay of the Higgs boson.

  1. Searches for Neutral Higgs Bosons in Extended Models

    CERN Document Server

    Abdallah, J; Adam, W; Adzic, P; Albrecht, T; Alderweireld, T; Alemany-Fernandez, R; Allmendinger, T; Allport, P P; Amaldi, Ugo; Amapane, N; Amato, S; Anashkin, E; Andreazza, A; Andringa, S; Anjos, N; Antilogus, P; Apel, W D; Arnoud, Y; Ask, S; Åsman, B; Augustin, J E; Augustinus, A; Baillon, Paul; Ballestrero, A; Bambade, P; Barbier, R; Bardin, Dimitri Yuri; Barker, G J; Baroncelli, A; Battaglia, Marco; Baubillier, M; Becks, K H; Begalli, M; Behrmann, A; Ben-Haim, E; Benekos, N C; Benvenuti, Alberto C; Bérat, C; Berggren, M; Berntzon, L; Bertrand, D; Besançon, M; Besson, N; Bloch, D; Blom, M; Bluj, M; Bonesini, M; Boonekamp, M; Booth, P S L; Borisov, G; Botner, O; Bouquet, B; Bowcock, T J V; Boyko, I; Bracko, M; Brenner, R; Brodet, E; Brückman, P; Brunet, J M; Bugge, L; Buschmann, P; Calvi, M; Camporesi, T; Canale, V; Carena, F; Castro, N; Cavallo, F R; Chapkin, M M; Charpentier, P; Checchia, P; Chierici, R; Shlyapnikov, P; Chudoba, J; Chung, S U; Cieslik, K; Collins, P; Contri, R; Cosme, G; Cossutti, F; Costa, M J; Crennell, D J; Cuevas-Maestro, J; D'Hondt, J; Dalmau, J; Da Silva, T; Da Silva, W; Della Ricca, G; De Angelis, A; de Boer, Wim; De Clercq, C; De Lotto, B; De Maria, N; De Min, A; De Paula, L S; Di Ciaccio, L; Di Simone, A; Doroba, K; Drees, J; Dris, M; Eigen, G; Ekelöf, T J C; Ellert, M; Elsing, M; Espirito-Santo, M C; Fanourakis, G K; Fassouliotis, D; Feindt, M; Fernández, J; Ferrer, A; Ferro, F; Flagmeyer, U; Föth, H; Fokitis, E; Fulda-Quenzer, F; Fuster, J A; Gandelman, M; García, C; Gavillet, P; Gazis, E N; Gokieli, R; Golob, B; Gómez-Ceballos, G; Gonçalves, P; Graziani, E; Grosdidier, G; Grzelak, K; Guy, J; Haag, C; Hallgren, A; Hamacher, K; Hamilton, K; Haug, S; Hauler, F; Hedberg, V; Hennecke, M; Herr, H; Hoffman, J; Holmgren, S O; Holt, P J; Houlden, M A; Hultqvist, K; Jackson, J N; Jarlskog, G; Jarry, P; Jeans, D; Johansson, E K; Johansson, P D; Jonsson, P; Joram, C; Jungermann, L; Kapusta, F; Katsanevas, S; Katsoufis, E C; Kernel, G; Kersevan, B P; Kerzel, U; Kiiskinen, A P; King, B T; Kjaer, N J; Kluit, P; Kokkinias, P; Kourkoumelis, C; Kuznetsov, O; Krumshtein, Z; Kucharczyk, M; Lamsa, J; Leder, G; Ledroit, F; Leinonen, L; Leitner, R; Lemonne, J; Lepeltier, V; Lesiak, T; Liebig, W; Liko, D; Lipniacka, A; Lopes, J H; López, J M; Loukas, D; Lutz, P; Lyons, L; MacNaughton, J; Malek, A; Maltezos, S; Mandl, F; Marco, J; Marco, R; Maréchal, B; Margoni, M; Marin, J C; Mariotti, C; Markou, A; Martínez-Rivero, C; Masik, J; Mastroyiannopoulos, N; Matorras, F; Matteuzzi, C; Mazzucato, F; Mazzucato, M; McNulty, R; Meroni, C; Migliore, E; Mitaroff, W A; Mjörnmark, U; Moa, T; Moch, M; Mönig, K; Monge, R; Montenegro, J; Moraes, D; Moreno, S; Morettini, P; Müller, U; Münich, K; Mulders, M; Mundim, L; Murray, W; Muryn, B; Myatt, G; Myklebust, T; Nassiakou, M; Navarria, Francesco Luigi; Nawrocki, K; Nicolaidou, R; Nikolenko, M; Oblakowska-Mucha, A; Obraztsov, V F; Olshevskii, A G; Onofre, A; Orava, R; Österberg, K; Ouraou, A; Oyanguren, A; Paganoni, M; Paiano, S; Palacios, J P; Palka, H; Papadopoulou, T D; Pape, L; Parkes, C; Parodi, F; Parzefall, U; Passeri, A; Passon, O; Peralta, L; Perepelitsa, V F; Perrotta, A; Petrolini, A; Piedra, J; Pieri, L; Pierre, F; Pimenta, M; Piotto, E; Podobnik, T; Poireau, V; Pol, M E; Polok, G; Pozdnyakov, V; Pukhaeva, N; Pullia, A; Rames, J; Read, A; Rebecchi, P; Rehn, J; Reid, D; Reinhardt, R; Renton, P B; Richard, F; Rídky, J; Rivero, M; Rodríguez, D; Romero, A; Ronchese, P; Roudeau, P; Rovelli, T; Ruhlmann-Kleider, V; Ryabtchikov, D; Sadovskii, A; Salmi, L; Salt, J; Sander, C; Savoy-Navarro, A; Schwickerath, U; Segar, A; Sekulin, R L; Siebel, M; Sissakian, A N; Smadja, G; Smirnova, O G; Sokolov, A; Sopczak, A; Sosnowski, R; Spassoff, Tz; Stanitzki, M; Stocchi, A; Strauss, J; Stugu, B; Szczekowski, M; Szeptycka, M; Szumlak, T; Tabarelli de Fatis, T; Taffard, A C; Tegenfeldt, F; Timmermans, J; Tkatchev, L G; Tobin, M; Todorovova, S; Tomé, B; Tonazzo, A; Tortosa, P; Travnicek, P; Treille, D; Tristram, G; Trochimczuk, M; Troncon, C; Turluer, M L; Tyapkin, I A; Tyapkin, P; Tzamarias, S; Uvarov, V; Valenti, G; van Dam, P; Van Eldik, J; Van Lysebetten, A; Van Remortel, N; Van Vulpen, I; Vegni, G; Veloso, F; Venus, W; Verdier, P; Verzi, V; Vilanova, D; Vitale, L; Vrba, V; Wahlen, H; Washbrook, A J; Weiser, C; Wicke, D; Wickens, J; Wilkinson, G; Winter, M; Witek, M; Yushchenko, O P; Zalewska-Bak, A; Zalewski, P; Zavrtanik, D; Zhuravlov, V; Zimin, N I; Zintchenko, A; Zupan, M

    2004-01-01

    Searches for neutral Higgs bosons produced at LEP in association with Z bosons, in pairs and in the Yukawa process are presented in this paper. Higgs boson decays into b quarks, tau leptons, or other Higgs bosons are considered, giving rise to four-b, four-b+jets, six-b and four-tau final states, as well as mixed modes with b quarks and tau leptons. The whole mass domain kinematically accessible at LEP in these topologies is searched. The analysed data set covers both the LEP1 and LEP2 energy ranges and exploits most of the luminosity recorded by the DELPHI experiment. No convincing evidence for a signal is found, and results are presented in the form of mass-dependent upper bounds on coupling factors (in units of model-independent reference cross-sections) for all processes, allowing interpretation of the data in a large class of models.

  2. Constraints on Z' models from LHC dijet searches

    International Nuclear Information System (INIS)

    Fairbairn, Malcolm; Heal, John; Tunney, Patrick

    2016-05-01

    We analyse a combination of ATLAS and CMS searches for dijet resonances at run I and run II, presenting the results in a way that can be easily applied to a generic Z ' model. As an illustrative example, we consider a simple model of a Z ' coupling to quarks and dark matter. We first study a benchmark case with fixed couplings and then focus on the assumption that the Z ' is responsible for setting the dark matter relic abundance. Dijet constraints place significant bounds on this scenario, allowing us to narrow down the allowed range of dark matter masses for given Z ' mass and width.

  3. Urban search mobile platform modeling in hindered access conditions

    Science.gov (United States)

    Barankova, I. I.; Mikhailova, U. V.; Kalugina, O. B.; Barankov, V. V.

    2018-05-01

    The article explores the control system simulation and the design of the experimental model of the rescue robot mobile platform. The functional interface, a structural functional diagram of the mobile platform control unit, and a functional control scheme for the mobile platform of secure robot were modeled. The task of design a mobile platform for urban searching in hindered access conditions is realized through the use of a mechanical basis with a chassis and crawler drive, a warning device, human heat sensors and a microcontroller based on Arduino platforms.

  4. A Software Control Framework for Learning Coordinated, Multi-Robot Strategies in Open Environments

    National Research Council Canada - National Science Library

    Grupen, Roderic

    2003-01-01

    .... The UMass effort marries high-level process descriptions, discrete event analysis and model checking, learning and stochastic exploration, and a control theoretic substrate to accomplish these goals...

  5. In Search of Optimal Cognitive Diagnostic Model(s) for ESL Grammar Test Data

    Science.gov (United States)

    Yi, Yeon-Sook

    2017-01-01

    This study compares five cognitive diagnostic models in search of optimal one(s) for English as a Second Language grammar test data. Using a unified modeling framework that can represent specific models with proper constraints, the article first fit the full model (the log-linear cognitive diagnostic model, LCDM) and investigated which model…

  6. Model-Independent and Quasi-Model-Independent Search for New Physics at CDF

    OpenAIRE

    CDF Collaboration

    2007-01-01

    Data collected in Run II of the Fermilab Tevatron are searched for indications of new electroweak scale physics. Rather than focusing on particular new physics scenarios, CDF data are analyzed for discrepancies with respect to the standard model prediction. A model-independent approach (Vista) considers the gross features of the data, and is sensitive to new large cross section physics. A quasi-model-independent approach (Sleuth) searches for a significant excess of events with large summed t...

  7. The search for a realistic flipped SU(5) string model

    Energy Technology Data Exchange (ETDEWEB)

    Lopez, J.L. (Center for Theoretical Physics, Texas A and M Univ., College Station, TX (United States) Astroparticle Physics Group, Houston Advanced Research Center (HARC), The Woodlands, TX (United States)); Nanopoulos, D.V. (Center for Theoretical Physics, Texas A and M Univ., College Station, TX (United States) Astroparticle Physics Group, Houston Advanced Research Center (HARC), The Woodlands, TX (United States)); Yuan, K. (Department of Physics and Astronomy, University of Alabama, Tuscaloosa, AL (United States))

    1993-07-05

    We present an extensive search for a class of flipped SU(5) models built within the free fermionic formulation of the heterotic string. We describe a set of algorithms which constitute the basis for a computer program capable of generating systematically the massless spectrum and the superpotential of all possible models within the class we consider. Our search through the huge parameter space to be explored is simplified considerably by the constraint of N=1 spacetime supersymmetry and the need for extra Q, anti Q representations beyond the standard ones in order to possibly achieve string gauge coupling unification at scales of O(10[sup 18] GeV). Our results are remarkably simple and evidence the large degree of redundancy in this kind of constructions. We find one model with gauge group SU(5)xU(1)sub(Y tilde)xSO(10)[sub h]xSU(4)[sub h]xU(1)[sup 5] and fairly acceptable phenomenological properties. We study the D- and F-flatness constraints and the symmetry breaking pattern in this model and conclude that string gauge coupling unification is quite possible. (orig.)

  8. Interpretation of searches for supersymmetry with simplified models

    Energy Technology Data Exchange (ETDEWEB)

    Chatrchyan, S.; Khachatryan, V.; Sirunyan, A. M.; Tumasyan, A.; Adam, W.; Aguilo, E.; Bergauer, T.; Dragicevic, M.; Erö, J.; Fabjan, C.; Friedl, M.; Frühwirth, R.; Ghete, V. M.; Hörmann, N.; Hrubec, J.; Jeitler, M.; Kiesenhofer, W.; Knünz, V.; Krammer, M.; Krätschmer, I.; Liko, D.; Mikulec, I.; Pernicka, M.; Rabady, D.; Rahbaran, B.; Rohringer, C.; Rohringer, H.; Schöfbeck, R.; Strauss, J.; Taurok, A.; Waltenberger, W.; Wulz, C. -E.; Mossolov, V.; Shumeiko, N.; Suarez Gonzalez, J.; Bansal, M.; Bansal, S.; Cornelis, T.; De Wolf, E. A.; Janssen, X.; Luyckx, S.; Mucibello, L.; Ochesanu, S.; Roland, B.; Rougny, R.; Selvaggi, M.; Van Haevermaet, H.; Van Mechelen, P.; Van Remortel, N.; Van Spilbeeck, A.; Blekman, F.; Blyweert, S.; D’Hondt, J.; Gonzalez Suarez, R.; Kalogeropoulos, A.; Maes, M.; Olbrechts, A.; Van Doninck, W.; Van Mulders, P.; Van Onsem, G. P.; Villella, I.; Clerbaux, B.; De Lentdecker, G.; Dero, V.; Gay, A. P. R.; Hreus, T.; Léonard, A.; Marage, P. E.; Mohammadi, A.; Reis, T.; Thomas, L.; Vander Velde, C.; Vanlaer, P.; Wang, J.; Adler, V.; Beernaert, K.; Cimmino, A.; Costantini, S.; Garcia, G.; Grunewald, M.; Klein, B.; Lellouch, J.; Marinov, A.; Mccartin, J.; Ocampo Rios, A. A.; Ryckbosch, D.; Strobbe, N.; Thyssen, F.; Tytgat, M.; Walsh, S.; Yazgan, E.; Zaganidis, N.; Basegmez, S.; Bruno, G.; Castello, R.; Ceard, L.; Delaere, C.; du Pree, T.; Favart, D.; Forthomme, L.; Giammanco, A.; Hollar, J.; Lemaitre, V.; Liao, J.; Militaru, O.; Nuttens, C.; Pagano, D.; Pin, A.; Piotrzkowski, K.; Vizan Garcia, J. M.; Beliy, N.; Caebergs, T.; Daubie, E.; Hammad, G. H.; Alves, G. A.; Correa Martins Junior, M.; Martins, T.; Pol, M. E.; Souza, M. H. G.; Aldá Júnior, W. L.; Carvalho, W.; Custódio, A.; Da Costa, E. M.; De Jesus Damiao, D.; De Oliveira Martins, C.; Fonseca De Souza, S.; Malbouisson, H.; Malek, M.; Matos Figueiredo, D.; Mundim, L.; Nogima, H.; Prado Da Silva, W. L.; Santoro, A.; Soares Jorge, L.; Sznajder, A.; Vilela Pereira, A.; Anjos, T. S.; Bernardes, C. A.; Dias, F. A.; Fernandez Perez Tomei, T. R.; Gregores, E. M.; Lagana, C.; Marinho, F.; Mercadante, P. G.; Novaes, S. F.; Padula, Sandra S.; Genchev, V.; Iaydjiev, P.; Piperov, S.; Rodozov, M.; Stoykova, S.; Sultanov, G.; Tcholakov, V.; Trayanov, R.; Vutova, M.; Dimitrov, A.; Hadjiiska, R.; Kozhuharov, V.; Litov, L.; Pavlov, B.; Petkov, P.; Bian, J. G.; Chen, G. M.; Chen, H. S.; Jiang, C. H.; Liang, D.; Liang, S.; Meng, X.; Tao, J.; Wang, J.; Wang, X.; Wang, Z.; Xiao, H.; Xu, M.; Zang, J.; Zhang, Z.; Asawatangtrakuldee, C.; Ban, Y.; Guo, Y.; Li, W.; Liu, S.; Mao, Y.; Qian, S. J.; Teng, H.; Wang, D.; Zhang, L.; Zou, W.; Avila, C.; Gomez, J. P.; Gomez Moreno, B.; Osorio Oliveros, A. F.; Sanabria, J. C.; Godinovic, N.; Lelas, D.; Plestina, R.; Polic, D.; Puljak, I.; Antunovic, Z.; Kovac, M.; Brigljevic, V.; Duric, S.; Kadija, K.; Luetic, J.; Mekterovic, D.; Morovic, S.; Attikis, A.; Galanti, M.; Mavromanolakis, G.; Mousa, J.; Nicolaou, C.; Ptochos, F.; Razis, P. A.; Finger, M.; Finger, M.; Assran, Y.; Elgammal, S.; Ellithi Kamel, A.; Mahmoud, M. A.; Mahrous, A.; Radi, A.; Kadastik, M.; Müntel, M.; Raidal, M.; Rebane, L.; Tiko, A.; Eerola, P.; Fedi, G.; Voutilainen, M.; Härkönen, J.; Heikkinen, A.; Karimäki, V.; Kinnunen, R.; Kortelainen, M. J.; Lampén, T.; Lassila-Perini, K.; Lehti, S.; Lindén, T.; Luukka, P.; Mäenpää, T.; Peltola, T.; Tuominen, E.; Tuominiemi, J.; Tuovinen, E.; Ungaro, D.; Wendland, L.; Banzuzi, K.; Karjalainen, A.; Korpela, A.; Tuuva, T.; Besancon, M.; Choudhury, S.; Dejardin, M.; Denegri, D.; Fabbro, B.; Faure, J. L.; Ferri, F.; Ganjour, S.; Givernaud, A.; Gras, P.; Hamel de Monchenault, G.; Jarry, P.; Locci, E.; Malcles, J.; Millischer, L.; Nayak, A.; Rander, J.; Rosowsky, A.; Titov, M.; Baffioni, S.; Beaudette, F.; Benhabib, L.; Bianchini, L.; Bluj, M.; Busson, P.; Charlot, C.; Daci, N.; Dahms, T.; Dalchenko, M.; Dobrzynski, L.; Florent, A.; Granier de Cassagnac, R.; Haguenauer, M.; Miné, P.; Mironov, C.; Naranjo, I. N.; Nguyen, M.; Ochando, C.; Paganini, P.; Sabes, D.; Salerno, R.; Sirois, Y.; Veelken, C.; Zabi, A.; Agram, J. -L.; Andrea, J.; Bloch, D.; Bodin, D.; Brom, J. -M.; Cardaci, M.; Chabert, E. C.; Collard, C.; Conte, E.; Drouhin, F.; Fontaine, J. -C.; Gelé, D.; Goerlach, U.; Juillot, P.; Le Bihan, A. -C.; Van Hove, P.; Fassi, F.; Mercier, D.; Beauceron, S.; Beaupere, N.; Bondu, O.; Boudoul, G.; Brochet, S.; Chasserat, J.; Chierici, R.; Contardo, D.; Depasse, P.; El Mamouni, H.; Fay, J.; Gascon, S.; Gouzevitch, M.; Ille, B.; Kurca, T.; Lethuillier, M.; Mirabito, L.; Perries, S.; Sgandurra, L.; Sordini, V.; Tschudi, Y.; Verdier, P.; Viret, S.; Tsamalaidze, Z.; Autermann, C.; Beranek, S.; Calpas, B.; Edelhoff, M.; Feld, L.; Heracleous, N.; Hindrichs, O.; Jussen, R.; Klein, K.; Merz, J.; Ostapchuk, A.; Perieanu, A.; Raupach, F.; Sammet, J.; Schael, S.; Sprenger, D.; Weber, H.; Wittmer, B.; Zhukov, V.; Ata, M.; Caudron, J.; Dietz-Laursonn, E.; Duchardt, D.; Erdmann, M.; Fischer, R.; Güth, A.; Hebbeker, T.; Heidemann, C.; Hoepfner, K.; Klingebiel, D.; Kreuzer, P.; Merschmeyer, M.; Meyer, A.; Olschewski, M.; Papacz, P.; Pieta, H.; Reithler, H.; Schmitz, S. A.; Sonnenschein, L.; Steggemann, J.; Teyssier, D.; Thüer, S.; Weber, M.; Bontenackels, M.; Cherepanov, V.; Erdogan, Y.; Flügge, G.; Geenen, H.; Geisler, M.; Haj Ahmad, W.; Hoehle, F.; Kargoll, B.; Kress, T.; Kuessel, Y.; Lingemann, J.; Nowack, A.; Perchalla, L.; Pooth, O.; Sauerland, P.; Stahl, A.; Aldaya Martin, M.; Behr, J.; Behrenhoff, W.; Behrens, U.; Bergholz, M.; Bethani, A.; Borras, K.; Burgmeier, A.; Cakir, A.; Calligaris, L.; Campbell, A.; Castro, E.; Costanza, F.; Dammann, D.; Diez Pardos, C.; Eckerlin, G.; Eckstein, D.; Flucke, G.; Geiser, A.; Glushkov, I.; Gunnellini, P.; Habib, S.; Hauk, J.; Hellwig, G.; Jung, H.; Kasemann, M.; Katsas, P.; Kleinwort, C.; Kluge, H.; Knutsson, A.; Krämer, M.; Krücker, D.; Kuznetsova, E.; Lange, W.; Leonard, J.; Lohmann, W.; Lutz, B.; Mankel, R.; Marfin, I.; Marienfeld, M.; Melzer-Pellmann, I. -A.; Meyer, A. B.; Mnich, J.; Mussgiller, A.; Naumann-Emme, S.; Novgorodova, O.; Olzem, J.; Perrey, H.; Petrukhin, A.; Pitzl, D.; Raspereza, A.; Ribeiro Cipriano, P. M.; Riedl, C.; Ron, E.; Rosin, M.; Salfeld-Nebgen, J.; Schmidt, R.; Schoerner-Sadenius, T.; Sen, N.; Spiridonov, A.; Stein, M.; Walsh, R.; Wissing, C.; Blobel, V.; Enderle, H.; Erfle, J.; Gebbert, U.; Görner, M.; Gosselink, M.; Haller, J.; Hermanns, T.; Höing, R. S.; Kaschube, K.; Kaussen, G.; Kirschenmann, H.; Klanner, R.; Lange, J.; Nowak, F.; Peiffer, T.; Pietsch, N.; Rathjens, D.; Sander, C.; Schettler, H.; Schleper, P.; Schlieckau, E.; Schmidt, A.; Schröder, M.; Schum, T.; Seidel, M.; Sibille, J.; Sola, V.; Stadie, H.; Steinbrück, G.; Thomsen, J.; Vanelderen, L.; Barth, C.; Berger, J.; Böser, C.; Chwalek, T.; De Boer, W.; Descroix, A.; Dierlamm, A.; Feindt, M.; Guthoff, M.; Hackstein, C.; Hartmann, F.; Hauth, T.; Heinrich, M.; Held, H.; Hoffmann, K. H.; Husemann, U.; Katkov, I.; Komaragiri, J. R.; Lobelle Pardo, P.; Martschei, D.; Mueller, S.; Müller, Th.; Niegel, M.; Nürnberg, A.; Oberst, O.; Oehler, A.; Ott, J.; Quast, G.; Rabbertz, K.; Ratnikov, F.; Ratnikova, N.; Röcker, S.; Schilling, F. -P.; Schott, G.; Simonis, H. J.; Stober, F. M.; Troendle, D.; Ulrich, R.; Wagner-Kuhr, J.; Wayand, S.; Weiler, T.; Zeise, M.; Anagnostou, G.; Daskalakis, G.; Geralis, T.; Kesisoglou, S.; Kyriakis, A.; Loukas, D.; Manolakos, I.; Markou, A.; Markou, C.; Ntomari, E.; Gouskos, L.; Mertzimekis, T. J.; Panagiotou, A.; Saoulidou, N.; Evangelou, I.; Foudas, C.; Kokkas, P.; Manthos, N.; Papadopoulos, I.; Patras, V.; Bencze, G.; Hajdu, C.; Hidas, P.; Horvath, D.; Sikler, F.; Veszpremi, V.; Vesztergombi, G.; Beni, N.; Czellar, S.; Molnar, J.; Palinkas, J.; Szillasi, Z.; Karancsi, J.; Raics, P.; Trocsanyi, Z. L.; Ujvari, B.; Beri, S. B.; Bhatnagar, V.; Dhingra, N.; Gupta, R.; Kaur, M.; Mehta, M. Z.; Nishu, N.; Saini, L. K.; Sharma, A.; Singh, J. B.; Kumar, Ashok; Kumar, Arun; Ahuja, S.; Bhardwaj, A.; Choudhary, B. C.; Malhotra, S.; Naimuddin, M.; Ranjan, K.; Sharma, V.; Shivpuri, R. K.; Banerjee, S.; Bhattacharya, S.; Dutta, S.; Gomber, B.; Jain, Sa.; Jain, Sh.; Khurana, R.; Sarkar, S.; Sharan, M.; Abdulsalam, A.; Dutta, D.; Kailas, S.; Kumar, V.; Mohanty, A. K.; Pant, L. M.; Shukla, P.; Aziz, T.; Ganguly, S.; Guchait, M.; Gurtu, A.; Maity, M.; Majumder, G.; Mazumdar, K.; Mohanty, G. B.; Parida, B.; Sudhakar, K.; Wickramage, N.; Banerjee, S.; Dugad, S.; Arfaei, H.; Bakhshiansohi, H.; Etesami, S. M.; Fahim, A.; Hashemi, M.; Hesari, H.; Jafari, A.; Khakzad, M.; Mohammadi Najafabadi, M.; Paktinat Mehdiabadi, S.; Safarzadeh, B.; Zeinali, M.; Abbrescia, M.; Barbone, L.; Calabria, C.; Chhibra, S. S.; Colaleo, A.; Creanza, D.; De Filippis, N.; De Palma, M.; Fiore, L.; Iaselli, G.; Maggi, G.; Maggi, M.; Marangelli, B.; My, S.; Nuzzo, S.; Pacifico, N.; Pompili, A.; Pugliese, G.; Selvaggi, G.; Silvestris, L.; Singh, G.; Venditti, R.; Verwilligen, P.; Zito, G.; Abbiendi, G.; Benvenuti, A. C.; Bonacorsi, D.; Braibant-Giacomelli, S.; Brigliadori, L.; Capiluppi, P.; Castro, A.; Cavallo, F. R.; Cuffiani, M.; Dallavalle, G. M.; Fabbri, F.; Fanfani, A.; Fasanella, D.; Giacomelli, P.; Grandi, C.; Guiducci, L.; Marcellini, S.; Masetti, G.; Meneghelli, M.; Montanari, A.; Navarria, F. L.; Odorici, F.; Perrotta, A.; Primavera, F.; Rossi, A. M.; Rovelli, T.; Siroli, G. P.; Tosi, N.; Travaglini, R.; Albergo, S.; Cappello, G.; Chiorboli, M.; Costa, S.; Potenza, R.; Tricomi, A.; Tuve, C.; Barbagli, G.; Ciulli, V.; Civinini, C.; D’Alessandro, R.; Focardi, E.; Frosali, S.; Gallo, E.; Gonzi, S.; Meschini, M.; Paoletti, S.; Sguazzoni, G.; Tropiano, A.; Benussi, L.; Bianco, S.; Colafranceschi, S.; Fabbri, F.; Piccolo, D.; Fabbricatore, P.; Musenich, R.; Tosi, S.; Benaglia, A.; De Guio, F.; Di Matteo, L.; Fiorendi, S.; Gennai, S.; Ghezzi, A.; Malvezzi, S.; Manzoni, R. A.; Martelli, A.; Massironi, A.; Menasce, D.; Moroni, L.; Paganoni, M.; Pedrini, D.; Ragazzi, S.; Redaelli, N.; Sala, S.; Tabarelli de Fatis, T.; Buontempo, S.; Carrillo Montoya, C. A.; Cavallo, N.; De Cosa, A.; Dogangun, O.; Fabozzi, F.; Iorio, A. O. M.; Lista, L.; Meola, S.; Merola, M.; Paolucci, P.; Azzi, P.; Bacchetta, N.; Bisello, D.; Branca, A.; Carlin, R.; Checchia, P.; Dorigo, T.; Gasparini, F.; Gozzelino, A.; Kanishchev, K.; Lacaprara, S.; Lazzizzera, I.; Margoni, M.; Meneguzzo, A. T.; Pazzini, J.; Pozzobon, N.; Ronchese, P.; Simonetto, F.; Torassa, E.; Tosi, M.; Triossi, A.; Vanini, S.; Zotto, P.; Zucchetta, A.; Zumerle, G.; Gabusi, M.; Ratti, S. P.; Riccardi, C.; Torre, P.; Vitulo, P.; Biasini, M.; Bilei, G. M.; Fanò, L.; Lariccia, P.; Mantovani, G.; Menichelli, M.; Nappi, A.; Romeo, F.; Saha, A.; Santocchia, A.; Spiezia, A.; Taroni, S.; Azzurri, P.; Bagliesi, G.; Bernardini, J.; Boccali, T.; Broccolo, G.; Castaldi, R.; D’Agnolo, R. T.; Dell’Orso, R.; Fiori, F.; Foà, L.; Giassi, A.; Kraan, A.; Ligabue, F.; Lomtadze, T.; Martini, L.; Messineo, A.; Palla, F.; Rizzi, A.; Serban, A. T.; Spagnolo, P.; Squillacioti, P.; Tenchini, R.; Tonelli, G.; Venturi, A.; Verdini, P. G.; Barone, L.; Cavallari, F.; Del Re, D.; Diemoz, M.; Fanelli, C.; Grassi, M.; Longo, E.; Meridiani, P.; Micheli, F.; Nourbakhsh, S.; Organtini, G.; Paramatti, R.; Rahatlou, S.; Sigamani, M.; Soffi, L.; Amapane, N.; Arcidiacono, R.; Argiro, S.; Arneodo, M.; Biino, C.; Cartiglia, N.; Casasso, S.; Costa, M.; Demaria, N.; Mariotti, C.; Maselli, S.; Migliore, E.; Monaco, V.; Musich, M.; Obertino, M. M.; Pastrone, N.; Pelliccioni, M.; Potenza, A.; Romero, A.; Ruspa, M.; Sacchi, R.; Solano, A.; Staiano, A.; Belforte, S.; Candelise, V.; Casarsa, M.; Cossutti, F.; Della Ricca, G.; Gobbo, B.; Marone, M.; Montanino, D.; Penzo, A.; Schizzi, A.; Kim, T. Y.; Nam, S. K.; Chang, S.; Kim, D. H.; Kim, G. N.; Kong, D. J.; Park, H.; Son, D. C.; Son, T.; Kim, J. Y.; Kim, Zero J.; Song, S.; Choi, S.; Gyun, D.; Hong, B.; Jo, M.; Kim, H.; Kim, T. J.; Lee, K. S.; Moon, D. H.; Park, S. K.; Roh, Y.; Choi, M.; Kim, J. H.; Park, C.; Park, I. C.; Park, S.; Ryu, G.; Choi, Y.; Choi, Y. K.; Goh, J.; Kim, M. S.; Kwon, E.; Lee, B.; Lee, J.; Lee, S.; Seo, H.; Yu, I.; Bilinskas, M. J.; Grigelionis, I.; Janulis, M.; Juodagalvis, A.; Castilla-Valdez, H.; De La Cruz-Burelo, E.; Heredia-de La Cruz, I.; Lopez-Fernandez, R.; Martínez-Ortega, J.; Sanchez-Hernandez, A.; Villasenor-Cendejas, L. M.; Carrillo Moreno, S.; Vazquez Valencia, F.; Salazar Ibarguen, H. A.; Casimiro Linares, E.; Morelos Pineda, A.; Reyes-Santos, M. A.; Krofcheck, D.; Bell, A. J.; Butler, P. H.; Doesburg, R.; Reucroft, S.; Silverwood, H.; Ahmad, M.; Asghar, M. I.; Butt, J.; Hoorani, H. R.; Khalid, S.; Khan, W. A.; Khurshid, T.; Qazi, S.; Shah, M. A.; Shoaib, M.; Bialkowska, H.; Boimska, B.; Frueboes, T.; Górski, M.; Kazana, M.; Nawrocki, K.; Romanowska-Rybinska, K.; Szleper, M.; Wrochna, G.; Zalewski, P.; Brona, G.; Bunkowski, K.; Cwiok, M.; Dominik, W.; Doroba, K.; Kalinowski, A.; Konecki, M.; Krolikowski, J.; Misiura, M.; Almeida, N.; Bargassa, P.; David, A.; Faccioli, P.; Ferreira Parracho, P. G.; Gallinaro, M.; Seixas, J.; Varela, J.; Vischia, P.; Bunin, P.; Gavrilenko, M.; Golutvin, I.; Gorbunov, I.; Kamenev, A.; Karjavin, V.; Kozlov, G.; Lanev, A.; Malakhov, A.; Moisenz, P.; Palichik, V.; Perelygin, V.; Savina, M.; Shmatov, S.; Smirnov, V.; Volodko, A.; Zarubin, A.; Evstyukhin, S.; Golovtsov, V.; Ivanov, Y.; Kim, V.; Levchenko, P.; Murzin, V.; Oreshkin, V.; Smirnov, I.; Sulimov, V.; Uvarov, L.; Vavilov, S.; Vorobyev, A.; Vorobyev, An.; Andreev, Yu.; Dermenev, A.; Gninenko, S.; Golubev, N.; Kirsanov, M.; Krasnikov, N.; Matveev, V.; Pashenkov, A.; Tlisov, D.; Toropin, A.; Epshteyn, V.; Erofeeva, M.; Gavrilov, V.; Kossov, M.; Lychkovskaya, N.; Popov, V.; Safronov, G.; Semenov, S.; Shreyber, I.; Stolin, V.; Vlasov, E.; Zhokin, A.; Belyaev, A.; Boos, E.; Dubinin, M.; Dudko, L.; Ershov, A.; Gribushin, A.; Klyukhin, V.; Kodolova, O.; Lokhtin, I.; Markina, A.; Obraztsov, S.; Perfilov, M.; Petrushanko, S.; Popov, A.; Sarycheva, L.; Savrin, V.; Snigirev, A.; Andreev, V.; Azarkin, M.; Dremin, I.; Kirakosyan, M.; Leonidov, A.; Mesyats, G.; Rusakov, S. V.; Vinogradov, A.; Azhgirey, I.; Bayshev, I.; Bitioukov, S.; Grishin, V.; Kachanov, V.; Konstantinov, D.; Krychkine, V.; Petrov, V.; Ryutin, R.; Sobol, A.; Tourtchanovitch, L.; Troshin, S.; Tyurin, N.; Uzunian, A.; Volkov, A.; Adzic, P.; Djordjevic, M.; Ekmedzic, M.; Krpic, D.; Milosevic, J.; Aguilar-Benitez, M.; Alcaraz Maestre, J.; Arce, P.; Battilana, C.; Calvo, E.; Cerrada, M.; Chamizo Llatas, M.; Colino, N.; De La Cruz, B.; Delgado Peris, A.; Domínguez Vázquez, D.; Fernandez Bedoya, C.; Fernández Ramos, J. P.; Ferrando, A.; Flix, J.; Fouz, M. C.; Garcia-Abia, P.; Gonzalez Lopez, O.; Goy Lopez, S.; Hernandez, J. M.; Josa, M. I.; Merino, G.; Puerta Pelayo, J.; Quintario Olmeda, A.; Redondo, I.; Romero, L.; Santaolalla, J.; Soares, M. S.; Willmott, C.; Albajar, C.; Codispoti, G.; de Trocóniz, J. F.; Brun, H.; Cuevas, J.; Fernandez Menendez, J.; Folgueras, S.; Gonzalez Caballero, I.; Lloret Iglesias, L.; Piedra Gomez, J.; Brochero Cifuentes, J. A.; Cabrillo, I. J.; Calderon, A.; Chuang, S. H.; Duarte Campderros, J.; Felcini, M.; Fernandez, M.; Gomez, G.; Gonzalez Sanchez, J.; Graziano, A.; Jorda, C.; Lopez Virto, A.; Marco, J.; Marco, R.; Martinez Rivero, C.; Matorras, F.; Munoz Sanchez, F. J.; Rodrigo, T.; Rodríguez-Marrero, A. Y.; Ruiz-Jimeno, A.; Scodellaro, L.; Vila, I.; Vilar Cortabitarte, R.; Abbaneo, D.; Auffray, E.; Auzinger, G.; Bachtis, M.; Baillon, P.; Ball, A. H.; Barney, D.; Benitez, J. F.; Bernet, C.; Bianchi, G.; Bloch, P.; Bocci, A.; Bonato, A.; Botta, C.; Breuker, H.; Camporesi, T.; Cerminara, G.; Christiansen, T.; Coarasa Perez, J. A.; D’Enterria, D.; Dabrowski, A.; De Roeck, A.; Di Guida, S.; Dobson, M.; Dupont-Sagorin, N.; Elliott-Peisert, A.; Frisch, B.; Funk, W.; Georgiou, G.; Giffels, M.; Gigi, D.; Gill, K.; Giordano, D.; Girone, M.; Giunta, M.; Glege, F.; Gomez-Reino Garrido, R.; Govoni, P.; Gowdy, S.; Guida, R.; Gundacker, S.; Hammer, J.; Hansen, M.; Harris, P.; Hartl, C.; Harvey, J.; Hegner, B.; Hinzmann, A.; Innocente, V.; Janot, P.; Kaadze, K.; Karavakis, E.; Kousouris, K.; Lecoq, P.; Lee, Y. -J.; Lenzi, P.; Lourenço, C.; Magini, N.; Mäki, T.; Malberti, M.; Malgeri, L.; Mannelli, M.; Masetti, L.; Meijers, F.; Mersi, S.; Meschi, E.; Moser, R.; Mozer, M. U.; Mulders, M.; Musella, P.; Nesvold, E.; Orsini, L.; Palencia Cortezon, E.; Perez, E.; Perrozzi, L.; Petrilli, A.; Pfeiffer, A.; Pierini, M.; Pimiä, M.; Piparo, D.; Polese, G.; Quertenmont, L.; Racz, A.; Reece, W.; Rodrigues Antunes, J.; Rolandi, G.; Rovelli, C.; Rovere, M.; Sakulin, H.; Santanastasio, F.; Schäfer, C.; Schwick, C.; Segoni, I.; Sekmen, S.; Sharma, A.; Siegrist, P.; Silva, P.; Simon, M.; Sphicas, P.; Spiga, D.; Tsirou, A.; Veres, G. I.; Vlimant, J. R.; Wöhri, H. K.; Worm, S. D.; Zeuner, W. D.; Bertl, W.; Deiters, K.; Erdmann, W.; Gabathuler, K.; Horisberger, R.; Ingram, Q.; Kaestli, H. C.; König, S.; Kotlinski, D.; Langenegger, U.; Meier, F.; Renker, D.; Rohe, T.; Bäni, L.; Bortignon, P.; Buchmann, M. A.; Casal, B.; Chanon, N.; Deisher, A.; Dissertori, G.; Dittmar, M.; Donegà, M.; Dünser, M.; Eller, P.; Eugster, J.; Freudenreich, K.; Grab, C.; Hits, D.; Lecomte, P.; Lustermann, W.; Marini, A. C.; Martinez Ruiz del Arbol, P.; Mohr, N.; Moortgat, F.; Nägeli, C.; Nef, P.; Nessi-Tedaldi, F.; Pandolfi, F.; Pape, L.; Pauss, F.; Peruzzi, M.; Ronga, F. J.; Rossini, M.; Sala, L.; Sanchez, A. K.; Starodumov, A.; Stieger, B.; Takahashi, M.; Tauscher, L.; Thea, A.; Theofilatos, K.; Treille, D.; Urscheler, C.; Wallny, R.; Weber, H. A.; Wehrli, L.; Amsler, C.; Chiochia, V.; De Visscher, S.; Favaro, C.; Ivova Rikova, M.; Kilminster, B.; Millan Mejias, B.; Otiougova, P.; Robmann, P.; Snoek, H.; Tupputi, S.; Verzetti, M.; Chang, Y. H.; Chen, K. H.; Ferro, C.; Kuo, C. M.; Li, S. W.; Lin, W.; Lu, Y. J.; Singh, A. P.; Volpe, R.; Yu, S. S.; Bartalini, P.; Chang, P.; Chang, Y. H.; Chang, Y. W.; Chao, Y.; Chen, K. F.; Dietz, C.; Grundler, U.; Hou, W. -S.; Hsiung, Y.; Kao, K. Y.; Lei, Y. J.; Lu, R. -S.; Majumder, D.; Petrakou, E.; Shi, X.; Shiu, J. G.; Tzeng, Y. M.; Wan, X.; Wang, M.; Asavapibhop, B.; Srimanobhas, N.; Adiguzel, A.; Bakirci, M. N.; Cerci, S.; Dozen, C.; Dumanoglu, I.; Eskut, E.; Girgis, S.; Gokbulut, G.; Gurpinar, E.; Hos, I.; Kangal, E. E.; Karaman, T.; Karapinar, G.; Kayis Topaksu, A.; Onengut, G.; Ozdemir, K.; Ozturk, S.; Polatoz, A.; Sogut, K.; Sunar Cerci, D.; Tali, B.; Topakli, H.; Vergili, L. N.; Vergili, M.; Akin, I. V.; Aliev, T.; Bilin, B.; Bilmis, S.; Deniz, M.; Gamsizkan, H.; Guler, A. M.; Ocalan, K.; Ozpineci, A.; Serin, M.; Sever, R.; Surat, U. E.; Yalvac, M.; Yildirim, E.; Zeyrek, M.; Gülmez, E.; Isildak, B.; Kaya, M.; Kaya, O.; Ozkorucuklu, S.; Sonmez, N.; Cankocak, K.; Levchuk, L.; Brooke, J. J.; Clement, E.; Cussans, D.; Flacher, H.; Frazier, R.; Goldstein, J.; Grimes, M.; Heath, G. P.; Heath, H. F.; Kreczko, L.; Metson, S.; Newbold, D. M.; Nirunpong, K.; Poll, A.; Senkin, S.; Smith, V. J.; Williams, T.; Basso, L.; Bell, K. W.; Belyaev, A.; Brew, C.; Brown, R. M.; Cockerill, D. J. A.; Coughlan, J. A.; Harder, K.; Harper, S.; Jackson, J.; Kennedy, B. W.; Olaiya, E.; Petyt, D.; Radburn-Smith, B. C.; Shepherd-Themistocleous, C. H.; Tomalin, I. R.; Womersley, W. J.; Bainbridge, R.; Ball, G.; Beuselinck, R.; Buchmuller, O.; Colling, D.; Cripps, N.; Cutajar, M.; Dauncey, P.; Davies, G.; Della Negra, M.; Ferguson, W.; Fulcher, J.; Futyan, D.; Gilbert, A.; Guneratne Bryer, A.; Hall, G.; Hatherell, Z.; Hays, J.; Iles, G.; Jarvis, M.; Karapostoli, G.; Lyons, L.; Magnan, A. -M.; Marrouche, J.; Mathias, B.; Nandi, R.; Nash, J.; Nikitenko, A.; Pela, J.; Pesaresi, M.; Petridis, K.; Pioppi, M.; Raymond, D. M.; Rogerson, S.; Rose, A.; Ryan, M. J.; Seez, C.; Sharp, P.; Sparrow, A.; Stoye, M.; Tapper, A.; Vazquez Acosta, M.; Virdee, T.; Wakefield, S.; Wardle, N.; Whyntie, T.; Chadwick, M.; Cole, J. E.; Hobson, P. R.; Khan, A.; Kyberd, P.; Leggat, D.; Leslie, D.; Martin, W.; Reid, I. D.; Symonds, P.; Teodorescu, L.; Turner, M.; Hatakeyama, K.; Liu, H.; Scarborough, T.; Charaf, O.; Henderson, C.; Rumerio, P.; Avetisyan, A.; Bose, T.; Fantasia, C.; Heister, A.; St. John, J.; Lawson, P.; Lazic, D.; Rohlf, J.; Sperka, D.; Sulak, L.; Alimena, J.; Bhattacharya, S.; Christopher, G.; Cutts, D.; Demiragli, Z.; Ferapontov, A.; Garabedian, A.; Heintz, U.; Jabeen, S.; Kukartsev, G.; Laird, E.; Landsberg, G.; Luk, M.; Narain, M.; Nguyen, D.; Segala, M.; Sinthuprasith, T.; Speer, T.; Breedon, R.; Breto, G.; Calderon De La Barca Sanchez, M.; Chauhan, S.; Chertok, M.; Conway, J.; Conway, R.; Cox, P. T.; Dolen, J.; Erbacher, R.; Gardner, M.; Houtz, R.; Ko, W.; Kopecky, A.; Lander, R.; Mall, O.; Miceli, T.; Pellett, D.; Ricci-Tam, F.; Rutherford, B.; Searle, M.; Smith, J.; Squires, M.; Tripathi, M.; Vasquez Sierra, R.; Yohay, R.; Andreev, V.; Cline, D.; Cousins, R.; Duris, J.; Erhan, S.; Everaerts, P.; Farrell, C.; Hauser, J.; Ignatenko, M.; Jarvis, C.; Rakness, G.; Schlein, P.; Traczyk, P.; Valuev, V.; Weber, M.; Babb, J.; Clare, R.; Dinardo, M. E.; Ellison, J.; Gary, J. W.; Giordano, F.; Hanson, G.; Liu, H.; Long, O. R.; Luthra, A.; Nguyen, H.; Paramesvaran, S.; Sturdy, J.; Sumowidagdo, S.; Wilken, R.; Wimpenny, S.; Andrews, W.; Branson, J. G.; Cerati, G. B.; Cittolin, S.; Evans, D.; Holzner, A.; Kelley, R.; Lebourgeois, M.; Letts, J.; Macneill, I.; Mangano, B.; Padhi, S.; Palmer, C.; Petrucciani, G.; Pieri, M.; Sani, M.; Sharma, V.; Simon, S.; Sudano, E.; Tadel, M.; Tu, Y.; Vartak, A.; Wasserbaech, S.; Würthwein, F.; Yagil, A.; Yoo, J.; Barge, D.; Bellan, R.; Campagnari, C.; D’Alfonso, M.; Danielson, T.; Flowers, K.; Geffert, P.; Golf, F.; Incandela, J.; Justus, C.; Kalavase, P.; Kovalskyi, D.; Krutelyov, V.; Lowette, S.; Magaña Villalba, R.; Mccoll, N.; Pavlunin, V.; Ribnik, J.; Richman, J.; Rossin, R.; Stuart, D.; To, W.; West, C.; Apresyan, A.; Bornheim, A.; Chen, Y.; Di Marco, E.; Duarte, J.; Gataullin, M.; Ma, Y.; Mott, A.; Newman, H. B.; Rogan, C.; Spiropulu, M.; Timciuc, V.; Veverka, J.; Wilkinson, R.; Xie, S.; Yang, Y.; Zhu, R. Y.; Azzolini, V.; Calamba, A.; Carroll, R.; Ferguson, T.; Iiyama, Y.; Jang, D. W.; Liu, Y. F.; Paulini, M.; Vogel, H.; Vorobiev, I.; Cumalat, J. P.; Drell, B. R.; Ford, W. T.; Gaz, A.; Luiggi Lopez, E.; Smith, J. G.; Stenson, K.; Ulmer, K. A.; Wagner, S. R.; Alexander, J.; Chatterjee, A.; Eggert, N.; Gibbons, L. K.; Heltsley, B.; Hopkins, W.; Khukhunaishvili, A.; Kreis, B.; Mirman, N.; Nicolas Kaufman, G.; Patterson, J. R.; Ryd, A.; Salvati, E.; Sun, W.; Teo, W. D.; Thom, J.; Thompson, J.; Tucker, J.; Vaughan, J.; Weng, Y.; Winstrom, L.; Wittich, P.; Winn, D.; Abdullin, S.; Albrow, M.; Anderson, J.; Bauerdick, L. A. T.; Beretvas, A.; Berryhill, J.; Bhat, P. C.; Burkett, K.; Butler, J. N.; Chetluru, V.; Cheung, H. W. K.; Chlebana, F.; Elvira, V. D.; Fisk, I.; Freeman, J.; Gao, Y.; Green, D.; Gutsche, O.; Hanlon, J.; Harris, R. M.; Hirschauer, J.; Hooberman, B.; Jindariani, S.; Johnson, M.; Joshi, U.; Klima, B.; Kunori, S.; Kwan, S.; Leonidopoulos, C.; Linacre, J.; Lincoln, D.; Lipton, R.; Lykken, J.; Maeshima, K.; Marraffino, J. M.; Maruyama, S.; Mason, D.; McBride, P.; Mishra, K.; Mrenna, S.; Musienko, Y.; Newman-Holmes, C.; O’Dell, V.; Prokofyev, O.; Sexton-Kennedy, E.; Sharma, S.; Spalding, W. J.; Spiegel, L.; Taylor, L.; Tkaczyk, S.; Tran, N. V.; Uplegger, L.; Vaandering, E. W.; Vidal, R.; Whitmore, J.; Wu, W.; Yang, F.; Yun, J. C.; Acosta, D.; Avery, P.; Bourilkov, D.; Chen, M.; Cheng, T.; Das, S.; De Gruttola, M.; Di Giovanni, G. P.; Dobur, D.; Drozdetskiy, A.; Field, R. D.; Fisher, M.; Fu, Y.; Furic, I. K.; Gartner, J.; Hugon, J.; Kim, B.; Konigsberg, J.; Korytov, A.; Kropivnitskaya, A.; Kypreos, T.; Low, J. F.; Matchev, K.; Milenovic, P.; Mitselmakher, G.; Muniz, L.; Park, M.; Remington, R.; Rinkevicius, A.; Sellers, P.; Skhirtladze, N.; Snowball, M.; Yelton, J.; Zakaria, M.; Gaultney, V.; Hewamanage, S.; Lebolo, L. M.; Linn, S.; Markowitz, P.; Martinez, G.; Rodriguez, J. L.; Adams, T.; Askew, A.; Bochenek, J.; Chen, J.; Diamond, B.; Gleyzer, S. V.; Haas, J.; Hagopian, S.; Hagopian, V.; Jenkins, M.; Johnson, K. F.; Prosper, H.; Veeraraghavan, V.; Weinberg, M.; Baarmand, M. M.; Dorney, B.; Hohlmann, M.; Kalakhety, H.; Vodopiyanov, I.; Yumiceva, F.; Adams, M. R.; Anghel, I. M.; Apanasevich, L.; Bai, Y.; Bazterra, V. E.; Betts, R. R.; Bucinskaite, I.; Callner, J.; Cavanaugh, R.; Evdokimov, O.; Gauthier, L.; Gerber, C. E.; Hofman, D. J.; Khalatyan, S.; Lacroix, F.; O’Brien, C.; Silkworth, C.; Strom, D.; Turner, P.; Varelas, N.; Akgun, U.; Albayrak, E. A.; Bilki, B.; Clarida, W.; Duru, F.; Griffiths, S.; Merlo, J. -P.; Mermerkaya, H.; Mestvirishvili, A.; Moeller, A.; Nachtman, J.; Newsom, C. R.; Norbeck, E.; Onel, Y.; Ozok, F.; Sen, S.; Tan, P.; Tiras, E.; Wetzel, J.; Yetkin, T.; Yi, K.; Barnett, B. A.; Blumenfeld, B.; Bolognesi, S.; Fehling, D.; Giurgiu, G.; Gritsan, A. V.; Guo, Z. J.; Hu, G.; Maksimovic, P.; Swartz, M.; Whitbeck, A.; Baringer, P.; Bean, A.; Benelli, G.; Kenny, R. P.; Murray, M.; Noonan, D.; Sanders, S.; Stringer, R.; Tinti, G.; Wood, J. S.; Barfuss, A. F.; Bolton, T.; Chakaberia, I.; Ivanov, A.; Khalil, S.; Makouski, M.; Maravin, Y.; Shrestha, S.; Svintradze, I.; Gronberg, J.; Lange, D.; Rebassoo, F.; Wright, D.; Baden, A.; Calvert, B.; Eno, S. C.; Gomez, J. A.; Hadley, N. J.; Kellogg, R. G.; Kirn, M.; Kolberg, T.; Lu, Y.; Marionneau, M.; Mignerey, A. C.; Pedro, K.; Skuja, A.; Temple, J.; Tonjes, M. B.; Tonwar, S. C.; Apyan, A.; Bauer, G.; Bendavid, J.; Busza, W.; Butz, E.; Cali, I. A.; Chan, M.; Dutta, V.; Gomez Ceballos, G.; Goncharov, M.; Kim, Y.; Klute, M.; Krajczar, K.; Levin, A.; Luckey, P. D.; Ma, T.; Nahn, S.; Paus, C.; Ralph, D.; Roland, C.; Roland, G.; Rudolph, M.; Stephans, G. S. F.; Stöckli, F.; Sumorok, K.; Sung, K.; Velicanu, D.; Wenger, E. A.; Wolf, R.; Wyslouch, B.; Yang, M.; Yilmaz, Y.; Yoon, A. S.; Zanetti, M.; Zhukova, V.; Cooper, S. I.; Dahmes, B.; De Benedetti, A.; Franzoni, G.; Gude, A.; Kao, S. C.; Klapoetke, K.; Kubota, Y.; Mans, J.; Pastika, N.; Rusack, R.; Sasseville, M.; Singovsky, A.; Tambe, N.; Turkewitz, J.; Cremaldi, L. M.; Kroeger, R.; Perera, L.; Rahmat, R.; Sanders, D. A.; Avdeeva, E.; Bloom, K.; Bose, S.; Claes, D. R.; Dominguez, A.; Eads, M.; Keller, J.; Kravchenko, I.; Lazo-Flores, J.; Malik, S.; Snow, G. R.; Godshalk, A.; Iashvili, I.; Jain, S.; Kharchilava, A.; Kumar, A.; Rappoccio, S.; Alverson, G.; Barberis, E.; Baumgartel, D.; Chasco, M.; Haley, J.; Nash, D.; Orimoto, T.; Trocino, D.; Wood, D.; Zhang, J.; Anastassov, A.; Hahn, K. A.; Kubik, A.; Lusito, L.; Mucia, N.; Odell, N.; Ofierzynski, R. A.; Pollack, B.; Pozdnyakov, A.; Schmitt, M.; Stoynev, S.; Velasco, M.; Won, S.; Antonelli, L.; Berry, D.; Brinkerhoff, A.; Chan, K. M.; Hildreth, M.; Jessop, C.; Karmgard, D. J.; Kolb, J.; Lannon, K.; Luo, W.; Lynch, S.; Marinelli, N.; Morse, D. M.; Pearson, T.; Planer, M.; Ruchti, R.; Slaunwhite, J.; Valls, N.; Wayne, M.; Wolf, M.; Bylsma, B.; Durkin, L. S.; Hill, C.; Hughes, R.; Kotov, K.; Ling, T. Y.; Puigh, D.; Rodenburg, M.; Vuosalo, C.; Williams, G.; Winer, B. L.; Berry, E.; Elmer, P.; Halyo, V.; Hebda, P.; Hegeman, J.; Hunt, A.; Jindal, P.; Koay, S. A.; Lopes Pegna, D.; Lujan, P.; Marlow, D.; Medvedeva, T.; Mooney, M.; Olsen, J.; Piroué, P.; Quan, X.; Raval, A.; Saka, H.; Stickland, D.; Tully, C.; Werner, J. S.; Zuranski, A.; Brownson, E.; Lopez, A.; Mendez, H.; Ramirez Vargas, J. E.; Alagoz, E.; Barnes, V. E.; Benedetti, D.; Bolla, G.; Bortoletto, D.; De Mattia, M.; Everett, A.; Hu, Z.; Jones, M.; Koybasi, O.; Kress, M.; Laasanen, A. T.; Leonardo, N.; Maroussov, V.; Merkel, P.; Miller, D. H.; Neumeister, N.; Shipsey, I.; Silvers, D.; Svyatkovskiy, A.; Vidal Marono, M.; Yoo, H. D.; Zablocki, J.; Zheng, Y.; Guragain, S.; Parashar, N.; Adair, A.; Akgun, B.; Boulahouache, C.; Ecklund, K. M.; Geurts, F. J. M.; Li, W.; Padley, B. P.; Redjimi, R.; Roberts, J.; Zabel, J.; Betchart, B.; Bodek, A.; Chung, Y. S.; Covarelli, R.; de Barbaro, P.; Demina, R.; Eshaq, Y.; Ferbel, T.; Garcia-Bellido, A.; Goldenzweig, P.; Han, J.; Harel, A.; Miner, D. C.; Vishnevskiy, D.; Zielinski, M.; Bhatti, A.; Ciesielski, R.; Demortier, L.; Goulianos, K.; Lungu, G.; Malik, S.; Mesropian, C.; Arora, S.; Barker, A.; Chou, J. P.; Contreras-Campana, C.; Contreras-Campana, E.; Duggan, D.; Ferencek, D.; Gershtein, Y.; Gray, R.; Halkiadakis, E.; Hidas, D.; Lath, A.; Panwalkar, S.; Park, M.; Patel, R.; Rekovic, V.; Robles, J.; Rose, K.; Salur, S.; Schnetzer, S.; Seitz, C.; Somalwar, S.; Stone, R.; Thomas, S.; Walker, M.; Cerizza, G.; Hollingsworth, M.; Spanier, S.; Yang, Z. C.; York, A.; Eusebi, R.; Flanagan, W.; Gilmore, J.; Kamon, T.; Khotilovich, V.; Montalvo, R.; Osipenkov, I.; Pakhotin, Y.; Perloff, A.; Roe, J.; Safonov, A.; Sakuma, T.; Sengupta, S.; Suarez, I.; Tatarinov, A.; Toback, D.; Akchurin, N.; Damgov, J.; Dragoiu, C.; Dudero, P. R.; Jeong, C.; Kovitanggoon, K.; Lee, S. W.; Libeiro, T.; Volobouev, I.; Appelt, E.; Delannoy, A. G.; Florez, C.; Greene, S.; Gurrola, A.; Johns, W.; Kurt, P.; Maguire, C.; Melo, A.; Sharma, M.; Sheldon, P.; Snook, B.; Tuo, S.; Velkovska, J.; Arenton, M. W.; Balazs, M.; Boutle, S.; Cox, B.; Francis, B.; Goodell, J.; Hirosky, R.; Ledovskoy, A.; Lin, C.; Neu, C.; Wood, J.; Gollapinni, S.; Harr, R.; Karchin, P. E.; Kottachchi Kankanamge Don, C.; Lamichhane, P.; Sakharov, A.; Anderson, M.; Belknap, D. A.; Borrello, L.; Carlsmith, D.; Cepeda, M.; Dasu, S.; Friis, E.; Gray, L.; Grogg, K. S.; Grothe, M.; Hall-Wilton, R.; Herndon, M.; Hervé, A.; Klabbers, P.; Klukas, J.; Lanaro, A.; Lazaridis, C.; Loveless, R.; Mohapatra, A.; Ojalvo, I.; Palmonari, F.; Pierro, G. A.; Ross, I.; Savin, A.; Smith, W. H.; Swanson, J.

    2013-09-01

    The results of searches for supersymmetry by the CMS experiment are interpreted in the framework of simplified models. The results are based on data corresponding to an integrated luminosity of 4.73 to 4.98 inverse femtobarns. The data were collected at the LHC in proton-proton collisions at a center-of-mass energy of 7 TeV. This paper describes the method of interpretation and provides upper limits on the product of the production cross section and branching fraction as a function of new particle masses for a number of simplified models. These limits and the corresponding experimental acceptance calculations can be used to constrain other theoretical models and to compare different supersymmetry-inspired analyses.

  9. Evolution of Signaling in a Multi-Robot System: Categorization and Communication

    Science.gov (United States)

    Ampatzis, Christos; Tuci, Elio; Trianni, Vito; Dorigo, Marco

    We use Evolutionary Robotics to design robot controllers in which decision-making mechanisms to switch from solitary to social behavior are integrated with the mechanisms that underpin the sensory-motor repertoire of the robots. In particular, we study the evolution of behavioral and communicative skills in a categorization task. The individual decision-making structures are based on the integration over time of sensory information. The mechanisms for switching from solitary to social behavior and the ways in which the robots can affect each other's behavior are not predetermined by the experimenter, but are aspects of our model designed by artificial evolution. Our results show that evolved robots manage to cooperate and collectively discriminate between different environments by developing a simple communication protocol based on sound signaling. Communication emerges in the absence of explicit selective pressure coded in the fitness function. The evolution of communication is neither trivial nor obvious; for a meaningful signaling system to evolve, evolution must produce both appropriate signals and appropriate reactions to signals. The use of communication proves to be adaptive for the group, even if, in principle, non-cooperating robots can be equally successful with cooperating robots.

  10. Choosing colors for map display icons using models of visual search.

    Science.gov (United States)

    Shive, Joshua; Francis, Gregory

    2013-04-01

    We show how to choose colors for icons on maps to minimize search time using predictions of a model of visual search. The model analyzes digital images of a search target (an icon on a map) and a search display (the map containing the icon) and predicts search time as a function of target-distractor color distinctiveness and target eccentricity. We parameterized the model using data from a visual search task and performed a series of optimization tasks to test the model's ability to choose colors for icons to minimize search time across icons. Map display designs made by this procedure were tested experimentally. In a follow-up experiment, we examined the model's flexibility to assign colors in novel search situations. The model fits human performance, performs well on the optimization tasks, and can choose colors for icons on maps with novel stimuli to minimize search time without requiring additional model parameter fitting. Models of visual search can suggest color choices that produce search time reductions for display icons. Designers should consider constructing visual search models as a low-cost method of evaluating color assignments.

  11. Understanding and modeling users of modern search engines

    NARCIS (Netherlands)

    Chuklin, A.

    2017-01-01

    As search is being used by billions of people, modern search engines are becoming more and more complex. And complexity does not just come from the algorithms. Richer and richer content is being added to search engine result pages: news and sports results, definitions and translations, images and

  12. Modeling of pheromone communication system of forest Lepidopterous insects. II. Model of female searching by male

    Directory of Open Access Journals (Sweden)

    A. V. Kovalev

    2015-06-01

    Full Text Available We propose an agent­based simulation model search. This model allows us to evaluate the effectiveness of different males­females pheromone search strategies for Lepidoptera. In the model, we consider the simplest case of the search, when the pheromone has only one chemical component. It is assumed that the insects are able to detect the pheromone molecules and the sensory cells generate action potentials in contact with the pheromone for some time. Thereafter pheromone molecule is inactivated. This behavior can be regarded as a memory of individual. Proportion of individuals who have reached the source is selected as an integral indicator of the search efficiency. To evaluate the effectiveness, numeric experiments were performed in different conditions: random walk, search algorithm without memory, and algorithm with memory and return mechanism. The resulting effectiveness of source localization by insects for flight in turbulent flows is ~ 70 %, which corresponds to experiments with live specimens in literature. In this case, proposed pheromone search algorithm is quite simple, which makes it biologically correct. Conducted modeling calculations can be the starting point for planning of field observations and pest monitoring systems using pheromone traps.

  13. Multi-robot caravanning

    KAUST Repository

    Denny, Jory; Giese, Andrew; Mahadevan, Aditya; Marfaing, Arnaud; Glockenmeier, Rachel; Revia, Colton; Rodriguez, Samuel; Amato, Nancy M.

    2013-01-01

    of waypoints. At the heart of our algorithm is the use of leader election to efficiently exploit the unique environmental knowledge available to each robot in order to plan paths for the group, which makes it general enough to work with robots that have

  14. Model-independent and quasi-model-independent search for new physics at CDF

    International Nuclear Information System (INIS)

    Aaltonen, T.; Maki, T.; Mehtala, P.; Orava, R.; Osterberg, K.; Saarikko, H.; van Remortel, N.; Abulencia, A.; Budd, S.; Ciobanu, C. I.; Errede, D.; Errede, S.; Gerberich, H.; Grundler, U.; Junk, T. R.; Kraus, J.; Marino, C. P.; Neubauer, M. S.; Norniella, O.; Pitts, K.

    2008-01-01

    Data collected in run II of the Fermilab Tevatron are searched for indications of new electroweak scale physics. Rather than focusing on particular new physics scenarios, CDF data are analyzed for discrepancies with respect to the standard model prediction. A model-independent approach (Vista) considers the gross features of the data and is sensitive to new large cross section physics. A quasi-model-independent approach (Sleuth) searches for a significant excess of events with large summed transverse momentum and is particularly sensitive to new electroweak scale physics that appears predominantly in one final state. This global search for new physics in over 300 exclusive final states in 927 pb -1 of pp collisions at √(s)=1.96 TeV reveals no such significant indication of physics beyond the standard model.

  15. A Hybrid Model Ranking Search Result for Research Paper Searching on Social Bookmarking

    Directory of Open Access Journals (Sweden)

    pijitra jomsri

    2015-11-01

    Full Text Available Social bookmarking and publication sharing systems are essential tools for web resource discovery. The performance and capabilities of search results from research paper bookmarking system are vital. Many researchers use social bookmarking for searching papers related to their topics of interest. This paper proposes a combination of similarity based indexing “tag title and abstract” and static ranking to improve search results. In this particular study, the year of the published paper and type of research paper publication are combined with similarity ranking called (HybridRank. Different weighting scores are employed. The retrieval performance of these weighted combination rankings are evaluated using mean values of NDCG. The results suggest that HybridRank and similarity rank with weight 75:25 has the highest NDCG scores. From the preliminary result of experiment, the combination ranking technique provide more relevant research paper search results. Furthermore the chosen heuristic ranking can improve the efficiency of research paper searching on social bookmarking websites.

  16. Specification Search for Identifying the Correct Mean Trajectory in Polynomial Latent Growth Models

    Science.gov (United States)

    Kim, Minjung; Kwok, Oi-Man; Yoon, Myeongsun; Willson, Victor; Lai, Mark H. C.

    2016-01-01

    This study investigated the optimal strategy for model specification search under the latent growth modeling (LGM) framework, specifically on searching for the correct polynomial mean or average growth model when there is no a priori hypothesized model in the absence of theory. In this simulation study, the effectiveness of different starting…

  17. A combined statistical model for multiple motifs search

    International Nuclear Information System (INIS)

    Gao Lifeng; Liu Xin; Guan Shan

    2008-01-01

    Transcription factor binding sites (TFBS) play key roles in genebior 6.8 wavelet expression and regulation. They are short sequence segments with definite structure and can be recognized by the corresponding transcription factors correctly. From the viewpoint of statistics, the candidates of TFBS should be quite different from the segments that are randomly combined together by nucleotide. This paper proposes a combined statistical model for finding over-represented short sequence segments in different kinds of data set. While the over-represented short sequence segment is described by position weight matrix, the nucleotide distribution at most sites of the segment should be far from the background nucleotide distribution. The central idea of this approach is to search for such kind of signals. This algorithm is tested on 3 data sets, including binding sites data set of cyclic AMP receptor protein in E.coli, PlantProm DB which is a non-redundant collection of proximal promoter sequences from different species, collection of the intergenic sequences of the whole genome of E.Coli. Even though the complexity of these three data sets is quite different, the results show that this model is rather general and sensible. (general)

  18. Model unspecific search for new physics in pp collisions

    International Nuclear Information System (INIS)

    Malhotra, Shivali

    2013-01-01

    The model-independent analysis systematically scans the data taken by Compact Muon Solenoid - CMS detector for deviations from the Standard Model (SM) predictions. This approach is sensitive to a variety of models for new physics due to the minimal theoretical bias i.e. without assumptions on specific models of new physics and covering a large phase space. Possible causes of the significant deviations could be insufficient understanding of the collision event generation or detector simulation, or indeed genuine new physics in the data. Thus the output of MUSiC must be seen as only the first, but important step in the potential discovery of new physics. To get the distinctive final states, events with at least one electron or muon are classified according to their content of reconstructed objects (muons, electrons, photons, jets and missing transverse energy) and sorted into event classes. A broad scan of three kinematic distributions (scalar sum of the transverse momentum, invariant mass of reconstructed objects and missing transverse energy) in those event classes is performed by identifying deviations from SM expectations, accounting for systematic uncertainties. A scanning algorithm determines the regions in the considered distributions where the measured data deviates most from the SM predictions. This search is sensitive to an excess as well as a deficit in the comparison of data and SM background. This approach has been applied to the CMS data and we have obtained the preliminary results. I will talk about the details of the analysis techniques, its implementation in analyzing CMS data, results obtained and the discussion on the discrepancy observed

  19. Flavour Independent $h^{0}A^{0}$ Search and Two Higgs Doublet Model Interpretation of Neutral Higgs Boson Searches at LEP

    CERN Document Server

    Abbiendi, G.; Akesson, P.F.; Alexander, G.; Allison, John; Amaral, P.; Anagnostou, G.; Anderson, K.J.; Asai, S.; Axen, D.; Bailey, I.; Barberio, E.; Barillari, T.; Barlow, R.J.; Batley, R.J.; Bechtle, P.; Behnke, T.; Bell, Kenneth Watson; Bell, P.J.; Bella, G.; Bellerive, A.; Benelli, G.; Bethke, S.; Biebel, O.; Boeriu, O.; Bock, P.; Boutemeur, M.; Braibant, S.; Brown, Robert M.; Burckhart, H.J.; Campana, S.; Capiluppi, P.; Carnegie, R.K.; Carter, A.A.; Carter, J.R.; Chang, C.Y.; Charlton, D.G.; Ciocca, C.; Csilling, A.; Cuffiani, M.; Dado, S.; De Roeck, A.; De Wolf, E.A.; Desch, K.; Dienes, B.; Donkers, M.; Dubbert, J.; Duchovni, E.; Duckeck, G.; Duerdoth, I.P.; Etzion, E.; Fabbri, F.; Ferrari, P.; Fiedler, F.; Fleck, I.; Ford, M.; Frey, A.; Gagnon, P.; Gary, John William; Geich-Gimbel, C.; Giacomelli, G.; Giacomelli, P.; Giunta, Marina; Goldberg, J.; Gross, E.; Grunhaus, J.; Gruwe, M.; Gunther, P.O.; Gupta, A.; Hajdu, C.; Hamann, M.; Hanson, G.G.; Harel, A.; Hauschild, M.; Hawkes, C.M.; Hawkings, R.; Hemingway, R.J.; Herten, G.; Heuer, R.D.; Hill, J.C.; Hoffman, Kara Dion; Horvath, D.; Igo-Kemenes, P.; Ishii, K.; Jeremie, H.; Jovanovic, P.; Junk, T.R.; Kanzaki, J.; Karlen, D.; Kawagoe, K.; Kawamoto, T.; Keeler, R.K.; Kellogg, R.G.; Kennedy, B.W.; Kluth, S.; Kobayashi, T.; Kobel, M.; Komamiya, S.; Kramer, T.; Krieger, P.; von Krogh, J.; Kuhl, T.; Kupper, M.; Lafferty, G.D.; Landsman, H.; Lanske, D.; Lellouch, D.; Lettso, J.; Levinson, L.; Lillich, J.; Lloyd, S.L.; Loebinger, F.K.; Lu, J.; Ludwig, A.; Ludwig, J.; Mader, W.; Marcellini, S.; Martin, A.J.; Masetti, G.; Mashimo, T.; Mattig, Peter; McKenna, J.; McPherson, R.A.; Meijers, F.; Menges, W.; Merritt, F.S.; Mes, H.; Meyer, Niels T.; Michelini, A.; Mihara, S.; Mikenberg, G.; Miller, D.J.; Mohr, W.; Mori, T.; Mutter, A.; Nagai, K.; Nakamura, I.; Nanjo, H.; Neal, H.A.; Nisius, R.; O'Neale, S.W.; Oh, A.; Oreglia, M.J.; Orito, S.; Pahl, C.; Pasztor, G.; Pater, J.R.; Pilcher, J.E.; Pinfold, J.; Plane, David E.; Pooth, O.; Przybycien, M.; Quadt, A.; Rabbertz, K.; Rembser, C.; Renkel, P.; Roney, J.M.; Rossi, A.M.; Rozen, Y.; Runge, K.; Sachs, K.; Saeki, T.; Sarkisyan, E.K.G.; Schaile, A.D.; Schaile, O.; Scharff-Hansen, P.; Schieck, J.; Schorner-Sadenius, T.; Schroder, Matthias; Schumacher, M.; Seuster, R.; Shears, T.G.; Shen, B.C.; Sherwood, P.; Skuja, A.; Smith, A.M.; Sobie, R.; Soldner-Rembold, S.; Spano, F.; Stahl, A.; Strom, David M.; Strohmer, R.; Tarem, S.; Tasevsky, M.; Teuscher, R.; Thomson, M.A.; Torrence, E.; Toya, D.; Tran, P.; Trigger, I.; Trocsanyi, Z.; Tsur, E.; Turner-Watson, M.F.; Ueda, I.; Ujvari, B.; Vollmer, C.F.; Vannerem, P.; Vertesi, R.; Verzocchi, M.; Voss, H.; Vossebeld, J.; Ward, C.P.; Ward, D.R.; Watkins, P.M.; Watson, A.T.; Watson, N.K.; Wells, P.S.; Wengler, T.; Wermes, N.; Wilson, G.W.; Wilson, J.A.; Wolf, G.; Wyatt, T.R.; Yamashita, S.; Zer-Zion, D.; Zivkovic, Lidija

    2005-01-01

    Upper limits on the cross-section of the pair-production process e+e- -> h0A0 assuming 100% decays into hadrons, are derived from a new search for the h0A0 -> hadrons topology, independent of the hadronic flavour of the decay products. Searches for the neutral Higgs bosons h0 and A0, are used to obtain constraints on the Type II Two Higgs Doublet Model (2HDM(11)) with no CP violation in the Higgs sector and no additional non Standard Model particles besides the five Higgs bosons. The analysis combines LEP1 and LEP2 data collected with the OPAL detctor up to the highest available centre-of-mass energies. The searches are sensitive to the h0, A0 -> qq, gg,tau+tau- and h0 -> A0A0 decay modes of the Higgs bosons. The 2HDM(II) parameter space is explored in a detailed scan. Large regions of the 2HDM(II) parameter space are excluded at the 95% CL in the (mh, mA), (mh, tanb) and (mA, tanb) planes, using both direct neutral Higgs boson searches and indirect limits derived from Standard Model high precision measuremen...

  20. Quantum-circuit model of Hamiltonian search algorithms

    International Nuclear Information System (INIS)

    Roland, Jeremie; Cerf, Nicolas J.

    2003-01-01

    We analyze three different quantum search algorithms, namely, the traditional circuit-based Grover's algorithm, its continuous-time analog by Hamiltonian evolution, and the quantum search by local adiabatic evolution. We show that these algorithms are closely related in the sense that they all perform a rotation, at a constant angular velocity, from a uniform superposition of all states to the solution state. This makes it possible to implement the two Hamiltonian-evolution algorithms on a conventional quantum circuit, while keeping the quadratic speedup of Grover's original algorithm. It also clarifies the link between the adiabatic search algorithm and Grover's algorithm

  1. The Little Engines That Could: Modeling the Performance of World Wide Web Search Engines

    OpenAIRE

    Eric T. Bradlow; David C. Schmittlein

    2000-01-01

    This research examines the ability of six popular Web search engines, individually and collectively, to locate Web pages containing common marketing/management phrases. We propose and validate a model for search engine performance that is able to represent key patterns of coverage and overlap among the engines. The model enables us to estimate the typical additional benefit of using multiple search engines, depending on the particular set of engines being considered. It also provides an estim...

  2. Design of personalized search engine based on user-webpage dynamic model

    Science.gov (United States)

    Li, Jihan; Li, Shanglin; Zhu, Yingke; Xiao, Bo

    2013-12-01

    Personalized search engine focuses on establishing a user-webpage dynamic model. In this model, users' personalized factors are introduced so that the search engine is better able to provide the user with targeted feedback. This paper constructs user and webpage dynamic vector tables, introduces singular value decomposition analysis in the processes of topic categorization, and extends the traditional PageRank algorithm.

  3. The Role of Domain Knowledge in Cognitive Modeling of Information Search

    NARCIS (Netherlands)

    Karanam, S.; Jorge-Botana, Guillermo; Olmos, Ricardo; van Oostendorp, H.

    2017-01-01

    Computational cognitive models developed so far do not incorporate individual differences in domain knowledge in predicting user clicks on search result pages. We address this problem using a cognitive model of information search which enables us to use two semantic spaces having a low (non-expert

  4. Beyond Standard Model searches with top quarks at ATLAS

    International Nuclear Information System (INIS)

    Chevalier, F.

    2008-01-01

    At the Lhc, the top quark is expected to provide a huge and clean signal. With about eight millions of expected top pairs and three millions of single top events produced per year in the low luminosity runs, and with a low level of backgrounds, the Lhc will open a new opportunity for precision measurements of the top quark properties and for exotic topology searches involving top quarks. As the ATLAS discovery potential on new physics with top quarks is being assessed with many analyses, this paper focuses on two particular topics: heavy neutral resonance and charged Higgs boson searches with top quarks. The analyses and the ATLAS expectations are described.

  5. Advertising and consumer search in a duopoly model

    NARCIS (Netherlands)

    Janssen, Maarten C. W.; Non, Marielle C.

    We consider a duopoly in a homogenous goods market where part of the consumers are ex ante uninformed about prices. Information can come through two different channels: advertising and sequential consumer search. We arrive at the following results. First, there is no monotone relationship between

  6. Searches for phenomena beyond the Standard Model at the Large ...

    Indian Academy of Sciences (India)

    A summary of the searches conducted by the ATLAS and CMS experiments based on about 1 fb .... space mρTC < mπTC + mW [35]. Figure 5. ... expected dilepton and diphoton events at high invariant mass through virtual graviton exchange.

  7. Searches for neutral Higgs bosons in extended models

    NARCIS (Netherlands)

    Abdallah, J.; Blom, M.R.; Drees, J.; Palacios, J.; van der Pol, M.; Siebel, M.; van Dam, P.A.; Zupan, M.

    2004-01-01

    Searches for neutral Higgs bosons produced at LEP in association with Z bosons, in pairs and in the Yukawa process are presented in this paper. Higgs boson decays into b quarks, τ leptons, or other Higgs bosons are considered, giving rise to four-b, four-b+jets, six-b and four-τ final states, as

  8. Model unspecific search for new physics in pp collision at

    Indian Academy of Sciences (India)

    A broad scan of three kinematic distributions in those classes is performed by identifying deviations from SM expectations, accounting for systematic uncertainties. In this particular search, no significant discrepancies have been observed in data taken by CMS in 2010 and corresponding to an integrated luminosity of 36.1 ...

  9. Learned helplessness, discouraged workers, and multiple unemployment equilibria in a search model

    OpenAIRE

    Bjørnstad, Roger

    2001-01-01

    Abstract: Unemployment varies strongly between countries with comparable economic structure. Some economists have tried to explain these differences with institutional differences in the labour market. Instead, this paper focuses on a model with multiple equilibria so that the same socioeconomic structure can give rise to different levels of unemployment. Unemployed workers' search efficiency are modelled within an equilibrium search model and lay behind these results. In the model learned...

  10. Two Higgs Doublet Model and Model Independent Interpretation of Neutral Higgs Boson Searches

    CERN Document Server

    Abbiendi, G.; Ainsley, C.; Akesson, P.F.; Alexander, G.; Allison, John; Anderson, K.J.; Arcelli, S.; Asai, S.; Ashby, S.F.; Axen, D.; Azuelos, G.; Bailey, I.; Ball, A.H.; Barberio, E.; Barlow, Roger J.; Baumann, S.; Behnke, T.; Bell, Kenneth Watson; Bella, G.; Bellerive, A.; Benelli, G.; Bentvelsen, S.; Bethke, S.; Biebel, O.; Bloodworth, I.J.; Boeriu, O.; Bock, P.; Bohme, J.; Bonacorsi, D.; Boutemeur, M.; Braibant, S.; Bright-Thomas, P.; Brigliadori, L.; Brown, Robert M.; Burckhart, H.J.; Cammin, J.; Capiluppi, P.; Carnegie, R.K.; Carter, A.A.; Carter, J.R.; Chang, C.Y.; Charlton, David G.; Clarke, P.E.L.; Clay, E.; Cohen, I.; Cooke, O.C.; Couchman, J.; Couyoumtzelis, C.; Coxe, R.L.; Csilling, A.; Cuffiani, M.; Dado, S.; Dallavalle, G.Marco; Dallison, S.; de Roeck, A.; de Wolf, E.; Dervan, P.; Desch, K.; Dienes, B.; Dixit, M.S.; Donkers, M.; Dubbert, J.; Duchovni, E.; Duckeck, G.; Duerdoth, I.P.; Estabrooks, P.G.; Etzion, E.; Fabbri, F.; Fanti, M.; Feld, L.; Ferrari, P.; Fiedler, F.; Fleck, I.; Ford, M.; Frey, A.; Furtjes, A.; Futyan, D.I.; Gagnon, P.; Gary, J.W.; Gaycken, G.; Geich-Gimbel, C.; Giacomelli, G.; Giacomelli, P.; Glenzinski, D.; Goldberg, J.; Grandi, C.; Graham, K.; Gross, E.; Grunhaus, J.; Gruwe, M.; Gunther, P.O.; Hajdu, C.; Hanson, G.G.; Hansroul, M.; Hapke, M.; Harder, K.; Harel, A.; Harin-Dirac, M.; Hauke, A.; Hauschild, M.; Hawkes, C.M.; Hawkings, R.; Hemingway, R.J.; Hensel, C.; Herten, G.; Heuer, R.D.; Hill, J.C.; Hocker, James Andrew; Hoffman, Kara Dion; Homer, R.J.; Honma, A.K.; Horvath, D.; Hossain, K.R.; Howard, R.; Huntemeyer, P.; Igo-Kemenes, P.; Ishii, K.; Jacob, F.R.; Jawahery, A.; Jeremie, H.; Jones, C.R.; Jovanovic, P.; Junk, T.R.; Kanaya, N.; Kanzaki, J.; Karapetian, G.; Karlen, D.; Kartvelishvili, V.; Kawagoe, K.; Kawamoto, T.; Keeler, R.K.; Kellogg, R.G.; Kennedy, B.W.; Kim, D.H.; Klein, K.; Klier, A.; Kluth, S.; Kobayashi, T.; Kobel, M.; Kokott, T.P.; Komamiya, S.; Kowalewski, Robert V.; Kress, T.; Krieger, P.; von Krogh, J.; Kuhl, T.; Kupper, M.; Kyberd, P.; Lafferty, G.D.; Landsman, H.; Lanske, D.; Lawson, I.; Layter, J.G.; Leins, A.; Lellouch, D.; Letts, J.; Levinson, L.; Liebisch, R.; Lillich, J.; List, B.; Littlewood, C.; Lloyd, A.W.; Lloyd, S.L.; Loebinger, F.K.; Long, G.D.; Losty, M.J.; Lu, J.; Ludwig, J.; Macchiolo, A.; Macpherson, A.; Mader, W.; Marcellini, S.; Marchant, T.E.; Martin, A.J.; Martin, J.P.; Martinez, G.; Mashimo, T.; Mattig, Peter; McDonald, W.John; McKenna, J.; McMahon, T.J.; McPherson, R.A.; Meijers, F.; Mendez-Lorenzo, P.; Menges, W.; Merritt, F.S.; Mes, H.; Michelini, A.; Mihara, S.; Mikenberg, G.; Miller, D.J.; Mohr, W.; Montanari, A.; Mori, T.; Nagai, K.; Nakamura, I.; Neal, H.A.; Nisius, R.; O'Neale, S.W.; Oakham, F.G.; Odorici, F.; Ogren, H.O.; Oh, A.; Okpara, A.; Oreglia, M.J.; Orito, S.; Pasztor, G.; Pater, J.R.; Patrick, G.N.; Patt, J.; Pfeifenschneider, P.; Pilcher, J.E.; Pinfold, J.; Plane, David E.; Poli, B.; Polok, J.; Pooth, O.; Przybycien, M.; Quadt, A.; Rembser, C.; Renkel, P.; Rick, H.; Rodning, N.; Roney, J.M.; Rosati, S.; Roscoe, K.; Rossi, A.M.; Rozen, Y.; Runge, K.; Runolfsson, O.; Rust, D.R.; Sachs, K.; Saeki, T.; Sahr, O.; Sarkisyan, E.K.G.; Sbarra, C.; Schaile, A.D.; Schaile, O.; Scharff-Hansen, P.; Schroder, Matthias; Schumacher, M.; Schwick, C.; Scott, W.G.; Seuster, R.; Shears, T.G.; Shen, B.C.; Shepherd-Themistocleous, C.H.; Sherwood, P.; Siroli, G.P.; Skuja, A.; Smith, A.M.; Snow, G.A.; Sobie, R.; Soldner-Rembold, S.; Spagnolo, S.; Sproston, M.; Stahl, A.; Stephens, K.; Stoll, K.; Strom, David M.; Strohmer, R.; Stumpf, L.; Surrow, B.; Talbot, S.D.; Tarem, S.; Taylor, R.J.; Teuscher, R.; Thiergen, M.; Thomas, J.; Thomson, M.A.; Torrence, E.; Towers, S.; Toya, D.; Trefzger, T.; Trigger, I.; Trocsanyi, Z.; Tsur, E.; Turner-Watson, M.F.; Ueda, I.; Vachon, B.; Vannerem, P.; Verzocchi, M.; Voss, H.; Vossebeld, J.; Waller, D.; Ward, C.P.; Ward, D.R.; Watkins, P.M.; Watson, A.T.; Watson, N.K.; Wells, P.S.; Wengler, T.; Wermes, N.; Wetterling, D.; White, J.S.; Wilson, G.W.; Wilson, J.A.; Wyatt, T.R.; Yamashita, S.; Zacek, V.; Zer-Zion, D.

    2001-01-01

    Searches for the neutral Higgs bosons h0 and A0, are used to obtain limits on the Type II Two Higgs Doublet Model (2HDM(II)) with no CP-violation in the Higgs sector and no additional particles besides the five Higgs bosons. The analysis combines approximately 170 pb-1 of data collected with the OPAL detector at sqrt{s} ~ 189 GeV with previous runs at sqrt{s} ~ mZ and sqrt{s} ~ 183 GeV. The searches are sensitive to the h0, A0 -> qq, gg, tau+tau- and h0 -> A0A0 decay modes of the Higgs bosons. For the first time, the 2HDM(II) parameter space is explored in a detailed scan, and new flavour independent analyses are applied to examine regions in which the neutral Higgs bosons decay predominantly into light quarks or gluons. Model-independent limits are also given.

  11. Analysis of Multivariate Experimental Data Using A Simplified Regression Model Search Algorithm

    Science.gov (United States)

    Ulbrich, Norbert Manfred

    2013-01-01

    A new regression model search algorithm was developed in 2011 that may be used to analyze both general multivariate experimental data sets and wind tunnel strain-gage balance calibration data. The new algorithm is a simplified version of a more complex search algorithm that was originally developed at the NASA Ames Balance Calibration Laboratory. The new algorithm has the advantage that it needs only about one tenth of the original algorithm's CPU time for the completion of a search. In addition, extensive testing showed that the prediction accuracy of math models obtained from the simplified algorithm is similar to the prediction accuracy of math models obtained from the original algorithm. The simplified algorithm, however, cannot guarantee that search constraints related to a set of statistical quality requirements are always satisfied in the optimized regression models. Therefore, the simplified search algorithm is not intended to replace the original search algorithm. Instead, it may be used to generate an alternate optimized regression model of experimental data whenever the application of the original search algorithm either fails or requires too much CPU time. Data from a machine calibration of NASA's MK40 force balance is used to illustrate the application of the new regression model search algorithm.

  12. A Local Search Modeling for Constrained Optimum Paths Problems (Extended Abstract

    Directory of Open Access Journals (Sweden)

    Quang Dung Pham

    2009-10-01

    Full Text Available Constrained Optimum Path (COP problems appear in many real-life applications, especially on communication networks. Some of these problems have been considered and solved by specific techniques which are usually difficult to extend. In this paper, we introduce a novel local search modeling for solving some COPs by local search. The modeling features the compositionality, modularity, reuse and strengthens the benefits of Constrained-Based Local Search. We also apply the modeling to the edge-disjoint paths problem (EDP. We show that side constraints can easily be added in the model. Computational results show the significance of the approach.

  13. Dynamics of a macroscopic model characterizing mutualism of search engines and web sites

    Science.gov (United States)

    Wang, Yuanshi; Wu, Hong

    2006-05-01

    We present a model to describe the mutualism relationship between search engines and web sites. In the model, search engines and web sites benefit from each other while the search engines are derived products of the web sites and cannot survive independently. Our goal is to show strategies for the search engines to survive in the internet market. From mathematical analysis of the model, we show that mutualism does not always result in survival. We show various conditions under which the search engines would tend to extinction, persist or grow explosively. Then by the conditions, we deduce a series of strategies for the search engines to survive in the internet market. We present conditions under which the initial number of consumers of the search engines has little contribution to their persistence, which is in agreement with the results in previous works. Furthermore, we show novel conditions under which the initial value plays an important role in the persistence of the search engines and deduce new strategies. We also give suggestions for the web sites to cooperate with the search engines in order to form a win-win situation.

  14. An operational search and rescue model for the Norwegian Sea and the North Sea

    Science.gov (United States)

    Breivik, Øyvind; Allen, Arthur A.

    A new operational, ensemble-based search and rescue model for the Norwegian Sea and the North Sea is presented. The stochastic trajectory model computes the net motion of a range of search and rescue objects. A new, robust formulation for the relation between the wind and the motion of the drifting object (termed the leeway of the object) is employed. Empirically derived coefficients for 63 categories of search objects compiled by the US Coast Guard are ingested to estimate the leeway of the drifting objects. A Monte Carlo technique is employed to generate an ensemble that accounts for the uncertainties in forcing fields (wind and current), leeway drift properties, and the initial position of the search object. The ensemble yields an estimate of the time-evolving probability density function of the location of the search object, and its envelope defines the search area. Forcing fields from the operational oceanic and atmospheric forecast system of The Norwegian Meteorological Institute are used as input to the trajectory model. This allows for the first time high-resolution wind and current fields to be used to forecast search areas up to 60 h into the future. A limited set of field exercises show good agreement between model trajectories, search areas, and observed trajectories for life rafts and other search objects. Comparison with older methods shows that search areas expand much more slowly using the new ensemble method with high resolution forcing fields and the new leeway formulation. It is found that going to higher-order stochastic trajectory models will not significantly improve the forecast skill and the rate of expansion of search areas.

  15. Propensity to Search: Common, Leisure, and Labor Models of Consumer Behavior

    Directory of Open Access Journals (Sweden)

    Sergey MALAKHOV

    2015-05-01

    Full Text Available The analysis of the propensity to search specifies the “common” or the ordinary model of consumer behavior based on the synthesis of the neoclassical approach with satisficing concept, and “leisure” and “labor” models of behavior that represent different combinations of conspicuous consumption, leisure, and labor. While the “common model” of behavior demonstrates a moderate propensity to search, “leisure” and “labor” models of consumer behavior exhibit vigorous propensities to search that results in purchase of unnecessary items and therefore in overconsumption. This trend is also presented in home production where vigorous propensity to search takes the form of the vigorous propensity to produce at home. The analysis of trends in allocation of time provides grounds for the assumption that men have more accentuated propensity to search and to produce at home than women that results in overconsumption of unnecessary items.

  16. MUSiC - Model-independent search for deviations from Standard Model predictions in CMS

    Science.gov (United States)

    Pieta, Holger

    2010-02-01

    We present an approach for a model independent search in CMS. Systematically scanning the data for deviations from the standard model Monte Carlo expectations, such an analysis can help to understand the detector and tune event generators. By minimizing the theoretical bias the analysis is furthermore sensitive to a wide range of models for new physics, including the uncounted number of models not-yet-thought-of. After sorting the events into classes defined by their particle content (leptons, photons, jets and missing transverse energy), a minimally prejudiced scan is performed on a number of distributions. Advanced statistical methods are used to determine the significance of the deviating regions, rigorously taking systematic uncertainties into account. A number of benchmark scenarios, including common models of new physics and possible detector effects, have been used to gauge the power of such a method. )

  17. Recent developments in MrBUMP: better search-model preparation, graphical interaction with search models, and solution improvement and assessment.

    Science.gov (United States)

    Keegan, Ronan M; McNicholas, Stuart J; Thomas, Jens M H; Simpkin, Adam J; Simkovic, Felix; Uski, Ville; Ballard, Charles C; Winn, Martyn D; Wilson, Keith S; Rigden, Daniel J

    2018-03-01

    Increasing sophistication in molecular-replacement (MR) software and the rapid expansion of the PDB in recent years have allowed the technique to become the dominant method for determining the phases of a target structure in macromolecular X-ray crystallography. In addition, improvements in bioinformatic techniques for finding suitable homologous structures for use as MR search models, combined with developments in refinement and model-building techniques, have pushed the applicability of MR to lower sequence identities and made weak MR solutions more amenable to refinement and improvement. MrBUMP is a CCP4 pipeline which automates all stages of the MR procedure. Its scope covers everything from the sourcing and preparation of suitable search models right through to rebuilding of the positioned search model. Recent improvements to the pipeline include the adoption of more sensitive bioinformatic tools for sourcing search models, enhanced model-preparation techniques including better ensembling of homologues, and the use of phase improvement and model building on the resulting solution. The pipeline has also been deployed as an online service through CCP4 online, which allows its users to exploit large bioinformatic databases and coarse-grained parallelism to speed up the determination of a possible solution. Finally, the molecular-graphics application CCP4mg has been combined with MrBUMP to provide an interactive visual aid to the user during the process of selecting and manipulating search models for use in MR. Here, these developments in MrBUMP are described with a case study to explore how some of the enhancements to the pipeline and to CCP4mg can help to solve a difficult case.

  18. Graphics-based intelligent search and abstracting using Data Modeling

    Science.gov (United States)

    Jaenisch, Holger M.; Handley, James W.; Case, Carl T.; Songy, Claude G.

    2002-11-01

    This paper presents an autonomous text and context-mining algorithm that converts text documents into point clouds for visual search cues. This algorithm is applied to the task of data-mining a scriptural database comprised of the Old and New Testaments from the Bible and the Book of Mormon, Doctrine and Covenants, and the Pearl of Great Price. Results are generated which graphically show the scripture that represents the average concept of the database and the mining of the documents down to the verse level.

  19. Customised search and comparison of in situ, satellite and model data for ocean modellers

    Science.gov (United States)

    Hamre, Torill; Vines, Aleksander; Lygre, Kjetil

    2014-05-01

    For the ocean modelling community, the amount of available data from historical and upcoming in situ sensor networks and satellite missions, provides an rich opportunity to validate and improve their simulation models. However, the problem of making the different data interoperable and intercomparable remains, due to, among others, differences in terminology and format used by different data providers and the different granularity provided by e.g. in situ data and ocean models. The GreenSeas project (Development of global plankton data base and model system for eco-climate early warning) aims to advance the knowledge and predictive capacities of how marine ecosystems will respond to global change. In the project, one specific objective has been to improve the technology for accessing historical plankton and associated environmental data sets, along with earth observation data and simulation outputs. To this end, we have developed a web portal enabling ocean modellers to easily search for in situ or satellite data overlapping in space and time, and compare the retrieved data with their model results. The in situ data are retrieved from a geo-spatial repository containing both historical and new physical, biological and chemical parameters for the Southern Ocean, Atlantic, Nordic Seas and the Arctic. The satellite-derived quantities of similar parameters from the same areas are retrieved from another geo-spatial repository established in the project. Both repositories are accessed through standard interfaces, using the Open Geospatial Consortium (OGC) Web Map Service (WMS) and Web Feature Service (WFS), and OPeNDAP protocols, respectively. While the developed data repositories use standard terminology to describe the parameters, especially the measured in situ biological parameters are too fine grained to be immediately useful for modelling purposes. Therefore, the plankton parameters were grouped according to category, size and if available by element. This grouping

  20. Interpretation of Higgs and Susy searches in MSUGRA and GMSB Models

    International Nuclear Information System (INIS)

    Vivie, J.B. de

    1999-10-01

    HIGGS and SUSY searches performed by the ALEPH Experiment at LEP are interpreted in the framework of two constrained R-parity conserving models: Minimal Supergravity and minimal Gauge Mediated Supersymmetry Breaking. (author)

  1. Model-independent search for new physics at D0 experiment

    International Nuclear Information System (INIS)

    Naimuddin, Md.

    2012-01-01

    Finding the evidence of new physics beyond the Standard Model is one of the primary goals of RunII of the Tevatron. Many dedicated searches for new physics are ongoing at the Tevatron but in order to broaden the scope and maximize the chances of finding the new physics, we also search in a model-independent way. The results of such searches for indications of new physics at the electroweak scale are presented using data collected using the D0 detector from pp-bar-interactions at √s = 1.96 TeV. (author)

  2. Job durations and the job search model : a two-country, multi-sample analysis

    OpenAIRE

    Bagger, Jesper; Henningsen, Morten

    2008-01-01

    Abstract: This paper assesses whether a parsimonious partial equilibrium job search model with on-the-job search can reproduce observed job durations and transitions to other jobs and to nonemployment. We allow for unobserved heterogeneity across individuals in key structural parameters. Observed heterogeneity and life cycle effects are accounted for by estimating separate models for flow samples of labor market entrants and stock samples of “mature” workers with 10-11 years of...

  3. Proposed Methodology for Application of Human-like gradual Multi-Agent Q-Learning (HuMAQ) for Multi-robot Exploration

    International Nuclear Information System (INIS)

    Ray, Dip Narayan; Majumder, Somajyoti

    2014-01-01

    Several attempts have been made by the researchers around the world to develop a number of autonomous exploration techniques for robots. But it has been always an important issue for developing the algorithm for unstructured and unknown environments. Human-like gradual Multi-agent Q-leaming (HuMAQ) is a technique developed for autonomous robotic exploration in unknown (and even unimaginable) environments. It has been successfully implemented in multi-agent single robotic system. HuMAQ uses the concept of Subsumption architecture, a well-known Behaviour-based architecture for prioritizing the agents of the multi-agent system and executes only the most common action out of all the different actions recommended by different agents. Instead of using new state-action table (Q-table) each time, HuMAQ uses the immediate past table for efficient and faster exploration. The proof of learning has also been established both theoretically and practically. HuMAQ has the potential to be used in different and difficult situations as well as applications. The same architecture has been modified to use for multi-robot exploration in an environment. Apart from all other existing agents used in the single robotic system, agents for inter-robot communication and coordination/ co-operation with the other similar robots have been introduced in the present research. Current work uses a series of indigenously developed identical autonomous robotic systems, communicating with each other through ZigBee protocol

  4. A 3D Geometry Model Search Engine to Support Learning

    Science.gov (United States)

    Tam, Gary K. L.; Lau, Rynson W. H.; Zhao, Jianmin

    2009-01-01

    Due to the popularity of 3D graphics in animation and games, usage of 3D geometry deformable models increases dramatically. Despite their growing importance, these models are difficult and time consuming to build. A distance learning system for the construction of these models could greatly facilitate students to learn and practice at different…

  5. Data-driven model-independent searches for long-lived particles at the LHC

    Science.gov (United States)

    Coccaro, Andrea; Curtin, David; Lubatti, H. J.; Russell, Heather; Shelton, Jessie

    2016-12-01

    Neutral long-lived particles (LLPs) are highly motivated by many beyond the Standard Model scenarios, such as theories of supersymmetry, baryogenesis, and neutral naturalness, and present both tremendous discovery opportunities and experimental challenges for the LHC. A major bottleneck for current LLP searches is the prediction of Standard Model backgrounds, which are often impossible to simulate accurately. In this paper, we propose a general strategy for obtaining differential, data-driven background estimates in LLP searches, thereby notably extending the range of LLP masses and lifetimes that can be discovered at the LHC. We focus on LLPs decaying in the ATLAS muon system, where triggers providing both signal and control samples are available at LHC run 2. While many existing searches require two displaced decays, a detailed knowledge of backgrounds will allow for very inclusive searches that require just one detected LLP decay. As we demonstrate for the h →X X signal model of LLP pair production in exotic Higgs decays, this results in dramatic sensitivity improvements for proper lifetimes ≳10 m . In theories of neutral naturalness, this extends reach to glueball masses far below the b ¯b threshold. Our strategy readily generalizes to other signal models and other detector subsystems. This framework therefore lends itself to the development of a systematic, model-independent LLP search program, in analogy to the highly successful simplified-model framework of prompt searches.

  6. Constitutional Justice Procedure in Lithuania: a Search for Optimal Model

    OpenAIRE

    Pūraitė-Andrikienė, Dovilė

    2017-01-01

    The dissertation systematically analyzes the preconditions for optimising the existing constitutional justice model, i.e. whether the current model meets the expectations of Lithuanian society and the legal community, corresponds to the capabilities of the legal system, and is in line with the tendencies of constitutional justice in European states, identifies the problematic aspects of the existing constitutional justice model and brings forward proposals regarding how the legal regulation c...

  7. Cardiovascular oscillations: in search of a nonlinear parametric model

    Science.gov (United States)

    Bandrivskyy, Andriy; Luchinsky, Dmitry; McClintock, Peter V.; Smelyanskiy, Vadim; Stefanovska, Aneta; Timucin, Dogan

    2003-05-01

    We suggest a fresh approach to the modeling of the human cardiovascular system. Taking advantage of a new Bayesian inference technique, able to deal with stochastic nonlinear systems, we show that one can estimate parameters for models of the cardiovascular system directly from measured time series. We present preliminary results of inference of parameters of a model of coupled oscillators from measured cardiovascular data addressing cardiorespiratory interaction. We argue that the inference technique offers a very promising tool for the modeling, able to contribute significantly towards the solution of a long standing challenge -- development of new diagnostic techniques based on noninvasive measurements.

  8. Univariate and Multivariate Specification Search Indices in Covariance Structure Modeling.

    Science.gov (United States)

    Hutchinson, Susan R.

    1993-01-01

    Simulated population data were used to compare relative performances of the modification index and C. Chou and P. M. Bentler's Lagrange multiplier test (a multivariate generalization of a modification index) for four levels of model misspecification. Both indices failed to recover the true model except at the lowest level of misspecification. (SLD)

  9. Investigating Master Students’ Mental Models of Google Search Engine

    Directory of Open Access Journals (Sweden)

    Azam Safari

    2017-09-01

    According to the findings, it is necessary to consider mental model as a factor affecting information seeking behavior, in designing information systems and training users too. Understanding users’ mental models reveal their errors, misconceptions and knowledge gaps, and by this pathology, it is possible to correct these faults and flaws and increase the effectiveness of the system and training.

  10. Wages, Training, and Job Turnover in a Search-Matching Model

    DEFF Research Database (Denmark)

    Rosholm, Michael; Nielsen, Michael Svarer

    1999-01-01

    In this paper we extend a job search-matching model with firm-specific investments in training developed by Mortensen (1998) to allow for different offer arrival rates in employment and unemployment. The model by Mortensen changes the original wage posting model (Burdett and Mortensen, 1998) in two...

  11. Modelling antibody side chain conformations using heuristic database search.

    Science.gov (United States)

    Ritchie, D W; Kemp, G J

    1997-01-01

    We have developed a knowledge-based system which models the side chain conformations of residues in the variable domains of antibody Fv fragments. The system is written in Prolog and uses an object-oriented database of aligned antibody structures in conjunction with a side chain rotamer library. The antibody database provides 3-dimensional clusters of side chain conformations which can be copied en masse into the model structure. The object-oriented database architecture facilitates a navigational style of database access, necessary to assemble side chains clusters. Around 60% of the model is built using side chain clusters and this eliminates much of the combinatorial complexity associated with many other side chain placement algorithms. Construction and placement of side chain clusters is guided by a heuristic cost function based on a simple model of side chain packing interactions. Even with a simple model, we find that a large proportion of side chain conformations are modelled accurately. We expect our approach could be used with other homologous protein families, in addition to antibodies, both to improve the quality of model structures and to give a "smart start" to the side chain placement problem.

  12. Search for Higgs bosons beyond the Standard Model

    Directory of Open Access Journals (Sweden)

    Mankel Rainer

    2015-01-01

    Full Text Available While the existence of a Higgs boson with a mass near 125 GeV has been clearly established, the detailed structure of the entire Higgs sector is yet unclear. Beyond the standard model interpretation, various scenarios for extended Higgs sectors are being considered. Such options include the minimal and next-to-minimal supersymmetric extensions (MSSM and NMSSM of the standard model, more generic Two-Higgs Doublet models (2HDM, as well as truly exotic Higgs bosons decaying e.g. into totally invisible final states. This article presents recent results from the CMS experiment.

  13. Search for the standard model Higgs boson in $l\

    Energy Technology Data Exchange (ETDEWEB)

    Li, Dikai [Pierre and Marie Curie Univ., Paris (France)

    2013-01-01

    Humans have always attempted to understand the mystery of Nature, and more recently physicists have established theories to describe the observed phenomena. The most recent theory is a gauge quantum field theory framework, called Standard Model (SM), which proposes a model comprised of elementary matter particles and interaction particles which are fundamental force carriers in the most unified way. The Standard Model contains the internal symmetries of the unitary product group SU(3)c ⓍSU(2)L Ⓧ U(1)Y , describes the electromagnetic, weak and strong interactions; the model also describes how quarks interact with each other through all of these three interactions, how leptons interact with each other through electromagnetic and weak forces, and how force carriers mediate the fundamental interactions.

  14. QUEST: A model to quantify uncertain emergency search techniques, theory and application

    International Nuclear Information System (INIS)

    Johnson, M.M.; Goldsby, M.E.; Plantenga, T.D.; Wilcox, W.B.; Hensley, W.K.

    1996-01-01

    As recent world events show, criminal and terrorist access to nuclear materials is a growing national concern. The national laboratories are taking the lead in developing technologies to counter these potential threats to our national security. Sandia National Laboratories, with support from Pacific Northwest Laboratory and the Remote Sensing Laboratory, has developed QUEST (a model to Quantify Uncertain Emergency Search Techniques), to enhance the performance of organizations in the search for lost or stolen nuclear material. In addition, QUEST supports a wide range of other applications, such as environmental monitoring, nuclear facilities inspections, and searcher training. QUEST simulates the search for nuclear materials and calculates detector response fro various source types and locations. The probability of detecting a radioactive source during a search is a function of many different variables. Through calculation of dynamic detector response, QUEST makes possible quantitative comparisons of various sensor technologies and search patterns. The QUEST model can be used to examine the impact of new detector technologies, explore alternative search concepts, and provide interactive search/inspector training

  15. Dialect topic modeling for improved consumer medical search.

    Science.gov (United States)

    Crain, Steven P; Yang, Shuang-Hong; Zha, Hongyuan; Jiao, Yu

    2010-11-13

    Access to health information by consumers is hampered by a fundamental language gap. Current attempts to close the gap leverage consumer oriented health information, which does not, however, have good coverage of slang medical terminology. In this paper, we present a Bayesian model to automatically align documents with different dialects (slang, common and technical) while extracting their semantic topics. The proposed diaTM model enables effective information retrieval, even when the query contains slang words, by explicitly modeling the mixtures of dialects in documents and the joint influence of dialects and topics on word selection. Simulations using consumer questions to retrieve medical information from a corpus of medical documents show that diaTM achieves a 25% improvement in information retrieval relevance by nDCG@5 over an LDA baseline.

  16. Dialect Topic Modeling for Improved Consumer Medical Search

    Energy Technology Data Exchange (ETDEWEB)

    Crain, Steven P. [Georgia Institute of Technology; Yang, Shuang-Hong [Georgia Institute of Technology; Zha, Hongyuan [Georgia Institute of Technology; Jiao, Yu [ORNL

    2010-01-01

    Access to health information by consumers is ham- pered by a fundamental language gap. Current attempts to close the gap leverage consumer oriented health information, which does not, however, have good coverage of slang medical terminology. In this paper, we present a Bayesian model to automatically align documents with different dialects (slang, com- mon and technical) while extracting their semantic topics. The proposed diaTM model enables effective information retrieval, even when the query contains slang words, by explicitly modeling the mixtures of dialects in documents and the joint influence of dialects and topics on word selection. Simulations us- ing consumer questions to retrieve medical information from a corpus of medical documents show that diaTM achieves a 25% improvement in information retrieval relevance by nDCG@5 over an LDA baseline.

  17. Searching for extensions to the standard model in rare kaon decays

    International Nuclear Information System (INIS)

    Sanders, G.H.

    1989-01-01

    Small effects that are beyond the current standard models of physics are often signatures for new physics, revealing fields and mass scales far removed from contemporary experimental capabilities. This perspective motivates sensitive searches for rare decays of the kaon. The current status of these searches is reviewed, new results are presented, and progress in the near future is discussed. Opportunities for exciting physics research at a hadron facility are noted. 5 refs., 8 figs., 1 tab

  18. Modeling guidance and recognition in categorical search: Bridging human and computer object detection

    OpenAIRE

    Zelinsky, Gregory J.; Peng, Yifan; Berg, Alexander C.; Samaras, Dimitris

    2013-01-01

    Search is commonly described as a repeating cycle of guidance to target-like objects, followed by the recognition of these objects as targets or distractors. Are these indeed separate processes using different visual features? We addressed this question by comparing observer behavior to that of support vector machine (SVM) models trained on guidance and recognition tasks. Observers searched for a categorically defined teddy bear target in four-object arrays. Target-absent trials consisted of ...

  19. A product feature-based user-centric product search model

    OpenAIRE

    Ben Jabeur, Lamjed; Soulier, Laure; Tamine, Lynda; Mousset, Paul

    2016-01-01

    During the online shopping process, users would search for interesting products and quickly access those that fit with their needs among a long tail of similar or closely related products. Our contribution addresses head queries that are frequently submitted on e-commerce Web sites. Head queries usually target featured products with several variations, accessories, and complementary products. We present in this paper a product feature-based user-centric model for product search involving in a...

  20. Searches for physics beyond the Standard Model at the Tevatron

    Indian Academy of Sciences (India)

    Publications ... Beyond Standard Model Physics Volume 79 Issue 4 October 2012 pp 703-717 ... a centre-of-mass energy of 1.96 TeV that the CDF and DO Collaborations have scrutinized looking for new physics in a wide range of final states.

  1. Modeling and prediction of human word search behavior in interactive machine translation

    Science.gov (United States)

    Ji, Duo; Yu, Bai; Ma, Bin; Ye, Na

    2017-12-01

    As a kind of computer aided translation method, Interactive Machine Translation technology reduced manual translation repetitive and mechanical operation through a variety of methods, so as to get the translation efficiency, and played an important role in the practical application of the translation work. In this paper, we regarded the behavior of users' frequently searching for words in the translation process as the research object, and transformed the behavior to the translation selection problem under the current translation. The paper presented a prediction model, which is a comprehensive utilization of alignment model, translation model and language model of the searching words behavior. It achieved a highly accurate prediction of searching words behavior, and reduced the switching of mouse and keyboard operations in the users' translation process.

  2. Standard model parameters and the search for new physics

    International Nuclear Information System (INIS)

    Marciano, W.J.

    1988-04-01

    In these lectures, my aim is to present an up-to-date status report on the standard model and some key tests of electroweak unification. Within that context, I also discuss how and where hints of new physics may emerge. To accomplish those goals, I have organized my presentation as follows: I discuss the standard model parameters with particular emphasis on the gauge coupling constants and vector boson masses. Examples of new physics appendages are also briefly commented on. In addition, because these lectures are intended for students and thus somewhat pedagogical, I have included an appendix on dimensional regularization and a simple computational example that employs that technique. Next, I focus on weak charged current phenomenology. Precision tests of the standard model are described and up-to-date values for the Cabibbo-Kobayashi-Maskawa (CKM) mixing matrix parameters are presented. Constraints implied by those tests for a 4th generation, supersymmetry, extra Z/prime/ bosons, and compositeness are also discussed. I discuss weak neutral current phenomenology and the extraction of sin/sup 2/ /theta//sub W/ from experiment. The results presented there are based on a recently completed global analysis of all existing data. I have chosen to concentrate that discussion on radiative corrections, the effect of a heavy top quark mass, and implications for grand unified theories (GUTS). The potential for further experimental progress is also commented on. I depart from the narrowest version of the standard model and discuss effects of neutrino masses and mixings. I have chosen to concentrate on oscillations, the Mikheyev-Smirnov- Wolfenstein (MSW) effect, and electromagnetic properties of neutrinos. On the latter topic, I will describe some recent work on resonant spin-flavor precession. Finally, I conclude with a prospectus on hopes for the future. 76 refs

  3. Possible constraints on SUSY-model parameters from direct dark matter search

    International Nuclear Information System (INIS)

    Bednyakov, V.A.; Kovalenko, S.G.

    1993-01-01

    We consider the SUSY-model neutralino as a dominant Dark Matter particle in the galactic halo and investigate some general issues of direct DM searches via elastic neutralino-nucleus scattering. On the basis of conventional assumptions about the nuclear and nucleon structure, without referring to a specific SUSY-model, we prove that it is impossible in principle to extract more than three constrains on fundamental SUSY-model parameters from the direct Dark Matter searches. Three types of Dark Matter detector probing different groups of parameters are recognized. 21 refs., 1 tab

  4. Models & Searches of CPT Violation: a personal, very partial, list

    Science.gov (United States)

    Mavromatos, Nick E.

    2018-01-01

    In this talk, first I motivate theoretically, and then I review the phenomenology of, some models entailing CPT Violation (CPTV). The latter is argued to be responsible for the observed matter-antimatter asymmetry in the Cosmos, and may owe its origin to either Lorentz-violating background geometries, whose effects are strong in early epochs of the Universe but very weak today, being temperature dependent in general, or to an ill-defined CPT generator in some quantum gravity models entailing decoherence of quantum matter as a result of quantum degrees of freedom in the gravity sector that are inaccessible to the low-energy observers. In particular, for the latter category of CPTV, I argue that entangled states of neutral mesons (Kaons or B-systems), of central relevance to KLOE-2 experiment, can provide smoking-gun sensitive tests or even falsify some of these models. If CPT is ill-defined one may also encounter violations of the spin-statistics theorem, with possible consequences for the Pauli Exclusion Principle, which I only briefly touch upon.

  5. Models & Searches of CPT Violation: a personal, very partial, list

    Directory of Open Access Journals (Sweden)

    Mavromatos Nick E.

    2018-01-01

    Full Text Available In this talk, first I motivate theoretically, and then I review the phenomenology of, some models entailing CPT Violation (CPTV. The latter is argued to be responsible for the observed matter-antimatter asymmetry in the Cosmos, and may owe its origin to either Lorentz-violating background geometries, whose effects are strong in early epochs of the Universe but very weak today, being temperature dependent in general, or to an ill-defined CPT generator in some quantum gravity models entailing decoherence of quantum matter as a result of quantum degrees of freedom in the gravity sector that are inaccessible to the low-energy observers. In particular, for the latter category of CPTV, I argue that entangled states of neutral mesons (Kaons or B-systems, of central relevance to KLOE-2 experiment, can provide smoking-gun sensitive tests or even falsify some of these models. If CPT is ill-defined one may also encounter violations of the spin-statistics theorem, with possible consequences for the Pauli Exclusion Principle, which I only briefly touch upon.

  6. DEVELOPING AND PROPOSING A CONCEPTUAL MODEL OF THE FLOW EXPERIENCE DURING ONLINE INFORMATION SEARCH

    Directory of Open Access Journals (Sweden)

    Lazoc Alina

    2012-07-01

    Full Text Available Information search is an essential part of the consumer`s decision making process. The online medium offers new opportunities and challenges for information search activities (in and outside the marketing context. We are interested in the way human information experiences and behaviors are affected by this. Very often online games and social web activities are perceived as challenging, engaging and enjoyable, while online information search is far below this evaluation. Our research proposal implies that using the online medium for information search may provoke enjoyable experiences through the flow state, which may in turn positively influence an individual`s exploratory information behavior and encourage his/her pro-active market behavior. The present study sets out to improve the understanding of the online medium`s impact on human`s exploratory behavior. We hypothesize that the inclusion of the online flow experience in our research model will better explain exploratory information search behaviors. A 11-component conceptual framework is proposed to explain the manifestations of flow, its personal and technological determinants and its behavioral consequence in the context of online information search. Our research has the primary purpose to present an integrated online flow model. Its secondary objective is to stimulate extended research in the area of informational behaviors in the digital age. The paper is organized in three sections. In the first section we briefly report the analysis results of the most relevant online flow theory literature and, drawing on it, we are trying to identify variables and relationships among these. In the second part we propose a research model and use prior flow models to specify a range of testable hypothesis. Drawing on the conceptual model developed, the last section of our study presents the final conclusions and proposes further steps in evaluating the model`s validity. Future research directions

  7. Hierarchical heuristic search using a Gaussian mixture model for UAV coverage planning.

    Science.gov (United States)

    Lin, Lanny; Goodrich, Michael A

    2014-12-01

    During unmanned aerial vehicle (UAV) search missions, efficient use of UAV flight time requires flight paths that maximize the probability of finding the desired subject. The probability of detecting the desired subject based on UAV sensor information can vary in different search areas due to environment elements like varying vegetation density or lighting conditions, making it likely that the UAV can only partially detect the subject. This adds another dimension of complexity to the already difficult (NP-Hard) problem of finding an optimal search path. We present a new class of algorithms that account for partial detection in the form of a task difficulty map and produce paths that approximate the payoff of optimal solutions. The algorithms use the mode goodness ratio heuristic that uses a Gaussian mixture model to prioritize search subregions. The algorithms search for effective paths through the parameter space at different levels of resolution. We compare the performance of the new algorithms against two published algorithms (Bourgault's algorithm and LHC-GW-CONV algorithm) in simulated searches with three real search and rescue scenarios, and show that the new algorithms outperform existing algorithms significantly and can yield efficient paths that yield payoffs near the optimal.

  8. Interpretation of the results of statistical measurements. [search for basic probability model

    Science.gov (United States)

    Olshevskiy, V. V.

    1973-01-01

    For random processes, the calculated probability characteristic, and the measured statistical estimate are used in a quality functional, which defines the difference between the two functions. Based on the assumption that the statistical measurement procedure is organized so that the parameters for a selected model are optimized, it is shown that the interpretation of experimental research is a search for a basic probability model.

  9. In search of a Croatian model of nursing education.

    Science.gov (United States)

    Simunovic, Vladimir J; Zupanovic, Marija; Mihanovic, Frane; Zemunik, Tatijana; Bradaric, Nikola; Jankovic, Stipan

    2010-10-01

    To analyze the present status and ongoing reforms of nursing education in Europe, to compare it with the situation in Croatia, and to propose a new educational model that corresponds to the needs of the Croatian health care system. The literature on contemporary nursing education in Europe and North America was reviewed, together with European Commission directives and regulations, as well as pertinent World Health Organization documents. In addition, 20 recent annual reports from 2003-2009, submitted by national nursing associations to the Workgroup of European Nurse Researchers (WERN), were studied. After appraisal of current trends, the Working Group on Reform of Nursing Education drafted The Croatian Model for Education in Nursing and developed a three-cycle curriculum with syllabus. The proposed curriculum is radically different from traditional ones. Responding to modern demands, it focuses on outcomes (developing competencies) and is evidence-based. A new, Croatian concept of nursing education is presented that is concordant with reforms in nursing education in other European countries. It holds promise for making nursing education an integral part of a unified European system of higher education.

  10. Electronic Commerce Success Model: A Search for Multiple Criteria

    Directory of Open Access Journals (Sweden)

    Didi Achjari

    2004-01-01

    Full Text Available The current study attempts to develop and examine framework of e-commerce success. In order to obtain comprehensive and robust measures, the framework accomodates key factors that are identified in the literature concerning the success of electronic commerce. The structural model comprises of four exogenous variables (Internal Driver, Internal Impediment, External Driver and Exgternal Impediment and one endogenous variable (Electornic Commerce Success eith 24 observed variables. The study that was administered within large Australian companies using questionaire survey concluded that benefits for both internal organization and external parties from the use of e-commerce were the main factor tro predict perceived and/or expected success of electronic commerce.

  11. A quasi-model-independent search for new high pT physics at DO

    International Nuclear Information System (INIS)

    Knuteson, Bruce O.

    2000-01-01

    We present a new quasi-model-independent strategy (''Sleuth'') for searching for physics beyond the standard model. We define final states to be studied, and construct a rule that identifies a set of relevant variables for any particular final state. A novel algorithm searches for regions of excess in those variables and quantifies the significance of any detected excess. This strategy is applied to search for new high p T physics in approximately 100 pb -1 of proton-anti-proton collisions at sqrt(s) = 1.8 TeV collected by the D0 experiment during 1992-1996 at the Fermilab Tevatron. We systematically analyze many exclusive final states, and demonstrate sensitivity to a variety of models predicting new phenomena at the electroweak scale. No evidence of new high p T physics is observed

  12. Three hybridization models based on local search scheme for job shop scheduling problem

    Science.gov (United States)

    Balbi Fraga, Tatiana

    2015-05-01

    This work presents three different hybridization models based on the general schema of Local Search Heuristics, named Hybrid Successive Application, Hybrid Neighborhood, and Hybrid Improved Neighborhood. Despite similar approaches might have already been presented in the literature in other contexts, in this work these models are applied to analyzes the solution of the job shop scheduling problem, with the heuristics Taboo Search and Particle Swarm Optimization. Besides, we investigate some aspects that must be considered in order to achieve better solutions than those obtained by the original heuristics. The results demonstrate that the algorithms derived from these three hybrid models are more robust than the original algorithms and able to get better results than those found by the single Taboo Search.

  13. Governance, Government, and the Search for New Provider Models

    Directory of Open Access Journals (Sweden)

    Richard B. Saltman

    2016-01-01

    Full Text Available A central problem in designing effective models of provider governance in health systems has been to ensure an appropriate balance between the concerns of public sector and/or government decision-makers, on the one hand, and of non-governmental health services actors in civil society and private life, on the other. In tax-funded European health systems up to the 1980s, the state and other public sector decision-makers played a dominant role over health service provision, typically operating hospitals through national or regional governments on a command-and-control basis. In a number of countries, however, this state role has started to change, with governments first stepping out of direct service provision and now de facto pushed to focus more on steering provider organizations rather than on direct public management. In this new approach to provider governance, the state has pulled back into a regulatory role that introduces market-like incentives and management structures, which then apply to both public and private sector providers alike. This article examines some of the main operational complexities in implementing this new governance reality/strategy, specifically from a service provision (as opposed to mostly a financing or even regulatory perspective. After briefly reviewing some of the key theoretical dilemmas, the paper presents two case studies where this new approach was put into practice: primary care in Sweden and hospitals in Spain. The article concludes that good governance today needs to reflect practical operational realities if it is to have the desired effect on health sector reform outcome.

  14. Governance, Government, and the Search for New Provider Models.

    Science.gov (United States)

    Saltman, Richard B; Duran, Antonio

    2015-11-03

    A central problem in designing effective models of provider governance in health systems has been to ensure an appropriate balance between the concerns of public sector and/or government decision-makers, on the one hand, and of non-governmental health services actors in civil society and private life, on the other. In tax-funded European health systems up to the 1980s, the state and other public sector decision-makers played a dominant role over health service provision, typically operating hospitals through national or regional governments on a command-and-control basis. In a number of countries, however, this state role has started to change, with governments first stepping out of direct service provision and now de facto pushed to focus more on steering provider organizations rather than on direct public management. In this new approach to provider governance, the state has pulled back into a regulatory role that introduces market-like incentives and management structures, which then apply to both public and private sector providers alike. This article examines some of the main operational complexities in implementing this new governance reality/strategy, specifically from a service provision (as opposed to mostly a financing or even regulatory) perspective. After briefly reviewing some of the key theoretical dilemmas, the paper presents two case studies where this new approach was put into practice: primary care in Sweden and hospitals in Spain. The article concludes that good governance today needs to reflect practical operational realities if it is to have the desired effect on health sector reform outcome. © 2016 by Kerman University of Medical Sciences.

  15. Search for Exotic Physics Beyond the Standard Model with the ATLAS Detector

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00287508; The ATLAS collaboration

    2017-01-01

    A summary is given of non-SUSY searches for New Physics with the ATLAS detector at the LHC. Shown results use a data sample collected with a center-of-mass energy of ${\\sqrt{s}=8}$ TeV and an integrated luminosity of around $20$ fb$^{-1}$ in proton-proton collisions. Four recent searches using leptons, photons, missing transverse energy, and jets are presented. No significant deviations from Standard Model expectations are observed, hence new limits on a wide set of predictions for several Standard Model extensions are set.

  16. Search for a lighter Higgs boson in Two Higgs Doublet Models

    Energy Technology Data Exchange (ETDEWEB)

    Cacciapaglia, Giacomo; Deandrea, Aldo; Gascon-Shotkin, Suzanne; Corre, Solène Le; Lethuillier, Morgan [University Lyon, Université Claude Bernard Lyon 1, CNRS/IN2P3, UMR5822 IPNL,4, rue E. Fermi, Villeurbanne, F-69622 (France); Tao, Junquan [Institute High Energy Physics, Chinese Academy of Sciences,P.O. Box 918, Beijing, 100049 (China)

    2016-12-15

    We consider present constraints on Two Higgs Doublet Models, both from the LHC at Run 1 and from other sources in order to explore the possibility of constraining a neutral scalar or pseudo-scalar particle lighter than the 125 GeV Higgs boson. Such a lighter particle is not yet completely excluded by present data. We show with a simplified analysis that some new constraints could be obtained at the LHC if such a search is performed by the experimental collaborations, which we therefore encourage to continue carrying out light diphoton resonance searches at √s=13 TeV in the context of Two Higgs Doublet Models.

  17. Global search tool for the Advanced Photon Source Integrated Relational Model of Installed Systems (IRMIS) database

    International Nuclear Information System (INIS)

    Quock, D.E.R.; Cianciarulo, M.B.

    2007-01-01

    The Integrated Relational Model of Installed Systems (IRMIS) is a relational database tool that has been implemented at the Advanced Photon Source to maintain an updated account of approximately 600 control system software applications, 400,000 process variables, and 30,000 control system hardware components. To effectively display this large amount of control system information to operators and engineers, IRMIS was initially built with nine Web-based viewers: Applications Organizing Index, IOC, PLC, Component Type, Installed Components, Network, Controls Spares, Process Variables, and Cables. However, since each viewer is designed to provide details from only one major category of the control system, the necessity for a one-stop global search tool for the entire database became apparent. The user requirements for extremely fast database search time and ease of navigation through search results led to the choice of Asynchronous JavaScript and XML (AJAX) technology in the implementation of the IRMIS global search tool. Unique features of the global search tool include a two-tier level of displayed search results, and a database data integrity validation and reporting mechanism.

  18. Power law-based local search in spider monkey optimisation for lower order system modelling

    Science.gov (United States)

    Sharma, Ajay; Sharma, Harish; Bhargava, Annapurna; Sharma, Nirmala

    2017-01-01

    The nature-inspired algorithms (NIAs) have shown efficiency to solve many complex real-world optimisation problems. The efficiency of NIAs is measured by their ability to find adequate results within a reasonable amount of time, rather than an ability to guarantee the optimal solution. This paper presents a solution for lower order system modelling using spider monkey optimisation (SMO) algorithm to obtain a better approximation for lower order systems and reflects almost original higher order system's characteristics. Further, a local search strategy, namely, power law-based local search is incorporated with SMO. The proposed strategy is named as power law-based local search in SMO (PLSMO). The efficiency, accuracy and reliability of the proposed algorithm is tested over 20 well-known benchmark functions. Then, the PLSMO algorithm is applied to solve the lower order system modelling problem.

  19. A Generalized Radiation Model for Human Mobility: Spatial Scale, Searching Direction and Trip Constraint.

    Directory of Open Access Journals (Sweden)

    Chaogui Kang

    Full Text Available We generalized the recently introduced "radiation model", as an analog to the generalization of the classic "gravity model", to consolidate its nature of universality for modeling diverse mobility systems. By imposing the appropriate scaling exponent λ, normalization factor κ and system constraints including searching direction and trip OD constraint, the generalized radiation model accurately captures real human movements in various scenarios and spatial scales, including two different countries and four different cities. Our analytical results also indicated that the generalized radiation model outperformed alternative mobility models in various empirical analyses.

  20. A Minimal Path Searching Approach for Active Shape Model (ASM)-based Segmentation of the Lung.

    Science.gov (United States)

    Guo, Shengwen; Fei, Baowei

    2009-03-27

    We are developing a minimal path searching method for active shape model (ASM)-based segmentation for detection of lung boundaries on digital radiographs. With the conventional ASM method, the position and shape parameters of the model points are iteratively refined and the target points are updated by the least Mahalanobis distance criterion. We propose an improved searching strategy that extends the searching points in a fan-shape region instead of along the normal direction. A minimal path (MP) deformable model is applied to drive the searching procedure. A statistical shape prior model is incorporated into the segmentation. In order to keep the smoothness of the shape, a smooth constraint is employed to the deformable model. To quantitatively assess the ASM-MP segmentation, we compare the automatic segmentation with manual segmentation for 72 lung digitized radiographs. The distance error between the ASM-MP and manual segmentation is 1.75 ± 0.33 pixels, while the error is 1.99 ± 0.45 pixels for the ASM. Our results demonstrate that our ASM-MP method can accurately segment the lung on digital radiographs.

  1. Simplified Models for Dark Matter and Missing Energy Searches at the LHC

    Energy Technology Data Exchange (ETDEWEB)

    Abdallah, Jalal [Academia Sinica, Taipei (Taiwan). Inst. of Physics; Ashkenazi, Adi [Tel Aviv Univ. (Israel). Dept. of Physics; Boveia, Antonio [Univ. of Chicago, IL (United States). Enrico Fermi Inst.; Busoni, Giorgio [International School for Advanced Studies (SISSA), Trieste (Italy); National Inst. for Nuclear Physics (INFN), Trieste (Italy); De Simone, Andrea [International School for Advanced Studies (SISSA), Trieste (Italy); National Inst. for Nuclear Physics (INFN), Trieste (Italy); Doglioni, Caterina [Univ. of Geneva (Switzerland). Physics Dept.; Efrati, Aielet [Weizmann Inst. of Science, Rehovot (Israel). Dept. of Particle Physics and Astrophysics; Etzion, Erez [Tel Aviv Univ. (Israel). Dept. of Physics; Gramling, Johanna [Univ. of Geneva (Switzerland). Physics Dept.; Jacques, Thomas [Univ. of Geneva (Switzerland). Physics Dept.; Lin, Tongyan [Univ. of Chicago, IL (United States). Kavli Inst. for Cosmological Physics. Enrico Fermi Inst.; Morgante, Enrico [Univ. of Geneva (Switzerland). Physics Dept.; Papucci, Michele [Univ. of California, Berkeley, CA (United States). Berkeley Center for Theoretical Physics; Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Theoretical Physics Group; Penning, Bjoern [Univ. of Chicago, IL (United States). Enrico Fermi Inst.; Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States); Riotto, Antonio Walter [Univ. of Geneva (Switzerland). Physics Dept.; Rizzo, Thomas [SLAC National Accelerator Lab., Menlo Park, CA (United States); Salek, David [National Inst. for Subatomic Physics (NIKHEF), Amsterdam (Netherlands); Gravitation and AstroParticle Physics in Amsterdam (GRAPPA), Amsterdam (Netherlands); Schramm, Steven [Univ. of Toronto, ON (Canada). Dept. of Physics; Slone, Oren [Tel Aviv Univ. (Israel). Dept. of Physics; Soreq, Yotam [Weizmann Inst. of Science, Rehovot (Israel). Dept. of Particle Physics and Astrophysics; Vichi, Alessandro [Univ. of California, Berkeley, CA (United States). Berkeley Center for Theoretical Physics; Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Theoretical Physics Group; Volansky, Tomer [Tel Aviv Univ. (Israel). Dept. of Physics; Yavin, Itay [Perimeter Inst. for Theoretical Physics, Waterloo, ON (Canada); McMaster Univ., Hamilton, ON (Canada). Dept. of Physics; Zhou, Ning [Univ. of California, Irvine, CA (United States). Dept. of Physics and Astronomy; Zurek, Kathryn [Univ. of California, Berkeley, CA (United States). Berkeley Center for Theoretical Physics; Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Theoretical Physics Group

    2014-10-01

    The study of collision events with missing energy as searches for the dark matter (DM) component of the Universe are an essential part of the extensive program looking for new physics at the LHC. Given the unknown nature of DM, the interpretation of such searches should be made broad and inclusive. This report reviews the usage of simplified models in the interpretation of missing energy searches. We begin with a brief discussion of the utility and limitation of the effective field theory approach to this problem. The bulk of the report is then devoted to several different simplified models and their signatures, including s-channel and t-channel processes. A common feature of simplified models for DM is the presence of additional particles that mediate the interactions between the Standard Model and the particle that makes up DM. We consider these in detail and emphasize the importance of their inclusion as final states in any coherent interpretation. We also review some of the experimental progress in the field, new signatures, and other aspects of the searches themselves. We conclude with comments and recommendations regarding the use of simplified models in Run-II of the LHC.

  2. A minimal path searching approach for active shape model (ASM)-based segmentation of the lung

    Science.gov (United States)

    Guo, Shengwen; Fei, Baowei

    2009-02-01

    We are developing a minimal path searching method for active shape model (ASM)-based segmentation for detection of lung boundaries on digital radiographs. With the conventional ASM method, the position and shape parameters of the model points are iteratively refined and the target points are updated by the least Mahalanobis distance criterion. We propose an improved searching strategy that extends the searching points in a fan-shape region instead of along the normal direction. A minimal path (MP) deformable model is applied to drive the searching procedure. A statistical shape prior model is incorporated into the segmentation. In order to keep the smoothness of the shape, a smooth constraint is employed to the deformable model. To quantitatively assess the ASM-MP segmentation, we compare the automatic segmentation with manual segmentation for 72 lung digitized radiographs. The distance error between the ASM-MP and manual segmentation is 1.75 +/- 0.33 pixels, while the error is 1.99 +/- 0.45 pixels for the ASM. Our results demonstrate that our ASM-MP method can accurately segment the lung on digital radiographs.

  3. Simplified Models for Dark Matter and Missing Energy Searches at the LHC

    International Nuclear Information System (INIS)

    Abdallah, Jalal; De Simone, Andrea; Doglioni, Caterina; Riotto, Antonio Walter; Salek, David; Schramm, Steven; Slone, Oren; Soreq, Yotam; Vichi, Alessandro; Lawrence Berkeley National Lab.; Volansky, Tomer; Yavin, Itay; McMaster Univ., Hamilton, ON; Zhou, Ning; Zurek, Kathryn; Lawrence Berkeley National Lab.

    2014-01-01

    The study of collision events with missing energy as searches for the dark matter (DM) component of the Universe are an essential part of the extensive program looking for new physics at the LHC. Given the unknown nature of DM, the interpretation of such searches should be made broad and inclusive. This report reviews the usage of simplified models in the interpretation of missing energy searches. We begin with a brief discussion of the utility and limitation of the effective field theory approach to this problem. The bulk of the report is then devoted to several different simplified models and their signatures, including s-channel and t-channel processes. A common feature of simplified models for DM is the presence of additional particles that mediate the interactions between the Standard Model and the particle that makes up DM. We consider these in detail and emphasize the importance of their inclusion as final states in any coherent interpretation. We also review some of the experimental progress in the field, new signatures, and other aspects of the searches themselves. We conclude with comments and recommendations regarding the use of simplified models in Run-II of the LHC.

  4. e/sup +/e/sup -/ interactions at very high energy: searching beyond the standard model

    Energy Technology Data Exchange (ETDEWEB)

    Dorfan, J.

    1983-04-01

    These lectures discuss e/sup +/e/sup -/ interactions at very high energies with a particular emphasis on searching the standard model which we take to be SU(3)/sub color/..lambda.. SU(2) ..lambda.. U(1). The highest e/sup +/e/sup -/ collision energy exploited to date is at PETRA where data have been taken at 38 GeV. We will consider energies above this to be the very high energy frontier. The lectures will begin with a review of the collision energies which will be available in the upgraded machines of today and the machines planned for tomorrow. Without going into great detail, we will define the essential elements of the standard model. We will remind ourselves that some of these essential elements have not yet been verified and that part of the task of searching beyond the standard model will involve experiments aimed at this verification. For if we find the standard model lacking, then clearly we are forced to find an alternative. So we will investigate how the higher energy e/sup +/e/sup -/ collisions can be used to search for the top quark, the neutral Higgs scalar, provide true verification of the non-Abelian nature of QCD, etc. Having done this we will look at tests of models involving simple extensions of the standard model. Models considered are those without a top quark, those with charged Higgs scalars, with multiple and/or composite vector bosons, with additional generations and possible alternative explanations for the PETRA three jet events which don't require gluon bremsstrahlung. From the simple extensions of the standard model we will move to more radical alternatives, alternatives which have arisen from the unhappiness with the gauge hierarchy problem of the standard model. Technicolor, Supersymmetry and composite models will be discussed. In the final section we will summarize what the future holds in terms of the search beyond the standard model.

  5. e+e- interactions at very high energy: searching beyond the standard model

    International Nuclear Information System (INIS)

    Dorfan, J.

    1983-04-01

    These lectures discuss e + e - interactions at very high energies with a particular emphasis on searching the standard model which we take to be SU(3)/sub color/Λ SU(2) Λ U(1). The highest e + e - collision energy exploited to date is at PETRA where data have been taken at 38 GeV. We will consider energies above this to be the very high energy frontier. The lectures will begin with a review of the collision energies which will be available in the upgraded machines of today and the machines planned for tomorrow. Without going into great detail, we will define the essential elements of the standard model. We will remind ourselves that some of these essential elements have not yet been verified and that part of the task of searching beyond the standard model will involve experiments aimed at this verification. For if we find the standard model lacking, then clearly we are forced to find an alternative. So we will investigate how the higher energy e + e - collisions can be used to search for the top quark, the neutral Higgs scalar, provide true verification of the non-Abelian nature of QCD, etc. Having done this we will look at tests of models involving simple extensions of the standard model. Models considered are those without a top quark, those with charged Higgs scalars, with multiple and/or composite vector bosons, with additional generations and possible alternative explanations for the PETRA three jet events which don't require gluon bremsstrahlung. From the simple extensions of the standard model we will move to more radical alternatives, alternatives which have arisen from the unhappiness with the gauge hierarchy problem of the standard model. Technicolor, Supersymmetry and composite models will be discussed. In the final section we will summarize what the future holds in terms of the search beyond the standard model

  6. A bio-inspired swarm robot coordination algorithm for multiple target searching

    Science.gov (United States)

    Meng, Yan; Gan, Jing; Desai, Sachi

    2008-04-01

    The coordination of a multi-robot system searching for multi targets is challenging under dynamic environment since the multi-robot system demands group coherence (agents need to have the incentive to work together faithfully) and group competence (agents need to know how to work together well). In our previous proposed bio-inspired coordination method, Local Interaction through Virtual Stigmergy (LIVS), one problem is the considerable randomness of the robot movement during coordination, which may lead to more power consumption and longer searching time. To address these issues, an adaptive LIVS (ALIVS) method is proposed in this paper, which not only considers the travel cost and target weight, but also predicting the target/robot ratio and potential robot redundancy with respect to the detected targets. Furthermore, a dynamic weight adjustment is also applied to improve the searching performance. This new method a truly distributed method where each robot makes its own decision based on its local sensing information and the information from its neighbors. Basically, each robot only communicates with its neighbors through a virtual stigmergy mechanism and makes its local movement decision based on a Particle Swarm Optimization (PSO) algorithm. The proposed ALIVS algorithm has been implemented on the embodied robot simulator, Player/Stage, in a searching target. The simulation results demonstrate the efficiency and robustness in a power-efficient manner with the real-world constraints.

  7. Approaching the Affective Factors of Information Seeking: The Viewpoint of the Information Search Process Model

    Science.gov (United States)

    Savolainen, Reijo

    2015-01-01

    Introduction: The article contributes to the conceptual studies of affective factors in information seeking by examining Kuhlthau's information search process model. Method: This random-digit dial telephone survey of 253 people (75% female) living in a rural, medically under-serviced area of Ontario, Canada, follows-up a previous interview study…

  8. Changes in users' mental models of Web search engines after ten ...

    African Journals Online (AJOL)

    Ward's Cluster analyses including the Pseudo T² Statistical analyses were used to determine the mental model clusters for the seventeen salient design features of Web search engines at each time point. The cubic clustering criterion (CCC) and the dendogram were conducted for each sample to help determine the number ...

  9. Chaotic Planning Solutions in the Textbook Model of Labor Market Search and Matching

    NARCIS (Netherlands)

    Bhattacharya, J.; Bunzel, H.

    2003-01-01

    This paper demonstrates that cyclical and chaotic planning solutions are possible in the standard textbook model of search and matching in labor markets. More specifically, it takes a discretetime adaptation of the continuous-time matching economy described in Pissarides (1990, 2001), and computes

  10. Search for the standard model Higgs boson in tau final states

    NARCIS (Netherlands)

    Abazov, V.M.; et al., [Unknown; Ancu, L.S.; de Jong, S.J.; Filthaut, F.; Galea, C.F.; Hegeman, J.G.; Houben, P.; Meijer, M.M.; Svoisky, P.; van den Berg, P.J.; van Leeuwen, W.M.

    2009-01-01

    We present a search for the standard model Higgs boson using hadronically decaying tau leptons, in 1 fb(-1) of data collected with the D0 detector at the Fermilab Tevatron p(p)over-bar collider. We select two final states: tau(+/-) plus missing transverse energy and b jets, and tau(+)tau(-) plus

  11. Mathematical programming models for solving in equal-sized facilities layout problems. A genetic search method

    International Nuclear Information System (INIS)

    Tavakkoli-Moghaddam, R.

    1999-01-01

    This paper present unequal-sized facilities layout solutions generated by a genetic search program. named Layout Design using a Genetic Algorithm) 9. The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computational results on test problems are reported as compared with layout solutions generated by the branch - and bound algorithm a hybrid method merging simulated annealing and local search techniques, and an optimization process of an enveloped block

  12. Financing of the site search by a public corporation (organization model)

    International Nuclear Information System (INIS)

    Selmer, P.

    2005-01-01

    The paper is focussed on the development of a concept concerning the final deposit of radioactive waste in Germany in connection with the search of an appropriate site for the repository. The main features of the so called organization model are described, the financing of the site search under constitutional law and the principles of tax law is discussed in this context. Other topics are the legitimacy of a final disposal organization in the form of a public corporation with compulsory membership including unconstitutional contributions, and aspects of basic rights and constitutional legality

  13. Martian methane plume models for defining Mars rover methane source search strategies

    Science.gov (United States)

    Nicol, Christopher; Ellery, Alex; Lynch, Brian; Cloutis, Ed

    2018-07-01

    The detection of atmospheric methane on Mars implies an active methane source. This introduces the possibility of a biotic source with the implied need to determine whether the methane is indeed biotic in nature or geologically generated. There is a clear need for robotic algorithms which are capable of manoeuvring a rover through a methane plume on Mars to locate its source. We explore aspects of Mars methane plume modelling to reveal complex dynamics characterized by advection and diffusion. A statistical analysis of the plume model has been performed and compared to analyses of terrestrial plume models. Finally, we consider a robotic search strategy to find a methane plume source. We find that gradient-based techniques are ineffective, but that more sophisticated model-based search strategies are unlikely to be available in near-term rover missions.

  14. Transmission network expansion planning based on hybridization model of neural networks and harmony search algorithm

    Directory of Open Access Journals (Sweden)

    Mohammad Taghi Ameli

    2012-01-01

    Full Text Available Transmission Network Expansion Planning (TNEP is a basic part of power network planning that determines where, when and how many new transmission lines should be added to the network. So, the TNEP is an optimization problem in which the expansion purposes are optimized. Artificial Intelligence (AI tools such as Genetic Algorithm (GA, Simulated Annealing (SA, Tabu Search (TS and Artificial Neural Networks (ANNs are methods used for solving the TNEP problem. Today, by using the hybridization models of AI tools, we can solve the TNEP problem for large-scale systems, which shows the effectiveness of utilizing such models. In this paper, a new approach to the hybridization model of Probabilistic Neural Networks (PNNs and Harmony Search Algorithm (HSA was used to solve the TNEP problem. Finally, by considering the uncertain role of the load based on a scenario technique, this proposed model was tested on the Garver’s 6-bus network.

  15. Using fuzzy rule-based knowledge model for optimum plating conditions search

    Science.gov (United States)

    Solovjev, D. S.; Solovjeva, I. A.; Litovka, Yu V.; Arzamastsev, A. A.; Glazkov, V. P.; L’vov, A. A.

    2018-03-01

    The paper discusses existing approaches to plating process modeling in order to decrease the distribution thickness of plating surface cover. However, these approaches do not take into account the experience, knowledge, and intuition of the decision-makers when searching the optimal conditions of electroplating technological process. The original approach to optimal conditions search for applying the electroplating coatings, which uses the rule-based model of knowledge and allows one to reduce the uneven product thickness distribution, is proposed. The block diagrams of a conventional control system of a galvanic process as well as the system based on the production model of knowledge are considered. It is shown that the fuzzy production model of knowledge in the control system makes it possible to obtain galvanic coatings of a given thickness unevenness with a high degree of adequacy to the experimental data. The described experimental results confirm the theoretical conclusions.

  16. Results on Standard Model Higgs Boson searches at high mass at the LHC

    International Nuclear Information System (INIS)

    Gao, Yanyan

    2014-01-01

    We present results from searches for the standard model Higgs boson with a mass greater than 200 GeV in pp collisions at √(s)=7 TeV. The data are collected at the LHC with both ATLAS and CMS detectors, and correspond to integrated luminosity of 5 fb -1 each. Searches are performed in the 2 main decay modes WW and ZZ. No significant excess of events above the standard model background expectations is observed, and upper limits on the Higgs boson production relative to the standard model expectation are derived. A standard model Higgs boson is excluded in the mass range up to 539 GeV or 600 GeV at 95% confidence level by the ATLAS or CMS experiments respectively. (author)

  17. Model unspecific search in CMS. Results at 8 TeV

    Energy Technology Data Exchange (ETDEWEB)

    Albert, Andreas; Duchardt, Deborah; Hebbeker, Thomas; Knutzen, Simon; Lieb, Jonas; Meyer, Arnd; Pook, Tobias; Roemer, Jonas [III. Physikalisches Institut A, RWTH Aachen University (Germany)

    2016-07-01

    In the year 2012, CMS collected a total data set of approximately 20 fb{sup -1} in proton-proton collisions at √(s)=8 TeV. Dedicated searches for physics beyond the standard model are commonly designed with the signatures of a given theoretical model in mind. While this approach allows for an optimised sensitivity to the sought-after signal, it may cause unexpected phenomena to be overlooked. In a complementary approach, the Model Unspecific Search in CMS (MUSiC) analyses CMS data in a general way. Depending on the reconstructed final state objects (e.g. electrons), collision events are sorted into classes. In each of the classes, the distributions of selected kinematic variables are compared to standard model simulation. An automated statistical analysis is performed to quantify the agreement between data and prediction. In this talk, the analysis concept is introduced and selected results of the analysis of the 2012 CMS data set are presented.

  18. MUSiC - A model unspecific search for new physics in CMS

    Energy Technology Data Exchange (ETDEWEB)

    Biallass, Philipp; Hof, Carsten; Hebbeker, Thomas; Meyer, Arnd [III. Physics Institute A, RWTH Aachen (Germany)

    2008-07-01

    With the start-up of the Large Hadron Collider in 2008 particle physics will enter an unknown territory. New physics is predicted to appear in these regimes by various extensions of the Standard Model such as Supersymmetry or Extra-Dimensions, but it is still unknown how exactly nature has realized such models. Therefore also the most promising signature to detect New Physics is unclear at the moment. In this context we will present a generic search strategy which aims to cover a variety of promising final state topologies without biasing itself to some expected signal. The Model Unspecific Search in CMS (MUSiC) algorithm tries to systematically compare recorded data with expectations from the Standard Model. Thus it is sensitive to deviations caused by New Physics, discrepancies caused by an imperfect simulation and differences due to a lack of understanding of the CMS detector. All three points will be equally important during the months of first data taking.

  19. Modeling guidance and recognition in categorical search: bridging human and computer object detection.

    Science.gov (United States)

    Zelinsky, Gregory J; Peng, Yifan; Berg, Alexander C; Samaras, Dimitris

    2013-10-08

    Search is commonly described as a repeating cycle of guidance to target-like objects, followed by the recognition of these objects as targets or distractors. Are these indeed separate processes using different visual features? We addressed this question by comparing observer behavior to that of support vector machine (SVM) models trained on guidance and recognition tasks. Observers searched for a categorically defined teddy bear target in four-object arrays. Target-absent trials consisted of random category distractors rated in their visual similarity to teddy bears. Guidance, quantified as first-fixated objects during search, was strongest for targets, followed by target-similar, medium-similarity, and target-dissimilar distractors. False positive errors to first-fixated distractors also decreased with increasing dissimilarity to the target category. To model guidance, nine teddy bear detectors, using features ranging in biological plausibility, were trained on unblurred bears then tested on blurred versions of the same objects appearing in each search display. Guidance estimates were based on target probabilities obtained from these detectors. To model recognition, nine bear/nonbear classifiers, trained and tested on unblurred objects, were used to classify the object that would be fixated first (based on the detector estimates) as a teddy bear or a distractor. Patterns of categorical guidance and recognition accuracy were modeled almost perfectly by an HMAX model in combination with a color histogram feature. We conclude that guidance and recognition in the context of search are not separate processes mediated by different features, and that what the literature knows as guidance is really recognition performed on blurred objects viewed in the visual periphery.

  20. Beyond the Standard Model Higgs boson searches using the ATLAS Experiment

    CERN Document Server

    Tsukerman, Ilya; The ATLAS collaboration

    2014-01-01

    The discovery of a Higgs boson with a mass of about 125 GeV has prompted the question of whether or not this particle is part of a larger and more complex Higgs sector than that envisioned in the Standard Model. In this talk, the current results from the ATLAS experiment on Beyond the Standard Model (BSM) Higgs boson searches are outlined. The results are interpreted in well-motivated BSM Higgs frameworks.

  1. Developing a Process Model for the Forensic Extraction of Information from Desktop Search Applications

    Directory of Open Access Journals (Sweden)

    Timothy Pavlic

    2008-03-01

    Full Text Available Desktop search applications can contain cached copies of files that were deleted from the file system. Forensic investigators see this as a potential source of evidence, as documents deleted by suspects may still exist in the cache. Whilst there have been attempts at recovering data collected by desktop search applications, there is no methodology governing the process, nor discussion on the most appropriate means to do so. This article seeks to address this issue by developing a process model that can be applied when developing an information extraction application for desktop search applications, discussing preferred methods and the limitations of each. This work represents a more structured approach than other forms of current research.

  2. Benchmark models, planes lines and points for future SUSY searches at the LHC

    International Nuclear Information System (INIS)

    AbdusSalam, S.S.; Allanach, B.C.; Dreiner, H.K.

    2012-03-01

    We define benchmark models for SUSY searches at the LHC, including the CMSSM, NUHM, mGMSB, mAMSB, MM-AMSB and p19MSSM, as well as models with R-parity violation and the NMSSM. Within the parameter spaces of these models, we propose benchmark subspaces, including planes, lines and points along them. The planes may be useful for presenting results of the experimental searches in different SUSY scenarios, while the specific benchmark points may serve for more detailed detector performance tests and comparisons. We also describe algorithms for defining suitable benchmark points along the proposed lines in the parameter spaces, and we define a few benchmark points motivated by recent fits to existing experimental data.

  3. Recent developments in imaging system assessment methodology, FROC analysis and the search model.

    Science.gov (United States)

    Chakraborty, Dev P

    2011-08-21

    A frequent problem in imaging is assessing whether a new imaging system is an improvement over an existing standard. Observer performance methods, in particular the receiver operating characteristic (ROC) paradigm, are widely used in this context. In ROC analysis lesion location information is not used and consequently scoring ambiguities can arise in tasks, such as nodule detection, involving finding localized lesions. This paper reviews progress in the free-response ROC (FROC) paradigm in which the observer marks and rates suspicious regions and the location information is used to determine whether lesions were correctly localized. Reviewed are FROC data analysis, a search-model for simulating FROC data, predictions of the model and a method for estimating the parameters. The search model parameters are physically meaningful quantities that can guide system optimization.

  4. Benchmark models, planes lines and points for future SUSY searches at the LHC

    Energy Technology Data Exchange (ETDEWEB)

    AbdusSalam, S.S. [The Abdus Salam International Centre for Theoretical Physics, Trieste (Italy); Allanach, B.C. [Cambridge Univ. (United Kingdom). Dept. of Applied Mathematics and Theoretical Physics; Dreiner, H.K. [Bonn Univ. (DE). Bethe Center for Theoretical Physics and Physikalisches Inst.] (and others)

    2012-03-15

    We define benchmark models for SUSY searches at the LHC, including the CMSSM, NUHM, mGMSB, mAMSB, MM-AMSB and p19MSSM, as well as models with R-parity violation and the NMSSM. Within the parameter spaces of these models, we propose benchmark subspaces, including planes, lines and points along them. The planes may be useful for presenting results of the experimental searches in different SUSY scenarios, while the specific benchmark points may serve for more detailed detector performance tests and comparisons. We also describe algorithms for defining suitable benchmark points along the proposed lines in the parameter spaces, and we define a few benchmark points motivated by recent fits to existing experimental data.

  5. Recent developments in imaging system assessment methodology, FROC analysis and the search model

    International Nuclear Information System (INIS)

    Chakraborty, Dev P.

    2011-01-01

    A frequent problem in imaging is assessing whether a new imaging system is an improvement over an existing standard. Observer performance methods, in particular the receiver operating characteristic (ROC) paradigm, are widely used in this context. In ROC analysis lesion location information is not used and consequently scoring ambiguities can arise in tasks, such as nodule detection, involving finding localized lesions. This paper reviews progress in the free-response ROC (FROC) paradigm in which the observer marks and rates suspicious regions and the location information is used to determine whether lesions were correctly localized. Reviewed are FROC data analysis, a search model for simulating FROC data, predictions of the model and a method for estimating the parameters. The search model parameters are physically meaningful quantities that can guide system optimization.

  6. Benchmark Models, Planes, Lines and Points for Future SUSY Searches at the LHC

    CERN Document Server

    AbdusSalam, S S; Dreiner, H K; Ellis, J; Ellwanger, U; Gunion, J; Heinemeyer, S; Krämer, M; Mangano, M L; Olive, K A; Rogerson, S; Roszkowski, L; Schlaffer, M; Weiglein, G

    2011-01-01

    We define benchmark models for SUSY searches at the LHC, including the CMSSM, NUHM, mGMSB, mAMSB, MM-AMSB and p19MSSM, as well as models with R-parity violation and the NMSSM. Within the parameter spaces of these models, we propose benchmark subspaces, including planes, lines and points along them. The planes may be useful for presenting results of the experimental searches in different SUSY scenarios, while the specific benchmark points may serve for more detailed detector performance tests and comparisons. We also describe algorithms for defining suitable benchmark points along the proposed lines in the parameter spaces, and we define a few benchmark points motivated by recent fits to existing experimental data.

  7. Similarity-based search of model organism, disease and drug effect phenotypes

    KAUST Repository

    Hoehndorf, Robert

    2015-02-19

    Background: Semantic similarity measures over phenotype ontologies have been demonstrated to provide a powerful approach for the analysis of model organism phenotypes, the discovery of animal models of human disease, novel pathways, gene functions, druggable therapeutic targets, and determination of pathogenicity. Results: We have developed PhenomeNET 2, a system that enables similarity-based searches over a large repository of phenotypes in real-time. It can be used to identify strains of model organisms that are phenotypically similar to human patients, diseases that are phenotypically similar to model organism phenotypes, or drug effect profiles that are similar to the phenotypes observed in a patient or model organism. PhenomeNET 2 is available at http://aber-owl.net/phenomenet. Conclusions: Phenotype-similarity searches can provide a powerful tool for the discovery and investigation of molecular mechanisms underlying an observed phenotypic manifestation. PhenomeNET 2 facilitates user-defined similarity searches and allows researchers to analyze their data within a large repository of human, mouse and rat phenotypes.

  8. Parameter Identification of the 2-Chlorophenol Oxidation Model Using Improved Differential Search Algorithm

    Directory of Open Access Journals (Sweden)

    Guang-zhou Chen

    2015-01-01

    Full Text Available Parameter identification plays a crucial role for simulating and using model. This paper firstly carried out the sensitivity analysis of the 2-chlorophenol oxidation model in supercritical water using the Monte Carlo method. Then, to address the nonlinearity of the model, two improved differential search (DS algorithms were proposed to carry out the parameter identification of the model. One strategy is to adopt the Latin hypercube sampling method to replace the uniform distribution of initial population; the other is to combine DS with simplex method. The results of sensitivity analysis reveal the sensitivity and the degree of difficulty identified for every model parameter. Furthermore, the posteriori probability distribution of parameters and the collaborative relationship between any two parameters can be obtained. To verify the effectiveness of the improved algorithms, the optimization performance of improved DS in kinetic parameter estimation is studied and compared with that of the basic DS algorithm, differential evolution, artificial bee colony optimization, and quantum-behaved particle swarm optimization. And the experimental results demonstrate that the DS with the Latin hypercube sampling method does not present better performance, while the hybrid methods have the advantages of strong global search ability and local search ability and are more effective than the other algorithms.

  9. Heterogeneous Multi-Robot Cooperation

    Science.gov (United States)

    1994-02-01

    express my heartfelt thanks to my thesis advisor . Rod Brooks. who supported and encouraged me throughout my time at MIT. He provided a good mixture of...group than is possible with individual robots alone. 25 26 CHAPTER 3. ALLIANCE: THE COOPERATIVE ROBO ,ARCHITECTURE’ discuss the implications of these...available, robot teams should take advantage of it; however, I do not want the team to experience total breakdown when communication becomes unavailable

  10. Millennial Students’ Online Search Strategies are Associated With Their Mental Models of Search. A Review of: Holman, L. (2011. Millennial students’ mental models of search: Implications for academic librarians and database developers. Journal of Academic Librarianship, 37(1, 19-27. doi:10.1016/j.acalib.2010.10.003

    Directory of Open Access Journals (Sweden)

    Leslie Bussert

    2011-09-01

    Full Text Available Objective – To examine first-year college students’ information seeking behaviours and determine whether their mental models of the search process influence their ability to effectively search for and find scholarly materials.Design – Mixed methods including contextual inquiry, concept mapping, observation, and interviews.Setting – University of Baltimore, a public institution in Maryland, United States of America, offering undergraduate, graduate, and professional degrees.Subjects – A total of 21 first-year undergraduate students, ages 16 to 19 years, undertaking research assignments for which they chose to use online resources.Methods – First-year students were recruited in the fall of 2008 and met with the researcher in a university usability lab for about one hour over a three week period. The researcher observed and videotaped the students as they conducted research in their chosen search engines or article databases. The searches were captured using software, and students were encouraged to think aloud about their research process, search strategies, and anticipated search results. Observation sessions concluded with a 10-question interview incorporating a review of the keywords the student used, the student’s reflection on the success of his or her searches, and possible alternate keywords. The interview also offered prompts to help the researcher learn about students’ conceptualizations of search tools’ utilization of keywords to generate results. The researcher then asked the students to provide a visual diagram of the relationship between their search terms and the items retrieved in the search tool.Data were analyzed by identifying the 21 different search tools used by the students and categorizing all 210 searches and student diagrams for further analysis. A scheme similar to Guinee, Eagleton, and Hall’s (2003 characterized the student searches into four categories: simple single-term searches, topic plus focus

  11. An adaptive bin framework search method for a beta-sheet protein homopolymer model

    Directory of Open Access Journals (Sweden)

    Hoos Holger H

    2007-04-01

    Full Text Available Abstract Background The problem of protein structure prediction consists of predicting the functional or native structure of a protein given its linear sequence of amino acids. This problem has played a prominent role in the fields of biomolecular physics and algorithm design for over 50 years. Additionally, its importance increases continually as a result of an exponential growth over time in the number of known protein sequences in contrast to a linear increase in the number of determined structures. Our work focuses on the problem of searching an exponentially large space of possible conformations as efficiently as possible, with the goal of finding a global optimum with respect to a given energy function. This problem plays an important role in the analysis of systems with complex search landscapes, and particularly in the context of ab initio protein structure prediction. Results In this work, we introduce a novel approach for solving this conformation search problem based on the use of a bin framework for adaptively storing and retrieving promising locally optimal solutions. Our approach provides a rich and general framework within which a broad range of adaptive or reactive search strategies can be realized. Here, we introduce adaptive mechanisms for choosing which conformations should be stored, based on the set of conformations already stored in memory, and for biasing choices when retrieving conformations from memory in order to overcome search stagnation. Conclusion We show that our bin framework combined with a widely used optimization method, Monte Carlo search, achieves significantly better performance than state-of-the-art generalized ensemble methods for a well-known protein-like homopolymer model on the face-centered cubic lattice.

  12. Supersymmetry searches in GUT models with non-universal scalar masses

    Energy Technology Data Exchange (ETDEWEB)

    Cannoni, M.; Gómez, M.E. [Departamento de Física Aplicada, Facultad de Ciencias Experimentales, Universidad de Huelva, 21071 Huelva (Spain); Ellis, J. [Theoretical Particle Physics and Cosmology Group, Physics Department, King' s College London, London WC2R 2LS (United Kingdom); Lola, S. [Department of Physics, University of Patras, 26500 Patras (Greece); De Austri, R. Ruiz, E-mail: mirco.cannoni@dfa.uhu.es, E-mail: John.Ellis@cern.ch, E-mail: mario.gomez@dfa.uhu.es, E-mail: magda@physics.upatras.gr, E-mail: rruiz@ific.uv.es [Instituto de Física Corpuscular, IFIC-UV/CSIC, Valencia (Spain)

    2016-03-01

    We study SO(10), SU(5) and flipped SU(5) GUT models with non-universal soft supersymmetry-breaking scalar masses, exploring how they are constrained by LHC supersymmetry searches and cold dark matter experiments, and how they can be probed and distinguished in future experiments. We find characteristic differences between the various GUT scenarios, particularly in the coannihilation region, which is very sensitive to changes of parameters. For example, the flipped SU(5) GUT predicts the possibility of ∼t{sub 1}−χ coannihilation, which is absent in the regions of the SO(10) and SU(5) GUT parameter spaces that we study. We use the relic density predictions in different models to determine upper bounds for the neutralino masses, and we find large differences between different GUT models in the sparticle spectra for the same LSP mass, leading to direct connections of distinctive possible experimental measurements with the structure of the GUT group. We find that future LHC searches for generic missing E{sub T}, charginos and stops will be able to constrain the different GUT models in complementary ways, as will the Xenon 1 ton and Darwin dark matter scattering experiments and future FERMI or CTA γ-ray searches.

  13. ATLAS experience with the modeling of SM processes in the context of Higgs studies / BSM searches

    CERN Document Server

    ATLAS Collaboration; The ATLAS collaboration

    2015-01-01

    much is known from the ATLAS/CMS SM articles about the performance of qcd tools (e.g. from the studies of W/Z+jets cross sections, top quark distributions, etc). A bit less is known about the efforts that are needed to ensure a proper description of backgrounds in the BSM searches or in Higgs studies. In the searches, for example, control samples are used, to avoid the need of inaccurate MC models, or to reweight improper modeling. Sometimes we don't see in teh final papers what is happening behind the scenes, and it's hard to learn about possible modeling issues. Are there clear deficiencies that, if fixed, would make your work simpler and more effective? These talks should focus on these specific aspects of the H and BSM studies. In other words, they should neither report H or BSM results, nor report on generic SM measurements, but give some perspective on the current status and on the possible needs for future improvements of SM modeling for H precision studies and BSM searches.

  14. Specification for a surface-search radar-detection-range model

    Science.gov (United States)

    Hattan, Claude P.

    1990-09-01

    A model that predicts surface-search radar detection range versus a variety of combatants has been developed at the Naval Ocean Systems Center. This model uses a simplified ship radar cross section (RCS) model and the U.S. Navy Oceanographic and Atmospheric Mission Library Standard Electromagnetic Propagation Model. It provides the user with a method of assessing the effects of the environment of the performance of a surface-search radar system. The software implementation of the model is written in ANSI FORTRAN 77, with MIL-STD-1753 extensions. The program provides the user with a table of expected detection ranges when the model is supplied with the proper environmental radar system inputs. The target model includes the variation in RCS as a function of aspect angle and the distribution of reflected radar energy as a function of height above the waterline. The modeled propagation effects include refraction caused by a multisegmented refractivity profile, sea-surface roughness caused by local winds, evaporation ducting, and surface-based ducts caused by atmospheric layering.

  15. Searching for quantum solitons in a (3+1)-dimensional chiral Yukawa model

    International Nuclear Information System (INIS)

    Farhi, E.; Graham, N.; Jaffe, R.L.; Weigel, H.

    2002-01-01

    We search for static solitons stabilized by heavy fermions in a (3+1)-dimensional Yukawa model. We compute the renormalized energy functional, including the exact one-loop quantum corrections, and perform a variational search for configurations that minimize the energy for a fixed fermion number. We compute the quantum corrections using a phase shift parameterization, in which we renormalize by identifying orders of the Born series with corresponding Feynman diagrams. For higher-order terms in the Born series, we develop a simplified calculational method. When applicable, we use the derivative expansion to check our results. We observe marginally bound configurations at large Yukawa coupling, and discuss their interpretation as soliton solutions subject to general limitations of the model

  16. Non-SUSY Beyond Standard Model Searches: Recent Results from ATLAS and CMS

    International Nuclear Information System (INIS)

    Malek, Fairouz

    2015-01-01

    The Standard Model of particle physics is a sensational success, especially since the discovery of the 125 GeV Higgs boson. However, there are still numerous unanswered questions. Why is the Higgs so light? Do the interactions couplings unify and how can gravity be included? Why three fermion generations? What is dark matter? Theories Beyond the Standard Model (BSM), such as Grand Unified Theories, Extra Dimensions or Technicolour are trying to answer these questions. In these proceedings, we will focus on the most recent results obtained by the ATLAS and CMS experiments at the LHC for BSM searches, excluding Higgs and supersymmetry searches. New results on Dark Matter, heavy narrow-width resonances, new heavy quarks and third generation leptoquarks are presented. A summary of the prospects at 14 TeV and at the High Luminosity LHC period is given. (paper)

  17. Non-SUSY Beyond Standard Model Searches: Recent Results from ATLAS and CMS

    CERN Document Server

    Malek, Fairouz; The ATLAS collaboration

    2015-01-01

    The Standard Model of particle physics is a sensational success, especially since the discovery of the 125 GeV Higgs boson. However, there are still numerous unanswered questions. Why is the Higgs so light? Do the interactions couplings unify and how can gravity be included? Why three fermion generations? What is dark matter? Theories Beyond the Standard Model (BSM), such as Grand Unified Theories, Extra Dimensions or Technicolour are trying to answer these questions. In this proceedings, we will focus on the most recent results obtained by the ATLAS and CMS experiments at the LHC for BSM searches, excluding Higgs and supersymmetry searches. New results on Dark matter, heavy narrow bosons, new heavy quarks and third generation leptoquarks are presented. A summary of the prospects at 14 TeV and at the High Luminosity LHC period is given.

  18. Constraining supersymmetric models using Higgs physics, precision observables and direct searches

    International Nuclear Information System (INIS)

    Zeune, Lisa

    2014-08-01

    We present various complementary possibilities to exploit experimental measurements in order to test and constrain supersymmetric (SUSY) models. Direct searches for SUSY particles have not resulted in any signal so far, and limits on the SUSY parameter space have been set. Measurements of the properties of the observed Higgs boson at ∝126 GeV as well as of the W boson mass (M W ) can provide valuable indirect constraints, supplementing the ones from direct searches. This thesis is divided into three major parts: In the first part we present the currently most precise prediction for M W in the Minimal Supersymmetric Standard Model (MSSM) with complex parameters and in the Next-to-Minimal Supersymmetric Standard Model (NMSSM). The evaluation includes the full one-loop result and all relevant available higher order corrections of Standard Model (SM) and SUSY type. We perform a detailed scan over the MSSM parameter space, taking into account the latest experimental results, including the observation of a Higgs signal. We find that the current measurements for M W and the top quark mass (m t ) slightly favour a non-zero SUSY contribution. The impact of different SUSY sectors on the prediction of M W as well as the size of the higher-order SUSY corrections are analysed both in the MSSM and the NMSSM. We investigate the genuine NMSSM contribution from the extended Higgs and neutralino sectors and highlight differences between the M W predictions in the two SUSY models. In the second part of the thesis we discuss possible interpretations of the observed Higgs signal in SUSY models. The properties of the observed Higgs boson are compatible with the SM so far, but many other interpretations are also possible. Performing scans over the relevant parts of the MSSM and the NMSSM parameter spaces and applying relevant constraints from Higgs searches, flavour physics and electroweak measurements, we find that a Higgs boson at ∝126 GeV, which decays into two photons, can in

  19. Observation of an Excess in the Search for the Standard Model Higgs Boson at ALEPH

    CERN Document Server

    Barate, R.; Ghez, Philippe; Goy, C.; Jezequel, S.; Lees, J.P.; Martin, F.; Merle, E.; Minard, M.N.; Pietrzyk, B.; Bravo, S.; Casado, M.P.; Chmeissani, M.; Crespo, J.M.; Fernandez, E.; Fernandez-Bosman, M.; Garrido, Ll.; Grauges, E.; Lopez, J.; Martinez, M.; Merino, G.; Miquel, R.; Mir, L.M.; Pacheco, A.; Paneque, D.; Ruiz, H.; Colaleo, A.; Creanza, D.; De Filippis, N.; de Palma, M.; Iaselli, G.; Maggi, G.; Maggi, M.; Nuzzo, S.; Ranieri, A.; Raso, G.; Ruggieri, F.; Selvaggi, G.; Silvestris, L.; Tempesta, P.; Tricomi, A.; Zito, G.; Huang, X.; Lin, J.; Ouyang, Q.; Wang, T.; Xie, Y.; Xu, R.; Xue, S.; Zhang, J.; Zhang, L.; Zhao, W.; Abbaneo, D.; Azzurri, P.; Barklow, T.; Boix, G.; Buchmuller, O.; Cattaneo, M.; Cerutti, F.; Clerbaux, B.; Dissertori, G.; Drevermann, H.; Forty, R.W.; Frank, M.; Gianotti, F.; Greening, T.C.; Hansen, J.B.; Harvey, John; Hutchcroft, D.E.; Janot, P.; Jost, B.; Kado, M.; Lemaitre, V.; Maley, P.; Mato, P.; Minten, A.; Moutoussi, A.; Ranjard, F.; Rolandi, Gigi; Schlatter, D.; Schmitt, M.; Schneider, O.; Spagnolo, P.; Tejessy, W.; Teubert, F.; Tournefier, E.; Valassi, A.; Ward, J.J.; Wright, A.E.; Ajaltouni, Z.; Badaud, F.; Dessagne, S.; Falvard, A.; Fayolle, D.; Gay, P.; Henrard, P.; Jousset, J.; Michel, B.; Monteil, S.; Montret, J.C.; Pallin, D.; Pascolo, J.M.; Perret, P.; Podlyski, F.; Hansen, J.D.; Hansen, J.R.; Hansen, P.H.; Nilsson, B.S.; Waananen, A.; Daskalakis, G.; Kyriakis, A.; Markou, C.; Simopoulou, E.; Vayaki, A.; Blondel, A.; Brient, J.C.; Machefert, F.; Rouge, A.; Swynghedauw, M.; Tanaka, R.; Videau, H.; Focardi, E.; Parrini, G.; Zachariadou, K.; Antonelli, A.; Antonelli, M.; Bencivenni, G.; Bologna, G.; Bossi, F.; Campana, P.; Capon, G.; Chiarella, V.; Laurelli, P.; Mannocchi, G.; Murtas, F.; Murtas, G.P.; Passalacqua, L.; Pepe-Altarelli, M.; Chalmers, M.; Halley, A.W.; Kennedy, J.; Lynch, J.G.; Negus, P.; O'Shea, V.; Raeven, B.; Smith, D.; Teixeira-Dias, P.; Thompson, A.S.; Cavanaugh, R.; Dhamotharan, S.; Geweniger, C.; Hanke, P.; Hepp, V.; Kluge, E.E.; Leibenguth, G.; Putzer, A.; Tittel, K.; Werner, S.; Wunsch, M.; Beuselinck, R.; Binnie, D.M.; Cameron, W.; Davies, G.; Dornan, P.J.; Girone, M.; Marinelli, N.; Nowell, J.; Przysiezniak, H.; Sedgbeer, J.K.; Thompson, J.C.; Thomson, Evelyn J.; White, R.; Ghete, V.M.; Girtler, P.; Kneringer, E.; Kuhn, D.; Rudolph, G.; Bouhova-Thacker, E.; Bowdery, C.K.; Clarke, D.P.; Ellis, G.; Finch, A.J.; Foster, F.; Hughes, G.; Jones, R.W.L.; Pearson, M.R.; Robertson, N.A.; Smizanska, M.; Giehl, I.; Holldorfer, F.; Jakobs, K.; Kleinknecht, K.; Krocker, M.; Muller, A.S.; Nurnberger, H.A.; Quast, G.; Renk, B.; Rohne, E.; Sander, H.G.; Schmeling, S.; Wachsmuth, H.; Zeitnitz, C.; Ziegler, T.; Bonissent, A.; Carr, J.; Coyle, P.; Curtil, C.; Ealet, A.; Fouchez, D.; Leroy, O.; Kachelhoffer, T.; Payre, P.; Rousseau, D.; Tilquin, A.; Aleppo, M.; Gilardoni, Simone S.; Ragusa, F.; David, A.; Dietl, H.; Ganis, G.; Heister, A.; Huttmann, K.; Lutjens, G.; Mannert, C.; Manner, W.; Moser, H.G.; Schael, S.; Settles, R.; Stenzel, H.; Wolf, G.; Boucrot, J.; Callot, O.; Davier, M.; Duflot, L.; Grivaz, J.F.; Heusse, P.; Jacholkowska, A.; Serin, L.; Veillet, J.J.; Videau, I.; de Vivie de Regie, J.B.; Yuan, C.; Zerwas, D.; Bagliesi, Giuseppe; Boccali, T.; Calderini, G.; Ciulli, V.; Foa, L.; Giammanco, A.; Giassi, A.; Ligabue, F.; Messineo, A.; Palla, F.; Rizzo, G.; Sanguinetti, G.; Sciaba, A.; Sguazzoni, G.; Tenchini, R.; Venturi, A.; Verdini, P.G.; Blair, G.A.; Coles, J.; Cowan, G.; Green, M.G.; Jones, L.T.; Medcalf, T.; Strong, J.A.; Clifft, R.W.; Edgecock, T.R.; Norton, P.R.; Tomalin, I.R.; Bloch-Devaux, Brigitte; Boumediene, D.; Colas, P.; Fabbro, B.; Lancon, E.; Lemaire, M.C.; Locci, E.; Perez, P.; Rander, J.; Renardy, J.F.; Rosowsky, A.; Seager, P.; Trabelsi, A.; Tuchming, B.; Vallage, B.; Konstantinidis, N.; Loomis, C.; Litke, A.M.; Taylor, G.; Booth, C.N.; Cartwright, S.; Combley, F.; Hodgson, P.N.; Lehto, M.; Thompson, L.F.; Affholderbach, K.; Boehrer, Armin; Brandt, S.; Grupen, C.; Hess, J.; Misiejuk, A.; Prange, G.; Sieler, U.; Borean, C.; Giannini, G.; Gobbo, B.; He, H.; Putz, J.; Rothberg, J.; Wasserbaech, S.; Armstrong, S.R.; Cranmer, K.; Elmer, P.; Ferguson, D.P.S.; Gao, Y.; Gonzalez, S.; Hayes, O.J.; Hu, H.; Jin, S.; Kile, J.; McNamara, P.A., III; Nielsen, J.; Orejudos, W.; Pan, Y.B.; Saadi, Y.; Scott, I.J.; Shao, N.; von Wimmersperg-Toeller, J.H.; Walsh, J.; Wiedenmann, W.; Wu, J.; Wu, Sau Lan; Wu, X.; Zobernig, G.

    2000-01-01

    A search has been performed for the Standard Model Higgs boson in the data sample collected with the ALEPH detector at LEP, at centre-of-mass energies up to 209 GeV. An excess of 3 $\\sigma$ beyond the background expectation is found, consistent with the production of the Higgs boson with a mass near 114 GeV=c^2 . Much of this excess is seen in the four-jet analyses, where three high purity events are selected.

  20. Modeling visual search using three-parameter probability functions in a hierarchical Bayesian framework.

    Science.gov (United States)

    Lin, Yi-Shin; Heinke, Dietmar; Humphreys, Glyn W

    2015-04-01

    In this study, we applied Bayesian-based distributional analyses to examine the shapes of response time (RT) distributions in three visual search paradigms, which varied in task difficulty. In further analyses we investigated two common observations in visual search-the effects of display size and of variations in search efficiency across different task conditions-following a design that had been used in previous studies (Palmer, Horowitz, Torralba, & Wolfe, Journal of Experimental Psychology: Human Perception and Performance, 37, 58-71, 2011; Wolfe, Palmer, & Horowitz, Vision Research, 50, 1304-1311, 2010) in which parameters of the response distributions were measured. Our study showed that the distributional parameters in an experimental condition can be reliably estimated by moderate sample sizes when Monte Carlo simulation techniques are applied. More importantly, by analyzing trial RTs, we were able to extract paradigm-dependent shape changes in the RT distributions that could be accounted for by using the EZ2 diffusion model. The study showed that Bayesian-based RT distribution analyses can provide an important means to investigate the underlying cognitive processes in search, including stimulus grouping and the bottom-up guidance of attention.

  1. Parameter Estimation for Traffic Noise Models Using a Harmony Search Algorithm

    Directory of Open Access Journals (Sweden)

    Deok-Soon An

    2013-01-01

    Full Text Available A technique has been developed for predicting road traffic noise for environmental assessment, taking into account traffic volume as well as road surface conditions. The ASJ model (ASJ Prediction Model for Road Traffic Noise, 1999, which is based on the sound power level of the noise emitted by the interaction between the road surface and tires, employs regression models for two road surface types: dense-graded asphalt (DGA and permeable asphalt (PA. However, these models are not applicable to other types of road surfaces. Accordingly, this paper introduces a parameter estimation procedure for ASJ-based noise prediction models, utilizing a harmony search (HS algorithm. Traffic noise measurement data for four different vehicle types were used in the algorithm to determine the regression parameters for several road surface types. The parameters of the traffic noise prediction models were evaluated using another measurement set, and good agreement was observed between the predicted and measured sound power levels.

  2. Transport energy modeling with meta-heuristic harmony search algorithm, an application to Turkey

    Energy Technology Data Exchange (ETDEWEB)

    Ceylan, Huseyin; Ceylan, Halim; Haldenbilen, Soner; Baskan, Ozgur [Department of Civil Engineering, Engineering Faculty, Pamukkale University, Muh. Fak. Denizli 20017 (Turkey)

    2008-07-15

    This study proposes a new method for estimating transport energy demand using a harmony search (HS) approach. HArmony Search Transport Energy Demand Estimation (HASTEDE) models are developed taking population, gross domestic product and vehicle kilometers as an input. The HASTEDE models are in forms of linear, exponential and quadratic mathematical expressions and they are applied to Turkish Transportation sector energy consumption. Optimum or near-optimum values of the HS parameters are obtained with sensitivity analysis (SA). Performance of all models is compared with the Ministry of Energy and Natural Resources (MENR) projections. Results showed that HS algorithm may be used for energy modeling, but SA is required to obtain best values of the HS parameters. The quadratic form of HASTEDE will overestimate transport sector energy consumption by about 26% and linear and exponential forms underestimate by about 21% when they are compared with the MENR projections. This may happen due to the modeling procedure and selected parameters for models, but determining the upper and lower values of transportation sector energy consumption will provide a framework and flexibility for setting up energy policies. (author)

  3. Forecasting Energy CO2 Emissions Using a Quantum Harmony Search Algorithm-Based DMSFE Combination Model

    Directory of Open Access Journals (Sweden)

    Xingsheng Gu

    2013-03-01

    Full Text Available he accurate forecasting of carbon dioxide (CO2 emissions from fossil fuel energy consumption is a key requirement for making energy policy and environmental strategy. In this paper, a novel quantum harmony search (QHS algorithm-based discounted mean square forecast error (DMSFE combination model is proposed. In the DMSFE combination forecasting model, almost all investigations assign the discounting factor (β arbitrarily since β varies between 0 and 1 and adopt one value for all individual models and forecasting periods. The original method doesn’t consider the influences of the individual model and the forecasting period. This work contributes by changing β from one value to a matrix taking the different model and the forecasting period into consideration and presenting a way of searching for the optimal β values by using the QHS algorithm through optimizing the mean absolute percent error (MAPE objective function. The QHS algorithm-based optimization DMSFE combination forecasting model is established and tested by forecasting CO2 emission of the World top‒5 CO2 emitters. The evaluation indexes such as MAPE, root mean squared error (RMSE and mean absolute error (MAE are employed to test the performance of the presented approach. The empirical analyses confirm the validity of the presented method and the forecasting accuracy can be increased in a certain degree.

  4. Model Unspecific Search for New Physics with High pT Photons in CMS

    CERN Document Server

    Schmitz, Stefan Antonius

    2009-01-01

    In 2009 the LHC collider at the European center of particle physics CERN will start operations, colliding protons with a center of mass energy of up to 14 TeV. Designed as a large multi purpose detector CMS 3 will then start taking collision data. CMS will perform precision measurements within the Standard Model of particle physics and expand the search for new physical phenomena into regions that have not yet been probed by previous experiments. Many theories about what physics beyond the Standard Model at the TeV scale might look like have been proposed. Together these models leave room for a broad spectrum of possible experimental signatures that one might look for in the data. Various analyses focus on processing the available information with the aim of finding evidence for a specific model of choice. MUSiC as a Model Unspecific Search in CMS provides a complementary approach by scanning the data for noteworthy deviations from the Standard Model expectation while making only basic assumptions about the n...

  5. The LAILAPS search engine: a feature model for relevance ranking in life science databases.

    Science.gov (United States)

    Lange, Matthias; Spies, Karl; Colmsee, Christian; Flemming, Steffen; Klapperstück, Matthias; Scholz, Uwe

    2010-03-25

    Efficient and effective information retrieval in life sciences is one of the most pressing challenge in bioinformatics. The incredible growth of life science databases to a vast network of interconnected information systems is to the same extent a big challenge and a great chance for life science research. The knowledge found in the Web, in particular in life-science databases, are a valuable major resource. In order to bring it to the scientist desktop, it is essential to have well performing search engines. Thereby, not the response time nor the number of results is important. The most crucial factor for millions of query results is the relevance ranking. In this paper, we present a feature model for relevance ranking in life science databases and its implementation in the LAILAPS search engine. Motivated by the observation of user behavior during their inspection of search engine result, we condensed a set of 9 relevance discriminating features. These features are intuitively used by scientists, who briefly screen database entries for potential relevance. The features are both sufficient to estimate the potential relevance, and efficiently quantifiable. The derivation of a relevance prediction function that computes the relevance from this features constitutes a regression problem. To solve this problem, we used artificial neural networks that have been trained with a reference set of relevant database entries for 19 protein queries. Supporting a flexible text index and a simple data import format, this concepts are implemented in the LAILAPS search engine. It can easily be used both as search engine for comprehensive integrated life science databases and for small in-house project databases. LAILAPS is publicly available for SWISSPROT data at http://lailaps.ipk-gatersleben.de.

  6. Search for Standard Model Higgs boson in the two-photon final state in ATLAS

    Directory of Open Access Journals (Sweden)

    Davignon Olivier

    2012-06-01

    Full Text Available We report on the search for the Standard Model Higgs boson decaying into two photons based on proton-proton collision data with a center-of-mass energy of 7 TeV recorded by the ATLAS experiment at the LHC. The dataset has an integrated luminosity of about 1:08 fb−1. The expected cross section exclusion at 95% confidence level varies between 2:0 and 5:8 times the Standard Model cross section over the diphoton mass range 110 – 150 GeV. The maximum deviations from the background-only expectation are consistent with statistical fluctuations.

  7. Search for the Standard Model Higgs Boson with the OPAL Detector at LEP

    CERN Document Server

    Abbiendi, G.; Akesson, P.F.; Alexander, G.; Allison, John; Amaral, P.; Anagnostou, G.; Anderson, K.J.; Arcelli, S.; Asai, S.; Axen, D.; Azuelos, G.; Bailey, I.; Barberio, E.; Barlow, R.J.; Batley, R.J.; Bechtle, P.; Behnke, T.; Bell, Kenneth Watson; Bell, P.J.; Bella, G.; Bellerive, A.; Benelli, G.; Bethke, S.; Biebel, O.; Bloodworth, I.J.; Boeriu, O.; Bock, P.; Bonacorsi, D.; Boutemeur, M.; Braibant, S.; Brigliadori, L.; Brown, Robert M.; Buesser, K.; Burckhart, H.J.; Campana, S.; Carnegie, R.K.; Caron, B.; Carter, A.A.; Carter, J.R.; Chang, C.Y.; Charlton, David G.; Csilling, A.; Cuffiani, M.; Dado, S.; Dallavalle, G.Marco; Dallison, S.; De Roeck, A.; De Wolf, E.A.; Desch, K.; Dienes, B.; Donkers, M.; Dubbert, J.; Duchovni, E.; Duckeck, G.; Duerdoth, I.P.; Elfgren, E.; Etzion, E.; Fabbri, F.; Feld, L.; Ferrari, P.; Fiedler, F.; Fleck, I.; Ford, M.; Frey, A.; Furtjes, A.; Gagnon, P.; Gary, John William; Gaycken, G.; Geich-Gimbel, C.; Giacomelli, G.; Giacomelli, P.; Giunta, Marina; Goldberg, J.; Gross, E.; Grunhaus, J.; Gruwe, M.; Gunther, P.O.; Gupta, A.; Hajdu, C.; Hamann, M.; Hanson, G.G.; Harder, K.; Harel, A.; Harin-Dirac, M.; Hauschild, M.; Hauschildt, J.; Hawkes, C.M.; Hawkings, R.; Hemingway, R.J.; Hensel, C.; Herten, G.; Heuer, R.D.; Hill, J.C.; Hoffman, Kara Dion; Homer, R.J.; Horvath, D.; Howard, R.; Huntemeyer, P.; Igo-Kemenes, P.; Ishii, K.; Jeremie, H.; Jovanovic, P.; Junk, T.R.; Kanaya, N.; Kanzaki, J.; Karapetian, G.; Karlen, D.; Kartvelishvili, V.; Kawagoe, K.; Kawamoto, T.; Keeler, R.K.; Kellogg, R.G.; Kennedy, B.W.; Kim, D.H.; Klein, K.; Klier, A.; Kluth, S.; Kobayashi, T.; Kobel, M.; Komamiya, S.; Kormos, Laura L.; Kowalewski, Robert V.; Kramer, T.; Kress, T.; Krieger, P.; von Krogh, J.; Krop, D.; Kruger, K.; Kupper, M.; Lafferty, G.D.; Landsman, H.; Lanske, D.; Layter, J.G.; Leins, A.; Lellouch, D.; Letts, J.; Levinson, L.; Lillich, J.; Lloyd, S.L.; Loebinger, F.K.; Lu, J.; Ludwig, J.; Macpherson, A.; Mader, W.; Marcellini, S.; Marchant, T.E.; Martin, A.J.; Martin, J.P.; Masetti, G.; Mashimo, T.; Mattig, Peter; McDonald, W.J.; McKenna, J.; McMahon, T.J.; McPherson, R.A.; Meijers, F.; Mendez-Lorenzo, P.; Menges, W.; Merritt, F.S.; Mes, H.; Michelini, A.; Mihara, S.; Mikenberg, G.; Miller, D.J.; Moed, S.; Mohr, W.; Mori, T.; Mutter, A.; Nagai, K.; Nakamura, I.; Neal, H.A.; Nisius, R.; O'Neale, S.W.; Oh, A.; Okpara, A.; Oreglia, M.J.; Orito, S.; Pahl, C.; Pasztor, G.; Pater, J.R.; Patrick, G.N.; Pilcher, J.E.; Pinfold, J.; Plane, David E.; Poli, B.; Polok, J.; Pooth, O.; Przybycien, M.; Quadt, A.; Rabbertz, K.; Rembser, C.; Renkel, P.; Rick, H.; Roney, J.M.; Rosati, S.; Rozen, Y.; Runge, K.; Sachs, K.; Saeki, T.; Sahr, O.; Sarkisyan, E.K.G.; Schaile, A.D.; Schaile, O.; Scharff-Hansen, P.; Schieck, J.; Schoerner-Sadenius, Thomas; Schroder, Matthias; Schumacher, M.; Schwick, C.; Scott, W.G.; Seuster, R.; Shears, T.G.; Shen, B.C.; Shepherd-Themistocleous, C.H.; Sherwood, P.; Siroli, G.; Skuja, A.; Smith, A.M.; Sobie, R.; Soldner-Rembold, S.; Spagnolo, S.; Spano, F.; Stahl, A.; Stephens, K.; Strom, David M.; Strohmer, R.; Tarem, S.; Tasevsky, M.; Taylor, R.J.; Teuscher, R.; Thomson, M.A.; Torrence, E.; Toya, D.; Tran, P.; Trefzger, T.; Tricoli, A.; Trigger, I.; Trocsanyi, Z.; Tsur, E.; Turner-Watson, M.F.; Ueda, I.; Ujvari, B.; Vachon, B.; Vollmer, C.F.; Vannerem, P.; Verzocchi, M.; Voss, H.; Vossebeld, J.; Waller, D.; Ward, C.P.; Ward, D.R.; Watkins, P.M.; Watson, A.T.; Watson, N.K.; Wells, P.S.; Wengler, T.; Wermes, N.; Wetterling, D.; Wilson, G.W.; Wilson, J.A.; Wolf, G.; Wyatt, T.R.; Yamashita, S.; Zer-Zion, D.; Zivkovic, Lidija

    2003-01-01

    This paper summarises the search for the Standard Model Higgs boson in e+e- collisions at centre-of-mass energies up to 209 GeV performed by the OPAL Collaboration at LEP. The consistency of the data with the background hypothesis and various Higgs boson mass hypotheses is examined. No indication of a signal is found in the data and a lower bound of 112.7GeV/C^2 is obtained on the mass of the Standard Model Higgs boson at the 95% CL.

  8. MUSiC. A model unspecific search in CMS based on 2010 LHC data

    Energy Technology Data Exchange (ETDEWEB)

    Pieta, Holger

    2012-06-20

    A Model Unspecific Search in CMS (MUSiC) is presented in this work, along with its results on the data taken in 2010 by the Compact Muon Solenoid (CMS) at the Large Hadron Collider (LHC). This analysis shows a sensitivity to various models for new physics and provides a broad view at the data, due to its minimal theoretical bias. Events are classified with respect to their reconstructed objects: Muons, electrons, photons, jets and missing transverse energy. Up to three kinematic variables in each of these classes are systematically scanned for continuous bin regions deviating significantly from the predictions by the Standard Model of particle physics. No deviations beyond expected fluctuations are observed, when taking systematic uncertainties into account. The sensitivity of the analysis to certain models beyond the Standard Model is demonstrated.

  9. Accurate corresponding point search using sphere-attribute-image for statistical bone model generation

    International Nuclear Information System (INIS)

    Saito, Toki; Nakajima, Yoshikazu; Sugita, Naohiko; Mitsuishi, Mamoru; Hashizume, Hiroyuki; Kuramoto, Kouichi; Nakashima, Yosio

    2011-01-01

    Statistical deformable model based two-dimensional/three-dimensional (2-D/3-D) registration is a promising method for estimating the position and shape of patient bone in the surgical space. Since its accuracy depends on the statistical model capacity, we propose a method for accurately generating a statistical bone model from a CT volume. Our method employs the Sphere-Attribute-Image (SAI) and has improved the accuracy of corresponding point search in statistical model generation. At first, target bone surfaces are extracted as SAIs from the CT volume. Then the textures of SAIs are classified to some regions using Maximally-stable-extremal-regions methods. Next, corresponding regions are determined using Normalized cross-correlation (NCC). Finally, corresponding points in each corresponding region are determined using NCC. The application of our method to femur bone models was performed, and worked well in the experiments. (author)

  10. A search for the standard model Higgs boson using the DELPHI detector at LEP2

    International Nuclear Information System (INIS)

    Sheridan, A.E.

    1998-11-01

    A search for the Standard Model Higgs boson is performed using the 51.59 pb -1 of data collected by the DELPHI detector at a centre-of-mass energy of 182.7 GeV. A search is made for the production of Higgs bosons with an on-shell Z boson, with the Higgs boson decaying to b-quarks and the Z to either a dielectron or dimuon pair. No significant excess is seen in the data and hence a 95% CL upper cross- section limit is set as a function of the Higgs boson mass. The results from these leptonic channels are combined with those from other Higgs and Z decay channel analyses using DELPHI data and a 95% CL lower mass limit for the Higgs boson of 87.6 GeV/c 2 is set. This limit significantly improves the limit obtained with previous data. (author)

  11. Model unspecific search in CMS. Treatment of insufficient Monte Carlo statistics

    Energy Technology Data Exchange (ETDEWEB)

    Lieb, Jonas; Albert, Andreas; Duchardt, Deborah; Hebbeker, Thomas; Knutzen, Simon; Meyer, Arnd; Pook, Tobias; Roemer, Jonas [III. Physikalisches Institut A, RWTH Aachen University (Germany)

    2016-07-01

    In 2015, the CMS detector recorded proton-proton collisions at an unprecedented center of mass energy of √(s)=13 TeV. The Model Unspecific Search in CMS (MUSiC) offers an analysis approach of these data which is complementary to dedicated analyses: By taking all produced final states into consideration, MUSiC is sensitive to indicators of new physics appearing in final states that are usually not investigated. In a two step process, MUSiC first classifies events according to their physics content and then searches kinematic distributions for the most significant deviations between Monte Carlo simulations and observed data. Such a general approach introduces its own set of challenges. One of them is the treatment of situations with insufficient Monte Carlo statistics. Complementing introductory presentations on the MUSiC event selection and classification, this talk will present a method of dealing with the issue of low Monte Carlo statistics.

  12. Review of searches for Higgs bosons and beyond the standard model physics at the Tevatron

    International Nuclear Information System (INIS)

    Duperrin, Arnaud

    2009-01-01

    The energy frontier is currently at the Fermilab Tevatron accelerator, which collides protons and antiprotons at a center-of-mass energy of 1.96 TeV. The luminosity delivered to the CDF and DOe experiments has now surpassed the 4 fb -1 . This paper reviews the most recent direct searches for Higgs bosons and beyond-the-standard-model (BSM) physics at the tevatron. The results reported correspond to an integrated luminosity of up to 2.5 fb -1 of Run II data collected by the two Collaborations. Searches covered include the standard model (SM) Higgs boson (including sensitivity projections), the neutral Higgs bosons in the minimal supersymmetric extension of the standard model (MSSM), charged Higgs bosons and extended Higgs models, supersymmetric decays that conserve or violate R-parity, gauge-mediated supersymmetric breaking models, long-lived particles, leptoquarks, compositeness, extra gauge bosons, extra dimensions, and finally signature-based searches. Given the excellent performance of the collider and the continued productivity of the experiments, the Tevatron physics potential looks promising for discovery with the coming larger data sets. In particular, evidence for the SM Higgs boson could be obtained if its mass is light or near 160 GeV. The observed (expected) upper limits are currently a factor of 3.7 (3.3) higher than the expected SM Higgs boson cross section at m H =115 GeV and 1.1(1.6) at m H =160 GeV at 95% C.L. (orig.)

  13. Modeling the effect of selection history on pop-out visual search.

    Directory of Open Access Journals (Sweden)

    Yuan-Chi Tseng

    Full Text Available While attentional effects in visual selection tasks have traditionally been assigned "top-down" or "bottom-up" origins, more recently it has been proposed that there are three major factors affecting visual selection: (1 physical salience, (2 current goals and (3 selection history. Here, we look further into selection history by investigating Priming of Pop-out (POP and the Distractor Preview Effect (DPE, two inter-trial effects that demonstrate the influence of recent history on visual search performance. Using the Ratcliff diffusion model, we model observed saccadic selections from an oddball search experiment that included a mix of both POP and DPE conditions. We find that the Ratcliff diffusion model can effectively model the manner in which selection history affects current attentional control in visual inter-trial effects. The model evidence shows that bias regarding the current trial's most likely target color is the most critical parameter underlying the effect of selection history. Our results are consistent with the view that the 3-item color-oddball task used for POP and DPE experiments is best understood as an attentional decision making task.

  14. Model unspecific search in CMS. First results at 13 TeV

    Energy Technology Data Exchange (ETDEWEB)

    Roemer, Jonas; Albert, Andreas; Duchardt, Deborah; Hebbeker, Thomas; Knutzen, Simon; Lieb, Jonas; Meyer, Arnd; Pook, Tobias [III. Physikalisches Institut A, RWTH Aachen University (Germany)

    2016-07-01

    Following an upgrade in center of mass energy from √(s) = 8 TeV to 13 TeV, the LHC delivered first proton-proton collisions at this unprecedented energy in 2015. The CMS experiment recorded data corresponding to an integrated luminosity of 3.7 fb{sup -1}. Since many theoretical models predict signal cross sections to increase strongly with the center of mass energy, the data taken at √(s) = 13 TeV are competitive to the previous data taking period even with a lower recorded integrated luminosity. The Model Unspecific Search in CMS (MUSiC) searches for physics beyond the standard model independent of theoretical models. Using an automatic method, kinematic distributions of the data are compared with the standard model expectation in every final state. Therefore, MUSiC reduces the chance of overlooking new physics, since even distributions not covered by dedicated analyses are investigated. This talk outlines changes to the analysis made necessary by the increased center of mass energy and first results with lepton triggered events.

  15. Dark Matter Benchmark Models for Early LHC Run-2 Searches. Report of the ATLAS/CMS Dark Matter Forum

    Energy Technology Data Exchange (ETDEWEB)

    Abercrombie, Daniel [Massachusetts Inst. of Technology (MIT), Cambridge, MA (United States). et al.

    2015-07-06

    One of the guiding principles of this report is to channel the efforts of the ATLAS and CMS collaborations towards a minimal basis of dark matter models that should influence the design of the early Run-2 searches. At the same time, a thorough survey of realistic collider signals of Dark Matter is a crucial input to the overall design of the search program.

  16. A Search Technique for Weak and Long-Duration Gamma-Ray Bursts from Background Model Residuals

    Science.gov (United States)

    Skelton, R. T.; Mahoney, W. A.

    1993-01-01

    We report on a planned search technique for Gamma-Ray Bursts too weak to trigger the on-board threshold. The technique is to search residuals from a physically based background model used for analysis of point sources by the Earth occultation method.

  17. Olfaction and Hearing Based Mobile Robot Navigation for Odor/Sound Source Search

    Directory of Open Access Journals (Sweden)

    Qi Wang

    2011-02-01

    Full Text Available Bionic technology provides a new elicitation for mobile robot navigation since it explores the way to imitate biological senses. In the present study, the challenging problem was how to fuse different biological senses and guide distributed robots to cooperate with each other for target searching. This paper integrates smell, hearing and touch to design an odor/sound tracking multi-robot system. The olfactory robot tracks the chemical odor plume step by step through information fusion from gas sensors and airflow sensors, while two hearing robots localize the sound source by time delay estimation (TDE and the geometrical position of microphone array. Furthermore, this paper presents a heading direction based mobile robot navigation algorithm, by which the robot can automatically and stably adjust its velocity and direction according to the deviation between the current heading direction measured by magnetoresistive sensor and the expected heading direction acquired through the odor/sound localization strategies. Simultaneously, one robot can communicate with the other robots via a wireless sensor network (WSN. Experimental results show that the olfactory robot can pinpoint the odor source within the distance of 2 m, while two hearing robots can quickly localize and track the olfactory robot in 2 min. The devised multi-robot system can achieve target search with a considerable success ratio and high stability.

  18. Olfaction and Hearing Based Mobile Robot Navigation for Odor/Sound Source Search

    Science.gov (United States)

    Song, Kai; Liu, Qi; Wang, Qi

    2011-01-01

    Bionic technology provides a new elicitation for mobile robot navigation since it explores the way to imitate biological senses. In the present study, the challenging problem was how to fuse different biological senses and guide distributed robots to cooperate with each other for target searching. This paper integrates smell, hearing and touch to design an odor/sound tracking multi-robot system. The olfactory robot tracks the chemical odor plume step by step through information fusion from gas sensors and airflow sensors, while two hearing robots localize the sound source by time delay estimation (TDE) and the geometrical position of microphone array. Furthermore, this paper presents a heading direction based mobile robot navigation algorithm, by which the robot can automatically and stably adjust its velocity and direction according to the deviation between the current heading direction measured by magnetoresistive sensor and the expected heading direction acquired through the odor/sound localization strategies. Simultaneously, one robot can communicate with the other robots via a wireless sensor network (WSN). Experimental results show that the olfactory robot can pinpoint the odor source within the distance of 2 m, while two hearing robots can quickly localize and track the olfactory robot in 2 min. The devised multi-robot system can achieve target search with a considerable success ratio and high stability. PMID:22319401

  19. Quasi-steady State Reduction of Molecular Motor-Based Models of Directed Intermittent Search

    KAUST Repository

    Newby, Jay M.

    2010-02-19

    We present a quasi-steady state reduction of a linear reaction-hyperbolic master equation describing the directed intermittent search for a hidden target by a motor-driven particle moving on a one-dimensional filament track. The particle is injected at one end of the track and randomly switches between stationary search phases and mobile nonsearch phases that are biased in the anterograde direction. There is a finite possibility that the particle fails to find the target due to an absorbing boundary at the other end of the track. Such a scenario is exemplified by the motor-driven transport of vesicular cargo to synaptic targets located on the axon or dendrites of a neuron. The reduced model is described by a scalar Fokker-Planck (FP) equation, which has an additional inhomogeneous decay term that takes into account absorption by the target. The FP equation is used to compute the probability of finding the hidden target (hitting probability) and the corresponding conditional mean first passage time (MFPT) in terms of the effective drift velocity V, diffusivity D, and target absorption rate λ of the random search. The quasi-steady state reduction determines V, D, and λ in terms of the various biophysical parameters of the underlying motor transport model. We first apply our analysis to a simple 3-state model and show that our quasi-steady state reduction yields results that are in excellent agreement with Monte Carlo simulations of the full system under physiologically reasonable conditions. We then consider a more complex multiple motor model of bidirectional transport, in which opposing motors compete in a "tug-of-war", and use this to explore how ATP concentration might regulate the delivery of cargo to synaptic targets. © 2010 Society for Mathematical Biology.

  20. Searching for beyond the minimal supersymmetric standard model at the laboratory and in the sky

    Energy Technology Data Exchange (ETDEWEB)

    Kim, Ju Min

    2010-09-15

    We study the collider signals as well as Dark Matter candidates in supersymmetric models. We show that the collider signatures from a supersymmetric Grand Unification model based on the SO(10) gauge group can be distinguishable from those from the (constrained) minimal supersymmetric Standard Model, even though they share some common features. The N=2 supersymmetry has the characteristically distinct phenomenology, due to the Dirac nature of gauginos, as well as the extra adjoint scalars. We compute the cold Dark Matter relic density including a class of one-loop corrections. Finally, we discuss the detectability of neutralino Dark Matter candidate of the SO(10) model by the direct and indirect Dark Matter search experiments. (orig.)

  1. Penentuan Posisi Hiposenter Gempabumi dengan Menggunakan Metoda Guided Grid Search dan Model Struktur Kecepatan Tiga Dimensi

    Directory of Open Access Journals (Sweden)

    Hendro Nugroho

    2014-04-01

    Full Text Available Salah satu penelitian ilmu kebumian yang perlu dilakukan untuk membantu upaya mitigasi bencana gempabumi adalah menentukan pusat gempa dengan presisi tinggi. Dalam hal ini ketelitian sangat diperlukan oleh karena adanya heterogenitas materi bumi yang dilewati gelombang gempa dari hiposenter ke stasiun pencatat. Oleh karena itu dengan bantuan model geotomografi (model struktur 3D kecepatan rambat gelombang gempa diharapkan akan dapat diperoleh posisi sumber gempa yang lebih baik. Untuk studi ini daerah penelitian yang diambil adalah Jawa dan sekitarnya, yaitu : 7° LS - 11° LS dan 105° BT - 114° BT. Data yang digunakan adalah waktu tiba gelombang P dari seismogram yang direkam pada seismograf broadband di Indonesia. Penentuan hiposenter menggunakan metoda guided grid search dengan model kecepatan 3D untuk busur Sunda. Hasil penentuan hiposenter gempa dengan pendekatan ini memberikan tingkat kesalahan yang lebih kecil dibandingkan dengan jika digunakan model kecepatan 1D.

  2. Physics at the LHC - From Standard Model measurements to Searches for New Physics

    Energy Technology Data Exchange (ETDEWEB)

    Jakobs, Karl [Freiburg University (Germany)

    2014-07-01

    The successful operation of the Large Hadron Collider (LHC) during the past two years allowed to explore particle interaction in a new energy regime. Measurements of important Standard Model processes like the production of high-p{sub T} jets, W and Z bosons and top and b-quarks were performed by the LHC experiments. In addition, the high collision energy allowed to search for new particles in so far unexplored mass regions. Important constraints on the existence of new particles predicted in many models of physics beyond the Standard Model could be established. With integrated luminosities reaching values around 5 fb{sup −1} in 2011, the experiments reached as well sensitivity to probe the existence of the Standard Model Higgs boson over a large mass range. In the present report the major physics results obtained by the two general-purpose experiments ATLAS and CMS are summarized.

  3. Implications of Higgs searches on the four-generation standard model.

    Science.gov (United States)

    Kuflik, Eric; Nir, Yosef; Volansky, Tomer

    2013-03-01

    Within the four-generation standard model, the Higgs couplings to gluons and to photons deviate in a significant way from the predictions of the three-generation standard model. As a consequence, large departures in several Higgs production and decay channels are expected. Recent Higgs search results, presented by ATLAS, CMS, and CDF, hint on the existence of a Higgs boson with a mass around 125 GeV. Using these results and assuming such a Higgs boson, we derive exclusion limits on the four-generation standard model. For m(H)=125 GeV, the model is excluded above 99.95% confidence level. For 124.5 GeV≤m(H)≤127.5 GeV, an exclusion limit above 99% confidence level is found.

  4. An Optimization Model and Modified Harmony Search Algorithm for Microgrid Planning with ESS

    Directory of Open Access Journals (Sweden)

    Yang Jiao

    2017-01-01

    Full Text Available To solve problems such as the high cost of microgrids (MGs, balance between supply and demand, stability of system operation, and optimizing the MG planning model, the energy storage system (ESS and harmony search algorithm (HSA are proposed. First, the conventional MG planning optimization model is constructed and the constraint conditions are defined: the supply and demand balance and reserve requirements. Second, an ESS is integrated into the optimal model of MG planning. The model with an ESS can solve and identify parameters such as the optimal power, optimal capacity, and optimal installation year. Third, the convergence speed and robustness of the ESS are optimized and improved. A case study comprising three different cases concludes the paper. The results show that the modified HSA (MHSA can effectively improve the stability and economy of MG operation with an ESS.

  5. Searching for beyond the minimal supersymmetric standard model at the laboratory and in the sky

    International Nuclear Information System (INIS)

    Kim, Ju Min

    2010-09-01

    We study the collider signals as well as Dark Matter candidates in supersymmetric models. We show that the collider signatures from a supersymmetric Grand Unification model based on the SO(10) gauge group can be distinguishable from those from the (constrained) minimal supersymmetric Standard Model, even though they share some common features. The N=2 supersymmetry has the characteristically distinct phenomenology, due to the Dirac nature of gauginos, as well as the extra adjoint scalars. We compute the cold Dark Matter relic density including a class of one-loop corrections. Finally, we discuss the detectability of neutralino Dark Matter candidate of the SO(10) model by the direct and indirect Dark Matter search experiments. (orig.)

  6. Models and Tabu Search Metaheuristics for Service Network Design with Asset-Balance Requirements

    DEFF Research Database (Denmark)

    Pedersen, Michael Berliner; Crainic, T.G.; Madsen, Oli B.G.

    2009-01-01

    This paper focuses on a generic model for service network design, which includes asset positioning and utilization through constraints on asset availability at terminals. We denote these relations as "design-balance constraints" and focus on the design-balanced capacitated multicommodity network...... design model, a generalization of the capacitated multicommodity network design model generally used in service network design applications. Both arc-and cycle-based formulations for the new model are presented. The paper also proposes a tabu search metaheuristic framework for the arc-based formulation....... Results on a wide range of network design problem instances from the literature indicate the proposed method behaves very well in terms of computational efficiency and solution quality....

  7. Boosting invisible searches via Z H : From the Higgs boson to dark matter simplified models

    Science.gov (United States)

    Gonçalves, Dorival; Krauss, Frank; Kuttimalai, Silvan; Maierhöfer, Philipp

    2016-09-01

    Higgs boson production in association with a Z boson at the LHC is analyzed, both in the Standard Model and in simplified model extensions for dark matter. We focus on H →invisibles searches and show that loop-induced components for both the signal and background present phenomenologically relevant contributions to the B R (H →inv) limits. We also show how multijet merging improves the description of key distributions to this analysis. In addition, the constraining power of this channel to simplified models for dark matter with scalar and pseudoscalar mediators ϕ and A is discussed and compared with noncollider constraints. We find that with 100 fb-1 of LHC data, this channel provides competitive constraints to the noncollider bounds, for most of the parameter space we consider, bounding the universal Standard Model fermion-mediator strength at gvmoderate masses in the range of 100 GeV

  8. A Search for Beyond Standard Model Light Bosons Decaying into Muon Pairs

    CERN Document Server

    CMS Collaboration

    2016-01-01

    A dataset corresponding to $2.8~\\mathrm{fb}^{-1}$ of proton-proton collisions at $\\sqrt{s} = 13~\\mathrm{TeV}$ was recorded by the CMS experiment at the CERN LHC. These data are used to search for new light bosons with a mass in the range $0.25-8.5~\\mathrm{GeV}/c^2$ decaying into muon pairs. No excess is observed in the data, and a model-independent upper limit on the product of the cross section, branching fraction and acceptance is derived. The results are interpreted in the context of two benchmark models, namely, the next-to-minimal supersymmetric standard model, and dark SUSY models including those predicting a non-negligible light boson lifetime.

  9. A New Signal Model for Axion Cavity Searches from N -body Simulations

    Energy Technology Data Exchange (ETDEWEB)

    Lentz, Erik W.; Rosenberg, Leslie J. [Physics Department, University of Washington, Seattle, WA 98195-1580 (United States); Quinn, Thomas R.; Tremmel, Michael J., E-mail: lentze@phys.washington.edu, E-mail: ljrosenberg@phys.washington.edu, E-mail: trq@astro.washington.edu, E-mail: mjt29@astro.washington.edu [Astronomy Department, University of Washington, Seattle, WA 98195-1580 (United States)

    2017-08-20

    Signal estimates for direct axion dark matter (DM) searches have used the isothermal sphere halo model for the last several decades. While insightful, the isothermal model does not capture effects from a halo’s infall history nor the influence of baryonic matter, which has been shown to significantly influence a halo’s inner structure. The high resolution of cavity axion detectors can make use of modern cosmological structure-formation simulations, which begin from realistic initial conditions, incorporate a wide range of baryonic physics, and are capable of resolving detailed structure. This work uses a state-of-the-art cosmological N -body+Smoothed-Particle Hydrodynamics simulation to develop an improved signal model for axion cavity searches. Signal shapes from a class of galaxies encompassing the Milky Way are found to depart significantly from the isothermal sphere. A new signal model for axion detectors is proposed and projected sensitivity bounds on the Axion DM eXperiment (ADMX) data are presented.

  10. Search for a Standard Model Higgs Boson with a Dilepton and Missing Energy Signature

    International Nuclear Information System (INIS)

    Gerbaudo, Davide

    2011-01-01

    The subject of this thesis is the search for a standard model Higgs boson decaying to a pair of W bosons that in turn decay leptonically, H → W + W - → (bar (ell))ν(ell)(bar ν). This search is performed considering events produced in p(bar p) collisions at √s = 1.96 TeV, where two oppositely charged lepton candidates (e + e - , e ± μ # -+#, or μ + μ - ), and missing transverse energy, have been reconstructed. The data were collected with the D0 detector at the Fermilab Tevatron collider, and are tested against the standard model predictions computed for a Higgs boson with mass in the range 115-200 GeV. No excess of events over background is observed, and limits on Standard Model Higgs boson production are determined. An interpretation of these limits within the hypothesis of a fourth-generation extension to the standard model is also given. The overall analysis scheme is the same for the three dilepton pairs being considered (e + e - , e ± μ # -+#, or μ + μ - ); this thesis, however, describes in detail the study of the dimuon final state.

  11. A search for neutral Higgs bosons in the MSSM and models with two scalar field doublets

    CERN Document Server

    Ackerstaff, K.; Allison, John; Altekamp, N.; Anderson, K.J.; Anderson, S.; Arcelli, S.; Asai, S.; Ashby, S.F.; Axen, D.; Azuelos, G.; Ball, A.H.; Barberio, E.; Barlow, Roger J.; Bartoldus, R.; Batley, J.R.; Baumann, S.; Bechtluft, J.; Behnke, T.; Bell, Kenneth Watson; Bella, G.; Bentvelsen, S.; Bethke, S.; Betts, S.; Biebel, O.; Biguzzi, A.; Bird, S.D.; Blobel, V.; Bloodworth, I.J.; Bobinski, M.; Bock, P.; Bonacorsi, D.; Boutemeur, M.; Braibant, S.; Brigliadori, L.; Brown, Robert M.; Burckhart, H.J.; Burgard, C.; Burgin, R.; Capiluppi, P.; Carnegie, R.K.; Carter, A.A.; Carter, J.R.; Chang, C.Y.; Charlton, David G.; Chrisman, D.; Clarke, P.E.L.; Cohen, I.; Conboy, J.E.; Cooke, O.C.; Couyoumtzelis, C.; Coxe, R.L.; Cuffiani, M.; Dado, S.; Dallapiccola, C.; Dallavalle, G.Marco; Davis, R.; De Jong, S.; del Pozo, L.A.; de Roeck, A.; Desch, K.; Dienes, B.; Dixit, M.S.; Doucet, M.; Duchovni, E.; Duckeck, G.; Duerdoth, I.P.; Eatough, D.; Estabrooks, P.G.; Etzion, E.; Evans, H.G.; Evans, M.; Fabbri, F.; Fanfani, A.; Fanti, M.; Faust, A.A.; Feld, L.; Fiedler, F.; Fierro, M.; Fischer, H.M.; Fleck, I.; Folman, R.; Fong, D.G.; Foucher, M.; Furtjes, A.; Futyan, D.I.; Gagnon, P.; Gary, J.W.; Gascon, J.; Gascon-Shotkin, S.M.; Geddes, N.I.; Geich-Gimbel, C.; Geralis, T.; Giacomelli, G.; Giacomelli, P.; Giacomelli, R.; Gibson, V.; Gibson, W.R.; Gingrich, D.M.; Glenzinski, D.; Goldberg, J.; Goodrick, M.J.; Gorn, W.; Grandi, C.; Gross, E.; Grunhaus, J.; Gruwe, M.; Hajdu, C.; Hanson, G.G.; Hansroul, M.; Hapke, M.; Hargrove, C.K.; Hart, P.A.; Hartmann, C.; Hauschild, M.; Hawkes, C.M.; Hawkings, R.; Hemingway, R.J.; Herndon, M.; Herten, G.; Heuer, R.D.; Hildreth, M.D.; Hill, J.C.; Hillier, S.J.; Hobson, P.R.; Hocker, James Andrew; Homer, R.J.; Honma, A.K.; Horvath, D.; Hossain, K.R.; Howard, R.; Huntemeyer, P.; Hutchcroft, D.E.; Igo-Kemenes, P.; Imrie, D.C.; Ishii, K.; Jawahery, A.; Jeffreys, P.W.; Jeremie, H.; Jimack, M.; Joly, A.; Jones, C.R.; Jones, M.; Jost, U.; Jovanovic, P.; Junk, T.R.; Kanzaki, J.; Karlen, D.; Kartvelishvili, V.; Kawagoe, K.; Kawamoto, T.; Kayal, P.I.; Keeler, R.K.; Kellogg, R.G.; Kennedy, B.W.; Kirk, J.; Klier, A.; Kluth, S.; Kobayashi, T.; Kobel, M.; Koetke, D.S.; Kokott, T.P.; Kolrep, M.; Komamiya, S.; Kowalewski, Robert V.; Kress, T.; Krieger, P.; von Krogh, J.; Kyberd, P.; Lafferty, G.D.; Lahmann, R.; Lai, W.P.; Lanske, D.; Lauber, J.; Lautenschlager, S.R.; Lawson, I.; Layter, J.G.; Lazic, D.; Lee, A.M.; Lefebvre, E.; Lellouch, D.; Letts, J.; Levinson, L.; List, B.; Lloyd, S.L.; Loebinger, F.K.; Long, G.D.; Losty, M.J.; Ludwig, J.; Lui, D.; Macchiolo, A.; Macpherson, A.; Mannelli, M.; Marcellini, S.; Markopoulos, C.; Markus, C.; Martin, A.J.; Martin, J.P.; Martinez, G.; Mashimo, T.; Mattig, Peter; McDonald, W.John; McKenna, J.; Mckigney, E.A.; McMahon, T.J.; McPherson, R.A.; Meijers, F.; Menke, S.; Merritt, F.S.; Mes, H.; Meyer, J.; Michelini, A.; Mihara, S.; Mikenberg, G.; Miller, D.J.; Mincer, A.; Mir, R.; Mohr, W.; Montanari, A.; Mori, T.; Nagai, K.; Nakamura, I.; Neal, H.A.; Nellen, B.; Nisius, R.; O'Neale, S.W.; Oakham, F.G.; Odorici, F.; Ogren, H.O.; Oh, A.; Oldershaw, N.J.; Oreglia, M.J.; Orito, S.; Palinkas, J.; Pasztor, G.; Pater, J.R.; Patrick, G.N.; Patt, J.; Perez-Ochoa, R.; Petzold, S.; Pfeifenschneider, P.; Pilcher, J.E.; Pinfold, J.; Plane, David E.; Poffenberger, P.; Poli, B.; Posthaus, A.; Rembser, C.; Robertson, S.; Robins, S.A.; Rodning, N.; Roney, J.M.; Rooke, A.; Rossi, A.M.; Routenburg, P.; Rozen, Y.; Runge, K.; Runolfsson, O.; Ruppel, U.; Rust, D.R.; Sachs, K.; Saeki, T.; Sahr, O.; Sang, W.M.; Sarkisian, E.K.G.; Sbarra, C.; Schaile, A.D.; Schaile, O.; Scharf, F.; Scharff-Hansen, P.; Schieck, J.; Schleper, P.; Schmitt, B.; Schmitt, S.; Schoning, A.; Schroder, Matthias; Schumacher, M.; Schwick, C.; Scott, W.G.; Shears, T.G.; Shen, B.C.; Shepherd-Themistocleous, C.H.; Sherwood, P.; Siroli, G.P.; Sittler, A.; Skillman, A.; Skuja, A.; Smith, A.M.; Snow, G.A.; Sobie, R.; Soldner-Rembold, S.; Springer, Robert Wayne; Sproston, M.; Stephens, K.; Steuerer, J.; Stockhausen, B.; Stoll, K.; Strom, David M.; Strohmer, R.; Szymanski, P.; Tafirout, R.; Talbot, S.D.; Taras, P.; Tarem, S.; Teuscher, R.; Thiergen, M.; Thomson, M.A.; von Torne, E.; Torrence, E.; Towers, S.; Trigger, I.; Trocsanyi, Z.; Tsur, E.; Turcot, A.S.; Turner-Watson, M.F.; Ueda, I.; Utzat, P.; Van Kooten, Rick J.; Vannerem, P.; Verzocchi, M.; Vikas, P.; Vokurka, E.H.; Voss, H.; Wackerle, F.; Wagner, A.; Ward, C.P.; Ward, D.R.; Watkins, P.M.; Watson, A.T.; Watson, N.K.; Wells, P.S.; Wermes, N.; White, J.S.; Wilson, G.W.; Wilson, J.A.; Wyatt, T.R.; Yamashita, S.; Yekutieli, G.; Zacek, V.; Zer-Zion, D.

    1998-01-01

    A search is described for the neutral Higgs bosons h^0 and A^0 predicted by models with two scalar field doublets and, in particular, the Minimal Supersymmetric Standard Model (MSSM). The search in the Z^0 h^0 and h^0 A^0 production channels is based on data corresponding to an integrated luminosity of 25 pb^{-1} from e^+e^- collisions at centre-of-mass energies between 130 and 172GeV collected with the OPAL detector at LEP. The observation of a number of candidates consistent with Standard Model background expectations is used in combination with earlier results from data collected at the Z^0 resonance to set limits on m_h and m_A in general models with two scalar field doublets and in the MSSM. For example, in the MSSM, for tan(beta) > 1, minimal and maximal scalar top quark mixing and soft SUSY-breaking masses of 1 TeV, the 95% confidence level limits m_h > 59.0 GeV and m_A > 59.5 GeV are obtained. For the first time, the MSSM parameter space is explored in a detailed scan.

  12. Search for a Standard Model Higgs Boson with a Dilepton and Missing Energy Signature

    Energy Technology Data Exchange (ETDEWEB)

    Gerbaudo, Davide [Princeton Univ., NJ (United States)

    2011-09-01

    The subject of this thesis is the search for a standard model Higgs boson decaying to a pair of W bosons that in turn decay leptonically, H → W+W- → $\\bar{ℓ}$vℓ$\\bar{v}$. This search is performed considering events produced in p$\\bar{p}$ collisions at √s = 1.96 TeV, where two oppositely charged lepton candidates (e+e-, e±μ±, or μ+μ}-), and missing transverse energy, have been reconstructed. The data were collected with the D0 detector at the Fermilab Tevatron collider, and are tested against the standard model predictions computed for a Higgs boson with mass in the range 115-200 GeV. No excess of events over background is observed, and limits on Standard Model Higgs boson production are determined. An interpretation of these limits within the hypothesis of a fourth-generation extension to the standard model is also given. The overall analysis scheme is the same for the three dilepton pairs being considered (e+e-, e±μ±, or μ+μ-); this thesis, however, describes in detail the study of the dimuon final state.

  13. Inverse modeling approach for evaluation of kinetic parameters of a biofilm reactor using tabu search.

    Science.gov (United States)

    Kumar, B Shiva; Venkateswarlu, Ch

    2014-08-01

    The complex nature of biological reactions in biofilm reactors often poses difficulties in analyzing such reactors experimentally. Mathematical models could be very useful for their design and analysis. However, application of biofilm reactor models to practical problems proves somewhat ineffective due to the lack of knowledge of accurate kinetic models and uncertainty in model parameters. In this work, we propose an inverse modeling approach based on tabu search (TS) to estimate the parameters of kinetic and film thickness models. TS is used to estimate these parameters as a consequence of the validation of the mathematical models of the process with the aid of measured data obtained from an experimental fixed-bed anaerobic biofilm reactor involving the treatment of pharmaceutical industry wastewater. The results evaluated for different modeling configurations of varying degrees of complexity illustrate the effectiveness of TS for accurate estimation of kinetic and film thickness model parameters of the biofilm process. The results show that the two-dimensional mathematical model with Edward kinetics (with its optimum parameters as mu(max)rho(s)/Y = 24.57, Ks = 1.352 and Ki = 102.36) and three-parameter film thickness expression (with its estimated parameters as a = 0.289 x 10(-5), b = 1.55 x 10(-4) and c = 15.2 x 10(-6)) better describes the biofilm reactor treating the industry wastewater.

  14. The Search Performance Evaluation and Prediction in Exploratory Search

    OpenAIRE

    LIU, FEI

    2016-01-01

    The exploratory search for complex search tasks requires an effective search behavior model to evaluate and predict user search performance. Few studies have investigated the relationship between user search behavior and search performance in exploratory search. This research adopts a mixed approach combining search system development, user search experiment, search query log analysis, and multivariate regression analysis to resolve the knowledge gap. Through this study, it is shown that expl...

  15. A template bank to search for gravitational waves from inspiralling compact binaries: I. Physical models

    International Nuclear Information System (INIS)

    Babak, S; Balasubramanian, R; Churches, D; Cokelaer, T; Sathyaprakash, B S

    2006-01-01

    Gravitational waves from coalescing compact binaries are searched for using the matched filtering technique. As the model waveform depends on a number of parameters, it is necessary to filter the data through a template bank covering the astrophysically interesting region of the parameter space. The choice of templates is defined by the maximum allowed drop in signal-to-noise ratio due to the discreteness of the template bank. In this paper we describe the template-bank algorithm that was used in the analysis of data from the Laser Interferometer Gravitational Wave Observatory (LIGO) and GEO 600 detectors to search for signals from binaries consisting of non-spinning compact objects. Using Monte Carlo simulations, we study the efficiency of the bank and show that its performance is satisfactory for the design sensitivity curves of ground-based interferometric gravitational wave detectors GEO 600, initial LIGO, advanced LIGO and Virgo. The bank is efficient in searching for various compact binaries such as binary primordial black holes, binary neutron stars, binary black holes, as well as a mixed binary consisting of a non-spinning black hole and a neutron star

  16. Search for the standard model higgs boson in eτ final states

    Energy Technology Data Exchange (ETDEWEB)

    Howley, Ian James [Univ. of Texas, Arlington, TX (United States)

    2013-05-01

    Presented in this dissertation is a search for the standard model (SM) Higgs boson using the DØ detector at Fermilab in Batavia, IL. The SM is a fantastically accurate theory describing the fundamental interactions and particles of the Universe. The only undiscovered particle in the SM is the Higgs boson, which is hypothesized to be responsible for electroweak symmetry breaking and giving mass to all other particles. Considered in this search is the process H + X → eτhjj, where e is an electron, τh is the hadronic decay of a tau, and j is a jet, using p $\\bar{p}$ collisions at center of mass energy√s = 1.96 TeV. This search includes three production modes: associated production, gluon fusion and vector boson fusion. It also utilizes two decay channels: H→ ττ and H → WW. A new technique, dubbed the Global Boosted Decision Tree, is introduced which offers a means of providing continuity to a multivariate search as a function of a particular parameter, in this case, the mass of the Higgs boson. The observed (expected) limit on the ratio of cross section times branching fraction to the SM at 95% confidence level is 14.6 (16.0) at mH = 125 GeV. This result is combined with the related channel H + X → μτhjj and produced an observed (expected) limit of 9.0 (11.3) at mH = 125 GeV.

  17. Dynamic model updating based on strain mode shape and natural frequency using hybrid pattern search technique

    Science.gov (United States)

    Guo, Ning; Yang, Zhichun; Wang, Le; Ouyang, Yan; Zhang, Xinping

    2018-05-01

    Aiming at providing a precise dynamic structural finite element (FE) model for dynamic strength evaluation in addition to dynamic analysis. A dynamic FE model updating method is presented to correct the uncertain parameters of the FE model of a structure using strain mode shapes and natural frequencies. The strain mode shape, which is sensitive to local changes in structure, is used instead of the displacement mode for enhancing model updating. The coordinate strain modal assurance criterion is developed to evaluate the correlation level at each coordinate over the experimental and the analytical strain mode shapes. Moreover, the natural frequencies which provide the global information of the structure are used to guarantee the accuracy of modal properties of the global model. Then, the weighted summation of the natural frequency residual and the coordinate strain modal assurance criterion residual is used as the objective function in the proposed dynamic FE model updating procedure. The hybrid genetic/pattern-search optimization algorithm is adopted to perform the dynamic FE model updating procedure. Numerical simulation and model updating experiment for a clamped-clamped beam are performed to validate the feasibility and effectiveness of the present method. The results show that the proposed method can be used to update the uncertain parameters with good robustness. And the updated dynamic FE model of the beam structure, which can correctly predict both the natural frequencies and the local dynamic strains, is reliable for the following dynamic analysis and dynamic strength evaluation.

  18. The waning of the WIMP? A review of models, searches, and constraints

    Science.gov (United States)

    Arcadi, Giorgio; Dutra, Maíra; Ghosh, Pradipta; Lindner, Manfred; Mambrini, Yann; Pierre, Mathias; Profumo, Stefano; Queiroz, Farinaldo S.

    2018-03-01

    Weakly Interacting Massive Particles (WIMPs) are among the best-motivated dark matter candidates. No conclusive signal, despite an extensive search program that combines, often in a complementary way, direct, indirect, and collider probes, has been detected so far. This situation might change in near future due to the advent of one/multi-TON Direct Detection experiments. We thus, find it timely to provide a review of the WIMP paradigm with focus on a few models which can be probed at best by these facilities. Collider and Indirect Detection, nevertheless, will not be neglected when they represent a complementary probe.

  19. GUT models at current and future hadron colliders and implications to dark matter searches

    Science.gov (United States)

    Arcadi, Giorgio; Lindner, Manfred; Mambrini, Yann; Pierre, Mathias; Queiroz, Farinaldo S.

    2017-08-01

    Grand Unified Theories (GUT) offer an elegant and unified description of electromagnetic, weak and strong interactions at high energy scales. A phenomenological and exciting possibility to grasp GUT is to search for TeV scale observables arising from Abelian groups embedded in GUT constructions. That said, we use dilepton data (ee and μμ) that has been proven to be a golden channel for a wide variety of new phenomena expected in theories beyond the Standard Model to probe GUT-inspired models. Since heavy dilepton resonances feature high signal selection efficiencies and relatively well-understood backgrounds, stringent and reliable bounds can be placed on the mass of the Z‧ gauge boson arising in such theories. In this work, we obtain 95% C.L. limits on the Z‧ mass for several GUT-models using current and future proton-proton colliders with √{ s} = 13 TeV , 33 TeV ,and 100 TeV, and put them into perspective with dark matter searches in light of the next generation of direct detection experiments.

  20. Supersymmetry Searches in GUT Models with Non-Universal Scalar Masses

    CERN Document Server

    Cannoni, M.; Gómez, M.E.; Lola, S.; Ruiz de Austri, R.

    2016-03-22

    We study SO(10), SU(5) and flipped SU(5) GUT models with non-universal soft supersymmetry-breaking scalar masses, exploring how they are constrained by LHC supersymmetry searches and cold dark matter experiments, and how they can be probed and distinguished in future experiments. We find characteristic differences between the various GUT scenarios, particularly in the coannihilation region, which is very sensitive to changes of parameters. For example, the flipped SU(5) GUT predict the possibility of $\\tilde{t}_1-\\chi$ coannihilation, which is absent in the regions of the SO(10) and SU(5) GUT parameter spaces that we study. We use the relic density predictions in different models to determine upper bounds for the neutralino masses, and we find large differences between different GUT models in the sparticle spectra for the same LSP mass, leading to direct connections of distinctive possible experimental measurements with the structure of the GUT group. We find that future LHC searches for generic missing $E_T$...

  1. Searches for beyond Standard Model physics with same-sign dileptons

    CERN Document Server

    Hawkins, Anthony

    An introduction into the theory and experimental background of particle physics and the ATLAS detector is given. The transition radiation tracker (TRT) which is vital to the particle tracking and identification is then described giving particular creedence to the calibration. The automation of this calibration is explained. The second half of this thesis and the central part dwells on the analyses searching for beyond Standard model physics at the ATLAS detector using same-sign dilepton pairs (e±e±, e±μ±, μ±μ±) during both the 7 TeV and 8 TeV data taking periods at the Large Hadron Collider (LHC). In both searches no significant excess from the standard model (SM) was seen. Limits were set on the fiducial cross-section for new physics as a function of invariant mass. Exclusion limits are also derived for a specific model of doubly charged higgs boson production and are seen to improve from the 7 TeV analysis to the 8 TeV analysis.

  2. GUT models at current and future hadron colliders and implications to dark matter searches

    Directory of Open Access Journals (Sweden)

    Giorgio Arcadi

    2017-08-01

    Full Text Available Grand Unified Theories (GUT offer an elegant and unified description of electromagnetic, weak and strong interactions at high energy scales. A phenomenological and exciting possibility to grasp GUT is to search for TeV scale observables arising from Abelian groups embedded in GUT constructions. That said, we use dilepton data (ee and μμ that has been proven to be a golden channel for a wide variety of new phenomena expected in theories beyond the Standard Model to probe GUT-inspired models. Since heavy dilepton resonances feature high signal selection efficiencies and relatively well-understood backgrounds, stringent and reliable bounds can be placed on the mass of the Z′ gauge boson arising in such theories. In this work, we obtain 95% C.L. limits on the Z′ mass for several GUT-models using current and future proton–proton colliders with s=13 TeV,33 TeV,and100 TeV, and put them into perspective with dark matter searches in light of the next generation of direct detection experiments.

  3. Forecasting solar radiation using an optimized hybrid model by Cuckoo Search algorithm

    International Nuclear Information System (INIS)

    Wang, Jianzhou; Jiang, He; Wu, Yujie; Dong, Yao

    2015-01-01

    Due to energy crisis and environmental problems, it is very urgent to find alternative energy sources nowadays. Solar energy, as one of the great potential clean energies, has widely attracted the attention of researchers. In this paper, an optimized hybrid method by CS (Cuckoo Search) on the basis of the OP-ELM (Optimally Pruned Extreme Learning Machine), called CS-OP-ELM, is developed to forecast clear sky and real sky global horizontal radiation. First, MRSR (Multiresponse Sparse Regression) and LOO-CV (leave-one-out cross-validation) can be applied to rank neurons and prune the possibly meaningless neurons of the FFNN (Feed Forward Neural Network), respectively. Then, Direct strategy and Direct-Recursive strategy based on OP-ELM are introduced to build a hybrid model. Furthermore, CS (Cuckoo Search) optimized algorithm is employed to determine the proper weight coefficients. In order to verify the effectiveness of the developed method, hourly solar radiation data from six sites of the United States has been collected, and methods like ARMA (Autoregression moving average), BP (Back Propagation) neural network and OP-ELM can be compared with CS-OP-ELM. Experimental results show the optimized hybrid method CS-OP-ELM has the best forecasting performance. - Highlights: • An optimized hybrid method called CS-OP-ELM is proposed to forecast solar radiation. • CS-OP-ELM adopts multiple variables dataset as input variables. • Direct and Direct-Recursive strategy are introduced to build a hybrid model. • CS (Cuckoo Search) algorithm is used to determine the optimal weight coefficients. • The proposed method has the best performance compared with other methods

  4. Search for the standard model Higgs boson in association with a W boson at D0.

    Energy Technology Data Exchange (ETDEWEB)

    Shaw, Savanna Marie [Michigan State Univ., East Lansing, MI (United States)

    2013-01-01

    I present a search for the standard model Higgs boson, H, produced in association with a W boson in data events containing a charged lepton (electron or muon), missing energy, and two or three jets. The data analysed correspond to 9.7 fb-1 of integrated luminosity collected at a center-of-momentum energy of √s = 1.96 TeV with the D0 detector at the Fermilab Tevatron p$\\bar{p}$ collider. This search uses algorithms to identify the signature of bottom quark production and multivariate techniques to improve the purity of H → b$\\bar{b}$ production. We validate our methodology by measuring WZ and ZZ production with Z → b$\\bar{b}$ and find production rates consistent with the standard model prediction. For a Higgs boson mass of 125 GeV, we determine a 95% C.L. upper limit on the production of a standard model Higgs boson of 4.8 times the standard model Higgs boson production cross section, while the expected limit is 4.7 times the standard model production cross section. I also present a novel method for improving the energy resolution for charged particles within hadronic signatures. This is achieved by replacing the calorimeter energy measurement for charged particles within a hadronic signature with the tracking momentum measurement. This technique leads to a ~ 20% improvement in the jet energy resolution, which yields a ~ 7% improvement in the reconstructed dijet mass width for H → b$\\bar{b}$ events. The improved energy calculation leads to a ~ 5% improvement in our expected 95% C.L. upper limit on the Higgs boson production cross section.

  5. Searching for beyond-the-Standard Model Higgs bosons at ATLAS and CMS

    CERN Document Server

    Beacham, James; The ATLAS collaboration

    2018-01-01

    Searches for scalar, Higgs-like particles beyond the Standard Model --- as well as non-standard decays of the newly discovered scalar with a mass of 125 GeV (h125) --- with the ATLAS and CMS detectors at the Large Hadron Collider are presented. Extensions of the SM scalar sector are ubiquitous in new physics scenarios, and motivate a wide variety of experimental searches at the LHC. Signatures mentioned include those sensitive to new higher- or lower- mass scalars or pseudoscalars in two-Higgs doublet models (h/A/H); new particles leading to Vh resonances (where V is a SM vector boson); pair production of h125 from a new, higher-mass particle (di-Higgs); charged Higgs bosons (H+/- or H++/--); lepton flavor violating decays of h125; new, high-mass scalars decaying to V+photon or di-photon final states; exotic decays of h125 to light, intermediate particles that decay to SM final states; and either h125 or new scalars decaying to new long-lived particles that yield atypical detector signatures.

  6. Turn-Based War Chess Model and Its Search Algorithm per Turn

    Directory of Open Access Journals (Sweden)

    Hai Nan

    2016-01-01

    Full Text Available War chess gaming has so far received insufficient attention but is a significant component of turn-based strategy games (TBS and is studied in this paper. First, a common game model is proposed through various existing war chess types. Based on the model, we propose a theory frame involving combinational optimization on the one hand and game tree search on the other hand. We also discuss a key problem, namely, that the number of the branching factors of each turn in the game tree is huge. Then, we propose two algorithms for searching in one turn to solve the problem: (1 enumeration by order; (2 enumeration by recursion. The main difference between these two is the permutation method used: the former uses the dictionary sequence method, while the latter uses the recursive permutation method. Finally, we prove that both of these algorithms are optimal, and we analyze the difference between their efficiencies. An important factor is the total time taken for the unit to expand until it achieves its reachable position. The factor, which is the total number of expansions that each unit makes in its reachable position, is set. The conclusion proposed is in terms of this factor: Enumeration by recursion is better than enumeration by order in all situations.

  7. Searching for the best model: ambiguity of inverse solutions and application to fetal magnetoencephalography

    International Nuclear Information System (INIS)

    Vrba, J; Robinson, S E; McCubbin, J; Lowery, C L; Eswaran, H; Murphy, P; Preissl, H

    2007-01-01

    Fetal brain signals produce weak magnetic fields at the maternal abdominal surface. In the presence of much stronger interference these weak fetal fields are often nearly indistinguishable from noise. Our initial objective was to validate these weak fetal brain fields by demonstrating that they agree with the electromagnetic model of the fetal brain. The fetal brain model is often not known and we have attempted to fit the data to not only the brain source position, orientation and magnitude, but also to the brain model position. Simulation tests of this extended model search on fetal MEG recordings using dipole fit and beamformers revealed a region of ambiguity. The region of ambiguity consists of a family of models which are not distinguishable in the presence of noise, and which exhibit large and comparable SNR when beamformers are used. Unlike the uncertainty of a dipole fit with known model plus noise, this extended ambiguity region yields nearly identical forward solutions, and is only weakly dependent on noise. The ambiguity region is located in a plane defined by the source position, orientation, and the true model centre, and will have a diameter approximately 0.67 of the modelled fetal head diameter. Existence of the ambiguity region allows us to only state that the fetal brain fields do not contradict the electromagnetic model; we can associate them with a family of models belonging to the ambiguity region, but not with any specific model. In addition to providing a level of confidence in the fetal brain signals, the ambiguity region knowledge in combination with beamformers allows detection of undistorted temporal waveforms with improved signal-to-noise ratio, even though the source position cannot be uniquely determined

  8. Review of searches for rare processes and physics beyond the Standard Model at HERA

    International Nuclear Information System (INIS)

    South, David M.; Turcato, Monica

    2016-01-01

    The electron-proton collisions collected by the H1 and ZEUS experiments at HERA comprise a unique particle physics data set, and a comprehensive range of measurements has been performed to provide new insight into the structure of the proton. The high centre of mass energy at HERA has also allowed rare processes to be studied, including the production of W and Z 0 bosons and events with multiple leptons in the final state. The data have also opened up a new domain to searches for physics beyond the Standard Model including contact interactions, leptoquarks, excited fermions and a number of supersymmetric models. This review presents a summary of such results, where the analyses reported correspond to an integrated luminosity of up to 1 fb -1 , representing the complete data set recorded by the H1 and ZEUS experiments. (orig.)

  9. Random intermittent search and the tug-of-war model of motor-driven transport

    International Nuclear Information System (INIS)

    Newby, Jay; Bressloff, Paul C

    2010-01-01

    We formulate the 'tug-of-war' model of microtubule cargo transport by multiple molecular motors as an intermittent random search for a hidden target. A motor complex consisting of multiple molecular motors with opposing directional preference is modeled using a discrete Markov process. The motors randomly pull each other off of the microtubule so that the state of the motor complex is determined by the number of bound motors. The tug-of-war model prescribes the state transition rates and corresponding cargo velocities in terms of experimentally measured physical parameters. We add space to the resulting Chapman–Kolmogorov (CK) equation so that we can consider delivery of the cargo to a hidden target at an unknown location along the microtubule track. The target represents some subcellular compartment such as a synapse in a neuron's dendrites, and target delivery is modeled as a simple absorption process. Using a quasi-steady-state (QSS) reduction technique we calculate analytical approximations of the mean first passage time (MFPT) to find the target. We show that there exists an optimal adenosine triphosphate (ATP) concentration that minimizes the MFPT for two different cases: (i) the motor complex is composed of equal numbers of kinesin motors bound to two different microtubules (symmetric tug-of-war model) and (ii) the motor complex is composed of different numbers of kinesin and dynein motors bound to a single microtubule (asymmetric tug-of-war model)

  10. Random intermittent search and the tug-of-war model of motor-driven transport

    Science.gov (United States)

    Newby, Jay; Bressloff, Paul C.

    2010-04-01

    We formulate the 'tug-of-war' model of microtubule cargo transport by multiple molecular motors as an intermittent random search for a hidden target. A motor complex consisting of multiple molecular motors with opposing directional preference is modeled using a discrete Markov process. The motors randomly pull each other off of the microtubule so that the state of the motor complex is determined by the number of bound motors. The tug-of-war model prescribes the state transition rates and corresponding cargo velocities in terms of experimentally measured physical parameters. We add space to the resulting Chapman-Kolmogorov (CK) equation so that we can consider delivery of the cargo to a hidden target at an unknown location along the microtubule track. The target represents some subcellular compartment such as a synapse in a neuron's dendrites, and target delivery is modeled as a simple absorption process. Using a quasi-steady-state (QSS) reduction technique we calculate analytical approximations of the mean first passage time (MFPT) to find the target. We show that there exists an optimal adenosine triphosphate (ATP) concentration that minimizes the MFPT for two different cases: (i) the motor complex is composed of equal numbers of kinesin motors bound to two different microtubules (symmetric tug-of-war model) and (ii) the motor complex is composed of different numbers of kinesin and dynein motors bound to a single microtubule (asymmetric tug-of-war model).

  11. Random intermittent search and the tug-of-war model of motor-driven transport

    KAUST Repository

    Newby, Jay

    2010-04-16

    We formulate the \\'tug-of-war\\' model of microtubule cargo transport by multiple molecular motors as an intermittent random search for a hidden target. A motor complex consisting of multiple molecular motors with opposing directional preference is modeled using a discrete Markov process. The motors randomly pull each other off of the microtubule so that the state of the motor complex is determined by the number of bound motors. The tug-of-war model prescribes the state transition rates and corresponding cargo velocities in terms of experimentally measured physical parameters. We add space to the resulting Chapman-Kolmogorov (CK) equation so that we can consider delivery of the cargo to a hidden target at an unknown location along the microtubule track. The target represents some subcellular compartment such as a synapse in a neuron\\'s dendrites, and target delivery is modeled as a simple absorption process. Using a quasi-steady-state (QSS) reduction technique we calculate analytical approximations of the mean first passage time (MFPT) to find the target. We show that there exists an optimal adenosine triphosphate (ATP) concentration that minimizes the MFPT for two different cases: (i) the motor complex is composed of equal numbers of kinesin motors bound to two different microtubules (symmetric tug-of-war model) and (ii) the motor complex is composed of different numbers of kinesin and dynein motors bound to a single microtubule (asymmetric tug-of-war model). © 2010 IOP Publishing Ltd.

  12. Random intermittent search and the tug-of-war model of motor-driven transport

    KAUST Repository

    Newby, Jay; Bressloff, Paul C

    2010-01-01

    We formulate the 'tug-of-war' model of microtubule cargo transport by multiple molecular motors as an intermittent random search for a hidden target. A motor complex consisting of multiple molecular motors with opposing directional preference is modeled using a discrete Markov process. The motors randomly pull each other off of the microtubule so that the state of the motor complex is determined by the number of bound motors. The tug-of-war model prescribes the state transition rates and corresponding cargo velocities in terms of experimentally measured physical parameters. We add space to the resulting Chapman-Kolmogorov (CK) equation so that we can consider delivery of the cargo to a hidden target at an unknown location along the microtubule track. The target represents some subcellular compartment such as a synapse in a neuron's dendrites, and target delivery is modeled as a simple absorption process. Using a quasi-steady-state (QSS) reduction technique we calculate analytical approximations of the mean first passage time (MFPT) to find the target. We show that there exists an optimal adenosine triphosphate (ATP) concentration that minimizes the MFPT for two different cases: (i) the motor complex is composed of equal numbers of kinesin motors bound to two different microtubules (symmetric tug-of-war model) and (ii) the motor complex is composed of different numbers of kinesin and dynein motors bound to a single microtubule (asymmetric tug-of-war model). © 2010 IOP Publishing Ltd.

  13. Search for the standard model Higgs boson in the dimuon decay channel with the ATLAS detector

    International Nuclear Information System (INIS)

    Rudolph, Joerg Christian

    2014-01-01

    The search for the Standard Model Higgs boson was one of the key motivations to build the world's largest particle physics experiment to date, the Large Hadron Collider (LHC). This thesis is equally driven by this search, and it investigates the direct muonic decay of the Higgs boson. The decay into muons has several advantages: it provides a very clear final state with two muons of opposite charge, which can easily be detected. In addition, the muonic final state has an excellent mass resolution, such that an observed resonance can be pinned down in one of its key properties: its mass. Unfortunately, the decay of a Standard Model Higgs boson into a pair of muons is very rare, only two out of 10000 Higgs bosons are predicted to exhibit this decay. On top of that, the non-resonant Standard Model background arising from the Z/γ * →μμ process has a very similar signature, while possessing a much higher cross-section. For one produced Higgs boson, there are approximately 1.5 million Z bosons produced at the LHC for a centre-of-mass energy of 8 TeV. Two related analyses are presented in this thesis: the investigation of 20.7 fb -1 of the proton-proton collision dataset recorded by the ATLAS detector in 2012, referred to as standalone analysis, and the combined analysis as the search in the full run-I dataset consisting of proton-proton collision data recorded in 2011 and 2012, which corresponds to an integrated luminosity of L int =24.8 fb -1 . In each case, the dimuon invariant mass spectrum is examined for a narrow resonance on top of the continuous background distribution. The dimuon phenomenology and ATLAS detector performance serve as the foundations to develop analytical models describing the spectra. Using these analytical parametrisations for the signal and background mass distributions, the sensitivity of the analyses to systematic uncertainties due to Monte-Carlo simulation mismodeling are minimised. These residual systematic uncertainties are

  14. A model-independent "General Search" for new physics with the ATLAS detector at LHC

    CERN Document Server

    Bianchi, Riccardo Maria

    2014-06-02

    The LHC particle collider accelerates bunches of colliding protons at an energy never reached before, and a completely new landscape of new physics has been opened. In this scenario the number of possible physics processes and signatures becomes virtually infinite, making the setup of dedicated analyses impossible. Moreover it is important being able to reveal new physics signals even in regions of the phase-space where it is less lucky to be found, or where suitable theoretical models are missing. In this Thesis a new model-independent “General Search” for the ATLAS experiment has been conceived. In fact, at the time this project started, no model-independent search was set for ATLAS. In the end the new analysis has been run over the first data at 7 TeV collected by the ATLAS experiment, and the results presented. The data have shown a very good agreement with the Standard Model expectation, and no evidence of new physics has been observed. But the strategy and methodology of the new model-independent Ge...

  15. USING OF BYOD MODEL FOR TESTING OF EDUCATIONAL ACHIEVEMENTS ON THE BASIS OF GOOGLE SEARCH SERVICES

    Directory of Open Access Journals (Sweden)

    Tetiana Bondarenko

    2016-04-01

    Full Text Available The technology of using their own mobile devices of learners for testing educational achievements, based on the model of BYOD, in an article is offered. The proposed technology is based on cloud services Google. This technology provides a comprehensive support of testing system: creating appropriate forms, storing the results in cloud storage, processing test results and management of testing system through the use of Google-Calendar. A number of software products based on cloud technologies that allow using BYOD model for testing of educational achievement are described, their strengths and weaknesses are identified. This article also describes the stages of the testing process of the academic achievements of students on the basis of Google search services with using the BYOD model. The proposed approaches to the testing of educational achievements based on using of BYOD model extends the space and time of the testing, makes the test procedure more flexible and systematically, adds to the procedure for testing the elements of a computer game. BYOD model opens up broad prospects for implementation of ICT in all forms of learning process, and particularly in testing of educational achievement in view of the limited computing resources in education

  16. Search for beyond Standard Model physics with high-pt leptons

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00184482; Hedberg, Vincent

    2017-01-24

    This thesis covers four different topics related to the physics analysis in the ATLAS experiment that uses proton-proton collisions data provided by the Large Hadron Collider. The first topic is focused on the numerical simulation of the Transition Radiation Tracker which is one of the ATLAS tracking detectors. The implementation of the alternative Argon based gas mixtures used in the drift tubes is described. A performance study with focus on the hit and track parameters with respect to the gas mixture is discussed as well. The second topic is related to the ATLAS luminosity monitor called LUCID. A number of studies are presented from the design phase of the detector and of its calibration system as well as detector operation, the performance and luminosity measurements. The two last topics are analyses that searches for beyond Standard Model physics with the ATLAS detector. The first search presented in the thesis is done in a final state with same-sign electron pairs using the data collected at a center of...

  17. Development and evaluation of a biomedical search engine using a predicate-based vector space model.

    Science.gov (United States)

    Kwak, Myungjae; Leroy, Gondy; Martinez, Jesse D; Harwell, Jeffrey

    2013-10-01

    Although biomedical information available in articles and patents is increasing exponentially, we continue to rely on the same information retrieval methods and use very few keywords to search millions of documents. We are developing a fundamentally different approach for finding much more precise and complete information with a single query using predicates instead of keywords for both query and document representation. Predicates are triples that are more complex datastructures than keywords and contain more structured information. To make optimal use of them, we developed a new predicate-based vector space model and query-document similarity function with adjusted tf-idf and boost function. Using a test bed of 107,367 PubMed abstracts, we evaluated the first essential function: retrieving information. Cancer researchers provided 20 realistic queries, for which the top 15 abstracts were retrieved using a predicate-based (new) and keyword-based (baseline) approach. Each abstract was evaluated, double-blind, by cancer researchers on a 0-5 point scale to calculate precision (0 versus higher) and relevance (0-5 score). Precision was significantly higher (psearching than keywords, laying the foundation for rich and sophisticated information search. Copyright © 2013 Elsevier Inc. All rights reserved.

  18. Recurrent neural network-based modeling of gene regulatory network using elephant swarm water search algorithm.

    Science.gov (United States)

    Mandal, Sudip; Saha, Goutam; Pal, Rajat Kumar

    2017-08-01

    Correct inference of genetic regulations inside a cell from the biological database like time series microarray data is one of the greatest challenges in post genomic era for biologists and researchers. Recurrent Neural Network (RNN) is one of the most popular and simple approach to model the dynamics as well as to infer correct dependencies among genes. Inspired by the behavior of social elephants, we propose a new metaheuristic namely Elephant Swarm Water Search Algorithm (ESWSA) to infer Gene Regulatory Network (GRN). This algorithm is mainly based on the water search strategy of intelligent and social elephants during drought, utilizing the different types of communication techniques. Initially, the algorithm is tested against benchmark small and medium scale artificial genetic networks without and with presence of different noise levels and the efficiency was observed in term of parametric error, minimum fitness value, execution time, accuracy of prediction of true regulation, etc. Next, the proposed algorithm is tested against the real time gene expression data of Escherichia Coli SOS Network and results were also compared with others state of the art optimization methods. The experimental results suggest that ESWSA is very efficient for GRN inference problem and performs better than other methods in many ways.

  19. Search for standard model Higgs bosons produced in association with W bosons.

    Science.gov (United States)

    Aaltonen, T; Adelman, J; Akimoto, T; Albrow, M G; González, B Alvarez; Amerio, S; Amidei, D; Anastassov, A; Annovi, A; Antos, J; Aoki, M; Apollinari, G; Apresyan, A; Arisawa, T; Artikov, A; Ashmanskas, W; Attal, A; Aurisano, A; Azfar, F; Azzi-Bacchetta, P; Azzurri, P; Bacchetta, N; Badgett, W; Barbaro-Galtieri, A; Barnes, V E; Barnett, B A; Baroiant, S; Bartsch, V; Bauer, G; Beauchemin, P-H; Bedeschi, F; Bednar, P; Behari, S; Bellettini, G; Bellinger, J; Belloni, A; Benjamin, D; Beretvas, A; Beringer, J; Berry, T; Bhatti, A; Binkley, M; Bisello, D; Bizjak, I; Blair, R E; Blocker, C; Blumenfeld, B; Bocci, A; Bodek, A; Boisvert, V; Bolla, G; Bolshov, A; Bortoletto, D; Boudreau, J; Boveia, A; Brau, B; Bridgeman, A; Brigliadori, L; Bromberg, C; Brubaker, E; Budagov, J; Budd, H S; Budd, S; Burkett, K; Busetto, G; Bussey, P; Buzatu, A; Byrum, K L; Cabrera, S; Campanelli, M; Campbell, M; Canelli, F; Canepa, A; Carlsmith, D; Carosi, R; Carrillo, S; Carron, S; Casal, B; Casarsa, M; Castro, A; Catastini, P; Cauz, D; Cavalli-Sforza, M; Cerri, A; Cerrito, L; Chang, S H; Chen, Y C; Chertok, M; Chiarelli, G; Chlachidze, G; Chlebana, F; Cho, K; Chokheli, D; Chou, J P; Choudalakis, G; Chuang, S H; Chung, K; Chung, W H; Chung, Y S; Ciobanu, C I; Ciocci, M A; Clark, A; Clark, D; Compostella, G; Convery, M E; Conway, J; Cooper, B; Copic, K; Cordelli, M; Cortiana, G; Crescioli, F; Almenar, C Cuenca; Cuevas, J; Culbertson, R; Cully, J C; Dagenhart, D; Datta, M; Davies, T; de Barbaro, P; De Cecco, S; Deisher, A; De Lentdecker, G; De Lorenzo, G; Dell'Orso, M; Demortier, L; Deng, J; Deninno, M; De Pedis, D; Derwent, P F; Di Giovanni, G P; Dionisi, C; Di Ruzza, B; Dittmann, J R; D'Onofrio, M; Donati, S; Dong, P; Donini, J; Dorigo, T; Dube, S; Efron, J; Erbacher, R; Errede, D; Errede, S; Eusebi, R; Fang, H C; Farrington, S; Fedorko, W T; Feild, R G; Feindt, M; Fernandez, J P; Ferrazza, C; Field, R; Flanagan, G; Forrest, R; Forrester, S; Franklin, M; Freeman, J C; Furic, I; Gallinaro, M; Galyardt, J; Garberson, F; Garcia, J E; Garfinkel, A F; Gerberich, H; Gerdes, D; Giagu, S; Giakoumopolou, V; Giannetti, P; Gibson, K; Gimmell, J L; Ginsburg, C M; Giokaris, N; Giordani, M; Giromini, P; Giunta, M; Glagolev, V; Glenzinski, D; Gold, M; Goldschmidt, N; Golossanov, A; Gomez, G; Gomez-Ceballos, G; Goncharov, M; González, O; Gorelov, I; Goshaw, A T; Goulianos, K; Gresele, A; Grinstein, S; Grosso-Pilcher, C; Grundler, U; Guimaraes da Costa, J; Gunay-Unalan, Z; Haber, C; Hahn, K; Hahn, S R; Halkiadakis, E; Hamilton, A; Han, B-Y; Han, J Y; Handler, R; Happacher, F; Hara, K; Hare, D; Hare, M; Harper, S; Harr, R F; Harris, R M; Hartz, M; Hatakeyama, K; Hauser, J; Hays, C; Heck, M; Heijboer, A; Heinemann, B; Heinrich, J; Henderson, C; Herndon, M; Heuser, J; Hewamanage, S; Hidas, D; Hill, C S; Hirschbuehl, D; Hocker, A; Hou, S; Houlden, M; Hsu, S-C; Huffman, B T; Hughes, R E; Husemann, U; Huston, J; Incandela, J; Introzzi, G; Iori, M; Ivanov, A; Iyutin, B; James, E; Jayatilaka, B; Jeans, D; Jeon, E J; Jindariani, S; Johnson, W; Jones, M; Joo, K K; Jun, S Y; Jung, J E; Junk, T R; Kamon, T; Kar, D; Karchin, P E; Kato, Y; Kephart, R; Kerzel, U; Khotilovich, V; Kilminster, B; Kim, D H; Kim, H S; Kim, J E; Kim, M J; Kim, S B; Kim, S H; Kim, Y K; Kimura, N; Kirsch, L; Klimenko, S; Klute, M; Knuteson, B; Ko, B R; Koay, S A; Kondo, K; Kong, D J; Konigsberg, J; Korytov, A; Kotwal, A V; Kraus, J; Kreps, M; Kroll, J; Krumnack, N; Kruse, M; Krutelyov, V; Kubo, T; Kuhlmann, S E; Kuhr, T; Kulkarni, N P; Kusakabe, Y; Kwang, S; Laasanen, A T; Lai, S; Lami, S; Lammel, S; Lancaster, M; Lander, R L; Lannon, K; Lath, A; Latino, G; Lazzizzera, I; LeCompte, T; Lee, J; Lee, J; Lee, Y J; Lee, S W; Lefèvre, R; Leonardo, N; Leone, S; Levy, S; Lewis, J D; Lin, C; Lin, C S; Linacre, J; Lindgren, M; Lipeles, E; Lister, A; Litvintsev, D O; Liu, T; Lockyer, N S; Loginov, A; Loreti, M; Lovas, L; Lu, R-S; Lucchesi, D; Lueck, J; Luci, C; Lujan, P; Lukens, P; Lungu, G; Lyons, L; Lys, J; Lysak, R; Lytken, E; Mack, P; MacQueen, D; Madrak, R; Maeshima, K; Makhoul, K; Maki, T; Maksimovic, P; Malde, S; Malik, S; Manca, G; Manousakis, A; Margaroli, F; Marino, C; Marino, C P; Martin, A; Martin, M; Martin, V; Martínez, M; Martínez-Ballarín, R; Maruyama, T; Mastrandrea, P; Masubuchi, T; Mattson, M E; Mazzanti, P; McFarland, K S; McIntyre, P; McNulty, R; Mehta, A; Mehtala, P; Menzemer, S; Menzione, A; Merkel, P; Mesropian, C; Messina, A; Miao, T; Miladinovic, N; Miles, J; Miller, R; Mills, C; Milnik, M; Mitra, A; Mitselmakher, G; Miyake, H; Moed, S; Moggi, N; Moon, C S; Moore, R; Morello, M; Fernandez, P Movilla; Mülmenstädt, J; Mukherjee, A; Muller, Th; Mumford, R; Murat, P; Mussini, M; Nachtman, J; Nagai, Y; Nagano, A; Naganoma, J; Nakamura, K; Nakano, I; Napier, A; Necula, V; Neu, C; Neubauer, M S; Nielsen, J; Nodulman, L; Norman, M; Norniella, O; Nurse, E; Oh, S H; Oh, Y D; Oksuzian, I; Okusawa, T; Oldeman, R; Orava, R; Osterberg, K; Griso, S Pagan; Pagliarone, C; Palencia, E; Papadimitriou, V; Papaikonomou, A; Paramonov, A A; Parks, B; Pashapour, S; Patrick, J; Pauletta, G; Paulini, M; Paus, C; Pellett, D E; Penzo, A; Phillips, T J; Piacentino, G; Piedra, J; Pinera, L; Pitts, K; Plager, C; Pondrom, L; Portell, X; Poukhov, O; Pounder, N; Prakoshyn, F; Pronko, A; Proudfoot, J; Ptohos, F; Punzi, G; Pursley, J; Rademacker, J; Rahaman, A; Ramakrishnan, V; Ranjan, N; Redondo, I; Reisert, B; Rekovic, V; Renton, P; Rescigno, M; Richter, S; Rimondi, F; Ristori, L; Robson, A; Rodrigo, T; Rogers, E; Rolli, S; Roser, R; Rossi, M; Rossin, R; Roy, P; Ruiz, A; Russ, J; Rusu, V; Saarikko, H; Safonov, A; Sakumoto, W K; Salamanna, G; Saltó, O; Santi, L; Sarkar, S; Sartori, L; Sato, K; Savoy-Navarro, A; Scheidle, T; Schlabach, P; Schmidt, E E; Schmidt, M A; Schmidt, M P; Schmitt, M; Schwarz, T; Scodellaro, L; Scott, A L; Scribano, A; Scuri, F; Sedov, A; Seidel, S; Seiya, Y; Semenov, A; Sexton-Kennedy, L; Sfyria, A; Shalhout, S Z; Shapiro, M D; Shears, T; Shepard, P F; Sherman, D; Shimojima, M; Shochet, M; Shon, Y; Shreyber, I; Sidoti, A; Siegrist, J; Sinervo, P; Sisakyan, A; Slaughter, A J; Slaunwhite, J; Sliwa, K; Smith, J R; Snider, F D; Snihur, R; Soderberg, M; Soha, A; Somalwar, S; Sorin, V; Spalding, J; Spinella, F; Spreitzer, T; Squillacioti, P; Stanitzki, M; St Denis, R; Stelzer, B; Stelzer-Chilton, O; Stentz, D; Strologas, J; Stuart, D; Suh, J S; Sukhanov, A; Sun, H; Suslov, I; Suzuki, T; Taffard, A; Takashima, R; Takeuchi, Y; Tanaka, R; Tecchio, M; Teng, P K; Terashi, K; Thom, J; Thompson, A S; Thompson, G A; Thomson, E; Tipton, P; Tiwari, V; Tkaczyk, S; Toback, D; Tokar, S; Tollefson, K; Tomura, T; Tonelli, D; Torre, S; Torretta, D; Tourneur, S; Trischuk, W; Tu, Y; Turini, N; Ukegawa, F; Uozumi, S; Vallecorsa, S; van Remortel, N; Varganov, A; Vataga, E; Vázquez, F; Velev, G; Vellidis, C; Veszpremi, V; Vidal, M; Vidal, R; Vila, I; Vilar, R; Vine, T; Vogel, M; Volobouev, I; Volpi, G; Würthwein, F; Wagner, P; Wagner, R G; Wagner, R L; Wagner-Kuhr, J; Wagner, W; Wakisaka, T; Wallny, R; Wang, S M; Warburton, A; Waters, D; Weinberger, M; Wester, W C; Whitehouse, B; Whiteson, D; Wicklund, A B; Wicklund, E; Williams, G; Williams, H H; Wilson, P; Winer, B L; Wittich, P; Wolbers, S; Wolfe, C; Wright, T; Wu, X; Wynne, S M; Yagil, A; Yamamoto, K; Yamaoka, J; Yamashita, T; Yang, C; Yang, U K; Yang, Y C; Yao, W M; Yeh, G P; Yoh, J; Yorita, K; Yoshida, T; Yu, G B; Yu, I; Yu, S S; Yun, J C; Zanello, L; Zanetti, A; Zaw, I; Zhang, X; Zheng, Y; Zucchelli, S; Group, R C

    2008-02-01

    We report on the results of a search for standard model Higgs bosons produced in association with W bosons from pp[over] collisions at sqrt[s]=1.96 TeV. The search uses a data sample corresponding to approximately 1 fb(-1) of integrated luminosity. Events consistent with the W-->lnu and H-->bb[over] signature are selected by triggering on a high-p(T) electron or muon candidate and tagging one or two of the jet candidates as having originated from b quarks. A neural network filter rejects a fraction of tagged charm and light-flavor jets, increasing the b-jet purity in the sample. We observe no excess lnubb[over] production beyond the background expectation, and we set 95% confidence level upper limits on the production cross section times branching fraction sigma(pp[over]-->WH)Br(H-->bb[over]) ranging from 3.9 to 1.3 pb, for specific Higgs boson mass hypotheses in the range 110 to 150 GeV/c2, respectively.

  20. Search for SUSY in gauge mediated and anomaly mediated supersymmetry breaking models

    International Nuclear Information System (INIS)

    Nunnnemann, Thomas

    2004-01-01

    In this note, recent results on the search for Gauge Mediated Supersymmetry Breaking (GMSB) and Anomaly Mediated Supersymmetry Breaking (AMSB) at the LEP and Tevatron colliders are summarized. We report on DOe's search for GMSB in di-photon events with large missing transverse energy and discuss the sensitivity of similar searches based on future Tevatron integrated luminosities. (orig.)

  1. Multiplicity of Mathematical Modeling Strategies to Search for Molecular and Cellular Insights into Bacteria Lung Infection.

    Science.gov (United States)

    Cantone, Martina; Santos, Guido; Wentker, Pia; Lai, Xin; Vera, Julio

    2017-01-01

    Even today two bacterial lung infections, namely pneumonia and tuberculosis, are among the 10 most frequent causes of death worldwide. These infections still lack effective treatments in many developing countries and in immunocompromised populations like infants, elderly people and transplanted patients. The interaction between bacteria and the host is a complex system of interlinked intercellular and the intracellular processes, enriched in regulatory structures like positive and negative feedback loops. Severe pathological condition can emerge when the immune system of the host fails to neutralize the infection. This failure can result in systemic spreading of pathogens or overwhelming immune response followed by a systemic inflammatory response. Mathematical modeling is a promising tool to dissect the complexity underlying pathogenesis of bacterial lung infection at the molecular, cellular and tissue levels, and also at the interfaces among levels. In this article, we introduce mathematical and computational modeling frameworks that can be used for investigating molecular and cellular mechanisms underlying bacterial lung infection. Then, we compile and discuss published results on the modeling of regulatory pathways and cell populations relevant for lung infection and inflammation. Finally, we discuss how to make use of this multiplicity of modeling approaches to open new avenues in the search of the molecular and cellular mechanisms underlying bacterial infection in the lung.

  2. Searching for beyond the Standard Model physics using direct and indirect methods at LHCb

    CERN Document Server

    Hall, Samuel C P; Golutvin, Andrey

    It is known that the Standard Model of particle physics is incomplete in its description of nature at a fundamental level. For example, the Standard Model can neither incorporate dark matter nor explain the matter dominated nature of the Universe. This thesis presents three analyses undertaken using data collected by the LHCb detector. Each analysis searches for indications of physics beyond the Standard Model in dierent decays of B mesons, using dierent techniques. Notably, two analyses look for indications of new physics using indirect methods, and one uses a direct approach. The rst analysis shows evidence for the rare decay $B^{+} \\rightarrow D^{+}_{s}\\phi$ with greater than 3 $\\sigma$ signicance; this also constitutes the rst evidence for a fullyhadronic annihilation-type decay of a $B^{+}$ meson. A measurement of the branching fraction of the decay $B^{+} \\rightarrow D^{+}_{s}\\phi$ is seen to be higher than, but still compatible with, Standard Model predictions. The CP-asymmetry of the decay is also ...

  3. SASAgent: an agent based architecture for search, retrieval and composition of scientific models.

    Science.gov (United States)

    Felipe Mendes, Luiz; Silva, Laryssa; Matos, Ely; Braga, Regina; Campos, Fernanda

    2011-07-01

    Scientific computing is a multidisciplinary field that goes beyond the use of computer as machine where researchers write simple texts, presentations or store analysis and results of their experiments. Because of the huge hardware/software resources invested in experiments and simulations, this new approach to scientific computing currently adopted by research groups is well represented by e-Science. This work aims to propose a new architecture based on intelligent agents to search, recover and compose simulation models, generated in the context of research projects related to biological domain. The SASAgent architecture is described as a multi-tier, comprising three main modules, where CelO ontology satisfies requirements put by e-science projects mainly represented by the semantic knowledge base. Preliminary results suggest that the proposed architecture is promising to achieve requirements found in e-Science projects, considering mainly the biological domain. Copyright © 2011 Elsevier Ltd. All rights reserved.

  4. RadioAstron and millimetron space observatories: Multiverse models and the search for life

    Science.gov (United States)

    Kardashev, N. S.

    2017-04-01

    The transition from the radio to the millimeter and submillimeter ranges is very promising for studies of galactic nuclei, as well as detailed studies of processes related to supermassive black holes, wormholes, and possible manifestations of multi-element Universe (Multiverse) models. This is shown by observations with the largest interferometer available—RadioAstron observatory—that will be used for the scientific program forMillimetron observatory. Observations have also shown the promise of this range for studies of the formation and evolution of planetary systems and searches for manifestations of intelligent life. This is caused by the requirements to use a large amount of condensedmatter and energy in large-scale technological activities. This range can also be used efficiently in the organisation of optimal channels for the transmission of information.

  5. The Security Aspect of Turkey-United States Relations: In Search For a New Model

    Directory of Open Access Journals (Sweden)

    Irina A. Svistunova

    2016-01-01

    Full Text Available Security cooperation has always been an important aspect of the relations between Turkey and the USA. In Cold War era Turkish-American interaction within NATO played a crucial role in this cooperation. After that period the two countries began to search for a new model of their relations. Both Turkey and the USA started to use cooperation within NATO for the purpose of strengthening their global positions. At the same time the USA aspiration to use military bases in Turkey beyond NATO obligations frequently becomes a source of disagreement and crises in the relations of the two countries as it happened during the American intervention to Iraq in 2003. At present new challenges for regional security, especially in the Middle East, demands new forms of interaction between Turkey and the USA. The beginning of "the Arab spring" was met in Ankara and Washington with overlapping interest in changing conservative regimes and promoting "Turkish model". At the same time such questions as participation of Turkey in the fight against ISIL and the USA military cooperation with the Syrian Kurds, whom Ankara considers to be connected with the PKK terrorist organization, has brought serious contradictions between the two countries. The cause of these contradiction is the difference in the perception of threats in Turkey and in the Western countries. While the search for new forms of security cooperation meets with difficulties, NATO remains important for the relations between Turkey and the USA, despite traditionally high level of anti-NATO moods in the Turkish society.

  6. Dark Matter Benchmark Models for Early LHC Run-2 Searches: Report of the ATLAS/CMS Dark Matter Forum

    CERN Document Server

    Abercrombie, Daniel; Akilli, Ece; Alcaraz Maestre, Juan; Allen, Brandon; Alvarez Gonzalez, Barbara; Andrea, Jeremy; Arbey, Alexandre; Azuelos, Georges; Azzi, Patrizia; Backovic, Mihailo; Bai, Yang; Banerjee, Swagato; Beacham, James; Belyaev, Alexander; Boveia, Antonio; Brennan, Amelia Jean; Buchmueller, Oliver; Buckley, Matthew R.; Busoni, Giorgio; Buttignol, Michael; Cacciapaglia, Giacomo; Caputo, Regina; Carpenter, Linda; Filipe Castro, Nuno; Gomez Ceballos, Guillelmo; Cheng, Yangyang; Chou, John Paul; Cortes Gonzalez, Arely; Cowden, Chris; D'Eramo, Francesco; De Cosa, Annapaola; De Gruttola, Michele; De Roeck, Albert; De Simone, Andrea; Deandrea, Aldo; Demiragli, Zeynep; DiFranzo, Anthony; Doglioni, Caterina; du Pree, Tristan; Erbacher, Robin; Erdmann, Johannes; Fischer, Cora; Flaecher, Henning; Fox, Patrick J.; Fuks, Benjamin; Genest, Marie-Helene; Gomber, Bhawna; Goudelis, Andreas; Gramling, Johanna; Gunion, John; Hahn, Kristian; Haisch, Ulrich; Harnik, Roni; Harris, Philip C.; Hoepfner, Kerstin; Hoh, Siew Yan; Hsu, Dylan George; Hsu, Shih-Chieh; Iiyama, Yutaro; Ippolito, Valerio; Jacques, Thomas; Ju, Xiangyang; Kahlhoefer, Felix; Kalogeropoulos, Alexis; Kaplan, Laser Seymour; Kashif, Lashkar; Khoze, Valentin V.; Khurana, Raman; Kotov, Khristian; Kovalskyi, Dmytro; Kulkarni, Suchita; Kunori, Shuichi; Kutzner, Viktor; Lee, Hyun Min; Lee, Sung-Won; Liew, Seng Pei; Lin, Tongyan; Lowette, Steven; Madar, Romain; Malik, Sarah; Maltoni, Fabio; Martinez Perez, Mario; Mattelaer, Olivier; Mawatari, Kentarou; McCabe, Christopher; Megy, Theo; Morgante, Enrico; Mrenna, Stephen; Narayanan, Siddharth M.; Nelson, Andy; Novaes, Sergio F.; Padeken, Klaas Ole; Pani, Priscilla; Papucci, Michele; Paulini, Manfred; Paus, Christoph; Pazzini, Jacopo; Penning, Bjorn; Peskin, Michael E.; Pinna, Deborah; Procura, Massimiliano; Qazi, Shamona F.; Racco, Davide; Re, Emanuele; Riotto, Antonio; Rizzo, Thomas G.; Roehrig, Rainer; Salek, David; Sanchez Pineda, Arturo; Sarkar, Subir; Schmidt, Alexander; Schramm, Steven Randolph; Shepherd, William; Singh, Gurpreet; Soffi, Livia; Srimanobhas, Norraphat; Sung, Kevin; Tait, Tim M.P.; Theveneaux-Pelzer, Timothee; Thomas, Marc; Tosi, Mia; Trocino, Daniele; Undleeb, Sonaina; Vichi, Alessandro; Wang, Fuquan; Wang, Lian-Tao; Wang, Ren-Jie; Whallon, Nikola; Worm, Steven; Wu, Mengqing; Wu, Sau Lan; Yang, Hongtao; Yang, Yong; Yu, Shin-Shan; Zaldivar, Bryan; Zanetti, Marco; Zhang, Zhiqing; Zucchetta, Alberto

    2015-01-01

    This document is the final report of the ATLAS-CMS Dark Matter Forum, a forum organized by the ATLAS and CMS collaborations with the participation of experts on theories of Dark Matter, to select a minimal basis set of dark matter simplified models that should support the design of the early LHC Run-2 searches. A prioritized, compact set of benchmark models is proposed, accompanied by studies of the parameter space of these models and a repository of generator implementations. This report also addresses how to apply the Effective Field Theory formalism for collider searches and present the results of such interpretations.

  7. Systematizing Web Search through a Meta-Cognitive, Systems-Based, Information Structuring Model (McSIS)

    Science.gov (United States)

    Abuhamdieh, Ayman H.; Harder, Joseph T.

    2015-01-01

    This paper proposes a meta-cognitive, systems-based, information structuring model (McSIS) to systematize online information search behavior based on literature review of information-seeking models. The General Systems Theory's (GST) prepositions serve as its framework. Factors influencing information-seekers, such as the individual learning…

  8. Metadata for 3D Models. How to search in 3D Model repositories?

    OpenAIRE

    Boeykens, Stefan; Bogani, Elena

    2008-01-01

    In architectural education and practice, students, teachers and architects increasingly rely on online repositories with architectural information. This includes product model data, exemplary architectural projects and technical documentation, in a wide variety of formats. Unfortunately, the major part of this architectural content exists in individual repositories and they are not accessible to geographically distributed professionals and students who require them. Some of them are freely ac...

  9. A Hybrid Tabu Search Heuristic for a Bilevel Competitive Facility Location Model

    Science.gov (United States)

    Küçükaydın, Hande; Aras, Necati; Altınel, I. Kuban

    We consider a problem in which a firm or franchise enters a market by locating new facilities where there are existing facilities belonging to a competitor. The firm aims at finding the location and attractiveness of each facility to be opened so as to maximize its profit. The competitor, on the other hand, can react by adjusting the attractiveness of its existing facilities, opening new facilities and/or closing existing ones with the objective of maximizing its own profit. The demand is assumed to be aggregated at certain points in the plane and the facilities of the firm can be located at prespecified candidate sites. We employ Huff's gravity-based rule in modeling the behavior of the customers where the fraction of customers at a demand point that visit a certain facility is proportional to the facility attractiveness and inversely proportional to the distance between the facility site and demand point. We formulate a bilevel mixed-integer nonlinear programming model where the firm entering the market is the leader and the competitor is the follower. In order to find a feasible solution of this model, we develop a hybrid tabu search heuristic which makes use of two exact methods as subroutines: a gradient ascent method and a branch-and-bound algorithm with nonlinear programming relaxation.

  10. A Harmony Search Algorithm for the Reproduction of Experimental Data in the Social Force Model

    Directory of Open Access Journals (Sweden)

    Osama Moh'd Alia

    2014-01-01

    Full Text Available Crowd dynamics is a discipline dealing with the management and flow of crowds in congested places and circumstances. Pedestrian congestion is a pressing issue where crowd dynamics models can be applied. The reproduction of experimental data (velocity-density relation and specific flow rate is a major component for the validation and calibration of such models. In the social force model, researchers have proposed various techniques to adjust essential parameters governing the repulsive social force, which is an effort at reproducing such experimental data. Despite that and various other efforts, the optimal reproduction of the real life data is unachievable. In this paper, a harmony search-based technique called HS-SFM is proposed to overcome the difficulties of the calibration process for SFM, where the fundamental diagram of velocity-density relation and the specific flow rate are reproduced in conformance with the related empirical data. The improvisation process of HS is modified by incorporating the global best particle concept from particle swarm optimization (PSO to increase the convergence rate and overcome the high computational demands of HS-SFM. Simulation results have shown HS-FSM’s ability to produce near optimal SFM parameter values, which makes it possible for SFM to almost reproduce the related empirical data.

  11. Networking in autism: leveraging genetic, biomarker and model system findings in the search for new treatments.

    Science.gov (United States)

    Veenstra-VanderWeele, Jeremy; Blakely, Randy D

    2012-01-01

    Autism Spectrum Disorder (ASD) is a common neurodevelopmental disorder affecting approximately 1% of children. ASD is defined by core symptoms in two domains: negative symptoms of impairment in social and communication function, and positive symptoms of restricted and repetitive behaviors. Available treatments are inadequate for treating both core symptoms and associated conditions. Twin studies indicate that ASD susceptibility has a large heritable component. Genetic studies have identified promising leads, with converging insights emerging from single-gene disorders that bear ASD features, with particular interest in mammalian target of rapamycin (mTOR)-linked synaptic plasticity mechanisms. Mouse models of these disorders are revealing not only opportunities to model behavioral perturbations across species, but also evidence of postnatal rescue of brain and behavioral phenotypes. An intense search for ASD biomarkers has consistently pointed to elevated platelet serotonin (5-HT) levels and a surge in brain growth in the first 2 years of life. Following a review of the diversity of ASD phenotypes and its genetic origins and biomarkers, we discuss opportunities for translation of these findings into novel ASD treatments, focusing on mTor- and 5-HT-signaling pathways, and their possible intersection. Paralleling the progress made in understanding the root causes of rare genetic syndromes that affect cognitive development, we anticipate progress in models systems using bona fide ASD-associated molecular changes that have the potential to accelerate the development of ASD diagnostics and therapeutics.

  12. Estimating bat and bird mortality occurring at wind energy turbines from covariates and carcass searches using mixture models.

    Science.gov (United States)

    Korner-Nievergelt, Fränzi; Brinkmann, Robert; Niermann, Ivo; Behr, Oliver

    2013-01-01

    Environmental impacts of wind energy facilities increasingly cause concern, a central issue being bats and birds killed by rotor blades. Two approaches have been employed to assess collision rates: carcass searches and surveys of animals prone to collisions. Carcass searches can provide an estimate for the actual number of animals being killed but they offer little information on the relation between collision rates and, for example, weather parameters due to the time of death not being precisely known. In contrast, a density index of animals exposed to collision is sufficient to analyse the parameters influencing the collision rate. However, quantification of the collision rate from animal density indices (e.g. acoustic bat activity or bird migration traffic rates) remains difficult. We combine carcass search data with animal density indices in a mixture model to investigate collision rates. In a simulation study we show that the collision rates estimated by our model were at least as precise as conventional estimates based solely on carcass search data. Furthermore, if certain conditions are met, the model can be used to predict the collision rate from density indices alone, without data from carcass searches. This can reduce the time and effort required to estimate collision rates. We applied the model to bat carcass search data obtained at 30 wind turbines in 15 wind facilities in Germany. We used acoustic bat activity and wind speed as predictors for the collision rate. The model estimates correlated well with conventional estimators. Our model can be used to predict the average collision rate. It enables an analysis of the effect of parameters such as rotor diameter or turbine type on the collision rate. The model can also be used in turbine-specific curtailment algorithms that predict the collision rate and reduce this rate with a minimal loss of energy production.

  13. Estimating bat and bird mortality occurring at wind energy turbines from covariates and carcass searches using mixture models.

    Directory of Open Access Journals (Sweden)

    Fränzi Korner-Nievergelt

    Full Text Available Environmental impacts of wind energy facilities increasingly cause concern, a central issue being bats and birds killed by rotor blades. Two approaches have been employed to assess collision rates: carcass searches and surveys of animals prone to collisions. Carcass searches can provide an estimate for the actual number of animals being killed but they offer little information on the relation between collision rates and, for example, weather parameters due to the time of death not being precisely known. In contrast, a density index of animals exposed to collision is sufficient to analyse the parameters influencing the collision rate. However, quantification of the collision rate from animal density indices (e.g. acoustic bat activity or bird migration traffic rates remains difficult. We combine carcass search data with animal density indices in a mixture model to investigate collision rates. In a simulation study we show that the collision rates estimated by our model were at least as precise as conventional estimates based solely on carcass search data. Furthermore, if certain conditions are met, the model can be used to predict the collision rate from density indices alone, without data from carcass searches. This can reduce the time and effort required to estimate collision rates. We applied the model to bat carcass search data obtained at 30 wind turbines in 15 wind facilities in Germany. We used acoustic bat activity and wind speed as predictors for the collision rate. The model estimates correlated well with conventional estimators. Our model can be used to predict the average collision rate. It enables an analysis of the effect of parameters such as rotor diameter or turbine type on the collision rate. The model can also be used in turbine-specific curtailment algorithms that predict the collision rate and reduce this rate with a minimal loss of energy production.

  14. A Hybrid Seasonal Mechanism with a Chaotic Cuckoo Search Algorithm with a Support Vector Regression Model for Electric Load Forecasting

    Directory of Open Access Journals (Sweden)

    Yongquan Dong

    2018-04-01

    Full Text Available Providing accurate electric load forecasting results plays a crucial role in daily energy management of the power supply system. Due to superior forecasting performance, the hybridizing support vector regression (SVR model with evolutionary algorithms has received attention and deserves to continue being explored widely. The cuckoo search (CS algorithm has the potential to contribute more satisfactory electric load forecasting results. However, the original CS algorithm suffers from its inherent drawbacks, such as parameters that require accurate setting, loss of population diversity, and easy trapping in local optima (i.e., premature convergence. Therefore, proposing some critical improvement mechanisms and employing an improved CS algorithm to determine suitable parameter combinations for an SVR model is essential. This paper proposes the SVR with chaotic cuckoo search (SVRCCS model based on using a tent chaotic mapping function to enrich the cuckoo search space and diversify the population to avoid trapping in local optima. In addition, to deal with the cyclic nature of electric loads, a seasonal mechanism is combined with the SVRCCS model, namely giving a seasonal SVR with chaotic cuckoo search (SSVRCCS model, to produce more accurate forecasting performances. The numerical results, tested by using the datasets from the National Electricity Market (NEM, Queensland, Australia and the New York Independent System Operator (NYISO, NY, USA, show that the proposed SSVRCCS model outperforms other alternative models.

  15. A quasi-model-independent search for new high pT physics at D0

    Energy Technology Data Exchange (ETDEWEB)

    Knuteson, Bruce Owen [Univ. of California, Berkeley, CA (United States)

    2000-12-05

    We present a new quasi-model-independent strategy (''Sleuth'') for searching for physics beyond the standard model. We define final states to be studied, and construct a rule that identifies a set of relevant variables for any particular final state. A novel algorithm searches for regions of excess in those variables and quantifies the significance of any detected excess. This strategy is applied to search for new high pT physics in approximately 100 pb-1 of proton-anti-proton collisions a √s = 1.8 TeV collected by the D0 experiment during 1992-1996 at the Fermilab Tevatron. We systematically analyze many exclusive final states, and demonstrate sensitivity to a variety of models predicting new phenomena at the electroweak scale. No evidence of new high pT physics is observed.

  16. Generalized Information Theory Meets Human Cognition: Introducing a Unified Framework to Model Uncertainty and Information Search.

    Science.gov (United States)

    Crupi, Vincenzo; Nelson, Jonathan D; Meder, Björn; Cevolani, Gustavo; Tentori, Katya

    2018-06-17

    Searching for information is critical in many situations. In medicine, for instance, careful choice of a diagnostic test can help narrow down the range of plausible diseases that the patient might have. In a probabilistic framework, test selection is often modeled by assuming that people's goal is to reduce uncertainty about possible states of the world. In cognitive science, psychology, and medical decision making, Shannon entropy is the most prominent and most widely used model to formalize probabilistic uncertainty and the reduction thereof. However, a variety of alternative entropy metrics (Hartley, Quadratic, Tsallis, Rényi, and more) are popular in the social and the natural sciences, computer science, and philosophy of science. Particular entropy measures have been predominant in particular research areas, and it is often an open issue whether these divergences emerge from different theoretical and practical goals or are merely due to historical accident. Cutting across disciplinary boundaries, we show that several entropy and entropy reduction measures arise as special cases in a unified formalism, the Sharma-Mittal framework. Using mathematical results, computer simulations, and analyses of published behavioral data, we discuss four key questions: How do various entropy models relate to each other? What insights can be obtained by considering diverse entropy models within a unified framework? What is the psychological plausibility of different entropy models? What new questions and insights for research on human information acquisition follow? Our work provides several new pathways for theoretical and empirical research, reconciling apparently conflicting approaches and empirical findings within a comprehensive and unified information-theoretic formalism. Copyright © 2018 Cognitive Science Society, Inc.

  17. How doctors search

    DEFF Research Database (Denmark)

    Lykke, Marianne; Price, Susan; Delcambre, Lois

    2012-01-01

    Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search to co...

  18. submitter Searches at LEP

    CERN Document Server

    Kawagoe, Kiyotomo

    2001-01-01

    Searches for new particles and new physics were extensively performed at LEP. Although no evidence for new particle/physics was discovered, the null results set very stringent limits to theories beyond the standard model. In this paper, searches at LEP and anomalies observed in the searches are presented. Future prospect of searches at the new energy frontier machines is also discussed.

  19. Effect of a Body Model on Performance in a Virtual Environment Search Task

    National Research Council Canada - National Science Library

    Singer, Michael

    1998-01-01

    ...) in training dismounted soldiers. This experiment investigated full body representation (generic) versus a hand linked pointer on movement performance in an office building interior during a search task...

  20. Search for beyond standard model physics (non-SUSY) in final states with photons at the Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    Palencia, Jose Enrique; /Fermilab

    2009-01-01

    We present the results of searches for non-standard model phenomena in photon final states. These searches use data from integrated luminosities of {approx} 1-4 fb{sup -1} of p{bar p} collisions at {radical}s = 1.96 TeV, collected with the CDF and D0 detectors at the Fermilab Tevatron. No significant excess in data has been observed. We report limits on the parameters of several BSM models (excluding SUSY) for events containing photons.

  1. Searching for dark matter signals in the left-right symmetric gauge model with CP symmetry

    International Nuclear Information System (INIS)

    Guo Wanlei; Wu Yueliang; Zhou Yufeng

    2010-01-01

    We investigate the singlet scalar dark matter (DM) candidate in a left-right symmetric gauge model with two Higgs bidoublets in which the stabilization of the DM particle is induced by the discrete symmetries P and CP. According to the observed DM abundance, we predict the DM direct and indirect detection cross sections for the DM mass range from 10 to 500 GeV. We show that the DM indirect detection cross section is not sensitive to the light Higgs mixing and Yukawa couplings except for the resonance regions. The predicted spin-independent DM-nucleon elastic scattering cross section is found to be significantly dependent on the above two factors. Our results show that the future DM direct search experiments can cover the most parts of the allowed parameter space. The PAMELA antiproton data can only exclude two very narrow regions in the two Higgs bidoublets model. It is very difficult to detect the DM direct or indirect signals in the resonance regions due to the Breit-Wigner resonance effect.

  2. Search for the Standard Model Higgs Boson in associated production with w boson at the Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    Chun, Xu [Univ. of Michigan, Ann Arbor, MI (United States)

    2009-11-01

    A search for the Standard Model Higgs boson in proton-antiproton collisions with center-of-mass energy 1.96 TeV at the Tevatron is presented in this dissertation. The process of interest is the associated production of W boson and Higgs boson, with the W boson decaying leptonically and the Higgs boson decaying into a pair of bottom quarks. The dataset in the analysis is accumulated by the D0 detector from April 2002 to April 2008 and corresponding to an integrated luminosity of 2.7 fb-1. The events are reconstructed and selected following the criteria of an isolated lepton, missing transverse energy and two jets. The D0 Neural Network b-jet identification algorithm is further used to discriminate b jets from light jets. A multivariate analysis combining Matrix Element and Neural Network methods is explored to improve the Higgs boson signal significance. No evidence of the Higgs boson is observed in this analysis. In consequence, an observed (expected) limit on the ratio of σ (p$\\bar{p}$ → WH) x Br (H → b$\\bar{b}$) to the Standard Model prediction is set to be 6.7 (6.4) at 95% C.L. for the Higgs boson with a mass of 115 GeV.

  3. In Search of the Nordic Working Life Model; Introduction to the Thematic Issue

    Directory of Open Access Journals (Sweden)

    Antti Kasvio

    2012-11-01

    Full Text Available The theme of this issue is “in search of the Nordic working life model.” The main reason for choosing this theme is related to the widespread observation that several features of the Nordic institutions of work have been considered atypical when compared with those prevailing in other advanced industrial societies. We are not, of course, the first to make such an observation, and much effort has been spent in order to sort out what we actually talk about when we apply a term like the Nordic model. However, in spite of this effort, we are still toiling with the question of what it is that entitles us to talk about a specific order. Furthermore, if it really exists, will it be able to survive in the face of far-reaching changes that may be expected to take place in the coming decades? On what kinds of resources may it be based in the future? In the following, we will present some speculations upon such questions while distinguishing between qualities at the societal and organizational level. This may, of course, be considered an artificial differentiation since organizations are a part of society. Nonetheless, we choose to apply this distinction based on analytical reasons. In this way we hope to better illustrate how these entities are linked together in a mutual relationship, thus contributing both to stability and to change. At the end of the introduction, we will give a brief orientation of the content of this issue (...

  4. Modeling Search Behaviors during the Acquisition of Expertise in a Sequential Decision-Making Task

    Directory of Open Access Journals (Sweden)

    Cristóbal Moënne-Loccoz

    2017-09-01

    Full Text Available Our daily interaction with the world is plagued of situations in which we develop expertise through self-motivated repetition of the same task. In many of these interactions, and especially when dealing with computer and machine interfaces, we must deal with sequences of decisions and actions. For instance, when drawing cash from an ATM machine, choices are presented in a step-by-step fashion and a specific sequence of choices must be performed in order to produce the expected outcome. But, as we become experts in the use of such interfaces, is it possible to identify specific search and learning strategies? And if so, can we use this information to predict future actions? In addition to better understanding the cognitive processes underlying sequential decision making, this could allow building adaptive interfaces that can facilitate interaction at different moments of the learning curve. Here we tackle the question of modeling sequential decision-making behavior in a simple human-computer interface that instantiates a 4-level binary decision tree (BDT task. We record behavioral data from voluntary participants while they attempt to solve the task. Using a Hidden Markov Model-based approach that capitalizes on the hierarchical structure of behavior, we then model their performance during the interaction. Our results show that partitioning the problem space into a small set of hierarchically related stereotyped strategies can potentially capture a host of individual decision making policies. This allows us to follow how participants learn and develop expertise in the use of the interface. Moreover, using a Mixture of Experts based on these stereotyped strategies, the model is able to predict the behavior of participants that master the task.

  5. Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization.

    Science.gov (United States)

    Akhtar, Mahmuda; Hannan, M A; Begum, R A; Basri, Hassan; Scavino, Edgar

    2017-03-01

    Waste collection is an important part of waste management that involves different issues, including environmental, economic, and social, among others. Waste collection optimization can reduce the waste collection budget and environmental emissions by reducing the collection route distance. This paper presents a modified Backtracking Search Algorithm (BSA) in capacitated vehicle routing problem (CVRP) models with the smart bin concept to find the best optimized waste collection route solutions. The objective function minimizes the sum of the waste collection route distances. The study introduces the concept of the threshold waste level (TWL) of waste bins to reduce the number of bins to be emptied by finding an optimal range, thus minimizing the distance. A scheduling model is also introduced to compare the feasibility of the proposed model with that of the conventional collection system in terms of travel distance, collected waste, fuel consumption, fuel cost, efficiency and CO 2 emission. The optimal TWL was found to be between 70% and 75% of the fill level of waste collection nodes and had the maximum tightness value for different problem cases. The obtained results for four days show a 36.80% distance reduction for 91.40% of the total waste collection, which eventually increases the average waste collection efficiency by 36.78% and reduces the fuel consumption, fuel cost and CO 2 emission by 50%, 47.77% and 44.68%, respectively. Thus, the proposed optimization model can be considered a viable tool for optimizing waste collection routes to reduce economic costs and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

  6. Finite frequency shear wave splitting tomography: a model space search approach

    Science.gov (United States)

    Mondal, P.; Long, M. D.

    2017-12-01

    Observations of seismic anisotropy provide key constraints on past and present mantle deformation. A common method for upper mantle anisotropy is to measure shear wave splitting parameters (delay time and fast direction). However, the interpretation is not straightforward, because splitting measurements represent an integration of structure along the ray path. A tomographic approach that allows for localization of anisotropy is desirable; however, tomographic inversion for anisotropic structure is a daunting task, since 21 parameters are needed to describe general anisotropy. Such a large parameter space does not allow a straightforward application of tomographic inversion. Building on previous work on finite frequency shear wave splitting tomography, this study aims to develop a framework for SKS splitting tomography with a new parameterization of anisotropy and a model space search approach. We reparameterize the full elastic tensor, reducing the number of parameters to three (a measure of strength based on symmetry considerations for olivine, plus the dip and azimuth of the fast symmetry axis). We compute Born-approximation finite frequency sensitivity kernels relating model perturbations to splitting intensity observations. The strong dependence of the sensitivity kernels on the starting anisotropic model, and thus the strong non-linearity of the inverse problem, makes a linearized inversion infeasible. Therefore, we implement a Markov Chain Monte Carlo technique in the inversion procedure. We have performed tests with synthetic data sets to evaluate computational costs and infer the resolving power of our algorithm for synthetic models with multiple anisotropic layers. Our technique can resolve anisotropic parameters on length scales of ˜50 km for realistic station and event configurations for dense broadband experiments. We are proceeding towards applications to real data sets, with an initial focus on the High Lava Plains of Oregon.

  7. FHSA-SED: Two-Locus Model Detection for Genome-Wide Association Study with Harmony Search Algorithm.

    Directory of Open Access Journals (Sweden)

    Shouheng Tuo

    Full Text Available Two-locus model is a typical significant disease model to be identified in genome-wide association study (GWAS. Due to intensive computational burden and diversity of disease models, existing methods have drawbacks on low detection power, high computation cost, and preference for some types of disease models.In this study, two scoring functions (Bayesian network based K2-score and Gini-score are used for characterizing two SNP locus as a candidate model, the two criteria are adopted simultaneously for improving identification power and tackling the preference problem to disease models. Harmony search algorithm (HSA is improved for quickly finding the most likely candidate models among all two-locus models, in which a local search algorithm with two-dimensional tabu table is presented to avoid repeatedly evaluating some disease models that have strong marginal effect. Finally G-test statistic is used to further test the candidate models.We investigate our method named FHSA-SED on 82 simulated datasets and a real AMD dataset, and compare it with two typical methods (MACOED and CSE which have been developed recently based on swarm intelligent search algorithm. The results of simulation experiments indicate that our method outperforms the two compared algorithms in terms of detection power, computation time, evaluation times, sensitivity (TPR, specificity (SPC, positive predictive value (PPV and accuracy (ACC. Our method has identified two SNPs (rs3775652 and rs10511467 that may be also associated with disease in AMD dataset.

  8. Search for the Standard Model Higgs boson with the Delphi detector at LEP

    Energy Technology Data Exchange (ETDEWEB)

    Jacobsson, R.

    1996-01-01

    A search for the Standard Model Higgs boson has been performed with the data recorded at DELPHI during 1991 and 1992. The detector and the data have been optimally exploited to make a search possible in the most abundant of the usable channels at LEP1; the channel in which the Higgs boson is produced in association with a pair of neutrinos from the decay of the Z{sup 0*}. In order to discriminate against the very large and difficult background a neural network has been used. A very good background rejection and selection efficiency for Higgs particle events have been achieved. Combined with a pre selection and a post selection, all the simulated background was removed with a Higgs boson selection efficiency on the average of about 40% for a H{sup 0} mass of 35-55 GeV/c{sup 2} this corresponds to about 5.5 expected events. No candidate events were observed in the real data. The result was therefore translated into a limit on the mass of the Higgs boson. Requiring a confidence level of 95% yielded a restriction on the mass of the Standard Model Higgs boson of m{sub H}{sup 0}>53.7 GeV/c{sup 2} with the analysis in the neutrino channel alone. The inherent background has been found to be very difficult to separate from the signal in the channels where the Z{sup 0*} decays either into a tau lepton pair or a quark pair. Therefore, in addition to the analysis above, only the channels where the H{sup 0} is produced in association with either muons or electrons have been analysed. In total, the three channels constitute only 26% of all the Z{sup 0} decays. Adding the analysis done on the data recorded in 1990 to the above analysis and combining it with a probabilistic analysis in the neutrino channel, an analysis in the muon channel and one in the electron channel further restricts the mass of the Higgs boson to m{sub H=}>55.7 GeV/c{sup 2} at the 95% confidence level. 35 refs.

  9. Search for the Standard Model Higgs boson with the Delphi detector at LEP

    International Nuclear Information System (INIS)

    Jacobsson, R.

    1996-01-01

    A search for the Standard Model Higgs boson has been performed with the data recorded at DELPHI during 1991 and 1992. The detector and the data have been optimally exploited to make a search possible in the most abundant of the usable channels at LEP1; the channel in which the Higgs boson is produced in association with a pair of neutrinos from the decay of the Z 0* . In order to discriminate against the very large and difficult background a neural network has been used. A very good background rejection and selection efficiency for Higgs particle events have been achieved. Combined with a pre selection and a post selection, all the simulated background was removed with a Higgs boson selection efficiency on the average of about 40% for a H 0 mass of 35-55 GeV/c 2 this corresponds to about 5.5 expected events. No candidate events were observed in the real data. The result was therefore translated into a limit on the mass of the Higgs boson. Requiring a confidence level of 95% yielded a restriction on the mass of the Standard Model Higgs boson of m H 0 >53.7 GeV/c 2 with the analysis in the neutrino channel alone. The inherent background has been found to be very difficult to separate from the signal in the channels where the Z 0* decays either into a tau lepton pair or a quark pair. Therefore, in addition to the analysis above, only the channels where the H 0 is produced in association with either muons or electrons have been analysed. In total, the three channels constitute only 26% of all the Z 0 decays. Adding the analysis done on the data recorded in 1990 to the above analysis and combining it with a probabilistic analysis in the neutrino channel, an analysis in the muon channel and one in the electron channel further restricts the mass of the Higgs boson to m H= >55.7 GeV/c 2 at the 95% confidence level. 35 refs

  10. A fault-tolerant small world topology control model in ad hoc networks for search and rescue

    Science.gov (United States)

    Tan, Mian; Fang, Ling; Wu, Yue; Zhang, Bo; Chang, Bowen; Holme, Petter; Zhao, Jing

    2018-02-01

    Due to their self-organized, multi-hop and distributed characteristics, ad hoc networks are useful in search and rescue. Topology control models need to be designed for energy-efficient, robust and fast communication in ad hoc networks. This paper proposes a topology control model which specializes for search and rescue-Compensation Small World-Repeated Game (CSWRG)-which integrates mobility models, constructing small world networks and a game-theoretic approach to the allocation of resources. Simulation results show that our mobility models can enhance the communication performance of the constructed small-world networks. Our strategy, based on repeated game, can suppress selfish behavior and compensate agents that encounter selfish or faulty neighbors. This model could be useful for the design of ad hoc communication networks.

  11. Ordered Consumer Search

    OpenAIRE

    Armstrong, Mark

    2016-01-01

    The paper discusses situations in which consumers search through their options in a deliberate order, in contrast to more familiar models with random search. Topics include: network effects (consumers may be better off following the same search order as other consumers); the use of price and non-price advertising to direct search; the impact of consumers starting a new search with their previous supplier; the incentive sellers have to merge or co-locate with other sellers; and the incentive a...

  12. Search for the Standard Model Higgs boson in the missing energy topology with DØ

    Energy Technology Data Exchange (ETDEWEB)

    Christoudias, Theodoros [Imperial College, London (United Kingdom)

    2009-06-01

    A search for the Standard Model Higgs boson in the missing energy and acoplanar b-jet topology is reported, using an integrated luminosity of 0.93 fb-1 recorded by the D0 detector at the Fermilab Tevatron p$\\bar{p}$ Collider. The analysis includes signal contributions from p$\\bar{p}$ → ZH → v$\\bar{v}$b$\\bar{b}$, as well as from WH production in which the charged lepton from the W boson decay is undetected. Neural networks are used to separate signal from background. In the absence of a signal, limits are set on σ(p$\\bar{p}$ → VH) x B(H → b$\\bar{b}$) at the 95% C.L. of 2.6-2.3 pb, for Higgs boson masses in the range 105-135 GeV, where V = W, Z. The corresponding expected limits range from 2.8 to 2.0 pb. Potential improvements to the analysis with an extended dataset totalling 4 fb-1 are also discussed. Essential maintenance related to the increased luminosity and RunIIb upgrade was carried out on the impact parameter (IP) based b-tagging trigger tool and the effect of the changes on the b-tagger's performance was investigated.

  13. Searching for the true diet of marine predators: incorporating Bayesian priors into stable isotope mixing models.

    Directory of Open Access Journals (Sweden)

    André Chiaradia

    Full Text Available Reconstructing the diet of top marine predators is of great significance in several key areas of applied ecology, requiring accurate estimation of their true diet. However, from conventional stomach content analysis to recent stable isotope and DNA analyses, no one method is bias or error free. Here, we evaluated the accuracy of recent methods to estimate the actual proportion of a controlled diet fed to a top-predator seabird, the Little penguin (Eudyptula minor. We combined published DNA data of penguins scats with blood plasma δ(15N and δ(13C values to reconstruct the diet of individual penguins fed experimentally. Mismatch between controlled (true ingested diet and dietary estimates obtained through the separately use of stable isotope and DNA data suggested some degree of differences in prey assimilation (stable isotope and digestion rates (DNA analysis. In contrast, combined posterior isotope mixing model with DNA Bayesian priors provided the closest match to the true diet. We provided the first evidence suggesting that the combined use of these complementary techniques may provide better estimates of the actual diet of top marine predators- a powerful tool in applied ecology in the search for the true consumed diet.

  14. Complementarity of DM Searches in a Consistent Simplified Model: the Case of Z'

    CERN Document Server

    Jacques, Thomas; Morgante, Enrico; Racco, Davide; Rameez, Mohamed; Riotto, Antonio

    2016-01-01

    We analyze the constraints from direct and indirect detection on fermionic Majorana Dark Matter (DM). Because the interaction with the Standard Model (SM) particles is spin-dependent, a priori the constraints that one gets from neutrino telescopes, the LHC and direct detection experiments are comparable. We study the complementarity of these searches in a particular example, in which a heavy $Z'$ mediates the interactions between the SM and the DM. We find that in most cases IceCube provides the strongest bounds on this scenario, while the LHC constraints are only meaningful for smaller dark matter masses. These light masses are less motivated by thermal relic abundance considerations. We show that the dominant annihilation channels of the light DM in the Sun are either $b \\bar b$ or $t \\bar t$, while the heavy DM annihilation is completely dominated by $Zh$ channel. The latter produces a hard neutrino spectrum which has not been previously analyzed. We study the neutrino spectrum yielded by DM and recast Ice...

  15. Complementarity of DM searches in a consistent simplified model: the case of Z′

    International Nuclear Information System (INIS)

    Jacques, Thomas; Katz, Andrey; Morgante, Enrico; Racco, Davide; Rameez, Mohamed; Riotto, Antonio

    2016-01-01

    We analyze the constraints from direct and indirect detection on fermionic Majorana Dark Matter (DM). Because the interaction with the Standard Model (SM) particles is spin-dependent, a priori the constraints that one gets from neutrino telescopes, the LHC, direct and indirect detection experiments are comparable. We study the complementarity of these searches in a particular example, in which a heavy Z ′ mediates the interactions between the SM and the DM. We find that for heavy dark matter indirect detection provides the strongest bounds on this scenario, while IceCube bounds are typically stronger than those from direct detection. The LHC constraints are dominant for smaller dark matter masses. These light masses are less motivated by thermal relic abundance considerations. We show that the dominant annihilation channels of the light DM in the Sun and the Galactic Center are either bb̄ or tt̄, while the heavy DM annihilation is completely dominated by Zh channel. The latter produces a hard neutrino spectrum which has not been previously analyzed. We study the neutrino spectrum yielded by DM and recast IceCube constraints to allow proper comparison with constraints from direct and indirect detection experiments and LHC exclusions.

  16. MAP: an iterative experimental design methodology for the optimization of catalytic search space structure modeling.

    Science.gov (United States)

    Baumes, Laurent A

    2006-01-01

    One of the main problems in high-throughput research for materials is still the design of experiments. At early stages of discovery programs, purely exploratory methodologies coupled with fast screening tools should be employed. This should lead to opportunities to find unexpected catalytic results and identify the "groups" of catalyst outputs, providing well-defined boundaries for future optimizations. However, very few new papers deal with strategies that guide exploratory studies. Mostly, traditional designs, homogeneous covering, or simple random samplings are exploited. Typical catalytic output distributions exhibit unbalanced datasets for which an efficient learning is hardly carried out, and interesting but rare classes are usually unrecognized. Here is suggested a new iterative algorithm for the characterization of the search space structure, working independently of learning processes. It enhances recognition rates by transferring catalysts to be screened from "performance-stable" space zones to "unsteady" ones which necessitate more experiments to be well-modeled. The evaluation of new algorithm attempts through benchmarks is compulsory due to the lack of past proofs about their efficiency. The method is detailed and thoroughly tested with mathematical functions exhibiting different levels of complexity. The strategy is not only empirically evaluated, the effect or efficiency of sampling on future Machine Learning performances is also quantified. The minimum sample size required by the algorithm for being statistically discriminated from simple random sampling is investigated.

  17. System modelling and online optimal management of MicroGrid using Mesh Adaptive Direct Search

    Energy Technology Data Exchange (ETDEWEB)

    Mohamed, Faisal A. [Department of Electrical Engineering, Omar Al-Mukhtar University, P.O. Box 919, El-Bieda (Libya); Koivo, Heikki N. [Department of Automation and Systems Technology, Helsinki University of Technology, P.O. Box 5500, FIN-02015 HUT (Finland)

    2010-06-15

    This paper presents a generalized formulation to determine the optimal operating strategy and cost optimization scheme for a MicroGrid. Prior to the optimization of the MicroGrid itself, models for the system components are determined using real data. The proposed cost function takes into consideration the costs of the emissions, NO{sub x}, SO{sub 2}, and CO{sub 2}, start-up costs, as well as the operation and maintenance costs. A daily income and outgo from sold or purchased power is also added. The MicroGrid considered in this paper consists of a wind turbine, a micro turbine, a diesel generator, a photovoltaic array, a fuel cell, and a battery storage. In this work, the Mesh Adaptive Direct Search (MADS) algorithm is used to minimize the cost function of the system while constraining it to meet the customer demand and safety of the system. In comparison with previously proposed techniques, a significant reduction is obtained. (author)

  18. Jagiellonian University Searches for the Standard Model Higgs boson decay to $\\tau $ lepton pairs at the CMS experiment

    CERN Document Server

    Pyskir, Andrzej

    2017-01-01

    We present results of searches for the Standard Model Higgs boson decaying to tau lepton pairs at the CMS experiment with data collected during the LHC Run 1. We also present some insight into the analysis with Run 2 data. CP sensitive variables are described and an experimental method of probing CP of the Higgs boson is presented.

  19. A large piece of a small pie: Minimum wages and unemployment benefits in an assignment model with search frictions

    NARCIS (Netherlands)

    P.A. Gautier (Pieter); C.N. Teulings (Coen)

    2003-01-01

    textabstractMost empirical studies on the minimum wage find a spike at the minimum wage, compression of wage differentials at a large interval above the minimum wage and small employment losses. This paper offers a search model which is consistent with these facts. We consider a continuum of worker

  20. An efficient implementation of maximum likelihood identification of LTI state-space models by local gradient search

    NARCIS (Netherlands)

    Bergboer, N.H.; Verdult, V.; Verhaegen, M.H.G.

    2002-01-01

    We present a numerically efficient implementation of the nonlinear least squares and maximum likelihood identification of multivariable linear time-invariant (LTI) state-space models. This implementation is based on a local parameterization of the system and a gradient search in the resulting

  1. Searching for Physics Beyond the Standard Model with the World's Largest Penning Trap

    Science.gov (United States)

    Roberts, B. Lee

    2015-05-01

    Measurements of the magnetic moments of the electron and muon were intertwined with the development of the modern physics of the 20th century, where μ --> = g(Qeℏ / 2 m) s --> with Q = +/- 1 and e > 0 . The g-value consists of a Dirac piece and the anomaly, g = 2(1 + a) or a =(g - 2) / 2 . For point-like particles, a arises from radiative corrections. The simplest correction, a = α / 2 π ~= 0 . 00116 ... , was first obtained by Schwinger. This result was also found to describe the muon's magnetic moment, indicating that the muon behaved like a heavy electron in a magnetic field. Loops containing all virtual particles that interact with the muon, including as yet undiscovered ones, can contribute to the muon anomaly. The relative contribution from heavier particles to the muon and electron anomalies scales as (mμ /me) 2 ~= 43 , 000 , giving the muon a distinct advantage in the search for effects from New Physics. E821 at the Brookhaven AGS obtained a relative precision of +/- 0 . 54 ppm, half the magnitude of the contributions from the Z and W gauge bosons. This result differs from the Standard-Model prediction by > 3 σ . To clarify whether this difference is a harbinger of New Physics beyond the Standard Model, E989 is being mounted at Fermilab with a design precision of 140 ppb. The 700 ton, 14 m diameter storage ring magnet will be shimmed to a point-to-point magnetic dipole field uniformity of +/- 25 ppm over the 1.137 m3 volume where the muon beam is stored, with the azimuthal averaged uniformity motivation for this new experiment, along with the experimental technique and outlook. This work supported in part by the US DOE and NSF.

  2. A Search for the Standard Model Higgs Boson in CDF II Data

    Energy Technology Data Exchange (ETDEWEB)

    Lockwitz, Sarah E. [Yale Univ., New Haven, CT (United States)

    2012-01-01

    This dissertation presents a search for the standard model Higgs boson in the associated production process p $\\bar{p}$ → ZH → e+e-b$\\bar{b}$. Data amounting to an integrated luminosity of 7.5 fb-1 at √s = 1.96 TeV collected at the Collider Detector at Fermilab (CDF) at the Tevatron are analyzed. Two objectives are pursued in the methods applied: maximize acceptance, and distinguish the signal from background. The first aim is met by applying a neural-network-based electron identi cation and considering multiple electron triggers in an effort to improve Z acceptance. In an attempt to maximize the Higgs acceptance, three b quark identification schemes are used allowing for varying event conditions. The latter goal is met by employing more multivariate techniques. First, the dijet mass resolution is improved by a neural network. Then, both single variables and boosted decision tree outputs are fed into a segmented final discriminant simultaneously isolating the signal-like events from the Z with additional jets background and the kinematically di erent tt background. Good agreement is seen with the null hypothesis and upper production cross section ( ZH) times branching ratio (BR(H →b $\\bar{b}$)) limits are set for 11 mass hypotheses between 100 and 150 GeV/c2 at the 95% confidence level. For a Higgs boson mass of 115 GeV/c2, this channel sets an observed (expected) upper limit of 3.9 (5.8) times the standard model value of ZH BR(H → b $\\bar{b}$). The inclusion of this channel within the combined CDF and Tevatron limits is discussed.

  3. Search Help

    Science.gov (United States)

    Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.

  4. An Equilibrium Search Model of the Labor Market Entry of Second-Generation Immigrants and Ethnic Danes

    DEFF Research Database (Denmark)

    Datta Gupta, Nabanita; Kromann, Lene

    do on the labor market, though not with respect to layoffs. This result is mainly driven by the group of high school graduates and those with a primary school education only. Second generation immigrants with vocational education, males in particular, face both significantly lower arrival rates when......Using a search model for Danish labor market entrants, we are one of the first studies to test whether second‐generation immigrants have the same job‐offer arrival and layoff rates as ethnic Danes have. We contribute to the search literature by incorporating matching as a way to ensure sub...... unemployed and significantly higher layoff rates than those of their ethnic Danish twins....

  5. Searches for vector-like quarks at future colliders and implications for composite Higgs models with dark matter

    Science.gov (United States)

    Chala, Mikael; Gröber, Ramona; Spannowsky, Michael

    2018-03-01

    Many composite Higgs models predict the existence of vector-like quarks with masses outside the reach of the LHC, e.g. m Q ≳ 2 TeV, in particular if these models contain a dark matter candidate. In such models the mass of the new resonances is bounded from above to satisfy the constraint from the observed relic density. We therefore develop new strategies to search for vector-like quarks at a future 100 TeV collider and evaluate what masses and interactions can be probed. We find that masses as large as ˜ 6.4 (˜9) TeV can be tested if the fermionic resonances decay into Standard Model (dark matter) particles. We also discuss the complementarity of dark matter searches, showing that most of the parameter space can be closed. On balance, this study motivates further the consideration of a higher-energy hadron collider for a next generation of facilities.

  6. Search for neutral leptons

    International Nuclear Information System (INIS)

    Perl, M.L.

    1984-12-01

    At present we know of three kinds of neutral leptons: the electron neutrino, the muon neutrino, and the tau neutrino. This paper reviews the search for additional neutral leptons. The method and significance of a search depends upon the model used for the neutral lepton being sought. Some models for the properties and decay modes of proposed neutral leptons are described. Past and present searches are reviewed. The limits obtained by some completed searches are given, and the methods of searches in progress are described. Future searches are discussed. 41 references

  7. Results on neutrinoless double beta decay search in GERDA. Background modeling and limit setting

    Energy Technology Data Exchange (ETDEWEB)

    Becerici Schmidt, Neslihan

    2014-07-22

    The search for the neutrinoless double beta decay (0νββ) process is primarily motivated by its potential of revealing the possible Majorana nature of the neutrino, in which the neutrino is identical to its antiparticle. It has also the potential to yield information on the intrinsic properties of neutrinos, if the underlying mechanism is the exchange of a light Majorana neutrino. The Gerda experiment is searching for 0νββ decay of {sup 76}Ge by operating high purity germanium (HPGe) detectors enriched in the isotope {sup 76}Ge (∝ 87%), directly in ultra-pure liquid argon (LAr). The first phase of physics data taking (Phase I) was completed in 2013 and has yielded 21.6 kg.yr of data. A background index of B∼10{sup -2} cts/(keV.kg.yr) at Q{sub ββ}=2039 keV has been achieved. A comprehensive background model of the Phase I energy spectrum is presented as the major topic of this dissertation. Decomposition of the background energy spectrum into the individual contributions from different processes provides many interesting physics results. The specific activity of {sup 39}Ar has been determined. The obtained result, A=(1.15±0.11) Bq/kg, is in good agreement with the values reported in literature. The contribution from {sup 42}K decays in LAr to the background spectrum has yielded a {sup 42}K({sup 42}Ar) specific activity of A=(106.2{sub -19.2}{sup +12.7}) μBq/kg, for which only upper limits exist in literature. The analysis of high energy events induced by α decays in the {sup 226}Ra chain indicated a total {sup 226}Ra activity of (3.0±0.9) μBq and a total initial {sup 210}Po activity of (0.18±0.01) mBq on the p{sup +} surfaces of the enriched semi-coaxial HPGe detectors. The half life of the two-neutrino double beta (2νββ) decay of {sup 76}Ge has been determined as T{sub 1/2}{sup 2ν}=(1.926±0.094).10{sup 21} yr, which is in good agreement with the result that was obtained with lower exposure and has been published by the Gerda collaboration

  8. Results on neutrinoless double beta decay search in GERDA. Background modeling and limit setting

    International Nuclear Information System (INIS)

    Becerici Schmidt, Neslihan

    2014-01-01

    The search for the neutrinoless double beta decay (0νββ) process is primarily motivated by its potential of revealing the possible Majorana nature of the neutrino, in which the neutrino is identical to its antiparticle. It has also the potential to yield information on the intrinsic properties of neutrinos, if the underlying mechanism is the exchange of a light Majorana neutrino. The Gerda experiment is searching for 0νββ decay of 76 Ge by operating high purity germanium (HPGe) detectors enriched in the isotope 76 Ge (∝ 87%), directly in ultra-pure liquid argon (LAr). The first phase of physics data taking (Phase I) was completed in 2013 and has yielded 21.6 kg.yr of data. A background index of B∼10 -2 cts/(keV.kg.yr) at Q ββ =2039 keV has been achieved. A comprehensive background model of the Phase I energy spectrum is presented as the major topic of this dissertation. Decomposition of the background energy spectrum into the individual contributions from different processes provides many interesting physics results. The specific activity of 39 Ar has been determined. The obtained result, A=(1.15±0.11) Bq/kg, is in good agreement with the values reported in literature. The contribution from 42 K decays in LAr to the background spectrum has yielded a 42 K( 42 Ar) specific activity of A=(106.2 -19.2 +12.7 ) μBq/kg, for which only upper limits exist in literature. The analysis of high energy events induced by α decays in the 226 Ra chain indicated a total 226 Ra activity of (3.0±0.9) μBq and a total initial 210 Po activity of (0.18±0.01) mBq on the p + surfaces of the enriched semi-coaxial HPGe detectors. The half life of the two-neutrino double beta (2νββ) decay of 76 Ge has been determined as T 1/2 2ν =(1.926±0.094).10 21 yr, which is in good agreement with the result that was obtained with lower exposure and has been published by the Gerda collaboration. According to the model, the background in Q ββ ±5 keV window is resulting from close

  9. Mitigating the Insider Threat Using High-Dimensional Search and Modeling

    National Research Council Canada - National Science Library

    Van Den Berg, Eric; Uphadyaya, Shambhu; Ngo, Phi H; Muthukrishnan, Muthu; Palan, Rajago

    2006-01-01

    In this project a system was built aimed at mitigating insider attacks centered around a high-dimensional search engine for correlating the large number of monitoring streams necessary for detecting insider attacks...

  10. A search for the standard model Higgs Boson in the neutrino channel using the DELPHI detector at LEP 2

    CERN Document Server

    McPherson, G

    1999-01-01

    A search for the Standard Model Higgs boson is performed using 51.6 pb sup - sup 1 of data collected by the DELPHI detector in 1997 at a centre-of-mass energy of 183 GeV. A search is made for Higgs bosons produced in association with a Z boson, where the Higgs decays to b-quarks and the Z to neutrinos. Different statistical search methods are investigated and compared, with 95% confidence level cross-section limits set as a function of the Higgs boson mass. No significant excess is observed in the data, allowing a lower mass limit of 73.0 GeV/c sup 2 to be set for the Higgs boson.

  11. Search for the Standard Model Higgs Boson in Leptons plus Jets Final States

    Energy Technology Data Exchange (ETDEWEB)

    Nguyen, Huong [Univ. of Virginia, Charlottesville, VA (United States)

    2014-01-01

    Searches for SM Higgs boson production in the leptons plus jets final states with a data set corresponding to 9.7 fb-1 of $\\bar{p}$p collisions at √s = 1.96TeV collected by the DØ Experiment are presented in this thesis. The searches are carried out in two independent analyses, accounting for different signal topologies.

  12. Sleuth: A quasi-model-independent search strategy for new physics

    International Nuclear Information System (INIS)

    Bruce O. Knuteson

    2001-01-01

    How can we search for new physics when we only vaguely know what it should look like? How can we perform an unbiased yet data-driven search? If we see apparently anomalous events in our data, how can we quantify their ''interestingness'' a posteriori? We present an analysis strategy (SLEUTH) that simultaneously addresses each of these questions, and we demonstrate its application to over thirty exclusive final states in data collected by D0 in Run I of the Fermilab Tevatron

  13. Pareto Optimization of a Half Car Passive Suspension Model Using a Novel Multiobjective Heat Transfer Search Algorithm

    Directory of Open Access Journals (Sweden)

    Vimal Savsani

    2017-01-01

    Full Text Available Most of the modern multiobjective optimization algorithms are based on the search technique of genetic algorithms; however the search techniques of other recently developed metaheuristics are emerging topics among researchers. This paper proposes a novel multiobjective optimization algorithm named multiobjective heat transfer search (MOHTS algorithm, which is based on the search technique of heat transfer search (HTS algorithm. MOHTS employs the elitist nondominated sorting and crowding distance approach of an elitist based nondominated sorting genetic algorithm-II (NSGA-II for obtaining different nondomination levels and to preserve the diversity among the optimal set of solutions, respectively. The capability in yielding a Pareto front as close as possible to the true Pareto front of MOHTS has been tested on the multiobjective optimization problem of the vehicle suspension design, which has a set of five second-order linear ordinary differential equations. Half car passive ride model with two different sets of five objectives is employed for optimizing the suspension parameters using MOHTS and NSGA-II. The optimization studies demonstrate that MOHTS achieves the better nondominated Pareto front with the widespread (diveresed set of optimal solutions as compared to NSGA-II, and further the comparison of the extreme points of the obtained Pareto front reveals the dominance of MOHTS over NSGA-II, multiobjective uniform diversity genetic algorithm (MUGA, and combined PSO-GA based MOEA.

  14. Bayesian uncertainty analysis for complex systems biology models: emulation, global parameter searches and evaluation of gene functions.

    Science.gov (United States)

    Vernon, Ian; Liu, Junli; Goldstein, Michael; Rowe, James; Topping, Jen; Lindsey, Keith

    2018-01-02

    Many mathematical models have now been employed across every area of systems biology. These models increasingly involve large numbers of unknown parameters, have complex structure which can result in substantial evaluation time relative to the needs of the analysis, and need to be compared to observed data of various forms. The correct analysis of such models usually requires a global parameter search, over a high dimensional parameter space, that incorporates and respects the most important sources of uncertainty. This can be an extremely difficult task, but it is essential for any meaningful inference or prediction to be made about any biological system. It hence represents a fundamental challenge for the whole of systems biology. Bayesian statistical methodology for the uncertainty analysis of complex models is introduced, which is designed to address the high dimensional global parameter search problem. Bayesian emulators that mimic the systems biology model but which are extremely fast to evaluate are embeded within an iterative history match: an efficient method to search high dimensional spaces within a more formal statistical setting, while incorporating major sources of uncertainty. The approach is demonstrated via application to a model of hormonal crosstalk in Arabidopsis root development, which has 32 rate parameters, for which we identify the sets of rate parameter values that lead to acceptable matches between model output and observed trend data. The multiple insights into the model's structure that this analysis provides are discussed. The methodology is applied to a second related model, and the biological consequences of the resulting comparison, including the evaluation of gene functions, are described. Bayesian uncertainty analysis for complex models using both emulators and history matching is shown to be a powerful technique that can greatly aid the study of a large class of systems biology models. It both provides insight into model behaviour

  15. Neurally and ocularly informed graph-based models for searching 3D environments

    Science.gov (United States)

    Jangraw, David C.; Wang, Jun; Lance, Brent J.; Chang, Shih-Fu; Sajda, Paul

    2014-08-01

    Objective. As we move through an environment, we are constantly making assessments, judgments and decisions about the things we encounter. Some are acted upon immediately, but many more become mental notes or fleeting impressions—our implicit ‘labeling’ of the world. In this paper, we use physiological correlates of this labeling to construct a hybrid brain-computer interface (hBCI) system for efficient navigation of a 3D environment. Approach. First, we record electroencephalographic (EEG), saccadic and pupillary data from subjects as they move through a small part of a 3D virtual city under free-viewing conditions. Using machine learning, we integrate the neural and ocular signals evoked by the objects they encounter to infer which ones are of subjective interest to them. These inferred labels are propagated through a large computer vision graph of objects in the city, using semi-supervised learning to identify other, unseen objects that are visually similar to the labeled ones. Finally, the system plots an efficient route to help the subjects visit the ‘similar’ objects it identifies. Main results. We show that by exploiting the subjects’ implicit labeling to find objects of interest instead of exploring naively, the median search precision is increased from 25% to 97%, and the median subject need only travel 40% of the distance to see 84% of the objects of interest. We also find that the neural and ocular signals contribute in a complementary fashion to the classifiers’ inference of subjects’ implicit labeling. Significance. In summary, we show that neural and ocular signals reflecting subjective assessment of objects in a 3D environment can be used to inform a graph-based learning model of that environment, resulting in an hBCI system that improves navigation and information delivery specific to the user’s interests.

  16. The MØLLER experiment at Jefferson Lab: search for physics beyond the Standard Model

    Science.gov (United States)

    van Oers, Willem T. H.

    2010-07-01

    The MO/LLER experiment at Jefferson Lab will measure the parity-violating analyzing power Az in the scattering of 11 GeV longitudinally polarized electrons from the atomic electrons in a liquid hydrogen target (Mo/ller scattering). In the Standard Model a non-zero Az is due to the interference of the electromagnetic amplitude and the weak neutral current amplitude, the latter mediated by the Z0 boson. Az is predicted to be 35.6 parts per billion (ppb) at the kinematics of the experiment. It is the objective of the experiment to measure Az to a precision of 0.73 ppb. This result would yield a measurement of the weak charge of the electron QWe to a fractional error of 2.3% at an average value Q2 of 0.0056 (GeV/c)2. This in turn will yield a determination of the weak mixing angle sin2θw with an uncertainty of ±0.00026(stat) ±0.00013(syst), comparable to the accuracy of the two best determinations at high energy colliders (at the Z0 pole). Consequently, the result could potentially influence the central value of this fundamental electroweak parameter, which is of critical importance in deciphering any signal of new physics that might be observed at the Large Hadron Collider (LHC). The measurement is sensitive to the interference of the electromagnetic amplitude with new neutral current amplitudes as weak as 10-3 GF from as yet unknown high energy dynamics, a level of sensitivity unlikely to be matched in any experiment measuring a flavor and CP conserving process in the next decade. This provides indirect access to new physics at multi-TeV scales in a manner complementary to direct searches at the LHC.

  17. Neurally and ocularly informed graph-based models for searching 3D environments.

    Science.gov (United States)

    Jangraw, David C; Wang, Jun; Lance, Brent J; Chang, Shih-Fu; Sajda, Paul

    2014-08-01

    As we move through an environment, we are constantly making assessments, judgments and decisions about the things we encounter. Some are acted upon immediately, but many more become mental notes or fleeting impressions-our implicit 'labeling' of the world. In this paper, we use physiological correlates of this labeling to construct a hybrid brain-computer interface (hBCI) system for efficient navigation of a 3D environment. First, we record electroencephalographic (EEG), saccadic and pupillary data from subjects as they move through a small part of a 3D virtual city under free-viewing conditions. Using machine learning, we integrate the neural and ocular signals evoked by the objects they encounter to infer which ones are of subjective interest to them. These inferred labels are propagated through a large computer vision graph of objects in the city, using semi-supervised learning to identify other, unseen objects that are visually similar to the labeled ones. Finally, the system plots an efficient route to help the subjects visit the 'similar' objects it identifies. We show that by exploiting the subjects' implicit labeling to find objects of interest instead of exploring naively, the median search precision is increased from 25% to 97%, and the median subject need only travel 40% of the distance to see 84% of the objects of interest. We also find that the neural and ocular signals contribute in a complementary fashion to the classifiers' inference of subjects' implicit labeling. In summary, we show that neural and ocular signals reflecting subjective assessment of objects in a 3D environment can be used to inform a graph-based learning model of that environment, resulting in an hBCI system that improves navigation and information delivery specific to the user's interests.

  18. submitter Search for Supersymmetry in single-lepton final states with the ATLAS detector and Improved background model for the search of new physics

    CERN Document Server

    Horner, Stephan

    The current understanding of nature at its elementary level is condensed in a physical theory known as the Standard Model. While it has been extraordinarily successful in describing almost all known phenomena in particle physics with astonishing precision since the 1970s, it is also commonly agreed upon that it can only be an approximation of more fundamental laws of physics, which have yet to be discovered. Supersymmetry is an attractive candidate for an extension of the Standard Model since it recovers many of its deficiencies and, maybe, constitutes an important milestone on the road to a theory of everything. There are good reasons to believe that if supersymmetry exists, it will make itself apparent at the so-called weak energy scale. With the start of the Large Hadron Collider, a new era in particle physics has therefore begun, since it will be possible to thoroughly probe this scale for the first time. The experiments at the Large Hadron collider will also search for the last big missing piece of the S...

  19. Search for the standard model Higgs Boson produced in association with top quarks using the full CDF data set.

    Science.gov (United States)

    Aaltonen, T; Álvarez González, B; Amerio, S; Amidei, D; Anastassov, A; Annovi, A; Antos, J; Apollinari, G; Appel, J A; Arisawa, T; Artikov, A; Asaadi, J; Ashmanskas, W; Auerbach, B; Aurisano, A; Azfar, F; Badgett, W; Bae, T; Barbaro-Galtieri, A; Barnes, V E; Barnett, B A; Barria, P; Bartos, P; Bauce, M; Bedeschi, F; Behari, S; Bellettini, G; Bellinger, J; Benjamin, D; Beretvas, A; Bhatti, A; Bisello, D; Bizjak, I; Bland, K R; Blumenfeld, B; Bocci, A; Bodek, A; Bortoletto, D; Boudreau, J; Boveia, A; Brigliadori, L; Bromberg, C; Brucken, E; Budagov, J; Budd, H S; Burkett, K; Busetto, G; Bussey, P; Buzatu, A; Calamba, A; Calancha, C; Camarda, S; Campanelli, M; Campbell, M; Canelli, F; Carls, B; Carlsmith, D; Carosi, R; Carrillo, S; Carron, S; Casal, B; Casarsa, M; Castro, A; Catastini, P; Cauz, D; Cavaliere, V; Cavalli-Sforza, M; Cerri, A; Cerrito, L; Chen, Y C; Chertok, M; Chiarelli, G; Chlachidze, G; Chlebana, F; Cho, K; Chokheli, D; Chung, W H; Chung, Y S; Ciocci, M A; Clark, A; Clarke, C; Compostella, G; Connors, J; Convery, M E; Conway, J; Corbo, M; Cordelli, M; Cox, C A; Cox, D J; Crescioli, F; Cuevas, J; Culbertson, R; Dagenhart, D; d'Ascenzo, N; Datta, M; de Barbaro, P; Dell'Orso, M; Demortier, L; Deninno, M; Devoto, F; d'Errico, M; Di Canto, A; Di Ruzza, B; Dittmann, J R; D'Onofrio, M; Donati, S; Dong, P; Dorigo, M; Dorigo, T; Ebina, K; Elagin, A; Eppig, A; Erbacher, R; Errede, S; Ershaidat, N; Eusebi, R; Farrington, S; Feindt, M; Fernandez, J P; Field, R; Flanagan, G; Forrest, R; Frank, M J; Franklin, M; Freeman, J C; Funakoshi, Y; Furic, I; Gallinaro, M; Garcia, J E; Garfinkel, A F; Garosi, P; Gerberich, H; Gerchtein, E; Giagu, S; Giakoumopoulou, V; Giannetti, P; Gibson, K; Ginsburg, C M; Giokaris, N; Giromini, P; Giurgiu, G; Glagolev, V; Glenzinski, D; Gold, M; Goldin, D; Goldschmidt, N; Golossanov, A; Gomez, G; Gomez-Ceballos, G; Goncharov, M; González, O; Gorelov, I; Goshaw, A T; Goulianos, K; Grinstein, S; Grosso-Pilcher, C; Group, R C; Guimaraes da Costa, J; Hahn, S R; Halkiadakis, E; Hamaguchi, A; Han, J Y; Happacher, F; Hara, K; Hare, D; Hare, M; Harr, R F; Hatakeyama, K; Hays, C; Heck, M; Heinrich, J; Herndon, M; Hewamanage, S; Hocker, A; Hopkins, W; Horn, D; Hou, S; Hughes, R E; Hurwitz, M; Husemann, U; Hussain, N; Hussein, M; Huston, J; Introzzi, G; Iori, M; Ivanov, A; James, E; Jang, D; Jayatilaka, B; Jeon, E J; Jindariani, S; Jones, M; Joo, K K; Jun, S Y; Junk, T R; Kamon, T; Karchin, P E; Kasmi, A; Kato, Y; Ketchum, W; Keung, J; Khotilovich, V; Kilminster, B; Kim, D H; Kim, H S; Kim, J E; Kim, M J; Kim, S B; Kim, S H; Kim, Y K; Kim, Y J; Kimura, N; Kirby, M; Klimenko, S; Knoepfel, K; Kondo, K; Kong, D J; Konigsberg, J; Kotwal, A V; Kreps, M; Kroll, J; Krop, D; Kruse, M; Krutelyov, V; Kuhr, T; Kurata, M; Kwang, S; Laasanen, A T; Lami, S; Lammel, S; Lancaster, M; Lander, R L; Lannon, K; Lath, A; Latino, G; Lecompte, T; Lee, E; Lee, H S; Lee, J S; Lee, S W; Leo, S; Leone, S; Lewis, J D; Limosani, A; Lin, C-J; Lindgren, M; Lipeles, E; Lister, A; Litvintsev, D O; Liu, C; Liu, H; Liu, Q; Liu, T; Lockwitz, S; Loginov, A; Lucchesi, D; Lueck, J; Lujan, P; Lukens, P; Lungu, G; Lys, J; Lysak, R; Madrak, R; Maeshima, K; Maestro, P; Malik, S; Manca, G; Manousakis-Katsikakis, A; Margaroli, F; Marino, C; Martínez, M; Mastrandrea, P; Matera, K; Mattson, M E; Mazzacane, A; Mazzanti, P; McFarland, K S; McIntyre, P; McNulty, R; Mehta, A; Mehtala, P; Mesropian, C; Miao, T; Mietlicki, D; Mitra, A; Miyake, H; Moed, S; Moggi, N; Mondragon, M N; Moon, C S; Moore, R; Morello, M J; Morlock, J; Movilla Fernandez, P; Mukherjee, A; Muller, Th; Murat, P; Mussini, M; Nachtman, J; Nagai, Y; Naganoma, J; Nakano, I; Napier, A; Nett, J; Neu, C; Neubauer, M S; Nielsen, J; Nodulman, L; Noh, S Y; Norniella, O; Oakes, L; Oh, S H; Oh, Y D; Oksuzian, I; Okusawa, T; Orava, R; Ortolan, L; Pagan Griso, S; Pagliarone, C; Palencia, E; Papadimitriou, V; Paramonov, A A; Patrick, J; Pauletta, G; Paulini, M; Paus, C; Pellett, D E; Penzo, A; Phillips, T J; Piacentino, G; Pianori, E; Pilot, J; Pitts, K; Plager, C; Pondrom, L; Poprocki, S; Potamianos, K; Prokoshin, F; Pranko, A; Ptohos, F; Punzi, G; Rahaman, A; Ramakrishnan, V; Ranjan, N; Redondo, I; Renton, P; Rescigno, M; Riddick, T; Rimondi, F; Ristori, L; Robson, A; Rodrigo, T; Rodriguez, T; Rogers, E; Rolli, S; Roser, R; Ruffini, F; Ruiz, A; Russ, J; Rusu, V; Safonov, A; Sakumoto, W K; Sakurai, Y; Santi, L; Sato, K; Saveliev, V; Savoy-Navarro, A; Schlabach, P; Schmidt, A; Schmidt, E E; Schwarz, T; Scodellaro, L; Scribano, A; Scuri, F; Seidel, S; Seiya, Y; Semenov, A; Sforza, F; Shalhout, S Z; Shears, T; Shepard, P F; Shimojima, M; Shochet, M; Shreyber-Tecker, I; Simonenko, A; Sinervo, P; Sliwa, K; Smith, J R; Snider, F D; Soha, A; Sorin, V; Song, H; Squillacioti, P; Stancari, M; St Denis, R; Stelzer, B; Stelzer-Chilton, O; Stentz, D; Strologas, J; Strycker, G L; Sudo, Y; Sukhanov, A; Suslov, I; Takemasa, K; Takeuchi, Y; Tang, J; Tecchio, M; Teng, P K; Thom, J; Thome, J; Thompson, G A; Thomson, E; Toback, D; Tokar, S; Tollefson, K; Tomura, T; Tonelli, D; Torre, S; Torretta, D; Totaro, P; Trovato, M; Ukegawa, F; Uozumi, S; Varganov, A; Vázquez, F; Velev, G; Vellidis, C; Vidal, M; Vila, I; Vilar, R; Vizán, J; Vogel, M; Volpi, G; Wagner, P; Wagner, R L; Wakisaka, T; Wallny, R; Wang, S M; Warburton, A; Waters, D; Wester, W C; Whiteson, D; Wicklund, A B; Wicklund, E; Wilbur, S; Wick, F; Williams, H H; Wilson, J S; Wilson, P; Winer, B L; Wittich, P; Wolbers, S; Wolfe, H; Wright, T; Wu, X; Wu, Z; Yamamoto, K; Yamato, D; Yang, T; Yang, U K; Yang, Y C; Yao, W-M; Yeh, G P; Yi, K; Yoh, J; Yorita, K; Yoshida, T; Yu, G B; Yu, I; Yu, S S; Yun, J C; Zanetti, A; Zeng, Y; Zhou, C; Zucchelli, S

    2012-11-02

    A search is presented for the standard model Higgs boson produced in association with top quarks using the full Run II proton-antiproton collision data set, corresponding to 9.45 fb(-1), collected by the Collider Detector at Fermilab. No significant excess over the expected background is observed, and 95% credibility-level upper bounds are placed on the cross section σ(ttH → lepton + missing transverse energy+jets). For a Higgs boson mass of 125 GeV/c(2), we expect to set a limit of 12.6 and observe a limit of 20.5 times the standard model rate. This represents the most sensitive search for a standard model Higgs boson in this channel to date.

  20. Looking For Physics Beyond The Standard Model: Searches For Charged Higgs Bosons At $e^{+}e^{-}$ Colliders

    CERN Document Server

    Kiiskinen, A P

    2004-01-01

    This thesis describes direct searches for pair production of charged Higgs bosons performed in the data collected by the DELPHI detector at the LEP collider at CERN. In addition, the possibilities to discover and study heavy charged Higgs bosons at possible future high-energy linear colliders are presented. The existence of charged Higgs bosons is predicted by many extensions of the Standard Model. A possible discovery of these particles would be a solid proof for physics beyond the Standard Model. Discovery of charged Higgs bosons, and measurement of their properties, would also provide useful information about the structure of the more general theory. New analysis methods were developed for the searches performed at LEP. A large, previously unexplored, mass range for cover but no evidence for the existence of the charged Higgs bosons was found. This allowed setting new lower mass limits for the charged Higgs boson within the framework of general two Higgs doublet models. Results have been interpreted and pr...

  1. Research and development modelling in the frame of search - prognosis - risk theory

    International Nuclear Information System (INIS)

    Valeca, Serban Constantin

    2002-01-01

    The re-engineering of the power production processes is an approach targeting the future of the competitive power market, undertaken by the custom-tailored managers able to keep the pace of market. The new corporations must be controlled by a flexible management able to adapt the integrated processes to market's changes, to cope to the price and quality competition. Innovating the structures in the frame of a neural network approach may transform the risks in substantial savings of financial resources. Power production re-engineering concept implies three forces thrusting presently the companies toward renewal, namely, the clients, competition and changes. The clients became offensive the competition is more and more acute while the changes implies continuous advancements. The clients order specifically what they want and what they need while give up the producers' patterns. The competition inserts new products in the market, cheaper and of higher quality, thus eliminating the traditional producers. The fast changing of the technologies, products and service distributions or of the co-operation patterns with the client ensures a sustainable development of the corporations. An analysis of the present processes in business shows the following: - the recommended solutions of re-designing the processes should be adopted; - the highest rate of progress is ensured by a continuous innovating policy; - the high quality products and services should be introduced on market when the demand is maximum, while the prices should be shaped to protect optimally the corporation against economic financial risk. The monograph is a synthetical presentation of the economical-industrial re-engineering described in the frame of search-prognosis-risk model implying technological innovation, processes-products-services quality improvement as well as the human factor framed by training-ergonomic-results descriptors. The decision making issue closely related to information processing and cost

  2. [Modeling of a three-dimensional structure of cytochrome P-450 1A2 and search for its new ligands].

    Science.gov (United States)

    Belkina, N V; Skvortsov, V S; Ivanov, A S; Archakov, A I

    1998-01-01

    The substances inhibiting cytochrome P450 1A2 (CYP1A2) represent a perspective class of new drugs, which application in clinical practice can become the important part in preventive maintenance in oncology. The present work is devoted to computer modelling of 3-D structure of CYP1A2 and searching of new inhibitors by database mining. The modelling of CYP1A2 was done based on homology with 4 bacterial cytochromes P450 with known 3-D structure. For optimization of CYP1A2 active site structure the models of its complexes with characteristic substrates (caffeine and 7-ethoxyresorufin) were designed. These complexes were optimized by molecular dynamics simulation in water. The models of 24 complexes of CYP1A2 with known ligands with known Kd were designed by means of DockSearch and LeapFrog programs. 3D-QSAR model with good predictive force was created based on these complexes. On a final stage the search of knew CYP1A2 ligands in testing database (more than 23.000 substances from database Maybridge and 112 known CYP1A2 ligands from database Metabolite, MDL) was executed. 680 potential ligands of CYP1A2 with Kd values, comparable with known ones were obtained. This number has included 73 compounds from 112 known ligands, introduced in tested database as the internal control.

  3. An experimental and theoretical model of children’s search behavior in relation to target conspicuity and spatial distribution

    Science.gov (United States)

    Rosetti, Marcos Francisco; Pacheco-Cobos, Luis; Larralde, Hernán; Hudson, Robyn

    2010-11-01

    This work explores search trajectories of children attempting to find targets distributed on a playing field. This task, of ludic nature, was developed to test the effect of conspicuity and spatial distribution of targets on the searcher’s performance. The searcher’s path was recorded by a Global Positioning System (GPS) device attached to the child’s waist. Participants were not rewarded nor their performance rated. Variation in the conspicuity of the targets influenced search performance as expected; cryptic targets resulted in slower searches and longer, more tortuous paths. Extracting the main features of the paths showed that the children: (1) paid little attention to the spatial distribution and at least in the conspicuous condition approximately followed a nearest neighbor pattern of target collection, (2) were strongly influenced by the conspicuity of the targets. We implemented a simple statistical model for the search rules mimicking the children’s behavior at the level of individual (coarsened) steps. The model reproduced the main features of the children’s paths without the participation of memory or planning.

  4. Two-agent cooperative search using game models with endurance-time constraints

    Science.gov (United States)

    Sujit, P. B.; Ghose, Debasish

    2010-07-01

    In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.

  5. An Exemplar-Familiarity Model Predicts Short-Term and Long-Term Probe Recognition across Diverse Forms of Memory Search

    Science.gov (United States)

    Nosofsky, Robert M.; Cox, Gregory E.; Cao, Rui; Shiffrin, Richard M.

    2014-01-01

    Experiments were conducted to test a modern exemplar-familiarity model on its ability to account for both short-term and long-term probe recognition within the same memory-search paradigm. Also, making connections to the literature on attention and visual search, the model was used to interpret differences in probe-recognition performance across…

  6. The low energy frontier: searches for ultra-light particles beyond the Standard Model

    CERN Multimedia

    CERN. Geneva

    2012-01-01

    In the recent years theoretical studies and astrophysical observations have confirmed that unknown constituents of our universe like dark matter may find its explanation not only at large-scale experiments at highest energies, but could also show up at the opposite energy scale. In many laboratories world-wide searches for axions, axion-like particles, hidden photons, chameleons or other so-called WISPs with masses below the eV scale are ongoing. Examples at DESY are the experiments ALPS ("Any Light Particle Search") and SHIPS ("Solar HIdden Photon Search"). At CERN CAST and OSQAR take data. In all these experiments new particles could manifest themselves in a very spectacular manner. Light would apparently shine through thickest walls. The results of a first generation of laboratory and astrophysics experiments will be summarized and plans for future enterprises be discussed

  7. How happy is your web browsing? A model to quantify satisfaction of an Internet user searching for desired information

    Science.gov (United States)

    Banerji, Anirban; Magarkar, Aniket

    2012-09-01

    We feel happy when web browsing operations provide us with necessary information; otherwise, we feel bitter. How to measure this happiness (or bitterness)? How does the profile of happiness grow and decay during the course of web browsing? We propose a probabilistic framework that models the evolution of user satisfaction, on top of his/her continuous frustration at not finding the required information. It is found that the cumulative satisfaction profile of a web-searching individual can be modeled effectively as the sum of a random number of random terms, where each term is a mutually independent random variable, originating from ‘memoryless’ Poisson flow. Evolution of satisfaction over the entire time interval of a user’s browsing was modeled using auto-correlation analysis. A utilitarian marker, a magnitude of greater than unity of which describes happy web-searching operations, and an empirical limit that connects user’s satisfaction with his frustration level-are proposed too. The presence of pertinent information in the very first page of a website and magnitude of the decay parameter of user satisfaction (frustration, irritation etc.) are found to be two key aspects that dominate the web user’s psychology. The proposed model employed different combinations of decay parameter, searching time and number of helpful websites. The obtained results are found to match the results from three real-life case studies.

  8. Cube search, revisited

    Science.gov (United States)

    Zhang, Xuetao; Huang, Jie; Yigit-Elliott, Serap; Rosenholtz, Ruth

    2015-01-01

    Observers can quickly search among shaded cubes for one lit from a unique direction. However, replace the cubes with similar 2-D patterns that do not appear to have a 3-D shape, and search difficulty increases. These results have challenged models of visual search and attention. We demonstrate that cube search displays differ from those with “equivalent” 2-D search items in terms of the informativeness of fairly low-level image statistics. This informativeness predicts peripheral discriminability of target-present from target-absent patches, which in turn predicts visual search performance, across a wide range of conditions. Comparing model performance on a number of classic search tasks, cube search does not appear unexpectedly easy. Easy cube search, per se, does not provide evidence for preattentive computation of 3-D scene properties. However, search asymmetries derived from rotating and/or flipping the cube search displays cannot be explained by the information in our current set of image statistics. This may merely suggest a need to modify the model's set of 2-D image statistics. Alternatively, it may be difficult cube search that provides evidence for preattentive computation of 3-D scene properties. By attributing 2-D luminance variations to a shaded 3-D shape, 3-D scene understanding may slow search for 2-D features of the target. PMID:25780063

  9. Hybrid Multiple Soft-Sensor Models of Grinding Granularity Based on Cuckoo Searching Algorithm and Hysteresis Switching Strategy

    Directory of Open Access Journals (Sweden)

    Jie-Sheng Wang

    2015-01-01

    Full Text Available According to the characteristics of grinding process and accuracy requirements of technical indicators, a hybrid multiple soft-sensor modeling method of grinding granularity is proposed based on cuckoo searching (CS algorithm and hysteresis switching (HS strategy. Firstly, a mechanism soft-sensor model of grinding granularity is deduced based on the technique characteristics and a lot of experimental data of grinding process. Meanwhile, the BP neural network soft-sensor model and wavelet neural network (WNN soft-sensor model are set up. Then, the hybrid multiple soft-sensor model based on the hysteresis switching strategy is realized. That is to say, the optimum model is selected as the current predictive model according to the switching performance index at each sampling instant. Finally the cuckoo searching algorithm is adopted to optimize the performance parameters of hysteresis switching strategy. Simulation results show that the proposed model has better generalization results and prediction precision, which can satisfy the real-time control requirements of grinding classification process.

  10. Beyond Standard Model searches in jets plus missing transverse energy final states with the ATLAS experiment at the LHC

    CERN Document Server

    AUTHOR|(INSPIRE)INSPIRE-00414488; Alviggi, Mariagrazia; Conventi, Francesco

    Dark Matter (DM) is currently one of the most challenging goal in the LHC programme: if DM exists it can be pair-produced in proton-proton collisions. Since its weakly-interacting nature, final signatures with high missing momentum and Standard Model (SM) particles are employed in these searches. This thesis presents results on signatures involving bottom quarks in final states, described in models where DM production occurs via massive spin-0 mediators (scalar or pseudoscalar) with a coupling to SM particles proportional to their masses. These collider searches provide an interesting complementarity to DM direct and indirect detection experiments, covering the parameter space with low DM masses. The results shown in the thesis are obtained on the data collected by the ATLAS experiment in 2015 and 2016.

  11. The Effect of Search, Solve, Create, And Share (SSCS Learning Model towards Student’s Critical Thinking Skills

    Directory of Open Access Journals (Sweden)

    Burhanudin Milama

    2017-11-01

    Full Text Available The aim of this study is determine the effect of search, solve, create, and share (SSCS learning model on critical thinking skills of hydrocarbons and petroleum material. The method used in this study was quasi experimental design, with research design nonequivalent control group design. The sample was taken by purposive sampling and divided into two groups consist of control group and experimental group. The data gathering techniques in this study was through 8 items of essay test instrument which is analyzed by using t-test. The results of t-test data showed that tcount ttable or 16.36 1.980 at significance level 5%, value tcount lies in the region reject H0 and accept Ha. The result shows that there are significant search, solve, create, and share (SSCS learning model on student’s critical thinking skills.

  12. Search for the Standard Model Higgs boson decay to μ+μ− with the ATLAS detector

    Directory of Open Access Journals (Sweden)

    G. Aad

    2014-11-01

    Full Text Available A search is reported for Higgs boson decay to μ+μ− using data with an integrated luminosity of 24.8 fb−1 collected with the ATLAS detector in pp collisions at s=7and8 TeV at the CERN Large Hadron Collider. The observed dimuon invariant mass distribution is consistent with the Standard Model background-only hypothesis in the 120–150 GeV search range. For a Higgs boson with a mass of 125.5 GeV, the observed (expected upper limit at the 95% confidence level is 7.0 (7.2 times the Standard Model expectation. This corresponds to an upper limit on the branching ratio BR(H→μ+μ− of 1.5×10−3.

  13. Classical algorithms for automated parameter-search methods in compartmental neural models - A critical survey based on simulations using neuron

    International Nuclear Information System (INIS)

    Mutihac, R.; Mutihac, R.C.; Cicuttin, A.

    2001-09-01

    Parameter-search methods are problem-sensitive. All methods depend on some meta-parameters of their own, which must be determined experimentally in advance. A better choice of these intrinsic parameters for a certain parameter-search method may improve its performance. Moreover, there are various implementations of the same method, which may also affect its performance. The choice of the matching (error) function has a great impact on the search process in terms of finding the optimal parameter set and minimizing the computational cost. An initial assessment of the matching function ability to distinguish between good and bad models is recommended, before launching exhaustive computations. However, different runs of a parameter search method may result in the same optimal parameter set or in different parameter sets (the model is insufficiently constrained to accurately characterize the real system). Robustness of the parameter set is expressed by the extent to which small perturbations in the parameter values are not affecting the best solution. A parameter set that is not robust is unlikely to be physiologically relevant. Robustness can also be defined as the stability of the optimal parameter set to small variations of the inputs. When trying to estimate things like the minimum, or the least-squares optimal parameters of a nonlinear system, the existence of multiple local minima can cause problems with the determination of the global optimum. Techniques such as Newton's method, the Simplex method and Least-squares Linear Taylor Differential correction technique can be useful provided that one is lucky enough to start sufficiently close to the global minimum. All these methods suffer from the inability to distinguish a local minimum from a global one because they follow the local gradients towards the minimum, even if some methods are resetting the search direction when it is likely to get stuck in presumably a local minimum. Deterministic methods based on

  14. Contrast model for three-dimensional vehicles in natural lighting and search performance analysis

    Science.gov (United States)

    Witus, Gary; Gerhart, Grant R.; Ellis, R. Darin

    2001-09-01

    Ground vehicles in natural lighting tend to have significant and systematic variation in luminance through the presented area. This arises, in large part, from the vehicle surfaces having different orientations and shadowing relative to the source of illumination and the position of the observer. These systematic differences create the appearance of a structured 3D object. The 3D appearance is an important factor in search, figure-ground segregation, and object recognition. We present a contrast metric to predict search and detection performance that accounts for the 3D structure. The approach first computes the contrast of the front (or rear), side, and top surfaces. The vehicle contrast metric is the area-weighted sum of the absolute values of the contrasts of the component surfaces. The 3D structure contrast metric, together with target height, account for more than 80% of the variance in probability of detection and 75% of the variance in search time. When false alarm effects are discounted, they account for 89% of the variance in probability of detection and 95% of the variance in search time. The predictive power of the signature metric, when calibrated to half the data and evaluated against the other half, is 90% of the explanatory power.

  15. Search and modelling of remnant radio galaxies in the LOFAR Lockman Hole field

    NARCIS (Netherlands)

    Brienza, M.; Godfrey, L.; Morganti, R.; Prandoni, I.; Harwood, J.; Mahony, E. K.; Hardcastle, M. J.; Murgia, M.; Röttgering, H. J. A.; Shimwell, T. W.; Shulevski, A.

    2017-01-01

    Context. The phase of radio galaxy evolution after the jets have switched off, often referred to as the remnant phase, is poorly understood and very few sources in this phase are known. Aims: In this work we present an extensive search for remnant radio galaxies in the Lockman Hole, a well-studied

  16. Search for the decay stau --> tau + gravitino in the framework of the Minimal Gauge Mediated SUSY Breaking models

    CERN Document Server

    Cavallo, F R

    1997-01-01

    A search for these decays was carried out in the context of Gauge Mediated SUSY Breaking models, using the data collected by DELPHI in 1995 and 1996 at the center of mass energies of 133, 161 and 172 GeV. No evidence of these processes was found for a decay length ranging from ~ 1mm to ~ 20cm and limits were derived on the gravitino and scalar tau masses.

  17. Search for Minimal Standard Model and Minimal Supersymmetric Model Higgs Bosons in e+ e- Collisions with the OPAL detector at LEP

    International Nuclear Information System (INIS)

    Ganel, Ofer

    1993-06-01

    When LEP machine was turned on in August 1989, a new era had opened. For the first time, direct, model-independent searches for Higgs boson could be carried out. The Minimal Standard Model Higgs boson is expected to be produced in e + e - collisions via the H o Z o . The Minimal Supersymmetric Model Higgs boson are expected to be produced in the analogous e + e - -> h o Z o process or in pairs via the process e + e - -> h o A o . In this thesis we describe the search for Higgs bosons within the framework of the Minimal Standard Model and the Minimal Supersymmetric Model, using the data accumulated by the OPAL detector at LEP in the 1989, 1990, 1991 and part of the 1992 running periods at and around the Z o pole. An MInimal Supersymmetric Model Higgs boson generator is described as well as its use in several different searches. As a result of this work, the Minimal Standard Model Higgs boson mass is bounded from below by 54.2 GeV/c 2 at 95% C.L. This is, at present, the highest such bound. A novel method of overcoming the m τ and m s dependence of Minimal Supersymmetric Higgs boson production and decay introduced by one-loop radiative corrections is used to obtain model-independent exclusion. The thesis describes also an algorithm for off line identification of calorimeter noise in the OPAL detector. (author)

  18. Search on Rugged Landscapes

    DEFF Research Database (Denmark)

    Billinger, Stephan; Stieglitz, Nils; Schumacher, Terry

    2014-01-01

    This paper presents findings from a laboratory experiment on human decision-making in a complex combinatorial task. We find strong evidence for a behavioral model of adaptive search. Success narrows down search to the neighborhood of the status quo, while failure promotes gradually more explorative...... for local improvements too early. We derive stylized decision rules that generate the search behavior observed in the experiment and discuss the implications of our findings for individual decision-making and organizational search....

  19. Search for the Standard Model Higgs Boson in the WH → νb(bar b) Channel in 1.96-TeV Proton-Antiproton Collisions

    International Nuclear Information System (INIS)

    Nagai, Yoshikazu

    2010-01-01

    We have searched for the Standard Model Higgs boson in the WH → lvbb channel in 1.96 TeV pp collisions at CDF. This search is based on the data collected by March 2009, corresponding to an integrated luminosity of 4.3 fb-1. The W H channel is one of the most promising channels for the Higgs boson search at Tevatron in the low Higgs boson mass region.

  20. Search for the Standard Model Higgs boson in the two photon decay channel with the ATLAS detector at the LHC

    CERN Document Server

    Aad, Georges; Abdallah, Jalal; Abdelalim, Ahmed Ali; Abdesselam, Abdelouahab; Abdinov, Ovsat; Abi, Babak; Abolins, Maris; Abramowicz, Halina; Abreu, Henso; Acerbi, Emilio; Acharya, Bobby Samir; Adams, David; Addy, Tetteh; Adelman, Jahred; Aderholz, Michael; Adomeit, Stefanie; Adragna, Paolo; Adye, Tim; Aefsky, Scott; Aguilar-Saavedra, Juan Antonio; Aharrouche, Mohamed; Ahlen, Steven; Ahles, Florian; Ahmad, Ashfaq; Ahsan, Mahsana; Aielli, Giulio; Akdogan, Taylan; Åkesson, Torsten Paul Ake; Akimoto, Ginga; Akimov, Andrei; Akiyama, Kunihiro; Alam, Mohammad; Alam, Muhammad Aftab; Albert, Justin; Albrand, Solveig; Aleksa, Martin; Aleksandrov, Igor; Alessandria, Franco; Alexa, Calin; Alexander, Gideon; Alexandre, Gauthier; Alexopoulos, Theodoros; Alhroob, Muhammad; Aliev, Malik; Alimonti, Gianluca; Alison, John; Aliyev, Magsud; Allport, Phillip; Allwood-Spiers, Sarah; Almond, John; Aloisio, Alberto; Alon, Raz; Alonso, Alejandro; Alviggi, Mariagrazia; Amako, Katsuya; Amaral, Pedro; Amelung, Christoph; Ammosov, Vladimir; Amorim, Antonio; Amorós, Gabriel; Amram, Nir; Anastopoulos, Christos; Ancu, Lucian Stefan; Andari, Nansi; Andeen, Timothy; Anders, Christoph Falk; Anders, Gabriel; Anderson, Kelby; Andreazza, Attilio; Andrei, George Victor; Andrieux, Marie-Laure; Anduaga, Xabier; Angerami, Aaron; Anghinolfi, Francis; Anjos, Nuno; Annovi, Alberto; Antonaki, Ariadni; Antonelli, Mario; Antonov, Alexey; Antos, Jaroslav; Anulli, Fabio; Aoun, Sahar; Aperio Bella, Ludovica; Apolle, Rudi; Arabidze, Giorgi; Aracena, Ignacio; Arai, Yasuo; Arce, Ayana; Archambault, John-Paul; Arfaoui, Samir; Arguin, Jean-Francois; Arik, Engin; Arik, Metin; Armbruster, Aaron James; Arnaez, Olivier; Arnault, Christian; Artamonov, Andrei; Artoni, Giacomo; Arutinov, David; Asai, Shoji; Asfandiyarov, Ruslan; Ask, Stefan; Åsman, Barbro; Asquith, Lily; Assamagan, Ketevi; Astbury, Alan; Astvatsatourov, Anatoli; Atoian, Grigor; Aubert, Bernard; Auge, Etienne; Augsten, Kamil; Aurousseau, Mathieu; Austin, Nicholas; Avolio, Giuseppe; Avramidou, Rachel Maria; Axen, David; Ay, Cano; Azuelos, Georges; Azuma, Yuya; Baak, Max; Baccaglioni, Giuseppe; Bacci, Cesare; Bach, Andre; Bachacou, Henri; Bachas, Konstantinos; Bachy, Gerard; Backes, Moritz; Backhaus, Malte; Badescu, Elisabeta; Bagnaia, Paolo; Bahinipati, Seema; Bai, Yu; Bailey, David; Bain, Travis; Baines, John; Baker, Oliver Keith; Baker, Mark; Baker, Sarah; Banas, Elzbieta; Banerjee, Piyali; Banerjee, Swagato; Banfi, Danilo; Bangert, Andrea Michelle; Bansal, Vikas; Bansil, Hardeep Singh; Barak, Liron; Baranov, Sergei; Barashkou, Andrei; Barbaro Galtieri, Angela; Barber, Tom; Barberio, Elisabetta Luigia; Barberis, Dario; Barbero, Marlon; Bardin, Dmitri; Barillari, Teresa; Barisonzi, Marcello; Barklow, Timothy; Barlow, Nick; Barnett, Bruce; Barnett, Michael; Baroncelli, Antonio; Barone, Gaetano; Barr, Alan; Barreiro, Fernando; Barreiro Guimarães da Costa, João; Barrillon, Pierre; Bartoldus, Rainer; Barton, Adam Edward; Bartsch, Detlef; Bartsch, Valeria; Bates, Richard; Batkova, Lucia; Batley, Richard; Battaglia, Andreas; Battistin, Michele; Battistoni, Giuseppe; Bauer, Florian; Bawa, Harinder Singh; Beare, Brian; Beau, Tristan; Beauchemin, Pierre-Hugues; Beccherle, Roberto; Bechtle, Philip; Beck, Hans Peter; Beckingham, Matthew; Becks, Karl-Heinz; Beddall, Andrew; Beddall, Ayda; Bedikian, Sourpouhi; Bednyakov, Vadim; Bee, Christopher; Begel, Michael; Behar Harpaz, Silvia; Behera, Prafulla; Beimforde, Michael; Belanger-Champagne, Camille; Bell, Paul; Bell, William; Bella, Gideon; Bellagamba, Lorenzo; Bellina, Francesco; Bellomo, Massimiliano; Belloni, Alberto; Beloborodova, Olga; Belotskiy, Konstantin; Beltramello, Olga; Ben Ami, Sagi; Benary, Odette; Benchekroun, Driss; Benchouk, Chafik; Bendel, Markus; Benekos, Nektarios; Benhammou, Yan; Benjamin, Douglas; Benoit, Mathieu; Bensinger, James; Benslama, Kamal; Bentvelsen, Stan; Berge, David; Bergeaas Kuutmann, Elin; Berger, Nicolas; Berghaus, Frank; Berglund, Elina; Beringer, Jürg; Bernardet, Karim; Bernat, Pauline; Bernhard, Ralf; Bernius, Catrin; Berry, Tracey; Bertin, Antonio; Bertinelli, Francesco; Bertolucci, Federico; Besana, Maria Ilaria; Besson, Nathalie; Bethke, Siegfried; Bhimji, Wahid; Bianchi, Riccardo-Maria; Bianco, Michele; Biebel, Otmar; Bieniek, Stephen Paul; Bierwagen, Katharina; Biesiada, Jed; Biglietti, Michela; Bilokon, Halina; Bindi, Marcello; Binet, Sebastien; Bingul, Ahmet; Bini, Cesare; Biscarat, Catherine; Bitenc, Urban; Black, Kevin; Blair, Robert; Blanchard, Jean-Baptiste; Blanchot, Georges; Blazek, Tomas; Blocker, Craig; Blocki, Jacek; Blondel, Alain; Blum, Walter; Blumenschein, Ulrike; Bobbink, Gerjan; Bobrovnikov, Victor; Bocchetta, Simona Serena; Bocci, Andrea; Boddy, Christopher Richard; Boehler, Michael; Boek, Jennifer; Boelaert, Nele; Böser, Sebastian; Bogaerts, Joannes Andreas; Bogdanchikov, Alexander; Bogouch, Andrei; Bohm, Christian; Boisvert, Veronique; Bold, Tomasz; Boldea, Venera; Bolnet, Nayanka Myriam; Bona, Marcella; Bondarenko, Valery; Bondioli, Mario; Boonekamp, Maarten; Boorman, Gary; Booth, Chris; Bordoni, Stefania; Borer, Claudia; Borisov, Anatoly; Borissov, Guennadi; Borjanovic, Iris; Borroni, Sara; Bos, Kors; Boscherini, Davide; Bosman, Martine; Boterenbrood, Hendrik; Botterill, David; Bouchami, Jihene; Boudreau, Joseph; Bouhova-Thacker, Evelina Vassileva; Bourdarios, Claire; Bousson, Nicolas; Boveia, Antonio; Boyd, James; Boyko, Igor; Bozhko, Nikolay; Bozovic-Jelisavcic, Ivanka; Bracinik, Juraj; Braem, André; Branchini, Paolo; Brandenburg, George; Brandt, Andrew; Brandt, Gerhard; Brandt, Oleg; Bratzler, Uwe; Brau, Benjamin; Brau, James; Braun, Helmut; Brelier, Bertrand; Bremer, Johan; Brenner, Richard; Bressler, Shikma; Breton, Dominique; Britton, Dave; Brochu, Frederic; Brock, Ian; Brock, Raymond; Brodbeck, Timothy; Brodet, Eyal; Broggi, Francesco; Bromberg, Carl; Brooijmans, Gustaaf; Brooks, William; Brown, Gareth; Brown, Heather; Bruckman de Renstrom, Pawel; Bruncko, Dusan; Bruneliere, Renaud; Brunet, Sylvie; Bruni, Alessia; Bruni, Graziano; Bruschi, Marco; Buanes, Trygve; Bucci, Francesca; Buchanan, James; Buchanan, Norman; Buchholz, Peter; Buckingham, Ryan; Buckley, Andrew; Buda, Stelian Ioan; Budagov, Ioulian; Budick, Burton; Büscher, Volker; Bugge, Lars; Buira-Clark, Daniel; Bulekov, Oleg; Bunse, Moritz; Buran, Torleiv; Burckhart, Helfried; Burdin, Sergey; Burgess, Thomas; Burke, Stephen; Busato, Emmanuel; Bussey, Peter; Buszello, Claus-Peter; Butin, François; Butler, Bart; Butler, John; Buttar, Craig; Butterworth, Jonathan; Buttinger, William; Byatt, Tom; Cabrera Urbán, Susana; Caforio, Davide; Cakir, Orhan; Calafiura, Paolo; Calderini, Giovanni; Calfayan, Philippe; Calkins, Robert; Caloba, Luiz; Caloi, Rita; Calvet, David; Calvet, Samuel; Camacho Toro, Reina; Camarri, Paolo; Cambiaghi, Mario; Cameron, David; Campana, Simone; Campanelli, Mario; Canale, Vincenzo; Canelli, Florencia; Canepa, Anadi; Cantero, Josu; Capasso, Luciano; Capeans Garrido, Maria Del Mar; Caprini, Irinel; Caprini, Mihai; Capriotti, Daniele; Capua, Marcella; Caputo, Regina; Cardarelli, Roberto; Carli, Tancredi; Carlino, Gianpaolo; Carminati, Leonardo; Caron, Bryan; Caron, Sascha; Carrillo Montoya, German D; Carter, Antony; Carter, Janet; Carvalho, João; Casadei, Diego; Casado, Maria Pilar; Cascella, Michele; Caso, Carlo; Castaneda Hernandez, Alfredo Martin; Castaneda-Miranda, Elizabeth; Castillo Gimenez, Victoria; Castro, Nuno Filipe; Cataldi, Gabriella; Cataneo, Fernando; Catinaccio, Andrea; Catmore, James; Cattai, Ariella; Cattani, Giordano; Caughron, Seth; Cauz, Diego; Cavalleri, Pietro; Cavalli, Donatella; Cavalli-Sforza, Matteo; Cavasinni, Vincenzo; Ceradini, Filippo; Santiago Cerqueira, Augusto; Cerri, Alessandro; Cerrito, Lucio; Cerutti, Fabio; Cetin, Serkant Ali; Cevenini, Francesco; Chafaq, Aziz; Chakraborty, Dhiman; Chan, Kevin; Chapleau, Bertrand; Chapman, John Derek; Chapman, John Wehrley; Chareyre, Eve; Charlton, Dave; Chavda, Vikash; Chavez Barajas, Carlos Alberto; Cheatham, Susan; Chekanov, Sergei; Chekulaev, Sergey; Chelkov, Gueorgui; Chelstowska, Magda Anna; Chen, Chunhui; Chen, Hucheng; Chen, Shenjian; Chen, Tingyang; Chen, Xin; Cheng, Shaochen; Cheplakov, Alexander; Chepurnov, Vladimir; Cherkaoui El Moursli, Rajaa; Chernyatin, Valeriy; Cheu, Elliott; Cheung, Sing-Leung; Chevalier, Laurent; Chiefari, Giovanni; Chikovani, Leila; Childers, John Taylor; Chilingarov, Alexandre; Chiodini, Gabriele; Chizhov, Mihail; Choudalakis, Georgios; Chouridou, Sofia; Christidi, Illectra-Athanasia; Christov, Asen; Chromek-Burckhart, Doris; Chu, Ming-Lee; Chudoba, Jiri; Ciapetti, Guido; Ciba, Krzysztof; Ciftci, Abbas Kenan; Ciftci, Rena; Cinca, Diane; Cindro, Vladimir; Ciobotaru, Matei Dan; Ciocca, Claudia; Ciocio, Alessandra; Cirilli, Manuela; Ciubancan, Mihai; Clark, Allan G; Clark, Philip James; Cleland, Bill; Clemens, Jean-Claude; Clement, Benoit; Clement, Christophe; Clifft, Roger; Coadou, Yann; Cobal, Marina; Coccaro, Andrea; Cochran, James H; Coe, Paul; Cogan, Joshua Godfrey; Coggeshall, James; Cogneras, Eric; Cojocaru, Claudiu; Colas, Jacques; Colijn, Auke-Pieter; Collard, Caroline; Collins, Neil; Collins-Tooth, Christopher; Collot, Johann; Colon, German; Conde Muiño, Patricia; Coniavitis, Elias; Conidi, Maria Chiara; Consonni, Michele; Consorti, Valerio; Constantinescu, Serban; Conta, Claudio; Conventi, Francesco; Cook, James; Cooke, Mark; Cooper, Ben; Cooper-Sarkar, Amanda; Cooper-Smith, Neil; Copic, Katherine; Cornelissen, Thijs; Corradi, Massimo; Corriveau, Francois; Cortes-Gonzalez, Arely; Cortiana, Giorgio; Costa, Giuseppe; Costa, María José; Costanzo, Davide; Costin, Tudor; Côté, David; Courneyea, Lorraine; Cowan, Glen; Cowden, Christopher; Cox, Brian; Cranmer, Kyle; Crescioli, Francesco; Cristinziani, Markus; Crosetti, Giovanni; Crupi, Roberto; Crépé-Renaudin, Sabine; Cuciuc, Constantin-Mihai; Cuenca Almenar, Cristóbal; Cuhadar Donszelmann, Tulay; Curatolo, Maria; Curtis, Chris; Cwetanski, Peter; Czirr, Hendrik; Czyczula, Zofia; D'Auria, Saverio; D'Onofrio, Monica; D'Orazio, Alessia; Da Silva, Paulo Vitor; Da Via, Cinzia; Dabrowski, Wladyslaw; Dai, Tiesheng; Dallapiccola, Carlo; Dam, Mogens; Dameri, Mauro; Damiani, Daniel; Danielsson, Hans Olof; Dannheim, Dominik; Dao, Valerio; Darbo, Giovanni; Darlea, Georgiana Lavinia; Daum, Cornelis; Dauvergne, Jean-Pierre; Davey, Will; Davidek, Tomas; Davidson, Nadia; Davidson, Ruth; Davies, Eleanor; Davies, Merlin; Davison, Adam; Davygora, Yuriy; Dawe, Edmund; Dawson, Ian; Dawson, John; Daya, Rozmin; De, Kaushik; de Asmundis, Riccardo; De Castro, Stefano; De Castro Faria Salgado, Pedro; De Cecco, Sandro; de Graat, Julien; De Groot, Nicolo; de Jong, Paul; De La Taille, Christophe; De la Torre, Hector; De Lotto, Barbara; De Mora, Lee; De Nooij, Lucie; De Pedis, Daniele; De Salvo, Alessandro; De Sanctis, Umberto; De Santo, Antonella; De Vivie De Regie, Jean-Baptiste; Dean, Simon; Debbe, Ramiro; Dedovich, Dmitri; Degenhardt, James; Dehchar, Mohamed; Del Papa, Carlo; Del Peso, Jose; Del Prete, Tarcisio; Deliyergiyev, Maksym; Dell'Acqua, Andrea; Dell'Asta, Lidia; Della Pietra, Massimo; della Volpe, Domenico; Delmastro, Marco; Delpierre, Pierre; Delruelle, Nicolas; Delsart, Pierre-Antoine; Deluca, Carolina; Demers, Sarah; Demichev, Mikhail; Demirkoz, Bilge; Deng, Jianrong; Denisov, Sergey; Derendarz, Dominik; Derkaoui, Jamal Eddine; Derue, Frederic; Dervan, Paul; Desch, Klaus Kurt; Devetak, Erik; Deviveiros, Pier-Olivier; Dewhurst, Alastair; DeWilde, Burton; Dhaliwal, Saminder; Dhullipudi, Ramasudhakar; Di Ciaccio, Anna; Di Ciaccio, Lucia; Di Girolamo, Alessandro; Di Girolamo, Beniamino; Di Luise, Silvestro; Di Mattia, Alessandro; Di Micco, Biagio; Di Nardo, Roberto; Di Simone, Andrea; Di Sipio, Riccardo; Diaz, Marco Aurelio; Diblen, Faruk; Diehl, Edward; Dietrich, Janet; Dietzsch, Thorsten; Diglio, Sara; Dindar Yagci, Kamile; Dingfelder, Jochen; Dionisi, Carlo; Dita, Petre; Dita, Sanda; Dittus, Fridolin; Djama, Fares; Djobava, Tamar; Barros do Vale, Maria Aline; Do Valle Wemans, André; Doan, Thi Kieu Oanh; Dobbs, Matt; Dobinson, Robert; Dobos, Daniel; Dobson, Ellie; Dobson, Marc; Dodd, Jeremy; Doglioni, Caterina; Doherty, Tom; Doi, Yoshikuni; Dolejsi, Jiri; Dolenc, Irena; Dolezal, Zdenek; Dolgoshein, Boris; Dohmae, Takeshi; Donadelli, Marisilvia; Donega, Mauro; Donini, Julien; Dopke, Jens; Doria, Alessandra; Dos Anjos, Andre; Dosil, Mireia; Dotti, Andrea; Dova, Maria-Teresa; Dowell, John; Doxiadis, Alexander; Doyle, Tony; Drasal, Zbynek; Drees, Jürgen; Dressnandt, Nandor; Drevermann, Hans; Driouichi, Chafik; Dris, Manolis; Dubbert, Jörg; Dubbs, Tim; Dube, Sourabh; Duchovni, Ehud; Duckeck, Guenter; Dudarev, Alexey; Dudziak, Fanny; Dührssen, Michael; Duerdoth, Ian; Duflot, Laurent; Dufour, Marc-Andre; Dunford, Monica; Duran Yildiz, Hatice; Duxfield, Robert; Dwuznik, Michal; Dydak, Friedrich; Düren, Michael; Ebenstein, William; Ebke, Johannes; Eckert, Simon; Eckweiler, Sebastian; Edmonds, Keith; Edwards, Clive; Edwards, Nicholas Charles; Ehrenfeld, Wolfgang; Ehrich, Thies; Eifert, Till; Eigen, Gerald; Einsweiler, Kevin; Eisenhandler, Eric; Ekelof, Tord; El Kacimi, Mohamed; Ellert, Mattias; Elles, Sabine; Ellinghaus, Frank; Ellis, Katherine; Ellis, Nicolas; Elmsheuser, Johannes; Elsing, Markus; Emeliyanov, Dmitry; Engelmann, Roderich; Engl, Albert; Epp, Brigitte; Eppig, Andrew; Erdmann, Johannes; Ereditato, Antonio; Eriksson, Daniel; Ernst, Jesse; Ernst, Michael; Ernwein, Jean; Errede, Deborah; Errede, Steven; Ertel, Eugen; Escalier, Marc; Escobar, Carlos; Espinal Curull, Xavier; Esposito, Bellisario; Etienne, Francois; Etienvre, Anne-Isabelle; Etzion, Erez; Evangelakou, Despoina; Evans, Hal; Fabbri, Laura; Fabre, Caroline; Fakhrutdinov, Rinat; Falciano, Speranza; Fang, Yaquan; Fanti, Marcello; Farbin, Amir; Farilla, Addolorata; Farley, Jason; Farooque, Trisha; Farrington, Sinead; Farthouat, Philippe; Fassnacht, Patrick; Fassouliotis, Dimitrios; Fatholahzadeh, Baharak; Favareto, Andrea; Fayard, Louis; Fazio, Salvatore; Febbraro, Renato; Federic, Pavol; Fedin, Oleg; Fedorko, Woiciech; Fehling-Kaschek, Mirjam; Feligioni, Lorenzo; Fellmann, Denis; Felzmann, Ulrich; Feng, Cunfeng; Feng, Eric; Fenyuk, Alexander; Ferencei, Jozef; Ferland, Jonathan; Fernando, Waruna; Ferrag, Samir; Ferrando, James; Ferrara, Valentina; Ferrari, Arnaud; Ferrari, Pamela; Ferrari, Roberto; Ferrer, Antonio; Ferrer, Maria Lorenza; Ferrere, Didier; Ferretti, Claudio; Ferretto Parodi, Andrea; Fiascaris, Maria; Fiedler, Frank; Filipčič, Andrej; Filippas, Anastasios; Filthaut, Frank; Fincke-Keeler, Margret; Fiolhais, Miguel; Fiorini, Luca; Firan, Ana; Fischer, Gordon; Fischer, Peter; Fisher, Matthew; Fisher, Steve; Flechl, Martin; Fleck, Ivor; Fleckner, Johanna; Fleischmann, Philipp; Fleischmann, Sebastian; Flick, Tobias; Flores Castillo, Luis; Flowerdew, Michael; Fokitis, Manolis; Fonseca Martin, Teresa; Forbush, David Alan; Formica, Andrea; Forti, Alessandra; Fortin, Dominique; Foster, Joe; Fournier, Daniel; Foussat, Arnaud; Fowler, Andrew; Fowler, Ken; Fox, Harald; Francavilla, Paolo; Franchino, Silvia; Francis, David; Frank, Tal; Franklin, Melissa; Franz, Sebastien; Fraternali, Marco; Fratina, Sasa; French, Sky; Friedrich, Felix; Froeschl, Robert; Froidevaux, Daniel; Frost, James; Fukunaga, Chikara; Fullana Torregrosa, Esteban; Fuster, Juan; Gabaldon, Carolina; Gabizon, Ofir; Gadfort, Thomas; Gadomski, Szymon; Gagliardi, Guido; Gagnon, Pauline; Galea, Cristina; Gallas, Elizabeth; Gallas, Manuel; Gallo, Valentina Santina; Gallop, Bruce; Gallus, Petr; Galyaev, Eugene; Gan, KK; Gao, Yongsheng; Gapienko, Vladimir; Gaponenko, Andrei; Garberson, Ford; Garcia-Sciveres, Maurice; García, Carmen; García Navarro, José Enrique; Gardner, Robert; Garelli, Nicoletta; Garitaonandia, Hegoi; Garonne, Vincent; Garvey, John; Gatti, Claudio; Gaudio, Gabriella; Gaumer, Olivier; Gaur, Bakul; Gauthier, Lea; Gavrilenko, Igor; Gay, Colin; Gaycken, Goetz; Gayde, Jean-Christophe; Gazis, Evangelos; Ge, Peng; Gee, Norman; Geerts, Daniël Alphonsus Adrianus; Geich-Gimbel, Christoph; Gellerstedt, Karl; Gemme, Claudia; Gemmell, Alistair; Genest, Marie-Hélène; Gentile, Simonetta; George, Matthias; George, Simon; Gerlach, Peter; Gershon, Avi; Geweniger, Christoph; Ghazlane, Hamid; Ghez, Philippe; Ghodbane, Nabil; Giacobbe, Benedetto; Giagu, Stefano; Giakoumopoulou, Victoria; Giangiobbe, Vincent; Gianotti, Fabiola; Gibbard, Bruce; Gibson, Adam; Gibson, Stephen; Gilbert, Laura; Gilchriese, Murdock; Gilewsky, Valentin; Gillberg, Dag; Gillman, Tony; Gingrich, Douglas; Ginzburg, Jonatan; Giokaris, Nikos; Giordani, MarioPaolo; Giordano, Raffaele; Giorgi, Francesco Michelangelo; Giovannini, Paola; Giraud, Pierre-Francois; Giugni, Danilo; Giunta, Michele; Giusti, Paolo; Gjelsten, Børge Kile; Gladilin, Leonid; Glasman, Claudia; Glatzer, Julian; Glazov, Alexandre; Glitza, Karl-Walter; Glonti, George; Godfrey, Jennifer; Godlewski, Jan; Goebel, Martin; Göpfert, Thomas; Goeringer, Christian; Gössling, Claus; Göttfert, Tobias; Goldfarb, Steven; Golling, Tobias; Golovnia, Serguei; Gomes, Agostinho; Gomez Fajardo, Luz Stella; Gonçalo, Ricardo; Goncalves Pinto Firmino Da Costa, Joao; Gonella, Laura; Gonidec, Allain; Gonzalez, Saul; González de la Hoz, Santiago; Gonzalez Silva, Laura; Gonzalez-Sevilla, Sergio; Goodson, Jeremiah Jet; Goossens, Luc; Gorbounov, Petr Andreevich; Gordon, Howard; Gorelov, Igor; Gorfine, Grant; Gorini, Benedetto; Gorini, Edoardo; Gorišek, Andrej; Gornicki, Edward; Gorokhov, Serguei; Goryachev, Vladimir; Gosdzik, Bjoern; Gosselink, Martijn; Gostkin, Mikhail Ivanovitch; Gough Eschrich, Ivo; Gouighri, Mohamed; Goujdami, Driss; Goulette, Marc Phillippe; Goussiou, Anna; Goy, Corinne; Grabowska-Bold, Iwona; Grabski, Varlen; Grafström, Per; Grah, Christian; Grahn, Karl-Johan; Grancagnolo, Francesco; Grancagnolo, Sergio; Grassi, Valerio; Gratchev, Vadim; Grau, Nathan; Gray, Heather; Gray, Julia Ann; Graziani, Enrico; Grebenyuk, Oleg; Greenfield, Debbie; Greenshaw, Timothy; Greenwood, Zeno Dixon; Gregersen, Kristian; Gregor, Ingrid-Maria; Grenier, Philippe; Griffiths, Justin; Grigalashvili, Nugzar; Grillo, Alexander; Grinstein, Sebastian; Grishkevich, Yaroslav; Grivaz, Jean-Francois; Grognuz, Joel; Groh, Manfred; Gross, Eilam; Grosse-Knetter, Joern; Groth-Jensen, Jacob; Grybel, Kai; Guarino, Victor; Guest, Daniel; Guicheney, Christophe; Guida, Angelo; Guillemin, Thibault; Guindon, Stefan; Guler, Hulya; Gunther, Jaroslav; Guo, Bin; Guo, Jun; Gupta, Ambreesh; Gusakov, Yury; Gushchin, Vladimir; Gutierrez, Andrea; Gutierrez, Phillip; Guttman, Nir; Gutzwiller, Olivier; Guyot, Claude; Gwenlan, Claire; Gwilliam, Carl; Haas, Andy; Haas, Stefan; Haber, Carl; Hackenburg, Robert; Hadavand, Haleh Khani; Hadley, David; Haefner, Petra; Hahn, Ferdinand; Haider, Stefan; Hajduk, Zbigniew; Hakobyan, Hrachya; Haller, Johannes; Hamacher, Klaus; Hamal, Petr; Hamilton, Andrew; Hamilton, Samuel; Han, Hongguang; Han, Liang; Hanagaki, Kazunori; Hance, Michael; Handel, Carsten; Hanke, Paul; Hansen, John Renner; Hansen, Jørgen Beck; Hansen, Jorn Dines; Hansen, Peter Henrik; Hansson, Per; Hara, Kazuhiko; Hare, Gabriel; Harenberg, Torsten; Harkusha, Siarhei; Harper, Devin; Harrington, Robert; Harris, Orin; Harrison, Karl; Hartert, Jochen; Hartjes, Fred; Haruyama, Tomiyoshi; Harvey, Alex; Hasegawa, Satoshi; Hasegawa, Yoji; Hassani, Samira; Hatch, Mark; Hauff, Dieter; Haug, Sigve; Hauschild, Michael; Hauser, Reiner; Havranek, Miroslav; Hawes, Brian; Hawkes, Christopher; Hawkings, Richard John; Hawkins, Donovan; Hayakawa, Takashi; Hayden, Daniel; Hayward, Helen; Haywood, Stephen; Hazen, Eric; He, Mao; Head, Simon; Hedberg, Vincent; Heelan, Louise; Heim, Sarah; Heinemann, Beate; Heisterkamp, Simon; Helary, Louis; Heller, Mathieu; Hellman, Sten; Hellmich, Dennis; Helsens, Clement; Henderson, Robert; Henke, Michael; Henrichs, Anna; Henriques Correia, Ana Maria; Henrot-Versille, Sophie; Henry-Couannier, Frédéric; Hensel, Carsten; Henß, Tobias; Medina Hernandez, Carlos; Hernández Jiménez, Yesenia; Herrberg, Ruth; Hershenhorn, Alon David; Herten, Gregor; Hertenberger, Ralf; Hervas, Luis; Hessey, Nigel; Hidvegi, Attila; Higón-Rodriguez, Emilio; Hill, Daniel; Hill, John; Hill, Norman; Hiller, Karl Heinz; Hillert, Sonja; Hillier, Stephen; Hinchliffe, Ian; Hines, Elizabeth; Hirose, Minoru; Hirsch, Florian; Hirschbuehl, Dominic; Hobbs, John; Hod, Noam; Hodgkinson, Mark; Hodgson, Paul; Hoecker, Andreas; Hoeferkamp, Martin; Hoffman, Julia; Hoffmann, Dirk; Hohlfeld, Marc; Holder, Martin; Holmgren, Sven-Olof; Holy, Tomas; Holzbauer, Jenny; Homma, Yasuhiro; Hong, Tae Min; Hooft van Huysduynen, Loek; Horazdovsky, Tomas; Horn, Claus; Horner, Stephan; Horton, Katherine; Hostachy, Jean-Yves; Hou, Suen; Houlden, Michael; Hoummada, Abdeslam; Howarth, James; Howell, David; Hristova, Ivana; Hrivnac, Julius; Hruska, Ivan; Hryn'ova, Tetiana; Hsu, Pai-hsien Jennifer; Hsu, Shih-Chieh; Huang, Guang Shun; Hubacek, Zdenek; Hubaut, Fabrice; Huegging, Fabian; Huffman, Todd Brian; Hughes, Emlyn; Hughes, Gareth; Hughes-Jones, Richard; Huhtinen, Mika; Hurst, Peter; Hurwitz, Martina; Husemann, Ulrich; Huseynov, Nazim; Huston, Joey; Huth, John; Iacobucci, Giuseppe; Iakovidis, Georgios; Ibbotson, Michael; Ibragimov, Iskander; Ichimiya, Ryo; Iconomidou-Fayard, Lydia; Idarraga, John; Idzik, Marek; Iengo, Paolo; Igonkina, Olga; Ikegami, Yoichi; Ikeno, Masahiro; Ilchenko, Yuri; Iliadis, Dimitrios; Imbault, Didier; Imhaeuser, Martin; Imori, Masatoshi; Ince, Tayfun; Inigo-Golfin, Joaquin; Ioannou, Pavlos; Iodice, Mauro; Ionescu, Gelu; Irles Quiles, Adrian; Ishii, Koji; Ishikawa, Akimasa; Ishino, Masaya; Ishmukhametov, Renat; Issever, Cigdem; Istin, Serhat; Ivashin, Anton; Iwanski, Wieslaw; Iwasaki, Hiroyuki; Izen, Joseph; Izzo, Vincenzo; Jackson, Brett; Jackson, John; Jackson, Paul; Jaekel, Martin; Jain, Vivek; Jakobs, Karl; Jakobsen, Sune; Jakubek, Jan; Jana, Dilip; Jankowski, Ernest; Jansen, Eric; Jantsch, Andreas; Janus, Michel; Jarlskog, Göran; Jeanty, Laura; Jelen, Kazimierz; Jen-La Plante, Imai; Jenni, Peter; Jeremie, Andrea; Jež, Pavel; Jézéquel, Stéphane; Jha, Manoj Kumar; Ji, Haoshuang; Ji, Weina; Jia, Jiangyong; Jiang, Yi; Jimenez Belenguer, Marcos; Jin, Ge; Jin, Shan; Jinnouchi, Osamu; Joergensen, Morten Dam; Joffe, David; Johansen, Lars; Johansen, Marianne; Johansson, Erik; Johansson, Per; Johnert, Sebastian; Johns, Kenneth; Jon-And, Kerstin; Jones, Graham; Jones, Roger; Jones, Tegid; Jones, Tim; Jonsson, Ove; Joram, Christian; Jorge, Pedro; Joseph, John; Jovin, Tatjana; Ju, Xiangyang; Juranek, Vojtech; Jussel, Patrick; Juste Rozas, Aurelio; Kabachenko, Vasily; Kabana, Sonja; Kaci, Mohammed; Kaczmarska, Anna; Kadlecik, Peter; Kado, Marumi; Kagan, Harris; Kagan, Michael; Kaiser, Steffen; Kajomovitz, Enrique; Kalinin, Sergey; Kalinovskaya, Lidia; Kama, Sami; Kanaya, Naoko; Kaneda, Michiru; Kanno, Takayuki; Kantserov, Vadim; Kanzaki, Junichi; Kaplan, Benjamin; Kapliy, Anton; Kaplon, Jan; Kar, Deepak; Karagoz, Muge; Karnevskiy, Mikhail; Karr, Kristo; Kartvelishvili, Vakhtang; Karyukhin, Andrey; Kashif, Lashkar; Kasmi, Azzedine; Kass, Richard; Kastanas, Alex; Kataoka, Mayuko; Kataoka, Yousuke; Katsoufis, Elias; Katzy, Judith; Kaushik, Venkatesh; Kawagoe, Kiyotomo; Kawamoto, Tatsuo; Kawamura, Gen; Kayl, Manuel; Kazanin, Vassili; Kazarinov, Makhail; Keates, James Robert; Keeler, Richard; Kehoe, Robert; Keil, Markus; Kekelidze, George; Kelly, Marc; Kennedy, John; Kenney, Christopher John; Kenyon, Mike; Kepka, Oldrich; Kerschen, Nicolas; Kerševan, Borut Paul; Kersten, Susanne; Kessoku, Kohei; Ketterer, Christian; Keung, Justin; Khakzad, Mohsen; Khalil-zada, Farkhad; Khandanyan, Hovhannes; Khanov, Alexander; Kharchenko, Dmitri; Khodinov, Alexander; Kholodenko, Anatoli; Khomich, Andrei; Khoo, Teng Jian; Khoriauli, Gia; Khoroshilov, Andrey; Khovanskiy, Nikolai; Khovanskiy, Valery; Khramov, Evgeniy; Khubua, Jemal; Kim, Hyeon Jin; Kim, Min Suk; Kim, Peter; Kim, Shinhong; Kimura, Naoki; Kind, Oliver; King, Barry; King, Matthew; King, Robert Steven Beaufoy; Kirk, Julie; Kirsch, Lawrence; Kiryunin, Andrey; Kishimoto, Tomoe; Kisielewska, Danuta; Kittelmann, Thomas; Kiver, Andrey; Kladiva, Eduard; Klaiber-Lodewigs, Jonas; Klein, Max; Klein, Uta; Kleinknecht, Konrad; Klemetti, Miika; Klier, Amit; Klimentov, Alexei; Klingenberg, Reiner; Klinkby, Esben; Klioutchnikova, Tatiana; Klok, Peter; Klous, Sander; Kluge, Eike-Erik; Kluge, Thomas; Kluit, Peter; Kluth, Stefan; Knecht, Neil; Kneringer, Emmerich; Knobloch, Juergen; Knoops, Edith; Knue, Andrea; Ko, Byeong Rok; Kobayashi, Tomio; Kobel, Michael; Kocian, Martin; Kocnar, Antonin; Kodys, Peter; Köneke, Karsten; König, Adriaan; Koenig, Sebastian; Köpke, Lutz; Koetsveld, Folkert; Koevesarki, Peter; Koffas, Thomas; Koffeman, Els; Kohn, Fabian; Kohout, Zdenek; Kohriki, Takashi; Koi, Tatsumi; Kokott, Thomas; Kolachev, Guennady; Kolanoski, Hermann; Kolesnikov, Vladimir; Koletsou, Iro; Koll, James; Kollar, Daniel; Kollefrath, Michael; Kolya, Scott; Komar, Aston; Komori, Yuto; Kondo, Takahiko; Kono, Takanori; Kononov, Anatoly; Konoplich, Rostislav; Konstantinidis, Nikolaos; Kootz, Andreas; Koperny, Stefan; Kopikov, Sergey; Korcyl, Krzysztof; Kordas, Kostantinos; Koreshev, Victor; Korn, Andreas; Korol, Aleksandr; Korolkov, Ilya; Korolkova, Elena; Korotkov, Vladislav; Kortner, Oliver; Kortner, Sandra; Kostyukhin, Vadim; Kotamäki, Miikka Juhani; Kotov, Sergey; Kotov, Vladislav; Kotwal, Ashutosh; Kourkoumelis, Christine; Kouskoura, Vasiliki; Koutsman, Alex; Kowalewski, Robert Victor; Kowalski, Tadeusz; Kozanecki, Witold; Kozhin, Anatoly; Kral, Vlastimil; Kramarenko, Viktor; Kramberger, Gregor; Krasny, Mieczyslaw Witold; Krasznahorkay, Attila; Kraus, James; Kreisel, Arik; Krejci, Frantisek; Kretzschmar, Jan; Krieger, Nina; Krieger, Peter; Kroeninger, Kevin; Kroha, Hubert; Kroll, Joe; Kroseberg, Juergen; Krstic, Jelena; Kruchonak, Uladzimir; Krüger, Hans; Kruker, Tobias; Krumshteyn, Zinovii; Kruth, Andre; Kubota, Takashi; Kuehn, Susanne; Kugel, Andreas; Kuhl, Thorsten; Kuhn, Dietmar; Kukhtin, Victor; Kulchitsky, Yuri; Kuleshov, Sergey; Kummer, Christian; Kuna, Marine; Kundu, Nikhil; Kunkle, Joshua; Kupco, Alexander; Kurashige, Hisaya; Kurata, Masakazu; Kurochkin, Yurii; Kus, Vlastimil; Kuykendall, William; Kuze, Masahiro; Kuzhir, Polina; Kvita, Jiri; Kwee, Regina; La Rosa, Alessandro; La Rotonda, Laura; Labarga, Luis; Labbe, Julien; Lablak, Said; Lacasta, Carlos; Lacava, Francesco; Lacker, Heiko; Lacour, Didier; Lacuesta, Vicente Ramón; Ladygin, Evgueni; Lafaye, Rémi; Laforge, Bertrand; Lagouri, Theodota; Lai, Stanley; Laisne, Emmanuel; Lamanna, Massimo; Lampen, Caleb; Lampl, Walter; Lancon, Eric; Landgraf, Ulrich; Landon, Murrough; Landsman, Hagar; Lane, Jenna; Lange, Clemens; Lankford, Andrew; Lanni, Francesco; Lantzsch, Kerstin; Laplace, Sandrine; Lapoire, Cecile; Laporte, Jean-Francois; Lari, Tommaso; Larionov, Anatoly; Larner, Aimee; Lasseur, Christian; Lassnig, Mario; Laurelli, Paolo; Lavorato, Antonia; Lavrijsen, Wim; Laycock, Paul; Lazarev, Alexandre; Le Dortz, Olivier; Le Guirriec, Emmanuel; Le Maner, Christophe; Le Menedeu, Eve; Lebel, Céline; LeCompte, Thomas; Ledroit-Guillon, Fabienne Agnes Marie; Lee, Hurng-Chun; Lee, Jason; Lee, Shih-Chang; Lee, Lawrence; Lefebvre, Michel; Legendre, Marie; Leger, Annie; LeGeyt, Benjamin; Legger, Federica; Leggett, Charles; Lehmacher, Marc; Lehmann Miotto, Giovanna; Lei, Xiaowen; Leite, Marco Aurelio Lisboa; Leitner, Rupert; Lellouch, Daniel; Leltchouk, Mikhail; Lemmer, Boris; Lendermann, Victor; Leney, Katharine; Lenz, Tatiana; Lenzen, Georg; Lenzi, Bruno; Leonhardt, Kathrin; Leontsinis, Stefanos; Leroy, Claude; Lessard, Jean-Raphael; Lesser, Jonas; Lester, Christopher; Leung Fook Cheong, Annabelle; Levêque, Jessica; Levin, Daniel; Levinson, Lorne; Levitski, Mikhail; Lewandowska, Marta; Lewis, Adrian; Lewis, George; Leyko, Agnieszka; Leyton, Michael; Li, Bo; Li, Haifeng; Li, Shu; Li, Xuefei; Liang, Zhihua; Liang, Zhijun; Liao, Hongbo; Liberti, Barbara; Lichard, Peter; Lichtnecker, Markus; Lie, Ki; Liebig, Wolfgang; Lifshitz, Ronen; Lilley, Joseph; Limbach, Christian; Limosani, Antonio; Limper, Maaike; Lin, Simon; Linde, Frank; Linnemann, James; Lipeles, Elliot; Lipinsky, Lukas; Lipniacka, Anna; Liss, Tony; Lissauer, David; Lister, Alison; Litke, Alan; Liu, Chuanlei; Liu, Dong; Liu, Hao; Liu, Jianbei; Liu, Minghui; Liu, Shengli; Liu, Yanwen; Livan, Michele; Livermore, Sarah; Lleres, Annick; Llorente Merino, Javier; Lloyd, Stephen; Lobodzinska, Ewelina; Loch, Peter; Lockman, William; Loddenkoetter, Thomas; Loebinger, Fred; Loginov, Andrey; Loh, Chang Wei; Lohse, Thomas; Lohwasser, Kristin; Lokajicek, Milos; Loken, James; Lombardo, Vincenzo Paolo; Long, Robin Eamonn; Lopes, Lourenco; Lopez Mateos, David; Losada, Marta; Loscutoff, Peter; Lo Sterzo, Francesco; Losty, Michael; Lou, Xinchou; Lounis, Abdenour; Loureiro, Karina; Love, Jeremy; Love, Peter; Lowe, Andrew; Lu, Feng; Lubatti, Henry; Luci, Claudio; Lucotte, Arnaud; Ludwig, Andreas; Ludwig, Dörthe; Ludwig, Inga; Ludwig, Jens; Luehring, Frederick; Luijckx, Guy; Lumb, Debra; Luminari, Lamberto; Lund, Esben; Lund-Jensen, Bengt; Lundberg, Björn; Lundberg, Johan; Lundquist, Johan; Lungwitz, Matthias; Lupi, Anna; Lutz, Gerhard; Lynn, David; Lys, Jeremy; Lytken, Else; Ma, Hong; Ma, Lian Liang; Macana Goia, Jorge Andres; Maccarrone, Giovanni; Macchiolo, Anna; Maček, Boštjan; Machado Miguens, Joana; Mackeprang, Rasmus; Madaras, Ronald; Mader, Wolfgang; Maenner, Reinhard; Maeno, Tadashi; Mättig, Peter; Mättig, Stefan; Magnoni, Luca; Magradze, Erekle; Mahalalel, Yair; Mahboubi, Kambiz; Mahout, Gilles; Maiani, Camilla; Maidantchik, Carmen; Maio, Amélia; Majewski, Stephanie; Makida, Yasuhiro; Makovec, Nikola; Mal, Prolay; Malecki, Pawel; Malecki, Piotr; Maleev, Victor; Malek, Fairouz; Mallik, Usha; Malon, David; Malone, Caitlin; Maltezos, Stavros; Malyshev, Vladimir; Malyukov, Sergei; Mameghani, Raphael; Mamuzic, Judita; Manabe, Atsushi; Mandelli, Luciano; Mandić, Igor; Mandrysch, Rocco; Maneira, José; Mangeard, Pierre-Simon; Manjavidze, Ioseb; Mann, Alexander; Manning, Peter; Manousakis-Katsikakis, Arkadios; Mansoulie, Bruno; Manz, Andreas; Mapelli, Alessandro; Mapelli, Livio; March, Luis; Marchand, Jean-Francois; Marchese, Fabrizio; Marchiori, Giovanni; Marcisovsky, Michal; Marin, Alexandru; Marino, Christopher; Marroquim, Fernando; Marshall, Robin; Marshall, Zach; Martens, Kalen; Marti-Garcia, Salvador; Martin, Andrew; Martin, Brian; Martin, Brian Thomas; Martin, Franck Francois; Martin, Jean-Pierre; Martin, Philippe; Martin, Tim; Martin, Victoria Jane; Martin dit Latour, Bertrand; Martin–Haugh, Stewart; Martinez, Mario; Martinez Outschoorn, Verena; Martyniuk, Alex; Marx, Marilyn; Marzano, Francesco; Marzin, Antoine; Masetti, Lucia; Mashimo, Tetsuro; Mashinistov, Ruslan; Masik, Jiri; Maslennikov, Alexey; Massa, Ignazio; Massaro, Graziano; Massol, Nicolas; Mastrandrea, Paolo; Mastroberardino, Anna; Masubuchi, Tatsuya; Mathes, Markus; Matricon, Pierre; Matsumoto, Hiroshi; Matsunaga, Hiroyuki; Matsushita, Takashi; Mattravers, Carly; Maugain, Jean-Marie; Maxfield, Stephen; Maximov, Dmitriy; May, Edward; Mayne, Anna; Mazini, Rachid; Mazur, Michael; Mazzanti, Marcello; Mazzoni, Enrico; Mc Kee, Shawn Patrick; McCarn, Allison; McCarthy, Robert; McCarthy, Tom; McCubbin, Norman; McFarlane, Kenneth; Mcfayden, Josh; McGlone, Helen; Mchedlidze, Gvantsa; McLaren, Robert Andrew; Mclaughlan, Tom; McMahon, Steve; McPherson, Robert; Meade, Andrew; Mechnich, Joerg; Mechtel, Markus; Medinnis, Mike; Meera-Lebbai, Razzak; Meguro, Tatsuma; Mehdiyev, Rashid; Mehlhase, Sascha; Mehta, Andrew; Meier, Karlheinz; Meinhardt, Jens; Meirose, Bernhard; Melachrinos, Constantinos; Mellado Garcia, Bruce Rafael; Mendoza Navas, Luis; Meng, Zhaoxia; Mengarelli, Alberto; Menke, Sven; Menot, Claude; Meoni, Evelin; Mercurio, Kevin Michael; Mermod, Philippe; Merola, Leonardo; Meroni, Chiara; Merritt, Frank; Messina, Andrea; Metcalfe, Jessica; Mete, Alaettin Serhan; Meuser, Stefan; Meyer, Carsten; Meyer, Jean-Pierre; Meyer, Jochen; Meyer, Joerg; Meyer, Thomas Christian; Meyer, W Thomas; Miao, Jiayuan; Michal, Sebastien; Micu, Liliana; Middleton, Robin; Miele, Paola; Migas, Sylwia; Mijović, Liza; Mikenberg, Giora; Mikestikova, Marcela; Mikuž, Marko; Miller, David; Miller, Robert; Mills, Bill; Mills, Corrinne; Milov, Alexander; Milstead, David; Milstein, Dmitry; Minaenko, Andrey; Miñano, Mercedes; Minashvili, Irakli; Mincer, Allen; Mindur, Bartosz; Mineev, Mikhail; Ming, Yao; Mir, Lluisa-Maria; Mirabelli, Giovanni; Miralles Verge, Lluis; Misiejuk, Andrzej; Mitrevski, Jovan; Mitrofanov, Gennady; Mitsou, Vasiliki A; Mitsui, Shingo; Miyagawa, Paul; Miyazaki, Kazuki; Mjörnmark, Jan-Ulf; Moa, Torbjoern; Mockett, Paul; Moed, Shulamit; Moeller, Victoria; Mönig, Klaus; Möser, Nicolas; Mohapatra, Soumya; Mohr, Wolfgang; Mohrdieck-Möck, Susanne; Moisseev, Artemy; Moles-Valls, Regina; Molina-Perez, Jorge; Monk, James; Monnier, Emmanuel; Montesano, Simone; Monticelli, Fernando; Monzani, Simone; Moore, Roger; Moorhead, Gareth; Mora Herrera, Clemencia; Moraes, Arthur; Morange, Nicolas; Morel, Julien; Morello, Gianfranco; Moreno, Deywis; Moreno Llácer, María; Morettini, Paolo; Morii, Masahiro; Morin, Jerome; Morita, Youhei; Morley, Anthony Keith; Mornacchi, Giuseppe; Morozov, Sergey; Morris, John; Morvaj, Ljiljana; Moser, Hans-Guenther; Mosidze, Maia; Moss, Josh; Mount, Richard; Mountricha, Eleni; Mouraviev, Sergei; Moyse, Edward; Mudrinic, Mihajlo; Mueller, Felix; Mueller, James; Mueller, Klemens; Müller, Thomas; Muenstermann, Daniel; Muir, Alex; Munwes, Yonathan; Murray, Bill; Mussche, Ido; Musto, Elisa; Myagkov, Alexey; Myska, Miroslav; Nadal, Jordi; Nagai, Koichi; Nagano, Kunihiro; Nagasaka, Yasushi; Nairz, Armin Michael; Nakahama, Yu; Nakamura, Koji; Nakano, Itsuo; Nanava, Gizo; Napier, Austin; Nash, Michael; Nation, Nigel; Nattermann, Till; Naumann, Thomas; Navarro, Gabriela; Neal, Homer; Nebot, Eduardo; Nechaeva, Polina; Negri, Andrea; Negri, Guido; Nektarijevic, Snezana; Nelson, Andrew; Nelson, Silke; Nelson, Timothy Knight; Nemecek, Stanislav; Nemethy, Peter; Nepomuceno, Andre Asevedo; Nessi, Marzio; Nesterov, Stanislav; Neubauer, Mark; Neusiedl, Andrea; Neves, Ricardo; Nevski, Pavel; Newman, Paul; Nguyen Thi Hong, Van; Nickerson, Richard; Nicolaidou, Rosy; Nicolas, Ludovic; Nicquevert, Bertrand; Niedercorn, Francois; Nielsen, Jason; Niinikoski, Tapio; Nikiforou, Nikiforos; Nikiforov, Andriy; Nikolaenko, Vladimir; Nikolaev, Kirill; Nikolic-Audit, Irena; Nikolics, Katalin; Nikolopoulos, Konstantinos; Nilsen, Henrik; Nilsson, Paul; Ninomiya, Yoichi; Nisati, Aleandro; Nishiyama, Tomonori; Nisius, Richard; Nodulman, Lawrence; Nomachi, Masaharu; Nomidis, Ioannis; Nordberg, Markus; Nordkvist, Bjoern; Norton, Peter; Novakova, Jana; Nozaki, Mitsuaki; Nožička, Miroslav; Nozka, Libor; Nugent, Ian Michael; Nuncio-Quiroz, Adriana-Elizabeth; Nunes Hanninger, Guilherme; Nunnemann, Thomas; Nurse, Emily; Nyman, Tommi; O'Brien, Brendan Joseph; O'Neale, Steve; O'Neil, Dugan; O'Shea, Val; Oakham, Gerald; Oberlack, Horst; Ocariz, Jose; Ochi, Atsuhiko; Oda, Susumu; Odaka, Shigeru; Odier, Jerome; Ogren, Harold; Oh, Alexander; Oh, Seog; Ohm, Christian; Ohshima, Takayoshi; Ohshita, Hidetoshi; Ohska, Tokio Kenneth; Ohsugi, Takashi; Okada, Shogo; Okawa, Hideki; Okumura, Yasuyuki; Okuyama, Toyonobu; Olcese, Marco; Olchevski, Alexander; Oliveira, Miguel Alfonso; Oliveira Damazio, Denis; Oliver Garcia, Elena; Olivito, Dominick; Olszewski, Andrzej; Olszowska, Jolanta; Omachi, Chihiro; Onofre, António; Onyisi, Peter; Oram, Christopher; Oreglia, Mark; Oren, Yona; Orestano, Domizia; Orlov, Iliya; Oropeza Barrera, Cristina; Orr, Robert; Osculati, Bianca; Ospanov, Rustem; Osuna, Carlos; Otero y Garzon, Gustavo; Ottersbach, John; Ouchrif, Mohamed; Ould-Saada, Farid; Ouraou, Ahmimed; Ouyang, Qun; Owen, Mark; Owen, Simon; Ozcan, Veysi Erkcan; Ozturk, Nurcan; Pacheco Pages, Andres; Padilla Aranda, Cristobal; Pagan Griso, Simone; Paganis, Efstathios; Paige, Frank; Pajchel, Katarina; Palacino, Gabriel; Paleari, Chiara; Palestini, Sandro; Pallin, Dominique; Palma, Alberto; Palmer, Jody; Pan, Yibin; Panagiotopoulou, Evgenia; Panes, Boris; Panikashvili, Natalia; Panitkin, Sergey; Pantea, Dan; Panuskova, Monika; Paolone, Vittorio; Papadelis, Aras; Papadopoulou, Theodora; Paramonov, Alexander; Park, Woochun; Parker, Andy; Parodi, Fabrizio; Parsons, John; Parzefall, Ulrich; Pasqualucci, Enrico; Passeri, Antonio; Pastore, Fernanda; Pastore, Francesca; Pásztor, Gabriella; Pataraia, Sophio; Patel, Nikhul; Pater, Joleen; Patricelli, Sergio; Pauly, Thilo; Pecsy, Martin; Pedraza Morales, Maria Isabel; Peleganchuk, Sergey; Peng, Haiping; Pengo, Ruggero; Penson, Alexander; Penwell, John; Perantoni, Marcelo; Perez, Kerstin; Perez Cavalcanti, Tiago; Perez Codina, Estel; Pérez García-Estañ, María Teresa; Perez Reale, Valeria; Perini, Laura; Pernegger, Heinz; Perrino, Roberto; Perrodo, Pascal; Persembe, Seda; Peshekhonov, Vladimir; Petersen, Brian; Petersen, Jorgen; Petersen, Troels; Petit, Elisabeth; Petridis, Andreas; Petridou, Chariclia; Petrolo, Emilio; Petrucci, Fabrizio; Petschull, Dennis; Petteni, Michele; Pezoa, Raquel; Phan, Anna; Phillips, Alan; Phillips, Peter William; Piacquadio, Giacinto; Piccaro, Elisa; Piccinini, Maurizio; Pickford, Andrew; Piec, Sebastian Marcin; Piegaia, Ricardo; Pilcher, James; Pilkington, Andrew; Pina, João Antonio; Pinamonti, Michele; Pinder, Alex; Pinfold, James; Ping, Jialun; Pinto, Belmiro; Pirotte, Olivier; Pizio, Caterina; Placakyte, Ringaile; Plamondon, Mathieu; Plano, Will; Pleier, Marc-Andre; Pleskach, Anatoly; Poblaguev, Andrei; Poddar, Sahill; Podlyski, Fabrice; Poggioli, Luc; Poghosyan, Tatevik; Pohl, Martin; Polci, Francesco; Polesello, Giacomo; Policicchio, Antonio; Polini, Alessandro; Poll, James; Polychronakos, Venetios; Pomarede, Daniel Marc; Pomeroy, Daniel; Pommès, Kathy; Pontecorvo, Ludovico; Pope, Bernard; Popeneciu, Gabriel Alexandru; Popovic, Dragan; Poppleton, Alan; Portell Bueso, Xavier; Porter, Robert; Posch, Christoph; Pospelov, Guennady; Pospisil, Stanislav; Potrap, Igor; Potter, Christina; Potter, Christopher; Poulard, Gilbert; Poveda, Joaquin; Prabhu, Robindra; Pralavorio, Pascal; Prasad, Srivas; Pravahan, Rishiraj; Prell, Soeren; Pretzl, Klaus Peter; Pribyl, Lukas; Price, Darren; Price, Lawrence; Price, Michael John; Prichard, Paul; Prieur, Damien; Primavera, Margherita; Prokofiev, Kirill; Prokoshin, Fedor; Protopopescu, Serban; Proudfoot, James; Prudent, Xavier; Przysiezniak, Helenka; Psoroulas, Serena; Ptacek, Elizabeth; Pueschel, Elisa; Purdham, John; Purohit, Milind; Puzo, Patrick; Pylypchenko, Yuriy; Qian, Jianming; Qian, Zuxuan; Qin, Zhonghua; Quadt, Arnulf; Quarrie, David; Quayle, William; Quinonez, Fernando; Raas, Marcel; Radescu, Voica; Radics, Balint; Rador, Tonguc; Ragusa, Francesco; Rahal, Ghita; Rahimi, Amir; Rahm, David; Rajagopalan, Srinivasan; Rammensee, Michael; Rammes, Marcus; Ramstedt, Magnus; Randle-Conde, Aidan Sean; Randrianarivony, Koloina; Ratoff, Peter; Rauscher, Felix; Rauter, Emanuel; Raymond, Michel; Read, Alexander Lincoln; Rebuzzi, Daniela; Redelbach, Andreas; Redlinger, George; Reece, Ryan; Reeves, Kendall; Reichold, Armin; Reinherz-Aronis, Erez; Reinsch, Andreas; Reisinger, Ingo; Reljic, Dusan; Rembser, Christoph; Ren, Zhongliang; Renaud, Adrien; Renkel, Peter; Rescigno, Marco; Resconi, Silvia; Resende, Bernardo; Reznicek, Pavel; Rezvani, Reyhaneh; Richards, Alexander; Richter, Robert; Richter-Was, Elzbieta; Ridel, Melissa; Rieke, Stefan; Rijpstra, Manouk; Rijssenbeek, Michael; Rimoldi, Adele; Rinaldi, Lorenzo; Rios, Ryan Randy; Riu, Imma; Rivoltella, Giancesare; Rizatdinova, Flera; Rizvi, Eram; Robertson, Steven; Robichaud-Veronneau, Andree; Robinson, Dave; Robinson, James; Robinson, Mary; Robson, Aidan; Rocha de Lima, Jose Guilherme; Roda, Chiara; Roda Dos Santos, Denis; Rodier, Stephane; Rodriguez, Diego; Roe, Adam; Roe, Shaun; Røhne, Ole; Rojo, Victoria; Rolli, Simona; Romaniouk, Anatoli; Romanov, Victor; Romeo, Gaston; Roos, Lydia; Ros, Eduardo; Rosati, Stefano; Rosbach, Kilian; Rose, Anthony; Rose, Matthew; Rosenbaum, Gabriel; Rosenberg, Eli; Rosendahl, Peter Lundgaard; Rosenthal, Oliver; Rosselet, Laurent; Rossetti, Valerio; Rossi, Elvira; Rossi, Leonardo Paolo; Rossi, Lucio; Rotaru, Marina; Roth, Itamar; Rothberg, Joseph; Rousseau, David; Royon, Christophe; Rozanov, Alexander; Rozen, Yoram; Ruan, Xifeng; Rubinskiy, Igor; Ruckert, Benjamin; Ruckstuhl, Nicole; Rud, Viacheslav; Rudolph, Christian; Rudolph, Gerald; Rühr, Frederik; Ruggieri, Federico; Ruiz-Martinez, Aranzazu; Rulikowska-Zarebska, Elzbieta; Rumiantsev, Viktor; Rumyantsev, Leonid; Runge, Kay; Runolfsson, Ogmundur; Rurikova, Zuzana; Rusakovich, Nikolai; Rust, Dave; Rutherfoord, John; Ruwiedel, Christoph; Ruzicka, Pavel; Ryabov, Yury; Ryadovikov, Vasily; Ryan, Patrick; Rybar, Martin; Rybkin, Grigori; Ryder, Nick; Rzaeva, Sevda; Saavedra, Aldo; Sadeh, Iftach; Sadrozinski, Hartmut; Sadykov, Renat; Safai Tehrani, Francesco; Sakamoto, Hiroshi; Salamanna, Giuseppe; Salamon, Andrea; Saleem, Muhammad; Salihagic, Denis; Salnikov, Andrei; Salt, José; Salvachua Ferrando, Belén; Salvatore, Daniela; Salvatore, Pasquale Fabrizio; Salvucci, Antonio; Salzburger, Andreas; Sampsonidis, Dimitrios; Samset, Björn Hallvard; Sanchez, Arturo; Sandaker, Heidi; Sander, Heinz Georg; Sanders, Michiel; Sandhoff, Marisa; Sandoval, Tanya; Sandoval, Carlos; Sandstroem, Rikard; Sandvoss, Stephan; Sankey, Dave; Sansoni, Andrea; Santamarina Rios, Cibran; Santoni, Claudio; Santonico, Rinaldo; Santos, Helena; Saraiva, João; Sarangi, Tapas; Sarkisyan-Grinbaum, Edward; Sarri, Francesca; Sartisohn, Georg; Sasaki, Osamu; Sasaki, Takashi; Sasao, Noboru; Satsounkevitch, Igor; Sauvage, Gilles; Sauvan, Emmanuel; Sauvan, Jean-Baptiste; Savard, Pierre; Savinov, Vladimir; Savu, Dan Octavian; Savva, Panagiota; Sawyer, Lee; Saxon, David; Says, Louis-Pierre; Sbarra, Carla; Sbrizzi, Antonio; Scallon, Olivia; Scannicchio, Diana; Schaarschmidt, Jana; Schacht, Peter; Schäfer, Uli; Schaepe, Steffen; Schaetzel, Sebastian; Schaffer, Arthur; Schaile, Dorothee; Schamberger, R. Dean; Schamov, Andrey; Scharf, Veit; Schegelsky, Valery; Scheirich, Daniel; Schernau, Michael; Scherzer, Max; Schiavi, Carlo; Schieck, Jochen; Schioppa, Marco; Schlenker, Stefan; Schlereth, James; Schmidt, Evelyn; Schmieden, Kristof; Schmitt, Christian; Schmitt, Sebastian; Schmitz, Martin; Schöning, André; Schott, Matthias; Schouten, Doug; Schovancova, Jaroslava; Schram, Malachi; Schroeder, Christian; Schroer, Nicolai; Schuh, Silvia; Schuler, Georges; Schultes, Joachim; Schultz-Coulon, Hans-Christian; Schulz, Holger; Schumacher, Jan; Schumacher, Markus; Schumm, Bruce; Schune, Philippe; Schwanenberger, Christian; Schwartzman, Ariel; Schwemling, Philippe; Schwienhorst, Reinhard; Schwierz, Rainer; Schwindling, Jerome; Schwindt, Thomas; Scott, Bill; Searcy, Jacob; Sedykh, Evgeny; Segura, Ester; Seidel, Sally; Seiden, Abraham; Seifert, Frank; Seixas, José; Sekhniaidze, Givi; Seliverstov, Dmitry; Sellden, Bjoern; Sellers, Graham; Seman, Michal; Semprini-Cesari, Nicola; Serfon, Cedric; Serin, Laurent; Seuster, Rolf; Severini, Horst; Sevior, Martin; Sfyrla, Anna; Shabalina, Elizaveta; Shamim, Mansoora; Shan, Lianyou; Shank, James; Shao, Qi Tao; Shapiro, Marjorie; Shatalov, Pavel; Shaver, Leif; Shaw, Kate; Sherman, Daniel; Sherwood, Peter; Shibata, Akira; Shichi, Hideharu; Shimizu, Shima; Shimojima, Makoto; Shin, Taeksu; Shmeleva, Alevtina; Shochet, Mel; Short, Daniel; Shupe, Michael; Sicho, Petr; Sidoti, Antonio; Siebel, Anca-Mirela; Siegert, Frank; Siegrist, James; Sijacki, Djordje; Silbert, Ohad; Silva, José; Silver, Yiftah; Silverstein, Daniel; Silverstein, Samuel; Simak, Vladislav; Simard, Olivier; Simic, Ljiljana; Simion, Stefan; Simmons, Brinick; Simonyan, Margar; Sinervo, Pekka; Sinev, Nikolai; Sipica, Valentin; Siragusa, Giovanni; Sircar, Anirvan; Sisakyan, Alexei; Sivoklokov, Serguei; Sjölin, Jörgen; Sjursen, Therese; Skinnari, Louise Anastasia; Skovpen, Kirill; Skubic, Patrick; Skvorodnev, Nikolai; Slater, Mark; Slavicek, Tomas; Sliwa, Krzysztof; Sloan, Terrence; Sloper, John erik; Smakhtin, Vladimir; Smirnov, Sergei; Smirnova, Lidia; Smirnova, Oxana; Smith, Ben Campbell; Smith, Douglas; Smith, Kenway; Smizanska, Maria; Smolek, Karel; Snesarev, Andrei; Snow, Steve; Snow, Joel; Snuverink, Jochem; Snyder, Scott; Soares, Mara; Sobie, Randall; Sodomka, Jaromir; Soffer, Abner; Solans, Carlos; Solar, Michael; Solc, Jaroslav; Soldatov, Evgeny; Soldevila, Urmila; Solfaroli Camillocci, Elena; Solodkov, Alexander; Solovyanov, Oleg; Sondericker, John; Soni, Nitesh; Sopko, Vit; Sopko, Bruno; Sorbi, Massimo; Sosebee, Mark; Soukharev, Andrey; Spagnolo, Stefania; Spanò, Francesco; Spighi, Roberto; Spigo, Giancarlo; Spila, Federico; Spiriti, Eleuterio; Spiwoks, Ralf; Spousta, Martin; Spreitzer, Teresa; Spurlock, Barry; St Denis, Richard Dante; Stahl, Thorsten; Stahlman, Jonathan; Stamen, Rainer; Stanecka, Ewa; Stanek, Robert; Stanescu, Cristian; Stapnes, Steinar; Starchenko, Evgeny; Stark, Jan; Staroba, Pavel; Starovoitov, Pavel; Staude, Arnold; Stavina, Pavel; Stavropoulos, Georgios; Steele, Genevieve; Steinbach, Peter; Steinberg, Peter; Stekl, Ivan; Stelzer, Bernd; Stelzer, Harald Joerg; Stelzer-Chilton, Oliver; Stenzel, Hasko; Stevenson, Kyle; Stewart, Graeme; Stillings, Jan Andre; Stockmanns, Tobias; Stockton, Mark; Stoerig, Kathrin; Stoicea, Gabriel; Stonjek, Stefan; Strachota, Pavel; Stradling, Alden; Straessner, Arno; Strandberg, Jonas; Strandberg, Sara; Strandlie, Are; Strang, Michael; Strauss, Emanuel; Strauss, Michael; Strizenec, Pavol; Ströhmer, Raimund; Strom, David; Strong, John; Stroynowski, Ryszard; Strube, Jan; Stugu, Bjarne; Stumer, Iuliu; Stupak, John; Sturm, Philipp; Soh, Dart-yin; Su, Dong; Subramania, Halasya Siva; Succurro, Antonella; Sugaya, Yorihito; Sugimoto, Takuya; Suhr, Chad; Suita, Koichi; Suk, Michal; Sulin, Vladimir; Sultansoy, Saleh; Sumida, Toshi; Sun, Xiaohu; Sundermann, Jan Erik; Suruliz, Kerim; Sushkov, Serge; Susinno, Giancarlo; Sutton, Mark; Suzuki, Yu; Suzuki, Yuta; Svatos, Michal; Sviridov, Yuri; Swedish, Stephen; Sykora, Ivan; Sykora, Tomas; Szeless, Balazs; Sánchez, Javier; Ta, Duc; Tackmann, Kerstin; Taffard, Anyes; Tafirout, Reda; Taiblum, Nimrod; Takahashi, Yuta; Takai, Helio; Takashima, Ryuichi; Takeda, Hiroshi; Takeshita, Tohru; Talby, Mossadek; Talyshev, Alexey; Tamsett, Matthew; Tanaka, Junichi; Tanaka, Reisaburo; Tanaka, Satoshi; Tanaka, Shuji; Tanaka, Yoshito; Tani, Kazutoshi; Tannoury, Nancy; Tappern, Geoffrey; Tapprogge, Stefan; Tardif, Dominique; Tarem, Shlomit; Tarrade, Fabien; Tartarelli, Giuseppe Francesco; Tas, Petr; Tasevsky, Marek; Tassi, Enrico; Tatarkhanov, Mous; Tayalati, Yahya; Taylor, Christopher; Taylor, Frank; Taylor, Geoffrey; Taylor, Wendy; Teinturier, Marthe; Teixeira Dias Castanheira, Matilde; Teixeira-Dias, Pedro; Temming, Kim Katrin; Ten Kate, Herman; Teng, Ping-Kun; Terada, Susumu; Terashi, Koji; Terron, Juan; Terwort, Mark; Testa, Marianna; Teuscher, Richard; Thadome, Jocelyn; Therhaag, Jan; Theveneaux-Pelzer, Timothée; Thioye, Moustapha; Thoma, Sascha; Thomas, Juergen; Thompson, Emily; Thompson, Paul; Thompson, Peter; Thompson, Stan; Thomson, Evelyn; Thomson, Mark; Thun, Rudolf; Tian, Feng; Tic, Tomáš; Tikhomirov, Vladimir; Tikhonov, Yury; Timmermans, Charles; Tipton, Paul; Tique Aires Viegas, Florbela De Jes; Tisserant, Sylvain; Tobias, Jürgen; Toczek, Barbara; Todorov, Theodore; Todorova-Nova, Sharka; Toggerson, Brokk; Tojo, Junji; Tokár, Stanislav; Tokunaga, Kaoru; Tokushuku, Katsuo; Tollefson, Kirsten; Tomoto, Makoto; Tompkins, Lauren; Toms, Konstantin; Tong, Guoliang; Tonoyan, Arshak; Topfel, Cyril; Topilin, Nikolai; Torchiani, Ingo; Torrence, Eric; Torres, Heberth; Torró Pastor, Emma; Toth, Jozsef; Touchard, Francois; Tovey, Daniel; Traynor, Daniel; Trefzger, Thomas; Tremblet, Louis; Tricoli, Alesandro; Trigger, Isabel Marian; Trincaz-Duvoid, Sophie; Trinh, Thi Nguyet; Tripiana, Martin; Trischuk, William; Trivedi, Arjun; Trocmé, Benjamin; Troncon, Clara; Trottier-McDonald, Michel; Trzupek, Adam; Tsarouchas, Charilaos; Tseng, Jeffrey; Tsiakiris, Menelaos; Tsiareshka, Pavel; Tsionou, Dimitra; Tsipolitis, Georgios; Tsiskaridze, Vakhtang; Tskhadadze, Edisher; Tsukerman, Ilya; Tsulaia, Vakhtang; Tsung, Jieh-Wen; Tsuno, Soshi; Tsybychev, Dmitri; Tua, Alan; Tuggle, Joseph; Turala, Michal; Turecek, Daniel; Turk Cakir, Ilkay; Turlay, Emmanuel; Turra, Ruggero; Tuts, Michael; Tykhonov, Andrii; Tylmad, Maja; Tyndel, Mike; Tyrvainen, Harri; Tzanakos, George; Uchida, Kirika; Ueda, Ikuo; Ueno, Ryuichi; Ugland, Maren; Uhlenbrock, Mathias; Uhrmacher, Michael; Ukegawa, Fumihiko; Unal, Guillaume; Underwood, David; Undrus, Alexander; Unel, Gokhan; Unno, Yoshinobu; Urbaniec, Dustin; Urkovsky, Evgeny; Urrejola, Pedro; Usai, Giulio; Uslenghi, Massimiliano; Vacavant, Laurent; Vacek, Vaclav; Vachon, Brigitte; Vahsen, Sven; Valenta, Jan; Valente, Paolo; Valentinetti, Sara; Valkar, Stefan; Valladolid Gallego, Eva; Vallecorsa, Sofia; Valls Ferrer, Juan Antonio; van der Graaf, Harry; van der Kraaij, Erik; Van Der Leeuw, Robin; van der Poel, Egge; van der Ster, Daniel; Van Eijk, Bob; van Eldik, Niels; van Gemmeren, Peter; van Kesteren, Zdenko; van Vulpen, Ivo; Vandelli, Wainer; Vandoni, Giovanna; Vaniachine, Alexandre; Vankov, Peter; Vannucci, Francois; Varela Rodriguez, Fernando; Vari, Riccardo; Varouchas, Dimitris; Vartapetian, Armen; Varvell, Kevin; Vassilakopoulos, Vassilios; Vazeille, Francois; Vegni, Guido; Veillet, Jean-Jacques; Vellidis, Constantine; Veloso, Filipe; Veness, Raymond; Veneziano, Stefano; Ventura, Andrea; Ventura, Daniel; Venturi, Manuela; Venturi, Nicola; Vercesi, Valerio; Verducci, Monica; Verkerke, Wouter; Vermeulen, Jos; Vest, Anja; Vetterli, Michel; Vichou, Irene; Vickey, Trevor; Vickey Boeriu, Oana Elena; Viehhauser, Georg; Viel, Simon; Villa, Mauro; Villaplana Perez, Miguel; Vilucchi, Elisabetta; Vincter, Manuella; Vinek, Elisabeth; Vinogradov, Vladimir; Virchaux, Marc; Virzi, Joseph; Vitells, Ofer; Viti, Michele; Vivarelli, Iacopo; Vives Vaque, Francesc; Vlachos, Sotirios; Vlasak, Michal; Vlasov, Nikolai; Vogel, Adrian; Vokac, Petr; Volpi, Guido; Volpi, Matteo; Volpini, Giovanni; von der Schmitt, Hans; von Loeben, Joerg; von Radziewski, Holger; von Toerne, Eckhard; Vorobel, Vit; Vorobiev, Alexander; Vorwerk, Volker; Vos, Marcel; Voss, Rudiger; Voss, Thorsten Tobias; Vossebeld, Joost; Vranjes, Nenad; Vranjes Milosavljevic, Marija; Vrba, Vaclav; Vreeswijk, Marcel; Vu Anh, Tuan; Vuillermet, Raphael; Vukotic, Ilija; Wagner, Wolfgang; Wagner, Peter; Wahlen, Helmut; Wakabayashi, Jun; Walbersloh, Jorg; Walch, Shannon; Walder, James; Walker, Rodney; Walkowiak, Wolfgang; Wall, Richard; Waller, Peter; Wang, Chiho; Wang, Haichen; Wang, Hulin; Wang, Jike; Wang, Jin; Wang, Joshua C; Wang, Rui; Wang, Song-Ming; Warburton, Andreas; Ward, Patricia; Warsinsky, Markus; Watkins, Peter; Watson, Alan; Watson, Miriam; Watts, Gordon; Watts, Stephen; Waugh, Anthony; Waugh, Ben; Weber, Jens; Weber, Marc; Weber, Michele; Weber, Pavel; Weidberg, Anthony; Weigell, Philipp; Weingarten, Jens; Weiser, Christian; Wellenstein, Hermann; Wells, Phillippa; Wen, Mei; Wenaus, Torre; Wendler, Shanti; Weng, Zhili; Wengler, Thorsten; Wenig, Siegfried; Wermes, Norbert; Werner, Matthias; Werner, Per; Werth, Michael; Wessels, Martin; Weydert, Carole; Whalen, Kathleen; Wheeler-Ellis, Sarah Jane; Whitaker, Scott; White, Andrew; White, Martin; Whitehead, Samuel Robert; Whiteson, Daniel; Whittington, Denver; Wicek, Francois; Wicke, Daniel; Wickens, Fred; Wiedenmann, Werner; Wielers, Monika; Wienemann, Peter; Wiglesworth, Craig; Wiik, Liv Antje Mari; Wijeratne, Peter Alexander; Wildauer, Andreas; Wildt, Martin Andre; Wilhelm, Ivan; Wilkens, Henric George; Will, Jonas Zacharias; Williams, Eric; Williams, Hugh; Willis, William; Willocq, Stephane; Wilson, John; Wilson, Michael Galante; Wilson, Alan; Wingerter-Seez, Isabelle; Winkelmann, Stefan; Winklmeier, Frank; Wittgen, Matthias; Wolter, Marcin Wladyslaw; Wolters, Helmut; Wong, Wei-Cheng; Wooden, Gemma; Wosiek, Barbara; Wotschack, Jorg; Woudstra, Martin; Wraight, Kenneth; Wright, Catherine; Wrona, Bozydar; Wu, Sau Lan; Wu, Xin; Wu, Yusheng; Wulf, Evan; Wunstorf, Renate; Wynne, Benjamin; Xaplanteris, Leonidas; Xella, Stefania; Xie, Song; Xie, Yigang; Xu, Chao; Xu, Da; Xu, Guofa; Yabsley, Bruce; Yacoob, Sahal; Yamada, Miho; Yamaguchi, Hiroshi; Yamamoto, Akira; Yamamoto, Kyoko; Yamamoto, Shimpei; Yamamura, Taiki; Yamanaka, Takashi; Yamaoka, Jared; Yamazaki, Takayuki; Yamazaki, Yuji; Yan, Zhen; Yang, Haijun; Yang, Un-Ki; Yang, Yi; Yang, Yi; Yang, Zhaoyu; Yanush, Serguei; Yao, Yushu; Yasu, Yoshiji; Ybeles Smit, Gabriel Valentijn; Ye, Jingbo; Ye, Shuwei; Yilmaz, Metin; Yoosoofmiya, Reza; Yorita, Kohei; Yoshida, Riktura; Young, Charles; Youssef, Saul; Yu, Dantong; Yu, Jaehoon; Yu, Jie; Yuan, Li; Yurkewicz, Adam; Zaets, Vassilli; Zaidan, Remi; Zaitsev, Alexander; Zajacova, Zuzana; Zalite, Youris; Zanello, Lucia; Zarzhitsky, Pavel; Zaytsev, Alexander; Zeitnitz, Christian; Zeller, Michael; Zeman, Martin; Zemla, Andrzej; Zendler, Carolin; Zenin, Oleg; Ženiš, Tibor; Zenonos, Zenonas; Zenz, Seth; Zerwas, Dirk; Zevi della Porta, Giovanni; Zhan, Zhichao; Zhang, Dongliang; Zhang, Huaqiao; Zhang, Jinlong; Zhang, Xueyao; Zhang, Zhiqing; Zhao, Long; Zhao, Tianchi; Zhao, Zhengguo; Zhemchugov, Alexey; Zheng, Shuchen; Zhong, Jiahang; Zhou, Bing; Zhou, Ning; Zhou, Yue; Zhu, Cheng Guang; Zhu, Hongbo; Zhu, Junjie; Zhu, Yingchun; Zhuang, Xuai; Zhuravlov, Vadym; Zieminska, Daria; Zimmermann, Robert; Zimmermann, Simone; Zimmermann, Stephanie; Ziolkowski, Michael; Zitoun, Robert; Živković, Lidija; Zmouchko, Viatcheslav; Zobernig, Georg; Zoccoli, Antonio; Zolnierowski, Yves; Zsenei, Andras; zur Nedden, Martin; Zutshi, Vishnu; Zwalinski, Lukasz

    2013-07-16

    A search for the Standard Model Higgs boson in the two photon decay channel is reported, using 1.08 fb^-1 of proton-proton collision data at a centre-of-mass energy of 7 TeV recorded by the ATLAS detector. No significant excess is observed in the investigated mass range of 110-150 GeV. Upper limits on the cross-section times branching ratio of between 2.0 and 5.8 times the Standard Model prediction are derived for this mass range.

  1. Search for tt-bar resonances and implications for new physics models

    International Nuclear Information System (INIS)

    Khalatyan, S.

    2014-01-01

    CMS and ATLAS experiments searched for top quark pair resonances using 2001 data recorded in pp collisions at √(s)=7 TeV at the Large Hadron Collider in all final states: dilepton, lepton+jets, and all hadronic. No significant deviation over backgrounds are observed. The experiments have set 95% confidence level upper limits on the resonance production cross section times branching ratio, and reported the excluded resonance mass region. (author)

  2. A template bank to search for gravitational waves from inspiralling compact binaries: II. Phenomenological model

    International Nuclear Information System (INIS)

    Cokelaer, T

    2007-01-01

    Matched filtering is used to search for gravitational waves emitted by inspiralling compact binaries in data from ground-based interferometers. One of the key aspects of the detection process is the deployment of a set of templates, also called a template bank, to cover the astrophysically interesting region of the parameter space. In a companion paper, we described the template bank algorithm used in the analysis of Laser Interferometer Gravitational-Wave Observatory (LIGO) data to search for signals from non-spinning binaries made of neutron star and/or stellar-mass black holes; this template bank is based upon physical template families. In this paper, we describe the phenomenological template bank that was used to search for gravitational waves from non-spinning black hole binaries (from stellar mass formation) in the second, third and fourth LIGO science runs. We briefly explain the design of the bank, whose templates are based on a phenomenological detection template family. We show that this template bank gives matches greater than 95% with the physical template families that are expected to be captured by the phenomenological templates

  3. A Memory Hierarchy Model Based on Data Reuse for Full-Search Motion Estimation on High-Definition Digital Videos

    Directory of Open Access Journals (Sweden)

    Alba Sandyra Bezerra Lopes

    2012-01-01

    Full Text Available The motion estimation is the most complex module in a video encoder requiring a high processing throughput and high memory bandwidth, mainly when the focus is high-definition videos. The throughput problem can be solved increasing the parallelism in the internal operations. The external memory bandwidth may be reduced using a memory hierarchy. This work presents a memory hierarchy model for a full-search motion estimation core. The proposed memory hierarchy model is based on a data reuse scheme considering the full search algorithm features. The proposed memory hierarchy expressively reduces the external memory bandwidth required for the motion estimation process, and it provides a very high data throughput for the ME core. This throughput is necessary to achieve real time when processing high-definition videos. When considering the worst bandwidth scenario, this memory hierarchy is able to reduce the external memory bandwidth in 578 times. A case study for the proposed hierarchy, using 32×32 search window and 8×8 block size, was implemented and prototyped on a Virtex 4 FPGA. The results show that it is possible to reach 38 frames per second when processing full HD frames (1920×1080 pixels using nearly 299 Mbytes per second of external memory bandwidth.

  4. Large-Scale Recurrent Neural Network Based Modelling of Gene Regulatory Network Using Cuckoo Search-Flower Pollination Algorithm.

    Science.gov (United States)

    Mandal, Sudip; Khan, Abhinandan; Saha, Goutam; Pal, Rajat K

    2016-01-01

    The accurate prediction of genetic networks using computational tools is one of the greatest challenges in the postgenomic era. Recurrent Neural Network is one of the most popular but simple approaches to model the network dynamics from time-series microarray data. To date, it has been successfully applied to computationally derive small-scale artificial and real-world genetic networks with high accuracy. However, they underperformed for large-scale genetic networks. Here, a new methodology has been proposed where a hybrid Cuckoo Search-Flower Pollination Algorithm has been implemented with Recurrent Neural Network. Cuckoo Search is used to search the best combination of regulators. Moreover, Flower Pollination Algorithm is applied to optimize the model parameters of the Recurrent Neural Network formalism. Initially, the proposed method is tested on a benchmark large-scale artificial network for both noiseless and noisy data. The results obtained show that the proposed methodology is capable of increasing the inference of correct regulations and decreasing false regulations to a high degree. Secondly, the proposed methodology has been validated against the real-world dataset of the DNA SOS repair network of Escherichia coli. However, the proposed method sacrifices computational time complexity in both cases due to the hybrid optimization process.

  5. Increasing the persistence of a heterogeneous behavior chain: Studies of extinction in a rat model of search behavior of working dogs.

    Science.gov (United States)

    Thrailkill, Eric A; Kacelnik, Alex; Porritt, Fay; Bouton, Mark E

    2016-08-01

    Dogs trained to search for contraband perform a chain of behavior in which they first search for a target and then make a separate response that indicates to the trainer that they have found one. The dogs often conduct multiple searches without encountering a target and receiving the reinforcer (i.e., no contraband is present). Understanding extinction (i.e., the decline in work rate when reinforcers are no longer encountered) may assist in training dogs to work in conditions where targets are rare. We therefore trained rats on a search-target behavior chain modeled on the search behavior of working dogs. A discriminative stimulus signaled that a search response (e.g., chain pull) led to a second stimulus that set the occasion for a target response (e.g., lever press) that was reinforced by a food pellet. In Experiment 1 training with longer search durations and intermittent (partial) reinforcement of searching (i.e. some trials had no target present) both led to more persistent search responding in extinction. The loss of search behavior in extinction was primarily dependent on the number of non-reinforced searches rather than time searching without reinforcement. In Experiments 2 and 3, delivery of non-contingent reinforcers during extinction increased search persistence provided they had also been presented during training. Thus, results with rats suggest that the persistence of working dog performance (or chained behavior generally) may be improved by training with partial reinforcement of searching and non-contingent reinforcement during both training and work (extinction). Copyright © 2016 Elsevier B.V. All rights reserved.

  6. Combined search for the standard model Higgs boson decaying to a bb pair using the full CDF data set.

    Science.gov (United States)

    Aaltonen, T; Álvarez González, B; Amerio, S; Amidei, D; Anastassov, A; Annovi, A; Antos, J; Apollinari, G; Appel, J A; Arisawa, T; Artikov, A; Asaadi, J; Ashmanskas, W; Auerbach, B; Aurisano, A; Azfar, F; Badgett, W; Bae, T; Barbaro-Galtieri, A; Barnes, V E; Barnett, B A; Barria, P; Bartos, P; Bauce, M; Bedeschi, F; Behari, S; Bellettini, G; Bellinger, J; Benjamin, D; Beretvas, A; Bhatti, A; Binkley, M E; Bisello, D; Bizjak, I; Bland, K R; Blumenfeld, B; Bocci, A; Bodek, A; Bortoletto, D; Boudreau, J; Boveia, A; Brigliadori, L; Bromberg, C; Brucken, E; Budagov, J; Budd, H S; Burkett, K; Busetto, G; Bussey, P; Buzatu, A; Calamba, A; Calancha, C; Camarda, S; Campanelli, M; Campbell, M; Canelli, F; Carls, B; Carlsmith, D; Carosi, R; Carrillo, S; Carron, S; Casal, B; Casarsa, M; Castro, A; Catastini, P; Cauz, D; Cavaliere, V; Cavalli-Sforza, M; Cerri, A; Cerrito, L; Chen, Y C; Chertok, M; Chiarelli, G; Chlachidze, G; Chlebana, F; Cho, K; Chokheli, D; Chung, W H; Chung, Y S; Ciocci, M A; Clark, A; Clarke, C; Compostella, G; Convery, M E; Conway, J; Corbo, M; Cordelli, M; Cox, C A; Cox, D J; Crescioli, F; Cuevas, J; Culbertson, R; Dagenhart, D; d'Ascenzo, N; Datta, M; de Barbaro, P; Dell'Orso, M; Demortier, L; Deninno, M; Devoto, F; d'Errico, M; Di Canto, A; Di Ruzza, B; Dittmann, J R; D'Onofrio, M; Donati, S; Dong, P; Dorigo, M; Dorigo, T; Ebina, K; Elagin, A; Eppig, A; Erbacher, R; Errede, S; Ershaidat, N; Eusebi, R; Farrington, S; Feindt, M; Fernandez, J P; Ferrazza, C; Field, R; Flanagan, G; Forrest, R; Frank, M J; Franklin, M; Freeman, J C; Funakoshi, Y; Furic, I; Gallinaro, M; Garcia, J E; Garfinkel, A F; Garosi, P; Gerberich, H; Gerchtein, E; Giagu, S; Giakoumopoulou, V; Giannetti, P; Gibson, K; Ginsburg, C M; Giokaris, N; Giromini, P; Giurgiu, G; Glagolev, V; Glenzinski, D; Gold, M; Goldin, D; Goldschmidt, N; Golossanov, A; Gomez, G; Gomez-Ceballos, G; Goncharov, M; González, O; Gorelov, I; Goshaw, A T; Goulianos, K; Grinstein, S; Grosso-Pilcher, C; Group, R C; Guimaraes da Costa, J; Hahn, S R; Halkiadakis, E; Hamaguchi, A; Han, J Y; Happacher, F; Hara, K; Hare, D; Hare, M; Harr, R F; Hatakeyama, K; Hays, C; Heck, M; Heinrich, J; Herndon, M; Hewamanage, S; Hocker, A; Hopkins, W; Horn, D; Hou, S; Hughes, R E; Hurwitz, M; Husemann, U; Hussain, N; Hussein, M; Huston, J; Introzzi, G; Iori, M; Ivanov, A; James, E; Jang, D; Jayatilaka, B; Jeans, D T; Jeon, E J; Jindariani, S; Jones, M; Joo, K K; Jun, S Y; Junk, T R; Kamon, T; Karchin, P E; Kasmi, A; Kato, Y; Ketchum, W; Keung, J; Khotilovich, V; Kilminster, B; Kim, D H; Kim, H S; Kim, J E; Kim, M J; Kim, S B; Kim, S H; Kim, Y K; Kim, Y J; Kimura, N; Kirby, M; Klimenko, S; Knoepfel, K; Kondo, K; Kong, D J; Konigsberg, J; Kotwal, A V; Kreps, M; Kroll, J; Krop, D; Kruse, M; Krutelyov, V; Kuhr, T; Kurata, M; Kwang, S; Laasanen, A T; Lami, S; Lammel, S; Lancaster, M; Lander, R L; Lannon, K; Lath, A; Latino, G; LeCompte, T; Lee, E; Lee, H S; Lee, J S; Lee, S W; Leo, S; Leone, S; Lewis, J D; Limosani, A; Lin, C-J; Lindgren, M; Lipeles, E; Lister, A; Litvintsev, D O; Liu, C; Liu, H; Liu, Q; Liu, T; Lockwitz, S; Loginov, A; Lucchesi, D; Lueck, J; Lujan, P; Lukens, P; Lungu, G; Lys, J; Lysak, R; Madrak, R; Maeshima, K; Maestro, P; Malik, S; Manca, G; Manousakis-Katsikakis, A; Margaroli, F; Marino, C; Martínez, M; Mastrandrea, P; Matera, K; Mattson, M E; Mazzacane, A; Mazzanti, P; McFarland, K S; McIntyre, P; McNulty, R; Mehta, A; Mehtala, P; Mesropian, C; Miao, T; Mietlicki, D; Mitra, A; Miyake, H; Moed, S; Moggi, N; Mondragon, M N; Moon, C S; Moore, R; Morello, M J; Morlock, J; Movilla Fernandez, P; Mukherjee, A; Muller, Th; Murat, P; Mussini, M; Nachtman, J; Nagai, Y; Naganoma, J; Nakano, I; Napier, A; Nett, J; Neu, C; Neubauer, M S; Nielsen, J; Nodulman, L; Noh, S Y; Norniella, O; Oakes, L; Oh, S H; Oh, Y D; Oksuzian, I; Okusawa, T; Orava, R; Ortolan, L; Pagan Griso, S; Pagliarone, C; Palencia, E; Papadimitriou, V; Paramonov, A A; Patrick, J; Pauletta, G; Paulini, M; Paus, C; Pellett, D E; Penzo, A; Phillips, T J; Piacentino, G; Pianori, E; Pilot, J; Pitts, K; Plager, C; Pondrom, L; Poprocki, S; Potamianos, K; Prokoshin, F; Pranko, A; Ptohos, F; Punzi, G; Rahaman, A; Ramakrishnan, V; Ranjan, N; Redondo, I; Renton, P; Rescigno, M; Riddick, T; Rimondi, F; Ristori, L; Robson, A; Rodrigo, T; Rodriguez, T; Rogers, E; Rolli, S; Roser, R; Ruffini, F; Ruiz, A; Russ, J; Rusu, V; Safonov, A; Sakumoto, W K; Sakurai, Y; Santi, L; Sato, K; Saveliev, V; Savoy-Navarro, A; Schlabach, P; Schmidt, A; Schmidt, E E; Schwarz, T; Scodellaro, L; Scribano, A; Scuri, F; Seidel, S; Seiya, Y; Semenov, A; Sforza, F; Shalhout, S Z; Shears, T; Shepard, P F; Shimojima, M; Shochet, M; Shreyber-Tecker, I; Simonenko, A; Sinervo, P; Sliwa, K; Smith, J R; Snider, F D; Soha, A; Sorin, V; Song, H; Squillacioti, P; Stancari, M; St Denis, R; Stelzer, B; Stelzer-Chilton, O; Stentz, D; Strologas, J; Strycker, G L; Sudo, Y; Sukhanov, A; Suslov, I; Takemasa, K; Takeuchi, Y; Tang, J; Tecchio, M; Teng, P K; Thom, J; Thome, J; Thompson, G A; Thomson, E; Tipton, P; Toback, D; Tokar, S; Tollefson, K; Tomura, T; Tonelli, D; Torre, S; Torretta, D; Totaro, P; Trovato, M; Ukegawa, F; Uozumi, S; Varganov, A; Vázquez, F; Velev, G; Vellidis, C; Vidal, M; Vila, I; Vilar, R; Vizán, J; Vogel, M; Volpi, G; Wagner, P; Wagner, R L; Wakisaka, T; Wallny, R; Wang, S M; Warburton, A; Waters, D; Wester, W C; Whiteson, D; Wicklund, A B; Wicklund, E; Wilbur, S; Wick, F; Williams, H H; Wilson, J S; Wilson, P; Winer, B L; Wittich, P; Wolbers, S; Wolfe, H; Wright, T; Wu, X; Wu, Z; Yamamoto, K; Yamato, D; Yang, T; Yang, U K; Yang, Y C; Yao, W-M; Yeh, G P; Yi, K; Yoh, J; Yorita, K; Yoshida, T; Yu, G B; Yu, I; Yu, S S; Yun, J C; Zanetti, A; Zeng, Y; Zhou, C; Zucchelli, S

    2012-09-14

    We combine the results of searches for the standard model (SM) Higgs boson based on the full CDF Run II data set obtained from sqrt[s]=1.96  TeV pp collisions at the Fermilab Tevatron corresponding to an integrated luminosity of 9.45  fb(-1). The searches are conducted for Higgs bosons that are produced in association with a W or Z boson, have masses in the range 90-150  GeV/c(2), and decay into bb pairs. An excess of data is present that is inconsistent with the background prediction at the level of 2.5 standard deviations (the most significant local excess is 2.7 standard deviations).

  7. An Improved Global Harmony Search Algorithm for the Identification of Nonlinear Discrete-Time Systems Based on Volterra Filter Modeling

    Directory of Open Access Journals (Sweden)

    Zongyan Li

    2016-01-01

    Full Text Available This paper describes an improved global harmony search (IGHS algorithm for identifying the nonlinear discrete-time systems based on second-order Volterra model. The IGHS is an improved version of the novel global harmony search (NGHS algorithm, and it makes two significant improvements on the NGHS. First, the genetic mutation operation is modified by combining normal distribution and Cauchy distribution, which enables the IGHS to fully explore and exploit the solution space. Second, an opposition-based learning (OBL is introduced and modified to improve the quality of harmony vectors. The IGHS algorithm is implemented on two numerical examples, and they are nonlinear discrete-time rational system and the real heat exchanger, respectively. The results of the IGHS are compared with those of the other three methods, and it has been verified to be more effective than the other three methods on solving the above two problems with different input signals and system memory sizes.

  8. An Equilibrium Search Model of the Labor Market Entry of Second-Generation Immigrants and Ethnic Danes

    DEFF Research Database (Denmark)

    Gupta, Nabanita Datta; Kromann, Lene

    Using a search model for Danish labor market entrants, we are one of the first studies to test whether second‐generation immigrants have the same job‐offer arrival and layoff rates as ethnic Danes have. We contribute to the search literature by incorporating matching as a way to ensure sub......‐sample homogeneity. Thus, we match second‐generation immigrants to their ethnic Danish twins on the basis of parental characteristics and informal network quality. There are big differences before matching, but after matching, second‐generation immigrants perform as well or better than their ethnic Dane counterparts...... unemployed and significantly higher layoff rates than those of their ethnic Danish twins....

  9. Search for physics beyond the standard model in the high-mass diphoton spectrum at $13~\\mathrm{TeV}$

    CERN Document Server

    CMS Collaboration

    2018-01-01

    A search is performed for physics beyond the standard model in high-mass diphoton events from proton-proton collisions at $\\sqrt{s} = 13~\\mathrm{TeV}$, using data corresponding to an integrated luminosity of $35.9~\\mathrm{fb}^{-1}$, delivered in 2016 to the CMS detector by the CERN Large Hadron Collider. Both resonant and nonresonant new physics signatures are searched for, using different techniques to estimate the background. Constraints are placed on the mass of the first graviton excitation in the Randall--Sundrum warped extra dimension model in the range of $2$ to $4~\\mathrm{TeV}$, for values of the associated coupling parameter between $0.01$ and $0.2$. Limits on the production of scalar resonances and model-independent fiducial cross section upper limits are also provided. For the large extra dimension model of Arkani--Hamed, Dimopoulos, and Dvali, lower limits are set on the ultraviolet cutoff scale $M_S$ ranging from $5.6$ to $9.7~\\mathrm{TeV}$, depending on the model parameters. Limits are also set ...

  10. A model independent search for new physics in final states containing leptons at the D0 experiment

    International Nuclear Information System (INIS)

    Piper, Joel Michael

    2009-01-01

    The standard model is known to be the low energy limit of a more general theory. Several consequences of the standard model point to a strong probability of new physics becoming experimentally visible in high energy collisions of a few TeV, resulting in high momentum objects. The specific signatures of these collisions are topics of much debate. Rather than choosing a specific signature, this analysis broadly searches the data, preferring breadth over sensitivity. In searching for new physics, several different approaches are used. These include the comparison of data with standard model background expectation in overall number of events, comparisons of distributions of many kinematic variables, and finally comparisons on the tails of distributions that sum the momenta of the objects in an event. With 1.07 fb -1 at the D0 experiment, we find no evidence of physics beyond the standard model. Several discrepancies from the standard model were found, but none of these provide a compelling case for new physics.

  11. A Hybrid Neural Network Model for Sales Forecasting Based on ARIMA and Search Popularity of Article Titles.

    Science.gov (United States)

    Omar, Hani; Hoang, Van Hai; Liu, Duen-Ren

    2016-01-01

    Enhancing sales and operations planning through forecasting analysis and business intelligence is demanded in many industries and enterprises. Publishing industries usually pick attractive titles and headlines for their stories to increase sales, since popular article titles and headlines can attract readers to buy magazines. In this paper, information retrieval techniques are adopted to extract words from article titles. The popularity measures of article titles are then analyzed by using the search indexes obtained from Google search engine. Backpropagation Neural Networks (BPNNs) have successfully been used to develop prediction models for sales forecasting. In this study, we propose a novel hybrid neural network model for sales forecasting based on the prediction result of time series forecasting and the popularity of article titles. The proposed model uses the historical sales data, popularity of article titles, and the prediction result of a time series, Autoregressive Integrated Moving Average (ARIMA) forecasting method to learn a BPNN-based forecasting model. Our proposed forecasting model is experimentally evaluated by comparing with conventional sales prediction techniques. The experimental result shows that our proposed forecasting method outperforms conventional techniques which do not consider the popularity of title words.

  12. A Hybrid Neural Network Model for Sales Forecasting Based on ARIMA and Search Popularity of Article Titles

    Science.gov (United States)

    Omar, Hani; Hoang, Van Hai; Liu, Duen-Ren

    2016-01-01

    Enhancing sales and operations planning through forecasting analysis and business intelligence is demanded in many industries and enterprises. Publishing industries usually pick attractive titles and headlines for their stories to increase sales, since popular article titles and headlines can attract readers to buy magazines. In this paper, information retrieval techniques are adopted to extract words from article titles. The popularity measures of article titles are then analyzed by using the search indexes obtained from Google search engine. Backpropagation Neural Networks (BPNNs) have successfully been used to develop prediction models for sales forecasting. In this study, we propose a novel hybrid neural network model for sales forecasting based on the prediction result of time series forecasting and the popularity of article titles. The proposed model uses the historical sales data, popularity of article titles, and the prediction result of a time series, Autoregressive Integrated Moving Average (ARIMA) forecasting method to learn a BPNN-based forecasting model. Our proposed forecasting model is experimentally evaluated by comparing with conventional sales prediction techniques. The experimental result shows that our proposed forecasting method outperforms conventional techniques which do not consider the popularity of title words. PMID:27313605

  13. A model independent search for new physics in final states containing leptons at the D0 experiment

    Energy Technology Data Exchange (ETDEWEB)

    Piper, Joel Michael [Michigan State Univ., East Lansing, MI (United States)

    2009-01-01

    The standard model is known to be the low energy limit of a more general theory. Several consequences of the standard model point to a strong probability of new physics becoming experimentally visible in high energy collisions of a few TeV, resulting in high momentum objects. The specific signatures of these collisions are topics of much debate. Rather than choosing a specific signature, this analysis broadly searches the data, preferring breadth over sensitivity. In searching for new physics, several different approaches are used. These include the comparison of data with standard model background expectation in overall number of events, comparisons of distributions of many kinematic variables, and finally comparisons on the tails of distributions that sum the momenta of the objects in an event. With 1.07 fb-1 at the D0 experiment, we find no evidence of physics beyond the standard model. Several discrepancies from the standard model were found, but none of these provide a compelling case for new physics.

  14. Upper Limits on Gravitational Waves from Scorpius X-1 from a Model-based Cross-correlation Search in Advanced LIGO Data

    NARCIS (Netherlands)

    Abbott, B. P.; Abbott, R.; Abbott, T. D.; Acernese, F.; Ackley, K.; Adams, C.; Adams, T.; Addesso, P.; Adhikari, R. X.; Adya, V. B.; Affeldt, C.; Afrough, M.; Agarwal, B.; Agathos, M.; Agatsuma, K.; Aggarwal, N.; Aguiar, O. D.; Aiello, L.; Ain, A.; Ajith, P.; Allen, B.; Allen, G.; Allocca, A.; Altin, P. A.; Amato, A.; Ananyeva, A.; Anderson, S. B.; Anderson, W. G.; Antier, S.; Appert, S.; Arai, K.; Araya, M. C.; Areeda, J. S.; Arnaud, N.; Arun, K. G.; Ascenzi, S.; Ashton, G.; Ast, M.; Aston, S. M.; Astone, P.; Aufmuth, P.; Aulbert, C.; AultONeal, K.; Avila-Alvarez, A.; Babak, S.; Bacon, P.; Bader, M. K. M.; Bae, S.; Baker, P. T.; Baldaccini, F.; Ballardin, G.; Ballmer, S. W.; Banagiri, S.; Barayoga, J. C.; Barclay, S. E.; Barish, B. C.; Barker, D.; Barone, F.; Barr, B.; Barsotti, L.; Barsuglia, M.; Barta, D.; Bartlett, J.; Bartos, I.; Bassiri, R.; Basti, A.; Batch, J. C.; Baune, C.; Bawaj, M.; Bazzan, M.; Becsy, B.; Beer, C.; Bejger, M.; Belahcene, I.; Bell, A. S.; Berger, B. K.; Bergmann, G.; Berry, C. P. L.; Bersanetti, D.; Bertolini, A.; Betzwieser, J.; Bhagwat, S.; Bhandare, R.; Bilenko, I. A.; Billingsley, G.; Billman, C. R.; Birch, J.; Birney, R.; Birnholtz, O.; Biscans, S.; Bisht, A.; Bitossi, M.; Biwer, C.; Bizouard, M. A.; Blackburn, J. K.; Blackman, J.; Blair, C. D.; Blair, D. G.; Blair, R. M.; Bloemen, S.; Bock, O.; Bode, N.; Boer, M.; Bogaert, G.; Bohe, A.; Bondu, F.; Bonnand, R.; Boom, B. A.; Bork, R.; Boschi, V.; Bose, S.; Bouffanais, Y.; Bozzi, A.; Bradaschia, C.; Brady, P. R.; Braginsky, V. B.; Branchesi, M.; Brau, J. E.; Briant, T.; Brillet, A.; Brinkmann, M.; Brisson, V.; Brockill, P.; Broida, J. E.; Brooks, A. F.; Brown, D. A.; Brown, D. D.; Brown, N. M.; Brunett, S.; Buchanan, C. C.; Buikema, A.; Bulik, T.; Bulten, H. J.; Buonanno, A.; Buskulic, D.; Buy, C.; Byer, R. L.; Cabero, M.; Cadonati, L.; Cagnoli, G.; Cahillane, C.; Bustillo, J. Calderon; Callister, T. A.; Calloni, E.; Camp, J. B.; Canepa, M.; Canizares, P.; Cannon, K. C.; Cao, H.; Cao, J.; Capano, C. D.; Capocasa, E.; Carbognani, F.; Caride, S.; Carney, M. F.; Diaz, J. Casanueva; Casentini, C.; Caudill, S.; Cavaglia, M.; Cavalier, F.; Cavalieri, R.; Cella, G.; Cepeda, C. B.; Baiardi, L. Cerboni; Cerretani, G.; Cesarini, E.; Chamberlin, S. J.; Chan, M.; Chao, S.; Charlton, P.; Chassande-Mottin, E.; Chatterjee, D.; Chatziioannou, K.; Cheeseboro, B. D.; Chen, H. Y.; Chen, Y.; Cheng, H. -P.; Chincarini, A.; Chiummo, A.; Chmiel, T.; Cho, H. S.; Cho, M.; Chow, J. H.; Christensen, N.; Chu, Q.; Chua, A. J. K.; Chua, S.; Chung, A. K. W.; Chung, S.; Ciani, G.; Ciolfi, R.; Cirelli, C. E.; Cirone, A.; Clara, F.; Clark, J. A.; Cleva, F.; Cocchieri, C.; Coccia, E.; Cohadon, P. -F.; Colla, A.; Collette, C. G.; Cominsky, L. R.; Constancio, M., Jr.; Conti, L.; Cooper, S. J.; Corban, P.; Corbitt, T. R.; Corley, K. R.; Cornish, N.; Corsi, A.; Cortese, S.; Costa, C. A.; Coughlin, M. W.; Coughlin, S. B.; Coulon, J. -P.; Countryman, S. T.; Couvares, P.; Covas, P. B.; Cowan, E. E.; Coward, D. M.; Cowart, M. J.; Coyne, D. C.; Coyne, R.; Creighton, J. D. E.; Creighton, T. D.; Cripe, J.; Crowder, S. G.; Cullen, T. J.; Cumming, A.; Cunningham, L.; Cuoco, E.; Dal Canton, T.; Danilishin, S. L.; D'Antonio, S.; Danzmann, K.; Dasgupta, A.; Da Silva Costa, C. F.; Dattilo, V.; Dave, I.; Davier, M.; Davis, D.; Daw, E. J.; Day, B.; De, S.; Debra, D.; Deelman, E.; Degallaix, J.; De laurentis, M.; Deleglise, S.; Del Pozzo, W.; Denker, T.; Dent, T.; Dergachev, V.; De Rosa, R.; DeRosa, R. T.; DeSalvo, R.; Devenson, J.; Devine, R. C.; Dhurandhar, S.; Diaz, M. C.; Di Fiore, L.; Di Giovanni, M.; Di Girolamo, T.; Di Lieto, A.; Di Pace, S.; Di Palma, I.; Di Renzo, F.; Doctor, Z.; Dolique, V.; Donovan, F.; Dooley, K. L.; Doravari, S.; Dorrington, I.; Douglas, R.; Alvarez, M. Dovale; Downes, T. P.; Drago, M.; Drever, R. W. P.; Driggers, J. C.; Du, Z.; Ducrot, M.; Duncan, J.; Dwyer, S. E.; Edo, T. B.; Edwards, M. C.; Effler, A.; Eggenstein, H. -B.; Ehrens, P.; Eichholz, J.; Eikenberry, S. S.; Eisenstein, R. A.; Essick, R. C.; Etienne, Z. B.; Etzel, T.; Evans, M.; Evans, T. M.; Factourovich, M.; Fafone, V.; Fair, H.; Fairhurst, S.; Fan, X.; Farinon, S.; Farr, B.; Farr, W. M.; Fauchon-Jones, E. J.; Favata, M.; Fays, M.; Fehrmann, H.; Feicht, J.; Fejer, M. M.; Fernandez-Galiana, A.; Ferrante, I.; Ferreira, E. C.; Ferrini, F.; Fidecaro, F.; Fiori, I.; Fiorucci, D.; Fisher, R. P.; Flaminio, R.; Fletcher, M.; Fong, H.; Forsyth, P. W. F.; Forsyth, S. S.; Fournier, J. -D.; Frasca, S.; Frasconi, F.; Frei, Z.; Freise, A.; Frey, R.; Frey, V.; Fries, E. M.; Fritschel, P.; Frolov, V. V.; Fulda, P.; Fyffe, M.; Gabbard, H.; Gabel, M.; Gadre, B. U.; Gaebel, S. M.; Gair, J. R.; Galloway, D. K.; Gammaitoni, L.; Ganija, M. R.; Gaonkar, S. G.; Garufi, F.; Gaudio, S.; Gaur, G.; Gayathri, V.; Gehrels, N.; Gemme, G.; Genin, E.; Gennai, A.; George, D.; George, J.; Gergely, L.; Germain, V.; Ghonge, S.; Ghosh, Abhirup; Ghosh, Archisman; Ghosh, S.; Giaime, J. A.; Giardina, K. D.; Giazotto, A.; Gill, K.; Glover, L.; Goetz, E.; Goetz, R.; Gomes, S.; Gonzlez, G.; Castro, J. M. Gonzalez; Gopakumar, A.; Gorodetsky, M. L.; Gossan, S. E.; Gosselin, M.; Gouaty, R.; Grado, A.; Graef, C.; Granata, M.; Grant, A.; Gras, S.; Gray, C.; Greco, G.; Green, A. C.; Groot, P.; Grote, H.; Grunewald, S.; Gruning, P.; Guidi, G. M.; Guo, X.; Gupta, A.; Gupta, M. K.; Gushwa, K. E.; Gustafson, E. K.; Gustafson, R.; Hall, B. R.; Hall, E. D.; Hammond, G.; Haney, M.; Hanke, M. M.; Hanks, J.; Hanna, C.; Hannuksela, O. A.; Hanson, J.; Hardwick, T.; Harms, J.; Harry, G. M.; Harry, I. W.; Hart, M. J.; Haster, C. -J.; Haughian, K.; Healy, J.; Heidmann, A.; Heintze, M. C.; Heitmann, H.; Hello, P.; Hemming, G.; Hendry, M.; Heng, I. S.; Hennig, J.; Henry, J.; Heptonstall, A. W.; Heurs, M.; Hild, S.; Hoak, D.; Hofman, D.; Holt, K.; Holz, D. E.; Hopkins, P.; Horst, C.; Hough, J.; Houston, E. A.; Howell, E. J.; Hu, Y. M.; Huerta, E. A.; Huet, D.; Hughey, B.; Husa, S.; Huttner, S. H.; Huynh-Dinh, T.; Indik, N.; Ingram, D. R.; Inta, R.; Intini, G.; Isa, H. N.; Isac, J. -M.; Isi, M.; Iyer, B. R.; Izumi, K.; Jacqmin, T.; Jani, K.; Jaranowski, P.; Jawahar, S.; Jimenez-Forteza, F.; Johnson, W. W.; Jones, D. I.; Jones, R.; Jonker, R. J. G.; Ju, L.; Junker, J.; Kalaghatgi, C. V.; Kalogera, V.; Kandhasamy, S.; Kang, G.; Kanner, J. B.; Karki, S.; Karvinen, K. S.; Kasprzack, M.; Katolik, M.; Katsavounidis, E.; Katzman, W.; Kaufer, S.; Kawabe, K.; Kefelian, F.; Keitel, D.; Kemball, A. J.; Kennedy, R.; Kent, C.; Key, J. S.; Khalili, F. Y.; Khan, I.; Khan, S.; Khan, Z.; Khazanov, E. A.; Kijbunchoo, N.; Kim, Chunglee; Kim, J. C.; Kim, W.; Kim, W. S.; Kim, Y. -M.; Kimbrell, S. J.; King, E. J.; King, P. J.; Kirchhoff, R.; Kissel, J. S.; Kleybolte, L.; Klimenko, S.; Koch, P.; Koehlenbeck, S. M.; Koley, S.; Kondrashov, V.; Kontos, A.; Korobko, M.; Korth, W. Z.; Kowalska, I.; Kozak, D. B.; Krmer, C.; Kringel, V.; Krishnan, B.; Krolak, A.; Kuehn, G.; Kumar, P.; Kumar, R.; Kumar, S.; Kuo, L.; Kutynia, A.; Kwang, S.; Lackey, B. D.; Lai, K. H.; Landry, M.; Lang, R. N.; Lange, J.; Lantz, B.; Lanza, R. K.; Lartaux-Vollard, A.; Lasky, P. D.; Laxen, M.; Lazzarini, A.; Lazzaro, C.; Leaci, P.; Leavey, S.; Lee, C. H.; Lee, H. K.; Lee, H. M.; Lee, H. W.; Lee, K.; Lehmann, J.; Lenon, A.; Leonardi, M.; Leroy, N.; Letendre, N.; Levin, Y.; Li, T. G. F.; Libson, A.; Littenberg, T. B.; Liu, J.; Lo, R. K. L.; Lockerbie, N. A.; London, L. T.; Lord, J. E.; Lorenzini, M.; Loriette, V.; Lormand, M.; Losurdo, G.; Lough, J. D.; Lousto, C. O.; Lovelace, G.; Luck, H.; Lumaca, D.; Lundgren, A. P.; Lynch, R.; Ma, Y.; Macfoy, S.; Machenschalk, B.; MacInnis, M.; Macleod, D. M.; Hernandez, I. Magana; Magana-Sandoval, F.; Zertuche, L. Magaa; Magee, R. M.; Majorana, E.; Maksimovic, I.; Man, N.; Mandic, V.; Mangano, V.; Mansell, G. L.; Manske, M.; Mantovani, M.; Marchesoni, F.; Marion, F.; Marka, S.; Marka, Z.; Markakis, C.; Markosyan, A. S.; Maros, E.; Martelli, F.; Martellini, L.; Martin, I. W.; Martynov, D. V.; Mason, K.; Masserot, A.; Massinger, T. J.; Masso-Reid, M.; Mastrogiovanni, S.; Matas, A.; Matichard, F.; Matone, L.; Mavalvala, N.; Mayani, R.; Mazumder, N.; McCarthy, R.; McClelland, D. E.; McCormick, S.; McCuller, L.; McGuire, S. C.; McIntyre, G.; McIver, J.; McManus, D. J.; McRae, T.; McWilliams, S. T.; Meacher, D.; Meadors, G. D.; Meidam, J.; Mejuto-Villa, E.; Melatos, A.; Mendell, G.; Mercer, R. A.; Merilh, E. L.; Merzougui, M.; Meshkov, S.; Messenger, C.; Messick, C.; Metzdorff, R.; Meyers, P. M.; Mezzani, F.; Miao, H.; Michel, C.; Middleton, H.; Mikhailov, E. E.; Milano, L.; Miller, A. L.; Miller, A.; Miller, B. B.; Miller, J.; Millhouse, M.; Minazzoli, O.; Minenkov, Y.; Ming, J.; Mishra, C.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Moggi, A.; Mohan, M.; Mohapatra, S. R. P.; Montani, M.; Moore, B. C.; Moore, C. J.; Moraru, D.; Moreno, G.; Morriss, S. R.; Mours, B.; Mow-Lowry, C. M.; Mueller, G.; Muir, A. W.; Mukherjee, Arunava; Mukherjee, D.; Mukherjee, S.; Mukund, N.; Mullavey, A.; Munch, J.; Muniz, E. A. M.; Murray, P. G.; Napier, K.; Nardecchia, I.; Naticchioni, L.; Nayak, R. K.; Nelemans, G.; Nelson, T. J. N.; Neri, M.; Nery, M.; Neunzert, A.; Newport, J. M.; Newton, G.; Ng, K. K. Y.; Nguyen, T. T.; Nichols, D.; Nielsen, A. B.; Nissanke, S.; Nitz, A.; Noack, A.; Nocera, F.; Nolting, D.; Normandin, M. E. N.; Nuttall, L. K.; Oberling, J.; Ochsner, E.; Oelker, E.; Ogin, G. H.; Oh, J. J.; Oh, S. H.; Ohme, F.; Oliver, M.; Oppermann, P.; Oram, Richard J.; O'Reilly, B.; Ormiston, R.; Ortega, L. F.; O'Shaughnessy, R.; Ottaway, D. J.; Overmier, H.; Owen, B. J.; Pace, A. E.; Page, J.; Page, M. A.; Pai, A.; Pai, S. A.; Palamos, J. R.; Palashov, O.; Palomba, C.; Pal-Singh, A.; Pan, H.; Pang, B.; Pang, P. T. H.; Pankow, C.; Pannarale, F.; Pant, B. C.; Paoletti, F.; Paoli, A.; Papa, M. A.; Paris, H. R.; Parker, W.; Pascucci, D.; Pasqualetti, A.; Passaquieti, R.; Passuello, D.; Patricelli, B.; Pearlstone, B. L.; Pedraza, M.; Pedurand, R.; Pekowsky, L.; Pele, A.; Penn, S.; Perez, C. J.; Perreca, A.; Perri, L. M.; Pfeiffer, H. P.; Phelps, M.; Piccinni, O. J.; Pichot, M.; Piergiovanni, F.; Pierro, V.; Pillant, G.; Pinard, L.; Pinto, I. M.; Pitkin, M.; Poggiani, R.; Popolizio, P.; Porter, E. K.; Post, A.; Powell, J.; Prasad, J.; Pratt, J. W. W.; Predoi, V.; Prestegard, T.; Prijatelj, M.; Principe, M.; Privitera, S.; Prix, R.; Prodi, G. A.; Prokhorov, L. G.; Puncken, O.; Punturo, M.; Puppo, P.; Prrer, M.; Qi, H.; Qin, J.; Qiu, S.; Quetschke, V.; Quintero, E. A.; Quitzow-James, R.; Raab, F. J.; Rabeling, D. S.; Radkins, H.; Raffai, P.; Raja, S.; Rajan, C.; Rakhmanov, M.; Ramirez, K. E.; Rapagnani, P.; Raymond, V.; Razzano, M.; Read, J.; Regimbau, T.; Rei, L.; Reid, S.; Reitze, D. H.; Rew, H.; Reyes, S. D.; Ricci, F.; Ricker, P. M.; Rieger, S.; Riles, K.; Rizzo, M.; Robertson, N. A.; Robie, R.; Robinet, F.; Rocchi, A.; Rolland, L.; Rollins, J. G.; Roma, V. J.; Romano, R.; Romel, C. L.; Romie, J. H.; Rosinska, D.; Ross, M. P.; Rowan, S.; Ruediger, A.; Ruggi, P.; Ryan, K.; Rynge, M.; Sachdev, S.; Sadecki, T.; Sadeghian, L.; Sakellariadou, M.; Salconi, L.; Saleem, M.; Salemi, F.; Samajdar, A.; Sammut, L.; Sampson, L. M.; Sanchez, E. J.; Sandberg, V.; Sandeen, B.; Sanders, J. R.; Sassolas, B.; Sathyaprakash, B. S.; Saulson, P. R.; Sauter, O.; Savage, R. L.; Sawadsky, A.; Schale, P.; Scheuer, J.; Schmidt, E.; Schmidt, J.; Schmidt, P.; Schnabel, R.; Schofield, R. M. S.; Schoenbeck, A.; Schoenbeck, A.; Schreiber, E.; Schuette, D.; Schulte, B. W.; Schutz, B. F.; Schwalbe, S. G.; Scott, J.; Scott, S. M.; Seidel, E.; Sellers, D.; Sengupta, A. S.; Sentenac, D.; Sequino, V.; Sergeev, A.; Shaddock, D. A.; Shaffer, T. J.; Shah, A. A.; Shahriar, M. S.; Shao, L.; Shapiro, B.; Shawhan, P.; Sheperd, A.; Shoemaker, D. H.; Shoemaker, D. M.; Siellez, K.; Siemens, X.; Sieniawska, M.; Sigg, D.; Silva, A. D.; Singer, A.; Singer, L. P.; Singh, A.; Singh, R.; Singhal, A.; Sintes, A. M.; Slagmolen, B. J. J.; Smith, B.; Smith, R. J. E.; Smith, R. J. E.; Son, E. J.; Sonnenberg, J. A.; Sorazu, B.; Sorrentino, F.; Souradeep, T.; Spencer, A. P.; Srivastava, A. K.; Staley, A.; Steinke, M.; Steinlechner, J.; Steinlechner, S.; Steinmeyer, D.; Stephens, B. C.; Stone, R.; Strain, K. A.; Stratta, G.; Strigin, S. E.; Sturani, R.; Stuver, A. L.; Summerscales, T. Z.; Sun, L.; Sunil, S.; Sutton, P. J.; Swinkels, B. L.; Szczepanczyk, M. J.; Tacca, M.; Talukder, D.; Tanner, D. B.; Tapai, M.; Taracchini, A.; Taylor, J. A.; Taylor, R.; Theeg, T.; Thomas, E. G.; Thomas, M.; Thomas, P.; Thorne, K. A.; Thorne, K. S.; Thrane, E.; Tiwari, S.; Tiwari, V.; Tokmakov, K. V.; Toland, K.; Tonelli, M.; Tornasi, Z.; Torrie, C. I.; Tayra, D.; Travasso, F.; Traylor, G.; Trifiro, D.; Trinastic, J.; Tringali, M. C.; Trozzo, L.; Tsang, K. W.; Tse, M.; Tso, R.; Tuyenbayev, D.; Ueno, K.; Ugolini, D.; Unnikrishnan, C. S.; Urban, A. L.; Usman, S. A.; Vahi, K.; Vahlbruch, H.; Vajente, G.; Valdes, G.; Vallisneri, M.; van Bakel, N.; van Beuzekom, M.; van den Brand, J. F. J.; Van den Broeck, C.; Vander-Hyde, D. C.; van der Schaaf, L.; Van Heijningen, J. V.; van Veggel, A. A.; Vardaro, M.; Varma, V.; Vass, S.; Vasuth, M.; Vecchio, A.; Vedovato, G.; Veitch, J.; Veitch, P. J.; Venkateswara, K.; Venugopalan, G.; Verkindt, D.; Vetrano, F.; Vicere, A.; Viets, A. D.; Vinciguerra, S.; Vine, D. J.; Vinet, J. -Y.; Vitale, S.; Vo, T.; Vocca, H.; Vorvick, C.; Voss, D. V.; Vousden, W. D.; Vyatchanin, S. P.; Wade, A. R.; Wade, L. E.; Wade, M.; Walet, R.; Walker, M.; Wallace, L.; Walsh, S.; Wang, G.; Wang, H.; Wang, J. Z.; Wang, M.; Wang, Y. -F.; Wang, Y.; Ward, R. L.; Warner, J.; Was, M.; Watchi, J.; Weaver, B.; Wei, L. -W.; Weinert, M.; Weinstein, A. J.; Weiss, R.; Wen, L.; Wessel, E. K.; Wessels, P.; Westphal, T.; Wette, K.; Whelan, J. T.; Whiting, B. F.; Whittle, C.; Williams, D.; Williams, R. D.; Williamson, A. R.; Willis, J. L.; Willke, B.; Wimmer, M. H.; Winkler, W.; Wipf, C. C.; Wittel, H.; Woan, G.; Woehler, J.; Wofford, J.; Wong, K. W. K.; Worden, J.; Wright, J. L.; Wu, D. S.; Wu, G.; Yam, W.; Yamamoto, H.; Yancey, C. C.; Yap, M. J.; Yu, Hang; Yu, Haocun; Yvert, M.; Zanolin, M.; Zelenova, T.; Zendri, J. -P.; Zevin, M.; Zhang, L.; Zhang, M.; Zhang, T.; Zhang, Y. -H.; Zhao, C.; Zhou, M.; Zhou, Z.; Zhu, X. J.; Zucker, M. E.; Zweizig, J.; Steeghs, D.; Wang, L.

    2017-01-01

    We present the results of a semicoherent search for continuous gravitational waves from the low-mass X-ray binary Scorpius X-1, using data from the first Advanced LIGO observing run. The search method uses details of the modeled, parametrized continuous signal to combine coherently data separated by

  15. Random searching

    International Nuclear Information System (INIS)

    Shlesinger, Michael F

    2009-01-01

    There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.

  16. Search Patterns

    CERN Document Server

    Morville, Peter

    2010-01-01

    What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont

  17. Improving 3D spatial queries search: newfangled technique of space filling curves in 3D city modeling

    DEFF Research Database (Denmark)

    Uznir, U.; Anton, François; Suhaibah, A.

    2013-01-01

    , retrieving portions of and especially searching these 3D city models, will not be done optimally. Even though current developments are based on an open data model allotted by the Open Geospatial Consortium (OGC) called CityGML, its XML-based structure makes it challenging to cluster the 3D urban objects......The advantages of three dimensional (3D) city models can be seen in various applications including photogrammetry, urban and regional planning, computer games, etc.. They expand the visualization and analysis capabilities of Geographic Information Systems on cities, and they can be developed using...... modeling will improve data retrieval time by means of optimized 3D adjacency, nearest neighbor information and 3D indexing. The Hilbert mapping, which maps a subinterval of the [0, 1] interval to the corresponding portion of the d-dimensional Hilbert’s curve, preserves the Lebesgue measure and is Lipschitz...

  18. Integrating textual and model-based process descriptions for comprehensive process search

    NARCIS (Netherlands)

    Leopold, Henrik; van der Aa, Han; Pittke, Fabian; Raffel, Manuel; Mendling, Jan; Reijers, Hajo A.

    2016-01-01

    Documenting business processes using process models is common practice in many organizations. However, not all process information is best captured in process models. Hence, many organizations complement these models with textual descriptions that specify additional details. The problem with this

  19. Sparticle mass hierarchies, simplified models from SUGRA unification, and benchmarks for LHC Run-II SUSY searches

    International Nuclear Information System (INIS)

    Francescone, David; Akula, Sujeet; Altunkaynak, Baris; Nath, Pran

    2015-01-01

    Sparticle mass hierarchies contain significant information regarding the origin and nature of supersymmetry breaking. The hierarchical patterns are severely constrained by electroweak symmetry breaking as well as by the astrophysical and particle physics data. They are further constrained by the Higgs boson mass measurement. The sparticle mass hierarchies can be used to generate simplified models consistent with the high scale models. In this work we consider supergravity models with universal boundary conditions for soft parameters at the unification scale as well as supergravity models with nonuniversalities and delineate the list of sparticle mass hierarchies for the five lightest sparticles. Simplified models can be obtained by a truncation of these, retaining a smaller set of lightest particles. The mass hierarchies and their truncated versions enlarge significantly the list of simplified models currently being used in the literature. Benchmarks for a variety of supergravity unified models appropriate for SUSY searches at future colliders are also presented. The signature analysis of two benchmark models has been carried out and a discussion of the searches needed for their discovery at LHC Run-II is given. An analysis of the spin-independent neutralino-proton cross section exhibiting the Higgs boson mass dependence and the hierarchical patterns is also carried out. It is seen that a knowledge of the spin-independent neutralino-proton cross section and the neutralino mass will narrow down the list of the allowed sparticle mass hierarchies. Thus dark matter experiments along with analyses for the LHC Run-II will provide strong clues to the nature of symmetry breaking at the unification scale.

  20. Search of associative memory.

    NARCIS (Netherlands)

    Raaijmakers, J.G.W.; Shiffrin, R.M.

    1981-01-01

    Describes search of associative memory (SAM), a general theory of retrieval from long-term memory that combines features of associative network models and random search models. It posits cue-dependent probabilistic sampling and recovery from an associative network, but the network is specified as a

  1. Search for non-standard model signatures in the WZ/ZZ final state at CDF run II

    Energy Technology Data Exchange (ETDEWEB)

    Norman, Matthew [Univ. of California, San Diego, CA (United States)

    2009-01-01

    This thesis discusses a search for non-Standard Model physics in heavy diboson production in the dilepton-dijet final state, using 1.9 fb -1 of data from the CDF Run II detector. New limits are set on the anomalous coupling parameters for ZZ and WZ production based on limiting the production cross-section at high š. Additionally limits are set on the direct decay of new physics to ZZ andWZ diboson pairs. The nature and parameters of the CDF Run II detector are discussed, as are the influences that it has on the methods of our analysis.

  2. Search for non-standard model signatures in the WZ/ZZ final state at CDF Run II

    International Nuclear Information System (INIS)

    Norman, Matthew

    2009-01-01

    This thesis discusses a search for non-Standard Model physics in heavy diboson production in the dilepton-dijet final state, using 1.9 fb -1 of data from the CDF Run II detector. New limits are set on the anomalous coupling parameters for ZZ and WZ production based on limiting the production cross-section at high (cflx s). Additionally limits are set on the direct decay of new physics to ZZ andWZ diboson pairs. The nature and parameters of the CDF Run II detector are discussed, as are the influences that it has on the methods of our analysis.

  3. Short-Term Wind Speed Forecasting Study and Its Application Using a Hybrid Model Optimized by Cuckoo Search

    Directory of Open Access Journals (Sweden)

    Xuejun Chen

    2015-01-01

    Full Text Available The support vector regression (SVR and neural network (NN are both new tools from the artificial intelligence field, which have been successfully exploited to solve various problems especially for time series forecasting. However, traditional SVR and NN cannot accurately describe intricate time series with the characteristics of high volatility, nonstationarity, and nonlinearity, such as wind speed and electricity price time series. This study proposes an ensemble approach on the basis of 5-3 Hanning filter (5-3H and wavelet denoising (WD techniques, in conjunction with artificial intelligence optimization based SVR and NN model. So as to confirm the validity of the proposed model, two applicative case studies are conducted in terms of wind speed series from Gansu Province in China and electricity price from New South Wales in Australia. The computational results reveal that cuckoo search (CS outperforms both PSO and GA with respect to convergence and global searching capacity, and the proposed CS-based hybrid model is effective and feasible in generating more reliable and skillful forecasts.

  4. Market Dominance and Search Quality in the Search Engine Market

    NARCIS (Netherlands)

    Lianos, I.; Motchenkova, E.I.

    2013-01-01

    We analyze a search engine market from a law and economics perspective and incorporate the choice of quality-improving innovations by a search engine platform in a two-sided model of Internet search engine. In the proposed framework, we first discuss the legal issues the search engine market raises

  5. SEARCHES FOR SUPERSYMMETRY IN ATLAS

    CERN Document Server

    Xu, Da; The ATLAS collaboration

    2017-01-01

    A wide range of supersymmetric searches are presented. All searches are based on the proton- proton collision dataset collected by the ATLAS experiment during the 2015 and 2016 (before summer) run with a center-of-mass energy of 13 TeV, corresponding to an integrated lumi- nosity of 36.1 (36.7) fb-1. The searches are categorized into inclusive gluino and squark search, third generation search, electroweak search, prompt RPV search and long-lived par- ticle search. No evidence of new physics is observed. The results are intepreted in various models and expressed in terms of limits on the masses of new particles.

  6. Neutrino-4 experiment on search for sterile neutrino with multi-section model of detector

    Science.gov (United States)

    Serebrov, A.; Ivochkin, V.; Samoilov, R.; Fomin, A.; Polyushkin, A.; Zinoviev, V.; Neustroev, P.; Golovtsov, V.; Chernyj, A.; Zherebtsov, O.; Martemyanov, V.; Tarasenkov, V.; Aleshin, V.; Petelin, A.; Izhutov, A.; Tuzov, A.; Sazontov, S.; Ryazanov, D.; Gromov, M.; Afanasiev, V.; Zaytsev, M.; Chaikovskii, M.

    2017-09-01

    In order to carry out research in the field of possible existence of a sterile neutrino the laboratory based on SM-3 reactor (Dimitrovgrad, Russia) was created to search for oscillations of reactor antineutrino. The prototype of a multi-section neutrino detector with liquid scintillator volume of 350 l was installed in the middle of 2015. It is a moveable inside the passive shielding detector, which can be set at distance range from 6 to 11 meters from the reactor core. Measurements of antineutrino flux at such small distances from the reactor core are carried out with moveable detector for the first time. The measurements carried out with detector prototype demonstrated a possibility of measuring a reactor antineutrino flux in difficult conditions of cosmic background at Earth surface.

  7. Optimizing heliostat positions with local search metaheuristics using a ray tracing optical model

    Science.gov (United States)

    Reinholz, Andreas; Husenbeth, Christof; Schwarzbözl, Peter; Buck, Reiner

    2017-06-01

    The life cycle costs of solar tower power plants are mainly determined by the investment costs of its construction. Significant parts of these investment costs are used for the heliostat field. Therefore, an optimized placement of the heliostats gaining the maximal annual power production has a direct impact on the life cycle costs revenue ratio. We present a two level local search method implemented in MATLAB utilizing the Monte Carlo raytracing software STRAL [1] for the evaluation of the annual power output for a specific weighted annual time scheme. The algorithm was applied to a solar tower power plant (PS10) with 624 heliostats. Compared to former work of Buck [2], we were able to improve both runtime of the algorithm and quality of the output solutions significantly. Using the same environment for both algorithms, we were able to reach Buck's best solution with a speed up factor of about 20.

  8. Orthogonal search-based rule extraction for modelling the decision to transfuse.

    Science.gov (United States)

    Etchells, T A; Harrison, M J

    2006-04-01

    Data from an audit relating to transfusion decisions during intermediate or major surgery were analysed to determine the strengths of certain factors in the decision making process. The analysis, using orthogonal search-based rule extraction (OSRE) from a trained neural network, demonstrated that the risk of tissue hypoxia (ROTH) assessed using a 100-mm visual analogue scale, the haemoglobin value (Hb) and the presence or absence of on-going haemorrhage (OGH) were able to reproduce the transfusion decisions with a joint specificity of 0.96 and sensitivity of 0.93 and a positive predictive value of 0.9. The rules indicating transfusion were: 1. ROTH > 32 mm and Hb 13 mm and Hb 38 mm, Hb < 102 g x l(-1) and OGH; 4. Hb < 78 g x l(-1).

  9. Identification of Evidence for Key Parameters in Decision-Analytic Models of Cost Effectiveness: A Description of Sources and a Recommended Minimum Search Requirement.

    Science.gov (United States)

    Paisley, Suzy

    2016-06-01

    This paper proposes recommendations for a minimum level of searching for data for key parameters in decision-analytic models of cost effectiveness and describes sources of evidence relevant to each parameter type. Key parameters are defined as treatment effects, adverse effects, costs, resource use, health state utility values (HSUVs) and baseline risk of events. The recommended minimum requirement for treatment effects is comprehensive searching according to available methodological guidance. For other parameter types, the minimum is the searching of one bibliographic database plus, where appropriate, specialist sources and non-research-based and non-standard format sources. The recommendations draw on the search methods literature and on existing analyses of how evidence is used to support decision-analytic models. They take account of the range of research and non-research-based sources of evidence used in cost-effectiveness models and of the need for efficient searching. Consideration is given to what constitutes best evidence for the different parameter types in terms of design and scientific quality and to making transparent the judgments that underpin the selection of evidence from the options available. Methodological issues are discussed, including the differences between decision-analytic models of cost effectiveness and systematic reviews when searching and selecting evidence and comprehensive versus sufficient searching. Areas are highlighted where further methodological research is required.

  10. Similarity-based search of model organism, disease and drug effect phenotypes

    KAUST Repository

    Hoehndorf, Robert; Gruenberger, Michael; Gkoutos, Georgios V; Schofield, Paul N

    2015-01-01

    Background: Semantic similarity measures over phenotype ontologies have been demonstrated to provide a powerful approach for the analysis of model organism phenotypes, the discovery of animal models of human disease, novel pathways, gene functions

  11. Internationalization through business model innovation: In search of relevant design dimensions and elements

    DEFF Research Database (Denmark)

    Rask, Morten

    2014-01-01

    Internationalization through business model innovation involves the creation, or reinvention, of the business itself. This paper aims to integrate basic insight from the literature on business model innovation, internationalization of the firm, international entrepreneurship and global marketing...

  12. Searches for standard model Higgs boson and supersymmetry - Trigger studies and software tools development for new phenomena in the DO experiment

    International Nuclear Information System (INIS)

    Duperrin, A.

    2007-04-01

    This document presents a summary of my research work during the past 7 years for the preparation of the D0 experiment at Fermilab and the analysis of the data collected at the Tevatron hadron collider. It mainly focuses on 2 topics: trigger and direct search for new phenomena, particularly on supersymmetry and standard model Higgs boson searches. This document is divided into 5 chapters: 1) the phenomenology of the standard model and beyond, 2) the phenomenology of pp-bar events, 3) the Tevatron and D0 detector, 4) the trigger system and data acquisition, and 5) data analysis: search for supersymmetry and Higgs boson

  13. Multi-Robot Communication-Sensitive Reconnaissance

    National Research Council Canada - National Science Library

    Wagner, Alan; Arkin, Ronald

    2004-01-01

    .... Different team sizes, scenarios, and task management strategies are investigated. Results indicate an acceptable reduction in communication attenuation when compared to other related methods of navigation...

  14. Adaptive heterogeneous multi-robot teams

    Energy Technology Data Exchange (ETDEWEB)

    Parker, L.E.

    1998-11-01

    This research addresses the problem of achieving fault tolerant cooperation within small- to medium-sized teams of heterogeneous mobile robots. The author describes a novel behavior-based, fully distributed architecture, called ALLIANCE, that utilizes adaptive action selection to achieve fault tolerant cooperative control in robot missions involving loosely coupled, largely independent tasks. The robots in this architecture possess a variety of high-level functions that they can perform during a mission, and must at all times select an appropriate action based on the requirements of the mission, the activities of other robots, the current environmental conditions, and their own internal states. Since such cooperative teams often work in dynamic and unpredictable environments, the software architecture allows the team members to respond robustly and reliably to unexpected environmental changes and modifications in the robot team that may occur due to mechanical failure, the learning of new skills, or the addition or removal of robots from the team by human intervention. After presenting ALLIANCE, the author describes in detail the experimental results of an implementation of this architecture on a team of physical mobile robots performing a cooperative box pushing demonstration. These experiments illustrate the ability of ALLIANCE to achieve adaptive, fault-tolerant cooperative control amidst dynamic changes in the capabilities of the robot team.

  15. Pareto Optimization of a Half Car Passive Suspension Model Using a Novel Multiobjective Heat Transfer Search Algorithm

    OpenAIRE

    Savsani, Vimal; Patel, Vivek; Gadhvi, Bhargav; Tawhid, Mohamed

    2017-01-01

    Most of the modern multiobjective optimization algorithms are based on the search technique of genetic algorithms; however the search techniques of other recently developed metaheuristics are emerging topics among researchers. This paper proposes a novel multiobjective optimization algorithm named multiobjective heat transfer search (MOHTS) algorithm, which is based on the search technique of heat transfer search (HTS) algorithm. MOHTS employs the elitist nondominated sorting and crowding dis...

  16. Search for the Standard Model Higgs boson decaying to tau leptons with the CMS experiment at LHC

    International Nuclear Information System (INIS)

    Bianchini, L.

    2012-01-01

    In this thesis, I present my work in the CMS experiment on a search for the standard model Higgs boson decaying into a pair of tau leptons. The original goal and the final aim of this research is a contribution to the discovery of the Higgs boson at the Lhc. After a summary of the theoretical framework and of the experimental apparatus, I will describe the partial flow technique developed for the offline CMS event reconstruction, which I contributed to commission with the first Lhc collisions delivered at 900 GeV and 7 TeV center-of-mass energy. The partial flow reconstruction gives optimal performances for the measurement of jets, missing transverse energy and tau particles, and is therefore ideally suited for the search of the Higgs boson decaying to tau leptons. Tau reconstruction and identification in CMS are described. Particular emphasis is devoted to the discrimination between the electrons and tau leptons decaying semi-leptonic ally (giving hadrons and neutrinos), an aspect of the tau identification where I brought original improvements. A crucial and challenging aspect in the search for the Higgs boson decaying into tau leptons is the reconstruction of the di-tau mass, given that an unknown fraction of the tau momenta is carried away by the undetected neutrinos. Existing and novel di-tau mass reconstruction techniques are described. On this subject, I have provided original contributions in the development of a new likelihood-based technique, called SVfit, which is then used for the analysis. Finally, a search for the Standard Model Higgs boson in the di-tau channel, based on 4.9 fb -1 of pp collisions at √(s) = 7 TeV, is presented. A first version of this analysis was completed for the CMS publications in Spring 2012. This analysis was then further improved and included in the combination using an additional 5.3 fb -1 collected at √(s) = 8 TeV in the first half of 2012. This 2012 version of the analysis is presented here. Events are selected where one

  17. Prices and heterogeneous search costs

    NARCIS (Netherlands)

    Luis Moraga-Gonzalez, Jose; Sandor, Zsolt; Wildenbeest, Matthijs R.

    2017-01-01

    We study price formation in a model of consumer search for differentiated products in which consumers have heterogeneous search costs. We provide conditions under which a pure-strategy symmetric Nash equilibrium exists and is unique. Search costs affect two margins-the intensive search margin (or

  18. Personalized Search

    CERN Document Server

    AUTHOR|(SzGeCERN)749939

    2015-01-01

    As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.

  19. SEARCHING FOR TROJAN ASTEROIDS IN THE HD 209458 SYSTEM: SPACE-BASED MOST PHOTOMETRY AND DYNAMICAL MODELING

    International Nuclear Information System (INIS)

    Moldovan, Reka; Matthews, Jaymie M.; Gladman, Brett; Bottke, William F.; Vokrouhlicky, David

    2010-01-01

    We have searched Microvariability and Oscillations of Stars (MOST) satellite photometry obtained in 2004, 2005, and 2007 of the solar-type star HD 209458 for Trojan asteroid swarms dynamically coupled with the system's transiting 'hot Jupiter' HD 209458b. Observations of the presence and nature of asteroids around other stars would provide unique constraints on migration models of exoplanetary systems. Our results set an upper limit on the optical depth of Trojans in the HD 209458 system that can be used to guide current and future searches of similar systems by upcoming missions. Using cross-correlation methods with artificial signals implanted in the data, we find that our detection limit corresponds to a relative Trojan transit depth of 1 x10 -4 , equivalent to ∼1 lunar mass of asteroids, assuming power-law Trojan size distributions similar to Jupiter's Trojans in our solar system. We confirm with dynamical interpretations that some asteroids could have migrated inward with the planet to its current orbit at 0.045 AU, and that the Yarkovsky effect is ineffective at eliminating objects of >1 m in size. However, using numerical models of collisional evolution we find that, due to high relative speeds in this confined Trojan environment, collisions destroy the vast majority of the asteroids in -7 .

  20. Search for the Standard Model Higgs boson in the decay channel H → ZZ(*) → 4l at CMS

    International Nuclear Information System (INIS)

    Singh, Chahal Gurpreet

    2012-01-01

    A search for the Standard Model (SM) Higgs boson in the decay channel H → ZZ (*) → 4l with each Z boson decaying to an electron or muon pair is presented using pp collisions from the LHC at √s = 7 TeV. The data analysed correspond to an integrated luminosity of 1.66 ±0.07 fb -1 recorded by the CMS detector in 2010 and 2011. The search covers Higgs boson mass (mH) hypotheses of 110 2 . Twenty-one events are observed, while 21.2 ± 0.8 events are expected from Standard Model (SM) background processes. The events are not clustered in mass excluding interpretation as the SM Higgs boson and its (4l) mass distribution is consistent with the expectation of SM continuum production of ZZ (*) pairs. Upper limits at 95% CL on the cross-section x branching ratio for a SM Higgs boson with SM like decays exclude cross-sections from about once to twice the expected SM cross-section for masses in the range of 150 2 . (author)

  1. Searches for the Standard Model Higgs boson at the Tevatron collider

    Energy Technology Data Exchange (ETDEWEB)

    Fisher, Wade C. [Michigan State Univ., East Lansing, MI (United States). Dept. of Physics and Astronomy; Junk, Thomas R. [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States)

    2016-01-01

    +τ-, H → γγ, and H → ZZ. This chapter summarizes the search methods and the results of the Higgs boson search at the Tevatron. The increased sophistication of the analysis techniques as the collider run progressed is discussed, covering the strategies used over time to improve the sensitivity and breadth of the analyses. Using the full Tevatron data sample for both experiments, the combined Higgs search in all channels observes an excess consistent with the predicted SM Higgs boson signal with mass of 125 GeV, with a significance of 3.0 standard deviations above the background prediction.

  2. Employees` motivation model in Lithuanian food industry : Search for theoretical and practical premises

    OpenAIRE

    Marcinkevičiūtė, Lina

    2005-01-01

    A complex use of employee motivation measures has recently been the issue of discussions, and a practical approach to this issue has become increasingly relevant. The paper aims to prepare an employee motivation model under the changing market conditions. When creating a rational employee motivation model, a certain logical analysis and consistency should be followed, because the creation of a model requires a considerable preparatory work, i.e. the evaluation of the current state of employee...

  3. Searches for rare and non-Standard-Model decays of the Higgs boson

    CERN Document Server

    Sun, Xiaohu; The ATLAS collaboration

    2018-01-01

    Theories beyond the Standard Model predict Higgs boson decays at a much enhanced rate compared to the Standard Model, e.g. for decays to Z+photon or a meson and a photon, or decays that do not exist in the Standard Model, such as decays into two light bosons (a). This talk presents recent results based on 36 fb-1 of pp collision data collected at 13 TeV.

  4. In search of laterally heterogeneous viscosity models of Glacial Isostatic Adjustment with the ICE-6G_C global ice history model

    Science.gov (United States)

    Li, Tanghua; Wu, Patrick; Steffen, Holger; Wang, Hansheng

    2018-05-01

    Most models of Glacial Isostatic Adjustment (GIA) assume that the Earth is laterally homogeneous. However, seismic and geological observations clearly show that the Earth's mantle is laterally heterogeneous. Previous studies of GIA with lateral heterogeneity mostly focused on its effect or sensitivity on GIA predictions, and it is not clear to what extent can lateral heterogeneity solve the misfits between GIA predictions and observations. Our aim is to search for the best 3D viscosity models that can simultaneously fit the global relative sea-level (RSL) data, the peak uplift rates (u-dot from GNSS) and peak gravity-rate-of-change (g-dot from the GRACE satellite mission) in Laurentia and Fennoscandia. However, the search is dependent on the ice and viscosity model inputs - the latter depends on the background viscosity and the seismic tomography models used. In this paper, the ICE-6G_C ice model, with Bunge & Grand's seismic tomography model and background viscosity models close to VM5 will be assumed. A Coupled Laplace-Finite Element Method is used to compute gravitationally self-consistent sea level change with time dependent coastlines and rotational feedback in addition to changes in deformation, gravity and the state of stress. Several laterally heterogeneous models are found to fit the global sea level data better than laterally homogeneous models. Two of these laterally heterogeneous models also fit the ICE-6G_C peak g-dot and u-dot rates observed in Laurentia simultaneously. However, even with the introduction of lateral heterogeneity, no model that is able to fit the present-day g-dot and uplift rate data in Fennoscandia has been found. Therefore, either the ice history of ICE-6G_C in Fennoscandia and Barent Sea needs some modifications, or the sub-lithospheric property/non-thermal effect underneath northern Europe must be different from that underneath Laurentia.

  5. Search for the associated production of the standard-model Higgs Boson in the all-hadronic channel.

    Science.gov (United States)

    Aaltonen, T; Adelman, J; Akimoto, T; Albrow, M G; Alvarez González, B; Amerio, S; Amidei, D; Anastassov, A; Annovi, A; Antos, J; Apollinari, G; Apresyan, A; Arisawa, T; Artikov, A; Ashmanskas, W; Attal, A; Aurisano, A; Azfar, F; Azzurri, P; Badgett, W; Barbaro-Galtieri, A; Barnes, V E; Barnett, B A; Bartsch, V; Bauer, G; Beauchemin, P-H; Bedeschi, F; Bednar, P; Beecher, D; Behari, S; Bellettini, G; Bellinger, J; Benjamin, D; Beretvas, A; Beringer, J; Bhatti, A; Binkley, M; Bisello, D; Bizjak, I; Blair, R E; Blocker, C; Blumenfeld, B; Bocci, A; Bodek, A; Boisvert, V; Bolla, G; Bortoletto, D; Boudreau, J; Boveia, A; Brau, B; Bridgeman, A; Brigliadori, L; Bromberg, C; Brubaker, E; Budagov, J; Budd, H S; Budd, S; Burkett, K; Busetto, G; Bussey, P; Buzatu, A; Byrum, K L; Cabrera, S; Calancha, C; Campanelli, M; Campbell, M; Canelli, F; Canepa, A; Carlsmith, D; Carosi, R; Carrillo, S; Carron, S; Casal, B; Casarsa, M; Castro, A; Catastini, P; Cauz, D; Cavaliere, V; Cavalli-Sforza, M; Cerri, A; Cerrito, L; Chang, S H; Chen, Y C; Chertok, M; Chiarelli, G; Chlachidze, G; Chlebana, F; Cho, K; Chokheli, D; Chou, J P; Choudalakis, G; Chuang, S H; Chung, K; Chung, W H; Chung, Y S; Ciobanu, C I; Ciocci, M A; Clark, A; Clark, D; Compostella, G; Convery, M E; Conway, J; Copic, K; Cordelli, M; Cortiana, G; Cox, D J; Crescioli, F; Cuenca Almenar, C; Cuevas, J; Culbertson, R; Cully, J C; Dagenhart, D; Datta, M; Davies, T; de Barbaro, P; De Cecco, S; Deisher, A; De Lorenzo, G; Dell'Orso, M; Deluca, C; Demortier, L; Deng, J; Deninno, M; Derwent, P F; di Giovanni, G P; Dionisi, C; Di Ruzza, B; Dittmann, J R; D'Onofrio, M; Donati, S; Dong, P; Donini, J; Dorigo, T; Dube, S; Efron, J; Elagin, A; Erbacher, R; Errede, D; Errede, S; Eusebi, R; Fang, H C; Farrington, S; Fedorko, W T; Feild, R G; Feindt, M; Fernandez, J P; Ferrazza, C; Field, R; Flanagan, G; Forrest, R; Franklin, M; Freeman, J C; Furic, I; Gallinaro, M; Galyardt, J; Garberson, F; Garcia, J E; Garfinkel, A F; Genser, K; Gerberich, H; Gerdes, D; Gessler, A; Giagu, S; Giakoumopoulou, V; Giannetti, P; Gibson, K; Gimmell, J L; Ginsburg, C M; Giokaris, N; Giordani, M; Giromini, P; Giunta, M; Giurgiu, G; Glagolev, V; Glenzinski, D; Gold, M; Goldschmidt, N; Golossanov, A; Gomez, G; Gomez-Ceballos, G; Goncharov, M; González, O; Gorelov, I; Goshaw, A T; Goulianos, K; Gresele, A; Grinstein, S; Grosso-Pilcher, C; Group, R C; Grundler, U; Guimaraes da Costa, J; Gunay-Unalan, Z; Haber, C; Hahn, K; Hahn, S R; Halkiadakis, E; Han, B-Y; Han, J Y; Handler, R; Happacher, F; Hara, K; Hare, D; Hare, M; Harper, S; Harr, R F; Harris, R M; Hartz, M; Hatakeyama, K; Hauser, J; Hays, C; Heck, M; Heijboer, A; Heinemann, B; Heinrich, J; Henderson, C; Herndon, M; Heuser, J; Hewamanage, S; Hidas, D; Hill, C S; Hirschbuehl, D; Hocker, A; Hou, S; Houlden, M; Hsu, S-C; Huffman, B T; Hughes, R E; Husemann, U; Huston, J; Incandela, J; Introzzi, G; Iori, M; Ivanov, A; James, E; Jayatilaka, B; Jeon, E J; Jha, M K; Jindariani, S; Johnson, W; Jones, M; Joo, K K; Jun, S Y; Jung, J E; Junk, T R; Kamon, T; Kar, D; Karchin, P E; Kato, Y; Kephart, R; Keung, J; Khotilovich, V; Kilminster, B; Kim, D H; Kim, H S; Kim, J E; Kim, M J; Kim, S B; Kim, S H; Kim, Y K; Kimura, N; Kirsch, L; Klimenko, S; Knuteson, B; Ko, B R; Koay, S A; Kondo, K; Kong, D J; Konigsberg, J; Korytov, A; Kotwal, A V; Kreps, M; Kroll, J; Krop, D; Krumnack, N; Kruse, M; Krutelyov, V; Kubo, T; Kuhr, T; Kulkarni, N P; Kurata, M; Kusakabe, Y; Kwang, S; Laasanen, A T; Lami, S; Lammel, S; Lancaster, M; Lander, R L; Lannon, K; Lath, A; Latino, G; Lazzizzera, I; LeCompte, T; Lee, E; Lee, S W; Leone, S; Lewis, J D; Lin, C S; Linacre, J; Lindgren, M; Lipeles, E; Lister, A; Litvintsev, D O; Liu, C; Liu, T; Lockyer, N S; Loginov, A; Loreti, M; Lovas, L; Lu, R-S; Lucchesi, D; Lueck, J; Luci, C; Lujan, P; Lukens, P; Lungu, G; Lyons, L; Lys, J; Lysak, R; Lytken, E; Mack, P; MacQueen, D; Madrak, R; Maeshima, K; Makhoul, K; Maki, T; Maksimovic, P; Malde, S; Malik, S; Manca, G; Manousakis-Katsikakis, A; Margaroli, F; Marino, C; Marino, C P; Martin, A; Martin, V; Martínez, M; Martínez-Ballarín, R; Maruyama, T; Mastrandrea, P; Masubuchi, T; Mattson, M E; Mazzanti, P; McFarland, K S; McIntyre, P; McNulty, R; Mehta, A; Mehtala, P; Menzione, A; Merkel, P; Mesropian, C; Miao, T; Miladinovic, N; Miller, R; Mills, C; Milnik, M; Mitra, A; Mitselmakher, G; Miyake, H; Moggi, N; Moon, C S; Moore, R; Morello, M J; Morlok, J; Movilla Fernandez, P; Mülmenstädt, J; Mukherjee, A; Muller, Th; Mumford, R; Murat, P; Mussini, M; Nachtman, J; Nagai, Y; Nagano, A; Naganoma, J; Nakamura, K; Nakano, I; Napier, A; Necula, V; Neu, C; Neubauer, M S; Nielsen, J; Nodulman, L; Norman, M; Norniella, O; Nurse, E; Oakes, L; Oh, S H; Oh, Y D; Oksuzian, I; Okusawa, T; Orava, R; Osterberg, K; Pagan Griso, S; Pagliarone, C; Palencia, E; Papadimitriou, V; Papaikonomou, A; Paramonov, A A; Parks, B; Pashapour, S; Patrick, J; Pauletta, G; Paulini, M; Paus, C; Pellett, D E; Penzo, A; Phillips, T J; Piacentino, G; Pianori, E; Pinera, L; Pitts, K; Plager, C; Pondrom, L; Poukhov, O; Pounder, N; Prakoshyn, F; Pronko, A; Proudfoot, J; Ptohos, F; Pueschel, E; Punzi, G; Pursley, J; Rademacker, J; Rahaman, A; Ramakrishnan, V; Ranjan, N; Redondo, I; Reisert, B; Rekovic, V; Renton, P; Rescigno, M; Richter, S; Rimondi, F; Ristori, L; Robson, A; Rodrigo, T; Rodriguez, T; Rogers, E; Rolli, S; Roser, R; Rossi, M; Rossin, R; Roy, P; Ruiz, A; Russ, J; Rusu, V; Saarikko, H; Safonov, A; Sakumoto, W K; Saltó, O; Santi, L; Sarkar, S; Sartori, L; Sato, K; Savoy-Navarro, A; Scheidle, T; Schlabach, P; Schmidt, A; Schmidt, E E; Schmidt, M A; Schmidt, M P; Schmitt, M; Schwarz, T; Scodellaro, L; Scott, A L; Scribano, A; Scuri, F; Sedov, A; Seidel, S; Seiya, Y; Semenov, A; Sexton-Kennedy, L; Sfyrla, A; Shalhout, S Z; Shears, T; Shepard, P F; Sherman, D; Shimojima, M; Shiraishi, S; Shochet, M; Shon, Y; Shreyber, I; Sidoti, A; Sinervo, P; Sisakyan, A; Slaughter, A J; Slaunwhite, J; Sliwa, K; Smith, J R; Snider, F D; Snihur, R; Soha, A; Somalwar, S; Sorin, V; Spalding, J; Spreitzer, T; Squillacioti, P; Stanitzki, M; St Denis, R; Stelzer, B; Stelzer-Chilton, O; Stentz, D; Strologas, J; Stuart, D; Suh, J S; Sukhanov, A; Suslov, I; Suzuki, T; Taffard, A; Takashima, R; Takeuchi, Y; Tanaka, R; Tecchio, M; Teng, P K; Terashi, K; Thom, J; Thompson, A S; Thompson, G A; Thomson, E; Tipton, P; Tiwari, V; Tkaczyk, S; Toback, D; Tokar, S; Tollefson, K; Tomura, T; Tonelli, D; Torre, S; Torretta, D; Totaro, P; Tourneur, S; Tu, Y; Turini, N; Ukegawa, F; Vallecorsa, S; van Remortel, N; Varganov, A; Vataga, E; Vázquez, F; Velev, G; Vellidis, C; Veszpremi, V; Vidal, M; Vidal, R; Vila, I; Vilar, R; Vine, T; Vogel, M; Volobouev, I; Volpi, G; Würthwein, F; Wagner, P; Wagner, R G; Wagner, R L; Wagner-Kuhr, J; Wagner, W; Wakisaka, T; Wallny, R; Wang, S M; Warburton, A; Waters, D; Weinberger, M; Wester, W C; Whitehouse, B; Whiteson, D; Wicklund, A B; Wicklund, E; Williams, G; Williams, H H; Wilson, P; Winer, B L; Wittich, P; Wolbers, S; Wolfe, C; Wright, T; Wu, X; Wynne, S M; Xie, S; Yagil, A; Yamamoto, K; Yamaoka, J; Yang, U K; Yang, Y C; Yao, W M; Yeh, G P; Yoh, J; Yorita, K; Yoshida, T; Yu, G B; Yu, I; Yu, S S; Yun, J C; Zanello, L; Zanetti, A; Zaw, I; Zhang, X; Zheng, Y; Zucchelli, S

    2009-11-27

    We report on a search for the standard-model Higgs boson in pp collisions at square root(s) = 1.96 TeV using an integrated luminosity of 2.0 fb(-1). We look for production of the Higgs boson decaying to a pair of bottom quarks in association with a vector boson V (W or Z) decaying to quarks, resulting in a four-jet final state. Two of the jets are required to have secondary vertices consistent with B-hadron decays. We set the first 95% confidence level upper limit on the VH production cross section with V(--> qq/qq')H(--> bb) decay for Higgs boson masses of 100-150 GeV/c2 using data from run II at the Fermilab Tevatron. For m(H) = 120 GeV/c2, we exclude cross sections larger than 38 times the standard-model prediction.

  6. Search for the Standard Model Higgs boson decaying to $b$ quarks with the CMS experiment

    CERN Document Server

    Donato, Silvio; Rizzi, Andrea

    2017-01-01

    Chapter 1 describes the theory of the Higgs boson in the framework of the SM and gives an overview of the physics of the Higgs boson and of its search performed by the CMS and ATLAS collaborations during the LHC Run 1. Chapter 2 introduces the CMS experiment at the LHC and the event reconstruction used by CMS. My contribution to the event reconstruction is an improvement of the tracking in the core of energetic jets, described in Appendix A. The last section of this Chapter will present the trigger system of CMS, with special attention to the High Level Trigger (HLT). The whole Chapter 3 is devoted to the description of the trigger improvements that I developed during my Ph.D. One of the most important achievements is a fast track- ing that allows to identify pile-up jets for any event accepted by the hardware trigger (∼ 100 kHz). This fast tracking exploits a novel algorithm, the Fast Primary Vertex, that localizes the primary vertex without using tracks, but just hits recorded by the pixel detector and je...

  7. In search of a health education model: teachers' conceptions in four Mediterranean countries.

    Science.gov (United States)

    Caussidier, Claude; El Hage, Fadi; Munoz, François; Remki, Latifa; Larribi, Rym; Khzami, Salah-Eddine; Berger, Dominique; de Carvalho, Graça S; Favre, Daniel

    2011-12-01

    School programs are defined to promote the health of the pupils and to develop their competencies so that they can adopt behaviors favorable to their health. With the European project FP6 Biohead-Citizen (2004-2007), we analyzed the conceptions of teachers as regards health education, in France, Lebanon, Morocco and Tunisia, in reference to the biomedical model and the social health model. These four countries were selected because their school curricula represented different models of health education. Lebanon and Tunisia addressed health education with the biomedical model. In Morocco, the curriculum was also primarily based on the biomedical model and enclosed a few instructions issued from the social health model. In France, the health education curriculum declared an approach based on the health promotion model. Our study was based on multivariate statistical analyses of questionnaires filled out by 2537 in-service and pre-service teachers. Our analysis showed that the conceptions of the teachers concerning health education were not structured and related to a specific model. We also found that the dominating factors of influence on the choices expressed with regards to health education were, among different sociocultural variables, the religion, the home country, and, to a lesser extent, the level of training. Thus, the conceptions of the teachers were not integrated into comprehensive approaches but related to individual characteristics. Consequently health education implementation would require thorough training for pre-service and in-service teachers and should also explicitly take into account their conceptions and values.

  8. Search for the Standard Model Higgs boson produced in the decay ...

    Indian Academy of Sciences (India)

    2012-10-06

    Oct 6, 2012 ... s = 7 TeV. No evidence is found for a significant deviation from Standard Model expectations anywhere in the ZZ mass range considered in this analysis. An upper limit at 95% CL is placed on the product of the cross-section and decay branching ratio for the Higgs boson decaying with Standard Model-like ...

  9. On looking into the Black Box: Prospects and Limits in the Search for Mental Models

    Science.gov (United States)

    1985-05-01

    particularly in terms of the ways in which humans understand systems. Norman (19831 characterizes this understanding as messy, sloppy, incomplete, and...Kleinman, et al., 1971]). However, for tasks involving only monitoring [ Smallwood , 1967; Sheridan, 1970], especially when apparent discontinuities...18 Norman [1983] uses the word "conceptaalization" to characterize researchers’ models of humans’ mental models. This characterization serves to

  10. On Looking into the Black Box: Prospects and Limits in the Search for Mental Models

    Science.gov (United States)

    Rouse, W. B.; Morris, N. M.

    1984-01-01

    To place the arguments advanced in this paper in alternative points of view with regard to mental models are reviewed. Use of the construct in areas such as neural information processing, manual control, decision making, problem solving, and cognitive science are discussed. Also reviewed are several taxonomies of mental models. The available empirical evidence for answering questions concerning the nature and usage of mental models is then discussed. A variety of studies are reviewed where the type and form of humans' knowledge have been manipulated. Also considered are numerous transfer of training studies whose results provide indirect evidence of the nature of mental models. The alternative perspectives considered and the spectrum of empirical evidence are combined to suggest a framework within which research on mental models can be viewed. By considering interactions of dimensions of this framework, the most salient unanswered questions can be identified.

  11. Nutrigenomics-based personalised nutritional advice: in search of a business model?

    Science.gov (United States)

    Ronteltap, Amber; van Trijp, Hans; Berezowska, Aleksandra; Goossens, Jo

    2013-03-01

    Nutritional advice has mainly focused on population-level recommendations. Recent developments in nutrition, communication, and marketing sciences have enabled potential deviations from this dominant business model in the direction of personalisation of nutrition advice. Such personalisation efforts can take on many forms, but these have in common that they can only be effective if they are supported by a viable business model. The present paper takes an inventory of approaches to personalised nutrition currently available in the market place as its starting point to arrive at an identification of their underlying business models. This analysis is presented as a unifying framework against which the potential of nutrigenomics-based personalised advice can be assessed. It has uncovered nine archetypical approaches to personalised nutrition advice in terms of their dominant underlying business models. Differentiating features among such business models are the type of information that is used as a basis for personalisation, the definition of the target group, the communication channels that are being adopted, and the partnerships that are built as a part of the business model. Future research should explore the consumer responses to the diversity of "archetypical" business models for personalised nutrition advice as a source of market information on which the delivery of nutrigenomics-based personalised nutrition advice may further build.

  12. A combined search for the standard model Higgs boson at √(s)=1.96 TeV

    International Nuclear Information System (INIS)

    Abazov, V.M.; Abbott, B.; Abolins, M.; Acharya, B.S.; Adams, M.; Adams, T.; Aguilo, E.; Ahn, S.H.; Ahsan, M.; Alexeev, G.D.; Alkhazov, G.; Alton, A.; Alverson, G.; Alves, G.A.; Anastasoaie, M.; Ancu, L.S.; Andeen, T.; Anderson, S.; Andrieu, B.; Anzelc, M.S.

    2008-01-01

    We present new results of the search for WH→lνbb-bar production in pp-bar collisions at a center-of-mass energy of √(s)=1.96 TeV, based on a dataset with integrated luminosity of 0.44 fb -1 . We combine these new results with previously published searches by the D0 collaboration, for WH and ZH production analyzed in the E/ T bb-bar final state, for ZH (→l + l - bb-bar) production, for WH (→WWW) production, and for H (→WW) direct production. No signal-like excess is observed either in the WH analysis or in the combination of all D0 Higgs boson analyses. We set 95% C.L. (expected) upper limits on σ(pp-bar→WH)xB(H→bb-bar) ranging from 1.6 (2.2) pb to 1.9 (3.3) pb for Higgs boson masses between 105 and 145 GeV, to be compared to the theoretical prediction of 0.13 pb for a Standard Model (SM) Higgs boson with mass m H =115 GeV. After combination with the other D0 Higgs boson searches, we obtain for m H =115 GeV an observed (expected) limit 8.5 (12.1) times higher than the SM predicted Higgs boson production cross section. For m H =160 GeV, the corresponding observed (expected) ratio is 10.2 (9.0)

  13. Absorbing systematic effects to obtain a better background model in a search for new physics

    International Nuclear Information System (INIS)

    Caron, S; Horner, S; Sundermann, J E; Cowan, G; Gross, E

    2009-01-01

    This paper presents a novel approach to estimate the Standard Model backgrounds based on modifying Monte Carlo predictions within their systematic uncertainties. The improved background model is obtained by altering the original predictions with successively more complex correction functions in signal-free control selections. Statistical tests indicate when sufficient compatibility with data is reached. In this way, systematic effects are absorbed into the new background model. The same correction is then applied on the Monte Carlo prediction in the signal region. Comparing this method to other background estimation techniques shows improvements with respect to statistical and systematic uncertainties. The proposed method can also be applied in other fields beyond high energy physics.

  14. Collective Odor Source Estimation and Search in Time-Variant Airflow Environments Using Mobile Robots

    Science.gov (United States)

    Meng, Qing-Hao; Yang, Wei-Xing; Wang, Yang; Zeng, Ming

    2011-01-01

    This paper addresses the collective odor source localization (OSL) problem in a time-varying airflow environment using mobile robots. A novel OSL methodology which combines odor-source probability estimation and multiple robots’ search is proposed. The estimation phase consists of two steps: firstly, the separate probability-distribution map of odor source is estimated via Bayesian rules and fuzzy inference based on a single robot’s detection events; secondly, the separate maps estimated by different robots at different times are fused into a combined map by way of distance based superposition. The multi-robot search behaviors are coordinated via a particle swarm optimization algorithm, where the estimated odor-source probability distribution is used to express the fitness functions. In the process of OSL, the estimation phase provides the prior knowledge for the searching while the searching verifies the estimation results, and both phases are implemented iteratively. The results of simulations for large-scale advection–diffusion plume environments and experiments using real robots in an indoor airflow environment validate the feasibility and robustness of the proposed OSL method. PMID:22346650

  15. Mitigating the Insider Threat Using High-Dimensional Search and Modeling

    National Research Council Canada - National Science Library

    Van Den Berg, Eric; Uphadyaya, Shambhu; Ngo, Phi H; Muthukrishnan, Muthu; Palan, Rajago

    2006-01-01

    .... Further accomplishments in this project include an insider attack modeling and analysis tool called MAPIT, developed by SUNY Buffalo, and a novel sketch-based anomaly detection sensor developed...

  16. Nutrigenomics-based personalised nutritional advice: in search of a business model?

    NARCIS (Netherlands)

    Ronteltap, A.; Trijp, van J.C.M.; Berezowska, A.; Goossens, Jo

    2013-01-01

    Nutritional advice has mainly focused on population-level recommendations. Recent developments in nutrition, communication, and marketing sciences have enabled potential deviations from this dominant business model in the direction of personalisation of nutrition advice. Such personalisation efforts

  17. A model-independent approach to the search for the sun neutrino oscillations from SNO data

    International Nuclear Information System (INIS)

    Beshtoev, Kh.M.

    1996-01-01

    A model-independent approach to analyse the existence of the Sun neutrino oscillations from SNO data is proposed. The used approximations for the calculations are offered as well as a scheme to determine the existence of the neutrino oscillations

  18. Modeling an Optical and Infrared Search for Extraterrestrial Intelligence Survey with Exoplanet Direct Imaging

    Science.gov (United States)

    Vides, Christina; Macintosh, Bruce; Ruffio, Jean-Baptiste; Nielsen, Eric; Povich, Matthew Samuel

    2018-01-01

    Gemini Planet Imager (GPI) is a direct high contrast imaging instrument coupled to the Gemini South Telescope. Its purpose is to image extrasolar planets around young (~Intelligence), we modeled GPI’s capabilities to detect an extraterrestrial continuous wave (CW) laser broadcasted within the H-band have been modeled. By using sensitivity evaluated for actual GPI observations of young target stars, we produced models of the CW laser power as a function of distance from the star that could be detected if GPI were to observe nearby (~ 3-5 pc) planet-hosting G-type stars. We took a variety of transmitters into consideration in producing these modeled values. GPI is known to be sensitive to both pulsed and CW coherent electromagnetic radiation. The results were compared to similar studies and it was found that these values are competitive to other optical and infrared observations.

  19. A search for distinctive features of demand-led growth models

    OpenAIRE

    Sergio Parrinello

    2014-01-01

    This paper aims at a critical and constructive assessment of some extensions of Keynes’s analysis of effective demand to the long period and growth. A criticism is addressed to a single-cause interpretation of the demand-led growth models and to the notion of normal capacity utilization adopted in such models. A positive argument tries to find a distinctive characterization of those extensions in the productive and financial conditions that make effective the autonomous changes in aggregate d...

  20. Tools for model-independent bounds in direct dark matter searches

    DEFF Research Database (Denmark)

    Cirelli, M.; Del Nobile, E.; Panci, P.

    2013-01-01

    We discuss a framework (based on non-relativistic operators) and a self-contained set of numerical tools to derive the bounds from some current direct detection experiments on virtually any arbitrary model of Dark Matter elastically scattering on nuclei.......We discuss a framework (based on non-relativistic operators) and a self-contained set of numerical tools to derive the bounds from some current direct detection experiments on virtually any arbitrary model of Dark Matter elastically scattering on nuclei....

  1. Non-SUSY Beyond Standard Model Searches: Recent Results from ATLAS and CMS

    OpenAIRE

    Malek, Fairouz

    2015-01-01

    The Standard Model of particle physics is a sensational success, especially since the discovery of the 125 GeV Higgs boson. However, there are still numerous unanswered questions. Why is the Higgs so light? Do the interactions couplings unify and how can gravity be included? Why three fermion generations? What is dark matter? Theories Beyond the Standard Model (BSM), such as Grand Unified Theories, Extra Dimensions or Technicolour are trying to answer these questions. In this proceedings, we ...

  2. A Novel Hierarchical Model to Locate Health Care Facilities with Fuzzy Demand Solved by Harmony Search Algorithm

    Directory of Open Access Journals (Sweden)

    Mehdi Alinaghian

    2014-08-01

    Full Text Available In the field of health losses resulting from failure to establish the facilities in a suitable location and the required number, beyond the cost and quality of service will result in an increase in mortality and the spread of diseases. So the facility location models have special importance in this area. In this paper, a successively inclusive hierarchical model for location of health centers in term of the transfer of patients from a lower level to a higher level of health centers has been developed. Since determination the exact number of demand for health care in the future is difficult and in order to make the model close to the real conditions of demand uncertainty, a fuzzy programming model based on credibility theory is considered. To evaluate the proposed model, several numerical examples are solved in small size. In order to solve large scale problems, a meta-heuristic algorithm based on harmony search algorithm was developed in conjunction with the GAMS software which indicants the performance of the proposed algorithm.

  3. Exploring L1 model space in search of conductivity bounds for the MT problem

    Science.gov (United States)

    Wheelock, B. D.; Parker, R. L.

    2013-12-01

    Geophysical inverse problems of the type encountered in electromagnetic techniques are highly non-unique. As a result, any single inverted model, though feasible, is at best inconclusive and at worst misleading. In this paper, we use modified inversion methods to establish bounds on electrical conductivity within a model of the earth. Our method consists of two steps, each making use of the 1-norm in model regularization. Both 1-norm minimization problems are framed without approximation as non-negative least-squares (NNLS) problems. First, we must identify a parsimonious set of regions within the model for which upper and lower bounds on average conductivity will be sought. This is accomplished by minimizing the 1-norm of spatial variation, which produces a model with a limited number of homogeneous regions; in fact, the number of homogeneous regions will never be greater than the number of data, regardless of the number of free parameters supplied. The second step establishes bounds for each of these regions with pairs of inversions. The new suite of inversions also uses a 1-norm penalty, but applied to the conductivity values themselves, rather than the spatial variation thereof. In the bounding step we use the 1-norm of our model parameters because it is proportional to average conductivity. For a lower bound on average conductivity, the 1-norm within a bounding region is minimized. For an upper bound on average conductivity, the 1-norm everywhere outside a bounding region is minimized. The latter minimization has the effect of concentrating conductance into the bounding region. Taken together, these bounds are a measure of the uncertainty in the associated region of our model. Starting with a blocky inverse solution is key in the selection of the bounding regions. Of course, there is a tradeoff between resolution and uncertainty: an increase in resolution (smaller bounding regions), results in greater uncertainty (wider bounds). Minimization of the 1-norm of

  4. Clinical challenges of chronic wounds: searching for an optimal animal model to recapitulate their complexity

    Directory of Open Access Journals (Sweden)

    Robert Nunan

    2014-11-01

    Full Text Available The efficient healing of a skin wound is something that most of us take for granted but is essential for surviving day-to-day knocks and cuts, and is absolutely relied on clinically whenever a patient receives surgical intervention. However, the management of a chronic wound – defined as a barrier defect that has not healed in 3 months – has become a major therapeutic challenge throughout the Western world, and it is a problem that will only escalate with the increasing incidence of conditions that impede wound healing, such as diabetes, obesity and vascular disorders. Despite being clinically and molecularly heterogeneous, all chronic wounds are generally assigned to one of three major clinical categories: leg ulcers, diabetic foot ulcers or pressure ulcers. Although we have gleaned much knowledge about the fundamental cellular and molecular mechanisms that underpin healthy, acute wound healing from various animal models, we have learned much less about chronic wound repair pathology from these models. This might largely be because the animal models being used in this field of research have failed to recapitulate the clinical features of chronic wounds. In this Clinical Puzzle article, we discuss the clinical complexity of chronic wounds and describe the best currently available models for investigating chronic wound pathology. We also assess how such models could be optimised to become more useful tools for uncovering pathological mechanisms and potential therapeutic treatments.

  5. A Hybrid Method for the Modelling and Optimisation of Constrained Search Problems

    Directory of Open Access Journals (Sweden)

    Sitek Pawel

    2014-08-01

    Full Text Available The paper presents a concept and the outline of the implementation of a hybrid approach to modelling and solving constrained problems. Two environments of mathematical programming (in particular, integer programming and declarative programming (in particular, constraint logic programming were integrated. The strengths of integer programming and constraint logic programming, in which constraints are treated in a different way and different methods are implemented, were combined to use the strengths of both. The hybrid method is not worse than either of its components used independently. The proposed approach is particularly important for the decision models with an objective function and many discrete decision variables added up in multiple constraints. To validate the proposed approach, two illustrative examples are presented and solved. The first example is the authors’ original model of cost optimisation in the supply chain with multimodal transportation. The second one is the two-echelon variant of the well-known capacitated vehicle routing problem.

  6. Reduced order models inertial manifold and global bifurcations: searching instability boundaries in nuclear power systems

    International Nuclear Information System (INIS)

    Suarez Antola, R.

    2009-01-01

    In the framework of an analytic or numerical model of a BWR power plant, this could imply first to find an suitable approximation to the solution manifold