Abstract: The invention discloses a DNN watermarking method, comprising embedding part of the digital watermark in selected redundant elements of a deep neural network (DNN) model—without compromising the performance of the DNN. The proposed method aims for a robust watermark scheme by embedding a large watermark that can span the whole DNN model. If an adversary attempts to destroy the watermark, the whole DNN model will be destroyed. However, maximizing the hiding capacity can lead to degradation in the performance of the DNN model. In this work, this capacity-performance trade-off problem is solved using the Discrete Cosine Transform (DCT). Moreover, the DCT can work more efficiently with highly correlated data. Therefore, this work suggests segmenting the weights of the DNN model into correlated segments to fully exploit the advantages of the DCT.

Abstract: An apparatus for ensuring quality-of-service in a network is provided. A first stream sender having a flow control parameter and transmitting a first stream. A network interconnection receiving the first stream and a second stream. First stream being a non-realtime stream and the second stream being a realtime stream. A bandwidth control being associated with the network interconnection. The bandwidth control adjusting the flow control parameter for supporting quality-of-service parameters associated with the second stream.

Abstract: A method is provided for managing memory resources in a service gateway environment. The method includes: receiving a service request, the service request having an associated memory space requirement that exceeds total available memory space associated with the gateway environment; determining a number of dependent service instances for each service instance; determining an accumulative memory space requirement for each service instance; identifying a subset of service instance whose memory space requirement exceeds the memory space requirement of the service request, the subset having a minimal number of the service instances; and performing a memory resource management operation in relation to the identified subset of service instances.

Abstract: A caller identification system for an instant messaging service identifies the sender of a message to the recipient. The caller identification system includes audio data, visual data, a private code, or other data indicative of the sender in an invite request. The recipient receives the invite request and is able to decide whether to allow a communication session with the sender based on the data.

Abstract: The disk scheduling algorithms try to service a request with lower priority and strict deadline only if serving this request is not going to violate the deadline constraints of a higher priority request. One of the algorithms uses a single queue to hold all the requests regardless of their priority. The single queue is reorganized after the arrival of a new request according to the order requests would be serviced. A second algorithm uses multiple queues. Each queue holds only requests with the same priority, and the requests in each priority queue are sorted according to their deadlines. The decision of servicing a request is made at scheduling time.

Abstract: An apparatus for ensuring quality-of-service in a network is provided. A first stream sender having a flow control parameter and transmitting a first stream. A network interconnection receiving the first stream and a second stream. First stream being a non-realtime stream and the second stream being a realtime stream. A bandwidth control being associated with the network interconnection. The bandwidth control adjusting the flow control parameter for supporting quality-of-service parameters associated with the second stream.

Abstract: The invention includes a system and method of programming a recording device to record at least one broadcast program. The method receives at a server, through a communications network, a request to program the recording device. The server customizes a page of programming information, including an identification of the one broadcast program. The customizing includes attaching a hyper link to the identified broadcast program and embedding an instruction to the recording device in the hyper link. The server transmits the customized page of programming information for user selection of the identified broadcast program through the hyper link. The request to program the recording device is transmitted through the communications network from a device, such as a cellular telephone, a personal computer or a personal digital assistant.

Abstract: A method is provided for managing memory resources in a service gateway environment. The method includes: receiving a service request, the service request having an associated memory space requirement that exceeds total available memory space associated with the gateway environment; determining a number of dependent service instances for each service instance; determining an accumulative memory space requirement for each service instance; identifying a subset of service instance whose memory space requirement exceeds the memory space requirement of the service request, the subset having a minimal number of the service instances; and performing a memory resource management operation in relation to the identified subset of service instances.

Abstract: A multi-media file system for conmmunicating information between a multi-media client and a network storage device over a network. The file system includes a cluster that comprises one cluster manager and at least one file manager with each network storage device. The cluster manager is located on a client, includes an admission controller for controlling the admission of a request from a client for a file operation upon a selected file. A network bandwidth request from the admission controller is responded to by a network status determiner included in the cluster manager. The network status determiner determines the available network bandwidth. Each file manager is located on one of the clients. The file managers manage file maintenance procedures of corresponding files located on the network storage device. Each file manager includes a disk status determiner for determining the available disk bandwidth. The disk status determiner responds to a request from the admission controller.

