Bibliographies thématiques / Collision search

Littérature scientifique sur le sujet « Collision search »

Auteur : Grafiati
Publié le 1 juin 2024

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Sommaire

Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Collision search ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Articles de revues sur le sujet "Collision search"

1

Rakholiya, Kalpesh R., et Dr Dhaval Kathiriya. « Efficient Black-Box Collision Search in cryptanalysis ». Paripex - Indian Journal Of Research 2, no 1 (15 janvier 2012) : 30–31. http://dx.doi.org/10.15373/22501991/jan2013/11.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Kim, Dong-Gyun, Katsutoshi Hirayama et Gyei-Kark Park. « Collision Avoidance in Multiple-Ship Situations by Distributed Local Search ». Journal of Advanced Computational Intelligence and Intelligent Informatics 18, no 5 (20 septembre 2014) : 839–48. http://dx.doi.org/10.20965/jaciii.2014.p0839.

Texte intégral
Résumé :
As vital transportation carriers in trade, ships have the advantage of stability, economy, and bulk capacity over airplanes, trucks, and trains. Even so, their loss and cost due to collisions and other accidents exceed those of any other mode of transportation. To prevent ship collisions many ways have been suggested, e.g., the 1972 COLREGs which is the regulation for preventing collision between ships. Technologically speaking, many related studies have been conducted. The term “Ship domain” involves that area surrounding a ship that the navigator wants to keep other ships clear of. Ship domain alone is not sufficient, however, for enabling one or more ships to simultaneously determine the collision risk for all of the ships concerned. Fuzzy theory is useful in helping ships avoid collision in that fuzzy theory may define whether collision risk is based on distance to closest point of approach, time to closest point of approach, or relative bearing – algorithms that are difficult to apply to more than one ships at one time. The main purpose of this study is thus to reduce collision risk among multiple ships using a distributed local search algorithm (DLSA). By exchanging information on, for example, next-intended courses within a certain area among ships, ships having the maximum reduction in collision risk change courses simultaneously until all ships approach a destination without collision. In this paper, we introduce distributed local search and explain how it works using examples. We conducted experiments to test distributed local search performance for certain instances of ship collision avoidance. Experiments results showed that in most cases, our proposal applies well in ship collision avoidance amongmultiple ships.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Fan, Yunsheng, Xiaojie Sun, Guofeng Wang et Dongdong Mu. « Collision Avoidance Controller for Unmanned Surface Vehicle Based on Improved Cuckoo Search Algorithm ». Applied Sciences 11, no 20 (19 octobre 2021) : 9741. http://dx.doi.org/10.3390/app11209741.

Texte intégral
Résumé :
For the dynamic collision avoidance problem of an unmanned surface vehicle (USV), a dynamic collision avoidance control method based on an improved cuckoo search algorithm is proposed. The collision avoidance model for a USV and obstacles is established on the basis of the principle of the velocity obstacle method. Simultaneously, the Convention on the International Regulations for Preventing Collisions at Sea (COLREGS) is incorporated in the collision avoidance process. For the improvement of the cuckoo algorithm, the adaptive variable step-size factor is designed to realize the adaptive adjustment of flight step-size, and a mutation and crossover strategy is introduced to enhance the population diversity and improve the global optimization ability. The improved cuckoo search algorithm is applied to the collision avoidance model to obtain an optimal collision avoidance strategy. According to the collision avoidance strategy, the desired evasion trajectory is obtained, and the tracking controller based on PID is used for the Lanxin USV. The experimental results show the feasibility and effectiveness of the proposed collision avoidance method, which provides a solution for the autonomous dynamic collision avoidance of USVs.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Chen, Jian Zhe, Gui Tang Wang, Mei Shao et Ying Ge Li. « An Improved Multi-Label Anti-Collision Algorithm of RFID ». Applied Mechanics and Materials 336-338 (juillet 2013) : 1887–91. http://dx.doi.org/10.4028/www.scientific.net/amm.336-338.1887.

Texte intégral
Résumé :
When there are multiple electronic tags in the reading range of reader, It arises problem of multiple tags data collision in the data communication process of RFID system, causing the data reader have obtained error. This paper will contrapose the problem of tag collision, analysizing the search number and the system throughput rate of the existing anti-collision search algorithm based on binary, to propose an improved anti-collision algorithm. The improved algorithm reduces the redundant information of the sequence number that the reader have sent, and no longer searchs the tags of one bit collided ,but identify the two collided tags directly, thus reducing the search number of algorithm. Matlab simulation show that this algorithm can reduce the search number of reader identifying tags, improving the identifying efficiency of the RFID system, solving the problem of tag collision effectively.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Zhang, Hang, et Jing Sha He. « An Anti-Collision Algorithm for Applications with Massive RFID Tags ». Advanced Materials Research 756-759 (septembre 2013) : 4011–15. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.4011.

