公开(公告)号：US06742019B1

公开(公告)日：2004-05-25

申请号：US09360324

申请日：1999-07-23

申请人： Asit Dan ,  Dinkar Sitaram ,  Junehwa Song

发明人： Asit Dan ,  Dinkar Sitaram ,  Junehwa Song

IPC分类号： G06F15167

CPC分类号： H04N7/17336 ,  G06F12/0866 ,  G06F12/0888 ,  H04L29/06027 ,  H04L65/4084 ,  H04L67/1002 ,  H04L67/1008 ,  H04L67/2842 ,  H04L69/329 ,  H04L2029/06054 ,  H04N21/23103 ,  H04N21/23106 ,  H04N21/2318

摘要： Under the present invention, a small cache is used for the selective buffering of devices of a heterogeneous striping group (i.e., striping group made of devices with unequal capacities) to match the load on each device to its capacity. The inventive caching algorithm utilizes a device map, or disk map, and applies a cache distribution factor for each device of a group to determined how to selectively buffer blocks read from different devices of a striping group; thereby placing different loads on the different devices of a striping group in accordance with their capacities.

摘要翻译： 在本发明中，使用小型缓存器来选择性地缓冲异构条带组（即，由具有不相等容量的设备组成的条带组）的装置，以将每个装置上的负载与其容量相匹配。 本发明的高速缓存算法利用设备图或磁盘映射，并对组中的每个设备应用高速缓存分配因子，以确定如何选择性地缓冲从条带组的不同设备读取的块; 从而根据其能力将不同的负载放置在条带组的不同装置上。

公开(公告)号：US08220017B1

公开(公告)日：2012-07-10

申请号：US09070831

申请日：1998-04-30

申请人： Asit Dan ,  Jai Prakash Menon ,  Junehwa Song

发明人： Asit Dan ,  Jai Prakash Menon ,  Junehwa Song

IPC分类号： H04N7/173 ,  H04N5/445 ,  G06F9/45 ,  G06F15/00 ,  G06F17/30

CPC分类号： G06F17/30017

摘要： A method of dynamically generating a presentation sequence from a plurality of authored presentation documents includes the steps of receiving the plurality of authored presentation documents from a plurality of data sources; applying the plurality of authored presentation documents to a set of presentation rules; and generating the presentation sequence in response to the applying step.

摘要翻译： 从多个创作的演示文稿动态地生成呈现序列的方法包括以下步骤：从多个数据源接收多个创作的演示文稿; 将所述多个创作的演示文档应用于一组呈现规则; 以及响应于所述应用步骤生成所述呈现序列。

公开(公告)号：US06317778B1

公开(公告)日：2001-11-13

申请号：US09197626

申请日：1998-11-23

申请人： Daniel Manuel Dias ,  Arun Kwangil Iyengar ,  Eric Michel Levy-Abegnoll ,  Junehwa Song

发明人： Daniel Manuel Dias ,  Arun Kwangil Iyengar ,  Eric Michel Levy-Abegnoll ,  Junehwa Song

IPC分类号： G06F1300

CPC分类号： H04L67/1095 ,  H04L67/1002 ,  H04L67/1014 ,  H04L67/28 ,  H04L67/2852 ,  H04L67/2895 ,  H04L69/329

摘要： Objects are cached in a system adapted to receive requests for said objects from one or more clients. The system has at least one of a plurality of nodes. Each node of the plurality of nodes includes at least one of a plurality of caches. One or more performance criteria of the system are selected. At least one of a plurality of metrics is assigned to a selected performance criterion. The desirability of storing an object of the objects in any one of the plurality of caches is calculated by assigning at least one of a plurality of desirability values to at least one of the objects based on the at least one of the plurality metrics. Any one of the objects stored in the at least one of the plurality of caches is replaced based on the at least one of the plurality of desirability values.

摘要翻译： 对象被缓存在适于从一个或多个客户端接收对所述对象的请求的系统中。 该系统具有多个节点中的至少一个。 多个节点中的每个节点包括多个高速缓存中的至少一个。 选择系统的一个或多个性能标准。 将多个度量中的至少一个分配给所选择的性能标准。 通过基于多个度量中的至少一个来将多个期望值中的至少一个分配给至少一个对象来计算存储多个高速缓存中的任何一个中的对象的对象的可取性。 基于多个期望值中的至少一个来替换存储在多个高速缓存中的至少一个高速缓存中的任何一个对象。

公开(公告)号：US06725265B1

公开(公告)日：2004-04-20

申请号：US09626327

申请日：2000-07-26

申请人： James R. H. Challenger ,  Paul M. Dantzig ,  Daniel M. Dias ,  Arun K. Iyengar ,  Junehwa Song

