Dissertations / Theses: 'Symbian OS (Computer file)'

1

Färnlycke, Isak. "An approach to automating mobile application testing on Symbian Smartphones : Functional testing through log file analysis of test cases developed from use cases." Thesis, KTH, Kommunikationssystem, CoS, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-116778.

Full text

Abstract:

Many developers today have difficulties testing their applications on mobile devices. This is due to a number of factors, such as the fact that the mobile phone market has become even more fragmented with the introduction of touch screen technology. Existing software that was designed for traditional mobile handhelds is not necessarily compatible with the newest models and vice versa. For developers this incompatibility increases the difficulty when creating software. Lack of resources for testing the application may lead to the application being limited to either just a specific model or in some cases to only one specific version of the operating system software. Without providing support for a large number of models the product may have difficulty attracting customers, and hence fail to gain the desired market share. The challenge is to find a way to make testing simple, effective, and automated on a large number of mobile devices. To achieve this test automation applicationsare needed and a test strategy must be devised. Additionally, testing is often described as never-ending since testing generally reveals errors rather than demonstrating when errors are absent. Because of this some limitations of testing are justified. In order to limit the scope of this thesis I have selected some of the most appropriate methods for testing, and will only examine these specific methods. The focus for the testing is not specifically to find errors, but rather to confirm that the product offers the specified functionality. This thesis describes an approach to functional testing of an application for Symbian mobile devices based upon log analysis. Unfortunately, testing applications on mobile devices is still not straightforward, and this thesis does not shed any light upon how to lessen this complexity. However, I believe that both testing and development will be more and more built around use cases in the future. Unfortunately, automation of testing based uponthese use cases will be further complicated by the increasing use of touch screens and physical input (such as gestures).
Idag har många utvecklare problem med att testa sina applikationer på mobila enheter.Detta har många orsaker, exempelvis att den globala mobila marknaden har blivit än mer fragmenterad i och med introduktionen av pekskärmstekniken och de snabba förändringar som sker idag. På grund av de många telefoner som idag finns så finns det ett behov för en automatiserad testprocess då det tar för lång tid att göra manuellt. OptiCall Solutions AB har utvecklat en applikation för Symbian S60 som behöver kunna köra på många olika telefoner. Denna masteruppsats har målet att hitta ett sätt att automatisera testning av mobilapplikationer på olika enheter, mer specifikt enheter som kör Symbian S60. OptiCaller är målet för testerna. Testmetodologier och verktyg har analyserats och kraven har samlats in på den önskade lösningen. Lösningen består av ett program som kör testskripten direkt på telefonen, mjukvara som analyserar testresultaten och presenterar dem i ett GUI, ett teststrategidokument, samt ett felrapporteringssystem. Med hjälp av dess kan testaren skapa sina egna skript för att automatisera och sedan samla in resultaten för analys. Detta eliminerar behovet för manuell testning och gör testningen effektivare, speciellt när man kör många tester. Analysmjukvaran är även integrerad med Felrapporteringssystemet för att underlätta felrapportering.

APA, Harvard, Vancouver, ISO, and other styles

2

Enany, Ahmed. "Achieving Security in Messaging and Personal Content in Symbian Phones." Thesis, Blekinge Tekniska Högskola, Avdelningen för för interaktion och systemdesign, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5635.

Full text

Abstract:

This thesis describes two proposed schemes that could be used to secure mobile messaging (SMS/MMS) as well as one scheme that could be used to secure mobile content. The security services we considered in securing the mobile messages are confidentiality, authentication, non-repudiation and integrity. We used Identity Based Cryptography in order to secure the mobile messaging and Blowfish algorithm to secure the mobile content. Due to some of the disadvantages imposed by the Identity Based Cryptography, we recommended using it along with the RSA algorithm. The proposed schemes were implemented in java and tested on an actual device, Nokia N70. In addition, we measured the time required by each of the algorithms we used to encrypt/decrypt a certain number of bytes. We found that the time taken by RSA and Blowfish algorithms will not be noticeable by the user. However, since the implementation of the Identity Based Cryptography we used was not meant to run on mobile devices, we encountered a noticeable delay whenever encrypting/decrypting the data using this algorithm. Securing the SMS messages will make it to be considered as one of the proposed means that could be used to conduct m-commerce. In addition, securing the MMS messages and the mobile content will increase the usability and the reliability of the mobile phones especially to the users on the move.
Phone: +46735731360

APA, Harvard, Vancouver, ISO, and other styles

3

Zhang, Irene Y. (Irene Yun). "Efficient file distribution in a flexible,wide-area file system." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53188.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 63-65).
WheelFS is a wide-area distributed file system designed to help applications cope with the challenges of sharing data over the wide-area network. A wide range of applications can use WheelFS as a storage layer because applications can control various trade-offs in WheelFS, such as consistency versus availability, using semantic cues. One key feature that many applications require from any storage system is efficient file distribution. The storage system needs to be able to serve files quickly, even large or popular ones, and allow users and applications to quickly browse files. Wide-area links with high latency and low throughput make achieving these goals difficult for most distributed storage systems. This thesis explores using pre fetching, a traditional file system optimization technique, in wide-area file systems for more efficient file distribution. This thesis focuses on Tread, a pref etcher for WheelFS. Tread includes several types of pre fetching to improve the performance of reading files and directories in WheelFS: read-ahead pre fetching, whole file prefetching, directory prefetching and a prefetching optimization for WheelFS's built-in cooperative caching. To makes the best use of scarce wide-area resources, Tread adaptively rate-limits prefetching and gives applications control over what and how prefetching is done using WheelFS's semantic cues. Experiments show that Tread can reduce the time to read a 10MB file in WheelFS by 40% and the time to list a directory with 100 entries by more than 80%.
(cont.) In addition, experiments on Planetlab show that using prefetching with cooperative caching to distribute a 10MB file to 270 clients reduces the average latency for each client to read the file by almost 45%.
by Irene Y. Zhang.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

