He’s homotopy perturbation method: A strongly promising method for solving non-linear systems of the mixed Volterra–Fredholm integral equations

In this paper, He’s homotopy perturbation method is applied to solve non-linear systems of mixed Volterra–Fredholm integral equations. Two examples are presented to illustrate the ability of the method. Also comparisons are made between the Adomian decomposition method and the homotopy perturbation method. The results reveal that He’s homotopy perturbation method is very effective and simple and in these examples leads to the exact solutions.     

A new homotopy perturbation method for solving systems of partial differential equations

In this paper, a new homotopy perturbation method (NHPM) is introduced for obtaining solutions of systems of non-linear partial differential equations. Theoretical considerations are discussed. To illustrate the capability and reliability of the method three examples are provided. Comparison of the results of applying NHPM with those of applying HPM reveal the effectiveness and convenience of the new technique.     

Semantic partitioning of peer-to-peer search space

Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be conceived as an ontology-based distributed hash table (DHT). Also, we introduce a lookup service for the network which is very scalable and independent of the network size and just depends on depth of the ontology tree. Further, we introduce a broadcast algorithm on the network. We present worst case analysis of both lookup and broadcast algorithms and measure their performance using simulation. The results show that our scheme is highly scalable and can be used in real P2P applications.     

A mathematical framework to study fast walking of human

The body of a walking human is an elaborated dynamic system that operates adaptively in various conditions such as fast walking. Due to dynamic redundancies, the individual motor control strategies for speeding up the walking can be different among normal subjects. However, in reality, we see that the pattern of motion is quite similar among people and it is only the profile of hip joint motion along its path which determines the speed. The objective of the current paper is to develop a mathematical framework to investigate time optimal motion of a human during walking. To this end, a nine-link planar biped model is used. The motion is considered to take place in sagittal plane and to follow a normal pattern of motion. The solution is obtained using a phase plane method to solve minimum time problem which is subjected to inequality constraints of variable maximum joint torques and stability conditions. The solution method can be used to find the maximum possible speed of a human with specific body characteristics and to obtain a hip joint trajectory which could produce that speed. The proposed method can be utilized to study quantitative effect of different parameters such as joint strength in fast walking.     

Robust model predictive control of biped robots with adaptive on-line gait generation

International Journal of Control, Automation and Systems - In this paper, an on-line gait control scheme is proposed for the biped robots for walking up and down the stairs. In the proposed...     

Optimal pricing, lot-sizing and marketing planning in a capacitated and imperfect production system

In the classical economic production quantity (EPQ) problem demand is considered to be known in advance. However, in the real-world, demand of a product is a function of factors such as product’s price, its quality, and marketing expenditures for promoting the product. Quality level of the product and specifications of the adopted manufacturing process also affect the unit product’s cost. Therefore, in this paper we consider a profit maximizing firm who wants to jointly determine the optimal lot-sizing, pricing, and marketing decisions along with manufacturing requirements in terms of flexibility and reliability of the process. Geometric programming (GP) technique is proposed to address the resulting nonlinear optimization problem. Using recent advances in optimization techniques we are able to optimally solve the developed, highly nonlinear, mathematical model. Finally, using numerical examples, we illustrate the solution approach and analyze the solution under different conditions.     

Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm

The Vehicle Routing Problem (VRP) has been thoroughly studied in the last decades. However, the main focus has been on the deterministic version where customer demands are fixed and known in advance. Uncertainty in demand has not received enough consideration. When demands are uncertain, several problems arise in the VRP. For example, there might be unmet customers’ demands, which eventually lead to profit loss. A reliable plan and set of routes, after solving the VRP, can significantly reduce the unmet demand costs, helping in obtaining customer satisfaction. This paper investigates a variant of an uncertain VRP in which the customers’ demands are supposed to be uncertain with unknown distributions. An advanced Particle Swarm Optimization (PSO) algorithm has been proposed to solve such a VRP. A novel decoding scheme has also been developed to increase the PSO efficiency. Comprehensive computational experiments, along with comparisons with other existing algorithms, have been provided to validate the proposed algorithms.     

Induction motors bearing fault detection using pattern recognition techniques

This paper proposes a systematic procedure based on a pattern recognition technique for fault diagnosis of induction motors bearings through the artificial neural networks (ANNs). In this method, the use of time domain features as a proper alternative to frequency features is proposed to improve diagnosis ability. The features are obtained from direct processing of the signal segments using very simple calculation. Three different cases including, healthy, inner race defect and outer race defect are investigated using the proposed algorithm. The ANNs are trained with a subset of the experimental data for known machine conditions. Once the network is trained, efficiency of the proposed method is evaluated using the remaining set of data. The obtained results indicate that using time domain features can be effective in accurate diagnosis of various motor bearing faults with high precision and low computational burden.     

A 40-GHz Flip-Flop-Based Frequency Divider

This brief presents the design and implementation of a 40-GHz flip-flop-based frequency divider which incorporates a novel latch topology with two distinct tail current sources and an enabled cross-coupled pair during the tracking mode. The proposed topology will speed up the latch operation and increase the driving capability. It is capable of performing frequency division at 40 GHz without shunt or series peaking inductors. The circuit was fabricated in a 0.18-mum SiGe BiCMOS process, where only CMOS transistors were used. It draws an average current of 5 mA from a 1.8-V supply voltage     

Analytical overview of DNA interaction with Morin and its metal complexes

Flavonoids play an important role in pharmaceutical and biomedical sciences. Various flavonoids, especially Morin, have potential to interact with DNA. Their prospective clinical and pharmacological utilities have attracted researchers?? attention in last two decades. Due to their interaction with DNA and their anticancer effects, a lot of investigations have been carried out all over the world. In this paper, we will review the properties of Morin and its different metal complexes as well as their interactions with DNA that have been reported by several research groups. Also, further details have been provided about binding mechanisms of these materials with DNA using analytical techniques such as UV?CVisible and fluorescence spectroscopies, viscosity and voltammetry. Structural analysis showed Morin binds to DNA through non-intercalation mode, but its metal complexes interact with DNA via intercalation mode and binding mode of Morin, and its metal complexes with DNA will be helpful in the determination of anticancer drugs binding mechanism to DNA. Therefore, it will be useful in new drug designs.