Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Articles 991 - 1020 of 2320

Full-Text Articles in Entire DC Network

Wave Equation With Logarithmic Nonlinearities In Kirchhoff Type, Khaled Zennir, Salah Boulaaras, Mohamed Haiour, Mohsin Bayoud Sep 2016

Wave Equation With Logarithmic Nonlinearities In Kirchhoff Type, Khaled Zennir, Salah Boulaaras, Mohamed Haiour, Mohsin Bayoud

Applied Mathematics & Information Sciences

In this paper, we study a viscoelastic wave equations of the Kirchhoff type u′′ −f (x) M(k?xuk22 )Dxu− Z t 0 g(t −s)Dxu(s)ds = auln |u|k (1) defined in any spaces dimension. It is well known that from a class of nonlinearities the logarithmic nonlinearity is distinguished by several interesting physical properties. We use weighted spaces to establish the long-time behavior of solution of (1). Furthermore, under convenient hypotheses on g and the initial data, the local-in-time existence of solution is established.


Comments On “The Exponentiated Inverted Weibull Distribution”, Pedro Luiz Ramos, Francisco Louzada Sep 2016

Comments On “The Exponentiated Inverted Weibull Distribution”, Pedro Luiz Ramos, Francisco Louzada

Applied Mathematics & Information Sciences

In this note, we comment on the recently published paper ”Flaih, A; Elsalloukh, H; Mendi, E; Milanova M. (2012). The Exponentiated Inverted Weibull Distribution, Appl. Math. Inf. Sci. 6, No. 2, 167-171”, which was intended to introduce a new generalization of the standard Inverted Weibull distribution, namely, Exponentiated Inverted Weibull distribution.


Accelerating Finite Field Inversion In Gf(3m) For Elliptic Curve Cryptography, Walid Mahmoud, Huapeng Wu Sep 2016

Accelerating Finite Field Inversion In Gf(3m) For Elliptic Curve Cryptography, Walid Mahmoud, Huapeng Wu

Applied Mathematics & Information Sciences

Ternary extension fields GF(3m) have been used in cryptographic applications based on bilinear-mappings in elliptic curve cryptography. In this paper, we focus on accelerating inversion in GF(3m) which is an indispensable operation in such applications. We propose a fast execution-time inversion algorithm which decomposes (m−1) of GF(3m) into several factors and a remainder and restricts the remainder to belong to the shortest addition chain of a suitable factor. Thus, unlike other algorithms that not decompose (m−1) and search for large near-optimal addition chains for (m−1) to compute the inverse, our algorithm relies on much smaller and known chains for the …


The Min-Pareto Power Series Distributions Of Lifetime, Bogdan Gheorghe Munteanu Sep 2016

The Min-Pareto Power Series Distributions Of Lifetime, Bogdan Gheorghe Munteanu

Applied Mathematics & Information Sciences

The paper sets out to study some properties of the new mathematical probability power series distributions called a Min Pareto power series (MinParPS). Several models in special cases used in the study of the lifetime are presented. Expressions for certain numerical and reliability characteristics (e.g. expectation, variance, survival function, hazard rate) are obtained. In the final part of the paper the problem of the statistical estimation using the EM algorithm is treated.


A Note On The Log-Alpha-Skew-Normal Model With Geochemical Applications., Osvaldo Venegas, Heleno Bolfarine, Diego I. Gallardo, Alberto Vergara-Fernandez, Hector W. Gomez Sep 2016

A Note On The Log-Alpha-Skew-Normal Model With Geochemical Applications., Osvaldo Venegas, Heleno Bolfarine, Diego I. Gallardo, Alberto Vergara-Fernandez, Hector W. Gomez

Applied Mathematics & Information Sciences

In this paper we introduce an extension of the log-normal distribution, based on the alpha-skew-normal distribution introduced by Elal-Olivero [10]. Basic properties, moments, moment estimators, maximum likelihood estimators and a simulation study are discussed. We apply the approach developed in this paper to data sets related to neodymium and nickel concentrations in soil samples. Model fit indicates good performance of the proposed model when compared with less flexible models.


