会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 62. 发明申请
    • EFFICIENT METHOD OF REPLICATE MEMORY DATA WITH VIRTUAL PORT SOLUTION
    • 使用虚拟端口解决方案更新记忆数据的有效方法
    • US20120051131A1
    • 2012-03-01
    • US12871450
    • 2010-08-30
    • Zhen LiuUma DurairajanKenway Tam
    • Zhen LiuUma DurairajanKenway Tam
    • G11C16/04
    • G11C11/413G11C7/06G11C7/1075G11C8/16
    • A hardware arrangement for a memory bitcell, including a primary decoder for decoding a common memory address portion among a plurality of memory addresses, and a plurality of secondary decoders each for decoding an uncommon memory address portion of each of the plurality of memory addresses. The memory bitcell is configured to receive the decoded common memory address portion and output data from a memory entry corresponding to the decoded common memory address portion, and includes a single read port for outputting the data. The hardware arrangement includes a modified sense amplifier (SA) configured to receive the data output on the single read port, and directly receive the plurality of decoded uncommon memory address portions. The plurality of decoded uncommon memory address portions is used to determine whether to enable the modified SA. Data output from the memory bitcell is forwarded when the modified SA is enabled.
    • 一种用于存储位单元的硬件装置,包括用于解码多个存储器地址中的公共存储器地址部分的主解码器,以及多个辅助解码器,每个副解码器用于解码多个存储器地址中的每一个的不常见的存储器地址部分。 存储位单元被配置为接收解码的公共存储器地址部分,并且从与解码的公共存储器地址部分相对应的存储器条目输出数据,并且包括用于输出数据的单个读取端口。 硬件装置包括被配置为接收单个读取端口上的数据输出的修改读出放大器(SA),并且直接接收多个经解码的非常见存储器地址部分。 多个解码的不常用存储器地址部分用于确定是否启用修改的SA。 当修改的SA被使能时,来自存储器位单元的数据输出被转发。
    • 63. 发明申请
    • CONDUCTIVE SLURRY FOR SOLAR BATTERY AND PREPARATION METHOD THEREOF
    • 太阳能电池的导电浆料及其制备方法
    • US20120032120A1
    • 2012-02-09
    • US13263959
    • 2010-05-08
    • Weihua TanZhen Liu
    • Weihua TanZhen Liu
    • H01B1/22
    • H01L31/022425H01B1/22Y02E10/50
    • The present invention discloses a conductive shiny for a solar battery comprising a first-order aluminum powder having a median diameter D50 of about 2-8 um, a second-order powder having a median diameter D50 of about 20-100 nm, a glass powder, and an organic carrier. The conductive slurry may be stable on a screen without leakage through screen, and there are no agglomeration and sedimentation during long-time storage. The present invention further discloses a method of preparing a conductive slurry for a solar battery, comprising steps of mixing a first-order aluminum powder, a second-order powder, a glass powder, and an organic carrier to obtain a mixture; and then ball milling the mixture to obtain the conductive slurry. The method may be simple and easy to realize, so that it's advantageous for mass production in the industry.
    • 本发明公开了一种太阳能电池的导电光泽,其包括中等直径D50为约2-8μm的一级铝粉末,中值粒径D50为约20-100nm的二阶粉末,玻璃粉末 ,和有机载体。 导电浆料可以在屏幕上稳定而不会通过筛网渗漏,并且在长时间储存​​期间不存在附聚和沉淀。 本发明还公开了一种制备太阳能电池用导电浆料的方法,包括以下步骤:将一级铝粉末,二级粉末,玻璃粉末和有机载体混合,得到混合物; 然后对混合物进行球磨以获得导电浆料。 该方法可以简单且易于实现,因此有利于工业中的批量生产。
    • 65. 发明授权
    • Distributed joint admission control and dynamic resource allocation in stream processing networks
    • 流处理网络中的分布式联合准入控制和动态资源分配
    • US07924718B2
    • 2011-04-12
    • US12535805
    • 2009-08-05
    • Hanhua FengZhen LiuHonghui XiaLi Zhang
    • Hanhua FengZhen LiuHonghui XiaLi Zhang
    • G01R31/08
    • G06F9/5066G06F9/5038
    • Methods and apparatus operating in a stream processing network perform load shedding and dynamic resource allocation so as to meet a pre-determined utility criterion. Load shedding is envisioned as an admission control problem encompassing source nodes admitting workflows into the stream processing network. A primal-dual approach is used to decompose the admission control and resource allocation problems. The admission control operates as a push-and-pull process with sources pushing workflows into the stream processing network and sinks pulling processed workflows from the network. A virtual queue is maintained at each node to account for both queue backlogs and credits from sinks. Nodes of the stream processing network maintain shadow prices for each of the workflows and share congestion information with neighbor nodes. At each node, resources are devoted to the workflow with the maximum product of downstream pressure and processing rate, where the downstream pressure is defined as the backlog difference between neighbor nodes. The primal-dual controller iteratively adjusts the admission rates and resource allocation using local congestion feedback. The iterative controlling procedure further uses an interior-point method to improve the speed of convergence towards optimal admission and allocation decisions.
    • 在流处理网络中操作的方法和装置执行卸载和动态资源分配,以满足预定的效用标准。 负载脱落被设想为包括允许流程处理网络中的工作流的源节点的准入控制问题。 使用原始双重方法来分解入学控制和资源分配问题。 准入控制作为推拉过程进行操作,其中源将工作流推送到流处理网络并且从网络中吸收经处理的工作流。 每个节点都维护一个虚拟队列,以解决队列积压和来自宿的积分。 流处理网络的节点维护每个工作流的影子价格,并与邻居节点共享拥塞信息。 在每个节点,资源用于工作流程,具有下游压力和处理速率的最大乘积,其中下游压力被定义为相邻节点之间的积压差异。 原始双控制器使用局部拥塞反馈迭代地调整入局速率和资源分配。 迭代控制程序进一步使用内点方法来提高收敛速度以达到最佳准入和分配决策。
    • 66. 发明授权
    • Method for declarative semantic expression of user intent to enable goal-driven stream processing
    • 声明性语义表达用户意图的方法,以实现目标驱动的流处理
    • US07899861B2
    • 2011-03-01
    • US11695430
    • 2007-04-02
    • Mark D. FeblowitzZhen LiuAnand RanganathanAnton V. Riabov
    • Mark D. FeblowitzZhen LiuAnand RanganathanAnton V. Riabov
    • G06F15/16
    • G06F8/34
    • A method for constructing a stream processing requests so that a stream processing application satisfying the stream processing request can be assembled, includes: inputting a stream processing request, wherein the stream processing request includes a goal that is represented by a graph pattern that semantically describes a desired stream processing outcome; and assembling a stream processing graph, wherein the stream processing graph is assembled to include at least one processing element that satisfies the desired processing outcome by associating the graph pattern that semantically describes the desired processing outcome with a graph pattern that semantically describes an input of the at least one processing element and a graph pattern that semantically describes an output of the at least one processing element, or to include at least one data source by associating the graph pattern that semantically describes the desired processing outcome with a graph pattern that semantically describes an output of the at least one data source.
    • 一种用于构建流处理请求的方法,使得可以组合满足流处理请求的流处理应用,包括:输入流处理请求,其中流处理请求包括由语义上描述 所需流处理结果; 并且组装流处理图,其中流处理图被组合以包括通过将语义上描述期望的处理结果的图形模式与语义上描述所需处理结果的输入的图形模式相关联来满足期望的处理结果的至少一个处理元件 至少一个处理元件和图形图案,其语义地描述所述至少一个处理元件的输出,或者通过将语义上描述所需处理结果的图形模式与语义上描述所述处理结果的图形模式相关联来包括至少一个数据源 输出至少一个数据源。
    • 67. 发明授权
    • Method and system for federated resource discovery service in distributed systems
    • 分布式系统中联合资源发现服务的方法和系统
    • US07849069B2
    • 2010-12-07
    • US11471981
    • 2006-06-21
    • Zhen LiuHao YangFan Ye
    • Zhen LiuHao YangFan Ye
    • G06F17/30
    • G06F17/30545
    • Resources disposed within a plurality of distributed and autonomous computing systems, each of which may have its own legacy resource discovery service, are identified and allocated. Resource identification servers disposed within each one of the distributed computing systems communicate resource attribute data to a tree hierarchy of dedicated servers. The resource attribute data are maintained in native formats within the distributed computing systems and are mapped to a common format provided by the dedicated servers. The resource attribute data are aggregated at each node within the tree hierarchy, communicated up through the tree hierarchy to one or more root nodes and replicated down through all of the nodes. Additional system robustness is provided through period resource checks and resource attribute data updates. Resource allocation queries are submitted to any level node within the hierarchy and forwarded to the proper computing system for processing.
    • 分配在多个分布式和自主的计算系统中的资源,每个计算系统中的每一个可以具有其自己的传统资源发现服务。 布置在每个分布式计算系统内的资源识别服务器将资源属性数据传送到专用服务器的树层。 资源属性数据以分布式计算系统内的本机格式进行维护,并映射到由专用服务器提供的通用格式。 资源属性数据在树层次结构中的每个节点进行聚合,通过树层次结构传递到一个或多个根节点,并通过所有节点进行复制。 通过周期资源检查和资源属性数据更新来提供额外的系统稳健性。 资源分配查询被提交到层次结构中的任何级节点,并转发到正确的计算系统进行处理。