公开(公告)号：US07454786B2

公开(公告)日：2008-11-18

申请号：US10401334

申请日：2003-03-27

Applicant: David Yu Chang ,  Ching-Yun Chao

Inventor： David Yu Chang ,  Ching-Yun Chao

IPC: G06F21/00 ,  G06F15/173 ,  H04L9/00

CPC classification number: H04L63/102 ,  G06F21/6236

Abstract: A method for integrated security roles is presented. An upstream application includes one or more role-mapping requirements that correspond to an upstream security role and a downstream security role. The upstream security role is expanded by adding an upstream security role identifier in a downstream application's role-mapping table or by adding upstream user-to-role mappings to a downstream application's role-mapping table. When an upstream security role is expanded, a user assigned to the upstream security role automatically has access to role-mapped downstream applications.

Abstract translation: 提出了一种集成安全角色的方法。 上游应用程序包括一个或多个对应于上游安全角色和下游安全角色的角色映射要求。 通过在下游应用程序的角色映射表中添加上游安全角色标识符，或通过向下游应用程序的角色映射表添加上游用户到角色映射来扩展上游安全角色。 当扩展上游安全角色时，分配给上游安全角色的用户可以自动访问角色映射的下游应用程序。

公开(公告)号：US07421453B2

公开(公告)日：2008-09-02

申请号：US11204415

申请日：2005-08-16

Applicant: Maximino Aguilar, Jr. ,  Michael Norman Day ,  Mark Richard Nutter

Inventor： Maximino Aguilar, Jr. ,  Michael Norman Day ,  Mark Richard Nutter

IPC: G06F17/00

CPC classification number: G06F17/30961 ,  Y10S707/99933 ,  Y10S707/99944 ,  Y10S707/99945

Abstract: Asynchronously traversing a disjoint linked data structure is presented. A synergistic processing unit (SPU) includes a handler that works in conjunction with a memory flow controller (MFC) to traverse a disjoint linked data structure. The handler compares a search value with a node value, and provides the MFC with an effective address of the next node to traverse based upon the comparison. In turn, the MFC retrieves the corresponding node data from system memory and stores the node data in the SPU's local storage area. The MFC stalls processing and sends an asynchronous event interrupt to the SPU which, as a result, instructs the handler to retrieve and compare the latest node data in the local storage area with the search value. The traversal continues until the handler matches the search value with a node value or until the handler determines a failed search.

Abstract translation: 呈现异步遍历不相交的数据结构。 协同处理单元（SPU）包括与存储器流控制器（MFC）一起工作的处理程序，以遍历不相交的数据结构。 处理程序将搜索值与节点值进行比较，并根据比较为MFC提供下一个节点的有效地址进行遍历。 反过来，MFC从系统存储器检索相应的节点数据，并将节点数据存储在SPU的本地存储区域中。 MFC停止处理并向SPU发送异步事件中断，结果指示处理程序检索和比较本地存储区域中的最新节点数据与搜索值。 遍历继续，直到处理程序与搜索值与节点值匹配，或者直到处理程序确定失败的搜索。

公开(公告)号：US07392482B2

公开(公告)日：2008-06-24

申请号：US10739665

申请日：2003-12-18

Applicant: Joseph E. Firebaugh ,  Robert C. Leah

Inventor： Joseph E. Firebaugh ,  Robert C. Leah

IPC: G06F15/177 ,  G06F15/173

CPC classification number: H04L41/22 ,  H04L41/12

Abstract: A selection accelerator in topology views is presented. A user uses a topology view to manage a computer network whereby the topology view includes a plurality of nodes and their relationships that correspond to computer network components. When a user selects a primary node, processing identifies related nodes, and displays a relationship identifier next the related nodes, such as a hierarchal level corresponding to the primary node. By viewing the relationship identifiers, the user is able to depress a key to select a plurality of related nodes based upon their relationships. In addition, the user is able to request an invert select which informs processing to select nodes related to the primary node which are not currently selected.

