Coding Problem Research Articles

Legal problems of the land code applying in Russian Federation

The most important step at the present stage of land reform was the adoption of such basic legislative acts as the Land Code of Russian Federation, the Federal Law “On the Delimitation of State Ownership of Land”, the Federal Law “On the Turnover of Agricultural Land”, the Federal Law “On the transfer of land or land plots from one category to another”, as well as the adoption of other regulatory legal acts in compliance with the specified federal laws. This caused a consistent continuation of the land reform, but no radical shifts in its implementation took place, and, therefore, new amendments are required to the current legislation.

МЕТОДИЧЕСКИЕ ВОЗМОЖНОСТИ ВКЛЮЧЕНИЯ ТЕМЫ «ПОМЕХОУСТОЙЧИВЫЕ КОДЫ РИДА-СОЛОМОНА» В ОБРАЗОВАТЕЛЬНЫЙ ПРОЦЕСС В ПЕДАГОГИЧЕСКОМ ВУЗЕ

In this article we are going to demonstrate how the topic “error correcting codes” can be used in training teachers of mathematics and IT. This topic is useful as teachers will know more about actual problems of information protection. The attempt to improve some shortcomings in scientific literature on Reed-Solomon codes (concerning students’ difficulties in understanding this topic) is presented here. The article describes the example of mathematical method of solving the problem of Reed-Solomon coding and decoding with error correction. Systematic coding is based on code seed, decoding is based on check matrix: this approach helps to avoid some difficulties in calculations.

Research and Application of Template Engine for Web Back-end Based on MyBatis-Plus

Abstract In web development, it takes much time to code for back-end including business logic and interface integration, which is machanized and high-repeated. In order to address the problem in back-end web coding, this paper analyzes the advantages and disadvantages of SSM(Spring, SpringMVC and MyBatis) framework and development pattern of the original and end separation. By integrating the template engine in PHP web development, we achieve the technology of code generation for back-end of web, which benefits for artificial intelligence of web coding and saves the time on software engineering.

Do the procedural forms of preliminary investigation meet the requirements of legal proceedings in the Russian Federation

The article analyzes the modern criminal procedure, confirms the trend of its constant development, which was reflected in the adoption of more than 250 Federal laws that make changes to it after the entry into force of the Criminal Procedure Code of the Russian Federation. At the same time, it is noted that the adoption of some of these Federal laws was due to compromise decisions during the preparation and adoption of the CPC of the Russian Federation. Among the problems of the current Criminal Procedure Code of the Russian Federation that require further legislative improvement are the procedural terms of the investigation, the rules governing the procedure for bringing charges, the introduction of a protocol form of investigation, absentee detention, and a number of others.

Unsupervised Deep Cross-modality Spectral Hashing.

This paper presents a novel framework, namely Deep Cross-modality Spectral Hashing (DCSH), to tackle the unsupervised learning problem of binary hash codes for efficient cross-modal retrieval. The framework is a two-step hashing approach which decouples the optimization into (1) binary optimization and (2) hashing function learning. In the first step, we propose a novel spectral embedding-based algorithm to simultaneously learn single-modality and binary cross-modality representations. While the former is capable of well preserving the local structure of each modality, the latter reveals the hidden patterns from all modalities. In the second step, to learn mapping functions from informative data inputs (images and word embeddings) to binary codes obtained from the first step, we leverage the powerful CNN for images and propose a CNN-based deep architecture to learn text modality. Quantitative evaluations on three standard benchmark datasets demonstrate that the proposed DCSH method consistently outperforms other state-of-the-art methods.

A Probabilistic Model-Based Method With Nonlocal Filtering for Robust Magnetic Resonance Imaging Reconstruction

