150 results about "Test matrix" patented technology

A test case generator including a test model generator for generating test models. A test case instance generator uses a permutation engine to generate test matrices from the tests models and generates XML documents from the test matrices. The documents are applied to an XML-based application interface to test the interface.

A method for computer-generating interaction-specific knowledge base for rapidly improving or optimizing a performance of an object comprises performing, according to computer-designed test matrices, at least several automatic experimental cycles on selected control variables. In at least one of the automatic experimental cycles after the first the computer plans a new test matrix designed to minimize or remove at least one expected two-variable interaction from a main effect of a designated control variable. A machine operating according to the method is also available.

The invention relates to an intelligent multi-core cable harness detection device. The device consists of a programmable power supply, an intelligent multi-channel switch, a current-limiting resistor network, a multi-core converter, a current sampling module, an analog multiplexer, a single-chip, a computer and detection software. The device can automatically analyze short-circuit performance, open-circuit performance and conduction performance of a multi-core cable harness. A harness system state is determined through a harness performance testing matrix graphical detection result and by comparing the result with a pre-stored standard, and different fault types are indicated by colors; and meanwhile, a fault alarm can be sent by an alarm device with sound and changing light. The device has the characteristics of simple and convenient operation, high testing efficiency, high system extensibility and the like, and can be directly used for development of harness-related products, quality control and performance detection.

A method for computer-generating interaction-specific knowledge base for rapidly improving or optimizing a performance of an object comprises performing, according to computer-designed test matrices, at least several automatic experimental cycles on selected control variables. In at least one of the automatic experimental cycles after the first the computer plans a new test matrix designed to minimize or remove at least one expected two-variable interaction from a main effect of a designated control variable. A machine operating according to the method is also available.

The invention belongs to the technical field of automatic radar HRRP (high resolution range profile) object identification and particularly relates to compressive sensing based range profile object identification. Range profile object identification includes the steps: constructing a matching dictionary according to a radar echo model, selecting an appropriate test matrix for compressive sensing of a training sample range profile and to-be-identified test sample range profile which are known in type information so as to achieve data dimension reduction; then, subjecting data subjected to compressive sensing to sparse reconstruction so as to obtain sparse coefficients of the training sample range profile and the test sample range profile under the matching dictionary; utilizing the sparse coefficient of the training sample range profile as a pattern vector, and identifying the test sample range profile according to a nearest neighbor method. By the aid of compressive sensing based range profile object identification, since sparse coefficient characteristics of objects under the dictionary are extracted, redundancy is avoided, calculating amount is decreased and unnecessary noise is avoided.

A regular quasi-cyclic matrix is prepared, a conditional expression for assuring a predetermined minimum loop in a parity check matrix is derived, and a mask matrix for converting a specific cyclic permutation matrix into a zero-matrix based on the conditional expression and a predetermined weight distribution is generated. The specific cyclic permutation matrix is converted into the zero-matrix to generate an irregular masking quasi-cyclic matrix. An irregular parity check matrix in which the masking quasi-cyclic matrix and a matrix in which the cyclic permutation matrices are arranged in a staircase manner are arranged in a predetermined location.

Urine analysis system that couples or integrates with a toilet. Wirelessly links to a computer, such as a user's mobile device to accept control inputs and report urine test results. Accepts user input to initiate testing and deploys a urine collector into the toilet bowl above the water to collect a urine sample. The collected urine sample is dispensed onto multiple regions of a test matrix that may perform many urine tests simultaneously. A single test matrix may include multiple types of tests, such as immunochromatography and colorimetric assays. An optical imaging system detects reaction of the urine with reagents integrated into the test matrix. Analysis of images may be performed locally or on a remote server. The system may store an inventory of test matrices to support daily testing for long durations, for example 6 months or more before refilling.

