公开(公告)号：US08560607B2

公开(公告)日：2013-10-15

申请号：US12937337

申请日：2009-05-03

申请人： Jinlin Wang ,  Hao Ren ,  Yifeng Lu ,  Shaowei Su ,  Zhentan Feng

发明人： Jinlin Wang ,  Hao Ren ,  Yifeng Lu ,  Shaowei Su ,  Zhentan Feng

IPC分类号： G06F15/16 ,  G06F15/177

CPC分类号： H04L29/1249 ,  H04L29/12528 ,  H04L61/256 ,  H04L61/2575 ,  H04L67/104

摘要： The present invention relates to a method based on the combination of UPnP and STUN for NAT traversal. The method of the present invention effectively takes the advantages of UPnP and STUN. In particularly, when UpnP fails to traverse NAT, STUN is applied to perform the NAT traversal for the second time, so that the efficiency of the successful traversal is effectively improved. For the symmetric NAT traversal, a Port-Adding Sample Estimation method based on NAT adding port mapping is provided for port estimation, to avoid the defects resulted from the third-party agent and the blindness of the speculation approach. And, where both of the communication peers in the P2P streaming media system are behind NAT, the method that the part of the ordinary outer peers with the sufficient bandwidth acts as the Auxiliary-Relay peers is provided to release the pressure of the relay server so that the bottle-neck of the communication is broken through.

摘要翻译： 本发明涉及一种基于UPnP和STUN组合的NAT穿越方法。 本发明的方法有效地利用了UPnP和STUN的优点。 特别地，当UpnP无法遍历NAT时，应用STUN第二次执行NAT穿越，从而有效提高成功遍历的效率。 对于对称NAT穿越，提供了基于NAT添加端口映射的端口添加样本估计方法，用于端口估计，以避免第三方代理造成的缺陷和投机方法的盲目性。 而且，P2P流媒体系统中的两个通信对等体都在NAT之后，提供具有足够带宽的普通外部对等体部分作为辅助中继对等体的方法，以释放中继服务器的压力 沟通的瓶颈被打破了。

公开(公告)号：US20110238486A1

公开(公告)日：2011-09-29

申请号：US12749372

申请日：2010-03-29

申请人： Weiguo Liu ,  Jinlin Wang

发明人： Weiguo Liu ,  Jinlin Wang

IPC分类号： G06Q30/00 ,  G06Q10/00

CPC分类号： G06Q30/0243 ,  G06Q30/02 ,  G06Q30/0244

摘要： A method and a system are provided for optimizing sponsored search ad placement for online advertising. In one example, the system obtains advertiser bid amount information. The system obtains advertiser bid amount information. The bid amount information allows determination of amounts that advertisers will pay per user click on ads served in association with advertiser bids. The advertiser bid amounts are associated with advertising campaigns. The system obtains click-through-rate information associated with at least some of the ads. The system obtains budget information associated with the advertising campaign. The budget information specifies a maximum advertiser spending over a period of time in association with at least a portion of the advertising campaign. The system ranks a set of ads to be served based on the bid amount information, the click-through-rate information, and/or the budget information. The system optimizes ad placement of the set of ads by eliminating one or more keywords. The system then facilitates serving of the set of ads in accordance with at least one of the ranking of the set of ads and the optimizing of the ad placement.

摘要翻译： 提供了一种方法和系统，用于优化在线广告的赞助搜索广告展示位置。 在一个示例中，系统获得广告商投标金额信息。 系统获取广告客户投标金额信息。 投标金额信息允许确定广告客户将按照广告客户出价关联广告投放的广告点击付费的金额。 广告客户出价金额与广告系列相关联。 该系统获得与至少一些广告相关联的点击率信息。 该系统获得与广告活动相关联的预算信息。 预算信息指定与至少一部分广告活动相关联的一段时间内的广告客户支出的最大值。 系统根据出价金额信息，点击率信息和/或预算信息对一组要投放的广告进行排序。 该系统通过删除一个或多个关键字来优化该组广告的广告展示位置。 该系统然后根据该组广告的排名和广告展示位置的优化中的至少一个来促进该组广告的投放。

公开(公告)号：US20070143254A1

公开(公告)日：2007-06-21

申请号：US11679040

申请日：2007-02-26

申请人： Jin Yang ,  Rao Korupolu ,  Jinlin Wang ,  Harry Walton ,  Bor-Ruey Fu

发明人： Jin Yang ,  Rao Korupolu ,  Jinlin Wang ,  Harry Walton ,  Bor-Ruey Fu

IPC分类号： G06F17/30

CPC分类号： G06F17/30348 ,  Y10S707/99952 ,  Y10S707/99953

