Abstract: This paper proposes a feed-forward control in
resonant dc link inverter. The feed-forward control configuration is
based on synchronous sigma-delta modulation. The simulation
results showing the proposed technique can reject non-ideal dc bus
improving the total harmonic distortion.
Abstract: Tracing and locating the geographical location of users (Geolocation) is used extensively in todays Internet. Whenever we, e.g., request a page from google we are - unless there was a specific configuration made - automatically forwarded to the page with the relevant language and amongst others, dependent on our location identified, specific commercials are presented. Especially within the area of Network Security, Geolocation has a significant impact. Because of the way the Internet works, attacks can be executed from almost everywhere. Therefore, for an attribution, knowledge of the origination of an attack - and thus Geolocation - is mandatory in order to be able to trace back an attacker. In addition, Geolocation can also be used very successfully to increase the security of a network during operation (i.e. before an intrusion actually has taken place). Similar to greylisting in emails, Geolocation allows to (i) correlate attacks detected with new connections and (ii) as a consequence to classify traffic a priori as more suspicious (thus particularly allowing to inspect this traffic in more detail). Although numerous techniques for Geolocation are existing, each strategy is subject to certain restrictions. Following the ideas of Endo et al., this publication tries to overcome these shortcomings with a combined solution of different methods to allow improved and optimized Geolocation. Thus, we present our architecture for improved Geolocation, by designing a new algorithm, which combines several Geolocation techniques to increase the accuracy.
Abstract: This paper proposes a new approach for image encryption
using a combination of different permutation techniques.
The main idea behind the present work is that an image can be
viewed as an arrangement of bits, pixels and blocks. The intelligible
information present in an image is due to the correlations among the
bits, pixels and blocks in a given arrangement. This perceivable information
can be reduced by decreasing the correlation among the bits,
pixels and blocks using certain permutation techniques. This paper
presents an approach for a random combination of the aforementioned
permutations for image encryption. From the results, it is observed
that the permutation of bits is effective in significantly reducing the
correlation thereby decreasing the perceptual information, whereas
the permutation of pixels and blocks are good at producing higher
level security compared to bit permutation. A random combination
method employing all the three techniques thus is observed to be
useful for tactical security applications, where protection is needed
only against a casual observer.
Abstract: Image retrieval is a topic where scientific interest is currently high. The important steps associated with image retrieval system are the extraction of discriminative features and a feasible similarity metric for retrieving the database images that are similar in content with the search image. Gabor filtering is a widely adopted technique for feature extraction from the texture images. The recently proposed sparsity promoting l1-norm minimization technique finds the sparsest solution of an under-determined system of linear equations. In the present paper, the l1-norm minimization technique as a similarity metric is used in image retrieval. It is demonstrated through simulation results that the l1-norm minimization technique provides a promising alternative to existing similarity metrics. In particular, the cases where the l1-norm minimization technique works better than the Euclidean distance metric are singled out.
Abstract: The selection for plantation of a particular type of
mustard plant depending on its productivity (pod yield) at the stage
of maturity. The growth of mustard plant dependent on some
parameters of that plant, these are shoot length, number of leaves,
number of roots and roots length etc. As the plant is growing, some
leaves may be fall down and some new leaves may come, so it can
not gives the idea to develop the relationship with the seeds weight at
mature stage of that plant. It is not possible to find the number of
roots and root length of mustard plant at growing stage that will be
harmful of this plant as roots goes deeper to deeper inside the land.
Only the value of shoot length which increases in course of time can
be measured at different time instances. Weather parameters are
maximum and minimum humidity, rain fall, maximum and minimum
temperature may effect the growth of the plant. The parameters of
pollution, water, soil, distance and crop management may be
dominant factors of growth of plant and its productivity. Considering
all parameters, the growth of the plant is very uncertain, fuzzy
environment can be considered for the prediction of shoot length at
maturity of the plant. Fuzzification plays a greater role for
fuzzification of data, which is based on certain membership
functions. Here an effort has been made to fuzzify the original data
based on gaussian function, triangular function, s-function,
Trapezoidal and L –function. After that all fuzzified data are
defuzzified to get normal form. Finally the error analysis
(calculation of forecasting error and average error) indicates the
membership function appropriate for fuzzification of data and use to
predict the shoot length at maturity. The result is also verified using
residual (Absolute Residual, Maximum of Absolute Residual, Mean
Absolute Residual, Mean of Mean Absolute Residual, Median of
Absolute Residual and Standard Deviation) analysis.
Abstract: This paper presents a new heuristic algorithm for the classical symmetric traveling salesman problem (TSP). The idea of the algorithm is to cut a TSP tour into overlapped blocks and then each block is improved separately. It is conjectured that the chance of improving a good solution by moving a node to a position far away from its original one is small. By doing intensive search in each block, it is possible to further improve a TSP tour that cannot be improved by other local search methods. To test the performance of the proposed algorithm, computational experiments are carried out based on benchmark problem instances. The computational results show that algorithm proposed in this paper is efficient for solving the TSPs.
Abstract: Multiple criteria decision making (MCDM) is an approach to ranking the solutions and finding the best one when two or more solutions are provided. In this study, MCDM approach is proposed to select the most suitable scheduling rule of robotic flexible assembly cells (RFACs). Two MCDM approaches, Analytic Hierarchy Process (AHP) and Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) are proposed for solving the scheduling rule selection problem. The AHP method is employed to determine the weights of the evaluation criteria, while the TOPSIS method is employed to obtain final ranking order of scheduling rules. Four criteria are used to evaluate the scheduling rules. Also, four scheduling policies of RFAC are examined to choose the most appropriate one for this purpose. A numerical example illustrates applications of the suggested methodology. The results show that the methodology is practical and works in RFAC settings.
Abstract: Several numerical schemes utilizing central difference
approximations have been developed to solve the Goursat problem.
However, in a recent years compact discretization methods which
leads to high-order finite difference schemes have been used since it
is capable of achieving better accuracy as well as preserving certain
features of the equation e.g. linearity. The basic idea of the new
scheme is to find the compact approximations to the derivative terms
by differentiating centrally the governing equations. Our primary
interest is to study the performance of the new scheme when applied
to two Goursat partial differential equations against the traditional
finite difference scheme.
Abstract: Intrusion detection is a mechanism used to protect a
system and analyse and predict the behaviours of system users. An
ideal intrusion detection system is hard to achieve due to
nonlinearity, and irrelevant or redundant features. This study
introduces a new anomaly-based intrusion detection model. The
suggested model is based on particle swarm optimisation and
nonlinear, multi-class and multi-kernel support vector machines.
Particle swarm optimisation is used for feature selection by applying
a new formula to update the position and the velocity of a particle;
the support vector machine is used as a classifier. The proposed
model is tested and compared with the other methods using the KDD
CUP 1999 dataset. The results indicate that this new method achieves
better accuracy rates than previous methods.
Abstract: Let S be an ordered semigroup. In this paper we first introduce the concepts of (∈,∈ ∨q)-fuzzy ideals, (∈,∈ ∨q)-fuzzy bi-ideals and (∈,∈ ∨q)-fuzzy generalized bi-ideals of an ordered semigroup S, and investigate their related properties. Furthermore, we also define the upper and lower parts of fuzzy subsets of an ordered semigroup S, and investigate the properties of (∈,∈ ∨q)-fuzzy ideals of S. Finally, characterizations of regular ordered semigroups and intra-regular ordered semigroups by means of the lower part of (∈ ,∈ ∨q)-fuzzy left ideals, (∈,∈ ∨q)-fuzzy right ideals and (∈,∈ ∨q)- fuzzy (generalized) bi-ideals are given.
Abstract: In this paper, we introduce an effective strategy for
subgoal division and ordering based upon recursive subgoals and
combine this strategy with a genetic-based planning approach. This
strategy can be applied to domains with conjunctive goals. The main
idea is to recursively decompose a goal into a set of serializable
subgoals and to specify a strict ordering among the subgoals.
Empirical results show that the recursive subgoal strategy reduces the
size of the search space and improves the quality of solutions to
planning problems.
Abstract: Markov games can be effectively used to design
controllers for nonlinear systems. The paper presents two novel
controller design algorithms by incorporating ideas from gametheory
literature that address safety and consistency issues of the
'learned' control strategy. A more widely used approach for
controller design is the H∞ optimal control, which suffers from high
computational demand and at times, may be infeasible. We generate
an optimal control policy for the agent (controller) via a simple
Linear Program enabling the controller to learn about the unknown
environment. The controller is facing an unknown environment and
in our formulation this environment corresponds to the behavior rules
of the noise modeled as the opponent. Proposed approaches aim to
achieve 'safe-consistent' and 'safe-universally consistent' controller
behavior by hybridizing 'min-max', 'fictitious play' and 'cautious
fictitious play' approaches drawn from game theory. We empirically
evaluate the approaches on a simulated Inverted Pendulum swing-up
task and compare its performance against standard Q learning.
Abstract: Severe symptoms, such as dissociation, depersonalization, self-mutilation, suicidal ideations and gestures, are the main reasons for a person to be diagnosed with Borderline Personality Disorder (BPD) and admitted to an inpatient Psychiatric Hospital. However, these symptoms are also indicators of a severe traumatic history as indicated by the extensive research on the topic. Unfortunately patients with such clinical presentation often are treated repeatedly only for their symptomatic behavior, while the main cause for their suffering, the trauma itself, is usually left unaddressed therapeutically. All of the highly structured, replicable, and manualized treatments lack the recognition of the uniqueness of the person and fail to respect his/her rights to experience and react in an idiosyncratic manner. Thus the communicative and adaptive meaning of such symptomatic behavior is missed. Only its pathological side is recognized and subjected to correction and stigmatization, and the message that the person is damaged goods that needs fixing is conveyed once again. However, this time the message would be even more convincing for the victim, because it is sent by mental health providers, who have the credibility to make such a judgment. The result is a revolving door of very expensive hospitalizations for only a temporary and patchy fix. In this way the patients, once victims of abuse and hardship are left invalidated and thus their re-victimization is perpetuated in their search for understanding and help. Keywordsborderline personality disorder (BPD), complex PTSD, integrative treatment of trauma, re-victimization of trauma victims.
Abstract: The performance of Advection Upstream Splitting
Method AUSM schemes are evaluated against experimental flow
fields at different Mach numbers and results are compared with
experimental data of subsonic, supersonic and hypersonic flow fields.
The turbulent model used here is SST model by Menter. The
numerical predictions include lift coefficient, drag coefficient and
pitching moment coefficient at different mach numbers and angle of
attacks. This work describes a computational study undertaken to
compute the Aerodynamic characteristics of different air vehicles
configurations using a structured Navier-Stokes computational
technique. The CFD code bases on the idea of upwind scheme for the
convective (convective-moving) fluxes. CFD results for GLC305
airfoil and cone cylinder tail fined missile calculated on above
mentioned turbulence model are compared with the available data.
Wide ranges of Mach number from subsonic to hypersonic speeds are
simulated and results are compared. When the computation is done
by using viscous turbulence model the above mentioned coefficients
have a very good agreement with the experimental values. AUSM
scheme is very efficient in the regions of very high pressure gradients
like shock waves and discontinuities. The AUSM versions simulate
the all types of flows from lower subsonic to hypersonic flow without
oscillations.
Abstract: This paper discusses the approach of real-time
controlling of the energy management system using the data
acquisition tool of LabVIEW. The main idea of this inspiration was
to interface the Station (PC) with the system and publish the data on
internet using LabVIEW. In this venture, controlling and switching of
3 phase AC loads are effectively and efficiently done. The phases are
also sensed through devices. In case of any failure the attached
generator starts functioning automatically. The computer sends
command to the system and system respond to the request. The
modern feature is to access and control the system world-wide using
world wide web (internet). This controlling can be done at any time
from anywhere to effectively use the energy especially in developing
countries where energy management is a big problem. In this system
totally integrated devices are used to operate via remote location.
Abstract: We present a prototype interactive (hyper) map of strategic, tactical, and logistic options for Supply Chain Management. The map comprises an anthology of options, broadly classified within the strategic spectrum of efficiency versus responsiveness, and according to logistic and cross-functional drivers. They are exemplified by cases in diverse industries. We seek to get all these information and ideas organized to help supply chain managers identify effective choices for specific business environments. The key and innovative linkage we introduce is the configuration of competitive forces. Instead of going through seemingly endless and isolated cases and wondering how one can borrow from them, we aim to provide a guide by force comparisons. The premise is that best practices in a different industry facing similar forces may be a most productive resource in supply chain design and planning. A prototype template is demonstrated.
Abstract: Nowadays in applications of renewable energy sources
it is important to develop powerful and energy-saving photovoltaic
converters and to keep the prescriptions of the standards. In grid
connected PV converters the obvious solution to increase the
efficiency is to reduce the switching losses. Our new developed
control method reduces the switching losses and keeps the limitations
of the harmonic distortion standards. The base idea of the method is
the utilization of 3-state control causing discontinuous current mode
at low input power. In the following sections the control theory, the
realizations and the simulation results are presented.
Abstract: This paper describes a new algorithm of arrangement
in parallel, based on Odd-Even Mergesort, called division and
concurrent mixes. The main idea of the algorithm is to achieve that
each processor uses a sequential algorithm for ordering a part of the
vector, and after that, for making the processors work in pairs in
order to mix two of these sections ordered in a greater one, also
ordered; after several iterations, the vector will be completely
ordered. The paper describes the implementation of the new
algorithm on a Message Passing environment (such as MPI). Besides,
it compares the obtained experimental results with the quicksort
sequential algorithm and with the parallel implementations (also on
MPI) of the algorithms quicksort and bitonic sort. The comparison
has been realized in an 8 processors cluster under GNU/Linux which
is running on a unique PC processor.
Abstract: We decribe a formal specification and verification of the Rabin public-key scheme in the formal proof system Is-abelle/HOL. The idea is to use the two views of cryptographic verification: the computational approach relying on the vocabulary of probability theory and complexity theory and the formal approach based on ideas and techniques from logic and programming languages. The analysis presented uses a given database to prove formal properties of our implemented functions with computer support. Thema in task in designing a practical formalization of correctness as well as security properties is to cope with the complexity of cryptographic proving. We reduce this complexity by exploring a light-weight formalization that enables both appropriate formal definitions as well as eficient formal proofs. This yields the first computer-proved implementation of the Rabin public-key scheme in Isabelle/HOL. Consequently, we get reliable proofs with a minimal error rate augmenting the used database. This provides a formal basis for more computer proof constructions in this area.