Active feature probing using data augmentation
    451.
    发明申请
    Active feature probing using data augmentation 有权
    使用数据增加的主动特征探测

    公开(公告)号:US20080147852A1

    公开(公告)日:2008-06-19

    申请号:US11869892

    申请日:2007-10-10

    CPC classification number: H04L41/5061 H04L41/5074

    Abstract: Systems and methods are disclosed that performs active feature probing using data augmentation. Active feature probing is a means of actively gathering information when the existing information is inadequate for decision making. The data augmentation technique generates factitious data which complete the existing information. Using the factitious data, the system is able to estimate the reliability of classification, and determine the most informative feature to probe, then gathers the additional information. The features are sequentially probed until the system has adequate information to make the decision.

    Abstract translation: 公开了使用数据增加来执行主动特征探测的系统和方法。 主动特征探测是当现有信息不足以决策时积极收集信息的一种手段。 数据增加技术生成完成现有信息的数据。 使用事实数据,系统能够估计分类的可靠性,并确定最具信息性的特征进行探测,然后收集附加信息。 这些功能被依次探测,直到系统有足够的信息作出决定。

    Register Transfer Level (RTL) Test Point Insertion Method to Reduce Delay Test Volume
    452.
    发明申请
    Register Transfer Level (RTL) Test Point Insertion Method to Reduce Delay Test Volume 审中-公开
    寄存器传输级别(RTL)测试点插入方法来减少延迟测试卷

    公开(公告)号:US20080092093A1

    公开(公告)日:2008-04-17

    申请号:US11858216

    申请日:2007-09-20

    CPC classification number: G01R31/318547 G01R31/318328

    Abstract: A method includes inserting test points into a circuit for reducing the number of specified bits required for transition fault testing of the circuit by reducing the dependency of a second time-frame pattern of the circuit on a first time-frame pattern of the circuit. Preferably, inserting the test points includes controlling directly scan flip-flops of the circuit in the second time-frame requiring a number of scan flip-flops to be specified in the first time-frame for reducing the number of specified bits to detect transition faults.

    Abstract translation: 一种方法包括将测试点插入到电路中,以通过减少电路的第二时间帧图案对电路的第一时间帧图案的依赖性来减少电路的转换故障测试所需的指定位数。 优选地,插入测试点包括在第二时间帧中直接扫描电路的触发器,需要在第一时间帧中指定多个扫描触发器,以减少指定位数来检测转变故障 。

    SOFTWARE TESTING USING MACHINE LEARNING
    453.
    发明申请
    SOFTWARE TESTING USING MACHINE LEARNING 有权
    使用机器学习的软件测试

    公开(公告)号:US20080082968A1

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

    申请号:US11863387

    申请日:2007-09-28

    CPC classification number: G06F11/3688

    Abstract: A system and method for analyzing a computer program includes performing a static analysis on a program to determine property correctness. Test cases are generated and conducted to provide test output data. Hypotheses about aspects of execution of the program are produced to classify paths for test cases to determine whether the test cases have been encountered or otherwise. In accordance with the hypothesis, new test cases are generated to cause the program to exercise behavior which is outside of the encountered test cases.

    Abstract translation: 用于分析计算机程序的系统和方法包括对程序执行静态分析以确定属性正确性。 产生并进行测试用例以提供测试输出数据。 产生关于程序执行方面的假设,以便对测试用例的路径进行分类,以确定是否遇到了测试用例。 根据该假设,生成新的测试用例,以使程序运行不在遇到的测试用例之外的行为。

    Low-Complexity High-Performance Low-Rate Communications Codes
    454.
    发明申请
    Low-Complexity High-Performance Low-Rate Communications Codes 有权
    低复杂性高性能低速率通信代码

    公开(公告)号:US20080016426A1

    公开(公告)日:2008-01-17

    申请号:US11768585

    申请日:2007-06-26

    Abstract: An encoder includes an outer repetition encoder, an interleaver for permuting encoding from said outer repetition encoder; and an inner encoder for encoding information from the interleaver to provide a repeat zigzag-Hadamard code. In an exemplary embodiment, a common bit of a zigzag-Hadamard segment of encoding from said inner encoder is a repetition of a last parity bit of a previous zigzag-Hadamard segment of encoding from said inner encoder and said common bit is punctured.

    Abstract translation: 编码器包括外部重复编码器,用于从所述外部重复编码器排列编码的交织器; 以及内部编码器,用于对来自交织器的信息进行编码以提供重复锯齿形 - 哈达玛码。 在示例性实施例中,来自所述内部编码器的编码的锯齿形 - 哈达玛段的公共位是来自所述内部编码器的先前之字形 - 哈达玛编码段的最后奇偶校验位的重复,并且所述公共位被删截。

    Efficient SAT-based unbounded symbolic model checking
    455.
    发明授权
    Efficient SAT-based unbounded symbolic model checking 有权
    高效的基于SAT的无界符号模型检查

    公开(公告)号:US07305637B2

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

    申请号:US11087898

    申请日:2005-03-23

    CPC classification number: G06F17/504

    Abstract: An efficient approach for SAT-based quantifier elimination and pre-image computation using unrolled designs that significantly improves the performance of pre-image and fix-point computation in SAT-based unbounded symbolic model checking.

    Abstract translation: 基于SAT的量化器消除和使用非滚动设计的前图像计算的有效方法,显着提高了基于SAT的无界符号模型检查中的前图像和定点计算的性能。

    Method and Apparatus for Testing an Integrated Circuit
    457.
    发明申请
    Method and Apparatus for Testing an Integrated Circuit 审中-公开
    用于测试集成电路的方法和装置

    公开(公告)号:US20070266283A1

    公开(公告)日:2007-11-15

    申请号:US11692367

    申请日:2007-03-28

    CPC classification number: G01R31/318547

    Abstract: Disclosed is an apparatus and method for testing an IC having a plurality of scan chains. A test input is transmitted over a tester channel to at least one scan chain during a time interval. Specifically, a memory element stores a first test input transmitted during a first time interval and a combinational circuit connected to the memory element and scan chain transmits to the scan chain one of a) the first test input and b) a second test input transmitted over the tester channel during a second time interval occurring after the first time interval.

    Abstract translation: 公开了一种用于测试具有多个扫描链的IC的装置和方法。 在一段时间间隔内,测试输入通过测试仪通道发送到至少一个扫描链。 具体地,存储元件存储在第一时间间隔期间发送的第一测试输入和连接到存储元件的组合电路,扫描链将扫描链传送到扫描链a)第一测试输入中的一个,以及b)传输的第二测试输入 在第一时间间隔之后的第二时间间隔期间发生测试仪通道。

    Method and Apparatus for Transductive Support Vector Machines
    458.
    发明申请
    Method and Apparatus for Transductive Support Vector Machines 有权
    用于转换支持向量机的方法和装置

    公开(公告)号:US20070265991A1

    公开(公告)日:2007-11-15

    申请号:US11688928

    申请日:2007-03-21

    CPC classification number: G06K9/6269 G06K9/6287

    Abstract: Disclosed is a method for training a transductive support vector machine. The support vector machine is trained based on labeled training data and unlabeled test data. A non-convex objective function which optimizes a hyperplane classifier for classifying the unlabeled test data is decomposed into a convex function and a concave function. A local approximation of the concave function at a hyperplane is calculated, and the approximation of the concave function is combined with the convex function such that the result is a convex problem. The convex problem is then solved to determine an updated hyperplane. This method is performed iteratively until the solution converges.

    Abstract translation: 公开了用于训练换能支持向量机的方法。 支持向量机基于标记的训练数据和未标记的测试数据进行训练。 优化用于对未标记测试数据进行分类的超平面分类器的非凸目标函数被分解为凸函数和凹函数。 计算超平面上的凹函数的局部近似,并将凹函数的近似与凸函数相结合,使得结果为凸问题。 然后解决凸问题以确定更新的超平面。 该方法迭代执行,直到解收敛。

    Uplink Scheduler for Cellular Packet Access
    459.
    发明申请
    Uplink Scheduler for Cellular Packet Access 有权
    用于蜂窝分组接入的上行链路调度器

    公开(公告)号:US20070248035A1

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

    申请号:US11690936

    申请日:2007-03-26

    CPC classification number: H04W72/1231 H04W52/346 H04W72/1268

    Abstract: A method includes constraining total power received from cellular users accessing a base station through any one of a TDMA access, CDMA access, and a derivation of a TDMA/CDMA access, and scheduling users for access to the base station within the constrained total power in response to an optimization that for each time slot determines a group of time critical cellular users and their transmission power factoring in instantaneous location-dependent channel states and long term quality of service performance. In the preferred embodiment, the optimization includes an iterative solution of an NP-hard Knapsak problem with initialization of maximum transmit power per cellular user inversely proportional to at least one of an activity factor of a cellular user's channel, the cellular user's antenna gain, the instantaneous channel gain of a dedicated uplink channel for the cellular user, and other-cellular user to same-cellular user interference ratio, and directly proportional to total resource power consumption.

    Abstract translation: 一种方法包括通过TDMA接入,CDMA接入和TDMA / CDMA接入的导出来限制从蜂窝用户接入基站的总功率,并且在约束总功率内调度用户接入基站 响应优化,对于每个时隙,确定一组时间关键的蜂窝用户及其在瞬时位置相关信道状态下的传输功率因子和长期服务质量性能。 在优选实施例中,优化包括NP硬Hardathapsak问题的迭代解决方案,每个蜂窝用户的最大发射功率的初始化与蜂窝用户信道的活动因子,蜂窝用户的天线增益, 用于蜂窝用户的专用上行链路信道的瞬时信道增益,以及其他蜂窝用户对同一蜂窝用户干扰比,并且与总资源功率消耗成正比。

Patent Agency Ranking