公开(公告)号：US06466978B1

公开(公告)日：2002-10-15

申请号：US09362819

申请日：1999-07-28

申请人： Sarit Mukherjee ,  Ibrahim Kamel ,  Prasant Mohapatra

发明人： Sarit Mukherjee ,  Ibrahim Kamel ,  Prasant Mohapatra

IPC分类号： G06F15173

CPC分类号： H04L47/10 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/0643 ,  G06F3/067 ,  G06F3/0689 ,  H04L47/12 ,  H04N21/21 ,  H04N21/23

摘要： 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.

摘要翻译： 一种多媒体文件系统，用于通过网络来协调多媒体客户端和网络存储设备之间的信息。 文件系统包括一个集群，其中包含一个集群管理器和至少一个文件管理器与每个网络存储设备。 集群管理器位于客户机上，包括允许控制器，用于控制从客户端接收对所选文件进行文件操作的请求。 来自接纳控制器的网络带宽请求由集群管理器中包括的网络状态确定器来响应。 网络状态确定器确定可用的网络带宽。 每个文件管理器位于其中一个客户端上。 文件管理器管理位于网络存储设备上的相应文件的文件维护过程。 每个文件管理器包括用于确定可用磁盘带宽的磁盘状态确定器。 磁盘状态确定器响应来自接纳控制器的请求。

公开(公告)号：US6101547A

公开(公告)日：2000-08-08

申请号：US114771

申请日：1998-07-14

申请人： Sarit Mukherjee ,  Ibrahim Kamel ,  Dennis Bushmitch ,  Walid G. Aref

发明人： Sarit Mukherjee ,  Ibrahim Kamel ,  Dennis Bushmitch ,  Walid G. Aref

IPC分类号： G06F13/10 ,  G06F13/00 ,  G06F15/16 ,  G06F17/30 ,  H04L29/06 ,  H04N21/2312

CPC分类号： H04N21/2312

摘要： 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.

摘要翻译： 多媒体服务器为客户端提供需要软实时保证的流数据和需要大量存储空间的静态数据。 服务器使用拉模式协议通过实时网络与客户端进行通信。 独立的数据和控制通道增强了服务器的软实时性能。 数据通道符合开放标准协议。 用于控制信道的交换数据链路层允许可以是多播和广播的单独的内部主机控制消息。 分布式文件系统基于用于增强软实时保证的压缩技术来选择特定数据块大小。 结合合并空数据块的层次数据结构最大限度地减少了磁盘碎片。 数据块在多个磁盘之间进行条带化，以提高磁盘利用率。 本地缓冲区和读取和写入请求的队列都支持同时读取和写入数据流。

公开(公告)号：US20060039545A1

公开(公告)日：2006-02-23

申请号：US10922287

申请日：2004-08-19

申请人： Mahfuzur Rahman ,  Cuneyt Akinlar ,  Ibrahim Kamel ,  John Buford ,  Alan Kaplan

发明人： Mahfuzur Rahman ,  Cuneyt Akinlar ,  Ibrahim Kamel ,  John Buford ,  Alan Kaplan

IPC分类号： H04M1/56 ,  H04M15/06

CPC分类号： H04L51/04 ,  H04M1/575 ,  H04M15/06 ,  H04M15/57 ,  H04M2215/208

摘要： 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.

摘要翻译： 用于即时消息收发服务的呼叫者识别系统向接收者识别消息的发送者。 呼叫者识别系统包括音频数据，可视数据，私人码或指示邀请请求中的发送者的其他数据。 收件人接收邀请请求，并且能够基于数据来决定是否允许与发送者进行通信会话。

公开(公告)号：US06263411B1

公开(公告)日：2001-07-17

申请号：US08718279

申请日：1996-09-20

申请人： Ibrahim Kamel ,  Walid G. Aref ,  Rafael Alonso

发明人： Ibrahim Kamel ,  Walid G. Aref ,  Rafael Alonso

IPC分类号： G06F1200

CPC分类号： H04N21/2182 ,  H04N21/2315 ,  H04N21/2326 ,  H04N21/8456

摘要： 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.

