会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 88. 发明申请
    • METHODS AND SYSTEMS FOR IDENTIFYING A TRUSTABLE WORKFLOW BASED ON A COMPREHENSIVE TRUST MODEL
    • 基于综合信任模型识别可信任工作流的方法和系统
    • US20130332992A1
    • 2013-12-12
    • US13494399
    • 2012-06-12
    • Hyun Joo KimGueyoung JungTong Sun
    • Hyun Joo KimGueyoung JungTong Sun
    • G06F21/00
    • G06Q10/06
    • Methods and systems for identifying a trustable workflow based on a comprehensive trust model. One or more trustable links between two or more abstract services among a number of combinations of concrete services can be searched and the trustable link combined to realize an abstract workflow so as to construct a candidate trustable workflow space. The K trustable workflows can be determined by randomly selecting the trustable link with respect to each pair of connected abstract services and combining the selected trustable links. The trustable link in the workflow can be selected to be replaced with another candidate trustable link to provide a higher selection probability to the trustable link in a critical path.
    • 基于综合信任模型识别可信任工作流的方法和系统。 可以搜索多个具体服务的组合中的两个或更多个抽象服务之间的一个或多个可信任链接,并且可信链接组合以实现抽象工作流,从而构建候选可信任的工作流空间。 可信赖的工作流程可以通过随机选择关于每对连接的抽象服务的可信任链接并组合所选择的可信任链接来确定。 可以选择工作流中的可信任链接以用另一候选可信任链接替代以向关键路径中的可信任链路提供更高的选择概率。
    • 90. 发明授权
    • Efficient implementation of branch intensive algorithms in VLIW and superscalar processors
    • 在VLIW和超标量处理器中有效实施分支密集型算法
    • US08019979B2
    • 2011-09-13
    • US11854003
    • 2007-09-12
    • Jeffrey W. CalderTong Sun
    • Jeffrey W. CalderTong Sun
    • G06F9/34G06F9/40
    • G06F9/3885G06F9/30061G06F9/30072G06F9/3846
    • An apparatus for implementing branch intensive algorithms is disclosed. The apparatus includes a processor containing a plurality of ALUs and a plurality of result registers. Each result register has a guard input which allows the ALU to write a result to the register upon receipt of a selection signal at the guard input. A lookup table is dynamically programmed with logic to implement an upcoming branching portion of program code. Upon evaluation of the branch conditions of the branching portion of code, the lookup table outputs a selection signal for writing the correct results of the branching portion of code based on the evaluation of the branch condition statements and the truth table programmed into the lookup table to the result register.
    • 公开了一种实现分支密集算法的装置。 该装置包括包含多个ALU和多个结果寄存器的处理器。 每个结果寄存器具有保护输入,允许ALU在接收到保护输入端的选择信号时将结果写入寄存器。 用逻辑动态编程查找表以实现即将到来的程序代码的分支部分。 在对代码的分支部分的分支条件进行评估时,查找表基于分配条件语句和编入查找表中的真值表的评估输出用于写入代码的分支部分的正确结果的选择信号 结果寄存器。