Texte intégral
Résumé :
Anti-collision is a key technology in systems and applications in which Radio Frequency Identification (RFID) is used since it determines the efficiency of RFID tag identification. Although binary-tree search algorithms can effectively resolve collisions, they may not be very efficient in systems with a large number of RFID tags. In this paper, we propose a new flat-tree anti-collision algorithm and show that the proposed algorithm is more suitable for resolving collisions involving a massive number of RFID tags. Through analysis and experiment, we show that the flat-tree algorithm outperforms the binary-tree search algorithms when the number of RFID tags reaches a massive scale, i.e., exceeds a certain number.
Styles APA, Harvard, Vancouver, ISO, etc.
6

Watanabe, Kento, Jun’ichi Kaneko et Kenichiro Horio. « Development of Tool Collision Avoidance Method Adapted to Uncut Workpiece Shape ». International Journal of Automation Technology 11, no 2 (1 mars 2017) : 235–41. http://dx.doi.org/10.20965/ijat.2017.p0235.

Texte intégral
Résumé :
This study developed an automatic planning method for tool collision avoidance, with posture adapted to the uncut shape of a workpiece to avoid collisions between the tool and workpiece in five-axis machining. This method sequentially judges the likelihood of collision between the holder and shank parts of the tool and the workpiece while machining, which is updated with tool motion. Then it automatically determines tool postures in which no collisions occur. The process of setting the search range for collision avoidance postures of the tool when collisions occur is made more efficient; it is possible to prevent rapid changes in tool posture at the time of avoidance, while reducing the time for geometric operations necessary when searching for compatible orientations.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Xu, Qingyang, Chuang Zhang et Ning Wang. « Multiobjective Optimization Based Vessel Collision Avoidance Strategy Optimization ». Mathematical Problems in Engineering 2014 (2014) : 1–9. http://dx.doi.org/10.1155/2014/914689.

Texte intégral
Résumé :
The vessel collision accidents cause a great loss of lives and property. In order to reduce the human fault and greatly improve the safety of marine traffic, collision avoidance strategy optimization is proposed to achieve this. In the paper, a multiobjective optimization algorithm NSGA-II is adopted to search for the optimal collision avoidance strategy considering the safety as well as economy elements of collision avoidance. Ship domain and Arena are used to evaluate the collision risk in the simulation. Based on the optimization, an optimal rudder angle is recommended to navigator for collision avoidance. In the simulation example, a crossing encounter situation is simulated, and the NSGA-II searches for the optimal collision avoidance operation under the Convention on the International Regulations for Preventing Collisions at Sea (COLREGS). The simulation studies exhibit the validity of the method.
Styles APA, Harvard, Vancouver, ISO, etc.
8

Byun, Hayoung, et Hyesook Lim. « Comparison on Search Failure between Hash Tables and a Functional Bloom Filter ». Applied Sciences 10, no 15 (29 juillet 2020) : 5218. http://dx.doi.org/10.3390/app10155218.

Texte intégral
Résumé :
Hash-based data structures have been widely used in many applications. An intrinsic problem of hashing is collision, in which two or more elements are hashed to the same value. If a hash table is heavily loaded, more collisions would occur. Elements that could not be stored in a hash table because of the collision cause search failures. Many variant structures have been studied to reduce the number of collisions, but none of the structures completely solves the collision problem. In this paper, we claim that a functional Bloom filter (FBF) provides a lower search failure rate than hash tables, when a hash table is heavily loaded. In other words, a hash table can be replaced with an FBF because the FBF is more effective than hash tables in the search failure rate in storing a large amount of data to a limited size of memory. While hash tables require to store each input key in addition to its return value, a functional Bloom filter stores return values without input keys, because different index combinations according to each input key can be used to identify the input key. In search failure rates, we theoretically compare the FBF with hash-based data structures, such as multi-hash table, cuckoo hash table, and d-left hash table. We also provide simulation results to prove the validity of our theoretical results. The simulation results show that the search failure rates of hash tables are larger than that of the functional Bloom filter when the load factor is larger than 0.6.
Styles APA, Harvard, Vancouver, ISO, etc.
9

Li, Jiaoyang, Zhe Chen, Daniel Harabor, Peter J. Stuckey et Sven Koenig. « MAPF-LNS2 : Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search ». Proceedings of the AAAI Conference on Artificial Intelligence 36, no 9 (28 juin 2022) : 10256–65. http://dx.doi.org/10.1609/aaai.v36i9.21266.

