Naudojant įprastas 2D failų naršykles esant dideliems (>1000) failų medžiams, kyla problemų, kaip patogiai ir greitai tvarkyti bylas. Šio darbo tikslas yra pasiūlyti patogesnį failų pavaizdavimo būdą ir sukurti didelių medžių failų naršyklės 3D vizualizaciją. Jai iškelti panaudojamumo kriterijai, pagal juos apžvelgiant pavaizdavimo būdus pasirinkta kūginių medžių vizualizacija, aprašyti sistemos reikalavimai, pasirinkta technologija ir realizuotas sistemos prototipas. Sukurta sistema FSN tenkina iškeltus kriterijus ir yra tinkama didelių failų medžių pavaizdavimui. / It is not convenient to browse large file systems (more than 1000 files) using ordinary 2D file browsers. The purpose of this paper is to suggest file tree visualization, suitable for large file trees and implement 3D file system browser prototype. According to the needed browser tasks, there was selected cone tree visualization, was defined specification, selected suitable technology and implemented 3D browser prototype. This system implemented all specified tasks and is suitable for large file tree visualization.

This paper examines the professional role of the music journalist and how it has been affected by the expansion of the Internet. The study aims to examine  the profession's outlook and how professional music journalists are working to reach the public with interesting information, despite the fact that the audience of today often can be first to deliver the news. Through qualitative research interviews with three current music journalists the professional role and its development is examined. Based on theories and previous research on journalism, how the media communicates and its importance to society, what it is to be a music journalist and the spread of digitization and the impact of file sharing the results are analyzed. The conclusions of the study are that it isn’t a profession that is disappearing but rather a profession that is working towards a new future. The wide range of social media and the ability to stream music via the music service Spotify, for example, is expanding the field of music and more music lovers can make their voices heard. The role of the music journalist is no longer to be first with the latest in the music world but to convey information best. / Denna uppsats undersöker musikjournalisternas yrkesroll och hur den har påverkats av internets expansion. Studiens syfte är att ta reda på yrkets framtidsutsikt och hur yrkesverksamma musikjournalister arbetar för att nå ut med intressant information, trots att dagens publik många gånger kan vara först med nyheterna. Genom kvalitativa forskningsintervjuer med tre aktuella musikjournalister undersöks yrkesrollen och dess utveckling. Med utgångspunkt från teorier och tidigare forskning om journalistyrket, hur medier kommunicerar och dess betydelse för samhället, hur det är att vara musikjournalist samt digitaliseringens utbredning och fildelningens konsekvenser analyseras resultatet. Slutsatserna för studien är att det inte är ett yrke som håller på att försvinna utan ett yrke som går mot en ny framtid. Det stora utbudet av sociala medier och möjligheten att lyssna på strömmad musik via exempelvis musiktjänsten Spotify breddar musikområdet och fler musikintresserade kan göra sin röst hörd. Musikjournalisternas roll handlar inte längre om att vara först med det senaste inom musikvärlden utan om att förmedla informationen bäst.

This project involved porting a Graphical Software Package (GSP) from the proprietary IDS-BO Gerber CAD system onto a more modern computer that would allow student access for further study and development. Because of the popularity of Unix as an "open systems environment", the computer chosen was an HP9000 using the HP-UX operating system. In addition, it was decided to implement a standard Graphical Kernel System (GKS) interface to provide further portability and to cater for the expected growth of the GKS as an international standard. By way of introduction, a brief general overview of computer graphics, some of the essential considerations for the design of a graphics package and a description of the work undertaken are presented. Then follows a detailed presentation of the two systems central to this project i) the lDS-8O Gerber proprietary CAD system, with particular attention being paid to the Graphical Software Package (GSP) which it uses and ii) the Graphical Kernel System (GKS) which has become a widely accepted international graphics standard. The major differences between the lDS-8O Gerber GSP system and the GKS system are indicated. Following the theoretical presentation of the GSP and GKS systems, the practical work involved in first implementing a "skeleton" GKS interface on the HP9000 Unix System, incorporating the existing Advanced Graphics Package (AGP) is presented. The establishment of a GKS interface then allows an lDS-8O Gerber GSP interface to be developed and mapped onto this. Detailed description is given of the methods employed for this implementation and the reasons for the data structures chosen. The procedures and considerations for the testing and verification of the total .system implemented on the HP9000 then follow. Original lDS-8O Gerber 2-D .applications software was used for the purpose of testing. The implementation of the data base that this software uses is also presented. Conclusions on system performance are finally presented as well as suggested areas for possible further work. / Thesis (M.Sc.)-University of Natal, Durban, 1989.