Methods and apparatus to measure flow of a drilling fluid composition include a test housing including a test matrix located between an inlet and an outlet, a test valve connected between the inlet of the test housing and a fluid reservoir, and a pressure assembly configured to apply pressure to drilling fluid contained in the fluid reservoir. The apparatus and methods further include a sample valve connected to the outlet of the test housing and a measurement device configured to measure a filtrate fluid flowing through the outlet. A method to measure flow of a drilling fluid includes measuring an amount of filtrate fluid flowing through the test matrix as a function of time.

The invention discloses a method and a system for intrusion detection based on non-negative matrix factorization under sparse representation. The method includes: acquiring network data and host data, and obtaining a level-one audit privilege program of original network data; preprocessing the network data and the host data, and generating network characteristic data and short-sequence vectors; performing non-negative matrix iterative factorization for a data test matrix, and performing sparse representation for a basis matrix and a weight matrix; sampling weight matrix data subjected to sparse representation by the aid of a projection matrix so that highly characteristic weight coefficient vectors are obtained; and matching the highly characteristic weight coefficient vectors with characteristic vectors in training data by the aid of characteristic vector library data, and judging whether abnormal characteristics are conformed to or not. The method and the system for intrusion detection achieve data dimension reduction by non-negative matrix factorization and uses multi-divergence as a measurement level, an RIP (routing information protocol) condition in sparse representation is added into a combined divergence objective function family to restrain a non-negative matrix factorization iterative process, data detection dimensionality is lowered, and high-dimensional mass data processing of the system for intrusion detection is facilitated.

A process for generating a set of tests for a system includes identifying a plurality of factors to use in a design of experiments (DOE) test, using each of the plurality of factors in the DOE, identifying, through the DOE testing, one or more factors which have a significant effect an output of the system, including only the one or more factors in a Combinatorial design methodology (CDM) and generating a first test matrix based upon the CDM using the DOE inputs. The unique part of the process is then adding interactions of order greater than 2-way, as identified by the DOE, to the CDM matrix thus creating an optimized set of test cases. By using the sensitivity output of the DOE as an input to the final test matrix from the CDM, an affordable yet comprehensive test approach is provided.

The invention discloses an intrusion detection method based on improved OBS-NMF algorithm, mainly aiming at solving the existing problems in the current technology such as low capability of processing high dimensional data, weak robustness, small selection range of threshold value and undesired detection results. The realization thereof steps are as follows: (1) collecting a call of a progress system; (2) constructing and simplifying the training matrix; (3) carrying out lowering dimension decomposition on the training matrix; (4) judging whether the convergence conditions are satisfied, if so, then performing step (5), if not, returning to step (3) to carry out iteration continuously until the maximum iterations are reached; (5) constructing a test matrix U; (6) utilizing a basis matrix W to solve the characteristic coefficient vector hu of U; (7) solving the abnormality of the process vector in U; and (8) setting the threshold value lambda and outputting the detection results. The invention has the advantages of simple realization, favorable stability, high detection precision, large selection range of the threshold value and strong instantaneity, and can be applied to real-time intrusion detection based on host system call.

An apparatus and a method for performing shortening and puncturing in case of performing encoding and decoding using a parity test matrix in a communication/broadcasting system are provided. The method includes determining a number of zero-padding bits, determining a number N_pad of bit groups in which all bits are padded with zeros, padding the all bits within 0^th to (N_pad−1)^th bit groups with zeros based on a shortening pattern, encoding information bits including the zero-padded bits to generate a codeword. Here, the shortening pattern is defined in a sequence of bit groups defined as 9, 8, 15, 10, 0, 12, 5, 27, 6, 7, 19, 22, 1, 16, 26, 20, 21, 18, 11, 3, 17, 24, 2, 23, 25, 14, 28, 4, 13, 29.