Texte intégral
Résumé :
Multi-Agent Path Finding (MAPF) is the problem of planning collision-free paths for multiple agents in a shared environment. In this paper, we propose a novel algorithm MAPF-LNS2 based on large neighborhood search for solving MAPF efficiently. Starting from a set of paths that contain collisions, MAPF-LNS2 repeatedly selects a subset of colliding agents and replans their paths to reduce the number of collisions until the paths become collision-free. We compare MAPF-LNS2 against a variety of state-of-the-art MAPF algorithms, including Prioritized Planning with random restarts, EECBS, and PPS, and show that MAPF-LNS2 runs significantly faster than them while still providing near-optimal solutions in most cases. MAPF-LNS2 solves 80% of the random-scenario instances with the largest number of agents from the MAPF benchmark suite with a runtime limit of just 5 minutes, which, to our knowledge, has not been achieved by any existing algorithms.
Styles APA, Harvard, Vancouver, ISO, etc.
10

Jiang, Ruoxi, Shunying Zhu, Pan Wang, QiuCheng Chen, He Zou et Shiping Kuang. « In Search of the Consequence Severity of Traffic Conflict ». Journal of Advanced Transportation 2020 (13 juillet 2020) : 1–15. http://dx.doi.org/10.1155/2020/9089817.

Texte intégral
Résumé :
Currently, many studies on the severity of traffic conflicts only considered the possibility of potential collisions but ignored the consequences severity of potential collisions. Aiming toward this defect, this study establishes a potential collision (serious conflict) consequences severity model on the basis of vehicle collision theory. Regional vehicles trajectory data and historical traffic accident data were obtained. The field data were brought into the conflict consequences severity model to calculate the conflict severity rate of each section under different TTC thresholds. For comparison, the traditional conflict rate of each section under different TTC thresholds that considered only the number of conflicts was also calculated. Results showed that the relationship between conflict severity rate and influencing factors was somehow different. The conflict severity rate seemed to have a higher correlation with accident rate and accident severity rate than conflict rate did. The TTC threshold value also affected the correlation between conflicts and accidents, with high and low TTC threshold indicating a lower correlation. The results showed that conflict severity rate that considered each single conflict consequence severity was a little better than the traditional conflict rate that considered only the numbers of conflicts in reflecting real risks as a new conflict evaluation indicator. The severity of traffic conflicts should consider two dimensions: the possibility and consequence of potential collisions. Based on this, we propose a new traffic safety evaluation method that takes into account the severity of the consequences of the conflict. More data and prediction models are needed to conduct more realistic and complex research in the future to ensure reliability of this new method.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Thèses sur le sujet "Collision search"

1

Wolf, Travis Benjamin. « Aircraft collision avoidance using Monte Carlo Real-Time Belief Space Search ». Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/54226.

Texte intégral
Résumé :
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2009.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 93-95).
This thesis presents the Monte Carlo Real-Time Belief Space Search (MC-RTBSS) algorithm, a novel, online planning algorithm for partially observable Markov decision processes (POMDPs). MC-RTBSS combines a sample-based belief state representation with a branch and bound pruning method to search through the belief space for the optimal policy. The algorithm is applied to the problem of aircraft collision avoidance and its performance is compared to the Trac Alert and Collision Avoidance System (TCAS) in simulated encounter scenarios. The simulations are generated using an encounter model formulated as a dynamic Bayesian network that is based on radar feeds covering U.S. airspace. MC-RTBSS leverages statistical information from the airspace model to predict future intruder behavior and inform its maneuvers. Use of the POMDP formulation permits the inclusion of different sensor suites and aircraft dynamic models. The behavior of MC-RTBSS is demonstrated using encounters generated from an airspace model and comparing the results to TCAS simulation results. In the simulations, both MC-RTBSS and TCAS measure intruder range, bearing, and relative altitude with the same noise parameters. Increasing the penalty of a Near Mid-Air Collision (NMAC) in the MC-RTBSS reward function reduces the number of NMACs, although the algorithm is limited by the number of particles used for belief state projections. Increasing the number of particles and observations used during belief state projection increases performance.
(cont.) Increasing these parameter values also increases computation time, which needs to be mitigated using a more efficient implementation of MC-RTBSS to permit real-time use.
by Travis Benjamin Wolf.
S.M.
Styles APA, Harvard, Vancouver, ISO, etc.
2

Allen, Benjamin. « Search for New Phenomena in Dijet Events Using 13 TeV Proton-Proton Collision Data Collected With the ATLAS Detector ». Thesis, University of Oregon, 2018. http://hdl.handle.net/1794/23801.

Texte intégral
Résumé :
Dijet events are studied in the proton--proton collision dataset recorded at $\sqrt{s}=$13 TeV with the ATLAS detector at the Large Hadron Collider in 2015 and 2016, corresponding to integrated luminosities of 37 fb$^{-1}$. Invariant mass distributions are compared to background predictions and no significant deviation is observed. A new method for fitting the background component of the invariant mass distribution is employed. The dataset is used to set upper limits at a 95\% confidence level on a range of new physics scenarios. Excited quarks with masses below 6.0 TeV are excluded, and limits are set on quantum black holes, heavy W' bosons, W* bosons, and a range of masses and couplings in a Z' dark matter mediator model. These results represent a substantial improvement over those obtained previously with lower integrated luminosity.
Styles APA, Harvard, Vancouver, ISO, etc.
3