Šio darbo tikslas – išanalizuoti pasirinktas rinkmenų paieškos sistemas bei pasirinkta optimaliausia metodika sukurti elektroninių dokumentų paieškos sistemą, kuri leistų sumažinti laiko sanaudas ieškant rinkmenų vietinio tinklo serveryje ir vietiniame tinkle sujungtuose kompiuteriuose. Darbe aprašytos elektroninių dokumentų savybės, paieškos metodikos teoriniai ir praktiniai aspektai. Atlikta pasirinktų rinkmenų paieškos sistemų lyginamoji analizė. Šio tyrimo problema: vidutinio dydžio įmonėje ar įstaigoje sunku greitai surasti ir peržiūrėti dokumentus, naudojamus vietiniame serveryje ar tinklo kompiuteriuose. Išanalizavus elektroninių dokumentų savybes bei jų paieškos technologijas buvo sukurta rinkmenų paieškos programa, pasinaudojant "Microsoft Visual C # 2005 Express Edition" programavimo platforma. Sukurta programa "Paieška", skirta surasti rinkmenas vietinio tinko serveryje ir tinklo kompiuterių bendrai naudojamuose kataloguose. Tai ypač naudinga organizacijose, besinaudojančiose bendrais dokumentų resursais. Darbą sudaro įvadas, elektroninių dokumentų analizė, rinkmenų paieškos sistemų analizė, paieškos technologijų apžvalga, realizuotos paieškos sistemos aprašymas, išvados, literatūros sąrašas ir 2 priedai. Darbo dydis yra 35 puslapiai be priedų, 3 lentelės, 4 paveikslėliai ir 17 literatūros šaltinių. / This work main purpose to analyze the usage of main desktop search systems, choose one optimal system and to create electronic documents search engine, which would reduce the time searching for files on a local network server and LAN computers. There are described document search and managemant teoretical and practical aspects. Develope essential features, accomplished comparable analysis of main document search systems. The following problems ware determined: there are no possibilities to find quickly and modify documents which are shared over Local Area Network in medium organization. After analysis of data search technologies it was decided to create a file search application using „Microsoft Visual C# 2005 Express Edition“ programming platform. Created application „Paieška“ is a tool designed for the purpose of searching for files and folders which are shared over a Local Area Network and servers. It is particularly useful in organizations where a lot of folders are shared on individual systems. The work consists of introduction, the analysis of data managemant usage in the document management system, technologies of document seaching, solution for document search system, findings, references and 2 annexes. The size of work is 35 pages without annexes, 3 tables, 4 pictures and 17 references.

In this dissertation we take a peer-to-peer approach to deal with two specific issues, fair trading and file distribution, arisen from data management for cloud computing. In mobile cloud computing environment cloud providers may collaborate with each other and essentially organize some dedicated resources as a peer to peer sharing system. One well-known problem in such peer to peer systems with exchange of resources is free riding. Providing incentives for peers to contribute to the system is an important issue in peer to peer systems. We design a reputation-based fair trading mechanism that favors peers with higher reputation. Based on the definition of the reputation used in the system, we derive a fair trading policy. We evaluate the performance of reputation-based trading mechanisms and highlight the scenarios in which they can make a difference. Distribution of data to the resources within a cloud or to different collaborating clouds efficiently is another issue in cloud computing. The delivery efficiency is dependent on the characteristics of the network links available among these network nodes and the mechanism that takes advantage of them. Our study is based on the Global Environment for Network Innovations (GENI), a testbed for researchers to build a virtual laboratory at scale to explore future Internets. Our study consists of two parts. First, we characterize the links in the GENI network. Even though GENI has been used in many research and education projects, there is no systematic study about what we can expect from the GENI testbeds from a performance perspective. The goal is to characterize the links of the GENI networks and provide guidance for GENI experiments. Second, we propose a peer to peer approach to file distribution for cloud computing. We develop a mechanism that uses multiple delivery trees as the distribution structure, which takes into consideration the measured performance information in the GENI network. Files are divided into chunks to improve parallelism among different delivery trees. With a strict scheduling mechanism for each chunk, we can reduce the overall time for getting the file to all relevant nodes. We evaluate the proposed mechanism and show that our mechanism can significantly reduce the overall delivery time.