Existing model-based or data-driven methods have achieved a high-quality reconstruction in compressive sensing magnetic resonance imaging (CS-MRI). However, most methods are designed for a specific type of sampling mask or sampling rate while ignoring the existence of external noise, resulting in poor robustness. In this work, we propose a probabilistic model-based method based on Laplacian scale mixture (LSM) modeling and denoising based approximate message passing (D-AMP) algorithm to address this issue. Sparse coefficients of similar packed patches are modeled with LSM distribution to exploit the nonlocal self-similarity prior of MR image, and a maximum a posterior estimation problem for sparse coding is formulated. It is shown that both hidden scale parameters i.e. variances of sparse coefficients and location parameters can be jointly estimated along with the unknown sparse coefficients via the method of alternating optimization. Moreover, the variance of noise is also iteratively updated based on maximum likelihood estimation. With plug-and-play prior method, the above structured sparse coding procedure can be regarded as a nonlocal filtering operation and be incorporated into D-AMP for MR image reconstruction. Owing to the power of our nonlocal filtering which takes both signal and noise estimation into account, the proposed method not only outperforms many state-of-the-art methods for most situations of observation, but also delivers the best qualitative reconstruction results with finer details and less artifacts in experiments.

Cultural code and ways of its rendering (based on the translation of Abai’s «Wisdom Words» into French)

Modern linguistics is characterized by developing interdisciplinary research, among which the problem of the cultural code of the nation is most clearly revealed. The current paper presents the results of the translation analysis of Abai‘s Words of Wisdom rendered from Kazakh into French and taking into consideration the transfer of the Kazakh cultural code into the French language. A number of general and specific hypotheses concerning the possibilities for rendering the cultural code are put forward in the paper. In modern translation theory the problem of the original text and the target text equivalence has always been a cornerstone. The difficulties were caused by a necessity to render the most important semantic and structural features of the source text in the target language, to adapt the text of the translation to a different linguocultural perception as far as it is possible. Without doubt cultural codes are universal for humanity, but their scope and content in each individual ethnic community, in which they are implemented, are nationally and culturally determined. At the same time cultural code can be modified, simplified or complicated in the course of development, inventions, borrowings from other cultures. The way of thinking, the nature of manifestation of feelings, values and attitudes, ideas about the world and oneself, beliefs, opinions and prejudices also undergo transformation.

Meta-Modern City: the Problem of Authenticity

The aim of the article is to analyze the urban research paradigm that has developed at the turn of the XX and XXI centuries in the works of Western experts and the possibility to use it for domestic research. Methodologically, the author relies on the heritage of the Manchester sociological school, which effectively applied the concepts of actor-network theory to analyze the sociology of a city. The city is considered as a single object complex. Its main characteristics are contingent and contextual. The author analyzes the city as a derivative of stable sets of objects and networks of relations. A change in the components that make up a city leads to a change in the entire object. The article notes that in modern urbanism there is another way of classifying cities not according to the principle of geographical location, economic structure, or national identity, but according to the system of forming networks of relations. The author analyzes the linguistic metaphors system, which is used to describe urban space. The problems of metaphor, code and reading, perception of urban space in the form of text are analyzed. The concept of "language" and "text" allows you to create a system of describing a city as a complex phenomenon. In this case, the constructs "modern", "postmodern", "meta-modern" are presented as a system of grammar and punctuation for interpreting the phenomenon of the city. The article notes the difficulties of using the characteristics of a postmodernist and metamodernist city for domestic research. The author suggests that the development of the domestic city in the twentieth century took place according to the scenario of a more radical modernism. As a result, we got a post-Soviet city with a different rationality, which is combined with the modernist principles of architecture and urban planning. The article provides examples of the semiotic analysis of architectural objects. The author concludes that the mental image of the city restructures the physical space, turning it into a personalized network of human life relations.

An Adaptive Distributed Compressed Video Sensing Algorithm Based on Normalized Bhattacharyya Coefficient for Coal Mine Monitoring Video

Compared with traditional video surveillance systems, wireless video sensor systems are more suitable for emergency application scenarios, such as underground coal mine disaster rescue, due to their low power consumption and rapid deployment. Considering the limited computing power and transmission bandwidth of video sensor nodes, we propose an adaptive compression and hybrid multiple hypothesis based residual reconstruction algorithm based on normalized Bhattacharyya coefficient (NBCAC-MHRR) to solve the high efficiency video coding (HEVC) problem in underground coal mines. First, a low-complexity adaptive sampling rate allocation method is performed on the encoding side. Second, by integrating the background subtraction idea, we combine the high-quality reconstruction of the foreground with the multi-hypothesis residual reconstruction of the background to improve the overall reconstruction effect of the video sequence. Simulation results show that the proposed algorithm can achieve higher reconstruction quality and efficiency than previous methods, especially in underground coal mine application scenarios.