Follega, Francesco Maria. « Search for boosted Higgs bosons decaying to b-quarks at sqrt{s}=13 TeV with the ATLAS detector ». Doctoral thesis, Università degli studi di Trento, 2020. http://hdl.handle.net/11572/259651.

Texte intégral
Résumé :
A search for the Higgs boson produced with large transverse momentum and decaying as H -> bb is presented, using the 80 fb^{-1} from the dataset collected by the ATLAS detector at sqrt{s}=13 TeV. The Higgs boson is reconstructed as a large-R jet with two b-tagged variable radius track-jets. The work focuses on a peculiar event topology in which the Higgs is produced in association with another Large-R jet. Considering events with reconstructed pT above 480 GeV and with a reconstructed mass from 70-230 GeV, a signal significance of 1.6 sigma for the Higgs and of 5 sigma for the V (Z boson + W boson) is observed. Furthermore, the new Full Run2 analysis is presented, using 136 fb^{-1} from the dataset collected by the ATLAS detector at sqrt{s}=13 TeV. The strategy up to the computation of the expected sensitivity for the Higgs boson is presented in this thesis. The validation of the background modeling is described in details, including tests on data. A preliminary extraction of the Z boson signal is performed and the measured signal strength corresponds to muZ = 0.82 +/- 0.09.
Styles APA, Harvard, Vancouver, ISO, etc.
4

Follega, Francesco Maria. « Search for boosted Higgs bosons decaying to b-quarks at sqrt{s}=13 TeV with the ATLAS detector ». Doctoral thesis, Università ; degli studi di Trento, 2020. http://hdl.handle.net/11572/259651.

Texte intégral
Résumé :
A search for the Higgs boson produced with large transverse momentum and decaying as H -> bb is presented, using the 80 fb^{-1} from the dataset collected by the ATLAS detector at sqrt{s}=13 TeV. The Higgs boson is reconstructed as a large-R jet with two b-tagged variable radius track-jets. The work focuses on a peculiar event topology in which the Higgs is produced in association with another Large-R jet. Considering events with reconstructed pT above 480 GeV and with a reconstructed mass from 70-230 GeV, a signal significance of 1.6 sigma for the Higgs and of 5 sigma for the V (Z boson + W boson) is observed. Furthermore, the new Full Run2 analysis is presented, using 136 fb^{-1} from the dataset collected by the ATLAS detector at sqrt{s}=13 TeV. The strategy up to the computation of the expected sensitivity for the Higgs boson is presented in this thesis. The validation of the background modeling is described in details, including tests on data. A preliminary extraction of the Z boson signal is performed and the measured signal strength corresponds to muZ = 0.82 +/- 0.09.
Styles APA, Harvard, Vancouver, ISO, etc.
5

Gilmore, Jason R. « Search for contact interactions in deep inelastic scattering ». Connect to this title online, 2002. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu983824358.

Texte intégral
Résumé :
Thesis (Ph. D.)--Ohio State University, 2002.
Title from first page of PDF file. Document formatted into pages; contains xx, 143 p.; also contains graphics. Includes abstract and vita. Advisor: L. Stanley Durkin, Dept. of Physics. Includes bibliographical references (p. 137-143).
Styles APA, Harvard, Vancouver, ISO, etc.
6

Olschewski, Mark [Verfasser], Thomas [Akademischer Betreuer] Hebbeker et Christopher Henrik V. [Akademischer Betreuer] Wiebusch. « Search for new physics in proton-proton collision events with a lepton and missing transverse energy / Mark Olschewski ; Thomas Hebbeker, Christopher Wiebusch ». Aachen : Universitätsbibliothek der RWTH Aachen, 2016. http://nbn-resolving.de/urn:nbn:de:hbz:82-rwth-2016-027043.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Olschewski, Mark Verfasser], Thomas [Akademischer Betreuer] [Hebbeker et Christopher Henrik V. [Akademischer Betreuer] Wiebusch. « Search for new physics in proton-proton collision events with a lepton and missing transverse energy / Mark Olschewski ; Thomas Hebbeker, Christopher Wiebusch ». Aachen : Universitätsbibliothek der RWTH Aachen, 2016. http://d-nb.info/1130590046/34.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Tashiro, Takuya. « Search for single production of Vector Like Quarks using the LHC pp collision data at √s=13 TeV collected with the ATLAS detector ». Kyoto University, 2019. http://hdl.handle.net/2433/242601.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Trimoska, Monika. « Combinatorics in algebraic and logical cryptanalysis ». Electronic Thesis or Diss., Amiens, 2021. http://www.theses.fr/2021AMIE0005.

