专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

11. 发明申请

US20070054592A1 Seat-driving device for simulation system 审中-公开
标题翻译：用于模拟系统的座椅驱动装置
公开(公告)号：US20070054592A1
公开(公告)日：2007-03-08
申请号：US11218404
申请日：2005-09-02
申请人： Young Chang , Jonathan Lee
发明人： Young Chang , Jonathan Lee
IPC分类号： A63B69/16 , A63H33/22
CPC分类号： G09B9/00
摘要： A seat driving device of a simulation system for driving a seat on which a user of the simulation system sits is provided. The seat driving device includes a first member having a spherical surface, a second member making a relative motion with respect to the first member, two wheels rotatably coupled to the second member and rolling on and contacting the spherical surface of the first member, and two driving motors installed on the second member and connected to the wheels to rotate the wheels. The seat is installed on one of the first and second members.
摘要翻译：提供了一种用于驱动模拟系统的用户所在的座椅的模拟系统的座椅驱动装置。座椅驱动装置包括具有球形表面的第一构件，相对于第一构件相对运动的第二构件，可旋转地联接到第二构件并在第一构件的球形表面上滚动并接触第二构件的两个轮驱动电动机安装在第二构件上并连接到车轮以使车轮旋转。座椅安装在第一和第二构件之一上。

12. 发明申请

US20070016728A1 Automatically detecting types of external data flash devices 失效
公开(公告)号：US20070016728A1
公开(公告)日：2007-01-18
申请号：US11181547
申请日：2005-07-14
申请人： Xiaogang Zhu , Jonathan Lee
发明人： Xiaogang Zhu , Jonathan Lee
IPC分类号： G06F12/00
CPC分类号： G06F13/4239
摘要： Automatically detecting types of external FLASH devices is provided, and may comprise communicating one or more read memory device ID commands corresponding to at least one supported memory device to at least one memory device. Data received in response to this communication may be utilized to determine whether the received data identifies the memory device as one of the plurality of supported memory devices. The supported memory devices may be serial FLASH memory devices. Each read memory device ID command may be manufacturer specific, or may be specific to a group of the supported memory devices. The communicating of read memory device ID commands and determining whether the memory device is a supported memory device may be repeated if the memory device is not identified as one of the supported memory devices. There may be a limit to the number of times this is repeated.

13. 发明申请

US20060212447A1 System and method for influencing a position on a search result list generated by a computer network search engine 有权
标题翻译：用于影响由计算机网络搜索引擎生成的搜索结果列表上的位置的系统和方法
公开(公告)号：US20060212447A1
公开(公告)日：2006-09-21
申请号：US11438378
申请日：2006-05-22
申请人： Darren Davis , Matthew Derer , Johann Garcia , Larry Greco , Tod Kurt , Thomas Kwong , Jonathan Lee , Ka Lee , Preston Pfarner , Steve Skovran
发明人： Darren Davis , Matthew Derer , Johann Garcia , Larry Greco , Tod Kurt , Thomas Kwong , Jonathan Lee , Ka Lee , Preston Pfarner , Steve Skovran
IPC分类号： G06F17/30
CPC分类号： G06Q30/0275 , G06F17/30864 , G06Q30/02 , G06Q30/04 , G06Q30/0601 , G06Q30/0633 , G06Q30/08 , G06Q40/00 , G06Q40/04 , G06Q50/188 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99945
摘要： A system and method for enabling information providers using a computer network to influence a position for a search listing within a search result list. A database stores accounts for the network information providers. Each account contains contact and billing information. In addition, each account contains at least one search listing having at least three components: a description, a search term comprising one or more keywords, and a bid amount. The network information provider may add, delete, or modify a search listing after logging into his or her account via an authentication process. The network information provider influences a position for a search listing in the provider's account by first selecting a relevant search term and entering that search term and the description into a search listing. A continuous online competitive bidding process occurs when the network information provider enters a new bid amount for a search listing. This bid amount is compared with all other bid amounts for the same search term. A rank value is generated for all search listings having that search term. The generated rank value determines where the network information provider's listing will appear on the search results list page that is generated in response to a query of the search term by a searcher at a client computer on the computer network. A higher bid by a network information provider will result in a higher rank value and a more advantageous placement.
摘要翻译：一种用于使得使用计算机网络的信息提供者能够影响搜索结果列表内的搜索列表的位置的系统和方法。数据库存储网络信息提供者的帐户。每个帐户都包含联系人和帐单信息。此外，每个帐户包含至少一个具有至少三个组件的搜索列表：描述，包括一个或多个关键字的搜索项和投标金额。网络信息提供者可以通过身份验证过程登录他/她的帐户后添加，删除或修改搜索列表。网络信息提供者通过首先选择相关搜索词并将该搜索词和描述输入到搜索列表中来影响提供商帐户中搜索列表的位置。当网络信息提供商输入搜索列表的新的出价金额时，会发生连续的在线竞标过程。将此出价金额与相同搜索字词的所有其他出价金额进行比较。为具有该搜索项的所有搜索列表生成等级值。生成的等级值确定网络信息提供者的列表将出现在搜索结果列表页面上，该搜索结果列表页面是响应于计算机网络上的客户端计算机上的搜索者对搜索项的查询而生成的。网络信息提供商的较高出价将导致更高的等级值和更有利的布局。

