公开(公告)号：USD686254S1

公开(公告)日：2013-07-16

申请号：US29387583

申请日：2011-03-15

申请人： Dongning Wang ,  Xiaofeng Li ,  Lei Zou ,  Falin Yang ,  Jianru Liu ,  Jian Wang

设计人： Dongning Wang ,  Xiaofeng Li ,  Lei Zou ,  Falin Yang ,  Jianru Liu ,  Jian Wang

公开(公告)号：US08489537B2

公开(公告)日：2013-07-16

申请号：US12359344

申请日：2009-01-26

申请人： Jie Su ,  Min Chu ,  Wenli Zhu ,  Jian Wang

发明人： Jie Su ,  Min Chu ,  Wenli Zhu ,  Jian Wang

IPC分类号： G06F17/00 ,  G06N5/02

CPC分类号： G06N5/02

摘要： Described is a technology in which a finite state machine-based method segments original sequential data into high level units. Segments with similar sub-sequences are treated as the same unit. In general, the finite state machine indentifies sub-sequences in the sequential data that have similar tree-like microstructures. One described finite state machine operates by entering a path state when an input is a path command corresponding to a non-leaf node; the state machine remains in the path state until another command comprises an action command corresponding to a leaf node, whereby it outputs an action unit, or until the other command comprises a path command that is not the parent or the sibling of a next command, whereby a browsing unit is output. Also described is aggregating sub-sequences of a same unit to produce an access structure corresponding to the unit.

摘要翻译： 描述了一种技术，其中基于有限状态机的方法将原始顺序数据分段成高级单元。 具有相似子序列的段被视为相同的单元。 一般来说，有限状态机识别具有类似树状微结构的序列数据中的子序列。 一个描述的有限状态机通过在输入是对应于非叶节点的路径命令时输入路径状态来操作; 状态机保持在路径状态，直到另一个命令包括与叶节点相对应的动作命令，由此其输出动作单元，或者直到另一个命令包括不是父节点的路径命令或下一个命令的兄弟节点， 由此输出浏览单元。 还描述了聚合相同单元的子序列以产生对应于该单元的访问结构。

公开(公告)号：US08466765B2

公开(公告)日：2013-06-18

申请号：US13094318

申请日：2011-04-26

申请人： Piotr Markowski ,  Lin Guo Wang ,  Hong Fei Bu ,  Feng Chuan Gao ,  Jian Wang

发明人： Piotr Markowski ,  Lin Guo Wang ,  Hong Fei Bu ,  Feng Chuan Gao ,  Jian Wang

IPC分类号： H01F17/04

CPC分类号： H01F27/346 ,  H01F27/2804

摘要： Multi-winding magnetic structures and methods of making multi-winding magnetic structures are disclosed. In one embodiment, a multi-winding magnetic structure includes a core constructed of a magnetic material and a plurality of windings. The core includes a core top, a core bottom, and a plurality of columns. The core top has an exterior edge defining a shape of the core top. A central section of the core top has a substantially constant thickness that defines a thickness of the core top. The core bottom is beneath the core top and has an exterior edge defining a shape of the core bottom. A central section of the core bottom has a substantially constant thickness that defines a thickness of the core bottom. The thickness of one of the core bottom and the core top decreases from an edge of its central section to its exterior edge. The plurality of columns extends from the core bottom to the core top and the plurality of windings are wound around the columns.

摘要翻译： 公开了多绕组磁结构和制造多绕组磁结构的方法。 在一个实施例中，多绕组磁结构包括由磁性材料和多个绕组构成的芯。 芯包括芯顶，芯底和多列。 芯顶具有限定芯顶的形状的外边缘。 芯顶部的中心部分具有基本上恒定的厚度，其限定了芯顶部的厚度。 芯底部在芯顶部下方，并且具有限定芯底部形状的外部边缘。 芯底部的中心部分具有确定芯底部厚度的基本恒定的厚度。 芯底部和芯顶之一的厚度从其中心部分的边缘到其外部边缘减小。 多个列从芯底延伸到芯顶，并且多个绕组围绕柱缠绕。

公开(公告)号：US08417789B1

公开(公告)日：2013-04-09

申请号：US13278319

申请日：2011-10-21

