DISTRIBUTED TIME SYNCHRONIZATION SYSTEM AND METHOD
    141.
    发明申请
    DISTRIBUTED TIME SYNCHRONIZATION SYSTEM AND METHOD 审中-公开
    分布式时间同步系统和方法

    公开(公告)号:WO1995002294A1

    公开(公告)日:1995-01-19

    申请号:PCT/US1994007545

    申请日:1994-07-06

    Abstract: A distributed time synchronization system and method synchronizes nodes within a frequency hopping spread spectrum (FHSS) local area network (LAN) group to a virtual master clock value. Each node system of the present invention comprises a CPU, an input device, a display device, a printer or hard copy device, a given amount of RAM and ROM memory, a data storage device, a local clock, a transmitter/receiver, an antenna, a virtual master clock processor, and a common data bus. The method of the present invention comprises the inclusion of a node's local clock value in a message just prior to transmission over the network, storage of a node's local clock value in RAM after an incoming message has been received, and the calculation of the time delay between the sending node and the receiving node by the virtual master clock processor. The virtual master clock processor utilizes this time delay in maintaining a virtual master clock value, which it uses in adjusting the value of the node's local clock at periodic intervals. This synchronizes the receiving node to the virtual master clock value. If the magnitude of the time delay exceeds a maximum allowed value, the magnitude is clamped to the maximum allowed value, thereby maintaining synchronization withing a predetermined tolerance. A node can receive a message transmitted over the FHSS LAN regardless of the message address. Synchronization is therefore maintained without requiring a node to be able to communicate with any specific node within the FHSS LAN group.

    Abstract translation: 分布式时间同步系统和方法将跳频扩频(FHSS)局域网(LAN)组内的节点同步到虚拟主时钟值。 本发明的每个节点系统包括CPU,输入设备,显示设备,打印机或硬拷贝设备,给定量的RAM和ROM存储器,数据存储设备,本地时钟,发送器/接收器, 天线,虚拟主时钟处理器和公共数据总线。 本发明的方法包括:在通过网络发送之前,将消息中的节点本地时钟值包含在消息中,在接收到传入消息之后,将节点本地时钟值存储在RAM中,并计算延迟时间 在虚拟主时钟处理器之间在发送节点和接收节点之间。 虚拟主时钟处理器利用该时间延迟来维持虚拟主时钟值,其用于以周期性间隔调整节点本地时钟的值。 这将接收节点同步到虚拟主时钟值。 如果时间延迟的大小超过最大允许值,则将幅值钳位到最大允许值,从而保持与预定公差的同步。 无论消息地址如何,节点都可以接收通过FHSS LAN发送的消息。 因此,不需要节点能够与FHSS LAN组内的任何特定节点进行通信,从而维护同步。

    SYSTEM FOR OBJECT ORIENTED DYNAMIC LINKING BASED UPON A CATALOG OF REGISTERED FUNCTION SET OR CLASS IDENTIFIERS
    142.
    发明申请
    SYSTEM FOR OBJECT ORIENTED DYNAMIC LINKING BASED UPON A CATALOG OF REGISTERED FUNCTION SET OR CLASS IDENTIFIERS 审中-公开
    基于注册功能集或类别标识符的目标的面向对象的动态链接系统

    公开(公告)号:WO1995001598A1

    公开(公告)日:1995-01-12

    申请号:PCT/US1994007424

    申请日:1994-06-30

    CPC classification number: G06F9/44521 G06F9/44536 G06F9/4488

    Abstract: A system is provided for managing code resources for use by client applications in a computer, wherein the computer has internal memory storing at least one client application. The apparatus comprises a resource set catalog stored in the internal memory. The resource set catalog identifies a plurality of function sets of functions by respective function set IDs. Further, the resource set catalog includes set records which characterize the functions within the respective sets. A dispatch engine, in the internal memory, linked with a client application, supplies a particular function set ID in response to a call by the client application of a particular function which is a member of a corresponding function set identified by the particular function set ID. A lookup engine in the internal memory, coupled with the resource set catalog and the dispatch engine, is responsive to the particular function set ID to look up a set record for a corresponding function set in the resource set catalog. Finally, a link engine in the internal memory and coupled with the dispatch engine returns the particular function to the client application in response to the set record. Thus, because the link engine is responsive to the set record, which is not linked with the client, the client need not be aware of changes in the structure of the library in which the particular function set resides. Thus, the function set can be moved into and out of internal memory, revised, placed in different sections of internal memory, and otherwise handled independently of the client, without requiring re-compilation of the client application.

    Abstract translation: 提供了一种用于管理代码资源以供计算机中的客户端应用使用的系统,其中所述计算机具有存储至少一个客户端应用的内部存储器。 该装置包括存储在内部存储器中的资源集目录。 资源集目录通过各个功能集ID识别多个功能函数集。 此外,资源集目录包括表征各个集合内的功能的集合记录。 与内部存储器中的与客户端应用程序链接的调度引擎响应于客户端应用程序对由特定功能集ID标识的对应功能集的成员的特定功能的调用提供特定功能集ID 。 内部存储器中的查找引擎与资源集目录和调度引擎相结合,响应于特定的功能集ID来查找资源集目录中对应的功能集的集合记录。 最后,内部存储器中的链接引擎与调度引擎相结合,响应于设置的记录将特定功能返回到客户端应用程序。 因此,因为链接引擎响应于不与客户端链接的设置记录,所以客户机不需要知道特定功能集所在的库的结构中的改变。 因此,功能集可以移入和移出内部存储器,修改,放置在内部存储器的不同部分中,否则独立于客户机处理,而不需要重新编译客户端应用程序。

    COMPUTER SYSTEM WITH GRAPHICAL USER INTERFACE INCLUDING DRAWER-LIKE WINDOWS
    143.
    发明申请
    COMPUTER SYSTEM WITH GRAPHICAL USER INTERFACE INCLUDING DRAWER-LIKE WINDOWS 审中-公开
    具有图形用户界面的计算机系统,包括抽屉式窗口

    公开(公告)号:WO1994029793A1

    公开(公告)日:1994-12-22

    申请号:PCT/US1994006217

    申请日:1994-06-03

    CPC classification number: G06F3/0483 G06F3/0481 G09G5/14

    Abstract: A window management mechanism allows a user to open a window as a drawer or, perhaps more appropriately named, a pop-up window. The drawer is an opened window that a user has dragged down to a drawer region at the bottom of the screen such that only the title bar or some drawer handle illustration is left showing. When the user does this, the window remains open but is kept offscreen. The user may momentarily pop the window back onto the screen by clicking on the window title bar or drawer handle, or by dragging the cursor into the window icon during a drag. The window stays onscreen as long as no other windows are selected. As soon as a user selects another window, or opens a file with a double click within the drawer, the window slides back offscreen. This allows the user to set up easy access windows. Another feature of a drawer window allows the user to open them during a drag. To do so, the user drags an object or the cursor into the drawer window that is desired to be opened. When the cursor touches the bottom of the screen, or an area within a threshold of the bottom of the screen, the drawer window slides open a notch at a time. As long as the user pushes against the bottom or remains in this threshold region, the drawer slides open.

    Abstract translation: 窗口管理机制允许用户打开一个窗口作为抽屉,或者更合适地命名一个弹出窗口。 抽屉是一个打开的窗口,用户已经拖动到屏幕底部的抽屉区域,这样只剩下标题栏或一些抽屉的手柄图示。 当用户执行此操作时,窗口保持打开状态,但保持在屏幕外。 用户可以通过点击窗口标题栏或抽屉手柄,或者在拖动时将光标拖动到窗口图标中,将窗口暂时弹出到屏幕上。 只要没有选择其他窗口,窗口保持在屏幕上。 一旦用户选择另一个窗口,或者在抽屉中双击打开一个文件,窗口将在屏幕外滑回。 这允许用户设置方便的访问窗口。 抽屉窗口的另一个功能允许用户在拖动期间打开它们。 为此,用户将对象或光标拖动到需要打开的抽屉窗口中。 当光标触摸屏幕底部或屏幕底部阈值范围内时,抽屉窗口一次滑开一个凹口。 只要用户按压底部或保持在该阈值区域,抽屉滑动打开。

    METHOD AND APPARATUS FOR PATCHING CODE RESIDING ON A READ ONLY MOEMORY DEVICE
    145.
    发明申请
    METHOD AND APPARATUS FOR PATCHING CODE RESIDING ON A READ ONLY MOEMORY DEVICE 审中-公开
    用于在只读读取设备上分配代码的方法和装置

    公开(公告)号:WO1994027219A1

    公开(公告)日:1994-11-24

    申请号:PCT/US1994004995

    申请日:1994-05-06

    CPC classification number: G06F9/44521 G06F8/66 G06F9/4486 G06F17/30188

    Abstract: A method and apparatus for generating patching resources in an information processing system having operating instructions on a Read Only Memory Device. The present invention simplifies the patch generation and installation processes. A patch resource is generated and used by a patch installation process. Patch resources are generated for each ROM version by comparing previous ROM versions to the new ROM version. A patch resource is comprised of a plurality of entries, each of which defines a vector table address, an offset into the vector table and the routine to be inserted. By comparing routines between the ROM versions, routines which are different or new are identified. These routines will become patch resource entries. For patch installation, the ROM version number for the installed ROM is determined; the proper patching resource is retrieved, and the patch resource entries cause the patches to be installed. Patch installation is performed by the steps of modifying vector tables to include the addresses for the new routines.

    Abstract translation: 一种用于在具有只读存储器件的操作指令的信息处理系统中生成修补资源的方法和装置。 本发明简化了补丁生成和安装过程。 修补程序资源由修补程序安装过程生成并使用。 通过将先前的ROM版本与新的ROM版本进行比较,为每个ROM版本生成补丁资源。 补丁资源由多个条目组成,每个条目定义向量表地址,向量表中的偏移量和待插入的例程。 通过比较ROM版本之间的例程,识别不同或新的例程。 这些例程将成为补丁资源条目。 对于补丁安装,确定安装的ROM的ROM版本号; 检索适当的修补资源,补丁资源条目导致修补程序被安装。 通过修改向量表以包括新例程的地址的步骤执行补丁安装。

    METHOD FOR DECODING SEQUENCES OF GUEST INSTRUCTIONS FOR A HOST COMPUTER
    146.
    发明申请
    METHOD FOR DECODING SEQUENCES OF GUEST INSTRUCTIONS FOR A HOST COMPUTER 审中-公开
    用于解码主机计算机用户指令序列的方法

    公开(公告)号:WO1994027214A1

    公开(公告)日:1994-11-24

    申请号:PCT/US1994003862

    申请日:1994-04-08

    CPC classification number: G06F9/45508

    Abstract: Emulator performance can be improved by recognizing repeated sequences of the same instruction, or commonly groups of instructions. For example, it is very common to see a three instruction sequence of MOVEM, UNLK A6, and RTS instructions for a 68020 processor in procedure exit code. By looking for these sequences, and combining the operations performed by the separate sequences, overhead of decoding and dispatching the individual instructions in the sequence can be eliminated, and performance improved. Common instruction sequences or repeated sequences in a guest program are detected during emulation of the guest program on a host processor, and performance of the emulation optimized based on the detected sequences. Thus, the emulation logic comprising host instructions embedded within a particular emulation program for a particular guest instruction, detects a particular sequence of guest instructions and in response to detection of the particular sequence bypasses the dispatch logic for guest instructions within the particular sequence. The sequences detected can comprise repeated guest instructions, or common sequences of two or more than two guest instructions.

    Abstract translation: 通过识别相同指令的重复序列或通常的指令组,可以提高仿真器的性能。 例如,在程序退出代码中看到一个68020处理器的MOVEM,UNLK A6和RTS指令的三个指令序列是非常常见的。 通过查找这些序列,并且组合由单独序列执行的操作,可以消除解码和分派序列中的各个指令的开销,并且性能得到改善。 在宿主处理器中的访客程序仿真期间检测访客程序中的公共指令序列或重复序列,以及基于检测到的序列优化仿真的性能。 因此,包括嵌入特定访客指令的特定仿真程序内的主机指令的仿真逻辑检测访客指令的特定序列,并响应于特定序列的检测绕过特定序列内的访客指令的调度逻辑。 检测到的序列可以包括重复的客户指令或两个或多于两个客户指令的公共序列。

    METHOD AND APPARATUS FOR IMPLEMENTING A COMMON MODE LEVEL SHIFT IN A BUS TRANSCEIVER INCORPORATING A HIGH SPEED BINARY DATA TRANSFER MODE WITH A TERNARY CONTROL TRANSFER MODE
    147.
    发明申请
    METHOD AND APPARATUS FOR IMPLEMENTING A COMMON MODE LEVEL SHIFT IN A BUS TRANSCEIVER INCORPORATING A HIGH SPEED BINARY DATA TRANSFER MODE WITH A TERNARY CONTROL TRANSFER MODE 审中-公开
    用于实现具有三次控制传输模式的高速二进制数据传输模式的总线收发器中的公共模式电平转换的方法和装置

    公开(公告)号:WO1994022092A2

    公开(公告)日:1994-09-29

    申请号:PCT/US1994002621

    申请日:1994-03-11

    CPC classification number: H04L25/028 H04L5/16 H04L25/0276 H04L25/0292

    Abstract: The present invention provides a bus transceiver incorporating a high speed, binary transfer mode for the half-duplex transfer of data signals with a ternary control transfer mode having a full duplex dominant logic transmission scheme for the full duplex transfer of control signals. In one embodiment of the present invention, the above-noted transfer modes are implemented in a bus architecture which includes at least a first communications node coupled to a second communications node via a twisted pair, serial bus. Each node comprises first transceiver and second transceivers having a differential driver for driving on the bus signal states comprising first and second signal states having equal current amplitudes opposite in sign and a third signal state having approximately a zero current amplitude, a high speed binary receiver for receiving high speed data signals during data transfer phases and a ternary receiver for receiving control signals during control transfer phases. To permit the receivers of the present invention to receive the transmitted signals at the amplitude required to detect the proper bus voltage values, the present invention further provides a means for common mode shifting of the signals at the front end of the receivers while providing for a voltage offset independent of the fabrication process. This common mode shifting means also permits the implementation of a single ternary receiver in place of each of the binary, ternary and preemptive signaling receivers for each transceiver. In this manner, the present invention can be modified so that both transfer modes in addition to the preemptive signaling method can be performed using a single ternary receiver.

    Abstract translation: 本发明提供了一种总线收发器,其包括用于数据信号的半双工传输的具有用于控制信号的全双工传输的全双工主导逻辑传输方案的三进制控制传输模式的高速二进制传输模式。 在本发明的一个实施例中,上述传送模式在总线架构中实现,总线架构包括经由双绞线串行总线耦合到第二通信节点的至少第一通信节点。 每个节点包括第一收发器和第二收发器,其具有用于在总线信号状态上驱动的差分驱动器,该信号状态包括具有与符号相反的相等的电流幅度的第一和第二信号状态以及具有大约零电流幅度的第三信号状态, 在数据传输阶段期间接收高速数据信号,以及在控制传输阶段期间接收控制信号的三元接收机。 为了允许本发明的接收机以检测合适的总线电压值所需的振幅接收发送的信号,本发明还提供了一种用于在接收机前端对信号进行共模移位的装置,同时提供一个 电压偏移与制造工艺无关。 这种共模移动装置还允许实现单个三进制接收机来代替每个收发信机的二进制,三进制和抢先信令接收机中的每一个。 以这种方式,可以修改本发明,使得可以使用单个三进制接收机来执行除抢先信令方法之外的两种传送模式。

    APPARATUS AND METHOD FOR A RELOCATABLE FILE FORMAT
    148.
    发明申请
    APPARATUS AND METHOD FOR A RELOCATABLE FILE FORMAT 审中-公开
    用于可靠文件格式的装置和方法

    公开(公告)号:WO1994022078A2

    公开(公告)日:1994-09-29

    申请号:PCT/US1994002952

    申请日:1994-03-17

    CPC classification number: G06F8/54

    Abstract: Relocation table entries in an executable object code file are interpreted as relocation instructions rather than as individual specifications for a particular respective relocatable information item. An abstract machine is provided for interpreting the relocation instructions and performing various relocation operations and various control functions for the abstract machine, in response to the relocation instructions. The abstract machine maintains certain variables containing information which is referenced and updated in response to certain types of the relocation instructions, thereby obviating the need to include such information as part of each relocation instruction. Certain of the relocation instruction types can also specify a particular relocation operation to be performed on a run of n consecutive reloactable information items, where n is specified as part of the relocation instruction. Certain of these relocation instruction types also consider each information item as including two or more individual relocations of the same or different types to perform, thus effectively specifying a run of n repetitions of a pattern of relocations. Other types of relocation instructions are also made available. The file also contains a hashed symbol export table and pattern-initialized data expansion instructions.

    Abstract translation: 可执行对象代码文件中的重定位表条目被解释为重定位指令,而不是作为特定相应可重定位信息项的单独规范。 响应于重定位指令,提供抽象机器用于解释重定位指令并执行抽象机器的各种重定位操作和各种控制功能。 抽象机器维护包含响应于某些类型的重新定位指令而被引用和更新的信息的某些变量,从而避免包括作为每个重定位指令的一部分的这样的信息的需要。 某些重新定位指令类型还可以指定在n个连续可重复信息项的运行上执行的特定重定位操作,其中n被指定为重定位指令的一部分。 这些重定位指令类型中的某些也将每个信息项目视为包括要执行的相同或不同类型的两个或多个单独的重定位,从而有效地指定重定位模式的n次重复的运行。 还提供其他类型的搬迁说明。 该文件还包含散列符号导出表和模式初始化的数据扩展指令。

    WAVEFORM BLENDING TECHNIQUE FOR TEXT-TO-SPEECH SYSTEM
    149.
    发明申请
    WAVEFORM BLENDING TECHNIQUE FOR TEXT-TO-SPEECH SYSTEM 审中-公开
    用于文字到语音系统的波形混合技术

    公开(公告)号:WO1994017517A1

    公开(公告)日:1994-08-04

    申请号:PCT/US1994000770

    申请日:1994-01-18

    CPC classification number: G10L13/07

    Abstract: A concatenator for a first digital frame with a second digital frame, such as the ending and beginning of adjacent diphone strings being concatenated to form speech is based on determining an optimun blend point for the first and second digital frames in response to the magnitudes of samples in the first and second digital frames. The frames are then blended to generate a digital sequence representing a concatenation of the first and second frames with reference to the optimum blend point. The system operates by first computing an extended frame in response to the first digital frame, and then finding a subset of the extended frame with matches the second digital frame using a minimum average magnitude difference function over the samples in the subset. The blend point is the first sample of the matching subset. To generate the concatenated waveform, the subset of the extended frame is combined with the second digital frame and concatenated with the beginning segments of the extended frame to produce the concatenate waveform.

    Abstract translation: 用于具有第二数字帧的第一数字帧的级联器,诸如被级联以形成语音的相邻双声道串的结束和开始是基于响应于样本的幅度确定第一和第二数字帧的最佳混合点 在第一和第二数字帧中。 然后混合帧以参考最佳混合点产生表示第一和第二帧的级联的数字序列。 该系统通过首先响应于第一数字帧计算扩展帧,然后使用该子集中的样本上的最小平均幅度差函数,与第二数字帧匹配来找到扩展帧的子集。 混合点是匹配子集的第一个样本。 为了产生级联波形,扩展帧的子集与第二数字帧组合,并与扩展帧的起始段连接以产生级联波形。

    IMPROVED VECTOR QUANTIZATION
    150.
    发明申请
    IMPROVED VECTOR QUANTIZATION 审中-公开
    改进的矢量量化

    公开(公告)号:WO1994006099A1

    公开(公告)日:1994-03-17

    申请号:PCT/US1993008235

    申请日:1993-08-31

    Abstract: Improved method and apparatus for vector quantization (VQ) to build a codebook for the compression of data. The codebook (600) or "tree" is initialized by establishing N initial nodes (610) and creating the remainder of the codebook as a binary codebook (650). Children entries (670) are split upon determination of various attributes, such as maximum distortion, population, etc. Vectors obtained from the data are associated with the children nodes, and then representative children entries are recalculated. This splitting/reassociation continues iteratively until a difference in error associated with the previous children and current children becomes less than a threshold. This splitting and reassociating process continues until the maximum number of terminal nodes is created in the tree, a total error or distortion threshold has been reached or some other criterion. The data may then be transmitted as a compressed bitstream comprising a codebook and indices referencing the codebook.

    Abstract translation: 用于矢量量化(VQ)的改进的方法和装置来构建用于压缩数据的码本。 通过建立N个初始节点(610)并且将码本的剩余部分创建为二进制码本(650)来初始化码本(600)或“树”。 儿童条目(670)在确定各种属性(例如最大失真,人口等)时被拆分。从数据获得的向量与子节点相关联,然后重新计算代表性的子条目。 这种分裂/重新关联继续迭代,直到与先前的孩子和当前孩子相关联的错误差异变得小于阈值。 该分解和重新关联过程继续,直到在树中创建最大数量的终端节点,已经达到总误差或失真阈值或一些其他准则。 然后可以将数据作为包括码本的压缩比特流和引用码本的索引来发送。

Patent Agency Ranking