14. 发明申请

US20060143096A1 System and method for influencing a position on a search result list generated by a computer network search engine 有权
标题翻译：用于影响由计算机网络搜索引擎生成的搜索结果列表上的位置的系统和方法
公开(公告)号：US20060143096A1
公开(公告)日：2006-06-29
申请号：US11359737
申请日：2006-02-22
申请人： Darren Davis , Matthew Derer , Johann Garcia , Larry Greco , Tod Kurt , Thomas Kwong , Jonathan Lee , Ka Lee , Preston Pfarner , Steve Skovran
发明人： Darren Davis , Matthew Derer , Johann Garcia , Larry Greco , Tod Kurt , Thomas Kwong , Jonathan Lee , Ka Lee , Preston Pfarner , Steve Skovran
IPC分类号： G06Q30/00
CPC分类号： G06Q30/0275 , G06F17/30864 , G06Q30/02 , G06Q30/04 , G06Q30/0601 , G06Q30/0633 , G06Q30/08 , G06Q40/00 , G06Q40/04 , G06Q50/188 , Y10S707/99932 , Y10S707/99933 , Y10S707/99934 , Y10S707/99935 , Y10S707/99945
摘要： A system and method for enabling information providers using a computer network such as the Internet to influence a position for a search listing within a search result list generated by an Internet search engine. The system and method of the present invention provides a database having accounts for the network information providers. Each account contains at least one search listing having at least three components: a description, a search term comprising one or more keywords, and a bid amount. The network information provider may add, delete, or modify a search listing after logging into his or her account via an authentication process. The network information provider influences the position for a search listing through a continuous online competitive bidding process. The bidding process occurs when the network information provider enters a new bid amount, which is preferably a money amount, for a search listing. The system then compares this bid amount with all other bid amounts for the same search term, and generates a rank value for all search listings having that search term. The rank value generated by the bidding process determines where the network information providers listing will appear on the search results list page that is generated in response to a query of the search term by a searcher located at a client computer on the computer network. A higher bid by a network information provider will result in a higher rank value and a more advantageous placement.
摘要翻译：一种用于使诸如因特网之类的计算机网络的信息提供者能够影响由因特网搜索引擎生成的搜索结果列表内的搜索列表的位置的系统和方法。本发明的系统和方法提供了一种具有网络信息提供者帐户的数据库。每个帐户至少包含一个具有至少三个组件的搜索列表：描述，包括一个或多个关键字的搜索项和投标金额。网络信息提供者可以通过身份验证过程登录他/她的帐户后添加，删除或修改搜索列表。网络信息提供商通过连续的在线竞标过程影响搜索列表的位置。当网络信息提供者为搜索列表输入新的出价金额（优选地为货币金额）时，出价投标过程发生。然后，该系统将该出价金额与相同搜索项的所有其他出价金额进行比较，并为具有该搜索项的所有搜索列表生成等级值。由投标过程产生的等级值确定网络信息提供商列表将在搜索结果列表页面上显示的位置，该搜索结果列表页面是响应于位于计算机网络上的客户端计算机上的搜索者对搜索词的查询生成的。网络信息提供商的较高出价将导致更高的等级值和更有利的布局。

15. 发明申请