摘要： A system and method for efficiently performing memory intensive computations including a bidirectional synchronization mechanism for maintaining consistency of data on which computations will be performed. This can be used to solve various problems such as those in a business context. Synchronization occurs in a near-real-time fashion between data in a database and data stored in memory. The synchronization is accomplished by periodically scanning the database to see if any data has changed. If any data has changed, the changes are copied over to memory so that the data in memory is current. This update is accomplished without copying the entire database into memory each time data in the database changes.

摘要翻译： 一种用于有效执行存储器密集型计算的系统和方法，包括用于维持将执行哪些计算的数据的一致性的双向同步机制。 这可以用于解决诸如业务环境中的各种问题。 同步在数据库中的数据和存储在存储器中的数据之间以几乎实时的方式发生。 通过定期扫描数据库以查看是否有任何数据已更改来实现同步。 如果任何数据已更改，则将更改复制到内存中，以使内存中的数据为最新。 每次数据库中的数据更改时，都不会将整个数据库复制到内存中进行此更新。

公开(公告)号：US08174113B2

公开(公告)日：2012-05-08

申请号：US12284097

申请日：2008-09-17

申请人： Abhishek Gupta ,  Mike Boyd ,  Carl Deppisch ,  Jinlin Wang ,  Daewoong Suh ,  Brad Drew

发明人： Abhishek Gupta ,  Mike Boyd ,  Carl Deppisch ,  Jinlin Wang ,  Daewoong Suh ,  Brad Drew

IPC分类号： H01L23/10 ,  H01L23/34

CPC分类号： B23K1/0016 ,  B23K2101/42 ,  B23K2103/12 ,  F28F3/12 ,  F28F21/08 ,  H01L23/42 ,  H01L2224/16 ,  H01L2224/73253 ,  H01L2924/00011 ,  H01L2924/00014 ,  H01L2924/01078 ,  H01L2924/01079 ,  H01L2924/01327 ,  H01L2924/16152 ,  H01L2924/00 ,  H01L2224/0401

摘要： Methods and associated structures of forming an indium containing solder material directly on an active region of a copper IHS is enabled. A copper indium containing solder intermetallic is formed on the active region of the IHS. The solder intermetallic improves the solder-TIM integration process for microelectronic packaging applications.

摘要翻译： 能够在铜IHS的有源区上直接形成含铟焊料的方法和相关结构。 在IHS的有源区上形成含铜铟的焊料金属间化合物。 焊料金属间改善了用于微电子封装应用的焊料-TM集成工艺。

公开(公告)号：US20080142996A1

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

申请号：US11641638

申请日：2006-12-19

申请人： Gopalakrishnan Subramanian ,  Nirupama Chakrapani ,  Lawrence D. Decesare ,  Shripad Gokhale ,  Jason M. Murphy ,  Jinlin Wang

发明人： Gopalakrishnan Subramanian ,  Nirupama Chakrapani ,  Lawrence D. Decesare ,  Shripad Gokhale ,  Jason M. Murphy ,  Jinlin Wang

IPC分类号： H01L23/31 ,  H01L21/71

CPC分类号： H01L21/563 ,  H01L2224/16225 ,  H01L2224/27013 ,  H01L2224/32225 ,  H01L2224/73203 ,  H01L2224/73204 ,  H01L2924/00011 ,  H01L2924/00014 ,  H01L2924/01019 ,  H01L2924/01025 ,  H01L2924/1461 ,  H01L2924/00012 ,  H01L2924/00 ,  H01L2224/0401

摘要： According to one embodiment, a polymer coating is disposed on a surface of a package substrate. The polymer coating comprises a material capable of inhibiting the flow of an underfill material into a keep-out zone (KOZ). In a further embodiment, a die is disposed on the substrate and a layer of the underfill material is disposed between the die and substrate, and the polymer coating inhibits the flow of the underfill into the KOZ. Other embodiments are described and may be claimed.

摘要翻译： 根据一个实施例，聚合物涂层设置在封装衬底的表面上。 聚合物涂层包括能够抑制底部填充材料流入保持区（KOZ）的材料。 在另一个实施例中，模具设置在基板上，底层填充材料层设置在模具和基板之间，聚合物涂层阻止底部填充物流入KOZ。 描述并且可以要求保护其他实施例。

公开(公告)号：US07200720B1

公开(公告)日：2007-04-03

申请号：US10041033

申请日：2001-12-28

申请人： Jin Yang ,  Rao Korupolu ,  Jinlin Wang ,  Harry Phillip Walton, III ,  Bor-Ruey Fu

发明人： Jin Yang ,  Rao Korupolu ,  Jinlin Wang ,  Harry Phillip Walton, III ,  Bor-Ruey Fu

IPC分类号： G06F12/00 ,  G06F17/30

CPC分类号： G06F17/30348 ,  Y10S707/99952 ,  Y10S707/99953