4

Leal, Anamary. "Exploring the effectiveness of 3D file browsing techniques for file searching tasks." Honors in the Major Thesis, University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/1285.

Full text

Abstract:

This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucf.edu/Systems/DigitalInitiatives/DigitalCollections/InternetDistributionConsentAgreementForm.pdf You may also contact the project coordinator, Kerri Bottorff, at kerri.bottorff@ucf.edu for more information.
Bachelors
Engineering and Computer Science
Early Childhood Education

APA, Harvard, Vancouver, ISO, and other styles

5

Grusecki, Travis R. "Improving block sharing in the Write Anywhere File Layout file system." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/76818.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student submitted PDF version of thesis.
Includes bibliographical references (p. 41).
It is often useful in modern file systems for several files to share one or more data blocks. Block sharing is used to improve storage utilization by storing only one copy of a block shared by multiple files or volumes. This thesis proposes an approach, called Space Maker, which uses garbage collection techniques to simplify the up-front cost of file system operations, moving some of the more difficult block tracking work, such as the work required to clean-up after a file delete, to a back-end garbage collector. Space Maker was developed on top of the WAFL file system used in NetApp hardware. The Space Maker is shown to have fast scan performance, while decreasing the front-end time to delete files. Other operations, like file creates and writes have similar performance to a baseline system. Under Space Maker, block sharing is simplified, making a possible for new file system features that rely on sharing to be implemented more quickly with good performance.
by Travis R. Grusecki.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

6

Alsowail, Rakan. "Secure file sharing." Thesis, University of Sussex, 2016. http://sro.sussex.ac.uk/id/eprint/63551/.

Full text

Abstract:

File sharing has become an indispensable part of our daily lives. The shared files might be sensitive, thus, their confidentially, integrity and availability should be protected. Such protection might be against external threats that are initiated by unauthorised users or insider threats that are initiated by authorised users. Our main interest in this thesis is with insider threats. Protecting shared files against insiders is a challenging problem. Insiders enjoy various characteristics such as being trusted and authorised, in addition to being inside the network perimeter and having knowledge of information systems. This makes it difficult to prevent or detect policy violation for these users. The goal of this thesis is to protect shared files from the perspective of insider security with language-based techniques. In the first part of the thesis, we define what we mean by an insider and the insider problem precisely, and propose an approach to classify the insider problem into different categories. We then define and focus on one category that is related to file sharing. Namely, protecting the confidentiality and integrity of the shared files against accidental misuse by insiders. Furthermore, we classify the activity of file sharing into different categories that describe all possible ways of performing the activity of file sharing. These categories represent policies that describe how files should be propagated and accessed by insiders. We show that enforcing these policies can protect the files against accidental misuse by insiders while allowing the activity of sharing to be performed as desired. Thus our interest can be summarised as keeping honest users safe. In the second part of the thesis, we develop a security type system that statically enforces information flow and access control policies in a file system. Files are associated with security types that represent security policies, and programs are sets of operations to be performed on files such as read, copy, move, etc. A type checker, therefore, will statically check each operation to be performed on a file and determine whether the operation satisfies the policy of the file. We prove that our type system is sound and develop a type reconstruction algorithm and prove its soundness and completeness. The type system we developed in this thesis protects the files against accidental misuse by insiders.

APA, Harvard, Vancouver, ISO, and other styles

7

Heger, Dominique A. "The Design of a Logarithmic File Data Allocation Algorithm for Extent Based File Systems." NSUWorks, 2001. http://nsuworks.nova.edu/gscis_etd/578.

Full text

Abstract:

I/O has become the major bottleneck in application performance as processor speed has skyrocket over the last few years, leaving storage hardware and file systems struggling to be competitive. This study presented a new methodology to evaluate workload-dependent file system performance. Applying the new methodology, the benchmarks conducted on the VxFS file system served as a baseline for the design of a new logarithmic file data allocation algorithm for extent based file systems. Most of the I/O performance evaluations conducted today have reached a steady state in which new developments are evolutionary, not revolutionary. The performance model that was introduced in this thesis is revolutionary, as it produces an application as well as a system characterization vector that allows researchers to conduct an in -depth analysis of a complete system environment. The constructed performance hierarchy incorporates performance dependencies at all levels of a system, which allows comparing, evaluating, and analyzing the system at any level of abstraction. When combining the performance characterization vectors, a single, application specific metric allows the analyst to conduct a sensitivity study. The characterization vectors and the resulting single metric satisfy all the potential demands for analyzing I/O performance, in particular systems evaluation, comparison, and optimization. The main argument made throughout this study is that systems performance has to be measured in the context of a particular application and a particular workload. The performance evaluation methodology presented in this thesis enables such measurements. Utilizing the methodology, the in-depth file system performance analysis conducted on different hardware and software configurations reviled that the new approach taken in this study was successful, as it was possible to rank the test systems in their proper order of relative performance measurements. The methodology allowed to normalize the results and to quantify performance in terms of performance paths that included an application, an operating system, as well as the underlying hardware subsystems. The file system benchmarks conducted on VxFS and UFS file systems respectively disclosed the strengths and weaknesses of an extent-based and a block-based file system design. In both architectures, fragmentation substantially impacts I/O performance as the file systems age. The performance measurements outlined the correlation between internal and external fragmentation, and made a strong case for a much enhanced file data allocation algorithm for extent based file systems. The second part of this research introduced a new file data allocation algorithm for extent based file systems that is unique in its approach in that it questioned established boundaries and redistributed existing responsibilities. The new allocation algorithm fulfilled the major requirements of increasing I/O performance by lowering internal fragmentation without significantly increasing the metadata overhead. The presented analytical data model, as well as the actual simulation of the new file data allocation algorithm proofed the great potential of the new design. The study concluded with the recommendation for a new I/O model that is fundamentally different from all the existing once. The vision is that a completely redesigned I/O model is necessary to provide adequate I/O performance. To be efficient, the new I/O model will have to work around the expensive memory-copy to and from user and kernel address space. Moving the data in an out of virtual address ·space is poor overhead, and if the subsystem that is moving the data does not have any virtual memory technique implemented to avoid the data copy, performance is limited to approximately 1,4 of the memory speed. The next generation I/O model envisioned in this study focuses on alleviating all unnecessary overhead in the I/O path , allowing the hardware to operate at its full potential.

APA, Harvard, Vancouver, ISO, and other styles

8

Rao, Herman Chung-Hwa. "The Jade File System." Diss., The University of Arizona, 1991. http://hdl.handle.net/10150/185569.

Full text

Abstract:

File systems have long been the most important and most widely used form of shared permanent storage. File systems in traditional time-sharing systems such as Unix support a coherent sharing model for multiple users. Distributed file systems implement this sharing model in local area networks. However, most distributed file systems fail to scale from local area networks to an internet. This thesis recognizes four characteristics of scalability: size, wide area, autonomy, and heterogeneity. Owing to size and wide area, techniques such as broadcasting, central control, and central resources, which are widely adopted by local area network file systems, are not adequate for an internet file system. An internet file system must also support the notion of autonomy because an internet is made up by a collection of independent organizations. Finally, heterogeneity is the nature of an internet file system, not only because of its size, but also because of the autonomy of the organizations in an internet. This thesis introduces the Jade File System, which provides a uniform way to name and access files in the internet environment. Jade is a logical system that integrates a heterogeneous collection of existing file systems, where heterogeneous means that the underlying file systems support different file access protocols. Because of autonomy, Jade is designed under the restriction that the underlying file systems may not be modified. In order to avoid the complexity of maintaining an internet-wide, global name space, Jade permits each user to define a private name space. In Jade's design, we pay careful attention to avoiding unnecessary network messages between clients and file servers in order to achieve acceptable performance. Jade's name space supports two novel features: It allows multiple file systems to be mounted under one directory, and it permits one logical name space to mount other logical name spaces. A prototype of Jade has been implemented to examine and validate its design. The prototype consists of interfaces to the Unix File System, the Sun Network File System, and the File Transfer Protocol.

APA, Harvard, Vancouver, ISO, and other styles

9

Purdin, Titus Douglas Mahlon. "ENHANCING FILE AVAILABILITY IN DISTRIBUTED SYSTEMS (THE SAGUARO FILE SYSTEM)." Diss., The University of Arizona, 1987. http://hdl.handle.net/10150/184161.

Full text

Abstract:

This dissertation describes the design and implementation of the file system component of the Saguaro operating system for computers connected by a local-area network. Systems constructed on such an architecture have the potential advantage of increased file availability due to their inherent redundancy. In Saguaro, this advantage is made available through two mechanisms that support semi-automatic file replication and access: reproduction sets and metafiles. A reproduction set is a collection of files that the system attempts to keep identical on a "best effort" basis, relying on the user to handle unusual situations that may arise. A metafile is a special file that contains symbolic path names of other files; when a metafile is opened, the system selects an available constituent file and opens it instead. These mechanisms are especially appropriate for situations that do not require guaranteed consistency or a large number of copies. Other interesting aspects of the Saguaro file system design are also described. The logical file system forms a single tree, yet any file can be placed in any of the physical file systems. This organization allows the creation of a logical association among files that is quite different from their physical association. In addition, the broken path algorithm is described. This algorithm makes it possible to bypass elements in a path name that are on inaccessible physical file systems. Thus, any accessible file can be made available, regardless of the availability of directories in its path. Details are provided on the implementation of the Saguaro file system. The servers of which the system is composed are described individually and a comprehensive operational example is supplied to illustrate their interation. The underlying data structures of the file system are presented. The virtual roots, which contain information used by the broken path algorithm, are the most novel of these. Finally, an implementation of reproduction sets and metafiles for interconnected networks running Berkeley UNIX is described. This implementation demonstrates the broad applicability of these mechanisms. It also provides insight into the way in which mechanisms to facilitate user controlled replication of files can be inexpensively added to existing file systems. Performance measurements for this implementation are also presented.

