SAS Journals

Scientific Journals and Yearbooks Published at SAS

Article List

Computing and Informatics

Volume 25, 2006, No. 5

Content:

KIM, I. - KANG, M. - CHOI, J. - D. ZEGZHDA, P. - O. KALININ, M. - P. ZEGZHDA, D. - KANG, I.
Formal Verification of Security Model Using SPR Tool.
In Computing and Informatics. Vol. 25, no. 5 (2006), p. 353-368.
ORSAG, F.
Speaker Recognition in the Biometric Security Systems.
In Computing and Informatics. Vol. 25, no. 5 (2006), p. 369-391.
TOMAN, E. - STANEK, M.
Analysis of Greedy Algorithm for Vertex Covering of Random Graph by Cubes.
In Computing and Informatics. Vol. 25, no. 5 (2006), p. 393-404.
FRANKOVIC, B. - BUDINSKA, I. - DANG, T. - FLOOD, B. - SHEAHAN, C. - DANG, B.
Using Heuristic Search for Solving Single Machine Batch Processing Problems.
In Computing and Informatics. Vol. 25, no. 5 (2006), p. 405-420.
HLUCHY, L. - LACLAVIK, M. - BALOGH, Z. - BABIK, M.
AgentOWL: Semantic Knowledge Model and Agent Architecture.
In Computing and Informatics. Vol. 25, no. 5 (2006), p. 421-439.
STRNADEL, J.
Testability Analysis and Improvements of Register-Transfer Level Digital Circuits.
In Computing and Informatics. Vol. 25, no. 5 (2006), p. 441-464.

	Formal Verification of Security Model Using SPR Tool Il-Gon KIM, Miyoung KANG, Jin-Young CHOI, Peter D. ZEGZHDA, Maxim O. KALININ, Dmitry P. ZEGZHDA, Inhye KANG SPR (Safety Problem Resolver), SEW (Security Evaluation Workshop), SPSL (Safety Problem Specification Language) In this paper, formal verification methodologies and the SPR (Safety Problem Resolver) model checking tool are used for verifying a security model's safety. The SPR tool makes it possible to analyze security issues on security systems based on the access control model. To illustrate this approach, a case study of the Simple Access Control Model (SACM) is used and specific safety problems of the security model are analyzed using the SPR tool. Computing and Informatics. Volume 25, 2006, No. 5: 353-368.
	Speaker Recognition in the Biometric Security Systems Filip ORSAG Biometry, security systems, speaker recopgnition At present, the importance of the biometric security increases a lot in context of the events in the world. Development of the individual biometric technologies such as the fingerprint recognition, iris or retina recognition or speaker recognition has been considered very important. However, it comes to be true that only one biometric technology is not sufficient enough. One of the most prosperous solutions might be a combination of more such technologies. This article aims at the technology of the speaker recognition and proposes a solution of its integration into a more complex biometric security system. Herein a design of the complex biometric security system is introduced based on the speaker recognition and the fingerprint authentication. A method of acquisition of a unique vector from speaker specific features is introduced as well. Computing and Informatics. Volume 25, 2006, No. 5: 369-391.
	Analysis of Greedy Algorithm for Vertex Covering of Random Graph by Cubes Eduard TOMAN, Martin STANEK Random graphs, vertex covering, greedy algorithm We study randomly induced subgraphs G of a hypercube. Specifically, we investigate vertex covering of G by cubes. We instantiate a greedy algorithm for this problem from general hypergraph covering algorithm, and estimate the length of vertex covering of G. In order to obtain this result, a number of theoretical parameters of randomly induced subgraph G were estimated. Computing and Informatics. Volume 25, 2006, No. 5: 393-404.
	Using Heuristic Search for Solving Single Machine Batch Processing Problems BALTAZAR FRANKOVIC, IVANA BUDINSKA, Thanh-Tung DANG, Ben FLOOD, Con SHEAHAN, Bao-Lam DANG Scheduling, batch processing, optimization, heuristic search This paper deals with scheduling for single machine batch processing, specifically the transporting problem with one vehicle. Capacity restrictions of the machine are considered and the main objective is to find an assignment of jobs to achieve the minimal processing time of all batches, given these capacities. A polynomial algorithm is proposed for solving the case in which the jobs are non-preemptive, non-identical, and are known before the realization of the schedule. The proposed algorithm is implemented and shown to yield better results than alternatives from the literature. Computing and Informatics. Volume 25, 2006, No. 5: 405-420.
	AgentOWL: Semantic Knowledge Model and Agent Architecture LADISLAV HLUCHY, Michal LACLAVIK, Zoltan BALOGH, Marian BABIK Semantics, agent, architecture, knowledge model MAS is a powerful paradigm in nowadays distributed systems, however its disadvantage is that it lacks the interconnection with semantic web standards such as OWL. The aim of this article is to present a semantic knowledge model of an agent suitable for discrete environments as well as implementation and a use of such model using the Jena semantic web library and the JADE agent system. The developed library allows interconnection of Agent and Semantic Web technologies can be used in an agent based application where such interconnection is needed. The defined model and methodology show the use of the library in knowledge management applications where the proposed model has been used and evaluated in the scope of the Pellucid and K-Wf Grid IST projects. Computing and Informatics. Volume 25, 2006, No. 5: 421-439.
	Testability Analysis and Improvements of Register-Transfer Level Digital Circuits Josef STRNADEL Digital circuit, testing, register-transfer level, data path, testability analysis, design for testability, scan technique The paper presents novel testability analysis method applicable to register-transfer level digital circuits. It is shown if each module stored in a design library is equipped both with information related to design and information related to testing, then more accurate testability results can be achieved. A mathematical model based on virtual port conception is utilized to describe the information and proposed testability analysis method. In order to be effective, the method is based on the idea of searching two special digraphs developed for the purpose. Experimental results gained by the method are presented and compared with results of existing methods. Computing and Informatics. Volume 25, 2006, No. 5: 441-464.