发明人： James R. H. Challenger ,  Paul M. Dantzig ,  Daniel M. Dias ,  Arun K. Iyengar ,  Junehwa Song

IPC分类号： G06F15173

CPC分类号： G06F17/30902

摘要： A method for providing customized information in a computer processing system includes the step of defining at least one rule for one of creating and retrieving at least one customized block of data. At least one customizable template is created which includes at least one reference to the at least one rule and at least one offset that specifies at least one position at which the at least one customized block is inserted into the at least one customizable template. The at least one customized block is inserted into the at least one customizable template at the at least one position specified by the at least one offset. The customized block, the customizable template, and/or the rule may be pre-stored in a cache of the computer processing system. The customized block may also be dynamically created.

摘要翻译： 用于在计算机处理系统中提供定制信息的方法包括为创建和检索至少一个定制的数据块之一定义至少一个规则的步骤。 创建至少一个可定制模板，其包括至少一个对所述至少一个规则的引用和至少一个偏移，所述至少一个偏移指定至少一个所述至少一个自定义块被插入到所述至少一个可定制模板中的位置。 在由至少一个偏移指定的至少一个位置处将至少一个定制块插入至少一个可定制模板中。 定制块，可定制模板和/或规则可以预先存储在计算机处理系统的高速缓存中。 也可以动态创建自定义块。

公开(公告)号：US5669006A

公开(公告)日：1997-09-16

申请号：US392717

申请日：1995-02-23

申请人： Leo Joskowicz ,  Michelle Yoonkyung Kim ,  Junehwa Song

发明人： Leo Joskowicz ,  Michelle Yoonkyung Kim ,  Junehwa Song

IPC分类号： G06F3/14 ,  G06F3/048 ,  G06T11/60 ,  G06T19/20 ,  G06F15/00

CPC分类号： G06T19/20 ,  G06T2219/2004

摘要： A computer implemented method reduces the complexities of obtaining a spatial design in a multimedia presentation. The method is an interactive process which assists an author in readily arriving at a suitable spatial design in the multimedia presentation. A set of objects that appear on the computer display screen simultaneously is termed a clique. The spatial design for a multimedia clique is defined in terms of three dimensions, two dimensions defining the plane of the computer display screen and the third dimension defining the depth of overlapping objects. The locations of the associated episodes and their respective depths on the screen are found. This process involves resolving space requirements between the several episodes in the clique according to a defined set of constraints. Assuming that a resolution can be reached which provides a consistent layout, the layout is displayed. The user is then given the opportunity to change the predefined set of constraints, resulting in the display of the layout with the changed set of constraints. If the layout is still not satisfactory, the user can change the sizes and locations of individual episodes in the clique. Based on the changed constraints for the episodes in the clique, the process again automatically determines a layout which is displayed for review and possible acceptance by the user. When the spatial design is finally accepted by the user, the process outputs the spatial design for the clique. Given a series of cliques which constitute an entire multimedia story, a technique of constraint propagation is provided. More particularly, an object in one clique may be displayed with other objects in a succeeding clique. Rather than moving that object around, the option is provided to fix the position of the object and let the other objects move around the fixed one.

摘要翻译： 计算机实现的方法降低了在多媒体呈现中获得空间设计的复杂性。 该方法是一种交互过程，其帮助作者在多媒体呈现中容易地达到合适的空间设计。 同时出现在计算机显示屏幕上的一组对象称为集团。 多媒体集团的空间设计是根据三维定义的，二维定义了计算机显示屏的平面，第三维定义了重叠对象的深度。 找到相关情节的位置及其各自的深度在屏幕上。 该过程涉及根据一组规定的约束来解决集团中的几集之间的空间需求。 假设可以达到提供一致布局的分辨率，则会显示布局。 然后，给予用户改变预定义的约束集合的机会，导致具有改变的约束集合的布局的显示。 如果布局仍然不令人满意，用户可以改变团体中个人情节的大小和位置。 基于组内剧集变化的限制，该过程再次自动确定显示供用户审阅和可能接受的布局。 当空间设计最终被用户接受时，该过程输出了集团的空间设计。 给出构成整个多媒体故事的一系列小组，提供了约束传播技术。 更具体地说，一个集团中的对象可以与其他对象一起显示在随后的集团中。 而不是移动该对象，提供了选项来修复对象的位置，并让其他对象围绕固定对象移动。

公开(公告)号：US5659790A

公开(公告)日：1997-08-19

申请号：US392701

申请日：1995-02-23

申请人： Michelle Yoonkyung Kim ,  Junehwa Song

发明人： Michelle Yoonkyung Kim ,  Junehwa Song

