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: To define or predict incipient motion in an alluvial
channel, most of the investigators use a standard or modified form of
Shields- diagram. Shields- diagram does give a process to determine
the incipient motion parameters but an iterative one. To design
properly (without iteration), one should have another equation for
resistance. Absence of a universal resistance equation also magnifies
the difficulties in defining the model. Neural network technique,
which is particularly useful in modeling a complex processes, is
presented as a tool complimentary to modeling incipient motion.
Present work develops a neural network model employing the RBF
network to predict the average velocity u and water depth y based on
the experimental data on incipient condition. Based on the model,
design curves have been presented for the field application.
Abstract: This paper presents the results related to the
interference reduction technique in multistage multiuser detector for
asynchronous DS-CDMA system. To meet the real-time
requirements for asynchronous multiuser detection, a bit streaming,
cascade architecture is used. An asynchronous multiuser detection
involves block-based computations and matrix inversions. The paper
covers iterative-based suboptimal schemes that have been studied to
decrease the computational complexity, eliminate the need for matrix
inversions, decreases the execution time, reduces the memory
requirements and uses joint estimation and detection process that
gives better performance than the independent parameter estimation
method. The stages of the iteration use cascaded and bits processed
in a streaming fashion. The simulation has been carried out for
asynchronous DS-CDMA system by varying one parameter, i.e.,
number of users. The simulation result exhibits that system gives
optimum bit error rate (BER) at 3rd stage for 15-users.
Abstract: In this note, we consider a family of iterative formula for computing the weighted Minskowski inverses AM,N in Minskowski space, and give two kinds of iterations and the necessary and sufficient conditions of the convergence of iterations.
Abstract: A model based fault detection and diagnosis
technique for DC motor is proposed in this paper. Fault detection
using Kalman filter and its different variants are compared. Only
incipient faults are considered for the study. The Kalman Filter
iterations and all the related computations required for fault detection
and fault confirmation are presented. A second order linear state
space model of DC motor is used for this work. A comparative
assessment of the estimates computed from four different observers
and their relative performance is evaluated.
Abstract: Since the presentation of the backpropagation algorithm, a vast variety of improvements of the technique for training a feed forward neural networks have been proposed. This article focuses on two classes of acceleration techniques, one is known as Local Adaptive Techniques that are based on weightspecific only, such as the temporal behavior of the partial derivative of the current weight. The other, known as Dynamic Adaptation Methods, which dynamically adapts the momentum factors, α, and learning rate, η, with respect to the iteration number or gradient. Some of most popular learning algorithms are described. These techniques have been implemented and tested on several problems and measured in terms of gradient and error function evaluation, and percentage of success. Numerical evidence shows that these techniques improve the convergence of the Backpropagation algorithm.
Abstract: We present here the results for a comparative study of
some techniques, available in the literature, related to the relevance
feedback mechanism in the case of a short-term learning. Only one
method among those considered here is belonging to the data mining
field which is the K-nearest neighbors algorithm (KNN) while the
rest of the methods is related purely to the information retrieval field
and they fall under the purview of the following three major axes:
Shifting query, Feature Weighting and the optimization of the
parameters of similarity metric. As a contribution, and in addition to
the comparative purpose, we propose a new version of the KNN
algorithm referred to as an incremental KNN which is distinct from
the original version in the sense that besides the influence of the
seeds, the rate of the actual target image is influenced also by the
images already rated. The results presented here have been obtained
after experiments conducted on the Wang database for one iteration
and utilizing color moments on the RGB space. This compact
descriptor, Color Moments, is adequate for the efficiency purposes
needed in the case of interactive systems. The results obtained allow
us to claim that the proposed algorithm proves good results; it even
outperforms a wide range of techniques available in the literature.
Abstract: This paper presents a particle swarm optimization
(PSO) based approach for multiple object tracking based on histogram
matching. To start with, gray-level histograms are calculated to
establish a feature model for each of the target object. The difference
between the gray-level histogram corresponding to each particle in the
search space and the target object is used as the fitness value. Multiple
swarms are created depending on the number of the target objects
under tracking. Because of the efficiency and simplicity of the PSO
algorithm for global optimization, target objects can be tracked as
iterations continue. Experimental results confirm that the proposed
PSO algorithm can rapidly converge, allowing real-time tracking of
each target object. When the objects being tracked move outside the
tracking range, global search capability of the PSO resumes to re-trace
the target objects.
Abstract: Service identification is one of the main activities in
the modeling of a service-oriented solution, and therefore errors
made during identification can flow down through detailed design
and implementation activities that may necessitate multiple
iterations, especially in building composite applications. Different
strategies exist for how to identify candidate services that each of
them has its own benefits and trade offs. The approach presented in
this paper proposes a selective identification of services approach,
based on in depth business process analysis coupled with use cases
and existing assets analysis and goal service modeling. This article
clearly emphasizes the key activities need for the analysis and
service identification to build a optimized service oriented
architecture. In contrast to other approaches this article mentions
some best practices and steps, wherever appropriate, to point out the
vagueness involved in service identification.
Abstract: In this paper, we consider an iteration process for
approximating common fixed points of two asymptotically quasinonexpansive
mappings and we prove some strong and weak convergence
theorems for such mappings in uniformly convex Banach
spaces.
Abstract: Architecture education was based on apprenticeship
models and its nature has not changed much during long period but
the Source of changes was its evaluation process and system. It is
undeniable that art and architecture education is completely based on
transmitting knowledge from instructor to students. In contrast to
other majors this transmitting is by iteration and practice and studio
masters try to control the design process and improving skills in the
form of supervision and criticizing. Also the evaluation will end by
giving marks to students- achievements. Therefore the importance of
the evaluation and assessment role is obvious and it is not irrelevant
to say that if we want to know about the architecture education
system, we must first study its assessment procedures. The evolution
of these changes in western countries has literate and documented
well. However it seems that this procedure has unregarded in
Malaysia and there is a severe lack of research and documentation in
this area. Malaysia as an under developing and multicultural country
which is involved different races and cultures is a proper origin for
scrutinizing and understanding the evaluation systems and
acceptability amount of current implemented models to keep the
evaluation and assessment procedure abreast with needs of different
generations, cultures and even genders. This paper attempts to
answer the questions of how evaluation and assessments are
performed and how students perceive this evaluation system in the
context Malaysia. The main advantage of this work is that it
contributes in international debate on evaluation model.
Abstract: Super resolution (SR) technologies are now being
applied to video to improve resolution. Some TV sets are now
equipped with SR functions. However, it is not known if super
resolution image reconstruction (SRR) for TV really works or not.
Super resolution with non-linear signal processing (SRNL) has
recently been proposed. SRR and SRNL are the only methods for
processing video signals in real time. The results from subjective
assessments of SSR and SRNL are described in this paper. SRR video
was produced in simulations with quarter precision motion vectors and
100 iterations. These are ideal conditions for SRR. We found that the
image quality of SRNL is better than that of SRR even though SRR
was processed under ideal conditions.
Abstract: There are two common types of operational research techniques, optimisation and metaheuristic methods. The latter may be defined as a sequential process that intelligently performs the exploration and exploitation adopted by natural intelligence and strong inspiration to form several iterative searches. An aim is to effectively determine near optimal solutions in a solution space. In this work, a type of metaheuristics called Ant Colonies Optimisation, ACO, inspired by a foraging behaviour of ants was adapted to find optimal solutions of eight non-linear continuous mathematical models. Under a consideration of a solution space in a specified region on each model, sub-solutions may contain global or multiple local optimum. Moreover, the algorithm has several common parameters; number of ants, moves, and iterations, which act as the algorithm-s driver. A series of computational experiments for initialising parameters were conducted through methods of Rigid Simplex, RS, and Modified Simplex, MSM. Experimental results were analysed in terms of the best so far solutions, mean and standard deviation. Finally, they stated a recommendation of proper level settings of ACO parameters for all eight functions. These parameter settings can be applied as a guideline for future uses of ACO. This is to promote an ease of use of ACO in real industrial processes. It was found that the results obtained from MSM were pretty similar to those gained from RS. However, if these results with noise standard deviations of 1 and 3 are compared, MSM will reach optimal solutions more efficiently than RS, in terms of speed of convergence.
Abstract: One of the purposes of the robust method of
estimation is to reduce the influence of outliers in the data, on the
estimates. The outliers arise from gross errors or contamination from
distributions with long tails. The trimmed mean is a robust estimate.
This means that it is not sensitive to violation of distributional
assumptions of the data. It is called an adaptive estimate when the
trimming proportion is determined from the data rather than being
fixed a “priori-.
The main objective of this study is to find out the robustness
properties of the adaptive trimmed means in terms of efficiency, high
breakdown point and influence function. Specifically, it seeks to find
out the magnitude of the trimming proportion of the adaptive
trimmed mean which will yield efficient and robust estimates of the
parameter for data which follow a modified Weibull distribution with
parameter λ = 1/2 , where the trimming proportion is determined by a
ratio of two trimmed means defined as the tail length. Secondly, the
asymptotic properties of the tail length and the trimmed means are
also investigated. Finally, a comparison is made on the efficiency of
the adaptive trimmed means in terms of the standard deviation for the
trimming proportions and when these were fixed a “priori".
The asymptotic tail lengths defined as the ratio of two trimmed
means and the asymptotic variances were computed by using the
formulas derived. While the values of the standard deviations for the
derived tail lengths for data of size 40 simulated from a Weibull
distribution were computed for 100 iterations using a computer
program written in Pascal language.
The findings of the study revealed that the tail lengths of the
Weibull distribution increase in magnitudes as the trimming
proportions increase, the measure of the tail length and the adaptive
trimmed mean are asymptotically independent as the number of
observations n becomes very large or approaching infinity, the tail
length is asymptotically distributed as the ratio of two independent
normal random variables, and the asymptotic variances decrease as
the trimming proportions increase. The simulation study revealed
empirically that the standard error of the adaptive trimmed mean
using the ratio of tail lengths is relatively smaller for different values
of trimming proportions than its counterpart when the trimming
proportions were fixed a 'priori'.
Abstract: In this paper, we use a one-step iteration scheme to approximate common fixed points of two quasi-asymptotically nonexpansive mappings. We prove weak and strong convergence theorems in a uniformly convex Banach space. Our results generalize the corresponding results of Yao and Chen [15] to a wider class of mappings while extend those of Khan, Abbas and Khan [4] to an improved one-step iteration scheme without any condition and improve upon many others in the literature.
Abstract: Truss spars are used for oil exploitation in deep and ultra-deep water if storage crude oil is not needed. The linear hydrodynamic analysis of truss spar in random sea wave load is necessary for determining the behaviour of truss spar. This understanding is not only important for design of the mooring lines, but also for optimising the truss spar design. In this paper linear hydrodynamic analysis of truss spar is carried out in frequency domain. The hydrodynamic forces are calculated using the modified Morison equation and diffraction theory. Added mass and drag coefficients of truss section computed by transmission matrix and normal acceleration and velocity component acting on each element and for hull section computed by strip theory. The stiffness properties of the truss spar can be separated into two components; hydrostatic stiffness and mooring line stiffness. Then, platform response amplitudes obtained by solved the equation of motion. This equation is non-linear due to viscous damping term therefore linearised by iteration method [1]. Finally computed RAOs and significant response amplitude and results are compared with experimental data.
Abstract: Transliteration is frequently used especially in writing geographic denominations, personal names (onyms) etc. Proper names (onyms) of all languages must sound similarly in translated works as well as in scientific projects and works written in mother tongue, because we can get introduced with the nation, its history, culture, traditions and other spiritual values through the onyms of that nation. Therefore it is necessary to systematize the different transliterations of onyms of foreign languages. This paper is dedicated to the problem of making the project of transliterating Kazakh onyms into Arabic. In order to achieve this goal we use scientific or practical types of transliteration. Because in this type of transliteration provides easy reading writing source language's texts in the target language without any diacritical symbols, it is limited by the target language's alphabetic system.
Abstract: Let T and S be a subspace of Cn and Cm, respectively.
Then for A ∈ Cm×n satisfied AT ⊕ S = Cm, the generalized
inverse A(2)
T,S is given by A(2)
T,S = (PS⊥APT )†. In this paper, a
finite formulae is presented to compute generalized inverse A(2)
T,S
under the concept of restricted inner product, which defined as <
A,B >T,S=< PS⊥APT,B > for the A,B ∈ Cm×n. By this
iterative method, when taken the initial matrix X0 = PTA∗PS⊥, the
generalized inverse A(2)
T,S can be obtained within at most mn iteration
steps in absence of roundoff errors. Finally given numerical example
is shown that the iterative formulae is quite efficient.
Abstract: The paper describes the futures trading and aims to
design the speculators trading strategy. The problem is formulated as
the decision making task and such as is solved. The solution of the
task leads to complex mathematical problems and the approximations
of the decision making is demanded. Two kind of approximation are
used in the paper: Monte Carlo for the multi-step prediction and
iteration spread in time for the optimization. The solution is applied to the real-market data and the results of the off-line experiments are
presented.
Abstract: This paper presents a generalized form of the
mechanistic deconvolution technique (GMD) to modeling image sensors applicable in various pan–tilt planes of view. The mechanistic deconvolution technique (UMD) is modified with the
given angles of a pan–tilt plane of view to formulate constraint parameters and characterize distortion effects, and thereby, determine
the corrected image data. This, as a result, does not require experimental setup or calibration. Due to the mechanistic nature of
the sensor model, the necessity for the sensor image plane to be
orthogonal to its z-axis is eliminated, and it reduces the dependency on image data. An experiment was constructed to evaluate the
accuracy of a model created by GMD and its insensitivity to changes in sensor properties and in pan and tilt angles. This was compared
with a pre-calibrated model and a model created by UMD using two sensors with different specifications. It achieved similar accuracy
with one-seventh the number of iterations and attained lower mean error by a factor of 2.4 when compared to the pre-calibrated and
UMD model respectively. The model has also shown itself to be robust and, in comparison to pre-calibrated and UMD model, improved the accuracy significantly.