The invention discloses a device and a system for testing a packer in a formation tester, and aims to test a newly-developed packer in a formation tester. In the test device, a first end of a simulation borehole sleeve is connected with a sleeve end cap, and a second end of the simulation borehole sleeve is sleeved inside a first end of an axial limiting sleeve and contacts the axial limiting sleeve; a protection ring is sleeved outside a contact part of the simulation borehole sleeve and the axial limiting sleeve; a test matrix is positioned in the simulation borehole sleeve and the axial limiting sleeve, and can be in circumferential seal with a sliding end cap of the packer; a first end of the test matrix can be in circumferential seal and fixedly connected with a fixed end cap of the packer, and a second end of the test matrix is connected with a second fixed head; and an expansion pressurizing pipe penetrates through an end face of the axial limiting sleeve and an end face of the second fixed head, and is communicated with a pipeline in the test matrix. The device and the system are used for performing simulation test on the charging pressure resistance and the setting sealability of the packer.

A system and method of synthesizing layout patterns to test an optical proximity correction algorithm. The method comprises the steps of: embodying Walsh patterns in a set of Walsh pattern matrices; processing groups of matrices from the set of Walsh pattern matrices to form a set of test matrices; mapping the set of test matrices to a test pattern set.

The invention refers to a method which generates an IC tester control consisting of numerous test instructions for a plurality of specific test environments, which can generate and measure analog and digital signals for an IC, in particular a mixed-signal IC. The method obtains data and control instructions from multidimensional test matrices independent of the test environment, such as matrix-like databases or libraries. The data and control instructions independent of the test environment are converted by means of a code generator into a syntax which is dependent on the test environment and which can be integrated into a general syntax dependent on the test environment, so that the syntax dependent on the test environment and the general syntax dependent on the test environment together form a complete control, comprising analog and digital signals, for one of the specific test environments.

The present invention discloses a power generation process control system fault detection method, which comprises the steps of: carrying out matrix factorization on a training matrix X after noise reduction and standardization processing by adopting a principal component analysis PCA method, and adopting a score matrix T as an initial value W0 of a base matrix W; carrying out iteration solution on the base matrix W and a weight coefficient matrix H of the training matrix X by adopting an alternating least square method with nonnegative constrains; constructing a monitoring statistics Tn <2> and SPEn based on nonnegative matrix factorization, calculating probability density functions PDF of the monitoring statistics Tn <2> and SPEn separately by utilizing a kernel density estimation method, setting a significance level and solving control limits of the monitoring statistics Tn <2> and SPEn separately; and calculating to obtain an approximate value W-hat test of a base matrix of a test matrix Xtest by utilizing the weight coefficient matrix H and the test matrix Xtest after data processing, calculating monitoring statistics Tn <2> and SPEn of the test matrix Xtest separately, and indicating that a fault occurs if the monitoring statistics exceed the control limits when compared with the corresponding control limits. The power generation process control system fault detection method can be used for carrying out condition monitoring on massive operation data in the power generation process, further achieve the fault diagnosis of a power generation process control system.

The invention discloses an unsupervised relationship prediction method based on a depth map network auto-encoder. The method comprises the following steps: collecting an entity pair data set X with mpairs of target relationships and n entities; preprocessing the entity pair data, and dividing the entity pair data into K combinations of a test set and a training set; converting the test set into atest matrix Atest, and converting the training set into a training matrix Atrain; normalizing the training set matrix Atest to define an encoder and a decoder for an adjacent matrix, and building a prediction model; traversing k test sets and training sets by the prediction model for training and relationship reconstruction to obtain k trained prediction models; and traversing the k trained prediction models to obtain prediction of the target relationship. According to the method, target relationship prediction is completed by adopting a graph convolutional neural network, and a transductionproblem of a node embedding vector is changed into a conclusion problem during edge prediction of a graph.

Provided is a method and apparatus for lattice reduction with reduced computational complexity. The apparatus and method include calculating an R matrix using sorted QR decomposition, and conducting an R-value test using an R-value based on diagonal elements of the R matrix and a threshold value. The R matrix is an upper triangular matrix. The apparatus and method further execute a loop comprising a size reduction and a conditional update of a basis vector corresponding to a column element of the R matrix in response to the R-value being greater than or equal to the threshold value. The apparatus and method conduct another R-value test based on the R matrix comprising the updated basis vector in response to the basis vector being updated.