会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 外观设计
    • Cosmetic brush cleaning device
    • USD1045263S1
    • 2024-10-01
    • US29915197
    • 2023-10-26
    • Yang Xu
    • Yang Xu
    • FIG. 1 is a front, top perspective view of a first embodiment of a cosmetic brush cleaning device, showing my new design;
      FIG. 2 is a rear, bottom perspective view thereof;
      FIG. 3 is a front elevation view thereof;
      FIG. 4 is a rear elevation view thereof;
      FIG. 5 is a left side elevation view thereof;
      FIG. 6 is a right side elevation view thereof;
      FIG. 7 is a top plan view thereof;
      FIG. 8 is a bottom plan view thereof;
      FIG. 9 is a front, top perspective view of a second embodiment of the cosmetic brush cleaning device;
      FIG. 10 is a rear and bottom perspective view thereof;
      FIG. 11 is a front view thereof;
      FIG. 12 is a rear view thereof;
      FIG. 13 is a left side view thereof;
      FIG. 14 is a right side view thereof;
      FIG. 15 is a top view thereof; and,
      FIG. 16 is a bottom view thereof.
      The broken lines in the figures illustrate portions of the cosmetic brush cleaning device that form no part of the claimed design.
    • 9. 发明授权
    • Automatically matching data sets with storage components
    • 自动将数据集与存储组件进行匹配
    • US08949293B2
    • 2015-02-03
    • US12972137
    • 2010-12-17
    • Magdi A. MorsiWai Ho AuYing SunSanjeev KatariyaYang XuNina Sarawgi
    • Magdi A. MorsiWai Ho AuYing SunSanjeev KatariyaYang XuNina Sarawgi
    • G06F17/30G06F11/34
    • G06F17/30289G06F11/3442G06F11/3485
    • An administrator of an enterprise storage set may be tasked with storing a large number and variety of data sets on a large number and variety of storage components. However, the manual selection of a physical schema by an administrator may be time-consuming, may generate inefficient physical schemata, and may not be easily reevaluated as the data sets and storage set change. Presented herein are techniques for automatically determining a physical schema by comparing the storage factors of each data set (e.g., data size, relationships with other data sets, and usages of the data set by users) with the storage capabilities of the storage components, selecting a suitable storage component, and implementing the storage of the data set on the storage component. An embodiment of these techniques may thereby achieve an automated identification of a physical schema with improved efficiency and flexibility of the physical schema while conserving administrative resources.
    • 企业存储集的管理员可以负责在大量和多种存储组件上存储大量和多种数据集。 然而,由管理员手动选择物理模式可能是耗时的,可能产生低效的物理模式,并且可能不会随数据集和存储集改变而容易地重新评估。 这里提出的技术是通过将每个数据集的存储因子(例如,数据大小,与其他数据集的关系以及用户的数据集的使用)与存储组件的存储能力进行比较来自动确定物理模式,选择 合适的存储组件,以及在存储组件上实现数据集的存储。 因此,这些技术的实施例可以实现物理模式的自动识别,同时节省管理资源,同时提高物理模式的效率和灵活性。
    • 10. 发明授权
    • Using a tunable finite automaton for regular expression matching
    • 使用可调谐有限自动机进行正则表达式匹配
    • US08938454B2
    • 2015-01-20
    • US13648438
    • 2012-10-10
    • H. Jonathan ChaoYang Xu
    • H. Jonathan ChaoYang Xu
    • G06F7/00G06F17/30
    • G06F17/30985
    • Deterministic Finite Automatons (DFAs) and Nondeterministic Finite Automatons (NFAs) are two typical automatons used in the Network Intrusion Detection System (NIDS). Although they both perform regular expression matching, they have quite different performance and memory usage properties. DFAs provide fast and deterministic matching performance but suffer from the well-known state explosion problem. NFAs are compact, but their matching performance is unpredictable and with no worst case guarantee. A new automaton representation of regular expressions, called Tunable Finite Automaton (TFA), is described. TFAs resolve the DFAs' state explosion problem and the NFAs' unpredictable performance problem. Different from a DFA, which has only one active state, a TFA allows multiple concurrent active states. Thus, the total number of states required by the TFA to track the matching status is much smaller than that required by the DFA. Different from an NFA, a TFA guarantees that the number of concurrent active states is bounded by a bound factor b that can be tuned during the construction of the TFA according to the needs of the application for speed and storage. A TFA can achieve significant reductions in the number of states and memory space.
    • 确定性有限自动机(DFA)和非确定性有限自动机(NFAs)是网络入侵检测系统(NIDS)中使用的两种典型自动机。 虽然它们都执行正则表达式匹配,但它们具有非常不同的性能和内存使用属性。 DFA提供快速和确定性的匹配性能,但遭受着名的国家爆炸问题。 NFAs是紧凑的,但它们的匹配性能是不可预测的,没有最坏的情况保证。 描述了称为可调谐有限自动机(TFA)的正则表达式的新自动机表示。 TFAs解决了DFA的状态爆炸问题和NFAs不可预测的性能问题。 与仅具有一个活动状态的DFA不同,TFA允许多个并发活动状态。 因此,TFA跟踪匹配状态所需的状态总数远远小于DFA所要求的状态总数。 与NFA不同,TFA保证并行活动状态的数量受绑定因子b的约束,根据应用速度和存储的需要,可以在构建TFA期间进行调整。 TFA可以显着减少状态和记忆空间的数量。