A Cost-Effective Algorithm for Selecting Optimal Bandwidth to Clear Malicious Codes

Malicious code has posed a severe threat to modern society. Delivering antivirus program to networks is an important task of a cybersecurity company. As the bandwidth resource in a company is limited and precious, cybersecurity companies have to make a tradeoff between the impact(i.e. the economic loss) of malicious codes and the bandwidth assigned to transmit the antivirus programs. This paper addresses the malicious code and bandwidth tradeoff(MCBT) problem. By developing a novel malicious code and antivirus program interacting model, the total loss, which is the sum of the bandwidth usage fee and the economic loss, is quantified. On this basis, the MCBT problem is modelled as a constrained optimization problem that we refer to as the MCBT model, where the independent variable stands for bandwidth, and the objective function stands for the total loss. Some optimal bandwidth is determined by solving the MCBT model. Based on this, we propose a heuristic algorithm named DOWNHILL, which outperforms random strategies. Finally, the influence of some factors on the optimal bandwidth and the corresponding optimal total loss is uncovered through numerical simulations. To our knowledge, this is the first time the MCBT problem is treated in this way.

Research on insulation joint damage of the station track circuit in high speed and heavy load condition

In high-speed and heavy-load operation environment, the insulation joints of the station track circuit are damaged in many stations, which caused the carrier information of the adjacent sections to interfere with each other, endangered the safety of the train and reduced the reliability of the track circuit. In order to solve the incorrect code problem caused by the insulation joint breakage, we analysed the insulation damage situation for the station track circuit and the structural principle of BES choke transformer. Then the different structures of the insulation damage protection circuit are given and the relevant parameters are obtained, and verifying the anti-interference ability of the new BES choke transformer. Finally, a complete four-terminal network model of the new BES choke transformer is established. And its four-terminal network parameters are calculated by matlab simulation, which provides the theoretical basis for establishing the track circuit complete system.

Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction

The main problem of constant-dimension subspace coding is to construct constant-dimension codes (CDCs) with the maximum possible cardinality. Lifting Ferrers diagram codes is an effective way to construct CDCs. In addition, the discovery of linkage construction allows to construct many CDCs, i.e., lower bounds. In this paper, we combine the two methods of construction and obtain some new lower bounds of CDCs for small parameters.

Deep discrete hashing with pairwise correlation learning

Hashing technology plays an important role in large-scale visual search due to its low memory and fast retrieval speed. Most existing deep hashing approaches first leverage the continuous relaxation strategy to learn continuous approximate codes, and then transform them into discrete hash codes by separating quantization operations, which results in the suboptimal problem of hash codes and ultimately affects the performance of image retrieval. To solve this problem, we propose a novel deep discrete hashing approach with pairwise labels, namely Pairwise Correlation Discrete Hashing (PCDH), to leverage the pairwise correlation of deep features and semantic supervised information to directly guide discrete hashing codes learning. Firstly, we integrate discrete hash code learning and deep features learning in a unified network framework, which can utilize the semantic supervision to guide discrete hash codes learning. Secondly, we design a novel pairwise correlation constraint to perform pairwise correlation learning of deep features. Thirdly, we develop a novel pairwise construction module to mine good pairwise samples for discrete hash codes learning. Extensive experimental results show that the proposed PCDH approach achieves superior performance over other recent state-of-the-art hashing approaches.

Explicit Constructions of MDS Self-Dual Codes

In this paper, we study self-dual codes over finite fields using tools from algebraic function fields in one variable. An algebraic geometry code of length n is defined using two divisors G and D = P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> + ⋯ + P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> . We characterize self-orthogonality of the genus zero code in terms of the divisors G, D and the value of a well-chosen derivative polynomial at points (P <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sub> ) <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1≤i≤n</sub> . We explore the existence problem of MDS self-dual codes in the odd characteristic case, and we explicitly construct families of new MDS self-dual codes.

On the Optimal Broadcast Rate of the Two-Sender Unicast Index Coding Problem With Fully-Participated Interactions

