Abstract: The radius-of-curvature (ROC) defines the degree of
curvature along the centerline of a roadway whereby a travelling
vehicle must follow. Roadway designs must encompass ROC in
mitigating the cost of earthwork associated with construction while
also allowing vehicles to travel at maximum allowable design speeds.
Thus, a road will tend to follow natural topography where possible,
but curvature must also be optimized to permit fast, but safe vehicle
speeds. The more severe the curvature of the road, the slower the
permissible vehicle speed. For route planning, whether for urban
settings, emergency operations, or even parcel delivery, ROC is a
necessary attribute of road arcs for computing travel time.
It is extremely rare for a geo-spatial database to contain ROC. This
paper will present a procedure and mathematical algorithm to
calculate and assign ROC to a segment pair and/or polyline.
Abstract: Continuously variable transmission (CVT) is a type of
automatic transmission that can change the gear ratio to any arbitrary
setting within the limits. The most common type of CVT operates on
a pulley system that allows an infinite variability between highest and
lowest gears with no discrete steps. However, the current CVT
system with hydraulic actuation method suffers from the power loss.
It needs continuous force for the pulley to clamp the belt and hold the
torque resulting in large amount of energy consumption. This study
focused on the development of an electromechanical actuated control
CVT to eliminate the problem that faced by the existing CVT. It is
conducted with several steps; computing and selecting the
appropriate sizing for stroke length, lead screw system and etc. From
the visual observation it was found that the CVT system of this
research is satisfactory.
Abstract: Evapotranspiration (ET) is a major component of the hydrologic cycle and its accurate estimation is essential for hydrological studies. In past, various estimation methods have been developed for different climatological data, and the accuracy of these methods varies with climatic conditions. Reference crop evapotranspiration (ET0) is a key variable in procedures established for estimating evapotranspiration rates of agricultural crops. Values of ET0 are used with crop coefficients for many aspects of irrigation and water resources planning and management. Numerous methods are used for estimating ET0. As per internationally accepted procedures outlined in the United Nations Food and Agriculture Organization-s Irrigation and Drainage Paper No. 56(FAO-56), use of Penman-Monteith equation is recommended for computing ET0 from ground based climatological observations. In the present study, seven methods have been selected for performance evaluation. User friendly software has been developed using programming language visual basic. The visual basic has ability to create graphical environment using less coding. For given data availability the developed software estimates reference evapotranspiration for any given area and period for which data is available. The accuracy of the software has been checked by the examples given in FAO-56.The developed software is a user friendly tool for estimating ET0 under different data availability and climatic conditions.
Abstract: Accurate software cost estimates are critical to both
developers and customers. They can be used for generating request
for proposals, contract negotiations, scheduling, monitoring and
control. The exact relationship between the attributes of the effort
estimation is difficult to establish. A neural network is good at
discovering relationships and pattern in the data. So, in this paper a
comparative analysis among existing Halstead Model, Walston-Felix
Model, Bailey-Basili Model, Doty Model and Neural Network
Based Model is performed. Neural Network has outperformed the
other considered models. Hence, we proposed Neural Network
system as a soft computing approach to model the effort estimation
of the software systems.
Abstract: A computer cluster is a group of tightly coupled
computers that work together closely so that in many respects they
can be viewed as though they are a single computer. The components
of a cluster are commonly, but not always, connected to each other
through fast local area networks. Clusters are usually deployed to
improve performance and/or availability over that provided by a
single computer, while typically being much more cost-effective than
single computers of comparable speed or availability. This paper
proposed the way to implement the Beowulf Cluster in order to
achieve high performance as well as high availability.
Abstract: Mobile learning (M-learning) integrates mobile
devices and wireless computing technology to enhance the current
conventional learning system. However, there are constraints which
are affecting the implementation of platform and device independent
M-learning. The main aim of this research is to fulfill the following
main objectives: to develop platform independent mobile learning
tool (M-LT) for structured programming course, and evaluate its
effectiveness and usability using ADDIE instructional design model
(ISD) as M-LT life cycle. J2ME (Java 2 micro edition) and XML
(Extensible Markup Language) were used to develop platform
independent M-LT. It has two modules lecture materials and quizzes.
This study used Quasi experimental design to measure effectiveness
of the tool. Meanwhile, questionnaire is used to evaluate the usability
of the tool. Finally, the results show that the system was effective and
also usability evaluation was positive.
Abstract: In this paper, we introduce an mobile agent framework
with proactive load balancing for ambient intelligence (AmI) environments.
One of the main obstacles of AmI is the scalability in
which the openness of AmI environment introduces dynamic resource
requirements on agencies. To mediate this scalability problem, our
framework proposes a load balancing module to proactively analyze
the resource consumption of network bandwidth and preferred agencies
to suggest the optimal communication method to its user. The
framework generally formulates an AmI environment that consists
of three main components: (1) mobile devices, (2) hosts or agencies,
and (3) directory service center (DSC). A preliminary implementation
was conducted with NetLogo and the experimental results show that
the proposed approach provides enhanced system performance by
minimizing the network utilization to provide users with responsive
services.
Abstract: Program slicing is the task of finding all statements in
a program that directly or indirectly influence the value of a variable
occurrence. The set of statements that can affect the value of a
variable at some point in a program is called a program backward
slice. In several software engineering applications, such as program
debugging and measuring program cohesion and parallelism, several
slices are computed at different program points. The existing
algorithms for computing program slices are introduced to compute a
slice at a program point. In these algorithms, the program, or the
model that represents the program, is traversed completely or
partially once. To compute more than one slice, the same algorithm
is applied for every point of interest in the program. Thus, the same
program, or program representation, is traversed several times.
In this paper, an algorithm is introduced to compute all forward
static slices of a computer program by traversing the program
representation graph once. Therefore, the introduced algorithm is
useful for software engineering applications that require computing
program slices at different points of a program. The program
representation graph used in this paper is called Program Dependence
Graph (PDG).
Abstract: In any trust model, the two information sources that a peer relies on to predict trustworthiness of another peer are direct experience as well as reputation. These two vital components evolve over time. Trust evolution is an important issue, where the objective is to observe a sequence of past values of a trust parameter and determine the future estimates. Unfortunately, trust evolution algorithms received little attention and the proposed algorithms in the literature do not comply with the conditions and the nature of trust. This paper contributes to this important problem in the following ways: (a) presents an algorithm that manages and models trust evolution in a P2P environment, (b) devises new mechanisms for effectively maintaining trust values based on the conditions that influence trust evolution , and (c) introduces a new methodology for incorporating trust-nurture incentives into the trust evolution algorithm. Simulation experiments are carried out to evaluate our trust evolution algorithm.
Abstract: Deoxyribonucleic Acid or DNA computing has
emerged as an interdisciplinary field that draws together chemistry,
molecular biology, computer science and mathematics. Thus, in this
paper, the possibility of DNA-based computing to solve an absolute
1-center problem by molecular manipulations is presented. This is
truly the first attempt to solve such a problem by DNA-based
computing approach. Since, part of the procedures involve with
shortest path computation, research works on DNA computing for
shortest path Traveling Salesman Problem, in short, TSP are reviewed.
These approaches are studied and only the appropriate one is adapted
in designing the computation procedures. This DNA-based
computation is designed in such a way that every path is encoded by
oligonucleotides and the path-s length is directly proportional to the
length of oligonucleotides. Using these properties, gel electrophoresis
is performed in order to separate the respective DNA molecules
according to their length. One expectation arise from this paper is that
it is possible to verify the instance absolute 1-center problem using
DNA computing by laboratory experiments.
Abstract: The drastic increase in the usage of SMS technology
has led service providers to seek for a solution that enable users of
mobile devices to access services through SMSs. This has resulted in
the proposal of solutions towards SMS-based service invocation in
service oriented environments. However, the dynamic nature of
service-oriented environments coupled with sudden load peaks
generated by service request, poses performance challenges to
infrastructures for supporting SMS-based service invocation. To
address this problem we adopt load balancing techniques. A load
balancing model with adaptive load balancing and load monitoring
mechanisms as its key constructs is proposed. The load balancing
model then led to realization of Least Loaded Load Balancing
Framework (LLLBF). Evaluation of LLLBF benchmarked with round
robin (RR) scheme on the queuing approach showed LLLBF
outperformed RR in terms of response time and throughput.
However, LLLBF achieved better result in the cost of high
processing power.
Abstract: In this paper, we summarize recent work of the authors on nanocomputing memory devices. We investigate two memory devices, each comprising a charged metallofullerene and carbon nanotubes. The first device involves two open nanotubes of the same radius that are joined by a centrally located nanotube of a smaller radius. A metallofullerene is then enclosed inside the structure. The second device also involves a etallofullerene that is located inside a closed carbon nanotube. Assuming the Lennard-Jones interaction energy and the continuum approximation, for both devices, the metallofullerene has two symmetrically placed equal minimum energy positions. On one side the metallofullerene represents the zero information state and by applying an external electrical field, it can overcome the energy barrier, and pass from one end of the tube to the other, where the metallofullerene then represents the one information state.
Abstract: .Hardware realization of a Neural Network (NN), to a large extent depends on the efficient implementation of a single neuron. FPGA-based reconfigurable computing architectures are suitable for hardware implementation of neural networks. FPGA realization of ANNs with a large number of neurons is still a challenging task. This paper discusses the issues involved in implementation of a multi-input neuron with linear/nonlinear excitation functions using FPGA. Implementation method with resource/speed tradeoff is proposed to handle signed decimal numbers. The VHDL coding developed is tested using Xilinx XC V50hq240 Chip. To improve the speed of operation a lookup table method is used. The problems involved in using a lookup table (LUT) for a nonlinear function is discussed. The percentage saving in resource and the improvement in speed with an LUT for a neuron is reported. An attempt is also made to derive a generalized formula for a multi-input neuron that facilitates to estimate approximately the total resource requirement and speed achievable for a given multilayer neural network. This facilitates the designer to choose the FPGA capacity for a given application. Using the proposed method of implementation a neural network based application, namely, a Space vector modulator for a vector-controlled drive is presented
Abstract: The link between Gröbner basis and linear algebra was
described by Lazard [4,5] where he realized the Gr¨obner basis
computation could be archived by applying Gaussian elimination over
Macaulay-s matrix .
In this paper, we indicate how same technique may be used to
SAGBI- Gröbner basis computations in invariant rings.
Abstract: All-to-all personalized communication, also known as complete exchange, is one of the most dense communication patterns in parallel computing. In this paper, we propose new indirect algorithms for complete exchange on all-port ring and torus. The new algorithms fully utilize all communication links and transmit messages along shortest paths to completely achieve the theoretical lower bounds on message transmission, which have not be achieved among other existing indirect algorithms. For 2D r × c ( r % c ) all-port torus, the algorithm has time complexities of optimal transmission cost and O(c) message startup cost. In addition, the proposed algorithms accommodate non-power-of-two tori where the number of nodes in each dimension needs not be power-of-two or square. Finally, the algorithms are conceptually simple and symmetrical for every message and every node so that they can be easily implemented and achieve the optimum in practice.
Abstract: Morphogenesis is the process that underpins the selforganised development and regeneration of biological systems. The ability to mimick morphogenesis in artificial systems has great potential for many engineering applications, including production of biological tissue, design of robust electronic systems and the co-ordination of parallel computing. Previous attempts to mimick these complex dynamics within artificial systems have relied upon the use of evolutionary algorithms that have limited their size and complexity. This paper will present some insight into the underlying dynamics of morphogenesis, then show how to, without the assistance of evolutionary algorithms, design cellular architectures that converge to complex patterns.
Abstract: As a method of expanding a higher-order tensor data to tensor products of vectors we have proposed the Third-order Orthogonal Tensor Product Expansion (3OTPE) that did similar expansion as Higher-Order Singular Value Decomposition (HOSVD). In this paper we provide a computation algorithm to improve our previous method, in which SVD is applied to the matrix that constituted by the contraction of original tensor data and one of the expansion vector obtained. The residual of the improved method is smaller than the previous method, truncating the expanding tensor products to the same number of terms. Moreover, the residual is smaller than HOSVD when applying to color image data. It is able to be confirmed that the computing time of improved method is the same as the previous method and considerably better than HOSVD.
Abstract: In recent years multi-agent systems have emerged as one of the interesting architectures facilitating distributed collaboration and distributed problem solving. Each node (agent) of the network might pursue its own agenda, exploit its environment, develop its own problem solving strategy and establish required communication strategies. Within each node of the network, one could encounter a diversity of problem-solving approaches. Quite commonly the agents can realize their processing at the level of information granules that is the most suitable from their local points of view. Information granules can come at various levels of granularity. Each agent could exploit a certain formalism of information granulation engaging a machinery of fuzzy sets, interval analysis, rough sets, just to name a few dominant technologies of granular computing. Having this in mind, arises a fundamental issue of forming effective interaction linkages between the agents so that they fully broadcast their findings and benefit from interacting with others.
Abstract: Researches show that probability-statistical methods application, especially at the early stage of the aviation Gas Turbine Engine (GTE) technical condition diagnosing, when the flight information has property of the fuzzy, limitation and uncertainty is unfounded. Hence the efficiency of application of new technology Soft Computing at these diagnosing stages with the using of the Fuzzy Logic and Neural Networks methods is considered. According to the purpose of this problem training with high accuracy of fuzzy multiple linear and non-linear models (fuzzy regression equations) which received on the statistical fuzzy data basis is made. For GTE technical condition more adequate model making dynamics of skewness and kurtosis coefficients- changes are analysed. Researches of skewness and kurtosis coefficients values- changes show that, distributions of GTE work parameters have fuzzy character. Hence consideration of fuzzy skewness and kurtosis coefficients is expedient. Investigation of the basic characteristics changes- dynamics of GTE work parameters allows drawing conclusion on necessity of the Fuzzy Statistical Analysis at preliminary identification of the engines' technical condition. Researches of correlation coefficients values- changes shows also on their fuzzy character. Therefore for models choice the application of the Fuzzy Correlation Analysis results is offered. At the information sufficiency is offered to use recurrent algorithm of aviation GTE technical condition identification (Hard Computing technology is used) on measurements of input and output parameters of the multiple linear and non-linear generalised models at presence of noise measured (the new recursive Least Squares Method (LSM)). The developed GTE condition monitoring system provides stageby- stage estimation of engine technical conditions. As application of the given technique the estimation of the new operating aviation engine technical condition was made.
Abstract: One main drawback of intrusion detection system is the
inability of detecting new attacks which do not have known
signatures. In this paper we discuss an intrusion detection method
that proposes independent component analysis (ICA) based feature
selection heuristics and using rough fuzzy for clustering data. ICA is
to separate these independent components (ICs) from the monitored
variables. Rough set has to decrease the amount of data and get rid of
redundancy and Fuzzy methods allow objects to belong to several
clusters simultaneously, with different degrees of membership. Our
approach allows us to recognize not only known attacks but also to
detect activity that may be the result of a new, unknown attack. The
experimental results on Knowledge Discovery and Data Mining-
(KDDCup 1999) dataset.