会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 52. 发明授权
    • System and method to record environmental condition on an RFID tag
    • 记录RFID标签环境状况的系统和方法
    • US07327260B2
    • 2008-02-05
    • US11132535
    • 2005-05-19
    • Kevin David HimbergerClark Debs JeffriesMohammad Peyravian
    • Kevin David HimbergerClark Debs JeffriesMohammad Peyravian
    • G08B13/14G06K7/00
    • G06K19/0723G06K19/0717
    • System and method for recording temperature on an RFID tag. A first RFID tag is attached to a container. The first RFID tag includes a temperature sensor. The container contains a multiplicity of packages. A multiplicity of second RFID tags are attached to the multiplicity of packages, respectively. The first RFID tag transmits temperature information to the multiplicity of second RFID tags. In response, the multiplicity of second RFID tags record the temperature information. Consequently, there is no need for expensive temperature sensors on the multiplicity of RFID tags on the packages. According to features of the present invention, the first RFID tag is an active RFID tag, and the multiplicity of second RFID tags are passive RFID tags. The first RFID tag also transmits other information to the multiplicity of second RFID tags to enable the second RFID tags to authenticate the temperature information. Other types of environmental sensors such as a humidity sensor or vibration sensor can substitute for the temperature sensor.
    • 记录RFID标签温度的系统和方法。 第一个RFID标签连接到容器。 第一RFID标签包括温度传感器。 容器包含多个包。 多个第二RFID标签分别附接到多个包装。 第一RFID标签将温度信息传送到多个第二RFID标签。 作为响应,第二RFID标签的多个记录温度信息。 因此,不需要在包装上的RFID标签上的昂贵的温度传感器。 根据本发明的特征,第一RFID标签是有源RFID标签,多个第二RFID标签是无源RFID标签。 第一RFID标签还向多个第二RFID标签传送其他信息,以使第二RFID标签能够认证温度信息。 其他类型的环境传感器,如湿度传感器或振动传感器可以代替温度传感器。
    • 54. 发明授权
    • Method and system for providing optimal discard fraction
    • 提供最佳丢弃分数的方法和系统
    • US06724776B1
    • 2004-04-20
    • US09448190
    • 1999-11-23
    • Clark Debs Jeffries
    • Clark Debs Jeffries
    • H04J322
    • H04L47/10H04L47/29H04L47/30
    • A method and system for controlling a flow of a plurality of packets in a computer network is disclosed. The network includes a queue having a maximum queue level that is possible. The method and system include determining a queue level for the queue and determining an offered rate of the plurality of packets to the queue. The method and system also include determining a virtual maximum queue level based on the queue level and the maximum queue level and controlling a transmission fraction of the plurality of packets to the queue, based on the queue level, the offered rate and the virtual maximum queue level.
    • 公开了一种用于控制计算机网络中的多个分组的流的方法和系统。 网络包括具有可能的最大队列级别的队列。 该方法和系统包括确定队列的队列级别并确定多个分组到队列的提供速率。 该方法和系统还包括基于队列级别和最大队列级别来确定虚拟最大队列级别,并且基于队列级别,提供的速率和虚拟最大队列来控制多个分组到队列的传输分数 水平。
    • 55. 发明授权
    • Cache storage management using dual stacks
    • 使用双栈缓存存储管理
    • US06336167B1
    • 2002-01-01
    • US09415416
    • 1999-10-08
    • Clark Debs JeffriesKen Van VuMazin Sami Yousif
    • Clark Debs JeffriesKen Van VuMazin Sami Yousif
    • G06F1200
    • G06F12/123
    • Cache management in a computer system is achieved by using a cache with dual stacks with storage locations for labels associated with data units stored either in the stack or in a separate cache memory unit. The first or preliminary stack is always refreshed following each label request using a conventional Least Recently Used (LRU) algorithm. If the requested label exists in either stack, the conventional LRU algorithm is also used to update the second stack. If the requested label does not exist in either stack and the bottom position in the second stack is empty, the label is written into the top position of the second stack and existing stack entries are pushed down one position. If the bottom position in the second stack is not empty, stack entries at and below a predetermined insertion point (which may be set statically or dynamically) are pushed down, the entry in the bottom position in the stack is discarded and the label is written into the predetermined insertion point in the second stack.
    • 计算机系统中的缓存管理通过使用具有双堆栈的高速缓存来实现,该缓存具有与存储在堆栈中的数据单元相关联的标签的存储单元或单独的高速缓冲存储器单元中。 使用常规的最近最少使用(LRU)算法,在每个标签请求之后总是刷新第一或初步堆叠。 如果请求的标签存在于任一堆栈中,传统的LRU算法也用于更新第二堆栈。 如果请求的标签不存在于任一堆栈中,并且第二堆栈中的底部位置为空,则将标签写入第二堆栈的顶部位置,并将现有堆栈条目按下一个位置。 如果第二堆栈中的底部位置不为空,则在预定插入点(可以静态或动态设置)下方的堆栈条目被按下,堆叠中底部位置的条目被丢弃并且标签被写入 进入第二堆叠中的预定插入点。
    • 56. 发明授权
    • Method and system for providing congestion control in a data
