WorldWideScience

Sample records for modeling multi-robot search

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

    Science.gov (United States)

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

    2014-12-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.

  2. COMPARISON OF EXPLORATION STRATEGIES FOR MULTI-ROBOT SEARCH

    Directory of Open Access Journals (Sweden)

    Miroslav Kulich

    2015-06-01

    Full Text Available Searching for a stationary object in an unknown environment can be formulated as an iterative procedure consisting of map updating, selection of a next goal and navigation to this goal. It finishes when the object of interest is found. This formulation and a general search structure is similar to the related exploration problem. The only difference is in goal-selection, as search and exploration objectives are not the same. Although search is a key task in many search and rescue scenarios, the robotics community has paid little attention to the problem. There is no goal-selection strategy that has been designed specifically for search. In this paper, we study four state-of-the-art strategies for multi-robot exploration, and we evaluate their performance in various environments with respect to the expected time needed to find an object, i.e. to achieve the objective of the search.

  3. A Hybrid of Modified PSO and Local Search on a Multi-robot Search System

    Directory of Open Access Journals (Sweden)

    Mohammad Naim Rastgoo

    2015-07-01

    Full Text Available Particle swarm optimization (PSO, a new population-based algorithm, has recently been used on multi-robot systems. Although this algorithm is applied to solve many optimization problems as well as multi-robot systems, it has some drawbacks when it is applied on multi-robot search systems to find a target in a search space containing big static obstacles. One of these defects is premature convergence. This means that one of the properties of basic PSO is that when particles are spread in a search space, as time increases they tend to converge in a small area. This shortcoming is also evident on a multi-robot search system, particularly when there are big static obstacles in the search space that prevent the robots from finding the target easily; therefore, as time increases, based on this property they converge to a small area that may not contain the target and become entrapped in that area. Another shortcoming is that basic PSO cannot guarantee the global convergence of the algorithm. In other words, initially particles explore different areas, but in some cases they are not good at exploiting promising areas, which will increase the search time. This study proposes a method based on the particle swarm optimization (PSO technique on a multi-robot system to find a target in a search space containing big static obstacles. This method is not only able to overcome the premature convergence problem but also establishes an efficient balance between exploration and exploitation and guarantees global convergence, reducing the search time by combining with a local search method, such as A-star. To validate the effectiveness and usefulness of algorithms, a simulation environment has been developed for conducting simulation-based experiments in different scenarios and for reporting experimental results. These experimental results have demonstrated that the proposed method is able to overcome the premature convergence problem and guarantee global

  4. Discrete-event modeling for internet multi-robotics

    Institute of Scientific and Technical Information of China (English)

    赵杰; 高胜; 蔡鹤皋

    2004-01-01

    Intemet multi-robotics is a typical discrete-event system. In order to describe joint activities between multiple operators and multiple robots, a 4-level discrete-event model is proposed in this paper based on the controlled condition/event Petri nets (CCEP). On the first or mission level, the task splitting of the system is defined; on the second or multi-operator level, a precedence graph is introduced for every operator to plan his or her robotic actions; on the third or coordination level, the above precedence graphs are translated and integrated into the corresponding CCEPs in terms of specific rules; and on the last or multi-robot level, operators can select their control range by setting the corresponding control marks of the obtained CCEPs. As a consequence, a clear mechanism of operator-robot collaboration is obtained to conduct the development of the system.

  5. Multi-robot path planning in a dynamic environment using improved gravitational search algorithm

    Directory of Open Access Journals (Sweden)

    P.K. Das

    2016-09-01

    Full Text Available This paper proposes a new methodology to optimize trajectory of the path for multi-robots using improved gravitational search algorithm (IGSA in a dynamic environment. GSA is improved based on memory information, social, cognitive factor of PSO (particle swarm optimization and then, population for next generation is decided by the greedy strategy. A path planning scheme has been developed using IGSA to optimally obtain the succeeding positions of the robots from the existing position. Finally, the analytical and experimental results of the multi-robot path planning have been compared with those obtained by IGSA, GSA and PSO in a similar environment. The simulation and the Khepera environmental results outperform IGSA as compared to GSA and PSO with respect to performance matrix.

  6. Demonstration of multi-robot search and secure

    OpenAIRE

    2010-01-01

    We consider the search and secure problem, where intruders are to be detected in a bounded area without allowing them to escape. The problem is tackled by representing the area to be searched as a traversability graph, which is reduced to a tree graph by placing stationary robots to remove loops. The search of the remaining tree is performed using two strategies that represent different trade-offs between the needed search time and the number of robots. Proof of correctness is provided for th...

  7. Multi-Robot Searching Algorithm Using Levy Flight and Artificial Potential Field

    CERN Document Server

    Sutantyo, Donny K; Nepomnyashchikh, Valentin A; Levi, Paul

    2011-01-01

    An efficient search algorithm is very crucial in robotic area, especially for exploration missions, where the target availability is unknown and the condition of the environment is highly unpredictable. In a very large environment, it is not sufficient to scan an area or volume by a single robot, multiple robots should be involved to perform the collective exploration. In this paper, we propose to combine bio-inspired search algorithm called Levy flight and artificial potential field method to perform an efficient searching algorithm for multi-robot applications. The main focus of this work is not only to prove the concept or to measure the efficiency of the algorithm by experiments, but also to develop an appropriate generic framework to be implemented both in simulation and on real robotic platforms. Several experiments, which compare different search algorithms, are also performed.

  8. 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.

  9. Game Theory Models for Multi-Robot Patrolling of Infrastructures

    Directory of Open Access Journals (Sweden)

    Erik Hernández

    2013-03-01

    Full Text Available This work is focused on the problem of performing multi‐robot patrolling for infrastructure security applications in order to protect a known environment at critical facilities. Thus, given a set of robots and a set of points of interest, the patrolling task consists of constantly visiting these points at irregular time intervals for security purposes. Current existing solutions for these types of applications are predictable and inflexible. Moreover, most of the previous work has tackled the patrolling problem with centralized and deterministic solutions and only few efforts have been made to integrate dynamic methods. Therefore, one of the main contributions of this work is the development of new dynamic and decentralized collaborative approaches in order to solve the aforementioned problem by implementing learning models from Game Theory. The model selected in this work that includes belief‐based and reinforcement models as special cases is called Experience‐Weighted Attraction. The problem has been defined using concepts of Graph Theory to represent the environment in order to work with such Game Theory techniques. Finally, the proposed methods have been evaluated experimentally by using a patrolling simulator. The results obtained have been compared with previous available approaches.

  10. Multi-robot searching with sparse binary cues and limited space perception

    Directory of Open Access Journals (Sweden)

    Siqi eZhang

    2015-05-01

    Full Text Available In this paper, we consider the problem of searching for a source that releases particles in a turbulent medium with searchers having binary sensors and limited space perception.To this aim, we extend an information-theoric strategy to multiple searchers and demonstrate its efficiency both in simulation and robotic experiments. The search time is found to decay as $1/n$ for $n$ cooperative robots as compared to $1/sqrt{n}$ for independent robots so that significant gains in the search time are obtained with a small number of robots, {it e.g.} $n=3$. Search efficiency results from pooling sensory information between robots to improve individual decision-making (three detections on average per searcher were sufficient to reach the source. The methods is robust to odometry errors and is thus relevant to robots searching in low visibility conditions, {it e.g.} firefighter robots exploring smoky environments.

  11. Task allocation of searching in multi-robot system using improved bundled auction%基于改进捆绑拍卖多机器人任务分配研究

    Institute of Scientific and Technical Information of China (English)

    姜来浩; 戴学丰; 蔡标; 陈泽涛

    2014-01-01

    In order to solve the problem of multi-robot in the search process of multi task allocation and multi-robot utilization, this paper presents a K-means clustering with instant auction algorithm based bundle auction.Firstly by using K-means clustering algorithm to solve the problem of multi tasks in multi robot binding ,then using bundled auction mechanism allocates the clusters to the corresponding robots. According to the completion of the tasks in each cluster ,the corresponding robot judge whether to make instant auction. Simulation results proves that this method of the multi-robot in the search process save resource and the robots use equilibrium.%为了解决多机器人在搜索过程中多任务分配和多机器人利用率问题,提出了一种带有即时拍卖的K-means聚类捆绑式拍卖算法。首先通过K-means聚类算法解决多机器人系统中的多任务捆绑问题,再运用捆绑式拍卖机制把聚类分配给相应的机器人。考虑各聚类内的任务完成情况和各机器人利用情况,相应机器人判断是否产生即时拍卖。仿真证明,该方法在多机器人搜索过程中节省资源且各机器人利用均衡。

  12. Emergence of Consensus in a Multi-Robot Network: from Abstract Models to Empirical Validation

    CERN Document Server

    Trianni, Vito; Reina, Andreagiovanni; Baronchelli, Andrea

    2016-01-01

    Consensus dynamics in decentralised multiagent systems are subject to intense studies, and several different models have been proposed and analysed. Among these, the naming game stands out for its simplicity and applicability to a wide range of phenomena and applications, from semiotics to engineering. Despite the wide range of studies available, the implementation of theoretical models in real distributed systems is not always straightforward, as the physical platform imposes several constraints that may have a bearing on the consensus dynamics. In this paper, we investigate the effects of an implementation of the naming game for the kilobot robotic platform, in which we consider concurrent execution of games and physical interferences. Consensus dynamics are analysed in the light of the continuously evolving communication network created by the robots, highlighting how the different regimes crucially depend on the robot density and on their ability to spread widely in the experimental arena. We find that ph...

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

    OpenAIRE

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

  14. 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.

  15. Autonomous multi-robot exploration in communication-limited environments

    NARCIS (Netherlands)

    de Hoog, J.; Cameron, S.; Visser, A.; Belpaeme, T.; Bugmann, G.; Melhuish, C.; Witkowski, M.

    2010-01-01

    Teams of communicating robots are likely to be used for a wide range of applications in the near future, such as robotic search and rescue or robotic exploration of hostile and remote environments. In such scenarios, environments are likely to contain significant interference and multi-robot systems

  16. A Framework for Multi Robot Guidance Control

    Science.gov (United States)

    Keskin, Onur; Uyar, Erol

    In this paper we present a framework for path planning and path finding for multiple mobile robots with global vision. Our framework model considers the agents’ dynamic status and their environment with obstacles to perform given tasks. The global vision system provides feedback to main controller computer and mobile robots are directed towards to their tasks with avoiding obstacles and without any collision. Different kinds of scenario are prepared to simulate manipulating tasks and non-collision behavior with our framework. Experiment results with Lego Mindstorms NXT shows that our framework can be used where a multi robot system is needed with minimum resources.

  17. 湍流环境中多弱感知机器人气味源搜索算法%Odor source search employing multi-robots with limited perception in turbulence environments

    Institute of Scientific and Technical Information of China (English)

    张思齐; 徐德民

    2015-01-01

    An odor source search algorithm employing multi-robots with limited space perception in a turbulence environment is presented. In this algorithm, an approximate expression of the inferred position of the odor source is established, and the moving directions of robots are given by minimization of a free energy separately. The robots are coordinated with sharing their path each other. An internal temperature allows active control on the exploration/exploitation balance during the search. Simulation results show the effectiveness of the proposed method.%针对湍流环境中机器人空间感知能力的不足,提出一种多弱感知机器人气味源搜索算法.该算法建立了气味源位置概率分布的近似表达式,机器人通过自由能最小化获得移动方向.各机器人之间通过共享位置信息实现协同,通过设定内部温度达到搜索过程中探索和利用的平衡.仿真结果验证了所提出算法的有效性.

  18. Multi-Robot Motion Planning Using Swarm Intelligence

    Directory of Open Access Journals (Sweden)

    Gerasimos G. Rigatos

    2008-11-01

    Full Text Available Swarm intelligence theory is proposed for motion planning of multi-robot systems. Multiple particles start from different points in the solutions space and interact to each other while moving towards the goal position. Swarm intelligence theory is a derivative-free approach to the problem of multi-robotcooperation which works by searching iteratively in regions defined by each robot's best previous move and the best previous move of its neighbors. The method's performance is evaluated through simulation tests.

  19. MRPPSim: A Multi-Robot Path Planning Simulation

    Directory of Open Access Journals (Sweden)

    Ebtehal Turki Saho Alotaibi

    2016-08-01

    Full Text Available Multi-robot path planning problem is an interesting problem of research having great potential for several optimization problems in the world. In multi-robot path planning problem domain (MRPP, robots must move from their start locations to their goal locations avoiding collisions with each other. MRPP is a relevant problem in several domains, including; automatic packages inside a warehouse, automated guided vehicles, planetary exploration, robotics mining, and video games. This work introduces MRPPSim; a new modeling, evaluation and simulation tool for multi-robot path planning algorithms and its applications. In doing so, it handles all the aspects related to the multi-robot path planning algorithms. Through its working, MRPPSim unifies the representation for the input. This algorithm provides researchers with a set of evaluation models with each of them serving a set of objectives. It provides a comprehensive method to evaluate and compare the algorithm’s performance to the ones that solve public benchmark problems inas shown in literature. The work presented in this paper also provides a complete tool to reformat and control user input, critical small benchmark, biconnected, random and grid problems. Once all of this is performed, it calculates the common performance measurements of multi-robot path planning algorithms in a unified way. The work presented in this paper animates the results so the researchers can follow their algorithms’ executions. In addition, MRPPSim is designed as set of models, each is dedicated to a specific function, this allows new algorithm, evaluation model, or performance measurements to be easily plugged into the simulator.

  20. 基于场地模型的多机器人动态协作技术%Multi-robot dynamic coordination based on field model

    Institute of Scientific and Technical Information of China (English)

    杜明晓; 陈启军

    2015-01-01

    针对机器人足球比赛中的协作问题,提出了一种多机器人系统协作控制方法。该方法包括时间同步机制、全局模型的建立以及角色的动态分配。该方法首先使用修改后的 TPSN 算法完成时间同步,然后通过机器人间共享信息的融合建立全局模型,最终通过竞标函数进行角色的动态分配,可使得机器人能够高效、稳定的完成比赛,并在实验及比赛中得到验证。%To solve the coordination problem in robot soccer competition,a multi-robot system control approach was presented,including time synchronization,world model building and dynamic role as-signment.This method firstly used an improved TPSN (timing-sync protocol for sensor network)al-gorithm to synchronize time and then built a global world model by using the shared information a-mong the robots.Finally,it implemented the dynamic role assignment with bid functions.The robots could achieve the game efficiently and stably by using this method.The experiments and result of the competitions have proved the effectiveness of the approach.

  1. 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.

  2. 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...

  3. 基于SRV1平台的多机器人搜索研究%Research of multi-robots search based on SRV1 platform

    Institute of Scientific and Technical Information of China (English)

    张静; 刘国涛; 高强; 庞毅

    2011-01-01

    Aiming at dealing with hazardous applications, the SRV1 (Surveyor Open Source Wireless Mobile Robot with Vid-eo) platform was used. According to todays robot research development direction, SRV1 robots will be developed as a basic platform to meet the application demand. Group robots can work together to search for the target , analysis the site condition, collect data and provide the necessary image to on - site PC environment.%针对危险性搜索的应用需求,选用SRV1(Surveyor Open Source Wireless Mobile Robot with Video)开源无线可移动机器人为平台,对其进行二次开发,根据当今机器人研究发展的方向,将其开发成一种可以满足应用需求的平台,多个机器人可以共同搜索目标,采集必要图像数据,提供现场图像信息给上位机环境.

  4. Genetic Algorithm Based Combinatorial Auction Method for Multi-Robot Task Allocation

    Institute of Scientific and Technical Information of China (English)

    GONG Jian-wei; HUANG Wan-ning; XIONG Guang-ming; MAN Yi-ming

    2007-01-01

    An improved genetic algorithm is proposed to solve the problem of bad real-time performance or inability to get a global optimal/better solution when applying single-item auction (SIA) method or combinatorial auction method to multi-robot task allocation.The genetic algorithm based combinatorial auction (GACA) method which combines the basic-genetic algorithm with a new concept of ringed chromosome is used to solve the winner determination problem (WDP) of combinatorial auction.The simulation experiments are conducted in OpenSim, a multi-robot simulator.The results show that GACA can get a satisfying solution in a reasonable shot time, and compared with SIA or parthenogenesis algorithm combinatorial auction (PGACA) method, it is the simplest and has higher search efficiency, also, GACA can get a global better/optimal solution and satisfy the high real-time requirement of multi-robot task allocation.

  5. A Biologically Inspired Cooperative Multi-Robot Control Architecture

    Science.gov (United States)

    Howsman, Tom; Craft, Mike; ONeil, Daniel; Howell, Joe T. (Technical Monitor)

    2002-01-01

    A prototype cooperative multi-robot control architecture suitable for the eventual construction of large space structures has been developed. In nature, there are numerous examples of complex architectures constructed by relatively simple insects, such as termites and wasps, which cooperatively assemble their nests. The prototype control architecture emulates this biological model. Actions of each of the autonomous robotic construction agents are only indirectly coordinated, thus mimicking the distributed construction processes of various social insects. The robotic construction agents perform their primary duties stigmergically i.e., without direct inter-agent communication and without a preprogrammed global blueprint of the final design. Communication and coordination between individual agents occurs indirectly through the sensed modifications that each agent makes to the structure. The global stigmergic building algorithm prototyped during the initial research assumes that the robotic builders only perceive the current state of the structure under construction. Simulation studies have established that an idealized form of the proposed architecture was indeed capable of producing representative large space structures with autonomous robots. This paper will explore the construction simulations in order to illustrate the multi-robot control architecture.

  6. 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

  7. 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 team

  8. 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......-modal hybrid automata. The notion of bisimulations is used to abstract robots in the network. The result is a network of interacting timed automata which allows coordination among the robots and timing constraints to be considered. The model checker UPPAAL is used for formal symbolic model checking against...

  9. Cognitive Coordination for Cooperative Multi-Robot Teamwork

    OpenAIRE

    C. Wei

    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 teams. Social deliberation should be taken into consideration in such a multi-robot system, which requires that the robots are capable of generating long term plans to achieve a global or team goal, ra...

  10. Multi-Robot Systems for Subsurface Planetary Exploration Project

    Data.gov (United States)

    National Aeronautics and Space Administration — The proposed innovation is a heterogeneous multi-robot team developed as a platform for effective subsurface planetary exploration. State-of-art robotic exploration...

  11. Multi-robot system learning based on evolutionary classification

    Directory of Open Access Journals (Sweden)

    Manko Sergey

    2016-01-01

    Full Text Available This paper presents a novel machine learning method for agents of a multi-robot system. The learning process is based on knowledge discovery through continual analysis of robot sensory information. We demonstrate that classification trees and evolutionary forests may be a basis for creation of autonomous robots capable both of learning and knowledge exchange with other agents in multi-robot system. The results of experimental studies confirm the effectiveness of the proposed approach.

  12. An object oriented multi-robotic graphic simulation environment for programming the welding tasks

    Institute of Scientific and Technical Information of China (English)

    崔泽; 赵杰; 崔岩; 蔡鹤皋

    2002-01-01

    An object-oriented multi-robotic graphic simulation environment is described in this paper. Object-oriented programming is used to model the physical objects of the robotic workcell in the form of software objects or classes. The virtual objects are defined to provide the user with a user-friendly interface including realistic graphic simulation and clarify the software architecture. The programming method of associating the task object with active object effectively increases the software reusability, maintainability and modifiability. Task level programming is also demonstrated through a multi-robot welding task that allows the user to concentrate on the most important aspects of the tasks. The multi-thread programming technique is used to simulate the interaction of multiple tasks. Finally, a virtual test is carried out in the graphic simulation environment to observe design and program errors and fix them before downloading the software to the real workcell.

  13. Multi-Robot Dynamic Task Allocation Using Modified Ant Colony System

    Science.gov (United States)

    Xu, Zhenzhen; Xia, Feng; Zhang, Xianchao

    This paper presents a dynamic task allocation algorithm for multiple robots to visit multiple targets. This algorithm is specifically designed for the environment where robots have dissimilar starting and ending locations. And the constraint of balancing the number of targets visited by each robot is considered. More importantly, this paper takes into account the dynamicity of multi-robot system and the obstacles in the environment. This problem is modeled as a constrained MTSP which can not be transformed to TSP and can not be solved by classical Ant Colony System (ACS). The Modified Ant Colony System (MACS) is presented to solve this problem and the unvisited targets are allocated to appropriate robots dynamically. The simulation results show that the output of the proposed algorithm can satisfy the constraints and dynamicity for the problem of multi-robot task allocation.

  14. Multi-Robot Coalitions Formation with Deadlines: Complexity Analysis and Solutions.

    Science.gov (United States)

    Guerrero, Jose; Oliver, Gabriel; Valero, Oscar

    2017-01-01

    Multi-robot task allocation is one of the main problems to address in order to design a multi-robot system, very especially when robots form coalitions that must carry out tasks before a deadline. A lot of factors affect the performance of these systems and among them, this paper is focused on the physical interference effect, produced when two or more robots want to access the same point simultaneously. To our best knowledge, this paper presents the first formal description of multi-robot task allocation that includes a model of interference. Thanks to this description, the complexity of the allocation problem is analyzed. Moreover, the main contribution of this paper is to provide the conditions under which the optimal solution of the aforementioned allocation problem can be obtained solving an integer linear problem. The optimal results are compared to previous allocation algorithms already proposed by the first two authors of this paper and with a new method proposed in this paper. The results obtained show how the new task allocation algorithms reach up more than an 80% of the median of the optimal solution, outperforming previous auction algorithms with a huge reduction of the execution time.

  15. Scalable Automated Model Search

    Science.gov (United States)

    2014-05-20

    of processing. 6. FUTURE WORK We note that these optimizations are just the tip of the iceberg in solving this problem faster. Advanced model ...Scalable Automated Model Search Evan Sparks Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No...2014 to 00-00-2014 4. TITLE AND SUBTITLE Scalable Automated Model Search 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR

  16. Graph rigidity and localization of multi-robot formations

    Institute of Scientific and Technical Information of China (English)

    张帆

    2004-01-01

    This paper provides theoretical foundation tor the problem ot localization in multi-robot formations. Sufficient and necessary conditions for completely localizing a formation of mobile robots/vehicles in SE(2) based on distributed sensor networks and graph rigidity are proposed. A method for estimating the quality of localizations via a linearized weighted least-squares algorithm is presented, which considers incomplete and noisy sensory information. The approach in this paper had been implemented in a multi-robot system of five car-like robots equipped with omni-directional cameras and IEEE 802.11b wireless network.

  17. Graph rigidity and localization of multi-robot formations

    Institute of Scientific and Technical Information of China (English)

    张帆

    2004-01-01

    This paper provides theoretical foundation for the problem of localization in multi-robot formations. Sufficient and necessary conditions for completely localizing a formation of mobile robots/vehicles in SE(2) based on distributed sensor networks and graph rigidity are proposed. A method for estimating the quality of localizations via a linearized weighted least-squares algorithm is presented, which considers incomplete and noisy sensory information. The approach in this paper had been implemented in a multi-robot system of five car-like robots equipped with omni-directional cameras and IEEE 802.11b wireless network.

  18. Internet based design of distributed virtual environment for multi-robot teleoperation

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Studies the design of distributed virtual environments (DVEs) for tele-multi-robotics. The proposed design, incorporating two models (distribution-supported model and VE-supported model), attempts to represent common functionality, communication issues, and requirements found in multi-operator DVEs. The distribution-supported model concentrates on the introduction of computer-supported collaborative work (CSCW) to realize the coordination of multi-operators, while the VE-supported model concentrates on the utilization of an object-oriented approach to strengthen the expandability and robustness of the system. Finally, the configuration and running environments of the system are given.

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

    Science.gov (United States)

    2015-11-01

    uncertain environment. Verification of robot software is related to general purpose software verification in its objective of taking a program as...input and automatically determining whether that program achieves a desired objective or not [1]. It differs in that a robot program continually...Probabilistic Verification of Multi -Robot Missions in Uncertain Environments Damian M. Lyons*, Ronald C. Arkin‡, Shu Jiang‡, Dagan Harrington

  20. A Gradient Optimization Approach to Adaptive Multi-Robot Control

    Science.gov (United States)

    2009-09-01

    and Machine Intelligence, 25(10):1355-1360, 2003. [51] C. S. Kong, N. A. Peng, and I. Rekleitis . Distributed coverage with multi- robot system. In...2005. [82] I. Rekleitis , G. Dudek, and E. Milios. Mulit-robot collaboration for robust exploration. Annals of Mathematics and Artificial Intelligence

  1. DECENTRALIZED MULTI-ROBOT PLANNING TO EXPLORE AND PERCEIVE

    Directory of Open Access Journals (Sweden)

    Laetitia Matignon

    2015-06-01

    Full Text Available In a recent French robotic contest, the objective was to develop a multi-robot system able to autonomously map and explore an unknown area while also detecting and localizing objects. As a participant in this challenge, we proposed a new decentralized Markov decision process (Dec-MDP resolution based on distributed value functions (DVF to compute multi-robot exploration strategies. The idea is to take advantage of sparse interactions by allowing each robot to calculate locally a strategy that maximizes the explored space while minimizing robots interactions. In this paper, we propose an adaptation of this method to improve also object recognition by integrating into the DVF the interest in covering explored areas with photos. The robots will then act to maximize the explored space and the photo coverage, ensuring better perception and object recognition.

  2. Guaranteeing Spoof-Resilient Multi-Robot Networks

    Science.gov (United States)

    2016-02-12

    Effective coordination, however, requires trust. In order for these multi- robot systems to perform their tasks optimally, transmitted data is often assumed...of anten- nas. SAR can be implemented using a well-studied signal processing algorithm called MUSIC [16] to obtain spatial fingerprints at each...empirical results in Sec. §9 demonstrate that α performs well when applied both in continuous and discrete settings. However, it is natural to ask

  3. 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...

  4. 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.

  5. Theory and Application of Multi-robot Service-oriented Architecture

    Institute of Scientific and Technical Information of China (English)

    Yunfei Cai; Zhenmin Tang; Yuhua Ding; Bin Qian

    2016-01-01

    In order to solve the problem of heterogeneity in multi-robot cooperation, a new service-oriented architecture is proposed for multi-robot cooperation. Service provision and energy consumption are the basic cooperative behaviors. A set of basic concepts of robot service are proposed. A layered multi-robot service-oriented architecture is designed. Finally, the experiments illustrate the superiority of the proposed architecture which makes robot’s underlying functional components be transparently encapsulated and the services in upper layer be transparently invoked, which will effectively avoid the impact of heterogeneous characteristics in multi-robot cooperation and facilitate the system construction, expansion, restructuring and maintenance.

  6. Simultaneous Task Subdivision and Allocation using Negotiations in Multi-Robot Systems

    Directory of Open Access Journals (Sweden)

    Claudio Rossi

    2015-03-01

    Full Text Available This paper presents a negotiations based approach for simultaneous task subdivision and assignment in hetero-geneous multi-robot systems. We first propose an abstraction of the concept of a task that allows for the generalizing of a variety of different problems. Based on such an abstraction, we have developed a negotiation protocol based on Rubinstein’s alternate offers protocol. This is extended to the multi-dimensional space and employs a heuristic search step for evaluating and generating offers. Furthermore, the issue of how to extend a bilateral negotiations protocol to more than two parties is taken into consideration. The protocol was first tested in numerical simulations with different scenarios and then applied to three real world missions.

  7. Multi-robot task allocation for exploration

    Institute of Scientific and Technical Information of China (English)

    GAO Ping-an; CAI Zi-xing

    2006-01-01

    The problem of allocating a number of exploration tasks to a team of mobile robots in dynamic environments was studied. The team mission is to visit several distributed targets. The path cost of target is proportional to the distance that a robot has to move to visit the target. The team objective is to minimize the average path cost of target over all targets. Finding an optimal allocation is strongly NP-hard. The proposed algorithm can produce a near-optimal solution to it. The allocation can be cast in terms of a multi-round single-item auction by which robots bid on targets. In each auction round, one target is assigned to a robot that produces the lowest path cost of the target. The allocated targets form a forest where each tree corresponds a robot's exploring targets set. Each robot constructs an exploring path through depth-first search in its target tree. The time complexity of the proposed algorithm is polynomial. Simulation experiments show that the allocating method is valid.

  8. Safety architecture of internet based multi-robot teleoperation system

    Institute of Scientific and Technical Information of China (English)

    ZHAO Jie; GAO Yong-sheng; CAI He-gao

    2005-01-01

    Safety subsystem is one of the important parts in robot teleoperation system. In this paper, a safety architecture of safety subsystem in Internet based multi-operator-multi-robot (MOMR) teleoperation system is presented. The subsystem is divided into three layers in its logic architecture: interactive monitor layer, collaborative control layer and real-time control layer. The safety problems and the related strategy are clarified by detailed analysis of each layer and relationship among the layers. So we can obtain a high performance MOMR teleoperation system with multi-layer safety architecture.

  9. 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.

  10. Flexible Morphogenesis based Formation Control for Multi-Robot Systems

    Directory of Open Access Journals (Sweden)

    Jan Carlo Barca

    2012-09-01

    Full Text Available Inspired by how biological cells communicate with each other at a cell-to-cell level; morphogenesis emerged to be an effective way for local communication between homogenous robots in multi-robot systems. In this paper, we present the first steps towards a scalable morphogenesis style formation control technique, which address the drawbacks associated with current morphogenesis type formation control techniques, including their inability to distribute robots evenly across target shapes. A series of experiments, which demonstrate that the proposed technique enables groups of non-holonomic ground moving robots to generate formations in less than 9 seconds with three robots and less than 22 seconds with five robots, is also presented. These experiments furthermore reveal that the proposed technique enables groups of robots to generate formations without significantly increasing the total travel distance when faced with obstacles. This work is an important contribution to multi-robot control theory as history has shown that the success of groups often depends on efficient and robust formation control.

  11. 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.

  12. 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.

  13. A Search Model of Discouragement

    DEFF Research Database (Denmark)

    Rosholm, Michael; Toomet, Ott

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

  14. 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.

  15. Adaptive genetic algorithm for path planning of loosely coordinated multi-robot manipulators

    Institute of Scientific and Technical Information of China (English)

    高胜; 赵杰; 蔡鹤皋

    2003-01-01

    Adaptive genetic algorithm ASAGA, a novel algorithm, which can dynamically modify the parameters of Genetic Algorithms in terms of simulated annealing mechanism, is proposed for path planning of loosely coordinated multi-robot manipulators. Over the task space of a multi-robot, a strategy of decoupled planning is also applied to the evolutionary process, which enables a multi-robot to avoid falling into deadlock and calculating of composite C-space. Finally, two representative tests are given to validate ASA GA and the strategy of decoupled planning.

  16. 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

  17. 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.

  18. Theory and Application of Multi-robot Service-oriented Architecture

    Institute of Scientific and Technical Information of China (English)

    Yunfei Cai; Zhenmin Tang; Yuhua Ding; Bin Qian

    2016-01-01

    In order to solve the problem of heterogeneity in multi-robot cooperation,a new service-oriented architecture is proposed for multi-robot cooperation.Service provision and energy consumption are the basic cooperative behaviors.A set of basic concepts of robot service are proposed.A layered multi-robot service-oriented architecture is designed.Finally,the experiments illustrate the superiority of the proposed architecture which makes robot's underlying functional components be transparently encapsulated and the services in upper layer be transparently invoked,which will effectively avoid the impact of heterogeneous characteristics in multi-robot cooperation and facilitate the system construction,expansion,restructuring and maintenance.

  19. 基于生物刺激神经网络的多机器人编队方法%Multi-robot formation based on biological inspired neural network

    Institute of Scientific and Technical Information of China (English)

    仰晓芳; 倪建军

    2013-01-01

    Multi-robot formation control is an important issue in the multi-robot cooperation field. It is a hot and difficult problem to achieve multi-robot dynamic formation while making them move toward the same target. Concerning this problem, a new biological inspired neural network based approach for multi-robot formation was proposed in this paper. In the proposed approach, a leader-referenced formation model was used to calculate the virtual target location for each robot in real-time, and a biological neural network was used to realize multi-robot navigation. Finally, some simulation experiments were carried out. The experimental results show that the proposed approach has some good performances, such as the real-time obstacle avoidance, keeping formation and moving toward the same target. Furthermore, multi-robots can change the formation quickly, which proves the real-time and intelligence of the proposed approach.%多机器人编队控制是多机器人协作领域的重要研究内容之一,如何实现多机器人朝同一目标移动的同时保持队形是多机器人编队的一个热点和难点问题.针对这一问题,提出一种新的基于生物刺激神经网络的多机器人动态编队方法,采用基于leader-referenced编队模型实时计算各机器人的虚拟目标位置,利用生物刺激神经网络进行机器人导航.最后进行仿真实验,实验结果表明该方法在实现多机器人实时避障并保持队形的同时,朝同一目标移动,而且可以很快实现队形变换,具有较好的实时性和灵活性.

  20. Multi-robot coverage to locate fixed targets using formation structures

    CERN Document Server

    Rogge, Jonathan

    2012-01-01

    This paper develops an algorithm that guides a multi-robot system in an unknown environment in search of fixed targets. The area to be scanned contains an unknown number of convex obstacles of unknown size and shape. The algorithm covers the entire free space in a sweeping fashion and as such relies on the use of robot formations. The geometry of the robot group is a lateral line formation, which is allowed to split and rejoin when passing obstacles. It is our main goal to exploit this formation structure in order to reduce robot resources to a minimum. Each robot has a limited and finite amount of memory available. No information of the topography is recorded. Communication between two robots is only possible up to a maximum inter-robot distance, and if the line-of-sight between both robots is not obstructed. Broadcasting capabilities and indirect communication are not allowed. Supervisory control is prohibited. The number of robots equipped with GPS is kept as small as possible. Applications of the algorith...

  1. Conceptual Models for Search Engines

    Science.gov (United States)

    Hendry, D. G.; Efthimiadis, E. N.

    Search engines have entered popular culture. They touch people in diverse private and public settings and thus heighten the importance of such important social matters as information privacy and control, censorship, and equitable access. To fully benefit from search engines and to participate in debate about their merits, people necessarily appeal to their understandings for how they function. In this chapter we examine the conceptual understandings that people have of search engines by performing a content analysis on the sketches that 200 undergraduate and graduate students drew when asked to draw a sketch of how a search engine works. Analysis of the sketches reveals a diverse range of conceptual approaches, metaphors, representations, and misconceptions. On the whole, the conceptual models articulated by these students are simplistic. However, students with higher levels of academic achievement sketched more complete models. This research calls attention to the importance of improving students' technical knowledge of how search engines work so they can be better equipped to develop and advocate policies for how search engines should be embedded in, and restricted from, various private and public information settings.

  2. 基于蚁群算法的多机器人环境探索%Environment exploration of multi-robots based on ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    蔡标; 戴学丰; 姜来浩

    2014-01-01

    To aim at the environment exploration of multi-robots,the ant algorithm is put forward to solve the target distribution and area coverage of multi-robots.According to the comparison of coverage percentage between the ant algorithm and the waiting auction algorithm in two different models,it illustrates that ant algorithm runs fewer steps in the same coverage.%针对多机器人的环境探索问题,采用了蚁群算法,解决了多机器人的目标分配与环境区域覆盖。通过对蚁群算法和等待拍卖算法在两种不同环境模型的覆盖率的比较,表明了蚁群算法在相同覆盖率的情况下运行次数较少。

  3. Collision avoidance planning in multi-robot system based on improved artificial potential field and rules

    Institute of Scientific and Technical Information of China (English)

    YUAN Xin; ZHU Qi-dan; YAN Yong-jie

    2009-01-01

    For real-time and distributed features of multi-robot system, the strategy of combining the improved artificial potential field method and the mles based on priority is proposed to study the collision avoidance planning in multi-robot systems. The improved artificial potential field based on simulated annealing algorithm satisfactorily overcomes the drawbacks of traditional artificial potential field method, so that robots can find a local collision-free path in the complex environment. According to the movement vector trail of robots, collisions between robots can be detected, thereby the collision avoidance rules can be obtained. Coordination between robots by the priority based rules improves the real-time property of multi-robot system. The combination of these two methods can help a robot to find a collision-free path from a starting point to the goal quickly in an environment with many obstacles. The feasibility of the proposed method is validated in the VC-basod simulated environment.

  4. Online Mapping and Perception Algorithms for Multi-robot Teams Operating in Urban Environments

    Science.gov (United States)

    2015-01-01

    best suited for near -term predictions. For use in a multi-robot exploration system , the performance around 0-6 seconds in the future is of most...and A. Voldsund, “A study of the noise-level in two infrared marker-based motion capture systems ,” pp. 258–263, 2012. [64] M. Li, “Camera calibration of... LIDAR and camera sensors. Multi-robot teams are ideal for deployment in large, real-world environments due to their ability to parallelize exploration

  5. Multi-Robot Path-Planning Problem for a Heavy Traffic Control Application: A Survey

    Directory of Open Access Journals (Sweden)

    Ebtehal Turki Saho Alotaibi

    2016-06-01

    Full Text Available This survey looked at the methods used to solve multi-autonomous vehicle path-planning for an application of heavy traffic control in cities. Formally, the problem consisted of a graph and a set of robots. Each robot has to reach its destination in the minimum time and number of movements, considering the obstacles and other robots’ paths, hence, the problem is NP-hard. The study found that decoupled centralised approaches are the most relevant approaches for an autonomous vehicle path-planning problem for three reasons: (1 a city is a large environment and coupled centralised approaches scale weakly, (2 the overhead of a coupled decentralised approach to achieve the global optimal will affect the time and memory of the other robots, which is not important in a city configuration and (3 the coupled approaches suppose that the number of robots is defined before they start to find the paths and resolve collisions, while in a city, any car can start at any time and hence, each car should work individually and resolve collisions as they arise. In addition, the study reviewed four decoupled centralised techniques to solve the problem: multi-robot path-planning rapidly exploring random tree (MRRRT, push and swap (PAS, push and rotate (PAR and the Bibox algorithm. The experiments showed that MRRRT is the best for exploring any search space and optimizing the solution. On the other hand, PAS, PAR and Bibox are better in terms of providing a complete solution for the problem and resolving collisions in significantly much less time, the analysis, however, shows that a wider class of solvable instances are excluded from PAS and PAR domain. In addition, Bibox solves a smaller class than the class solved by PAS and PAR in less time, in the worst case, and with a shorter path than PAS and PAR.

  6. Vision-Based Cooperative Pose Estimation for Localization in Multi-Robot Systems Equipped with RGB-D Cameras

    Directory of Open Access Journals (Sweden)

    Xiaoqin Wang

    2014-12-01

    Full Text Available We present a new vision based cooperative pose estimation scheme for systems of mobile robots equipped with RGB-D cameras. We first model a multi-robot system as an edge-weighted graph. Then, based on this model, and by using the real-time color and depth data, the robots with shared field-of-views estimate their relative poses in pairwise. The system does not need the existence of a single common view shared by all robots, and it works in 3D scenes without any specific calibration pattern or landmark. The proposed scheme distributes working loads evenly in the system, hence it is scalable and the computing power of the participating robots is efficiently used. The performance and robustness were analyzed both on synthetic and experimental data in different environments over a range of system configurations with varying number of robots and poses.

  7. Multi-robot terrain coverage and task allocation for autonomous detection of landmines

    Science.gov (United States)

    Dasgupta, Prithviraj; Muñoz-Meléndez, Angélica; Guruprasad, K. R.

    2012-06-01

    Multi-robot systems comprising of heterogeneous autonomous vehicles on land, air, water are being increasingly used to assist or replace humans in different hazardous missions. Two crucial aspects in such multi-robot systems are to: a) explore an initially unknown region of interest to discover tasks, and, b) allocate and share the discovered tasks between the robots in a coordinated manner using a multi-robot task allocation (MRTA) algorithm. In this paper, we describe results from our research on multi-robot terrain coverage and MRTA algorithms within an autonomous landmine detection scenario, done as part of the COMRADES project. Each robot is equipped with a different type of landmine detection sensor and different sensors, even of the same type, can have different degrees of accuracy. The landmine detection-related operations performed by each robot are abstracted as tasks and multiple robots are required to complete a single task. First, we describe a distributed and robust terrain coverage algorithm that employs Voronoi partitions to divide the area of interest among the robots and then uses a single-robot coverage algorithm to explore each partition for potential landmines. Then, we describe MRTA algorithms that use the location information of discovered potential landmines and employ either a greedy strategy, or, an opportunistic strategy to allocate tasks among the robots while attempting to minimize the time (energy) expended by the robots to perform the tasks. We report experimental results of our algorithms using accurately-simulated Corobot robots within the Webots simulator performing a multi-robot, landmine detection operation.

  8. A neural click model for web search

    NARCIS (Netherlands)

    Borisov, A.; Markov, I.; de Rijke, M.; Serdyukov, P.

    2016-01-01

    Understanding user browsing behavior in web search is key to improving web search effectiveness. Many click models have been proposed to explain or predict user clicks on search engine results. They are based on the probabilistic graphical model (PGM) framework, in which user behavior is represented

  9. 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.

  10. A Search Model for Imperfectly Detected Targets

    Science.gov (United States)

    Ahumada, Albert

    2012-01-01

    Under the assumptions that 1) the search region can be divided up into N non-overlapping sub-regions that are searched sequentially, 2) the probability of detection is unity if a sub-region is selected, and 3) no information is available to guide the search, there are two extreme case models. The search can be done perfectly, leading to a uniform distribution over the number of searches required, or the search can be done with no memory, leading to a geometric distribution for the number of searches required with a success probability of 1/N. If the probability of detection P is less than unity, but the search is done otherwise perfectly, the searcher will have to search the N regions repeatedly until detection occurs. The number of searches is thus the sum two random variables. One is N times the number of full searches (a geometric distribution with success probability P) and the other is the uniform distribution over the integers 1 to N. The first three moments of this distribution were computed, giving the mean, standard deviation, and the kurtosis of the distribution as a function of the two parameters. The model was fit to the data presented last year (Ahumada, Billington, & Kaiwi, 2 required to find a single pixel target on a simulated horizon. The model gave a good fit to the three moments for all three observers.

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

    Science.gov (United States)

    2015-09-01

    robot that wades through a flooded disaster site to extinguish a critical fire, we believe a heterogeneous, multi-robot team that can quickly navigate...prior maps of the environment, a classical formulation would suffice. Initially it could be as a well-studied Vehicle Routing Problem (VRP): with known...GTSAM software library developed at Georgia Tech.25 Our technique leverages the Generalized Iterative Closet Point (ICP) algorithm26 for dense inter

  12. Democratic Inspired Particle Swarm Optimization for Multi-Robot Exploration Task

    OpenAIRE

    Moslah, Oussama; Hachaïchi, Yassine; Lahbib, Younes

    2016-01-01

    In this paper, we propose a new method for exploring an unknown environment with a team of homogeneous mobile robots. The goal of our approach is to minimize the exploration time. The challenge in multi-robot exploration is how to develop distributed algorithm to govern the colony of robots while choosing its new direction so that they simultaneously explore different regions. In this paper we use the extended version of Particle Swarm Optimization (PSO) to robotic applications, which is refe...

  13. Internet Based General Computer Simulation Platform for Distributed Multi-Robotic System

    Institute of Scientific and Technical Information of China (English)

    迟艳玲; 张斌; 王硕; 谭民

    2002-01-01

    A general computer simulation platform is designed for the purpose of catrrying out experiments on the Distributed Multi-Robotic System. The simulation platform is based on Internet and possesses generality, validity, real-time display and function of supporting algorithm developing. In addition, the platform is equipped wit recording and replay module, and simulation experiment can be reviewed at anytime.By now; a few algorithms have been developed on the Simulation Platform designed.

  14. 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.

  15. 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.

  16. 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

  17. 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.

  18. 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-01-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. PMID:27376297

  19. 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...

  20. 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 mo...... returned by the last query...

  1. Model-based Tomographic Reconstruction Literature Search

    Energy Technology Data Exchange (ETDEWEB)

    Chambers, D H; Lehman, S K

    2005-11-30

    In the process of preparing a proposal for internal research funding, a literature search was conducted on the subject of model-based tomographic reconstruction (MBTR). The purpose of the search was to ensure that the proposed research would not replicate any previous work. We found that the overwhelming majority of work on MBTR which used parameterized models of the object was theoretical in nature. Only three researchers had applied the technique to actual data. In this note, we summarize the findings of the literature search.

  2. 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...

  3. 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.

  4. 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.

  5. Intelligent learning technique based-on fuzzy logic for multi-robot path planning

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Soccer robot system is a tremendously challenging intelligent system developed to mimic human soc cer competition based on the multi-discipline research: robotics, intelligent control, computer vision, etc. robot path planning strategy is a very important subject concerning to the performance and intelligence degree of the multi-robot system. Therefore, this paper studies the path planning strategy of soccer system by using fuzzy log ic. After setting up two fuzziers and two sorts of fuzzy rules for soccer system, fuzzy logic is applied to work space partition and path revision. The experiment results show that this technique can well enhance the perform ance and intelligence degree of the system.

  6. Self-organizing method for collaboration in multi-robot system on basis of balance principle

    Institute of Scientific and Technical Information of China (English)

    Yangbin DONA; Jinping JIANG; Yan HE

    2008-01-01

    By analyzing the operation characteristics of two subtasks that have resource dependency on each other, this paper demonstrates the impact of progress relation between the two subtasks on the whole task's progress, and then puts forward a self-organizing prin-ciple called balance principle that keeps the individual profit between robots equal. Furthermore, an algorithm is designed for adjusting subtask selection on the basis of this principle. Simulation shows the validity of the algorithm on self-organizing task allocation in a multi-robot system.

  7. Collaborative task planning for an internet based multi-operator multi-robot system

    Institute of Scientific and Technical Information of China (English)

    GAO Sheng; ZHAO Jie; CAI He-gao

    2005-01-01

    In an Internet based multi-operator and multi-robot system (IMOMR), operators have to work collaboratively to overcome the constraints of space and time. Inherently, the activities among them can be defined as a computer-supported cooperative work (CSCW). As a practical application of CSCW, a collaborative task planning system (CTPS) for IMOMR is proposed in this paper on the basis of Petri nets. Its definition, components design, and concrete implementation are given in detail, respectively. As a result, a clear collaboration mechanism of multiple operators in an IMOMR is obtained to guarantee their task planning.

  8. 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.

  9. A reinforcement learning trained fuzzy neural network controller for maintaining wireless communication connections in multi-robot systems

    Science.gov (United States)

    Zhong, Xu; Zhou, Yu

    2014-05-01

    This paper presents a decentralized multi-robot motion control strategy to facilitate a multi-robot system, comprised of collaborative mobile robots coordinated through wireless communications, to form and maintain desired wireless communication coverage in a realistic environment with unstable wireless signaling condition. A fuzzy neural network controller is proposed for each robot to maintain the wireless link quality with its neighbors. The controller is trained through reinforcement learning to establish the relationship between the wireless link quality and robot motion decision, via consecutive interactions between the controller and environment. The tuned fuzzy neural network controller is applied to a multi-robot deployment process to form and maintain desired wireless communication coverage. The effectiveness of the proposed control scheme is verified through simulations under different wireless signal propagation conditions.

  10. 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...... against specification requirements formulated in computational tree logic (CTL). In this way, all feasible trajectories that satisfy specifications and which moves the robots from a set of initial positions to a set of desired goal positions may be algorithmically analyzed. The trajectories can...... 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....

  11. 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...... against specification requirements formulated in computational tree logic (CTL). In this way, all feasible trajectories that satisfy specifications and which moves the robots from a set of initial positions to a set of desired goal positions may be algorithmically analyzed. The trajectories can...... 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....

  12. 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.

  13. 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.

  14. 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.

  15. 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.

  16. 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.

  17. 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.

  18. An Empirical Model of Employed Search, Unemployed Search, and Nonsearch.

    Science.gov (United States)

    Kahn, Lawrence M.; Low, Stuart A.

    1984-01-01

    The 1969-1971 National Longitudinal Surveys data on young men were used to study the employed worker's choice among employed search, unemployed search, and not searching for a new job. The principal results are that current wages, seniority, collective bargaining coverage, employment outside construction, and employment by government are each…

  19. Path Planning for Multi-robot Rescue System under Coal Mine%矿井中多机器人搜救系统路径规划

    Institute of Scientific and Technical Information of China (English)

    金纯; 王升刚; 尹远阳

    2014-01-01

    矿难发生后,井下通信设施可能已有一定的损害、无法正常使用,因而无法知道被困人员的确切位置并且井下环境复杂危险,可能对营救人员造成伤害发生二次事故。为了快速地搜索到被困人员,结合井下无线传播环境的特点,提出井下多机器人组网搜救系统,其中包括机器人自由空间环境模型的创建、机器人搜索的局部和全局路径的规划。利用MAKLINK图论理论对井下环境进行建模,并且采用Dijkstra算法规划出避障初始路径,最后依据距离改进蚁群算法节点选择得出优化的最终路径,完成搜索路径的规划。MATLAB仿真结果表明,优化的路径总长度明显优于初始路径并且改进的蚁群算法有着较好的收敛速度,可以满足多机器人搜救系统的要求。%Because communication facilities from underground are damaged and may not work normally after mine disaster,accu-rate position about trapped workers cannot be known.The dangerous environment may cause second accident and hurt rescue workers. To find out trapped workers quickly,the multi-robot rescue system was proposed combined with the characteristics of under coal mine wireless environment,including creation of a free space model for robot,global and local path plan for multi-robot rescue system.The MAKLINK graph theory was used to establish the free space model of the mobile robot,and then Dijkstra algorithm was utilized to find a sub-optimal collision-free path.Lastly,the improved algorithm based on distance to optimize the location of sub-optimal path was a-dopted to generate the optimal path of the mobile robot.The result of MATLAB simulation experiment shows that the proposed algorithm has a better performance in convergence speed and matches to the multi-robot rescue system.

  20. A Case Study of Collaboration with Multi-Robots and Its Effect on Children's Interaction

    Science.gov (United States)

    Hwang, Wu-Yuin; Wu, Sheng-Yi

    2014-01-01

    Learning how to carry out collaborative tasks is critical to the development of a student's capacity for social interaction. In this study, a multi-robot system was designed for students. In three different scenarios, students controlled robots in order to move dice; we then examined their collaborative strategies and their behavioral…

  1. JL-2: A Mobile Multi-robot System with Docking and Manipulating Capabilities

    Directory of Open Access Journals (Sweden)

    Wei Wang

    2010-02-01

    Full Text Available This paper presents a new version of the JL series reconfigurable multi-robot system called JL-2. By virtue of the docking manipulator composed of a parallel mechanism and a cam gripper, every mobile robot in the JL-2 system is able to not only perform tasks in parallel, e.g. moving and grasping, but also dock with each other even if there are large misalignments between two robots. A motorized spherical joint is formed between two docked robots to enhance the locomotion capability of JL-2. To fulfill the demands of reconfiguration, a distributed control system and sonar based docking guidance system are designed for the JL-2 prototype. Based on the above design, the JL-2 prototype has been built and successfully demonstrated to confirm the validity and functionality of the proposed capabilities.

  2. The Evolution of Cooperative Behaviours in Physically Heterogeneous Multi-Robot Systems

    Directory of Open Access Journals (Sweden)

    Jianhua Yang

    2012-12-01

    Full Text Available Evolutionary Robotics (ER is a methodology that uses evolutionary computation to develop controllers for autonomous robots. The existing works focus on single robot systems or physically homogenous multi-robot teams, although physical heterogeneousness is more prevalent in the real world. It is therefore instructive to examine whether cooperative behaviours can be synthesized using artificial evolution for a team of physically heterogeneous robots. This paper makes an important contribution in answering the question of whether robots with distinct capabilities can synthesize their control strategies to accommodate their own capabilities without human intervention. We present an empirical analysis of the collaboration mechanisms and suggest guidelines about how to choose appropriate evolution methods. Simulated experiments with a team of e-puck robots show that evolution can lead to effective controllers for robots with distinct capabilities.

  3. A People-Localization Method for Multi-Robot Systems First Approach for Guiding-Tours

    Directory of Open Access Journals (Sweden)

    Edgar Martinez-Garcia

    2008-11-01

    Full Text Available Throughout this article we present a methodology to localize multiple people in a group by a multi-robot system (MRS. The aim of the MRS is to conduct people through hallways in indoors as a guided-tour service task. However, further than guidance process, we detail a method for humans' localization by sharing distributed sensor data arising from the team of robots instrumented with stereo vision. The robustness of the method is presented, and by matching the real environment against the computed results, error in human localization is showed as well. As a first approach of the entire MRS goal, this paper explains from a task approach the way for environment ranging, spatial noise filtering, distributed sensor data fusion and clustering based segmentation. Likewise, through the paper experimental results are shown to verify the feasibility of the method.

  4. 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.

  5. JL-2: A Mobile Multi-robot System with Docking and Manipulating Capabilities

    Directory of Open Access Journals (Sweden)

    Wei Wang

    2010-03-01

    Full Text Available This paper presents a new version of the JL series reconfigurable multi-robot system called JL-2. By virtue of the docking manipulator composed of a parallel mechanism and a cam gripper, every mobile robot in the JL-2 system is able to not only perform tasks in parallel, e.g. moving and grasping, but also dock with each other even if there are large misalignments between two robots. A motorized spherical joint is formed between two docked robots to enhance the locomotion capability of JL-2. To fulfill the demands of reconfiguration, a distributed control system and sonar based docking guidance system are designed for the JL-2 prototype. Based on the above design, the JL-2 prototype has been built and successfully demonstrated to confirm the validity and functionality of the proposed capabilities.

  6. SHP: Smooth Hypocycloidal Paths with Collision-Free and Decoupled Multi-Robot Path Planning

    Directory of Open Access Journals (Sweden)

    Abhijeet Ravankar

    2016-06-01

    Full Text Available Generating smooth and continuous paths for robots with collision avoidance, which avoid sharp turns, is an important problem in the context of autonomous robot navigation. This paper presents novel smooth hypocycloidal paths (SHP for robot motion. It is integrated with collision-free and decoupled multi-robot path planning. An SHP diffuses (i.e., moves points along segments the points of sharp turns in the global path of the map into nodes, which are used to generate smooth hypocycloidal curves that maintain a safe clearance in relation to the obstacles. These nodes are also used as safe points of retreat to avoid collision with other robots. The novel contributions of this work are as follows: (1 The proposed work is the first use of hypocycloid geometry to produce smooth and continuous paths for robot motion. A mathematical analysis of SHP generation in various scenarios is discussed. (2 The proposed work is also the first to consider the case of smooth and collision-free path generation for a load carrying robot. (3 Traditionally, path smoothing and collision avoidance have been addressed as separate problems. This work proposes integrated and decoupled collision-free multi-robot path planning. ‵Node caching‵ is proposed to improve efficiency. A decoupled approach with local communication enables the paths of robots to be dynamically changed. (4 A novel ‵multi-robot map update‵ in case of dynamic obstacles in the map is proposed, such that robots update other robots about the positions of dynamic obstacles in the map. A timestamp feature ensures that all the robots have the most updated map. Comparison between SHP and other path smoothing techniques and experimental results in real environments confirm that SHP can generate smooth paths for robots and avoid collision with other robots through local communication.

  7. CSIR at TREC 2008 Expert Search Task: Modeling Expert Evidence in Expert Search

    Science.gov (United States)

    2008-11-01

    CSIR at TREC 2008 Expert Search Task: Modeling Expert Evidence in Expert Search Jiepu Jiang1, Wei Lu1, Haozhen Zhao2 1 Center for Studies of...AND SUBTITLE CSIR at TREC 2008 Expert Search Task: Modeling Expert Evidence in Expert Search 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM...15. J. Jiang, W. Lu, D. Liu. CSIR at TREC 2007. In Proceedings of the 16th Text REtrieval Conference (TREC 2007), 2007. 16. J. Jiang, W. Lu. IR

  8. Advertising for attention in a consumer search model

    NARCIS (Netherlands)

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

    2011-01-01

    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

  9. 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

  10. 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.

  11. Characteristics of Behavior of Robots with Emotion Model

    Science.gov (United States)

    Sato, Shigehiko; Nozawa, Akio; Ide, Hideto

    Cooperated multi robots system has much dominance in comparison with single robot system. It is able to adapt to various circumstances and has a flexibility for variation of tasks. However it has still problems to control each robot, though methods for control multi robots system have been studied. Recently, the robots have been coming into real scene. And emotion and sensitivity of the robots have been widely studied. In this study, human emotion model based on psychological interaction was adapt to multi robots system to achieve methods for organization of multi robots. The characteristics of behavior of multi robots system achieved through computer simulation were analyzed. As a result, very complexed and interesting behavior was emerged even though it has rather simple configuration. And it has flexiblity in various circumstances. Additional experiment with actual robots will be conducted based on the emotion model.

  12. Flocking of multi-robot systems with connectivity maintenance on directed graphs

    Institute of Scientific and Technical Information of China (English)

    Yutian Mao; Lihua Dou; Hao Fang; Jie Chen

    2014-01-01

    Analysis and design techniques for cooperative flocking of nonholonomic multi-robot systems with connectivity mainte-nance on directed graphs are presented. First, a set of bounded and smoothly distributed control protocols are devised via careful y designing a class of bounded artificial potential fields (APF) which could guarantee the connectivity maintenance, col ision avoidance and distance stabilization simultaneously during the system evolu-tion. The connectivity of the underlying network can be preserved, and the desired stable flocking behavior can be achieved pro-vided that the initial communication topology is strongly connected rather than undirected or balanced, which relaxes the constraints for group topology and extends the previous work to more general-ized directed graphs. Furthermore, the proposed control algorithm is extended to solve the flocking problem with a virtual leader. In this case, it is shown that al robots can asymptotical y move with the desired velocity and orientation even if there is only one in-formed robot in the team. Final y, nontrivial simulations and exper-iments are conducted to verify the effectiveness of the proposed algorithm.

  13. Hitchhiking Robots: A Collaborative Approach for Efficient Multi-Robot Navigation in Indoor Environments.

    Science.gov (United States)

    Ravankar, Abhijeet; Ravankar, Ankit A; Kobayashi, Yukinori; Emaru, Takanori

    2017-08-15

    Hitchhiking is a means of transportation gained by asking other people for a (free) ride. We developed a multi-robot system which is the first of its kind to incorporate hitchhiking in robotics, and discuss its advantages. Our method allows the hitchhiker robot to skip redundant computations in navigation like path planning, localization, obstacle avoidance, and map update by completely relying on the driver robot. This allows the hitchhiker robot, which performs only visual servoing, to save computation while navigating on the common path with the driver robot. The driver robot, in the proposed system performs all the heavy computations in navigation and updates the hitchhiker about the current localized positions and new obstacle positions in the map. The proposed system is robust to recover from `driver-lost' scenario which occurs due to visual servoing failure. We demonstrate robot hitchhiking in real environments considering factors like service-time and task priority with different start and goal configurations of the driver and hitchhiker robots. We also discuss the admissible characteristics of the hitchhiker, when hitchhiking should be allowed and when not, through experimental results.

  14. Discrimination and Skill Differences in an Equilibrium Search Model

    NARCIS (Netherlands)

    Bowlus, Audra J.; Eckstein, Zvi

    1998-01-01

    In this paper we analyze an equilibrium search model with threesources for wage andunemployment differentials among workers with the same (observed) human capital but different appearance (race): unobserved productivity (skill), search intensities and discrimination (Becker 1957)due to an

  15. Discrimination and Skill Differences in an Equilibrium Search Model

    NARCIS (Netherlands)

    Bowlus, Audra J.; Eckstein, Zvi

    1998-01-01

    In this paper we analyze an equilibrium search model with threesources for wage andunemployment differentials among workers with the same (observed) human capital but different appearance (race): unobserved productivity (skill), search intensities and discrimination (Becker 1957)due to an appearanc

  16. Search for symmetries beyond the Standard Model with ATLAS

    CERN Document Server

    Tal Hod, Noam; The ATLAS collaboration

    2015-01-01

    Searches for new physics beyond the Standard Model (SM) at the LHC are mainly driven by two approaches: a signature-based search where one looks for a deviation from the SM prediction in event yield or kinematic properties, and a more theory-oriented approach where the search is designed to look for specific signatures/topologies predicted by certain beyond standard model (BSM ) scenarios. Extensive searches for such signatures have been performed in ATLAS at LHC Run 1 in the context of Supersymmetry, Extended Gauge models, Technicolor, Little Higgs, Extra Dimensions, Left-Right symmetric models, and many other BSM scenarios. Highlights from these searches are presented.

  17. 协作多机器人系统研究进展综述%A survey of recent advances in cooperative multi-robot systems

    Institute of Scientific and Technical Information of China (English)

    吴军; 徐昕; 连传强; 贺汉根

    2011-01-01

    Cooperative multi-robot systems have been a particularly popular topic within robotics because of their potential applications. To meet the demand of promoting relevant study, the current research and development situation of cooperative multi-robot systems were systematically reviewed and summarized. Research concerning the unconscious bionic swarm-cooperation multi-robot and the heterogeneous intentional-cooperation multi-robot was discussed. In particular, to build and optimize heterogeneous intentional-cooperation multi-robot systems. the recent advances in system structure, environment perception. and control optimization were surveyed and analyzed. Moreover, the benchmark tasks and universal software/hardware platforms for a multi-robot were summarized. Finally,future developments in cooperative multi-robot system research were discussed.%协作多机器人系统是近年来机器人研究的热点,具有良好的应用前景.针对开展相关研究的迫切需要,总结了协作多机器人系统研究的国内外发展现状,并分别对无意识协作的仿生多机器人系统和有意识协作的异构多机器人系统研究进行论述.重点从系统构建和优化控制的宏观角度出发,对有意识协作异构多机器人系统的体系结构、环境感知以及优化控制3个方面的研究进展分别展开论述;对典型的多机器人验证任务和软硬件实验平台进行了总结;最后对协作多机器人系统的研究方向进行了展望.

  18. Top Partners Searches and Composite Higgs Models

    CERN Document Server

    Matsedonskyi, Oleksii; Wulzer, Andrea

    2015-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.

  19. Top partners searches and composite Higgs models

    Science.gov (United States)

    Matsedonskyi, Oleksii; Panico, Giuliano; Wulzer, Andrea

    2016-04-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.

  20. Top partner searches and Composite Higgs models

    Energy Technology Data Exchange (ETDEWEB)

    Matsedonskyi, Oleksii [DESY Hamburg (Germany); Panico, Giuliano [Barcelona Univ. Autonoma (Spain). IFAE; Wulyer, Andrea [Padova Univ. (Italy). Dipt. di Fisica e Astronomia; INFN, Padova (Italy)

    2015-12-15

    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.

  1. Efficient Approach for Semantic Web Searching Using Markov Model

    Directory of Open Access Journals (Sweden)

    Pradeep Salve

    2012-09-01

    Full Text Available The semantic search usually the web pages for the required information and filter the pages from semantic web searching unnecessary pages by using advanced algorithms. Web pages are vulnerable in answering intelligent semantic search from the user due to the confidence of their consequences on information obtainable in web pages. To get the trusted results semantic web search engines require searching for pages that maintain such information at some place including domain knowledge. The layered model of Semantic Web provides solution to this problem by providing semantic web search based on HMM for optimization of search engines tasks, specialty focusing on how to construct a new model structure to improve the extraction of web pages. We classify the search results using some search engines and some different search keywords provide a significant improvement in search accuracy. Semantic web is segmented from the elicited information of various websites based on their characteristic of semi-structure in order to improve the accuracy and efficiency of the transition matrix. Also, it optimizes the observation probability distribution and the estimation accuracy of state transition sequence by adopting the “voting strategy” and alter Viterbi algorithm. In this paper, we have presented a hybrid system that includes both hidden Markov models and rich markov model that showed the effectiveness of combining implicit search with rich Markov models for a recommender system.

  2. R&D of FMS and multi-robot comprehensive training platform facing vocational education%面向职教的FMS与多机器人综合实训平台研究与开发

    Institute of Scientific and Technical Information of China (English)

    雷云涛; 杨薇; 李全利; 邴志刚

    2012-01-01

    以职业教育为应用背景,为提升FMS(flexible manufacture system)的整体性能、拓展其适用面,将多机器人、传感器网络等技术融入FMS.给出了FMS总体结构、传感器网络环境下多机器人协同控制系统结构,以及FMS物流子系统基于Petri网的建模和优化算法.实际应用验证了所设计平台以及相关算法和软件的有效性.%Taking vocational education as the application background, several techniques, including the multi-robot and the wireless sensor networks, are integrated into the FMS to promote the whole performance and to extend the applicability. Some key issues such as the general structure of FMS, the multi-robot collaboration control system under the wireless sensor networks environment, the FMS logistics system modeling based on Petri network and optimization algorithms are discussed. The practical application is implemented to verify the effectiveness of the platform, algorithms and software.

  3. Application of Sensor Fusion in Multi-robot Cooperative Localization%传感器融合在多机器人合作定位中的应用

    Institute of Scientific and Technical Information of China (English)

    刘显荣

    2011-01-01

    Robot localization is the premise of other robot research,such as environment explore and motion coordination.Inspired by information fusion ,a novel multi-robot cooperative localization technology is presented, which fuses the robot's multiple sensor data. First, the basic motion form of the two-wheel robot was modeled, and the relative observing formula was built aiming at the ultrasonic sensor. Then filtering and first-level fusion were applied to robots proprioceptive and exteroceptive sensors respectively,by which obtained the robot's proprioceptive location data and relative observing data.Finally, the robot's proprioceptive location data and observing data were fused by extension kalman filter (EKF),and the multi-robot cooperative localization was implemented. Experiment result demonstrates this cooperative localization technology can get the robots to form landmarks for each other,eliminate the accumulate error from encoder,and improve the robot localization accuracy efficiently.%机器人的定位技术是进行机器人环境探索、协调运动研究的前提,从信息融合的思想出发,提出了一种融合多传感器信息的合作定位技术.首先,对两轮机器人的基本运动形式进行建模,并针对超声波传感器建立了机器人之间的相对观测方程.然后,分别对机器人的内、外部传感器进行滤波和第一级融合,得到自身位姿和相对观测信息.最后,利用扩展卡尔曼滤波(EKF)融合机器人的自身位姿和观测信息,实现多机器人的合作定位.实验结果表明,本合作定位能够使机器人之间互为路标,消除码盘定位的累积误差,有效地提高机器人定位精度.

  4. A Multi-Robot Sense-Act Approach to Lead to a Proper Acting in Environmental Incidents.

    Science.gov (United States)

    Conesa-Muñoz, Jesús; Valente, João; Del Cerro, Jaime; Barrientos, Antonio; Ribeiro, Angela

    2016-08-10

    Many environmental incidents affect large areas, often in rough terrain constrained by natural obstacles, which makes intervention difficult. New technologies, such as unmanned aerial vehicles, may help address this issue due to their suitability to reach and easily cover large areas. Thus, unmanned aerial vehicles may be used to inspect the terrain and make a first assessment of the affected areas; however, nowadays they do not have the capability to act. On the other hand, ground vehicles rely on enough power to perform the intervention but exhibit more mobility constraints. This paper proposes a multi-robot sense-act system, composed of aerial and ground vehicles. This combination allows performing autonomous tasks in large outdoor areas by integrating both types of platforms in a fully automated manner. Aerial units are used to easily obtain relevant data from the environment and ground units use this information to carry out interventions more efficiently. This paper describes the platforms and sensors required by this multi-robot sense-act system as well as proposes a software system to automatically handle the workflow for any generic environmental task. The proposed system has proved to be suitable to reduce the amount of herbicide applied in agricultural treatments. Although herbicides are very polluting, they are massively deployed on complete agricultural fields to remove weeds. Nevertheless, the amount of herbicide required for treatment is radically reduced when it is accurately applied on patches by the proposed multi-robot system. Thus, the aerial units were employed to scout the crop and build an accurate weed distribution map which was subsequently used to plan the task of the ground units. The whole workflow was executed in a fully autonomous way, without human intervention except when required by Spanish law due to safety reasons.

  5. A Multi-Robot Sense-Act Approach to Lead to a Proper Acting in Environmental Incidents

    Science.gov (United States)

    Conesa-Muñoz, Jesús; Valente, João; del Cerro, Jaime; Barrientos, Antonio; Ribeiro, Angela

    2016-01-01

    Many environmental incidents affect large areas, often in rough terrain constrained by natural obstacles, which makes intervention difficult. New technologies, such as unmanned aerial vehicles, may help address this issue due to their suitability to reach and easily cover large areas. Thus, unmanned aerial vehicles may be used to inspect the terrain and make a first assessment of the affected areas; however, nowadays they do not have the capability to act. On the other hand, ground vehicles rely on enough power to perform the intervention but exhibit more mobility constraints. This paper proposes a multi-robot sense-act system, composed of aerial and ground vehicles. This combination allows performing autonomous tasks in large outdoor areas by integrating both types of platforms in a fully automated manner. Aerial units are used to easily obtain relevant data from the environment and ground units use this information to carry out interventions more efficiently. This paper describes the platforms and sensors required by this multi-robot sense-act system as well as proposes a software system to automatically handle the workflow for any generic environmental task. The proposed system has proved to be suitable to reduce the amount of herbicide applied in agricultural treatments. Although herbicides are very polluting, they are massively deployed on complete agricultural fields to remove weeds. Nevertheless, the amount of herbicide required for treatment is radically reduced when it is accurately applied on patches by the proposed multi-robot system. Thus, the aerial units were employed to scout the crop and build an accurate weed distribution map which was subsequently used to plan the task of the ground units. The whole workflow was executed in a fully autonomous way, without human intervention except when required by Spanish law due to safety reasons. PMID:27517934

  6. A Multi-Robot Sense-Act Approach to Lead to a Proper Acting in Environmental Incidents

    Directory of Open Access Journals (Sweden)

    Jesús Conesa-Muñoz

    2016-08-01

    Full Text Available Many environmental incidents affect large areas, often in rough terrain constrained by natural obstacles, which makes intervention difficult. New technologies, such as unmanned aerial vehicles, may help address this issue due to their suitability to reach and easily cover large areas. Thus, unmanned aerial vehicles may be used to inspect the terrain and make a first assessment of the affected areas; however, nowadays they do not have the capability to act. On the other hand, ground vehicles rely on enough power to perform the intervention but exhibit more mobility constraints. This paper proposes a multi-robot sense-act system, composed of aerial and ground vehicles. This combination allows performing autonomous tasks in large outdoor areas by integrating both types of platforms in a fully automated manner. Aerial units are used to easily obtain relevant data from the environment and ground units use this information to carry out interventions more efficiently. This paper describes the platforms and sensors required by this multi-robot sense-act system as well as proposes a software system to automatically handle the workflow for any generic environmental task. The proposed system has proved to be suitable to reduce the amount of herbicide applied in agricultural treatments. Although herbicides are very polluting, they are massively deployed on complete agricultural fields to remove weeds. Nevertheless, the amount of herbicide required for treatment is radically reduced when it is accurately applied on patches by the proposed multi-robot system. Thus, the aerial units were employed to scout the crop and build an accurate weed distribution map which was subsequently used to plan the task of the ground units. The whole workflow was executed in a fully autonomous way, without human intervention except when required by Spanish law due to safety reasons.

  7. Semantic Web Based Efficient Search Using Ontology and Mathematical Model

    Directory of Open Access Journals (Sweden)

    K.Palaniammal

    2014-01-01

    Full Text Available The semantic web is the forthcoming technology in the world of search engine. It becomes mainly focused towards the search which is more meaningful rather than the syntactic search prevailing now. This proposed work concerns about the semantic search with respect to the educational domain. In this paper, we propose semantic web based efficient search using ontology and mathematical model that takes into account the misleading, unmatched kind of service information, lack of relevant domain knowledge and the wrong service queries. To solve these issues in this framework is designed to make three major contributions, which are ontology knowledge base, Natural Language Processing (NLP techniques and search model. Ontology knowledge base is to store domain specific service ontologies and service description entity (SDE metadata. The search model is to retrieve SDE metadata as efficient for Education lenders, which include mathematical model. The Natural language processing techniques for spell-check and synonym based search. The results are retrieved and stored in an ontology, which in terms prevents the data redundancy. The results are more accurate to search, sensitive to spell check and synonymous context. This paper reduces the user’s time and complexity in finding for the correct results of his/her search text and our model provides more accurate results. A series of experiments are conducted in order to respectively evaluate the mechanism and the employed mathematical model.

  8. 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…

  9. 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…

  10. Search for Beyond the Standard Model Physics at D0

    Energy Technology Data Exchange (ETDEWEB)

    Kraus, James

    2011-08-01

    The standard model (SM) of particle physics has been remarkably successful at predicting the outcomes of particle physics experiments, but there are reasons to expect new physics at the electroweak scale. Over the last several years, there have been a number of searches for beyond the standard model (BSM) physics at D0. Here, we limit our focus to three: searches for diphoton events with large missing transverse energy (E{sub T}), searches for leptonic jets and E{sub T}, and searches for single vector-like quarks. We have discussed three recent searches at D0. There are many more, including limits on heavy neutral gauge boson in the ee channel, a search for scalar top quarks, a search for quirks, and limits on a new resonance decaying to WW or WZ.

  11. RNA Structural Homology Search with a Succinct Stochastic Grammar Model

    Institute of Scientific and Technical Information of China (English)

    Ying-Lei Song; Ji-Zhen Zhao; Chun-Mei Liu; Kan Liu; Russell Malmberg; Li-Ming Cai

    2005-01-01

    An increasing number of structural homology search tools, mostly based on profile stochastic context-free grammars (SCFGs) have been recently developed for the non-coding RNA gene identification. SCFGs can include statistical biases that often occur in RNA sequences, necessary to profile specific RNA structures for structural homology search. In this paper, a succinct stochastic grammar model is introduced for RNA that has competitive search effectiveness. More importantly, the profiling model can be easily extended to include pseudoknots, structures that are beyond the capability of profile SCFGs. In addition, the model allows heuristics to be exploited, resulting in a significant speed-up for the CYK algorithm-based search.

  12. 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…

  13. Information Search Process Model: How Freshmen Begin Research.

    Science.gov (United States)

    Swain, Deborah E.

    1996-01-01

    Investigates Kuhlthau's Search Process Model for information seeking using two Freshmen English classes. Data showed that students followed the six stages Kuhlthau proposed and suggest extensions to the model, including changing the order of the tasks, iterating and combining steps, and revising search goals based on social and interpersonal…

  14. 多机器人Ad Hoc路由协议中蚁群算法的改进%Improvement on ant-colony algorithm in Ad Hoc routing protocol for multi-robot network

    Institute of Scientific and Technical Information of China (English)

    曹洁; 王思乐; 帅立国

    2012-01-01

    Aimed at the problems of lower stability and reliability of the routing in multi-robot Ad Hoc routing protocols, an ant-colony algorithm was introduced and its thorough analysis was made. By means of improving the state transition strategy and pheromone update strategy in the ant-colony algorithm, the global searching ability was improved and the falling-into local optimum solution of the algorithm was a-voided. Therefore, the design of multi-robots Ad Hoc routing protocol was realized based on this improved ant-colony algorithm. Simulation result showed that, compared with classic AODV (Ad Hoc on-demand distance vector) protocol, this routing protocol has improved the stability of the network performances and communication efficiency more effectively.%针对多机器人Ad Hoc网络路由协议中路由稳定性和可靠性低的问题,引入蚁群算法并对其进行深入分析.通过对蚁群算法状态转移策略和信息素更新策略的改进,提高全局搜索能力,避免算法陷入局部最优解,实现基于改进蚁群算法多机器人Ad Hoc路由协议的设计.仿真结果表明,与经典的AODV(Ad Hoc on-denand distance vector)协议相比,该路由协议有效地提高了网络的稳定性和通信效率.

  15. 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.

  16. SHERLOCK: A quasi-model-independent new physics search strategy.

    Science.gov (United States)

    Knuteson, Bruce

    2000-04-01

    We develop a quasi-model-independent prescription for searching for physics responsible for the electroweak symmetry breaking in the Standard Model, and show a preliminary version of what we find when this prescription is applied to the DZero data.

  17. Developing Operator Models for UAV Search Scheduling

    NARCIS (Netherlands)

    Bertuccelli, L.F.; Beckers, N.W.M.; Cummings, M.L.

    2010-01-01

    With the increased use of Unmanned Aerial Vehicles (UAVs), it is envisioned that UAV operators will become high level mission supervisors, responsible for information management and task planning. In the context of search missions, operators supervising a large number of UAVs can become overwhelmed

  18. Combining search space partition and search Space partition and abstraction for LTL model checking

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    The state space explosion problem is still the key obstacle for applying model checking to systems of industrial size.Abstraction-based methods have been particularly successful in this regard.This paper presents an approach based on refinement of search space partition and abstraction which combines these two techniques for reducing the complexity of model checking.The refinement depends on the representation of each portion of search space. Especially, search space can be refined stepwise to get a better reduction. As reported in the case study, the Integration of search space partition and abstraction improves the efficiencyof verification with respect to the requirement of memory and obtains significant advantage over the use of each of them in isolation.

  19. A multi-dimensional model for search intent.

    NARCIS (Netherlands)

    Kraaij, W.; Hinne, M.; Heijden, M. van der; Verberne, S.

    2011-01-01

    The interaction of users with search engines is part of goal driven behaviour involving an underlying information need. Information needs range from simple lookups to complex long-term desk studies. This paper proposes a new multi-dimensional model for search intent, which can be used for the

  20. 基于虚拟环境的多操作者多机器人协作遥操作系统%Virtual Environment-Based Multi-Operator Multi-Robot Cooperative Teleoperation System

    Institute of Scientific and Technical Information of China (English)

    马良; 闫继宏; 赵杰; 陈志峰

    2011-01-01

    A virtual environment-based multi-operator multi-robot cooperative teleoperation system is proposed, and the software framework of control system with three layered C/S (client/server) structure is adopted.The model of distributed virtual environment is built according to work scene of the experimental platform for accomplishing distributed control of multiple robots by multiple operators.Based on the structure of multi-operator multi-robot teleoperation system, a method based on local lag is presented to realize consistency control in distributed virtual environment, and the problems of clock synchronization, lag time and state repairing in teleoperation system are overcome.Finally, multi-robot cooperative control experiment including different types of cooperation is conducted on the proposed platform, and interaction between the operator and virtual environment is achieved.The operator interacts with virtual environment, observes the task environment and controls the robots in real time with the aid of real-time multi-video image feedback and force feedback, and completes the given task safely and efficiently, which verifies the reasonability and feasibility of the system.%建立了基于虚拟环境的多操作者多机器人协作遥操作系统,采用3层C/S结构的控制系统软件构架.根据实验系统平台工作场景对分布式虚拟环境进行建模,以实现多操作者对多机器人的分布式控制.结合多操作者多机器人遥操作系统的结构特点,采用本地滞后原理对分布式虚拟环境的一致性控制进行了研究,解决了遥操作系统一致性控制中时钟同步、滞后时间、状态修复等问题.最后在提出的系统平台上进行了不同协作类型的多机器人协调控制实验,操作者与虚拟环境进行交互,在力反馈及实时多视频图像反馈辅助下,实时地观察作业环境并控制机器人运动,安全、高效地完成了作业任务,验证了该系统的合理性和有效性.

  1. Search Strategies for Top Partners in Composite Higgs models

    CERN Document Server

    Gripaios, Ben; Parker, M A; Sutherland, Dave

    2014-01-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)\\times SU(2) \\rtimes \\mathbb{Z}_2$ symmetry protecting the rate for $Z \\rightarrow b\\overline{b}$ decays. We identify a number of minimal models whose top partners only have electric charges of $\\frac{1}{3}, \\frac{2}{3},$ or $\\frac{4}{3}$ 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.

  2. 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

  3. Enhanced bandwidth of a microstrip antenna using a parasitic mushroom-like metamaterial structure for multi-robot cooperative navigation

    Science.gov (United States)

    Lee, Cherl-Hee; Lee, Jonghun; Kim, Yoon-Gu; An, Jinung

    2015-01-01

    The broadband design of a microstrip patch antenna is presented and experimentally studied for multi-robot cooperation. A parasitic mushroom-like metamaterial (MTM) patch close to a microstrip top patch is excited through gap-coupling, thereby producing a resonance frequency. Because of the design, the resonance frequency of the parasitic MTM patch is adjacent to that of the main patch, and the presented antenna can achieve an enhanced bandwidth of 450 MHz, which is about two times the bandwidth of a conventional patch antenna without the MTM parasitic patch. The error rate of packet transmissions for measuring the distance between a leader robot and a follower robot was also improved by almost two-fold.

  4. Polynomial search and global modeling: Two algorithms for modeling chaos.

    Science.gov (United States)

    Mangiarotti, S; Coudret, R; Drapeau, L; Jarlan, L

    2012-10-01

    Global modeling aims to build mathematical models of concise description. Polynomial Model Search (PoMoS) and Global Modeling (GloMo) are two complementary algorithms (freely downloadable at the following address: http://www.cesbio.ups-tlse.fr/us/pomos_et_glomo.html) designed for the modeling of observed dynamical systems based on a small set of time series. Models considered in these algorithms are based on ordinary differential equations built on a polynomial formulation. More specifically, PoMoS aims at finding polynomial formulations from a given set of 1 to N time series, whereas GloMo is designed for single time series and aims to identify the parameters for a selected structure. GloMo also provides basic features to visualize integrated trajectories and to characterize their structure when it is simple enough: One allows for drawing the first return map for a chosen Poincaré section in the reconstructed space; another one computes the Lyapunov exponent along the trajectory. In the present paper, global modeling from single time series is considered. A description of the algorithms is given and three examples are provided. The first example is based on the three variables of the Rössler attractor. The second one comes from an experimental analysis of the copper electrodissolution in phosphoric acid for which a less parsimonious global model was obtained in a previous study. The third example is an exploratory case and concerns the cycle of rainfed wheat under semiarid climatic conditions as observed through a vegetation index derived from a spatial sensor.

  5. 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.

  6. Search Pathways: Modeling GeoData Search Behavior to Support Usable Application Development

    Science.gov (United States)

    Yarmey, L.; Rosati, A.; Tressel, S.

    2014-12-01

    Recent technical advances have enabled development of new scientific data discovery systems. Metadata brokering, linked data, and other mechanisms allow users to discover scientific data of interes across growing volumes of heterogeneous content. Matching this complex content with existing discovery technologies, people looking for scientific data are presented with an ever-growing array of features to sort, filter, subset, and scan through search returns to help them find what they are looking for. This paper examines the applicability of available technologies in connecting searchers with the data of interest. What metrics can be used to track success given shifting baselines of content and technology? How well do existing technologies map to steps in user search patterns? Taking a user-driven development approach, the team behind the Arctic Data Explorer interdisciplinary data discovery application invested heavily in usability testing and user search behavior analysis. Building on earlier library community search behavior work, models were developed to better define the diverse set of thought processes and steps users took to find data of interest, here called 'search pathways'. This research builds a deeper understanding of the user community that seeks to reuse scientific data. This approach ensures that development decisions are driven by clearly articulated user needs instead of ad hoc technology trends. Initial results from this research will be presented along with lessons learned for other discovery platform development and future directions for informatics research into search pathways.

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

    NARCIS (Netherlands)

    Joolingen, van Wouter R.; Jong, de Ton

    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 fr

  8. Cognitive control in majority search: A computational modeling approach

    Directory of Open Access Journals (Sweden)

    Hongbin eWang

    2011-02-01

    Full Text Available Despite the importance of cognitive control in many cognitive tasks involving uncertainty, the computational mechanisms of cognitive control in response to uncertainty remain unclear. In this study, we develop biologically realistic neural network models to investigate the instantiation of cognitive control in a majority function task, where one determines the category to which the majority of items in a group belong. Two models are constructed, both of which include the same set of modules representing task-relevant brain functions and share the same model structure. However, with a critical change of a model parameter setting, the two models implement two different underlying algorithms: one for grouping search (where a subgroup of items are sampled and re-sampled until a congruent sample is found and the other for self-terminating search (where the items are scanned and counted one-by-one until the majority is decided. The two algorithms hold distinct implications for the involvement of cognitive control. The modeling results show that while both models are able to perform the task, the grouping search model fit the human data better than the self-terminating search model. An examination of the dynamics underlying model performance reveals how cognitive control might be instantiated in the brain via the V4-ACC-LPFC-IPS loop for computing the majority function.

  9. Cognitive control in majority search: a computational modeling approach.

    Science.gov (United States)

    Wang, Hongbin; Liu, Xun; Fan, Jin

    2011-01-01

    Despite the importance of cognitive control in many cognitive tasks involving uncertainty, the computational mechanisms of cognitive control in response to uncertainty remain unclear. In this study, we develop biologically realistic neural network models to investigate the instantiation of cognitive control in a majority function task, where one determines the category to which the majority of items in a group belong. Two models are constructed, both of which include the same set of modules representing task-relevant brain functions and share the same model structure. However, with a critical change of a model parameter setting, the two models implement two different underlying algorithms: one for grouping search (where a subgroup of items are sampled and re-sampled until a congruent sample is found) and the other for self-terminating search (where the items are scanned and counted one-by-one until the majority is decided). The two algorithms hold distinct implications for the involvement of cognitive control. The modeling results show that while both models are able to perform the task, the grouping search model fit the human data better than the self-terminating search model. An examination of the dynamics underlying model performance reveals how cognitive control might be instantiated in the brain for computing the majority function.

  10. Discrimination and Skill Differences in an Equilibrium Search Model

    OpenAIRE

    Bowlus, Audra J.; Eckstein, Zvi

    1998-01-01

    In this paper, we analyse an equilibrium search model with three sources for wage and unemployment differentials among workers with the same (observed) human capital but different appearance (race): unobserved productivity (skill), search intensities and discrimination (Becker 1957) due to an appearance-based employer disutility factor. Because these sources affect the earnings distributions differently, empirical identification of these potential sources for the explanation of wage and unemp...

  11. 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.

  12. 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.

  13. 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....

  14. 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 c...

  15. 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 ta

  16. 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...

  17. 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.

  18. Financial applications of a Tabu search variable selection model

    Directory of Open Access Journals (Sweden)

    Zvi Drezner

    2001-01-01

    Full Text Available We illustrate how a comparatively new technique, a Tabu search variable selection model [Drezner, Marcoulides and Salhi (1999], can be applied efficiently within finance when the researcher must select a subset of variables from among the whole set of explanatory variables under consideration. Several types of problems in finance, including corporate and personal bankruptcy prediction, mortgage and credit scoring, and the selection of variables for the Arbitrage Pricing Model, require the researcher to select a subset of variables from a larger set. In order to demonstrate the usefulness of the Tabu search variable selection model, we: (1 illustrate its efficiency in comparison to the main alternative search procedures, such as stepwise regression and the Maximum R2 procedure, and (2 show how a version of the Tabu search procedure may be implemented when attempting to predict corporate bankruptcy. We accomplish (2 by indicating that a Tabu Search procedure increases the predictability of corporate bankruptcy by up to 10 percentage points in comparison to Altman's (1968 Z-Score model.

  19. Visual-search models for location-known detection tasks

    Science.gov (United States)

    Gifford, H. C.; Karbaschi, Z.; Banerjee, K.; Das, M.

    2017-03-01

    Lesion-detection studies that analyze a fixed target position are generally considered predictive of studies involving lesion search, but the extent of the correlation often goes untested. The purpose of this work was to develop a visual-search (VS) model observer for location-known tasks that, coupled with previous work on localization tasks, would allow efficient same-observer assessments of how search and other task variations can alter study outcomes. The model observer featured adjustable parameters to control the search radius around the fixed lesion location and the minimum separation between suspicious locations. Comparisons were made against human observers, a channelized Hotelling observer and a nonprewhitening observer with eye filter in a two-alternative forced-choice study with simulated lumpy background images containing stationary anatomical and quantum noise. These images modeled single-pinhole nuclear medicine scans with different pinhole sizes. When the VS observer's search radius was optimized with training images, close agreement was obtained with human-observer results. Some performance differences between the humans could be explained by varying the model observer's separation parameter. The range of optimal pinhole sizes identified by the VS observer was in agreement with the range determined with the channelized Hotelling observer.

  20. Search of novel model for integrative medicine.

    Science.gov (United States)

    Patwardhan, Bhushan; Mutalik, Gururaj

    2014-03-01

    This article provides global and Indian scenario with strengths and limitations of present health care system. Affordability, accessibility and availability of health care coupled with disproportionate growth and double burden of diseases have become major concerns in India. This article emphasizes need for mindset change from illness-disease-drug centric curative to person-health-wellness centric preventive and promotive approaches. It highlights innovation deficit faced pharmaceutical industry and drugs being withdrawn from market for safety reasons. Medical pluralism is a growing trend and people are exploring various options including modern, traditional, complementary and alternative medicine. In such a situation, knowledge from Ayurveda, yoga, Chinese medicine and acupuncture may play an important role. We can evolve a suitable model by integrating modern and traditional systems of medicine for affordable health care. In the larger interest of global community, Indian and Chinese systems should share knowledge and experiences for mutual intellectual enrichments and work together to evolve a novel model of integrative medicine.

  1. 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.

  2. Model-Independent Jets plus Missing Energy Searches

    Energy Technology Data Exchange (ETDEWEB)

    Alwall, Johan; Le, My-Phuong; Lisanti, Mariangela; Wacker, Jay G.

    2008-09-22

    We present a proposal for performing model-independent jets plus missing energy searches. Currently, these searches are optimized for mSUGRA and are consequently not sensitive to all kinematically-accessible regions of parameter space. We show that the reach of these searches can be broadened by setting limits on the differential cross section as a function of the total visible energy and the missing energy. These measurements only require knowledge of the relevant Standard Model backgrounds and can be subsequently used to limit any theoretical model of new physics. We apply this approach to an example where gluinos are pair-produced and decay to the LSP through a single-step cascade, and show how sensitivity to different gluino masses is altered by the presence of the decay chain. The analysis is closely based upon the current searches done at the Tevatron and our proposal requires only small modifications to the existing techniques. We find that within the MSSM, the gluino can be as light as 125 GeV. The same techniques are applicable to jets and missing energy searches at the Large Hadron Collider.

  3. On Range Searching in the Group Model and Combinatorial Discrepancy

    DEFF Research Database (Denmark)

    Larsen, Kasper Green

    2011-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_ut_q = Omega(disc^2/lg n)$ where...... $t_u$ is the worst case update time, $t_q$ 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:begin{itemize}item For half space range searching in $d$-dimensional space, we get a lower bound of $t_u t_q = Omega(n^{1-1/d}/lg n)$. This comes within a $lg n lg lg n$ factor of the best known upper bound. item For orthogonal range searching in $d...

  4. 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...

  5. 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.

  6. Searches for Standard Model Higgs at the Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    Cortavitarte, Rocio Vilar; /Cantabria Inst. of Phys.

    2007-11-01

    A summary of the latest results of Standard Model Higgs boson searches from CDF and D0 presented at the DIS 2007 conference is reported in this paper. All analyses presented use 1 fb{sup -1} of Tevatron data. The strategy of the different analyses is determined by the Higgs production mechanism and decay channel.

  7. Searches for standard model Higgs at the Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    Vilar Cortabitarte, Rocio; /Cantabria U., Santander

    2007-04-01

    A summary of the latest results of Standard Model Higgs boson searches from CDF and D0 presented at the DIS 2007 conference is reported in this paper. All analyses presented use 1 fb{sup -1} of Tevatron data. The strategy of the different analyses is determined by the Higgs production mechanism and decay channel.

  8. 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...

  9. In search for animal models of female sexual dysfunction

    NARCIS (Netherlands)

    Snoeren, E.M.S.

    2010-01-01

    Female Sexual Dysfunction (FSD) is a disorder that affects around 40% of the population. Low sexual arousal and low sexual desire are the most common problems. The mechanisms underlying the disorder are still unclear. The aims of this thesis were 1) the search for animal models of FSD, 2) the develo

  10. The Evaluation of Provided Methods in SLAM Problem and a Method Development in Order to Use in Multi Robot

    Directory of Open Access Journals (Sweden)

    Jenabzadeh MohammadReza

    2013-07-01

    Full Text Available Simultaneously Localization and Mapping (SLAM in mobile robots is an issue which is of utmost importance to Robotic Science researchers. The goal is to determine the position of intelligent mobile robots and their navigation to provide the overview map of the environment when no knowledge of it exists. So far, various methods have been presented in group robots to solve the SLAM problem. After about six years of research on mobile robots in Yazd Robotic Association and of applying available algorithms on rescue real robots, we will review major approaches on a robot and will introduce a new method that has been applied on two platforms of manual and autonomous robots in IranOpen 2011 competitions. We provide a method based on ROA-BlackWelized Particles filter (RBPF algorithm and Forgetting curve in Multi robots which, compared to the limitations of collecting environmental data in the past two years, has provided satisfactory results. In the end, we simulate the consequence method in order to provide the robot’s overview and local maps from the environment in PlayerStage software.

  11. 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.

  12. 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.

  13. 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.

  14. Novel web service selection model based on discrete group search.

    Science.gov (United States)

    Zhai, Jie; Shao, Zhiqing; Guo, Yi; Zhang, Haiteng

    2014-01-01

    In our earlier work, we present a novel formal method for the semiautomatic verification of specifications and for describing web service composition components by using abstract concepts. After verification, the instantiations of components were selected to satisfy the complex service performance constraints. However, selecting an optimal instantiation, which comprises different candidate services for each generic service, from a large number of instantiations is difficult. Therefore, we present a new evolutionary approach on the basis of the discrete group search service (D-GSS) model. With regard to obtaining the optimal multiconstraint instantiation of the complex component, the D-GSS model has competitive performance compared with other service selection models in terms of accuracy, efficiency, and ability to solve high-dimensional service composition component problems. We propose the cost function and the discrete group search optimizer (D-GSO) algorithm and study the convergence of the D-GSS model through verification and test cases.

  15. Content-Based Search on a Database of Geometric Models: Identifying Objects of Similar Shape

    Energy Technology Data Exchange (ETDEWEB)

    XAVIER, PATRICK G.; HENRY, TYSON R.; LAFARGE, ROBERT A.; MEIRANS, LILITA; RAY, LAWRENCE P.

    2001-11-01

    The Geometric Search Engine is a software system for storing and searching a database of geometric models. The database maybe searched for modeled objects similar in shape to a target model supplied by the user. The database models are generally from CAD models while the target model may be either a CAD model or a model generated from range data collected from a physical object. This document describes key generation, database layout, and search of the database.

  16. An equilibrium search model of the informal sector

    OpenAIRE

    2006-01-01

    We use an equilibrium search framework to model a formal- informal sector labour market where the informal sector arises endogenously. In our model large firms will be in the formal sector and pay a wage premium, while small firms are characterised by low wages and tend to be in the informal sector. Using data from the South African labour force survey we illustrate that the data is consistent with these predictions.

  17. In search for animal models of female sexual dysfunction

    OpenAIRE

    2010-01-01

    Female Sexual Dysfunction (FSD) is a disorder that affects around 40% of the population. Low sexual arousal and low sexual desire are the most common problems. The mechanisms underlying the disorder are still unclear. The aims of this thesis were 1) the search for animal models of FSD, 2) the development of new treatments and 3) to investigate the effects of common used antidepressants on female sexual behavior. In the first part, two rat models are described which were validated with pharmac...

  18. 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.

  19. Variable Neighborhood Simplex Search Methods for Global Optimization Models

    Directory of Open Access Journals (Sweden)

    Pongchanun Luangpaiboon

    2012-01-01

    Full Text Available Problem statement: Many optimization problems of practical interest are encountered in various fields of chemical, engineering and management sciences. They are computationally intractable. Therefore, a practical algorithm for solving such problems is to employ approximation algorithms that can find nearly optimums within a reasonable amount of computational time. Approach: In this study the hybrid methods combining the Variable Neighborhood Search (VNS and simplex’s family methods are proposed to deal with the global optimization problems of noisy continuous functions including constrained models. Basically, the simplex methods offer a search scheme without the gradient information whereas the VNS has the better searching ability with a systematic change of neighborhood of the current solution within a local search. Results: The VNS modified simplex method has a better searching ability for optimization problems with noise. The VNS modified simplex method also outperforms in average on the characteristics of intensity and diversity during the evolution of design point moving stage for the constrained optimization. Conclusion: The adaptive hybrid versions have proved to obtain significantly better results than the conventional methods. The amount of computation effort required for successful optimization is very sensitive to the rate of noise decrease of the process yields. Under circumstances of constrained optimization and gradually increasing the noise during an optimization the most preferred approach is the VNS modified simplex method.

  20. Cuckoo Search Optimization for Reduction of a Greenhouse Climate Model

    Directory of Open Access Journals (Sweden)

    Hasni Abdelhafid

    2016-07-01

    Full Text Available Greenhouse climate and crop models and specially reduced models are necessary for bettering environmental management and control ability. In this paper, we present a new metaheuristic method, called Cuckoo Search (CS algorithm, established on the life of a bird family for selecting the parameters of a reduced model which optimizes their choice by minimizing a cost function. The reduced model was already developed for control purposes and published in the literature. The proposed models target at simulating and predicting the greenhouse environment. [?]. This study focuses on the dynamical behaviors of the inside air temperature and pressure using ventilation. Some experimental results are used for model validation, the greenhouse being automated with actuators and sensors connected to a greenhouse control system on the cuckoo search methods to determine the best set of parameters allowing for the convergence of a criteria based on the difference between calculated and observed state variables (inside air temperature and water vapour pressure content. The results shown that the tested Cuckoo Search algorithm allows for a faster convergence towards the optimal solution than classical optimization methods.

  1. 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 whether their parameters are fixed or evolutive. Stochastic model specification is carried out to discriminate two alternative hypotheses concerning the generation of trends: the trend-stationary hypothesis, on the one hand, for which the trend is a deterministic function of time and the short run......, estimated by a suitable Gibbs sampling scheme, provides useful insight on quasi-integrated nature of the specifications selected....

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

    Directory of Open Access Journals (Sweden)

    J. A. Astaiza

    2015-12-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.

  3. 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.

  4. Robust hashing with local models for approximate similarity search.

    Science.gov (United States)

    Song, Jingkuan; Yang, Yi; Li, Xuelong; Huang, Zi; Yang, Yang

    2014-07-01

    Similarity search plays an important role in many applications involving high-dimensional data. Due to the known dimensionality curse, the performance of most existing indexing structures degrades quickly as the feature dimensionality increases. Hashing methods, such as locality sensitive hashing (LSH) and its variants, have been widely used to achieve fast approximate similarity search by trading search quality for efficiency. However, most existing hashing methods make use of randomized algorithms to generate hash codes without considering the specific structural information in the data. In this paper, we propose a novel hashing method, namely, robust hashing with local models (RHLM), which learns a set of robust hash functions to map the high-dimensional data points into binary hash codes by effectively utilizing local structural information. In RHLM, for each individual data point in the training dataset, a local hashing model is learned and used to predict the hash codes of its neighboring data points. The local models from all the data points are globally aligned so that an optimal hash code can be assigned to each data point. After obtaining the hash codes of all the training data points, we design a robust method by employing l2,1 -norm minimization on the loss function to learn effective hash functions, which are then used to map each database point into its hash code. Given a query data point, the search process first maps it into the query hash code by the hash functions and then explores the buckets, which have similar hash codes to the query hash code. Extensive experimental results conducted on real-life datasets show that the proposed RHLM outperforms the state-of-the-art methods in terms of search quality and efficiency.

  5. Optimum Binary Search Trees on the Hierarchical Memory Model

    CERN Document Server

    Thite, Shripad

    2008-01-01

    The Hierarchical Memory Model (HMM) of computation is similar to the standard Random Access Machine (RAM) model except that the HMM has a non-uniform memory organized in a hierarchy of levels numbered 1 through h. The cost of accessing a memory location increases with the level number, and accesses to memory locations belonging to the same level cost the same. Formally, the cost of a single access to the memory location at address a is given by m(a), where m: N -> N is the memory cost function, and the h distinct values of m model the different levels of the memory hierarchy. We study the problem of constructing and storing a binary search tree (BST) of minimum cost, over a set of keys, with probabilities for successful and unsuccessful searches, on the HMM with an arbitrary number of memory levels, and for the special case h=2. While the problem of constructing optimum binary search trees has been well studied for the standard RAM model, the additional parameter m for the HMM increases the combinatorial comp...

  6. Singlet-Doublet model: dark matter searches and LHC constraints

    Energy Technology Data Exchange (ETDEWEB)

    Calibbi, Lorenzo [State Key Laboratory of Theoretical Physics, Institute of Theoretical Physics,Chinese Academy of Sciences,Beijing 100190 (China); Service de Physique Théorique, Université Libre de Bruxelles,C.P. 225, B-1050, Brussels (Belgium); Mariotti, Alberto; Tziveloglou, Pantelis [Theoretische Natuurkunde and IIHE/ELEM, Vrije Universiteit Brussel,and International Solvay Institutes,Pleinlaan 2, B-1050 Brussels (Belgium)

    2015-10-19

    The Singlet-Doublet model of dark matter is a minimal extension of the Standard Model with dark matter that is a mixture of a singlet and a non-chiral pair of electroweak doublet fermions. The stability of dark matter is ensured by the typical parity symmetry, and, similar to a ‘Bino-Higgsino’ system, the extra matter content improves gauge coupling unification. We revisit the experimental constraints on the Singlet-Doublet dark matter model, combining the most relevant bounds from direct (spin independent and spin dependent) and indirect searches. We show that such comprehensive analysis sets strong constraints on a large part of the 4-dimensional parameter space, closing the notorious ‘blind-spots’ of spin independent direct searches. Our results emphasise the complementarity of direct and indirect searches in probing dark matter models in diverse mass scale regimes. We also discuss the LHC bounds on such scenario, which play a relevant role in the low mass region of the dark matter candidate.

  7. Singlet-Doublet Model: Dark matter searches and LHC constraints

    CERN Document Server

    Calibbi, Lorenzo; Tziveloglou, Pantelis

    2015-01-01

    The Singlet-Doublet model of dark matter is a minimal extension of the Standard Model with dark matter that is a mixture of a singlet and a non-chiral pair of electroweak doublet fermions. The stability of dark matter is ensured by the typical parity symmetry, and, similar to a "Bino-Higgsino" system, the extra matter content improves gauge coupling unification. We revisit the experimental constraints on the Singlet-Doublet dark matter model, combining the most relevant bounds from direct (spin independent and spin dependent) and indirect searches. We show that such comprehensive analysis sets strong constraints on a large part of the 4-dimensional parameter space, closing the notorious "blind-spots" of spin independent direct searches. Our results emphasise the complementarity of direct and indirect searches in probing dark matter models in diverse mass scale regimes. We also discuss the LHC bounds on such scenario, which play a relevant role in the low mass region of the dark matter candidate.

  8. LEP Higgs boson searches beyond the standard model and minimum supersymmetric standard model

    Indian Academy of Sciences (India)

    Pauline Gagnon

    2004-03-01

    Ever since the center-of-mass energy was increased in 1995 above the $Z^{0}$ resonance, the four LEP experiments (ALEPH, DELPHI, OPAL and L3) have renewed their effort to search for the Higgs boson. Data taking ended in the year 2000 with about 130 pb-1 f data collected per experiment above 206 GeV in $e^{+} e^{-}$ collisions but the data analysis is still very active. Most recently, the wealth of theoretical models and predictions has stimulated new analyses and model interpretations which go beyond the standard model and minimal supersymmetric standard model. 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 present the LEP combined results when they exist.

  9. 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.

  10. 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.

  11. Search for the Standard Model Higgs boson at CMS

    Directory of Open Access Journals (Sweden)

    Mohammadi Abdollah

    2015-01-01

    Full Text Available A search has been performed for the Standard Model (SM Higgs boson in different production modes and decay channels. The results are based on up to 5 fb−1 of 7 TeV and up to 20 fb−1 of 8 TeV proton-proton collisions data accumulated by the CMS experiment at LHC in 2011 and 2012. Additionally several tests have been done to check the compatibility of the observed state with the SM Higgs boson.

  12. Searching for Composite Higgs Models at the LHC

    Science.gov (United States)

    Flacke, Thomas

    Composite Higgs models have the potential to provide a solution to the hierarchy problem and a dynamical explanation for the generation of the Higgs potential. They can be tested at the LHC as the new sector which underlies electroweak symmetry breaking must become strong in the TeV regime, which implies additional bound states beyond the Higgs. In this paper, we first discuss prospects and search strategies for top partners (and other quark partners) in the strongly coupled sector, which we study in an effective field theory setup. In the second part of the proceedings, we go beyond the effective field theory approach. We discuss potential UV embeddings for composite Higgs models which contain a Higgs as well as top partners. We show that in all of these models, additional pseudo-Nambu-Goldstone bosons beyond the Higgs are present. In particular, all of the models contain a pseudoscalar which couples to the Standard Model gauge fields through Wess-Zumino-Witten terms, providing a prime candidate for a di-boson (including a di-photon) resonance. The models also contain colored pNGBs which can be searched for at the LHC.

  13. Searching for composite Higgs models at the LHC

    Science.gov (United States)

    Flacke, Thomas

    2016-07-01

    Composite Higgs models have the potential to provide a solution to the hierarchy problem and a dynamical explanation for the generation of the Higgs potential. They can be tested at the LHC as the new sector which underlies electroweak symmetry breaking must become strong in the TeV regime, which implies additional bound states beyond the Higgs. In this paper, we first discuss prospects and search strategies for top partners (and other quark partners) in the strongly coupled sector, which we study in an effective field theory setup. In the second part of the proceedings, we go beyond the effective field theory approach. We discuss potential UV embeddings for composite Higgs models which contain a Higgs as well as top partners. We show that in all of these models, additional pseudo-Nambu-Goldstone bosons beyond the Higgs are present. In particular, all of the models contain a pseudoscalar which couples to the Standard Model gauge fields through Wess-Zumino-Witten terms, providing a prime candidate for a di-boson (including a di-photon) resonance. The models also contain colored pNGBs which can be searched for at the LHC.

  14. 多机器人远程监控系统的多智能体控制结构%Multi-Agent Control Structure of Multi-robot Remote Monitoring System

    Institute of Scientific and Technical Information of China (English)

    刘鑫; 于振中; 郑为凑; 惠晶

    2014-01-01

    针对多机器人远程监控系统信息错综复杂、协作不稳定的问题,建立基于多智能体(Multi-Agent)技术的系统体系结构,描述系统各组件之间的信息交互关系,优化人-机智能分配。分析系统物理结构的特点,提出一种基于 Multi-Agent 技术的共享控制系统分层体系结构,结合黑板结构和点对点结构,给出 Multi-Agent 的混合通信模型。针对遥操作系统的特点,设计一种混合型Agent 体系结构,举例研究 Agent 的实现方法。通过多操作者控制机器人保持队形的实验,验证了该混合型 Agent 体系结构的实用性和有效性。%According to the problem of multi-robot intricate and multi-robot collaboration unstable for remote monitoring system of multi-mobile robot, a system architecture based on multi-Agent technology can be established to optimize the man-machine intelligence allocation and to give a clear description of the various components of the system. By the analysis of the physical structure of the system, the architecture of hierarchical system based on share control mode of multi-Agent is proposed and a mixed communication model of multi-Agent combining the blackboard architecture and peer-to-peer structure is designed. According to the characteristics of the teleoperation system, a hybrid Agent architecture is designed. An example of the realization of the Agent is given, and an experiment that multi-operator keep robots controlled in line is designed to verify the effectiveness of the hybrid Agent architecture.

  15. Immune Task Allocation for Multi-robot System Based on Adjustment Mechanism of Thymic Peptide%基于胸腺肽调节机制的多机器人免疫任务分配

    Institute of Scientific and Technical Information of China (English)

    袁明新; 李平正; 江亚峰; 王孙安

    2014-01-01

    To solve the task allocation in multi-robot system, a thymic peptide based immune task allocation algorithm ( TPITAA) is proposed. Inspired by the mechanism of idiotypic network hypothesis, an immune allocation model is constructed according to the stimulation and suppression among the antigen and antibodies. The robot, robot behavior and task are taken as B cell, antibody and antigen respectively. To further improve the allocation efficiency, a thymic peptide feedback function based on movement direction of robot is defined according to the immune adjustment mechanism of thymic peptide, which realizes the self-adjustment of antibody stimulation level and antibody concentration. The simulation results show that the proposed algorithm realizes the automatic allocation for tasks, reduces the completion time, improves the operating efficiency and solves the cooperation handling well in multi-robot system.%针对多机器人系统协作中的任务分配问题,提出一种基于胸腺肽的免疫任务分配算法( TPITAA)。借鉴独特型免疫网络假设,将机器人作为B细胞,机器人行为作为抗体,机器人任务作为抗原,通过抗原与抗体间的激励和抑制机理构建免疫分配模型。为进一步提高分配效率,根据胸腺肽的免疫调节机理,定义基于机器人运动方向的胸腺肽反馈函数,实现免疫分配中的抗体激励水平及浓度自调节。仿真实验表明,新算法能实现任务的自动分配,减少任务完成时间,提高系统执行效率,较好地解决多机器人系统中的协作搬运问题。

  16. Recent results of searches for beyond Standard Model physics in ATLAS

    CERN Document Server

    Serkin, Leonid; The ATLAS collaboration

    2017-01-01

    Recent results of searches for beyond Standard Model physics in ATLAS are presented, with particular focus on searches for new phenomena in high jet multiplicity final states. No significant excess are observed and limits are set on several signal models.

  17. Cooperative Localization for Multi-Robot Incorporating Proprioceptive/Exteroceptive Position Sensors1

    OpenAIRE

    Lee, Jihong; Jo, Kyounghwan; Jang, Choulsoo

    2007-01-01

    International audience; This paper presents a new method of cooperative localization for multiple robots utilizing correlation between GPS errors of common mode in shared workspace. Assuming that GPS data of individual robot are correlated strongly as the distance between robots are close, we utilize the differential position data between the robots to refine robot's position data. Under artificial environment for simulation with imposed model error to robot motion and GPS sensor data error, ...

  18. Subspaces indexing model on Grassmann manifold for image search.

    Science.gov (United States)

    Wang, Xinchao; Li, Zhu; Tao, Dacheng

    2011-09-01

    Conventional linear subspace learning methods like principal component analysis (PCA), linear discriminant analysis (LDA) derive subspaces from the whole data set. These approaches have limitations in the sense that they are linear while the data distribution we are trying to model is typically nonlinear. Moreover, these algorithms fail to incorporate local variations of the intrinsic sample distribution manifold. Therefore, these algorithms are ineffective when applied on large scale datasets. Kernel versions of these approaches can alleviate the problem to certain degree but face a serious computational challenge when data set is large, where the computing involves Eigen/QP problems of size N × N. When N is large, kernel versions are not computationally practical. To tackle the aforementioned problems and improve recognition/searching performance, especially on large scale image datasets, we propose a novel local subspace indexing model for image search termed Subspace Indexing Model on Grassmann Manifold (SIM-GM). SIM-GM partitions the global space into local patches with a hierarchical structure; the global model is, therefore, approximated by piece-wise linear local subspace models. By further applying the Grassmann manifold distance, SIM-GM is able to organize localized models into a hierarchy of indexed structure, and allow fast query selection of the optimal ones for classification. Our proposed SIM-GM enjoys a number of merits: 1) it is able to deal with a large number of training samples efficiently; 2) it is a query-driven approach, i.e., it is able to return an effective local space model, so the recognition performance could be significantly improved; 3) it is a common framework, which can incorporate many learning algorithms. Theoretical analysis and extensive experimental results confirm the validity of this model.

  19. Searches for the standard model Higgs boson at the Tevatron

    Energy Technology Data Exchange (ETDEWEB)

    Dorigo, Tommaso; /Padua U.

    2005-05-01

    The CDF and D0 experiments at the Tevatron have searched for the Standard Model Higgs boson in data collected between 2001 and 2004. Upper limits have been placed on the production cross section times branching ratio to b{bar b} pairs or W{sup +}W{sup -} pairs as a function of the Higgs boson mass. projections indicate that the Tevatron experiments have a chance of discovering a M{sub H} = 115 GeV Higgs with the total dataset foreseen by 2009, or excluding it at 95% C.L. up to a mass of 135 GeV.

  20. Interpretation of searches for supersymmetry with simplified models

    Science.gov (United States)

    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., Jr.; 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.

    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.98fb-1. 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.

  1. Interpretation of searches for supersymmetry with simplified models

    CERN Document Server

    Chatrchyan, Serguei; Sirunyan, Albert M; Tumasyan, Armen; Adam, Wolfgang; Aguilo, Ernest; Bergauer, Thomas; Dragicevic, Marko; Erö, Janos; Fabjan, Christian; Friedl, Markus; Fruehwirth, Rudolf; Ghete, Vasile Mihai; Hörmann, Natascha; Hrubec, Josef; Jeitler, Manfred; Kiesenhofer, Wolfgang; Knünz, Valentin; Krammer, Manfred; Krätschmer, Ilse; Liko, Dietrich; Mikulec, Ivan; Pernicka, Manfred; Rabady, Dinyar; Rahbaran, Babak; Rohringer, Christine; Rohringer, Herbert; Schöfbeck, Robert; Strauss, Josef; Taurok, Anton; Waltenberger, Wolfgang; Wulz, Claudia-Elisabeth; Mossolov, Vladimir; Shumeiko, Nikolai; Suarez Gonzalez, Juan; Bansal, Monika; Bansal, Sunil; Cornelis, Tom; De Wolf, Eddi A; Janssen, Xavier; Luyckx, Sten; Mucibello, Luca; Ochesanu, Silvia; Roland, Benoit; Rougny, Romain; Selvaggi, Michele; Van Haevermaet, Hans; Van Mechelen, Pierre; Van Remortel, Nick; Van Spilbeeck, Alex; Blekman, Freya; Blyweert, Stijn; D'Hondt, Jorgen; Gonzalez Suarez, Rebeca; Kalogeropoulos, Alexis; Maes, Michael; Olbrechts, Annik; Van Doninck, Walter; Van Mulders, Petra; Van Onsem, Gerrit Patrick; Villella, Ilaria; Clerbaux, Barbara; De Lentdecker, Gilles; Dero, Vincent; Gay, Arnaud; Hreus, Tomas; Léonard, Alexandre; Marage, Pierre Edouard; Mohammadi, Abdollah; Reis, Thomas; Thomas, Laurent; Vander Velde, Catherine; Vanlaer, Pascal; Wang, Jian; Adler, Volker; Beernaert, Kelly; Cimmino, Anna; Costantini, Silvia; Garcia, Guillaume; Grunewald, Martin; Klein, Benjamin; Lellouch, Jérémie; Marinov, Andrey; Mccartin, Joseph; Ocampo Rios, Alberto Andres; Ryckbosch, Dirk; Strobbe, Nadja; Thyssen, Filip; Tytgat, Michael; Walsh, Sinead; Yazgan, Efe; Zaganidis, Nicolas; Basegmez, Suzan; Bruno, Giacomo; Castello, Roberto; Ceard, Ludivine; Delaere, Christophe; Du Pree, Tristan; Favart, Denis; Forthomme, Laurent; Giammanco, Andrea; Hollar, Jonathan; Lemaitre, Vincent; Liao, Junhui; Militaru, Otilia; Nuttens, Claude; Pagano, Davide; Pin, Arnaud; Piotrzkowski, Krzysztof; Vizan Garcia, Jesus Manuel; Beliy, Nikita; Caebergs, Thierry; Daubie, Evelyne; Hammad, Gregory Habib; Alves, Gilvan; Correa Martins Junior, Marcos; Martins, Thiago; Pol, Maria Elena; Henrique Gomes E Souza, Moacyr; Aldá Júnior, Walter Luiz; Carvalho, Wagner; Custódio, Analu; Da Costa, Eliza Melo; De Jesus Damiao, Dilson; De Oliveira Martins, Carley; Fonseca De Souza, Sandro; Malbouisson, Helena; Malek, Magdalena; Matos Figueiredo, Diego; Mundim, Luiz; Nogima, Helio; Prado Da Silva, Wanda Lucia; Santoro, Alberto; Soares Jorge, Luana; Sznajder, Andre; Vilela Pereira, Antonio; Souza Dos Anjos, Tiago; Bernardes, Cesar Augusto; De Almeida Dias, Flavia; Tomei, Thiago; De Moraes Gregores, Eduardo; Lagana, Caio; Da Cunha Marinho, Franciole; Mercadante, Pedro G; Novaes, Sergio F; Padula, Sandra; Genchev, Vladimir; Iaydjiev, Plamen; Piperov, Stefan; Rodozov, Mircho; Stoykova, Stefka; Sultanov, Georgi; Tcholakov, Vanio; Trayanov, Rumen; Vutova, Mariana; Dimitrov, Anton; Hadjiiska, Roumyana; Kozhuharov, Venelin; Litov, Leander; Pavlov, Borislav; Petkov, Peicho; Bian, Jian-Guo; Chen, Guo-Ming; Chen, He-Sheng; Jiang, Chun-Hua; Liang, Dong; Liang, Song; Meng, Xiangwei; Tao, Junquan; Wang, Jian; Wang, Xianyou; Wang, Zheng; Xiao, Hong; Xu, Ming; Zang, Jingjing; Zhang, Zhen; Asawatangtrakuldee, Chayanit; Ban, Yong; Guo, Yifei; Li, Wenbo; Liu, Shuai; Mao, Yajun; Qian, Si-Jin; Teng, Haiyun; Wang, Dayong; Zhang, Linlin; Zou, Wei; Avila, Carlos; Gomez, Juan Pablo; Gomez Moreno, Bernardo; Osorio Oliveros, Andres Felipe; Sanabria, Juan Carlos; Godinovic, Nikola; Lelas, Damir; Plestina, Roko; Polic, Dunja; Puljak, Ivica; Antunovic, Zeljko; Kovac, Marko; Brigljevic, Vuko; Duric, Senka; Kadija, Kreso; Luetic, Jelena; Mekterovic, Darko; Morovic, Srecko; Attikis, Alexandros; Galanti, Mario; Mavromanolakis, Georgios; Mousa, Jehad; Nicolaou, Charalambos; Ptochos, Fotios; Razis, Panos A; Finger, Miroslav; Finger Jr, Michael; Assran, Yasser; Elgammal, Sherif; Ellithi Kamel, Ali; Mahmoud, Mohammed; Mahrous, Ayman; Radi, Amr; Kadastik, Mario; Müntel, Mait; Raidal, Martti; Rebane, Liis; Tiko, Andres; Eerola, Paula; Fedi, Giacomo; Voutilainen, Mikko; Härkönen, Jaakko; Heikkinen, Mika Aatos; Karimäki, Veikko; Kinnunen, Ritva; Kortelainen, Matti J; Lampén, Tapio; Lassila-Perini, Kati; Lehti, Sami; Lindén, Tomas; Luukka, Panja-Riina; Mäenpää, Teppo; Peltola, Timo; Tuominen, Eija; Tuominiemi, Jorma; Tuovinen, Esa; Ungaro, Donatella; Wendland, Lauri; Banzuzi, Kukka; Karjalainen, Ahti; Korpela, Arja; Tuuva, Tuure; Besancon, Marc; Choudhury, Somnath; Dejardin, Marc; Denegri, Daniel; Fabbro, Bernard

    2013-01-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.

  2. Search for the Standard Model Higgs Boson at LEP

    CERN Document Server

    CERN. Geneva

    2002-01-01

    The four LEP collaborations, ALEPH, DELPHI, L3 and OPAL, have collected 2465 pb-1 of e+e- collision data at energies between 189 and 209 GeV, of which 542 pb-1 were collected above 206 GeV. Searches for the Standard Model Higgs boson have been performed by each of the LEP collaborations. Their data have been combined and examined for their consistency with the Standard Model background and various Standard Model Higgs boson mass hypotheses. A lower bound of 114.1 GeV has been obtained at the 95% confidence level for the mass of the Higgs boson. The likelihood analysis shows a preference for a Higgs boson with a mass of 115.6 GeV. At this mass, the probability for the background to generate the observed effect is 3.5%.

  3. Multiple Retrieval Models and Regression Models for Prior Art Search

    CERN Document Server

    Lopez, Patrice

    2009-01-01

    This paper presents the system called PATATRAS (PATent and Article Tracking, Retrieval and AnalysiS) realized for the IP track of CLEF 2009. Our approach presents three main characteristics: 1. The usage of multiple retrieval models (KL, Okapi) and term index definitions (lemma, phrase, concept) for the three languages considered in the present track (English, French, German) producing ten different sets of ranked results. 2. The merging of the different results based on multiple regression models using an additional validation set created from the patent collection. 3. The exploitation of patent metadata and of the citation structures for creating restricted initial working sets of patents and for producing a final re-ranking regression model. As we exploit specific metadata of the patent documents and the citation relations only at the creation of initial working sets and during the final post ranking step, our architecture remains generic and easy to extend.

  4. Sit-and-wait versus active-search hunting: A behavioral ecological model of optimal search mode.

    Science.gov (United States)

    Ross, Cody T; Winterhalder, Bruce

    2015-12-21

    Drawing on Skellam׳s (1958) work on sampling animal populations using transects, we derive a behavioral ecological model of the choice between sit-and-wait and active-search hunting. Using simple, biologically based assumptions about the characteristics of predator and prey, we show how an empirically definable parameter space favoring active-search hunting expands as: (1) the average rate of movement of prey decreases, or (2) the energetic costs of hunter locomotion decline. The same parameter space narrows as: (3) prey skittishness increases as a function of a hunter׳s velocity, or (4) prey become less detectable as a function of a hunter׳s velocity. Under either search tactic, encounter rate increases as a function of increasing prey velocity and increasing detection zone radius. Additionally, we investigate the roles of habitat heterogeneity and spatial auto-correlation or grouping of prey on the optimal search mode of a hunter, finding that habitat heterogeneity has the potential to complicate application of the model to some empirical examples, while the effects of prey grouping lead to relatively similar model outcomes. As predicted by the model, the introduction of the horse to the Great Plains and the introduction of the snowmobile to Arctic foraging communities decreased the metabolic costs of active-search and led to a change in normative hunting strategies that favored active-search in place of sit-and-wait hunting.

  5. Parameter Estimation of Photovoltaic Models via Cuckoo Search

    Directory of Open Access Journals (Sweden)

    Jieming Ma

    2013-01-01

    Full Text Available Since conventional methods are incapable of estimating the parameters of Photovoltaic (PV models with high accuracy, bioinspired algorithms have attracted significant attention in the last decade. Cuckoo Search (CS is invented based on the inspiration of brood parasitic behavior of some cuckoo species in combination with the Lévy flight behavior. In this paper, a CS-based parameter estimation method is proposed to extract the parameters of single-diode models for commercial PV generators. Simulation results and experimental data show that the CS algorithm is capable of obtaining all the parameters with extremely high accuracy, depicted by a low Root-Mean-Squared-Error (RMSE value. The proposed method outperforms other algorithms applied in this study.

  6. Direct search for the Standard Model Higgs boson

    Science.gov (United States)

    Janot, Patrick; Kado, Marumi

    2002-11-01

    For twelve years, LEP revolutionized the knowledge of electroweak symmetry breaking within the standard model, and the direct discovery of the Higgs boson would have been the crowning achievement. Searches at the Z resonance and above the W +W - threshold allowed an unambiguous lower limit on the mass of the standard model Higgs boson to set be at 114.1 GeV· c-2. After years of efforts to push the LEP performance far beyond the design limits, hints of what could be the first signs of the existence of a 115 GeV· c-2 Higgs boson appeared in June 2000, were confirmed in September, and were then confirmed again in November. An additional six-month period of LEP operation was enough to provide a definite answer, with an opportunity to make a fundamental discovery of prime importance. To cite this article: P. Janot, M. Kado, C. R. Physique 3 (2002) 1193-1202.

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

  8. Antecedents and Outcomes of Search Engines Loyalty: Designing a model of Iranian Users Loyalty

    Directory of Open Access Journals (Sweden)

    Alireza Hadadian

    2013-09-01

    Full Text Available This paper aims to design proposed model for search engine designers to promote loyalty levels of search engine users. This is a descriptive survey study. The statistical population of the research is composed of Ferdowsi University students. The sample size estimated to be 347. Data gathering instrument was a self administered questionnaire and structural equation modeling (SEM is used for the data analysis. Findings indicate that user communication affects user satisfaction significantly and negatively. Also in research final model search engine image, search engine perceived quality and search engine perceived value affects user satisfaction. Moreover, search engine perceived value affects user loyalty and verbal advertising directly. Also user satisfaction affects user loyalty directly. Finally user loyalty leads into high expected switching costs, search engine revisit and verbal advertising for search engines.

  9. Thermal Image Sensing Model for Robotic Planning and Search

    Science.gov (United States)

    Castro Jiménez, Lídice E.; Martínez-García, Edgar A.

    2016-01-01

    This work presents a search planning system for a rolling robot to find a source of infra-red (IR) radiation at an unknown location. Heat emissions are observed by a low-cost home-made IR passive visual sensor. The sensor capability for detection of radiation spectra was experimentally characterized. The sensor data were modeled by an exponential model to estimate the distance as a function of the IR image’s intensity, and, a polynomial model to estimate temperature as a function of IR intensities. Both theoretical models are combined to deduce a subtle nonlinear exact solution via distance-temperature. A planning system obtains feed back from the IR camera (position, intensity, and temperature) to lead the robot to find the heat source. The planner is a system of nonlinear equations recursively solved by a Newton-based approach to estimate the IR-source in global coordinates. The planning system assists an autonomous navigation control in order to reach the goal and avoid collisions. Trigonometric partial differential equations were established to control the robot’s course towards the heat emission. A sine function produces attractive accelerations toward the IR source. A cosine function produces repulsive accelerations against the obstacles observed by an RGB-D sensor. Simulations and real experiments of complex indoor are presented to illustrate the convenience and efficacy of the proposed approach. PMID:27509510

  10. Thermal Image Sensing Model for Robotic Planning and Search.

    Science.gov (United States)

    Castro Jiménez, Lídice E; Martínez-García, Edgar A

    2016-08-08

    This work presents a search planning system for a rolling robot to find a source of infra-red (IR) radiation at an unknown location. Heat emissions are observed by a low-cost home-made IR passive visual sensor. The sensor capability for detection of radiation spectra was experimentally characterized. The sensor data were modeled by an exponential model to estimate the distance as a function of the IR image's intensity, and, a polynomial model to estimate temperature as a function of IR intensities. Both theoretical models are combined to deduce a subtle nonlinear exact solution via distance-temperature. A planning system obtains feed back from the IR camera (position, intensity, and temperature) to lead the robot to find the heat source. The planner is a system of nonlinear equations recursively solved by a Newton-based approach to estimate the IR-source in global coordinates. The planning system assists an autonomous navigation control in order to reach the goal and avoid collisions. Trigonometric partial differential equations were established to control the robot's course towards the heat emission. A sine function produces attractive accelerations toward the IR source. A cosine function produces repulsive accelerations against the obstacles observed by an RGB-D sensor. Simulations and real experiments of complex indoor are presented to illustrate the convenience and efficacy of the proposed approach.

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

    CERN Document Server

    Aaltonen, T; Adelman, J; Akimoto, T; Albrow, M G; Alvarez-Gonzalez, B; Amerio, S; Amidei, D; Anastassov, A; Annovi, A; Antos, J; Apollinari, G; Apresyan, A; Arisawa, T; Artikov, A; Ashmanskas, W; Aurisano, A; Azfar, F; Azzi-Bacchetta, P; Azzurri, P; Bacchetta, N; Badgett, W; 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; Berry, T; Bhatti, A; Binkley, M; Bisello, D; Bizjak, I; Blair, R E; Blocker, C; Blumenfeld, B; Bocci, A; Bodek, A; Boisvert, V; Bölla, G; Bolshov, A; Bortoletto, D; Boudreau, J; Boveia, A; Brau, B; Brigliadori, L; Bromberg, C; Brubaker, E; Budagov, Yu A; Budd, H S; Budd, S; Burkett, K; Busetto, G; Bussey, P; Buzatu, A; Byrum, K L; Cabrerar, S; Campanelli, M; Campbell, M; Canelli, F; Canepa, A; Carlsmith, D; Carosi, R; Carrillol, S; Carron, S; Casal, B; Casarsa, M; Castro, A; Catastini, P; Cauz, D; Cerri, A; Cerritop, 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; Cuenca Almenarr, C; Cuevaso, J; Culbertson, R; Cully, J C; Dagenhart, D; Datta, M; Davies, T; De Barbaro, P; De Cecco, S; Deisher, A; De Lentdeckerd, G; Dell'Orso, Mauro; Demortier, L; Deng, J; Deninno, M; De Pedis, D; Derwent, P F; Di Giovanni, G P; Dionisi, C; Di Ruzza, B; Dittmann, J R; 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; Fernández, 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; García, J E; Garfinkel, A F; Gerberich, H; Gerdes, D; Giagu, S; Giannetti, P; Gibson, K; Gimmell, J L; Ginsburg, C; Giokarisa, N; Giordani, M; Giromini, P; Giunta, M; Glagolev, V; Glenzinski, D; Gold, M; Goldschmidt, N; Goldsteinc, J; Golossanov, A; Gómez, G; Gómez-Ceballos, G; Goncharov, M; Gonzlez, O; Gorelov, I; Goshaw, A T; Goulianos, K; Gresele, A; Grinstein, S; Grosso-Pilcher, C; Group, R C; Grundler, U; Guimaraesda Costa, J; Gunay-Unalan, Z; 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; Heinrich, J; Henderson, C; Herndon, M; Heuser, J; Hewamanage, S; Hidas, D; Hillc, C S; Hirschbuehl, D; Höcker, 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; Lancaster, M; Lander, R L; Lannon, K; Lath, A; Latino, G; Lazzizzera, I; Le Compte, T; Lee, J; Lee, J; Lee, Y J; Leeq, S W; Lefèvre, R; Leonardo, N; Leone, S; Levy, S; Lewis, J D; Lin, C; 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; Lysak, R; Lytken, E; Mack, P; MacQueen, D; Madrak, R; Maeshima, K; Makhoul, K; Mäki, T; Maksimovic, P; Malde, S; Malik, S; Manousakisa, A; Margaroli, F; Marino, C; Marino, C P; Martin, A; Martin, M; Martinj, V; Martinez-Ballarin, R; Maruyama, T; Mastrandrea, P; Masubuchi, T; Mattson, M E; Mazzanti, P; McFarland, K S; McIntyre, P; McNultyi, R; Mehta, A; Mehtälä, P; Menzemerk, 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; Movilla-Fernández, P A; Mrenna, S; Mulmenstdt, J; Mukherjee, A; Müller, T; 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; Nodulman, L; Norman, M; Norniella, O; Nurse, E; Oh, S H; Oh, Y D; Oksuzian, I; Okusawa, T; Orava, R; Österberg, 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, Aldo L; Phillips, T J; Piacentino, G; Piedra, J; Pinera, L; Pitts, K; Plager, C; Pondrom, L; Poukhov, O; Pounder, N; Prakoshyn, F; Pronko, A; Proudfoot, J; Ptohosh, F; Punzi, G; Pursley, J; Rademackerc, J; Rahaman, A; Ramakrishnan, V; Ranjan, N; Redondo, I; Reisert, B; Rekovic, V; Renton, P B; Rescigno, M; Richter, S; Rimondi, F; Ristori, L; Robson, A; Rodrigo, T; Rogers, E; Roser, R; Rossi, M; Rossin, R; Roy, P; Ruiz, A; Russ, J; Rusu, V; Saarikko, H; Safonov, A; Sakumoto, W K; Salamanna, G; Santi, L; Sarkar, S; Sartori, L; Sato, K; Savard, P; Savoy-Navarro, A; Scheidle, T; Schlabach, P; Schmidt, E E; 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 G; Shepard, P F; Sherman, D; Shimojiman, M; Shochet, M; Shon, Y; Shreyber, I; Sidoti, A; Sinervo, P; Sisakian, A; Slaughter, A J; Slaunwhite, J; Sliwa, K; Smith, J R; Snider, F D; Snihur, R; Söderberg, M; Soha, A; Somalwar, S; Sorin, V; Spalding, J; Spinella, F; Spreitzer, T; Squillacioti, P; Stanitzki, M; Saint-Denis, R; Stelzer, B; Stelzer-Chilton, O; Stentz, D; Strologas, J; Stuart, D; Suh, J S; Sukhanov, A; Sun, H; Suslov, I; Suzuki, T; Taffarde, A; Takashima, R; Takeuchi, Y; Tanaka, R; Tecchio, M; Teng, P K; Terashi, K; Thomg, 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; Vzquezl, F; Velev, G; Vellidisa, C; Veszpremi, V; Vidal, M; Vidal, R; Vila, I; Vilar, R; Vine, T; Vogel, M; Volpi, G; Würthwein, F; Wagner, P; Wagner, R G; Wagner, R L; Wagner, J; Wagner, W; Wallny, R; Wang, S M; Warburton, A; Waters, D; Weinberger, M; Wester, W C; Whitehouse, B; Whitesone, D; Wicklund, A B; Wicklund, E; Williams, G; Williams, H H; Wilson, P; Winer, B L; Wittichg, P; Wolbers, S; Wolfe, C; Wright, T; Wu, X; Wynne, S M; Xie, S; Yagil, A; Yamamoto, K; Yamaoka, J; Yamashita, T; Yang, C; Yangm, 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; Zhengb, Y; Zucchelli, S

    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 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 three hundred exclusive final states in 927 pb^-1 of ppbar collisions at sqrt(s)=1.96 TeV reveals no such significant indication of physics beyond the standard model.

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

    Science.gov (United States)

    Aaltonen, T.; Abulencia, A.; Adelman, J.; Akimoto, T.; Albrow, M. G.; González, B. Álvarez; Amerio, S.; Amidei, D.; Anastassov, A.; Annovi, A.; Antos, J.; Apollinari, G.; Apresyan, A.; Arisawa, T.; Artikov, A.; Ashmanskas, W.; Aurisano, A.; Azfar, F.; Azzi-Bacchetta, P.; Azzurri, P.; Bacchetta, N.; Badgett, W.; 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.; 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.; 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.; 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.; 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.; 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.; Giannetti, P.; Gibson, K.; Gimmell, J. L.; Ginsburg, C.; Giokaris, N.; Giordani, M.; Giromini, P.; Giunta, M.; Glagolev, V.; Glenzinski, D.; Gold, M.; Goldschmidt, N.; Goldstein, J.; 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.; da Costa, J. Guimaraes; Gunay-Unalan, Z.; 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.; 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.; 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.; 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.; Lysak, R.; Lytken, E.; Mack, P.; MacQueen, D.; Madrak, R.; Maeshima, K.; Makhoul, K.; Maki, T.; Maksimovic, P.; Malde, S.; Malik, S.; Manousakis, A.; Margaroli, F.; Marino, C.; Marino, C. P.; Martin, A.; Martin, M.; Martin, V.; 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; Mrenna, S.; 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.; Nodulman, L.; Norman, M.; Norniella, O.; Nurse, E.; Oh, S. H.; Oh, Y. D.; Oksuzian, I.; Okusawa, T.; 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.; 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.; Roser, R.; Rossi, M.; Rossin, R.; Roy, P.; Ruiz, A.; Russ, J.; Rusu, V.; Saarikko, H.; Safonov, A.; Sakumoto, W. K.; Salamanna, G.; Santi, L.; Sarkar, S.; Sartori, L.; Sato, K.; Savoy-Navarro, A.; Scheidle, T.; Schlabach, P.; Schmidt, E. E.; 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.; Shochet, M.; Shon, Y.; Shreyber, I.; Sidoti, A.; 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.; Denis, R. St.; 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.; 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.; Volpi, G.; Würthwein, F.; Wagner, P.; Wagner, R. G.; Wagner, R. L.; Wagner, J.; Wagner, W.; Wallny, R.; Wang, S. M.; Warburton, A.; Waters, D.; Weinberger, M.; Wester, W. C., III; 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.; 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.

    2008-07-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 927pb-1 of p pmacr collisions at s=1.96TeV reveals no such significant indication of physics beyond the standard model.

  13. 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…

  14. 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.

  15. A Strategy Tackling Local Minimum of Direct Search Method in Modeling a Hydraulic Actuator

    Institute of Scientific and Technical Information of China (English)

    刘云山; 陈晓辉

    2013-01-01

    A strategy for attacking the local minimum problem of direct search method is developed for modeling a hydraulic actuator. The Nelder-Mead direct search method is combined with Ordinary Least Squares which can used to optimize the parameters which the model function is in linear with. The model fitting results show that this strategy can reach a solution more close to the global minimum than the Nelder-Mead direct search method used alone.

  16. Cluster based hierarchical resource searching model in P2P network

    Institute of Scientific and Technical Information of China (English)

    Yang Ruijuan; Liu Jian; Tian Jingwen

    2007-01-01

    For the problem of large network load generated by the Gnutella resource-searching model in Peer to Peer (P2P) network, a improved model to decrease the network expense is proposed, which establishes a duster in P2P network,auto-organizes logical layers, and applies a hybrid mechanism of directional searching and flooding. The performance analysis and simulation results show that the proposed hierarchical searching model has availably reduced the generated message load and that its searching-response time performance is as fairly good as that of the Gnutella model.

  17. A two-stage model for blog feed search

    NARCIS (Netherlands)

    Weerkamp, W.; Balog, K.; de Rijke, M.

    2010-01-01

    We consider blog feed search: identifying relevant blogs for a given topic. An individual's search behavior often involves a combination of exploratory behavior triggered by salient features of the information objects being examined plus goal-directed in-depth information seeking behavior. We presen

  18. Image dataset for testing search and detection models

    NARCIS (Netherlands)

    Toet, A.; Bijl, P.; Valeton, J.M.

    2001-01-01

    The TNO Human Factors Searchû2 image dataset consists of: a set of 44 high-resolution digital color images of different complex natural scenes, the ground truth corresponding to each of these scenes, and the results of psychophysical experiments on each of these images. The images in the Searchû2 da

  19. A two-stage model for blog feed search

    NARCIS (Netherlands)

    Weerkamp, W.; Balog, K.; de Rijke, M.

    2010-01-01

    We consider blog feed search: identifying relevant blogs for a given topic. An individual's search behavior often involves a combination of exploratory behavior triggered by salient features of the information objects being examined plus goal-directed in-depth information seeking behavior. We

  20. 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; Åkesson, P F; Alexander, G; Allison, J; Amaral, P; Anagnostou, G; Anderson, K J; Asai, S; Axen, D A; Bailey, I; Barberio, E; Barillari, T; Barlow, R J; Batley, J Richard; Bechtle, P; Behnke, T; Bell, K W; Bell, P J; Bella, G; Bellerive, A; Benelli, G; Bethke, Siegfried; Biebel, O; Boeriu, O; Bock, P; Boutemeur, M; Braibant, S; Brown, R 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, Klaus; Dienes, B; Donkers, M; Dubbert, J; Duchovni, E; Duckeck, G; Duerdoth, I P; Etzion, E; Fabbri, Franco Luigi; Ferrari, P; Fiedler, F; Fleck, I; Ford, M; Frey, A; Gagnon, P; Gary, J W; Geich-Gimbel, C; Giacomelli, G; Giacomelli, P; Giunta, M; Goldberg, J; Gross, E; Grunhaus, Jacob; Gruwé, M; Günther, P O; Sen-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, K; Horváth, D; Igo-Kemenes, P; Ishii, K; Jeremie, H; Jovanovic, P; Junk, T R; Kanzaki, J; Karlen, Dean A; 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, J H; Krogh, A; Kühl, T; Kupper, M; Lafferty, G D; Landsman, Hagar Yaël; Lanske, D; Lellouch, D; Letts, J; Levinson, L; Lillich, J; Lloyd, S L; Loebinger, F K; Lü, J; Ludwig, A; Ludwig, J; Mader, W; Marcellini, S; Martin, A J; Masetti, G; Mashimo, T; Mättig, P; McKenna, J A; McPherson, R A; Meijers, F; Menges, W; Merritt, F S; Mes, H; Meyer, N; 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; Pásztor, G; Pater, J R; Pilcher, J E; Pinfold, J L; Plane, D E; Pooth, O; Przybycien, M B; Quadt, A; Rabbertz, K; Rembser, C; Renkel, P; Roney, J M; Rossi, A M; Rozen, Y; Runge, K; Sachs, K; Saeki, T; Sarkisyan-Grinbaum, E; Schaile, A D; Schaile, O; Scharff-Hansen, P; Schieck, J; Schörner-Sadenius, T; Schröder, M; Schumacher, M; Seuster, R; Shears, T G; Shen, B C; Sherwood, P; Skuja, A; Smith, A M; Sobie, R J; Söldner-Rembold, S; Spanó, F; Stahl, A; Strom, D; Ströhmer, R; Tarem, S; Tasevsky, M; Teuscher, R; Thomson, M A; Torrence, E; Toya, D; Tran, P; Trigger, I; Trócsányi, Z L; Tsur, E; Turner-Watson, M F; Ueda, I; Ujvári, B; Vollmer, C F; Vannerem, P; Vertesi, R; Verzocchi, M; Voss, H; Vossebeld, Joost Herman; 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, L

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

  1. Modeling the Chi-square veto in the inspiral searches

    Science.gov (United States)

    Biswas, Rahul; LIGO Collaboration

    2011-04-01

    Chi-square discriminatory veto is a computationally expensive signal based veto as it requires lots of computing time. This veto is applied to the triggers surviving the second stage of the pipeline in the inspiral searches. We shall make an attempt to understand the nature of this veto and whether we can predict the chi-square values of triggers surviving this computationally expensive veto. This veto helps us to discriminate real signals from those arising due to noise transients by measuring the goodness of fit quantity. We discuss here two separate approaches. One is purely analytical which is based on the power accumulated in a given frequency bin due to the presence of non-stationary and non-Gaussian noise. We know that sum of squares of Gaussian random variables follow a central chi-square distribution whereas in case on non-Gaussian noise they obey a non-central chi-square distribution and hence the mean value has a contribution from central part non-central parameter λ. We shall show that this non-central parameter λ is a function of signal to noise ratio (SNR) of the triggers. Thus enabling us to model the expected chi-square values of the triggers using the SNR. The second approach I will talk involves trying to obtain a parabolic fit to the measured chi-squared distribution for a range of values as a function of signal to noise ratio.

  2. Application of ARIMA(1,1,0 Model for Predicting Time Delay of Search Engine Crawlers

    Directory of Open Access Journals (Sweden)

    Jeeva JOSE

    2013-01-01

    Full Text Available World Wide Web is growing at a tremendous rate in terms of the number of visitors and number of web pages. Search engine crawlers are highly automated programs that periodically visit the web and index web pages. The behavior of search engines could be used in analyzing server load, quality of search engines, dynamics of search engine crawlers, ethics of search engines etc. The more the number of visits of a crawler to a web site, the more it contributes to the workload. The time delay between two consecutive visits of a crawler determines the dynamicity of the crawlers. The ARIMA(1,1,0 Model in time series analysis works well with the forecasting of the time delay between the visits of search crawlers at web sites. We considered 5 search engine crawlers, all of which could be modeled using ARIMA(1,1,0.The results of this study is useful in analyzing the server load.

  3. Personalized Search Based on Context-Centric Model

    Directory of Open Access Journals (Sweden)

    Mingyang Liu

    2013-07-01

    Full Text Available With the rapid development of the World Wide Web, huge amount of data has been growing exponentially in our daily life. Users will spend much more time on searching the information they really need than before. Even when they make the exactly same searching input, different users would have various goals. Otherwise, users commonly annotate the information resources or make search query according to their own behaviors. As a matter of fact, this process will bring fuzzy results and be time-consuming. Based on the above problems, we propose our methodology that to combine user’s context, users’ profile with users’ Folksonomies together to optimize personal search. At the end of this paper, we make an experiment to evaluate our methodology and from which we can conclude that our work performs better than other samples.

  4. A Modular Simulation Framework for Assessing Swarm Search Models

    Science.gov (United States)

    2014-09-01

    Simulink . American Institute of Aeronautics and Astronautics, 2011. [31] MathWorks. (2014, Jun. 25). Strategies for efficient use of memory - MATLAB ... Simulink . [Online]. Available: http://www.mathworks.com/help/ matlab / matlab \\ _prog/strategies-for-efficient-use-of-memory.html [32] J. P. C. Kleijnen, S. M...explored utilizing today’s search decision support and analysis tools. This thesis develops a framework in MATLAB that allows the investigation of search

  5. Scene analysis for effective visual search in rough three-dimensional-modeling scenes

    Science.gov (United States)

    Wang, Qi; Hu, Xiaopeng

    2016-11-01

    Visual search is a fundamental technology in the computer vision community. It is difficult to find an object in complex scenes when there exist similar distracters in the background. We propose a target search method in rough three-dimensional-modeling scenes based on a vision salience theory and camera imaging model. We give the definition of salience of objects (or features) and explain the way that salience measurements of objects are calculated. Also, we present one type of search path that guides to the target through salience objects. Along the search path, when the previous objects are localized, the search region of each subsequent object decreases, which is calculated through imaging model and an optimization method. The experimental results indicate that the proposed method is capable of resolving the ambiguities resulting from distracters containing similar visual features with the target, leading to an improvement of search speed by over 50%.

  6. Demeter, persephone, and the search for emergence in agent-based models.

    Energy Technology Data Exchange (ETDEWEB)

    North, M. J.; Howe, T. R.; Collier, N. T.; Vos, J. R.; Decision and Information Sciences; Univ. of Chicago; PantaRei Corp.; Univ. of Illinois

    2006-01-01

    In Greek mythology, the earth goddess Demeter was unable to find her daughter Persephone after Persephone was abducted by Hades, the god of the underworld. Demeter is said to have embarked on a long and frustrating, but ultimately successful, search to find her daughter. Unfortunately, long and frustrating searches are not confined to Greek mythology. In modern times, agent-based modelers often face similar troubles when searching for agents that are to be to be connected to one another and when seeking appropriate target agents while defining agent behaviors. The result is a 'search for emergence' in that many emergent or potentially emergent behaviors in agent-based models of complex adaptive systems either implicitly or explicitly require search functions. This paper considers a new nested querying approach to simplifying such agent-based modeling and multi-agent simulation search problems.

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

  8. Integrating Domain Knowledge Differences into Modeling User Clicks on Search Result Pages

    NARCIS (Netherlands)

    Karanam, S.; van Oostendorp, H.

    2016-01-01

    Computational cognitive models developed so far do not incorporate any effect of individual differences in domain knowledge of users 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

  9. The probit choice model under sequential search with an application to online retailing

    NARCIS (Netherlands)

    Bronnenberg, Bart; Kim, Jun B.; Albuquerque, P.

    2016-01-01

    We develop a probit choice model under optimal sequential search and apply it to the study of aggregate demand of consumer durable goods. In our joint model of search and choice, we derive a semi-closed form expression for the probability of choice that obeys the full set of restrictions imposed by

  10. Searches for h(125) properties beyond the Standard Model at the CMS experiment

    CERN Document Server

    Lenz, Teresa

    2017-01-01

    The discovered Higgs boson with a mass of 125\\,GeV exhibits properties which are all in agreement with Standard Model predictions. However, the corresponding measurements still allow for a considerable non-Standard Model behavior of the h(125). Beyond Standard Model properties can show up in non-Standard Model decays of the h(125) or in anomalous couplings of the Higgs boson. This article presents four different analyses done at the CMS experiment with 2012 and 2016 data that search for properties of the discovered Higgs boson beyond the Standard Model. These include a search for lepton flavor violating Higgs decays, a search for decays of the h(125) to light Higgs bosons, a search for anomalous contributions to the Higgs trilinear self-coupling, and finally a search for anomalous couplings of the h(125) to vector bosons.

  11. A new model of information behaviour based on the Search Situation Transition schema Information searching, Information behaviour, Behavior, Information retrieval, Information seeking

    Directory of Open Access Journals (Sweden)

    Nils Pharo

    2004-01-01

    Full Text Available This paper presents a conceptual model of information behaviour. The model is part of the Search Situation Transition method schema. The method schema is developed to discover and analyse interplay between phenomena traditionally analysed as factors influencing either information retrieval or information seeking. In this paper the focus is on the model's five main categories: the work task, the searcher, the social/organisational environment, the search task, and the search process. In particular, the search process and its sub-categories search situation and transition and the relationship between these are discussed. To justify the method schema an empirical study was designed according to the schema's specifications. In the paper a subset of the study is presented analysing the effects of work tasks on Web information searching. Findings from this small-scale study indicate a strong relationship between the work task goal and the level of relevance used for judging resources during search processes.

  12. 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.

  13. Tenure, Experience, Human Capital and Wages: A Tractable Equilibrium Search Model of Wage Dynamics

    OpenAIRE

    Bagger, Jesper; Fontaine, François; Postel-Vinay, Fabien; Robin, Jean-Marc

    2011-01-01

    We develop and estimate an equilibrium job search model of worker careers, allowing for human capital accumulation, employer heterogeneity and individual-level shocks. Career wage growth is decomposed into the contributions of human capital and job search, within and between jobs. Human capital accumulation is largest for highly educated workers, and both human capital accumulation and job search contribute to the observed concavity of wage-experience profiles. The contribution from job searc...

  14. Search for the Standard Model Higgs Boson in the $WH \\to \\ell \

    Energy Technology Data Exchange (ETDEWEB)

    Nagai, Yoshikazu [Univ. of Tsukuba (Japan)

    2010-02-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.

  15. 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.

  16. Using Intent Information to Model User Behavior in Diversified Search

    NARCIS (Netherlands)

    A. Chuklin; P. Serdyukov; M. de Rijke

    2013-01-01

    A result page of a modern commercial search engine often contains documents of different types targeted to satisfy different user intents (news, blogs, multimedia). When evaluating system performance and making design decisions we need to better understand user behavior on such result pages. To addr

  17. The Effects of Level of Autonomy on Human-Agent Teaming for Multi-Robot Control and Local Security Maintenance

    Science.gov (United States)

    2013-11-01

    Zelinsky, G. J.; Sheinberg, D. L. Eye Movements During Parallel– Serial Visual Search. Journal of Experimental Psychology: Human Perception and Performance...usa savatal softo..,.’S!a pad:ag: s 7 . Ata you in your good! comfortab le stat: of health physically? Y’ES NO If NO, p lease briefly exp lain: S

  18. 多机器人动态避碰及抬箱编队仿真研究%Simulation research on multi-robot dynamic collision avoidance and carrying-box formation

    Institute of Scientific and Technical Information of China (English)

    李佩林; 李志春

    2011-01-01

    Foraging,pushing box and formation are several classic forms of tasks in multi robot system. It proposed a new task form for the multi-robot,I.e.carrying box task,which is expanded from foraging, pushing and formation tasks and application fie Id is very broad.Various reactive behaviors of multi-robot were designed and multi-robot dynamic collision avoidance was realized;Meanwhile an algorithm for carrying box formation around edge of fixed object was represented,which is designed with scalabilityAfier observing and studying in detail collision situation between robots,dynamic collision avoidance among robots is realized according to general strategy of human collision.Simulation results verified that the algorithm is feasible.%觅食、推箱以及编队是多机器人系统研究中的经典任务形式,提出的新的多机器人任务:抬箱任务是由觅食、推箱以及编队等任务拓展而来,适用领域非常广阔.设计了多机器人在动态环境中的各种反应行为,实现了多机器人之间的动态避碰;提出了围绕固定物体边缘形成抬箱队形的算法,该算法的设计具有可扩展性,详细考察了机器人之间发生碰撞的情形,并根据人类避碰的一般策略完全实现了机器人之间的动态避碰.仿真结果证实了算法的可行性.

  19. 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.

  20. Search for Standard Model Higgs in WH->lvbb at the Tevatron

    CERN Document Server

    Price, Darren D

    2009-01-01

    We present a search for the Standard Model Higgs boson produced in association with a W boson in $p\\bar{p}$ collisions at a center-of-mass energy of $\\sqrt{s} = 1.96$ TeV. The search is performed in the $WH\\to \\ell\

  1. A model for the evaluation of search queries in medical bibliographic sources

    NARCIS (Netherlands)

    Verhoeven, A A; Boendermaker, P M; Boerma, Edzard J.; Meyboom-de Jong, B

    1999-01-01

    The aim of this study was to develop a model to evaluate the retrieval quality of search queries performed by Dutch general practitioners using the printed Index Medicus, MEDLINE on CD-ROM, and MEDLINE through GRATEFUL MED. Four search queries related to general practice were formulated for a contin

  2. Searches for physics beyond the Standard Model using jet-based resonances with the ATLAS Detector

    CERN Document Server

    Frate, Meghan; The ATLAS collaboration

    2016-01-01

    Run2 of the LHC, with its increased center-of-mass energy, is an unprecedented opportunity to discover physics beyond the Standard Model. One interesting possibility to conduct such searches is to use resonances based on jets. The latest search results from the ATLAS experiment, based on either inclusive or heavy-flavour jets, will be presented.

  3. Adult Participation in Children's Word Searches: On the Use of Prompting, Hinting, and Supplying a Model

    Science.gov (United States)

    Radford, Julie

    2010-01-01

    Although word searching in children is very common, very little is known about how adults support children in the turns following the child's search behaviours, an important topic because of the social, educational, and clinical implications. This study characterizes, in detail, teachers' use of prompting, hinting, and supplying a model. From a…

  4. Search for Physics Beyond the Standard Model at BaBar and Belle

    Directory of Open Access Journals (Sweden)

    Calderini G.

    2012-06-01

    Full Text Available Recent results on the search for new physics at BaBar and Belle B-factories are presented. The search for a light Higgs boson produced in the decay of different γ resonances is shown. In addition, recent measurements aimed to discover invisible final states produced by new physics mechanisms beyond the standard model are presented.

  5. Modeling Rich Interactions in Session Search - Georgetown University at TREC 2014 Session Track

    Science.gov (United States)

    2014-11-01

    iterations triggered by query reformulations to accomplish a complex search task. In our groups’ 2013 work [1], we model this interactive process of session...algorithm is set as Language Modeling with Dirichlet smoothing. The smoothing parameter mu is set as 5000. In RL2, we adopt QCM algorithm [1] where we...hoc Retrieval Model (Ad-hoc) Our RL1 approach directly uses the current query of each session as search terms. The retrieval algorithm is Language

  6. Model-based systems engineering in the execution of search and rescue operations

    OpenAIRE

    Hunt, Spencer S.

    2015-01-01

    Approved for public release; distribution is unlimited Complex systems engineering problems require robust modeling early in the design process in order to analyze crucial design requirements and interactions. This thesis emphasizes the need for such modeling through multiple model-based systems engineering techniques as they apply to the execution of search and rescue. Through the development of a design reference mission, this thesis illustrates how a search and rescue architecture can u...

  7. Game theory based task allocation algorithm for multi-robot systems%基于博弈论的多机器人系统任务分配算法

    Institute of Scientific and Technical Information of China (English)

    黎萍; 杨宜民

    2013-01-01

    Considering to dependences between robots, this paper introduced main idea of game theory to depict multi-robot system task allocation which afforded a new mathematic description way for solving task allocation. To the relationships between strategies of robots, it analyzed multi-robot system task allocation based on game theory, and proposed a game theory based task allocation algorithm for multi-robot systems (GT-MRTA). Simulation experiment shows that GT-MRTA has low complexity, and needs less computation. It has good robustness for communication failure and can help to getting task allocation schemes with high quality.%对多机器人系统任务分配策略进行了形式化描述,为任务分配方案的求解提供了一种数学描述工具;针对多机器人系统中机器人决策之间的相互依存性,引入博弈论的思想分析了多机器人系统的任务分配问题,提出了一种基于博弈论的多机器人系统任务分配算法(GT-MRTA).实验结果表明,算法复杂度较低,计算量较小,鲁棒性较好,获得的任务分配方案质量较高.

  8. The Multi-Robot Task Allocation Study Based on Improved Ant Colony Algorithm%基于改进蚁群算法的多机器人任务分配

    Institute of Scientific and Technical Information of China (English)

    曹宗华; 吴斌; 黄玉清; 邓春艳

    2013-01-01

    This paper researches the multi-robot system' s task allocating process, which is a NP problem. In order to solve the best task allocating problem of the multi-robot system, an improved Ant Colony Algorithm is used in allusion to the multi-robot system autonomously task allocating problem in a dynamic environment, considered the task restricting and robot ability. The improved algorithm achieving overall situation approximation optimal task allocation is verified by simulation based on the basic Ant Colony Algorithm and the improved algorithm.%研究了多机器人系统的任务分配方法,多机器人多任务分配是一个NP问题.针对多机器人系统在动态环境下自主任务分配问题,综合考虑任务约束及机器人的执行任务能力,采用了一种改进的蚁群算法,解决多机器人系统全局最优任务分配问题.通过对基本蚁群算法和改进的算法的仿真,验证了改进的算法实现了全局近似最优的任务分配.

  9. Dynamics of the job search process: developing and testing a mediated moderation model.

    Science.gov (United States)

    Sun, Shuhua; Song, Zhaoli; Lim, Vivien K G

    2013-09-01

    Taking a self-regulatory perspective, we develop a mediated moderation model explaining how within-person changes in job search efficacy and chronic regulatory focus interactively affect the number of job interview offers and whether job search effort mediates the cross-level interactive effects. A sample of 184 graduating college students provided monthly reports of their job search activities over a period of 8 months. Findings supported the hypothesized relationships. Specifically, at the within-person level, job search efficacy was positively related with the number of interview offers for job seekers with strong prevention focus and negatively related with the number of interview offers for job seekers with strong promotion focus. Results show that job search effort mediated the moderated relationships. Findings enhance understandings of the complex self-regulatory processes underlying job search. PsycINFO Database Record (c) 2013 APA, all rights reserved

  10. A Sorting Method of Meta-search Based on User Web Page Interactive Model

    Institute of Scientific and Technical Information of China (English)

    Zongli Jiang; Tengyu Zhang

    2012-01-01

    Nowadays, there is a problem in most meta-search engines that many web pages searched have nothing to do with users' expectations. We introduce a new user web page interactive model under the framework ofmeta search, which analyzes users' action to get users' interests and storages them, and update these information with users' feedback. Meanwhile this model analyzes user records stored in web, attaches labels to the web page with statistics of user interest. We calculate the similarity about user and web page with the information from model and add similarity to scores of web pages. The experimental results reveal that this method can improve the relevance of the information retrieval.

  11. Neutral Higgs bosons in the standard model and in the minimal supersymmetric model: Searches at LEP

    Indian Academy of Sciences (India)

    P Igo-Kemenes

    2004-03-01

    During the twelve years of operation of the $e^{+}e^{-}$ collider LEP, the associated collaborations, ALEPH, DELPHI, L3 and OPAL, have extensively searched for Higgs bosons over a broad range of masses. We present the final results from LEP for the standard model Higgs boson which are obtained from a statistical combination of the data from the four experiments. We also present preliminary combined results for neutral Higgs bosons in the minimal supersymmetric model (MSSM) where the Higgs sector is assumed to be CP invariant. Finally, we discuss an alternative MSSM scenario including CP violation in the Higgs sector.

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

    Indian Academy of Sciences (India)

    Alberto Annovi; for the CDF and D0 Collaborations

    2012-10-01

    During the last 10 years, the Fermilab Tevatron has produced $p \\bar{p}$ collision at 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. Here, recent updates of new physics searches are reported using a data sample of up to 9 fb-1

  13. Some Notes on Search, Detection and Localization Modeling

    Science.gov (United States)

    1975-04-01

    px3gramming problem for which thea solution set is: 25 16.. 111 . -~i(1/X) I (A./W.)ln p. + k./1 i in 02 . piop 0 i not in Q wherc A F A{MW and = l,2...Region 1. This will be assumed to be effectively consistent with the prescription deter- mined by the formula for piop given AX. If this search is

  14. Intelligent-based multi-robot path planning inspired by improved classical Q-learning and improved particle swarm optimization with perturbed velocity

    Directory of Open Access Journals (Sweden)

    P.K. Das

    2016-03-01

    Full Text Available Classical Q-learning takes huge computation to calculate the Q-value for all possible actions in a particular state and takes large space to store its Q-value for all actions, as a result of which its convergence rate is slow. This paper proposed a new methodology to determine the optimize trajectory of the path for multi-robots in clutter environment using hybridization of improving classical Q-learning based on four fundamental principles with improved particle swarm optimization (IPSO by modifying parameters and differentially perturbed velocity (DV algorithm for improving the convergence. The algorithms are used to minimize path length and arrival time of all the robots to their respective destination in the environment and reducing the turning angle of each robot to reduce the energy consumption of each robot. In this proposed scheme, the improve classical Q-learning stores the Q-value of the best action of the state and thus save the storage space, which is used to decide the Pbest and gbest of the improved PSO in each iteration, and the velocity of the IPSO is adjusted by the vector differential operator inherited from differential evolution (DE. The validation of the algorithm is studied in simulated and Khepera-II robot.

  15. 基于蓝牙Piconet的LEGO多机器人P2P通信%Bluetooth Piconet based P2P communication among LEGO multi-robots

    Institute of Scientific and Technical Information of China (English)

    石博天; 张学良

    2012-01-01

    P2P通信是构建复杂多机器人系统的基础,由于LEGO NXT资源有限,不适于采用常用的Scatternet机制实现P2P通信.以支持蓝牙设备的PC作为中控机和网络主设备,基于Piconet,在中控机上提供可以接收/缓存/转发来自各NXT的通信数据,通过封装,在逻辑上形成P2P通信网络.协同舞蹈4机器人系统原型的研制工作验证了该组网通信机制可行.%P2P conmmunication is the basis of constructing multi-robot system. Due to limited resources, the bluetooth Scattemet is not suitable for the realization of P2P. In this paper, a PC with bluetooth was used as the master device and central controllor, a logical P2P network based on bluetooth Piconet was realized with receiving/buffering/forwarding messages from all NXTs by the communication server on the PC. The feasibility of the network was verified by the research work of a type of 4-cooperative dancing robot.

  16. Multi-robot cooperative localization based on particle swarm optimization%粒子群优化的多机器人协作定位方法

    Institute of Scientific and Technical Information of China (English)

    刘利枚; 蔡自兴

    2011-01-01

    针对异质多机器人具有不同的感知能力和处理能力的特点,提出一种基于粒子群优化的多机器人协作相对定位方法.该方法将常规粒子滤波方法与粒子群优化算法有机结合,通过粒子群优化方法对预估粒子进行更新,同时利用多机器人之间的相对观测信息,调整粒子的提议分布和粒子权重,增强多机器人位置预测的有效性,提高多机器人定位的精度.实时数据实验结果表明:该方法正确、可行.%According to different perceptions and processing abilities of heterogeneous robots, an approach to multi-robot cooperative localization was presented based on particle swarm optimization. Through the particle swarm algorithm combined with the standard particle filter, the prediction of particles was updated, and the proposal distribution and the weight of particles were adjusted based on the relative observations to enhance the effectiveness of the position prediction and improve the localization accuracy. The online experimential results prove that the improved method is correct and feasible.

  17. Monopolistic competition and search unemployment: a Pissarides-Dixit-Stiglitz model

    OpenAIRE

    Ziesemer, T.H.W.

    2001-01-01

    We integrate two workhorse models in economics: The monopolistic competition model of Dixit and Stiglitz and the search unemployment model of Pissarides. Many results of the original models survive. New results concerning the effects of changes in labour (goods) market parameters on goods markets (the labour market) variables are obtained and compared to the literature.

  18. Interpretation of Higgs and SUSY searches in MSUGRA and GMSB models

    CERN Document Server

    De Vivie de Régie, J B

    2000-01-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. (4 refs).

  19. Monitoring seasonal influenza epidemics by using internet search data with an ensemble penalized regression model

    Science.gov (United States)

    Guo, Pi; Zhang, Jianjun; Wang, Li; Yang, Shaoyi; Luo, Ganfeng; Deng, Changyu; Wen, Ye; Zhang, Qingying

    2017-01-01

    Seasonal influenza epidemics cause serious public health problems in China. Search queries-based surveillance was recently proposed to complement traditional monitoring approaches of influenza epidemics. However, developing robust techniques of search query selection and enhancing predictability for influenza epidemics remains a challenge. This study aimed to develop a novel ensemble framework to improve penalized regression models for detecting influenza epidemics by using Baidu search engine query data from China. The ensemble framework applied a combination of bootstrap aggregating (bagging) and rank aggregation method to optimize penalized regression models. Different algorithms including lasso, ridge, elastic net and the algorithms in the proposed ensemble framework were compared by using Baidu search engine queries. Most of the selected search terms captured the peaks and troughs of the time series curves of influenza cases. The predictability of the conventional penalized regression models were improved by the proposed ensemble framework. The elastic net regression model outperformed the compared models, with the minimum prediction errors. We established a Baidu search engine queries-based surveillance model for monitoring influenza epidemics, and the proposed model provides a useful tool to support the public health response to influenza and other infectious diseases. PMID:28422149

  20. Ecosystem models. (Latest citations from the NTIS database). Published Search

    Energy Technology Data Exchange (ETDEWEB)

    1993-07-01

    The bibliography contains citations concerning the design and applications of ecosystem models. Ecosystem simulation and characterization models, together with models for marine biology, plants, microorganisms, and food chains, are described. Models that assess the effect of pollutants on specific environments and habitat suitability index models are also included. (Contains 250 citations and includes a subject term index and title list.)

  1. Towards Visual-Search Model Observers for Mass Detection in Breast Tomosynthesis.

    Science.gov (United States)

    Lau, Beverly A; Das, Mini; Gifford, Howard C

    2013-03-21

    We are investigating human-observer models that perform clinically realistic detection and localization tasks as a means of making reliable assessments of digital breast tomosynthesis images. The channelized non-prewhitening (CNPW) observer uses the background known exactly task for localization and detection. Visual-search observer models attempt to replicate the search patterns of trained radiologists. The visual-search observer described in this paper utilizes a two-phase approach, with an initial holistic search followed by directed analysis and decision making. Gradient template matching is used for the holistic search, and the CNPW observer is used for analysis and decision making. Spherical masses were embedded into anthropomorphic breast phantoms, and simulated projections were made using ray-tracing and a serial cascade model. A localization ROC study was performed on these images using the visual-search model observer and the CNPW observer. Observer performance from the two computer observers was compared to human observer performance. The visual-search observer was able to produce area under the LROC curve values similar to those from human observers; however, more research is needed to increase the robustness of the algorithm.

  2. Simplified models vs. effective field theory approaches in dark matter searches

    Science.gov (United States)

    De Simone, Andrea; Jacques, Thomas

    2016-07-01

    In this review we discuss and compare the usage of simplified models and Effective Field Theory (EFT) approaches in dark matter searches. We provide a state of the art description on the subject of EFTs and simplified models, especially in the context of collider searches for dark matter, but also with implications for direct and indirect detection searches, with the aim of constituting a common language for future comparisons between different strategies. The material is presented in a form that is as self-contained as possible, so that it may serve as an introductory review for the newcomer as well as a reference guide for the practitioner.

  3. Simplified Models vs. Effective Field Theory Approaches in Dark Matter Searches

    CERN Document Server

    De Simone, Andrea

    2016-01-01

    In this review we discuss and compare the usage of simplified models and Effective Field Theory (EFT) approaches in dark matter searches. We provide a state of the art description on the subject of EFTs and simplified models, especially in the context of collider searches for dark matter, but also with implications for direct and indirect detection searches, with the aim of constituting a common language for future comparisons between different strategies. The material is presented in a form that is as self-contained as possible, so that it may serve as an introductory review for the newcomer as well as a reference guide for the practitioner.

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

    Indian Academy of Sciences (India)

    Md Naimuddin

    2012-11-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 $p\\bar{p}$-interactions at $\\sqrt{s} = 1.96$ TeV.

  5. Sleuth at CDF: A Quasi-model-independent search for new electroweak scale physics

    Energy Technology Data Exchange (ETDEWEB)

    Choudalakis, Georgios; /MIT, LNS

    2007-10-01

    These proceedings describe Sleuth, a quasi-model-independent search strategy targeting new electroweak scale physics, and its application to 927 pb{sup -1} of CDF II data. Exclusive final states are analyzed for an excess of data beyond the Standard Model prediction at large summed scalar transverse momentum. This analysis of high-pT data represents one of the most encompassing searches so far conducted for new physics at the energy frontier.

  6. 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

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

  8. Accelerated search for biomolecular network models to interpret high-throughput experimental data

    Directory of Open Access Journals (Sweden)

    Sokhansanj Bahrad A

    2007-07-01

    Full Text Available Abstract Background The functions of human cells are carried out by biomolecular networks, which include proteins, genes, and regulatory sites within DNA that encode and control protein expression. Models of biomolecular network structure and dynamics can be inferred from high-throughput measurements of gene and protein expression. We build on our previously developed fuzzy logic method for bridging quantitative and qualitative biological data to address the challenges of noisy, low resolution high-throughput measurements, i.e., from gene expression microarrays. We employ an evolutionary search algorithm to accelerate the search for hypothetical fuzzy biomolecular network models consistent with a biological data set. We also develop a method to estimate the probability of a potential network model fitting a set of data by chance. The resulting metric provides an estimate of both model quality and dataset quality, identifying data that are too noisy to identify meaningful correlations between the measured variables. Results Optimal parameters for the evolutionary search were identified based on artificial data, and the algorithm showed scalable and consistent performance for as many as 150 variables. The method was tested on previously published human cell cycle gene expression microarray data sets. The evolutionary search method was found to converge to the results of exhaustive search. The randomized evolutionary search was able to converge on a set of similar best-fitting network models on different training data sets after 30 generations running 30 models per generation. Consistent results were found regardless of which of the published data sets were used to train or verify the quantitative predictions of the best-fitting models for cell cycle gene dynamics. Conclusion Our results demonstrate the capability of scalable evolutionary search for fuzzy network models to address the problem of inferring models based on complex, noisy biomolecular

  9. Mono-X Versus Direct Searches: Simplified Models for Dark Matter at the LHC

    CERN Document Server

    Liew, Seng Pei; Vichi, Alessandro; Zurek, Kathryn M

    2016-01-01

    We consider simplified models for dark matter (DM) at the LHC, focused on mono-Higgs, -Z, -W or -b produced in the final state. Our primary purpose is to study the LHC reach of a relatively complete set of simplified models for these final states, while comparing the reach of the mono-X DM search against direct searches for the mediating particle. We find that direct searches for the mediating particle, whether in di-jets, jets+MET, multi-b+MET, or di-boson+MET, are usually stronger. We draw attention to the cases that the mono-X search is strongest, which include regions of parameter space in inelastic DM, two Higgs doublet, and squark mediated production models with a compressed spectrum.

  10. A New Multi-Robot Task Allocation Algorithm Based on Multi-Modality Synthesis%多模态融合的多机器人任务分配算法研究

    Institute of Scientific and Technical Information of China (English)

    段俊花; 朱怡安; 黄姝娟; 陆伟

    2013-01-01

    In distributed task allocation , it is hard to balance three problems:conflict, solution quality and solving price .Multimodal synthesis method is put forward for multi-robot distributed and self-organized task allocation . Three models of cooperation mechanism are combined; these three models are conflict problem , which is implicit cooperation mechanism based on pheromone , implicit task allocation realized by threshold method based on robot visual sense , and explicit task allocation based on improved contract net mechanism .The experiment results and their analysis show preliminarily that multimodal synthesis method can expand the scope of the robot perception , improve the system reliability , resolve the conflict problem by less communication , and improve the task execution efficiency .%针对分布式任务分配中的资源竞争冲突问题以及解的质量和求解代价难以协调的问题,提出了一种基于多模态融合的多机器人分布式自组织任务分配算法。它将基于信息素的隐式交互机制、基于视觉的阈值模型任务分配机制和基于通信的显式协商协调机制等相结合,实现了未知环境下多机器人系统的多模态分布式自组织任务分配。仿真实验结果表明,多模态融合技术扩大了机器人的感知范围,提高了系统可靠性,而且在较少通信的情况下,有效解决了任务分配冲突问题,提高了任务执行效率。

  11. The health belief model and consumer information searches: toward an integrated model.

    Science.gov (United States)

    Risker, D C

    1996-01-01

    Some health data organizations (HDOs) are producing consumer-level health services information. National reform proposals would suggest that competition between health plans will be developed through the use of outcome information. Policy makers have paid little attention to how consumers might use that information or how that information might be most effectively packaged for consumer use. This paper argues that marketing literature developed over the last ten to fifteen years could prove to be an informative resource for policy makers and the health services provider community alike. This paper suggests that combining a consumer decision model (CDM) with the health belief model (HBM) will provide an important step toward an increased understanding of consumer information search behavior. This integrated model could form the basis of future research in this important area.

  12. Search Combinators

    CERN Document Server

    Schrijvers, Tom; Wuille, Pieter; Samulowitz, Horst; Stuckey, Peter J

    2012-01-01

    The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is often inadequate. Either modeling capabilities are extremely limited or users are faced with a general-purpose programming language whose features are not tailored towards writing search heuristics. As a result, major improvements in performance may remain unexplored. This article introduces search combinators, a lightweight and solver-independent method that bridges the gap between a conceptually simple modeling language for search (high-level, functional and naturally compositional) and an efficient implementation (low-level, imperative and highly non-modular). By allowing the user to define application-tailored search strategies from a small set of primitives, search combinators effectively provide a rich domain-specific language (DSL) for modeling search to the user. Remarkably, this DSL comes at a low implementation cost to the...

  13. Feature modulation search: a novel memory search model that extends the perceptual interference effect to musical stimuli.

    Science.gov (United States)

    Schulkind, Matthew D

    2002-03-01

    Although most research in the perceptual interference literature has used visual stimuli, recent experiments have replicated this effect using musical stimuli. Two experiments investigated whether musical and visual demonstrations of the effect are produced by a common mechanism by examining whether the provision of incorrect cues would impair melodic object identification in the perceptual interference paradigm. Whereas incorrect cues typically do not affect visual object identification, they reduced melody identification both when the subjects generated the cues and when the experimenter provided them. A novel model (feature modulation search) is presented to account for perceptual interference in musical stimuli. The model has potential applications for the larger perceptual interference literature and for related phenomena in which target-related information impairs cognition.

  14. Searching for turbulence models by artificial neural network

    Science.gov (United States)

    Gamahara, Masataka; Hattori, Yuji

    2017-05-01

    An artificial neural network (ANN) is tested as a tool for finding a new subgrid model of the subgrid-scale (SGS) stress in large-eddy simulation. An ANN is used to establish a functional relation between the grid-scale flow field and the SGS stress without any assumption of the form of function. Data required for training and test of the ANN are provided by direct numerical simulation of a turbulent channel flow. It is shown that an ANN can establish a model similar to the gradient model. The correlation coefficients between the real SGS stress and the output of the ANN are comparable to or larger than similarity models, but smaller than a two-parameter dynamic mixed model. Large-eddy simulations using the trained ANN are also performed. Although ANN models show no advantage over the Smagorinsky model, the results confirm that the ANN is a promising tool for establishing a new subgrid model with further improvement.

  15. Beyond standard model Higgs boson searches in the ATLAS and CMS experiments

    CERN Document Server

    Mariotti, Chiara

    2013-01-01

    Searches for a Higgs boson in models beyond the Standard Model at the ATLAS and CMS experiments at the Large Hadron Collider are discussed. No sign of new physics is present in the data collected at 7 and 8 TeV proton center of mass energies. Limits on model parameters are set. Future studies at higher energy are presented.

  16. 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…

  17. Modeling Strategies: In Search of the Holy Grail.

    Science.gov (United States)

    Bollen, Kenneth A.

    2000-01-01

    Neither the four-step model nor the one-step procedure can actually tell whether the researcher has the right number of factors in structural equation modeling. In fact, for reasons discussed, a simple formulaic approach to the correct specification of models does not yet exist. (SLD)

  18. Structured Metametadata Model to Augment Semantic Searching Algorithms in Learning Content Repository

    Directory of Open Access Journals (Sweden)

    Amirah Ismail

    2011-08-01

    Full Text Available This paper discusses on a novel technique for semantic searching and retrieval of information about learning materials. A novel structured metametadata model has been created to provide the foundation for a semantic search engine to extract, match and map queries to retrieve relevant results. Metametadata encapsulate metadata instances by using the properties and attributes provided by ontologies rather than describing learning objects. The use of ontological views assists the pedagogical content of metadata extracted from learning objects by using the control vocabularies as identified from the metametadata taxonomy. The use of metametadata (based on the metametadata taxonomy supported by the ontologies have contributed towards a novel semantic searching mechanism. This research has presented a metametadata model for identifying semantics and describing learning objects in finer-grain detail that allows for intelligent and smart retrieval by automated search and retrieval software.

  19. Structured Metametadata Model to Augment Semantic Searching Algorithms in Learning Content Repository

    Directory of Open Access Journals (Sweden)

    Amirah Ismail

    2011-08-01

    Full Text Available This paper discusses on a novel technique for semantic searching and retrieval of information about learning materials. A novel structured metametadata model has been created to provide the foundation for a semantic search engine to extract, match and map queries to retrieve relevant results. Metametadata encapsulate metadata instances by using the properties and attributes provided by ontologies rather than describing learning objects. The use of ontological views assists the pedagogical content of metadata extracted from learning objects by using the control vocabularies as identified from the metametadata taxonomy. The use of metametadata (based on the metametadata taxonomy supported by the ontologies have contributed towards a novel semantic searching mechanism. This research has presented a metametadata model for identifying semantics and describing learning objects in finer-grain detail that allows for intelligent and smart retrieval by automated search and retrieval software.

  20. Student Search Behaviour in an Online Public Access Catalogue: An Examination of "Searching Mental Models" and "Searcher Self-Concept"

    Science.gov (United States)

    Willson, Rebekah; Given, Lisa M.

    2014-01-01

    Introduction: This paper presents a qualitative exploration of university students' experience of searching an online public access catalogue. The study investigated how students conceptualise their searching process, as well as how students understand themselves as seekers of information. Method: Following a search task, thirty-eight…

  1. Search for nucleon decay via modes favored by supersymmetric grand unification models in Super-Kamiokande-I

    CERN Document Server

    Kobayashi, K; Ashie, Y; Hosaka, J; Ishihara, K; Itow, Y; Kameda, J; Koshio, Y; Minamino, A; Mitsuda, C; Miura, M; Moriyama, S; Nakahata, M; Namba, T; Nambu, R; Obayashi, Y; Shiozawa, M; Suzuki, Y; Takeuchi, Y; Taki, K; Yamada, S; Ishitsuka, M; Kajita, T; Kaneyuki, K; Nakayama, S; Okada, A; Okumura, K; Ooyabu, T; Saji, C; Takenaga, Y; Desai, S; Kearns, E; Likhoded, S; Stone, J L; Sulak, L R; Wang, W; Goldhaber, M; Casper, D; Cravens, J P; Gajewski, W; Kropp, W R; Liu, D W; Mine, S; Smy, M B; Sobel, H W; Sterner, C W; Vagins, M R; Ganezer, K S; Hill, J E; Keig, W E; Jang, J S; Kim, J Y; Lim, I T; Scholberg, K; Walter, C W; Ellsworth, R W; Tasaka, S; Guillian, G; Kibayashi, A; Learned, J G; Matsuno, S; Takemori, D; Messier, M D; Hayato, Y; Ichikawa, A K; Ishida, T; Ishii, T; Iwashita, T; Kobayashi, T; Maruyama, T; Nakamura, K; Nitta, K; Oyama, Y; Sakuda, M; Totsuka, Y; Suzuki, A T; Hasegawa, M; Hayashi, K; Kato, I; Maesaka, H; Morita, T; Nakadaira, T; Nakaya, T; Nishikawa, K; Sasaki, T; Ueda, S; Yamamoto, S; Yokoyama, M; Haines, T J; Dazeley, S; Hatakeyama, S; Svoboda, R; Blaufuss, E; Goodman, J A; Sullivan, G W; Turcan, D; Habig, A; Fukuda, Y; Jung, C K; Kato, T; Malek, M; Mauger, C; McGrew, C; Sarrat, A; Sharkey, E; Yanagisawa, C; Toshito, T; Miyano, K; Tamura, N; Ishii, J; Kuno, Y; Yoshida, M; Kim, S B; Yoo, J; Okazawa, H; Ishizuka, T; Choi, Y; Seo, H K; Gando, Y; Hasegawa, T; Inoue, K; Shirai, J; Suzuki, A; Koshiba, M; Nakajima, Y; Nishijima, K; Harada, T; Ishino, H; Watanabe, Y; Kielczewska, D; Zalipska, J; Berns, H G; Gran, R; Shiraishi, K K; Stachyra, A; Washburn, K; Wilkes, R J

    2005-01-01

    We report the results for nucleon decay searches via modes favored by supersymmetric grand unified models in Super-Kamiokande. Using 1489 days of full Super-Kamiokande-I data, we searched for $p \\to \\bar{\

  2. Website Traffics Acquisition Model for E-Business using Search Engine Optimization and Sitemap Submission (SEOSS)

    OpenAIRE

    ZULAZEZE SAHRI

    2016-01-01

    Abstract—It is inevitable to accept that today’s business trends focus on selling products online using the latest web application system and website marketing tools. This phenomenon creates a high competition on search engine ranking among website owners in gaining business leads, visitor traffics and acquisitions. This paper proposed a model on improving e-business traffics acquisitions in terms of the number of new visitors (traffics) and returning visitors using Search Engine Optimization...

  3. B-tree search reinforcement learning for model based intelligent agent

    Science.gov (United States)

    Bhuvaneswari, S.; Vignashwaran, R.

    2013-03-01

    Agents trained by learning techniques provide a powerful approximation of active solutions for naive approaches. In this study using B - Trees implying reinforced learning the data search for information retrieval is moderated to achieve accuracy with minimum search time. The impact of variables and tactics applied in training are determined using reinforcement learning. Agents based on these techniques perform satisfactory baseline and act as finite agents based on the predetermined model against competitors from the course.

  4. 多机器人主—从行星式编队控制%Multi-robot Leader-follower Planetary Formation Control

    Institute of Scientific and Technical Information of China (English)

    郑秀娟; 吴怀宇; 程磊; 陈洋; 张玉礼

    2012-01-01

    研究了二阶积分器描述的多机器人主—从行星式编队控制问题,提出了将多机器人编队分解为每个机器人对各自具有时变速度的虚拟机器人的跟踪控制,使得每个机器人相对于虚拟机器人的位置与速度跟踪误差收敛为零且彼此不相碰撞,此时编队系统收敛到理想队形.在统一的算法框架下,分别实现了跟随者以领航者为中心的公转运动编队(revolution formation,RF)模式和跟随者与领航者保持期望距离、期望速度的编队(desired formation,DF)模式.公转运动编队(RF)模式适用于异构多机器人系统的环境探索任务;保持期望距离、期望速度的编队(DF)模式适用于自主水下机器人(AUV)、无人机(UAV)等合作与协调任务.应用李亚普诺夫稳定性理论对控制算法的稳定性进行了分析,并通过计算机仿真验证了该方法的有效性.%The leader-follower planetary formation control problem for multiple robots with double-integrator is studied, and an approach is proposed to transform the multi-robot formation control method into tracking control problem of desired virtual robot with varying velocity for each robot, and then the position and velocity tracking errors between each robot and its virtual robot converge to zero without any collision, while the formation system converges to the desired formation. Under the unified algorithm framework, two kinds of formation modes are realized respectively, including the followers moving around the leader formation (revolution Formation, RF) mode and the followers maintaining desired distance and velocity with the leader formation (desired formation, DF) mode. The RF mode is applied to the exploration mission for heterogeneous multi-robot system, and the DF mode is applied to the cooperation and coordination tasks for AUVs (autonomous underwater vehicle) and UAVs (unmanned aerial vehicle). The stability of the control algorithm is analyzed through Lyapunov

  5. Nonalcoholic Steatohepatitis: A Search for Factual Animal Models.

    Science.gov (United States)

    Sanches, Sheila Cristina L; Ramalho, Leandra Naira Z; Augusto, Marlei Josiele; da Silva, Deisy Mara; Ramalho, Fernando Silva

    2015-01-01

    Nonalcoholic fatty liver disease (NAFLD) is characterized by hepatic steatosis, which occurs in the absence of alcohol abuse. NAFLD can evolve into progressive liver injury and fibrosis in the form of nonalcoholic steatohepatitis (NASH). Several animal models have been developed to attempt to represent the morphological, biochemical, and clinical features of human NASH. The actual review presents a critical analysis of the most commonly used experimental models of NAFLD/NASH development. These models can be classified into genetic, nutritional, and a combination of genetic and nutritional factors. The main genetic models are ob/ob and db/db mutant mice and Zucker rats. The principal nutritional models employ methionine- and choline-deficient, high-fat, high-cholesterol and high-cholate, cafeteria, and high-fructose diets. Currently, associations between high-fructose and various compositions of high-fat diets have been widely studied. Previous studies have encountered significant difficulties in developing animal models capable of reproducing human NASH. Some models produce consistent morphological findings, but the induction method differs significantly compared with the pathophysiology of human NASH. Other models precisely represent the clinical and etiological contexts of this disease but fail to provide accurate histopathological representations mainly in the progression from steatosis to liver fibrosis.

  6. Nonalcoholic Steatohepatitis: A Search for Factual Animal Models

    Directory of Open Access Journals (Sweden)

    Sheila Cristina L. Sanches

    2015-01-01

    Full Text Available Nonalcoholic fatty liver disease (NAFLD is characterized by hepatic steatosis, which occurs in the absence of alcohol abuse. NAFLD can evolve into progressive liver injury and fibrosis in the form of nonalcoholic steatohepatitis (NASH. Several animal models have been developed to attempt to represent the morphological, biochemical, and clinical features of human NASH. The actual review presents a critical analysis of the most commonly used experimental models of NAFLD/NASH development. These models can be classified into genetic, nutritional, and a combination of genetic and nutritional factors. The main genetic models are ob/ob and db/db mutant mice and Zucker rats. The principal nutritional models employ methionine- and choline-deficient, high-fat, high-cholesterol and high-cholate, cafeteria, and high-fructose diets. Currently, associations between high-fructose and various compositions of high-fat diets have been widely studied. Previous studies have encountered significant difficulties in developing animal models capable of reproducing human NASH. Some models produce consistent morphological findings, but the induction method differs significantly compared with the pathophysiology of human NASH. Other models precisely represent the clinical and etiological contexts of this disease but fail to provide accurate histopathological representations mainly in the progression from steatosis to liver fibrosis.

  7. Outdoor-indoor Space: Unified Modeling and Shortest Path Search

    DEFF Research Database (Denmark)

    Jensen, Søren Kejser; Nielsen, Jens Thomas Vejlby; Lu, Hua;

    2016-01-01

    Graph models are widely used for representing the topology of outdoor space (O-Space) and indoor space (I-Space). However, existing models neglect the intersection between O-Space and I-Space, only allowing for computations such as shortest path and nearest neighbor queries in either O-Space or I...

  8. Searching for turbulence models by artificial neural network

    CERN Document Server

    Gamahara, Masataka

    2016-01-01

    Artificial neural network (ANN) is tested as a tool for finding a new subgrid model of the subgrid-scale (SGS) stress in large-eddy simulation. ANN is used to establish a functional relation between the grid-scale (GS) flow field and the SGS stress without any assumption of the form of function. Data required for training and test of ANN are provided by direct numerical simulation (DNS) of a turbulent channel flow. It is shown that ANN can establish a model similar to the gradient model. The correlation coefficients between the real SGS stress and the output of ANN are comparable to or larger than similarity models, but smaller than a two-parameter dynamic mixed model.

  9. 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.

  10. Model-Independent Global Search for New High-pT Physics at CDF

    Energy Technology Data Exchange (ETDEWEB)

    Collaboration, CDF

    2007-12-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 three hundred exclusive final states in 927 pb{sup -1} of p{bar p} collisions at {radical}s = 1.96 TeV reveals no such significant indication of physics beyond the standard model.

  11. Model-Independent Global Search for New High-pT Physics at CDF

    CERN Document Server

    Aaltonen, T; Adelman, J; Akimoto, T; Albrow, M G; Alvarez-Gonzalez, B; Amerio, S; Amidei, D; Anastassov, A; Annovi, A; Antos, J; Apollinari, G; Apresyan, A; Arisawa, T; Artikov, A; Ashmanskas, W; Aurisano, A; Azfar, F; Azzi-Bacchetta, P; Azzurri, P; Bacchetta, N; Badgett, W; 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; Berry, T; Bhatti, A; Binkley, M; Bisello, D; Bizjak, I; Blair, R E; Blocker, C; Blumenfeld, B; Bocci, A; Bodek, A; Boisvert, V; Bölla, G; Bolshov, A; Bortoletto, D; Boudreau, J; Boveia, A; Brau, B; Brigliadori, L; Bromberg, C; Brubaker, E; Budagov, Yu A; Budd, H S; Budd, S; Burkett, K; Busetto, G; Bussey, P; Buzatu, A; Byrum, K L; Cabrerar, S; Campanelli, M; Campbell, M; Canelli, F; Canepa, A; Carlsmith, D; Carosi, R; Carrillol, S; Carron, S; Casal, B; Casarsa, M; Castro, A; Catastini, P; Cauz, D; Cerri, A; Cerritop, 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; Cuenca Almenarr, C; Cuevaso, J; Culbertson, R; Cully, J C; Dagenhart, D; Datta, M; Davies, T; De Barbaro, P; De Cecco, S; Deisher, A; De Lentdeckerd, G; Dell'Orso, Mauro; Demortier, L; Deng, J; Deninno, M; De Pedis, D; Derwent, P F; Di Giovanni, G P; Dionisi, C; Di Ruzza, B; Dittmann, J R; 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; Fernández, 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; García, J E; Garfinkel, A F; Gerberich, H; Gerdes, D; Giagu, S; Giannetti, P; Gibson, K; Gimmell, J L; Ginsburg, C; Giokarisa, N; Giordani, M; Giromini, P; Giunta, M; Glagolev, V; Glenzinski, D; Gold, M; Goldschmidt, N; Goldsteinc, J; Golossanov, A; Gómez, G; Gómez-Ceballos, G; Goncharov, M; Gonzlez, O; Gorelov, I; Goshaw, A T; Goulianos, K; Gresele, A; Grinstein, S; Grosso-Pilcher, C; Group, R C; Grundler, U; Guimaraesda Costa, J; Gunay-Unalan, Z; 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; Heinrich, J; Henderson, C; Herndon, M; Heuser, J; Hewamanage, S; Hidas, D; Hillc, C S; Hirschbuehl, D; Höcker, 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; Lancaster, M; Lander, R L; Lannon, K; Lath, A; Latino, G; Lazzizzera, I; Le Compte, T; Lee, J; Lee, J; Lee, Y J; Leeq, S W; Lefèvre, R; Leonardo, N; Leone, S; Levy, S; Lewis, J D; Lin, C; 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; Lysak, R; Lytken, E; Mack, P; MacQueen, D; Madrak, R; Maeshima, K; Makhoul, K; Mäki, T; Maksimovic, P; Malde, S; Malik, S; Manousakisa, A; Margaroli, F; Marino, C; Marino, C P; Martin, A; Martin, M; Martinj, V; Martinez-Ballarin, R; Maruyama, T; Mastrandrea, P; Masubuchi, T; Mattson, M E; Mazzanti, P; McFarland, K S; McIntyre, P; McNultyi, R; Mehta, A; Mehtälä, P; Menzemerk, 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; Movilla-Fernández, P A; Mrenna, S; Mülmenstädt, J; Mukherjee, A; Müller, T; 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; Nodulman, L; Norman, M; Norniella, O; Nurse, E; Oh, S H; Oh, Y D; Oksuzian, I; Okusawa, T; Orava, R; Österberg, 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, Aldo L; Phillips, T J; Piacentino, G; Piedra, J; Pinera, L; Pitts, K; Plager, C; Pondrom, L; Poukhov, O; Pounder, N; Prakoshyn, F; Pronko, A; Proudfoot, J; Ptohosh, F; Punzi, G; Pursley, J; Rademackerc, J; Rahaman, A; Ramakrishnan, V; Ranjan, N; Redondo, I; Reisert, B; Rekovic, V; Renton, P B; Rescigno, M; Richter, S; Rimondi, F; Ristori, L; Robson, A; Rodrigo, T; Rogers, E; Roser, R; Rossi, M; Rossin, R; Roy, P; Ruiz, A; Russ, J; Rusu, V; Saarikko, H; Safonov, A; Sakumoto, W K; Salamanna, G; Santi, L; Sarkar, S; Sartori, L; Sato, K; Savard, P; Savoy-Navarro, A; Scheidle, T; Schlabach, P; Schmidt, E E; 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 G; Shepard, P F; Sherman, D; Shimojiman, M; Shochet, M; Shon, Y; Shreyber, I; Sidoti, A; Sinervo, P; Sisakian, A; Slaughter, A J; Slaunwhite, J; Sliwa, K; Smith, J R; Snider, F D; Snihur, R; Söderberg, M; Soha, A; Somalwar, S; Sorin, V; Spalding, J; Spinella, F; Spreitzer, T; Squillacioti, P; Stanitzki, M; Saint-Denis, R; Stelzer, B; Stelzer-Chilton, O; Stentz, D; Strologas, J; Stuart, D; Suh, J S; Sukhanov, A; Sun, H; Suslov, I; Suzuki, T; Taffarde, A; Takashima, R; Takeuchi, Y; Tanaka, R; Tecchio, M; Teng, P K; Terashi, K; Thomg, 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; Vazquezl, F; Velev, G; Vellidisa, C; Veszpremi, V; Vidal, M; Vidal, R; Vila, I; Vilar, R; Vine, T; Vogel, M; Volpi, G; Würthwein, F; Wagner, P; Wagner, R G; Wagner, R L; Wagner, J; Wagner, W; Wallny, R; Wang, S M; Warburton, A; Waters, D; Weinberger, M; Wester, W C; Whitehouse, B; Whitesone, D; Wicklund, A B; Wicklund, E; Williams, G; Williams, H H; Wilson, P; Winer, B L; Wittichg, P; Wolbers, S; Wolfe, C; Wright, T; Wu, X; Wynne, S M; Xie, S; Yagil, A; Yamamoto, K; Yamaoka, J; Yamashita, T; Yang, C; Yangm, 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; Zhengb, Y; Zucchelli, S

    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 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 three hundred exclusive final states in 927 pb^-1 of ppbar collisions at sqrt(s)=1.96 TeV reveals no such significant indication of physics beyond the standard model.

  12. 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...... aspects. First, it provides a link between the wage posting framework and the search-matching framework (eg. Pissarides, 1990). Second, it improves the correspondence between the theoretical characterization of the endogeneously derived earnings density and the empirically observed earnings density. We...

  13. Model Independent Searches for New Physics at the Fermilab Tevatron Collider

    CERN Document Server

    Piper, Joel

    2009-01-01

    The standard model is a successful but limited theory. There is significant theoretical motivation to believe that new physics may appear at the energy scale of a few TeV, the lower end of which is currently probed by the Fermilab Tevatron Collider. The methods used to search for physics beyond the standard model in a model independent way and the results of these searches based on 1.0 fb-1 of data collected with the D0 detector and 2.0 fb^-1 at the CDF detector are presented.

  14. 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.

  15. 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.

  16. 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

  17. Literature search for offsite data to improve the DWPF melter off-gas model

    Energy Technology Data Exchange (ETDEWEB)

    Daniel, W.E.

    2000-05-04

    This report documents the literature search performed and any relevant data that may help relax some of the constraints on the DWPF melter off-gas model. The objective of this task was to look for outside sources of technical data to help reduce some of the conservatism built in the DWPF melter off-gas model.

  18. 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.

  19. The (Ir)relevance of Real Wage Rigidity in the New Keynesian Model with Search Frictions

    NARCIS (Netherlands)

    Krause, M.U.; Lubik, T.A.

    2003-01-01

    We explore the role of real wage dynamics in a New Keynesian business cycle model with search and matching frictions in the labor market.Both job creation and destruction are endogenous.We show that the model generates counterfactual inflation and labor market dynamics.In particular, it fails to gen

  20. The search for a new model structure of β-Factor XIIa

    Science.gov (United States)

    Henriques, Elsa S.; Floriano, Welly B.; Reuter, Nathalie; Melo, André; Brown, David; Gomes, José A. N. F.; Maigret, Bernard; Nascimento, Marco A. C.; Ramos, Maria João

    2001-04-01

    We present the search for a new model of β-factor XIIa, a blood coagulation enzyme, with an unknown experimental 3D-structure. We decided to build not one but three different models using different homologous proteins as well as different techniques and different modellers. Additional studies, including extensive molecular dynamics simulations on the solvated state, allowed us to draw several conclusions concerning homology modelling, in general, and β-factor XIIa, in particular.

  1. Multi-AUV Target Search Based on Bioinspired Neurodynamics Model in 3-D Underwater Environments.

    Science.gov (United States)

    Cao, Xiang; Zhu, Daqi; Yang, Simon X

    2016-11-01

    Target search in 3-D underwater environments is a challenge in multiple autonomous underwater vehicles (multi-AUVs) exploration. This paper focuses on an effective strategy for multi-AUV target search in the 3-D underwater environments with obstacles. First, the Dempster-Shafer theory of evidence is applied to extract information of environment from the sonar data to build a grid map of the underwater environments. Second, a topologically organized bioinspired neurodynamics model based on the grid map is constructed to represent the dynamic environment. The target globally attracts the AUVs through the dynamic neural activity landscape of the model, while the obstacles locally push the AUVs away to avoid collision. Finally, the AUVs plan their search path to the targets autonomously by a steepest gradient descent rule. The proposed algorithm deals with various situations, such as static targets search, dynamic targets search, and one or several AUVs break down in the 3-D underwater environments with obstacles. The simulation results show that the proposed algorithm is capable of guiding multi-AUV to achieve search task of multiple targets with higher efficiency and adaptability compared with other algorithms.

  2. An Operational Search and Rescue Model for the Norwegian Sea and the North Sea

    CERN Document Server

    Breivik, Øyvind; 10.1016/j.jmarsys.2007.02.010

    2011-01-01

    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 th...

  3. POLYNOMIAL MODEL BASED FAST FRACTIONAL PIXEL SEARCH ALGORITHM FOR H.264/AVC

    Institute of Scientific and Technical Information of China (English)

    Xi Yinglai; Hao Chongyang; Lai Changcai

    2006-01-01

    This paper proposed a novel fast fractional pixel search algorithm based on polynomial model.With the analysis of distribution characteristics of motion compensation error surface inside fractional pixel searching window, the matching error is fitted with parabola along horizontal and vertical direction respectively. The proposed searching strategy needs to check only 6 points rather than 16 or 24 points, which are used in the Hierarchical Fractional Pel Search algorithm (HFPS) for 1/4-pel and 1/8-pel Motion Estimation (ME). The experimental results show that the proposed algorithm shows very good capability in keeping the rate distortion performance while reduces computation load to a large extent compared with HFPS algorithm.

  4. Data-driven Model-independent Searches for Long-lived Particles at the LHC

    CERN Document Server

    Coccaro, Andrea; Lubatti, H J; Russell, Heather; Shelton, Jessie

    2016-01-01

    Neutral long-lived particles (LLPs) are highly motivated by many BSM 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 SM 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 the 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 \\to X X$ signal model of LLP pair production in exotic Higgs decays, this res...

  5. A Gossip-based Mechanism for Communication in Multi-Robot Systems%基于Gossip协议的多机器人系统通讯机制的研究

    Institute of Scientific and Technical Information of China (English)

    侯君

    2013-01-01

    多机器人系统的移动特性给无线通讯的设计提出挑战.而广泛使用的移动Ad-Hoc网络处理网络拓扑结构不断变化的任务会产生不可预测的计算开销.针对这种不足,该文对广泛应用于分布式信息管理的Gossip协议进行修改,应用于移动多机器人通讯中,并基于该协议提出一种实现机器人规模统计的算法.实验结果表明,该协议在不同规模的机器人系统中,都能有效地完成信息的分发,且不会造成通讯量锐增.%The moving character of multi-robot systems offers challenges to wireless communication.But the mobile Ad-Hoc network,which has been widely used in multi-robot systems,will result in unpredictable computing overhead because of the ever-changing network topology.According to the shortages,the gossip protocol which has been widely used in information management of distributed systems can be modified and applied in the communication of mobile robots.To verify the modified gossip protocol,an algorithm for group scale estimation of robots is proposed.The experimental results show that any small and medium-size multi-robot systems which are applied in modified gossip protocol can complete information distribution successfully.And what's more,the amount of communication will not be affected.

  6. T he formation control of multi-robot fish based on leader-follower and fuzzy feedback mechanism%采用 Leader-follower 和模糊反馈机制的机器鱼队形控制

    Institute of Scientific and Technical Information of China (English)

    2013-01-01

    In the formation control of multi-robot fish under the leader-follower framework, the fuzzy feedback con-troller was introduced to traditional leader-follower formation control algorithm in efforts to cope with the relative in-dependence of the leader and followers , as well as the desertion of the laggard robot fishes .The goal was to ensure that the pilot robotic fish could check the position of followers regularly .In order to enhance the stability of the for-mation control of multi-robot fish and complete the task of collaborative operation , the formation control problem of multi-robot fish system was transformed into the problem of followers ’ tracking the position and orientation of the leader with the addition of the feedback regulation .Simulations verify that the proposed method can better realize the formation control of the robotic fish system .%  在Leader-follower框架下的多机器鱼系统队形控制中,针对Leader和Follower相对独立及落后机器鱼离队等问题,在传统的Leader -follower队形控制算法中引入模糊反馈控制器进行反馈调节,使得领航机器鱼Leader能定时检查Follower的位置,将多机器鱼系统的队形控制问题转化为具有反馈调节的Follower跟踪Leader的位置和方向的问题,以增强多机器鱼队形控制的稳定性,更好地协同作业完成任务。仿真试验验证了所提出的方法能较好地实现多机器鱼系统的队形控制。

  7. Modelling geographical graduate job search using circular statistics

    NARCIS (Netherlands)

    Faggian, Alessandra; Corcoran, Jonathan; McCann, Philip

    2013-01-01

    Theory suggests that the spatial patterns of migration flows are contingent both on individual human capital and underlying geographical structures. Here we demonstrate these features by using circular statistics in an econometric modelling framework applied to the flows of UK university graduates.

  8. In Search of the Nordic Model in Education

    Science.gov (United States)

    Antikainen, Ari

    2006-01-01

    The Nordic model of education is defined in this article as an attempt to construct a national education system on the foundation of specific local values and practices, but at the same time subject to international influences. According to the author, equity, participation, and welfare are the major goals and the publicly funded comprehensive…

  9. 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.

  10. A quasi-model-independent search for new high p{_}T physics at DO

    Energy Technology Data Exchange (ETDEWEB)

    Knuteson, Bruce O.

    2000-12-11

    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{sup -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.

  11. 考虑通信状况的多机器人CSLAM问题综述%An Overview on the Cooperative SLAM Problem of Multi-robot Systems Considering Communication Conditions

    Institute of Scientific and Technical Information of China (English)

    张国良; 汤文俊; 曾静; 徐君; 姚二亮

    2014-01-01

    The communication conditions can affect the design and realization of cooperative simultaneous localization and mapping (CSLAM) algorithms directly. According to the different focuses among the assumptions on the com-munication conditions of multi-robot systems, the state-of-the-art research advances of multi-robot CSLAM algorithms are presented in this paper. Firstly, the characters and drawbacks of the centralized CSLAM algorithm based on fully connected communication condition are introduced. Secondly, in the situation of unknown initial correspondence of the multi-robot system, the map merging issue of distributed CSLAM algorithm based on limited communication range and bandwidth is analyzed and defined in terms of map alignment, data association and map fusion. Furthermore, some of the latest research achievements on distributed CSLAM algorithm considering sparse-dynamic communication situation are also presented. Finally, the prospect of future research in the area of multi-robot CSLAM is summarized.%多机器人系统的通信状况能够直接影响协作同时定位与地图创建(Cooperative simultaneous localization and mapping, CSLAM)算法的设计和实现。根据对多机器人通信状况所作出假设的侧重点不同,对多机器人CSLAM 算法研究现状和进展进行综述。首先,简要介绍了基于完全连通通信条件的集中式CSLAM 算法的特点和缺陷;其次,结合多机器人系统初始相对位姿关系未知的情况,从地图配准、数据关联和地图融合等三个方面,对基于通信范围或者带宽受限条件的分布式CSLAM 算法的地图合并问题进行了分析和阐述;进而重点对考虑稀疏-动态通信状况的分布式CSLAM 算法的最新研究成果进行了归纳总结。最后指出多机器人CSLAM研究领域今后的研究方向。

  12. 一种多机械手编码控制系统的果蔬采摘机器人设计%Design of Picking Robot for Fruits and Vegetables Based on Encoding Control System for Multi Robot Manipulators

    Institute of Scientific and Technical Information of China (English)

    李素云; 余长庚

    2016-01-01

    为了提高果蔬的采摘效率,对果蔬采摘机器人进行了改进,设计了一种新的多机械手的编码控制采摘机器人. 通过对机器人功能和结构的设计,使机器人具有了利用机器视觉技术的图像边缘提取来划分每个机械手的作业区间的功能,并可以利用编码器对每个机械手进行编码,从而完成多机械手的协同作业. 对机器人的采摘作业性能进行了测试,首先利用机器视觉模块完成了苹果采摘区间的划分,并预设了每个机械手的采摘作业轨迹,利用编码器对预设轨迹进行了追踪. 通过测试发现:机器人多机械手的实际追踪轨迹和预设轨迹的误差很小,满足设计需求,多机械手的协同采摘平均速度可以达到8 0 个/min 以上,具有高效的果蔬采摘性能.%In order to improve the efficiency of picking fruits and vegetables, a new kind of robot with multi robot hand is designed, which is used to improve the picking efficiency of fruits and vegetables.Through the function and structure of robot,the design enables the robot extract the image edge ion based on machine vision technology to divide each manipu -lator the operating range of the function.And it can use the encoder to encode each manipulator, so as to complete the multi robot cooperative working industry.The robot's picking performance were tested.First of all, the machine vision module apple picking interval of the partition, and the default of each manipulator picking operation trajectory,the coder for the preset trajectory tracking.Through the test found that multi robot manipulator of actual trajectory tracking and pre -set trajectory error is very small, meet the design requirements, multi robot cooperative picking average speed can reach more than 80/min, with high fruit and vegetable picking performance.

  13. The search for animal models for Lassa fever vaccine development.

    Science.gov (United States)

    Lukashevich, Igor S

    2013-01-01

    Lassa virus (LASV) is the most prevalent arenavirus in West Africa and is responsible for several hundred thousand infections and thousands of deaths annually. The sizeable disease burden, numerous imported cases of Lassa fever (LF) and the possibility that LASV can be used as an agent of biological warfare make a strong case for vaccine development. Currently there is no licensed LF vaccine and research and devlopment is hampered by the high cost of nonhuman primate animal models and by biocontainment requirements (BSL-4). In addition, a successful LF vaccine has to induce a strong cell-mediated cross-protective immunity against different LASV lineages. All of these challenges will be addressed in this review in the context of available and novel animal models recently described for evaluation of LF vaccine candidates.

  14. Standard model parameters and the search for new physics

    Energy Technology Data Exchange (ETDEWEB)

    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.

  15. A feedback-trained autonomous control system for heterogeneous search and rescue applications

    Science.gov (United States)

    Straub, Jeremy

    2012-06-01

    Due to the environment in which operation occurs, earch and rescue (SAR) applications present a challenge to autonomous systems. A control technique for a heterogeneous multi-robot group is discussed. The proposed methodology is not fully autonomous; however, human operators are freed from most control tasks and allowed to focus on perception tasks while robots execute a collaborative search and identification plan. Robotic control combines a centralized dispatch and learning system (which continuously refines heuristics used for planning) with local autonomous task ordering (based on existing task priority and proximity and local conditions). This technique was tested in a SAR analogous (from a control perspective) environment.

  16. Search for the standard model Higgs boson decaying to two photons with CMS at the LHC

    Directory of Open Access Journals (Sweden)

    Marinelli Nancy

    2013-05-01

    Full Text Available The search for the Higgs boson is presented on 10.4 fb−1 of data recorded with CMS at the Large Hadron Collider (LHC during proton-proton interaction runs at √s = 7 and 8 TeV. The search is performed in the mass range between 110 and 150 GeV and limits are set on the cross section in the context of the Standard Model. An excess of events above the expected background is observed at about 125 GeV which is consistent with the observation of a new boson statistically compatible with the Standard Model Higgs boson hypothesis.

  17. 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.

  18. Searching for Standard Model Adjoint Scalars with Diboson Resonance Signatures

    CERN Document Server

    Carpenter, Linda M

    2015-01-01

    We explore the phenomenology of scalar fields in the adjoint representation of SM gauge groups. We write a general set of dimension 5 effective operators in which SM adjoint scalars couple to pairs of standard model bosons. Using these effective operators, we explore new possible decay channels of a scalar color octet into a gluon and a Z boson/ gluon and a photon. We recast several analyses from Run I of the LHC to find constraints on an a scalar octet decaying into these channels, and we project the discovery potential of color octets in our gluon+photon channel for the 14 TeV run of LHC.

  19. Precision Searches for Physics Beyond the Standard Model

    CERN Document Server

    Roberts, B Lee

    2009-01-01

    The "precision" frontier, which is closely related to the "intensity" frontier, provides a complementary path to the discovery of physics beyond the Standard Model. Several examples of discoveries that would change our view of the physical world are: Charged lepton flavor violation, e.g. muon electron conversion; the discovery of a permanent electric dipole moment of the electron, neutron, muon or a nucleus. In this paper I focus mostly on phenomena mediated by a dipole interaction, including the anomalous magnetic moment of the muon.

  20. Enhanced hybrid search algorithm for protein structure prediction using the 3D-HP lattice model.

    Science.gov (United States)

    Zhou, Changjun; Hou, Caixia; Zhang, Qiang; Wei, Xiaopeng

    2013-09-01

    The problem of protein structure prediction in the hydrophobic-polar (HP) lattice model is the prediction of protein tertiary structure. This problem is usually referred to as the protein folding problem. This paper presents a method for the application of an enhanced hybrid search algorithm to the problem of protein folding prediction, using the three dimensional (3D) HP lattice model. The enhanced hybrid search algorithm is a combination of the particle swarm optimizer (PSO) and tabu search (TS) algorithms. Since the PSO algorithm entraps local minimum in later evolution extremely easily, we combined PSO with the TS algorithm, which has properties of global optimization. Since the technologies of crossover and mutation are applied many times to PSO and TS algorithms, so enhanced hybrid search algorithm is called the MCMPSO-TS (multiple crossover and mutation PSO-TS) algorithm. Experimental results show that the MCMPSO-TS algorithm can find the best solutions so far for the listed benchmarks, which will help comparison with any future paper approach. Moreover, real protein sequences and Fibonacci sequences are verified in the 3D HP lattice model for the first time. Compared with the previous evolutionary algorithms, the new hybrid search algorithm is novel, and can be used effectively to predict 3D protein folding structure. With continuous development and changes in amino acids sequences, the new algorithm will also make a contribution to the study of new protein sequences.

  1. A New Retrieval Model Based on TextTiling for Document Similarity Search

    Institute of Scientific and Technical Information of China (English)

    Xiao-Jun Wan; Yu-Xin Peng

    2005-01-01

    Document similarity search is to find documents similar to a given query document and return a ranked list of similar documents to users, which is widely used in many text and web systems, such as digital library, search engine,etc. Traditional retrieval models, including the Okapi's BM25 model and the Smart's vector space model with length normalization, could handle this problem to some extent by taking the query document as a long query. In practice,the Cosine measure is considered as the best model for document similarity search because of its good ability to measure similarity between two documents. In this paper, the quantitative performances of the above models are compared using experiments. Because the Cosine measure is not able to reflect the structural similarity between documents, a new retrieval model based on TextTiling is proposed in the paper. The proposed model takes into account the subtopic structures of documents. It first splits the documents into text segments with TextTiling and calculates the similarities for different pairs of text segments in the documents. Lastly the overall similarity between the documents is returned by combining the similarities of different pairs of text segments with optimal matching method. Experiments are performed and results show:1) the popular retrieval models (the Okapi's BM25 model and the Smart's vector space model with length normalization)do not perform well for document similarity search; 2) the proposed model based on TextTiling is effective and outperforms other models, including the Cosine measure; 3) the methods for the three components in the proposed model are validated to be appropriately employed.

  2. 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.

  3. Statistical Combination of Several Important Standard Model Higgs Boson Search Channels.

    CERN Document Server

    The ATLAS collaboration

    2009-01-01

    In this note we describe statistical procedures for combination of results from independent searches for the Higgs boson. Here only the Standard Model Higgs is considered, although the methods can easily be extended to non-standard Higgs models as well as to other searches. The methods are applied to Monte Carlo studies of four important search channels: H to tau+ tau-, H to W+ W- to e-nu mu-nu, H to gamma gamma, and H to ZZ)(*) to 4 leptons. The statistical treatment relies on a large sample approximation that is expected to be valid for an integrated luminosity of at least 2 fb-1 . Results are presented for the expected statistical significance of discovery and expected exclusion limits.

  4. 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.

  5. 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.

  6. Accounting for anatomical noise in search-capable model observers for planar nuclear imaging.

    Science.gov (United States)

    Sen, Anando; Gifford, Howard C

    2016-01-01

    Model observers intended to predict the diagnostic performance of human observers should account for the effects of both quantum and anatomical noise. We compared the abilities of several visual-search (VS) and scanning Hotelling-type models to account for anatomical noise in a localization receiver operating characteristic (LROC) study involving simulated nuclear medicine images. Our VS observer invoked a two-stage process of search and analysis. The images featured lesions in the prostate and pelvic lymph nodes. Lesion contrast and the geometric resolution and sensitivity of the imaging collimator were the study variables. A set of anthropomorphic mathematical phantoms was imaged with an analytic projector based on eight parallel-hole collimators with different sensitivity and resolution properties. The LROC study was conducted with human observers and the channelized nonprewhitening, channelized Hotelling (CH) and VS model observers. The CH observer was applied in a "background-known-statistically" protocol while the VS observer performed a quasi-background-known-exactly task. Both of these models were applied with and without internal noise in the decision variables. A perceptual search threshold was also tested with the VS observer. The model observers without inefficiencies failed to mimic the average performance trend for the humans. The CH and VS observers with internal noise matched the humans primarily at low collimator sensitivities. With both internal noise and the search threshold, the VS observer attained quantitative agreement with the human observers. Computational efficiency is an important advantage of the VS observer.

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

  8. 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.

  9. 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.

  10. 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.

  11. Multi-robot active SLAM under limited communication range%通讯范围受限条件下的多机器人主动SLAM

    Institute of Scientific and Technical Information of China (English)

    吴晓琳; 宋萌; 苑晶; 孙凤池; 陶通

    2012-01-01

    针对机器人通讯范围受限的问题,提出一种新的多机器人协作同时定位与建图(simultaneous localization and mapping,SLAM)方法.多个机器人采用基于最优控制的主动探索策略,创建自身周围区域的子地图,在每个建图周期内使用扩展的卡尔曼滤波器(extended Kalman filter,EKF)估计和维护子地图状态,并在一个周期结束后联络其通讯范围内的其他机器人,进行子地图的传递与融合.同时,为避免由通讯范围受限带来的地图过度融合问题,每个机器人保存每个建图周期内的局部子地图,待与其他机器人相遇时只传递并融合子地图的增量部分.仿真实验验证了该方法的有效性.%For the problem of communication constraint between robots caused by limited communication range, a new approach for cooperative multi-robot simultaneous localization and mapping (SLAM) is proposed. The robots adopt an active exploration strategy based on optimal control to build submaps around themselves, and use the extended Kalman filter(EKF) to estimate and maintain the states of submaps during every map-building cycle, and connect with other robots at the end of every cycle, sending and fusing submaps. At the same time, in order to avoid the over-fusion problem, which is introduced by limited communication range, it is suggested to save the submaps of every map-buildig cycle, sending and fusing the incremental parts when the robots meet each other. Simulation results validate the effectiveness of the presented approach.

  12. An Intelligent Man-Machine Interface-Multi-Robot Control Adapted for Task Engagement Based on Single-Trial Detectability of P300.

    Science.gov (United States)

    Kirchner, Elsa A; Kim, Su K; Tabie, Marc; Wöhrle, Hendrik; Maurus, Michael; Kirchner, Frank

    2016-01-01

    Advanced man-machine interfaces (MMIs) are being developed for teleoperating robots at remote and hardly accessible places. Such MMIs make use of a virtual environment and can therefore make the operator immerse him-/herself into the environment of the robot. In this paper, we present our developed MMI for multi-robot control. Our MMI can adapt to changes in task load and task engagement online. Applying our approach of embedded Brain Reading we improve user support and efficiency of interaction. The level of task engagement was inferred from the single-trial detectability of P300-related brain activity that was naturally evoked during interaction. With our approach no secondary task is needed to measure task load. It is based on research results on the single-stimulus paradigm, distribution of brain resources and its effect on the P300 event-related component. It further considers effects of the modulation caused by a delayed reaction time on the P300 component evoked by complex responses to task-relevant messages. We prove our concept using single-trial based machine learning analysis, analysis of averaged event-related potentials and behavioral analysis. As main results we show (1) a significant improvement of runtime needed to perform the interaction tasks compared to a setting in which all subjects could easily perform the tasks. We show that (2) the single-trial detectability of the event-related potential P300 can be used to measure the changes in task load and task engagement during complex interaction while also being sensitive to the level of experience of the operator and (3) can be used to adapt the MMI individually to the different needs of users without increasing total workload. Our online adaptation of the proposed MMI is based on a continuous supervision of the operator's cognitive resources by means of embedded Brain Reading. Operators with different qualifications or capabilities receive only as many tasks as they can perform to avoid mental

  13. An Intelligent Man-Machine Interface—Multi-Robot Control Adapted for Task Engagement Based on Single-Trial Detectability of P300

    Science.gov (United States)

    Kirchner, Elsa A.; Kim, Su K.; Tabie, Marc; Wöhrle, Hendrik; Maurus, Michael; Kirchner, Frank

    2016-01-01

    Advanced man-machine interfaces (MMIs) are being developed for teleoperating robots at remote and hardly accessible places. Such MMIs make use of a virtual environment and can therefore make the operator immerse him-/herself into the environment of the robot. In this paper, we present our developed MMI for multi-robot control. Our MMI can adapt to changes in task load and task engagement online. Applying our approach of embedded Brain Reading we improve user support and efficiency of interaction. The level of task engagement was inferred from the single-trial detectability of P300-related brain activity that was naturally evoked during interaction. With our approach no secondary task is needed to measure task load. It is based on research results on the single-stimulus paradigm, distribution of brain resources and its effect on the P300 event-related component. It further considers effects of the modulation caused by a delayed reaction time on the P300 component evoked by complex responses to task-relevant messages. We prove our concept using single-trial based machine learning analysis, analysis of averaged event-related potentials and behavioral analysis. As main results we show (1) a significant improvement of runtime needed to perform the interaction tasks compared to a setting in which all subjects could easily perform the tasks. We show that (2) the single-trial detectability of the event-related potential P300 can be used to measure the changes in task load and task engagement during complex interaction while also being sensitive to the level of experience of the operator and (3) can be used to adapt the MMI individually to the different needs of users without increasing total workload. Our online adaptation of the proposed MMI is based on a continuous supervision of the operator's cognitive resources by means of embedded Brain Reading. Operators with different qualifications or capabilities receive only as many tasks as they can perform to avoid mental

  14. 基于实时栅格法的多机器人协作建图%Multi-robot Collaboration Mapping Based on Real-Time Grid Method

    Institute of Scientific and Technical Information of China (English)

    王曙光; 唐浩漾

    2014-01-01

    针对多机器人协作建立空间地图的问题,提出一种实时栅格法,通过控制机器人的编队,在探索环境的过程中,实时生成栅格地图,并标示出障碍的位置。机器人之间采用定向红外测距和无线通信技术保持多机器人的编队形态,同时划分栅格区域。用领导-跟随法和VHF+避障法控制编队绕过障碍。论证了该方法的基本原理及可行性,在InnoSTAR机器人平台上验证了该方法的有效性。该方法计算简单,占用存储空间小,可以使用简单廉价的传感器在小型机器人上实现,但必须要精确控制机器人编队的相对位置。%Aiming at the problem of multi-robot collaboration mapping,a real-time grid method was proposed. Grid map was cre-ated during exploration through controlling robot formations,and the obstacle was located. Using wireless communication and direction-al infrared ranging technology,the fleet formation was maintained,grid area was divided at the same time. Adapting leader-following method and VHF+ obstacle avoidance method,the formation was controlled to round obstacle. The principle and feasibility of the method were demonstrated. The effectiveness of the method was verified with InnoSTAR robot. This method has simple calculation,and it occupies less storage space,can be realized on small robot with simple sensors,but the relative position of the robot fleet must be controlled.

  15. A model independent S/W framework for search-based software testing.

    Science.gov (United States)

    Oh, Jungsup; Baik, Jongmoon; Lim, Sung-Hwa

    2014-01-01

    In Model-Based Testing (MBT) area, Search-Based Software Testing (SBST) has been employed to generate test cases from the model of a system under test. However, many types of models have been used in MBT. If the type of a model has changed from one to another, all functions of a search technique must be reimplemented because the types of models are different even if the same search technique has been applied. It requires too much time and effort to implement the same algorithm over and over again. We propose a model-independent software framework for SBST, which can reduce redundant works. The framework provides a reusable common software platform to reduce time and effort. The software framework not only presents design patterns to find test cases for a target model but also reduces development time by using common functions provided in the framework. We show the effectiveness and efficiency of the proposed framework with two case studies. The framework improves the productivity by about 50% when changing the type of a model.

  16. A Regime Switching Model of Schooling Choice as a Job Search Process

    Directory of Open Access Journals (Sweden)

    Yong Hyun Shin

    2015-01-01

    Full Text Available We propose a regime switching model of schooling choice as a job search process. We adopt a two-state Markov process and the derived coupled Bellman equations are solved by seeking the root of an auxiliary algebraic equation. Some numerical examples are also considered.

  17. Research Universities for National Rejuvenation and Global Influence: China's Search for a Balanced Model

    Science.gov (United States)

    Postiglione, Gerard A.

    2015-01-01

    The search continues for a Chinese research university model that can balance quality and quantity in research and teaching. This paper argues that finding one depends upon deepening internationalization, defining educational sovereignty, and expanding university autonomy. The paper does this by examining selected aspects in the development of the…

  18. 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 jet

  19. Research Universities for National Rejuvenation and Global Influence: China's Search for a Balanced Model

    Science.gov (United States)

    Postiglione, Gerard A.

    2015-01-01

    The search continues for a Chinese research university model that can balance quality and quantity in research and teaching. This paper argues that finding one depends upon deepening internationalization, defining educational sovereignty, and expanding university autonomy. The paper does this by examining selected aspects in the development of the…

  20. Searches for Higgs bosons beyond the Standard Model using the ATLAS experiment

    CERN Document Server

    Ferrari, Arnaud; The ATLAS collaboration

    2015-01-01

    Two searches for additional charged and neutral Higgs bosons, as predicted by Two-Higgs-Doublet Models, are presented. These analyses are based on the 2012 pp collision dataset collected by ATLAS at a center-of-mass energy of 8 TeV. Upper limits are presented, as well as their interpretation in CP-conserving 2HDMs.

  1. 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…

  2. Variations in offer arrival rates in a stationary search model : a note

    NARCIS (Netherlands)

    Rao Sahib, Padma

    2001-01-01

    The standard search model predicts that the hazard and the expected accepted wage should be constant over an unemployment spell. This note shows that heterogeneity in job o®er arrival rates can generate declining hazards and declining accepted wages, results in conformity with the empirical evidence

  3. Search for the standard model Higgs boson in $\\bm{\\ell\

    CERN Document Server

    ,

    2013-01-01

    We present, in detail, a search for the standard model Higgs boson, $H$, in final states with a charged lepton (electron or muon), missing energy, and two or more jets in data corresponding to 9.7 fb$^{-1}$ of integrated luminosity collected at a center of mass energy of $\\sqrt{s}$ = 1.96 TeV with the D0 detector at the Fermilab Tevatron $p\\bar{p}$ Collider. The search uses $b$-jet identification to categorize events for improved signal versus background separation and is sensitive to associated production of the $H$ with a $W$ boson, $WH\\to\\ell\

  4. 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.

  5. Resource discovery algorithm based on hierarchical model and Conscious search in Grid computing system

    Directory of Open Access Journals (Sweden)

    Nasim Nickbakhsh

    2017-03-01

    Full Text Available The distributed system of Grid subscribes the non-homogenous sources at a vast level in a dynamic manner. The resource discovery manner is very influential on the efficiency and of quality the system functionality. The “Bitmap” model is based on the hierarchical and conscious search model that allows for less traffic and low number of messages in relation to other methods in this respect. This proposed method is based on the hierarchical and conscious search model that enhances the Bitmap method with the objective to reduce traffic, reduce the load of resource management processing, reduce the number of emerged messages due to resource discovery and increase the resource according speed. The proposed method and the Bitmap method are simulated through Arena tool. This proposed model is abbreviated as RNTL.

  6. Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians

    Science.gov (United States)

    Portugal, R.; Fernandes, T. D.

    2017-04-01

    Quantum search on the two-dimensional lattice with one marked vertex and cyclic boundary conditions is an important problem in the context of quantum algorithms with an interesting unfolding. It avails to test the ability of quantum walk models to provide efficient algorithms from the theoretical side and means to implement quantum walks in laboratories from the practical side. In this paper, we rigorously prove that the recent-proposed staggered quantum walk model provides an efficient quantum search on the two-dimensional lattice, if the reflection operators associated with the graph tessellations are used as Hamiltonians, which is an important theoretical result for validating the staggered model with Hamiltonians. Numerical results show that on the two-dimensional lattice staggered models without Hamiltonians are not as efficient as the one described in this paper and are, in fact, as slow as classical random-walk-based algorithms.

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

  8. Searches for Exotic physics beyond the Standard Model with the ATLAS detector

    CERN Document Server

    Haley, Joseph; The ATLAS collaboration

    2015-01-01

    An overview of Exotic physics searches with the ATLAS detector is given in this presentation, highlighting selected LHC Run 1 results as well as first Run 2 results (if available). The Standard Model of particle physics is thought to be “completed” with the discovery of the Higgs boson, though many yet to be answered questions remain, such as dark matter, baryon asymmetry of the Universe, neutrino masses, quark/lepton generations, etc. New physics scenarios addressing these questions predict new particles/phenomena in a wide range of topologies/final states, motivating us to develop signature-based search strategy. This talk will summarize ATLAS results on Exotic physics searches and future prospects at the LHC.

  9. 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.

  10. A Quasi-Model-Independent Search for New High $p_{T}$ Physics at DZero

    CERN Document Server

    Abbott, B; Abolins, M; Abramov, V; Acharya, B S; Adams, D L; Adams, M; Alves, G A; Amos, N; Anderson, E W; Baarmand, M M; Babintsev, V V; Babukhadia, L R; Bacon, Trevor C; Baden, A; Baldin, B Yu; Balm, P W; Todorova-Nová, S; Barberis, E; Baringer, P; Bartlett, J F; Bassler, U; Bauer, D; Bean, A; Begel, M; Belyaev, A; Beri, S B; Bernardi, G; Bertram, I; Besson, A; Beuselinck, R; Bezzubov, V A; Bhat, P C; Bhatnagar, V; Bhattacharjee, M; Blazey, G C; Blessing, S; Böhnlein, A; Bozhko, N; Borcherding, F; Brandt, A; Breedon, R; Briskin, G M; Brock, R; Brooijmans, G; Bross, A; Buchholz, D; Bühler, M; Büscher, V; Burtovoi, V S; Butler, J M; Canelli, F; Carvalho, W S; Casey, D; Casilum, Z; Castilla-Valdez, H; Chakraborty, D; Chan, K M; Chekulaev, S V; Cho, D K; Choi, S; Chopra, S; Christenson, J H; Chung, M; Claes, D; Clark, A R; Cochran, J; Coney, L; Connolly, B; Cooper, W E; Coppage, D; Cummings, M A C; Cutts, D; Davis, G A; Davis, K; De, K; Del Signore, K; Demarteau, M; Demina, R; Demine, P; Denisov, D S; Denisov, S P; Desai, S V; Diehl, H T; Diesburg, M; DiLoreto, G; Doulas, S; Draper, P; Ducros, Y; Dudko, L V; Duensing, S; Duflot, L; Dugad, S R; Dyshkant, A; Edmunds, D; Ellison, J; Elvira, V D; Engelmann, R; Eno, S; Eppley, G; Ermolov, P; Eroshin, O V; Estrada, J; Evans, H; Evdokimov, V N; Fahland, T; Fehér, S; Fein, D; Ferbel, T; Filthaut, Frank; Fisk, H E; Fisyak, Yu; Flattum, E M; Fleuret, F; Fortner, M R; Frame, K C; Fuess, S; Gallas, E J; Galjaev, A N; Gao, M; Gavrilov, V; Genik, R J; Genser, K; Gerber, C E; Gershtein, Yu; Gilmartin, R; Ginther, G; Gómez, B; Gómez, G; Goncharov, P I; González-Solis, J L; Gordon, H; Goss, L T; Gounder, K; Goussiou, A; Graf, N; Graham, G; Grannis, P D; Green, J A; Greenlee, H; Grinstein, S; Groer, L S; Grünendahl, S; Sen-Gupta, A; Gurzhev, S N; Gutíerrez, G; Gutíerrez, P; Hadley, N J; Haggerty, H; Hagopian, S L; Hagopian, V; Hahn, K S; Hall, R E; Hanlet, P; Hansen, S; Hauptman, J M; Hays, C; Hebert, C; Hedin, D; Heinson, A P; Heintz, U; Heuring, T C; Hirosky, R; Hobbs, J D; Hoeneisen, B; Hoftun, J S; Hou, S; Huang, Y; Illingworth, R; Ito, A S; Jaffré, M; Jerger, S A; Jesik, R; Johns, K; Johnson, M; Jonckheere, A; Jones, M; Jöstlein, H; Juste, A; Kahn, S; Kajfasz, E; Karmanov, D E; Karmgard, D J; Kim, S K; Klima, B; Klopfenstein, C; Knuteson, B; Ko, W; Kohli, J M; Kostritskii, A V; Kotcher, J; Kotwal, A V; Kozelov, A V; Kozlovskii, E A; Krane, J; Krishnaswamy, M R; Krzywdzinski, S; Kubantsev, M A; Kuleshov, S; Kulik, Y; Kunori, S; Kuznetsov, V E; Landsberg, G L; Leflat, A; Leggett, C; Lehner, F; Li, J; Li, Q Z; Lima, J G R; Lincoln, D; Linn, S L; Linnemann, J T; Lipton, R; Lucotte, A; Lueking, L H; Lundstedt, C; Luo, C; Maciel, A K A; Madaras, R J; Manankov, V; Mao, H S; Marshall, T; Martin, M I; Martin, R D; Mauritz, K M; May, B; Mayorov, A A; McCarthy, R; McDonald, J; McMahon, T; Melanson, H L; Meng, X C; Merkin, M; Merritt, K W B; Miao, C; Miettinen, H; Mihalcea, D; Mishra, C S; Mokhov, N V; Mondal, N K; Montgomery, H E; Moore, R W; Mostafa, M A; Da Motta, H; Nagy, E; Nang, F; Narain, M; Narasimham, V S; Neal, H A; Negret, J P; Negroni, S; Norman, D; Nunnemann, T; Oesch, L H; Oguri, V; Olivier, B; Oshima, N; Padley, P; Pan, L J; Papageorgiou, K; Para, A; Parashar, N; Partridge, R; Parua, N; Paterno, M; Patwa, A; Pawlik, B; Perkins, J; Peters, M; Peters, O; Petroff, P; Piegaia, R; Piekarz, H; Pope, B G; Popkov, E; Prosper, H B; Protopopescu, S D; Qian, J; Quintas, P Z; Raja, R; Rajagopalan, S; Ramberg, E; Rapidis, P A; Reay, N W; Reucroft, S; Rha, J; Ridel, M; Rijssenbeek, M; Rockwell, T; Roco, M T; Rubinov, P; Ruchti, R C; Santoro, A F S; Sawyer, L; Schamberger, R D; Schellman, H; Schwartzman, A; Sen, N; Shabalina, E; Shivpuri, R K; Shpakov, D; Shupe, M A; Sidwell, R A; Simák, V; Singh, H; Singh, J B; Sirotenko, V I; Slattery, P F; Smith, E; Smith, R P; Snihur, R; Snow, G A; Snow, J; Snyder, S; Solomon, J; Sorin, V; Sosebee, M; Sotnikova, N; Soustruznik, K; Souza, M; Stanton, N R; Steinbruck, G; Stephens, R W; Stichelbaut, F; Stoker, D; Stolin, V; Stoyanova, D A; Strauss, M; Strovink, M; Stutte, L; Sznajder, A; Taylor, W; Tentindo-Repond, S; Thompson, J; Toback, D; Tripathi, S M; Trippe, T G; Turcot, A S; Tuts, P M; Van Gemmeren, P; Vaniev, V; Van Kooten, R; Varelas, N; Volkov, A A; Vorobev, A P; Wahl, H D; Wang, H; Wang, Z M; Warchol, J; Watts, G; Wayne, M; Weerts, H; White, A; White, J T; Whiteson, D; Wightman, J A; Wijngaarden, D A; Willis, S; Wimpenny, S J; Wirjawan, J V D; Womersley, J; Wood, D R; Yamada, R; Yamin, P; Yasuda, T; Yip, K; Youssef, S; Yu, J; Yu, Z; Zanabria, M E; Zheng, H; Zhou, Z; Zielinski, M; Zieminska, D; Zieminski, A; Zutshi, V; Zverev, E G; Zylberstejn, A

    2001-01-01

    We apply a quasi-model-independent strategy ("Sleuth") to search for new high p_T physics in approximately 100 pb^-1 of ppbar collisions at sqrt(s) = 1.8 TeV collected by the DZero 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.

  11. Quasi-Model-Independent Search for New High pT Physics at D0

    Science.gov (United States)

    Abbott, B.; Abdesselam, A.; Abolins, M.; Abramov, V.; Acharya, B. S.; Adams, D. L.; Adams, M.; Alves, G. A.; Amos, N.; Anderson, E. W.; Baarmand, M. M.; Babintsev, V. V.; Babukhadia, L.; Bacon, T. C.; Baden, A.; Baldin, B.; Balm, P. W.; Banerjee, S.; Barberis, E.; Baringer, P.; Bartlett, J. F.; Bassler, U.; Bauer, D.; Bean, A.; Begel, M.; Belyaev, A.; Beri, S. B.; Bernardi, G.; Bertram, I.; Besson, A.; Beuselinck, R.; Bezzubov, V. A.; Bhat, P. C.; Bhatnagar, V.; Bhattacharjee, M.; Blazey, G.; Blessing, S.; Boehnlein, A.; Bojko, N. I.; Borcherding, F.; Brandt, A.; Breedon, R.; Briskin, G.; Brock, R.; Brooijmans, G.; Bross, A.; Buchholz, D.; Buehler, M.; Buescher, V.; Burtovoi, V. S.; Butler, J. M.; Canelli, F.; Carvalho, W.; Casey, D.; Casilum, Z.; Castilla-Valdez, H.; Chakraborty, D.; Chan, K. M.; Chekulaev, S. V.; Cho, D. K.; Choi, S.; Chopra, S.; Christenson, J. H.; Chung, M.; Claes, D.; Clark, A. R.; Cochran, J.; Coney, L.; Connolly, B.; Cooper, W. E.; Coppage, D.; Cummings, M. A.; Cutts, D.; Davis, G. A.; Davis, K.; de, K.; del Signore, K.; Demarteau, M.; Demina, R.; Demine, P.; Denisov, D.; Denisov, S. P.; Desai, S.; Diehl, H. T.; Diesburg, M.; di Loreto, G.; Doulas, S.; Draper, P.; Ducros, Y.; Dudko, L. V.; Duensing, S.; Duflot, L.; Dugad, S. R.; Dyshkant, A.; Edmunds, D.; Ellison, J.; Elvira, V. D.; Engelmann, R.; Eno, S.; Eppley, G.; Ermolov, P.; Eroshin, O. V.; Estrada, J.; Evans, H.; Evdokimov, V. N.; Fahland, T.; Feher, S.; Fein, D.; Ferbel, T.; Filthaut, F.; Fisk, H. E.; Fisyak, Y.; Flattum, E.; Fleuret, F.; Fortner, M.; Frame, K. C.; Fuess, S.; Gallas, E.; Galyaev, A. N.; Gao, M.; Gavrilov, V.; Genik, R. J.; Genser, K.; Gerber, C. E.; Gershtein, Y.; Gilmartin, R.; Ginther, G.; Gómez, B.; Gómez, G.; Goncharov, P. I.; González Solís, J. L.; Gordon, H.; Goss, L. T.; Gounder, K.; Goussiou, A.; Graf, N.; Graham, G.; Grannis, P. D.; Green, J. A.; Greenlee, H.; Grinstein, S.; Groer, L.; Grünendahl, S.; Gupta, A.; Gurzhiev, S. N.; Gutierrez, G.; Gutierrez, P.; Hadley, N. J.; Haggerty, H.; Hagopian, S.; Hagopian, V.; Hahn, K. S.; Hall, R. E.; Hanlet, P.; Hansen, S.; Hauptman, J. M.; Hays, C.; Hebert, C.; Hedin, D.; Heinson, A. P.; Heintz, U.; Heuring, T.; Hirosky, R.; Hobbs, J. D.; Hoeneisen, B.; Hoftun, J. S.; Hou, S.; Huang, Y.; Illingworth, R.; Ito, A. S.; Jaffré, M.; Jerger, S. A.; Jesik, R.; Johns, K.; Johnson, M.; Jonckheere, A.; Jones, M.; Jöstlein, H.; Juste, A.; Kahn, S.; Kajfasz, E.; Karmanov, D.; Karmgard, D.; Kim, S. K.; Klima, B.; Klopfenstein, C.; Knuteson, B.; Ko, W.; Kohli, J. M.; Kostritskiy, A. V.; Kotcher, J.; Kotwal, A. V.; Kozelov, A. V.; Kozlovsky, E. A.; Krane, J.; Krishnaswamy, M. R.; Krzywdzinski, S.; Kubantsev, M.; Kuleshov, S.; Kulik, Y.; Kunori, S.; Kuznetsov, V. E.; Landsberg, G.; Leflat, A.; Leggett, C.; Lehner, F.; Li, J.; Li, Q. Z.; Lima, J. G.; Lincoln, D.; Linn, S. L.; Linnemann, J.; Lipton, R.; Lucotte, A.; Lueking, L.; Lundstedt, C.; Luo, C.; Maciel, A. K.; Madaras, R. J.; Manankov, V.; Mao, H. S.; Marshall, T.; Martin, M. I.; Martin, R. D.; Mauritz, K. M.; May, B.; Mayorov, A. A.; McCarthy, R.; McDonald, J.; McMahon, T.; Melanson, H. L.; Meng, X. C.; Merkin, M.; Merritt, K. W.; Miao, C.; Miettinen, H.; Mihalcea, D.; Mishra, C. S.; Mokhov, N.; Mondal, N. K.; Montgomery, H. E.; Moore, R. W.; Mostafa, M.; da Motta, H.; Nagy, E.; Nang, F.; Narain, M.; Narasimham, V. S.; Neal, H. A.; Negret, J. P.; Negroni, S.; Norman, D.; Nunnemann, T.; Oesch, L.; Oguri, V.; Olivier, B.; Oshima, N.; Padley, P.; Pan, L. J.; Papageorgiou, K.; Para, A.; Parashar, N.; Partridge, R.; Parua, N.; Paterno, M.; Patwa, A.; Pawlik, B.; Perkins, J.; Peters, M.; Peters, O.; Pétroff, P.; Piegaia, R.; Piekarz, H.; Pope, B. G.; Popkov, E.; Prosper, H. B.; Protopopescu, S.; Qian, J.; Quintas, P. Z.; Raja, R.; Rajagopalan, S.; Ramberg, E.; Rapidis, P. A.; Reay, N. W.; Reucroft, S.; Rha, J.; Ridel, M.; Rijssenbeek, M.; Rockwell, T.; Roco, M.; Rubinov, P.; Ruchti, R.; Rutherfoord, J.; Santoro, A.; Sawyer, L.; Schamberger, R. D.; Schellman, H.; Schwartzman, A.; Sen, N.; Shabalina, E.; Shivpuri, R. K.; Shpakov, D.; Shupe, M.; Sidwell, R. A.; Simak, V.; Singh, H.; Singh, J. B.; Sirotenko, V.; Slattery, P.; Smith, E.; Smith, R. P.; Snihur, R.; Snow, G. R.; Snow, J.; Snyder, S.; Solomon, J.; Sorín, V.; Sosebee, M.; Sotnikova, N.; Soustruznik, K.; Souza, M.; Stanton, N. R.; Steinbrück, G.; Stephens, R. W.; Stichelbaut, F.; Stoker, D.; Stolin, V.; Stoyanova, D. A.; Strauss, M.; Strovink, M.; Stutte, L.; Sznajder, A.; Taylor, W.; Tentindo-Repond, S.; Thompson, J.; Toback, D.; Tripathi, S. M.; Trippe, T. G.; Turcot, A. S.; Tuts, P. M.; van Gemmeren, P.; Vaniev, V.; van Kooten, R.; Varelas, N.; Volkov, A. A.; Vorobiev, A. P.; Wahl, H. D.; Wang, H.; Wang, Z.-M.; Warchol, J.; Watts, G.; Wayne, M.; Weerts, H.; White, A.; White, J. T.; Whiteson, D.; Wightman, J. A.; Wijngaarden, D. A.; Willis, S.; Wimpenny, S. J.; Wirjawan, J. V.; Womersley, J.; Wood, D. R.; Yamada, R.; Yamin, P.; Yasuda, T.; Yip, K.; Youssef, S.; Yu, J.; Yu, Z.; Zanabria, M.; Zheng, H.; Zhou, Z.; Zielinski, M.; Zieminska, D.; Zieminski, A.; Zutshi, V.; Zverev, E. G.; Zylberstejn, A.

    2001-04-01

    We apply a quasi-model-independent strategy (``Sleuth'') to search for new high pT physics in ~100 pb-1 of pp¯ collisions at 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.

  12. Searching the charged Higgs boson of the type III two Higss doublet model

    CERN Document Server

    Cardenas, H

    2008-01-01

    In the framework of the Two Higgs Doublet Model (2HDM) type III appears two charged Higgs boson and recently there are experimental reports from D0 and CDF collaborations searching a particular signature of new physics. We present a review of the analisys done in the region $M_{H^+}>m_t$ by D0 collaboration and we use the ratio $R_\\sigma$ for the region $M_{H^+} < m_t$ in different scenarios of space parameter of this model.

  13. Beyond the Standard ModelSearches with a Free-Electron Laser

    Energy Technology Data Exchange (ETDEWEB)

    A. Afanasev, O.K. Baker, K.B. Beard, G. Biallas, J. Boyce, M. Minarni, R. Ramdon, Michelle D. Shinn, P. Slocumb

    2010-02-01

    Much of the focus of Beyond the Standard Model physics searches is on the TeV scale, making use of hadron and lepton colliders. Additionally, however, there is the means to make these searches in different regions of parameter space using sub-electron volt photons from a Free Electron Laser, for example. We report on the experimental results of searches for opticalwavelength photons mixing with hypothetical hidden-sector paraphotons in the mass range between 10^-5 and 10^-2 electron volts for a mixing parameter greater than 10-7. We also report on the results of a sensitive search for scalar coupling of photons to light neutral bosons in the mass range of approximately 1.0 milli-electron volts and coupling strength greater than 10-6 GeV-1. These were generation-regeneration experiments using the “light shining through a wall” technique in which regenerated photons are searched for downstream of an optical barrier that separates it from an upstream generation region. The present results indicate no evidence for photon-paraphoton mixing or for scalar couplings of bosons to photons for the range of parameters investigated.

  14. Fast Tree Search for A Triangular Lattice Model of Protein Folding

    Institute of Scientific and Technical Information of China (English)

    Xiaomei Li; Nengchao Wang

    2004-01-01

    Using a triangular lattice model to study the designability of protein folding, we overcame the parity problem of previous cubic lattice model and enumerated all the sequences and compact structures on a simple two-dimensional triangular lattice model of size 4+5+6+5+4. We used two types of amino acids, hydrophobic and polar, to make up the sequences, and achieved 223+212 different sequences excluding the reverse symmetry sequences. The total string number of distinct compact structures was 219,093, excluding reflection symmetry in the self-avoiding path of length 24 triangular lattice model. Based on this model, we applied a fast search algorithm by constructing a cluster tree. The algorithm decreased the computation by computing the objective energy of non-leaf nodes. The parallel experiments proved that the fast tree search algorithm yielded an exponential speed-up in the model of size 4+5+6+5+4. Designability analysis was performed to understand the search result.

  15. 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

  16. Heterogeneous Multi-Robot Cooperation

    Science.gov (United States)

    1994-02-01

    the objects the robots manipulate are hazardous waste. I have not actually applied the robots to reA toxic waste spills, since they are simply small...1993] Bruce Randall Donald, James Jennings, and Daniela Rus. To- wards a theory of information invariants for cooperating autonomous mobile robots

  17. Applying Statistical Models and Parametric Distance Measures for Music Similarity Search

    Science.gov (United States)

    Lukashevich, Hanna; Dittmar, Christian; Bastuck, Christoph

    Automatic deriving of similarity relations between music pieces is an inherent field of music information retrieval research. Due to the nearly unrestricted amount of musical data, the real-world similarity search algorithms have to be highly efficient and scalable. The possible solution is to represent each music excerpt with a statistical model (ex. Gaussian mixture model) and thus to reduce the computational costs by applying the parametric distance measures between the models. In this paper we discuss the combinations of applying different parametric modelling techniques and distance measures and weigh the benefits of each one against the others.

  18. 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.

  19. Search for the Standard Model Scalar Decaying to Fermions at CMS

    CERN Document Server

    Dutta, Valentina

    2013-01-01

    The latest results of the search for the standard model scalar boson in fermionic decay channels at the CMS experiment are presented. The dataset used corresponds to an integrated luminosity of 5 $fb^{-1}$ of proton-proton collision data collected at $\\sqrt{s}$ = 7 TeV and up to 19.4 $fb^{-1}$ collected at $\\sqrt{s}$ = 8 TeV. The analyses described include the searches for the standard model scalar decaying to tau pairs and to a pair of b-quarks. In the tau-pair nal state, an excess of events is observed over a broad range of SM scalar mass hypotheses, with a maximum local signicance of 2.93 standard deviations at $m_H$ = 120 GeV. The excess is compatible with the presence of a standard model scalar boson of mass 125 GeV.

  20. 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.

  1. Inference in Non-Linear Panels with Partially Missing Observations: The Case of the Equilibrium Search Model

    DEFF Research Database (Denmark)

    Christensen, Bent J.; M. Kiefer, Nicholas

    1996-01-01

    A thorough econometric analysis of the pure equilibrium search model is given. Minimal data requirements for estimation are unemployment durations, wages, and employment durations. An assessment of the information contribution of each data element is given. The results define the range of potential...... application of the equilibrium search framework and form the foundation for future econometric analysis of related models....

  2. Linear fuzzy gene network models obtained from microarray data by exhaustive search

    Directory of Open Access Journals (Sweden)

    Quong Judy N

    2004-08-01

    Full Text Available Abstract Background Recent technological advances in high-throughput data collection allow for experimental study of increasingly complex systems on the scale of the whole cellular genome and proteome. Gene network models are needed to interpret the resulting large and complex data sets. Rationally designed perturbations (e.g., gene knock-outs can be used to iteratively refine hypothetical models, suggesting an approach for high-throughput biological system analysis. We introduce an approach to gene network modeling based on a scalable linear variant of fuzzy logic: a framework with greater resolution than Boolean logic models, but which, while still semi-quantitative, does not require the precise parameter measurement needed for chemical kinetics-based modeling. Results We demonstrated our approach with exhaustive search for fuzzy gene interaction models that best fit transcription measurements by microarray of twelve selected genes regulating the yeast cell cycle. Applying an efficient, universally applicable data normalization and fuzzification scheme, the search converged to a small number of models that individually predict experimental data within an error tolerance. Because only gene transcription levels are used to develop the models, they include both direct and indirect regulation of genes. Conclusion Biological relationships in the best-fitting fuzzy gene network models successfully recover direct and indirect interactions predicted from previous knowledge to result in transcriptional correlation. Fuzzy models fit on one yeast cell cycle data set robustly predict another experimental data set for the same system. Linear fuzzy gene networks and exhaustive rule search are the first steps towards a framework for an integrated modeling and experiment approach to high-throughput "reverse engineering" of complex biological systems.

  3. 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.

  4. 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.

  5. Prediction of job search intentions and behaviors: Testing the social cognitive model of career self-management.

    Science.gov (United States)

    Lim, Robert H; Lent, Robert W; Penn, Lee T

    2016-10-01

    We present 2 studies testing the recently developed social-cognitive model of career self-management (Lent & Brown, 2013) in the context of the job search process. In the first study, a sample of 243 unemployed job seekers completed measures of job search self-efficacy, outcome expectations, social support, search intentions, conscientiousness, and perceived control (or volition) over the outcomes of the job search. The latter variable was added to the social-cognitive model to examine the possibility, derived from the psychology of working perspective, that perceived volition might moderate the relation of self-efficacy to job search intentions. The second study included 240 graduating college seniors and focused on the utility of the social-cognitive, personality, and perceived outcome control variables in predicting active engagement in the job search process. Path analyses indicated that the model generally fit the data well in both studies. In Study 1, self-efficacy and outcome expectations mediated the relations of the other predictors to job search intentions. In Study 2, job search intentions produced the primary direct path to subsequent job search behaviors; conscientiousness, support, and outcome control related to job search behavior indirectly through self-efficacy and its linkage to intentions. Outcome control moderated self-efficacy/intention relations only in Study 2, and the pattern of moderation was contrary to expectations. Implications for further inquiry and practice with job seekers are discussed. (PsycINFO Database Record (c) 2016 APA, all rights reserved).

  6. 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.

  7. 机器人世界杯足球锦标赛中多机器人对目标协同定位算法的改进%Improvements of collaborative localization algorithm of multi-robot on target in ROBOCUP

    Institute of Scientific and Technical Information of China (English)

    张彦铎; 李哲靖; 鲁统伟

    2013-01-01

    Armed at the accuracy and stability of data processing by density-based spatial clustering of applications with noise algorithm(DBSCAN), an improved DBSCAN clustering algorithm was used to raise the accuracy of multi-robot cooperative localization on platform of the Robot World Cup (ROBOCUP) autonomous robot. The information fusion model of cooperative localization was established by studying the self-positioning and targeting of a single-robot. The distance threshold was introduced in the improved DBSCAN algorithm, by combining the actual condition of less distance of observation, the higher accuracy, the data which might be deleted by DBSCAN was kept by comparing the actual distance to the distance threshold. In this way, the size and accuracy rating of data was improved and the error of observation information and instability of data was reduced. In the experiment, the traditional DBSCAN clustering algorithm and improved DBSCAN clustering algorithm were both used in the data fusion of same observation point on robot platform. The experiment results show that the integration of data is stable by the improved algorithm with the EPS changes; the data fusion is more stable and accurate using improved DBSCAN clustering algorithm, in which the robot distance threshold is used on real ROBOCUP autonomous robot platform.%以机器人世界杯足球锦标赛(ROBOCUP)中全自主机器人平台为对象,针对传统的基于密度空间聚类方法(DBSCAN)在对数据处理的精准度和稳定性上的出现的问题,提出了引入机器人距离阈值的改进DBSCAN算法,以提高多机器人协同定位的准确度.首先通过研究单个机器人自定位和目标定位,建立协同定位信息融合的模型;然后该算法通过引入机器人距离阈值,结合平台实际,即机器人测控距离越近测控的精度越高,将传统基于密度空间的聚类方法中有可能被剔除掉的数据,通过与阈值的对比而决定是否保留,提高融合数

  8. Beyond Standard Model Searches in the MiniBooNE Experiment

    Directory of Open Access Journals (Sweden)

    Teppei Katori

    2015-01-01

    Full Text Available The MiniBooNE experiment has contributed substantially to beyond standard model searches in the neutrino sector. The experiment was originally designed to test the Δm2~1 eV2 region of the sterile neutrino hypothesis by observing νe(ν-e charged current quasielastic signals from a νμ(ν-μ beam. MiniBooNE observed excesses of νe and ν-e candidate events in neutrino and antineutrino mode, respectively. To date, these excesses have not been explained within the neutrino standard model (νSM; the standard model extended for three massive neutrinos. Confirmation is required by future experiments such as MicroBooNE. MiniBooNE also provided an opportunity for precision studies of Lorentz violation. The results set strict limits for the first time on several parameters of the standard-model extension, the generic formalism for considering Lorentz violation. Most recently, an extension to MiniBooNE running, with a beam tuned in beam-dump mode, is being performed to search for dark sector particles. This review describes these studies, demonstrating that short baseline neutrino experiments are rich environments in new physics searches.

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

    Science.gov (United States)

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

    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 ~t1-χ 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 ET, 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.

  10. Search for the Standard Model Higgs Boson Produced in Association with Top Quarks

    Energy Technology Data Exchange (ETDEWEB)

    Wilson, Jonathan Samuel [Ohio State U.

    2011-01-01

    We have performed a search for the Standard Model Higgs boson produced in association with top quarks in the lepton plus jets channel. We impose no constraints on the decay of the Higgs boson. We employ ensembles of neural networks to discriminate events containing a Higgs boson from the dominant tt¯background, and set upper bounds on the Higgs production cross section. At a Higgs boson mass mH = 120 GeV/c2 , we expect to exclude a cross section 12.7 times the Standard Model prediction, and we observe an exclusion 27.4 times the Standard Model prediction with 95 % confidence.

  11. Search for the Standard Model Higgs boson decay to $\\mu^{+}\\mu^{-}$ with the ATLAS detector

    CERN Document Server

    Aad, Georges; Abdallah, Jalal; Abdel Khalek, Samah; Abdinov, Ovsat; Aben, Rosemarie; Abi, Babak; Abolins, Maris; AbouZeid, Ossama; Abramowicz, Halina; Abreu, Henso; Abreu, Ricardo; Abulaiti, Yiming; Acharya, Bobby Samir; Adamczyk, Leszek; Adams, David; Adelman, Jahred; Adomeit, Stefanie; Adye, Tim; Agatonovic-Jovin, Tatjana; Aguilar-Saavedra, Juan Antonio; Agustoni, Marco; Ahlen, Steven; Ahmadov, Faig; Aielli, Giulio; Akerstedt, Henrik; Åkesson, Torsten Paul Ake; Akimoto, Ginga; Akimov, Andrei; Alberghi, Gian Luigi; Albert, Justin; Albrand, Solveig; Alconada Verzini, Maria Josefina; Aleksa, Martin; Aleksandrov, Igor; Alexa, Calin; Alexander, Gideon; Alexandre, Gauthier; Alexopoulos, Theodoros; Alhroob, Muhammad; Alimonti, Gianluca; Alio, Lion; Alison, John; Allbrooke, Benedict; Allison, Lee John; Allport, Phillip; Almond, John; Aloisio, Alberto; Alonso, Alejandro; Alonso, Francisco; Alpigiani, Cristiano; Altheimer, Andrew David; Alvarez Gonzalez, Barbara; Alviggi, Mariagrazia; Amako, Katsuya; Amaral Coutinho, Yara; Amelung, Christoph; Amidei, Dante; Amor Dos Santos, Susana Patricia; Amorim, Antonio; Amoroso, Simone; Amram, Nir; Amundsen, Glenn; Anastopoulos, Christos; Ancu, Lucian Stefan; Andari, Nansi; Andeen, Timothy; Anders, Christoph Falk; Anders, Gabriel; Anderson, Kelby; Andreazza, Attilio; Andrei, George Victor; Anduaga, Xabier; Angelidakis, Stylianos; Angelozzi, Ivan; Anger, Philipp; Angerami, Aaron; Anghinolfi, Francis; Anisenkov, Alexey; Anjos, Nuno; Annovi, Alberto; Antonaki, Ariadni; Antonelli, Mario; Antonov, Alexey; Antos, Jaroslav; Anulli, Fabio; Aoki, Masato; Aperio Bella, Ludovica; Apolle, Rudi; Arabidze, Giorgi; Aracena, Ignacio; Arai, Yasuo; Araque, Juan Pedro; Arce, Ayana; Arguin, Jean-Francois; Argyropoulos, Spyridon; Arik, Metin; Armbruster, Aaron James; Arnaez, Olivier; Arnal, Vanessa; Arnold, Hannah; Arratia, Miguel; Arslan, Ozan; Artamonov, Andrei; Artoni, Giacomo; Asai, Shoji; Asbah, Nedaa; Ashkenazi, Adi; Åsman, Barbro; Asquith, Lily; Assamagan, Ketevi; Astalos, Robert; Atkinson, Markus; Atlay, Naim Bora; Auerbach, Benjamin; Augsten, Kamil; Aurousseau, Mathieu; Avolio, Giuseppe; Azuelos, Georges; Azuma, Yuya; Baak, Max; Baas, Alessandra; Bacci, Cesare; Bachacou, Henri; Bachas, Konstantinos; Backes, Moritz; Backhaus, Malte; Backus Mayes, John; Badescu, Elisabeta; Bagiacchi, Paolo; Bagnaia, Paolo; Bai, Yu; Bain, Travis; Baines, John; Baker, Oliver Keith; Balek, Petr; Balli, Fabrice; Banas, Elzbieta; Banerjee, Swagato; Bannoura, Arwa A E; Bansal, Vikas; Bansil, Hardeep Singh; Barak, Liron; Baranov, Sergei; Barberio, Elisabetta Luigia; Barberis, Dario; Barbero, Marlon; Barillari, Teresa; Barisonzi, Marcello; Barklow, Timothy; Barlow, Nick; Barnett, Bruce; Barnett, Michael; Barnovska, Zuzana; Baroncelli, Antonio; Barone, Gaetano; Barr, Alan; Barreiro, Fernando; Barreiro Guimarães da Costa, João; Bartoldus, Rainer; Barton, Adam Edward; Bartos, Pavol; Bartsch, Valeria; Bassalat, Ahmed; Basye, Austin; Bates, Richard; Batley, Richard; Battaglia, Marco; Battistin, Michele; Bauer, Florian; Bawa, Harinder Singh; Beattie, Michael David; Beau, Tristan; Beauchemin, Pierre-Hugues; Beccherle, Roberto; Bechtle, Philip; Beck, Hans Peter; Becker, Anne Kathrin; Becker, Sebastian; Beckingham, Matthew; Becot, Cyril; Beddall, Andrew; Beddall, Ayda; Bedikian, Sourpouhi; Bednyakov, Vadim; Bee, Christopher; Beemster, Lars; Beermann, Thomas; Begel, Michael; Behr, Katharina; Belanger-Champagne, Camille; Bell, Paul; Bell, William; Bella, Gideon; Bellagamba, Lorenzo; Bellerive, Alain; Bellomo, Massimiliano; Belotskiy, Konstantin; Beltramello, Olga; Benary, Odette; Benchekroun, Driss; Bendtz, Katarina; Benekos, Nektarios; Benhammou, Yan; Benhar Noccioli, Eleonora; Benitez Garcia, Jorge-Armando; Benjamin, Douglas; Bensinger, James; Benslama, Kamal; Bentvelsen, Stan; Berge, David; Bergeaas Kuutmann, Elin; Berger, Nicolas; Berghaus, Frank; Beringer, Jürg; Bernard, Clare; Bernat, Pauline; Bernius, Catrin; Bernlochner, Florian Urs; Berry, Tracey; Berta, Peter; Bertella, Claudia; Bertoli, Gabriele; Bertolucci, Federico; Bertsche, Carolyn; Bertsche, David; Besana, Maria Ilaria; Besjes, Geert-Jan; Bessidskaia, Olga; Bessner, Martin Florian; Besson, Nathalie; Betancourt, Christopher; Bethke, Siegfried; Bhimji, Wahid; Bianchi, Riccardo-Maria; Bianchini, Louis; Bianco, Michele; Biebel, Otmar; Bieniek, Stephen Paul; Bierwagen, Katharina; Biesiada, Jed; Biglietti, Michela; Bilbao De Mendizabal, Javier; Bilokon, Halina; Bindi, Marcello; Binet, Sebastien; Bingul, Ahmet; Bini, Cesare; Black, Curtis; Black, James

    2014-01-01

    A search is reported for Higgs boson decay to $\\mu^{+}\\mu^{-}$ using data with an integrated luminosity of $24.8~\\rm{fb}^{-1}$ collected with the ATLAS detector in $pp$ collisions at $\\sqrt{s}=$7 and 8 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 \\rightarrow \\mu^+\\mu^-$) of $1.5\\times10^{-3}$.

  12. Forecasting influenza in Hong Kong with Google search queries and statistical model fusion.

    Science.gov (United States)

    Xu, Qinneng; Gel, Yulia R; Ramirez Ramirez, L Leticia; Nezafati, Kusha; Zhang, Qingpeng; Tsui, Kwok-Leung

    2017-01-01

    The objective of this study is to investigate predictive utility of online social media and web search queries, particularly, Google search data, to forecast new cases of influenza-like-illness (ILI) in general outpatient clinics (GOPC) in Hong Kong. To mitigate the impact of sensitivity to self-excitement (i.e., fickle media interest) and other artifacts of online social media data, in our approach we fuse multiple offline and online data sources. Four individual models: generalized linear model (GLM), least absolute shrinkage and selection operator (LASSO), autoregressive integrated moving average (ARIMA), and deep learning (DL) with Feedforward Neural Networks (FNN) are employed to forecast ILI-GOPC both one week and two weeks in advance. The covariates include Google search queries, meteorological data, and previously recorded offline ILI. To our knowledge, this is the first study that introduces deep learning methodology into surveillance of infectious diseases and investigates its predictive utility. Furthermore, to exploit the strength from each individual forecasting models, we use statistical model fusion, using Bayesian model averaging (BMA), which allows a systematic integration of multiple forecast scenarios. For each model, an adaptive approach is used to capture the recent relationship between ILI and covariates. DL with FNN appears to deliver the most competitive predictive performance among the four considered individual models. Combing all four models in a comprehensive BMA framework allows to further improve such predictive evaluation metrics as root mean squared error (RMSE) and mean absolute predictive error (MAPE). Nevertheless, DL with FNN remains the preferred method for predicting locations of influenza peaks. The proposed approach can be viewed a feasible alternative to forecast ILI in Hong Kong or other countries where ILI has no constant seasonal trend and influenza data resources are limited. The proposed methodology is easily tractable

  13. Adjustment and Development of Health User’s Mental Model Completeness Scale in Search Engines

    Directory of Open Access Journals (Sweden)

    Maryam Nakhoda

    2016-10-01

    Full Text Available Introduction: Users’ performance and their interaction with information retrieval systems can be observed in development of their mental models. Users, especially users of health, use mental models to facilitate their interactions with these systems and incomplete or incorrect models can cause problems for them . The aim of this study was the adjustment and development of health user’s mental model completeness scale in search engines. Method: This quantitative study uses Delphi method. Among various scales for users’ mental model completeness, Li’s scale was selected and some items were added to this scale based on previous valid literature. Delphi panel members were selected using purposeful sampling method, consisting of 20 and 18 participants in the first and second rounds, respectively. Kendall’s Coefficient of Concordance in SPSS version 16 was used as basis for agreement (95% confidence. Results:The Kendall coefficient of Concordance (W was calculated to be 0.261(P-value<0.001 for the first and 0.336 (P-value<0.001 for the second round. Therefore, the study was found to be statistically significant with 95% confidence. Since the increase in the coefficient in two consecutive rounds was very little (equal to 0.075, surveying the panel members were stopped based on second Schmidt criterion and Delphi method was stopped after the second round. Finally, the dimensions of Li’s scale (existence and nature, search characteristics and levels of interaction were confirmed again, but “indexing of pages or websites” was eliminated and “Difference between results of different search engines”, “possibility of access to similar or related webpages”, and “possibility of search for special formats and multimedia” were added to Li’s scale. Conclusion: In this study, the scale for mental model completeness of health users was adjusted and developed; it can help the designers of information retrieval systems in systematic

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

    CERN Document Server

    Barate, R; Ghez, P; Goy, C; Jézéquel, S; Lees, J P; Martin, F; Merle, E; Minard, M N; Pietrzyk, B; Bravo, S; Casado, M P; Chmeissani, M; Crespo, J M; Fernández, E; Fernández-Bosman, M; Garrido, L; Graugès-Pous, E; López, J; Martínez, 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, Giuseppe; 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, Timothy L; Boix, G; Buchmüller, O L; Cattaneo, M; Cerutti, F; Clerbaux, B; Dissertori, G; Drevermann, H; Forty, Roger W; Frank, M; Gianotti, F; Greening, T C; Hansen, J B; Harvey, J; Hutchcroft, D E; Janot, P; Jost, B; Kado, M; Lemaître, V; Maley, P; Mato, P; Minten, Adolf G; Moutoussi, A; Ranjard, F; Rolandi, Luigi; Schlatter, W D; Schmitt, M; Schneider, O; Spagnolo, P; Tejessy, W; Teubert, F; Tournefier, E; Valassi, Andrea; Ward, J J; Wright, A E; Ajaltouni, Ziad J; 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; Wäänänen, A; Daskalakis, G; Kyriakis, A; Markou, C; Simopoulou, Errietta; Vayaki, Anna; Blondel, A; Brient, J C; Machefert, F P; Rougé, A; Swynghedauw, M; Tanaka, R; Videau, H L; 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; Pepé-Altarelli, M; Chalmers, M; Halley, A W; Kennedy, J; Lynch, J G; Negus, P; O'Shea, V; Räven, B; Smith, D; Teixeira-Dias, P; Thompson, A S; Cavanaugh, R J; Dhamotharan, S; Geweniger, C; Hanke, P; Hepp, V; Kluge, E E; Leibenguth, G; Putzer, A; Tittel, K; Werner, S; Wunsch, M; Beuselinck, R; Binnie, David M; Cameron, W; Davies, G; Dornan, Peter J; Girone, M; Marinelli, N; Nowell, J; Przysiezniak, H; Sedgbeer, J K; Thompson, J C; Thomson, E; 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; Hölldorfer, F; Jakobs, K; Kleinknecht, K; Kröcker, M; Müller, A S; Nürnberger, H A; Quast, G; Renk, B; Rohne, E; Sander, H G; Schmeling, S; Wachsmuth, H W; 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, S S; Ragusa, F; David, A; Dietl, H; Ganis, G; Heister, A; Hüttmann, K; Lütjens, G; Mannert, C; Männer, W; Moser, H G; Schael, S; Settles, Ronald; 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 Régie, J B; Yuan, C; Zerwas, D; Bagliesi, G; Boccali, T; Calderini, G; Ciulli, V; Foà, L; Giammanco, A; Giassi, A; Ligabue, F; Messineo, A; Palla, Fabrizio; Rizzo, G; Sanguinetti, G; Sciabà, A; Sguazzoni, G; Tenchini, Roberto; Venturi, A; Verdini, P G; Blair, G A; Coles, J; Cowan, G D; 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, B; Boumediene, D E; Colas, P; Fabbro, B; Lançon, E; Lemaire, M C; Locci, E; Pérez, P; Rander, J; Renardy, J F; Rosowsky, A; Seager, P; Trabelsi, A; Tuchming, B; Vallage, B; Konstantinidis, N P; Loomis, C; Litke, A M; Taylor, G; Booth, C N; Cartwright, S L; Combley, F; Hodgson, P N; Lehto, M H; Thompson, L F; Affholderbach, K; Böhrer, A; Brandt, S; Grupen, Claus; Hess, J; Misiejuk, A; Prange, G; Sieler, U; Borean, C; Giannini, G; Gobbo, B; He, H; Pütz, J; Rothberg, J E; Wasserbaech, S R; Armstrong, S R; Cranmer, K; Elmer, P; Ferguson, D P S; Gao, Y; González, S; Hayes, O J; Hu, H; Jin, S; Kile, J; McNamara, P A; Nielsen, J; Orejudos, W; Pan, Y B; Saadi, Y; Scott, I J; Shao, N; Von Wimmersperg-Töller, J H; Steinberger, J; 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.

  15. Observation of an excess in the search for the Standard Model Higgs boson at ALEPH

    Science.gov (United States)

    ALEPH Collaboration; Barate, R.; De Bonis, I.; Decamp, D.; Ghez, P.; 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.; Graugés, E.; Lopez, J.; Martinez, M.; Merino, G.; Miquel, R.; Mir, Ll. 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.; Buchmüller, 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, J.; Hutchcroft, D. E.; Janot, P.; Jost, B.; Kado, M.; Lemaitre, V.; Maley, P.; Mato, P.; Minten, A.; Moutoussi, A.; Ranjard, F.; Rolandi, L.; 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.; Wäänänen, A.; Daskalakis, G.; Kyriakis, A.; Markou, C.; Simopoulou, E.; Vayaki, A.; Blondel, A.; Brient, J.-C.; Machefert, F.; Rougé, 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, E.; 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.; Hölldorfer, F.; Jakobs, K.; Kleinknecht, K.; Kröcker, M.; Müller, A.-S.; Nürnberger, 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, S.; Ragusa, F.; David, A.; Dietl, H.; Ganis, G.; Heister, A.; Hüttmann, K.; Lütjens, G.; Mannert, C.; Männer, W.; Moser, H.-G.; Schael, S.; Settles, R.; Stenzel, H.; Wolf, G.; Boucrot, J.; Callot, O.; Davier, M.; Duflot, L.; Grivaz, J.-F.; Heusse, Ph.; Jacholkowska, A.; Serin, L.; Veillet, J.-J.; Videau, I.; de Vivie de Régie, J.-B.; Yuan, C.; Zerwas, D.; Bagliesi, G.; Boccali, T.; Calderini, G.; Ciulli, V.; Foà, L.; Giammanco, A.; Giassi, A.; Ligabue, F.; Messineo, A.; Palla, F.; Rizzo, G.; Sanguinetti, G.; Sciabà, A.; Sguazzoni, G.; Steinberger, J.; 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, B.; Boumediene, D.; Colas, P.; Fabbro, B.; Lançon, 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.; Böhrer, A.; 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.; González, S.; Hayes, O. J.; Hu, H.; Jin, S.; Kile, J.; McNamara, P. A.; 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, S. L.; Wu, X.; Zobernig, G.

    2000-12-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 209GeV. An excess of /3σ beyond the background expectation is found, consistent with the production of the Higgs boson with a mass near 114GeV/c2. Much of this excess is seen in the four-jet analyses, where three high purity events are selected.

  16. Search for Higgs boson in beyond standard model scenarios at large hadron collider

    Indian Academy of Sciences (India)

    Kajari Mazumdar; on behalf of the ATLAS and CMS Collaborations

    2007-11-01

    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. Main results from the recently published studies of CMS collaboration are only included in this write-up.

  17. A Survey of Data Management System for Cloud Computing: Models and Searching Methods

    Directory of Open Access Journals (Sweden)

    Linhua Zhou

    2013-06-01

    Full Text Available At present, the research of data storage and management in cloud computing mainly focuses on dealing with data expression and search. This study gives a comprehensive survey of numerous models and approaches of data-intensive applications in cloud computing in both academic and industrial communities. We review various approaches and their ideas of design. And then, we attempt to summarize and appraise the open issues.

  18. Searching For Exotic Physics Beyond the Standard Model: Extrapolation Until the End of Run-3

    CERN Document Server

    Genest, Marie-Hel\\`ene; The ATLAS collaboration

    2017-01-01

    The prospects of looking for exotic beyond-the-Standard-Model physics with the ATLAS and CMS detectors at the LHC in the rest of Run-2 and in Run-3 will be reviewed. A few selected analyses will be discussed, showing the gain in sensitivity that can be achieved by accumulating more data and comparing the current limits with the predicted reach. Some limiting factors will be identified, along with ideas on how to improve on the searches.

  19. Model of the Search and Rescue operations in Republic of Serbia

    Directory of Open Access Journals (Sweden)

    Svetislav ŠoŁkic

    2015-06-01

    Definition of terms Rescue: An operation to retrieve persons in distress, provide for their initial medical or other needs and deliver them to a place of safety. Work should contribute to the establishment of thinking for model of SAR in Republic of Serbia due to the growing need of interventions in the prevention and elimination of consequences of natural disasters and better organization of search and rescue using the standards prescribed in the the world.

  20. Status of searches for Higgs and physics beyond the standard model at CDF

    Energy Technology Data Exchange (ETDEWEB)

    Tsybychev, D.; /Florida U.

    2004-12-01

    This article presents selected experimental results on searches for Higgs and physics beyond the standard model (BSM) at the Collider Detector at Fermilab (CDF). The results are based on about 350 pb{sup -1} of proton-antiproton collisions data at {radical}s = 1.96 TeV, collected during Run II of the Tevatron. No evidence of signal was found and limits on the production cross section of various physics processes BSM are derived.

  1. Coordinated Dynamic Load Distribution for Multi-Robot Collaborative Towing System%多机器人协同吊运系统的协调动态载荷分配

    Institute of Scientific and Technical Information of China (English)

    赵志刚; 吕恬生

    2012-01-01

    针对多机器人共同吊运同一个物体形成闭运动链的协调系统,利用牛顿-欧拉法建立了系统的广义动力学方程.研究了多机器人协调吊运系统动态载荷的一种实时性分配方法.根据各机器人的承载力,用线性加权方法使被吊运物质心处的内力有限并获得了系统的载荷分配原则.随后根据被吊运物的期望运动,给出了系统动态载荷分配的解析表达式,并进而可计算得到各机器人的期望工作载荷.最后,采用ABB工业机器人搭建吊运平台,实验验证所获得的载荷分配方法.研究结果为进一步研究多移动机器人协调吊运系统的载荷分配问题打下基础.%A closed-kinematic chain composed of multi-robot manipulators used to tow a common object is presented. The generalized dynamic equation is given by use of the Newton-Euler principle, and an efficient real-time dynamic load distribution method is studied for the multi-robot collaborative towing system. Subject to the bearing capacity of each robot manipulator, the load distribution principle for the system is given by a linear weighting algorithm that can make the internal force on the mass center of the object limited. Subsequently, according to the expected trajectory of the object, the analytical formulation of the dynamic load distribution for the system is attained, and the expected operating force of each robot manipulator is calculated and obtained. Finally, three ABB robot manipulators are used to build a towing stand, that can validate the proposed load distribution method. The results can serve as the foundation for further research on load distribution problem of mobile multi-robot collaborative towing system.

  2. Recognition-based online Kurdish character recognition using hidden Markov model and harmony search

    Directory of Open Access Journals (Sweden)

    Rina D. Zarro

    2017-04-01

    Full Text Available In this paper a hidden Markov model and harmony search algorithms are combined for writer independent online Kurdish character recognition. The Markov model is integrated as an intermediate group classifier instead of a main character classifier/recognizer as in most of previous works. Markov model is used to classify each group of characters, according to their forms, into smaller sub groups based on common directional feature vector. This process reduced the processing time taken by the later recognition stage. The small number of candidate characters are then processed by harmony search recognizer. The harmony search recognizer uses a dominant and common movement pattern as a fitness function. The objective function is used to minimize the matching score according to the fitness function criteria and according to the least score for each segmented group of characters. Then, the system displays the generated word which has the lowest score from the generated character combinations. The system was tested on a dataset of 4500 words structured with 21,234 characters in different positions or forms (isolated, start, middle and end. The system scored 93.52% successful recognition rate with an average of 500 ms. The system showed a high improvement in recognition rate when compared to similar systems that use HMM as its main recognizer.

  3. 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.

  4. 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.

  5. Application of Harmony Search algorithm to the solution of groundwater management models

    Science.gov (United States)

    Tamer Ayvaz, M.

    2009-06-01

    This study proposes a groundwater resources management model in which the solution is performed through a combined simulation-optimization model. A modular three-dimensional finite difference groundwater flow model, MODFLOW is used as the simulation model. This model is then combined with a Harmony Search (HS) optimization algorithm which is based on the musical process of searching for a perfect state of harmony. The performance of the proposed HS based management model is tested on three separate groundwater management problems: (i) maximization of total pumping from an aquifer (steady-state); (ii) minimization of the total pumping cost to satisfy the given demand (steady-state); and (iii) minimization of the pumping cost to satisfy the given demand for multiple management periods (transient). The sensitivity of HS algorithm is evaluated by performing a sensitivity analysis which aims to determine the impact of related solution parameters on convergence behavior. The results show that HS yields nearly same or better solutions than the previous solution methods and may be used to solve management problems in groundwater modeling.

  6. The Search Performance Evaluation and Prediction in Exploratory Search

    OpenAIRE

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

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

  8. 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.

  9. 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.

  10. New displaying models of bibliographic data and resources: cataloguing/resource description and search results

    Directory of Open Access Journals (Sweden)

    Antonella Trombone

    2014-07-01

    Full Text Available The logical model outlined in Functional Requirements for Bibliographic Records in 1998 has led to a theoretical reflection on the function of data and their organization into catalogues that hasn’t found stable effects in the representation of information yet. A consequence of the wide theoretical resonance of FRBR report was the review of regulatory codes and standards for electronic recording of bibliographic data. The first code that partly implements the FRBR model is the Italian one, published in 2009, the Italian cataloguing Rules: REICAT. The revision the Anglo-American cataloging rules has resulted in a new tool, based on the FRBR model and not set as a cataloging code: RDA. Resource Description and Access, released in 2010. To changing patterns of information models and contents’ media it has to add new information environment available to users, accustomed to using search engines as information retrieval tools, powerful and generalist.Today’s electronic catalogs are based on MARC formats for encoding of information, aimed at sharing and exchanging bibliographic records. However, the library data encoded in MARC exchange formats are invisible to search engines.Gradually, over the last few years, software modules devoted to cataloging have been differentiated from those for consultation, data visualization interfaces dedicated to users aimed to simplify the search mechanisms.One of the open issues relating to the new display systems concerns the selection and presentation of data. The sorting order is based on the criteria of relevance, which is based on scores that a software assigns to the record in relation to the weight or importance of the words entered in the search string.The new display systems of users ‘ searches, the discovery platforms that simultaneously query heterogeneous data bases for content and location, including also the OPACs, no longer use the languages of librarianship. The final display of search results

  11. 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...

  12. 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...

  13. 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.

  14. 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.

  15. Standard Model Higgs boson searches with the ATLAS detector at the Large Hadron Collider

    Indian Academy of Sciences (India)

    Aleandro Nisati; on behalf of the ATLAS Collaboration

    2012-10-01

    The investigation of the mechanism responsible for electroweak symmetry breaking is one of the most important tasks of the scientific program of the Large Hadron Collider. The experimental results on the search of the Standard Model Higgs boson with 1 to 2 fb-1 of proton–proton collision data at $\\sqrt{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 of a Higgs boson is excluded at 95% Confidence Level for the mass regions 144–232, 256–282 and 296–466 GeV.

  16. Experimental Search for Chargino and Neutralino Production in Supersymmetry Models with a Light Gravitino

    Science.gov (United States)

    Abbott, B.; Abolins, M.; Acharya, B. S.; Adam, I.; Adams, D. L.; Adams, M.; Ahn, S.; Aihara, H.; Alves, G. A.; Amidi, E.; Amos, N.; Anderson, E. W.; Astur, R.; Baarmand, M. M.; Baden, A.; Balamurali, V.; Balderston, J.; Baldin, B.; Banerjee, S.; Bantly, J.; Bartlett, J. F.; Bazizi, K.; Belyaev, A.; Beri, S. B.; Bertram, I.; Bezzubov, V. A.; Bhat, P. C.; Bhatnagar, V.; Bhattacharjee, M.; Biswas, N.; Blazey, G.; Blessing, S.; Bloom, P.; Boehnlein, A.; Bojko, N. I.; Borcherding, F.; Boswell, C.; Brandt, A.; Brock, R.; Bross, A.; Buchholz, D.; Burtovoi, V. S.; Butler, J. M.; Carvalho, W.; Casey, D.; Casilum, Z.; Castilla-Valdez, H.; Chakraborty, D.; Chang, S.-M.; Chekulaev, S. V.; Chen, L.-P.; Chen, W.; Choi, S.; Chopra, S.; Choudhary, B. C.; Christenson, J. H.; Chung, M.; Claes, D.; Clark, A. R.; Cobau, W. G.; Cochran, J.; Cooper, W. E.; Cretsinger, C.; Cullen-Vidal, D.; Cummings, M. A.; Cutts, D.; Dahl, O. I.; Davis, K.; de, K.; del Signore, K.; Demarteau, M.; Denisov, D.; Denisov, S. P.; Diehl, H. T.; Diesburg, M.; di Loreto, G.; Draper, P.; Ducros, Y.; Dudko, L. V.; Dugad, S. R.; Edmunds, D.; Ellison, J.; Elvira, V. D.; Engelmann, R.; Eno, S.; Eppley, G.; Ermolov, P.; Eroshin, O. V.; Evdokimov, V. N.; Fahland, T.; Fatyga, M.; Fatyga, M. K.; Featherly, J.; Feher, S.; Fein, D.; Ferbel, T.; Finocchiaro, G.; Fisk, H. E.; Fisyak, Y.; Flattum, E.; Forden, G. E.; Fortner, M.; Frame, K. C.; Fuess, S.; Gallas, E.; Galyaev, A. N.; Gartung, P.; Geld, T. L.; Genik, R. J.; Genser, K.; Gerber, C. E.; Gibbard, B.; Glenn, S.; Gobbi, B.; Goforth, M.; Goldschmidt, A.; Gómez, B.; Gómez, G.; Goncharov, P. I.; González Solís, J. L.; Gordon, H.; Goss, L. T.; Gounder, K.; Goussiou, A.; Graf, N.; Grannis, P. D.; Green, D. R.; Green, J.; Greenlee, H.; Grim, G.; Grinstein, S.; Grossman, N.; Grudberg, P.; Grünendahl, S.; Guglielmo, G.; Guida, J. A.; Guida, J. M.; Gupta, A.; Gurzhiev, S. N.; Gutierrez, P.; Gutnikov, Y. E.; Hadley, N. J.; Haggerty, H.; Hagopian, S.; Hagopian, V.; Hahn, K. S.; Hall, R. E.; Hanlet, P.; Hansen, S.; Hauptman, J. M.; Hedin, D.; Heinson, A. P.; Heintz, U.; Hernández-Montoya, R.; Heuring, T.; Hirosky, R.; Hobbs, J. D.; Hoeneisen, B.; Hoftun, J. S.; Hsieh, F.; Hu, Ting; Hu, Tong; Huehn, T.; Ito, A. S.; James, E.; Jaques, J.; Jerger, S. A.; Jesik, R.; Jiang, J. Z.-Y.; Joffe-Minor, T.; Johns, K.; Johnson, M.; Jonckheere, A.; Jones, M.; Jöstlein, H.; Jun, S. Y.; Jung, C. K.; Kahn, S.; Kalbfleisch, G.; Kang, J. S.; Kehoe, R.; Kelly, M. L.; Kim, C. L.; Kim, S. K.; Klatchko, A.; Klima, B.; Klopfenstein, C.; Klyukhin, V. I.; Kochetkov, V. I.; Kohli, J. M.; Koltick, D.; Kostritskiy, A. V.; Kotcher, J.; Kotwal, A. V.; Kourlas, J.; Kozelov, A. V.; Kozlovski, E. A.; Krane, J.; Krishnaswamy, M. R.; Krzywdzinski, S.; Kunori, S.; Lami, S.; Lan, H.; Lander, R.; Landry, F.; Landsberg, G.; Lauer, B.; Leflat, A.; Li, H.; Li, J.; Li-Demarteau, Q. Z.; Lima, J. G.; Lincoln, D.; Linn, S. L.; Linnemann, J.; Lipton, R.; Liu, Q.; Liu, Y. C.; Lobkowicz, F.; Loken, S. C.; Lökös, S.; Lueking, L.; Lyon, A. L.; Maciel, A. K.; Madaras, R. J.; Madden, R.; Magaña-Mendoza, L.; Mani, S.; Mao, H. S.; Markeloff, R.; Marshall, T.; Martin, M. I.; Mauritz, K. M.; May, B.; Mayorov, A. A.; McCarthy, R.; McDonald, J.; McKibben, T.; McKinley, J.; McMahon, T.; Melanson, H. L.; Merkin, M.; Merritt, K. W.; Miettinen, H.; Mincer, A.; Mishra, C. S.; Mokhov, N.; Mondal, N. K.; Montgomery, H. E.; Mooney, P.; da Motta, H.; Murphy, C.; Nang, F.; Narain, M.; Narasimham, V. S.; Narayanan, A.; Neal, H. A.; Negret, J. P.; Nemethy, P.; Nicola, M.; Norman, D.; Oesch, L.; Oguri, V.; Oltman, E.; Oshima, N.; Owen, D.; Padley, P.; Pang, M.; Para, A.; Park, Y. M.; Partridge, R.; Parua, N.; Paterno, M.; Perkins, J.; Peters, M.; Piegaia, R.; Piekarz, H.; Pischalnikov, Y.; Podstavkov, V. M.; Pope, B. G.; Prosper, H. B.; Protopopescu, S.; Qian, J.; Quintas, P. Z.; Raja, R.; Rajagopalan, S.; Ramirez, O.; Rasmussen, L.; Reucroft, S.; Rijssenbeek, M.; Rockwell, T.; Roe, N. A.; Rubinov, P.; Ruchti, R.; Rutherfoord, J.; Sánchez-Hernández, A.; Santoro, A.; Sawyer, L.; Schamberger, R. D.; Schellman, H.; Sculli, J.; Shabalina, E.; Shaffer, C.; Shankar, H. C.; Shivpuri, R. K.; Shupe, M.; Singh, H.; Singh, J. B.; Sirotenko, V.; Smart, W.; Smith, R. P.; Snihur, R.; Snow, G. R.; Snow, J.; Snyder, S.; Solomon, J.; Sood, P. M.; Sosebee, M.; Sotnikova, N.; Souza, M.; Spadafora, A. L.; Stephens, R. W.; Stevenson, M. L.; Stewart, D.; Stichelbaut, F.; Stoianova, D. A.; Stoker, D.; Strauss, M.; Streets, K.; Strovink, M.; Sznajder, A.; Tamburello, P.; Tarazi, J.; Tartaglia, M.; Thomas, T. L.; Thompson, J.; Trippe, T. G.; Tuts, P. M.; Varelas, N.; Varnes, E. W.; Vititoe, D.; Volkov, A. A.; Vorobiev, A. P.; Wahl, H. D.; Wang, G.; Warchol, J.; Watts, G.; Wayne, M.; Weerts, H.; White, A.; White, J. T.; Wightman, J. A.; Willis, S.; Wimpenny, S. J.; Wirjawan, J. V.; Womersley, J.; Won, E.; Wood, D. R.; Xu, H.; Yamada, R.; Yamin, P.; Yanagisawa, C.; Yang, J.; Yasuda, T.; Yepes, P.; Yoshikawa, C.; Youssef, S.; Yu, J.; Yu, Y.; Zhu, Z. H.; Zieminska, D.; Zieminski, A.; Zverev, E. G.; Zylberstejn, A.

    1998-01-01

    We search for inclusive high ET diphoton events with large missing transverse energy in pp¯ collisions at s = 1.8 TeV. Such events are expected from pair production of charginos and neutralinos within the framework of the minimal supersymmetric standard model with a light gravitino. No excess of events is observed. In that model, and assuming gaugino mass unification at the GUT scale, we obtain a 95% C.L. exclusion region in the supersymmetry parameter space and lower mass bounds of 150 GeV/c2 for the lightest chargino and 77 GeV/c2 for the lightest neutralino.

  17. Search for Standard Model $ZH \\to \\ell^+\\ell^-b\\bar{b}$ at DØ

    Energy Technology Data Exchange (ETDEWEB)

    Jiang, Peng [Hefei, CUST

    2014-07-01

    We present a search for the Standard Model Higgs boson in the ZH → ℓ + ℓ ₋ $b\\bar{b}$ channel, using data collected with the DØ detector at the Fermilab Tevatron Collider. This analysis is based on a sample of reprocessed data incorporating several improve ments relative to a previous published result, and a modified multivariate analysis strategy. For a Standard Model Higgs boson of mass 125 GeV, the expected cross section limit over the Standard M odel prediction is improved by about 5% compared to the previous published results in this c hannel from the DØ Collaboration

  18. Search for the standard model Higgs boson in the $H \\to ZZ \\to 2l 2\

    CERN Document Server

    Chatrchyan, Serguei; Sirunyan, Albert M; Tumasyan, Armen; Adam, Wolfgang; Bergauer, Thomas; Dragicevic, Marko; Erö, Janos; Fabjan, Christian; Friedl, Markus; Fruehwirth, Rudolf; Ghete, Vasile Mihai; Hammer, Josef; Hoch, Michael; Hörmann, Natascha; Hrubec, Josef; Jeitler, Manfred; Kiesenhofer, Wolfgang; Krammer, Manfred; Liko, Dietrich; Mikulec, Ivan; Pernicka, Manfred; Rahbaran, Babak; Rohringer, Christine; Rohringer, Herbert; Schöfbeck, Robert; Strauss, Josef; Taurok, Anton; Teischinger, Florian; Wagner, Philipp; Waltenberger, Wolfgang; Walzel, Gerhard; Widl, Edmund; Wulz, Claudia-Elisabeth; Mossolov, Vladimir; Shumeiko, Nikolai; Suarez Gonzalez, Juan; Bansal, Sunil; Benucci, Leonardo; Cornelis, Tom; De Wolf, Eddi A; Janssen, Xavier; Luyckx, Sten; Maes, Thomas; Mucibello, Luca; Ochesanu, Silvia; Roland, Benoit; Rougny, Romain; Selvaggi, Michele; Van Haevermaet, Hans; Van Mechelen, Pierre; Van Remortel, Nick; Van Spilbeeck, Alex; Blekman, Freya; Blyweert, Stijn; D'Hondt, Jorgen; Gonzalez Suarez, Rebeca; Kalogeropoulos, Alexis; Maes, Michael; Olbrechts, Annik; Van Doninck, Walter; Van Mulders, Petra; Van Onsem, Gerrit Patrick; Villella, Ilaria; Charaf, Otman; Clerbaux, Barbara; De Lentdecker, Gilles; Dero, Vincent; Gay, Arnaud; Hammad, Gregory Habib; Hreus, Tomas; Léonard, Alexandre; Marage, Pierre Edouard; Thomas, Laurent; Vander Velde, Catherine; Vanlaer, Pascal; Wickens, John; Adler, Volker; Beernaert, Kelly; Cimmino, Anna; Costantini, Silvia; Garcia, Guillaume; Grunewald, Martin; Klein, Benjamin; Lellouch, Jérémie; Marinov, Andrey; Mccartin, Joseph; Ocampo Rios, Alberto Andres; Ryckbosch, Dirk; Strobbe, Nadja; Thyssen, Filip; Tytgat, Michael; Vanelderen, Lukas; Verwilligen, Piet; Walsh, Sinead; Yazgan, Efe; Zaganidis, Nicolas; Basegmez, Suzan; Bruno, Giacomo; Ceard, Ludivine; De Favereau De Jeneret, Jerome; Delaere, Christophe; Du Pree, Tristan; Favart, Denis; Forthomme, Laurent; Giammanco, Andrea; Grégoire, Ghislain; Hollar, Jonathan; Lemaitre, Vincent; Liao, Junhui; Militaru, Otilia; Nuttens, Claude; Pagano, Davide; Pin, Arnaud; Piotrzkowski, Krzysztof; Schul, Nicolas; Beliy, Nikita; Caebergs, Thierry; Daubie, Evelyne; Alves, Gilvan; Correa Martins Junior, Marcos; De Jesus Damiao, Dilson; Martins, Thiago; Pol, Maria Elena; Henrique Gomes E Souza, Moacyr; Aldá Júnior, Walter Luiz; Carvalho, Wagner; Custódio, Analu; Da Costa, Eliza Melo; De Oliveira Martins, Carley; Fonseca De Souza, Sandro; Matos Figueiredo, Diego; Mundim, Luiz; Nogima, Helio; Oguri, Vitor; Prado Da Silva, Wanda Lucia; Santoro, Alberto; Silva Do Amaral, Sheila Mara; Soares Jorge, Luana; Sznajder, Andre; Souza Dos Anjos, Tiago; Bernardes, Cesar Augusto; De Almeida Dias, Flavia; Tomei, Thiago; De Moraes Gregores, Eduardo; Lagana, Caio; Da Cunha Marinho, Franciole; Mercadante, Pedro G; Novaes, Sergio F; Padula, Sandra; Genchev, Vladimir; Iaydjiev, Plamen; Piperov, Stefan; Rodozov, Mircho; Stoykova, Stefka; Sultanov, Georgi; Tcholakov, Vanio; Trayanov, Rumen; Vutova, Mariana; Dimitrov, Anton; Hadjiiska, Roumyana; Karadzhinova, Aneliya; Kozhuharov, Venelin; Litov, Leander; Pavlov, Borislav; Petkov, Peicho; Bian, Jian-Guo; Chen, Guo-Ming; Chen, He-Sheng; Jiang, Chun-Hua; Liang, Dong; Liang, Song; Meng, Xiangwei; Tao, Junquan; Wang, Jian; Wang, Jian; Wang, Xianyou; Wang, Zheng; Xiao, Hong; Xu, Ming; Zang, Jingjing; Zhang, Zhen; Asawatangtrakuldee, Chayanit; Ban, Yong; Guo, Shuang; Guo, Yifei; Li, Wenbo; Liu, Shuai; Mao, Yajun; Qian, Si-Jin; Teng, Haiyun; Wang, Siguang; Zhu, Bo; Zou, Wei; Cabrera, Andrés; Gomez Moreno, Bernardo; Osorio Oliveros, Andres Felipe; Sanabria, Juan Carlos; Godinovic, Nikola; Lelas, Damir; Plestina, Roko; Polic, Dunja; Puljak, Ivica; Antunovic, Zeljko; Dzelalija, Mile; Kovac, Marko; Brigljevic, Vuko; Duric, Senka; Kadija, Kreso; Luetic, Jelena; Morovic, Srecko; Attikis, Alexandros; Galanti, Mario; Mousa, Jehad; Nicolaou, Charalambos; Ptochos, Fotios; Razis, Panos A; Finger, Miroslav; Finger Jr, Michael; Assran, Yasser; Ellithi Kamel, Ali; Khalil, Shaaban; Mahmoud, Mohammed; Radi, Amr; Hektor, Andi; Kadastik, Mario; Müntel, Mait; Raidal, Martti; Rebane, Liis; Tiko, Andres; Azzolini, Virginia; Eerola, Paula; Fedi, Giacomo; Voutilainen, Mikko; Czellar, Sandor; Härkönen, Jaakko; Heikkinen, Mika Aatos; Karimäki, Veikko; Kinnunen, Ritva; Kortelainen, Matti J; Lampén, Tapio; Lassila-Perini, Kati; Lehti, Sami; Lindén, Tomas; Luukka, Panja-Riina; Mäenpää, Teppo; Peltola, Timo; Tuominen, Eija; Tuominiemi, Jorma; Tuovinen, Esa; Ungaro, Donatella; Wendland, Lauri; Banzuzi, Kukka; Korpela, Arja; Tuuva, Tuure; Sillou, Daniel; Besancon, Marc; Choudhury, Somnath; Dejardin, Marc; Denegri, Daniel; Fabbro, Bernard; Faure, Jean-Louis; Ferri, Federico; Ganjour, Serguei; Givernaud, Alain; Gras, Philippe; Hamel de Monchenault, Gautier; Jarry, Patrick; Locci, Elizabeth; Malcles, Julie; Millischer, Laurent; Rander, John; Rosowsky, André; Shreyber, Irina; Titov, Maksym; Baffioni, Stephanie; Beaudette, Florian; Benhabib, Lamia; Bianchini, Lorenzo; Bluj, Michal; Broutin, Clementine; Busson, Philippe; Charlot, Claude; Daci, Nadir; Dahms, Torsten; Dobrzynski, Ludwik; Elgammal, Sherif; Granier de Cassagnac, Raphael; Haguenauer, Maurice; Miné, Philippe; Mironov, Camelia; Ochando, Christophe; Paganini, Pascal; Sabes, David; Salerno, Roberto; Sirois, Yves; Thiebaux, Christophe; Veelken, Christian; Zabi, Alexandre; Agram, Jean-Laurent; Andrea, Jeremy; Bloch, Daniel; Bodin, David; Brom, Jean-Marie; Cardaci, Marco; Chabert, Eric Christian; Collard, Caroline; Conte, Eric; Drouhin, Frédéric; Ferro, Cristina; Fontaine, Jean-Charles; Gelé, Denis; Goerlach, Ulrich; Juillot, Pierre; Karim, Mehdi; Le Bihan, Anne-Catherine; Van Hove, Pierre; Fassi, Farida; Mercier, Damien; Baty, Clement; Beauceron, Stephanie; Beaupere, Nicolas; Bedjidian, Marc; Bondu, Olivier; Boudoul, Gaelle; Boumediene, Djamel; Brun, Hugues; Chasserat, Julien; Chierici, Roberto; Contardo, Didier; Depasse, Pierre; El Mamouni, Houmani; Falkiewicz, Anna; Fay, Jean; Gascon, Susan; Gouzevitch, Maxime; Ille, Bernard; Kurca, Tibor; Le Grand, Thomas; Lethuillier, Morgan; Mirabito, Laurent; Perries, Stephane; Sordini, Viola; Tosi, Silvano; Tschudi, Yohann; Verdier, Patrice; Viret, Sébastien; Lomidze, David; Anagnostou, Georgios; Beranek, Sarah; Edelhoff, Matthias; Feld, Lutz; Heracleous, Natalie; Hindrichs, Otto; Jussen, Ruediger; Klein, Katja; Merz, Jennifer; Ostapchuk, Andrey; Perieanu, Adrian; Raupach, Frank; Sammet, Jan; Schael, Stefan; Sprenger, Daniel; Weber, Hendrik; Wittmer, Bruno; Zhukov, Valery; Ata, Metin; Caudron, Julien; Dietz-Laursonn, Erik; Erdmann, Martin; Güth, Andreas; Hebbeker, Thomas; Heidemann, Carsten; Hoepfner, Kerstin; Klimkovich, Tatsiana; Klingebiel, Dennis; Kreuzer, Peter; Lanske, Dankfried; Lingemann, Joschka; Magass, Carsten; Merschmeyer, Markus; Meyer, Arnd; Olschewski, Mark; Papacz, Paul; Pieta, Holger; Reithler, Hans; Schmitz, Stefan Antonius; Sonnenschein, Lars; Steggemann, Jan; Teyssier, Daniel; Weber, Martin; Bontenackels, Michael; Cherepanov, Vladimir; Davids, Martina; Flügge, Günter; Geenen, Heiko; Geisler, Matthias; Haj Ahmad, Wael; Hoehle, Felix; Kargoll, Bastian; Kress, Thomas; Kuessel, Yvonne; Linn, Alexander; Nowack, Andreas; Perchalla, Lars; Pooth, Oliver; Rennefeld, Jörg; Sauerland, Philip; Stahl, Achim; Zoeller, Marc Henning; Aldaya Martin, Maria; Behrenhoff, Wolf; Behrens, Ulf; Bergholz, Matthias; Bethani, Agni; Borras, Kerstin; Burgmeier, Armin; Cakir, Altan; Calligaris, Luigi; Campbell, Alan; Castro, Elena; Dammann, Dirk; Eckerlin, Guenter; Eckstein, Doris; Flossdorf, Alexander; Flucke, Gero; Geiser, Achim; Hauk, Johannes; Jung, Hannes; Kasemann, Matthias; Katsas, Panagiotis; Kleinwort, Claus; Kluge, Hannelies; Knutsson, Albert; Krämer, Mira; Krücker, Dirk; Kuznetsova, Ekaterina; Lange, Wolfgang; Lohmann, Wolfgang; Lutz, Benjamin; Mankel, Rainer; Marfin, Ihar; Marienfeld, Markus; Melzer-Pellmann, Isabell-Alissandra; Meyer, Andreas Bernhard; Mnich, Joachim; Mussgiller, Andreas; Naumann-Emme, Sebastian; Olzem, Jan; Petrukhin, Alexey; Pitzl, Daniel; Raspereza, Alexei; Ribeiro Cipriano, Pedro M; Rosin, Michele; Salfeld-Nebgen, Jakob; Schmidt, Ringo; Schoerner-Sadenius, Thomas; Sen, Niladri; Spiridonov, Alexander; Stein, Matthias; Tomaszewska, Justyna; Walsh, Roberval; Wissing, Christoph; Autermann, Christian; Blobel, Volker; Bobrovskyi, Sergei; Draeger, Jula; Enderle, Holger; Erfle, Joachim; Gebbert, Ulla; Görner, Martin; Hermanns, Thomas; Höing, Rebekka Sophie; Kaschube, Kolja; Kaussen, Gordon; Kirschenmann, Henning; Klanner, Robert; Lange, Jörn; Mura, Benedikt; Nowak, Friederike; Pietsch, Niklas; Sander, Christian; Schettler, Hannes; Schleper, Peter; Schlieckau, Eike; Schmidt, Alexander; Schröder, Matthias; Schum, Torben; Stadie, Hartmut; Steinbrück, Georg; Thomsen, Jan; Barth, Christian; Berger, Joram; Chwalek, Thorsten; De Boer, Wim; Dierlamm, Alexander; Dirkes, Guido; Feindt, Michael; Gruschke, Jasmin; Guthoff, Moritz; Hackstein, Christoph; Hartmann, Frank; Heinrich, Michael; Held, Hauke; Hoffmann, Karl-Heinz; Honc, Simon; Katkov, Igor; Komaragiri, Jyothsna Rani; Kuhr, Thomas; Martschei, Daniel; Mueller, Steffen; Müller, Thomas; Niegel, Martin; Nürnberg, Andreas; Oberst, Oliver; Oehler, Andreas; Ott, Jochen; Peiffer, Thomas; Quast, Gunter; Rabbertz, Klaus; Ratnikov, Fedor; Ratnikova, Natalia; Renz, Manuel; Röcker, Steffen; Saout, Christophe; Scheurer, Armin; Schieferdecker, Philipp; Schilling, Frank-Peter; Schmanau, Mike; Schott, Gregory; Simonis, Hans-Jürgen; Stober, Fred-Markus Helmut; Troendle, Daniel; Wagner-Kuhr, Jeannine; Weiler, Thomas; Zeise, Manuel; Ziebarth, Eva Barbara; Daskalakis, Georgios; Geralis, Theodoros; Kesisoglou, Stilianos; Kyriakis, Aristotelis; Loukas, Demetrios; Manolakos, Ioannis; Markou, Athanasios; Markou, Christos; Mavrommatis, Charalampos; Ntomari, Eleni; Gouskos, Loukas; Mertzimekis, Theodoros; Panagiotou, Apostolos; Saoulidou, Niki; Stiliaris, Efstathios; Evangelou, Ioannis; Foudas, Costas; Kokkas, Panagiotis; Manthos, Nikolaos; Papadopoulos, Ioannis; Patras, Vaios; Triantis, Frixos A; Aranyi, Attila; Bencze, Gyorgy; Boldizsar, Laszlo; Hajdu, Csaba; Hidas, Pàl; Horvath, Dezso; Kapusi, Anita; Krajczar, Krisztian; Sikler, Ferenc; Veszpremi, Viktor; Vesztergombi, Gyorgy; Beni, Noemi; Molnar, Jozsef; Palinkas, Jozsef; Szillasi, Zoltan; Karancsi, János; Raics, Peter; Trocsanyi, Zoltan Laszlo; Ujvari, Balazs; Beri, Suman Bala; Bhatnagar, Vipin; Dhingra, Nitish; Gupta, Ruchi; Jindal, Monika; Kaur, Manjit; Kohli, Jatinder Mohan; Mehta, Manuk Zubin; Nishu, Nishu; Saini, Lovedeep Kaur; Sharma, Archana; Singh, Anil; Singh, Jasbir; Singh, Supreet Pal; Ahuja, Sudha; Choudhary, Brajesh C; Kumar, Ashok; Kumar, Arun; Malhotra, Shivali; Naimuddin, Md; Ranjan, Kirti; Sharma, Varun; Shivpuri, Ram Krishen; Banerjee, Sunanda; Bhattacharya, Satyaki; Dutta, Suchandra; Gomber, Bhawna; Jain, Sandhya; Jain, Shilpi; Khurana, Raman; Sarkar, Subir; Choudhury, Rajani Kant; Dutta, Dipanwita; Kailas, Swaminathan; Kumar, Vineet; Mohanty, Ajit Kumar; Pant, Lalit Mohan; Shukla, Prashant; Aziz, Tariq; Ganguly, Sanmay; Guchait, Monoranjan; Gurtu, Atul; Maity, Manas; Majumder, Gobinda; Mazumdar, Kajari; Mohanty, Gagan Bihari; Parida, Bibhuti; Saha, Anirban; Sudhakar, Katta; Wickramage, Nadeesha; Banerjee, Sudeshna; Dugad, Shashikant; Mondal, Naba Kumar; Arfaei, Hessamaddin; Bakhshiansohi, Hamed; Etesami, Seyed Mohsen; Fahim, Ali; Hashemi, Majid; Hesari, Hoda; Jafari, Abideh; Khakzad, Mohsen; Mohammadi, Abdollah; Mohammadi Najafabadi, Mojtaba; Paktinat Mehdiabadi, Saeid; Safarzadeh, Batool; Zeinali, Maryam; Abbrescia, Marcello; Barbone, Lucia; Calabria, Cesare; Chhibra, Simranjit Singh; Colaleo, Anna; Creanza, Donato; De Filippis, Nicola; De Palma, Mauro; Fiore, Luigi; Iaselli, Giuseppe; Lusito, Letizia; Maggi, Giorgio; Maggi, Marcello; Manna, Norman; Marangelli, Bartolomeo; My, Salvatore; Nuzzo, Salvatore; Pacifico, Nicola; Pompili, Alexis; Pugliese, Gabriella; Romano, Francesco; Selvaggi, Giovanna; Silvestris, Lucia; Singh, Gurpreet; Tupputi, Salvatore; Zito, Giuseppe; Abbiendi, Giovanni; Benvenuti, Alberto; Bonacorsi, Daniele; Braibant-Giacomelli, Sylvie; Brigliadori, Luca; Capiluppi, Paolo; Castro, Andrea; Cavallo, Francesca Romana; Cuffiani, Marco; Dallavalle, Gaetano-Marco; Fabbri, Fabrizio; Fanfani, Alessandra; Fasanella, Daniele; Giacomelli, Paolo; Grandi, Claudio; Marcellini, Stefano; Masetti, Gianni; Meneghelli, Marco; Montanari, Alessandro; Navarria, Francesco; Odorici, Fabrizio; Perrotta, Andrea; Primavera, Federica; Rossi, Antonio; Rovelli, Tiziano; Siroli, Gianni; Travaglini, Riccardo; Albergo, Sebastiano; Cappello, Gigi; Chiorboli, Massimiliano; Costa, Salvatore; Potenza, Renato; Tricomi, Alessia; Tuve, Cristina; Barbagli, Giuseppe; Ciulli, Vitaliano; Civinini, Carlo; D'Alessandro, Raffaello; Focardi, Ettore; Frosali, Simone; Gallo, Elisabetta; Gonzi, Sandro; Meschini, Marco; Paoletti, Simone; Sguazzoni, Giacomo; Tropiano, Antonio; Benussi, Luigi; Bianco, Stefano; Colafranceschi, Stefano; Fabbri, Franco; Piccolo, Davide; Fabbricatore, Pasquale; Musenich, Riccardo; Benaglia, Andrea; De Guio, Federico; Di Matteo, Leonardo; Fiorendi, Sara; Gennai, Simone; Ghezzi, Alessio; Malvezzi, Sandra; Manzoni, Riccardo Andrea; Martelli, Arabella; Massironi, Andrea; Menasce, Dario; Moroni, Luigi; Paganoni, Marco; Pedrini, Daniele; Ragazzi, Stefano; Redaelli, Nicola; Sala, Silvano; Tabarelli de Fatis, Tommaso; Buontempo, Salvatore; Carrillo Montoya, Camilo Andres; Cavallo, Nicola; De Cosa, Annapaola; Dogangun, Oktay; Fabozzi, Francesco; Iorio, Alberto Orso Maria; Lista, Luca; Merola, Mario; Paolucci, Pierluigi; Azzi, Patrizia; Bacchetta, Nicola; Bellan, Paolo; Bisello, Dario; Branca, Antonio; Carlin, Roberto; Checchia, Paolo; Dorigo, Tommaso; Dosselli, Umberto; Fanzago, Federica; Gasparini, Fabrizio; Gasparini, Ugo; Gozzelino, Andrea; Kanishchev, Konstantin; Lacaprara, Stefano; Lazzizzera, Ignazio; Margoni, Martino; Mazzucato, Mirco; Meneguzzo, Anna Teresa; Nespolo, Massimo; Perrozzi, Luca; Pozzobon, Nicola; Ronchese, Paolo; Simonetto, Franco; Torassa, Ezio; Tosi, Mia; Vanini, Sara; Zotto, Pierluigi; Zumerle, Gianni; Berzano, Umberto; Gabusi, Michele; Ratti, Sergio P; Riccardi, Cristina; Torre, Paola; Vitulo, Paolo; Biasini, Maurizio; Bilei, Gian Mario; Caponeri, Benedetta; Fanò, Livio; Lariccia, Paolo; Lucaroni, Andrea; Mantovani, Giancarlo; Menichelli, Mauro; Nappi, Aniello; Romeo, Francesco; Santocchia, Attilio; Taroni, Silvia; Valdata, Marisa; Azzurri, Paolo; Bagliesi, Giuseppe; Boccali, Tommaso; Broccolo, Giuseppe; Castaldi, Rino; D'Agnolo, Raffaele Tito; Dell'Orso, Roberto; Fiori, Francesco; Foà, Lorenzo; Giassi, Alessandro; Kraan, Aafke; Ligabue, Franco; Lomtadze, Teimuraz; Martini, Luca; Messineo, Alberto; Palla, Fabrizio; Palmonari, Francesco; Rizzi, Andrea; Serban, Alin Titus; Spagnolo, Paolo; Tenchini, Roberto; Tonelli, Guido; Venturi, Andrea; Verdini, Piero Giorgio; Barone, Luciano; Cavallari, Francesca; Del Re, Daniele; Diemoz, Marcella; Fanelli, Cristiano; Grassi, Marco; Longo, Egidio; Meridiani, Paolo; Micheli, Francesco; Nourbakhsh, Shervin; Organtini, Giovanni; Pandolfi, Francesco; Paramatti, Riccardo; Rahatlou, Shahram; Sigamani, Michael; Soffi, Livia; Amapane, Nicola; Arcidiacono, Roberta; Argiro, Stefano; Arneodo, Michele; Biino, Cristina; Botta, Cristina; Cartiglia, Nicolo; Castello, Roberto; Costa, Marco; Demaria, Natale; Graziano, Alberto; Mariotti, Chiara; Maselli, Silvia; Migliore, Ernesto; Monaco, Vincenzo; Musich, Marco; Obertino, Maria Margherita; Pastrone, Nadia; Pelliccioni, Mario; Potenza, Alberto; Romero, Alessandra; Ruspa, Marta; Sacchi, Roberto; Sola, Valentina; Solano, Ada; Staiano, Amedeo; Vilela Pereira, Antonio; Belforte, Stefano; Cossutti, Fabio; Della Ricca, Giuseppe; Gobbo, Benigno; Marone, Matteo; Montanino, Damiana; Penzo, Aldo; Heo, Seong Gu; Nam, Soon-Kwon; Chang, Sunghyun; Chung, Jin Hyuk; Kim, Dong Hee; Kim, Gui Nyun; Kim, Ji Eun; Kong, Dae Jung; Park, Hyangkyu; Ro, Sang-Ryul; Son, Dong-Chul; Kim, Jae Yool; Kim, Zero Jaeho; Song, Sanghyeon; Jo, Hyun Yong; Choi, Suyong; Gyun, Dooyeon; Hong, Byung-Sik; Jo, Mihee; Kim, Hyunchul; Kim, Tae Jeong; Lee, Kyong Sei; Moon, Dong Ho; Park, Sung Keun; Seo, Eunsung; Sim, Kwang Souk; Choi, Minkyoo; Kang, Seokon; Kim, Hyunyong; Kim, Ji Hyun; Park, Chawon; Park, Inkyu; Park, Sangnam; Ryu, Geonmo; Cho, Yongjin; Choi, Young-Il; Choi, Young Kyu; Goh, Junghwan; Kim, Min Suk; Lee, Byounghoon; Lee, Jongseok; Lee, Sungeun; Seo, Hyunkwan; Yu, Intae; Bilinskas, Mykolas Jurgis; Grigelionis, Ignas; Janulis, Mindaugas; Castilla-Valdez, Heriberto; De La Cruz-Burelo, Eduard; Heredia-de La Cruz, Ivan; Lopez-Fernandez, Ricardo; Magaña Villalba, Ricardo; Martínez-Ortega, Jorge; Sánchez-Hernández, Alberto; Villasenor-Cendejas, Luis Manuel; Carrillo Moreno, Salvador; Vazquez Valencia, Fabiola; Salazar Ibarguen, Humberto Antonio; Casimiro Linares, Edgar; Morelos Pineda, Antonio; Reyes-Santos, Marco A; Krofcheck, David; Bell, Alan James; Butler, Philip H; Doesburg, Robert; Reucroft, Steve; Silverwood, Hamish; Ahmad, Muhammad; Asghar, Muhammad Irfan; Hoorani, Hafeez R; Khalid, Shoaib; Khan, Wajid Ali; Khurshid, Taimoor; Qazi, Shamona; Shah, Mehar Ali; Shoaib, Muhammad; Brona, Grzegorz; Cwiok, Mikolaj; Dominik, Wojciech; Doroba, Krzysztof; Kalinowski, Artur; Konecki, Marcin; Krolikowski, Jan; Bialkowska, Helena; Boimska, Bozena; Frueboes, Tomasz; Gokieli, Ryszard; Górski, Maciej; Kazana, Malgorzata; Nawrocki, Krzysztof; Romanowska-Rybinska, Katarzyna; Szleper, Michal; Wrochna, Grzegorz; Zalewski, Piotr; Almeida, Nuno; Bargassa, Pedrame; David Tinoco Mendes, Andre; Faccioli, Pietro; Ferreira Parracho, Pedro Guilherme; Gallinaro, Michele; Musella, Pasquale; Nayak, Aruna; Pela, Joao; Ribeiro, Pedro Quinaz; Seixas, Joao; Varela, Joao; Vischia, Pietro; Afanasiev, Serguei; Belotelov, Ivan; Bunin, Pavel; Golutvin, Igor; Kamenev, Alexey; Karjavin, Vladimir; Konoplyanikov, Viktor; Kozlov, Guennady; Lanev, Alexander; Moisenz, Petr; Palichik, Vladimir; Perelygin, Victor; Savina, Maria; Shmatov, Sergey; Smirnov, Vitaly; Volodko, Anton; Zarubin, Anatoli; Evstyukhin, Sergey; Golovtsov, Victor; Ivanov, Yury; Kim, Victor; Levchenko, Petr; Murzin, Victor; Oreshkin, Vadim; Smirnov, Igor; Sulimov, Valentin; Uvarov, Lev; Vavilov, Sergey; Vorobyev, Alexey; Vorobyev, Andrey; Andreev, Yuri; Dermenev, Alexander; Gninenko, Sergei; Golubev, Nikolai; Kirsanov, Mikhail; Krasnikov, Nikolai; Matveev, Viktor; Pashenkov, Anatoli; Toropin, Alexander; Troitsky, Sergey; Epshteyn, Vladimir; Erofeeva, Maria; Gavrilov, Vladimir; Kossov, Mikhail; Krokhotin, Andrey; Lychkovskaya, Natalia; Popov, Vladimir; Safronov, Grigory; Semenov, Sergey; Stolin, Viatcheslav; Vlasov, Evgueni; Zhokin, Alexander; Belyaev, Andrey; Boos, Edouard; Dubinin, Mikhail; Dudko, Lev; Ershov, Alexander; Gribushin, Andrey; Kodolova, Olga; Lokhtin, Igor; Markina, Anastasia; Obraztsov, Stepan; Perfilov, Maxim; Petrushanko, Sergey; Sarycheva, Ludmila; Savrin, Viktor; Snigirev, Alexander; Andreev, Vladimir; Azarkin, Maksim; Dremin, Igor; Kirakosyan, Martin; Leonidov, Andrey; Mesyats, Gennady; Rusakov, Sergey V; Vinogradov, Alexey; Azhgirey, Igor; Bayshev, Igor; Bitioukov, Sergei; Grishin, Viatcheslav; Kachanov, Vassili; Konstantinov, Dmitri; Korablev, Andrey; Krychkine, Victor; Petrov, Vladimir; Ryutin, Roman; Sobol, Andrei; Tourtchanovitch, Leonid; Troshin, Sergey; Tyurin, Nikolay; Uzunian, Andrey; Volkov, Alexey; Adzic, Petar; Djordjevic, Milos; Ekmedzic, Marko; Krpic, Dragomir; Milosevic, Jovan; Aguilar-Benitez, Manuel; Alcaraz Maestre, Juan; Arce, Pedro; Battilana, Carlo; Calvo, Enrique; Cerrada, Marcos; Chamizo Llatas, Maria; Colino, Nicanor; De La Cruz, Begona; Delgado Peris, Antonio; Diez Pardos, Carmen; Domínguez Vázquez, Daniel; Fernandez Bedoya, Cristina; Fernández Ramos, Juan Pablo; Ferrando, Antonio; Flix, Jose; Fouz, Maria Cruz; Garcia-Abia, Pablo; Gonzalez Lopez, Oscar; Goy Lopez, Silvia; Hernandez, Jose M; Josa, Maria Isabel; Merino, Gonzalo; Puerta Pelayo, Jesus; Redondo, Ignacio; Romero, Luciano; Santaolalla, Javier; Soares, Mara Senghi; Willmott, Carlos; Albajar, Carmen; Codispoti, Giuseppe; de Trocóniz, Jorge F; Cuevas, Javier; Fernandez Menendez, Javier; Folgueras, Santiago; Gonzalez Caballero, Isidro; Lloret Iglesias, Lara; Piedra Gomez, Jonatan; Vizan Garcia, Jesus Manuel; Brochero Cifuentes, Javier Andres; Cabrillo, Iban Jose; Calderon, Alicia; Chuang, Shan-Huei; Duarte Campderros, Jordi; Felcini, Marta; Fernandez, Marcos; Gomez, Gervasio; Gonzalez Sanchez, Javier; Jorda, Clara; Lobelle Pardo, Patricia; Lopez Virto, Amparo; Marco, Jesus; Marco, Rafael; Martinez Rivero, Celso; Matorras, Francisco; Munoz Sanchez, Francisca Javiela; Rodrigo, Teresa; Rodríguez-Marrero, Ana Yaiza; Ruiz-Jimeno, Alberto; Scodellaro, Luca; Sobron Sanudo, Mar; Vila, Ivan; Vilar Cortabitarte, Rocio; Abbaneo, Duccio; Auffray, Etiennette; Auzinger, Georg; Baillon, Paul; Ball, Austin; Barney, David; Bernet, Colin; Bialas, Wojciech; Bianchi, Giovanni; Bloch, Philippe; Bocci, Andrea; Breuker, Horst; Bunkowski, Karol; Camporesi, Tiziano; Cerminara, Gianluca; Christiansen, Tim; Coarasa Perez, Jose Antonio; Curé, Benoît; D'Enterria, David; De Roeck, Albert; Di Guida, Salvatore; Dobson, Marc; Dupont-Sagorin, Niels; Elliott-Peisert, Anna; Frisch, Benjamin; Funk, Wolfgang; Gaddi, Andrea; Georgiou, Georgios; Gerwig, Hubert; Giffels, Manuel; Gigi, Dominique; Gill, Karl; Giordano, Domenico; Giunta, Marina; Glege, Frank; Gomez-Reino Garrido, Robert; Govoni, Pietro; Gowdy, Stephen; Guida, Roberto; Guiducci, Luigi; Hansen, Magnus; Harris, Philip; Hartl, Christian; Harvey, John; Hegner, Benedikt; Hinzmann, Andreas; Hoffmann, Hans Falk; Innocente, Vincenzo; Janot, Patrick; Kaadze, Ketino; Karavakis, Edward; Kousouris, Konstantinos; Lecoq, Paul; Lenzi, Piergiulio; Lourenco, Carlos; Maki, Tuula; Malberti, Martina; Malgeri, Luca; Mannelli, Marcello; Masetti, Lorenzo; Mavromanolakis, Georgios; Meijers, Frans; Mersi, Stefano; Meschi, Emilio; Moser, Roland; Mozer, Matthias Ulrich; Mulders, Martijn; Nesvold, Erik; Nguyen, Matthew; Orimoto, Toyoko; Orsini, Luciano; Palencia Cortezon, Enrique; Perez, Emmanuelle; Petrilli, Achille; Pfeiffer, Andreas; Pierini, Maurizio; Pimiä, Martti; Piparo, Danilo; Polese, Giovanni; Quertenmont, Loic; Racz, Attila; Reece, William; Rodrigues Antunes, Joao; Rolandi, Gigi; Rommerskirchen, Tanja; Rovelli, Chiara; Rovere, Marco; Sakulin, Hannes; Santanastasio, Francesco; Schäfer, Christoph; Schwick, Christoph; Segoni, Ilaria; Sharma, Archana; Siegrist, Patrice; Silva, Pedro; Simon, Michal; Sphicas, Paraskevas; Spiga, Daniele; Spiropulu, Maria; Stoye, Markus; Tsirou, Andromachi; Veres, Gabor Istvan; Vichoudis, Paschalis; Wöhri, Hermine Katharina; Worm, Steven; Zeuner, Wolfram Dietrich; Bertl, Willi; Deiters, Konrad; Erdmann, Wolfram; Gabathuler, Kurt; Horisberger, Roland; Ingram, Quentin; Kaestli, Hans-Christian; König, Stefan; Kotlinski, Danek; Langenegger, Urs; Meier, Frank; Renker, Dieter; Rohe, Tilman; Sibille, Jennifer; Bäni, Lukas; Bortignon, Pierluigi; Buchmann, Marco-Andrea; Casal, Bruno; Chanon, Nicolas; Chen, Zhiling; Deisher, Amanda; Dissertori, Günther; Dittmar, Michael; Dünser, Marc; Eugster, Jürg; Freudenreich, Klaus; Grab, Christoph; Lecomte, Pierre; Lustermann, Werner; Martinez Ruiz del Arbol, Pablo; Mohr, Niklas; Moortgat, Filip; Nägeli, Christoph; Nef, Pascal; Nessi-Tedaldi, Francesca; Pape, Luc; Pauss, Felicitas; Peruzzi, Marco; Ronga, Frederic Jean; Rossini, Marco; Sala, Leonardo; Sanchez, Ann - Karin; Sawley, Marie-Christine; Starodumov, Andrei; Stieger, Benjamin; Takahashi, Maiko; Tauscher, Ludwig; Thea, Alessandro; Theofilatos, Konstantinos; Treille, Daniel; Urscheler, Christina; Wallny, Rainer; Weber, Hannsjoerg Artur; Wehrli, Lukas; Weng, Joanna; Aguilo, Ernest; Amsler, Claude; Chiochia, Vincenzo; De Visscher, Simon; Favaro, Carlotta; Ivova Rikova, Mirena; Millan Mejias, Barbara; Otiougova, Polina; Robmann, Peter; Snoek, Hella; Verzetti, Mauro; Chang, Yuan-Hann; Chen, Kuan-Hsin; Kuo, Chia-Ming; Li, Syue-Wei; Lin, Willis; Liu, Zong-Kai; Lu, Yun-Ju; Mekterovic, Darko; Volpe, Roberta; Yu, Shin-Shan; Bartalini, Paolo; Chang, Paoti; Chang, You-Hao; Chang, Yu-Wei; Chao, Yuan; Chen, Kai-Feng; Dietz, Charles; Grundler, Ulysses; Hou, George Wei-Shu; Hsiung, Yee; Kao, Kai-Yi; Lei, Yeong-Jyi; Lu, Rong-Shyang; Majumder, Devdatta; Petrakou, Eleni; Shi, Xin; Shiu, Jing-Ge; Tzeng, Yeng-Ming; Wang, Minzu; Adiguzel, Aytul; Bakirci, Mustafa Numan; Cerci, Salim; Dozen, Candan; Dumanoglu, Isa; Eskut, Eda; Girgis, Semiray; Gokbulut, Gul; Hos, Ilknur; Kangal, Evrim Ersin; Karapinar, Guler; Kayis Topaksu, Aysel; Onengut, Gulsen; Ozdemir, Kadri; Ozturk, Sertac; Polatoz, Ayse; Sogut, Kenan; Sunar Cerci, Deniz; Tali, Bayram; Topakli, Huseyin; Uzun, Dilber; Vergili, Latife Nukhet; Vergili, Mehmet; Akin, Ilina Vasileva; Aliev, Takhmasib; Bilin, Bugra; Bilmis, Selcuk; Deniz, Muhammed; Gamsizkan, Halil; Guler, Ali Murat; Ocalan, Kadir; Ozpineci, Altug; Serin, Meltem; Sever, Ramazan; Surat, Ugur Emrah; Yalvac, Metin; Yildirim, Eda; Zeyrek, Mehmet; Deliomeroglu, Mehmet; Gülmez, Erhan; Isildak, Bora; Kaya, Mithat; Kaya, Ozlem; Ozkorucuklu, Suat; Sonmez, Nasuf; Levchuk, Leonid; Bostock, Francis; Brooke, James John; Clement, Emyr; Cussans, David; Flacher, Henning; Frazier, Robert; Goldstein, Joel; Grimes, Mark; Heath, Greg P; Heath, Helen F; Kreczko, Lukasz; Metson, Simon; Newbold, Dave M; Nirunpong, Kachanon; Poll, Anthony; Senkin, Sergey; Smith, Vincent J; Williams, Thomas; Basso, Lorenzo; Bell, Ken W; Belyaev, Alexander; Brew, Christopher; Brown, Robert M; Cockerill, David JA; Coughlan, John A; Harder, Kristian; Harper, Sam; Jackson, James; Kennedy, Bruce W; Olaiya, Emmanuel; Petyt, David; Radburn-Smith, Benjamin Charles; Shepherd-Themistocleous, Claire; Tomalin, Ian R; Womersley, William John; Bainbridge, Robert; Ball, Gordon; Beuselinck, Raymond; Buchmuller, Oliver; Colling, David; Cripps, Nicholas; Cutajar, Michael; Dauncey, Paul; Davies, Gavin; Della Negra, Michel; Ferguson, William; Fulcher, Jonathan; Futyan, David; Gilbert, Andrew; Guneratne Bryer, Arlo; Hall, Geoffrey; Hatherell, Zoe; Hays, Jonathan; Iles, Gregory; Jarvis, Martyn; Karapostoli, Georgia; Lyons, Louis; Magnan, Anne-Marie; Marrouche, Jad; Mathias, Bryn; Nandi, Robin; Nash, Jordan; Nikitenko, Alexander; Papageorgiou, Anastasios; Pesaresi, Mark; Petridis, Konstantinos; Pioppi, Michele; Raymond, David Mark; Rogerson, Samuel; Rompotis, Nikolaos; Rose, Andrew; Ryan, Matthew John; Seez, Christopher; Sparrow, Alex; Tapper, Alexander; Tourneur, Stephane; Vazquez Acosta, Monica; Virdee, Tejinder; Wakefield, Stuart; Wardle, Nicholas; Wardrope, David; Whyntie, Tom; Barrett, Matthew; Chadwick, Matthew; Cole, Joanne; Hobson, Peter R; Khan, Akram; Kyberd, Paul; Leslie, Dawn; Martin, William; Reid, Ivan; Symonds, Philip; Teodorescu, Liliana; Turner, Mark; Hatakeyama, Kenichi; Liu, Hongxuan; Scarborough, Tara; Henderson, Conor; Avetisyan, Aram; Bose, Tulika; Carrera Jarrin, Edgar; Fantasia, Cory; Heister, Arno; St John, Jason; Lawson, Philip; Lazic, Dragoslav; Rohlf, James; Sperka, David; Sulak, Lawrence; Bhattacharya, Saptaparna; Cutts, David; Ferapontov, Alexey; Heintz, Ulrich; Jabeen, Shabnam; Kukartsev, Gennadiy; Landsberg, Greg; Luk, Michael; Narain, Meenakshi; Nguyen, Duong; Segala, Michael; Sinthuprasith, Tutanon; Speer, Thomas; Tsang, Ka Vang; Breedon, Richard; Breto, Guillermo; Calderon De La Barca Sanchez, Manuel; Caulfield, Matthew; Chauhan, Sushil; Chertok, Maxwell; Conway, John; Conway, Rylan; Cox, Peter Timothy; Dolen, James; Erbacher, Robin; Gardner, Michael; Houtz, Rachel; Ko, Winston; Kopecky, Alexandra; Lander, Richard; Mall, Orpheus; Miceli, Tia; Nelson, Randy; Pellett, Dave; Robles, Jorge; Rutherford, Britney; Searle, Matthew; Smith, John; Squires, Michael; Tripathi, Mani; Vasquez Sierra, Ricardo; Andreev, Valeri; Arisaka, Katsushi; Cline, David; Cousins, Robert; Duris, Joseph; Erhan, Samim; Everaerts, Pieter; Farrell, Chris; Hauser, Jay; Ignatenko, Mikhail; Jarvis, Chad; Plager, Charles; Rakness, Gregory; Schlein, Peter; Tucker, Jordan; Valuev, Vyacheslav; Weber, Matthias; Babb, John; Clare, Robert; Ellison, John Anthony; Gary, J William; Giordano, Ferdinando; Hanson, Gail; Jeng, Geng-Yuan; Liu, Hongliang; Long, Owen Rosser; Luthra, Arun; Nguyen, Harold; Paramesvaran, Sudarshan; Sturdy, Jared; Sumowidagdo, Suharyo; Wilken, Rachel; Wimpenny, Stephen; Andrews, Warren; Branson, James G; Cerati, Giuseppe Benedetto; Cittolin, Sergio; Evans, David; Golf, Frank; Holzner, André; Kelley, Ryan; Lebourgeois, Matthew; Letts, James; Macneill, Ian; Mangano, Boris; Padhi, Sanjay; Palmer, Christopher; Petrucciani, Giovanni; Pi, Haifeng; Pieri, Marco; Ranieri, Riccardo; Sani, Matteo; Sfiligoi, Igor; Sharma, Vivek; Simon, Sean; Sudano, Elizabeth; Tadel, Matevz; Tu, Yanjun; Vartak, Adish; Wasserbaech, Steven; Würthwein, Frank; Yagil, Avraham; Yoo, Jaehyeok; Barge, Derek; Bellan, Riccardo; Campagnari, Claudio; D'Alfonso, Mariarosaria; Danielson, Thomas; Flowers, Kristen; Geffert, Paul; Incandela, Joe; Justus, Christopher; Kalavase, Puneeth; Koay, Sue Ann; Kovalskyi, Dmytro; Krutelyov, Vyacheslav; Lowette, Steven; Mccoll, Nickolas; Pavlunin, Viktor; Rebassoo, Finn; Ribnik, Jacob; Richman, Jeffrey; Rossin, Roberto; Stuart, David; To, Wing; Vlimant, Jean-Roch; West, Christopher; Apresyan, Artur; Bornheim, Adolf; Bunn, Julian; Chen, Yi; Di Marco, Emanuele; Duarte, Javier; Gataullin, Marat; Ma, Yousi; Mott, Alexander; Newman, Harvey B; Rogan, Christopher; Timciuc, Vladlen; Traczyk, Piotr; Veverka, Jan; Wilkinson, Richard; Yang, Yong; Zhu, Ren-Yuan; Akgun, Bora; Carroll, Ryan; Ferguson, Thomas; Iiyama, Yutaro; Jang, Dong Wook; Jun, Soon Yung; Liu, Yueh-Feng; Paulini, Manfred; Russ, James; Vogel, Helmut; Vorobiev, Igor; Cumalat, John Perry; Dinardo, Mauro Emanuele; Drell, Brian Robert; Edelmaier, Christopher; Ford, William T; Gaz, Alessandro; Heyburn, Bernadette; Luiggi Lopez, Eduardo; Nauenberg, Uriel; Smith, James; Stenson, Kevin; Ulmer, Keith; Wagner, Stephen Robert; Zang, Shi-Lei; Agostino, Lorenzo; Alexander, James; Chatterjee, Avishek; Eggert, Nicholas; Gibbons, Lawrence Kent; Heltsley, Brian; Hopkins, Walter; Khukhunaishvili, Aleko; Kreis, Benjamin; Mirman, Nathan; Nicolas Kaufman, Gala; Patterson, Juliet Ritchie; Ryd, Anders; Salvati, Emmanuele; Sun, Werner; Teo, Wee Don; Thom, Julia; Thompson, Joshua; Vaughan, Jennifer; Weng, Yao; Winstrom, Lucas; Wittich, Peter; Biselli, Angela; Winn, Dave; Abdullin, Salavat; Albrow, Michael; Anderson, Jacob; Apollinari, Giorgio; Atac, Muzaffer; Bakken, Jon Alan; Bauerdick, Lothar AT; Beretvas, Andrew; Berryhill, Jeffrey; Bhat, Pushpalatha C; Bloch, Ingo; Burkett, Kevin; Butler, Joel Nathan; Chetluru, Vasundhara; Cheung, Harry; Chlebana, Frank; Cihangir, Selcuk; Cooper, William; Eartly, David P; Elvira, Victor Daniel; Esen, Selda; Fisk, Ian; Freeman, Jim; Gao, Yanyan; Gottschalk, Erik; Green, Dan; Gutsche, Oliver; Hanlon, Jim; Harris, Robert M; Hirschauer, James; Hooberman, Benjamin; Jensen, Hans; Jindariani, Sergo; Johnson, Marvin; Joshi, Umesh; Klima, Boaz; Kunori, Shuichi; Kwan, Simon; Leonidopoulos, Christos; Lincoln, Don; Lipton, Ron; Lykken, Joseph; Maeshima, Kaori; Marraffino, John Michael; Maruyama, Sho; Mason, David; McBride, Patricia; Miao, Ting; Mishra, Kalanand; Mrenna, Stephen; Musienko, Yuri; Newman-Holmes, Catherine; O'Dell, Vivian; Pivarski, James; Pordes, Ruth; Prokofyev, Oleg; Schwarz, Thomas; Sexton-Kennedy, Elizabeth; Sharma, Seema; Spalding, William J; Spiegel, Leonard; Tan, Ping; Taylor, Lucas; Tkaczyk, Slawek; Uplegger, Lorenzo; Vaandering, Eric Wayne; Vidal, Richard; Whitmore, Juliana; Wu, Weimin; Yang, Fan; Yumiceva, Francisco; Yun, Jae Chul; Acosta, Darin; Avery, Paul; Bourilkov, Dimitri; Chen, Mingshui; Das, Souvik; De Gruttola, Michele; Di Giovanni, Gian Piero; Dobur, Didar; Drozdetskiy, Alexey; Field, Richard D; Fisher, Matthew; Fu, Yu; Furic, Ivan-Kresimir; Gartner, Joseph; Goldberg, Sean; Hugon, Justin; Kim, Bockjoo; Konigsberg, Jacobo; Korytov, Andrey; Kropivnitskaya, Anna; Kypreos, Theodore; Low, Jia Fu; Matchev, Konstantin; Milenovic, Predrag; Mitselmakher, Guenakh; Muniz, Lana; Remington, Ronald; Rinkevicius, Aurelijus; Schmitt, Michael; Scurlock, Bobby; Sellers, Paul; Skhirtladze, Nikoloz; Snowball, Matthew; Wang, Dayong; Yelton, John; Zakaria, Mohammed; Gaultney, Vanessa; Lebolo, Luis Miguel; Linn, Stephan; Markowitz, Pete; Martinez, German; Rodriguez, Jorge Luis; Adams, Todd; Askew, Andrew; Bochenek, Joseph; Chen, Jie; Diamond, Brendan; Gleyzer, Sergei V; Haas, Jeff; Hagopian, Sharon; Hagopian, Vasken; Jenkins, Merrill; Johnson, Kurtis F; Prosper, Harrison; Sekmen, Sezen; Veeraraghavan, Venkatesh; Weinberg, Marc; Baarmand, Marc M; Dorney, Brian; Hohlmann, Marcus; Kalakhety, Himali; Vodopiyanov, Igor; Adams, Mark Raymond; Anghel, Ioana Maria; Apanasevich, Leonard; Bai, Yuting; Bazterra, Victor Eduardo; Betts, Russell Richard; Callner, Jeremy; Cavanaugh, Richard; Dragoiu, Cosmin; Gauthier, Lucie; Gerber, Cecilia Elena; Hofman, David Jonathan; Khalatyan, Samvel; Kunde, Gerd J; Lacroix, Florent; Malek, Magdalena; O'Brien, Christine; Silkworth, Christopher; Silvestre, Catherine; Strom, Derek; Varelas, Nikos; Akgun, Ugur; Albayrak, Elif Asli; Bilki, Burak; Clarida, Warren; Duru, Firdevs; Griffiths, Scott; Lae, Chung Khim; McCliment, Edward; Merlo, Jean-Pierre; Mermerkaya, Hamit; Mestvirishvili, Alexi; Moeller, Anthony; Nachtman, Jane; Newsom, Charles Ray; Norbeck, Edwin; Olson, Jonathan; Onel, Yasar; Ozok, Ferhat; Sen, Sercan; Tiras, Emrah; Wetzel, James; Yetkin, Taylan; Yi, Kai; Barnett, Bruce Arnold; Blumenfeld, Barry; Bolognesi, Sara; Bonato, Alessio; Fehling, David; Giurgiu, Gavril; Gritsan, Andrei; Guo, Zijin; Hu, Guofan; Maksimovic, Petar; Rappoccio, Salvatore; Swartz, Morris; Tran, Nhan Viet; Whitbeck, Andrew; Baringer, Philip; Bean, Alice; Benelli, Gabriele; Grachov, Oleg; Kenny Iii, Raymond Patrick; Murray, Michael; Noonan, Daniel; Sanders, Stephen; Stringer, Robert; Tinti, Gemma; Wood, Jeffrey Scott; Zhukova, Victoria; Barfuss, Anne-Fleur; Bolton, Tim; Chakaberia, Irakli; Ivanov, Andrew; Khalil, Sadia; Makouski, Mikhail; Maravin, Yurii; Shrestha, Shruti; Svintradze, Irakli; Gronberg, Jeffrey; Lange, David; Wright, Douglas; Baden, Drew; Boutemeur, Madjid; Calvert, Brian; Eno, Sarah Catherine; Gomez, Jaime; Hadley, Nicholas John; Kellogg, Richard G; Kirn, Malina; Kolberg, Ted; Lu, Ying; Marionneau, Matthieu; Mignerey, Alice; Peterman, Alison; Rossato, Kenneth; Rumerio, Paolo; Skuja, Andris; Temple, Jeffrey; Tonjes, Marguerite; Tonwar, Suresh C; Twedt, Elizabeth; Alver, Burak; Bauer, Gerry; Bendavid, Joshua; Busza, Wit; Butz, Erik; Cali, Ivan Amos; Chan, Matthew; Dutta, Valentina; Gomez Ceballos, Guillelmo; Goncharov, Maxim; Hahn, Kristan Allan; Kim, Yongsun; Klute, Markus; Lee, Yen-Jie; Li, Wei; Luckey, Paul David; Ma, Teng; Nahn, Steve; Paus, Christoph; Ralph, Duncan; Roland, Christof; Roland, Gunther; Rudolph, Matthew; Stephans, George; Stöckli, Fabian; Sumorok, Konstanty; Sung, Kevin; Velicanu, Dragos; Wenger, Edward Allen; Wolf, Roger; Wyslouch, Bolek; Xie, Si; Yang, Mingming; Yilmaz, Yetkin; Yoon, Sungho; Zanetti, Marco; Cooper, Seth; Cushman, Priscilla; Dahmes, Bryan; De Benedetti, Abraham; Franzoni, Giovanni; Gude, Alexander; Haupt, Jason; Kao, Shih-Chuan; Klapoetke, Kevin; Kubota, Yuichi; Mans, Jeremy; Pastika, Nathaniel; Rekovic, Vladimir; Rusack, Roger; Sasseville, Michael; Singovsky, Alexander; Tambe, Norbert; Turkewitz, Jared; Cremaldi, Lucien Marcus; Godang, Romulus; Kroeger, Rob; Perera, Lalith; Rahmat, Rahmat; Sanders, David A; Summers, Don; Avdeeva, Ekaterina; Bloom, Kenneth; Bose, Suvadeep; Butt, Jamila; Claes, Daniel R; Dominguez, Aaron; Eads, Michael; Jindal, Pratima; Keller, Jason; Kravchenko, Ilya; Lazo-Flores, Jose; Malbouisson, Helena; Malik, Sudhir; Snow, Gregory R; Baur, Ulrich; Godshalk, Andrew; Iashvili, Ia; Jain, Supriya; Kharchilava, Avto; Kumar, Ashish; Shipkowski, Simon Peter; Smith, Kenneth; Wan, Zongru; Alverson, George; Barberis, Emanuela; Baumgartel, Darin; Chasco, Matthew; Trocino, Daniele; Wood, Darien; Zhang, Jinzhong; Anastassov, Anton; Kubik, Andrew; Mucia, Nicholas; Odell, Nathaniel; Ofierzynski, Radoslaw Adrian; Pollack, Brian; Pozdnyakov, Andrey; Schmitt, Michael; Stoynev, Stoyan; Velasco, Mayda; Won, Steven; Antonelli, Louis; Berry, Douglas; Brinkerhoff, Andrew; Hildreth, Michael; Jessop, Colin; Karmgard, Daniel John; Kolb, Jeff; Lannon, Kevin; Luo, Wuming; Lynch, Sean; Marinelli, Nancy; Morse, David Michael; Pearson, Tessa; Ruchti, Randy; Slaunwhite, Jason; Valls, Nil; Wayne, Mitchell; Wolf, Matthias; Ziegler, Jill; Bylsma, Ben; Durkin, Lloyd Stanley; Hill, Christopher; Killewald, Phillip; Kotov, Khristian; Ling, Ta-Yung; Puigh, Darren; Rodenburg, Marissa; Vuosalo, Carl; Williams, Grayson; Adam, Nadia; Berry, Edmund; Elmer, Peter; Gerbaudo, Davide; Halyo, Valerie; Hebda, Philip; Hegeman, Jeroen; Hunt, Adam; Laird, Edward; Lopes Pegna, David; Lujan, Paul; Marlow, Daniel; Medvedeva, Tatiana; Mooney, Michael; Olsen, James; Piroué, Pierre; Quan, Xiaohang; Raval, Amita; Saka, Halil; Stickland, David; Tully, Christopher; Werner, Jeremy Scott; Zuranski, Andrzej; Acosta, Jhon Gabriel; Huang, Xing Tao; Lopez, Angel; Mendez, Hector; Oliveros, Sandra; Ramirez Vargas, Juan Eduardo; Zatserklyaniy, Andriy; Alagoz, Enver; Barnes, Virgil E; Benedetti, Daniele; Bolla, Gino; Bortoletto, Daniela; De Mattia, Marco; Everett, Adam; Gutay, Laszlo; Hu, Zhen; Jones, Matthew; Koybasi, Ozhan; Kress, Matthew; Laasanen, Alvin T; Leonardo, Nuno; Maroussov, Vassili; Merkel, Petra; Miller, David Harry; Neumeister, Norbert; Shipsey, Ian; Silvers, David; Svyatkovskiy, Alexey; Vidal Marono, Miguel; Yoo, Hwi Dong; Zablocki, Jakub; Zheng, Yu; Guragain, Samir; Parashar, Neeti; Adair, Antony; Boulahouache, Chaouki; Cuplov, Vesna; Ecklund, Karl Matthew; Geurts, Frank JM; Padley, Brian Paul; Redjimi, Radia; Roberts, Jay; Zabel, James; Betchart, Burton; Bodek, Arie; Chung, Yeon Sei; Covarelli, Roberto; de Barbaro, Pawel; Demina, Regina; Eshaq, Yossof; Garcia-Bellido, Aran; Goldenzweig, Pablo; Gotra, Yury; Han, Jiyeon; Harel, Amnon; Miner, Daniel Carl; Petrillo, Gianluca; Sakumoto, Willis; Vishnevskiy, Dmitry; Zielinski, Marek; Bhatti, Anwar; Ciesielski, Robert; Demortier, Luc; Goulianos, Konstantin; Lungu, Gheorghe; Malik, Sarah; Mesropian, Christina; Arora, Sanjay; Atramentov, Oleksiy; Barker, Anthony; Chou, John Paul; Contreras-Campana, Christian; Contreras-Campana, Emmanuel; Duggan, Daniel; Ferencek, Dinko; Gershtein, Yuri; Gray, Richard; Halkiadakis, Eva; Hidas, Dean; Hits, Dmitry; Lath, Amitabh; Panwalkar, Shruti; Park, Michael; Patel, Rishi; Richards, Alan; Rose, Keith; Salur, Sevil; Schnetzer, Steve; Seitz, Claudia; Somalwar, Sunil; Stone, Robert; Thomas, Scott; Cerizza, Giordano; Hollingsworth, Matthew; Spanier, Stefan; Yang, Zong-Chang; York, Andrew; Eusebi, Ricardo; Flanagan, Will; Gilmore, Jason; Kamon, Teruki; Khotilovich, Vadim; Montalvo, Roy; Osipenkov, Ilya; Pakhotin, Yuriy; Perloff, Alexx; Roe, Jeffrey; Safonov, Alexei; Sakuma, Tai; Sengupta, Sinjini; Suarez, Indara; Tatarinov, Aysen; Toback, David; Akchurin, Nural; Bardak, Cemile; Damgov, Jordan; Dudero, Phillip Russell; Jeong, Chiyoung; Kovitanggoon, Kittikul; Lee, Sung Won; Libeiro, Terence; Mane, Poonam; Roh, Youn; Sill, Alan; Volobouev, Igor; Wigmans, Richard; Appelt, Eric; Brownson, Eric; Engh, Daniel; Florez, Carlos; Gabella, William; Gurrola, Alfredo; Issah, Michael; Johns, Willard; Kurt, Pelin; Maguire, Charles; Melo, Andrew; Sheldon, Paul; Snook, Benjamin; Tuo, Shengquan; Velkovska, Julia; Arenton, Michael Wayne; Balazs, Michael; Boutle, Sarah; Conetti, Sergio; Cox, Bradley; Francis, Brian; Goadhouse, Stephen; Goodell, Joseph; Hirosky, Robert; Ledovskoy, Alexander; Lin, Chuanzhe; Neu, Christopher; Wood, John; Yohay, Rachel; Gollapinni, Sowjanya; Harr, Robert; Karchin, Paul Edmund; Kottachchi Kankanamge Don, Chamath; Lamichhane, Pramod; Mattson, Mark; Milstène, Caroline; Sakharov, Alexandre; Anderson, Michael; Bachtis, Michail; Belknap, Donald; Bellinger, James Nugent; Bernardini, Jacopo; Borrello, Laura; Carlsmith, Duncan; Cepeda, Maria; Dasu, Sridhara; Efron, Jonathan; Friis, Evan; Gray, Lindsey; Grogg, Kira Suzanne; Grothe, Monika; Hall-Wilton, Richard; Herndon, Matthew; Hervé, Alain; Klabbers, Pamela; Klukas, Jeffrey; Lanaro, Armando; Lazaridis, Christos; Leonard, Jessica; Loveless, Richard; Mohapatra, Ajit; Ojalvo, Isabel; Pierro, Giuseppe Antonio; Ross, Ian; Savin, Alexander; Smith, Wesley H; Swanson, Joshua

    2012-01-01

    A search for the standard model Higgs boson in the H to ZZ to 2l 2nu decay channel, where l = e or mu, in pp collisions at a center-of-mass energy of 7 TeV is presented. The data were collected at the LHC, with the CMS detector, and correspond to an integrated luminosity of 4.6 inverse femtobarns. No significant excess is observed above the background expectation, and upper limits are set on the Higgs boson production cross section. The presence of the standard model Higgs boson with a mass in the 270-440 GeV range is excluded at 95% confidence level.

  19. A Search for the Standard Model Higgs Boson Produced in Association with a $W$ Boson

    Energy Technology Data Exchange (ETDEWEB)

    Frank, Martin Johannes [Baylor Univ., Waco, TX (United States)

    2011-05-01

    We present a search for a standard model Higgs boson produced in association with a W boson using data collected with the CDF II detector from p$\\bar{p}$ collisions at √s = 1.96 TeV. The search is performed in the WH → ℓvb$\\bar{b}$ channel. The two quarks usually fragment into two jets, but sometimes a third jet can be produced via gluon radiation, so we have increased the standard two-jet sample by including events that contain three jets. We reconstruct the Higgs boson using two or three jets depending on the kinematics of the event. We find an improvement in our search sensitivity using the larger sample together with this multijet reconstruction technique. Our data show no evidence of a Higgs boson, so we set 95% confidence level upper limits on the WH production rate. We set limits between 3.36 and 28.7 times the standard model prediction for Higgs boson masses ranging from 100 to 150 GeV/c2.

  20. 震区地面搜索路线模型%Route Model of Earthquake Ground Search

    Institute of Scientific and Technical Information of China (English)

    安霞; 刘艳艳; 王福昌

    2011-01-01

    震后灾区矩形区域的全境搜索问题,是通过把搜索时间划分为出发时间、横向搜索时间、纵向搜索时间、搜角时间与集结时间,兼顾耗时与通讯,把搜索区域横向或纵向划分,建立三个在实践中易于操作的震区地面搜索路线模型来完成。%After the earthquake disaster areas throughout the rectangular area search problem, By the search time is divided into starting time, horizontal search time, vertical search time, and Gathering time. Taking into account the time-consuming and communication, the search area is divided horizontally or vertically, we set up three easy- to- route model of earthquake ground search.

  1. 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.

  2. Model-independent search for the decay B+→l+νlγ

    Science.gov (United States)

    Aubert, B.; Karyotakis, Y.; Lees, J. P.; Poireau, V.; Prencipe, E.; Prudent, X.; Tisserand, V.; Tico, J. Garra; Grauges, E.; Martinelli, M.; Palano, A.; Pappagallo, M.; Eigen, G.; Stugu, B.; Sun, L.; Battaglia, M.; Brown, D. N.; Kerth, L. T.; Kolomensky, Yu. G.; Lynch, G.; Osipenkov, I. L.; Tackmann, K.; Tanabe, T.; Hawkes, C. M.; Soni, N.; Watson, A. T.; Koch, H.; Schroeder, T.; Asgeirsson, D. J.; Fulsom, B. G.; Hearty, C.; Mattison, T. S.; McKenna, J. A.; Barrett, M.; Khan, A.; Randle-Conde, A.; Blinov, V. E.; Bukin, A. D.; Buzykaev, A. R.; Druzhinin, V. P.; Golubev, V. B.; Onuchin, A. P.; Serednyakov, S. I.; Skovpen, Yu. I.; Solodov, E. P.; Todyshev, K. Yu.; Bondioli, M.; Curry, S.; Eschrich, I.; Kirkby, D.; Lankford, A. J.; Lund, P.; Mandelkern, M.; Martin, E. C.; Stoker, D. P.; Atmacan, H.; Gary, J. W.; Liu, F.; Long, O.; Vitug, G. M.; Yasin, Z.; Sharma, V.; Campagnari, C.; Hong, T. M.; Kovalskyi, D.; Mazur, M. A.; Richman, J. D.; Beck, T. W.; Eisner, A. M.; Heusch, C. A.; Kroseberg, J.; Lockman, W. S.; Martinez, A. J.; Schalk, T.; Schumm, B. A.; Seiden, A.; Wang, L.; Winstrom, L. O.; Cheng, C. H.; Doll, D. A.; Echenard, B.; Fang, F.; Hitlin, D. G.; Narsky, I.; Ongmongkolkul, P.; Piatenko, T.; Porter, F. C.; Andreassen, R.; Mancinelli, G.; Meadows, B. T.; Mishra, K.; Sokoloff, M. D.; Bloom, P. C.; Ford, W. T.; Gaz, A.; Hirschauer, J. F.; Nagel, M.; Nauenberg, U.; Smith, J. G.; Wagner, S. R.; Ayad, R.; Toki, W. H.; Wilson, R. J.; Feltresi, E.; Hauke, A.; Jasper, H.; Karbach, T. M.; Merkel, J.; Petzold, A.; Spaan, B.; Wacker, K.; Kobel, M. J.; Nogowski, R.; Schubert, K. R.; Schwierz, R.; Volk, A.; Bernard, D.; Latour, E.; Verderi, M.; Clark, P. J.; Playfer, S.; Watson, J. E.; Andreotti, M.; Bettoni, D.; Bozzi, C.; Calabrese, R.; Cecchi, A.; Cibinetto, G.; Fioravanti, E.; Franchini, P.; Luppi, E.; Munerato, M.; Negrini, M.; Petrella, A.; Piemontese, L.; Santoro, V.; Baldini-Ferroli, R.; Calcaterra, A.; de Sangro, R.; Finocchiaro, G.; Pacetti, S.; Patteri, P.; Peruzzi, I. M.; Piccolo, M.; Rama, M.; Zallo, A.; Contri, R.; Guido, E.; Lo Vetere, M.; Monge, M. R.; Passaggio, S.; Patrignani, C.; Robutti, E.; Tosi, S.; Chaisanguanthum, K. S.; Morii, M.; Adametz, A.; Marks, J.; Schenk, S.; Uwer, U.; Bernlochner, F. U.; Klose, V.; Lacker, H. M.; Bard, D. J.; Dauncey, P. D.; Tibbetts, M.; Behera, P. K.; Charles, M. J.; Mallik, U.; Cochran, J.; Crawley, H. B.; Dong, L.; Eyges, V.; Meyer, W. T.; Prell, S.; Rosenberg, E. I.; Rubin, A. E.; Gao, Y. Y.; Gritsan, A. V.; Guo, Z. J.; Arnaud, N.; Béquilleux, J.; D'Orazio, A.; Davier, M.; Derkach, D.; da Costa, J. Firmino; Grosdidier, G.; Le Diberder, F.; Lepeltier, V.; Lutz, A. M.; Malaescu, B.; Pruvot, S.; Roudeau, P.; Schune, M. H.; Serrano, J.; Sordini, V.; Stocchi, A.; Wormser, G.; Lange, D. J.; Wright, D. M.; Bingham, I.; Burke, J. P.; Chavez, C. A.; Fry, J. R.; Gabathuler, E.; Gamet, R.; Hutchcroft, D. E.; Payne, D. J.; Touramanis, C.; Bevan, A. J.; Clarke, C. K.; di Lodovico, F.; Sacco, R.; Sigamani, M.; Cowan, G.; Paramesvaran, S.; Wren, A. C.; Brown, D. N.; Davis, C. L.; Denig, A. G.; Fritsch, M.; Gradl, W.; Hafner, A.; Alwyn, K. E.; Bailey, D.; Barlow, R. J.; Jackson, G.; Lafferty, G. D.; West, T. J.; Yi, J. I.; Anderson, J.; Chen, C.; Jawahery, A.; Roberts, D. A.; Simi, G.; Tuggle, J. M.; Dallapiccola, C.; Salvati, E.; Cowan, R.; Dujmic, D.; Fisher, P. H.; Henderson, S. W.; Sciolla, G.; Spitznagel, M.; Yamamoto, R. K.; Zhao, M.; Lindemann, D. M.; Patel, P. M.; Robertson, S. H.; Schram, M.; Biassoni, P.; Lazzaro, A.; Lombardo, V.; Palombo, F.; Stracka, S.; Bauer, J. M.; Cremaldi, L.; Godang, R.; Kroeger, R.; Sonnek, P.; Summers, D. J.; Zhao, H. W.; Simard, M.; Taras, P.; Nicholson, H.; de Nardo, G.; Lista, L.; Monorchio, D.; Onorato, G.; Sciacca, C.; Raven, G.; Snoek, H. L.; Jessop, C. P.; Knoepfel, K. J.; Losecco, J. M.; Wang, W. F.; Corwin, L. A.; Honscheid, K.; Kagan, H.; Kass, R.; Morris, J. P.; Rahimi, A. M.; Regensburger, J. J.; Sekula, S. J.; Wong, Q. K.; Blount, N. L.; Brau, J.; Frey, R.; Igonkina, O.; Kolb, J. A.; Lu, M.; Rahmat, R.; Sinev, N. B.; Strom, D.; Strube, J.; Torrence, E.; Castelli, G.; Gagliardi, N.; Margoni, M.; Morandin, M.; Posocco, M.; Rotondo, M.; Simonetto, F.; Stroili, R.; Voci, C.; Del Amo Sanchez, P.; Ben-Haim, E.; Bonneaud, G. R.; Briand, H.; Chauveau, J.; Hamon, O.; Leruste, Ph.; Marchiori, G.; Ocariz, J.; Perez, A.; Prendki, J.; Sitt, S.; Gladney, L.; Biasini, M.; Manoni, E.; Angelini, C.; Batignani, G.; Bettarini, S.; Calderini, G.; Carpinelli, M.; Cervelli, A.; Forti, F.; Giorgi, M. A.; Lusiani, A.; Morganti, M.; Neri, N.; Paoloni, E.; Rizzo, G.; Walsh, J. J.; Pegna, D. Lopes; Lu, C.; Olsen, J.; Smith, A. J. S.; Telnov, A. V.; Anulli, F.; Baracchini, E.; Cavoto, G.; Faccini, R.; Ferrarotto, F.; Ferroni, F.; Gaspero, M.

    2009-12-01

    We present a search for the radiative leptonic decay B+→ℓ+νℓγ, where ℓ=e, μ, using a data sample of 465×106 BB¯ pairs collected by the BABAR experiment. In this analysis, we fully reconstruct the hadronic decay of one of the B mesons in Υ(4S)→B+B- decays, then search for evidence of B+→ℓ+νℓγ in the rest of the event. We observe no significant evidence of signal decays and report model-independent branching fraction upper limits of B(B+→e+νeγ)<17×10-6, B(B+→μ+νμγ)<24×10-6, and B(B+→ℓ+νℓγ)<15.6×10-6 (ℓ=e or μ), all at the 90% confidence level.

  3. 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.

  4. A search for the standard model Higgs boson using the DELPHI detector at LEP 2

    CERN Document Server

    Sheridan, A

    1998-01-01

    A search for the Standard Model Higgs boson is performed using the 51.59 pb sup - sup 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 sup 2 is set. This limit significantly improves the limit obtained with previous data.

  5. Improved limits on Standard Model Extension parameters and applications to axion dark matter searches

    CERN Document Server

    Stadnik, Y V

    2014-01-01

    Nuclear many-body effects create new possibilities in tests of the fundamental symmetries of nature and searches for axion dark matter. We calculate the proton and neutron spin contributions for a wide range of nuclei of experimental interest. We reconsider experiments, which search for evidence of CPT- and Lorentz invariance-violating couplings, using a $^{3}$He/$^{129}$Xe comagnetometer and show that the $^{3}$He/$^{129}$Xe system is in fact particularly sensitive to proton interaction parameters. From existing data, we derive a limit on the Standard Model Extension (SME) parameter $|\\tilde{b}_{\\perp}^p| < 1.6 \\times 10^{-33}$ GeV, which improves on the world's previously most stringent limit by a factor of 35. We also extend previous analysis of nuclear anapole moment data for Cs to obtain new limits on several other SME parameters.

  6. Modeling the Effect of Selection History on Pop-Out Visual Search

    Science.gov (United States)

    Tseng, Yuan-Chi; Glaser, Joshua I.; Caddigan, Eamon; Lleras, Alejandro

    2014-01-01

    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. PMID:24595032

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

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

    Science.gov (United States)

    Tseng, Yuan-Chi; Glaser, Joshua I; Caddigan, Eamon; Lleras, Alejandro

    2014-01-01

    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.

  9. Dissecting jets and missing energy searches using n-body extended simplified models

    Energy Technology Data Exchange (ETDEWEB)

    Cohen, Timothy [Institute of Theoretical Science, University of Oregon, Eugene, OR 97403 (United States); Dolan, Matthew J. [ARC Centre of Excellence for Particle Physics at the Terascale,School of Physics, University of Melbourne, 3010 (Australia); Hedri, Sonia El [Institut fur Physik (THEP) Johannes Gutenberg-Universitat,D-55099, Mainz (Germany); Hirschauer, James; Tran, Nhan; Whitbeck, Andrew [Fermi National Accelerator Laboratory, Batavia, IL 60510 (United States)

    2016-08-04

    Simplified Models are a useful way to characterize new physics scenarios for the LHC. Particle decays are often represented using non-renormalizable operators that involve the minimal number of fields required by symmetries. Generalizing to a wider class of decay operators allows one to model a variety of final states. This approach, which we dub the n-body extension of Simplified Models, provides a unifying treatment of the signal phase space resulting from a variety of signals. In this paper, we present the first application of this framework in the context of multijet plus missing energy searches. The main result of this work is a global performance study with the goal of identifying which set of observables yields the best discriminating power against the largest Standard Model backgrounds for a wide range of signal jet multiplicities. Our analysis compares combinations of one, two and three variables, placing emphasis on the enhanced sensitivity gain resulting from non-trivial correlations. Utilizing boosted decision trees, we compare and classify the performance of missing energy, energy scale and energy structure observables. We demonstrate that including an observable from each of these three classes is required to achieve optimal performance. This work additionally serves to establish the utility of n-body extended Simplified Models as a diagnostic for unpacking the relative merits of different search strategies, thereby motivating their application to new physics signatures beyond jets and missing energy.

  10. 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.

  11. 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.

  12. 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.

  13. Boosting invisible searches via $\\boldsymbol{ZH}$: From the Higgs Boson to Dark Matter Simplified Models

    CERN Document Server

    Goncalves, Dorival; Kuttimalai, Silvan; Maierhöfer, Philipp

    2016-01-01

    Higgs boson production in association with a $Z$-boson at the LHC is analysed, both in the Standard Model and in Simplified Model extensions for Dark Matter. We focus on $H\\rightarrow$invisibles searches and show that loop-induced components for both the signal and background present phenomenologically relevant contributions to the $\\mathcal{BR}(H\\rightarrow\\textit{inv})$ limits. In addition, the constraining power of this channel to Simplified Models for Dark Matter with scalar and pseudo-scalar mediators $\\phi$ and $A$ is discussed and compared with non-collider constraints. We find that with $100~fb^{-1}$ of LHC data, this channel provides competitive constraints to the non-collider bounds, for most of the parameter space we consider, bounding the universal Standard Model fermion-mediator strength at $g_v < 1$ for moderate masses in the range of ${100~\\text{GeV}

  14. 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.)

  15. 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.

  16. Dissecting Jets and Missing Energy Searches Using $n$-body Extended Simplified Models

    CERN Document Server

    Cohen, Timothy; Hedri, Sonia El; Hirschauer, James; Tran, Nhan; Whitbeck, Andrew

    2016-01-01

    Simplified Models are a useful way to characterize new physics scenarios for the LHC. Particle decays are often represented using non-renormalizable operators that involve the minimal number of fields required by symmetries. Generalizing to a wider class of decay operators allows one to model a variety of final states. This approach, which we dub the $n$-body extension of Simplified Models, provides a unifying treatment of the signal phase space resulting from a variety of signals. In this paper, we present the first application of this framework in the context of multijet plus missing energy searches. The main result of this work is a global performance study with the goal of identifying which set of observables yields the best discriminating power against the largest Standard Model backgrounds for a wide range of signal jet multiplicities. Our analysis compares combinations of one, two and three variables, placing emphasis on the enhanced sensitivity gain resulting from non-trivial correlations. Utilizing b...

  17. Search for Charged Higgs Bosons at LEP in General Two Higgs Doublet 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; 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, Borut 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 M; 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; Poropat, P; Pozdnyakov, V; Pukhaeva, N; Pullia, Antonio; Rames, J; Ramler, L; 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, Patrick; Rovelli, T; Ruhlmann-Kleider, V; Ryabtchikov, D; Sadovskii, A; Salmi, L; Salt, J; 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 A; Verdier, P; Verzi, V; Vilanova, D; Vitale, L; Vrba, V; Wahlen, H; Washbrook, A J; Weiser, C; Wicke, D; Wickens, J H; 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

    A search for pair-produced charged Higgs bosons was performed in the data collected by the DELPHI detector at LEP II at centre-of-mass energies from 189 GeV to 209 GeV. Five different final states, tau+ nu_tau tau- anti-nu_tau, c sbar cbar s, c sbar tau- anti-nu_tau, W* A W* A and W* A tau- anti-nu_tau were considered, accounting for the major expected decays in type I and type II Two Higgs Doublet Models. No significant excess of data compared to the expected Standard Model processes was observed. The existence of a charged Higgs boson with mass lower than 76.7 GeV/c^2 (type I) or 74.4 GeV/c^2 (type II) is excluded at the 95% confidence level, for a wide range of the model parameters. Model independent cross-section limits have also been calculated.

  18. 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....

  19. 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.

  20. 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.

  1. Optimization and universality of Brownian search in a basic model of quenched heterogeneous media

    Science.gov (United States)

    Godec, Aljaž; Metzler, Ralf

    2015-05-01

    The kinetics of a variety of transport-controlled processes can be reduced to the problem of determining the mean time needed to arrive at a given location for the first time, the so-called mean first-passage time (MFPT) problem. The occurrence of occasional large jumps or intermittent patterns combining various types of motion are known to outperform the standard random walk with respect to the MFPT, by reducing oversampling of space. Here we show that a regular but spatially heterogeneous random walk can significantly and universally enhance the search in any spatial dimension. In a generic minimal model we consider a spherically symmetric system comprising two concentric regions with piecewise constant diffusivity. The MFPT is analyzed under the constraint of conserved average dynamics, that is, the spatially averaged diffusivity is kept constant. Our analytical calculations and extensive numerical simulations demonstrate the existence of an optimal heterogeneity minimizing the MFPT to the target. We prove that the MFPT for a random walk is completely dominated by what we term direct trajectories towards the target and reveal a remarkable universality of the spatially heterogeneous search with respect to target size and system dimensionality. In contrast to intermittent strategies, which are most profitable in low spatial dimensions, the spatially inhomogeneous search performs best in higher dimensions. Discussing our results alongside recent experiments on single-particle tracking in living cells, we argue that the observed spatial heterogeneity may be beneficial for cellular signaling processes.

  2. A Neotropical Miocene Pollen Database Employing Image-Based Search and Semantic Modeling

    Directory of Open Access Journals (Sweden)

    Jing Ginger Han

    2014-08-01

    Full Text Available Premise of the study: Digital microscopic pollen images are being generated with increasing speed and volume, producing opportunities to develop new computational methods that increase the consistency and efficiency of pollen analysis and provide the palynological community a computational framework for information sharing and knowledge transfer. Methods: Mathematical methods were used to assign trait semantics (abstract morphological representations of the images of neotropical Miocene pollen and spores. Advanced database-indexing structures were built to compare and retrieve similar images based on their visual content. A Web-based system was developed to provide novel tools for automatic trait semantic annotation and image retrieval by trait semantics and visual content. Results: Mathematical models that map visual features to trait semantics can be used to annotate images with morphology semantics and to search image databases with improved reliability and productivity. Images can also be searched by visual content, providing users with customized emphases on traits such as color, shape, and texture. Discussion: Content- and semantic-based image searches provide a powerful computational platform for pollen and spore identification. The infrastructure outlined provides a framework for building a community-wide palynological resource, streamlining the process of manual identification, analysis, and species discovery.

  3. Searches for the Standard Model Higgs boson at the LEP collider

    Science.gov (United States)

    Igo-Kemenes, Peter; Read, Alexander L.

    2016-10-01

    The Large Electron Positron (LEP) collider installed at CERN provided unprecedented possibilities for studying the properties of elementary particles during the years 1989-2000. The four detectors associated to the collider, run by the ALEPH, DELPHI, L3, and OPAL Collaborations, were based on the latest available technologies. The conjunction of high collision energies, precise instrumentation and data analysis techniques allowed the Standard Model (SM) of elementary particles to be tested at the level of quantum corrections. The search for new particles, in particular the long-sought Higgs boson, was one of the primary research subjects. During the twelve years of LEP, data samples of the highest quality and statistical weight were analysed. Concerning the search for the SM Higgs boson, the domain extending from zero mass to the kinematic limit imposed by the collider energy was scrutinised. The spirit of scientific competition gradually gave way to a collaborative effort, allowing the final results of LEP to be optimised. The methodology of Higgs boson searches is summarised in this paper together with the statistical methods adopted to combine the data of the four collaborations.

  4. Model-based Layer Estimation using a Hybrid Genetic/Gradient Search Optimization Algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Chambers, D; Lehman, S; Dowla, F

    2007-05-17

    A particle swarm optimization (PSO) algorithm is combined with a gradient search method in a model-based approach for extracting interface positions in a one-dimensional multilayer structure from acoustic or radar reflections. The basic approach is to predict the reflection measurement using a simulation of one-dimensional wave propagation in a multi-layer, evaluate the error between prediction and measurement, and then update the simulation parameters to minimize the error. Gradient search methods alone fail due to the number of local minima in the error surface close to the desired global minimum. The PSO approach avoids this problem by randomly sampling the region of the error surface around the global minimum, but at the cost of a large number of evaluations of the simulator. The hybrid approach uses the PSO at the beginning to locate the general area around the global minimum then switches to the gradient search method to zero in on it. Examples of the algorithm applied to the detection of interior walls of a building from reflected ultra-wideband radar signals are shown. Other possible applications are optical inspection of coatings and ultrasonic measurement of multilayer structures.

  5. 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.

  6. An Interpretation of Tevatron SUSY Trilepton Search Results in mSUGRA and in a Model-independent Fashion

    CERN Document Server

    Dube, Sourabh; Somalwar, Sunil; Sood, Alexander

    2008-01-01

    Both the CDF and D0 experiments at the Tevatron search for supersymmetry using the golden three lepton and missing energy "trilepton" signature of chargino-neutralino production. However, the experimental results are presented for specific parameter values of a given model or for custom-made scenarios in the region of sensitivity. By breaking down search sensitivity according to the tau-lepton content of the trileptons, we are able to present in this paper a recipe to extend the interpretation of the Tevatron trilepton search results to the general mSUGRA model. We also attempt to interprete the search results in a model-independent fashion by expressing them in terms of relevant sparticle masses instead of specific parameters of a model such as mSUGRA.

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

  8. Search for the Standard Model Higgs boson at LEP in the year 2000

    CERN Document Server

    Abreu, P.; Adye, T.; Adzic, P.; Albrecht, Z.; Alderweireld, T.; Alekseev, G.D.; Alemany, R.; Allmendinger, T.; Allport, P.P.; Almehed, S.; Amaldi, U.; Amapane, N.; Amato, S.; Anashkin, E.; Anassontzis, E.G.; Andersson, P.; Andreazza, A.; Andringa, S.; Anjos, N.; Antilogus, P.; Apel, W.D.; Arnoud, Y.; Asman, B.; Augustin, J.E.; Augustinus, A.; Baillon, P.; Ballestrero, A.; Bambade, P.; Barao, F.; Barbiellini, G.; Barbier, R.; Bardin, Dmitri Yu.; Barker, G.J.; Baroncelli, A.; Battaglia, M.; Baubillier, M.; Becks, K.H.; Begalli, M.; Behrmann, A.; Belokopytov, Yu.; Belous, K.; Benekos, N.C.; Benvenuti, A.C.; Berat, C.; Berggren, M.; Berntzon, L.; Bertrand, D.; Besancon, M.; Besson, N.; Bilenky, Mikhail S.; Bloch, D.; Blom, H.M.; Bol, L.; Bonesini, M.; Boonekamp, M.; Booth, P.S.L.; Borisov, G.; Bosio, C.; Botner, O.; Boudinov, E.; Bouquet, B.; Bowcock, T.J.V.; Boyko, I.; Bozovic, I.; Bozzo, M.; Bracko, M.; Branchini, P.; Brenner, R.A.; Bruckman, P.; Brunet, J.M.; Bugge, L.; Buschmann, P.; Caccia, M.; Calvi, M.; Camporesi, T.; Canale, V.; Carena, F.; Carroll, L.; Caso, C.; Castillo Gimenez, M.V.; Cattai, A.; Cavallo, F.R.; Chapkin, M.; Charpentier, P.; Checchia, P.; Chelkov, G.A.; Chierici, R.; Chliapnikov, P.; Chochula, P.; Chorowicz, V.; Chudoba, J.; Cieslik, K.; Collins, P.; Contri, R.; Cortina, E.; Cosme, G.; Cossutti, F.; Costa, M.; Crawley, H.B.; Crennell, D.; Croix, J.; Crosetti, G.; Cuevas Maestro, J.; Czellar, S.; D'Hondt, J.; Dalmau, J.; Davenport, M.; Da Silva, W.; Della Ricca, G.; Delpierre, P.; Demaria, N.; De Angelis, A.; De Boer, W.; De Clercq, C.; De Lotto, B.; De Min, A.; De Paula, L.; Dijkstra, H.; Di Ciaccio, L.; Doroba, K.; Dracos, M.; Drees, J.; Dris, M.; Eigen, G.; Ekelof, T.; Ellert, M.; Elsing, M.; Engel, J.P.; Espirito Santo, M.C.; Fanourakis, G.; Fassouliotis, D.; Feindt, M.; Fernandez, J.; Ferrer, A.; Ferrer-Ribas, E.; Ferro, F.; Firestone, A.; Flagmeyer, U.; Foeth, H.; Fokitis, E.; Franek, B.; Frodesen, A.G.; Fruhwirth, R.; Fulda-Quenzer, F.; Fuster, J.; Gamba, D.; Gamblin, S.; Gandelman, M.; Garcia, C.; Gaspar, C.; Gaspar, M.; Gasparini, U.; Gavillet, P.; Gazis, Evangelos; Gele, D.; Geralis, T.; Ghodbane, N.; Gil Botella, Ines; Glege, F.; Gokieli, R.; Golob, B.; Gomez-Ceballos, G.; Goncalves, P.; Gonzalez Caballero, I.; Gopal, G.; Gorn, L.; Gouz, Yu.; Gracco, V.; Grahl, J.; Graziani, E.; Grosdidier, G.; Grzelak, K.; Guy, J.; Haag, C.; Hahn, F.; Hahn, S.; Haider, S.; Hallgren, A.; Hamacher, K.; Hansen, J.; Harris, F.J.; Haug, S.; Hauler, F.; Hedberg, V.; Heising, S.; Hernandez, J.J.; Herquet, P.; Herr, H.; Hertz, O.; Higon, E.; Holmgren, S.O.; Holt, P.J.; Hoorelbeke, S.; Houlden, M.; Hrubec, J.; Hughes, G.J.; Hultqvist, K.; Jackson, John Neil; Jacobsson, R.; Jalocha, P.; Jarlskog, C.; Jarlskog, G.; Jarry, P.; Jean-Marie, B.; Jeans, D.; Johansson, Erik Karl; Jonsson, P.; Joram, C.; Juillot, P.; Jungermann, L.; Kapusta, Frederic; Karafasoulis, K.; Katsanevas, S.; Katsoufis, E.C.; Keranen, R.; Kernel, G.; Kersevan, B.P.; Khomenko, B.A.; Khovanski, N.N.; Kiiskinen, A.; King, B.; Kinvig, A.; Kjaer, N.J.; Klapp, O.; Kluit, P.; Kokkinias, P.; Kostioukhine, V.; Kourkoumelis, C.; Kouznetsov, O.; Krammer, M.; Kriznic, E.; Krumstein, Z.; Kubinec, P.; Kucharczyk, M.; Kurowska, J.; Lamsa, J.W.; Laugier, J.P.; Leder, G.; Ledroit, Fabienne; Leinonen, L.; Leisos, A.; Leitner, R.; Lenzen, G.; Lepeltier, V.; Lesiak, T.; Lethuillier, M.; Libby, J.; Liebig, W.; Liko, D.; Lipniacka, A.; Lippi, I.; Loken, J.G.; Lopes, J.H.; Lopez, J.M.; Lopez-Fernandez, R.; Loukas, D.; Lutz, P.; Lyons, L.; MacNaughton, J.; Mahon, J.R.; Maio, A.; Malek, A.; Maltezos, S.; Malychev, V.; Mandl, F.; Marco, J.; Marco, R.; Marechal, B.; Margoni, M.; Marin, J.C.; Mariotti, C.; Markou, A.; Martinez-Rivero, C.; Marti i Garcia, S.; Masik, J.; Mastroyiannopoulos, N.; Matorras, F.; Matteuzzi, C.; Matthiae, G.; Mazzucato, F.; Mazzucato, M.; McCubbin, M.; McKay, R.; McNulty, R.; Merle, E.; Meroni, C.; Meyer, W.T.; Miagkov, A.; Migliore, E.; Mirabito, L.; Mitaroff, W.A.; Mjoernmark, U.; Moa, T.; Moch, M.; Monig, Klaus; Monge, M.R.; Montenegro, J.; Moraes, D.; Morettini, P.; Morton, G.; Muller, U.; Muenich, K.; Mulders, M.; Mundim, L.M.; Murray, W.J.; Muryn, B.; Myatt, G.; Myklebust, T.; Nassiakou, M.; Navarria, F.L.; Nawrocki, K.; Negri, P.; Nemecek, S.; Neufeld, N.; Nicolaidou, R.; Niezurawski, P.; Nikolenko, M.; Nomokonov, V.; Nygren, A.; Obraztsov, V.; Olshevski, A.G.; Onofre, A.; Orava, R.; Osterberg, K.; Ouraou, A.; Oyanguren, A.; Paganoni, M.; Paiano, S.; Pain, R.; Paiva, R.; Palacios, J.; Palka, H.; Papadopoulou, T.D.; Pape, L.; Parkes, C.; Parodi, F.; Parzefall, U.; Passeri, A.; Passon, O.; Peralta, L.; Perepelitsa, V.; Pernicka, M.; Perrotta, A.; Petridou, C.; Petrolini, A.; Phillips, H.T.; Pierre, F.; Pimenta, M.; Piotto, E.; Podobnik, T.; Poireau, V.; Pol, M.E.; Polok, G.; Poropat, P.; Pozdniakov, V.; Privitera, P.; Pukhaeva, N.; Pullia, A.; Radojicic, D.; Ragazzi, S.; Rahmani, H.; Read, Alexander L.; Rebecchi, P.; Redaelli, Nicola Giuseppe; Regler, M.; Rehn, J.; Reid, D.; Reinhardt, R.; Renton, P.B.; Resvanis, L.K.; Richard, F.; Ridky, J.; Rinaudo, G.; Ripp-Baudot, Isabelle; Romero, A.; Ronchese, P.; Rosenberg, E.I.; Rosinsky, P.; Roudeau, P.; Rovelli, T.; Ruhlmann-Kleider, V.; Ruiz, A.; Saarikko, H.; Sacquin, Y.; Sadovsky, A.; Sajot, G.; Salmi, L.; Salt, J.; Sampsonidis, D.; Sannino, M.; Savoy-Navarro, A.; Schwanda, C.; Schwemling, P.; Schwering, B.; Schwickerath, U.; Scuri, Fabrizio; Sedykh, Y.; Segar, A.M.; Sekulin, R.; Sette, G.; Shellard, R.C.; Siebel, M.; Simard, L.; Simonetto, F.; Sisakian, A.N.; Smadja, G.; Smirnov, N.; Smirnova, O.; Smith, G.R.; Sokolov, A.; Sopczak, A.; Sosnowski, R.; Spassov, T.; Spiriti, E.; Squarcia, S.; Stanescu, C.; Stanitzki, M.; Stevenson, K.; Stocchi, A.; Strauss, J.; Strub, R.; Stugu, B.; Szczekowski, M.; Szeptycka, M.; Tabarelli, T.; Taffard, A.; Chikilev, O.; Tegenfeldt, F.; Terranova, F.; Timmermans, Jan; Tinti, N.; Tkatchev, L.G.; Tobin, M.; Todorova, S.; Tome, B.; Tonazzo, A.; Tortora, L.; Tortosa, P.; Treille, D.; Tristram, G.; Trochimczuk, M.; Troncon, C.; Turluer, M.L.; Tyapkin, I.A.; Tyapkin, P.; Tzamarias, S.; Ullaland, O.; Uvarov, V.; Valenti, G.; Vallazza, E.; Vander Velde, C.; Van Dam, Piet; Van den Boeck, W.; Van Doninck, Walter; Van Eldik, J.; Van Lysebetten, A.; van Remortel, N.; Van Vulpen, I.; Vegni, G.; Ventura, L.; Venus, W.; Verbeure, F.; Verdier, P.; Verlato, M.; Vertogradov, L.S.; Verzi, V.; Vilanova, D.; Vitale, L.; Vlasov, E.; Vodopianov, A.S.; Voulgaris, G.; Vrba, V.; Wahlen, H.; Washbrook, A.J.; Weiser, C.; Wicke, D.; Wickens, J.H.; Wilkinson, G.R.; Winter, M.; Witek, M.; Wolf, G.; Yi, J.; Yushchenko, O.; Zalewska, A.; Zalewski, P.; Zavrtanik, D.; Zevgolatakos, E.; Zimine, N.I.; Zintchenko, A.; Zoller, P.; Zumerle, G.; Zupan, M.

    2001-01-01

    Searches for the Standard Model Higgs boson have been performed in the data collected by the DELPHI experiment at LEP in the year 2000 at centre-of-mass energies between 200 and 209~\\mbox{${\\mathrm{GeV}} $} corresponding to a total integrated \\mbox{luminosity} of 224~\\mbox{pb$^{-1}$}. No evidence for a Higgs signal is observed in the kinematically accessible mass range, and a 95\\% CL lower mass limit of 114.3~\\mbox{${\\mathrm{GeV}}/c ^2 $} is set, to be compared with an expected median limit of 113.5~\\mbox{${\\mathrm{GeV}}/c^2 $} for these data.

  9. Search for the standard model Higgs boson with the ATLAS detector

    CERN Document Server

    Orestano, D

    2013-01-01

    This document presents a brief overview of some of the experimental techniques employed by the ATLAS experiment at the CERN Large Hadron Collider in the search for the Higgs boson predicted by the standard model of particle physics. The data and the statistical analyses which allowed in July 2012, only few days before this presentation at the Marcel Grossman Meeting, to firmly establish the observation of a new particle, are described. The additional studies needed to check the consistency between the newly discovered particle and the Higgs boson are also discussed.

  10. 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-01-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 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$...

  11. Modeling State Space Search Technique for a Real World Adversarial Problem Solving

    Directory of Open Access Journals (Sweden)

    Kester O. Omoregie

    2015-02-01

    Full Text Available In problem solving, there is a search for the appropriate solution. A state space is a problem domain consisting of the start state, the goal state and the operations that will necessitate the various moves from the start state to the goal state. Each move operation takes one away from the start state and closer to the goal state. In this work we have attempted implementing this concept in adversarial problem solving, which is a more complex problem space. We noted that real world adversarial problems vary in their types and complexities, and therefore solving an adversarial problem would depend on the nature of the adversarial problem itself. Specifically, we examined a real world case, "the prisoner's dilemma" which is a critical, mutually independent, decision making adversarial problem. We combined the idea of the Thagard's Theory of Explanatory Coherence (TEC with Bayes' theorem of conditional probability to construct the model of an opponent that includes the opponent's model of the agent. A further conversion of the model into a series of state space structures led us into the use of breadth-first search strategy to arrive at our decision goal.

  12. Search for the Standard Model Higgs boson in the dimuon decay channel with the ATLAS detector

    CERN Document Server

    Rudolph, Christian

    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. 2 On top of that, the non-resonant Standard Model background arising from the $Z/\\gamma^*\\rightarrow\\mu\\mu$ 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 boso...

  13. Detecting outlying studies in meta-regression models using a forward search algorithm.

    Science.gov (United States)

    Mavridis, Dimitris; Moustaki, Irini; Wall, Melanie; Salanti, Georgia

    2017-06-01

    When considering data from many trials, it is likely that some of them present a markedly different intervention effect or exert an undue influence on the summary results. We develop a forward search algorithm for identifying outlying and influential studies in meta-analysis models. The forward search algorithm starts by fitting the hypothesized model to a small subset of likely outlier-free studies and proceeds by adding studies into the set one-by-one that are determined to be closest to the fitted model of the existing set. As each study is added to the set, plots of estimated parameters and measures of fit are monitored to identify outliers by sharp changes in the forward plots. We apply the proposed outlier detection method to two real data sets; a meta-analysis of 26 studies that examines the effect of writing-to-learn interventions on academic achievement adjusting for three possible effect modifiers, and a meta-analysis of 70 studies that compares a fluoride toothpaste treatment to placebo for preventing dental caries in children. A simple simulated example is used to illustrate the steps of the proposed methodology, and a small-scale simulation study is conducted to evaluate the performance of the proposed method. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.

  14. A Quasi-Model-Independent Search for New Physics at Large Transverse Momentum

    CERN Document Server

    Abbott, B; Abolins, M; Abramov, V; Acharya, B S; Adams, D L; Adams, M; Alves, G A; Amos, N; Anderson, E W; Baarmand, M M; Babintsev, V V; Babukhadia, L R; Bacon, Trevor C; Baden, A; Baldin, B Yu; Balm, P W; Todorova-Nová, S; Barberis, E; Baringer, P; Bartlett, J F; Bassler, U; Bauer, D; Bean, A; Begel, M; Belyaev, A; Beri, S B; Bernardi, G; Bertram, I; Besson, A; Beuselinck, R; Bezzubov, V A; Bhat, P C; Bhatnagar, V; Bhattacharjee, M; Blazey, G C; Blessing, S; Böhnlein, A; Bozhko, N; Borcherding, F; Brandt, A; Breedon, R; Briskin, G M; Brock, R; Brooijmans, G; Bross, A; Buchholz, D; Bühler, M; Büscher, V; Burtovoi, V S; Butler, J M; Canelli, F; Carvalho, W S; Casey, D; Casilum, Z; Castilla-Valdez, H; Chakraborty, D; Chan, K M; Chekulaev, S V; Cho, D K; Choi, S; Chopra, S; Christenson, J H; Chung, M; Claes, D; Clark, A R; Cochran, J; Coney, L; Connolly, B; Cooper, W E; Coppage, D; Cummings, M A C; Cutts, D; Davis, G A; Davis, K; De, K; Del Signore, K; Demarteau, M; Demina, R; Demine, P; Denisov, D S; Denisov, S P; Desai, S V; Diehl, H T; Diesburg, M; DiLoreto, G; Doulas, S; Draper, P; Ducros, Y; Dudko, L V; Duensing, S; Duflot, L; Dugad, S R; Dyshkant, A; Edmunds, D; Ellison, J; Elvira, V D; Engelmann, R; Eno, S; Eppley, G; Ermolov, P; Eroshin, O V; Estrada, J; Evans, H; Evdokimov, V N; Fahland, T; Fehér, S; Fein, D; Ferbel, T; Filthaut, Frank; Fisk, H E; Fisyak, Yu; Flattum, E M; Fleuret, F; Fortner, M R; Frame, K C; Fuess, S; Gallas, E J; Galjaev, A N; Gao, M; Gavrilov, V; Genik, R J; Genser, K; Gerber, C E; Gershtein, Yu; Gilmartin, R; Ginther, G; Gómez, B; Gómez, G; Goncharov, P I; González-Solis, J L; Gordon, H; Goss, L T; Gounder, K; Goussiou, A; Graf, N; Graham, G; Grannis, P D; Green, J A; Greenlee, H; Grinstein, S; Groer, L S; Grünendahl, S; Sen-Gupta, A; Gurzhev, S N; Gutíerrez, G; Gutíerrez, P; Hadley, N J; Haggerty, H; Hagopian, S L; Hagopian, V; Hahn, K S; Hall, R E; Hanlet, P; Hansen, S; Hauptman, J M; Hays, C; Hebert, C; Hedin, D; Heinson, A P; Heintz, U; Heuring, T C; Hirosky, R; Hobbs, J D; Hoeneisen, B; Hoftun, J S; Hou, S; Huang, Y; Illingworth, R; Ito, A S; Jaffré, M; Jerger, S A; Jesik, R; Johns, K; Johnson, M; Jonckheere, A; Jones, M; Jöstlein, H; Juste, A; Kahn, S; Kajfasz, E; Karmanov, D E; Karmgard, D J; Kim, S K; Klima, B; Klopfenstein, C; Knuteson, B; Ko, W; Kohli, J M; Kostritskii, A V; Kotcher, J; Kotwal, A V; Kozelov, A V; Kozlovskii, E A; Krane, J; Krishnaswamy, M R; Krzywdzinski, S; Kubantsev, M A; Kuleshov, S; Kulik, Y; Kunori, S; Kuznetsov, V E; Landsberg, G L; Leflat, A; Leggett, C; Lehner, F; Li, J; Li, Q Z; Lima, J G R; Lincoln, D; Linn, S L; Linnemann, J T; Lipton, R; Lucotte, A; Lueking, L H; Lundstedt, C; Luo, C; Maciel, A K A; Madaras, R J; Manankov, V; Mao, H S; Marshall, T; Martin, M I; Martin, R D; Mauritz, K M; May, B; Mayorov, A A; McCarthy, R; McDonald, J; McMahon, T; Melanson, H L; Meng, X C; Merkin, M; Merritt, K W B; Miao, C; Miettinen, H; Mihalcea, D; Mishra, C S; Mokhov, N V; Mondal, N K; Montgomery, H E; Moore, R W; Mostafa, M A; Da Motta, H; Nagy, E; Nang, F; Narain, M; Narasimham, V S; Neal, H A; Negret, J P; Negroni, S; Norman, D; Nunnemann, T; Oesch, L H; Oguri, V; Olivier, B; Oshima, N; Padley, P; Pan, L J; Papageorgiou, K; Para, A; Parashar, N; Partridge, R; Parua, N; Paterno, M; Patwa, A; Pawlik, B; Perkins, J; Peters, M; Peters, O; Petroff, P; Piegaia, R; Piekarz, H; Pope, B G; Popkov, E; Prosper, H B; Protopopescu, S D; Qian, J; Quintas, P Z; Raja, R; Rajagopalan, S; Ramberg, E; Rapidis, P A; Reay, N W; Reucroft, S; Rha, J; Ridel, M; Rijssenbeek, M; Rockwell, T; Roco, M T; Rubinov, P; Ruchti, R C; Santoro, A F S; Sawyer, L; Schamberger, R D; Schellman, H; Schwartzman, A; Sen, N; Shabalina, E; Shivpuri, R K; Shpakov, D; Shupe, M A; Sidwell, R A; Simák, V; Singh, H; Singh, J B; Sirotenko, V I; Slattery, P F; Smith, E; Smith, R P; Snihur, R; Snow, G A; Snow, J; Snyder, S; Solomon, J; Sorin, V; Sosebee, M; Sotnikova, N; Soustruznik, K; Souza, M; Stanton, N R; Steinbruck, G; Stephens, R W; Stichelbaut, F; Stoker, D; Stolin, V; Stoyanova, D A; Strauss, M; Strovink, M; Stutte, L; Sznajder, A; Taylor, W; Tentindo-Repond, S; Thompson, J; Toback, D; Tripathi, S M; Trippe, T G; Turcot, A S; Tuts, P M; Van Gemmeren, P; Vaniev, V; Van Kooten, R; Varelas, N; Volkov, A A; Vorobev, A P; Wahl, H D; Wang, H; Wang, Z M; Warchol, J; Watts, G; Wayne, M; Weerts, H; White, A; White, J T; Whiteson, D; Wightman, J A; Wijngaarden, D A; Willis, S; Wimpenny, S J; Wirjawan, J V D; Womersley, J; Wood, D R; Yamada, R; Yamin, P; Yasuda, T; Yip, K; Youssef, S; Yu, J; Yu, Z; Zanabria, M E; Zheng, H; Zhou, Z; Zielinski, M; Zieminska, D; Zieminski, A; Zutshi, V; Zverev, E G; Zylberstejn, A

    2001-01-01

    We apply a quasi-model-independent strategy ("Sleuth") to search for new high p_T physics in approximately 100 pb^-1 of ppbar collisions at sqrt(s) = 1.8 TeV collected by the DZero experiment during 1992-1996 at the Fermilab Tevatron. Over thirty-two e mu X, W+jets-like, Z+jets-like, and 3(lepton/photon)X exclusive final states are systematically analyzed for hints of physics beyond the standard model. Simultaneous sensitivity to a variety of models predicting new phenomena at the electroweak scale is demonstrated by testing the method on a particular signature in each set of final states. No evidence of new high p_T physics is observed in the course of this search, and we find that 89% of an ensemble of hypothetical similar experimental runs would have produced a final state with a candidate signal more interesting than the most interesting observed in these data.

  15. Quasi-model-independent search for new physics at large transverse momentum

    Science.gov (United States)

    Abazov, V. M.; Abbott, B.; Abdesselam, A.; Abolins, M.; Abramov, V.; Acharya, B. S.; Adams, D. L.; Adams, M.; Ahmed, S. N.; Alexeev, G. D.; Alves, G. A.; Amos, N.; Anderson, E. W.; Baarmand, M. M.; Babintsev, V. V.; Babukhadia, L.; Bacon, T. C.; Baden, A.; Baldin, B.; Balm, P. W.; Banerjee, S.; Barberis, E.; Baringer, P.; Barreto, J.; Bartlett, J. F.; Bassler, U.; Bauer, D.; Bean, A.; Begel, M.; Belyaev, A.; Beri, S. B.; Bernardi, G.; Bertram, I.; Besson, A.; Beuselinck, R.; Bezzubov, V. A.; Bhat, P. C.; Bhatnagar, V.; Bhattacharjee, M.; Blazey, G.; Blessing, S.; Boehnlein, A.; Bojko, N. I.; Borcherding, F.; Bos, K.; Brandt, A.; Breedon, R.; Briskin, G.; Brock, R.; Brooijmans, G.; Bross, A.; Buchholz, D.; Buehler, M.; Buescher, V.; Burtovoi, V. S.; Butler, J. M.; Canelli, F.; Carvalho, W.; Casey, D.; Casilum, Z.; Castilla-Valdez, H.; Chakraborty, D.; Chan, K. M.; Chekulaev, S. V.; Cho, D. K.; Choi, S.; Chopra, S.; Christenson, J. H.; Chung, M.; Claes, D.; Clark, A. R.; Cochran, J.; Coney, L.; Connolly, B.; Cooper, W. E.; Coppage, D.; Cummings, M. A.; Cutts, D.; Davis, G. A.; Davis, K.; de, K.; de Jong, S. J.; del Signore, K.; Demarteau, M.; Demina, R.; Demine, P.; Denisov, D.; Denisov, S. P.; Desai, S.; Diehl, H. T.; Diesburg, M.; di Loreto, G.; Doulas, S.; Draper, P.; Ducros, Y.; Dudko, L. V.; Duensing, S.; Duflot, L.; Dugad, S. R.; Dyshkant, A.; Edmunds, D.; Ellison, J.; Elvira, V. D.; Engelmann, R.; Eno, S.; Eppley, G.; Ermolov, P.; Eroshin, O. V.; Estrada, J.; Evans, H.; Evdokimov, V. N.; Fahland, T.; Feher, S.; Fein, D.; Ferbel, T.; Filthaut, F.; Fisk, H. E.; Fisyak, Y.; Flattum, E.; Fleuret, F.; Fortner, M.; Frame, K. C.; Fuess, S.; Gallas, E.; Galyaev, A. N.; Gao, M.; Gavrilov, V.; Genik, R. J.; Genser, K.; Gerber, C. E.; Gershtein, Y.; Gilmartin, R.; Ginther, G.; Gómez, B.; Gómez, G.; Goncharov, P. I.; Solís, J. L.; Gordon, H.; Goss, L. T.; Gounder, K.; Goussiou, A.; Graf, N.; Graham, G.; Grannis, P. D.; Green, J. A.; Greenlee, H.; Grinstein, S.; Groer, L.; Grünendahl, S.; Gupta, A.; Gurzhiev, S. N.; Gutierrez, G.; Gutierrez, P.; Hadley, N. J.; Haggerty, H.; Hagopian, S.; Hagopian, V.; Hall, R. E.; Hanlet, P.; Hansen, S.; Hauptman, J. M.; Hays, C.; Hebert, C.; Hedin, D.; Heinson, A. P.; Heintz, U.; Heuring, T.; Hildreth, M. D.; Hirosky, R.; Hobbs, J. D.; Hoeneisen, B.; Huang, Y.; Illingworth, R.; Ito, A. S.; Jaffré, M.; Jain, S.; Jesik, R.; Johns, K.; Johnson, M.; Jonckheere, A.; Jones, M.; Jöstlein, H.; Juste, A.; Kahn, S.; Kajfasz, E.; Kalinin, A. M.; Karmanov, D.; Karmgard, D.; Kehoe, R.; Kharchilava, A.; Kim, S. K.; Klima, B.; Knuteson, B.; Ko, W.; Kohli, J. M.; Kostritskiy, A. V.; Kotcher, J.; Kotwal, A. V.; Kozelov, A. V.; Kozlovsky, E. A.; Krane, J.; Krishnaswamy, M. R.; Krivkova, P.; Krzywdzinski, S.; Kubantsev, M.; Kuleshov, S.; Kulik, Y.; Kunori, S.; Kupco, A.; Kuznetsov, V. E.; Landsberg, G.; Leflat, A.; Leggett, C.; Lehner, F.; Li, J.; Li, Q. Z.; Lima, J. G.; Lincoln, D.; Linn, S. L.; Linnemann, J.; Lipton, R.; Lucotte, A.; Lueking, L.; Lundstedt, C.; Luo, C.; Maciel, A. K.; Madaras, R. J.; Malyshev, V. L.; Manankov, V.; Mao, H. S.; Marshall, T.; Martin, M. I.; Martin, R. D.; Mauritz, K. M.; May, B.; Mayorov, A. A.; McCarthy, R.; McDonald, J.; McMahon, T.; Melanson, H. L.; Merkin, M.; Merritt, K. W.; Miao, C.; Miettinen, H.; Mihalcea, D.; Mishra, C. S.; Mokhov, N.; Mondal, N. K.; Montgomery, H. E.; Moore, R. W.; Mostafa, M.; da Motta, H.; Nagy, E.; Nang, F.; Narain, M.; Narasimham, V. S.; Neal, H. A.; Negret, J. P.; Negroni, S.; Nunnemann, T.; O'neil, D.; Oguri, V.; Olivier, B.; Oshima, N.; Padley, P.; Pan, L. J.; Papageorgiou, K.; Para, A.; Parashar, N.; Partridge, R.; Parua, N.; Paterno, M.; Patwa, A.; Pawlik, B.; Perkins, J.; Peters, M.; Peters, O.; Pétroff, P.; Piegaia, R.; Piekarz, H.; Pope, B. G.; Popkov, E.; Prosper, H. B.; Protopopescu, S.; Qian, J.; Raja, R.; Rajagopalan, S.; Ramberg, E.; Rapidis, P. A.; Reay, N. W.; Reucroft, S.; Rha, J.; Ridel, M.; Rijssenbeek, M.; Rockwell, T.; Roco, M.; Rubinov, P.; Ruchti, R.; Rutherfoord, J.; Sabirov, B. M.; Santoro, A.; Sawyer, L.; Schamberger, R. D.; Schellman, H.; Schwartzman, A.; Sen, N.; Shabalina, E.; Shivpuri, R. K.; Shpakov, D.; Shupe, M.; Sidwell, R. A.; Simak, V.; Singh, H.; Singh, J. B.; Sirotenko, V.; Slattery, P.; Smith, E.; Smith, R. P.; Snihur, R.; Snow, G. R.; Snow, J.; Snyder, S.; Solomon, J.; Sorín, V.; Sosebee, M.; Sotnikova, N.; Soustruznik, K.; Souza, M.; Stanton, N. R.; Steinbrück, G.; Stephens, R. W.; Stichelbaut, F.; Stoker, D.; Stolin, V.; Stoyanova, D. A.; Strauss, M.; Strovink, M.; Stutte, L.; Sznajder, A.; Taylor, W.; Tentindo-Repond, S.; Toback, D.; Tripathi, S.; Trippe, T. G.; Turcot, A. S.; Tuts, P. M.; van Gemmeren, P.; Vaniev, V.; van Kooten, R.; Varelas, N.; Vertogradov, L. S.; Volkov, A. A.; Vorobiev, A. P.; Wahl, H. D.; Wang, H.; Wang, Z.-M.; Warchol, J.; Watts, G.; Wayne, M.; Weerts, H.; White, A.; White, J. T.; Whiteson, D.; Wightman, J. A.; Wijngaarden, D. A.; Willis, S.; Wimpenny, S. J.; Womersley, J.; Wood, D. R.; Yamada, R.; Yamin, P.; Yasuda, T.; Yatsunenko, Y. A.; Yip, K.; Youssef, S.; Yu, J.; Yu, Z.; Zanabria, M.; Zheng, H.; Zhou, Z.; Zielinski, M.; Zieminska, D.; Zieminski, A.; Zutshi, V.; Zverev, E. G.; Zylberstejn, A.

    2001-07-01

    We apply a quasi-model-independent strategy (``SLEUTH'') to search for new high pT physics in ~100 pb-1 of pp¯ collisions at s=1.8 TeV collected by the DØ experiment during 1992-1996 at the Fermilab Tevatron. Over 32 eμX, W+jets-like, Z+jets-like, and (l/γ)(l/γ)(l/γ)X exclusive final states are systematically analyzed for hints of physics beyond the standard model. Simultaneous sensitivity to a variety of models predicting new phenomena at the electroweak scale is demonstrated by testing the method on a particular signature in each set of final states. No evidence of new high pT physics is observed in the course of this search, and we find that 89% of an ensemble of hypothetical similar experimental runs would have produced a final state with a candidate signal more interesting than the most interesting observed in these data.

  16. 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.

  17. 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.

  18. Search for a Standard Model Higgs boson in the $H \\to ZZ \\to l^{+}l^{-}\

    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

    2011-01-01

    A search for a heavy Standard Model Higgs boson decaying via H->ZZ->llnunu, where l=e,mu, is presented. It is based on proton-proton collision data at sqrt(s)=7 TeV, collected by the ATLAS experiment at the LHC in the first half of 2011 and corresponding to an integrated luminosity of 1.04 fb^-1. The data are compared to the expected Standard Model backgrounds. The data and the combined background expectations are found to be in agreement and upper limits are placed on the Higgs boson production cross section over the entire mass window considered; in particular the production of a Standard Model Higgs boson is excluded in the region 340 < m_H < 450 GeV at the 95% confidence level.

  19. Model unspecific search for new physics in collision at $\\sqrt{s} = 7$ TeV

    Indian Academy of Sciences (India)

    Shivali Malhotra; Md Naimuddin; Thomas Hebbeker; Arnd Meyer; Holger Pieta; Paul Papacz; Stefan Antonius Schmitz; Mark Olschewski

    2012-11-01

    We present the results of a model-independent analysis, which systematically scans the data taken by CMS for deviations from the Standard Model (SM) predictions. Due to the minimal theoretical bias, this approach is sensitive to a variety of models for new physics. 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). 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 pb-1.

  20. Collide and Conquer: Constraints on Simplified Dark Matter Models using Mono-X Collider Searches

    CERN Document Server

    Brennan, A J; Gramling, J; Jacques, T D

    2016-01-01

    The use of simplified models as a tool for interpreting dark matter collider searches has become increasingly prevalent, and while early Run II results are beginning to appear, we look to see what further information can be extracted from the Run I dataset. We consider three `standard' simplified models that couple quarks to fermionic singlet dark matter: an $s$-channel vector mediator with vector or axial-vector couplings, and a $t$-channel scalar mediator. Upper limits on the couplings are calculated and compared across three alternate channels, namely mono-jet, mono-$Z$ (leptonic) and mono-$W/Z$ (hadronic). The strongest limits are observed in the mono-jet channel, however the computational simplicity and absence of significant $t$-channel model width effects in the mono-boson channels make these a straightforward and competitive alternative. We also include a comparison with relic density and direct detection constraints.

  1. A Markov Chain Model for Changes in Users’ Assessment of Search Results

    Science.gov (United States)

    Zhitomirsky-Geffet, Maayan; Bar-Ilan, Judit; Levene, Mark

    2016-01-01

    Previous research shows that users tend to change their assessment of search results over time. This is a first study that investigates the factors and reasons for these changes, and describes a stochastic model of user behaviour that may explain these changes. In particular, we hypothesise that most of the changes are local, i.e. between results with similar or close relevance to the query, and thus belong to the same”coarse” relevance category. According to the theory of coarse beliefs and categorical thinking, humans tend to divide the range of values under consideration into coarse categories, and are thus able to distinguish only between cross-category values but not within them. To test this hypothesis we conducted five experiments with about 120 subjects divided into 3 groups. Each student in every group was asked to rank and assign relevance scores to the same set of search results over two or three rounds, with a period of three to nine weeks between each round. The subjects of the last three-round experiment were then exposed to the differences in their judgements and were asked to explain them. We make use of a Markov chain model to measure change in users’ judgments between the different rounds. The Markov chain demonstrates that the changes converge, and that a majority of the changes are local to a neighbouring relevance category. We found that most of the subjects were satisfied with their changes, and did not perceive them as mistakes but rather as a legitimate phenomenon, since they believe that time has influenced their relevance assessment. Both our quantitative analysis and user comments support the hypothesis of the existence of coarse relevance categories resulting from categorical thinking in the context of user evaluation of search results. PMID:27171426

  2. A Markov Chain Model for Changes in Users' Assessment of Search Results.

    Directory of Open Access Journals (Sweden)

    Maayan Zhitomirsky-Geffet

    Full Text Available Previous research shows that users tend to change their assessment of search results over time. This is a first study that investigates the factors and reasons for these changes, and describes a stochastic model of user behaviour that may explain these changes. In particular, we hypothesise that most of the changes are local, i.e. between results with similar or close relevance to the query, and thus belong to the same"coarse" relevance category. According to the theory of coarse beliefs and categorical thinking, humans tend to divide the range of values under consideration into coarse categories, and are thus able to distinguish only between cross-category values but not within them. To test this hypothesis we conducted five experiments with about 120 subjects divided into 3 groups. Each student in every group was asked to rank and assign relevance scores to the same set of search results over two or three rounds, with a period of three to nine weeks between each round. The subjects of the last three-round experiment were then exposed to the differences in their judgements and were asked to explain them. We make use of a Markov chain model to measure change in users' judgments between the different rounds. The Markov chain demonstrates that the changes converge, and that a majority of the changes are local to a neighbouring relevance category. We found that most of the subjects were satisfied with their changes, and did not perceive them as mistakes but rather as a legitimate phenomenon, since they believe that time has influenced their relevance assessment. Both our quantitative analysis and user comments support the hypothesis of the existence of coarse relevance categories resulting from categorical thinking in the context of user evaluation of search results.

  3. A Markov Chain Model for Changes in Users' Assessment of Search Results.

    Science.gov (United States)

    Zhitomirsky-Geffet, Maayan; Bar-Ilan, Judit; Levene, Mark

    2016-01-01

    Previous research shows that users tend to change their assessment of search results over time. This is a first study that investigates the factors and reasons for these changes, and describes a stochastic model of user behaviour that may explain these changes. In particular, we hypothesise that most of the changes are local, i.e. between results with similar or close relevance to the query, and thus belong to the same"coarse" relevance category. According to the theory of coarse beliefs and categorical thinking, humans tend to divide the range of values under consideration into coarse categories, and are thus able to distinguish only between cross-category values but not within them. To test this hypothesis we conducted five experiments with about 120 subjects divided into 3 groups. Each student in every group was asked to rank and assign relevance scores to the same set of search results over two or three rounds, with a period of three to nine weeks between each round. The subjects of the last three-round experiment were then exposed to the differences in their judgements and were asked to explain them. We make use of a Markov chain model to measure change in users' judgments between the different rounds. The Markov chain demonstrates that the changes converge, and that a majority of the changes are local to a neighbouring relevance category. We found that most of the subjects were satisfied with their changes, and did not perceive them as mistakes but rather as a legitimate phenomenon, since they believe that time has influenced their relevance assessment. Both our quantitative analysis and user comments support the hypothesis of the existence of coarse relevance categories resulting from categorical thinking in the context of user evaluation of search results.

  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. Robust Modeling of Low-Cost MEMS Sensor Errors in Mobile Devices Using Fast Orthogonal Search

    Directory of Open Access Journals (Sweden)

    M. Tamazin

    2013-01-01

    Full Text Available Accessibility to inertial navigation systems (INS has been severely limited by cost in the past. The introduction of low-cost microelectromechanical system-based INS to be integrated with GPS in order to provide a reliable positioning solution has provided more wide spread use in mobile devices. The random errors of the MEMS inertial sensors may deteriorate the overall system accuracy in mobile devices. These errors are modeled stochastically and are included in the error model of the estimated techniques used such as Kalman filter or Particle filter. First-order Gauss-Markov model is usually used to describe the stochastic nature of these errors. However, if the autocorrelation sequences of these random components are examined, it can be determined that first-order Gauss-Markov model is not adequate to describe such stochastic behavior. A robust modeling technique based on fast orthogonal search is introduced to remove MEMS-based inertial sensor errors inside mobile devices that are used for several location-based services. The proposed method is applied to MEMS-based gyroscopes and accelerometers. Results show that the proposed method models low-cost MEMS sensors errors with no need for denoising techniques and using smaller model order and less computation, outperforming traditional methods by two orders of magnitude.

  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. Solving a novel multi-skilled project scheduling model by scatter search

    Directory of Open Access Journals (Sweden)

    Kazemipoor, H.

    2013-05-01

    Full Text Available A multi-skilled project scheduling problem (MSPSP has generally been presented to schedule information technology projects in deterministic conditions. The contribution of this model is to consider the resources, called staff members. These members are regarded as valuable, renewable, and discrete resources with different multiple skills. The different skills of staff members, as well as the project networks activity requirement of different skills, cause this problem to become a special type of multi-mode resource-constrained project scheduling problem (MM-RCPSP, with a huge number of modes. Taking into account the importance of this issue and the few studies performed on this problem, a novel mathematical model for the MSPSP is presented. Since the complexity of this problem is NP-hard, an efficient scatter search (SS algorithm is developed to solve such a difficult problem. This proposed SS is capable of generating optimised solutions in small sizes, and the excellent solutions in large sizes are compared with the solutions reported by a proposed Tabu search (TS algorithm.

  8. Search for standard model Higgs boson production in association with a W boson at CDF

    Science.gov (United States)

    Aaltonen, T.; Adelman, J.; Akimoto, T.; Albrow, M. G.; Álvarez 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.; 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.; 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.; 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, J.; Lee, Y. J.; Lee, S. W.; Leone, S.; Levy, 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.; 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., III; 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, 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.

    2008-08-01

    We present a search for standard model Higgs boson production in association with a W boson in proton-antiproton collisions (p pmacr →W±H→ℓνb bmacr ) at a center of mass energy of 1.96 TeV. The search employs data collected with the CDF II detector which correspond to an integrated luminosity of approximately 1fb-1. We select events consistent with a signature of a single lepton (e±/μ±), missing transverse energy, and two jets. Jets corresponding to bottom quarks are identified with a secondary vertex tagging method and a neural network filter technique. The observed number of events and the dijet mass distributions are consistent with the standard model background expectations, and we set 95% confidence level upper limits on the production cross section times branching ratio ranging from 3.9 to 1.3 pb for Higgs boson masses from 110 to 150GeV/c2, respectively.

  9. Search for New Physics in $e\\muX$ Data at D0 Using Sherlock A Quasi-Model-Independent Search Strategy for New Physics

    CERN Document Server

    Abbott, B; Abramov, V; Acharya, B S; Adams, D L; Adams, M; Alves, G A; Amos, N; Anderson, E W; Baarmand, M M; Babintsev, V V; Babukhadia, L R; Baden, A; Baldin, B Yu; Banerjee, S; Bantly, J; Barberis, E; Baringer, P; Bartlett, J F; Bassler, U; Bean, A; Begel, M; Belyaev, A; Beri, S B; Bernardi, G; Bertram, I; Besson, A; Bezzubov, V A; Bhat, P C; Bhatnagar, V; Bhattacharjee, M; Blazey, G C; Blessing, S; Böhnlein, A; Bozhko, N; Borcherding, F; Brandt, A; Breedon, R; Briskin, G M; Brock, R; Brooijmans, G; Bross, A; Buchholz, D; Bühler, M; Büscher, V; Burtovoi, V S; Butler, J M; Canelli, F; Carvalho, W S; Casey, D; Casilum, Z; Castilla-Valdez, H; Chakraborty, D; Chan, K M; Chekulaev, S V; Cho, D K; Choi, S; Chopra, S; Choudhary, B C; Christenson, J H; Chung, M; Claes, D; Clark, A R; Cochran, J; Coney, L; Connolly, B; Cooper, W E; Coppage, D; Cummings, M A C; Cutts, D; Dahl, O I; Davis, G A; Davis, K; De, K; Del Signore, K; Demarteau, M; Demina, R; Demine, P; Denisov, D S; Denisov, S P; Diehl, H T; Diesburg, M; DiLoreto, G; Doulas, S; Draper, P; Ducros, Y; Dudko, L V; Dugad, S R; Dyshkant, A; Edmunds, D; Ellison, J; Elvira, V D; Engelmann, R; Eno, S; Eppley, G; Ermolov, P; Eroshin, O V; Estrada, J K; Evans, H; Evdokimov, V N; Fahland, T; Fehér, S; Fein, D; Ferbel, T; Filthaut, Frank; Fisk, H E; Fisyak, Yu; Flattum, E M; Fleuret, F; Fortner, M R; Frame, K C; Fuess, S; Gallas, E J; Galjaev, A N; Gartung, P E; Gavrilov, V; Genik, R J; Genser, K; Gerber, C E; Gershtein, Yu; Gibbard, B; Gilmartin, R; Ginther, G; Gómez, B; Gómez, G; Goncharov, P I; González-Solis, J L; Gordon, H; Goss, L T; Gounder, K; Goussiou, A; Graf, N; Grannis, P D; Green, J A; Greenlee, H; Grinstein, S; Grudberg, P M; Grünendahl, S; Sen-Gupta, A; Gurzhev, S N; Gutíerrez, G; Gutíerrez, P; Hadley, N J; Haggerty, H; Hagopian, S L; Hagopian, V; Hahn, K S; Hall, R E; Hanlet, P; Hansen, S; Hauptman, J M; Hays, C; Hebert, C; Hedin, D; Heinson, A P; Heintz, U; Heuring, T C; Hirosky, R; Hobbs, J D; Hoeneisen, B; Hoftun, J S; Ito, A S; Jerger, S A; Jesik, R; Johns, K; Johnson, M; Jonckheere, A M; Jones, M; Jöstlein, H; Juste, A; Kahn, S; Kajfasz, E; Karmanov, D E; Karmgard, D J; Kehoe, R; Kim, S K; Klima, B; Klopfenstein, C; Knuteson, B; Ko, W; Kohli, J M; Kostritskii, A V; Kotcher, J; Kotwal, A V; Kozelov, A V; Kozlovskii, E A; Krane, J; Krishnaswamy, M R; Krzywdzinski, S; Kubantsev, M A; Kuleshov, S; Kulik, Y; Kunori, S; Kuznetsov, V; Landsberg, G L; Leflat, A; Lehner, F; Li, J; Li, Q Z; Lima, J G R; Lincoln, D; Linn, S L; Linnemann, J T; Lipton, R; Lucotte, A; Lueking, L H; Lundstedt, C; Maciel, A K A; Madaras, R J; Manankov, V; Mani, S; Mao, H S; Marshall, T; Martin, M I; Martin, R D; Mauritz, K M; May, B; Mayorov, A A; McCarthy, R; McDonald, J; McMahon, T; Melanson, H L; Meng, X C; Merkin, M; Merritt, K W B; Miao, C; Miettinen, H; Mihalcea, D; Mincer, A; Mishra, C S; Mokhov, N V; Mondal, N K; Montgomery, H E; Mostafa, M A; Da Motta, H; Nagy, E; Nang, F; Narain, M; Narasimham, V S; Neal, H A; Negret, J P; Negroni, S; Norman, D; Oesch, L H; Oguri, V; Olivier, B; Oshima, N; Padley, P; Pan, L J; Para, A; Parashar, N; Partridge, R; Parua, N; Paterno, M; Patwa, A; Pawlik, B; Perkins, J; Peters, M; Piegaia, R; Piekarz, H; Pope, B G; Popkov, E; Prosper, H B; Protopopescu, S D; Qian, J; Quintas, P Z; Raja, R; Rajagopalan, S; Ramberg, E; Reay, N W; Reucroft, S; Rha, J; Rijssenbeek, M; Rockwell, T; Roco, M T; Rubinov, P M; Ruchti, R C; Rutherfoord, John P; Santoro, A F S; Sawyer, L; Schamberger, R D; Schellman, H; Schwartzman, A; Scully, J R; Sen, N; Shabalina, E; Shankar, H C; Shivpuri, R K; Shpakov, D; Shupe, M A; Sidwell, R A; Simák, V; Singh, H; Singh, J B; Sirotenko, V I; Slattery, P F; Smith, E; Smith, R P; Snihur, R; Snow, G A; Snow, J; Snyder, S; Solomon, J; Sorin, V; Sosebee, M; Sotnikova, N; Soustruznik, K; Souza, M; Stanton, N R; Steinbruck, G; Stephens, R W; Stevenson, M L; Stichelbaut, F; Stoker, D; Stolin, V; Stoyanova, D A; Strauss, M; Streets, K; Strovink, M; Stutte, L; Sznajder, A; Taylor, W; Tentindo-Repond, S; Thompson, J; Toback, D; Trippe, T G; Turcot, A S; Tuts, P M; Van Gemmeren, P; Vaniev, V; Van Kooten, R; Varelas, N; Volkov, A A; Vorobev, A P; Wahl, H D; Wang, H; Wang, Z M; Warchol, J; Watts, G; Wayne, M; Weerts, H; White, A; White, J T; Whiteson, D; Wightman, J A; Willis, S; Wimpenny, S J; Wirjawan, J V D; Womersley, J; Wood, D R; Yamada, R; Yamin, P; Yasuda, T; Yip, K; Youssef, S; Yu, J; Yu, Z; Zanabria, M E; Zheng, H; Zhou, Z; Zhu, Z H; Zielinski, M; Zieminska, D; Zieminski, A; Zutshi, V; Zverev, E G; Zylberstejn, A

    2000-01-01

    We present a quasi-model-independent search for the physics responsible for electroweak symmetry breaking. We define final states to be studied, and construct a rule that identifies a set of relevant variables for any particular final state. A new algorithm ("Sherlock") searches for regions of excess in those variables and quantifies the significance of any detected excess. After demonstrating the sensitivity of the method, we apply it to the semi-inclusive channel e mu X collected in 108 pb^-1 of ppbar collisions at sqrt(s) = 1.8 TeV at the D0 experiment during 1992-1996 at the Fermilab Tevatron. We find no evidence of new high p_T physics in this sample.

  10. Search for new physics in eμX data at DØ using SLEUTH: A quasi-model-independent search strategy for new physics

    Science.gov (United States)

    Abbott, B.; Abolins, M.; Abramov, V.; Acharya, B. S.; Adams, D. L.; Adams, M.; Alves, G. A.; Amos, N.; Anderson, E. W.; Baarmand, M. M.; Babintsev, V. V.; Babukhadia, L.; Baden, A.; Baldin, B.; Banerjee, S.; Bantly, J.; Barberis, E.; Baringer, P.; Bartlett, J. F.; Bassler, U.; Bean, A.; Begel, M.; Belyaev, A.; Beri, S. B.; Bernardi, G.; Bertram, I.; Besson, A.; Bezzubov, V. A.; Bhat, P. C.; Bhatnagar, V.; Bhattacharjee, M.; Blazey, G.; Blessing, S.; Boehnlein, A.; Bojko, N. I.; Borcherding, F.; Brandt, A.; Breedon, R.; Briskin, G.; Brock, R.; Brooijmans, G.; Bross, A.; Buchholz, D.; Buehler, M.; Buescher, V.; Burtovoi, V. S.; Butler, J. M.; Canelli, F.; Carvalho, W.; Casey, D.; Casilum, Z.; Castilla-Valdez, H.; Chakraborty, D.; Chan, K. M.; Chekulaev, S. V.; Cho, D. K.; Choi, S.; Chopra, S.; Choudhary, B. C.; Christenson, J. H.; Chung, M.; Claes, D.; Clark, A. R.; Cochran, J.; Coney, L.; Connolly, B.; Cooper, W. E.; Coppage, D.; Cummings, M. A.; Cutts, D.; Dahl, O. I.; Davis, G. A.; Davis, K.; de, K.; del Signore, K.; Demarteau, M.; Demina, R.; Demine, P.; Denisov, D.; Denisov, S. P.; Diehl, H. T.; Diesburg, M.; di Loreto, G.; Doulas, S.; Draper, P.; Ducros, Y.; Dudko, L. V.; Dugad, S. R.; Dyshkant, A.; Edmunds, D.; Ellison, J.; Elvira, V. D.; Engelmann, R.; Eno, S.; Eppley, G.; Ermolov, P.; Eroshin, O. V.; Estrada, J.; Evans, H.; Evdokimov, V. N.; Fahland, T.; Feher, S.; Fein, D.; Ferbel, T.; Filthaut, F.; Fisk, H. E.; Fisyak, Y.; Flattum, E.; Fleuret, F.; Fortner, M.; Frame, K. C.; Fuess, S.; Gallas, E.; Galyaev, A. N.; Gartung, P.; Gavrilov, V.; Genik, R. J.; Genser, K.; Gerber, C. E.; Gershtein, Y.; Gibbard, B.; Gilmartin, R.; Ginther, G.; Gómez, B.; Gómez, G.; Goncharov, P. I.; González Solís, J. L.; Gordon, H.; Goss, L. T.; Gounder, K.; Goussiou, A.; Graf, N.; Grannis, P. D.; Green, J. A.; Greenlee, H.; Grinstein, S.; Grudberg, P.; Grünendahl, S.; Gupta, A.; Gurzhiev, S. N.; Gutierrez, G.; Gutierrez, P.; Hadley, N. J.; Haggerty, H.; Hagopian, S.; Hagopian, V.; Hahn, K. S.; Hall, R. E.; Hanlet, P.; Hansen, S.; Hauptman, J. M.; Hays, C.; Hebert, C.; Hedin, D.; Heinson, A. P.; Heintz, U.; Heuring, T.; Hirosky, R.; Hobbs, J. D.; Hoeneisen, B.; Hoftun, J. S.; Ito, A. S.; Jerger, S. A.; Jesik, R.; Johns, K.; Johnson, M.; Jonckheere, A.; Jones, M.; Jöstlein, H.; Juste, A.; Kahn, S.; Kajfasz, E.; Karmanov, D.; Karmgard, D.; Kehoe, R.; Kim, S. K.; Klima, B.; Klopfenstein, C.; Knuteson, B.; Ko, W.; Kohli, J. M.; Kostritskiy, A. V.; Kotcher, J.; Kotwal, A. V.; Kozelov, A. V.; Kozlovsky, E. A.; Krane, J.; Krishnaswamy, M. R.; Krzywdzinski, S.; Kubantsev, M.; Kuleshov, S.; Kulik, Y.; Kunori, S.; Kuznetsov, V.; Landsberg, G.; Leflat, A.; Lehner, F.; Li, J.; Li, Q. Z.; Lima, J. G.; Lincoln, D.; Linn, S. L.; Linnemann, J.; Lipton, R.; Lucotte, A.; Lueking, L.; Lundstedt, C.; Maciel, A. K.; Madaras, R. J.; Manankov, V.; Mani, S.; Mao, H. S.; Marshall, T.; Martin, M. I.; Martin, R. D.; Mauritz, K. M.; May, B.; Mayorov, A. A.; McCarthy, R.; McDonald, J.; McMahon, T.; Melanson, H. L.; Meng, X. C.; Merkin, M.; Merritt, K. W.; Miao, C.; Miettinen, H.; Mihalcea, D.; Mincer, A.; Mishra, C. S.; Mokhov, N.; Mondal, N. K.; Montgomery, H. E.; Mostafa, M.; da Motta, H.; Nagy, E.; Nang, F.; Narain, M.; Narasimham, V. S.; Neal, H. A.; Negret, J. P.; Negroni, S.; Norman, D.; Oesch, L.; Oguri, V.; Olivier, B.; Oshima, N.; Padley, P.; Pan, L. J.; Para, A.; Parashar, N.; Partridge, R.; Parua, N.; Paterno, M.; Patwa, A.; Pawlik, B.; Perkins, J.; Peters, M.; Piegaia, R.; Piekarz, H.; Pope, B. G.; Popkov, E.; Prosper, H. B.; Protopopescu, S.; Qian, J.; Quintas, P. Z.; Raja, R.; Rajagopalan, S.; Ramberg, E.; Reay, N. W.; Reucroft, S.; Rha, J.; Rijssenbeek, M.; Rockwell, T.; Roco, M.; Rubinov, P.; Ruchti, R.; Rutherfoord, J.; Santoro, A.; Sawyer, L.; Schamberger, R. D.; Schellman, H.; Schwartzman, A.; Sculli, J.; Sen, N.; Shabalina, E.; Shankar, H. C.; Shivpuri, R. K.; Shpakov, D.; Shupe, M.; Sidwell, R. A.; Simak, V.; Singh, H.; Singh, J. B.; Sirotenko, V.; Slattery, P.; Smith, E.; Smith, R. P.; Snihur, R.; Snow, G. R.; Snow, J.; Snyder, S.; Solomon, J.; Sorín, V.; Sosebee, M.; Sotnikova, N.; Soustruznik, K.; Souza, M.; Stanton, N. R.; Steinbrück, G.; Stephens, R. W.; Stevenson, M. L.; Stichelbaut, F.; Stoker, D.; Stolin, V.; Stoyanova, D. A.; Strauss, M.; Streets, K.; Strovink, M.; Stutte, L.; Sznajder, A.; Taylor, W.; Tentindo-Repond, S.; Thompson, J.; Toback, D.; Trippe, T. G.; Turcot, A. S.; Tuts, P. M.; van Gemmeren, P.; Vaniev, V.; van Kooten, R.; Varelas, N.; Volkov, A. A.; Vorobiev, A. P.; Wahl, H. D.; Wang, H.; Wang, Z.-M.; Warchol, J.; Watts, G.; Wayne, M.; Weerts, H.; White, A.; White, J. T.; Whiteson, D.; Wightman, J. A.; Willis, S.; Wimpenny, S. J.; Wirjawan, J. V.; Womersley, J.; Wood, D. R.; Yamada, R.; Yamin, P.; Yasuda, T.; Yip, K.; Youssef, S.; Yu, J.; Yu, Z.; Zanabria, M.; Zheng, H.; Zhou, Z.; Zhu, Z. H.; Zielinski, M.; Zieminska, D.; Zieminski, A.; Zutshi, V.; Zverev, E. G.; Zylberstejn, A.

    2000-11-01

    We present a quasi-model-independent search for the physics responsible for electroweak symmetry breaking. We define final states to be studied, and construct a rule that identifies a set of relevant variables for any particular final state. A new algorithm (``SLEUTH'') searches for regions of excess in those variables and quantifies the significance of any detected excess. After demonstrating the sensitivity of the method, we apply it to the semi-inclusive channel eμX collected in 108 pb-1 of pp¯ collisions at s=1.8 TeV at the DØ experiment during 1992-1996 at the Fermilab Tevatron. We find no evidence of new high pT physics in this sample.

  11. Pre-trip tourism information search by smartphones and use of alternative information channels: A conceptual model

    Directory of Open Access Journals (Sweden)

    Chaang-Iuan Ho

    2016-12-01

    Full Text Available This study developed a comprehensive model of how smartphone users search for pre-trip tourism information. Important dimensions and relationships in tourism information search (TIS behavior were studied in 21 subjects. The data collection process included semi-structured in-depth interviewing data and field observation data. The analysis revealed 10 activities characteristic of TIS behavior: internal searches, mobile searches, saving information in the smartphones, preliminary collaborative TIS, barriers to TIS, bringing mobile search to an end, summarizing information, PC Internet search, advanced collaborative TIS, and searches via editorial communications. Such data collection was not performed in isolation. Further, 20 propositions have been developed for future testing. The results suggest that pre-trip TIS appears to consist in a diversity of search patterns with the usage of multiple information sources; in addition, it is no longer individual but collaborative behavior in the context of Web 2.0. Finally, the theoretical and practical implications of the research work are discussed, and directions for future work are suggested.

  12. A Model of the Superior Colliculus Predicts Fixation Locations during Scene Viewing and Visual Search.

    Science.gov (United States)

    Adeli, Hossein; Vitu, Françoise; Zelinsky, Gregory J

    2017-02-08

    Modern computational models of attention predict fixations using saliency maps and target maps, which prioritize locations for fixation based on feature contrast and target goals, respectively. But whereas many such models are biologically plausible, none have looked to the oculomotor system for design constraints or parameter specification. Conversely, although most models of saccade programming are tightly coupled to underlying neurophysiology, none have been tested using real-world stimuli and tasks. We combined the strengths of these two approaches in MASC, a model of attention in the superior colliculus (SC) that captures known neurophysiological constraints on saccade programming. We show that MASC predicted the fixation locations of humans freely viewing naturalistic scenes and performing exemplar and categorical search tasks, a breadth achieved by no other existing model. Moreover, it did this as well or better than its more specialized state-of-the-art competitors. MASC's predictive success stems from its inclusion of high-level but core principles of SC organization: an over-representation of foveal information, size-invariant population codes, cascaded population averaging over distorted visual and motor maps, and competition between motor point images for saccade programming, all of which cause further modulation of priority (attention) after projection of saliency and target maps to the SC. Only by incorporating these organizing brain principles into our models can we fully understand the transformation of complex visual information into the saccade programs underlying movements of overt attention. With MASC, a theoretical footing now exists to generate and test computationally explicit predictions of behavioral and neural responses in visually complex real-world contexts.SIGNIFICANCE STATEMENT The superior colliculus (SC) performs a visual-to-motor transformation vital to overt attention, but existing SC models cannot predict saccades to visually

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

    Energy Technology Data Exchange (ETDEWEB)

    Vrba, J [VSM MedTech Ltd, Coquitlam, BC, V3K 7B2 (Canada); Robinson, S E [VSM MedTech Ltd, Coquitlam, BC, V3K 7B2 (Canada); McCubbin, J [Department of Obstetrics and Gynecology, University of Arkansas for Medical Sciences, Little Rock, AR 72205 (United States); Lowery, C L [Department of Obstetrics and Gynecology, University of Arkansas for Medical Sciences, Little Rock, AR 72205 (United States); Eswaran, H [Department of Obstetrics and Gynecology, University of Arkansas for Medical Sciences, Little Rock, AR 72205 (United States); Murphy, P [Department of Obstetrics and Gynecology, University of Arkansas for Medical Sciences, Little Rock, AR 72205 (United States); Preissl, H [Department of Obstetrics and Gynecology, University of Arkansas for Medical Sciences, Little Rock, AR 72205 (United States)

    2007-02-07

    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.

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

    Energy Technology Data Exchange (ETDEWEB)

    Abazov, Victor Mukhamedovich; et al.

    2012-08-01

    We present a search for the standard model Higgs boson in final states with an electron or muon and a hadronically decaying tau lepton in association with zero, one, or two or more jets using data corresponding to an integrated luminosity of up to 7.3 fb{sup -1} collected with the D0 detector at the Fermilab Tevatron collider. The analysis is sensitive to Higgs boson production via gluon gluon fusion, associated vector boson production, and vector boson fusion, and to Higgs boson decays to tau lepton pairs or W boson pairs. Observed (expected) limits are set on the ratio of 95% C.L. upper limits on the cross section times branching ratio, relative to those predicted by the Standard Model, of 14 (22) at a Higgs boson mass of 115 GeV and 7.7 (6.8) at 165 GeV.

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

    Energy Technology Data Exchange (ETDEWEB)

    South, David M. [Deutsches Elektronen Synchrotron, Hamburg (Germany); Turcato, Monica [Hamburg University, Institute of Experimental Physics, Hamburg (Germany); European X-ray Free-Electron Laser Facility GmbH, Hamburg (Germany)

    2016-06-15

    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{sup 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{sup -1}, representing the complete data set recorded by the H1 and ZEUS experiments. (orig.)

  16. Interpretation of Vector-like Quark Searches: Heavy Gluons in Composite Higgs Models

    CERN Document Server

    Araque, Juan Pedro; Santiago, Jose

    2015-01-01

    Pair production of new vector-like quarks in pp collisions is considered model independent as it is usually dominated by QCD production. We discuss the interpretation of vector-like quark searches in the case that QCD is not the only relevant production mechanism for the new quarks. In particular we consider the effect of a new massive color octet vector boson with sizeable decay branching ratio into the new quarks. We pay special attention to the sensitivity of the Large Hadron Collider experiments, both in run-1 and early run-2, to differences in the kinematical distributions from the different production mechanisms. We have found that even though there can be significant differences in some kinematical distributions at the parton level, the differences are washed out at the reconstruction level. Thus, the published experimental results can be reinterpreted in models with heavy gluons by simply rescaling the production cross section.

  17. Search for the Standard Model Higgs Boson in $H \\to WW \\to \\ell \

    Energy Technology Data Exchange (ETDEWEB)

    Sudo, Yuji [Univ. of Tsukuba (Japan)

    2011-02-01

    We searched for Standard Model Higgs boson decaying into WW(*), where one of the W bosons decays leptonically and the other hadronically. We used 4.6 $fb^{-1}$ of data collected with the CDF detector in Tevatron Run II. We composed a likelihood discriminant using kinematic variables in order to maximize the signal/background separation. We set upper limits on Higgs boson production cross section for Higgs boson masses between 150 and 200 GeV/$c^2$. The results range from 5.69 ($m_H$ = 170 GeV/$c^2$) to 52.5 ($m_H$ = 150 GeV/$c^2$) times the Standard Model values at 95 % confidence level

  18. Heuristic Algorithm with Simulation Model for Searching Optimal Reservoir Rule Curves

    Directory of Open Access Journals (Sweden)

    Anongrit Kangrang

    2009-01-01

    Full Text Available This study proposes a heuristic algorithm to connect with simulation model for searching the optimal reservoir rule curves. The proposed model was applied to determine the optimal rule curves of the Ubolratana reservoir (the Chi River Basin, Thailand. The results showed that the pattern of the obtained rule curves similar to the existing rule curve. Then the obtained rule curves were used to simulate the Ubolratana reservoir system with the synthetic inflows. The results indicated that the frequency of water shortage and the average water shortage are reduced to 44.31 and 43.75% respectively, the frequency of excess release and the average excess release are reduced to 24.08% and 22.81%.

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

    Science.gov (United States)

    South, David M.; Turcato, Monica

    2016-06-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 Z0 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.

  20. Review of Searches for Rare Processes and Physics Beyond the Standard Model at HERA

    CERN Document Server

    South, David M

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

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

    Science.gov (United States)

    Abazov, V M; Abbott, B; Abolins, M; Acharya, B S; Adams, M; Adams, T; Aguilo, E; Ahsan, M; Alexeev, G D; Alkhazov, G; Alton, A; Alverson, G; Alves, G A; Ancu, L S; Andeen, T; Anzelc, M S; Aoki, M; Arnoud, Y; Arov, M; Arthaud, M; Askew, A; Asman, B; Atramentov, O; Avila, C; Backusmayes, J; Badaud, F; Bagby, L; Baldin, B; Bandurin, D V; Banerjee, S; Barberis, E; Barfuss, A-F; Bargassa, P; Baringer, P; Barreto, J; Bartlett, J F; Bassler, U; Bauer, D; Beale, S; Bean, A; Begalli, M; Begel, M; Belanger-Champagne, C; Bellantoni, L; Bellavance, A; Benitez, J A; Beri, S B; Bernardi, G; Bernhard, R; Bertram, I; Besançon, M; Beuselinck, R; Bezzubov, V A; Bhat, P C; Bhatnagar, V; Blazey, G; Blessing, S; Bloom, K; Boehnlein, A; Boline, D; Bolton, T A; Boos, E E; Borissov, G; Bose, T; Brandt, A; Brock, R; Brooijmans, G; Bross, A; Brown, D; Bu, X B; Buchholz, D; Buehler, M; Buescher, V; Bunichev, V; Burdin, S; Burnett, T H; Buszello, C P; Calfayan, P; Calpas, B; Calvet, S; Cammin, J; Carrasco-Lizarraga, M A; Carrera, E; Carvalho, W; Casey, B C K; Castilla-Valdez, H; Chakrabarti, S; Chakraborty, D; Chan, K M; Chandra, A; Cheu, E; Cho, D K; Choi, S; Choudhary, B; Christoudias, T; Cihangir, S; Claes, D; Clutter, J; Cooke, M; Cooper, W E; Corcoran, M; Couderc, F; Cousinou, M-C; Crépé-Renaudin, S; Cuplov, V; Cutts, D; Cwiok, M; Das, A; Davies, G; De, K; de Jong, S J; De La Cruz-Burelo, E; DeVaughan, K; Déliot, F; Demarteau, M; Demina, R; Denisov, D; Denisov, S P; Desai, S; Diehl, H T; Diesburg, M; Dominguez, A; Dorland, T; Dubey, A; Dudko, L V; Duflot, L; Duggan, D; Duperrin, A; Dutt, S; Dyshkant, A; Eads, M; Edmunds, D; Ellison, J; Elvira, V D; Enari, Y; Eno, S; Ermolov, P; Escalier, M; Evans, H; Evdokimov, A; Evdokimov, V N; Facini, G; Ferapontov, A V; Ferbel, T; Fiedler, F; Filthaut, F; Fisher, W; Fisk, H E; Fortner, M; Fox, H; Fu, S; Fuess, S; Gadfort, T; Galea, C F; Garcia-Bellido, A; Gavrilov, V; Gay, P; Geist, W; Geng, W; Gerber, C E; Gershtein, Y; Gillberg, D; Ginther, G; Gómez, B; Goussiou, A; Grannis, P D; Greder, S; Greenlee, H; Greenwood, Z D; Gregores, E M; Grenier, G; Gris, Ph; Grivaz, J-F; Grohsjean, A; Grünendahl, S; Grünewald, M W; Guo, F; Guo, J; Gutierrez, G; Gutierrez, P; Haas, A; Hadley, N J; Haefner, P; Hagopian, S; Haley, J; Hall, I; Hall, R E; Han, L; Harder, K; Harel, A; Hauptman, J M; Hays, J; Hebbeker, T; Hedin, D; Hegeman, J G; Heinson, A P; Heintz, U; Hensel, C; Heredia-De La Cruz, I; Herner, K; Hesketh, G; Hildreth, M D; Hirosky, R; Hoang, T; Hobbs, J D; Hoeneisen, B; Hohlfeld, M; Hossain, S; Houben, P; Hu, Y; Hubacek, Z; Huske, N; Hynek, V; Iashvili, I; Illingworth, R; Ito, A S; Jabeen, S; Jaffré, M; Jain, S; Jakobs, K; Jamin, D; Jarvis, C; Jesik, R; Johns, K; Johnson, C; Johnson, M; Johnston, D; Jonckheere, A; Jonsson, P; Juste, A; Kajfasz, E; Karmanov, D; Kasper, P A; Katsanos, I; Kaushik, V; Kehoe, R; Kermiche, S; Khalatyan, N; Khanov, A; Kharchilava, A; Kharzheev, Y N; Khatidze, D; Kim, T J; Kirby, M H; Kirsch, M; Klima, B; Kohli, J M; Konrath, J-P; Kozelov, A V; Kraus, J; Kuhl, T; Kumar, A; Kupco, A; Kurca, T; Kuzmin, V A; Kvita, J; Lacroix, F; Lam, D; Lammers, S; Landsberg, G; Lebrun, P; Lee, W M; Leflat, A; Lellouch, J; Li, J; Li, L; Li, Q Z; Lietti, S M; Lim, J K; Lincoln, D; Linnemann, J; Lipaev, V V; Lipton, R; Liu, Y; Liu, Z; Lobodenko, A; Lokajicek, M; Love, P; Lubatti, H J; Luna-Garcia, R; Lyon, A L; Maciel, A K A; Mackin, D; Mättig, P; Magerkurth, A; Mal, P K; Malbouisson, H B; Malik, S; Malyshev, V L; Maravin, Y; Martin, B; McCarthy, R; McGivern, C L; Meijer, M M; Melnitchouk, A; Mendoza, L; Menezes, D; Mercadante, P G; Merkin, M; Merritt, K W; Meyer, A; Meyer, J; Mitrevski, J; Mommsen, R K; Mondal, N K; Moore, R W; Moulik, T; Muanza, G S; Mulhearn, M; Mundal, O; Mundim, L; Nagy, E; Naimuddin, M; Narain, M; Neal, H A; Negret, J P; Neustroev, P; Nilsen, H; Nogima, H; Novaes, S F; Nunnemann, T; Obrant, G; Ochando, C; Onoprienko, D; Orduna, J; Oshima, N; Osman, N; Osta, J; Otec, R; Otero Y Garzón, G J; Owen, M; Padilla, M; Padley, P; Pangilinan, M; Parashar, N; Park, S-J; Park, S K; Parsons, J; Partridge, R; Parua, N; Patwa, A; Pawloski, G; Penning, B; Perfilov, M; Peters, K; Peters, Y; Pétroff, P; Piegaia, R; Piper, J; Pleier, M-A; Podesta-Lerma, P L M; Podstavkov, V M; Pogorelov, Y; Pol, M-E; Polozov, P; Popov, A V; Potter, C; Prado da Silva, W L; Protopopescu, S; Qian, J; Quadt, A; Quinn, B; Rakitine, A; Rangel, M S; Ranjan, K; Ratoff, P N; Renkel, P; Rich, P; Rijssenbeek, M; Ripp-Baudot, I; Rizatdinova, F; Robinson, S; Rodrigues, R F; Rominsky, M; Royon, C; Rubinov, P; Ruchti, R; Safronov, G; Sajot, G; Sánchez-Hernández, A; Sanders, M P; Sanghi, B; Savage, G; Sawyer, L; Scanlon, T; Schaile, D; Schamberger, R D; Scheglov, Y; Schellman, H; Schliephake, T; Schlobohm, S; Schwanenberger, C; Schwienhorst, R; Sekaric, J; Severini, H; Shabalina, E; Shamim, M; Shary, V; Shchukin, A A; Shivpuri, R K; Siccardi, V; Simak, V; Sirotenko, V; Skubic, P; Slattery, P; Smirnov, D; Snow, G R; Snow, J; Snyder, S; Söldner-Rembold, S; Sonnenschein, L; Sopczak, A; Sosebee, M; Soustruznik, K; Spurlock, B; Stark, J; Stolin, V; Stoyanova, D A; Strandberg, J; Strandberg, S; Strang, M A; Strauss, E; Strauss, M; Ströhmer, R; Strom, D; Stutte, L; Sumowidagdo, S; Svoisky, P; Takahashi, M; Tanasijczuk, A; Taylor, W; Tiller, B; Tissandier, F; Titov, M; Tokmenin, V V; Torchiani, I; Tsybychev, D; Tuchming, B; Tully, C; Tuts, P M; Unalan, R; Uvarov, L; Uvarov, S; Uzunyan, S; Vachon, B; van den Berg, P J; Van Kooten, R; van Leeuwen, W M; Varelas, N; Varnes, E W; Vasilyev, I A; Verdier, P; Vertogradov, L S; Verzocchi, M; Vilanova, D; Vint, P; Vokac, P; Voutilainen, M; Wagner, R; Wahl, H D; Wang, M H L S; Warchol, J; Watts, G; Wayne, M; Weber, G; Weber, M; Welty-Rieger, L; Wenger, A; Wetstein, M; White, A; Wicke, D; Williams, M R J; Wilson, G W; Wimpenny, S J; Wobisch, M; Wood, D R; Wyatt, T R; Xie, Y; Xu, C; Yacoob, S; Yamada, R; Yang, W-C; Yasuda, T; Yatsunenko, Y A; Ye, Z; Yin, H; Yip, K; Yoo, H D; Youn, S W; Yu, J; Zeitnitz, C; Zelitch, S; Zhao, T; Zhou, B; Zhu, J; Zielinski, M; Zieminska, D; Zivkovic, L; Zutshi, V; Zverev, E G

    2009-06-26

    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 pp collider. We select two final states: tau+/- plus missing transverse energy and b jets, and tau+ tau- plus jets. These final states are sensitive to a combination of associated W/Z boson plus Higgs boson, vector boson fusion, and gluon-gluon fusion production processes. The observed ratio of the combined limit on the Higgs production cross section at the 95% C.L. to the standard model expectation is 29 for a Higgs boson mass of 115 GeV.

  2. Constraints on radion in a warped extra dimension model from Higgs boson searches at the LHC

    CERN Document Server

    Cho, Gi-Chol; Ohno, Yoshiko

    2013-01-01

    We study constraints on the radion mass and couplings in the Randall-Sundrum model from the recent LHC data on the Standard Model (SM) Higgs boson searches. When the radion is heavy enough so that it can decay into a pair of on-shell Z-bosons, we find that the ZZ channel gives a stringent constraint. For example, if the radion mass m_\\phi is 200 GeV, the scale \\Lambda_\\phi which characterizes the interactions of the radion with the SM fields must be larger than 5 TeV. Even for m_\\phi=1 TeV, we find that the lower bound on \\Lambda_\\phi is 2 TeV.

  3. Searching for a two-factor model of marriage duration: commentary on Gottman and Levenson.

    Science.gov (United States)

    DeKay, Michael L; Greeno, Catherine G; Houck, Patricia R

    2002-01-01

    Gottman and Levenson (2002) report a number of post hoc ordinary least squares regressions to "predict" the length of marriage, given that divorce has occurred. We argue that the type of statistical model they use is inappropriate for answering clinically relevant questions about the causes and timing of divorce, and present several reasons why an alternative family of models called duration models would be more appropriate. The distribution of marriage length is not bimodal, as Gottman and Levenson suggest, and their search for a two-factor model for explaining marriage length is misguided. Their regression models omit many variables known to affect marriage length, and instead use variables that were pre-screened for their predictive ability. Their final model is based on data for only 15 cases, including one unusual case that has undue influence on the results. For these and other technical reasons presented in the text, we believe that Gottman and Levenson's results are not replicable, and that they should not be used to guide interventions for couples in clinical settings.

  4. 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.

  5. Model development and system performance optimization for staring infrared search and track (IRST) sensors

    Science.gov (United States)

    Olson, Craig; Theisen, Michael; Pace, Teresa; Halford, Carl; Driggers, Ronald

    2016-05-01

    The mission of an Infrared Search and Track (IRST) system is to detect and locate (sometimes called find and fix) enemy aircraft at significant ranges. Two extreme opposite examples of IRST applications are 1) long range offensive aircraft detection when electronic warfare equipment is jammed, compromised, or intentionally turned off, and 2) distributed aperture systems where enemy aircraft may be in the proximity of the host aircraft. Past IRST systems have been primarily long range offensive systems that were based on the LWIR second generation thermal imager. The new IRST systems are primarily based on staring infrared focal planes and sensors. In the same manner that FLIR92 did not work well in the design of staring infrared cameras (NVTherm was developed to address staring infrared sensor performance), current modeling techniques do not adequately describe the performance of a staring IRST sensor. There are no standard military IRST models (per AFRL and NAVAIR), and each program appears to perform their own modeling. For this reason, L-3 has decided to develop a corporate model, working with AFRL and NAVAIR, for the analysis, design, and evaluation of IRST concepts, programs, and solutions. This paper provides some of the first analyses in the L-3 IRST model development program for the optimization of staring IRST sensors.

  6. Development of optimization model for sputtering process parameter based on gravitational search algorithm

    Science.gov (United States)

    Norlina, M. S.; Diyana, M. S. Nor; Mazidah, P.; Rusop, M.

    2016-07-01

    In the RF magnetron sputtering process, the desirable layer properties are largely influenced by the process parameters and conditions. If the quality of the thin film has not reached up to its intended level, the experiments have to be repeated until the desirable quality has been met. This research is proposing Gravitational Search Algorithm (GSA) as the optimization model to reduce the time and cost to be spent in the thin film fabrication. The optimization model's engine has been developed using Java. The model is developed based on GSA concept, which is inspired by the Newtonian laws of gravity and motion. In this research, the model is expected to optimize four deposition parameters which are RF power, deposition time, oxygen flow rate and substrate temperature. The results have turned out to be promising and it could be concluded that the performance of the model is satisfying in this parameter optimization problem. Future work could compare GSA with other nature based algorithms and test them with various set of data.

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