Analysis of Information Security of Objects under Attacks and Processed by Methods of Compression

In this paper a methodology for evaluation of information security of objects under attacks, processed by methods of compression, is represented. Two basic parameters for evaluation of information security of objects – TIME and SIZE – are chosen and the characteristics, which reflect on their evaluation, are analyzed and estimated. A co-efficient of information security of object is proposed as a mean of the coefficients of the parameter TIME and SIZE. From the simulation experiments which were carried out methods with the highest co-efficient of information security had been determined. Assessments and conclusions for future investigations are proposed.

Forming of Learning Set for Neural Networks in Problems of Losless Data Compression

questions of forming of learning sets for artificial neural networks in problems of lossless data compression are considered. Methods of construction and use of learning sets are studied. The way of forming of learning set during training an artificial neural network on the data stream is offered.

Study of the Information Security of File Objects under Information Attacks with a Record of Effect of the Methods of Compression

This report examines important issues pertaining to the different ways of affecting the information security of file objects under information attacks through methods of compression. Accordingly, the report analyzes the three-way relationships which may exist among a selected set of attacks, methods and objects. Thus, a methodology is proposed for evaluation of information security, and a coefficient of information security is created. With respects to this coefficient, using different criteria and methods for evaluation and selection of alternatives, the lowest-risk methods of compression are selected.

Conceptual Information Compression and Efficient Pattern Search

This paper introduces an encoding of knowledge representation statements as regular languages and proposes a two-phase approach to processing of explicitly declared conceptual information. The idea is presented for the simple conceptual graphs where conceptual pattern search is implemented by the so called projection operation. Projection calculations are organised into off-line preprocessing and run-time computations. This enables fast run-time treatment of NP-complete problems, given that the intermediate results of the off-line phase are kept in suitable data structures. The experiments with randomly-generated, middle-size knowledge bases support the claim that the suggested approach radically improves the run-time conceptual pattern search.

Some Para-Hermitian Related Complex Structures and Non-existence of Semi-Riemannian Metric on Some Spheres

It is shown that the spheres S^(2n) (resp: S^k with k ≡ 1 mod 4) can be given neither an indefinite metric of any signature (resp: of signature (r, k − r) with 2 ≤ r ≤ k − 2) nor an almost paracomplex structure. Further for every given Riemannian metric on an almost para-Hermitian manifold with the associated 2-form φ one can construct an almost Hermitian structure (under certain conditions, two different almost Hermitian structures) whose associated 2-form(s) is φ.

Nonlinear pulse combining and pulse compression in multi-core fibers

We demonstrate light pulse combining and pulse compression using a continuous-discrete nonlinear system implemented in a multi-core fiber (MCF). It is shown that the pulses initially injected into all of the cores of a ring MCF are combined by nonlinearity into a small number of cores with simultaneous pulse compression. We demonstrate the combining of 77% of the energy into one core with pulse compression over 14× in a 20-core MCF. We also demonstrate that a suggested scheme is insensitive to the phase perturbations. Nonlinear spatio-temporal pulse manipulation in multi-core fibers can be exploited for various applications, including pulse compression, switching, and combining.

Compression by replication

A recently introduced inference method based on system replication and an online message passing algorithm is employed to complete a previously suggested compression scheme based on a nonlinear perceptron. The algorithm is shown to approach the information theoretical bounds for compression as the number of replicated systems increases, offering superior performance compared to basic message passing algorithms. In addition, the suggested method does not require fine-tuning of parameters or other complementing heuristic techniques, such as the introduction of inertia terms, to improve convergence rates to nontrivial results. © 2014 American Physical Society.

A Partition Metric for Clustering Features Analysis

A new distance function to compare arbitrary partitions is proposed. Clustering of image collections and image segmentation give objects to be matched. Offered metric intends for combination of visual features and metadata analysis to solve a semantic gap between low-level visual features and high-level human concept.

Compression Technologies of Graphic Information

The classification of types of information redundancy in symbolic and graphical forms representation of information is done. The general classification of compression technologies for graphical information is presented as well. The principles of design, tasks and variants for realizations of semantic compression technology of graphical information are suggested.

A Sensitive Metric of Class Cohesion