Texte intégral
Résumé :
Les attaques cryptographiques que nous décrivons dans cette thèse reposent sur des approches combinatoires, relevant notamment de la théorie des graphes et de la satisfaction sous contraintes. Notre objectif principal concerne l'étude du problème du logarithme discret sur courbes elliptiques. Dans un premier temps, nous nous concentrons sur l'attaque de calcul d'index pour le cas des courbes elliptiques définies sur des extensions de corps finis de degré premier. Au cœur de l'attaque sur ces courbes réside la résolution des systèmes polynomiaux en caractéristique 2. Ainsi, la première phase du calcul d'index, phase de recherche de relations, consiste à résoudre des systèmes d'équations obtenus à partir de polynômes de Semaev, dont les zéros représentent des coordonnées de points. La résolution de ces systèmes répond au problème de décomposition de points. Dans le cadre de cette attaque, premièrement, nous modélisons le problème de décomposition de points sous la forme d'une formule logique et nous le définissons comme une instance du problème SAT. En ajout de cela, nous développons un solveur SAT dédié à ce problème spécifique, nommé WDSat. Le solveur est muni d'une extension qui vise à éliminer les solutions symétriques des polynômes de Semaev sans agrandir le modèle SAT et sans introduire de coût de calcul supplémentaire. Les temps d'exécution expérimentaux montrent que notre approche de résolution utilisant WDSat est significativement plus rapide que les méthodes algébriques actuelles basées sur le calcul de bases de Gröbner. De plus, notre solveur a des meilleures performances que d’autres solveurs SAT couramment utilisés, pour ce problème spécifique. Au final, nous abordons le problème du logarithme discret sur courbes elliptiques dans le cas générique. Notamment, pour la mise en oeuvre de l'attaque de recherche de collisions en contexte parallèle de van Oorschot et Wiener, nous proposons une nouvelle structure de données, ayant des conséquences importantes sur la complexité en mémoire et en temps
In this thesis, we explore the use of combinatorial techniques, such as graph-based algorithms and constraint satisfaction, in cryptanalysis. Our main focus is on the elliptic curve discrete logarithm problem. First, we tackle this problem in the case of elliptic curves defined over prime-degree binary extension fields, using the index calculus attack. A crucial step of this attack is solving the point decomposition problem, which consists in finding zeros of Semaev’s summation polynomials and can be reduced to the problem of solving a multivariate Boolean polynomial system. To this end, we encode the point decomposition problem as a logical formula and define it as an instance of the SAT problem. Then, we propose an original XOR-reasoning SAT solver, named WDSat, dedicated to this specific problem. As Semaev’s polynomials are symmetric, we extend the WDSat solver by adding a novel symmetry breaking technique that, in contrast to other symmetry breaking techniques, is not applied to the modelization or the choice of a factor base, but to the solving process. Experimental running times show that our SAT-based solving approach is significantly faster than current algebraic methods based on Gröbner basis computation. In addition, our solver outperforms other state-of-the-art SAT solvers, for this specific problem. Finally, we study the elliptic curve discrete logarithm problem in the general case. More specifically, we propose a new data structure for the Parallel Collision Search attack proposed by van Oorschot and Wiener, which has significant consequences on the memory and time complexity of this algorithm
Styles APA, Harvard, Vancouver, ISO, etc.
10

Brintaki, Athina N. « A Computational Kinematics and Evolutionary Approach to Model Molecular Flexibility for Bionanotechnology ». Scholar Commons, 2009. https://scholarcommons.usf.edu/etd/1579.

Texte intégral
Résumé :
Modeling molecular structures is critical for understanding the principles that govern the behavior of molecules and for facilitating the exploration of potential pharmaceutical drugs and nanoscale designs. Biological molecules are flexible bodies that can adopt many different shapes (or conformations) until they reach a stable molecular state that is usually described by the minimum internal energy. A major challenge in modeling flexible molecules is the exponential explosion in computational complexity as the molecular size increases and many degrees of freedom are considered to represent the molecules' flexibility. This research work proposes a novel generic computational geometric approach called enhanced BioGeoFilter (g.eBGF) that geometrically interprets inter-atomic interactions to impose geometric constraints during molecular conformational search to reduce the time for identifying chemically-feasible conformations. Two new methods called Kinematics-Based Differential Evolution (kDE) and Biological Differential Evolution (BioDE) are also introduced to direct the molecular conformational search towards low energy (stable) conformations. The proposed kDE method kinematically describes a molecule's deformation mechanism while it uses differential evolution to minimize the inta-molecular energy. On the other hand, the proposed BioDE utilizes our developed g.eBGF data structure as a surrogate approximation model to reduce the number of exact evaluations and to speed the molecular conformational search. This research work will be extremely useful in enabling the modeling of flexible molecules and in facilitating the exploration of nanoscale designs through the virtual assembly of molecules. Our research work can also be used in areas such as molecular docking, protein folding, and nanoscale computer-aided design where rapid collision detection scheme for highly deformable objects is essential.
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Livres sur le sujet "Collision search"