申请人： Kartik Gopalan ,  Michael Hines ,  Jian Wang

发明人： Kartik Gopalan ,  Michael Hines ,  Jian Wang

IPC分类号： G06F15/16

CPC分类号： H04L67/2842

摘要： Memory demands of large-memory applications continue to remain one step ahead of the improvements in DRAM capacities of commodity systems. Performance of such applications degrades rapidly once the system hits the physical memory limit and starts paging to the local disk. A distributed network-based virtual memory scheme is provided which treats remote memory as another level in the memory hierarchy between very fast local memory and very slow local disks. Performance over gigabit Ethernet shows significant performance gains over local disk. Large memory applications may access potentially unlimited network memory resources without requiring any application or operating system code modifications, relinkling or recompilation. A preferred embodiment employs kernel-level driver software.

摘要翻译： 大型存储器应用的存储器需求在商品系统的DRAM容量的改进方面继续保持领先一步。 一旦系统达到物理内存限制，此类应用程序的性能就会下降，并开始分页到本地磁盘。 提供了一种基于分布式网络的虚拟内存方案，将远程内存视为非常快速的本地内存和非常慢的本地磁盘之间的内存层次结构中的另一个级别。 千兆以太网上的性能显示出超过本地磁盘的性能提升。 大型内存应用程序可以访问潜在的无限的网络内存资源，而不需要任何应用程序或操作系统代码修改，重新链接或重新编译。 优选实施例使用内核级驱动程序软件。

公开(公告)号：US08415442B2

公开(公告)日：2013-04-09

申请号：US13063960

申请日：2009-10-01

申请人： Teresa P. Karjala ,  Christopher R. Eddy ,  Mehmet Demirors ,  Wallace W. Yau ,  Sarat Munjal ,  Stefan Hinrichs ,  Jian Wang ,  Otto J. Berbee ,  Werner Zschoch ,  Cornelis J. Hosman ,  Lonnie G. Hazlitt

发明人： Teresa P. Karjala ,  Christopher R. Eddy ,  Mehmet Demirors ,  Wallace W. Yau ,  Sarat Munjal ,  Stefan Hinrichs ,  Jian Wang ,  Otto J. Berbee ,  Werner Zschoch ,  Cornelis J. Hosman ,  Lonnie G. Hazlitt

IPC分类号： C08F10/02 ,  C08F2/38 ,  B01J19/24

CPC分类号： C08F10/02 ,  C08F110/02 ,  Y10S526/917 ,  C08F2/01 ,  C08F2/001 ,  C08F2/38 ,  C08F2/00 ,  C08F2500/08 ,  C08F2500/12 ,  C08F2500/20 ,  C08F2500/04

摘要： Disclosed is an ethylene-based polymer with a density from about 0.90 to about 0.94 in grams per cubic centimeter, with a molecular weight distribution (Mw/Mn) from about 2 to about 30, a melt index (I2) from about 0.1 to about 50 grams per 10 minutes, and further comprising sulfur from about 5 to about 4000 parts per million. The amount of sulfur is also determined based upon the total weight of the ethylene-based polymer. Also disclosed is process for making an ethylene-based polymer which includes the steps of splitting a process fluid for delivery into a tubular reactor; feeding an upstream process feed stream into a first reaction zone and at least one downstream process feed stream into at least one other reaction zone, where the process fluid has an average velocity of at least 10 meters per second; and initiating a free-radical polymerization reaction.

摘要翻译： 公开了密度为约0.90至约0.94（克/立方厘米）的乙烯基聚合物，分子量分布（Mw / Mn）为约2至约30，熔体指数（I 2）为约0.1至约 50克/ 10分钟，还含有约5至约4000ppm的硫。 硫的量也基于乙烯类聚合物的总重量来确定。 还公开了制备基于乙烯的聚合物的方法，其包括将工艺流体分离成管式反应器的步骤; 将上游工艺进料流输送到第一反应区和至少一个下游工艺进料流进入至少一个其它反应区，其中所述工艺流体具有至少10米/秒的平均速度; 并引发自由基聚合反应。

公开(公告)号：US08302197B2

公开(公告)日：2012-10-30

申请号：US11823731

申请日：2007-06-28

申请人： Song Huang ,  Yingnong Dang ,  Xiaohui Hou ,  Dongmei Zhang ,  Jian Wang

