اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDatabase and Channel Access on the VEPP-4
51
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The VEPP-4 control system was designed almost 20 years ago as CAMAC-based distributed control system. Today the main peculiarity of the upgraded VEPP-4 control system is the employment of obsolete CAMAC-embedded 24-bit Odrenok computers in the middle (process) level. The communication software is developed to provide an effective interaction between user (operator) applications on the high level and executive programs in the middle level. The communication software is Linux-based and includes the Application Server and Device Servers. The Application Server provides channel and database access for user applications. The Device Servers provide interaction with the hardware. The backend database server is based on PostgreSQL. This paper describes the structure of the VEPP-4 control system database and data/channel access procedures.
قيم البحث
اقرأ أيضاً
The control system of the VEPP-4 facility was designed more than fifteen years ago and based on the home-developed CAMAC-embedded minicomputers Odrenok [1]. Five years ago, all computers were connected via Ethernet network. This step allowed us to fo
rce an integration of PCs into the VEPP-4 control system. This paper reviews new tools running on the PCs under Linux. The beam diagnostics tool described in this paper provides the data about position and dimensions of e-/e+ beams from CCD matrix controller via 100-Mbit Ethernet. The next tool provides measuring of beam energy at the VEPP-4M collider using a well-known method of resonance depolarization by the observation of the polarization degree on the effect of internal scattering of particles. Data visualization tools are based on CERN ROOT framework. Hardware and software aspects of the systems are presented in this paper.
In this paper we introduce the two-user asynchronous cognitive multiple access channel (ACMAC). This channel model includes two transmitters, an uninformed one, and an informed one which knows prior to the beginning of a transmission the message whic
h the uninformed transmitter is about to send. We assume that the channel from the uninformed transmitter to the receiver suffers a fixed but unknown delay. We further introduce a modified model, referred to as the asynchronous codeword cognitive multiple access channel (ACC-MAC), which differs from the ACMAC in that the informed user knows the signal that is to be transmitted by the other user, rather than the message that it is about to transmit. We state inner and outer bounds on the ACMAC and the ACC-MAC capacity regions, and we specialize the results to the Gaussian case. Further, we characterize the capacity regions of these channels in terms of multi-letter expressions. Finally, we provide an example which instantiates the difference between message side-information and codeword side-information.
The beam energy measurement system for the VEPP-2000 electron-positron collider is described. The method of Compton backscattering of $CO$ laser photons on the electron beam is used. The relative systematic uncertainty of the beam energy determinatio
n is estimated as 6cdot10^{-5}. It was obtained through comparison of the results of the beam energy measurements using the Compton backscattering and resonance depolarization methods.
It is well known that CS can boost massive random access protocols. Usually, the protocols operate in some overloaded regime where the sparsity can be exploited. In this paper, we consider a different approach by taking an orthogonal FFT base, subdiv
ide its image into appropriate sub-channels and let each subchannel take only a fraction of the load. To show that this approach can actually achieve the full capacity we provide i) new concentration inequalities, and ii) devise a sparsity capture effect, i.e where the sub-division can be driven such that the activity in each each sub-channel is sparse by design. We show by simulations that the system is scalable resulting in a coarsely 30-fold capacity increase.
In the scalar dirty multiple-access channel, in addition to Gaussian noise, two additive interference signals are present, each known non-causally to a single transmitter. It was shown by Philosof et al. that for strong interferences, an i.i.d. ensem
ble of codes does not achieve the capacity region. Rather, a structured-codes approach was presented, that was shown to be optimal in the limit of high signal-to-noise ratios, where the sum-capacity is dictated by the minimal (bottleneck) channel gain. In this paper, we consider the multiple-input multiple-output (MIMO) variant of this setting. In order to incorporate structured codes in this case, one can utilize matrix decompositions that transform the channel into effective parallel scalar dirty multiple-access channels. This approach however suffers from a bottleneck effect for each effective scalar channel and therefore the achievable rates strongly depend on the chosen decomposition. It is shown that a recently proposed decomposition, where the diagonals of the effective channel matrices are equal up to a scaling factor, is optimal at high signal-to-noise ratios, under an equal rank assumption. This approach is then extended to any number of transmitters. Finally, an application to physical-layer network coding for the MIMO two-way relay channel is presented.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
