Product (mathematics)

About: Product (mathematics) is a research topic. Over the lifetime, 44382 publications have been published within this topic receiving 377809 citations.

Solving Fuzzy Relational Equations Via Semitensor Product

Abstract: The problem of solving max-min fuzzy relational equations is investigated. First, we show that if there is a solution, then there is a corresponding solution within the set of parameters [briefly, the parameter set solution (PSS)]. Then, the semitensor product of matrices is used to convert the logical equations into algebraic equations via the vector expression of logical variables. Under this form, every PSS can be obtained. It is proved that all the solutions can be revealed from their corresponding PSS. Some examples are presented to demonstrate the algorithm to solve fuzzy relational equations.

Low cost system method apparatus and way of doing business for the conveyance and electronic labeling and transference of secure multimedia and data products

Abstract: A portable receiving system for receiving data products and data product information. The system includes a portable data unit and a subscriber interface unit. The portable data unit includes a broadcast signal receiver for receiving at least one of a data product or data product information modulated with a broadcast signal, a processor for separating the at least one data product or data product information from the broadcast signal by demodulating the broadcast signal, memory for storing the separated at least one data product or data product information, a presentation device for presenting the separated at least one data product or data product information, and a user interface for allowing selection of a data product associated with the presented data product or data product information. The subscriber interface unit includes a network interface for connecting the subscriber interface unit to a data product center over a communications network, and an interface for connecting to the portable data unit.

A new way to compute the product and join of relations

Abstract: This paper presents a new method of computing the product or join of n relations in a paged-memory environment. The method, termed the nested-block method, is an attempt to take maximum advantage of available main-memory buffer space. The problem of finding an optimal allocation of main-memory buffer space for the nested-block method of scanning n relations poses a nonlinear integer-programming problem. This paper first describes the operation of the nested-block method, and derives corresponding cost formula. It then presents an efficient heuristic algorithm for determining a near-optimal allocation of main-memory buffer space. The need to compute the product of relations arises naturally in processing n-relation queries. Conventional techniques for computing the join of relations can be complemented by the nested-block method. This paper examines these two important applications of the nested-block method.

On products of non-negative matrices

Abstract: The main theme of this paper is that under wide conditions the product of a large number of square non-negative matrices is close to a positive matrix of rank 1 (A non-negative matrix is one whose elements are non-negative real numbers)