Abstract: A light fixture includes a visible light module and a germicidal light module. The visible light module may include one or more visible light engines designed for emitting visible light for general illumination. The visible light module may define a top side, a bottom side opposite the top side, and an outer perimeter around the top side and the bottom side. The visible light module may define an aperture extending through the visible light module from the top side to the bottom side. The visible light module may be designed to emit the visible light out of and across the bottom side from the outer perimeter to an inner perimeter defined by the aperture. The germicidal light module may be coupled to the visible light module. The germicidal light module includes a germicidal light engine designed to emit germicidal light through the aperture effective in deactivating pathogens.

Abstract: The present invention enhances a golf tournament using novel tournament rules that include allowing proficient players to interact with other players, more particularly, professional players to affect the outcome of the tournament. After teams are created the game a best ball is played at the first day, a low and aggregate ball is played on the second day and a worse ball is played on the last day. At the end of the tournament the team with the lowest score wins.

Abstract: A method for scoring a golf tournament that incorporates, in part, a worst ball format is presented. The invention is directed to a tournament or rounds of golf of teams of two golfers each. On certain of the holes, the format is a best ball format. On other holes, the format is a worst ball format, and on yet other holes, the format is a weighted one, in which the scores of the golfer for each hole are added together, and then either the best or worst score for that hole is added again. The team having the lowest total score at the end of the tournament is the winner.

Abstract: A table configured for play of the game Monte in a casino includes a number of player positions and a dealer position. It further includes a number of card areas and a number of bet areas. Chips are used to place bets. The casino pays bets in an amount less than the original bet for a window winner and in an amount equal to the bet for a match winner. The bets are paid in chips.

Abstract: A table configured for play of the game Monte in a casino includes a number of player positions and a dealer position. It further includes a number of card areas and a number of bet areas. Chips are used to place bets. The casino pays bets in an amount less than the original bet for a window winner and in an amount equal to the bet for a match winner. The bets are paid in chips.

Abstract: Apparatus and method are disclosed for enabling rapid search of magnetic tape having information helically recorded thereon. A tape mark, consisting of an analog signal, is recorded on the magnetic tape as a physical location reference in a manner such that the mark can be detected at both normal playback speed and at faster search speeds. The recorded analog signal provides a highly reliable indication of record boundaries, including end of file, end of volume, end of directory, and the like.

Abstract: Short traces of consecutive CPU references to storage are accumulated and processed to ascertain hit ratio as a function of cache size. From this determination, an allocation of cache can be made. Because this determination requires minimal processing time, LRU-referenceable memory space among concurrently executing sequential processes is used dynamically by a CPU cache manager.

Abstract: Apparatus for detecting and correcting errors in one or two tracks of a multi-bit, multi-track data group which includes an error correction character (ECC). The received data group is simultaneously stored and applied to an ECC generator which operates upon each data byte according to an operator B such that an error correction character ECC is reproduced. The ECC is of such a nature that another application of operator B produces a new character termed an error vector E. If all of the received data characters are correct all data bits of the error vector E will be zero. The error vector may be regressively operated on by the operator B and sequentially compared to a locally-generated parity vector P.sub.n. If single track is in error its identity is determined by the number of cycles by operator B necessary to obtain an error vector identical to the parity vector.