1

Leslie, Lynn D. Alaska Over-The-Horizon Backscatter Radar System : Climate factors analysis : a search for a gauge of bird collision potential. Anchorage, Alaska : University of Alaska, Arctic Environmental Information and Data Center, 1988.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Gustavino, Giuliano. Search for New Physics in Mono-jet Final States in pp Collisions. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-58871-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Hazumi, Masashi. Search for scalar and vector leptoquarks in electron-proton collisions at /S=300 GeV. Tokyo, Japan : University of Tokyo, 1993.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Sveinsson, Óttar. Útkall í Atlantshafi a jólanótt. Reykjavík : Íslenska bókaútgáfan, 1999.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

INFN, Eloisatron Project Workshop on Higgs Particle(s) (8th 1989 Erice Italy). Higgs particle(s) : Physics issues and experimental searches in high-energy collisions. New York : Plenum Press, 1990.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Ali, Ahmed. Higgs Particle(s) : Physics Issues and Experimental Searches in High-Energy Collisions. Boston, MA : Springer US, 1990.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

INFN Eloisatron Project Workshop on Higgs Particle(s) : Physics Issues and Searches in High-Energy Collisions (1989 Erice, Italy). Higgs particle(s) : Physics issues and experimental searches in high-energy collisions. New York : Plenum Press, 1990.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Weng, Joanna. Parameterisation of electromagnetic showers and search for large extra dimensions in pp collisions at s=14 TeV. Karlsruhe : Univ.-Verl. Karlsruhe, 2006.

Trouver le texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Zinser, Markus. Search for New Heavy Charged Bosons and Measurement of High-Mass Drell-Yan Production in Proton—Proton Collisions. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-00650-1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Iiyama, Yutaro. Search for Supersymmetry in pp Collisions at √s = 8 TeV with a Photon, Lepton, and Missing Transverse Energy. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-58661-8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Plus de sources

Chapitres de livres sur le sujet "Collision search"

1

Naito, Yusuke, Yu Sasaki, Takeshi Shimoyama, Jun Yajima, Noboru Kunihiro et Kazuo Ohta. « Improved Collision Search for SHA-0 ». Dans Advances in Cryptology – ASIACRYPT 2006, 21–36. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11935230_2.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Wang, Xiaoyun, Hongbo Yu et Yiqun Lisa Yin. « Efficient Collision Search Attacks on SHA-0 ». Dans Advances in Cryptology – CRYPTO 2005, 1–16. Berlin, Heidelberg : Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11535218_1.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Maruyama, Kazuki, et Toshimichi Saito. « A Collision PSO for Search of Periodic Points ». Dans Nonlinear Dynamics of Electronic Systems, 59–67. Cham : Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-08672-9_9.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Cho, Hong-Su, Sangwoo Park, Soo Hak Sung et Aaram Yun. « Collision Search Attack for 53-Step HAS-160 ». Dans Information Security and Cryptology – ICISC 2006, 286–95. Berlin, Heidelberg : Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11927587_24.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

De Cannière, Christophe, Florian Mendel et Christian Rechberger. « Collisions for 70-Step SHA-1 : On the Full Cost of Collision Search ». Dans Selected Areas in Cryptography, 56–73. Berlin, Heidelberg : Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-77360-3_4.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Park, Jung Kyu, et Jaeho Kim. « Collision Avoidance Method for UAV Using A* Search Algorithm ». Dans Advances in Intelligent, Interactive Systems and Applications, 186–93. Cham : Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-02804-6_25.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Devadas, Srinivas, Ling Ren et Hanshen Xiao. « On Iterative Collision Search for LPN and Subset Sum ». Dans Theory of Cryptography, 729–46. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70503-3_24.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Khovratovich, Dmitry, Alex Biryukov et Ivica Nikolic. « Speeding up Collision Search for Byte-Oriented Hash Functions ». Dans Topics in Cryptology – CT-RSA 2009, 164–81. Berlin, Heidelberg : Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-00862-7_11.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Eichlseder, Maria, Florian Mendel et Martin Schläffer. « Branching Heuristics in Differential Collision Search with Applications to SHA-512 ». Dans Fast Software Encryption, 473–88. Berlin, Heidelberg : Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-46706-0_24.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Chailloux, André, María Naya-Plasencia et André Schrottenloher. « An Efficient Quantum Collision Search Algorithm and Implications on Symmetric Cryptography ». Dans Advances in Cryptology – ASIACRYPT 2017, 211–40. Cham : Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70697-9_8.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Actes de conférences sur le sujet "Collision search"

