Linear Support Vector Machines for Error Correction in Optical Data Transmission

Reduction of bit error rates in optical transmission systems is an important task that is difficult to achieve. As speeds increase, the difficulty in reducing bit error rates also increases. Channels have differing characteristics, which may change over time, and any error correction employed must be capable of operating at extremely high speeds. In this paper, a linear support vector machine is used to classify large-scale data sets of simulated optical transmission data in order to demonstrate their effectiveness at reducing bit error rates and their adaptability to the specifics of each channel. For the classification, LIBLINEAR is used, which is related to the popular LIBSVM classifier. It is found that is possible to reduce the error rate on a very noisy channel to about 3 bits in a thousand. This is done by a linear separator that can be built in hardware and can operate at the high speed required of an operationally useful decode

Using Simple Neural Networks to Correct Errors in Optical Data Transmission.

We have demonstrated the applicability of neural-network-based systems to the problem of reducing the effects of signal distortion, and shown that such a system has the potential to reduce the bit-error-rate in the digitized version of the analogue electrical signal derived from an optical data stream by a substantial margin over existing techniques

Developing a system for automating the project-based didactic method of active learning in the educational process

The paper presents the development of a test bench for a proportional valve using Festo equipment and a simulation of the bench operation in the Fluidsim software. Analysis of the data obtained allows us to conclude that the developed simulation model adequately describes the behavior of a real object

Developing a system for automating the project-based didactic method of active learning in the educational process

The paper presents the development of a test bench for a proportional valve using Festo equipment and a simulation of the bench operation in the Fluidsim software. Analysis of the data obtained allows us to conclude that the developed simulation model adequately describes the behavior of a real object

Non-Local Configuration of Component Interfaces by Constraint Satisfaction

© 2020 Springer-Verlag. The final publication is available at Springer via https://doi.org/10.1007/s10601-020-09309-y.Service-oriented computing is the paradigm that utilises services as fundamental elements for developing applications. Service composition, where data consistency becomes especially important, is still a key challenge for service-oriented computing. We maintain that there is one aspect of Web service communication on the data conformance side that has so far escaped the researchers attention. Aggregation of networked services gives rise to long pipelines, or quasi-pipeline structures, where there is a profitable form of inheritance called flow inheritance. In its presence, interface reconciliation ceases to be a local procedure, and hence it requires distributed constraint satisfaction of a special kind. We propose a constraint language for this, and present a solver which implements it. In addition, our approach provides a binding between the language and C++, whereby the assignment to the variables found by the solver is automatically translated into a transformation of C++ code. This makes the C++ Web service context compliant without any further communication. Besides, it uniquely permits a very high degree of flexibility of a C++ coded Web service without making public any part of its source code.Peer reviewe

Coercion as homomorphism: type inference in a system with subtyping and overloading

A type system with atomic subtyping and a special form of operator overloading, which we call oset-homomorphism is proposed. A set of operator overloadings is said to be oset-homomorphic when for each pair of overloadings the coercion function realises a homomorphism of types and at the same time certain conditions on the operator type signa- ture are satised. We demonstrate that oset-homomorphic overloading has sucient power for supporting a compre- hensive set of array operations in a declarative language. The problem of inferring the least types in our type system is proven to be equivalent to the shortest path problem for weighted, directed graphs with non-negative cycle weights, which has a computationally ecient solution.Final Accepted Versio

Vintage Bit Cryptography

We propose to use a Random High-Rate Binary (RHRB) stream for the purpose of key distribution. The idea is as follows. Assume availability of a high-rate (terabits per second) broadcaster sending random content. Members of the key group (e.g. {Alice, Bob}) share a weak secret (at least 60 bits) and use it to make a selection of bits from the RHRB stream at an extremely low rate (1 bit out of 1016 to 1018). By the time that a strong key of reasonable size has been collected (1,000 bits), an enormous amount of data has been broadcast (1019 − 1021 bits). This is 106 to 108 times current hard drive capacity, which makes it infeasible for the interceptor (Eve) to store the stream for subsequent cryptanalysis, which is what the interceptor would have to do in the absence of the shared secret. Alternatively Eve could record the selection of bits that correspond to every value of the weak shared secret, which under the above assumptions requires the same or greater amount of storage i.e. 260×103. The members of the key group have no need to capture the whole stream, but store only the tiny part of it that is the key. Effectively this allows a pseudo-random sequence generated from a weak key to be leveraged up into a strong genuinely random key.Peer reviewedSubmitted Versio