Search

Wireless broadcasting is an efficient way to deliver information to mobile clients. Due to power limit for the portable units, how to design an energy-saving organization is a key issue. Imielinski et al. have proposed two hashing-based schemes, Hashing A and Hashing B, to save energy in the progress of getting data of interest. However, these two hashing-based schemes have the directory miss phenomenon. To improve the directory miss phenomenon further, in this paper, we propose the TopK scheme which is a multiple-hashing-function-based scheme. Prom our simulation study, we show that the performance of TopK is better than that of Hashing B in terms of the average access time and the average tuning time. [ABSTRACT FROM AUTHOR]

Records provide a safe and flexible way to construct data structures. We describe a natural approach to typing polymorphic and extensible records that is simple, easy to use in practice, and straightforward to implement. A novel aspect of this work is that records can contain duplicate labels, effectively introducing a form of scoping over the labels. Furthermore, it is a fully orthogonal extension to existing type systems and programming languages. In particular, we show how it can be used conveniently with standard Hindley-Milner, qualified types, and MLF. [ABSTRACT FROM AUTHOR]

In this paper, we present simple and efficient array-based mesh data structures, including a compact representation of the half-edge data structure for surface meshes, and its generalization—a half-face data structure—for volume meshes. These array-based structures provide comprehensive and efficient support for querying incidence, adjacency, and boundary classification, but require substantially less memory than pointer-based mesh representations. In addition, they are easy to implement in traditional programming languages (such as in C or Fortran 90) and convenient to exchange across different software packages or different storage media. In a parallel setting, they also support partitioned meshes and hence are particularly appealing for large-scale scientific and engineering applications. We demonstrate the construction and usage of these data structures for various operations, and compare their space and time complexities with alternative structures. [ABSTRACT FROM AUTHOR]

Chapter One introduces the topics of image and video compression, explains the motivation for writing a book about design issues for video compression systems and describes the structure of the book. [ABSTRACT FROM PUBLISHER]

This overview of the notation and properties of matrices as data structures and algebras is for readers familiar with the general subject of linear algebra but whose recall may be a little rusty. A more thorough treatment can be found in most college-level textbooks on linear algebra and matrix theory. [ABSTRACT FROM PUBLISHER]

The article reports that lists are very flexible data structures that are suitable for a large number of applications. The main advantage of lists is that they organize computer memory into an elastic object that can be allocated on demand in various amounts and shapes during the running of a program. Lists can be lengthened by the insertion of new elements or by adjoining a new list to a given list. Also, one list could be embedded inside another list, creating a two-dimensional list. Embedding can be performed repeatedly, producing structures of unrestricted depth. Thus, lists can grow both in length and depth by nesting.

This article presents information on data structures and algorithms. An algorithm is any technique used to solve a given problem. The problem could be that of rearranging a given sequence of numbers, solving a system of linear equations, finding the shortest path between two nodes in a graph, and so on. The time complexity or the run time of an algorithm is the total number of basic operations performed in the algorithm. As an example, consider the problem of finding the minimum of "n" given numbers. An algorithm can be thought of as a mapping from the input data to the output data. A data structure refers to the way the data are organized.

The article presents a discussion related to data compression for networking. There has been an explosive growth of multimedia communication over networks during the past two decades. Networks currently deliver more than just text and images. Video, audio, and other continuous media data, as well as additional discrete media such as graphics, become the part of integrated network applications. For these applications, the traditional media, for example, text, image, as well as the continuous media, for example, video, audio, must be processed. Such processing referred to as "data coding", often yields better and more efficient representations of text, image, graphics, audio, and video signals.

The article presents a list of cases and data-definition cards for example files. It also presents data-definition cards for file comstudy and file orgstudy.

An encyclopedia entry for "Symbolic Links" is presented. Symbolic Link (symlink) is a special type of file that functions as a reference to another file. It does not point directly to data but presents a symbolic path for hard link identification. Symbolic Links can be used to refer to files on other mounted file systems.

A reference entry for the "File Transfer Access and Management (FTAM)" protocol is presented. It refers to an application protocol that provides file transfer services between client and server systems in an open environment. Access to files and management of files on diverse systems is also provided by FTAM. In the Transmission Control Protocol/Internet Protocol (TCP/IP) environment, FTAM is similar to both the File Transfer Protocol (FTP) and Network File System (NFS).