摘要翻译： 提出了一种在视频服务器环境中支持同时进行磁盘读写请求的过程。 读取请求是电影观看的结果，而写入请求是视频剪辑编辑或电影创作过程的结果。 由于电影观看的实时需求，读取请求必须在一定的期限内完成，否则被认为是丢失的。 由于要写入磁盘的数据存储在主存储器缓冲区中，所以可以推迟写入请求，直到处理关键的读取请求为止。 但是，写入请求仍然需要在合理的延迟之内进行，并且不会无限期地推迟。 这是由于主存储器写入缓冲器的有限大小的物理约束。 新进程适当地调度读取和写入请求，以最大程度地减少不符合其演示截止时间的磁盘读取量，并避免在磁盘写入情况下无限期推迟和大型缓冲区大小。

公开(公告)号：US5875300A

公开(公告)日：1999-02-23

申请号：US791112

申请日：1997-01-30

申请人： Ibrahim Kamel ,  Rafael Alonso

发明人： Ibrahim Kamel ,  Rafael Alonso

IPC分类号： H04N5/765 ,  H04H20/76 ,  H04L12/801 ,  H04L12/911 ,  H04N5/781 ,  H04N7/173 ,  H04N21/2318

CPC分类号： H04N7/17336

摘要： 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.

摘要翻译： 存储在视频服务器上的电影的数据组织方案。 该方法利用I / O系统中的可用带宽和空间来避免ATM中的数据争用。 基本上，部分热电影在服务器单元上复制。 大多数对热门电影的要求都是针对本机的。 但是，如果服务器单元无法在所需的时间限制内传送所需的视频对象（由于队列长度较长），则视频对象通过ATM网络从其他服务器单元传输。 服务器单元在本地完成的所有请求都不会通过网络。 因此，通过ATM的流量以增加磁盘利用率为代价降低。

公开(公告)号：US5710916A

公开(公告)日：1998-01-20

申请号：US491506

申请日：1995-06-16

申请人： Daniel Barbara ,  Ibrahim Kamel

发明人： Daniel Barbara ,  Ibrahim Kamel

IPC分类号： G06F17/30 ,  G06K9/00 ,  G06K9/22 ,  G06K9/62 ,  G06K9/68

CPC分类号： G06F17/30247 ,  G06F17/30613 ,  G06F17/30625 ,  G06K9/00409 ,  G06K9/00422 ,  G06K9/00879 ,  G06K9/6282 ,  G06K9/6297 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99936 ,  Y10S707/99939

摘要： 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. Each string is associated with one of the leaves, such that each child of each internal node in any of the levels between the one leaf and the root node is a root of a respective subtree. Each string associated with any leaf in the subtree which includes the one leaf is equally distant from the key associated with the one level, based on the global features. The tree is queried to search for a subset of the strings, such that each string in the subset is within a threshold distance of an input string, according to the distance function.

摘要翻译： 用于确定数据库中两个手写字符串之间的距离的装置。 处理器从每个字符串中提取全局特征。 处理器将字符串划分为笔画，并标识多个边框。 每个框包含不同的笔画。 处理器从诉讼中提取全局特征，包括：（1）若干点; （2）弦中的第一点与最高边界框的角之间的最大角度; （3）多次正面倒转; 和（4）一些负面的倒转。 该装置基于所有点数，最大角度，正反转数和负反转数来计算弦之间的距离。 可以形成固定的查询树索引。 树具有多个级别的叶和内部节点。 每个级别都有一个不同的密钥。 每个键都是一个手写字符串。 每个字符串与一个叶子相关联，使得一个叶子和根节点之间的任何级别中的每个内部节点的每个子节点是相应子树的根。 基于全局特征，与包含一个叶的子树中的任何叶相关联的每个字符串与与一个级相关联的密钥相同。 查询树以搜索字符串的子集，使得子集中的每个字符串根据距离函数在输入字符串的阈值距离之内。

公开(公告)号：US5649023A

公开(公告)日：1997-07-15

申请号：US410812

申请日：1995-03-27

申请人： Daniel Barbara ,  Walid Aref ,  Ibrahim Kamel ,  Padmavathi Vallabhaneni

发明人： Daniel Barbara ,  Walid Aref ,  Ibrahim Kamel ,  Padmavathi Vallabhaneni

IPC分类号： G06F17/30 ,  G06K9/00 ,  G06K9/22 ,  G06K9/62 ,  G06K9/68