The Problem Of Mayer For Discrete And Differential Inclusions With Initial Boundary Constraints, Gulseren Cicek, Elimhan Mahmudov Sep 2016

The Problem Of Mayer For Discrete And Differential Inclusions With Initial Boundary Constraints, Gulseren Cicek, Elimhan Mahmudov

Applied Mathematics & Information Sciences

In the present paper we consider the Mayer Problem for Second Order Differential Inclusions with initial boundary constraints. We derive the approximation conditions for the problem. Locally adjoint mapping is our basic tool to formulate necessary and sufficient conditions for the optimality of the discrete approximation problem. Then by passing to the limit, sufficient optimality conditions to the optimal problem described by differential inclusions are established.


Stability Analysis Of Extended One-Step Schemes For Stiff And Non-Stiff Delay Differential Equations, F. Ibrahim, F. A. Rihan, S. Turek Sep 2016

Stability Analysis Of Extended One-Step Schemes For Stiff And Non-Stiff Delay Differential Equations, F. Ibrahim, F. A. Rihan, S. Turek

Applied Mathematics & Information Sciences

Herein, we provide a reliable and stable computational technique, based on a class of extended one-step methods for solving delay differential equations with constant and variable delays. Numerical stability properties of the schemes are investigated. The schemes are suitable for stiff and non-stiff problems. Numerical results and simulations are presented to demonstrate the effectiveness of the methodology.


Estimating Matrix Travel Light Vehicle Observations By Volume Sleeve Approach Inference Bayes, Sobri Abusini, Adem Kılıcman Sep 2016

Estimating Matrix Travel Light Vehicle Observations By Volume Sleeve Approach Inference Bayes, Sobri Abusini, Adem Kılıcman

Applied Mathematics & Information Sciences

The process can change the assignment of a knowledge matrix of travel [Ti j] into the estimated flow of arms, the two main points of the assignment process is the proportion of travel between zones i and j zone on an arm and balance assignment. The problem is the number of arms in the measurement of traffic volume is less than the sum of n - origin destination pairs (dual problem), thus resulting in the problem has a solution that is much that is difficult to solve. For that to look for a single solution to solve these problems. In …


Dynamics Of A Worm Propagation Model With Quarantine In Wireless Sensor Networks, Nguyen Huu Khanh Sep 2016

Dynamics Of A Worm Propagation Model With Quarantine In Wireless Sensor Networks, Nguyen Huu Khanh

Applied Mathematics & Information Sciences

We study the attacking behavior of possible worms inWireless Sensor Network (WSNs). Using epidemic theory, we propose a susceptible-infectious-quarantine-recovered (SIQR)model to describe dynamics of worms propagation with quarantine in the wireless sensor network. Mathematical analysis shows that dynamics of the spread of worms are determined by the threshold R0. If R0 ≤ 1, the worm-free equilibrium is globally asymptotically stable, and if R0 > 1, the worm-endemic equilibrium is globally asymptotically stable. Lyapunov functional method as well as geometric approach are used for proving the global stability of equilibria. A numerical investigation is carried out to confirm the analytical results. As …


Optimal Scheduling For The Linear Section Of A Single-Track Railway With Independent Edges Orientations, Elena N. Akimova, Damir N. Gainanov, Oleg A. Golubev, Ilya D. Kolmogortsev, Anton V. Konygin Sep 2016

Optimal Scheduling For The Linear Section Of A Single-Track Railway With Independent Edges Orientations, Elena N. Akimova, Damir N. Gainanov, Oleg A. Golubev, Ilya D. Kolmogortsev, Anton V. Konygin

Applied Mathematics & Information Sciences

The paper is devoted to the problem of organizing the flow in both directions, in the most efficient way, for the linear section of a single-track railway. The authors propose an algorithm for scheduling with independent orientations of edges, investigate the properties of this algorithm and perform computational experiments. The authors also present some estimates for the track capacity of the section.