Data stored in third party storage systems like the cloud might not be secure since confidentiality and integrity of data are not guaranteed. Though cloud computing provides cost-effective storage services, it is a third party service and so, a client cannot trust the cloud service provider to store its data securely within the cloud. Hence, many organizations and users may not be willing to use the cloud services to store their data in the cloud until certain security guarantees are made. In this thesis, a solution to the problem of securely storing the client’s data by maintaining the confidentiality and integrity of the data within the cloud is developed. Five protocols are developed which ensure that the client’s data is stored only on trusted storage servers, replicated only on trusted storage servers, and guarantee that the data owners and other privileged users of that data access the data securely. The system is based on trusted computing platform technology [11]. It uses a Trusted Platform Module, specified by the Trusted Computing Group [11]. An encrypted file system is used to encrypt the user’s data. The system provides data security against a system administrator in the cloud.

The Design Metrics Research Team at Ball State University has developed a quality design metric D(G), which consists of an internal design metric Di, and an external design metric De. This thesis discusses applying design metrics to the ROCC-Radar On-line Command Control project received from Harris Corporation. Thus, the main objective of this thesis is to analyze the behavior of D(G), and the primitive components of this metric.Error and change history reports are vital inputs to the validation of design metrics' performance. Since correct identification of types of changes/errors is critical for our evaluation, several different types of analyses were performed in an attempt to qualify the metric performance in each case.This thesis covers the analysis of 666 FORTRAN modules with approximately 142,296 lines of code. / Department of Computer Science

The G-Net research group at Ball State University previously developed a graph editor, written in Java, with limited algorithm support. This editor was modified until the code had the instability of a legacy system. It was decided that, rather than continue working with the old system, a new version would be created.The enhancements planned for this new version were more efficient data structures, easy addition of new algorithms, and animated algorithm output. Additionally, the new version was to be written in compliance with the latest Java standards. This paper describes the structure of this new program, Jedit3.1. An overview of the structure of the program and detailed descriptions of the material that future programmers will need to understand in order to add new algorithms is included. Appropriate descriptions are included for files that future programmers should understand but not necessarily modify. / Department of Computer Science

Dalinis failų šifravimas – tai failų šifravimas neužšifruojant viso failo, taip taupant techninius resursus ir sumažinant šifravimo laiką. Praktikoje dalinis failų šifravimas pernešamose laikmenose gali būti pritaikomas asmeniniam naudojimui, taip pat ir komercinėje veikloje kurioje reikia šifruoti duomenis į pernešamas laikmenas, taip pat pirminiam šifravimui kai informacija šifruojama dažnai ir greitis yra labai svarbus. Šiame darbe yra tiriamas dažnai sutinkamų failų tipų tinkamumas daliniam šifravimui, kiek duomenų reikia užšifruoti, jog failas nebūtų greitai atkurtas pasinaudojus viešai prieinama programine įranga. Atliekami greičio testai tarp dalinio ir pilno šifravimo nustatyti ar dalinis šifravimas duoda apčiuopiamą naudą. Darbe išsikeltų tikslų pasiekimui yra realizuota testavimo sistema kuri leidžia nesunkiai pilnai ir dalinai šifruoti failus sekantu operacijų laiką. Darbo pabaigoje aptariami tinkami failų tipai daliniam šifravimui, testavimo rezultatai ir išvados. Šiame darbe atlikti tyrimai parodė, jog dalinis failų šifravimas dideliems neatkuriamiems failų tipams gali sumažinti šifravimo laiką lygininat su pilnu šifravimu. / Partial fail encryption - it's the encryption method that doesn't encrypt the whole file, that way saving technical resources and time for encryption. In practice partial fail encryption in removable media can be used for personal usage, also in commercial practice when it is required to encrypt data to removable media, also for initial encryption when data is being constantly encrypted and speed is a very important manner. This work examines regularly encountered files types compatibility for partial encryption and how much data it is required to finish the encryption, so it couldn't be decrypted by using publicly available software. Speed tests were made between partial and full encryption methods to diagnose if partial encryption has any real benefit. To accomplish set goals for this work, a testing system was established, which allows to encrypt files fully and partially by tracking operations time. By the end of the work it is discussed about compatible files types for partial encryption, test results and conclusion. The examinations made in this work, proven that partial encryption for bigger undecryptable file types can save time compared to full encryption method.

There are increasing demands for graphics-oriented software packages for graph theory teaching and research. G-Net, a departmental research project headed by Dr. Jay Bagga, is an effort to create a software package that comprises of a graph database, a graph editor, 'and a collection of graph algorithms. Also, with widespread use of the World Wide Web, the graph editor should be accessible through the Web. Taking these issues into consideration Jedit (Java Graph editor) is developed. This thesis concentrates on the design and implementation of a graph editor and a graph object (Jgraph). Jgraph is developed in java to implement the graph algorithms in future. One of the unique features of this graph editor is that it can be used as stand-alone application or as an applet for the Web. In addition, it also provides a friendly user interface. / Department of Computer Science