The optimal modified performance of the multi-input multi-output (MIMO) networked control systems (NCSs) with encoding-decoding, channel noise in the forward channel and packet dropouts, quantization in the feedback c...
详细信息
The optimal modified performance of the multi-input multi-output (MIMO) networked control systems (NCSs) with encoding-decoding, channel noise in the forward channel and packet dropouts, quantization in the feedback channel is investigated in this paper. A new and efficient tracking performance index for the NCSs is presented which prevents variations in the tracking error where there is no integrator in the plant. The optimal modified performance is obtained by the method of coprime factorization and partial fraction. The results demonstrate that the optimal modified performance is related to the locations of the non-minimum phase (NMP) zeros, unstable poles of the given plant as well as their directions. In addition, the modified factor, packet dropouts probability, channel noise and encoding-decoding are also closely related to optimal modified performance of the NCSs. Finally, we present some particular examples to illustrate the theoretical results. (C) 2018 ISA. Published by Elsevier Ltd. All rights reserved.
Data compression plays an important role for storing and transmitting text or multimedia information. This paper refers to a lossless data algorithm is developed in C-platform to compress character string based on Bas...
详细信息
ISBN:
(数字)9789811031533
ISBN:
(纸本)9789811031533;9789811031526
Data compression plays an important role for storing and transmitting text or multimedia information. This paper refers to a lossless data algorithm is developed in C-platform to compress character string based on Basic Arithmetic Coding. At the preliminary stage, this algorithm was tested for the character array comprising of vowels only and the probability distribution is assumed arbitrarily. The result being obtained is encouraging with compression ratio far beyond unity. Though the algorithm was tested for vowels only but the work can be extended for any character array with probability of distribution as obtained from the survey of few randomly selected articles.
QR codes are used to store information in two dimensional grids which can be decoded quickly. The proposed work here deals with Quick response (QR) code extending its encoding and decoding implementation to design a n...
详细信息
ISBN:
(纸本)9781479987924
QR codes are used to store information in two dimensional grids which can be decoded quickly. The proposed work here deals with Quick response (QR) code extending its encoding and decoding implementation to design a new articulated user authentication and access control mechanism. The work also proposes a new simultaneous registration system for offices and organizations. The proposed system retrieves the candidate's information from their QR identification code and transfers the data to the digital application form, along with granting authentication to authorized QR image from the database. The system can improve the quality of service and thus it can increase the productivity of any organization.
Shape representations using polynomials in computer-aided geometric design (CAGD) and computer graphics are ubiquitous. This paper shows that any bivariate polynomial p(t, u) of total degree d <= n can be represent...
详细信息
ISBN:
(纸本)9781424422609
Shape representations using polynomials in computer-aided geometric design (CAGD) and computer graphics are ubiquitous. This paper shows that any bivariate polynomial p(t, u) of total degree d <= n can be represented in the forrn of a blossom of another bivariate polynomial b(t, u) of total degree d evaluated off the diagonal at the linear function pairs (Xj(t),Yj(u)), j = 1, ..., n, chosen under some conditions expressed in terms of symmetric functions. The bivariate polynomial b(t, u) is called a bud of the bivariate polynomial p(t, u). An algorithm for finding a bud b(t, u) of a given bivariate polynomial p(t, u) is presented. Successively, a bud of b(t, u) can be computed and so on, to form a sequence of representations. The information represented by the original bivariate polynomial is preserved in its buds. This scheme can be used for encoding/decoding geometric design information. The objects in the encoding/decoding sequence can be rendered graphically and manipulated geometrically like the usual parametric representations. Examples concerning triangular Bezier patches are provided as illustrations.
Shape representations using polynomials in computer-aided geometric design (CAGD) and computer graphics are ubiquitous. This paper shows that any bivariate polynomial p(t,u) of total degree d ≤ n can be represented i...
详细信息
Shape representations using polynomials in computer-aided geometric design (CAGD) and computer graphics are ubiquitous. This paper shows that any bivariate polynomial p(t,u) of total degree d ≤ n can be represented in the form of a blossom of another bivariate polynomial b(t,u) of total degree d evaluated off the diagonal at the linear function pairs (X{sub}j(t),Y{sub}j(u)), j = 1,...,n, chosen under some conditions expressed in terms of symmetric functions. The bivariate polynomial b(t,u) is called a bud of the bivariate polynomial p(t,u). An algorithm for finding a bud b(t,u) of a given bivariate polynomial p(t,u) is presented. Successively, a bud of b(t, u) can be computed and so on, to form a sequence of representations. The information represented by the original bivariate polynomial is preserved in its buds. This scheme can be used for encoding/decoding geometric design information. The objects in the encoding/decoding sequence can be rendered graphically and manipulated geometrically like the usual parametric representations. Examples concerning triangular Bezier patches are provided as illustrations.
OCDMA is a highly flexible technique to achieve high-speed connectivity with large bandwidth. Data access security and ability to support asynchronous, bursty data transmission are two of the main driving forces behin...
详细信息
ISBN:
(纸本)9781424412488
OCDMA is a highly flexible technique to achieve high-speed connectivity with large bandwidth. Data access security and ability to support asynchronous, bursty data transmission are two of the main driving forces behind a lot of interest in the OCDMA techniques. On the other hand, the poor spectral efficiency of OCDMA systems demand appropriate choice of coding techniques and multi-access interference (MAI) is often a limiting factor. This paper describes a simulated model for an incoherent Gigabit OCDMA system using high performance W/T codes. 60 km fiber amplifier span has been used in this model. Earlier work has been done at 1.25Gbps for 16 users. In this paper OCDMA system beyond 1.25 Gbps is suggested by redesigning W/T code using 8-wavelength and 8-time slots. By using modified W/T code the MAI reduces. The analysis takes into account the effect of data rates for increasing number of simultaneous users and received power. The system performance is evaluated by eye diagram and BER analysis at different data rates. The system has been designed for 1 Gbps, 1.25 Gbps, 2.5 Gbps and 5 Gbps. BER analysis for asynchronous concurrent communication of multiple users at different data rates has been done. Results show that the Bit-Error-Rate performance for 1.25 Gbps improves in comparison to previous designs. The designed system provides adequate BER (< 10(-9)) for 2.5 Gbps up to 16 users and for 5 Gbps up to 8 users.
Teachers need to provide numerous examples sentences for students to translate in the process of teaching English, but the number of sentences given by teachers to practice subjectively is not enough. Therefore, the s...
详细信息
Teachers need to provide numerous examples sentences for students to translate in the process of teaching English, but the number of sentences given by teachers to practice subjectively is not enough. Therefore, the study constructs a text generation model using an improved convolutional neural network semantic segmentation method, where the corpus utterances are keyword extracted and new shorter utterances are generated based on the keywords for language learners to practice translation. The research first uses the textRank algorithm to extract semantic keywords to obtain a dataset, and then uses CNN to construct an encoder to achieve semantic encoding of the keyword dataset. However, during the research process, it was found that traditional CNN models are relatively sensitive to the location of input data. Therefore, the research introduces the idea of Decomposition Machine (FM) to improve the encoder. In order to control text generation, research has introduced a weighted additive attention mechanism in the decoding process to associate the meaning of the generated text sequence with the meaning of the keyword set. Based on this, a text generation model for generating a translation related corpus in English teaching is constructed. This results in a text generation model that can be used to generate a translation-linked corpus for English language teaching. The average BLEU value of model 1 is 0.924, Inform value is 98.40, the Success value is 97.64, and the Combine value is 101.24, which can achieve high-quality text generation by the keyword lexical meaning and provide technical guarantee for the establishment of the corpus in educating in English.
暂无评论