Simulation Model For Evaluating Business Values Of New Business Model Using Pattern Analysis, Sang-Chul Lee Sep 2016

Simulation Model For Evaluating Business Values Of New Business Model Using Pattern Analysis, Sang-Chul Lee

Applied Mathematics & Information Sciences

Objective: The purpose of this paper is to develop the simulation model for evaluating business values of new BM adopting new R&D technologies using pattern analysis. Method: Through the pattern analysis, the cost-based pricing and price elasticity of demand, this paper proposes the methods for evaluating business value of new R&D and how it can change the existing market Conclusions: The simulation model consisted of four modules, such as 1) calculate the quantity of sales, 2) predict the price according to cost-based pricing, 3) calculate the cost and 4) analyse the changes of the traditional market based on the formula …


Properties Of Solutions To Volterra Integro-Differential Equations With Delay, Cemil Tunc Sep 2016

Properties Of Solutions To Volterra Integro-Differential Equations With Delay, Cemil Tunc

Applied Mathematics & Information Sciences

Using suitable Lyapunov functionals, we study the stability and boundedness of solutions in a class of non-linear Volterra integro-differential equations with delay. Our results give new sufficient conditions for stability and boundedness of solutions for the considered equations, and they improve, complete and extend the results obtained in literature


Unifying Some Implicit Common Fixed Point Theorems For Hybrid Pairs Of Mappings In G-Metric Spaces Through Altering Distance Function, Deepak Singh, Vishal Joshi, Jong Kyu Kim Sep 2016

Unifying Some Implicit Common Fixed Point Theorems For Hybrid Pairs Of Mappings In G-Metric Spaces Through Altering Distance Function, Deepak Singh, Vishal Joshi, Jong Kyu Kim

Applied Mathematics & Information Sciences