APA, Harvard, Vancouver, ISO, and other styles

10

Motara, Yusuf Moosa. "File integrity checking." Thesis, Rhodes University, 2006. http://hdl.handle.net/10962/d1007701.

Full text

Abstract:

This thesis looks at file execution as an attack vector that leads to the execution of unauthorized code. File integrity checking is examined as a means of removing this attack vector, and the design, implementation, and evaluation of a best-of-breed file integrity checker for the Linux operating system is undertaken. We conclude that the resultant file integrity checker does succeed in removing file execution as an attack vector, does so at a computational cost that is negligible, and displays innovative and useful features that are not currently found in any other Linux file integrity checker.

APA, Harvard, Vancouver, ISO, and other styles

11

Dumitran, Octavian-Daniel. "Fixing file descriptor leaks." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/41645.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.
Includes bibliographical references (p. 89).
We design, implement and test a tool for eliminating file descriptor (FD) leaks in programs at run-time. Our tool monitors FD allocation and use. When the allocation of a new FD would fail because a process's entire pool of FDs is already in use, our tool "recycles" (forcibly closes) an FD. The FD to be recycled is chosen according to three simple rules: 1) do not recycle FDs used within the last second, 2) do not recycle "persistent" FDs (FDs allocated at sites that allocate few FDs) and 3) recycle the FD that was least recently used. We tested our tool with nine applications (HTTP/FTP servers, proxies and clients) that make extensive use of FDs. We first simulated massive leaks by disabling all calls to close. Without recycling (and in the presence of leaks), all applications malfunctioned. With FD recycling, applications continued to execute normally despite massive FD leakage. Throughout our tests, our tool has never attempted to close an FD that was still in use.
by Octavian-Daniel Dumitran.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

12

Dabek, Frank (Frank Edward) 1977. "A cooperative file system." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86811.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Mazières, David (David Folkman) 1972. "Self-certifying file system." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86610.

Full text

Abstract:

Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Includes bibliographical references (p. 137-141) and index.
by David Mazières.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

14

Stolt, Jonatan. "Avkodning av streckkoder i mobila enheter." Thesis, Linköping University, Department of Computer and Information Science, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-52225.

Full text

Abstract:

The most common method for identifying merchandise in the commerce is by barcodes. Symbian OS is an advanced operating system aimed at cell phones and the most commonly used in smart phones. Opportunities to a full range of new services are given through barcode recognition in a Symbian OS based device. Therefore the purpose of this degree project was to create an application which would contribute to a future solution aimed at shopping where the cell phone constitutes a reader of itemsʼ identification numbers. Available barcode decoders have been evaluated and three were chosen for testing. The decoder that fared best was ZXing. It was subsequently incorporated into a Symbian OS-based mobile phone. The decoder was written in the Java language but sufficient Java APIs for controlling the camera's autofocus were missing, something that was necessary to decode the barcode. On the other hand the APIs were offered in C++. Therefore, the solution was split into two applications, one server application written in Java and responsible for the decoding and one client application written in C++ containing the GUI, camera controlling facilities and connections to two price comparison services. A procedure for communication between applications and an interface for various lookup services were defined. Finally, the information security was evaluated and the most relevant threat would be a third party that collects information about user behavior patterns for extortion purposes. It was concluded that the application that was created had the ability to scan barcodes, it is possible to extend and thereby fulfill the purpose.

APA, Harvard, Vancouver, ISO, and other styles

15

Tang, Wai-hung. "An anonymity scheme for file retrieval systems." Click to view the E-thesis via HKUTO, 2008. http://sunzi.lib.hku.hk/hkuto/record/B40887972.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Kukkadapu, Sowmya. "Android application for file storage and retrieval over secured and distributed file servers." Kansas State University, 2012. http://hdl.handle.net/2097/13959.

Full text

Abstract:

Master of Science
Department of Computing and Information Sciences
Daniel A. Andresen
Recently, the world has been trending toward the use of Smartphone. Today, almost each and every individual is using Smartphone for various purposes benefited by the availability of large number of applications. The memory on the SD (Secure Digital) memory card is going to be a constraint for the usage of the Smartphone for the user. Memory is used for storing large amounts of data, which include various files and important document. Besides having many applications to fill the free space, we hardly have an application that manages the free memory according to the user’s choice. In order to manage the free space on the SD card, we need an application to be developed. All the important files stored on the Android device cannot be retrieved if we lose the Android device. Targeting the problem of handling the memory issues, we developed an application that can be used to provide the security to the important documents and also store unnecessary files on the distributed file servers and retrieve them back on request.

APA, Harvard, Vancouver, ISO, and other styles

17

Li, Haoyuan. "Alluxio| A Virtual Distributed File System." Thesis, University of California, Berkeley, 2018. http://pqdtopen.proquest.com/#viewpdf?dispub=10814792.

Full text

Abstract:

The world is entering the data revolution era. Along with the latest advancements of the Internet, Artificial Intelligence (AI), mobile devices, autonomous driving, and Internet of Things (IoT), the amount of data we are generating, collecting, storing, managing, and analyzing is growing exponentially. To store and process these data has exposed tremendous challenges and opportunities.

