会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Partial recall of deduplicated files
    • 部分召回重复数据删除的文件
    • US08645335B2
    • 2014-02-04
    • US12970848
    • 2010-12-16
    • Abhishek GuptaRan KalachChun Ho CheungJames Robert BentonJoerg-Thomas Pfenning
    • Abhishek GuptaRan KalachChun Ho CheungJames Robert BentonJoerg-Thomas Pfenning
    • G06F7/00G06F17/00
    • G06F17/30156
    • The subject disclosure is directed towards changing a file from a fully deduplicated state to a partially deduplicated state in which some of the file data is deduplicated in a chunk store, and some is recalled into the file, that is, in the file's storage volume. A partial recall mechanism such as in a file system filter tracks (e.g., via a bitmap in a file reparse point) whether file data is maintained in the chunk store or has been recalled to the file. Data is recalled from the chunk store as needed, and committed (e.g., flushed) to the file. Also described is efficiently returning the file to a fully deduplicated state by using the tracking information to determine which parts of the file are already deduplicated into the chunk store so as to avoid their further deduplication processing.
    • 主题公开涉及将文件从完全重复数据删除的状态改变为部分重复数据删除的状态,其中一些文件数据在块存储中被重复数据删除,并且一些文件被调回到该文件中,即在该文件的存储卷中。 诸如在文件系统过滤器中的部分恢复机制跟踪(例如,通过文件重分析点中的位图)文件数据是否被保存在块存储器中或已被调用到文件中。 根据需要从块存储器中调用数据,并将其提交(例如,刷新)到文件中。 还描述了通过使用跟踪信息来确定文件的哪些部分已被重复数据删除到块存储器中以有效地将文件返回到完全重复数据删除的状态,以避免其进一步的重复数据消除处理。
    • 3. 发明授权
    • Geographic reminders
    • 地理提醒
    • US08537003B2
    • 2013-09-17
    • US12468874
    • 2009-05-20
    • Vassilii KhachaturovLev NovikMoe Khosravy
    • Vassilii KhachaturovLev NovikMoe Khosravy
    • G08B3/00G08B21/00
    • G08B21/24G06Q10/109
    • Described is a technology by which a mobile device outputs an alert for a reminder based upon a current location of the mobile device with respect to an entity (person, place or thing) associated with the reminder. The reminders may be maintained and provided by a service. Each reminder includes a reference to target-related information. When the device moves to within a threshold proximity of the target, and other criteria (e.g., time of day) is satisfied, an alert is output by the device. A user may gesture with a device towards an entity to set a reminder associated with that entity, or to get any reminder associated with that entity. A device may also get reminders by scanning or image processing, e.g., by reading a barcode associated with a product to get any reminders associated with that product.
    • 描述了一种移动设备基于移动设备相对于与提醒相关联的实体(个人,地点或事物)的当前位置输出用于提醒的警报的技术。 提醒可以由服务维护和提供。 每个提醒包括对目标相关信息的引用。 当设备移动到目标的阈值接近度内时,并且满足其他标准(例如,时间),则设备输出警报。 用户可以使用设备向实体手势来设置与该实体相关联的提醒,或者获得与该实体相关联的任何提醒。 设备还可以通过扫描或图像处理来获得提醒,例如通过读取与产品相关联的条形码来获得与该产品相关联的任何提醒。
    • 4. 发明授权
    • Segmenting sequential data with a finite state machine
    • 用有限状态机分段顺序数据
    • US08489537B2
    • 2013-07-16
    • US12359344
    • 2009-01-26
    • Jie SuMin ChuWenli ZhuJian Wang
    • Jie SuMin ChuWenli ZhuJian Wang
    • G06F17/00G06N5/02
    • 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.
    • 描述了一种技术,其中基于有限状态机的方法将原始顺序数据分段成高级单元。 具有相似子序列的段被视为相同的单元。 一般来说,有限状态机识别具有类似树状微结构的序列数据中的子序列。 一个描述的有限状态机通过在输入是对应于非叶节点的路径命令时输入路径状态来操作; 状态机保持在路径状态,直到另一个命令包括与叶节点相对应的动作命令,由此其输出动作单元,或者直到另一个命令包括不是父节点的路径命令或下一个命令的兄弟节点, 由此输出浏览单元。 还描述了聚合相同单元的子序列以产生对应于该单元的访问结构。
    • 5. 发明授权
    • Extensible job submission
    • 可扩展的工作提交
    • US08381214B2
    • 2013-02-19
    • US11789386
    • 2007-04-23
    • Marvin Michael TheimerChristopher Andrew Norman Smith
    • Marvin Michael TheimerChristopher Andrew Norman Smith
    • G06F9/46
    • G06F9/5027G06F9/5072G06F2209/5013G06F2209/5014
    • Briefly, aspects of the subject matter described herein relate to job submission. In aspects, a client (which itself may be a scheduler) sends a request to a scheduler to execute a job. The client may indicate which extensions to a base job submission protocol the client supports. The scheduler may implement a base case protocol and may also implement extensions to the base case. The client and scheduler may communicate information and requests about a job based on extensions both support, if any. The scheduler maintains state information about executing jobs that may include substate information without affecting interoperability with clients that do not recognize substates. A job may be in multiple substates at the same time.
    • 简言之,本文描述的主题的方面涉及作业提交。 在方面,客户端(其本身可以是调度器)向调度器发送请求以执行作业。 客户端可以指出客户端支持的基本作业提交协议的哪些扩展。 调度器可以实现基本情况协议并且还可以实现对基本情况的扩展。 客户端和调度器可以基于扩展支持(如果有的话)传送关于作业的信息和请求。 调度程序维护关于执行可能包括子状态信息的作业的状态信息,而不会影响与不识别子状态的客户端的互操作性。 同时可以在多个子状态中进行作业。
    • 6. 发明授权
    • Self-inflating weapons case
    • 自充气武器箱
    • US08342324B2
    • 2013-01-01
    • US12764487
    • 2010-04-21
    • Rod Debias
    • Rod Debias
    • B65D85/00B65D81/02
    • F41C33/0209F41C33/06
    • The different advantageous embodiments provide an apparatus comprising an inflatable portion, a nozzle, and a non-inflatable portion. The inflatable portion has an interior housing and an inflating system. The inflating system is disposed between a number of layers of material. An interior layer of material from the number of layers of material comprises the interior housing. The number of layers of material are flexible and impervious to penetration by air and moisture. The nozzle is connected to the inflatable portion and configured to control fluid flow to and from the inflating system. The non-inflatable portion is connected to an end of the inflatable portion and has a sealing system configured to seal the interior housing of the inflatable portion.
    • 不同的有利实施例提供了一种包括可充气部分,喷嘴和不可充气部分的装置。 充气部分具有内部壳体和充气系统。 充气系统设置在多层材料之间。 来自材料层数的材料的内层包括内部壳体。 材料层的数量是柔性的,并且不透空气和湿气渗透。 喷嘴连接到可膨胀部分并且构造成控制流入和流出膨胀系统的流体。 不可充气部分连接到可充气部分的一端,并且具有密封系统,该密封系统构造成密封可膨胀部分的内部壳体。
    • 7. 发明授权
    • Clustering videos by location
    • 按位置分组视频
    • US08184913B2
    • 2012-05-22
    • US12416152
    • 2009-04-01
    • Simon J. BakerCharles Lawrence Zitnick, IIIGerhard Florian Schroff
    • Simon J. BakerCharles Lawrence Zitnick, IIIGerhard Florian Schroff
    • G06K9/68
    • G06K9/00718G06F17/30781G06F17/3082G06K9/6219Y02D10/45
    • Described is a technology in which video shots are clustered based upon the location at which the shots were captured. A global energy function is optimized, including a first term that computes clusters so as to be reasonably dense and well connected, to match the possible shots that are captured at a location, e.g., based on similarity scores between pairs of shots. A second term is a temporal prior that encourages subsequent shots to be placed in the same cluster. The shots may be represented as nodes of a minimum spanning tree having edges with weights that are based on the similarity score between the shots represented by their respective nodes. Agglomerative clustering is performed by selecting pairs of available clusters, merging the pairs and keeping the pair with the lowest cost. Clusters are iteratively merged until a stopping criterion or criteria is met (e.g., only a single cluster remains).
    • 描述了一种基于拍摄拍摄位置来进行视频拍摄的技术。 优化了全局能量函数,包括计算集群以便相当密集和良好连接的第一项,以匹配在某个位置捕获的可能的拍摄,例如,基于拍摄对之间的相似性得分。 第二个术语是时间先前,鼓励后续的镜头被放置在同一个集群中。 拍摄可以被表示为具有基于由它们各自的节点表示的拍摄之间的相似性得分的权重的边缘的最小生成树的节点。 通过选择成对的可用集群,合并对并保持成本最低的组合来执行集群聚类。 集群被迭代合并,直到满足停止标准或条件(例如,仅剩下一个集群)。
    • 9. 发明授权
    • Deep-structured conditional random fields for sequential labeling and classification
    • 用于连续标签和分类的深层结构条件随机字段
    • US08473430B2
    • 2013-06-25
    • US12696051
    • 2010-01-29
    • Dong YuLi DengShizhen Wang
    • Dong YuLi DengShizhen Wang
    • G06F15/18
    • G06F15/18G06N5/02
    • Described is a technology by which a deep-structured (multiple layered) conditional random field model is trained and used for classification of sequential data. Sequential data is processed at each layer, from the lowest layer to a final (highest) layer, to output data in the form of conditional probabilities of classes given the sequential input data. Each higher layer inputs the conditional probability data and the sequential data jointly to output further probability data, and so forth, until the final layer which outputs the classification data. Also described is layer-by-layer training, supervised or unsupervised. Unsupervised training may process raw features to minimize average frame-level conditional entropy while maximizing state occupation entropy, or to minimize reconstruction error. Also described is a technique for back-propagation of error information of the final layer to iteratively fine tune the parameters of the lower layers, and joint training, including joint training via subgroups of layers.
    • 描述了一种深层结构(多层)条件随机场模型被训练并用于顺序数据分类的技术。 在从最低层到最终(最高)层的每个层处理顺序数据,以给定顺序输入数据的类的条件概率的形式输出数据。 每个较高层输入条件概率数据和顺序数据,共同输出进一步的概率数据,等等,直到输出分类数据的最后一层。 还描述了逐层培训,监督或无监督。 无监督训练可以处理原始特征以最小化平均帧级条件熵,同时最大化状态占用熵,或最小化重建误差。 还描述了用于反向传播最终层的误差信息的技术,以迭代地微调下层的参数,以及联合训练,包括通过子层的联合训练。
    • 10. 发明授权
    • Program analysis as constraint solving
    • 程序分析作为约束求解
    • US08402439B2
    • 2013-03-19
    • US12147908
    • 2008-06-27
    • Sumit GulwaniSaurabh SrivastavaRamarathnam Venkatesan
    • Sumit GulwaniSaurabh SrivastavaRamarathnam Venkatesan
    • G06F9/44
    • G06F8/49
    • Described is a technology by which program analysis uses rich invariant templates that may specify an arbitrary Boolean combination of linear inequalities for program verification. Also described is choosing a cut-set that identifies program locations, each of which is associated with an invariant template. The verification generates second-order constraints, converts second-order logic formula based on those constraints into first-order logic formula, then converts the first-order logic formula into a quantifier-free formula, which is then converted into a Boolean satisfiability formula. Off-the-shelf constraint solvers may then be applied to the Boolean satisfiability formula to generate program analysis results. Various templates may be used to convert the second-order logic formula into the first-order logic formula. Further described are interprocedural analysis and the determination of weakest precondition and strongest postcondition with applications to termination analysis, timing bounds analysis, and generation of most-general counterexamples for both termination and safety properties.
    • 描述了一种技术,程序分析使用丰富的不变模板,可以为程序验证指定线性不等式的任意布尔组合。 还描述了选择一个标识程序位置的剪辑,每个程序位置与不变模板相关联。 验证产生二阶约束,将基于这些约束的二阶逻辑公式转换为一阶逻辑公式,然后将一阶逻辑公式转换为无量词的公式,然后将其转换为布尔可满足公式。 现在可以将现成的约束求解器应用于布尔可满足公式以生成程序分析结果。 可以使用各种模板来将二阶逻辑公式转换成一阶逻辑公式。 进一步描述的是过程间分析以及最弱前提条件和最强后置条件的确定,适用于终止分析,时序界限分析,以及针对终端和安全属性生成大多数一般的反例。