Abstract: A computer implemented online music distribution system provides for the secure delivery of audio data and related media, including text and images, over a public communications network. The online music distribution system provides security through multiple layers of encryption, and the cryptographic binding of purchased audio data to each specific purchaser. The online music distribution system also provides for previewing of audio data prior to purchase. In one embodiment, the online music distribution system is a client-server system including a content manager, a delivery server, and an HTTP server, communicating with a client system including a Web browser and a media player. The content manager provides for management of media and audio content, and processing of purchase requests. The delivery server provides delivery of the purchased media data. The Web browser and HTTP server provide a communications interface over the public network between the content manager and media players.

Abstract: Data such as a musical track is stored as a secure portable track (SPT) which can be bound to one or more players and can be bound to a particular storage medium, restricting playback of the SPT to the specific players and ensuring that playback is only from the original storage medium. The SPT is bound to a player by encrypting data of the SPT using a storage key which is unique to the player, is difficult to change, and is held in strict secrecy by the player. The SPT is bound to a particular storage medium by including data uniquely identifying the storage medium in a tamper-resistant form, e.g., cryptographically signed. The SPT can also be bound to the storage medium by embedding cryptographic logic circuitry, e.g., integrate circuitry, in the packaging of the storage medium. The SPT is bound by encrypting an encryption key using the embedded logic.

Abstract: Watermark data is encoded in a digitized signal by forming a noise threshold spectrum which represents a maximum amount of imperceptible noise, spread-spectrum chipping the noise threshold spectrum with a relatively endless stream of pseudo-random bits to form a basis signal, dividing the basis signal into segments, and filtering the segments to smooth segment boundaries. The data encoded in the watermark signal is precoded to make the watermark data inversion robust and is convolutional encoded to further increase the likelihood that the watermark data will subsequently be retrievable notwithstanding lossy processing of the watermarked signal.

Abstract: Watermark data is encoded in a digitized signal by forming a noise threshold spectrum which represents a maximum amount of imperceptible noise, spread-spectrum chipping the noise threshold spectrum with a relatively endless stream of pseudo-random bits to form a basis signal, dividing the basis signal into segments, and filtering the segments to smooth segment boundaries. The data encoded in the watermark signal is precoded to make the watermark data inversion robust and is convolutional encoded to further increase the likelihood that the watermark data will subsequently be retrievable notwithstanding lossy processing of the watermarked signal. A watermark alignment module determines which of a large number of offsets of the watermarked data is most likely to correspond to a recognizable watermark. The watermark alignment module uses a single basis signal to evaluate a number of offsets over a relatively narrow range of offsets.

Abstract: A device securely decrypts and writes an encrypted digital file to a local recordable storage medium. The device uses two decryption engines. The first decryption engine incrementally decrypts the encrypted digital file, which is then preprocessed and re-encrypted to form an intermediate file. The second decryption engine then incrementally decrypts the intermediate file and writes the decrypted results to a local recordable storage medium. Both decryption engines perform incremental decryption, such that substantially less than all of the digital file is in decrypted form at any instant. A device in accordance with a second embodiment includes a single decryption engine. The encrypted digital file includes individually encrypted portions, and the decryption engine incrementally decrypts the encrypted portions. These portions are buffered for subsequent writing to the recordable storage medium, but substantially less than all of the individually encrypted portions are stored in decrypted form at any instant.

Abstract: A bypass chute is included with a bulk ingredient beverage brewer/dispenser such that bypass chute accepts an alternative ingredient directly from a user. In conventional operation, a bulk ingredient is moved through a guide and into a brew device chamber for brewing. However, in a bypass mode, an alternative ingredient is introduced into the bypass chute by the user and the bulk ingredient is not used.

Abstract: Watermark data is encoded in a digitized signal by forming a noise threshold spectrum which represents a maximum amount of imperceptible noise, spread-spectrum chipping the noise threshold spectrum with a relatively endless stream of pseudo-random bits to form a basis signal, dividing the basis signal into segments, and filtering the segments to smooth segment boundaries. The data encoded in the watermark signal is precoded to make the watermark data inversion robust and is convolutional encoded to further increase the likelihood that the watermark data will subsequently be retrievable notwithstanding lossy processing of the watermarked signal. To produce the endless pseudo-random bit stream, subsequent bits of the sequence are generated in a pseudo-random manner from previous bits of the sequence. The pseudo-random bits are appended to the stream of pseudo-random bits and, additionally, replace a number of bits of the state.