Over the past two decades, we have seen significant innovation in the data stack. For example, in the computation layer, the ecosystem started from the MapReduce framework, and grew to many different general and specialized systems such as Apache Spark for general data processing, Apache Storm, Apache Samza for stream processing, Apache Mahout for machine learning, Tensorflow, Caffe for deep learning, Presto, Apache Drill for SQL workloads. There are more than a hundred popular frameworks for various workloads and the number is growing. Similarly, the storage layer of the ecosystem grew from the Apache Hadoop Distributed File System (HDFS) to a variety of choices as well, such as file systems, object stores, blob stores, key-value systems, and NoSQL databases to realize different tradeoffs in cost, speed and semantics.

This increasing complexity in the stack creates challenges in multi-fold. Data is siloed in various storage systems, making it difficult for users and applications to find and access the data efficiently. For example, for system developers, it requires more work to integrate a new compute or storage component as a building block to work with the existing ecosystem. For data application developers, understanding and managing the correct way to access different data stores becomes more complex. For end users, accessing data from various and often remote data stores often results in performance penalty and semantics mismatch. For system admins, adding, removing, or upgrading an existing compute or data store or migrating data from one store to another can be arduous if the physical storage has been deeply coupled with all applications.

To address these challenges, this dissertation proposes an architecture to have a Virtual Distributed File System (VDFS) as a new layer between the compute layer and the storage layer. Adding VDFS into the stack brings many benefits. Specifically, VDFS enables global data accessibility for different compute frameworks, efficient in-memory data sharing and management across applications and data stores, high I/O performance and efficient use of network bandwidth, and the flexible choice of compute and storage. Meanwhile, as the layer to access data and collect data metrics and usage patterns, it also provides users insight into their data and can also be used to optimize the data access based on workloads.

We achieve these goals through an implementation of VDFS called Alluxio (formerly Tachyon). Alluxio presents a set of disparate data stores as a single file system, greatly reducing the complexity of storage APIs, and semantics exposed to applications. Alluxio is designed with a memory centric architecture, enabling applications to leverage memory speed I/O by simply using Alluxio. Alluxio has been deployed at hundreds of leading companies in production, serving critical workloads. Its open source community has attracted more than 800 contributors worldwide from over 200 companies.

In this dissertation, we also investigate lineage as an important technique in the VDFS to improve write performance, and also propose DFS-Perf, a scalable distributed file system performance evaluation framework to help researchers and developers better design and implement systems in the Alluxio ecosystem.

APA, Harvard, Vancouver, ISO, and other styles

18

Folmer, Brennan Thomas. "Metadata storage for file management systems data storage and representation techniques for a file management system /." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1001141.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Su, Yang M. Eng Massachusetts Institute of Technology. "File system unification using LatticeFS." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53145.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Includes bibliographical references (p. 57-58).
LatticeFS is a namespace unification system designed to merge multiple source file systems into a single working file system. atticeFS can be used to merge multiple software package directories, work with multiple file systems as if they are one, and share a single storage medium among multiple machines. On a high level, LatticeFS takes as input an arbitrary number of file system paths, and mounts a new virtual drive that will appear to the user as a union of the input file systems. Of course, attempting to combine multiple file systems will inevitably be met with conflicts. Situations in which multiple input file systems contain files/directories with the same name will be common in large systems; which file/directory should the user be exposed to in this case? Previous work such as UnionFS solved the problem by giving each input file system a strict priority value, and when a conflict occurred, the file/directory with the highest priority was the one shown to the user. In LatticeFS, we have introduced a plug-in system in which different strategies for resolving conflicts can be easily swapped in and out; additionally, handlers for special file types can also be "plugged" into the system. This paper describes and evaluates all aspects of LatticeFS in detail.
by Yang Su.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

20

Tseng, Jessica Hui-Chun 1977. "Energy-efficient register file design." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80219.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2000.
Includes bibliographical references (p. 69-70).
by Jessica Hui-Chun Tseng.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

21

Cuevas, Genevieve T. "SloanSpace- DSpace file transfer component." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/33118.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2005.
Includes bibliographical references (leaf 57).
This thesis demonstrates how to use Web services to integrate course management systems with digital repositories. We present a component that provides interoperation between SloanSpace, a course management system, and DSpace, a digital repository, both developed at MIT. In particular, a file transfer component was created that enables SloanSpace users to search and retrieve DSpace documents while in SloanSpace, and submit SloanSpace documents into DSpace. DSpace's web services provided the means for interaction between the systems. The architecture of the component was designed to handle not only the metadata mappings between SloanSpace and DSpace metadata, but mappings between file metadata of SloanSpace and other systems as well. Two scenarios were then created to test the effectiveness of the component. The test results demonstrate the ability of the component to decrease the amount of time spent in performing file transfers between the two systems. Most importantly, however, the component demonstrates more generally interoperation with digital repositories. It not only integrates SloanSpace with DSpace, but also allows for a more a general integration with any other system.
by Genevieve T. Curvas.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

22

