The Internet advertising has more capabilities than other advertising tools. Taking into consideration the broad spectrum of the Internet, the study of the effectiveness indicators of the Internet advertising and the identification of problems in this field are considered to be topical issues. The article analyzes the key effectiveness indicators (KEA) to evaluate the effectiveness of the Internet advertising. Moreover, proposals for the effective use of advertising and marketing systems are also provided. Reducing the number of indicators to simplify the effective collection and analysis of the effectiveness indicators of Internet advertising can be promising. In this regard, some statistical and spectral operations are performed on the efficiency values, and effectiveness signs vector is determined. The Euclidean distance between these vectors is seen as the closeness between the two performance measures. The difference from other methods lies in the collection and distribution in the storage area, the distribution of data by the subsystem in the appropriate analysis systems. The processed information consists of numerical, temporary, logical and text data. The article uses a systematic approach and methodology for the scientific analysis of problems and ways to solve them, as well as for summing up.

Mobile phones and handsets enable us to communicate our voice, data and video messages with individuals that are far-off from us. When an active call is initiated by someone using a mobile phone, it is transmitted through a nearby Base Station (BS) transmitter to another BS until the call gets to its intended receiver. Any time a caller initiates and loses a connection to a BS while on conversation, the call is said to be dropped. The initiation and completion of an active call without any form of disconnection or termination is a key service quality parameter in telecommunication system networks. Robust statistical estimation, modelling and characterization of call drop rates is of high importance to the network operators and radio frequency engineers for effective re-planning and performance management process of telecommunication system networks. This work was designed to determine the optimal probability distribution model for drop call rates based on a five week acquired rate of drop calls data sample in the Southern regions of Nigeria.  To accomplish the aim, eight probability distributions namely logistic, log-logistic, normal, log-normal, exponential, Rayleigh, rician and Gumbel max were explored and based on the combined scores of three goodness of fit statistical tests, the log-logistic distribution was found to be the optimal probability distribution for the weekly rate of drop call prognostic analysis. The results could be of immense assistance to radio frequency engineers for optimal statistical modelling and design of cellular systems channels. 

Security in digital communication is becoming more important as the number of systems is connected to the internet day by day. It is necessary to protect secret message during transmission over insecure channels of the internet. Thus, data security becomes an important research issue. Steganography is a technique that embeds secret information into a carrier such as images, audio files, text files, and video files so that it cannot be observed.  In this paper, based on spatial domain, a new image steganography method is proposed to ensure the privacy of the digital data during transmission over the internet. In this method, least significant bit substitution is proposed where the information embedded in the random bit position of a random pixel location of the cover image using Pseudo Random Number Generator (PRNG). The proposed method used a 3-3-2 approach to hide a byte in a pixel of a 24 bit color image. The method uses Pseudo Random Number Generator (PRNG) in two different stages of embedding process. The first one is used to select random pixels and the second PRNG is used select random bit position into the R, G and B values of a pixel to embed one byte of information. Due to this randomization, the security of the system is expected to increase and the method achieves a very high maximum hiding capacity which signifies the importance of the proposed method.

In this paper, we propose a novel variant of the Hill cipher based on vector spaces. In the classical Hill cipher, a non-singular matrix is used for encryption but it is well known that this cipher is vulnerable to the known-plaintext attack. In our proposed cryptosystem, we eradicate this problem by encrypting each plaintext block with a new invertible key matrix. This makes our scheme immune to all existing attacks in literature on this type of ciphers and so the resulting cipher can be used as other state-of-art block cipher. To generate the invertible matrices which serve as the dynamic keys, we make use of the vector spaces along with randomly generated basis and non-singular linear transformation. In addition to this, we also study the computational complexity of the proposed cryptosystem and compare this with the computational complexities of other schemes based on Hill cipher. 

Random numbers play an important role in many areas, for example, encryption, cryptography, static analysis, simulations. It is also a fundamental resource in science and engineering. There are algorithmically generated numbers that are similar to random distributions, but are not actually random, called pseudo random number generators. In many cases the tasks to be solved are based on the unpredictability of random numbers, which cannot be guaranteed in the case of pseudo random number generators, true randomness is required. In such situations, we use real random number generators whose source of randomness is unpredictable random events.
Quantum Random Number Generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements. Our goal is to generate fast random numbers at a lower cost. At the same time, a high level of randomness is essential.
Through quantum mechanics, we can obtain true numbers using the unpredictable behavior of a photon, which is the basis of many modern cryptographic protocols. It is essential to trust cryptographic random number generators to generate only true random numbers. This is why certification methods are needed which will check both the operation of the device and the quality of the random bits generated.
We present the improved novel quantum random number generator, which is based the on time of arrival QRNG. It uses the simple version of the detectors with few requirements. The novel QRNG produces more than one random bit per each photon detection. It is rather efficient and has a high level of randomness.
Self-testing as well as device independent quantum random number generation methods are analyzed. The advantages and disadvantages of both methods are identified. The model of a novel semi self-testing certification method for quantum random number generators (QRNG) is offered in the paper. This method combines different types of certification approaches and is rather secure and efficient. Finally, the novel certification method is integrated into the model of the new quantum random number generator. The paper analyzes its security and efficiency.