Abstract: A novel file splitting technique for the reduction of the nth-order entropy of text files is proposed. The technique is based on mapping the original text file into a non-ASCII binary file using a new codeword assignment method and then the resulting binary file is split into several subfiles each contains one or more bits from each codeword of the mapped binary file. The statistical properties of the subfiles are studied and it is found that they reflect the statistical properties of the original text file which is not the case when the ASCII code is used as a mapper. The nth-order entropy of these subfiles are determined and it is found that the sum of their entropies is less than that of the original text file for the same values of extensions. These interesting statistical properties of the resulting subfiles can be used to achieve better compression ratios when conventional compression techniques are applied to these subfiles individually and on a bit-wise basis rather than on character-wise basis.
Abstract: Pattern matching based on regular tree grammars have been widely used in many areas of computer science. In this paper, we propose a pattern matcher within the framework of code generation, based on a generic and a formalized approach. According to this approach, parsers for regular tree grammars are adapted to a general pattern matching solution, rather than adapting the pattern matching according to their parsing behavior. Hence, we first formalize the construction of the pattern matches respective to input trees drawn from a regular tree grammar in a form of the so-called match trees. Then, we adopt a recently developed generic parser and tightly couple its parsing behavior with such construction. In addition to its generality, the resulting pattern matcher is characterized by its soundness and efficient implementation. This is demonstrated by the proposed theory and by the derived algorithms for its implementation. A comparison with similar and well-known approaches, such as the ones based on tree automata and LR parsers, has shown that our pattern matcher can be applied to a broader class of grammars, and achieves better approximation of pattern matches in one pass. Furthermore, its use as a machine code selector is characterized by a minimized overhead, due to the balanced distribution of the cost computations into static ones, during parser generation time, and into dynamic ones, during parsing time.
Abstract: In this paper, the process of obtaining Q and R
matrices for optimal pitch aircraft control system has been described.
Since the innovation of optimal control method, the determination of
Q and R matrices for such system has not been fully specified. The
value of Q and R for optimal pitch aircraft control application, have
been simulated and calculated. The suitable results for Q and R have
been observed through the performance index (PI). If the PI is small
“enough", we would say the Q & R values are suitable for that
certain type of optimal control system. Moreover, for the same value
of PI, we could have different Q and R sets. Due to the rule-free
determination of Q and R matrices, a specific method is brought to
find out the rough value of Q and R referring to rather small value of
PI.
Abstract: Network coding has recently attracted attention as an efficient technique in multicast/broadcast services. The problem of finding the optimal network coding mechanism maximizing the bandwidth efficiency is hard to solve and hard to approximate. Lots of network coding-based schemes have been suggested in the literature to improve the bandwidth efficiency, especially network coding-based automatic repeat request (NCARQ) schemes. However, existing schemes have several limitations which cause the performance degradation in resource limited systems. To improve the performance in resource limited systems, we propose NCARQ with overlapping selection (OS-NCARQ) scheme. The advantages of OS-NCARQ scheme over the traditional ARQ scheme and existing NCARQ schemes are shown through the analysis and simulations.
Abstract: CloudSim is a useful tool to simulate the cloud
environment. It shows the service availability, the power consumption,
and the network traffic of services on the cloud environment.
Moreover, it supports to calculate a network communication delay
through a network topology data easily. CloudSim allows inputting a
file of topology data, but it does not provide any generating process.
Thus, it needs the file of topology data generated from some other
tools. The BRITE is typical network topology generator. Also, it
supports various type of topology generating algorithms. If CloudSim
can include the BRITE, network simulation for clouds is easier than
existing version. This paper shows the potential of connection between
BRITE and CloudSim. Also, it proposes the direction to link between
them.
Abstract: This paper presents a new hardware interface using a
microcontroller which processes audio music signals to standard
MIDI data. A technique for processing music signals by extracting
note parameters from music signals is described. An algorithm to
convert the voice samples for real-time processing without complex
calculations is proposed. A high frequency microcontroller as the
main processor is deployed to execute the outlined algorithm. The
MIDI data generated is transmitted using the EIA-232 protocol. The
analyses of data generated show the feasibility of using
microcontrollers for real-time MIDI generation hardware interface.
Abstract: This article is devoted to the numerical solution of
large-scale quadratic eigenvalue problems. Such problems arise in
a wide variety of applications, such as the dynamic analysis of
structural mechanical systems, acoustic systems, fluid mechanics,
and signal processing. We first introduce a generalized second-order
Krylov subspace based on a pair of square matrices and two initial
vectors and present a generalized second-order Arnoldi process for
constructing an orthonormal basis of the generalized second-order
Krylov subspace. Then, by using the projection technique and the
refined projection technique, we propose a restarted generalized
second-order Arnoldi method and a restarted refined generalized
second-order Arnoldi method for computing some eigenpairs of largescale
quadratic eigenvalue problems. Some theoretical results are also
presented. Some numerical examples are presented to illustrate the
effectiveness of the proposed methods.
Abstract: This paper proposes a new performance characterization for the test strategy intended for second order filters denominated Transient Analysis Method (TRAM). We evaluate the ability of the addressed test strategy for detecting deviation faults under simultaneous statistical fluctuation of the non-faulty parameters. For this purpose, we use Monte Carlo simulations and a fault model that considers as faulty only one component of the filter under test while the others components adopt random values (within their tolerance band) obtained from their statistical distributions. The new data reported here show (for the filters under study) the presence of hard-to-test components and relatively low fault coverage values for small deviation faults. These results suggest that the fault coverage value obtained using only nominal values for the non-faulty components (the traditional evaluation of TRAM) seem to be a poor predictor of the test performance.
Abstract: Task of object localization is one of the major
challenges in creating intelligent transportation. Unfortunately, in
densely built-up urban areas, localization based on GPS only
produces a large error, or simply becomes impossible. New
opportunities arise for the localization due to the rapidly emerging
concept of a wireless ad-hoc network. Such network, allows
estimating potential distance between these objects measuring
received signal level and construct a graph of distances in which
nodes are the localization objects, and edges - estimates of the
distances between pairs of nodes. Due to the known coordinates of
individual nodes (anchors), it is possible to determine the location of
all (or part) of the remaining nodes of the graph. Moreover, road
map, available in digital format can provide localization routines
with valuable additional information to narrow node location search.
However, despite abundance of well-known algorithms for solving
the problem of localization and significant research efforts, there are
still many issues that currently are addressed only partially. In this
paper, we propose localization approach based on the graph mapped
distances on the digital road map data basis. In fact, problem is
reduced to distance graph embedding into the graph representing area
geo location data. It makes possible to localize objects, in some cases
even if only one reference point is available. We propose simple
embedding algorithm and sample implementation as spatial queries
over sensor network data stored in spatial database, allowing
employing effectively spatial indexing, optimized spatial search
routines and geometry functions.
Abstract: The Sphere Method is a flexible interior point algorithm for linear programming problems. This was developed mainly by Professor Katta G. Murty. It consists of two steps, the centering step and the descent step. The centering step is the most expensive part of the algorithm. In this centering step we proposed some improvements such as introducing two or more initial feasible solutions as we solve for the more favorable new solution by objective value while working with the rigorous updates of the feasible region along with some ideas integrated in the descent step. An illustration is given confirming the advantage of using the proposed procedure.
Abstract: The drug discovery process starts with protein
identification because proteins are responsible for many functions
required for maintenance of life. Protein identification further needs
determination of protein function. Proposed method develops a
classifier for human protein function prediction. The model uses
decision tree for classification process. The protein function is
predicted on the basis of matched sequence derived features per each
protein function. The research work includes the development of a
tool which determines sequence derived features by analyzing
different parameters. The other sequence derived features are
determined using various web based tools.
Abstract: The Globally Asynchronous Locally Synchronous Network on Chip (GALS NoC) is the most efficient solution that provides low latency transfers and power efficient System on Chip (SoC) interconnect. This study presents a GALS and generic NoC architecture based on a configurable router. This router integrates a sophisticated dynamic arbiter, the wormhole routing technique and can be configured in a manner that allows it to be used in many possible NoC topologies such as Mesh 2-D, Tree and Polygon architectures. This makes it possible to improve the quality of service (QoS) required by the proposed NoC. A comparative performances study of the proposed NoC architecture, Tore architecture and of the most used Mesh 2D architecture is performed. This study shows that Spidergon architecture is characterised by the lower latency and the later saturation. It is also shown that no matter what the number of used links is raised; the Links×Diameter product permitted by the Spidergon architecture remains always the lower. The only limitation of this architecture comes from it-s over cost in term of silicon area.
Abstract: The performance of a type of fuzzy sliding mode control is researched by considering the nonlinear characteristic of a missile-target interception problem to obtain a robust interception process. The variable boundary layer by using fuzzy logic is proposed to reduce the chattering around the switching surface then is applied to the interception model which was derived. The performances of the sliding mode control with constant and fuzzy boundary layer are compared at the end of the study and the results are evaluated.
Abstract: The present work is motivated by the idea that the
layer deformation in anisotropic elasticity can be estimated from the
theory of interfacial dislocations. In effect, this work which is an
extension of a previous approach given by one of the authors
determines the anisotropic displacement fields and the critical
thickness due to a complex biperiodic network of MDs lying just
below the free surface in view of the arrangement of dislocations.
The elastic fields of such arrangements observed along interfaces
play a crucial part in the improvement of the physical properties of
epitaxial systems. New results are proposed in anisotropic elasticity
for hexagonal networks of MDs which contain intrinsic and extrinsic
stacking faults. We developed, using a previous approach based on
the relative interfacial displacement and a Fourier series formulation
of the displacement fields, the expressions of elastic fields when
there is a possible dissociation of MDs. The numerical investigations
in the case of the observed system Si/(111)Si with low twist angles
show clearly the effect of the anisotropy and thickness when the
misfit networks are dissociated.
Abstract: Automatic detection of syllable repetition is one of the
important parameter in assessing the stuttered speech objectively.
The existing method which uses artificial neural network (ANN)
requires high levels of agreement as prerequisite before attempting to
train and test ANNs to separate fluent and nonfluent. We propose
automatic detection method for syllable repetition in read speech for
objective assessment of stuttered disfluencies which uses a novel
approach and has four stages comprising of segmentation, feature
extraction, score matching and decision logic. Feature extraction is
implemented using well know Mel frequency Cepstra coefficient
(MFCC). Score matching is done using Dynamic Time Warping
(DTW) between the syllables. The Decision logic is implemented by
Perceptron based on the score given by score matching. Although
many methods are available for segmentation, in this paper it is done
manually. Here the assessment by human judges on the read speech
of 10 adults who stutter are described using corresponding method
and the result was 83%.
Abstract: New methodologies for XOR-XNOR circuits are
proposed to improve the speed and power as these circuits are basic
building blocks of many arithmetic circuits. This paper evaluates and
compares the performance of various XOR-XNOR circuits. The
performance of the XOR-XNOR circuits based on TSMC 0.18μm
process models at all range of the supply voltage starting from 0.6V
to 3.3V is evaluated by the comparison of the simulation results
obtained from HSPICE. Simulation results reveal that the proposed
circuit exhibit lower PDP and EDP, more power efficient and faster
when compared with best available XOR-XNOR circuits in the
literature.
Abstract: This paper proposes a novel architecture for developing decision support systems. Unlike conventional decision support systems, the proposed architecture endeavors to reveal the decision-making process such that humans' subjectivity can be incorporated into a computerized system and, at the same time, to preserve the capability of the computerized system in processing information objectively. A number of techniques used in developing the decision support system are elaborated to make the decisionmarking process transparent. These include procedures for high dimensional data visualization, pattern classification, prediction, and evolutionary computational search. An artificial data set is first employed to compare the proposed approach with other methods. A simulated handwritten data set and a real data set on liver disease diagnosis are then employed to evaluate the efficacy of the proposed approach. The results are analyzed and discussed. The potentials of the proposed architecture as a useful decision support system are demonstrated.
Abstract: In most rule-induction algorithms, the only operator used against nominal attributes is the equality operator =. In this paper, we first propose the use of the inequality operator, ≠, in addition to the equality operator, to increase the expressiveness of induced rules. Then, we present a new method, Binary Coding, which can be used along with an arbitrary rule-induction algorithm to make use of the inequality operator without any need to change the algorithm. Experimental results suggest that the Binary Coding method is promising enough for further investigation, especially in cases where the minimum number of rules is desirable.
Abstract: This paper presents a speed fuzzy sliding mode
controller for a vector controlled induction machine (IM) fed by a
voltage source inverter (PWM).
The sliding mode based fuzzy control method is developed to
achieve fast response, a best disturbance rejection and to maintain a
good decoupling.
The problem with sliding mode control is that there is high
frequency switching around the sliding mode surface. The FSMC is
the combination of the robustness of Sliding Mode Control (SMC)
and the smoothness of Fuzzy Logic (FL). To reduce the torque
fluctuations (chattering), the sign function used in the conventional
SMC is substituted with a fuzzy logic algorithm.
The proposed algorithm was simulated by Matlab/Simulink
software and simulation results show that the performance of the
control scheme is robust and the chattering problem is solved.
Abstract: For controlling urban transportations, traffic lights
show similar behavior for different kinds of vehicles at intersections.
Emergency vehicles need special behavior at intersections, so traffic
lights should behave in different manner when emergency vehicles
approach them. At the present time, intelligent traffic lights control
urban transportations intelligently. In this paper the ethical aspect of
this topic is considered. A model is proposed for adding special
component to emergency vehicles and traffic lights for controlling
traffic in ethical manner. The proposed model is simulated by JADE.