Universal Stegoconstructor in Context of Intellectual Property Protection
Information interchange is one of the main processes in our everyday life. This process was simplified due to development of modern technologies, especially computer technologies. But the drawback of such transfer is the simplification of copyrights infringement. Steganography is modern science with old historical roots, its goal is during transmission to hide secret information. This science has some trends; in this case digital steganography is the most actual trend. One of digital steganography's research branches tries to find possible solutions of this problem. As a result of given researches the technologies of watermarks and fingerprints appeared. This paper contains information about the conception of digital steganography's development as protection method of the intellectual property. The basic scope of watermarking is classified, and the problem of selection of appropriate steganographic copyrights methods is designated. Eventually the universal constructor presented in the previous research is extended and adapted to resolve problem mentioned.
Kutter Steganographical Method's Improvement and Concept of Universal Stegoconstructor
Information interchange is one of the main processes in human everyday life. This process was simplified due to development of modern technologies, especially computer technologies. But the drawback of such transmission is data exposure. Steganography tries to find possible decisions of this problem. The main difference between steganography and cryptography: malicious person has no any data about information hiding in first case. That's mean he doesn't think about possible valuable information in message. This paper contains information about the conception of digital steganography's development as protection method of the confidential information. Classification of the basic scopes is given, and the problems facing to the given science are explained. Some aspects of steganography were examined in the context of the theory of signal transmission. The properties of possible universal stegomethod's constructor are determined on the basis of required transmission's reliability. The way, which increases the probability of a bit correct detecting in Kutter method till 70%, is offered as improvement of data embedding procedure. Disadvantages of the original steganographical Kutter method's were commented at the same time. Results of experiments are presented as numerous histograms.
Blocking and Non-Blocking Process Synchronization: Analysis of Implementation
—In computer programs with multiple processes, inter-process communication is of high importance. One of its main aspects is process synchronization, which can be divided into two classes: blocking and non-blocking. Blocking synchronization is simpler and mostly used; however, non-blocking synchronization allows avoiding some negative effects. In this paper, there is discussed the logic of widespread process synchronization mechanisms and is analyzed the support of these mechanisms in different platforms.
Implementation of Cryptographic Algorithms in Software: An Analysis of the Effectiveness
The goal of the paper is to discuss some possibilities of effective implementing cryptographic algorithms in software development. There are concerned two aspects of the term "effectiveness": efficacy (i.e., meeting a goal of using cryptographic algorithms - providing a protection of information) and efficiency (i.e., implementing cryptographic algorithms in an economical way; as well as implementing cryptographic algorithms to the effect that they execute in an economical way). In the paper, there are defined and classified errors which are the causes of possible vulnerabilities in implementation of cryptographic algorithms on a computer. There are given general recommendations, how to escape from these vulnerabilities. There is also considered implementation of cryptographic algorithms in software development by using software libraries and frameworks. Several widespread software frameworks which provide cryptographic functionality are compared with each other by the speed of execution of algorithms. Finally, there are discussed some possibilities of maximising the speed of execution of cryptographic algorithms, emphasising the importance of parallelisation of algorithms. For block ciphers, possible parallelisation is discussed especially deeply, referencing the results obtained in practical experiments that demonstrate and estimate the benefits of parallelising block ciphers.
The Definition of Framework for Automated Creation of Graph Visualization Systems
In this paper the authors perform an analysis of automated creation of graph visualization systems (GVS). The complete process, starting with definition of functional requirements for GVS and finishing with evaluation of resulting system, is described. The overview of each construction step is provided. The set of metric types is developed for evaluation of resulting GVS. Features of existing solutions are compared with proposed framework. Conclusions are made and further researches are defined.
Definition of General Requirements for Graph Visualization Software
This paper contains comparative analysis of some modern graph visualization packages (for example, "Graphviz", "yFiles", "Wilmascope 3D", etc) in order to outline and characterize general requirements that could be useful for development of new graph visualization software (GVS). Relations between identified requirements and necessary related components of potential GVS are being derived. To precise these requirements there were studied an additional theoretical information sources. The main goal of this research is to improve development of new GVS providing mechanism of design templates for different kinds of tasks (for example - visualization of general graphs, diagrams, routing and communication networks, etc). The result of this research is presented in tabular form. That allows identifying the set of main components of new frameworks at early stages of software development (starting with a list of desired features and transforming it into a list of necessary components). An example of using such table in DBMS MS Access environment is provided in a study of development of imaginary GVS as a part of generic air traffic control routing system. There is made conclusion about the achieved results. It is presented information about future researches in this field.
In this article, the authors perform an analysis in order to assess adaptation of magnetic force-directed algorithms for context-based information extraction from multi-attributed graphs during visualization sessions. Theoretic standings behind magnetic force-directed approach are stated together with review on how particular features of respective algorithms in combination with appropriate visual techniques are especially suitable for improved processing and presenting of knowledge that is captured in form of graphs. The complexity of retrieving multi-attributed information within the proposed approach is handled with dedicated tools, such as selective attraction of nodes to MFE (Magnetic Force Emitter) based on search criteria, localization of POI (Point of Interest) regions, graph node anchoring, etc. Implicit compatibility of aforementioned tools with interactive nature of data exploration is distinguished. Description of case study, based on bibliometric network analysis is given, which is followed by the review of existing related works in this field. Conclusions are made and further studies in the field of visualization of multi-attributed graphs are defined.
In this paper authors perform a research on possibilities of RDF (Resource Description Framework) syntaxes usage for information representation in Semantic Web. It is described why pure XML cannot be effectively used for this purpose, and how RDF framework solves this problem. Information is being represented in a form of a directed graph. RDF is only an abstract formal model for information representation and side tools are required in order to write down that information. Such tools are RDF syntaxes – concrete text or binary formats, which prescribe rules for RDF data serialization. Text-based RDF syntaxes can be developed on the existing format basis (XML, JSON) or can be an RDF-specific – designed from scratch to serve the only purpose – to serialize RDF graphs. Authors briefly describe some of the RDF syntaxes (both XML and non-XML) and compare them in order to identify strengths and weaknesses of each version. Serialization and deserialization speed tests using Jena library are made. The results from both analytical and experimental parts of this research are used to develop the recommendations for RDF syntaxes usage and to design a RDF/XML syntax subset, which is intended to simplify the development and raise compatibility of information serialized with this RDF syntax.
The goal of this paper is to give a specification of the software framework that evaluates the efficiency of different mechanisms for concurrent processes, notably process synchronization mechanisms. The paper discusses the concept of this framework, the potential users of it and some necessary considerations, including assumptions. Further, it defines general requirements for the framework and presents its desired conceptual design. The conclusions and possible directions for future work end the paper.
The paper focuses on the comparison of video steganography methods for the purpose of digital watermarking in the context of copyright protection. Four embedding methods that use Discrete Cosine and Discrete Wavelet Transforms have been researched and compared based on their embedding efficiency and fidelity. A video steganography program has been developed in the Java programming language with all of the researched methods implemented for experiments. The experiments used 3 video containers with different amounts of movement. The impact of the movement has been addressed in the paper as well as the ways of potential improvement of embedding efficiency using adaptive embedding based on the movement amount. Results of the research have been verified using a survey with 17 participants.