-
公开(公告)号：US20090324576A1
公开(公告)日：2009-12-31
申请号：US12299601
申请日：2007-05-04
CPC分类号： A01N63/02 , A61K38/50 , C07K14/00 , C07K2319/00 , C07K2319/035 , C07K2319/33 , C12N1/20 , C12N9/2462 , C12N9/78
摘要： The present invention provides methods and compositions to reduce growth of microbial colonies, including infections, and includes therapeutic compositions, methods for treatment of infections, and methods for identifying additional such compositions.
摘要翻译： 本发明提供了减少微生物菌落生长的方法和组合物，包括感染，并且包括治疗组合物，用于治疗感染的方法以及用于鉴定另外的这种组合物的方法。
-
42.发明授权公开(公告)号：US07469249B2
公开(公告)日：2008-12-23
申请号：US10795534
申请日：2004-03-08
IPC分类号： G06F17/00
CPC分类号： G06F17/30932 , Y10S707/99931 , Y10S707/99943 , Y10S707/99945 , Y10S707/99953
摘要： Techniques are provided for automatically rewriting a relational-to-hierarchical mapping into one or more modified mappings. In this way, clients that prefer or require different portions of the mapping-defined data are supported. For example, in one aspect of the invention, a technique for modifying a relational-to-hierarchical mapping in accordance with at least one user query includes the following steps/operations. At least one query associated with a query language that supports a hierarchical data structure is obtained. Further, at least one relational-to-hierarchical mapping for use in translating data associated with a relational data structure into data associated with the hierarchical data structure is obtained. Then, the at least one relational-to-hierarchical mapping is modified based on the at least one query such that data specifically relevant to the at least one query may be generated in accordance with the modified relational-to-hierarchical mapping.
摘要翻译： 提供了用于将关系到分层映射自动重写成一个或多个修改的映射的技术。 以这种方式，支持偏好或需要映射定义数据的不同部分的客户端。 例如，在本发明的一个方面，根据至少一个用户查询修改关系到分层映射的技术包括以下步骤/操作。 获得与支持分层数据结构的查询语言相关联的至少一个查询。 此外，获得用于将与关系数据结构相关联的数据转换成与分层数据结构相关联的数据的至少一个关系到分层映射。 然后，基于至少一个查询来修改至少一个关系到分层映射，使得可以根据修改的关系到分层映射生成与至少一个查询特别相关的数据。
-
公开(公告)号：US07269729B2
公开(公告)日：2007-09-11
申请号：US10036196
申请日：2001-12-28
申请人： Jingmin He , Sriram Padmanabhan , Min Wang
发明人： Jingmin He , Sriram Padmanabhan , Min Wang
CPC分类号： G06F17/30595 , H04L9/0825 , H04L9/0894
摘要： Disclosed is a method of internally encrypting data in a relational database, comprising the steps of providing a security dictionary comprising one or more security catalogs, receiving data from a user associating said data with a database column and at least one authorized user, generating a working encryption key, internally encrypting said working encryption key using a public key from an authorized user, storing said encrypted working key in a security catalog, and using said working key to internally encrypt said data.
摘要翻译： 公开了一种在关系数据库中内部加密数据的方法，包括以下步骤：提供包括一个或多个安全目录的安全词典，从用户接收数据，将所述数据与数据库列和至少一个授权用户相关联，生成工作 加密密钥，使用来自授权用户的公钥对所述工作加密密钥进行内部加密，将所述加密的工作密钥存储在安全目录中，并使用所述工作密钥对所述数据进行内部加密。
-
公开(公告)号：US20070143321A1
公开(公告)日：2007-06-21
申请号：US11303432
申请日：2005-12-16
IPC分类号： G06F7/00
CPC分类号： G06F16/86
摘要： A system and method of converting a recursive XML document into a relational schema comprises providing a recursive XML document; parsing an external mapping script specifying a mapping from the recursive XML document to a relational table format; building a recursive shredding tree based on the external mapping script and the relational table format; and shredding the mapped recursive XML document into a relational table. The system and method further comprise detecting whether any of a XML schema and a DTD document is recursive, wherein the detecting comprises building a directed graph comprising element names; corresponding elements names as nodes in the directed graph; forming arcs from every element parent node to every element child node of the element parent node; and checking for cycles in the directed graph. The system and method further comprise identifying all recursive cursor nodes and a recursive degree corresponding to the recursive shredding tree.
摘要翻译： 将递归XML文档转换为关系模式的系统和方法包括提供递归XML文档; 解析指定从递归XML文档到关系表格式的映射的外部映射脚本; 基于外部映射脚本和关系表格式构建递归切割树; 并将映射的递归XML文档切割成关系表。 所述系统和方法还包括检测XML模式和DTD文档中的任何一个是递归的，其中所述检测包括构建包括元素名称的有向图; 相应的元素名称作为有向图中的节点; 从每个元素父节点到元素父节点的每个元素子节点形成弧; 并检查有向图中的周期。 该系统和方法还包括识别所有递归光标节点和对应于递归粉碎树的递归度。
-
45.发明申请Learning-based method for estimating cost and statistics of complex operators in continuous queries 审中-公开用于估计连续查询中复杂运算符的成本和统计的基于学习的方法公开(公告)号：US20060100969A1
公开(公告)日：2006-05-11
申请号：US10984323
申请日：2004-11-08
申请人： Min Wang , Sriram Padmanabhan , Like Gao
发明人： Min Wang , Sriram Padmanabhan , Like Gao
IPC分类号： G06F17/00
CPC分类号： G06Q30/0283 , G06F16/24542 , G06F16/24568
摘要： A learning-based method for estimating costs or statistics of an operator in a continuous query includes a cost estimation model learning procedure and a model applying procedure. The model learning procedure builds a cost estimation model from training data, and the applying procedure uses the model to estimate the cost associated with a given query. The learning procedure uses a feature extractor and a cost estimator. The feature extractor collects relevant training data and obtains feature values. The extracted feature values are associated with costs and used to create the cost estimator. When applying the cost estimator to a continuous stream of data, the feature extractor extracts feature values from the data stream and uses the extracted feature values as inputs into the cost estimator to obtain the desired cost values.
摘要翻译： 用于估计连续查询中的运营商的成本或统计的基于学习的方法包括成本估计模型学习过程和模型应用程序。 模型学习过程从培训数据建立成本估算模型，应用程序使用模型来估计与给定查询相关联的成本。 学习过程使用特征提取器和成本估算器。 特征提取器收集相关的训练数据并获取特征值。 提取的特征值与成本相关联，并用于创建成本估计。 当将成本估计器应用于连续数据流时，特征提取器从数据流中提取特征值，并将所提取的特征值作为输入到成本估计器中以获得期望的成本值。
-
公开(公告)号：US20050226851A1
公开(公告)日：2005-10-13
申请号：US11053982
申请日：2005-02-08
IPC分类号： C12N15/09 , A61K9/19 , A61K35/76 , A61P31/04 , C12N1/21 , C12N7/00 , C12N7/01 , C12N7/04 , A61K45/00
CPC分类号： C12N7/00 , A61K35/76 , C12N2795/10111 , C12N2795/10132 , C12N2795/10161 , Y02A50/475
摘要： The present invention features therapeutic bacteriophage deficient in the lysin protein (“Lys minus” phage). Lys minus bacteriophage are incapable of facilitating efficient lysis of the bacterial host since the enzymatic activity of the lysin of the phage is needed for breaking down the peptidoglycan layer of the bacterial cell wall. Lys minus bacteriophage retain activity in invasion of its appropriate bacterial host, destruction of the bacterial genome, and replication, which are sufficient to inhibit bacterial growth and replication. Therefore, the therapeutic Lys minus phage stops the spread of infection by the bacterial pathogen without lysis of the bacterium. This approach is attractive as it also prevents the release of the phage progeny, thus reducing or eliminating the potential for generation of immune responses against the phage. The incapacitated bacterial pathogen is then removed by the normal defense systems such as phagocytes and macrophages.
摘要翻译： 本发明的特征在于溶酶蛋白（“Lys减”噬菌体）中缺乏的治疗性噬菌体。 Lys minus噬菌体不能促进细菌宿主的有效溶解，因为需要噬菌体溶素的酶活性来分解细菌细胞壁的肽聚糖层。 Lys减去噬菌体在其适当的细菌宿主的侵入中保留活性，破坏细菌基因组和复制，其足以抑制细菌生长和复制。 因此，治疗性Lys-噬菌体阻止了细菌病原体感染的扩散，而不会破坏细菌。 这种方法是有吸引力的，因为它也可以防止噬菌体后代的释放，从而减少或消除针对噬菌体产生免疫应答的可能性。 然后通过正常的防御系统如吞噬细胞和巨噬细胞去除失能的细菌病原体。
-
47.发明申请Method, computer program product, and system of optimized data translation from relational data storage to hierarchical structure 失效方法，计算机程序产品和从关系数据存储到分层结构的优化数据转换系统公开(公告)号：US20050138073A1
公开(公告)日：2005-06-23
申请号：US10744424
申请日：2003-12-22
CPC分类号： G06F17/30595 , Y10S707/99934 , Y10S707/99945 , Y10S707/99948
摘要： A tagging tree that defines a hierarchical output data structure and relational database query operations that retrieve the data to be included in each hierarchical section is accepted and processed. A query optimizer analyzes the tagging tree to determine database query operations that can be combined into a single query command. An outer-union query command is generated to allow efficient combination of multiple query commands, some of which are predicates to others. The tagging tree is modified to replace the database queries that were combined into the outer-union query to extract data from the results set produced by the outer-union query as opposed to submitting queries to the database manager. The optimized queries can be reused an arbitrary number of times to leverage the optimizing resources that were used in their creation.
摘要翻译： 定义分层输出数据结构的标记树和检索要包含在每个分层部分中的数据的关系数据库查询操作被接受和处理。 查询优化器分析标记树以确定可以组合成单个查询命令的数据库查询操作。 生成一个外联合查询命令，以允许多个查询命令的有效组合，其中一些查询命令是其他命令的谓词。 标记树被修改为将组合到外联合查询中的数据库查询替换为从外联合查询生成的结果集中提取数据，而不是向数据库管理器提交查询。 优化的查询可以重复使用任意次数，以利用其创建中使用的优化资源。
-
48.发明申请Method, system and recording medium for maintaining the order of nodes in a heirarchical document 有权方法，系统和记录介质，用于维护阴性文件中节点的顺序公开(公告)号：US20050028091A1
公开(公告)日：2005-02-03
申请号：US10629744
申请日：2003-07-30
申请人： Rajesh Bordawekar , Yi Chen , George Mihaila , Sriram Padmanabhan
发明人： Rajesh Bordawekar , Yi Chen , George Mihaila , Sriram Padmanabhan
CPC分类号： G06Q10/10 , Y10S707/99942
摘要： A method, a system and recording medium for maintaining the order of nodes in a hierarchical document. The method may select the maximum and the minimum number of children for each node, build an auxiliary ordered tree having at least as many leaves as atoms within the hierarchical document based upon the selected maximum and minimum number of children for each node, attach the atoms to the leaves of the auxiliary ordered tree, and label each of the nodes in the auxiliary ordered tree.
摘要翻译： 一种用于维护分级文档中节点顺序的方法，系统和记录介质。 该方法可以基于每个节点的所选择的最大和最小子数，来选择每个节点的最大和最小子数，构建具有至少与分层文档中的原子一样多的叶的辅助有序树，附加原子 到辅助有序树的叶子，并标记辅助有序树中的每个节点。
-
49.发明授权Parallel processing of ETL jobs involving extensible markup language documents 有权并行处理涉及可扩展标记语言文档的ETL作业公开(公告)号：US09064047B2
公开(公告)日：2015-06-23
申请号：US12566255
申请日：2009-09-24
申请人： Manoj K. Agarwal , Manish A. Bhide , Srilakshmi Kotwal , Srinivas Kiran Mittapalli , Sriram Padmanabhan
发明人： Manoj K. Agarwal , Manish A. Bhide , Srilakshmi Kotwal , Srinivas Kiran Mittapalli , Sriram Padmanabhan
CPC分类号： G06F11/3604 , G06F17/30917
摘要： Techniques for running an Extract Transform Load (ETL) job in parallel on one or more processors wherein the ETL job comprises use of an extensible markup language (XML) document are provided. The techniques include receiving an XML document input, identifying a node in the XML document at which partitioning of the XML document is to begin, sending partition information to each respective processor, performing a shallow parsing of the XML document in parallel on the one or more processors, wherein each processor performs shallow parsing using the identified partition node until it reaches its identified partition, using the shallow parsing to generate the partition of the input XML document, wherein each processor generates a different partition of the same XML document, and sending each partition in streaming format to an ETL job instance.
摘要翻译： 提供了在一个或多个处理器上并行运行提取变换加载（ETL）作业的技术，其中ETL作业包括使用可扩展标记语言（XML）文档。 这些技术包括接收XML文档输入，识别XML文档中开始分割XML文档的节点，向每个相应处理器发送分区信息，在一个或多个文件上并行执行XML文档的浅析解 处理器，其中每个处理器使用所识别的分区节点执行浅解析，直到其到达其识别的分区，使用浅解析来生成输入XML文档的分区，其中每个处理器生成相同XML文档的不同分区，并且发送每个 以流格式分区到ETL作业实例。
-
公开(公告)号：US09002131B2
公开(公告)日：2015-04-07
申请号：US14131979
申请日：2012-09-11
CPC分类号： G06T5/002 , G06T5/003 , G06T5/008 , G06T5/20 , G06T2207/20012 , G06T2207/20032 , G06T2207/20192
摘要： The present disclosure relates to image filtering techniques for enhancing image quality. In one embodiment, two filtering techniques are applied on an image. Firstly, an adaptive weighted median filtering operation is performed on an acquired low contrast image corrupted by impulsive noise. Subsequently, a guided image filtering on the image obtained from adaptive weighted median filtering operation to de-blur and enhance the contrast that ultimately assures to preserve the edges of the images. In addition, the image filtering for enhancing image quality is enhanced by several variations of data adaptive guided image filtering and adaptive window sizes for guided image filtering techniques.
摘要翻译： 本公开涉及用于增强图像质量的图像滤波技术。 在一个实施例中，在图像上应用两种滤波技术。 首先，对由脉冲噪声损坏的获取的低对比度图像执行自适应加权中值滤波操作。 随后，对从自适应加权中值滤波操作获得的图像上的引导图像滤波进行去模糊并增强最终确保保留图像边缘的对比度。 此外，用于增强图像质量的图像滤波通过用于引导图像滤波技术的数据自适应引导图像滤波和自适应窗口尺寸的几种变化而增强。
-
-
-
-
-
-
-
-
-
搜索结果
62 条记录 (耗时 0.029 秒)
