会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 101. 发明申请
    • SIMPLIFIED SUB-PREDICTION UNIT (SUB-PU) MOTION PARAMETER INHERITENCE (MPI)
    • 简化子预测单元(SUB-PU)运动参数不确定度(MPI)
    • US20160366442A1
    • 2016-12-15
    • US15119057
    • 2014-03-07
    • Hongbin LIUQUALCOMM INCORPORATEDYing CHEN
    • Hongbin LiuYing Chen
    • H04N19/597H04N19/52
    • This disclosure describes techniques for simplifying depth inter mode coding in a three-dimensional (3D) video coding process, such as 3D-HEVC. The techniques include generating a motion parameter candidate list, e.g., merging candidate list, for a current depth prediction unit (PU). In some examples, the described techniques include determining that a sub-PU motion parameter inheritance (MPI) motion parameter candidate is unavailable for inclusion in the motion parameter candidate list for the current depth PU if motion parameters of a co-located texture block to a representative block of the current depth PU are unavailable. In some examples, the described techniques include deriving a sub-PU MPI candidate for inclusion in the motion parameter candidate list for the current depth PU only if a partition mode of the current depth PU is 2N×2N.
    • 本公开描述了用于简化3D-HEVC等三维(3D)视频编码处理中的深度帧间编码的技术。 这些技术包括为当前深度预测单元(PU)生成运动参数候选列表,例如合并候选列表。 在一些示例中,所描述的技术包括确定如果将位于同一个位置的纹理块的运动参数传送到一个或多个运动参数继承(MPI)运动参数候选者的运动参数,则不能使用用于当前深度PU的运动参数候选列表 当前深度PU的代表块不可用。 在一些示例中,所描述的技术包括仅当当前深度PU的分区模式是2N×2N时,才导出用于当前深度PU的运动参数候选列表中的子PU MPI候选。
    • 103. 发明授权
    • Methods and apparatus for reuse optimization of a data storage process using an ordered structure
    • 使用有序结构重用数据存储过程优化的方法和装置
    • US09348884B2
    • 2016-05-24
    • US12128264
    • 2008-05-28
    • Ying ChenBin HeAna Lelescu
    • Ying ChenBin HeAna Lelescu
    • G06F17/30
    • G06F17/30592G06F17/30563G06F17/30569
    • Techniques for reducing a number of computations in a data storage process are provided. One or more computational elements are identified in the data storage process. An ordered structure of one or more nodes is generated using the one or more computational elements. Each of the one or more nodes represents one or more computational elements. Further, a weight is assigned to each of the one or more nodes. An ordered structure of one or more reusable nodes is generated by deleting one or more nodes in accordance with the assigned weights. The ordered structure of one or more reusable nodes is utilized to reduce the number of computations in the data storage process. The data storage process converts data from a first format into a second format, and stores the data in the second format on a computer readable medium for data analysis purposes.
    • 提供了用于减少数据存储过程中的多个计算的技术。 在数据存储过程中识别一个或多个计算元件。 使用一个或多个计算元件生成一个或多个节点的有序结构。 一个或多个节点中的每一个表示一个或多个计算元件。 此外,对一个或多个节点中的每一个分配权重。 通过根据分配的权重删除一个或多个节点来生成一个或多个可重用节点的有序结构。 利用一个或多个可重用节点的有序结构来减少数据存储过程中的计算次数。 数据存储过程将数据从第一格式转换成第二格式,并将数据以第二格式存储在计算机可读介质上用于数据分析目的。
    • 104. 发明授权
    • Method, server and system for converging desktop application and web application
    • 用于融合桌面应用程序和Web应用程序的方法,服务器和系统
    • US09047130B2
    • 2015-06-02
    • US13534819
    • 2012-06-27
    • Ying ChenXing FangJie QiuQing Bo WangMeng Ye
    • Ying ChenXing FangJie QiuQing Bo WangMeng Ye
    • G06F15/16G06F9/50
    • H04L67/02G06F9/5055H04L67/42
    • A method, Web server and computer system are provided for converging a desktop application and a Web application. The method includes in response to a request from a client user for using a target desktop application, starting a desktop application initialization process on the Web server and determining an appropriate corresponding hosting server for the user; preparing and provisioning desktop application environment on the corresponding hosting server and starting the target desktop application; transmitting the corresponding hosting server's address to the client so as to make desktop application interaction between the client and the corresponding hosting server; and in response to the completion of the desktop application interaction, stopping and exiting the target desktop application on the corresponding hosting server. The client user is provided with a unified Web console for accessing desktop applications and Web applications, and Web files are shared between the desktop applications and the Web applications.
    • 提供了一种方法,Web服务器和计算机系统来收敛桌面应用程序和Web应用程序。 该方法包括响应于来自客户端用户的使用目标桌面应用程序的请求,在Web服务器上启动桌面应用程序初始化过程并为用户确定适当的相应托管服务器; 在相应的托管服务器上准备和配置桌面应用程序环境,并启动目标桌面应用程序; 将相应的主机服务器地址发送给客户端,以便在客户端和相应的主机服务器之间进行桌面应用交互; 并响应桌面应用程序交互的完成,停止和退出相应主机服务器上的目标桌面应用程序。 为客户端用户提供统一的Web控制台,用于访问桌面应用程序和Web应用程序,Web文件在桌面应用程序和Web应用程序之间共享。
    • 108. 发明申请
    • METHOD AND APPARATUS FOR LABEL DISTRIBUTION
    • 方法和装置的标签分配
    • US20130250962A1
    • 2013-09-26
    • US13614066
    • 2012-09-13
    • Ying ChenQianglin Zhao
    • Ying ChenQianglin Zhao
    • H04L12/56
    • H04L45/507
    • The present invention provides a method for label distribution, including: receiving a Label Distribution Protocol packet that contains a first label and is distributed by a downstream node, in which the first label belongs to a downstream logical topology; searching for a second label that corresponds to the first label and belongs to an upstream logical topology, in which the upstream logical topology and the downstream logical topology are different logical topologies; and distributing, when an upstream node belonging to the upstream logical topology exists in a neighboring node, the second label to the upstream node. The present invention also provides a node device. Using the method or device disclosed in the present invention, a label may cross different logical topologies during distribution, so that in a newly established logical topology, it is not necessary to upgrade all common nodes, thereby reducing the cost for establishing the new logical topology.
    • 本发明提供了一种标签分发方法,包括:接收包含第一标签并由下游节点分发的标签分发协议分组,其中第一标签属于下游逻辑拓扑; 搜索对应于第一标签的第二标签,属于上游逻辑拓扑,其中上游逻辑拓扑和下游逻辑拓扑是不同的逻辑拓扑; 并且当属于上游逻辑拓扑的上游节点存在于相邻节点中时,将所述第二标签分配给所述上游节点。 本发明还提供一种节点设备。 使用本发明公开的方法或装置,标签可以在分发期间跨越不同的逻辑拓扑,使得在新建立的逻辑拓扑中,不需要升级所有公共节点,从而降低了建立新的逻辑拓扑的成本 。
    • 109. 发明授权
    • Switching between two communication modes in a WLAN
    • 在WLAN中切换两种通信模式
    • US08493896B2
    • 2013-07-23
    • US12190050
    • 2008-08-12
    • Xui Lan YuYing ChenLi Hua TangShi Xia Liu
    • Xui Lan YuYing ChenLi Hua TangShi Xia Liu
    • H04B7/00
    • H04W48/18H04W84/12H04W84/18
    • Method and system for switching a network application operating in a first communication mode to a second mode within a wireless local area network, comprising: judging whether mobile nodes are neighboring according to location information; when nodes are neighboring inquiring whether mobile nodes want to switch to second mode to run network applications; when all mobile nodes agree to switch to second mode, downloading and installing network application provided by the application server to one of the mobile nodes; configuring each of the mobile nodes with the communication parameters under the second mode; and switching all mobile nodes to the second communication mode to continue the previous network application. The invention dynamically switches between Infrastructure mode and Ad-hoc mode to balance system resources, improve QoS, reduce the communication traffic, waiting time and the cost of the users, and increase the income of the provider of the network service.
    • 用于将在第一通信模式中操作的网络应用切换到无线局域网内的第二模式的方法和系统,包括:根据位置信息判断移动节点是否相邻; 当节点相邻时询问移动节点是否要切换到运行网络应用的第二种模式; 当所有移动节点同意切换到第二模式时,将应用服务器提供的网络应用程序下载并安装到移动节点之一; 在第二模式下用通信参数配置每个移动节点; 并将所有移动节点切换到第二通信模式以继续以前的网络应用。 本发明在基础设施模式和Ad-hoc模式之间动态切换,平衡系统资源,提高QoS,降低通信流量,等待时间和用户成本,增加网络服务提供商的收入。
    • 110. 发明授权
    • Memory leak diagnosis
    • 内存泄漏诊断
    • US08429620B2
    • 2013-04-23
    • US12491877
    • 2009-06-25
    • Ying ChenQiming TengXin Hui LiYing LiTian Cheng Liu
    • Ying ChenQiming TengXin Hui LiYing LiTian Cheng Liu
    • G06F9/44
    • G06F11/366G06F11/3636
    • A method and an apparatus for diagnosing memory leak. The method includes: tracing the allocation of objects; recording allocation paths and allocation time of each object; giving to each object one unique identifier (ID) corresponding to an allocation path; determining the allocation path to which each object belongs; organizing the objects which are allocated but still not collected, and counting the age generations of the objects of the similar type according to the allocation time of each object; ranking the allocation paths according to the age generations of the surviving objects; and analyzing the ranking of the allocation paths, in which the allocation path with higher rank is more probable to introduce memory leaks. Thus, the suspicious allocation path possibly incurring memory leaks is selected and reported to the user for analysis.
    • 一种用于诊断内存泄漏的方法和装置。 该方法包括:跟踪对象的分配; 记录每个对象的分配路径和分配时间; 给每个对象一个对应于分配路径的唯一标识符(ID); 确定每个对象所属的分配路径; 组织分配但尚未收集的对象,并根据每个对象的分配时间对相似类型的对象的年代进行计数; 根据幸存对象的年龄代码排列分配路径; 并且分析具有较高等级的分配路径更可能引入内存泄漏的分配路径的排序。 因此,可选择引发内存泄漏的可疑分配路径被选择并报告给用户进行分析。