An encyclopedia entry about "Doc-O-Matic" is presented. It is a commercial automatic documentation generator which creates fully cross linked documentation systems. The generator includes both Source Code Documentation, Online Help and User Manuals in Portable Document Format, browser-based Help and Extensible Markup Language. It outlines the file formats that Doc-O-Matic supports, including Java and C/C++.

Focuses on the significant practices of software development file (SDF). Overviews the development of SDF practices; Impact of the practice on the defense and nondefense industries; Details the use of SDF within the defense industry.

An encyclopedia entry for "zipping" is presented. It refers to the process of compressing a file so it takes up less space. The compressed files are called a zip file, which have two types, the normal and self-executing that open up automatically. It states that PKZip and WinZip are popular zipping and unzipping programs.

An encyclopedia entry for "ZIP file format" is presented. The format, a popular data compression and archival format, was originally designed by Phil Katz for PKZIP. It states that many software utilities other than PKZIP itself are now available to create, modify or open ZIP files, which generally use the file extensions .zip or .ZIP and the Multipurpose Internet Mail Extensions (MIME) media type application/zip.

A reference entry for "WinRAR" is presented. In the context of computer software, this is a shareware file archiver and data compression utility developed by Eugene Roshal. This software is one of the few applications that is able to natively create RAR archives since the encoding method is held to be proprietary.

A definition of the term "utility program" is presented. It refers to a type of computer program that supports using computer, an application or a development environment. It includes file management, searching for files, comparing file contents as well as performing diagnostic routines to check performance and current health of the hardware.

An encyclopedia entry for "TUGZip" is presented. It refers to a freeware file archiver for Microsoft Windows, handling a wide range of archive formats, including some of the commonly used zip, rar, gzip, bzip2 and 7z. The archiver can also view disk image files like BIN, C2D, IMG, ISO and NRG.

A definition of the term "tripwire" is presented. It refers to a file integrity security program to check designated files and/or directories against a previously generated database and flags any files that have been added, deleted or changed. It works with a database that maintains information about the byte count of files.

A definition of the term "ticket," as used in Kerberos authentication, is presented. It refers to a data structure used to provide access to resources.

An encyclopedia entry for "Static Single Assignment Form" (SSA form or SSA) is presented. It is an intermediate representation (IR) in which every variable is assigned exactly once. Existing variables in the original IR are divided into versions so that every definition gets its own version. In SSA form, use-definition chains are explicit and contains one element.

A definition of the term "SHA-2" is presented. It refers to an umbrella designation for variants of the Secure Hash Algorithm-1 (SHA-1).

A definition of the term "self-extracting file" is presented. It refers to a type of file that contains other files that have been compressed through a ZIP or other compression program for more efficient transfer of the data. According to the article, the files contains within it the program software needed to un-compress the file and execute the application.

A reference entry for "Secure Hash Standard" in relation to computer security is presented. It refers to the Federal Information Processing Standard (FIPS) defining the Secure Has Algorithm-1 (SHA-1).

A definition of the term "Salt" is presented. In the context of password protection, it refers to a random string of data used to modify password hash. It can be added to the hash to prevent collision by identifying a user's password even if another user in the system has selected the same password.

A definition of the term "Rzip" in computer software is presented. The term refers to a data compression program that is based on bzip2.rzip that operates in two stages. The first stage encodes large chunks of duplicated data over potentially very long distances in the input file, while the second stage employs a standard compression algorithm to compress the output of the first stage.

A definition of the term "RPC NFS Procedures" is presented. It refers to the Network File System implementation using the Remote Procedure Call Protocol. All Network File System operations are implemented as Remote Procedure Call procedures.

An encyclopedia entry for "Roshal Archive (RAR)" is presented. In computing, it is a proprietary file format for data compression and archiving, which was developed by Eugene Roshal. Several programs were also developed by Roshal for packing and unpacking RAR files, originally for disk operating system and later ported to other platforms.

A definition of the term "remote file system" (RFS) is presented. RFS refers to a distributed file system, similar to Network File System (NFS), developed by AT&T and distributed with their UNIX System V operating system.

A definition of the term "Rayleigh fading" is presented. It refers to a type of signal fading caused by independent multipath signals having a Rayleigh PDF.