CPC分类号： G06K9/00879 ,  G06F17/30625 ,  G06K9/00422 ,  G06K9/6282 ,  G06K9/6297

摘要： 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.th levels is trained to accept all of the handwritten objects in the leaves of a subtree that has as a root the respective child with which the HMM is associated.

摘要翻译： 提供了一种用于索引多个手写物体的方法。 生成阶数为m的B树数据结构，其中m为整数。 B树具有被分成多个级别的多个节点，序号为0到n。 第0级的每个节点都是叶。 第1级的每个节点至少有m / 2个叶子作为子节点。 每个手写物体被分配到相应的叶片。 分别不同的隐马尔可夫模型（HMM）与第1至第n级中的每个节点的每个相应子节点相关联。 第1至第n层中的每个节点包含与一个节点的子节点相关联的相应HMM。 训练第1级每个节点中的每个HMM接受作为该节点的子节点的相应叶子的手写对象。 与第2至第n级中的任何节点相关联的每个HMM被训练以接受子树的叶中的所有手写对象，该子树具有与HMM相关联的相应子节的根。

公开(公告)号：US07010661B2

公开(公告)日：2006-03-07

申请号：US10075514

申请日：2002-02-13

申请人： Ibrahim Kamel ,  Khaled Elbassioni ,  Beizhong Chen

发明人： Ibrahim Kamel ,  Khaled Elbassioni ,  Beizhong Chen

IPC分类号： G06F12/00

CPC分类号： H04L12/2814 ,  H04L12/2803

摘要： 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.

公开(公告)号：US6023720A

公开(公告)日：2000-02-08

申请号：US20883

申请日：1998-02-09

申请人： Walid G. Aref ,  Ibrahim Kamel ,  Thirumale N. Niranjan ,  Shahram Ghandeharizadeh

发明人： Walid G. Aref ,  Ibrahim Kamel ,  Thirumale N. Niranjan ,  Shahram Ghandeharizadeh

IPC分类号： H04N5/765 ,  G06F3/06 ,  G11B20/10 ,  G11B27/034 ,  H04N5/781 ,  H04N7/173 ,  H04N21/232 ,  H04N21/238 ,  H04N21/262 ,  H04N21/472 ,  G06F13/18

CPC分类号： H04N21/2326 ,  G11B27/034

摘要： 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. The new process treats both read and write requests in a homogenous manner in order to ensure that the deadlines are met and avoids indefinite postponement and large buffer sized in the case of storage device writes utilizing a single queue of requests.

摘要翻译： 磁盘调度系统支持在视频服务器环境中处理同时存储设备读写请求，从而支持视频点播和非线性编辑应用。 读取请求是电影观看的结果，而写入请求是视频剪辑编辑或电影创作过程的结果。 由于电影观看的实时需求，读取请求必须在一定的期限内完成，否则被认为是丢失的。 由于要写入存储设备的数据存储在主存储器缓冲器（或写入缓冲器）中，所以可以推迟写入请求，直到处理关键的读取请求为止。 但是，写入请求仍然需要在合理的延迟之内进行，并且不会无限期地推迟。 这是由于主存储器缓冲器的有限大小的物理约束。 新进程以同质的方式处理读取和写入请求，以确保满足最后期限并避免无限期延迟，并且在使用单个请求队列进行存储设备写入的情况下，缓冲区大。

公开(公告)号：US07802008B2

公开(公告)日：2010-09-21

申请号：US10217229

申请日：2002-08-12

申请人： Cuneyt Akinlar ,  Khaled Elbassioni ,  Ibrahim Kamel

发明人： Cuneyt Akinlar ,  Khaled Elbassioni ,  Ibrahim Kamel

IPC分类号： G06F15/16

CPC分类号： H04L47/2416 ,  H04L47/10 ,  H04L47/193 ,  H04L47/225 ,  H04L47/2433 ,  H04L47/2441 ,  H04L47/323 ,  H04L47/762 ,  H04L47/801

摘要： 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.

摘要翻译： 提供一种用于确保网络中的服务质量的装置。 具有流控制参数并发送第一流的第一流发送器。 接收第一流和第二流的网络互连。 第一流是非实时流，第二流是实时流。 带宽控制与网络互连相关联。 所述带宽控制调整所述流量控制参数以支持与所述第二流相关联的服务质量参数。