نتایج جستجو برای: detector system

تعداد نتایج: 2274045  

2010
A. Kotynia

Efficient charged particle tracking and high momentum resolution are central performance requirements of the CBM Silicon Tracking System (STS). The aim of the ongoing layout studies is to design a highly granular and lowmass detector system which can track up to 1000 charged particles that are typically generated in one central Au+Au collision at 25 GeV/u projectile energy. A low-mass detector ...

Journal: :J. Visual Communication and Image Representation 2005
Étienne Vincent Robert Laganière

This paper proposes a new feature point detector which uses a wedge model to characterize corners by their orientation and angular width. This detector is compared to two popular feature point detectors: the Harris and SUSAN detectors, on the basis of some defined quality attributes. It is also shown how feature points between widely separated views can be matched by using the information provi...

2011
C. Ponchut

A 2D photon-counting X-ray detector system with 1.4 kHz frame rate and 55 μm spatial resolution has been developed and commissionned on ESRF beamlines. The system called MAXIPIX (Multichip Area X-ray detector based on a photon-counting PIXel array) consists of a detector module implementing up to five MEDIPIX-2 or TIMEPIX photon-counting readout chips, a custom readout interface board and a Lin...

مولوی, علی‌اصغر,

 In this paper, an algorithm base on Monte Carlo simulation for pileup effect in gamma spectrum of a detection system is presented whose its code was written in FORTRAN language. The code can be run in paralayzable and nonparalazable mode to obtain the pileup distortion and value of pulses pileup for any detection system. The result show, that the computed spectrum of 137Cs is in good agreement...

ژورنال: سنجش و ایمنی پرتو 2016

One of the most important instruments in gamma ray spectroscopy is HPGe detector. Concept of virtual point detector was considered for Ge(Li) detector. On the basis of this concept, there is a point inside a Ge detector that can be regarded as a fictitious point detector hosting all the interactions. If there is really a point whose response can be considered similar to that of the whole real b...

Journal: :J. Signal and Information Processing 2011
Rabi N. Panda Nihar Panda Siba Prasada Panigrahi Rashmi R. Mohanty Manoj K. Sahu Himanshu S. Sahu Anupama Majhi Umesh C. Mishra

This paper develops a reduced complexity quasi-1D detector for optical storage devices and digital communication system. Superior performance of the proposed detector is evidenced by simulation results.

Journal: :J. Parallel Distrib. Comput. 2005
Carole Delporte-Gallet Hugues Fauconnier Rachid Guerraoui Petr Kuznetsov

This paper defines the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem. This failure detector, which we call the trusting failure detector, and which we denote by T , is strictly weaker than the perfect failure detector P but strictly stronger than the eventually perfect failure detector P . The pa...

1994
J. A. Jones

During the year of 2007, the Large Hadron Collider (LHC) and its four main detectors will begin operation with a view to answering the most pressing questions in particle physics. However before one can analyse the data produced to find the rare phenomena being looked for, both the detector and readout electronics must be thoroughly tested to ensure that the system will operate in a consistent ...

2002
Felix C. Freiling Stefan Pleisch

This paper investigates the amount of information about failures needed to solve the predicate detection problem in asynchronous systems with crash failures. In particular, we show that predicate detection cannot be solved with traditional failure detectors, which are only functions of failures. In analogy to the definition of failure detectors, we define a failure detection sequencer, which ca...

1999
Marcos K. Aguilera Sam Toueg Borislav Deianov

Uniform Reliable Broadcast (URB) is a communication primitive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent paper [HR99] uses Knowledge Theory to determine what failure detectors are necessary to implement this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit this ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید