Intrusion Detection Architecture Utilizing Graphics Processors

With the thriving technology and the great increase in the usage of computer networks, the risk of having these network to be under attacks have been increased. Number of techniques have been created and designed to help in detecting and/or preventing such attacks. One common technique is the use of Intrusion Detection Systems (IDS). Today, number of open sources and commercial IDS are available to match enterprises requirements. However, the performance of these systems is still the main concern. This paper examines perceptions of intrusion detection architecture implementation, resulting from the use of graphics processor. It discusses recent research activities, developments and problems of operating systems security. Some exploratory evidence is presented that shows capabilities of using graphical processors and intrusion detection systems. The focus is on how knowledge experienced throughout the graphics processor inclusion has played out in the design of intrusion detection architecture that is seen as an opportunity to strengthen research expertise

PSVDAG: Compact Voxelized Representation of 3D Scenes Using Pointerless Sparse Voxel Directed Acyclic Graphs

This paper deals with the issue of geometry representation of voxelized three-dimensional scenes using hierarchical data structures. These include pointerless Sparse Voxel Octrees that have no pointers on child nodes and allow a compact binary representation. However, if necessary, there is a possibility to reconstruct these pointers for rapid traversing. Sparse Voxel Directed Acyclic Graphs added 32-bit pointers to child nodes and merging of common subtrees, which can be considered lossless compression. By merging common subtrees, no decompression overhead occurs at the time of traversing. The hierarchical data structure proposed herein - the Pointerless Sparse Voxel Directed Acyclic Graph - incorporates the benefits of both - pointerless Sparse Voxel Octrees (by avoiding storing pointers on child nodes) and Sparse Voxel Directed Acyclic Graphs (by allowing the merging of common subtrees due the introduction of labels and callers). The proposed data structure supports the quick and easy reconstruction of pointers by introducing the Active Child Node Count. It also potentially allows Child Node Mask compression of its nodes. This paper presents the proposed data structure and its binary-level encoding in detail. It compares the effectiveness of the representation of voxelized three-dimensional scenes (originally represented in OBJ format) in the proposed data structure with the data structures mentioned above. It also summarizes statistical data providing a more detailed description of the various parameters of the data structure for different scenes stored in multiple resolutions

Testing of xtUML Models across Auto-Reflexive Software Architecture

Application of MDA in the software development enables a synchronization of the system models and corresponding source files used for the building of the executable version of a software system. Because of often use of manual modifications of some parts of code without equivalent changes in connected models, there is no guarantee that the output of the process of building of the target application will be consistent with the relevant design and implementation models. Possibility of generating of the source files from the models is a necessity, but not a sufficient condition in the process of development and modification of software systems synchronously with the changes in all related models.  More safe approach is building the target application with the use of an automated building process with nested steps for consistency verifications of all critical models and related source files and the usage of model compilers. This article describes the method and tools for extending the software process of building the target system using special files with specification of dependencies between models and source files. Such dependencies represent the core of the critical knowledge, and it is possible to make this knowledge an integral part of the proposed new software architecture

Multi-Carrier Steganographic Algorithm Using File Fragmentation of FAT FS

Steganography is considered to be not only a science, but also a craft of concealing ongoing communication by hiding messages in unsuspicious cover documents, such as texts, digital images, audio and video sequences. Its essential feature is the constant search for - often exceptionally creative - possibilities of concealing information. In computers, steganography often uses secondary memory and exchangeable memory media utilising file systems. This paper deals with the current state of the issues related to information hiding by means of hard disks, being the most important source of forensic data. This paper focuses on information hiding using the File Allocation Table (FAT) file system. It also proposes a novel multi-carrier algorithm of hiding information in file fragmentation. The algorithm provides flexibility of encoding the information to be hidden and makes steps toward optimization that allows reduction of interference with the current state of the file system, represented by the statistical values of the file fragmentation parameters

Agent-Based Model of the Spectrum Auctions with Sensing Imperfections in Dynamic Spectrum Access Networks

Cognitive radio (CR) is the underlying platform for the application of dynamic spectrum access (DSA) networks. Although the auction theory and spectrum trading mechanisms have been discussed in the CR related works, their joint techno-economic impact on the efficiency of distributed CR networks has not been researched yet. In this paper we assume heterogeneous primary channels with network availability statistics unknown to each secondary user (SU) terminal. In order to detect the idle primary user (PU) network channels, the SU terminals trigger regularly the spectrum sensing mechanism and make the cooperative decision regarding the channel status at the fusion center. The imperfections of the spectrum mechanism create the possibility of the channel collision, resulting in the existence of the risk (in terms of user collision) in the network. The spectrum trading within SU network is governed by the application of the sealed-bid first-price auction, which takes into account the channel valuation as well as the statistical probability of the risk existence. In order to maximize the long-term payoff, the SU terminals take an advantage of the reinforcement comparison strategy. The results demonstrate that in the investigated model, total revenue and total payoff of the SU operator (auctioneer) and SU terminals (bidders) are characterized by the existence of the global optimum, thus there exists the optimal sensing time guaranteeing the optimum economic factors for both SU operator and SU terminals

Investigating Translators’ Work-related Happiness: Slovak Sworn and Institutional Translators as a Case in Point

