Computing and Informatics (E-Journal - Institute of Informatics, SAS, Bratislava)
Not a member yet
1506 research outputs found
Sort by
Towards the Knowledge in Coalgebraic Model of IDS
Get PDFIn the last decades linear logic became a useful logical system for various usage in computer science. Its ability to handle resources and its competence to describe dynamics of processes predetermine it for describing behaviour of programs and program systems. Linear logic can be apprehended as a multiplicative and additive extension of usual logic. We show the possibilities how these fragments can be enriched to describe behaviour and to achieve knowledge on an example of simplified Intrusion Detection System (IDS). We construct Kripke model over a coalgebra of modal linear logic for pursuing observable behaviour of IDS. Using the same Kripke frame we show how knowledge and belief in the terms of epistemic linear logic can be achieved
New Science Gateways for Advanced Computing Simulations and Visualization Using Vine Toolkit in PL-Grid
Get PDFA Science Gateway is a connection between scientists and their computational tools in the form of web portal. It creates a space for communities, collaboration and data sharing and visualization in a comprehensive and efficient manner. The main purpose of such a solution is to allow users to access the computational resources, process and analyze their data and get the results in a uniform and user friendly way. In this paper we propose a complex solution based on the Rich Internet Application (RIA) approach consisting of a web portal powered by Vine Toolkit with Adobe Flex/BlazeDs technologies. There are two Science Gateways described in detail one for engineers to manage computationally intensive workflows used in advanced airplane construction simulations, and one for nanotechnology scientists to manage experiments in nano-science field calculated with Density Functional Theory (DFT). In both cases the results show how modern web solution can help scientists in their work.  
Hysteretic Control Technique for Overload Problem Solution in Network of SIP Servers
Get PDFThis paper contains research and development results concerning application of hysteretic control principles to solve SIP servers overload problem, which is known from a number of IETF standards and scientific papers published over the past few years. The problem is that SIP protocol, being the application layer protocol, by default has no build-in means of overload control, as, for example, SS7, MTP2 and MTP3 protocols. It was the SS7 network, where a threshold mechanism of hysteretic signalling load control was first implemented. In this paper we describe the main up-to-date solutions of an overload control problem in a signalling network, and develop analytical models of hysteretic control, which are useful in the development of load management functions of SIP servers. We also propose the design of Open SIP signalling Node (OSN) software architecture which is intended to be used for simulations and comparison of various overload control mechanisms
A SPEMOntology for Software Processes Reusing
Get PDFReusing the best practices and know-how capitalized from existing software process models is a promising solution to model high quality software processes. This paper presents a part of AoSP (Architecture oriented Software Process) for software processes reuse based on software architectures. The solution is proposed after the study of existing works on software process reusing. AoSP approach deals with the engineering "for" and "by" reusing software processes, it exploits the progress of two research fields that promote reusing in order to improve the software process reusing: domain ontologies and software architectures. AoSP exploits a domain ontology to reuse software process know-how, it allows retrieving, describing and deploring software process architectures. This article details the engineering "for" reusing SPs step of AoSP, it explains how the software process architectures are described and discusses the software process ontology conceptualization and software process knowledge acquisition
An Executable Service Composition Code Automatic Creation Tool Based on Petri Net Model
Get PDFFor Web services composition problem, this paper proposes an executable code creation algorithm to model Web services composition based on Petri net model, and develops an executable composition code automatic creation tool. This tool can achieve the automatic creation process from composition model to executable code, and more meaningfully makes it possible to analyze and validate composition process logically. Finally, experiment results have proven that the tool of this paper is feasible
Applying Clustering Techniques in Hybrid Network in the Presence of 2D and 3D Obstacles
Get PDFClustering spatial data is a well-known problem that has been extensively studied. In the real world, there are many physical obstacles such as rivers, lakes, highways, and mountains, whose presence may substantially affect the clustering result. Although many methods have been proposed in previous works, very few have considered physical obstacles and interlinking bridges. Taking these constraints into account during the clustering process is costly, yet modeling the constraints is paramount for good performance. Owing to saturation in existing telephone networks and the ever increasing demand for wire and wireless services, telecommunication engineers are looking at technologies that can deliver sites and satisfy the demand and level of service constraints in an area with and without obstacles. In this paper, we study the problem of clustering in the presence of obstacles to solve the network planning problem. As such, we modified the NetPlan algorithm and developed the COD-NETPLAN (Clustering with Obstructed Distance -- Network Planning) algorithm to solve the problem of 2D and 3D obstacles. We studied the problem of determining the location of the multi-service access node in an area with many mountains and rivers. We used a reachability matrix to detect 2D obstacles, and line segment intersection together with geographical information system techniques for 3D obstacles. Experimental results and the subsequent analysis indicate that the COD-NETPLAN algorithm is both efficient and effective
Rough Fuzzy Subspace Clustering for Data with Missing Values
Get PDFThe paper presents rough fuzzy subspace clustering algorithm and experimental results of clustering. In this algorithm three approaches for handling missing values are used: marginalisation, imputation and rough sets. The algorithm also assigns weights to attributes in each cluster; this leads to subspace clustering. The parameters of clusters are elaborated in the iterative procedure based on minimising of criterion function. The crucial parameter of the proposed algorithm is the parameter having the influence on the sharpness of elaborated subspace cluster. The lower values of the parameter lead to selection of the most important attribute. The higher values create clusters in the global space, not in subspaces. The paper is accompanied by results of clustering of synthetic and real life data sets
Illumination Correction on Biomedical Images
Get PDFRF-Inhomogeneity Correction (aka bias) artifact is an important research field in Magnetic Resonance Imaging (MRI). Bias corrupts MR images altering their illumination even though they are acquired with the most recent scanners. Homomorphic Unsharp Masking (HUM) is a filtering technique aimed at correcting illumination inhomogeneity, but it produces a halo around the edges as a side effect. In this paper a novel correction scheme based on HUM is proposed to correct the artifact mentioned above without introducing the halo. A wide experimentation has been performed on MR images. The method has been tuned and evaluated using the simulated Brainweb image database. In this framework, the approach has been compared successfully against the Guillemaud filter and the SPM2 method. Moreover, the method has been successfully applied on several real MR images of the brain (0.18 T, 1.5 T and 7 T). The description of the overall technique is reported along with the experimental results that show its effectiveness in different anatomical regions and its ability to compensate both underexposed and overexposed areas. Our approach is also effective on non-radiological images, like retinal ones
LOGOS: Enabling Local Resource Managers for the Efficient Support of Data-Intensive Workflows within Grid Sites
Get PDFIn this study we discuss how to enable grid sites for the support of data-intensive workflows. Usually, within grid sites, tasks and resources are administrated by local resource managers (LRMs). Many of LRMs have been designed for managing compute-intensive applications. Therefore, data-intensive workflow applications might not perform well on such environments due to the number and size of data transfers between tasks. To improve the performance of such kind of applications it is necessary to redefine the scheduling policies integrated on LRMs. This paper proposes a novel scheme for efficiently supporting data-intensive workflows in LRMs within grid sites. Such scheme is partially implemented in our grid middleware LOGOS and used to improve the performance of a well known LRM: HTCondor. The core of LOGOS is a novel communication-aware scheduling algorithm (PPSA) capable of finding near-optimal solutions. Experiments conducted in this study showed that our approach leads to performance improvements up to 52 % in the management of data-intensive workflow applications
Compact Indexes Based on Core Content in Personal Dataspace Management System
Get PDFA Personal DataSpace Management System is a platform to manage personal data with heterogeneous data types, in which keyword query is a primary query form for users who know little about the structure of the dataspace. Unlike exploratory queries in web search, a user in a personal dataspace usually has a specific search target and wants to find some known items in mind. To improve result quality in terms of query relevance in a personal dataspace, we propose the concept of compact index in this paper. We refer to the most important and representative semantics from documents as core content, and build compact index on it. We propose algorithm for selecting core content from a document based on semantic analysis, which can process English and Chinese documents uniformly. Furthermore, a software platform named Versatile is introduced for flexible personal data management, in which core content is extracted for building compact indexes and generating query-biased snippet efficiently and accurately. Finally, extensive experiments have been conducted to show the effectiveness and feasibility of compact indexes in personal dataspace management system