Search for pair production of Higgsinos in final states with at least three b -tagged jets in s = 13 TeV p p collisions using the ATLAS detector
Not Available
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Not Available
Not Available
We present a search for a new narrow, spin-1, high mass resonance decaying to {mu}{sup +}{mu}{sup -}+X, using a matrix-element-based likelihood and a simultaneous measurement of the resonance mass and production rate. In data with 4.6 fb{sup -1} of integrated luminosity collected by the CDF detector in pp collisions at {radical}(s)=1960 GeV, the most likely signal cross section is consistent with zero at 16% confidence level. We therefore do not observe evidence for a high mass resonance and place limits on models predicting spin-1 resonances, including M>1071 GeV/c{sup 2} at 95% confidence level for a Z{sup '} boson with the same couplings to fermions as the Z boson.
Abstract Not Provided
We present a search for the standard model Higgs boson and a fermiophobic Higgs boson in the diphoton final states based on 8.2 fb{sup -1} of pp collisions at {radical}(s)=1.96 TeV collected with the D0 detector at the Fermilab Tevatron Collider. No excess of data above background predictions is observed and upper limits at the 95% C.L. on the cross section multiplied by the branching fraction are set which are the most restrictive to date. A fermiophobic Higgs boson with a mass below 112.9 GeV is excluded at the 95% C.L.
Abstract Not Provided
Fuel loading pattern optimization is a combinatorial optimization problem from the mathematical point of view. However, exhaustive search is impractical because enormous computational cost is necessary due to huge search space. For this reason, various optimization methods have been developed so far, but no methods are able to guarantee to reach the optimum solution. In the present study, search space is divided into subspaces using key parameters that well represent characteristics of a loading pattern and then promising subspaces are extensively searched. In the present method, balance between division of a search space into subspaces and a search method used in a subspace is essential. For example, when the number of division is set to be one, it is equivalent to the exhaustive search thus is impractical. Similarly, when the division to subspaces is too coarse, an optimum (or near optimum) solution cannot be found through local search in each subspace since design space of a subspace is still too large. Contrary, if division to subspaces is too fine, number of subspaces becomes to large thus promising subspaces cannot be found. In the present study, search space is divided focusing on the location of fresh fuel assemblies with gadolinia since it has significant impact on core characteristics. Number of possible loading patterns of gadolinia bearing fresh fuel assemblies is not very large thus exhaustive search is possible. Local fine search is executed by considering location of burned fuels for each loading pattern of gadolinia bearing fresh fuel assembly. If the same solution is obtained by multiple local searches starting from different initial burnt fuel locations (but the same loading patterns for gadolinia bearing fresh fuel assemblies), the obtained solution is highly likely the optimum in the subspace. In more general, the present method is based on the 'divide and conquer' approach, which is familiar in the optimization field. Namely, after division of search space into subspaces and then promising subspace is searched. Once the promising subspace is found, the subspace is further subdivided into subspaces and repeat the above procedures. This method would be efficient when appropriate balance between search space division method and performance of local search is achieved. The previous works utilizes the similar approach. In reference [1], exhaustive search in small region in a core is carried out focusing on loading patterns of gadolinia bearing fresh fuel assemblies. In reference [2], rough exhaustive search based on the 'batch-wise' loading pattern is performed with the assist of the linear programming. By contrast, in the present study, exhaustive search is carried out for loading patterns of gadolinia bearing fresh fuel assemblies. The random Multi-start Local Search (MSLS) with the direct search or the exhaustive binary swap is used to find out optimal solutions in a subspace, which consists of loading patterns having the same arrangement of gadolinia bearing fresh fuel assemblies. (authors)
This paper introduces a novel hybrid optimization algorithm to establish the parameters of chaotic systems. In order to deal with the weaknesses of the traditional cuckoo search algorithm, the proposed adaptive cuckoo search with simulated annealing algorithm is presented, which incorporates the adaptive parameters adjusting operation and the simulated annealing operation in the cuckoo search algorithm. Normally, the parameters of the cuckoo search algorithm are kept constant that may result in decreasing the efficiency of the algorithm. For the purpose of balancing and enhancing the accuracy and convergence rate of the cuckoo search algorithm, the adaptive operation is presented to tune the parameters properly. Besides, the local search capability of cuckoo search algorithm is relatively weak that may decrease the quality of optimization. So the simulated annealing operation is merged into the cuckoo search algorithm to enhance the local search ability and improve the accuracy and reliability of the results. The functionality of the proposed hybrid algorithm is investigated through the Lorenz chaotic system under the noiseless and noise condition, respectively. The numerical results demonstrate that the method can estimate parameters efficiently and accurately in the noiseless and noise condition. Finally, the results are compared with the traditional cuckoo search algorithm, genetic algorithm, and particle swarm optimization algorithm. Simulation results demonstrate the effectiveness and superior performance of the proposed algorithm.
PTMSearchPlus is a software tool for the automated integration of accurate intact protein mass (AIPM) and bottom-up (BU) mass spectra searches/data in order to both confidently identify the intact proteins and to characterize their post-translational modifications (PTMs). The development of PTMSearchPlus was motivated by the desire to effectively integrate high-resolution intact protein molecular masses with bottom-up peptide MS/MS data. PTMSearchPlus requires as input both intact protein and proteolytic peptide mass spectra collected from the same protein mixture, a FASTA protein database, and a selection of possible PTMs, the types and ranges of which can be specified. The output of PTMSearchPlus is a list of intact and modified proteins matching the AIPM data concomitant with their respective peptides found by the BU search. This list also contains protein and peptide sequence coverage information, scores, etc. that can be used for further evaluation or refiltering of the results. Corresponding and annotated AIPM and BU mass spectra are also displayed for visual inspection when a listed protein or a peptide is selected. These and other controls ensure that the user can manually evaluate, modify (e.g., remove obvious false positives, low quality spectra etc.), and save the results of the automated search if necessary. Driven by the exponential growth in the number of possible peptide candidates in a BU search when multiple PTMs are probed, the advantages on search speed by limiting the total number of possible PTMs on a peptide in the BU search or by performing an AIPM predicted BU search are also discussed in addition to the integration approach. The features of PTMSearchPlus are demonstrated using both a protein standard mixture and a complex protein mixture from Escherichia coli. Experimental data revealed a unique advantage of coupling AIPM and the BU data sets that is mutually beneficial for both approaches. Namely, AIPM data can confirm that no PTM peptides were missed in a BU search, while the BU search determines the location of the PTM. This information is not available using an AIPM search alone.
Abstract Not Provided
N/A
A search for the electroweak pair production of charged sleptons and weak gauginos decaying into final states with two leptons is performed using 4.7 fb -1 of proton–proton collision data at √s = 7 TeV recorded with the ATLAS experiment at the Large Hadron Collider. No significant excesses are observed with respect to the prediction from Standard Model processes. In the scenario of direct slepton production, if the sleptons decay directly into the lightest neutralino, left-handed slepton masses between 85 and 195 GeV are excluded at 95% confidence level for a 20 GeV neutralino. Chargino masses between 110 and 340 GeV are excluded in the scenario of direct production of wino-like chargino pairs decaying into the lightest neutralino via an intermediate on-shell charged slepton for a 10 GeV neutralino. The results are also interpreted in the framework of the phenomenological minimal supersymmetric Standard Model.
Explore the source record for details and available documents.
Not Available
A search for pair production of first-generation scalar leptoquarks is performed in the final state containing two electrons and two jets using proton-proton collision data at {radical}(s)=7 TeV. The data sample used corresponds to an integrated luminosity of 33 pb{sup -1} collected with the CMS detector at the CERN LHC. The number of observed events is in good agreement with the predictions for the standard model background processes, and an upper limit is set on the leptoquark pair production cross section times {beta}{sup 2} as a function of the leptoquark mass, where {beta} is the branching fraction of the leptoquark decay to an electron and a quark. A 95% confidence level lower limit is set on the mass of a first-generation scalar leptoquark at 384 GeV for {beta}=1, which is the most stringent direct limit to date.
A search for pair production of second-generation scalar leptoquarks in the final state with two muons and two jets is performed using proton-proton collision data at {radical}(s)=7 TeV collected by the CMS detector at the LHC. The data sample used corresponds to an integrated luminosity of 34 pb{sup -1}. The number of observed events is in good agreement with the predictions from the standard model processes. An upper limit is set on the second-generation leptoquark cross section times {beta}{sup 2} as a function of the leptoquark mass, and leptoquarks with masses below 394 GeV are excluded at a 95% confidence level for {beta}=1, where {beta} is the leptoquark branching fraction into a muon and a quark. These limits are the most stringent to date.