摘要： A system and method for efficiently performing memory intensive computations including a bidirectional synchronization mechanism for maintaining consistency of data on which computations will be performed. This can be used to solve various problems such as those in a business context. Synchronization occurs in a near-real-time fashion between data in a database and data stored in memory. The synchronization is accomplished by periodically scanning the database to see if any data has changed. If any data has changed, the changes are copied over to memory so that the data in memory is current. This update is accomplished without copying the entire database into memory each time data in the database changes.

摘要翻译： 一种用于有效执行存储器密集型计算的系统和方法，包括用于维持将执行哪些计算的数据的一致性的双向同步机制。 这可以用于解决诸如业务环境中的各种问题。 同步在数据库中的数据和存储在存储器中的数据之间以几乎实时的方式发生。 通过定期扫描数据库以查看是否有任何数据已更改来实现同步。 如果任何数据已更改，则将更改复制到内存中，以使内存中的数据为最新。 每次数据库中的数据更改时，都不会将整个数据库复制到内存中进行此更新。

公开(公告)号：US09584410B2

公开(公告)日：2017-02-28

申请号：US14405223

申请日：2012-12-28

申请人： Jinlin Wang ,  Lingfang Wang ,  Jiali You ,  Feng Deng

发明人： Jinlin Wang ,  Lingfang Wang ,  Jiali You ,  Feng Deng

IPC分类号： H04L12/721 ,  H04L12/747 ,  H04L29/06 ,  H04W36/00 ,  H04W80/02

CPC分类号： H04L45/66 ,  H04L45/742 ,  H04L69/22 ,  H04W36/005 ,  H04W80/02

摘要： The present invention relates to a Layer 2 adapter selecting system, including a Layer 3 packet requirements extracting module, a destination Layer 2 address acquiring module, a Layer 2 adapter metric acquiring module, an appropriate Layer 2 adapter identifier selecting module, a packet caching module and a packet scheduling module; wherein the packet caching module is configured to cache a received Layer 3 packet; the Layer 3 packet requirements extracting module is configured to read the Layer 3 packet and extract the type and a parameter value of the requirements; the Layer 2 adapter metric acquiring module is configured to acquire instant metric parameter values of each of the adapters; the appropriate Layer 2 adapter identifier selecting module calculates an adapter identifier and a Layer 3 packet metric; the destination Layer 2 address acquiring module is configured to acquire a Layer 2 address of each of the adapters associated with a destination Layer 3 address; and the packet scheduling module calls an external Layer 2 adapter driver, and the Layer 2 adapter driver completes packaging and sending of the packet. The present invention may solve the problem of resource waste of multiple links, so that the multiple links may be used dynamically in parallel.

摘要翻译： 本发明涉及一种二层适配器选择系统，包括三层分组要求提取模块，目的地二层地址获取模块，二层适配器度量获取模块，适当的二层适配器标识选择模块，分组缓存模块 和分组调度模块; 其中所述分组高速缓存模块被配置为缓存接收的第3层分组; 第3层数据包要求提取模块配置为读取第3层数据包并提取要求的类型和参数值; 所述第二层适配器度量获取模块被配置为获取每个所述适配器的即时度量参数值; 适当的第2层适配器标识符选择模块计算适配器标识符和第3层分组度量; 目的地二层地址获取模块被配置为获取与目的地层3地址相关联的每个适配器的二层地址; 并且分组调度模块调用外部第2层适配器驱动程序，并且第2层适配器驱动程序完成打包和发送数据包。 本发明可以解决多个链路的资源浪费问题，可以并行地动态地使用多个链路。

公开(公告)号：US20120179870A1

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

申请号：US13376153

申请日：2011-11-20

申请人： Jinlin Wang ,  Lingfang Wang ,  Jiali You ,  Haojiang Deng

发明人： Jinlin Wang ,  Lingfang Wang ,  Jiali You ,  Haojiang Deng

IPC分类号： G06F12/00

CPC分类号： G06F11/1076 ,  G06F2211/1028 ,  H04L41/12

摘要： A data storing method of a (d, k) Moore graph-based network storage structure is provided. The method arranges a number of formula(I) storing nodes in a wide area network (WAN) environment in accordance with a (d, k) Moore graph to form a strongly regular network structure, and utilizes implementation methods of different separate redundant array of independent disks (RAID) techniques of multiple degrees of reliability, thereby enabling data storing supported by network-RAIDs (NRAID) of multiple degrees of reliability in a network environment; said network structure of a strongly regular graph makes an arbitrarily accessed storing node as a controlling node, and uses other d+d(d−1) storing nodes as neighboring nodes of the controlling node, wherein d is the number of one-hop neighboring nodes; and d(d−1) are the number of two-hop neighboring nodes; the controlling node stores metadata of stored data, and sends information of accessing data; the neighboring nodes provide data storing services. The present invention combines the special characteristics of a (d, k) Moore graph with RAID technology, thereby enhancing the reliability of data storing in a network environment. 1 + d  ∑ i = 0 k - 1  ( d - 1 ) i Formula   ( I )