Greco, Nicola S. M. Massachusetts Institute of Technology. "Decentralized infrastructure for file storage." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113976.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 99-103).
How might we incentivize a peer-to-peer network to store users' files? The purpose of this research is to combine ideas from existing peer-to-peer file sharing systems, blockchain technology and Proofs-of-Storage to create an incentivized decentralized storage network, where every participant can earn a reward for storing and serving files or pay the network to store or retrieve their own. More broadly, in this thesis we present the elementary components for building decentralized infrastructure, culminating in a protocol for incentivizing file storage.
by Nicola Greco.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

23

Tang, Wai-hung, and 鄧偉雄. "An anonymity scheme for file retrieval systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2008. http://hub.hku.hk/bib/B40887972.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Ergin, Oǧuz. "Register file optimizations for superscalar microprocessors." Diss., Online access via UMI:, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

25

Merritt, John W. "Distributed file systems in an authentication system." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9938.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Zheng, Lingyi. "JavaDiff a Chicory tool for file comparison /." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=711.

Full text

Abstract:

Thesis (M.S.)--West Virginia University, 1999.
Title from document title page. Document formatted into pages; contains iv, 43 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 42-43).

APA, Harvard, Vancouver, ISO, and other styles

27

Simco, Gregory E. "A Methodology for File System Performance Evaluation." NSUWorks, 1997. http://nsuworks.nova.edu/gscis_etd/839.

Full text

Abstract:

This study presents a specification for the design of file system performance metrics. Standard system performance evaluation techniques involve the use of checkpoints imposed at the application layer. These checkpoints are part of a synthetic mix of programs, usually part of a benchmark, used to exercise a system. These evaluations compile system data, but in most cases only collect general information on the I/O subsystem. An important aspect of the I/O subsystem is a file system. In most performance studies the file system is measured based on system calls such as read, write, and delete. However, a file system is composed of many algorithms that perform the file system management duties. This study isolates those functions that compose a file system. It is important to provide a testing environment that isolates the subsystem used in the study. This study provides a controlled environment for data collection with the use of an operating system that allows the coexistence of multiple file systems. Based on this feature, a virtual model was developed as a specification for the design of checkpoints used to collect the appropriate raw data. This 'data was then studied and analyzed. This study presents an implementation under the Linux Virtual File System model based on the virtual model design. This implementation was used to collect and present data on performance of several of the Linux file system implementations. This study shows that a controlled specification designed into the multiple file system support layer of an operating system provides: (J) a file system independent checkpoint that cannot be altered by the file system; (2) more file system related data by collecting information on most file system functions; and (3) a means for measuring file systems under live loads as well as synthetic loads.

APA, Harvard, Vancouver, ISO, and other styles

28

Colonna, Christopher Joseph. "Efficient register file management through reallocation." Diss., Online access via UMI:, 2006.

Find full text

Abstract:

Thesis (M.S.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Electrical Engineering, 2006.
Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

29

Katebi, Ataur Rahim. "Supporting snapshots in a log-based file system." [Gainesville, Fla.] : University of Florida, 2004. http://purl.fcla.edu/fcla/etd/UFE0008900.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Jardetzky, Paul Wenceslas. "Network file server design for continuous media." Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.241058.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Zehender, Nicholas (Nicholas G. ). "Network assisted file system consistency checking." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/77538.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 63-64).
This thesis reports on the design and implementation of Network Assisted NFSCK (or NAN), an extension to NFSCK, a research project about checking file system consistency at NetApp. NFSCK requires disk space to store temporary files, but sometimes insufficient disk space is available, and NFSCK cannot be used. NAN allows NFSCK to use an NFS server to store these temporary files. Tests were run to compare the total running time of NAN and NFSCK on various machines and data sets. Results showed that CPU was the limiting factor for NAN's performance. On machines with four CPUs, the running time of NAN was within 1% of the running time of NFSCK. On machines with two CPUs, running time was up to 6% worse with a large file data set, and up to 22% worse with a small file data set.
by Nicholas Zehender.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

32

Wang, Edward M. 1976. "Supreme Court audio file search engine." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/17997.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2004.
Includes bibliographical references (leaves 73-74).
Search engines have evolved from simple text indexing to indexing other forms of media, such as audio and video. I have designed and implemented a web-based system that permits people to search the transcripts of selected Supreme Court cases, and retrieve audio file clips relevant to the search terms. The system development compared two implementation approaches, one based on transcript aligning technologies developed by Hewlett-Packard, the other is a servlet-based search system designed to return pre-parsed audio file clips. While the first approach has the potential to revolutionize audio content search, it could not consistently deliver successively parsed audio file clips with the same user friendly content and speed as the simpler second approach. This web service, implemented with the second approach, is currently deployed and publicly available at www.supremecourtaudio.net .
by Edward M. Wang.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

33

Chen, Haogang. "Certifying a crash-safe file system." Thesis, Massachusetts Institute of Technology, 2016. http://hdl.handle.net/1721.1/107325.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 93-99).
File systems are a cornerstone for storing and retrieving permanent data, yet they are complex enough to have bugs that might cause data loss, especially in the face of system crashes. FSCQ is the first file system that (1) provides a precise specification for the core subset of POSIX file-system APIs; and the APIs include fsync and fdatasync, which allow applications to achieve high I/O performance and crash safety, and that (2) provides a machine-checked proof that its I/O-efficient implementation meets this precise specification. FSCQ's proofs avoid crash-safety bugs that have plagued file systems, such as forgetting to insert a disk-write barrier between writing the data from the log and writing the log's commit block. FSCQ's specification also allows applications to prove their own crash safety, avoiding application-level bugs such as forgetting to invoke fsync on both the file and the containing directory. As a result, applications on FSCQ can provide strong guarantees: they will not lose data under any sequence of crashes. To state FSCQ's theorems, FSCQ introduces the Crash Hoare Logic (CHL), which extends traditional Hoare logic with a crash condition, a recovery procedure, and logical address spaces for specifying disk states at different abstraction levels. CHL also reduces the proof effort for developers through proof automation. Using CHL, the thesis developed, specified, and proved the correctness of the FSCQ file system. FSCQ introduces a metadata-prefix specification that captures the properties of fsync and fdatasync, based on Linux ext4's behavior. FSCQ also introduces disk sequences and disk relations to help formalize the metadata-prefix specification. The evaluation shows that FSCQ enables end-to-end verification of application crash safety, and that FSCQ's optimizations achieve I/O performance on par with that of Linux ext4.
by Haogang Chen.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

34

Lyubashevskiy, Igor B. (Igor Boris) 1977. "Portable fault-tolerant file I/O." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47646.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (p. 58-61).
by Lgor B. Lyubashevskiy.
S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

35

Eqbal, Rasha. "ScaleFS : a multicore-scalable file system." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/93781.

Full text

Abstract:

Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 47-49).
It is difficult to achieve durability and crash consistency in file systems along with multicore scalability. Commutative file system operations, which should scale according to the Scalable Commutativity Property, conflict on shared resources like coarse-grained locks and pages present in the page cache or buffer cache. Furthermore, data structures that are on separate cache lines in memory (e.g., directory entries) are grouped together when the file system writes them to disk for durability. This grouping results in additional conflicts. This thesis introduces a new design approach that decouples the in-memory file system from the on-disk file system, using per core operation logs. This facilitates the use of highly concurrent data structures for the in-memory representation, which is essential for commutative operations to proceed conflict free and hence scale perfectly. The in-memory representation does not propagate updates to the disk representation immediately, instead it simply logs the operation in a per core logical log. A sync or an fsync call processes these operations and applies them to the disk. Techniques based on time stamping linearization points of file system operations ensure crash consistency, and dependency tracking ensures good disk performance. A prototype file system, SCALEFS, implements this new approach and techniques. Experiments using COMMUTER and SCALEFS show that the implementation is conflict free for 99% of test cases involving commutative operations.
by Rasha Eqbal.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