US20060083408A1 Biometric tokenless electronic rewards system and method 审中-公开
标题翻译：生物识别无电子奖励系统及方法
公开(公告)号：US20060083408A1
公开(公告)日：2006-04-20
申请号：US11245662
申请日：2005-10-07
申请人： Ned Hoffman , David Pare , Jonathan Lee , Philip Lapsley
发明人： Ned Hoffman , David Pare , Jonathan Lee , Philip Lapsley
IPC分类号： G06K9/00 , G07G1/14
CPC分类号： G06Q30/02 , G06F21/31 , G06F21/32 , G06Q20/02 , G06Q20/18 , G06Q20/387 , G06Q20/40 , G06Q20/4014 , G06Q30/0222 , G06Q30/0225 , G06Q30/0226 , G06Q30/0234 , G06Q30/0236 , G07C9/00142 , G07C9/00158
摘要： Disclosed is a system and method for processing tokenless electronic consumer rewards between a reward provider and a recipient using an electronic identicator comparator and at least one recipient biometric data. The process uses apparatus for creating an electronic registry of a reward provider's products or services each having a predetermined rewards value, the rewards being disbursed to recipients based upon the occurrence of predetermined criteria; recipient registration, wherein the recipient registers with the electronic identicator comparator at least one registration biometric sample, and recipient specific data; recipient identification, wherein the identicator comparator compares a recipient bid biometric sample with previously registered biometric samples for producing either a successful or failed identification of the recipient; and recipient rewards issuance, wherein the rewards provider issues rewards to the recipient. This method and system can process an electronic consumer rewards transaction without the recipient using any unique identification tokens.
摘要翻译：公开了一种用于使用电子识别器比较器和至少一个接收者生物测定数据来处理奖励提供者和接收者之间的无令牌电子消费者奖励的系统和方法。该过程使用用于创建奖励提供者的产品或服务的电子注册表的装置，每个产品或服务具有预定的奖励值，根据预定标准的发生，奖励被支付给接收者; 收件人注册，其中所述接收者向所述电子标识符比较器注册至少一个注册生物特征样本和接收者特定数据; 其中所述识别者比较器将接收者投标生物特征样本与先前注册的生物特征样本进行比较，以产生接收者的成功或失败的标识; 和收款人奖励发行，其中奖励提供者向收件人发放奖励。该方法和系统可以处理电子消费者回报交易，而不使用任何唯一的识别令牌。

16. 发明申请

US20060029261A1 Tokenless electronic transaction system 有权
公开(公告)号：US20060029261A1
公开(公告)日：2006-02-09
申请号：US11245624
申请日：2005-10-07
申请人： Ned Hoffman , David Pare , Jonathan Lee
发明人： Ned Hoffman , David Pare , Jonathan Lee
IPC分类号： G06K9/00 , G06Q99/00
CPC分类号： G06Q20/40 , G06Q20/12 , G06Q20/401 , G06Q20/4014 , G07C9/00158 , G07C9/00166 , H04L9/3226 , H04L9/3231 , H04L63/0861 , H04L2209/56
摘要： The invention as described provides a method and system for tokenless authorization of commercial transactions between a buyer and a seller using a computer system. The method comprises the steps of registering a buyer, wherein the buyer registers with the computer system a PIN, at least one registration biometric sample, and at least one buyer financial account. The method also includes a seller registration step, wherein the seller registers with the computer system at least one seller financial account. In a proposal step, the seller offers a proposed commercial transaction to the buyer usually comprising price information. If the buyer accepts the seller's proposal, in an acceptance step, the buyer signals his/her acceptance by adding to the proposed commercial transaction the buyer's personal authentication information comprising a PIN and at least one bid biometric sample which is obtained from the buyer's person. In a transmission step, the bid biometric sample and PIN are forwarded to the computer system. The computer system compares the bid biometric sample with registration biometric samples for producing either a successful or failed identification of the buyer in a buyer identification step. Upon determination of sufficient resources, a financial account of the buyer is debited and a financial account of the seller is credited, in a payment step. Therefore, a commercial transaction is conducted without the buyer having to use any portable man-made memory devices such as smartcards or swipe cards.

17. 发明申请

US20050147126A1 Method and system for transmission control packet (TCP) segmentation offload 有权
标题翻译：传输控制分组（TCP）分段卸载的方法和系统
公开(公告)号：US20050147126A1
公开(公告)日：2005-07-07
申请号：US10752336
申请日：2004-01-06
申请人： Jack Qiu , Jonathan Lee
发明人： Jack Qiu , Jonathan Lee
IPC分类号： H04L12/56 , H04L29/06 , H04L29/08
CPC分类号： H04L69/16 , H04L49/90 , H04L49/901 , H04L49/9042 , H04L69/12 , H04L69/166 , H04L69/326
摘要： Certain aspects of the invention for packet segmentation and offload may comprise determining whether an identified packet is a large send offload packet (LSOP). If the identified packet is a LSOP, a selection may be made between a hardware process and a firmware process for handling the LSOP. The LSOP may then be processed by the selected hardware process or firmware process. At least a portion of protocol header information for a first segment of the LSOP may be stored and subsequently utilized for at least a header portion of a second segment of the LSOP. A payload corresponding to the second segment of the LSOP may be placed at a determined offset within a transmit buffer for the second segment. A header portion of the second segment may be updated based on at least a header portion of a previous segment.
摘要翻译：用于分组分段和卸载的本发明的某些方面可以包括确定所识别的分组是否是大的发送卸载分组（LSOP）。如果识别的分组是LSOP，则可以在硬件处理和用于处理LSOP的固件处理之间进行选择。然后可以通过所选择的硬件过程或固件处理来处理LSOP。用于LSOP的第一段的协议报头信息的至少一部分可以被存储并随后用于LSOP的第二段的至少一个报头部分。可以将对应于LSOP的第二段的有效载荷置于第二段的发送缓冲器内的确定的偏移处。可以基于至少前一段的报头部分来更新第二段的报头部分。

