Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: Code Construction Networks.
Artykuły w czasopismach na temat „Code Construction Networks”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „Code Construction Networks”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.
1
Skachek, Vitaly. "Recursive Code Construction for Random Networks". IEEE Transactions on Information Theory 56, nr 3 (marzec 2010): 1378–82. http://dx.doi.org/10.1109/tit.2009.2039163.
Pełny tekst źródła
2
Sanna, Michele, i Ebroul Izquierdo. "A Survey of Linear Network Coding and Network Error Correction Code Constructions and Algorithms". International Journal of Digital Multimedia Broadcasting 2011 (2011): 1–12. http://dx.doi.org/10.1155/2011/857847.
Pełny tekst źródłaStreszczenie:
Network coding was introduced by Ahlswede et al. in a pioneering work in 2000. This paradigm encompasses coding and retransmission of messages at the intermediate nodes of the network. In contrast with traditional store-and-forward networking, network coding increases the throughput and the robustness of the transmission. Linear network coding is a practical implementation of this new paradigm covered by several research works that include rate characterization, error-protection coding, and construction of codes. Especially determining the coding characteristics has its importance in providing the premise for an efficient transmission. In this paper, we review the recent breakthroughs in linear network coding for acyclic networks with a survey of code constructions literature. Deterministic construction algorithms and randomized procedures are presented for traditional network coding and for network-control network coding.
3
Zhao, Xubo. "An efficient basic convolutional network code construction algorithm on cyclic networks". AEU - International Journal of Electronics and Communications 67, nr 12 (grudzień 2013): 1072–78. http://dx.doi.org/10.1016/j.aeue.2013.06.010.
Pełny tekst źródła
4
Abbas, Huda Saleh, Mark A. Gregory i Michael W. Austin. "A New Prime Code for Synchronous Optical Code Division Multiple-Access Networks". Journal of Computer Networks and Communications 2018 (2018): 1–11. http://dx.doi.org/10.1155/2018/3192520.
Pełny tekst źródłaStreszczenie:
A new spreading code based on a prime code for synchronous optical code-division multiple-access networks that can be used in monitoring applications has been proposed. The new code is referred to as “extended grouped new modified prime code.” This new code has the ability to support more terminal devices than other prime codes. In addition, it patches subsequences with “0s” leading to lower power consumption. The proposed code has an improved cross-correlation resulting in enhanced BER performance. The code construction and parameters are provided. The operating performance, using incoherent on-off keying modulation and incoherent pulse position modulation systems, has been analyzed. The performance of the code was compared with other prime codes. The results demonstrate an improved performance, and a BER floor of 10−9 was achieved.
5
Shapoval, Nataliia, i Denys Lobanov. "Detecting Handwritten Line for TikZ Code Generating". Electronics and Control Systems 2, nr 76 (23.06.2023): 56–60. http://dx.doi.org/10.18372/1990-5548.76.17671.
Pełny tekst źródłaStreszczenie:
This work is devoted to the recognition of straight lines in geometric drawings created by hand with the help of neural networks. The LaTeX language is usually used for the design of articles, which takes more time, especially when writing formulas or constructing geometric drawings, unlike writing by hand. Automating the construction of drawings will make it possible to speed up the process of writing articles. The paper considers the recognition of straight lines as the most popular element of geometric drawings. The Hough transform for straight lines detection and its disadvantages are considered. The use of convolutional neural networks for this task is proposed as the best tool for working with images. To train the model, a dataset was created with handwritten lines and lines constructed in a graphics editor. The results of the neural network are given.
6
Duo, Bin, Xiaoling Zhong i Yong Guo. "Practical polar code construction for degraded multiple-relay networks". China Communications 14, nr 4 (kwiecień 2017): 127–39. http://dx.doi.org/10.1109/cc.2017.7927571.
Pełny tekst źródła
7
Nlend, Samuel, i Theo G. Swart. "Construction and Characterization of Optical Orthogonal Codes (n,w,1) for Fast Frequency Hopping-Optical Code Division Multiple Access". ECTI Transactions on Electrical Engineering, Electronics, and Communications 20, nr 1 (18.02.2022): 62–73. http://dx.doi.org/10.37936/ecti-eec.2022201.246105.
Pełny tekst źródłaStreszczenie:
This paper investigates a new combinatorial construction approach based on cyclic difference packings for the construction of an optical orthogonal code that is suitable as a time spreading sequence for fast frequency hopping optical code division multiple access (OCDM) systems. The proposed construction provides a solution to the electrical decoding delay problem when compared to its optical counterpart, as well as other optimization issues. The criteria for optimizing the performance of such an OCDMA system are provided, namely: the flexibility and simplicity in constructing the optimal code for any length and weight, a reduction in the encoding/decoding complexity that complies with changes in the fast frequency hopping system, and the provision of system transfer transparency, a decoding rule that exploits the embedded asymmetric error correcting capability of the code. Our neighbor difference approach refers to the partition of different solutions into sub-classes, given in the correlation matrix form. It takes into account both direct and recursive combinatorial code construction methods, and the resulting characteristics are evaluated accordingly. A performance analysis based on the OCDMA channel is given, and a comparison with other difference family solutions is performed.
8
GRELCK, CLEMENS, SVEN-BODO SCHOLZ i ALEX SHAFARENKO. "A GENTLE INTRODUCTION TO S-NET: TYPED STREAM PROCESSING AND DECLARATIVE COORDINATION OF ASYNCHRONOUS COMPONENTS". Parallel Processing Letters 18, nr 02 (czerwiec 2008): 221–37. http://dx.doi.org/10.1142/s0129626408003351.
Pełny tekst źródłaStreszczenie:
We present the design of S-NET, a coordination language and component technology based on stream processing. S-NET achieves a near-complete separation between application code, written in a conventional programming language, and coordination code, written in S-NET itself. S-NET boxes integrate existing sequential code as stream-processing components into streaming networks, whose construction is based on algebraic formulae built out of four network combinators. Subtyping on the level of boxes and networks and a tailor-made inheritance mechanism achieve flexible software reuse.
9
Li, Jian, Tongtong Li i Jian Ren. "Optimal Construction of Regenerating Code Through Rate-Matching in Hostile Networks". IEEE Transactions on Information Theory 63, nr 7 (lipiec 2017): 4414–29. http://dx.doi.org/10.1109/tit.2017.2694441.
Pełny tekst źródła
10
Li, Xiyang, i Kenneth W. Shum. "Mixed construction of OOC for optical code division multiple access networks". IET Communications 13, nr 7 (23.04.2019): 837–41. http://dx.doi.org/10.1049/iet-com.2018.5602.
Pełny tekst źródła
11
Li, Xiyang, i Kenneth W. Shum. "A mixed construction of variable-weight optical orthogonal code for optical code division multiple access networks". Physical Communication 39 (kwiecień 2020): 101025. http://dx.doi.org/10.1016/j.phycom.2020.101025.
Pełny tekst źródła
12
Chen, Jia, Quankai Qi, Yongjie Wang, Xuehu Yan i Longlong Li. "Data Hiding Based on Mini Program Code". Security and Communication Networks 2021 (24.05.2021): 1–12. http://dx.doi.org/10.1155/2021/5546344.
Pełny tekst źródłaStreszczenie:
A mini program code (also known as sunflower code) comes with WeChat mini program APPs. With the popularization of mini program APPs, mini program codes have become more and more widely used. As a new carrier, the study of information hiding technology based on mini program code is of great significance for the expansion of covert communication carriers and can also deal with security problems in advance. At present, to the best of our knowledge, there is no steganographic research based on mini program codes. In this paper, we propose a scheme to embed secret information into mini program codes for the first time. After studying the construction of mini program codes, a coordinate system is constructed to represent its module coordinates. Then, a binary stream of the secret message is embedded into the encoding region or the edge patch. Experiments show that the proposed data hiding scheme is effective and feasible. The embedded secret message could be extracted while keeping the readability of the mini program code. Moreover, the secret payloads of the encoding region and the edge patch for the V-36 mini program code are 72 bits and 29 bits, respectively.
13
Погасій, С. С., С. В. Мілевський, О. С. Жученко, Б. П. Томашевський, І. Р. Рагімова i С. В. Сергієв. "Development of Niederriter crypto-code design models on LDPC-codes". Системи обробки інформації, nr 4(167) (26.12.2021): 58–68. http://dx.doi.org/10.30748/soi.2021.167.05.
Pełny tekst źródłaStreszczenie:
The development of mobile technologies and computing resources has expanded the range of digital services and practically outstripped the development of computer technologies. This approach ensures the use of mobile and wireless networks in almost all areas of smart technologies, provides a further synthesis of cyberspace and the mobile Internet. However, the absence of security service protocols: confidentiality and integrity, initially when they are formed in the structure of LTE technologies, provides cyber attackers with the opportunity to use mobile Internet channels to implement targeted (APT) attacks. The development and emergence of a full-scale quantum computer with Shor and Grover algorithms can lead to a sharp decrease in the level of security of cryptosystems based on symmetric and asymmetric cryptography (including cryptography on elliptic curves). In addition, modern cyber threats have signs of synergy and hybridity, and their integration with social engineering methods practically does not allow providing the required level of preventive measures (protection). The article proposes post-quantum cryptosystems based on the Niederreiter crypto-code construction on low-density parity-check codes (LDPC-codes). This approach makes it easy to integrate into wireless networks based on IEEE 802.16 and IEEE 802.15.4 standards, as well as LTE mobile technologies. At the same time, the required level of resistance to modern threats ensured.
14
Asif, Muhammad, Wuyang Zhou, Qingping Yu, Saifullah Adnan, Md Sadek Ali i Muhammad Shahid Iqbal. "Jointly designed quasi-cyclic LDPC-coded cooperation with diversity combining at receiver". International Journal of Distributed Sensor Networks 16, nr 7 (lipiec 2020): 155014772093897. http://dx.doi.org/10.1177/1550147720938974.
Pełny tekst źródłaStreszczenie:
This correspondence proposes a jointly-designed quasi-cyclic (QC) low-density parity-check (LDPC)-coded multi-relay cooperation with a destination node realized by multiple receive antennas. First, a deterministic approach is utilized to construct different classes of binary QC-LDPC codes with no length-4 cycles. Existing methods put some limitations in terms of code length and rate in order to provide high error-correction performance. Therefore, this article gives three classes of QC-LDPC codes based on a combinatoric design approach, known as cyclic difference packing (CDP), with flexibility in terms of code-length and rate selection. Second, the proposed CDP-based construction is utilized to jointly-design QC-LDPC codes for coded-relay cooperation. At the receiver, the destination node is realized by multiple receive antennas, where maximal-ratio combining (MRC) and sum-product algorithm (SPA)-based joint iterative decoding are utilized to decode the corrupted sequences coming from the source and relay nodes. Simulation results show that the proposed QC-LDPC coded-relay cooperations outperform their counterparts with a coding gain of about 0.25 dB at bit-error rate (BER) [Formula: see text] over a Rayleigh fading channel in the presence of additive white Gaussian noise. Furthermore, the extrinsic-information transfer (EXIT) chart analysis has been used to detect the convergence threshold of proposed jointly-designed QC-LDPC codes. Numerical analysis shows that the proposed jointly-designed QC-LDPC codes provide a better convergence as compared to their counterparts under the same conditions.
15
Morsy, Morsy A., i Moustafa H. Aly. "A New Hybrid Prime Code for OCDMA Network Multimedia Applications". Electronics 10, nr 21 (5.11.2021): 2705. http://dx.doi.org/10.3390/electronics10212705.
Pełny tekst źródłaStreszczenie:
This paper presents a new family of spreading code sequences called hybrid prime code (HPC), to be used as source code for the optical code division multiple access (OCDMA) network for large network capacity. The network capacity directly depends on the number of available code sequences provided and their correlation properties. Therefore, the proposed HPC is designed based on combining two or more different code words belonging to two or more different prime numbers. This increases the number of code sequences generated. The code construction method utilized allows the generation of different code sets, each with different code length and weight, according to the number of prime numbers used. In addition, the incoherent pulse position modulation (PPM) OCDMA system is proposed based on the HPC code. Furthermore, the bit error rate (BER) performance analysis is introduced versus the received optical power and the number of active users. Moreover, the error vector magnitude (EVM) is calculated versus the optical signal-to-noise ratio. This work proves that using two prime numbers simultaneously generates far more codes than using prime numbers separately. It also achieved an OCDMA system capacity higher than the system that uses the optical orthogonal codes (OOCs), modified prime codes (MPCs) families, and two code families with separate simultaneously prime numbers, at a BER below 10−9 which is the optimum level.
16
Fadhil, Hilal A., Syed A. Aljunid, Hassan Y. Ahmed i Hamza M. R. AlKhafaji. "Variable cross-correlation code construction for spectral amplitude coding optical CDMA networks". Optik 123, nr 11 (czerwiec 2012): 956–63. http://dx.doi.org/10.1016/j.ijleo.2011.07.011.
Pełny tekst źródła
17
Zhao, Chunli, Fengfan Yang, Daniel Kariuki Waweru, Chen Chen, Hongjun Xu i Lin Luo. "Distributed Goppa-Coded Generalized Spatial Modulation: Optimized Design and Performance Study". Electronics 12, nr 11 (25.05.2023): 2404. http://dx.doi.org/10.3390/electronics12112404.
Pełny tekst źródłaStreszczenie:
The distributed Goppa-coded generalized spatial modulation (DGC-GSM) scheme with the source, relay, and destination in cooperative communications is proposed, where the source and relay adopt different Goppa codes. Goppa codes have many advantages such as the flexible codeword length, excellent code construction, and easy encoding and decoding complexity. At the relay, we select portions of the source information bits for further encoding. For each selection, the destination constructs a channel code. To obtain the best code in the destination, we propose the optimal information bit selection algorithm at the relay to choose the source information. However, Goppa codes with a large block length will impose high complexity on the optimal algorithm. Thus, the locally optimized selection algorithm is further proposed. At the destination, the joint decoding algorithm is adopted to recover the source information. Our simulated results indicate that the two selection algorithms proposed achieve better performance than the random selection method. This is because the optimized algorithms can generate the code with a larger minimum distance at the destination. Moreover, the proposed DGC-GSM scheme outperforms the non-cooperative system. Moreover, the DGC-GSM scheme can obtain the approximate performance with the distributed Goppa-coded spatial modulation (DGC-SM) scheme but has a significantly reduced transmit antenna number.
18
Anshu, Anurag, i Nikolas P. Breuckmann. "A construction of combinatorial NLTS". Journal of Mathematical Physics 63, nr 12 (1.12.2022): 122201. http://dx.doi.org/10.1063/5.0113731.
Pełny tekst źródłaStreszczenie:
The NLTS (No Low-Energy Trivial State) conjecture [M. H. Freedman and M. B. Hastings, Quantum Inf. Comput. 14, 144 (2014)] posits that there exist families of Hamiltonians with all low energy states of high complexity (with complexity measured by the quantum circuit depth preparing the state). Here, we prove a weaker version called the combinatorial no low error trivial states (NLETS), where a quantum circuit lower bound is shown against states that violate a (small) constant fraction of local terms. This generalizes the prior NLETS results [L. Eldar and A. W. Harrow, in 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2017), pp. 427–438] and [Nirkhe et al., in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Leibniz International Proceedings in Informatics (LIPIcs), edited by Chatzigiannakis et al. (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018), Vol. 107, pp. 1–11]. Our construction is obtained by combining tensor networks with expander codes [M. Sipser and D. Spielman, IEEE Trans. Inf. Theory 42, 1710 (1996)]. The Hamiltonian is the parent Hamiltonian of a perturbed tensor network, inspired by the “uncle Hamiltonian” of Fernández-González et al. [Commun. Math. Phys. 333, 299 (2015)]. Thus, we deviate from the quantum Calderbank-Shor-Steane (CSS) code Hamiltonians considered in most prior works.
19
Zeng, Yao, Yuxi Tang i Luping Xiang. "Physical Layer Security Design for Polar Code Construction". Cryptography 6, nr 3 (4.07.2022): 35. http://dx.doi.org/10.3390/cryptography6030035.
Pełny tekst źródłaStreszczenie:
In contrast to the network security that relies on upper-layer encryption for the confidentiality and authenticity of communications, physical layer security (PLS) exploits the uniqueness and randomness of the physical channel to encrypt information and enhance the security of the system. In this paper, we study the PLS of a polar-coded wireless communication system. To be more specific, we leverage the unique properties in polar code construction and propose a channel quality indicator (CQI)-based frozen-bit pattern generation scheme. The transmitter employs the Gaussian approximation algorithm to generate the corresponding frozen bit pattern according to the instantaneous CQI of the legitimate link. At the receiver, by leveraging the full channel reciprocity in the time-division duplex (TDD) mode, we can map the CQI to the corresponding frozen bit pattern and correctly decode the received bits. By contrast, the eavesdropper was unable to have the knowledge of the legal channel, and hence cannot determine the frozen bit pattern of the polar-coded bit sequence. Our simulation results demonstrate that by adopting the proposed PLS key generation scheme, Eve was hardly able to correctly decode a complete frame, leading to a high block error rate (BLER), while Bob was able to attain a 10−5 BLER.
20
Rahmani, Mohamed, Abdelhamid Cherifi, Abdullah S. Karar, Ghoutia Naima Sabri i Boubakar S. Bouazza. "Contribution of New Three-Dimensional Code Based on the VWZCC Code Extension in Eliminating Multiple Access Interference in Optical CDMA Networks". Photonics 9, nr 5 (3.05.2022): 310. http://dx.doi.org/10.3390/photonics9050310.
Pełny tekst źródłaStreszczenie:
In order to solve the problem of one-dimensional code length, two-dimensional code spatial length, phase induced intensity noise PIIN effect, improved system capacity, and increased the number of simultaneous users, a new three-dimensional spectral/time/spatial variable weight zero cross correlation code for non-coherent spectral amplitude coding-optical code division multiple access (3D-VWZCC-SAC-OCDMA) is proposed in this paper. Its construction is based on a one-dimensional (1D) spectral sequence and two-dimensional (2D) temporal/spatial sequences, which are characterized by the property of zero cross correlation ZCC. The simulation results demonstrate that our code proves high immunity against PIIN noise and shot noise, it increases multiplexing ability when the passage is from (1D) and (2D) to (3D) up to 5.112 and 2.248 times, and it saves −7.04 dBm and −5.9 dBm of the receiver power due to simple detection at the receiver; furthermore, the 3D-VWZCC system capacity has outperformed the 3D-PD, 3D-PD/MD and 3D-DCS/MD codes, which reach 3686, 2908, and 3234 times, respectively. Moreover, our code offers better performance, in terms of data rates, with up to 2 Gbps compared to previous codes, which makes the system meet the requirements of optical communication networks. Further, 3D-VWZCC is also simulated in Optisystem software, where our code offers a transmission quality Q reaching 11.56 with a bit error rate BER of 1.99 × 10−31 despite a high number of users.
21
Krylova, Victoria, Elena Tverytnykova, Oleg Vasylchenkov i Tatyana Kolisnyk. "PUNCTURED NCC CODES FOR INFORMATION PROTECTION IN INFORMATION AND MEASUREMENT SYSTEMS". Bulletin of the National Technical University «KhPI» Series: New solutions in modern technologies, nr 1(11) (18.05.2022): 38–43. http://dx.doi.org/10.20998/2413-4295.2022.01.06.
Pełny tekst źródłaStreszczenie:
During development and design of information-measuring systems, enabling to carry out collection, processing and transmission of information, one of the main problems is the choice of effective methods of information protection against defects in noisy communication channels. Effective use of frequency-time resources of information communication channels, as the most valuable part of the information transmission system, is the key to provide reliable delivery of transmitted messages. One of effective directions of reliability increase and information transfer reliability in information-measuring communication networks is implementation of methods and algorithms of noise-resistant coding, providing for detection and coping with errors, arising due to interferences in the communication channel. In this case, the choice in favor of one or another coding method depends on the information characteristics of the data channel. Parameters of the noise coder must be coordinated with the source of the message, the communication channel, as well as the requirements for the reliability of bringing information to the recipient. The problem of obtaining a wide range of codec parameters with simultaneous preservation of the unified macrostructure of the codec in communication systems causes the need for research on the development of adaptive algorithms for error information protection. In the article the research results of the characteristics of variable rate slot convolutional codes for adaptive coding/decoding in information-measuring systems of information transmission are proposed. Consequently, when creating communication networks, there is no need to use a large number of different codecs, even with completely different requirements to the code rate, channel rate and gain due to coding. In addition, there is a real opportunity to create terminal equipment, working on unified algorithms of protection against errors and access.
22
Zinoviev, V. A., i D. V. Zinoviev. "On the Generalized Concatenated Construction for the Nordstrom–Robinson Code and the Binary Golay Code". Problems of Information Transmission 57, nr 4 (październik 2021): 331–40. http://dx.doi.org/10.1134/s0032946021040037.
Pełny tekst źródła
23
Abdulwahab, Walled K., i Abdulkareem A. Kadhim. "Internal pilot insertion for polar codes". Indonesian Journal of Electrical Engineering and Computer Science 22, nr 3 (1.06.2021): 1495. http://dx.doi.org/10.11591/ijeecs.v22.i3.pp1495-1504.
Pełny tekst źródłaStreszczenie:
Two internal pilot insertion methods are proposed for polar codes to improve their error correction performance. The presented methods are based on a study of the weight distribution of the given polar code. The insertion of pilot bits provided a new way to control the coding rate of the modified polar code on the basis of the Hamming weight properties without sacrificing the code construction and the related channel condition. Rate control is highly demanded by 5G channel coding schemes. Two short-length polar codes were considered in the work with successive cancellation list decoding. The results showed that advantages in the range of 0.1 to 0.75 dB were obtained in the relative tolerance of the modified coded signal to the additive white Gaussian noise and fading channels at a bit error rate of 10<sup>−4</sup>. The simulation results also revealed that the performance improvements were possible with a careful insertion of the pilots. The modified polar code with pilot insertion provided performance improvement and offered the control of the coding rate without any added complexity at both the encoder and the decoder.
24
Liu, Xiao, Mianxiong Dong, Yuxin Liu, Anfeng Liu i Neal N. Xiong. "Construction Low Complexity and Low Delay CDS for Big Data Code Dissemination". Complexity 2018 (20.06.2018): 1–19. http://dx.doi.org/10.1155/2018/5429546.
Pełny tekst źródłaStreszczenie:
The diffusion of codes is an important processing technology for big data networks. In previous scheme, data analysis was conducted for small samples of big data and complex problems that cannot be processed by big data technology. Due to the limited capacity of intelligence device, a better method is to select a set of nodes (intelligence device) to form a connected dominating set (CDS) to save energy, and constructing CDS is proved to be a complete NP problem. However, it is a challenge to reduce the communication delay and complexity for urgent data transmission in big data. In this paper, an appropriate duty cycle control (ADCC) scheme is proposed to reduce communication delay and complexity while improving energy efficient in CDS-based WSNs. In ADCC scheme, the method for constructing CDS is proposed at lower complexity. Nodes in CDS are selected according to the degree of nodes. Then, duty cycle of dominator nodes in CDS is higher than that of dominated nodes, so the communication delay in the proposed scheme is far less than that of previous scheme. The duty cycle of dominated nodes is small to save energy. This is because the number of dominator nodes in CDS is far less than the number of dominated nodes whose duty cycle is small; thus, the total energy consumption of the network is less than that of the previous scheme. As a result, the performance of energy consumption and communication delay and complex have been improved. Its complexity O∑i=0vm−i+2m−2v−s is reduced a lot for big data. The theoretical analysis shows that compared to the previous scheme, the transmission delay can be reduced 25–92% and the energy efficiency is improved by about 80% while retaining network lifetime.
25
Yang, Shuai. "Construction of Video Courses of Physical Education and Health Education in Colleges and Universities under the MOOC Platform". Mobile Information Systems 2021 (3.06.2021): 1–8. http://dx.doi.org/10.1155/2021/9925838.
Pełny tekst źródłaStreszczenie:
In the traditional construction process of educational video courses for physical and health education in universities, numerous problems are encountered, such as small storage capacity, significant delay error, and decreased information throughput rate. Therefore, an educational video course for physical and health education in universities based on the Massive Open Online Course (MOOC) platform is constructed. The course is built by constructing a creative environment for video courses, establishing a video course model under the MOOC platform, and the caching code design for video courses. Upon numerous modifications and test runs, with the campus network’s help, the construction of a network teaching video for physical and health theory courses is realized. Our proposed approach’s experimental result shows that the designed course’s frame rate is 10% higher than that of the traditional course designing. The node’s storage capacity is up to 130%, the delay error is significantly reduced, and the information throughput rate is not affected by the increase of network load.
26
Darginavičienė, I., i I. Ignotaitė. "Code-switching in the computer-mediated communication". RUDN Journal of Sociology 20, nr 2 (15.12.2020): 405–15. http://dx.doi.org/10.22363/2313-2272-2020-20-2-405-415.
Pełny tekst źródłaStreszczenie:
Most authors admit that code-switching is the process of switching different languages, their varieties, speaking styles, etc. Today the majority of people in the world are multilingual and often mix languages in different ways, which makes code-switching a quite common global phenomenon. Code-switching incorporates government, cultural, religious and network contexts, and the frequency of code-switching in such multilingual conversations is an indicator of the global dominance of multilingualism. Online communication fosters social communicative practices consisting of code-switching and marks the development of verbal behaviour of multilingual communities. Code-switching also affects language visuality, its images are tools for the social construction of reality. The developed verbal practices support effective communication and affect the expression of new meanings. The article aims at presenting the features of code-switching in digital communication with 8 examples of different length, topic and author, in which the native Lithuanians code-switched to English and used elements of the Internet language. These examples were taken from the social networks Instagram, YouTube, Facebook and Twitter, and the authors analyzed the grammar, spelling and punctuation of both Lithuanian and the English words, the type and use of the code-switched English elements, special characters, abbreviations, emoji and other features of the Internet language. The results show that online communication is not entirely textual, with various means of text composition communicators make their code-switched English elements more visible and alter the appearance of messages. Such practices correspond to the features of social networks and seem to follow the popular Internet culture trends.
27
Addad, Mouad, i Ali Djebbari. "A New Code Family for QS-CDMA Visible Light Communication Systems". Journal of Telecommunications and Information Technology 3 (28.09.2018): 5–8. http://dx.doi.org/10.26636/jtit.2018.124318.
Pełny tekst źródłaStreszczenie:
Visible light communication (VLC) is a promising technology for wireless communication networks. Optical code division multiple access (OCDMA) is a strong candidate for VLC-based applications. The predominant source of bit error in OCDMA is the multiple access interference (MAI). To eliminate MAI in synchronous OCDMA, zero cross correlation (ZCC) codes have been proposed. However, synchronization problems and multipath propagation introduce relative non-zero time delays. Therefore, the zero correlation zone (ZCZ) concept was introduced. In this paper, we propose a new method for generating ZCC codes. The proposed construction can accommodate any number of users with flexible Hamming weight. The numerical results obtained show that the proposed codes significantly reduce MAI, compared to ZCC, as well as ZCZ codes.
28
Pedrosa, Valéria G., i Max H. M. Costa. "Index Coding with Multiple Interpretations". Entropy 24, nr 8 (18.08.2022): 1149. http://dx.doi.org/10.3390/e24081149.
Pełny tekst źródłaStreszczenie:
The index coding problem consists of a system with a server and multiple receivers with different side information and demand sets, connected by a noiseless broadcast channel. The server knows the side information available to the receivers. The objective is to design an encoding scheme that enables all receivers to decode their demanded messages with a minimum number of transmissions, referred to as an index code length. The problem of finding the minimum length index code that enables all receivers to correct a specific number of errors has also been studied. This work establishes a connection between index coding and error-correcting codes with multiple interpretations from the tree construction of nested cyclic codes. The notion of multiple interpretations using nested codes is as follows: different data packets are independently encoded, and then combined by addition and transmitted as a single codeword, minimizing the number of channel uses and offering error protection. The resulting packet can be decoded and interpreted in different ways, increasing the error correction capability, depending on the amount of side information available at each receiver. Motivating applications are network downlink transmissions, information retrieval from datacenters, cache management, and sensor networks.
29
ASAHINA, Hiromu, Kentaroh TOYODA, P. Takis MATHIOPOULOS, Iwao SASASE i Hisao YAMAMOTO. "RPL-Based Tree Construction Scheme for Target-Specific Code Dissemination in Wireless Sensors Networks". IEICE Transactions on Communications E103.B, nr 3 (1.03.2020): 190–99. http://dx.doi.org/10.1587/transcom.2019ebp3066.
Pełny tekst źródła
30
ZHANG, Chongfu, Kun QIU, Yu XIANG i Hua XIAO. "Construction of Frequency-Hopping/Time-Spreading Two-Dimensional Optical Codes Using Quadratic and Cubic Congruence Code". IEICE Transactions on Communications E94-B, nr 7 (2011): 1883–91. http://dx.doi.org/10.1587/transcom.e94.b.1883.
Pełny tekst źródła
31
Chen, Biao, Weiming Zhang, Kede Ma i Nenghai Yu. "Recursive code construction for reversible data hiding in DCT domain". Multimedia Tools and Applications 72, nr 2 (17.05.2013): 1985–2009. http://dx.doi.org/10.1007/s11042-013-1493-x.
Pełny tekst źródła
32
Hong, Xiaobin. "Based on the Software Complexity Measurement of Complex Networks under Big Data Technology". Journal of Physics: Conference Series 2066, nr 1 (1.11.2021): 012014. http://dx.doi.org/10.1088/1742-6596/2066/1/012014.
Pełny tekst źródłaStreszczenie:
Abstract With the development of the times, computer technology is booming, so the network is becoming more and more complex, software design is becoming more and more complex, because of the protection against a variety of internal or external risks. The internal risk is that the traffic carried by the system is too large to cause the system to crash or the system to crash caused by the code operation error, and the external threat is that hackers use computer technology to break into the system according to security vulnerabilities, so the purpose of this paper is based on big data technology, the software complexity of complex networks is measured and studied. With the consent of the school, we used the school’s internal network data, and after consulting the literature on the complex construction and analysis of complex networks and software, modeled and analyzed it using the improved particle group algorithm. The experimental results show that there is a certain correlation between complex network and software complexity. Because complex networks determine that software requires complex construction to withstand potential risks to keep the software running properly.
33
Benedetto, Sergio, Guido Montorsi, Dariush Divsalar i Fabrizio Pollara. "Soft-input soft-output modules for the construction and distributed iterative decoding of code networks". European Transactions on Telecommunications 9, nr 2 (marzec 1998): 155–72. http://dx.doi.org/10.1002/ett.4460090206.
Pełny tekst źródła
34
Babich, Fulvio, i Francesca Vatta. "Turbo Codes Construction for Robust Hybrid Multitransmission Schemes". Journal of Communications Software and Systems 7, nr 4 (20.12.2011): 128. http://dx.doi.org/10.24138/jcomss.v7i4.174.
Pełny tekst źródłaStreszczenie:
In certain applications the user has to cope with some random packet erasures due, e.g., to deep fading conditions on wireless links, or to congestion on wired networks. In other applications, the user has to cope with a pure wireless link, in which all packets are available to him, even if seriously corrupted. The ARQ/FEC schemes already studied and presented in the literature are well optimized only for one of these two applications. In a previous work, the authors aimed at bridging this gap, giving a design method for obtaining hybrid ARQ schemes that perform well in both conditions, i.e., at the presence of packet erasures and packet fading. This scheme uses a channel coding system based on partially-systematic periodically punctured turbo codes. Since the computation of the transfer function and, consequently, the union bound on the Bit or Frame Error Rate of a partiallysystematic punctured turbo code becomes highly intensive as the interleaver size and the puncturing period increase, in this work a simplified and more efficient method to calculate the most significant terms of the average distance spectrum of the turbo encoder is proposed and validated.
35
Thiers, Johann-Philipp, i Jürgen Freudenberger. "Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography". Cryptography 5, nr 4 (29.11.2021): 33. http://dx.doi.org/10.3390/cryptography5040033.
Pełny tekst źródłaStreszczenie:
The code-based McEliece and Niederreiter cryptosystems are promising candidates for post-quantum public-key encryption. Recently, q-ary concatenated codes over Gaussian integers were proposed for the McEliece cryptosystem, together with the one-Mannheim error channel, where the error values are limited to the Mannheim weight one. Due to the limited error values, the codes over Gaussian integers achieve a higher error correction capability than maximum distance separable (MDS) codes with bounded minimum distance decoding. This higher error correction capability improves the work factor regarding decoding attacks based on information-set decoding. The codes also enable a low complexity decoding algorithm for decoding beyond the guaranteed error correction capability. In this work, we extend this coding scheme to codes over Eisenstein integers. These codes have advantages for the Niederreiter system. Additionally, we propose an improved code construction based on generalized concatenated codes. These codes extend to the rate region, where the work factor is beneficial compared to MDS codes. Moreover, generalized concatenated codes are more robust against structural attacks than ordinary concatenated codes.
36
Li, Wei, i Xin Wang. "Construction of Modularized English Teaching Platform for Multimedia Wireless Network Based on NS2 Simulation Software". Mobile Information Systems 2021 (19.10.2021): 1–10. http://dx.doi.org/10.1155/2021/5329208.
Pełny tekst źródłaStreszczenie:
Using the NS2 network simulation tool to teach the “wireless network” course can enhance students’ understanding of wireless network protocols through visualization and can also improve students’ ability to analyze problems hands on. We built a multimedia wireless network modularized English teaching platform based on NS2 simulation software; made full use of the rich components and network resources provided by NS2 to achieve a high degree of code reuse and reduce the time for developing simulation codes; designed the overall framework of this multimedia wireless network modular English teaching platform based on the B/S structure; and solved the weight coefficient and importance value of the learning input evaluation index, based on the feedback elite teaching optimization algorithm, the improved teaching formula, the increase in the number of exchanges, and the improvement in the learner’s performance. The experimental results show that the LEACH and LEACH-C protocols of the clustered NS2 simulation software have more surviving nodes most of the time, which indicates that the clustering routing protocol has better performance.
37
Saniya, M., B. Amulya, A. Sahiti, A. Nagarani i Dr M. Shanker. "Construction Site Accident Avoidance". International Journal for Research in Applied Science and Engineering Technology 10, nr 6 (30.06.2022): 1269–78. http://dx.doi.org/10.22214/ijraset.2022.44042.
Pełny tekst źródłaStreszczenie:
Abstract: Visual examination of the plant and in- time memorial to the failure of wearing a safety helmet is of particular significance to avoid injuries of workers at the construction point. Videotape monitoring systems give a large quantum of unshaped image data on- point for this purpose, still, taking a computer vision- based automatic result for real- time discovery. In this regard, we develop a deep learning-based system for the real- time discovery of a safety helmet at the construction point. i.e. presented system uses the YOLO algorithm that's grounded on convolutional neural networks. The trial results demonstrate that the presented machine learning-based model using the YOLO algorithm is able of detecting the unsafe operation of failure of wearing a helmet at the construction point, with satisfactory delicacy and efficiency. However, also the system generates a sound indicating it, If any worker fails to wear helmet. Using color code safety helmets at the workplace is very beneficial. It is also proved that many countries which are using color coding system for safety helmets, have made the working process fast and smooth. There are some specific standard color codes which are already defined for these safety helmets based on job sites or working environment you are present. It will be very helpful for identifying the key people at the time of emergency. This system ables to detect the particular job profile that the employees holding based upon the color of helmet he/she is wearing. This system also includes a module which is able to detect whether the worker is working or idle. we analyze the movement of worker in real-time.
38
Kotenko, Igor, Konstantin Izrailov, Mikhail Buinevich, Igor Saenko i Rajeev Shorey. "Modeling the Development of Energy Network Software, Taking into Account the Detection and Elimination of Vulnerabilities". Energies 16, nr 13 (2.07.2023): 5111. http://dx.doi.org/10.3390/en16135111.
Pełny tekst źródłaStreszczenie:
This paper solves the problem of modeling the scheme for developing software systems, which can be used in building solutions for secure energy networks. A development scheme is proposed in a set of representations through which each program of the software complex passes, namely the following representations: idea, conceptual model, architecture, algorithm, source code, graphic code, abstract syntax tree, assembler code, machine code, byte code, executed code. The main properties of each representation are indicated, such as the form (text, graphic, programming language, binary, and decoded), development (transformation) methods, as well as vulnerabilities that are detected in it. An example of each representation is given, particularly as applied to the energy networks. The scheme elements (representations, vulnerabilities, forms, etc.) and the main operations for working with their elements (representation transformation, vulnerability injection, and detection) are presented in an analytical form. An example of a development scheme for a simple software complex of energy networks is given. The classification of vulnerabilities is introduced; it divides the vulnerabilities according to the structural level, functioning disruption, and information impact. The vulnerabilities in each of the views are substantiated using the common vulnerabilities and exposures (CVE) database. An experiment was conducted to demonstrate the vulnerability spread across representations during the development of a software complex example for the energy network. The features of the applications of the obtained results for energy networks are taken into account. The advantages, disadvantages, and limitations of the study, as well as ways to eliminate them, are discussed.
39
Martin-Du Pan, Oliver, Paul Woods i Richard Hanson-Graville. "Optimising pipe sizing and operating temperatures for district heating networks to minimise operational energy consumption". Building Services Engineering Research and Technology 40, nr 2 (27.09.2018): 237–55. http://dx.doi.org/10.1177/0143624418802590.
Pełny tekst źródłaStreszczenie:
Reducing heat losses is an important factor in improving the performance of district heating networks. High heat losses are sometimes experienced in UK district heating networks and this is often as a result of poor design, partly due to oversized pipes. To provide additional guidance to designers on this issue, this paper proposes a set of maximum pipe diameters to be used for a given maximum flow rate to reduce the risk of oversizing and high heat losses. It was found that the optimised velocities are higher than those given in CIBSE CP1 Heat Networks Code of Practice and adopting these will result in smaller pipe diameters and lower operational and capital costs. The methodology used in this paper is based on minimising the total operational energy. The flow and return optimised pipe diameters are calculated for different scenarios which include variations in the pipe material, insulation thickness, water temperature and ambient environment. It was found that the optimised velocity in every scenario remains relatively constant with a varying pipe diameter. This paper shows that the operational cost of a DH network can be reduced when selecting the recommended maximum pipe diameter, compared to commonly used sizing criteria. Further savings can be achieved if the flow and return pipe are sized separately; to minimise operational energy of both flow and return pipes, the return pipe should be sized for a lower velocity. This paper also explores particular questions of interest: A range of insulation thicknesses. Benefit from using a variable flow temperature and to supply the flow at 90℃ at peak times instead of a constant temperature at 70℃. A comparison between steel and plastic pipes which have different roughness coefficients. Optimised differential pressure drop per unit length in both flow and return pipes. Maximum distance occurring before measuring a temperature loss and pressure drop of 1℃ and 1 bar, respectively, at peak load. However, this paper does not take into account any potential benefits that a lower flow temperature might have in reducing heat production costs or a lower return temperature might have in enhanced heat recovery, or that lower temperatures may enable use of plastic carrier pipes. Such matters are site specific but should be included in any similar pipe sizing analysis and operating temperature optimisation carried out for an actual scheme. Practical application: Optimising maximum pipe diameters is necessary to improve the viability of district heating systems. The current guidance for designers is not considered optimal and this paper suggests a new methodology to size pipes to reduce both the heat losses and the operational cost. This paper also gives guidance to sustainability engineers to assess the performance of 90/40℃, 70/40℃ and 60/30℃ district heating networks; 70℃ was assumed to be the minimum acceptable flow temperature in the network to enable domestic hot water to be heated to a safe temperature of 60℃ for storage; 40℃ was the used return temperature to be in line with the CIBSE Code of Practice CP1 stating in Objective 3.5 that best practice should achieve return temperatures below 40℃ for a scheme supplying heat to new buildings. A 90/40℃ DH network performance when increasing the flow temperature was then compared to the performance of a 70/40℃ system. Finally, a 60/30℃ system was also analysed to investigate the benefit from operating a DH network complying with the 4th generation of DH network temperatures that encourages minimal exergy destruction from the network to the end user.
40
Ji, Jianhua, Ming Xu i Shuwen Yang. "Construction and performance analysis of a 2D optical orthogonal code". Journal of Optical Networking 6, nr 4 (2007): 375. http://dx.doi.org/10.1364/jon.6.000375.
Pełny tekst źródła
41
Zhang, Fan, Jian Xu i Gangqiang Yang. "Design of Regenerating Code Based on Security Level in Cloud Storage System". Electronics 12, nr 11 (26.05.2023): 2423. http://dx.doi.org/10.3390/electronics12112423.
Pełny tekst źródłaStreszczenie:
Cloud storage is an indispensable part of cloud computing solutions and the security of its stored data has become a key issue in the research and application of cloud storage systems. To solve this problem, this paper studies the anti-eavesdropping regenerating code technology for cloud storage systems, from the perspective of information theory. As opposed to the existing research ideas on regenerating code theory, that enable the system to obtain strong/weak security, this paper focuses on quantifying the relationship between security and system performance parameters, evaluating the system performance gains that can be obtained by appropriately reducing security, and designing regenerating code schemes with different information security levels to meet the personalized requirements of cloud storage customers. This paper puts forward a generalized matrix transposing method and applies it to the coding construction of fractional repetition codes. The scheme proposed in this paper will provide new ideas and methods for research on secure regenerating code technology in cloud storage systems.
42
Scherer, Paul, Maja Trębacz, Nikola Simidjievski, Ramon Viñas, Zohreh Shams, Helena Andres Terre, Mateja Jamnik i Pietro Liò. "Unsupervised construction of computational graphs for gene expression data with explicit structural inductive biases". Bioinformatics 38, nr 5 (9.12.2021): 1320–27. http://dx.doi.org/10.1093/bioinformatics/btab830.
Pełny tekst źródłaStreszczenie:
Abstract Motivation Gene expression data are commonly used at the intersection of cancer research and machine learning for better understanding of the molecular status of tumour tissue. Deep learning predictive models have been employed for gene expression data due to their ability to scale and remove the need for manual feature engineering. However, gene expression data are often very high dimensional, noisy and presented with a low number of samples. This poses significant problems for learning algorithms: models often overfit, learn noise and struggle to capture biologically relevant information. In this article, we utilize external biological knowledge embedded within structures of gene interaction graphs such as protein–protein interaction (PPI) networks to guide the construction of predictive models. Results We present Gene Interaction Network Constrained Construction (GINCCo), an unsupervised method for automated construction of computational graph models for gene expression data that are structurally constrained by prior knowledge of gene interaction networks. We employ this methodology in a case study on incorporating a PPI network in cancer phenotype prediction tasks. Our computational graphs are structurally constructed using topological clustering algorithms on the PPI networks which incorporate inductive biases stemming from network biology research on protein complex discovery. Each of the entities in the GINCCo computational graph represents biological entities such as genes, candidate protein complexes and phenotypes instead of arbitrary hidden nodes of a neural network. This provides a biologically relevant mechanism for model regularization yielding strong predictive performance while drastically reducing the number of model parameters and enabling guided post-hoc enrichment analyses of influential gene sets with respect to target phenotypes. Our experiments analysing a variety of cancer phenotypes show that GINCCo often outperforms support vector machine, Fully Connected Multi-layer Perceptrons (MLP) and Randomly Connected MLPs despite greatly reduced model complexity. Availability and implementation https://github.com/paulmorio/gincco contains the source code for our approach. We also release a library with algorithms for protein complex discovery within PPI networks at https://github.com/paulmorio/protclus. This repository contains implementations of the clustering algorithms used in this article. Supplementary information Supplementary data are available at Bioinformatics online.
43
Zhang, Wenyu, Yaqun Zhao i Sijie Fan. "Cryptosystem Identification Scheme Based on ASCII Code Statistics". Security and Communication Networks 2020 (15.12.2020): 1–10. http://dx.doi.org/10.1155/2020/8875864.
Pełny tekst źródłaStreszczenie:
In the field of information security, block cipher is widely used in the protection of messages, and its safety naturally attracts people’s attention. The identification of the cryptosystem is the premise of encrypted data analysis. It belongs to the category of attack analysis in cryptanalysis and has important theoretical significance and application value. This paper focuses on the extraction of ciphertext features and the construction of cryptosystem identification classifiers. The main contents and innovations of this paper are as follows. Firstly, inspired by language processing, we propose the feature extraction scheme based on ASCII statistics of ciphertexts which decrease the dimension of data preprocessing. Secondly, on the basis of previous work, we increase the types of block ciphers to eight, encrypt plaintext of the same sizes as experimental objects, and recognize the cryptosystem. Thirdly, we use two machine learning classifiers to perform classification experiments including random forest and SVM. The experimental results show that our scheme can not only improve the identification accuracy of 8 typical block cipher algorithms but also shorten the experimental time and reduce the computation load by greatly minimizing the dimension of the feature vector. And the various evaluation indicators obtained by the scheme have been greatly improved compared with the existing published literature.
44
Hu, Hao. "Construction of Automatic Acquisition System for Multichannel Electronic Communication Signals Based on Sorting Optimization Algorithm". Mobile Information Systems 2022 (16.08.2022): 1–9. http://dx.doi.org/10.1155/2022/2385191.
Pełny tekst źródłaStreszczenie:
In both the military and the civilian world, multichannel electronic communication signals are widely used. The goal of signal processing in contemporary communication systems is to capture the signal. The traditional multichannel electronic communication signal automatic capture system has a limited range of performance, which slows down the rate of capture. This study used the sorting algorithm to build an automatic acquisition system for multichannel electronic communication signals in order to address this issue. The system processes the communication signal using the quick sorting method in the sorting optimization algorithm, achieving the goal of more precisely obtaining the carrier frequency and pseudo-code phase, and resolving the issue of slow system acquisition caused by the lengthy pseudo-code period. According to the experimental findings, the improved system’s acquisition rate is 6.89% higher than the conventional system’s, ensuring efficiency and reducing processing time in real-world communication applications.
45
Zhao, Yiqiang, Boning Shi, Qizhi Zhang, Yidong Yuan i Jiaji He. "Research on Cache Coherence Protocol Verification Method Based on Model Checking". Electronics 12, nr 16 (11.08.2023): 3420. http://dx.doi.org/10.3390/electronics12163420.
Pełny tekst źródłaStreszczenie:
This paper analyzes the underlying logic of the processor’s behavior level code. It proposes an automatic model construction and formal verification method for the cache consistency protocol with the aim of ensuring data consistency in the processor and the correctness of the cache function. The main idea of this method is to analyze the register transfer level (RTL) code directly at the module level and variable level, and extract the key modules and key variables according to the code information. Then, based on key variables, conditional behavior statements are retrieved from the code, and unnecessary statements are deleted. The model construction and simplification of related core states are completed automatically, while also simultaneously generating the attribute library to be verified, using “white list” as the construction strategy. Finally, complete cache consistency protocol verification is implemented in the model detector UPPAAL. Ultimately, this mechanism reduces the 142 state-transition path-guided global states of the cache module to be verified into 4 core functional states driven by consistency protocol implementation, effectively reducing the complexity of the formal model, and extracting 32 verification attributes into 6 verification attributes, reducing the verification time cost by 76.19%.
46
Badri, Mourad, Aymen Kout i Linda Badri. "Investigating the Effect of Aspect-Oriented Refactoring on the Unit Testing Effort of Classes: An Empirical Evaluation". International Journal of Software Engineering and Knowledge Engineering 27, nr 05 (czerwiec 2017): 749–89. http://dx.doi.org/10.1142/s0218194017500280.
Pełny tekst źródłaStreszczenie:
This paper aims at investigating empirically the effect of aspect-oriented (AO) refactoring on the unit testability of classes in object-oriented software. The unit testability of classes has been addressed from the perspective of the unit testing effort, and particularly from the perspective of the unit test cases (TCs) construction. We investigated, in fact, different research questions: (1) the impact of AO refactoring on source code attributes (size, complexity, coupling, cohesion and inheritance), attributes that are mostly related to the unit testability of classes, (2) the impact of AO refactoring on unit test code attributes (size, assertions, invocations and data creation), attributes that are indicators of the effort involved to write the code of unit TCs, and (3) the relationships between the variations observed after AO refactoring in both source code and unit test code attributes. We used in the study different techniques: correlation analysis, statistical tests and linear regression. We performed an empirical evaluation using data collected from three well-known open source (Java) software systems (JHOTDRAW, HSQLBD and PETSTORE) that have been refactored using AO programming (AspectJ). Results suggest that: (1) overall, the effort involved in the construction of unit TCs of refactored classes has been reduced, (2) the variations of source code attributes have more impact on methods invocation between unit TCs, and finally (3) the variations of unit test code attributes are more influenced by the variation of the complexity of refactored classes compared to the other class attributes.
47
Alimov, Timur Mansurovich, Mokhamad Belal Alabdullakh, Akhmed Khusham khusam Alkhuzaii i Radzhikh Ziad Kattavi. "Dynamic arrays in C ++ and minimax search problem". Interactive science, nr 7 (41) (25.07.2019): 10–12. http://dx.doi.org/10.21661/r-497643.
Pełny tekst źródłaStreszczenie:
The article presents the classical saddle-point problem in a two-dimensional array. Such tasks are highly demanded in geodesy, in the construction of topographic or gravimetric maps of the terrain, in the energy sector – in planning the load on electric or thermal networks. The program code of the proposed project is written within the framework of the structured approach in the C ++ language in the Visual Studio 2017 programming environment.
48
Kuleshov, Sergey, Aleksandra Zaytseva i Iliya Shalnev. "Distributed system of virtual machines for self-organized networks". Information and Control Systems, nr 5 (16.10.2019): 30–37. http://dx.doi.org/10.31799/1684-8853-2019-5-30-37.
Pełny tekst źródłaStreszczenie:
Introduction: Active data, being fragments of executable code transmitted between the nodes of an active network, are an effectivemechanism for the operation of software-reconfigurable distributed systems. Previously, in the works devoted to active data, not enoughattention was paid to the implementation of the runtime environment (the processor) for the executable code of active data, as well asto the issues of building hypervisors and load balancing in distributed systems. Purpose: Developing principles for the construction of virtual machines with active data, providing the reconfigurability of the target devices and network flexibility in general. Evaluatingthe possibility of using the existing approaches to load balancing for networks with active data. Methods: Our study uses the principlesof software-defined system development, the conception of active data, theoretical foundations and technology of virtualization.Results: Is has been proposed to use a distributed system of virtual machines as an active data execution environment, based on theobject-oriented approach to creating distributed applications. Each node of such a distributed system of virtual machines can act aseither a control or slave node during the object interaction. Based on the developed approach, we proposed to solve the problem ofbuilding a network of repeaters using active data, considering an unmanned aerial vehicle as an element of an active info-communicationnetwork which supports the active data technology. Since a distributed system of virtual machines enables asymmetric distribution ofdecentralized network nodes, a method has been developed for a distributed system whose nodes are unmanned aerial vehicles and acontrol node, to control the asymmetry value by creating objects of various decomposition levels. Practical relevance: The proposedmethods provide a way to control the resource consumption of the nodes of a distributed software-reconfigurable network and theamount of network data transmitted. For dynamic management of the load on the network nodes, a resource manager architecture anda resource allocation algorithm are developed.
49
Wang, Luping, Kai Zhang, Haifeng Qian i Jie Chen. "Group Signature with Verifier-Local Revocation Based on Coding Theory". Security and Communication Networks 2021 (20.08.2021): 1–12. http://dx.doi.org/10.1155/2021/3259767.
Pełny tekst źródłaStreszczenie:
Group signature with verifier-local revocation (VLR-GS) is a special variant of revocable group signature that not only allows a user to anonymously sign messages but also only requires the verifiers to possess some up-to-date revocation information. To date, a number of VLR-GS schemes have been proposed under bilinear groups and lattices, while they have not yet been instantiated based on coding theory. In this paper, we present a code-based VLR-GS scheme in the random oracle model, which is the first construction to the best of our knowledge. Concretely, our VLR-GS scheme does not rely on the traditional paradigm which utilizes an encryption scheme as a building block and achieves logarithmic-size group signature. To obtain the scheme, we first introduce a new code-based Stern-like interactive zero-knowledge protocol with member revocation mechanism based on syndrome decoding problem. Moreover, we employ the binary Goppa code embedded for our scheme with efficiency and security analysis.
50
Cui, Shujie, i Peng Qi. "The legal construction of personal information protection and privacy under the Chinese Civil Code". Computer Law & Security Review 41 (lipiec 2021): 105560. http://dx.doi.org/10.1016/j.clsr.2021.105560.
Pełny tekst źródła