Metrics estimate the quality of different aspects of software. In particular, cohesion indicates how well the parts of a system hold together. A metric to evaluate class cohesion is important in object-oriented programming because it gives an indication of a good design of classes. There are several proposals of metrics for class cohesion but they have several problems (for instance, low discrimination). In this paper, a new metric to evaluate class cohesion is proposed, called SCOM, which has several relevant features. It has an intuitive and analytical formulation, what is necessary to apply it to large-size software systems. It is normalized to produce values in the range [0..1], thus yielding meaningful values. It is also more sensitive than those previously reported in the literature. The attributes and methods used to evaluate SCOM are unambiguously stated. SCOM has an analytical threshold, which is a very useful but rare feature in software metrics. We assess the metric with several sample cases, showing that it gives more sensitive values than other well know cohesion metrics.

Multiplierless DCT Algorithm for Image Compression Applications

This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of 8x8 2-D Discrete Cosine Transform. The architecture uses a new algebraic integer encoding of a 1-D radix-8 DCT that allows the separable computation of a 2-D 8x8 DCT without any intermediate number representation conversions. This is a considerable improvement on previously introduced algebraic integer encoding techniques to compute both DCT and IDCT which eliminates the requirements to approximate the transformation matrix ele- ments by obtaining their exact representations and hence mapping the transcendental functions without any errors. Apart from the multiplication-free nature, this new mapping scheme fits to this algorithm, eliminating any computational or quantization errors and resulting short-word-length and high-speed-design.

Radial deformation measurement of a cylinder under compression using multicore fibre

A multicore fibre (MCF) sensor to measure the radial deformation of a compliant cylinder under compression is presented. The sensor is connectorised and need not be permanently bonded to the test object. A differential measurement technique using FBGs written into the MCF makes the sensor temperature insensitive. FBG measurement of axial strain of a cylinder under compression is also reported.

Anisotropic characterization of crack growth in the tertiary flow of asphalt mixtures in compression

Asphalt mixtures exhibit primary, secondary, and tertiary stages in sequence during a rutting deterioration. Many field asphalt pavements are still in service even when the asphalt layer is in the tertiary stage, and rehabilitation is not performed until a significant amount of rutting accompanied by numerous macrocracks is observed. The objective of this study was to provide a mechanistic method to model the anisotropic cracking of the asphalt mixtures in compression during the tertiary stage of rutting. Laboratory tests including nondestructive and destructive tests were performed to obtain the viscoelastic and viscofracture properties of the asphalt mixtures. Each of the measured axial and radial total strains in the destructive tests were decomposed into elastic, plastic, viscoelastic, viscoplastic, and viscofracture strains using the pseudostrain method in an extended elastic-viscoelastic correspondence principle. The viscofracture strains are caused by the crack growth, which is primarily signaled by the increase of phase angle in the tertiary flow. The viscofracture properties are characterized using the anisotropic damage densities (i.e., the ratio of the lost area caused by cracks to the original total area in orthogonal directions). Using the decomposed axial and radial viscofracture strains, the axial and radial damage densities were determined by using a dissipated pseudostrain energy balance principle and a geometric analysis of the cracks, respectively. Anisotropic pseudo J-integral Paris' laws in terms of damage densities were used to characterize the evolution of the cracks in compression. The material constants in the Paris' law are determined and found to be highly correlated. These tests, analysis, and modeling were performed on different asphalt mixtures with two binders, two air void contents, and three aging periods. Consistent results were obtained; for instance, a stiffer asphalt mixture is demonstrated to have a higher modulus, a lower phase angle, a greater flow number, and a larger n1 value (exponent of Paris' law). The calculation of the orientation of cracks demonstrates that the asphalt mixture with 4% air voids has a brittle fracture and a splitting crack mode, whereas the asphalt mixture with 7% air voids tends to have a ductile fracture and a diagonal sliding crack mode. Cracks of the asphalt mixtures in compression are inclined to propagate along the direction of the external compressive load. © 2014 American Society of Civil Engineers.

Multiplicative Systems on Ultra-Metric Spaces

AMS Subj. Classification: MSC2010: 42C10, 43A50, 43A75

New Vacuum Solutions for Quadratic Metric-Affine Gravity - a Metric Affine Model for the Massless Neutrino?

AMS Subj. Classification: 83C15, 83C35