Abstract: A method and system for call setup in an evolved third generation (3G) radio access network are disclosed. A wireless transmit/receive unit (WTRU) sends its identity to a core network (CN) for call setup when the WTRU is in an RRC_disconnected state. The CN verifies the identity and sends an authentication vector to the WTRU. The WTRU sends a service access request message including an authentication response to the CN via a Node-B. The Node-B performs an admission control. The CN attaches the WTRU if the authentication response is same to an expected response. The Node-B then allocates radio resources to the WTRU. The Node-Bs may be directly connected, or may be connected to a control plane server which performs admission control. When the WTRU is transitioning from an RRC_idle state to an RRC_connected state, the WTRU may or may not need to re-authenticate again.

Abstract: A wireless communications network includes access points and wireless nodes. Each access point and each wireless node has a respective authentication token and address associated therewith. The access points and wireless nodes communicate using packets, where each packet includes an authentication token, an origination address and a destination address. During the communications, the access points read and store the respective authentication tokens and origination addresses in the packets wirelessly transmitted from the wireless nodes for defining an allowed wireless node list. Likewise, each wireless node reads and stores the respective authentication tokens and origination addresses wirelessly transmitted from the access points for defining an allowed access point list. The wireless nodes and access points do not associate with an attacker if both an authentication token and an address associated with the attacker are not on the respective allowed access point and wireless node lists.

Abstract: The present invention relates to secret key generation and authentication methods that are based on joint randomness not shared by others (JRNSO), in which unique channel response between two communication terminals generates a secret key. Multiple network access points use a unique physical location of a receiving station to increase user data security. High data rate communication data is encrypted by generating a random key and a pseudo-random bit stream. A configurable interleaving is achieved by introduction of JRNSO bits to an encoder used for error-correction codes. Databases of user data are also protected by JRNSO-based key mechanisms. Additional random qualities are induced on the joint channel using MIMO eigen-beamforming, antenna array deflection, polarization selection, pattern deformation, and path selection by beamforming or time correlation. Gesturing induces randomness according to uniquely random patterns of a human user's arm movements inflected to the user device.

Abstract: A system and method for managing assets in a file system or plural Web servers includes crawling the assets to identify the assets in the system and any reference pointers, such as hyperlinks in the Web context, to other assets in the system. Metadata representing the assets and pointers is stored in a database that is linked to the assets, such that, e.g., backing up of the database causes the assets to be backed up. Any broken pointers such as hyperlinks that point to non-existent Web pages are addressed. Then, the database and the links between the database and the underlying assets are used to manage subsequent modifications, additions, and deletions to, e.g., assets on a Web server, such that it can be ensured that when a user clicks on a hyperlink, a “file not found” message is avoided.

Abstract: A clustered computer system includes a shared data storage system, preferably a virtual shared disk (VSD) memory system, to which the computers in the cluster write data and from which the computers read data, using data access requests. The data access requests can be associated with deadlines, and individual storage devices in the shared storage system satisfy competing requests based on the deadlines of the requests. The deadlines can be updated and requests can be killed, to facilitate real time data access for, e.g., multimedia applications such as video on demand.

Abstract: A method and system for securing wireless communications is disclosed. In one embodiment, different security policies are used based on the distance between a receiver and a transmitter, whereby data in the wireless communications can only be demodulated if received in particular trust zones. In another embodiment, a plurality of bit stream fragments are transmitted by a plurality of transmitters to a receiver located in an area where transmission patterns radiated by the transmitters intersect. Alternatively, the receiver performs a function on packet data units (PDUs) transmitted by the transmitters. In yet another embodiment, primary modulation points of a modulation constellation are split into clusters of proximate secondary modulation points which can be demodulated only by a receiver that is within range of the transmitter. In yet another embodiment, a main waveform is transmitted which overlays a QPSK signal with hierarchical modulation (HM) having encoded descrambling information.

Abstract: A system and method for context-sensitive federated search across multiple heterogeneous data sources in real-time are disclosed. A user interface receives search query context information from a user. A decision engine interprets the search query context through an internal query classification system. Data sources relevant to the search query are identified for searching. The identification of data sources is aided by dynamically updated source statistics where relevance factors of various sources with respect to different input search categories are stored. These data sources are suggested to the user. Based on the user selection, search queries are formulated for each source and search results are retrieved via associated communication protocols. These search results are consolidated and formatted for presenting to the user. Further, the relevance of the sources to the input categories are automatically updated based on the result sets and user selections.

Abstract: A clustered computer system includes a shared data storage system, preferably a virtual shared disk (VSD) memory system, to which the computers in the cluster write data and from which the computers read data, using data access requests. The data access requests can be associated with deadlines, and individual storage devices in the shared storage system satisfy competing requests based on the deadlines of the requests. The deadlines can be updated and requests can be killed, to facilitate real time data access for, e.g., multimedia applications such as video on demand.