communications network
    • 在数据通信网络中提供拥塞控制的方法和系统
    • US6035333A
    • 2000-03-07
    • US977252
    • 1997-11-24
    • Clark Debs JeffriesAnoop GhanwaniGerald Arnold MarinKen Van Vu
    • Clark Debs JeffriesAnoop GhanwaniGerald Arnold MarinKen Van Vu
    • H04L12/56G06F15/173
    • H04L47/28H04L47/10H04L47/12H04L47/13
    • A bin packing algorithm is employed to schedule computer network activities, such as pause times required for operation of an Ethernet network which implements existing IEEE 802.3x standards. In such a network, any node in the network can control the flow of traffic from upstream stations in order to avoid congestion at the flow-controlling node. Upon sensing congestion, the flow-controlling node determines how long each upstream node contributing to the congestion should pause transmission over the next control interval. In accordance with the invention, the pause times are scheduled or staggered by using the bin packing algorithm to sort the sources into one or more bins. One required bin property is that there is no overlap in pause times for the sources within a particular bin. Another required bin property is that the sum of the pause times within a bin can be no greater than the length of the control interval. In a preferred embodiment, the calculated pause times are separated into different groups having different number ranges and no more than one pause time is selected from any particular group for packing into a given bin.
    • 采用bin打包算法来调度计算机网络活动,例如实现现有IEEE 802.3x标准的以太网的操作所需的暂停时间。 在这种网络中,网络中的任何节点可以控制来自上游站的业务流,以避免流控制节点处的拥塞。 在感测到拥塞时,流控制节点确定每个有助于拥塞的上游节点在暂停下一个控制间隔时间内的传输时间。 根据本发明,通过使用二进制打包算法来排列或交错暂停时间,以将源排列成一个或多个仓。 一个必需的bin属性是在特定仓中的源的暂停时间没有重叠。 另一个所需的bin属性是bin内暂停时间的总和可以不大于控制间隔的长度。 在优选实施例中,将计算的暂停时间分成具有不同数量范围的不同组,并且从用于打包到给定仓中的任何特定组中选择不超过一个暂停时间。
    • 59. 发明申请
    • FRONT-END PROTOCOL FOR SERVER PROTECTION
    • 用于服务器保护的前端协议
    • US20120260335A1
    • 2012-10-11
    • US13495210
    • 2012-06-13
    • Clark Debs JeffriesMohammad Peyravian
    • Clark Debs JeffriesMohammad Peyravian
    • G06F21/00
    • H04L63/1458
    • The present invention provides for protecting against denial of service attacks. A request is sent by a client, the request comprises client indicia. The request is received at a server. A request count is incremented by the server. A sequence number is assigned as a function of the client indicia. A problem is selected by the server. The problem is sent by the server to the client. A solution to the problem is sent to the server. It is determined if the solution by client is correct. If the solution is correct, a session is performed. If the solution is not correct, the request is discarded. This can substantially decrease the amount of attacks performed by a rogue client, as the session set-up time can be substantial.
    • 本发明提供了防止拒绝服务攻击的保护。 请求由客户端发送,请求包括客户端标记。 服务器收到请求。 请求计数由服务器递增。 作为客户端标记的函数分配序列号。 服务器选择了一个问题。 该问题由服务器发送给客户端。 将问题的解决方案发送到服务器。 确定客户端的解决方案是否正确。 如果解决方案是正确的,则执行会话。 如果解决方案不正确,请求将被丢弃。 这可以显着减少流氓客户端执行的攻击的数量,因为会话建立时间可能很大。
    • 60. 发明授权
    • Front-end protocol for server protection
    • 用于服务器保护的前端协议
    • US08250650B2
    • 2012-08-21
    • US10937695
    • 2004-09-09
    • Clark Debs JeffriesMohammad Peyravian
    • Clark Debs JeffriesMohammad Peyravian
    • G06F21/00
    • H04L63/1458
    • The present invention provides for protecting against denial of service attacks. A request is sent by a client, the request comprises client indicia. The request is received at a server. A request count is incremented by the server. A sequence number is assigned as a function of the client indicia. A problem is selected by the server. The problem is sent by the server to the client. A solution to the problem is sent to the server. It is determined if the solution by client is correct. If the solution is correct, a session is performed. If the solution is not correct, the request is discarded. This can substantially decrease the amount of attacks performed by a rogue client, as the session set-up time can be substantial.
    • 本发明提供了防止拒绝服务攻击的保护。 请求由客户端发送,请求包括客户端标记。 服务器收到请求。 请求计数由服务器递增。 作为客户端标记的函数分配序列号。 服务器选择了一个问题。 该问题由服务器发送给客户端。 将问题的解决方案发送到服务器。 确定客户端的解决方案是否正确。 如果解决方案是正确的,则执行会话。 如果解决方案不正确,请求将被丢弃。 这可以显着减少流氓客户端执行的攻击的数量,因为会话建立时间可能很大。