DSpace Collection: Volume 8 Number 4
http://hdl.handle.net/10525/2470
The Collection's search engineSearch the Channelsearch
http://sci-gems.math.bas.bg/jspui/simple-search
An Approach for a more Objective Evaluation of Practical Projects, Used in the Training Process
http://hdl.handle.net/10525/2480
Title: An Approach for a more Objective Evaluation of Practical Projects, Used in the Training Process<br/><br/>Authors: Delinov, Emil; Eskenazi, Avram<br/><br/>Abstract: Well–prepared, adaptive and sustainably developing specialistsare an important competitive advantage, but also one of the main challengesfor businesses. One option of the education system for creation and developmentof staff adequate to the needs is the development of pro jects withtopics from real economy ("Practical Projects").The objective assessment is an essential driver and motivator, and is based ona system of well-chosen, well-defined and specific criteria and indicators.An approach to a more objective evaluation of practical projects is finding moreobjective weights of the criteria.A natural and reasonable approach is the accumulation of opinions of provenexperts and subsequent bringing out the weights from the accumulated data.The preparation and conduction of a survey among recognized experts in the fieldof project-based learning in mathematics, informatics and information technologiesis described. The processing of the data accumulated by applying AHP, allowed usto objectively determine weights of evaluation criteria and hence to achievethe desired objectiveness.ACM Computing Classification System (1998): K.3.2.VisibleZ: A Mainframe Architecture Emulator for Computing Education
http://hdl.handle.net/10525/2479
Title: VisibleZ: A Mainframe Architecture Emulator for Computing Education<br/><br/>Authors: Woolbright, David; Zanev, Vladimir; Rogers, Neal<br/><br/>Abstract: This paper describes a PC-based mainframe computer emulatorcalled VisibleZ and its use in teaching mainframe Computer Organizationand Assembly Programming classes.VisibleZ models IBM’s z/Architectureand allows direct interpretation of mainframe assembly language objectcode in a graphical user interface environment that was developed in Java.The VisibleZ emulator acts as an interactive visualization tool to simulateenterprise computer architecture. The provided architectural componentsinclude main storage, CPU, registers, Program Status Word (PSW), andI/O Channels. Particular attention is given to providing visual clues tothe user by color-coding screen components, machine instruction execution,and animation of the machine architecture components.Students interact with VisibleZ by executing machine instructions in a step-by-stepmode, simultaneously observing the contents of memory, registers, and changes inthe PSW during the fetch-decode-execute machine instruction cycle. Theobject-oriented design and implementation of VisibleZ allows students todevelop their own instruction semantics by coding Java for existing specificz/Architecture machine instructions or design and implement new machineinstructions.The use of VisibleZ in lectures, labs, and assignments is describedin the paper and supported by a website that hosts an extensivecollection of related materials. VisibleZ has been proven a useful tool inmainframe Assembly Language Programming and Computer Organizationclasses. Using VisibleZ, students develop a better understanding ofmainframe concepts, components, and how the mainframe computer works.ACM Computing Classification System (1998): C.0, K.3.2.An Adaptation of the Hoshen-Kopelman Cluster Counting Algorithm for Honeycomb Networks
http://hdl.handle.net/10525/2478
Title: An Adaptation of the Hoshen-Kopelman Cluster Counting Algorithm for Honeycomb Networks<br/><br/>Authors: Popova, Hristina<br/><br/>Abstract: We develop a simplified implementation of the Hoshen-Kopelman cluster countingalgorithm adapted for honeycomb networks.In our implementation of the algorithm we assume that all nodes in the networkare occupied and links between nodes can be intact or broken.The algorithm counts how many clusters there are in the network and determineswhich nodes belong to each cluster. The network information is stored intotwo sets of data. The first one is related to the connectivity of the nodes andthe second one to the state of links. The algorithm finds all clusters in onlyone scan across the network and thereafter cluster relabeling operates on avector whose size is much smaller than the size of the network. Countingthe number of clusters of each size, the algorithm determines the clustersize probability distribution from which the mean cluster size parameter canbe estimated. Although our implementation of the Hoshen-Kopelman algorithmworks only for networks with a honeycomb (hexagonal) structure, itcan be easily changed to be applied for networks with arbitrary connectivitybetween the nodes (triangular, square, etc.).The proposed adaptation of the Hoshen-Kopelman cluster counting algorithmis applied to studying the thermal degradation of a graphene-like honeycombmembrane by means of Molecular Dynamics simulation with a Langevin thermostat.ACM Computing Classification System (1998): F.2.2, I.5.3.Augmented Reality as a Method for Expanded Presentation of Objects of Digitized Heritage
http://hdl.handle.net/10525/2477
Title: Augmented Reality as a Method for Expanded Presentation of Objects of Digitized Heritage<br/><br/>Authors: Kolev, Alexander; Dimov, Dimo<br/><br/>Abstract: Augmented reality is the latest among information technologiesin modern electronics industry. The essence is in the addition of advancedcomputer graphics in real and/or digitized images. This paper gives a briefanalysis of the concept and the approaches to implementing augmentedreality for an expanded presentation of a digitized object of national culturaland/or scientific heritage.ACM Computing Classification System (1998): H.5.1, H.5.3, I.3.7.Representing Equivalence Problems for Combinatorial Objects
http://hdl.handle.net/10525/2476
Title: Representing Equivalence Problems for Combinatorial Objects<br/><br/>Authors: Bouyukliev, Iliya; Dzhumalieva-Stoeva, Mariya<br/><br/>Abstract: Methods for representing equivalence problems of various combinatorial objectsas graphs or binary matrices are considered. Such representations can be usedfor isomorphism testing in classification or generation algorithms.Often it is easier to consider a graph or a binary matrix isomorphism problemthan to implement heavy algorithms depending especially on particular combinatorialobjects. Moreover, there already exist well tested algorithms for the graph isomorphismproblem (nauty) and the binary matrix isomorphism problem as well (Q-Extension).ACM Computing Classification System (1998): F.2.1, G.4.Modular Digital Watermarking for Image Verification and Secure Data Storage in Web Applications
http://hdl.handle.net/10525/2475
Title: Modular Digital Watermarking for Image Verification and Secure Data Storage in Web Applications<br/><br/>Authors: Ilchev, Svetozar; Ilcheva, Zlatoliliya<br/><br/>Abstract: Our modular approach to data hiding is an innovative conceptin the data hiding research field. It enables the creation of modular digitalwatermarking methods that have extendable features and are designed foruse in web applications. The methods consist of two types of modules – abasic module and an application-specific module. The basic module mainlyprovides features which are connected with the specific image format.As JPEG is a preferred image format on the Internet, we have put a focuson the achievement of a robust and error-free embedding and retrieval ofthe embedded data in JPEG images. The application-specific modules areadaptable to user requirements in the concrete web application.The experimental results of the modular data watermarking are very promising.They indicate excellent image quality, satisfactory size of the embedded data andperfect robustness against JPEG transformations with prespecified compression ratios.ACM Computing Classification System (1998): C.2.0.