Abstract: A clustered computer system includes a shared data storage system, preferably a virtual shared disk (VSD) memory system, to which the computers in the cluster write data and from which the computers read data, using data access requests. The data access requests can be associated with deadlines, and individual storage devices in the shared storage system satisfy competing requests based on the deadlines of the requests. The deadlines can be updated and requests can be killed, to facilitate real time data access for, e.g., multimedia applications such as video on demand.

Abstract: A system for visualizing Web assets and hyperlinks includes a domain class that accesses, via respective pipe classes, data classes that contain information on heterogenous assets. Each pipe class transforms information from its respective data class into XML, and the information is then parsed by the domain class and sent to a respective layout class. The layout classes generate graphics objects representative of the parsed information for presentation thereof on a visual display. In this way, both assets and links can be presented for visualizing the assets and, e.g., any broken links that might exist between assets. With this architecture, the system is platform-independent and extensible, and it supports a variety of data sources and integrates external applications and services.

Abstract: A system and method for dynamically determining whether a client computer or a web site server computer is to process web site database data to render a data structure, such as a web page, in response to a request from the client computer. The request from the client computer implicitly or explicitly indicates the processing capability of the client computer, and if the client's processing capability is sufficient to render the web site data into a web page in fulfillment of the request, and the web server usage is high and server policy permits it, the unprocessed data and necessary classes of processing code are downloaded to the client computer, which then processes the data to render the requested web page. Otherwise, the server computer processes the data and returns the web page to the client computer.

Abstract: A method of combining information from multiple heterogeneous workers comprises transmitting a first search request to a search worker to assist the search worker in searching a first database and returning a first results set. A second search request is directed to a peer worker to assist the peer worker in initiating a search of a second database across a network asynchronously from the search worker and returning a second results set. The first results set and second results set are then incorporated into a composite results set.

Abstract: A method of ranking search results includes producing a relevance score for a document in view of a query. A similarity score is calculated for the query utilizing a feature vector that characterizes attributes and query words associated with the document. A rank value is assigned to the document based upon the relevance score and the similarity score.

Abstract: This invention includes the step of transmitting a query to a set of search engines. Any result lists returned from these search engines is received, and a subset of entries in each result list is selected. Each entry in this subset is assigned a scoring value according to a scoring function, and each result list is then assigned a representative value according to the scoring values assigned to its entries. A merged list of entries is produced based upon the representative value assigned to each result list.

Abstract: Management of a distributed object system containing persistent objects using a database management system. Persistent objects are stored in distributed object system files and the distributed object system is connected to a client application. A connection is created between a database system and the distributed object system for exchange of information between the database system and the distributed object system files. Control information is provided on the connection between the database system and the distributed object system files, which causes the distributed object system to control processing of the objects in the distributed object system files according to constraints established at the database system.

Abstract: This invention includes the step of transmitting a query to a set of search engines. Any result lists returned from these search engines is received, and a subset of entries in each result list is selected. Each entry in this subset is assigned a scoring value according to a scoring function, and each result list is then assigned a representative value according to the scoring values assigned to its entries. A merged list of entries is produced based upon the representative value assigned to each result list.

Abstract: A method of ranking search results includes producing a relevance score for a document in view of a query. A similarity score is calculated for the query utilizing a feature vector that characterizes attributes and query words associated with the document. A rank value is assigned to the document based upon the relevance score and the similarity score.

Abstract: An affinity-based router and method for routing and load balancing in an encapsulated cluster of server nodes is disclosed. The system consists of a multi-node server, wherein any of the server nodes can handle a client request, but wherein clients have affinity to one or more of the server nodes that are preferred to handle a client request. Such affinity is due to state at the servers either due to previous routing requests, or data affinity at the server. At the multi-node server, a node may be designated as a TCP router. The address of the TCP router is given out to clients, and client requests are sent thereto. The TCP router selects one of the nodes in the multi-node server to process the client request, and routes the request to this server; in addition, the TCP router maintains affinity tables, containing affinity records, indicating which node a client was routed to.

Abstract: An affinity-based router and method for routing and load balancing in an encapsulated cluster of server nodes is disclosed. The system consists of a multi-node server, wherein any of the server nodes can handle a client request, but wherein clients have affinity to one or more of the server nodes that are preferred to handle a client request. Such affinity is due to state at the servers either due to previous routing requests, or data affinity at the server. At the multi-node server, a node may be designated as a TCP router. The address of the TCP router is given out to clients, and client requests are sent thereto. The TCP router selects one of the nodes in the multi-node server to process the client request, and routes the request to this server; in addition, the TCP router maintains affinity tables, containing affinity records, indicating which node a client was routed to.

Abstract: A clustered computer system includes a shared data storage system, preferably a virtual shared disk (VSD) memory system, to which the computers in the cluster write data and from which the computers read data, using data access requests. The data access requests can be associated with deadlines, and individual storage devices in the shared storage system satisfy competing requests based on the deadlines of the requests. The deadlines can be updated and requests can be killed, to facilitate real time data access for, e.g., multimedia applications such as video on demand.