18. 发明授权

US06721737B2 Method of ranking items using efficient queries 失效
标题翻译：使用高效查询对项目进行排序的方法
公开(公告)号：US06721737B2
公开(公告)日：2004-04-13
申请号：US09826242
申请日：2001-04-04
申请人： Vijay S. Iyengar , Jonathan Lee
发明人： Vijay S. Iyengar , Jonathan Lee
IPC分类号： G06F1730
CPC分类号： G06F17/30395 , G06F17/3053 , G06Q30/02 , Y10S707/99935 , Y10S707/99936 , Y10S707/99942
摘要： A method is provided for ranking a plurality of items. The method comprises initializing a (D−1) dimensional weight space including a feasible region, where D is equal to a number of attributes and a point in the weight space corresponds to each attribute, determining an item pair, and querying a user to select an item from among the item pair. The method further includes reducing the feasible region based upon a user's item selection, and ranking the items according a ranking point in a reduced feasible region. The ranking point is a center of the reduced feasible region, wherein the center is one of a vertex barycenter and center of gravity. The ranking point corresponds to a users item selection. The method includes the step of selecting a plurality of hyperplanes, each hyperplane corresponding to an item pair such that the hyperplane divides the feasible region into two substantially equal portions.
摘要翻译：提供了一种用于对多个项目进行排序的方法。该方法包括初始化包括可行区域的（D-1）维重量空间，其中D等于属性数量，权重空间中的点对应于每个属性，确定项目对，并且查询用户选择项目对中的一个项目。该方法还包括基于用户的项目选择来减少可行区域，并且根据减少的可行区域中的排名点对项目进行排序。排名点是可行区域的中心，其中心是顶点重心和重心之一。排名点对应于用户项目选择。该方法包括选择多个超平面的步骤，每个超平面对应于项目对，使得超平面将可行区域划分为两个基本相等的部分。

19. 发明授权

US6157862A Shaped multiple electrode lead for implantable device 失效
标题翻译：用于可植入装置的成形多电极引线
公开(公告)号：US6157862A
公开(公告)日：2000-12-05
申请号：US90514
申请日：1998-06-04
申请人： Robert R Brownlee , Jonathan Lee
发明人： Robert R Brownlee , Jonathan Lee
IPC分类号： A61N1/05
CPC分类号： A61N1/056 , A61N1/0563
摘要： A single pass lead system for defibrillating the heart is shown. Portion of the lead is relatively stiff and holds the lead in the SVC. This stiff section extends into the atrium where good contact with the electrodes on the lead are maintained by the lead stiffness. A very flexible distal portion carries defibrillation leads into the ventricle.
摘要翻译：显示了用于除颤心脏的单程引导系统。铅的部分比较僵硬，并在SVC中占据领先地位。该刚性部分延伸到心房，其中与引线刚度保持与引线上的电极的良好接触。一个非常灵活的远端部分将除颤线引入脑室。

20. 发明申请

US20180050753A1 A DEVICE SUITABLE FOR PROTECTING AND/OR ALLOWING CLEANING OF A BIKE AND/OR VEHICLE COMPONENT AND METHOD OF USE THEREOF 审中-公开
公开(公告)号：US20180050753A1
公开(公告)日：2018-02-22
申请号：US15557540
申请日：2016-01-27
申请人： Esther Lee , Jonathan Lee , Gareth Bransby
发明人： Jonathan Lee , Gareth Bransby , Ertu Unver , Robert Silkstone
IPC分类号： B62J13/00 , F16D65/00 , F16H57/04 , F16N31/00
CPC分类号： B62J13/00 , B62J2099/0066 , F16D65/0031 , F16D2055/0037 , F16H57/0402 , F16N31/006
摘要： A device is provided for protecting, allowing cleaning, servicing and/or lubrication of one or more components of a bike or vehicle in use. The device is formed from at least one blank of material including a first portion arranged to act as a shield element so as to at least partially shield at least one component of the vehicle or bike in use, and at least a second portion. The second portion includes at least one wall joined to the first portion by at least one fold line. The at least one wall and fold line are arranged such that when the second portion is assembled and/or erected in use it defines a tray or container portion joined to the first portion.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式