A definition of the term "PowerArchiver" is presented. It refers to a commercial file archiver designed for Microsoft Windows users developed by ConexWare Inc. It uses 7-Zip format and handles a number of other archive formats. It is cited that it has a free evaluation version.

A definition of the term "Portable Document Format" (PDF) is presented. It refers to the native file format for Acrobat by Adobe Systems. It is cited that the PDF file format is independent of the original application software, hardware and operating system used to create these documents. It is said that a PDF file can describe documents that have any combination of text, graphics and images.

A definition of the term "Operating System" (OS) is presented. It refers to a software program that manages the hardware and software resources of a computer. Its fundamental tasks include controlling and allocating memory, prioritizing the processing of instructions and managing files. It may be split into a kernel and various system programs which use facilities provided by the kernel to perform higher-level house-keeping tasks.

A definition of the term "Non-Code Resource" is presented. It is a resource containing the data structures on which the program operates, for example, WIND, DLOG, DITL, or SIZE resources. Non-code resources can be created by using the resource compiler Rez or a resource editor.

A definition of the term "New Technology File System" is presented. It refers to an enhanced file system used on Microsoft Windows NT and later versions of the operating system, which include Windows 2000, Windows XP, Windows Server 2003 and Windows Vista. It replaced Microsoft's previous File Allocation Table system, used in MS-DOS and early versions of Windows.

An encyclopedia entry for "NetWare Core Protocol" (NCP) is presented. The NCP is developed by Novell to manage access to the primary NetWare server resources. It is responsible for making procedure calls to the NetWare File Sharing Protocol that services requests for NetWare file and print resources. The protocol is used for transmitting information between a NetWare server and its clients.

A definition of the term "Module" is presented. In computer software programming, module pertains to a software entity that groups a set of sub-programs/routines and data structures. Modules are units that can be compiled separately and can promote modularity and encapsulation, both of which can make complex program easier to understand.

A definition of the term "keyed-hash message authentication code" is presented. It refers to a kind of message authentication code (MAC) which can be computed through a cryptographic hash function in combination with a secret key. Similar with any MAC, it may be used to simultaneously verify both the data integrity and the authenticity of a message.

An encyclopedia entry about "Hyper Hasher" is presented. It is a shareware program developed by Matt LaPlante. Its objective is to allow the use to compute digital files hashes and checksums in more formats than any other computer program.

An encyclopedia entry for the term "GCA" in computing is presented. It is a freeware compression utility created by Shin-ichi Tsuruta in year 2000. The compressed archive format has higher compression capabilities than ZIP, especially with binary files. DGCA is the next generation of GCA.

A definition of the term "Disk Access" is presented. The term refers to read from and write to a computer disk. The disk access time refers to the average time it takes to position the head over the requested track.

A definition of the term "Digest Authentication" is presented. It refers to a computer security system that allows a Web client to compute MD5 hashes of the password to prove that it has the password.

A definition of the term "Binary Tree" is presented. It refers to a tree data structure in which each node has at most two children, which are called a left pointer and a right pointer. The root pointer points to the topmost node in the tree, while the left and right pointers point to smaller subtrees. Binary trees can be used as binary search trees and binary heaps.

A definition of the term "AppleTalk Filing Protocol," is presented. It was renamed to Apple Filing Protocol, that is used for communication with AppleShare file servers. It is built on top of ASP, and provide services for authentication methods including two-way random-number exchange and performing specific operations on the Macintosh HFS file system.

A definition of the term "AppleTalk Address Resolution Protocol" (AARP) is presented. It is said to be similar to the Address Resolution Protocol (ARP) and it maps AppleTalk nodes addresses at the network layer to the physical layer addresses. It also allows management of the Address Mapping Table on the device.

An encyclopedia entry for "Andrew File System (AFS)" is presented. This term refers to a distributed network file system that allows files from any AFS machine in the country to be accessed locally. It is composed of cells that represent portions of file space. These cells form a UNIX file system under the root/afs directory.

A definition of the term "adapter description file" is presented. It refers to a type of data format with an extension .adf.

The article reports on the ability of a programming language in allowing symbolic naming of operations and addresses and providing features designed to facilitate expression of data structures and program logic.