Abstract: Soft pin locations in a hybrid paradigm are optimized according to circuit density centers of circuit components coupled to the soft pins. As a result, the soft pins are located closer to components with heavier loads and further from components with lighter loads. Circuit density centers are determined by summing coordinates weighted by circuit loads, including capacitance and resistance, and dividing the summed weighted coordinates by a sum of the weights. To avoid blockage, optimized soft pin locations can be moved to soft block boundaries relative to the optimized locations.

Abstract: An audio encoding system includes quantization, phase matching, compressed domain processing and other improvements enabling high fidelity, low bit rate encoding systems to be formed. In a preferred embodiment a novel transient detector is used to divide an audio source into transient, low frequency non-transient and high frequency non-transient regions. Low frequency non-transients are sinusoid modeled and the residual is low frequency noise modeled. Transients are transform coded and high frequency non-transients and transform coded residual is high frequency noise modeled. The preferred embodiment also includes novel sinusoid, transform coded and noise quantization, among other methods for providing high fidelity data reduction and for interfacing sinusoid modeling and transform coding. Compressed domain time compression and expansion are further achieved with no detrimental effect on transients.

Abstract: A hierarchical circuit design is divided into independent components which can be processed independently of one another to simultaneously achieve the advantages of both hierarchical and flat paradigms. Blocks of the circuit design are flattened sufficiently to place and route global networks through the blocks. The flattened blocks of the circuit design are de-coupled to form independent blocks. In de-coupling the blocks, pins are added at intersections of the global networks with boundaries of the blocks. The global networks are divided into wire fragments between the pins and components of the flattened circuit design in generally the same place previously occupied by the global networks. Wire fragments inside a particular block of the circuit design are added to the block. Wire fragments outside all blocks are fixed as components of the circuit design. The blocks are therefore de-coupled at the pin positions along the block boundaries.

Abstract: Watermark data is encoded in a digitized signal by forming a noise threshold spectrum which represents a maximum amount of imperceptible noise, spread-spectrum chipping the noise threshold spectrum with a relatively endless stream of pseudo-random bits to form a basis signal, dividing the basis signal into segments, and filtering the segments to smooth segment boundaries. The data encoded in the watermark signal is precoded to make the watermark data inversion robust and is convolutional encoded to further increase the likelihood that the watermark data will subsequently be retrievable notwithstanding lossy processing of the watermarked signal. The basis signal fits noise thresholds determined by constant-quality quantization approximation. Noise introduced by quantization is estimated by determining a continuously differentiable function which approximates noise introduced by such quantization and using the function to solve for a relatively optimal gain to be applied during such quantization.

Abstract: Watermark data is encoded in a digitized signal by forming a noise threshold spectrum which represents a maximum amount of imperceptible noise, spread-spectrum chipping the noise threshold spectrum with a relatively endless stream of pseudo-random bits to form a basis signal, dividing the basis signal into segments, and filtering the segments to smooth segment boundaries. The data encoded in the watermark signal is precoded to make the watermark data inversion robust and is convolutional encoded to further increase the likelihood that the watermark data will subsequently be retrievable notwithstanding lossy processing of the watermarked signal. Watermark data is encoded in a basis signal by division of the basis signal into segments and inverting the basis signal in segments corresponding to watermark data bits with a first logical value and not inverting the basis signal in segment corresponding to watermark data bits with a different logical value.

Abstract: A measuring system includes an optical site reference, such as a reference line within a scope used in surveying, and a calibrated reference scale which provides measurements by optical comparison to the optical site reference. The calibrated reference scale includes centimeter sections which in turn include upper and lower stepped sections. The upper and lower stepped sections are symmetrical with respect to one another such that the upper and lower stepped sections can be easily distinguished from one another from significant distance. Each of the steps of each stepped section indicates a specific, corresponding offset within the stepped section. The symmetry of the upper and lower stepped sections is in the relative positions of the long and short reference members.

