Abstract: A decision as to whether a mobile terminal has transmitted an ACK, a NACK or a NULL from a received signal at a base station is made by successively eliminating one of the three possible transmitted symbols by sequentially applying decision rules that maximize network throughput by minimizing the sum of the weighted costs of making a decision based on the magnitude of the received signal.

Abstract: A method and apparatus for allowing a reseller to securely access and manage scratch cards at a recharge card management system that is maintained by the service provider. The service provider and reseller users of the recharge card management system can create a scratch card batch that is associated with the reseller account identification. The service provider and reseller users can search, view and modify scratch card data based on security and accessibility. Advantageously, the reseller or distributor can only manage and sell scratch card only to its own account identification, thus protecting such transactions against fraud.

Abstract: A multi-stage (e.g., two-stage) packet-based lookup process using a Ternary Content Addressable Memory (TCAM) divided into partitions. The result of a first stage lookup is used to selectively search one of a plurality of TCAM partitions during the second stage. A subset of destination address bits may be used in the first stage to hash to a selected partition for the second stage. Alternatively, a partitioning algorithm segments a routing trie into partitions, and then, either a separate, small TCAM or one of the partitions is used in the first stage to map a prefix of the destination address to one of the TCAM partitions for use in the second stage. The “trie-based” algorithms may advantageously partition the trie such that each second stage partition comprises a substantially contiguous sequence of routing prefixes in a post-order traversal of the routing trie, together with one or more covering prefixes thereof.

Abstract: A MEMS device having a movable plate supported on a substrate by a support structure that is hidden under the plate and yet which can be implemented to enable rotation of the plate with respect to the substrate about a rotation axis lying at the plate surface. As a result, the support structure does not take up any area within the plane of the plate, while enabling rotation of the plate, during which the plate does not substantially move sideways. The latter property reduces potential physical interference between neighboring plates in an arrayed MEMS device and enables implementation of a segmented mirror having relatively narrow gaps between adjacent segments and, thus, a relatively large fill factor, e.g., at least 98%.

Abstract: A method of scheduling data communication over an uplink. The method enables two or more users seeking to transmit data over the uplink to be scheduled in response to their path loss. The user having the most attractive determined path loss among the two or more users seeking to transmit data over the uplink us scheduled first. Thereafter, the next user having the next most attractive path loss among the remaining users may be subsequently scheduled if the total noise rise leftover is greater than zero. This process repeats so long as or until the total noise rise leftover is about zero.

Abstract: A failure of a network element is detected automatically. A bootable image of the network element is electronically retrieved upon detection of the failure of the network element. The bootable image is employed to restore the network element.

Abstract: A method and apparatus for tracing of computer documents is disclosed. A computer processor stores a processor identifier that is unique to the particular processor. Documents created by a computer system are tagged with an identification tag that is a value which results from performing a cryptographic function on the hash of the document and the unique processor identifier. Processor associators are stored in a secure database, with each of the processor associators being associated with one of the unique processor identifiers. In a first embodiment, the processor associators are the same as the processor identifiers. In a second embodiment, the processor identifiers are a function of their related processor associator. Documents may be traced by a third party possessing a document (including an attached identification tag) and a database of processor associators and user identification data associated with each of the processor associators.

Abstract: Techniques for computing a globally consistent set of image feature correspondences across a wide range of viewpoints suitable for interactive walkthroughs and visualizations. The inventive approach takes advantage of the redundancy inherent in a dense set of images captured in a plane (or in higher dimensions, e.g., images captured in a volume, images captured over time, etc). The technique may detect features in a set of source images and track the features to neighboring images. When features track to the same position in the same image, they are flagged as potential correspondences. Among the potential correspondences, the technique selects the maximal set using a greedy graph-labeling algorithm (e.g., best-first order). Only correspondences that produce a globally consistent labeling are selected. After globalization is done, a set of features common to a group of images can be quickly found and used to warp and combine the images to produce an interpolated novel view of the environment.

Abstract: A method for tracing packets in a communications network directed to tracing a stream of anonymous packets received at a given target host, in order to identify their source, in response, for example, to a Denial-of-Service (“DoS”) attack on the target host. Advantageously, the tracing is performed without reliance on knowledge or cooperation from intervening Internet Service Providers (ISPs) along the path. The method is performed by applying a “burst load” (i.e., a brief but heavy load of transmitted packets) to various elements (i.e., links or routers) in the network and measuring the change in the rate with which the stream of packets arrive at the target. If the rate is substantially altered upon introduction of the burst load, then it may be deduced that the given element is most likely on the path from the source host of the DoS attack to the target host.

Abstract: The bread pudding protocol of the present invention represents a novel use of proofs of work and is based upon the same principle as the dish from which it takes its name, namely, that of reuse to minimize waste. Whereas the traditional bread pudding recipe recycles stale bread, our bread pudding protocol recycles the “stale” computations in a POW to perform a separate and useful task, while also maintaining privacy in the task. In one advantageous embodiment of our bread pudding protocol, we consider the computationally intensive operation of minting coins in the MicroMint scheme of Rivest and Shamir and demonstrate how the minting operation can be partitioned into a collection of POWs, which are then used to shift the burden of the minting operation onto a large group of untrusted computational devices. Thus, the computational effort invested in the POWs is recycled to accomplish the minting operation.

