Programs written in C# in the mathematical logic course

Mathematical logic is included in the curriculum of students of high schools and colleges in all fields related to microprocessors and programming. In this paper we describe a program in C#, developed for a mathematical logic course. Targets are set for improving the program.Математическая логика входит в программу обучения студентов вузов и колледжей по всем направлениям, связанным с микропроцессорами и программированием. В настоящей работе описывается программа на языке С#, разработанная для курса математической логики. Поставлены задачи для совершенствования программ

Controlling the beginning of viewing the datagridview objects inc + + and c # languages

The IT-students' teaching program includes the "Object-oriented programming" training course. This course studying involves the development of window applications using the Windows Forms Application template and the DataGridView control element. Some approaches of working with DataGridView are describedВ программу обучения студентов по направлениям, связанным с информатикой, входит курс «Объектно-ориентированное программирование». Изучение этого курса предполагает разработку оконных приложений с использованием шаблона Windows Forms Application и элемента управления DataGridView. Описаны некоторые приемы работы с DataGridVie

Once More About the Possibility of Determining the Local Electron Concentration by the Dispersion Method with the Help of AES and on New Ionization Maxima in the Ionosphere

Reliability of ionospheric density measurements by satellites using dispersion metho

Websites development and maintenance technology

The student training program in courses related to the computer sciences, includes laboratory classes, using a server running Unix-like operating systems. However, methods and tools for the labs for the "Operating Systems" courses and WEB-technologies courses are differentВ программу обучения студентов по направлениям, связанным с информатикой, входят лабораторные занятия, использующие сервер под управлением Unix-подобных операционных систем. Однако методы и инструменты для лабораторных занятий по курсам «Операционные системы» и WEB-технологии различн

Experimental Signatures of Critically Balanced Turbulence in MAST

Beam Emission Spectroscopy (BES) measurements of ion-scale density fluctuations in the MAST tokamak are used to show that the turbulence correlation time, the drift time associated with ion temperature or density gradients, the particle (ion) streaming time along the magnetic field and the magnetic drift time are consistently comparable, suggesting a "critically balanced" turbulence determined by the local equilibrium. The resulting scalings of the poloidal and radial correlation lengths are derived and tested. The nonlinear time inferred from the density fluctuations is longer than the other times; its ratio to the correlation time scales as $\nu_{*i}^{-0.8\pm0.1}$, where $\nu_{*i}=$ ion collision rate/streaming rate. This is consistent with turbulent decorrelation being controlled by a zonal component, invisible to the BES, with an amplitude exceeding the drift waves' by $\sim \nu_{*i}^{-0.8}$.Comment: 6 pages, 4 figures, submitted to PR

Planet Packing Revisited

Ross Eckler discusses a problem in his article Planet Packing in the May 2001 Word Ways: given a list of words, such as the names of the planets, how efficiently can they be packed into a single string of characters so that each word on the list can be read off left to right (but not necessarily contiguously)? He hypothesizes there is no guarantee that any algorithm will end up with a minimum string. Since the design and analysis of algorithms has been my area of research for some 25 years, this caught my attention. Informally, an algorithm is a terminating procedure that could be coded as a computer program. (However, the procedure in the Planet Packing article does not contain enough tie-breaking rules to qualify as an algorithm)

Restricted infinitesimal deformations of restricted simple Lie algebras

We compute the restricted infinitesimal deformations of the restricted simple Lie algebras over an algebraically closed field of characteristic different from 2 and 3.Comment: 15 pages; final version, to appear in Journal of Algebra and Its Application