The problem of two-sender unicast index coding consists of two senders and a set of receivers. Each receiver demands a unique message not demanded by any other receiver and has a subset of messages as its side information. Every demanded message is available with at least one of the senders. The senders avail the knowledge of the side information at all the receivers to reduce the total number of transmissions required to satisfy the demands of all the receivers. The objective is to find the minimum total of number of transmissions per message length (known as the optimal broadcast rate with finite length messages) and its limiting value as the message length tends to infinity (called the optimal broadcast rate). Achievable broadcast rates are provided for a class of the two-sender unicast index coding problem based on a special graph coloring technique called two-sender graph coloring. This result illustrates the utility of graph products in the two-sender unicast index coding problem for the first time in the literature. For another class, achievable broadcast rates are provided based on the optimal broadcast rates of three single-sender sub-problems with finite message length. This employs a code construction for the two-sender unicast index coding problem using optimal codes (including non-linear codes) of the sub-problems. Optimal broadcast rates are provided for a special class of the TUICP for which only an upper bound was known prior to this work. The optimal broadcast rates presented in this work also consider non-linear coding schemes at the two senders.

Code of Ethics for Teachers in Islamic Education Perspective Muhammad Athiyah Al-Abrasyi

Education can be simply interpreted as an effort to shape human personality in accordance with the values ​​and codes of ethics contained in society and the country. One of the most important components in the learning process is educators and students. Along with the times, there is a shift in the pattern of teacher and student relations; economic values ​​have driven many policies, the appreciation of students towards teachers has decreased, the price of teacher's work is higher, and the teacher's appreciation for him has been lower. Considering the urgency of the teacher's role in the education process, many scholars wrote about the obligations, traits or tasks that the teacher and students had to have. Based on this background, the writer formulates the problem of the teacher's code of ethics in the perspective of Islamic education, Muhammad Athiyah Al-abrasyi. This research is a qualitative descriptive study with the type of library research. The results of this study include personal and professional aspects. The code of ethics of teachers in Islamic education proposed by Muhammad Athiyah al-Abrasyi includes: 1. The code of ethics of teachers relating to themselves; a. Be zuhud, b. Clean from sin and reprehensible qualities. 2. The teacher's code of ethics relating to students and fellow teachers; a. Be wise and firm, b. Forgiving and patient, c. Having dignity and self-esteem, d. Loving students is like loving their own children, e. Knowing students' habits. 3. Code of ethics for teachers related to their duties; a. Sincere at work, b. Mastering the field of study, c. Be able to create active communication between educators and students.

Tight Information Theoretic Converse Results for Some Pliable Index Coding Problems

This paper studies the Pliable Index CODing problem (PICOD), which models content-type distribution networks. In the PICOD$(t)$ problem there are $m$ messages, $n$ users and each user has a distinct message side information set, as in the classical Index Coding problem (IC). Differently from IC, where each user has a pre-specified set of messages to decode, in the PICOD$(t)$ a user is "pliable" and is satisfied if it can decode any $t$ messages that are not in its side information set. The goal is to find a code with the shortest length that satisfies all the users. This flexibility in determining the desired message sets makes the PICOD$(t)$ behave quite differently compared to the IC, and its analysis challenging. This paper mainly focuses on the \emph{complete--$S$} PICOD$(t)$ with $m$ messages, where the set $S\subset[m]$ contains the sizes of the side information sets, and the number of users is $n=\sum_{s\in S}\binom{m}{s}$, with no two users having the same side information set. Capacity results are shown for: (i) the \emph{consecutive} complete--$S$ PICOD$(t)$, where $S=[s_{\min}:s_{\max}]$ for some $0 \leq s_{\min} \leq s_{\max} \leq m-t$, and (ii) the \emph{complement-consecutive} complete--$S$ PICOD$(t)$, where $S=[0:m-t]\backslash[s_{\min}:s_{\max}]$, for some $0 < s_{\min} \leq s_{\max} < m-t$. The novel converse proof is inspired by combinatorial design techniques and the key insight is to consider all messages that a user can eventually decode successfully, even those in excess of the $t$ required ones. This allows one to circumvent the need to consider all possible desired message set assignments at the users in order to find the one that leads to the shortest code length. In addition, tight converse results are also shown for those PICOD$(1)$ with circular-arc network topology hypergraph.