Abstract translation: 介绍拓扑视图中的选择加速器。 用户使用拓扑视图来管理计算机网络，由此拓扑视图包括多个节点及其与计算机网络组件对应的关系。 当用户选择主节点时，处理识别相关节点，并在相关节点之后显示关系标识符，例如与主节点对应的层级。 通过查看关系标识符，用户能够基于它们的关系按下键来选择多个相关节点。 此外，用户能够请求反转选择，其通知处理以选择与当前未选择的主节点相关的节点。

公开(公告)号：US07391763B2

公开(公告)日：2008-06-24

申请号：US10279691

申请日：2002-10-23

Applicant: Michael Wayne Brown ,  Joseph Herbert McIntyre ,  Victor S. Moore ,  Michael A. Paolini ,  Scott Lee Winters

Inventor： Michael Wayne Brown ,  Joseph Herbert McIntyre ,  Victor S. Moore ,  Michael A. Paolini ,  Scott Lee Winters

IPC: H04L12/66

CPC classification number: H04L12/1831 ,  H04L51/00 ,  H04M3/42221 ,  H04M3/56 ,  H04M3/563 ,  H04M7/0054 ,  H04M7/1235 ,  H04M7/126 ,  H04M7/128 ,  H04M2201/40

Abstract: A proxy service provides telephone conferencing services and personal telephony services. Users can participate in the conference by connecting through different types of networks using a device having one or more types of communication lines connected to the proxy service. A primary user can request the proxy to call each one of the users and establish the conference. The primary user may accomplish this through a data line using data requests or though a voice line using voice requests. Typically, the primary user provides a telephone number for each user. The primary user can also provide with specific times of when calls should be placed, identification information for each user, the type of conference, and other conference parameters.

Abstract translation: 代理服务提供电话会议服务和个人电话服务。 用户可以通过使用具有连接到代理服务的一种或多种通信线路的设备连接不同类型的网络来参与会议。 主用户可以请求代理呼叫每个用户并建立会议。 主要用户可以通过使用数据请求的数据线或通过使用语音请求的语音线来完成此操作。 通常，主用户为每个用户提供电话号码。 主用户还可以提供何时应该拨打呼叫的时间，每个用户的身份信息，会议的类型和其他会议参数。

公开(公告)号：US07380247B2

公开(公告)日：2008-05-27

申请号：US10626192

申请日：2003-07-24

Applicant: Jos Manuel Accapadi ,  Andrew Dunshea ,  Dirk Michel ,  James W. Van Fleet

Inventor： Jos Manuel Accapadi ,  Andrew Dunshea ,  Dirk Michel ,  James W. Van Fleet

IPC: G06F13/18 ,  G06F13/00

CPC classification number: G06F9/52 ,  G06F9/4818

Abstract: A system and method is provided for delaying a priority boost of an execution thread. When a thread prepares to enter a critical section of code, such as when the thread utilizes a shared system resource, a user mode accessible data area is updated indicating that the thread is in a critical section and, if the kernel receives a preemption event, the priority boost that the thread should receive. If the kernel receives a preemption event before the thread finishes the critical section, the kernel applies the priority boost on behalf of the thread. Often, the thread will finish the critical section without having to have its priority actually boosted. If the thread does receive an actual priority boost then, after the critical section is finished, the kernel resets the thread's priority to a normal level.

Abstract translation: 提供了一种用于延迟执行线程的优先级提升的系统和方法。 当线程准备进入代码的关键部分时，例如当线程利用共享系统资源时，更新用户模式可访问数据区域，指示线程处于关键部分，并且如果内核接收到抢占事件， 线程应该接收的优先级提升。 如果内核在线程完成关键部分之前收到抢占事件，则内核将代表线程应用优先级提升。 通常，线程将完成关键部分，而无需实际提升优先级。 如果线程确实接收到实际的优先级提升，那么在关键部分完成之后，内核会将线程的优先级重置为正常级别。

公开(公告)号：US07376623B2

公开(公告)日：2008-05-20

申请号：US10318654

申请日：2002-12-12

Applicant: Rabindranath Dutta ,  John C. Hartley ,  Richard Scott Schwerdtfeger