1

Battaglieri, M. « Search for Pentaquarks with CLAS ». Dans XXV PHYSICS IN COLLISION : Proceedings of the XXV International Conference on Physics in Collision. AIP, 2006. http://dx.doi.org/10.1063/1.2173592.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Lin, Jian-Hung, et Keh-Chin Chang. « A Cost-Effective Search of Collision Pairs in Lagrangian Particle Tracking Method ». Dans ASME/JSME/KSME 2015 Joint Fluids Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/ajkfluids2015-32577.

Texte intégral
Résumé :
In the simulation of particle-laden flows, in which the inter-particle collisions have to be considered, using the Eulerian-Lagrangian approach, it is agreed that the search of collision pairs based on the deterministic particle tracking method together with the binary-collision, hard-sphere model is a time consuming job in the computational procedure particularly for the flow laden with a remarkably high number density of particles. A cost-effective algorithm for the particle tracking processes which include solving the equations of motion, searching the collision pairs, and updating the list of neighboring particles’ indices is developed. It is demonstrated in the turbulent, fully developed, particle-laden channel flows that the computational expenditure required for completing the particle tracking processes in a given Lagrangian time step can be optimally made with an approximately linear proportionally to the total number of particles (NPT) by setting the number of Lagrangian cells (Ncell) for computation in accordance with the criterion of NPT / Ncell = O(10°).
Styles APA, Harvard, Vancouver, ISO, etc.
3

Ullrich, Thomas. « Where are we in the search for the Quark Gluon Plasma ? » Dans XXV PHYSICS IN COLLISION : Proceedings of the XXV International Conference on Physics in Collision. AIP, 2006. http://dx.doi.org/10.1063/1.2173594.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Bai, Youjing, Lvqing Yang, Guoxing Zhang et Yezi Xu. « An improved binary search RFID anti-collision algorithm ». Dans 2017 12th International Conference on Computer Science and Education (ICCSE). IEEE, 2017. http://dx.doi.org/10.1109/iccse.2017.8085531.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Yang, Lvqing, Beizhan Wang, Dingzhao Li, Jintao Tang, Yishu Qiu et Jinsheng Lu. « Four slot dynamic binary search anti-collision Algorithm ». Dans 2019 IEEE International Conference on Computation, Communication and Engineering (ICCCE). IEEE, 2019. http://dx.doi.org/10.1109/iccce48422.2019.9010795.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Li, Chao, Wenhua Zeng, Weiwei Lin, Lvqing Yang et Meihong Wang. « An improved multi-ary search based anti-collision algorithm ». Dans 2013 International Conference on Future Computer and Information Technology. Southampton, UK : WIT Press, 2013. http://dx.doi.org/10.2495/icfcit130751.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
7

Gan, Seng Keat, Robert Fitch et Salah Sukkarieh. « Real-time decentralized search with inter-agent collision avoidance ». Dans 2012 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2012. http://dx.doi.org/10.1109/icra.2012.6224975.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Wang, Xinyan, et Lijun Mao. « A RFID Anti-collision Algorithm based on Q-ary Search ». Dans 2018 Joint International Advanced Engineering and Technology Research Conference (JIAET 2018). Paris, France : Atlantis Press, 2018. http://dx.doi.org/10.2991/jiaet-18.2018.70.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Weber, Brian, et Xiaowen Zhang. « Parallel hash collision search by Rho method with distinguished points ». Dans 2018 IEEE Long Island Systems, Applications and Technology Conference (LISAT). IEEE, 2018. http://dx.doi.org/10.1109/lisat.2018.8378028.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Mvoulabolo, Meryle, Tebello N. D. Mathaba et Marcel O. Odhiambo. « Performance analysis of binary search based RFID anti-collision algorithms ». Dans 2019 International Multidisciplinary Information Technology and Engineering Conference (IMITEC). IEEE, 2019. http://dx.doi.org/10.1109/imitec45504.2019.9015841.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.

Rapports d'organisations sur le sujet "Collision search"

1

Jang, Dongwook. Search for MSSM Higgs decaying to tau pairs in ppbar collision at √s = 1.96 TeV at CDF. Office of Scientific and Technical Information (OSTI), mai 2006. http://dx.doi.org/10.2172/892378.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
2

Baranzini, Richard D. Military Support to Law Enforcement and Posse Comitatus : Is the Search for Nontraditional Missions on a Collision Course with Operational Readiness. Fort Belvoir, VA : Defense Technical Information Center, juin 1993. http://dx.doi.org/10.21236/ada266650.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
3

Sekula, Stephen. Search for charged Higgs bosons in the ?+jets final state with pp collision data recorded at s?=8 TeV with the ATLAS experiment. Office of Scientific and Technical Information (OSTI), août 2013. http://dx.doi.org/10.2172/1120936.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
4

