Abstract: A method of locking exclusive access to a divided computer resource that may be access by more than one different is disclosed. A computer resource that is divided into more than one piece may require exclusive access to all the individual portions before the computer resource may be used. If more than one client system attempts to access such a divided computer resource, a deadlock situation may occur. To prevent such a deadlock situation, each client that attempts to access the divided resource will issue a globally unique identifier to the divided resource. If more than one client system attempts to access portions of the same computer resource then the globally unique identifier will be used to arbitrate disputes and thus prevent deadlock.

Abstract: Methods, systems, and apparatus, including computer program products for handling a workflow within an electronic document. Participants are chosen for the workflow and the activities are assigned to the workflow participants. Workflow information is obtained from an electronic document, where the workflow information pertains to activities assigned to a user. The user can consult on or delegate the assigned activities, in which case the electronic document is sent to the consultant or delegate. Alternatively the user can reassign future activities. If it is detected that the workflow has been completed, the user can indicate the continuing of the workflow by identifying additional workflow participants, and the electronic document is sent to one of the additional workflow participants.

Abstract: A system and method of allocating storage space in a computer system is disclosed. In the disclosed system, computer resources are allocated using a quota system that employs quota identifiers. An allocation system creates quota identifiers and each quota identifier is assigned a specific quota value. Computer resources are then assigned to users by assigning quota identifiers to the users. Additional amounts may be allocated to specific users by created extension quota identifiers and associating those quota identifiers with specific users.

Abstract: A system and method of allocating storage space in a computer system is disclosed. In the disclosed system, computer resources are allocated using a quota system that employs quota identifiers. An allocation system creates quota identifiers and each quota identifier is assigned a specific quota value. Computer resources are then assigned to users by assigning quota identifiers to the users. Additional amounts may be allocated to specific users by created extension quota identifiers and associating those quota identifiers with specific users.

Abstract: A method of implementing an expandable computer storage system is disclosed. With the ever increasing amounts of data, computer storage systems tend to eventually become filled. To allow for additional storage capacity in manner that can be formed without taking the computer storage system off-line an expandable computer storage system is disclosed. The expandable computer storage system uses a hasher system with a hash function on a filename to select an individual storage unit from an expandable array of storage units. A configuration file in the hasher system specifies how the hash function selects the individual storage unit. When additional storage units are added to the storage array, a newer configuration file is added to the hasher system which allows the new storage units to be used. However, the older configuration file is kept and used as a back-up in case a file cannot be located using the new configuration file.

Abstract: A method of locking exclusive access to a divided computer resource that may be access by more than one different is disclosed. A computer resource that is divided into more than one piece may require exclusive access to all the individual portions before the computer resource may be used. If more than one client system attempts to access such a divided computer resource, a deadlock situation may occur. To prevent such a deadlock situation, each client that attempts to access the divided resource will issue a globally unique identifier to the divided resource. If more than one client system attempts to access portions of the same computer resource then the globally unique identifier will be used to arbitrate disputes and thus prevent deadlock.

Abstract: Instead of using a separate database to store meta-data for computer files, the file system itself is used to store the meta-data associated with computer files and meta-data index files that allow searches to be performed quickly on meta-data values. The meta-data index files may store the filenames of computer files having a particular meta-data value. The filenames stored within the meta-data index file may also be sorted according to another meta-data type in order provide additional information. When adding a new computer file to a particular meta-data index file, that computer file may be added to a meta-data index appendix file that is not sorted. Periodically, the meta-data index appendix file will be integrated into the main meta-data index file. This may occur when the meta-data index appendix file reaches a particular size.

Abstract: Instead of using a separate database to store meta-data for computer files, the file system itself is used to store the meta-data associated with computer files and meta-data index files that allow searches to performed quickly on meta-data values according to example systems and methods. The meta-data associated with a computer file may be stored in a meta-data file with a filename derived from the filename of the original computer file. The meta-data index files associated with a particular type of meta-data type and meta-data value of that meta-data type may be stored in a meta-data index file with a filename derived from the meta-data type and meta-data value of that meta-data type. In this manner, the meta-data associated with computer files may easily be searched using the meta-data index files.