摘要翻译： 提供了一种（d，k）摩尔图形网络存储结构的数据存储方法。 该方法根据（d，k）摩尔图在广域网（WAN）环境中排列存在节点的多个公式（I），以形成强规则的网络结构，并利用不同的单独冗余阵列的实现方法 独立磁盘（RAID）技术，从而使网络环境中多个可靠度的网络RAID（NRAID）支持数据存储; 所述强规则图的网络结构使得任意访问的存储节点作为控制节点，并且使用其他d + d（d-1）存储节点作为控制节点的相邻节点，其中d是一跳相邻的数量 节点; 和d（d-1）是两跳相邻节点的数量; 控制节点存储所存储数据的元数据，并发送访问数据的信息; 相邻节点提供数据存储服务。 本发明将（d，k）摩尔图的特征与RAID技术相结合，从而提高了网络环境中数据存储的可靠性。 1 +dΣΣi = 0 k - 1（d - 1）i公式（I）

公开(公告)号：US20110264739A1

公开(公告)日：2011-10-27

申请号：US12937337

申请日：2009-05-03

申请人： Jinlin Wang ,  Hao Ren ,  Yifeng Lu ,  Shaowei Su ,  Zhentan Feng

发明人： Jinlin Wang ,  Hao Ren ,  Yifeng Lu ,  Shaowei Su ,  Zhentan Feng

IPC分类号： G06F15/16

CPC分类号： H04L29/1249 ,  H04L29/12528 ,  H04L61/256 ,  H04L61/2575 ,  H04L67/104

摘要： The present invention relates to a method based on the combination of UPnP and STUN for NAT traversal. The method of the present invention effectively takes the advantages of UPnP and STUN. In particularly, when UpnP fails to traverse NAT, STUN is applied to perform the NAT traversal for the second time, so that the efficiency of the successful traversal is effectively improved. For the symmetric NAT traversal, a Port-Adding Sample Estimation method based on NAT adding port mapping is provided for port estimation, to avoid the defects resulted from the third-party agent and the blindness of the speculation approach. And, where both of the communication peers in the P2P streaming media system are behind NAT, the method that the part of the ordinary outer peers with the sufficient bandwidth acts as the Auxiliary-Relay peers is provided to release the pressure of the relay server so that the bottle-neck of the communication is broken through.

摘要翻译： 本发明涉及一种基于UPnP和STUN组合的NAT穿越方法。 本发明的方法有效地利用了UPnP和STUN的优点。 特别地，当UpnP无法遍历NAT时，应用STUN第二次执行NAT穿越，从而有效提高成功遍历的效率。 对于对称NAT穿越，提供了基于NAT添加端口映射的端口添加样本估计方法，用于端口估计，以避免第三方代理造成的缺陷和投机方法的盲目性。 而且，P2P流媒体系统中的两个通信对等体都在NAT之后，提供具有足够带宽的普通外部对等体部分作为辅助中继对等体的方法，以释放中继服务器的压力 沟通的瓶颈被打破了。

公开(公告)号：US20110055003A1

公开(公告)日：2011-03-03

申请号：US12550904

申请日：2009-08-31

申请人： Jinlin Wang ,  Weiguo Liu

发明人： Jinlin Wang ,  Weiguo Liu

IPC分类号： G06Q30/00

CPC分类号： G06Q30/02 ,  G06Q30/0246

摘要： Methods and systems are provided for ranking of sponsored search advertisements, and for auction pricing, based on revenue factors in addition to bid amounts and click through rates including budgets associated with advertising accounts, campaigns and portions thereof. Methods are provided in which linear programming or other techniques are used to optimize the search engine revenue, and the optimized solutions are used in ranking sponsored search advertisements based on factors including an advertiser bid amount associated with the advertisement, a historical, estimated or predicted click through rate associated with the advertisement, and a budget over a period of time, such as a daily budget, the budget including spend associated with the advertisement. Instead of one fixed position, the new ranking is a service distribution on multiple positions.

摘要翻译： 提供方法和系统用于对赞助的搜索广告的排名以及针对拍卖定价，除基于收入因素以外的投标金额和点击率，包括与广告账户，活动及其部分相关联的预算。 提供了使用线性规划或其他技术来优化搜索引擎收入的方法，并且优化的解决方案用于基于包括与广告相关联的广告商投标金额，历史，估计或预测的点击的因素来排名赞助搜索广告 通过与广告相关联的费率，以及一段时间内的预算，例如每日预算，包括与广告相关联的支出的预算。 而不是一个固定的位置，新的排名是多个职位的服务分配。