Hadamard matrices from Goethals — Seidel difference families with a repeated block

Purpose: To construct Hadamard matrices by using Goethals — Seidel difference families having a repeated block, generalizingthe so called propus construction. In particular we construct the first examples of symmetric Hadamard matrices of order 236.Methods: The main ingredient of the propus construction is a difference family in a finite abelian group of order v consisting offour blocks (X1, X2, X3, X4) where X1 is symmetric and X2 X3. The parameters (v; k1, k2, k3, k4; λ) of such family must satisfythe additional condition ki  λ  v. We modify this construction by imposing different symmetry conditions on some of theblocks and construct many examples of Hadamard matrices of this kind. In this paper we work with the cyclic group Zv of order v.For larger values of v we build the blocks Xi by using the orbits of a suitable small cyclic subgroup of the automorphism groupof Zv. Results: We continue the systematic search for symmetric Hadamard matrices of order 4v by using the propus construction.Such searches were carried out previously for odd v  51. We extend it to cover the case v53. Moreover we construct thefirst examples of symmetric Hadamard matrices of order 236. A wide collection of symmetric and skew-symmetric Hadamardmatrices was obtained and the corresponding difference families tabulated by using the symmetry properties of their blocks.Practical relevance: Hadamard matrices are used extensively in the problems of error-free coding, compression and masking ofvideo information. Programs for search of symmetric Hadamard matrices and a library of constructed matrices are used in themathematical network Internet together with executable on line algorithms.

Minimum connected dominating sets in heterogeneous 3D wireless ad hoc networks

The Minimum Connected Dominating Set (MCDS) problem is a fundamental problem in wireless ad hoc networks. The majority of approximation algorithms for this NP-hard problem follow a two-phased approach: The first phase is to construct a Maximal Independent Set (MIS), and the second phase is to connect the nodes in it. The upper bounds of the MISs play a key role in the design of constant approximation MCDS algorithms. This paper considers this problem for 3D heterogeneous ad hoc networks, where the transmission ranges of nodes are allowed to be different. We prove upper bounds of MISs with two classical mathematical problems, the Spherical Code Problem and the Sphere Packing Problem. When the transmission range ratio (the ratio of the maximum transmission range over the minimum transmission range) is (1, 1.023], (1.023, 1.055], (1.055, 1.082], ..., we reduce the MIS upper bounds from the best-known results 22|OPT|+1,23|OPT|+1,24|OPT|+1, ..., to 12|OPT|+1,13|OPT|+1,14|OPT|+1, ..., where OPT is an optimal CDS and |OPT| is the size of OPT. With the bounds of MISs, the approximation ratio of MCDS algorithms can be reduced from 25.02 to 16.02 in heterogeneous 3D wireless ad hoc networks.

Markov Chain Monte Carlo Methods for Lattice Gaussian Sampling: Convergence Analysis and Enhancement

Sampling from lattice Gaussian distribution has emerged as an important problem in coding, decoding, and cryptography. In this paper, the classic Gibbs algorithm from Markov chain Monte Carlo (MCMC) methods is demonstrated to be geometrically ergodic for lattice Gaussian sampling, which means that the Markov chain arising from it converges exponentially fast to the stationary distribution. Meanwhile, the exponential convergence rate of the Markov chain is also derived through the spectral radius of the forward operator. Then, a comprehensive analysis of the convergence rate is carried out, and two sampling schemes are proposed to further enhance the convergence performance. The first one, referred to as a Metropolis-within-Gibbs (MWG) algorithm, improves the convergence by refining the state space of the univariate sampling. The second is a blocked strategy of the Gibbs algorithm, which performs sampling over multivariates at each Markov move, and is shown to yield a better convergence rate than the traditional univariate sampling. In order to perform blocked sampling efficiently, the Gibbs–Klein (GK) algorithm is proposed, which samples block by block using the Kleins algorithm. Furthermore, the validity of the GK algorithm is demonstrated by showing its ergodicity. Simulation results based on MIMO detections are presented to confirm the convergence gain brought by the proposed Gibbs sampling schemes.