IPC分类号： G06F17/30 ,  G06F19/00 ,  H04N7/173 ,  G06F15/00

CPC分类号： H04N7/17336 ,  G06F17/30017

摘要： A multimedia system represents multimedia objects as ranges of time intervals, each bounded by a minimum and a maximum, and temporal relationships are given to a set of objects which are to be integrated. In this system, where there are uncertainties in time, a stretchable time-line is provided. The stretchable time-line is modeled after a spring system such that an object (or a spring) is associated not only with a minimum and a maximum length but also with a length at rest. As a spring rests at a certain length and stretches and shrinks by a certain degree when a force is applied, multimedia objects placed on the stretchable time-line may also rest at a certain length, and stretch or shrink if necessary. As a spring has a tendency to return to the length at rest, a multimedia object may stretch or shrink when necessary and by a smallest degree possible. The system according to the invention can answer a question like, "Can I show this multimedia presentation in ten minutes, and if so, how should all the objects be scheduled?" If there is a solution that satisfies all the constraints given, the solution consists of a set of time intervals which "minimally" deviate from the corresponding lengths at rest and also evenly distribute the variation of the difference between the optimum duration and the scheduled duration for each episode.

摘要翻译： 多媒体系统将多媒体对象表示为时间间隔的范围，每个时间间隔由最小和最大限定，并且时间关系被赋予要被集成的一组对象。 在这个系统中，如果时间上有不确定性，则提供可拉伸的时间线。 可拉伸的时间线在弹簧系统之后建模，使得物体（或弹簧）不仅与最小和最大长度相关联，而且与静止的长度相关联。 当弹簧以一定的长度放置时，当施加力时，它一定程度地伸展和收缩，放置在可拉伸时间线上的多媒体物体也可以以一定的长度放置，如果需要的话伸展或收缩。 由于弹簧具有恢复到静止的长度的倾向，所以多媒体对象可能在必要时可以伸缩或缩小，并且尽量小。 根据本发明的系统可以回答一个问题：“我可以在十分钟内显示这个多媒体呈现，如果是，应该如何安排所有的对象？” 如果存在满足所有给定约束的解的解，则该解由一组时间间隔组成，这些时间间隔在最低限度地偏离相应的静止长度，并且还将最佳持续时间和预定持续时间之间的差异的均匀分布 每集

公开(公告)号：US06490615B1

公开(公告)日：2002-12-03

申请号：US09196944

申请日：1998-11-20

申请人： Daniel Manuel Dias ,  Arun Kwangil Iyengar ,  Eric Michel Levy-Abegnoli ,  Junehwa Song

发明人： Daniel Manuel Dias ,  Arun Kwangil Iyengar ,  Eric Michel Levy-Abegnoli ,  Junehwa Song

IPC分类号： G06F1516

CPC分类号： H04L67/1008 ,  H04L67/1002 ,  H04L67/1012 ,  H04L67/1019 ,  H04L67/2819 ,  H04L67/2842 ,  H04L69/18

摘要： Requests for objects are received from one or more clients in a system comprised of a plurality of nodes. One of the requests is sent from one of the clients. The request is received from a first node of said plurality of nodes by a second node of said plurality of nodes. A requested object is returned from the second node of the plurality of nodes using one of a plurality of protocols. The method may be applied to a scalable and highly available cache array. The cache array may enhance the performance and throughput of Web servers connected to a network such as the Internet. A network dispatcher may send requests to a cache node of a cache array. The cache node selected by the network dispatcher may either serve the request, handoff the request to another cache node of a cache array, or communicate via one of a variety of protocols with another cache node of the cache array to cooperatively serve the request. A network dispatcher, operating in a special mode, may also function as a content based router. Thus, it is also possible for a network dispatcher to route requests using a combination of content-based and non-content-based routing in order to further improve system performance.

摘要翻译： 从由多个节点组成的系统中的一个或多个客户端接收对象的请求。 其中一个请求是从其中一个客户端发送的。 所述多个节点的第二节点从所述多个节点的第一节点接收所述请求。 使用多个协议之一从多个节点的第二节点返回所请求的对象。 该方法可以应用于可扩展且高度可用的高速缓存阵列。 缓存阵列可以增强连接到诸如因特网的网络的Web服务器的性能和吞吐量。 网络调度员可以将请求发送到高速缓存阵列的高速缓存节点。 由网络调度器选择的高速缓存节点可以服务该请求，将请求切换到高速缓存阵列的另一高速缓存节点，或者通过各种协议之一与高速缓存阵列的另一个高速缓存节点进行通信，以协作地提供该请求。 以特殊模式运行的网络调度器也可以用作基于内容的路由器。 因此，网络调度员也可以使用基于内容和非基于内容的路由的组合路由请求，以进一步提高系统性能。