Abstract: Methods, systems, and apparatus, including computer program products for handling a workflow within an electronic document. Participants are chosen for the workflow and the activities are assigned to the workflow participants. Workflow information is obtained from an electronic document, where the workflow information pertains to activities assigned to a user. The user can consult on or delegate the assigned activities, in which case the electronic document is sent to the consultant or delegate. Alternatively the user can reassign future activities. If it is detected that the workflow has been completed, the user can indicate the continuing of the workflow by identifying additional workflow participants, and the electronic document is sent to one of the additional workflow participants.

Abstract: Methods, systems, and apparatus, including computer program products for handling a workflow within an electronic document. Participants are chosen for the workflow and the activities are assigned to the workflow participants. Workflow information is obtained from an electronic document, where the workflow information pertains to activities assigned to a user. The user can consult on or delegate the assigned activities, in which case the electronic document is sent to the consultant or delegate. Alternatively the user can reassign future activities. If it is detected that the workflow has been completed, the user can indicate the continuing of the workflow by identifying additional workflow participants, and the electronic document is sent to one of the additional workflow participants.

Abstract: A method of locking exclusive access to a divided computer resource that may be access by more than one different is disclosed. A computer resource that is divided into more than one piece may require exclusive access to all the individual portions before the computer resource may be used. If more than one client system attempts to access such a divided computer resource, a deadlock situation may occur. To prevent such a deadlock situation, each client that attempts to access the divided resource will issue a globally unique identifier to the divided resource. If more than one client system attempts to access portions of the same computer resource then the globally unique identifier will be used to arbitrate disputes and thus prevent deadlock.

Abstract: Methods and apparatus for inhibiting hyphenation clustering. In one aspect, the invention identifies a sequence of consecutive text lines, one or more of which end in hyphens, and calculates a hyphenation penalty value based on the number and proximity of hyphens within the sequence consecutive text lines. The hyphenation penalty can be aggregated with other format penalties to aid the identification of a paragraph layout having a best overall visual appearance.

Abstract: Programs, methods and apparatus for optimization of paragraph layouts, especially automated justified paragraph layouts. In one embodiment, the aggregate space expansion or compression necessary to achieve a particular length for a text line is first determined. In one embodiment, the length is the length of a fully justified line. Then a justification penalty is assessed to the line, the justification penalty being a function of at least a space expansion or compression and the number of inter-word spaces in the text line. Accordingly, the invention can be employed advantageously to inhibit visually unpleasant degrees of space compression or space expansion in fully justified paragraph layouts.

Abstract: Programs, methods and apparatus for optimization of paragraph layouts, especially automated justified paragraph layouts. In one embodiment, the aggregate space expansion or compression necessary to achieve a particular length for a text line is first determined. In one embodiment, the length is the length of a fully justified line. Then a justification penalty is assessed to the line, the justification penalty being a function of at least a space expansion or compression and the number of inter-word spaces in the text line. Accordingly, the invention can be employed advantageously to inhibit visually unpleasant degrees of space compression or space expansion in fully justified paragraph layouts.

Abstract: A technique for automated paragraph layout identifies possible lines within a paragraph in a top-down pass through the paragraph, selects a combination of the possible lines in a bottom-up pass through the paragraph, and specifies a layout for the paragraph within a page according to the selected combination.

Abstract: Methods and apparatus for inhibiting hyphenation clustering. In one aspect, the invention identifies a sequence of consecutive text lines, one or more of which end in hyphens, and calculates a hyphenation penalty value based on the number and proximity of hyphens within the sequence consecutive text lines. The hyphenation penalty can be aggregated with other format penalties to aid the identification of a paragraph layout having a best overall visual appearance.

Abstract: A method for regulating the asking and motivating the answering of questions via a computer network. The number and complexity of questions asked is controlled by a question regulation method, and the number and quality of answers provided is controlled by an answer evaluation method. The question regulation method permits users to post more numerous or more complex questions based on factors such as viewing of advertising, or provision of marketing information. The answer measurement method may be used to reward those who supply numerous or high-quality answers with premiums, public recognition, or employment opportunities.