Abstract: A process is presented for supporting simultaneous disk read and write requests in a video server environment. Read requests are the result of movie viewing, while write requests are the result of video clip editing or movie authoring procedures. Due to real-time demands of movie viewing, read requests have to be fulfilled within certain deadlines, otherwise they are considered lost. Since the data to be written into disk is stored in main memory buffers, write requests can be postponed until critical read requests are processed. However, write requests still have to be proceeded within reasonable delays and without the possibility of indefinite postponement. This is due to the physical constraint of the limited size of the main memory write buffers. The new process schedules both read and write requests appropriately, to minimize the amount of disk reads that do not meet their presentation deadlines, and to avoid indefinite postponement and large buffer sizes in the case of disk writes.

Abstract: Multi-media servers provide clients with streaming data requiring soft real-time guarantee and static data requiring a large amount of storage space. The servers use a pull-mode protocol to communicate with clients through a real-time network. Separate data and control channels enhance the soft real-time capability of the server. The data channel conforms to open standard protocol. A switched data link layer for the control channel permits separate intrahost control messages that may be multicast and broadcast. The distributed file system selects a specific data block size based upon the compression technique employed to enhance soft real-time guarantee. A hierarchal data structure combined with merging empty data blocks minimizes disk fragmentation. Data blocks are striped across multiple disks to improve disk utilization. A local buffer and a queue for both read and write requests provides support for simultaneous read and write data streams.

Abstract: The disk scheduling system supports the processing of simultaneous storage device read and write requests in a video server environment, thereby supporting both video-on-demand and non-linear editing applications. Read requests are the result of movie viewing, while write requests are the result of video clip editing or movie authoring procedures. Due to real-time demands of movie viewing, read requests have to be fulfilled within certain deadlines, otherwise they are considered lost. Since the data to be written into the storage device is stored in main memory buffers (or write buffers), write requests can be postponed until critical read requests are processed. However, write requests still have to be proceeded within reasonable delays and without the possibility of indefinite postponement. This is due to the physical constraint of the limited size of the main memory buffers.

Abstract: A data organization scheme for movies stored on a video server. The method utilizes the available bandwidth and space in the I/O system to avoid the data contention in the ATM. Basically, parts of the hot movies are replicated on the server unit. Most of the requests to the hot movie are directed to this unit. But if the server unit can not deliver the required video object within the required time limit (because of the large queue length) the video object is transported from the other server units through the ATM network. All the requests that are fulfilled locally by the server unit will not go through the network. Thus, the traffic through the ATM decreases on the expense of increasing the disk utilization.

Abstract: Apparatus for determining a distance between two handwritten strings in a database. A processor extracts global features from each string. The processor divides the string into strokes, and identifies a plurality of bounding boxes. Each box contains a different stroke. The processor extracts global features from the suing, including: (1) a number of points; (2) a maximum angle between a first point in the string and a corner of the tallest bounding box; (3) a number of positive inversions; and (4) a number of negative inversions. The apparatus calculates the distance between the strings based on all of the numbers of points, maximum angles, numbers of positive inversions and numbers of negative inversions. A fixed query tree index may be formed. The tree has leaves and internal nodes belonging to multiple levels. A different key is associated with each level. Each key is a handwritten string.

Abstract: A method for indexing a plurality of handwritten objects is provided. A B-tree data structure of order m is generated, where m is an integer. The B-tree has a plurality of nodes divided into a plurality of levels ordinally numbered 0.sup.th through n.sup.th. Each node in the 0.sup.th level is a leaf. Each node in the 1.sup.th level has at least m/2 leaves as children. Each one of the handwritten objects is assigned to a respective leaf. A respectively different hidden Markov model (HMM) is associated with each respective child of each of the nodes in the 1.sup.th to n.sup.th levels. Each one of the nodes in the 1.sup.th to n.sup.th levels contains the respective HMM associated with the child of the one node. Each HMM in each one of the nodes in the 1.sup.th level is trained to accept the handwritten object of the respective leaf that is a child of the one node. Each HMM associated with any of the nodes in the 2.sup.th through n.sup.