公开(公告)号：US6115070A

公开(公告)日：2000-09-05

申请号：US873490

申请日：1997-06-12

申请人： Junehwa Song ,  Boon-Lock Yeo

发明人： Junehwa Song ,  Boon-Lock Yeo

IPC分类号： H04N7/30 ,  G06T9/00 ,  H04N7/26 ,  H04N7/32 ,  H04N7/36 ,  H04N7/12

CPC分类号： H04N19/90 ,  H04N19/48 ,  H04N19/51

摘要： Given compressed video which supports the coding of interlaced and noninterlaced frames through DCT and motion compensation, shared information is used in a macroblock for efficient conversion of inter-coded blocks to DCT intra-coded blocks. The shared information is also used to efficiently construct spatially reduced images without decompression.

摘要翻译： 给定通过DCT和运动补偿支持隔行和非隔行扫描帧的编码的压缩视频，在宏块中使用共享信息以有效地将帧间编码块转换为DCT帧内编码块。 共享信息还用于有效地构建空间缩小的图像而不进行解压缩。

公开(公告)号：US6108448A

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

申请号：US873669

申请日：1997-06-12

申请人： Junehwa Song ,  Boon-Lock Yeo

发明人： Junehwa Song ,  Boon-Lock Yeo

IPC分类号： H04N7/30 ,  G06T9/00 ,  H04N7/32 ,  G06K9/36 ,  G06K9/32 ,  H04N7/12

CPC分类号： G06T9/007

摘要： Given compressed video which supports the coding of interlaced frames through DCT and motion compensation, different construction methods are applied based on select DCT domain coefficients and/or motion vector informations to produce spatially reduced images without decompressing. The spatially reduced images can then be used for video browsing, authoring and processing purposes.

摘要翻译： 给定通过DCT和运动补偿支持隔行扫描帧的编码的压缩视频，基于选择的DCT域系数和/或运动矢量信息应用不同的构造方法以产生没有解压缩的空间缩小的图像。 然后可以将空间缩小的图像用于视频浏览，创作和处理目的。

公开(公告)号：US5717438A

公开(公告)日：1998-02-10

申请号：US519261

申请日：1995-08-25

申请人： Michelle Y. Kim ,  Junehwa Song ,  Daniel Tunkelang

发明人： Michelle Y. Kim ,  Junehwa Song ,  Daniel Tunkelang

IPC分类号： G06F9/44 ,  G06F17/21 ,  G06F17/00

CPC分类号： G06F17/211 ,  G11B27/034 ,  G11B27/34

摘要： A computer-implemented method of drawing a multimedia story including at least one episode is provided which represents a plurality of multimedia fries (e.g., text, sound, video, and picture files) graphically in a "time-box" which can be connected to other time boxes to for a time box diagram. A user can easily stretch or shrink, reposition, delete, or otherwise manipulate the fries graphically using the time boxes in order to produce a final multimedia story within given temporal (time) constraints. The method according to the invention includes steps of inputting to a processor story data having at least one episode, and, for each episode, generating first and second events and temporal constraints. Thereafter, from the temporal constraints, first coordinates of each of the first and second events for each of the episodes are determined, and the first and second events are assigned to layers based on a temporal position of the first and second events such that for each episode the first and second events are temporally connected. Thereafter, an order of events on each layer of the layers is permuted, and, from the order of the events on each layer and the temporal constraints, second coordinates of each of the first and second events for each of the episodes are determined. Finally, a layout of the story is generated.

摘要翻译： 提供了一种绘制包括至少一集的多媒体故事的计算机实现的方法，其在“时间框”中以图形方式表示多个多媒体油炸机（例如，文本，声音，视频和图像文件），其可以连接到 其他时间框为一个时间框图。 用户可以使用时间框图以图形方式轻松地拉伸或缩小，重新定位，删除或以其他方式操纵炸薯条，以便在给定的时间（时间）限制内产生最终的多媒体故事。 根据本发明的方法包括以下步骤：向处理器输入具有至少一个情节的故事数据，并且针对每个情节，产生第一和第二事件和时间约束。 此后，根据时间约束，确定每个剧集的第一和第二事件中的每一个的第一坐标，并且基于第一和第二事件的时间位置将第一和第二事件分配给层，使得对于每个 第一集和第二个事件是时间上的连接。 此后，层的每层上的事件顺序被排列，并且根据每个层上的事件的顺序和时间约束，确定每个剧集的第一和第二事件中的每一个的第二个坐标。 最后，生成故事的布局。