Abstract: A numerical method for solving nonlinear Fredholm integral equations of second kind is proposed. The Fredholm type equations which have many applications in mathematical physics are then considered. The method is based on hybrid function approximations. The properties of hybrid of block-pulse functions and Chebyshev polynomials are presented and are utilized to reduce the computation of nonlinear Fredholm integral equations to a system of nonlinear. Some numerical examples are selected to illustrate the effectiveness and simplicity of the method.
Abstract: Building inspection is one of the key components of building maintenance. The primary purpose of performing a building inspection is to evaluate the building-s condition. Without inspection, it is difficult to determine a built asset-s current condition, so failure to inspect can contribute to the asset-s future failure. Traditionally, a longhand survey description has been widely used for property condition reports. Surveys that employ ratings instead of descriptions are gaining wide acceptance in the industry because they cater to the need for numerical analysis output. These kinds of surveys are also in keeping with the new RICS HomeBuyer Report 2009. In this paper, we propose a new assessment method, derived from the current rating systems, for assessing the specifically smart school building-s condition and rating the seriousness of each defect identified. These two assessment criteria are then multiplied to find the building-s score, which we called the Condition Survey Protocol (CSP) 1 Matrix. Instead of a longhand description of a building-s defects, this matrix requires concise explanations about the defects identified, thus saving on-site time during a smart school building inspection. The full score is used to give the building an overall rating: Good, Fair or Dilapidated.
Abstract: In this paper a one-dimension Self Organizing Map
algorithm (SOM) to perform feature selection is presented. The
algorithm is based on a first classification of the input dataset on a
similarity space. From this classification for each class a set of
positive and negative features is computed. This set of features is
selected as result of the procedure. The procedure is evaluated on an
in-house dataset from a Knowledge Discovery from Text (KDT)
application and on a set of publicly available datasets used in
international feature selection competitions. These datasets come
from KDT applications, drug discovery as well as other applications.
The knowledge of the correct classification available for the training
and validation datasets is used to optimize the parameters for positive
and negative feature extractions. The process becomes feasible for
large and sparse datasets, as the ones obtained in KDT applications,
by using both compression techniques to store the similarity matrix
and speed up techniques of the Kohonen algorithm that take
advantage of the sparsity of the input matrix. These improvements
make it feasible, by using the grid, the application of the
methodology to massive datasets.
Abstract: A company CSR commitment, as stated in its Social
Report is, actually, perceived by its stakeholders?And in what
measure? Moreover, are stakeholders satisfied with the company
CSR efforts? Indeed, business returns from Corporate Social
Responsibility (CSR) practices, such as company reputation and
customer loyalty, depend heavily on how stakeholders perceive the
company social conduct. In this paper, we propose a methodology to
assess a company CSR commitment based on Global Reporting
Initiative (GRI) indicators, Content Analysis and a CSR positioning
matrix. We evaluate three aspects of CSR: the company commitment
disclosed through its Social Report; the company commitment
perceived by its stakeholders; the CSR commitment that stakeholders
require to the company. The positioning of the company under study
in the CSR matrix is based on the comparison among the three
commitment aspects (disclosed, perceived, required) and it allows
assessment and development of CSR strategies.
Abstract: The problem of delay-range-dependent exponential synchronization is investigated for Lur-e master-slave systems with delay feedback control and Markovian switching. Using Lyapunov- Krasovskii functional and nonsingular M-matrix method, novel delayrange- dependent exponential synchronization in mean square criterions are established. The systems discussed in this paper is advanced system, and takes all the features of interval systems, Itˆo equations, Markovian switching, time-varying delay, as well as the environmental noise, into account. Finally, an example is given to show the validity of the main result.
Abstract: In this paper, we present the preconditioned mixed-type
splitting iterative method for solving the linear systems, Ax = b,
where A is a Z-matrix. And we give some comparison theorems
to show that the convergence rate of the preconditioned mixed-type
splitting iterative method is faster than that of the mixed-type splitting
iterative method. Finally, we give a numerical example to illustrate
our results.
Abstract: A P0-matrix is a real square matrix all of whose principle minors are nonnegative. In this paper, we consider the class of P0-matrix. Our main aim is to determine which sign pattern matrices are admissible for this class of real matrices.
Abstract: An important step in three-dimensional reconstruction
and computer vision is camera calibration, whose objective is to
estimate the intrinsic and extrinsic parameters of each camera. In this
paper, two linear methods based on the different planes are given. In
both methods, the general plane is used to replace the calibration
object with very good precision. In the first method, after controlling
the camera to undergo five times- translation movements and taking
pictures of the orthogonal planes, a set of linear constraints of the
camera intrinsic parameters is then derived by means of homography
matrix. The second method is to get all camera parameters by taking
only one picture of a given radius circle. experiments on simulated
data and real images,indicate that our method is reasonable and is a
good supplement to camera calibration.
Abstract: Recently, Uhlig [Numer. Algorithms, 52(3):335-353, 2009] proposed open questions about the ratios between the spectral norm, the numerical radius and the spectral radius of a square matrix. In this note, we provide some observations to answer these questions.
Abstract: Manufacturing components of fiber-reinforced
thermoplastics requires three steps: heating the matrix, forming and
consolidation of the composite and terminal cooling the matrix. For
the heating process a pre-determined temperature distribution through
the layers and the thickness of the pre-consolidated sheets is
recommended to enable forming mechanism. Thus, a design for the
heating process for forming composites with thermoplastic matrices
is necessary. To obtain a constant temperature through thickness and
width of the sheet, the heating process was analyzed by the help of
the finite element method. The simulation models were validated by
experiments with resistance thermometers as well as with an infrared
camera. Based on the finite element simulation, heating methods for
infrared radiators have been developed. Using the numeric
simulation many iteration loops are required to determine the process
parameters. Hence, the initiation of a model for calculating relevant
process parameters started applying regression functions.
Abstract: We analyze the problem of decision making under
ignorance with regrets. Recently, Yager has developed a new method
for decision making where instead of using regrets he uses another
type of transformation called negrets. Basically, the negret is
considered as the dual of the regret. We study this problem in detail
and we suggest the use of geometric aggregation operators in this
method. For doing this, we develop a different method for
constructing the negret matrix where all the values are positive. The
main result obtained is that now the model is able to deal with
negative numbers because of the transformation done in the negret
matrix. We further extent these results to another model developed
also by Yager about mixing valuations and negrets. Unfortunately, in
this case we are not able to deal with negative numbers because the
valuations can be either positive or negative.
Abstract: Neural processors have shown good results for
detecting a certain character in a given input matrix. In this paper, a
new idead to speed up the operation of neural processors for character
detection is presented. Such processors are designed based on cross
correlation in the frequency domain between the input matrix and the
weights of neural networks. This approach is developed to reduce the
computation steps required by these faster neural networks for the
searching process. The principle of divide and conquer strategy is
applied through image decomposition. Each image is divided into
small in size sub-images and then each one is tested separately by
using a single faster neural processor. Furthermore, faster character
detection is obtained by using parallel processing techniques to test the
resulting sub-images at the same time using the same number of faster
neural networks. In contrast to using only faster neural processors, the
speed up ratio is increased with the size of the input image when using
faster neural processors and image decomposition. Moreover, the
problem of local subimage normalization in the frequency domain is
solved. The effect of image normalization on the speed up ratio of
character detection is discussed. Simulation results show that local
subimage normalization through weight normalization is faster than
subimage normalization in the spatial domain. The overall speed up
ratio of the detection process is increased as the normalization of
weights is done off line.
Abstract: Automated discovery of Rule is, due to its applicability, one of the most fundamental and important method in KDD. It has been an active research area in the recent past. Hierarchical representation allows us to easily manage the complexity of knowledge, to view the knowledge at different levels of details, and to focus our attention on the interesting aspects only. One of such efficient and easy to understand systems is Hierarchical Production rule (HPRs) system. A HPR, a standard production rule augmented with generality and specificity information, is of the following form: Decision If < condition> Generality Specificity . HPRs systems are capable of handling taxonomical structures inherent in the knowledge about the real world. This paper focuses on the issue of mining Quantified rules with crisp hierarchical structure using Genetic Programming (GP) approach to knowledge discovery. The post-processing scheme presented in this work uses Quantified production rules as initial individuals of GP and discovers hierarchical structure. In proposed approach rules are quantified by using Dempster Shafer theory. Suitable genetic operators are proposed for the suggested encoding. Based on the Subsumption Matrix(SM), an appropriate fitness function is suggested. Finally, Quantified Hierarchical Production Rules (HPRs) are generated from the discovered hierarchy, using Dempster Shafer theory. Experimental results are presented to demonstrate the performance of the proposed algorithm.
Abstract: Matrix metalloproteinases (MMP) are a class of
structural and functional related enzymes involved in altering the
natural elements of the extracellular matrix. Most of the MMP
structures are cristalographycally determined and published in
WorldWide ProteinDataBank, isolated, in full structure or bound to
natural or synthetic inhibitors. This study proposes an algorithm to
replace missing crystallographic structures in PDB database. We
have compared the results of a chosen docking algorithm with a
known crystallographic structure in order to validate enzyme sites
reconstruction there where crystallographic data are missing.
Abstract: Linear Discrimination Analysis (LDA) is a linear
solution for classification of two classes. In this paper, we propose a
variant LDA method for multi-class problem which redefines the
between class and within class scatter matrices by incorporating a
weight function into each of them. The aim is to separate classes as
much as possible in a situation that one class is well separated from
other classes, incidentally, that class must have a little influence on
classification. It has been suggested to alleviate influence of classes
that are well separated by adding a weight into between class scatter
matrix and within class scatter matrix. To obtain a simple and
effective weight function, ordinary LDA between every two classes
has been used in order to find Fisher discrimination value and passed
it as an input into two weight functions and redefined between class
and within class scatter matrices. Experimental results showed that
our new LDA method improved classification rate, on glass, iris and
wine datasets, in comparison to different versions of LDA.
Abstract: A square matrix over the complex field with non- negative integral trace is called a quasi-permutation matrix. For a finite group G the minimal degree of a faithful representation of G by quasi-permutation matrices over the rationals and the complex numbers are denoted by q(G) and c(G) respectively. Finally r (G) denotes the minimal degree of a faithful rational valued complex character of C. The purpose of this paper is to calculate q(G), c(G) and r(G) for the group S L(2, q) when extended by a certain group of order two.
Abstract: The problem of incompressible steady flow simulation around an airfoil is discussed. For some simplest airfoils (circular, elliptical, Zhukovsky airfoils) the exact solution is known from complex analysis. It allows to compute the intensity of vortex layer which simulates the airfoil. Some modifications of the vortex element method are proposed and test computations are carried out. It-s shown that the these approaches are much more effective in comparison with the classical numerical scheme.
Abstract: Using state space technique and GF(2) theory, a
simulation model for external exclusive NOR type LFSR structures is
developed. Through this tool a systematic procedure is devised for
computing pseudo-random binary sequences from such structures.
Abstract: In this note, we demonstrate explicit LU
factorizations of Toeplitz matrices for some small sizes. Furthermore,
we obtain the inverse of referred Toeplitz matrices by appling the
above-mentioned results.
Abstract: This paper presents a practical scheme that can be used for allocating the transmission loss to generators and loads. In this scheme first the share of a generator or load on the current through a branch is determined using Z-bus modified matrix. Then the current components are decomposed and the branch loss allocation is obtained. A motivation of proposed scheme is to improve the results of Z-bus method and to reach more fair allocation. The proposed scheme has been implemented and tested on several networks. To achieve practical and applicable results, the proposed scheme is simulated and compared on the transmission network (400kv) of Khorasan region in Iran and the 14-bus standard IEEE network. The results show that the proposed scheme is comprehensive and fair to allocating the energy losses of a power market to its participants.