Abstract: Method and apparatus for establishing the legitimacy of use of a block of digitally represented information residing in a computer of a user The block of digitally represented information may be a text file, a sound recording, a graphical file or a software file The computer includes a program that processes the selected file to generate a substantially unique identification code The code is transmitted to a server that contains a listing of files correlated to status data, indicative of whether the file is proprietary material and the conditions associated with its use If the server locates an entry in its database it retrieves the status data and transmits it to the user's computer In the event the identification code issued by the user's computer is not sufficiently discriminative, ie, it does not allow the server to uniquely identify the file, the server transmits an algorithm identifier to the user's computer allowing the file to be re-processed with a new algorithm to generate a more distinctive identification code

Abstract: A method and apparatus is disclosed for synchronizing files stored in memory of two remotely located systems. The system can generate a copy of a source file at the destination location without transferring all the data of the source file. The destination location includes a reference file that can contain similar data as that contained in the source file. The synchronization is accomplished by sending keys (representing reference blocks of data from the reference file) to the source system. At the source system, a portion of each keys called a Feature is compared with portions of source file. If the Features match, a checksum corresponding to the reference block is compared with a check sum corresponding to the source block. If the checksums match, an short message identifying the key and reference block that matched is transmitted to the destination system in order that the reference block can be copied from the reference file in order to build the synchronized file.

Abstract: Processes and apparatuses are provided for generating file correspondency between a source computer and a target computer. The process comprises determining a first source file key for at least a portion of the source file and searching for an existing file having at least a portion thereof represented by a first existing file key which matches the first source file key. If the first existing file key is located and if the portion of the existing file represented by the first existing file key is also disposed on the target computer, the file correspondency is generated by accessing the portion of the existing file represented by the first existing file key which is disposed on the target computer.

Abstract: A graphical user interface layout is defined by a resource definition file having a set of resource directives associated therewith. A method of translating the layout to native Java source code begins by identifying each resource file directive associated with the window layout. For each resource file directive, or for each subdirective within a file directive or subdirective, the method generates a stub or "snippet" of Java code. The Java code snippets may be generated by direct code or by using a text-editable file interface, and the snippets are then combined to created a Java source file.

Abstract: The present invention discloses a method, computer program product, and system for dynamically and programmatically modifying the semantics and/or logic of class files as they are being loaded for execution. The present invention permits a user to write a control file specifying in a programmatic manner the changes to be applied to class files and the conditions for carrying out the changes. As the class files are loaded, they are analyzed for the desired conditions and if the conditions are found, the control file is applied to them to effect the appropriate changes according to the user's control file.

Abstract: Disclosed are a method and processor for linking a dynamic data fetch command to a document file, the document file initially in a preliminary markup state having at least one matching pair of a special beginning tag and a special ending tag, the tags separately contained in sequential comment statements of the preliminary markup document file, the tags delimiting and identifying an area in the preliminary markup document file for placement of requested dynamic data, the dynamic data fetch command located in a predefined script file having a linkage identifier, comprising the steps of identifying, in the preliminary markup document file, the matching pair of the special beginning tag and the special ending tag to identify the delimited area therebetween; selecting the predefined script file; generating a linked document file from the preliminary markup document file, adding, at the identified area in the preliminary markup document file, the linkage identifier for the selected predefined script file; and merging the predefined script file having the dynamic data variable fetch command with the linked document file.

Abstract: Modem massively parallel file systems provide high bandwidth file access by striping files across arrays of disks attached to a few specialized I/O nodes. However, these file systems are hard to use and difficult to integrate with workstations and tertiary storage. RAMA addresses these problems by providing a high-performance massively parallel file system with a simple interface. RAMA uses hashing to pseudo-randomly distribute data to all of its disks, insuring high bandwidth regardless of access pattern and eliminating bottlenecks in file block accesses. This flexibility does not cause a large loss of performance — RAMA's simulated performance is within 10–15% of the optimum performance of a similarly-sized striped file system, and is a factor of 4 or more better than a striped file system with poorly laid out data.

Abstract: A method, computer program product, and data structure is provided overcome excess code development associated with developing device drivers that are hierarchically related and provides standardization to driver developers by listing in the private area of a device object types of file objects, including specific IRP handlers associated therewith, that may be created under that device object to thereby provide a device object context. In like manner, each file object has listed in the private area types of other file objects, again including specific IRP handlers associated therewith, that may be created under that particular file object to thereby provide a file object context. The default handler for a driver object points to a multiplexing function that will process an incoming IRP based on the available context information to "route" the IRP to the appropriate handler. Each file object has reference to a plurality of dispatch function references that are used by the IRP handlers to fulfill a particular request. A request to create a file object will also be validated to assure that only file objects of the appropriate type may be created in hierarchy, again according to the context information.