Inventor： Rabindranath Dutta ,  John C. Hartley ,  Richard Scott Schwerdtfeger

IPC: G06Q99/00

CPC classification number: G06Q20/1235 ,  G06F21/10 ,  G06F2221/2117 ,  G06F2221/2135 ,  G06F2221/2153 ,  G06Q20/12 ,  G06Q20/123 ,  G06Q30/06 ,  G06Q50/184 ,  G06Q99/00 ,  G07F17/0014 ,  G09B21/006 ,  G09B21/008

Abstract: A system and method for accessibility content copyright permission is presented. A copyright server receives a copyright request from a requestor, such as a portal server. The copyright request corresponds to a user requesting a particular content to be transcoded. The copyright server identifies content copyright permissions associated with the requested content that indicate whether it is permissible to transcode the requested content. If the copyright server does not locate content copyright permissions associated with the requested content, the copyright server identifies the owner of the content and sends a message to the content owner requesting content copyright permission. The copyright server receives a response from the content owner, stores the response on a local storage area, and forwards the response to the requestor. The content copyright permissions may include an amount of a transcoding fee that the content owner requires in order to transcode the requested content.

Abstract translation: 介绍了无障碍内容版权许可的系统和方法。 版权服务器从请求者（例如门户网站服务器）接收版权请求。 版权请求对应于请求特定内容被转码的用户。 版权服务器识别与所请求的内容相关联的内容版权许可，其指示是否允许对所请求的内容进行转码。 如果版权服务器没有找到与所请求的内容相关联的版权权限的内容，则版权服务器识别内容的所有者，并向请求内容版权许可的内容所有者发送消息。 版权服务器接收内容所有者的响应，将响应存储在本地存储区域，并将响应转发给请求者。 内容版权权限可以包括内容所有者为了对所请求的内容进行转码而需要的代码转换费用的量。

公开(公告)号：US07367026B2

公开(公告)日：2008-04-29

申请号：US10919115

申请日：2004-08-16

Applicant: Alexandre E. Eichenberger ,  Kai-Ting Amy Wang ,  Peng Wu

Inventor： Alexandre E. Eichenberger ,  Kai-Ting Amy Wang ,  Peng Wu

IPC: G06F9/45 ,  G06F15/00 ,  G06F7/52

CPC classification number: G06F8/4452 ,  G06F8/445

Abstract: A method, computer program product, and information handling system for generating loop code to execute on Single-Instruction Multiple-Datapath (SIMD) architectures, where the loop contains multiple non-stride-one memory accesses that operate over a contiguous stream of memory is disclosed. A preferred embodiment identifies groups of isomorphic statements within a loop body where the isomorphic statements operate over a contiguous stream of memory over the iteration of the loop. Those identified statements are then converted into virtual-length vector operations. Next, the hardware's available vector length is used to determine a number of virtual-length vectors to aggregate into a single vector operation for each iteration of the loop. Finally, the aggregated, vectorized loop code is converted into SIMD operations.

Abstract translation: 一种用于生成在单指令多数据路径（SIMD）架构上执行的循环码的方法，计算机程序产品和信息处理系统，其中循环包含在连续的存储器流上操作的多个非步进存储器访问 披露 优选实施例识别在循环体内同构语句的组，其中同构语句在循环的迭代上在连续的存储器流上操作。 然后将那些识别的语句转换为虚拟长度向量操作。 接下来，使用硬件的可用向量长度来确定多个虚拟长度向量以聚合到单个向量操作中，用于循环的每次迭代。 最后，聚合的向量化循环码被转换成SIMD操作。

公开(公告)号：US07362330B2

公开(公告)日：2008-04-22

申请号：US11226964

申请日：2005-09-15

Applicant: Gordon Clyde Fossum ,  Barry L Minor

Inventor： Gordon Clyde Fossum ,  Barry L Minor

IPC: G06T15/50

CPC classification number: G06T15/20

