Rule-based automated return authorization
    13.
    发明授权
    Rule-based automated return authorization 有权
    基于规则的自动退货授权

    公开(公告)号:US08666907B1

    公开(公告)日:2014-03-04

    申请号:US13279986

    申请日:2011-10-24

    IPC分类号: G06Q30/00

    CPC分类号: G06Q30/01

    摘要: A return request processing engine automatically approves or denies requests for authorization to return a purchased item to the seller of the item. The return request processing engine utilizes return request rules to determine whether a particular return request can be approved or denied without input from the seller. When a request is received from a buyer to return an item, the return request processing engine utilizes the return request rules to determine if the request to return the item can be automatically approved or denied without input from the seller. If the return request processing engine cannot automatically approve or deny a return request, the return request processing engine causes a message to be transmitted to the seller of the item that provides a user interface through which the seller can indicate whether the return request is approved or denied by way of a single user input.

    摘要翻译: 退货请求处理引擎自动批准或拒绝授权的请求,将购买的商品退回给该商品的卖方。 返回请求处理引擎利用返回请求规则来确定特定返回请求是否可以被批准或被拒绝而没有来自卖方的输入。 当从买方接收到返回物品的请求时,返回请求处理引擎利用返回请求规则来确定在没有卖方的输入的情况下是否可以自动批准或拒绝返回该项目的请求。 如果返回请求处理引擎不能自动批准或拒绝返回请求,则返回请求处理引擎使得向提供用户界面的项目的卖方发送消息,卖方可以通过该用户界面指示返回请求是否被批准, 通过单个用户输入拒绝。

    Disjunctive image computation for sequential systems
    15.
    发明授权
    Disjunctive image computation for sequential systems 有权
    顺序系统的分离图像计算

    公开(公告)号:US07693690B2

    公开(公告)日:2010-04-06

    申请号:US11367665

    申请日:2006-03-03

    IPC分类号: G06F17/50 G06F13/00

    CPC分类号: G06F11/3608 G06F17/504

    摘要: A symbolic disjunctive image computation method for software models which exploits a number of characteristics unique to software models. More particularly, and according to our inventive method, the entire software model is decomposed into a disjunctive set of submodules and a separate set of transition relations are constructed. An image/reachability analysis is performed wherein an original image computation is divided into a set of image computation steps that may be performed on individual submodules, independently from any others. Advantageously, our inventive method exploits variable locality during the decomposition of the original model into the submodules. By formulating this decomposition as a multi-way hypergraph partition problem, we advantageously produce a small set of submodules while simultaneously minimizing the number of live variable in each individual submodule. Our inventive method produces a set of disjunctive transition relations directly from the software model, without producing a conjunctive transition relation—as is necessary in the prior art. In addition, our inventive method exploits the exclusive use of live variables in addition to novel search strategies which provide still further benefit to our method.

    摘要翻译: 用于软件模型的符号分离图像计算方法,其利用软件模型独特的许多特征。 更具体地,根据本发明的方法,整个软件模型被分解成一个分离的子模块集合,并构建了一组单独的过渡关系。 执行图像/可达性分析,其中原始图像计算被划分为可以独立于任何其他方式对各个子模块执行的一组图像计算步骤。 有利地,本发明的方法在原始模型分解成子模块期间利用可变局部性。 通过将此分解形式作为多路超图分区问题,我们有利地产生一小组子模块,同时最小化每个子模块中的实时变量数量。 我们的创造性方法直接从软件模型产生一组分离过渡关系,而不产生结合过渡关系 - 这在现有技术中是必需的。 此外,除了新颖的搜索策略之外,我们的创造性方法还利用了实时变量的独家使用,这为我们的方法提供了更多的益处。

    Efficient distributed SAT and SAT-based distributed bounded model checking
    16.
    发明授权
    Efficient distributed SAT and SAT-based distributed bounded model checking 有权
    高效分布式SAT和基于SAT的分布式有界模型检查

    公开(公告)号:US07203917B2

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

    申请号:US10795384

    申请日:2004-03-09

    IPC分类号: G06F17/50

    CPC分类号: G06F17/504

    摘要: There is provided a method of solving a SAT problem comprising partitioning SAT-formula clauses in the SAT problem into a plurality of partitions. Each of said plurality of partitions is solved as a separate process each, thereby constituting a plurality of processes where each of said process communicates only with a subset of the plurality of processes.

    摘要翻译: 提供了一种解决SAT问题的方法,包括将SAT问题中的SAT公式子句分成多个分区。 所述多个分区中的每一个分别被解决为单独的处理,从而构成多个处理,其中每个所述进程仅与多个进程的子集进行通信。

    Rotatable wall-mount rack assembly
    17.
    外观设计

    公开(公告)号:USD1005005S1

    公开(公告)日:2023-11-21

    申请号:US29805204

    申请日:2021-08-25

    申请人: Zijiang Yang

    设计人: Zijiang Yang

    摘要: FIG. 1 is an isometric view of a rotatable wall-mount rack assembly showing my new design;
    FIG. 2 is a front elevation view thereof.
    FIG. 3 is a rear elevation view thereof.
    FIG. 4 is a right side elevation view thereof.
    FIG. 5 is a left side elevation view thereof.
    FIG. 6 is a top plan view thereof; and,
    FIG. 7 is a bottom plan view thereof.
    The broken lines are for environmental purposes only and form no part of the claimed design.

    Combination panels for horizontal wall mount rack

    公开(公告)号:USD998377S1

    公开(公告)日:2023-09-12

    申请号:US29867982

    申请日:2022-11-15

    申请人: Zijiang Yang

    设计人: Zijiang Yang

    摘要: FIG. 1 is a front isometric view of the combination panels for horizontal wall mount rack according to our design;
    FIG. 2 is a front isometric view shown in use;
    FIG. 3 is a rear isometric view of the combination panels for horizontal wall mount rack shown in FIG. 1;
    FIG. 4 is an isometric view of the combination panels for horizontal wall mount rack shown in use in FIG. 2;
    FIG. 5 is a front elevation view of the combination panels for horizontal wall mount rack shown in FIG. 1;
    FIG. 6 is rear elevation view thereof;
    FIG. 7 is a top plan view thereof, with the opposite side being a mirror of that shown; and,
    FIG. 8 is a side elevation view thereof, with the opposite side being a mirror of that shown.
    The broken lines shown represent unclaimed rails and form no part of the claimed design.

    Reachability analysis for program verification
    19.
    发明授权
    Reachability analysis for program verification 有权
    程序验证的可达性分析

    公开(公告)号:US07926039B2

    公开(公告)日:2011-04-12

    申请号:US11692421

    申请日:2007-03-28

    IPC分类号: G06F9/44 G06F9/45

    CPC分类号: G06F9/44589

    摘要: An improved method for automatically improving the precision of an extrapolation operator used, for example, in software program verification in connection with the static analysis and model checking of the software programs which rely on fix-point computation. In particular, a new extrapolation-with-care-set operator, together with a method for gradually increasing the precision of this operation by tightening the care set.

    摘要翻译: 一种改进的方法,用于自动提高外推算子的精度,例如,在依赖于固定点计算的软件程序的静态分析和模型检查的软件程序验证中。 特别地,一种新的外推护理操作器,以及通过收紧护理套件逐渐增加该操作的精度的方法。

    Iterative abstraction using SAT-based BMC with proof analysis
    20.
    发明授权
    Iterative abstraction using SAT-based BMC with proof analysis 失效
    使用基于SAT的BMC进行迭代抽象与证明分析

    公开(公告)号:US07742907B2

    公开(公告)日:2010-06-22

    申请号:US10762499

    申请日:2004-01-23

    IPC分类号: G06F17/50 G06F9/45

    CPC分类号: G06F17/504

    摘要: A method of obtaining a resolution-based proof of unsatisfiability using a SAT procedure for a hybrid Boolean constraint problem comprising representing constraints as a combination of clauses and interconnected gates. The proof is obtained as a combination of clauses, circuit gates and gate connectivity constraints sufficient for unsatisfiability.

    摘要翻译: 使用针对混合布尔约束问题的SAT过程获得基于分辨率的不满足证明的方法,包括将约束表示为子句和互连门的组合。 证明是作为条件,电路门和门连接约束的组合获得的,足以满足不满足性。