Abstract: A data structure and method for dynamic type resolution in mapping abstract syntax notation (ASN.1) onto an object-oriented programming language (C++). For each information object class in ASN.1, two C++ classes are generating, a "set class" that models information object sets in that ASN.1 class, and a "class class" that models information objects in that ASN.1 class. For each information object set in an ASN.1 module class, a C++ data member is defined and a virtual resolve method is generated that may be invoked during the decoding process to permit dynamic extension of each information object set. A coder environment is provided in C++ that has pointers to instances of the various C++ module classes, enabling selective control of the type resolution information presented to the decoder.

Abstract: The procedure provides processing of coded information during payment for goods at a shop, where the customer has an individual smart card identifying himself and the particular terms to which he is entitled. The memory within the card includes a first identification file, called the Member's file, identifying the customer who holds the card. It also includes a second file, called the Points file, and a third file called the Relationship file concerning the business relationship of the card holder with the shop proprietors. A given processing algorithm is carried out using a part of the date of transaction and further information contained within the files, during a purchase transaction. The data is then written into the Points file, and new information is written into the Relationship file. There is also the optional printing of a coupon indicating the results of the transaction.

Abstract: One aspect of the invention is a method of generating object-oriented code. An object model is captured for at least one object using a computer. Code interpretable by a compiler is then generated based upon the object model. The code comprises a base object class (46) and a custom object class (50) where the base object class (46) comprises a base object header file and base object implementation file while the custom object class (50) comprises a custom object header file and custom object implementation file. The base object class (46) inherits from a framework object class (44) while the custom object class (50) inherits from the base object class (46). In response to a change in the object model, a new base object header file, base object implementation file, and custom object header file are generated while preserving at least some code in the base object implementation file.

Abstract: A method of providing operating system utilities for use by an applications program for a number of different operating systems. For each utility, a base class is created. The base class is defined in a header file and declares a static member function for creating the utility as an object and also declares virtual member functions for using the utility as an object (FIG. 2 ). The base classes and their static member functions are generic to all operating systems. A programmer includes the header file and invokes the member functions, which are implemented in a library of system-specific derived classes (FIGS. 1 and 2 ).

Abstract: PROBLEM TO BE SOLVED: To unitarily manage copyright by an image file itself and to provide a function for unitarily managing also the restriction of the copying or the like of the image file as well by turning the image file itself to a program or a module executed on an OS. SOLUTION: In a reference code S21, stored image data and the data form are specified. Then, in the code 22, inside a binary code in this image file, a password, the number of times capable of outputting data beforehand or the valid time limit of a program file and the number of times of allowing continuous erroneous password specification are specified. Then, in the code 23, the present date and time and the number of times of the continuous erroneous password specification are set and all information specified or set from the code 21 to the code 23 is ciphered. Then, in the code 24, all the ciphered information is stored as the image file.

Abstract: Few parallel file systems provide support for permuting file data from the canonical file distribution to a different distribution on compute nodes. Hence, redistributions are typically performed using many inefficient, fine-grained file operations. File systems relying on collective operations take a global view and replace many fine-grained file operations with a single request. One such system is disk-directed I/O, in which I/O nodes, given a collective description of a file operation, manage the transfer of data between the compute nodes' memory and disk. Disk-directed I/O provides the user with nearly full disk bandwidth in many situations, but while it easily outperforms non-collective approaches, disk-directed I/O provides only a fraction of the available disk bandwidth when fine-grained redistributions are required. We analyze disk-directed I/O's performance on these redistributions and show that, with the high-bandwidth disk systems available today, other approaches should be considered. We propose two enhancements to disk-directed I/O, one in which data from several disk blocks are combined into a single message from an I/O node to a compute node, and another in which the two-phase access strategy is combined with disk-directed I/O. Our results show that these schemes, when applied to fine-grained redistributions of file data, provide higher bandwidth than traditional disk-directed I/O or previously suggested variations.

Abstract: A method is described herein for generating a design file corresponding to a design entity in a logic design. An input and an output are specified for the design entity. A design file type is specified. The design file is created and a design file template corresponding to the design file type is copied into the design file. The design file template includes formatting corresponding to the design file type. The input and the output are instantiated in the design file. The designer may then completely specify the design entity in the design file.