Abstract: A processor uses start point fractional values during view screen segment computations that start a view screen segment's computations a particular distance away from a down point. This prevents an excessive sampling density during image generation without wasting processor resources. The processor identifies a start point fractional value for each view screen segment based upon each view screen segment's identifier, and computes a view screen segment start point for each view screen segment using the start point fractional value. View screen segment start points are “tiered” and are a particular distance away from the down point. This stops the view screen segments from converging to a point of severe over sampling while, at the same time, providing a pseudo-uniform sampling density.

Abstract translation: 处理器在视图屏幕段计算期间使用起始点分数值，该计算开始视图屏幕段的计算距离下降点的特定距离。 这防止了图像生成过程中的过度采样密度，而不会浪费处理器资源。 处理器基于每个视图屏幕段的标识符来识别每个视图屏幕段的开始点分数值，并且使用起始点分数值来计算每个视图屏幕段的视图屏幕段开始点。 查看屏幕段开始点是“分层”的，距离下降点是特定的距离。 这样就可以阻止观看屏幕段收敛到严重过采样点，同时提供一个伪均匀的采样密度。

公开(公告)号：US07334060B2

公开(公告)日：2008-02-19

申请号：US10805151

申请日：2004-03-19

Applicant: Anthony Joseph Bybell

Inventor： Anthony Joseph Bybell

IPC: G06F3/00 ,  G06F13/00 ,  G01V1/40

CPC classification number: G01R31/318555 ,  G01R31/318558

Abstract: A JTAG-compliant device is configured to receive data through the control (TMS) line in addition to being configured to receive data through the input (TDI) line. A burst-write instruction is made the active instruction, extending the capability of the test access protocol (TAP) controller such that the TAP controller can receive data into a data register while the TAP controller is in certain states. In some states, the TAP controller receives and stores a bit only from the input line. In other states, the TAP controller receives and stores a bit from the input line, and in addition, the TAP controller receives and stores a bit from the control line. The TAP controller may store the received bits by shifting the received bits into the least significant bit of a data register.

Abstract translation: 配置JTAG的设备配置为通过控制（TMS）线路接收数据，同时配置为通过输入（TDI）线路接收数据。 将突发写指令作为活动指令，扩展测试访问协议（TAP）控制器的能力，使TAP控制器在TAP控制器处于某些状态时可以将数据接收到数据寄存器中。 在某些状态下，TAP控制器仅从输入线接收和存储位。 在其他状态下，TAP控制器从输入线接收并存储位，此外，TAP控制器接收并存储来自控制线的位。 TAP控制器可以通过将接收到的比特移位到数据寄存器的最低有效位来存储所接收的比特。

公开(公告)号：US07308658B2

公开(公告)日：2007-12-11

申请号：US11252019

申请日：2005-10-17

Applicant: George W. Wood ,  Amol V. Bhinge

Inventor： George W. Wood ,  Amol V. Bhinge

IPC: G06F17/50

CPC classification number: G01R31/31835

Abstract: A method, computer program product, and data processing system for determining test sequences' coverage of events in testing a semiconductor design are disclosed. Test patterns are randomly generated by one or more “frontend” computers. Results from applying these patterns to the design under test are transmitted to a “backend” computer in the form of an ordered dictionary of events and bitmap and/or countmap data structures. A “bitmap” data structure encodes Boolean information regarding whether or not a given event was covered by a particular test sequence. A “countmap” data structure includes frequency information indicating how many times a given event was triggered by a particular test sequence. The backend computer combines results from each test sequence in a cumulative fashion to measure the overall coverage of the set of test sequences.

Abstract translation: 公开了一种用于确定测试半导体设计中测试序列覆盖事件的方法，计算机程序产品和数据处理系统。 测试模式由一个或多个“前端”计算机随机生成。 将这些模式应用于被测设计的结果以事件和位图和/或计数图数据结构的有序字典的形式被发送到“后端”计算机。 “位图”数据结构编码关于给定事件是否被特定测试序列覆盖的布尔信息。 “计数图”数据结构包括指示特定测试序列触发给定事件多少次的频率信息。 后端计算机以累积方式组合来自每个测试序列的结果，以测量该组测试序列的总体覆盖。