Abstract: In a multiple node network, the method includes waking up at least one node from a sleep mode during at least one associated slot of a time-slotted frame, the sleep mode being a low power consumption mode. Also, in at least one node of a multiple node network, the period of time a node sleeps is based on the residual energy of the node, the residual energy of the nodes in the neighborhood, neighborhood node density, and combinations thereof.

Abstract: In one embodiment, a control method, according to which a cascade of control messages is propagated between nodes of an optically transparent network, with each message being sent from a node to an adjacent downstream node to inform the latter about a control operation scheduled to be performed at the message-sending node and/or an upstream node that impacts an optical communication signal received at that downstream node. The cascade of control messages effectively creates an ad hoc control domain, in which control operations performed at various nodes of that domain can be coordinated to reduce unfavorable interactions between those control operations. By repeatedly propagating appropriate cascades of control messages through the network, control domains can be changed dynamically and adaptively to reflect any changes to the network topology, equipment, and/or traffic distribution.

Abstract: A method for routing emergency calls is provided for emergency calls placed over a packet-switched network (310) from a Customer Premises Equipment (CPE) (110) at a remote location (100). The method includes: registering the CPE (110) with a home Internet Service Provider (ISP) (260) through a remote ISP (130) that is providing the CPE (110) access to the packet-switched network (310); determining that the CPE is at a remote location (100); obtaining a local Internet Protocol (IP) address that corresponds to a Public Safety Answering Point (PSAP) (170) serving the remote location (100); routing non-emergency calls to the home ISP (260) for call processing; and, handling emergency calls locally at the remote ISP (130) in accordance with the obtained local IP address.

Abstract: Methods and apparatuses for allocating control and data time slots to a plurality of wireless mobile stations in a wireless communication system using time division multiplexing. The methods and apparatuses assign such time slots by first placing the wireless mobile stations into a number of different groups. Then, control time slots and anchor data time slots are assigned to the groups in the uplink and downlink frames of a carrier such that the uplink control time slot for each group is maximally spaced in time relative to the downlink control time slot for the same group. Data time slots are subsequently assigned to a particular mobile station by assigning time slots in the uplink and downlink frames which are as close as possible to the group's uplink or downlink anchor data time slots, as the case may be, according to a “grow from center” technique.

Abstract: In the operation of an MPLS network or the like, a network node receives a plurality of packets assigned to a label switched path (LSP) which exits the node on a link bundle. The node forwards the received packets such that packets assigned to the LSP are distributed over two or more distinct component links of the bundle.

Abstract: A packet-based traffic forwarding system with a plurality of contending queues. Each queue has an allocated bandwidth and an associated borrow vector. When a first queue does not consume all of its allocated bandwidth, the borrow vector associated with a second queue is checked to determine whether the second queue is permitted to use the unconsumed allocated bandwidth of the first queue. If the second queue has packets to forward, the second queue forwards the packets using the unconsumed allocated bandwidth of the first queue.

Abstract: Apparatus in one example comprises network controller(s) that serve to communicatively couple first network component with second network component. The first network component sends signaling message for the second network component to one or more of the network controller(s). The signaling message comprises indication of specific network connection(s) usable by the first network component. One or more of the network controller(s) serve to replace the indication of the specific network connection(s) usable by the first network component in the signaling message with wild card network connection information. The one or more of the network controller(s) serve to send the signaling message that comprises the wild card network connection information to the second network component. The wild card network connection information indicates the second network component is allowed to indicate to one or more of the network controller(s) specific network connection(s) usable by the second network component.

Abstract: A method for performing network control in wireless communication systems and a network entity for performing the same. The method and network entity pool at least one network parameter at the network entity, from at least two active set base transceiver stations and determine a current status of a mobile in the wireless communication system, using the pooled network parameters. The active set base transceiver stations may include a serving base transceiver station and a target base transceiver station. The network parameter may be a confidence metric and/or an error metric for each of a plurality of hypotheses, a power up/power down signal, and/or a measured signal-to-noise ratio and/or energy parameter of a pilot signal from the mobile. The current status of the mobile to be determined may be the mobile's decision to switch to the target base transceiver station transceiver or which base transceiver station transceiver the mobile is currently communication with.

Abstract: The disclosed embodiments relate to a communication system and method. The system may comprise a pre-whitening device that applies pre-whitening data to a received signal from an antenna array to produce a pre-whitened signal, at least one detector that is adapted to recognize a pattern corresponding to a request for access in the pre-whitened signal and compute correlation data corresponding to the pattern, and a threshold detector that determines whether the correlation data exceeds a threshold and indicates that an acknowledgement signal should be transmitted if the threshold is exceeded. The method may comprise the acts of creating a pre-whitened signal by applying pre-whitening data to a received signal, detecting a pattern that corresponds to a request for access in the pre-whitened signal, computing correlation data corresponding to the pattern, determining whether the correlation data exceeds a threshold, and indicating that an acknowledgement signal should be transmitted if the threshold is exceeded.

Abstract: The amount of TCP/IP packets which can be sent from an Internet network to a wireless network is maximized by modifying a receive window value of an acknowledgment (ACK) before the ACK is sent on to a source of data packets within the Internet network. The receive window value is modified to take into consideration delay and rate variations which occur in the wireless network.