发明人： Song Huang ,  Yingnong Dang ,  Xiaohui Hou ,  Dongmei Zhang ,  Jian Wang

IPC分类号： G06F11/00

CPC分类号： G06F21/57

摘要： A method for identifying data related to a software security issue is provided. The method includes accessing a software security issue and determining one or more attributes associated with the software security issue. The method also includes accessing aggregated software security data retrieved from a plurality of on-line sources and searching the aggregated software security data for the attributes associated with the security issue. The method further includes associating a portion of the aggregated data with the security issue based on matching the attributes associated with the security issue with contents of the portion of the aggregated data.

摘要翻译： 提供了一种识别与软件安全问题有关的数据的方法。 该方法包括访问软件安全问题并确定与软件安全问题相关联的一个或多个属性。 该方法还包括访问从多个在线源检索的聚合软件安全数据，并搜索聚合的软件安全数据以获得与安全问题相关联的属性。 该方法还包括基于将与安全性问题相关联的属性与聚合数据的该部分的内容相匹配来将聚合数据的一部分与安全性问题相关联。

公开(公告)号：US08291034B1

公开(公告)日：2012-10-16

申请号：US13073459

申请日：2011-03-28

申请人： Kartik Gopalan ,  Michael Hines ,  Jian Wang

发明人： Kartik Gopalan ,  Michael Hines ,  Jian Wang

IPC分类号： G06F15/16

CPC分类号： H04L67/1097 ,  H04L67/2842 ,  H04L67/288

摘要： There is a constant battle to break even between continuing improvements in DRAM capacities and the growing memory demands of large-memory high-performance applications. Performance of such applications degrades quickly once the system hits the physical memory limit and starts swapping to the local disk. We present the design, implementation and evaluation of Anemone—an Adaptive Network Memory Engine—that virtualizes the collective unused memory of multiple machines across a gigabit Ethernet LAN, without requiring any modifications to the either the large memory applications or the Linux kernel. We have implemented a working prototype of Anemone and evaluated it using real-world unmodified applications such as ray-tracing and large in-memory sorting. Our results with the Anemone prototype show that unmodified single-process applications execute 2 to 3 times faster and multiple concurrent processes execute 6 to 7.7 times faster, when compared to disk based paging. The Anemone prototype reduces page-fault latencies by a factor of 19.6—from an average of 9.8 ms with disk based paging to 500 μs with Anemone. Most importantly, Anemone provides a virtualized low-latency access to potentially “unlimited” network memory resources.

摘要翻译： 即使在DRAM容量的持续改进和大内存高性能应用程序的不断增长的内存需求之间，也有不断的战斗。 一旦系统达到物理内存限制并开始交换到本地磁盘，这种应用程序的性能就会降低。 我们介绍Anemone-a自适应网络内存引擎的设计，实现和评估，它可以跨越千兆以太网LAN虚拟化多台机器的集体未使用的内存，而无需对大内存应用程序或Linux内核进行任何修改。 我们已经实施了Anemone的工作原型，并使用真实的未修改应用程序（如光线跟踪和大内存分类）对其进行了评估。 我们的结果与海葵原型显示，与基于磁盘的分页相比，未修改的单进程应用程序执行速度快2到3倍，多个并发进程的执行速度提高了6到7.7倍。 海葵原型将页面故障延迟减少了19.6倍，从平均9.8毫秒，基于磁盘的寻呼到500微秒与海葵。 最重要的是，Anemone提供虚拟化的低延迟访问可能无限的网络内存资源。

公开(公告)号：US08285745B2

公开(公告)日：2012-10-09

申请号：US11849136

申请日：2007-08-31

申请人： Hua Li ,  HuaJun Zeng ,  Jian Hu ,  Zheng Chen ,  Jian Wang

发明人： Hua Li ,  HuaJun Zeng ,  Jian Hu ,  Zheng Chen ,  Jian Wang

IPC分类号： G06F17/30

CPC分类号： G06F17/30861 ,  G06F17/30672 ,  G06Q30/02

