Search results for: PARTICLE COLLISION

• PARTICLE & PARTICLE SYSTEMS CHARACTERIZATION

  Journals

  ISSN: 0934-0866 , eISSN: 1521-4117

• Tomasz Wąsowicz dr hab.

  People

  Instytut Fizyki i Informatyki Stosowanej, Zakład Spektroskopii Układów Złożonych

  Tomasz Wąsowicz's research was first related to high-resolution atomic spectroscopy and focused on measurements and analysis of the transition probabilities of the forbidden lines, the hyperfine and isotopic structure of spectral lines of heavy elements, Stark effect in the helium atom. Tomasz Wąsowicz currently studies physicochemical processes occurring during interactions of various forms of radiation with atoms and molecules...

• Particles

  Journals

  eISSN: 2571-712X

• Ship Collision Risk Assessment Based on Collision Detection Algorithm

  Publication

  • D. Liu
  • G. Shi

  - IEEE Access - Year 2020

  Full text to download in external service

• Decision Support Based on Optimal Collision Avoidance Path and Collision Risk

  Publication

  • D. Liu
  • G. Shi
  • W. Li

  - Year 2018

  Full text to download in external service

• Collision-Free Network Exploration

  Publication

  • J. Czyzowicz
  • D. Dereniowski
  • L. Gąsieniec
  • R. Klasing
  • A. Kosowski
  • D. Pająk

  - Year 2014

  A set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...

  Full text to download in external service

• Collision-free network exploration

  Publication

  • J. Czyzowicz
  • D. Dereniowski
  • L. Gąsieniec
  • R. Klasing
  • A. Kosowski
  • D. Pająk

  - JOURNAL OF COMPUTER AND SYSTEM SCIENCES - Year 2017

  Mobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...

  Full text available to download

• A ship domain-based model of collision risk for near-miss detection and Collision Alert Systems

  Publication

  • R. Szłapczyński
  • J. Szłapczyńska

  - RELIABILITY ENGINEERING & SYSTEM SAFETY - Year 2021

  The paper presents a new model of ship collision risk, which utilises a ship domain concept and the related domain-based collision risk parameters. An encounter is here described by five variables representing: degree of domain violation (DDV), relative speed of the two vessels, combination of the vessels’ courses, arena violations and encounter complexity. As for the first three variables, their values can be directly computed...

  Full text available to download

• Computational Particle Mechanics

  Journals

  ISSN: 2196-4378 , eISSN: 2196-4386

• LASER AND PARTICLE BEAMS

  Journals

  ISSN: 0263-0346 , eISSN: 1469-803X