This article is devoted to studying the solutions to the differential equation f (k) +Ak−1(z)f (k−1) + · · ·+A0(z)f = 0, k ≥ 2, where coefficients Aj(z) are entire functions of integer order. We obtain estimates on the orders and the hyper orders of the solutions to the above equation.

In this study, we propose the concept of left extension a hyperideal by generalizing k-hyperideals in ordered semihyperrings with symmetrical hyper-operation ?. By using notion k-hyperideal, prove some results semihyperrings. The paper can be viewed as generalization for k-ideals semirings.

Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general produce different data partitions. In fact, several partitions can also be obtained by using a single clustering algorithm due to dependencies on initialization or the selection of the value of some design parameter. This paper ad...

where Aj(z) (j = 0, 1, . . . , k) are meromorphic functions with finite order. Under some conditions on the coefficients, we show that all meromorphic solutions f 6≡ 0 of the above equations have an infinite order and infinite lower order. Furthermore, we give some estimates of their hyper-order, exponent and hyper-exponent of convergence of distinct zeros. We improve the results due to Kwon; C...

An apprenticeship-learning-based technique is used as a hyperheuristic to generate heuristics for an online combinatorial problem. It observes and learns from the actions of a known-expert heuristic on small instances, but has the advantage of producing a general heuristic that works well on other larger instances. Specifically, we generate heuristic policies for online bin packing problem by u...

A hyper-heuristic for the one dimensional bin packing problem is presented that uses an Evolutionary Algorithm (EA) to evolve a set of attributes that characterise a problem instance. The EA evolves divisions of variable quantity and dimension that represent ranges of a bin’s capacity and are used to train a k-nearest neighbour algorithm. Once trained the classifier selects a single determinist...

Assume we are given a right-totally Wiener, Noether, hyper-dependent polytope acting partially on a continuous scalar u. U. Eisenstein’s description of Gauss functions was a milestone in axiomatic Lie theory. We show that there exists an analytically complete, unconditionally Levi-Civita and prime reducible, linear, hyper-reversible graph. So in [17], it is shown that X ′ (0, . . . ,−K) ≡ ⋂ (T ...

Abstract We consider piecewise-smooth dynamical systems, i.e., systems of ordinary differential equations switching between different sets on distinct domains, separated by hyper-surfaces. As is well-known, when the solution approaches a discontinuity manifold, classical may cease to exist. For this reason, starting with pioneering work Filippov, concept weak (also known as sliding mode) has be...

BACKGROUND The onset of diabetes causes disruption of respiratory epithelial mediators. The present study investigates whether diabetes modifies the epithelium mediated bronchial responses in hyper-reactive airway smooth muscle (ASM) primarily through nitric oxide (NO), cyclooxygenase (COX), and epithelium derived hyperpolarizing factor (EpDHF) pathways. METHODS Experimental model of guinea p...

We construct a ‘weak’ version EMw(K ) of Lack & Street’s 2-category of monads in a 2-category K , by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between monads in EMw(K ) and composite pre-monads in K is discussed. If K admits Eilenberg-Moore constructions for monads, we define two symmetrical notions of ‘wea...