Technology of differentiated training bases of algorithmization and programming on the first course of the university on the basis of the DL.GSU.BY system of distance learning

The article describes the technology of teaching text-based programming on the basis of the DL.GSU.BY website. The main advantages of the technology include: “zero entry threshold”, training adapted to the student, many years of practical experience, efficiency, scalability. The following issues are consistently considered in the article: idealized goal setting; the use by students of a programming language of their choice from a variety of modern programming languages when performing practical tasks in the discipline; a clear verification of goal achievement; blended learning; effective personalization of the educational process; non-standard organizational and technical decisions; effectiveness of training. The idealized goal setting includes the need to teach students the following: algorithmic reformulation of the problem statement; knowledge of a set of basic language constructs, as well as basic builtin procedures and functions; the ability to use basic algorithms on one-dimensional and two-dimensional arrays, sets of plane points, lines, queues; the ability to develop and debug new algorithms. Effective personalization of the educational process is provided with the help of such techniques: at each lesson, the student is offered a choice of activities that correspond to current level of his training; automatic verification of solutions is provided with the test assignment service; the system of automatic differentiated learning is used.

The Technology of Differentiated Instruction in Text Programming in Elementary School Based on the Website dl.gsu.by

The technology of teaching text-based programming on the basis of the website DL.GSU.BY is described. The main advantages of the technology include: “zero entry threshold”, training adapted to the pupil, many years of practical experience, effectiveness and scalability

Mutually unbiased bases containing a complex Hadamard matrix of Schmidt rank three

Constructing four six-dimensional mutually unbiased bases (MUBs) is an open problem in quantum physics and measurement. We investigate the existence of four MUBs including the identity, and a complex Hadamard matrix (CHM) of Schmidt rank three. The CHM is equivalent to a controlled unitary operation on the qubit-qutrit system via local unitary transformation I 2 ⊗ V and I 2 ⊗ W . We show that V and W have no zero entry, and apply it to exclude constructed examples as members of MUBs. We further show that the maximum of entangling power of controlled unitary operation is log 2 3 ebits. We derive the condition under which the maximum is achieved, and construct concrete examples. Our results describe the phenomenon that if a CHM of Schmidt rank three belongs to an MUB then its entangling power may not reach the maximum.

The use of jet penetrators for movement in the lunar soil

The possibility of using penetrators for researching the subsurface layers of the moon is considered. Possible options for launching such penetrators are indicated, from the way the launch is carried out depends on the depth of penetration into the regolith. It was found that when the propulsion system has less traction than the static resistance of the lunar soil, movement does not occur if the launch of the penetrator is accomplished from the surface with zero entry speed. The dependences are given that permit calculating with sufficient accuracy the penetrator mass, penetration depth and the resulting overloads. The depth of penetration of the inertial penetrator depends on its mass-dimensional qualities and the speed of entry into the soil, which is limited by the level of permissible overloads. The use of a solid fuel engine on the penetrator facilitates increasing the allowable speed of the penetrator into the ground by reducing the overloads acting on it, and thereby increasing the penetration depth.

PENERAPAN ZERO ENTRY HACKING DIDALAM SECURITY MISCONFIGURATION PADA VAPT (VULNERABILITY ASSESSMENT AND PENETRATION TESTING)

Serangan terhadap sistem komputer dari waktu ke waktu semakin meningkat dan semakin canggih. Perusahaan dituntut untuk memastikan Cyber Security yang aman untuk melindungi dari serangan hacker. Penelitian ini, Mengimplementasikan VAPT (Vulnerability Assessment and Penetration Testing) menggunakan metode ZEH (Zero Entry Hacking)Penetration Testing Methodology untuk mengetahui kerentanan SMB (server Message block) dan RDP(remote desktop) pada server yang dapat dieksploitasi serta memberi penyerang hak akses terhadap server yang mampu memanipulasi data pada server.

Analysis of hard-thresholding for distributed compressed sensing with one-bit measurements

A simple hard-thresholding operation is shown to be able to uniformly recover $L$ signals $\textbf{x}_1,...,\textbf{x}_L \in{\mathbb{R}}^n$ that share a common support of size $s$ from $m = \mathscr{O}(s)$ one-bit measurements per signal if $L \geqslant \ln (en/s)$. This result improves the single signal recovery bounds with $m = \mathscr{O}(s\ln (en/s))$ measurements in the sense that asymptotically fewer measurements per non-zero entry are needed. Numerical evidence supports the theoretical considerations.

TECHNOLOGY OF DIFFERENTIATED TEACHING TEXT PROGRAMMING IN PRIMARY SCHOOL ON THE BASIS OF SITE DL.GSU.BY

The article describes the technology of learning text programming in primary school based on the site DL.GSU.BY. The key features of the technology are the following: zero entry threshold; text programming propaedeutics; developing, interesting, differentiated, task-oriented learning; minimalist approach to the theory; conducting regional programming Olympiads for pupils of grades I–IV; preparing primary school students for participation in Olympiads for students of V—VIII grades; presence of tasks on school, Olympiad and informatics mathematics; contests which motivate to permanent classes; many years of practical experience; practice-proven learning scalability; effectiveness; low requirements for professional qualifications of the teacher; availability of an accelerated course of studying; support the transition to learning C++.

Penerapan Sparse Principal Component Analysis dalam Menghasilkan Matriks Loading yang Sparse

Sparse Principal Component Analysis (Sparse PCA) is one of the development of PCA. Sparse PCA modifies new variables as a linier combination of p old variables (original variable) which is yielded by PCA method. Modifying new variables is conducted by producing a loading yang sparse matrix, such that old variable which is not effective (value of loading is zero) able be exit from PCA. In this study, Sparse PCA method was applied on data of Indonesia Poverty population in 2015, that contains 13 variables and 34 observation with variable reduction such that yields 4 (four) new variables, which can explain 80.1% of total variance data. This study show, the loading matrix that has been yielded by using Sparse PCA method to become sparse with there exist 11 elements (loading value) zero entry of matrix, such that the model that has been produced to be simpler and easy to be interpreted. Keywords: Principal Component Analysis, Sparse Principal Component Analysis, reduksi dimensi, matriks loading yang sparse Abstrak Sparse Principal Component Analysis (Sparse PCA) merupakan salah satu pengembangan dari metode PCA. Sparse PCA memodifikasi variabel-variabel baru yang merupakan kombinasi linear dari variabel lama (variabel asli) yang dihasilkan oleh metode PCA. Pemodifikasian variabel baru ini dilakukan dengan dengan menghasilkan matriks loading yang sparse sehingga variabel lama yang tidak efektif (memiliki nilai loading sama dengan nol) dapat dikeluarkan dari model PCA. Pada penelitian ini, metode Sparse PCA diterapkan pada data Indikator Kemiskinan Penduduk Indonesia Tahun 2015 yang memuat 13 variabel dan 34 observasi dengan reduksi variabel menghasilkan 4 (empat) variabel baru yang telah mampu menjelaskan 80,1% dari total variansi data. Hasil penelitian menunjukkan, matriks loading yang dihasilkan menggunakan metode Sparse PCA menjadi sparse dengan terdapat 11 elemen (nilai loading) matriks bernilai nol sehingga model yang dihasilkan menjadi lebih sederhana dan mudah untuk diinterpretasikan. Kata Kunci: Principal Component Analysis, Sparse Principal Component Analysis, reduksi dimensi, matriks loading yang sparse