Abstract: A base node of a computer network sends concurrent TTL query messages using multicast to other receiving nodes of the computer network. Each of the TTL query messages has a different time-to-live (TTL) parameter value and records the TTL parameter of the TTL query message into a message body. The receiving nodes receive one or more of the TTL query messages, namely, those TTL query messages whose TTL parameter values are sufficient to allow the TTL query message to reach the receiving node. Each receiving node can determine the TTL distance to the receiving node from the base node by determining the lowest TTL parameter value of all TTL query messages which reached the receiving node. Each receiving node communicates the TTL distance by sending to the base node a TTL query response message which indicates, in the message body, the least TTL parameter value of all TTL query messages received by the receiving node.

Abstract: A method and apparatus is provided for effecting secure document delivery in any of various document formats. A document is encrypted with the public key of a server associated with the recipient of the document, instead of with the public key of the intended recipient. The receiving server is located within a firewall. The encrypted document is forwarded to the server within the firewall. The server decrypts the document using its corresponding private key, converts the document to a new data representation, and then either forwards the document to the recipient inside the firewall, or re-encrypts the document with the public key of an intended recipient outside of the firewall or with the public key of another server that is associated with the intended recipient of the document.

Abstract: Digital products are delivered to a client computer through a wide area network such as the Internet only upon determination that the client computer is located in a geopolitical territory, such as a country or state, for which delivery of the digital product is authorized. A server computer estimates the geopolitical location of the client computer from the client computer's network address through contact information in a network address allocation database. Alternatively, the server computer estimates the geopolitical location of the client computer from the client computer's custom name, e.g., domain name. The domain name itself can specify a country within which the client computer is located. Such can be conventional or can be parse according to ad hoc patterns developed by large, international organizations identified by a root domain name. In addition, contact information for the domain name can be retrieved and geopolitical territory information parsed from the contact information.

Abstract: A computer sends a message to each of a number of recipient computers of a computer network by sending the message as a multicast message to near ones of the recipient computers and sending the message as unicast messages to far ones of the recipient computers. The sending computer determines the circumstances under which a combination of multicast and unicast messages are efficient by determining that many recipient computers are near the sending computer and that few recipient computers are far. The sending computer makes such a determination by determining no more than a predetermined number of recipient computers are at least a predetermined distance further from the sending computer than are the others of the recipient messages. The sending computer can also determine that the burden imposed upon the computer network by a multicast message is justified by the need to deliver the message to its intended recipients.

Abstract: An adaptive linear predictor is used to predict samples, and residuals from such predictions are encoded using Golomb-Rice encoding. Linear prediction of samples of a signal which represents digitized sound tends to produce relatively low residuals and those residuals tend to be distributed exponentially. Accordingly, linear prediction combined with Golomb-Rice encoding produces particularly good compression rates with very efficient and simple implementation. The accuracy of the linear predictor is improved by including, in the prediction of a current sample of a first channel of the digitized signal, look-ahead sample data from a corresponding second channel of the digitized signal. For example, prediction of a right channel sample of a digitized, stereo, audio signal is improved by inclusion of look-ahead left channel sample data in the right channel sample predictor.

Abstract: An adaptive linear predictor is used to predict samples, and residuals from such predictions are encoded using Golomb-Rice encoding. Linear prediction of samples of a signal which represents digitized sound tends to produce relatively low residuals and those residuals tend to be distributed exponentially. Accordingly, linear prediction combined with Golomb-Rice encoding produces particularly good compression rates with very efficient and simple implementation. A code length used in Golomb-Rice, which is typically referred to as the parameter k, is adapted for each sample in a predictable and repeatable manner to further reduce the size of a Golomb-Rice encoding for each sample. An infinite incident response filter of processed residuals automatically reduces influences of previously processed residuals upon such adaptation as additional samples are processed.

Abstract: Computer implemented training exercises present stimuli to a user and receive responses by the user to the stimuli. The stimuli are specifically selected to challenge and improve a cognitive ability of the user, e.g., the ability to perceive and understand spoken language. As a result, the stimuli cannot be changed or adapted to motivate the user through entertainment. Motivation is therefore provided by periodic reward animations which include persistent plots and characters. Progress indicators represent progress toward reward animations and represent such progression with smooth, entertaining progress animations. Randomly appearing animations and variations in rewards and immediate feedback add to the surprise and curiosity of the user and motivate further correct responses to see further random animations and variations. Progress indicators also represent a relation between the number of steps taking toward completion of a task and a maximum number of steps which should be needed to complete the task.