摘要： Systems and methods to determine relevant keywords from a user's search query sessions are disclosed. The described method includes identifying search session logs of a user, segmenting the search session logs into one or more search sessions. After the segmentation, the search sessions are analyzed to compose a list of semantically relevant keyword sets including at least a first keyword set and a second keyword set. The described method further includes determining a semantic relevance between the first and second keyword sets according to the frequency at which the first and second keyword sets are reported in the query results and displaying one or more semantically high relevant keyword sets after being filtered by a threshold.

摘要翻译： 公开了从用户的搜索查询会话确定相关关键词的系统和方法。 所描述的方法包括识别用户的搜索会话日志，将搜索会话日志分割成一个或多个搜索会话。 在分割之后，分析搜索会话以构成包括至少第一关键词集合和第二关键字集合的语义相关关键字集合的列表。 所描述的方法还包括根据在查询结果中报告第一和第二关键字集合的频率来确定第一和第二关键字集合之间的语义相关性，并且在被阈值过滤之后显示一个或多个语义上相关的关键字集合 。

公开(公告)号：US08266580B2

公开(公告)日：2012-09-11

申请号：US12124400

申请日：2008-05-21

申请人： Jian Wang ,  Jun Zhu ,  Sheng Ye ,  Jing Li ,  Hai Oi Liang ,  Ying Liu ,  Ying Nan Zuo

发明人： Jian Wang ,  Jun Zhu ,  Sheng Ye ,  Jing Li ,  Hai Oi Liang ,  Ying Liu ,  Ying Nan Zuo

IPC分类号： G06F9/44

CPC分类号： G06F8/10

摘要： Provides methods for transforming a flowchart to an equivalent tree diagram, methods for transforming an equivalent tree diagram to a flowchart, methods for verifying reorganization of a flowchart, methods for editing a flowchart, methods for creating a flowchart and a flowchart editor. A flowchart includes one or more logic structures and one or more processing activities in said one or more logic structures. The method for transforming a flowchart to an equivalent tree diagram comprises: traversing said flowchart; transforming said one or more logic structures in said flowchart to one or more branching nodes in said tree diagram; and transforming one or more processing activities in said logic structures of said flowchart to one or more leaf nodes below corresponding branching nodes in said tree diagram. Further, edition of a flowchart and verification of reorganization of a flowchart are performed by utilizing an equivalent tree diagram.

摘要翻译： 提供将流程图转换为等效树图的方法，将等效树图变换为流程图的方法，用于验证流程图重组的方法，用于编辑流程图的方法，用于创建流程图的方法和流程图编辑器。 流程图包括所述一个或多个逻辑结构中的一个或多个逻辑结构和一个或多个处理活动。 将流程图变换为等效树图的方法包括：遍历所述流程图; 将所述流程图中的一个或多个逻辑结构转换成所述树形图中的一个或多个分支节点; 以及将所述流程图的所述逻辑结构中的一个或多个处理活动转换为所述树形图中的相应分支节点之下的一个或多个叶节点。 此外，通过利用等效树图来执行流程图的编辑和流程图的重组的验证。

公开(公告)号：US08250651B2

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

申请号：US11823546

申请日：2007-06-28

申请人： Song Huang ,  Yingnong Dang ,  Xiaohui Hou ,  Dongmei Zhang ,  Jian Wang

发明人： Song Huang ,  Yingnong Dang ,  Xiaohui Hou ,  Dongmei Zhang ,  Jian Wang

IPC分类号： H04L29/06

CPC分类号： G06F21/57 ,  G06F17/30864

摘要： A method for identifying a portion of aggregated software security data is described. The method includes accessing aggregated data associated with software vulnerabilities retrieved from a plurality of on-line sources. The method further includes searching a portion of the aggregated data for an exact match to a particular attribute of the data and searching the portion of the aggregated data for one or more partial matches associated with the particular attribute. The method also includes associating the portion of the data with the particular attribute based on the exact match of one or more of the partial matches.

摘要翻译： 描述了用于识别聚合的软件安全数据的一部分的方法。 该方法包括访问与从多个在线源检索的软件漏洞相关联的聚合数据。 所述方法还包括搜索所述聚合数据的一部分以与所述数据的特定属性精确匹配，并且搜索所述聚合数据的所述部分与所述特定属性相关联的一个或多个部分匹配。 该方法还包括基于一个或多个部分匹配的精确匹配将数据的该部分与特定属性相关联。