36

Zuo, Catherine (Catherine W. ). "SibylFuzzer : stateful fuzzing for file systems." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/113551.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 61-62).
Correct file system behavior is vital to developing robust higher-level software and applications. However, correctly and efficiently investigating the wide range of file system behavior makes testing file systems a difficult task. In this thesis, I designed and implemented SibylFuzzer, a stateful fuzzer for testing file system behavior. Sibyl- Fuzzer is based on SibylFS, a third-party system comprised of a model for acceptable file system behavior and a procedure for comparing real-life file system implementation behavior against that model. SibylFuzzer uses SibylFS in two ways: first, as a source of file system knowledge to produce in-depth and meaningful tests; second, as a correctness standard such that any disagreement with a real-life file system's behavior indicates a potential bug within the real-life file system. I implemented SibylFuzzer in OCaml and performed all tests on a Linux file system.
by Catherine Zuo.
M. Eng.

APA, Harvard, Vancouver, ISO, and other styles

37

Holmes, Richard L., Rex K. Adams, and Harold C. Fritts. "Tree-Ring Chronologies of Western North America: California, Eastern Oregon and Northern Great Basin with Procedures Used in the Chronology Development Work Including Users Manuals for Computer Programs COFECHA and ARSTAN." Laboratory of Tree-Ring Research, University of Arizona (Tucson, AZ), 1986. http://hdl.handle.net/10150/304672.

Full text

Abstract:

Well replicated tree-ring samples were collected, dated and measured for California west of the Sierra Nevada, eastern Oregon and the northern Great Basin. A computer program was developed and used to check crossdating quality. Another computer program to generate and analyze tree-ring chronologies was evaluated, further developed cooperatively and used to produce chronologies for the dated site collections. This report contains these site chronologies in three versions along with site descriptions and chronology statistics. Users manuals are included for the two computer programs. The effect on a chronology of poor crossdating is discussed, and a study of standardization of tree-ring measurement series is reported. Some new techniques are described for processing tree-ring samples.

APA, Harvard, Vancouver, ISO, and other styles

38

Zou, Li. "State and file sharing in peer-to-peer systems." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/8093.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Bourget, Jean Paul. "Role-based file archiving /." Online version of thesis, 2008. http://hdl.handle.net/1850/8045.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Zou, Li. "State and file sharing in peer-to-peer systems." Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-06072004-131435/unrestricted/zou%5Fli%5F200405%5Fphd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Wennergren, Oscar, Mattias Vidhall, and Jimmy Sörensen. "Transparency analysis of Distributed file systems : With a focus on InterPlanetary File System." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-15727.

Full text

Abstract:

IPFS claims to be the replacement of HTTP and aims to be used globally. However, our study shows that in terms of scalability, performance and security, IPFS is inadequate. This is a result from our experimental and qualitative study of transparency of IPFS version 0.4.13. Moreover, since IPFS is a distributed file system, it should fulfill all aspects of transparency, but according to our study, this is not the case. From our small-scale analysis, we speculate that nested files appear to be the main cause of the performance issues and replication amplifies these problems even further.

APA, Harvard, Vancouver, ISO, and other styles

42

Pelletier, Larry Edward. "Description of a file access protocol for computer networks." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9870.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Bladh, Thomas. "StepTree : A File System Visualizer." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-5905.

Full text

Abstract:

A 3D visualization tool for file system hierarchies is presented. The visualization technique used is based on the Tree-map / nested Venn diagram concept and is capable of visualizing metrics and attributes such as size, change and file type for thousands of nodes simultaneously. Size is visualized through node base area, change is visualized through the ghosting and hiding of unchanged nodes and file type is visualized through colors. Actions such as navigation and selection are performed exclusively in 3D. Finally a method for improving the visibility of nodes through the equalization of sibling nodes is proposed.
Ett 3D visualiseringsverktyg för filsystem presenteras. Visualiseringstekniken är baserad på Tree-maps / Venn diagram och kan visualisera attribut såsom storlek, förändring och filtyp för tusentals noder samtidigt. Storlek visualiseras genom noders bas area, förändringar visualiseras genom ghosting (avfokusering) och hiding (gömning) av oförändrade noder och filtyp visualiseras med färger. Slutligen så föreslås en metod för att förbättra synligheten hos noder genom utjämning.
Tel. 0457-26310 Alt. 044-246025 (annars e-mail)

APA, Harvard, Vancouver, ISO, and other styles

44

Bah, Oury Amadou. "Database comparison, Oracle vs RDB." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/845945.

Full text

Abstract:

Database and database technology are having a major impact on the growing use of computers. The rising popularity of database systems for the management of data has resulted in an increasing number of systems. As the number grows, the difficulty in choosing the system which will best meet the requirements of a particular application also increases. Knowing how to choose the correct one for a given application is important.The purpose of this thesis is to compare two very commonly used Database Management Systems (ORACLE and RDB) at Ball State University by describing and listing the advantages of each of them as well as their weaknesses, giving a comprehensive study of their performances, user friendliness, limits, and to aid users and managers in obtaining a deeper knowledge of these two systems.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

45

Alhaffar, Mohammed. "Database comparison : Oracle vs RDB." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834505.

Full text

Abstract:

Databases and database technology are having a major impact on the growing use of computers. It is fair to say that databases are playing a critical role in almost all areas where computers are used, including business, engineering, medicine, law, education, and library science, to name a few.At Ball State University, databases are very widely used among faculty, staff, and students. The common commercial database management system (DBMS) used in the university is ORACLE. Due to the extensive use of the system and the availability and easy access to alternative systems such as RDB/VMS, a comparative research is in order.This thesis is a comprehensive comparison between the two systems. It covers the differences in design, SQL codings, and the use of host programming language such as FORTRAN. It concentrates on the differences in memory usage, execution time, as well as the CPU time needed to precompile, link, and run.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

46

Wheatman, Martin J. "An object layer for conventional file-systems." Thesis, Lancaster University, 1999. http://eprints.lancs.ac.uk/11680/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Maw, David Sze Yuen. "Administrative domain security gateway for file transfer." Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/36000.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Schmeidler, Yonah 1975. "A user level modulator file-system infrastructure." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47619.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (leaves 46-47).
by Yonah Schmeidler.
S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

49

Rimer, Matthew Scott 1975. "The secure file system under Windows NT." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80571.

Full text

Abstract:

Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
Includes bibliographical references (p. 53-54).
by Matthew Scott Rimer.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

50

Chajed, Tej. "Verifying an I/O-concurrent file system." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/108986.

Full text

Abstract:

Thesis: S.M. in Computer Science, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 67-71).
Systems software is a good target for verification due to its prevalent usage and its complexity, which can lead to tricky bugs that are hard to test for. One source of complexity in systems software is concurrency, but thus far verification techniques have struggled to enable large-scale verification of concurrent systems. This thesis contributes a verified file system, CIO-FSCQ, with I/O concurrency: if a file system call experiences a miss in the buffer cache and starts a disk I/O, the file system overlaps the I/O with the execution of another file system call. CIO-FSCQ re-uses the implementation, specifications, and proofs of an existing verified sequential file, FSCQ, and turns it into an I/O-concurrent file system. This re-use is enabled by CIO-FSCQ's optimistic system calls. An optimistic system call runs sequentially if all the data it needs is in the buffer cache. If some data is not in the cache, CIO-FSCQ issues I/Os to retrieve the data from disk and returns an error code. In the miss case, a system call wrapper reverts any partial changes and yields the processor so that another system call can run in parallel with the I/O. CIO-FSCQ retries the system call later, at which point the data is likely in the buffer cache. A directory-isolation protocol guarantees that FSCQ's specifications and proofs can be re-used even if optimistic system calls are retried. An evaluation of CIO-FSCQ shows that it speeds up a simple file-system workload by overlapping disk I/O with computation, and that the effort of building and verifying CIO-FSCQ is small compared to the effort of verifying FSCQ.
by Tej Chajed.
S.M. in Computer Science

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Symbian OS (Computer file)'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles