DYNAMICALLY OPTIMIZED INQUIRY PROCESS FOR INTELLIGENT HEALTH PRE-DIAGNOSIS

    公开(公告)号:US20200152338A1

    公开(公告)日:2020-05-14

    申请号:US16190691

    申请日:2018-11-14

    Abstract: A system is provided for facilitating medical conversation. The system includes a user interface, having a Natural Language Processing (NLP) system and an Automatic Speech Recognition (ASR) system, for processing user utterances to extract symptoms, attribute types and attribute values from a user. The system further includes a memory for storing program code. The system also includes a processor for running the program code to transform the symptoms, the attribute types, and the attribute values into a graph and extract relative entities and relationships of the relative entities from the graph. The processor further runs the program code to calculate an Inquiry Efficiency Index (IEI) of each candidate inquiry path based on the relative entities and the relationships of the relative entities. The processor additionally runs the program code to calculate a recommended inquiry path from among the candidate inquiry paths based on the IEI of each candidate inquiry path.

    Conversational Problem Determination based on Bipartite Graph

    公开(公告)号:US20190188067A1

    公开(公告)日:2019-06-20

    申请号:US15844434

    申请日:2017-12-15

    CPC classification number: G06F11/079 G06F11/0709 G06F11/0751 G06F11/0775

    Abstract: A cognitive conversation system that generates effective diagnostic questions is provided. The cognitive conversation system receives a set of currently known symptoms (or currently available answers to diagnostic questions) of a reported problem or fault. The system identifies (i) a set of possible root causes of the reported problem based on the currently known symptoms and (ii) probabilities for the set of possible root causes by using a bipartite graph data structure that links possible symptoms with possible root causes. Upon determining that at least one possible root cause has a probability that is higher than a threshold, the system presents an explanation or solution associated with the at least one possible root cause. Upon determining that none of the possible root causes in the set of possible root causes has a probability higher than the threshold, the system presents a question based on information entropy that is computed based on probabilities of the identified possible root causes.

    COGNITIVE ADVISORY SYSTEM OF STRUCTURED ASSESSMENTS THROUGH IOT SENSORS

    公开(公告)号:US20190038934A1

    公开(公告)日:2019-02-07

    申请号:US15668432

    申请日:2017-08-03

    Abstract: A method, computer system, and a computer program product for structured assessments is provided. The present invention may include initializing a structured assessment. The present invention may also include receiving a plurality of signup data from a user based on the initialized structured assessment. The present invention may then include collecting a plurality of user data from an IoT device based on the received plurality of signup data. The present invention may further include processing the collected plurality of user data. The present invention may also include generating a feedback report based on the processed plurality of user data, and outputting the generated feedback report to the user.

    MANAGING VEHICLE BRAKE SYSTEM
    5.
    发明申请

    公开(公告)号:US20180281770A1

    公开(公告)日:2018-10-04

    申请号:US15821310

    申请日:2017-11-22

    Abstract: A method for managing a vehicle brake system includes collecting sensor data from one or more sensors in or around the vehicle, calculating brake effectiveness values based on the sensor data, calibrating the brake effectiveness values based on environmental context data associated with the vehicle, accumulating the calibrated brake effectiveness values as a dataset, generating a prediction curve or formula based the dataset, and scheduling a maintenance alarm for the brake system based on the brake effectiveness values.

    Web page pre-loading optimization

    公开(公告)号:US10027777B2

    公开(公告)日:2018-07-17

    申请号:US14924924

    申请日:2015-10-28

    Abstract: A mechanism is provided for optimizing web page pre-loading. Source codes of a web page file are analyzed to generate a module dependency graph that describes load dependency relationships between respective modules in the web page file. A load flow graph that indicates load flows of respective modules in the web page file is generated based on the module dependency graph. The load flow graph and the module dependency graph are analyzed to determine pre-load sequences of respective modules in the web page file. A pre-load profile is then generated based on the determined pre-load sequences.

    EFFECTIVE FEATURE LOCATION IN LARGE LEGACY SYSTEMS
    8.
    发明申请
    EFFECTIVE FEATURE LOCATION IN LARGE LEGACY SYSTEMS 有权
    大型系统中的有效特征位置

    公开(公告)号:US20160321069A1

    公开(公告)日:2016-11-03

    申请号:US14700772

    申请日:2015-04-30

    CPC classification number: G06F8/75 G06F8/10 G06F8/20

    Abstract: A fine-grained behavior model matching based method and system for effective feature location in large legacy systems. A feature behavior analyzer extracts internal behaviors of a feature under requesting based on NLP techniques or writing rules of the feature specification and generates a feature behavior model. A method uses multiple information sources associated with each method under analyzing to generate an expressive behavior signature for each method. The method integrates control flow information of each method and the signature information of its callees, and generates a CFG-based behavior model. A feature location identifier identifies and ranks the feature-related code locations based on a similarity between the feature behavior and the code behavior models. In one aspect, “use cases”, “source code repository” and “issue tracking system” are historical information of existing applications that are used to help understand each code unit of legacy systems applications, and recommend code units related with the given feature description.

    Abstract translation: 基于精细粒度的行为模型匹配的方法和系统,用于大型遗留系统中的有效特征位置。 特征行为分析器基于NLP技术提取请求下的特征的内部行为或者写入特征规范的规则,并生成特征行为模型。 一种方法使用与分析中的每种方法相关联的多个信息源来为每种方法生成表达行为签名。 该方法集成了各种方法的控制流程信息和被调用者的签名信息,并生成基于CFG的行为模型。 特征位置标识符基于特征行为和代码行为模型之间的相似性识别和排列与特征相关的代码位置。 在一个方面,“用例”,“源代码存储库”和“问题跟踪系统”是用于帮助理解遗留系统应用程序的每个代码单元的现有应用程序的历史信息,并且推荐与给定特征描述相关的代码单元 。

    Method and Apparatus for Digital Rights Management
    9.
    发明申请
    Method and Apparatus for Digital Rights Management 审中-公开
    数字版权管理方法与装置

    公开(公告)号:US20160110527A1

    公开(公告)日:2016-04-21

    申请号:US14983888

    申请日:2015-12-30

    Abstract: A method and apparatus for digital rights management (DRM) with steps and means for receiving a registration request from one of a plurality of DRM agent devices requesting to register one of a plurality of user accounts and the one DRM agent device to one of a plurality of rights issuers, completing a registration process in the one rights issuer, including establishment of a relationship among the one user account, the one DRM agent device and the one rights issuer; and returning a registration completion response to the one DRM agent device. The invention provides support to the many-to-many relationships among DRM entities, such as DRM agent device, user account and rights issuer, so that the DRM system can be applied to more business modes.

    Abstract translation: 一种用于数字版权管理(DRM)的方法和装置,其具有步骤和装置,用于从多个DRM代理设备之一接收请求将多个用户帐户中的一个注册并将一个DRM代理设备注册到多个 的权利发行人,完成一个发行人的注册过程,包括建立一个用户帐户,一个DRM代理设备和一个发行者之间的关系; 并向所述一个DRM代理设备返回注册完成响应。 本发明提供对诸如DRM代理设备,用户帐户和权限发布者之类的DRM实体之间的多对多关系的支持,使得DRM系统可以应用于更多的业务模式。

    GENERATING A TREE MAP
    10.
    发明申请

    公开(公告)号:US20150248778A1

    公开(公告)日:2015-09-03

    申请号:US14625830

    申请日:2015-02-19

    CPC classification number: G06T3/40 G06T11/206 G06T2200/16

    Abstract: A method for generating a tree map for tree map visualization includes obtaining node information of a plurality of nodes to be processed, the plurality of nodes to be processed being sub-nodes sharing a same parent node and the node information comprising at least sizes of the nodes; determining from the plurality of nodes a plurality of candidate nodes whose sizes are less than a threshold size; determining at least one super node including the plurality of candidate nodes based on the node information of the determined plurality of candidate nodes, a screen size, and the threshold size, such that when displaying in a zooming-in mode the super node on the screen, all candidate nodes in the super node are displayed at display sizes not less than the threshold size; and determining data required for displaying the tree map based on the determined super node.

Patent Agency Ranking