• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1075-1080
• /
• 2011

Among the numerous topological indices considered in chemical graph theory, only a few have been found noteworthy in practical application, Randi$\acute{c}$ index is one of them. The dendrimer nanostars is a synthesized molecule built up from branched unit called monomers. In this article, we compute the Randi$\acute{c}$ index of two types of polymer dendrimers and a fullerene dendrimer.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1603-1608
• /
• 2011

Let R be a ring with identity. If a, b, $c{\in}R$ such that a+b+c = 1, then the distributive laws from addition over multiplication hold in R, that is a+(bc) = (a+b)(a+c) when ab = ba, and (ab)+c = (a+c)(b+c) when ac = ca. An application to obtains, if A,B are idempotent matrices and AB = BA = 0 then there exists an idempotent matrix C such that A + BC = (A + B)(A + C), and also A + BC = (I - C)(I - B). Some other cases and applications are also presented.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.531-537
• /
• 2001

In order for all participants at video conference to communicate mutually, the conference key should be necessary. In this paper, we present the communication protocol that generates a conference key efficiently based on $(\upsilon,\kappa,\lambda)$-configuration, one class of block designs, which minimizes message transmission overhead needed for this key. Especially, in the case of ${\lambda}=1$, the protocol requires only $O(\sqrt[v]{v})$ messages, where v is the number of participants.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.167-178
• /
• 1997

In this paper we present an application to airfoil design of an optimum design method based on optimal control theory. The method used here transforms the design problem by way of a change of variable into an optimal control problem for a distributed system with Neumann boundary control. This results in a set of variational inequalities which is solved by adding a penalty term to the differential equation. This si inturn solved by a finite element method.

• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.323-336
• /
• 2004

We consider the application of complex variable method to elastic problem and investigate the nonlinear effect of finite torsion of a compressible elastic composite layer. We obtain that as a result of finite deformation approach, a tube subjected to torsion decreases in radius giving rise to a “hold effect”.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.1353-1355
• /
• 2003

Genetic algorithms (GA) is a well known technique that is capable of handling multiobjective functions and discrete constraints in the process of numerical optimization. Together with the Pareto ranking scheme, more than one possible solution can be obtained despite the imposed constraints and multi-criteria design functions. In view of this unique capability, the design of the log-periodic dipole antenna array (LPDA) using this special feature is proposed in this paper. This method also provides gain, front-back level and S parameter design tradeoff for the LPDA design in broadband application at no extra computational cost.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.98-107
• /
• 1996

In this paper, we propose a scheme that maps the time-delay neural network (TDNN) into the neurocomputer called EMIND-II which has the wavefront toroidal mesh-array structure. This neurocomputer is scalable, consists of many timeshared virtual neurons, is equipped with programmable on-chip learning, and is versatile for building many types of neural networks. Also we define the programming model of this array and derive the parallel algorithms about TDNN for the proposed neurocomputer EMIND-II. In addition, the computational complexities for the parallel and serial algorithms are compared. Finally, we introduce an application of this neurocomputer to word recognition.

• Journal of Electrical Engineering and information Science
• /
• v.1 no.2
• /
• pp.125-133
• /
• 1996

In this paper, we dicuss on the properties related to the circular filtering in orthogonal transform domain. The efficient filtering schemes in six orthogonal transform domains are presented by generalizing the convolution-multiplication property of the DFT. In brief, the circular filtering can be accomplished by multiplying the transform domain filtering matrix W, which is shown to be very sparse, yielding the computational gains compared with the time domain processing. As an application, decimation and interpolation techniques in orthogonal transform domains are also investigated.

• Journal of Web Engineering
• /
• v.19 no.2
• /
• pp.139-166
• /
• 2020

The functions, capabilities, and effects produced by the application services of cyber physical systems (CPS) are usually consumed by users performing their daily activities in a variety of environmental conditions. Thus, it is critical to ensure that those systems neither interfere with human activities nor harm the users involved. In this paper, we propose a framework for testing and verifying the safety and reliability of CPS services from the perspectives of CPS environments and users. The framework provides an environmentaware testing method by which the efficiency of testing CPS services can be improved by prioritizing CPS environments and by applying machinelearning techniques. The framework also includes a metric by which we can automate the test of the most effective services that deliver effects from physical devices to users. Additionally, the framework provides a computational model that assesses mental workloads to test whether a CPS service can cause cognitive depletion or contention problems for users. We conducted a series of experiments to show the effectiveness of the proposed approaches for ensuring the safety and reliability of CPS application services during the development and operation phases.

• Journal of Information Processing Systems
• /
• v.10 no.4
• /
• pp.491-502
• /
• 2014

In this paper we present some research results on computing intensive applications using modern high performance architectures and from the perspective of high computational needs. Computing intensive applications are an important family of applications in distributed computing domain. They have been object of study using different distributed computing paradigms and infrastructures. Such applications distinguish for their demanding needs for CPU computing, independently of the amount of data associated with the problem instance. Among computing intensive applications, there are applications based on simulations, aiming to maximize system resources for processing large computations for simulation. In this research work, we consider an application that simulates scheduling and resource allocation in a Grid computing system using Genetic Algorithms. In such application, a rather large number of simulations is needed to extract meaningful statistical results about the behavior of the simulation results. We study the performance of Oracle Grid Engine for such application running in a Cluster of high computing capacities. Several scenarios were generated to measure the response time and queuing time under different workloads and number of nodes in the cluster.