Wang, Zhixing. Search for resonance in inclusive and b-tagged dijet mass spectra in proton-proton collision at $\sqrt{s}$ = 13 TeV and constraints on dark matter and other models. Office of Scientific and Technical Information (OSTI), décembre 2020. http://dx.doi.org/10.2172/1764049.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
5

Meder-Marouelli, David. Search for a Light Higgs boson in the channel WH→ eνe b$\bar{b}$ in p$\bar{p}$-collision with $\sqrt{s}$ = 1.96 TeV in the D0 detector of the Tevatron. Office of Scientific and Technical Information (OSTI), juillet 2005. http://dx.doi.org/10.2172/948153.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
6

Tan, Peng, et Nicholas Sitar. Parallel Level-Set DEM (LS-DEM) Development and Application to the Study of Deformation and Flow of Granular Media. Pacific Earthquake Engineering Research Center, University of California, Berkeley, CA, mars 2023. http://dx.doi.org/10.55461/kmiz5819.

Texte intégral
Résumé :
We present a systematic investigation of computational approaches to the modeling of granular materials. Granular materials are ubiquitous in everyday life and in a variety of engineering and industrial applications. Despite the apparent simplicity of the laws governing particle-scale interactions, predicting the continuum mechanical response of granular materials still poses extraordinary challenges. This is largely due to the complex history dependence resulting from continuous rearrangement of the microstructure of granular material, as well as the mechanical interlocking due to grain morphology and surface roughness. X-Ray Computed Tomography (XRCT) is used to characterize the grain morphology and the fabric of the granular media, naturally deposited sand in this study. The Level-Set based Discrete Element Method (LS-DEM) is then used to bridge the granular behavior gap between the micro and macro scale. The LS-DEM establishes a one-to-one correspondence between granular objects and numerical avatars and captures the details of grain morphology and surface roughness. However, the high-fidelity representation significantly increases the demands on computational resources. To this end a parallel version of LS-DEM is introduced to significantly decrease the computational demands. The code employs a binning algorithm, which reduces the search complexity of contact detection from O(n2) to O(n), and a domain decomposition strategy is used to elicit parallel computing in a memory- and communication-efficient manner. The parallel implementation shows good scalability and efficiency. High fidelity LS avatars obtained from XRCT images of naturally deposited sand are then used to replicate the results of triaxial tests using the new, parallel LS-DEM code. The result show that both micro- and macro-mechanical behavior of natural material is well captured and is consistent with experimental data, confirming experimental observation that the primary source of peak strength of sand is the mechanical interlocking between irregularly shaped grains. Specifically, triaxial test simulations with a flexible membrane produce a very good match to experimentally observed relationships between deviatoric stress and mobilized friction angle for naturally deposited sand. We then explore the viability of modeling dynamic problems with a new formulation of an impulse based LS-DEM. The new formulation is stable, fast, and energy conservative. However, it can be numerically stiff when the assembly has substantial mass differences between particles. We also demonstrate the feasibility of modeling deformable structures in the rigid body framework and propose several enhancements to improve the convergence of collision resolution, including a hybrid time integration scheme to separately handle at rest contacts and dynamic collisions. Finally, we extend the impulse-based LS-DEM to include arbitrarily shaped topographic surfaces and exploit its algorithmic advantages to demonstrate the feasibility of modeling realistic behavior of granular flows. The novel formulation significantly improves performance of dynamic simulations by allowing larger time steps, which is advantageous for observing the full development of physical phenomena such as rock avalanches, which we present as an illustrative example.
Styles APA, Harvard, Vancouver, ISO, etc.
7

Fuqiang Wang. SYSTEMATIC STUDIES OF HEAVY ION COLLISIONS TO SEARCH FOR QUARK-GLUON PLASMA. Office of Scientific and Technical Information (OSTI), novembre 2007. http://dx.doi.org/10.2172/920226.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
8

Akimoto, Takashi. Search for third generation vector leptoquarks in 1.96 TeV proton-antiproton collisions. Office of Scientific and Technical Information (OSTI), février 2007. http://dx.doi.org/10.2172/923526.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
9

Martin, Andrew James. A Search for Top Quarks in $\bar{P}P$ Collisions Using Dileptons. Office of Scientific and Technical Information (OSTI), avril 1996. http://dx.doi.org/10.2172/1421746.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
10

Vaca-Alvarez, Francisco Javier. A Search for $\Lambda_b$ in $\pi^-$ a Collisions at 515-GeV/c. Office of Scientific and Technical Information (OSTI), novembre 1995. http://dx.doi.org/10.2172/1423681.

Texte intégral
Styles APA, Harvard, Vancouver, ISO, etc.
Vous pouvez également être intéressé par les bibliographies sur le sujet « Collision search » pour d’autres types de sources :
Articles de revues Thèses Livres
Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!

Vers la bibliographie