Abstract: A language processing system including a parsing unit for receiving input of a source file to be processed and conducting parsing processing of the same, an optimization unit for receiving input of intermediate data generated by the parsing unit and conducting optimization processing of the same, a debugging source program information generating unit for generating a debugging source file which reflects the contents of optimization and whose form is approximate to a source file based on optimized intermediate data, and further, adding debug information obtained in the course of the generation of a debugging source file to optimized intermediate data, and a code generating unit for receiving input of intermediate data with debug information added and coding the same to generate an object file.

Abstract: PROBLEM TO BE SOLVED: To find a required class so as to execute down-load by requesting an applet execution code to a decided applet server through the use of an object requesting broker, drawing-out an applet execution code to an applet server and returning it to a client. SOLUTION: Communication is executed through the use of communication mechanism 206 in order to obtain a JAVA class file in a distribution object system 200 by a JAVA client 202. Communication mechanism where the JAVA client can find the class file so as to execute down-load is mounted in various kins of methods. For example, this communication mechanism is mounted as the object requesting broker of the distribution object system. The class server A, for example, is provided with a related file aggregation 209 and the class server B is provided with the related file aggregation 211. Therefore, the JACA class may be in any machine inside the distribution object system.

Abstract: A computer system comprises first and second software components, such as for example TUXEDO software and a Visual Basic application. A first data structure definition file (e.g. a C header file) represents a data structure from the point of view of the first software component. A software tool processes the first data structure to generate a second structure definition file (e.g. Visual Basic Types) representing the data structure from the point of view of the second software component, and at the same time to generate a compact coded representation of the data structure. A conversion function is provided, for converting an instance of the data structure represented by the first structure definition file into an instance of the data structure represented by the second structure definition file, and vice versa, using the compact coded representation to control the conversion.

Abstract: When writing a program to be executed in the worldwide object-oriented distributed systems environment, the source code may include class names developed at other sites. In this case, using the class name as a runtime class identifier, which should be globally unique, may cause problems such as: 1) The same class name representing a different class is found in another site. 2) Classes using different versions of a class cannot work together. To tackle these problems, the authors proposed and implemented a local class name facility called ‘chool. The school facility separates the compile time class name and the runtime class identity. This paper describes our design and implementation of the school and the runtime class identity in the OZ++ system: a worldwide object-oriented distributed systems environment developed by the authors.

Abstract: We describe the effects of a new user-level library for the Galley Parallel File System. This library allows some pre-existing sequential programs to make use of the Galley Parallel File System with minimal modification. It permits programs to efficiently use the parallel file system because the user-level library groups accesses together. We examine the performance of our library, and we show how code needs to be modified to use the library.

Abstract: This is the user manual for the kluwer.cls class file for the preparation of articles to be submitted to journals or spin-offs of journals published by Kluwer Academic Publishers. The kluwer.cls is a generic class, which allows us to have a simple conversion to different journal layouts. The kluwer.cls class file is similar to the article class file of LATEX2", but it has some extra fields in the preamble and some extended commands for the body text.

Abstract: The MPC++ Version 2 meta-level architecture is proposed. The architecture makes it possible to incorporate new optimizers into a compiler. A library designer can provide an optimizer specific to his class/template library in the library header file. A library user may use such a high-performance library by including the header file. A meta-level programming library, called DMSF, is designed to facilitate programming optimizers. As an example, a distributed array class in a parallel environment is introduced and its optimization program is presented. The optimizer is simple to describe, and it is effective. Evaluation using the CG kernel of NAS Parallel Benchmark shows that the program optimized by the meta-level optimizer runs almost as fast as the equivalent C program.

Abstract: This paper presents ParFiSys , a parallel file system developed at the UPM. ParFiSys 1 provides transparent access to several types of distributed file systems, which may be accessed using different mapping functions. Grouped management, parallelization, resource preallocation and write-before-full cache policies, are presented as relevant features of ParFiSys . Finally, some results of ParFiSys evaluation are presented to demonstrate its viability.

Abstract: Most current multiprocessor file systems are designed to use multiple disks in parallel, using the high aggregate bandwidth to meet the growing I/O requirements of parallel scientific applications. Many multiprocessor file systems provide applications with a conventional Unix-like interface, allowing the application to access multiple disks transparently. This interface conceals the parallelism within the file system, increasing the ease of programmability, but making it difficult or impossible for sophisticated programmers and libraries to use knowledge about their I/O needs to exploit that parallelism. In addition to providing an insufficient interface, most current multiprocessor file systems are optimized for a different workload than they are being asked to support. We introduce Galley, a new parallel file system that is intended to efficiently support realistic scientific multiprocessor workloads. We discuss Galley's file structure and application interface, as well as the performance advantages offered by that interface.