Abstract: In this paper presents a technique for developing the
computational efficiency in simulating double output induction
generators (DOIG) with two rotor circuits where stator transients are
to be included. Iterative decomposition is used to separate the flux–
Linkage equations into decoupled fast and slow subsystems, after
which the model order of the fast subsystems is reduced by
neglecting the heavily damped fast transients caused by the second
rotor circuit using integral manifolds theory. The two decoupled
subsystems along with the equation for the very slowly changing slip
constitute a three time-scale model for the machine which resulted in
increasing computational speed. Finally, the proposed method of
reduced order in this paper is compared with the other conventional
methods in linear and nonlinear modes and it is shown that this
method is better than the other methods regarding simulation
accuracy and speed.
Abstract: Signal processing applications which are iterative in
nature are best represented by data flow graphs (DFG). In these
applications, the maximum sampling frequency is dependent on the
topology of the DFG, the cyclic dependencies in particular. The
determination of the iteration bound, which is the reciprocal of the
maximum sampling frequency, is critical in the process of hardware
implementation of signal processing applications. In this paper, a
novel technique to compute the iteration bound is proposed. This
technique is different from all previously proposed techniques, in the
sense that it is based on the natural flow of tokens into the DFG
rather than the topology of the graph. The proposed algorithm has
lower run-time complexity than all known algorithms. The
performance of the proposed algorithm is illustrated through
analytical analysis of the time complexity, as well as through
simulation of some benchmark problems.
Abstract: This paper addresses the problem of how one can
improve the performance of a non-optimal filter. First the theoretical question on dynamical representation for a given time correlated
random process is studied. It will be demonstrated that for a wide class of random processes, having a canonical form, there exists
a dynamical system equivalent in the sense that its output has the
same covariance function. It is shown that the dynamical approach is more effective for simulating and estimating a Markov and non-
Markovian random processes, computationally is less demanding,
especially with increasing of the dimension of simulated processes.
Numerical examples and estimation problems in low dimensional
systems are given to illustrate the advantages of the approach. A very useful application of the proposed approach is shown for the
problem of state estimation in very high dimensional systems. Here a modified filter for data assimilation in an oceanic numerical model
is presented which is proved to be very efficient due to introducing
a simple Markovian structure for the output prediction error process
and adaptive tuning some parameters of the Markov equation.
Abstract: In this work, propagation of uncertainty during calibration
process of TRANUS, an integrated land use and transport model
(ILUTM), has been investigated. It has also been examined, through a
sensitivity analysis, which input parameters affect the variation of the
outputs the most. Moreover, a probabilistic verification methodology
of calibration process, which equates the observed and calculated
production, has been proposed. The model chosen as an application is
the model of the city of Grenoble, France. For sensitivity analysis and
uncertainty propagation, Monte Carlo method was employed, and a
statistical hypothesis test was used for verification. The parameters of
the induced demand function in TRANUS, were assumed as uncertain
in the present case. It was found that, if during calibration, TRANUS
converges, then with a high probability the calibration process is
verified. Moreover, a weak correlation was found between the inputs
and the outputs of the calibration process. The total effect of the
inputs on outputs was investigated, and the output variation was found
to be dictated by only a few input parameters.
Abstract: Embedding and extraction of a secret information as
well as the restoration of the original un-watermarked image is
highly desirable in sensitive applications like military, medical, and
law enforcement imaging. This paper presents a novel reversible
data-hiding method for digital images using integer to integer
wavelet transform and companding technique which can embed and
recover the secret information as well as can restore the image to its
pristine state. The novel method takes advantage of block based
watermarking and iterative optimization of threshold for companding
which avoids histogram pre and post-processing. Consequently, it
reduces the associated overhead usually required in most of the
reversible watermarking techniques. As a result, it keeps the
distortion small between the marked and the original images.
Experimental results show that the proposed method outperforms the
existing reversible data hiding schemes reported in the literature.
Abstract: Surveillance system is widely used in the traffic
monitoring. The deployment of cameras is moving toward a
ubiquitous camera (UbiCam) environment. In our previous study, a
novel service, called GPS-VT, was firstly proposed by incorporating
global positioning system (GPS) and visual tracking techniques for
the UbiCam environment. The first prototype is called GODTA
(GPS-based Moving Object Detection and Tracking Approach). For a
moving person carried GPS-enabled mobile device, he can be
tracking when he enters the field-of-view (FOV) of a camera
according to his real-time GPS coordinate. In this paper, GPS-VT
service is applied to the tracking of vehicles. The moving speed of a
vehicle is much faster than a person. It means that the time passing
through the FOV is much shorter than that of a person. Besides, the
update interval of GPS coordinate is once per second, it is
asynchronous with the frame rate of the real-time image. The above
asynchronous is worsen by the network transmission delay. These
factors are the main challenging to fulfill GPS-VT service on a
vehicle.In order to overcome the influence of the above factors, a
back-propagation neural network (BPNN) is used to predict the
possible lane before the vehicle enters the FOV of a camera. Then, a
template matching technique is used for the visual tracking of a target
vehicle. The experimental result shows that the target vehicle can be
located and tracking successfully. The success location rate of the
implemented prototype is higher than that of the previous GODTA.
Abstract: In the domain of machine vision, the
measurement of length is done using cameras where the
accuracy is directly proportional to the resolution of the
camera and inversely to the size of the object. Since most of
the pixels are wasted imaging the entire body as opposed to
just imaging the edges in a conventional system, a double
aperture system is constructed to focus on the edges to
measure at higher resolution. The paper discusses the
complexities and how they are mitigated to realize a practical
machine vision system.
Abstract: In this study, we are interested in the economic lot
scheduling problem (ELSP) that considers manufacturing of the
serviceable products and remanufacturing of the reworked products. In
this paper, we formulate a mathematical model for the ELSP with
reworks using the basic period approach. In order to solve this
problem, we propose a search algorithm to find the cyclic multiplier ki
of each product that can be cyclically produced for every ki basic
periods. This research also uses two heuristics to search for the optimal
production sequence of all lots and the optimal time length of the basic
period so as to minimize the average total cost. This research uses a
numerical example to show the effectiveness of our approach.
Abstract: We propose a low-cost uniform analysis framework
allowing comparison of the strengths and weaknesses of the
bicycling experience within and between cities. A primary
component is an expedient, one-page mobility survey from which
mode share is calculated. The bicycle mode share of many cities
remains unknown, creating a serious barrier for both scientists and
policy makers aiming to understand and increase rates of bicycling.
Because of its low cost and expedience, this framework could be
replicated widely, uniformly filling the data gap. The framework has
been applied to 13 Central European cities with success. Data is
collected on multiple modes with specific questions regarding both
behavior and quality of travel experience. Individual preferences are
also collected, examining the conditions under which respondents
would change behavior to adopt more sustainable modes (bicycling
or public transportation). A broad analysis opportunity results,
intended to inform policy choices.
Abstract: In this article we propose to model Net-banking
system by game theory. We adopt extensive game to model our web
application. We present the model in term of players and strategy.
We present UML diagram related the protocol game.
Abstract: As a security mechanism, authorization is to provide access control to the system resources according to the polices and rules specified by the security strategies. Either by update or in the initial specification, conflicts in authorization is an issue needs to be solved. In this paper, we propose a new approach to solve conflict by using prioritized logic programs and discuss the uniqueness of its answer set. Addressing conflict resolution from logic programming viewpoint and the uniqueness analysis of the answer set provide a novel, efficient approach for authorization conflict resolution.
Abstract: Machining is an important manufacturing process used to produce a wide variety of metallic parts. Among various machining processes, turning is one of the most important one which is employed to shape cylindrical parts. In turning, the quality of finished product is measured in terms of surface roughness. In turn, surface quality is determined by machining parameters and tool geometry specifications. The main objective of this study is to simultaneously model and optimize machining parameters and tool geometry in order to improve the surface roughness for AISI1045 steel. Several levels of machining parameters and tool geometry specifications are considered as input parameters. The surface roughness is selected as process output measure of performance. A Taguchi approach is employed to gather experimental data. Then, based on signal-to-noise (S/N) ratio, the best sets of cutting parameters and tool geometry specifications have been determined. Using these parameters values, the surface roughness of AISI1045 steel parts may be minimized. Experimental results are provided to illustrate the effectiveness of the proposed approach.
Abstract: The resource-based view of the firm regards
knowledge as one of the most important organizational assets and a
key strategic resource that contributes unique value to organizations.
The acquisition, absorption and internalization of external
knowledge are central to an organization-s innovative capabilities.
This ability to evaluate, acquire and integrate new knowledge from
its environment is referred to as a firm-s absorptive capacity (AC).
This research in progress paper explores the link between interorganizational
Social Networks (SNs) and a firm-s Absorptive
Capacity (AC). Based on an in-depth literature survey of both
concepts, four propositions are proposed that explain the link
between AC and SNs. These propositions suggest that SNs are key
to a firm-s AC. A qualitative research method is proposed to test the
set of propositions in the next stage of this research.
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: Given a large sparse signal, great wishes are to
reconstruct the signal precisely and accurately from lease number of
measurements as possible as it could. Although this seems possible
by theory, the difficulty is in built an algorithm to perform the
accuracy and efficiency of reconstructing. This paper proposes a new
proved method to reconstruct sparse signal depend on using new
method called Least Support Matching Pursuit (LS-OMP) merge it
with the theory of Partial Knowing Support (PSK) given new method
called Partially Knowing of Least Support Orthogonal Matching
Pursuit (PKLS-OMP).
The new methods depend on the greedy algorithm to compute the
support which depends on the number of iterations. So to make it
faster, the PKLS-OMP adds the idea of partial knowing support of its
algorithm. It shows the efficiency, simplicity, and accuracy to get
back the original signal if the sampling matrix satisfies the Restricted
Isometry Property (RIP).
Simulation results also show that it outperforms many algorithms
especially for compressible signals.
Abstract: XML data consists of a very flexible tree-structure
which makes it difficult to support the storing and retrieving of XML
data. The node numbering scheme is one of the most popular
approaches to store XML in relational databases. Together with the
node numbering storage scheme, structural joins can be used to
efficiently process the hierarchical relationships in XML. However, in
order to process a tree-structured XPath query containing several
hierarchical relationships and conditional sentences on XML data,
many structural joins need to be carried out, which results in a high
query execution cost. This paper introduces mechanisms to reduce the
XPath queries including branch nodes into a much more efficient form
with less numbers of structural joins. A two step approach is proposed.
The first step merges duplicate nodes in the tree-structured query and
the second step divides the query into sub-queries, shortens the paths
and then merges the sub-queries back together. The proposed
approach can highly contribute to the efficient execution of XML
queries. Experimental results show that the proposed scheme can
reduce the query execution cost by up to an order of magnitude of the
original execution cost.
Abstract: In this paper, the vessel inscribed trigonometry (VITM) for the vessel progression orientation (VPO) is proposed in the two-dimensional fundus image. The VPO is a major factor in the optic disc (OD) detection which is a basic process in the retina analysis. To measure the VPO, skeletons of vessel are used. First, the vessels are classified into three classes as vessel end, vessel branch and vessel stem. And the chain code maps of VS are generated. Next, two farthest neighborhoods of each point on VS are searched by the proposed angle restriction. Lastly, a gradient of the straight line between two farthest neighborhoods is estimated to measure the VPO. VITM is validated by comparing with manual results and 2D Gaussian templates. It is confirmed that VPO of the proposed mensuration is correct enough to detect OD from the results of experiment which applied VITM to detect OD in fundus images.
Abstract: This paper presents a single correlator RAKE receiver for direct sequence code division multiple access (DS-CDMA) systems. In conventional RAKE receivers, multiple correlators are used to despread the multipath signals and then to align and combine those signals in a later stage before making a bit decision. The simplified receiver structure presented here uses a single correlator and single code sequence generator to recover the multipaths. Modified Walsh- Hadamard codes are used here for data spreading that provides better uncorrelation properties for the multipath signals. The main advantage of this receiver structure is that it requires only a single correlator and a code generator in contrary to the conventional RAKE receiver concept with multiple correlators. It is shown in results that the proposed receiver achieves better bit error rates in comparison with the conventional one for more than one multipaths.
Abstract: This paper addresses the problem of source separation
in images. We propose a FastICA algorithm employing a modified
Gaussian contrast function for the Blind Source Separation.
Experimental result shows that the proposed Modified Gaussian
FastICA is effectively used for Blind Source Separation to obtain
better quality images. In this paper, a comparative study has been
made with other popular existing algorithms. The peak signal to
noise ratio (PSNR) and improved signal to noise ratio (ISNR) are
used as metrics for evaluating the quality of images. The ICA metric
Amari error is also used to measure the quality of separation.
Abstract: The increasing development of wireless networks and
the widespread popularity of handheld devices such as Personal
Digital Assistants (PDAs), mobile phones and wireless tablets
represents an incredible opportunity to enable mobile devices as a
universal payment method, involving daily financial transactions.
Unfortunately, some issues hampering the widespread acceptance of
mobile payment such as accountability properties, privacy protection,
limitation of wireless network and mobile device. Recently, many
public-key cryptography based mobile payment protocol have been
proposed. However, limited capabilities of mobile devices and
wireless networks make these protocols are unsuitable for mobile
network. Moreover, these protocols were designed to preserve
traditional flow of payment data, which is vulnerable to attack and
increase the user-s risk. In this paper, we propose a private mobile
payment protocol which based on client centric model and by
employing symmetric key operations. The proposed mobile payment
protocol not only minimizes the computational operations and
communication passes between the engaging parties, but also
achieves a completely privacy protection for the payer. The future
work will concentrate on improving the verification solution to
support mobile user authentication and authorization for mobile
payment transactions.