This paper reports on an investigation which is part of a comprehensive project aimed at investigating translators’ work-related happiness in various contexts, a subject largely under-researched in contemporary translation studies. The purpose of this pilot cohort study is to determine the perceptions of happiness in two presumably high-profile groups of translators—Slovak sworn translators and Slovak EU translators. To accomplish the aim, comparative and causal perspectives are used. The quantitative analysis, comprising descriptive and correlation analysis, involves data from questionnaires completed by a total of 115 translators belonging to the two groups (83 + 32). The respondents’ perceptions of their work-related happiness are examined and compared, based on their responses to questions revolving primarily around social status variables and parameters of occupational prestige. Based on the gained data, seven hypotheses are tested with quantitative research methods employing contingency tables. Although our findings largely do not corroborate the hypotheses and lead to the identification of crucial differences between the two groups, the analyses also allow us to identify some commonalities. The results of the quantitative analysis are discussed in detail.L’article rend compte d’une enquête effectuée au sein d’un projet d’ensemble visant à examiner, dans divers contextes, le bonheur professionnel des traducteurs, sujet largement négligé par les traductologues contemporains. Cette étude de cohorte pilote cherche à saisir la perception du bonheur dans deux groupes de traducteurs considérés de haut niveau – traducteurs assermentés slovaques et traducteurs slovaques travaillant pour l’UE. Pour atteindre l’objectif fixé, des perspectives comparatives et causales sont mises en place. Les données issues de questionnaires remplis par 115 traducteurs appartenant aux deux groupes (83 + 32) en question sont soumises à une analyse quantitative comprenant une analyse descriptive et une analyse de corrélation. La perception que les répondants ont de leur bonheur au travail est examinée et comparée à partir de leurs réponses aux questions concernant principalement des variables inhérentes au statut social et des paramètres de prestige professionnel. Sur la base des données obtenues, sept hypothèses sont formulées et vérifiées au moyen de méthodes de recherche quantitatives exploitant des tableaux de contingence. Bien que dans la plupart des cas nos découvertes ne corroborent pas les hypothèses et permettent de découvrir plusieurs différences cruciales entre les deux groupes, les analyses font également apparaître certains points communs. Les résultats de l’analyse quantitative sont examinés en détail.Este artículo informa de una investigación que es una parte de un proyecto más amplio dirigido a la investigación de la felicidad laboral de los traductores. Este tema cuenta con muy pocos estudios en la traductología contemporánea en diferentes contextos. El propósito de este estudio piloto de cohorte es determinar la percepción de la felicidad en dos grupos de traductores considerados de alto nivel profesional – los traductores jurados eslovacos y los traductores eslovacos de la UE. Para lograr este objetivo, utilizamos el punto de vista comparativo y causal. El análisis cuantitativo incluye un análisis descriptivo y correlativo de los datos obtenidos de cuestionarios respondidos por 115 traductores pertenecientes a los dos grupos (83+32). Analizamos y comparamos la percepción de la felicidad laboral en base a las respuestas relacionadas ante todo con las variables de estatus social y los parámetros de prestigio profesional. Sobre la base de los datos obtenidos probamos siete hipótesis por medio de métodos de investigación cuantitativos con empleo de tablas de contingencia. Aunque nuestras conclusiones en gran parte no corroboran las hipótesis e indican algunas diferencias cruciales entre los dos grupos, los análisis también nos permiten identificar algunas similitudes. Los resultados del análisis cuantitativo son discutidos detalladamente

Android Access Control Extension

The main objective of this work is to analyze and extend security model of mobile devices running on Android OS. Provided security extension is a Linux kernel security module that allows the system administrator to restrict program's capabilities with per-program profiles. Profiles can allow capabilities like network access, raw socket access, and the permission to read, write, or execute files on matching paths. Module supplements the traditional Android capability access control model by providing mandatory access control (MAC) based on path. This extension increases security of access to system objects in a device and allows creating security sandboxes per application

Testing of xtUML Models across Auto-Reflexive Software Architecture

Application of MDA in the software development enables a synchronization of the system models and corresponding source files used for the building of the executable version of a software system. Because of often use of manual modifications of some parts of code without equivalent changes in connected models, there is no guarantee that the output of the process of building of the target application will be consistent with the relevant design and implementation models. Possibility of generating of the source files from the models is a necessity, but not a sufficient condition in the process of development and modification of software systems synchronously with the changes in all related models. More safe approach is building the target application with the use of an automated building process with nested steps for consistency verifications of all critical models and related source files and the usage of model compilers. This article describes the use of xtUML and OAL for extending the software process of building the target system using special files with specification of dependencies between models and source files. Such dependencies represent the core of the critical knowledge, and it is possible to make this knowledge an integral part of the proposed new software architecture

CSVO: Clustered Sparse Voxel Octrees—A Hierarchical Data Structure for Geometry Representation of Voxelized 3D Scenes

When representing the geometry of voxelized three-dimensional scenes (especially if they have been voxelized to high resolutions) in a naive—uncompressed—form, one may end up using vast amounts of data. These can easily attack the available memory capacity of the graphics card, the operating memory or even secondary storage of computer. A viable solution to this problem is to use domain-specific hierarchical data structures, based on octant trees or directed acyclic graphs, which, among other advantages, provide a compact binary representation that can thus be considered to be their compressed encoding. These data structures include—inter alia—sparse voxel octrees, sparse voxel directed acyclic graphs and symmetry-aware sparse voxel directed acyclic graphs. The paper deals with the proposal of a new domain-specific hierarchical data structure: the clustered sparse voxel octrees. It is designed to represent the geometry of voxelized three-dimensional scenes and can be constructed using the out-of-core algorithm proposed in the paper. The advantage of the presented data structure is in its compact binary representation, achieved by omitting a significant number of pointers to child nodes (82.55% in case of Angel Lucy model in 1283 voxels resolution) and by using a wider range of child node pointer lengths, including 8b, 16b and 32b. We achieved from 6.57 to 6.82 times more compact encoding, compared to sparse voxel octrees, whose all node components were 32b aligned, and from 4.11 to 4.27 times more compact encoding, when not all node components were 32b aligned