In this paper, the notion of sub-compatibility for hybrid pair of mappings in the framework of G-metric spaces, is introduced. The role of an appropriate implicit function concerning altering distance function is also highlighted which envelops a host of contraction conditions, in one go. Employing this implicit relation some common fixed point theorems are proved for two hybrid pairs of single and multivalued mappings in the structure of G-metric spaces. While proving our results, we utilize the idea of compatibility for hybrid mappings due to Kneko et al. [1] together with subsequentially continuity due to Bouhadjera et al. [2] (also …


Harmonic Variational Inequalities, Muhammad Aslam Noor, Khalida Inayat Noor Sep 2016

Harmonic Variational Inequalities, Muhammad Aslam Noor, Khalida Inayat Noor

Applied Mathematics & Information Sciences

In this paper, we consider a new class of variational inequalities, which is called the harmonic variational inequality. It is shown that that the minimum of a differentiable harmonic convex function on the harmonic convex set can be characterized by the harmonic variational inequality. We use the auxiliary principle technique to discuss the existence of a solution of the harmonic variational inequality. Results proved in this paper may stimulate further research in this field.


Solving The Flexible Job Shop Problem Using Multi-Objective Optimizer With Solution Characteristic Extraction, Sheng-Ta Hsieh, Shi-Jim Yen, Chun-Ling Lin, Shih-Yuan Chiu, Tsan-Cheng Su Sep 2016

Solving The Flexible Job Shop Problem Using Multi-Objective Optimizer With Solution Characteristic Extraction, Sheng-Ta Hsieh, Shi-Jim Yen, Chun-Ling Lin, Shih-Yuan Chiu, Tsan-Cheng Su

Applied Mathematics & Information Sciences

It is difficult to find optimal scheduling solutions for abstract scheduling problems with mass parallel tasks on multiprocessors because they are NP-complete. In this paper, a solution searching strategy called solution characteristic extraction is proposed as a multi-objective optimizer for solving flexible job shop problems (FJSP). These problems are concerned with finishing assigned jobs with minimal critical machine workload, total workload, and completion times. A suitable job assignment must consider processor performance, job complexity, and job suitability for each individual processor simultaneously. To test the efficiency and robustness of the proposed method, the experiments will contain two groups of benchmarks; …


Online Rotating Pi Controller For Ncs Over Communication Constraints, Pooya Hajebi, Seyed Mohammad Taghi Almodarresi Sep 2016

Online Rotating Pi Controller For Ncs Over Communication Constraints, Pooya Hajebi, Seyed Mohammad Taghi Almodarresi

Applied Mathematics & Information Sciences

A new method for controlling the plant in networked control systems (NCSs) is proposed. Network time delay and packet loss are two major drawbacks in data communication networks which make NCSs unstable. Unlike previous related research works, this new proposed rotating PI controller based method has the advantage of considering time delay and packet loss effects simultaneously. Time delay is estimated online and then used for tuning the PI controller by rotating the phase plane, while packet loss sequences are modeled by Markov chain. This novel method improves the performance compared to other methods, especially when packets are dropped consecutively …


A Multi-Criteria Neutrosophic Group Decision Making Method Based Topsis For Supplier Selection, Rıdvan Sahin, Muhammet Yigider Sep 2016

A Multi-Criteria Neutrosophic Group Decision Making Method Based Topsis For Supplier Selection, Rıdvan Sahin, Muhammet Yigider

Applied Mathematics & Information Sciences

The process of multi-criteria group decision making (MCGDM) is of determining the best choice among all of the probable alternatives. The problem of supplier selection on which decision maker has usually vague and imprecise knowledge is a typical example ofmulti criteria group decision-making problem. The conventional crisp techniques has notmuch effective for solvingMCDMproblems because of imprecise or fuzziness nature of the linguistic assessments. To find the exact values for MCGDM problems is both difficult and impossible in more cases in real world. So, it is more reasonable to consider the values of alternatives according to the criteria as single valued …


Stability Analysis Of Implicit-Explicit Class For Solving Odes And Ddes, Iman H. Ibrahim, Fatma M. Yousry Sep 2016

Stability Analysis Of Implicit-Explicit Class For Solving Odes And Ddes, Iman H. Ibrahim, Fatma M. Yousry

Applied Mathematics & Information Sciences

Implicit-Explicit schemes have been widely used, it reduces the computational work for solving differential equations which have both stiff and non-stiff parts . In this paper an implicit-explicit linear multistep method for solving ordinary and delay differential equations is introduced. In both cases we are going to study the stability of the method using two approaches and the stability regions will be ploted. Numerical tests are introduced.


The Consistent Value: Potentializability And Equivalent Relations On Fuzzy Games, Yu-Hsien Liao Sep 2016

The Consistent Value: Potentializability And Equivalent Relations On Fuzzy Games, Yu-Hsien Liao

Applied Mathematics & Information Sciences

Based on several equivalent relations, this paper is aimed to axiomatize the family of all solutions that admit a potential in the framework of fuzzy transferable-utility (TU) games. Further, several axiomatic results of the consistent value are also proposed by applying these equivalent relations.


A Study On Recovery Rate For Counter - Current Imbibition Phenomenon With Corey’S Model Arising During Oil Recovery Process, Hardik S. Patel, Ramakanta Meher Sep 2016

A Study On Recovery Rate For Counter - Current Imbibition Phenomenon With Corey’S Model Arising During Oil Recovery Process, Hardik S. Patel, Ramakanta Meher

Applied Mathematics & Information Sciences

This paper presents a new numerical formulation of Counter – Current Imbibition Phenomenon for the simulation of immiscible and incompressible phase flow in heterogeneous porous media for Corey’s model and Scheidegger-Johnson model. Adomian Decomposition Method is used numerically to investigate the saturation rate as well as the recovery rate for both models with its convergence analysis. A detailed discussion of the saturation rate as well as recovery rate with dimensionless time is studied for both models with its comparison study and its physical interpretation.


Shortest Paths Routing Problem In Manets, Hamdy H. El-Sayed Sep 2016

Shortest Paths Routing Problem In Manets, Hamdy H. El-Sayed

Applied Mathematics & Information Sciences

The need for communication services is rapidly increasing, because the mobile communication service is synonymous with an ideal communication style realizing communication anytime, anywhere and with anyone. The availability of a path depends on the number of links and the reliability of each link forming the path. Many routing metrics in terms of number of links have been proposed, such as the shortest path routing. Shortest path routing selects a path having minimum cost to forward the data to the destination node. Shortest path routing algorithm selection depends on direct traffic form source to destination, maximizing the network performance and …


Oscillatory Of Third-Order Neutral Differential Equations With Continuously Distributed Mixed Arguments, Nagehan Kılınc Gecer, Pakize Temtek Sep 2016

Oscillatory Of Third-Order Neutral Differential Equations With Continuously Distributed Mixed Arguments, Nagehan Kılınc Gecer, Pakize Temtek

Applied Mathematics & Information Sciences

It is the purpose of this paper to give oscillation criteria for the third-order neutral differential equation with continuously distributed mixed arguments r(t) 􀀀 [x(t)+ Z b a p(t,m)x[t (t,m)]dm] ′′ g ′ + Z d c q1(t,x ) f (x[f1(t,x )])dx + Z d c q2(t,h)g(x[f2(t,h)])dh = 0, where g > 0 is a quotient of odd positive integers. By using a generalized Riccati transformation and integral averaging technique, we establish some new sufficient conditions which ensure that every solution of this equation oscillates or converges to zero.


A Precomputed Method For Skyline Evaluation, Mei-Tzu Wang Sep 2016

A Precomputed Method For Skyline Evaluation, Mei-Tzu Wang

Applied Mathematics & Information Sciences

In a mobile environment, the query point may take dynamic distance as a factor to determine the skyline. But few research works involve such a situation. Most efforts are focused on static attributes in static environments. From literature, we also found that most query points are assumed on an unconstrained space. To have the query that involves dynamic distance in constrained space be evaluated more efficiently, a pre-computed method is proposed. We express dominance relation with respect to static attributes as a dominance graph, which is better suited for evaluation. Local pruning is performed within equivalence classes, whereas computing the …


An Efficient Explicit Error Notification With Adaptive Packet Size Mechanism To Improve Tcp Performance In Leo Network, J. Govindarajan, G. Kousalya Sep 2016

An Efficient Explicit Error Notification With Adaptive Packet Size Mechanism To Improve Tcp Performance In Leo Network, J. Govindarajan, G. Kousalya

Applied Mathematics & Information Sciences

LEO satellite network plays a major role in the design of next generation internet. Due to high error rate of satellite link and absence of error handling mechanism in TCP, the end-to-end performance of existing TCP based applications over the satellite environment degrades substantially. Many research contributions have shown that with the help of explicit loss notification, sender is able to discriminate between loss due to congestion and loss due packet corruption, thereby avoids the unnecessary reduction of sending rate. Few studies, however, have mentioned that sending smaller size packets or optimum size packets can increase the success of packet …


An Efficient Failure Recovery Scheme For Service Composition In Pervasive Computing, Chengyuan Yu, Linpeng Huang Sep 2016

An Efficient Failure Recovery Scheme For Service Composition In Pervasive Computing, Chengyuan Yu, Linpeng Huang

Applied Mathematics & Information Sciences

During the execution of service composition, if one component service fails, a failure recovery mechanism is needed to ensure that the running process is not interrupted and the failed service can be replaced quickly and efficiently. In this paper, we propose an efficient failure recovery scheme for rapid reconstruction of services compositions. Sufficient conditions about substitution and keeping state-consistent between services are proposed. Further, the algorithm for keeping state-consistent between services is proposed. The innovation of this paper is that the failure service will be substituted and the failure service’ state will be transformed into the substituting service’ state to …


Portfolio Optimization By Mean-Value At Risk Framework, Shokufeh Banihashemi, Ali Moayedi Azarpour, Hamidreza Navvabpour Sep 2016

Portfolio Optimization By Mean-Value At Risk Framework, Shokufeh Banihashemi, Ali Moayedi Azarpour, Hamidreza Navvabpour

Applied Mathematics & Information Sciences

The purpose of this study is to evaluate various tools used for improving performance of portfolios and assets selection using mean-value at risk models. The study is mainly based on a non-parametric efficiency analysis tool, namely Data Envelopment Analysis (DEA). Conventional DEA models assume non-negative values for inputs and outputs, but variance is the only variable in models that takes non-negative values. At the beginning variance was considered as a risk measure. However, both theories and practices indicate that variance is not a good measure of risk and has some disadvantages. This paper focuses on the evaluation process of the …


The Ideal Of 𝛘2 In A Vector Lattice Of P− Metric Spaces Defined By Musielak-Orlicz Functions, N. Kavitha, N. Subramanian Sep 2016

The Ideal Of 𝛘2 In A Vector Lattice Of P− Metric Spaces Defined By Musielak-Orlicz Functions, N. Kavitha, N. Subramanian

Applied Mathematics & Information Sciences

In this paper we introduce the concepts of ideal t− double Cauchy and ideal t− double analytic sequence in vector lattice defined by Musielak. Some basic properties of these concepts has been investigated.


Evolution Of Special Ruled Surfaces Via The Evolution Of Their Directrices In Euclidean 3-Space E3, R. A. Hussien, Taha Youssef Sep 2016

Evolution Of Special Ruled Surfaces Via The Evolution Of Their Directrices In Euclidean 3-Space E3, R. A. Hussien, Taha Youssef

Applied Mathematics & Information Sciences

In this paper, evolutions of ruled surfaces that are generated by the normal and binormal vector fields of space curve (normal and binormal surfaces) are presented. These evolutions of the ruled surfaces depend on the evolutions of their directrices. Geometric visualization of these ruled surfaces are presented. In addition, the conditions which make these surfaces of types inextensible, developable and minimal are obtained.


A New Modified Binary Differential Evolution Algorithm And Its Applications, Ali Wagdy Mohamed Sep 2016

A New Modified Binary Differential Evolution Algorithm And Its Applications, Ali Wagdy Mohamed

Applied Mathematics & Information Sciences

This paper proposes a novel discrete version of Differential Evolution (NBDE) algorithm to solve combinatorial optimization problems with binary variables. A new binary mutation rule is introduced derived from the table of the basic DE mutation strategy and the value of scaling factor F is 1. The eight different combinations of the three randomly selected individuals using binary encoding are deduced. The developed mutation operator enables NBDE to explore and exploit the search space efficiently and effectively which are verified in applications to discrete optimization problems. Numerical experiments and comparisons on One-Max problem and Knapsack problem with two different sizes …


Estimation Of Higher-Order Regression Via. Sparse Representation Model For Single Image Super-Resolution Algorithm, W. Jino Hans, N. Venkateswaran, Srinath Narayanan, Sandeep Ramachandran Sep 2016

Estimation Of Higher-Order Regression Via. Sparse Representation Model For Single Image Super-Resolution Algorithm, W. Jino Hans, N. Venkateswaran, Srinath Narayanan, Sandeep Ramachandran

Applied Mathematics & Information Sciences

Super-resolution algorithms generate high-resolution (HR) imagery from single or multiple low-resolution (LR) degraded images. In this paper, an efficient single image super-resolution (SR) algorithm using higher-order regression is proposed. Image patches extracted from HR image will have self-similar example patches near its corresponding location in the LR image. A higherorder regression function is learned using these self-similar example patches via. sparse representation model. The regression function is based on local approximations and henceforth estimated from the localized image patches. Taylor series is used as local approximation of the regression function and hence the zeroth order regression co-efficient will yield the …