In previous work, one of us calculated the Solvation force of hard ellipsoid fluid with hard Gaussian overlap potential using hard needle wall interaction and non-linear equation proposed by Grimson- Rickyazen. In present work, using density functional theory and extended restricted orientation model, the solvation force of hard ellipsoid fluid in presence of more realistic rod- sphere and rod-...

‎The Mod $2$ Steenrod algebra is a Hopf algebra that consists of the primary cohomology operations‎, ‎denoted by $Sq^n$‎, ‎between the cohomology groups with $mathbb{Z}_2$ coefficients of any topological space‎. ‎Regarding to its vector space structure over $mathbb{Z}_2$‎, ‎it has many base systems and some of the base systems can also be restricted to its sub algebras‎. ‎On the contrary‎, ‎in ...

The original analysis of sponsored search auctions by Varian and independently by Aggarwal et al. did not take into account the notion of reserve prices, which are common across all major search engines. We investigate this further and show that the separability assumption derived by Aggarwal et al. is not sufficient for aligning the greedy allocation employed by GSP and the efficient allocatio...

We introduce a new geometric spanner, δ-Greedy, whose construction is based on a generalization of the known Path-Greedy and Gap-Greedy spanners. The δ-Greedy spanner combines the most desirable properties of geometric spanners both in theory and in practice. More specifically, it has the same theoretical and practical properties as the Path-Greedy spanner: a natural definition, small degree, l...

In this note, we present a notion of species isomorphism for fibered Burnside rings. We prove that can be restricted to an mark tables, it extended between the ghost rings and provide three additional characterizations concept.

We introduce a multidimensional multiblock clustering (MDMBC) algorithm in this paper. MDMBC can generate overlapping clusters with similar values along of dimensions. The parsimonious binary vector representation lends itself to the application efficient meta-heuristic optimization algorithms. In paper, hill-climbing (HC) greedy search has been presented that be extended by several stochastic ...

A graph drawing is greedy if, for every ordered pair of vertices (x, y), there is a path from x to y such that the Euclidean distance to y decreases monotonically at every vertex of the path. Greedy drawings support a simple geometric routing scheme, in which any node that has to send a packet to a destination “greedily” forwards the packet to any neighbor that is closer to the destination than...

In this paper, a scheduling problem for Automated Guided Vehicles in container terminals is defined and formulated as a Minimum Cost Flow model. This problem is then solved by a novel algorithm, NSA+, which extended the standard Network Simplex Algorithm (NSA). Like NSA, NSA+ is a complete algorithm, which means it guarantees optimality of the solution if it finds one within the time available....

Routing protocols for Mobile Ad Hoc Networks (MANETs) have been extensively studied for more than fifteen years. Position-based routing protocols route packets towards the destination using greedy forwarding (i.e., an intermediate node forwards packets to a neighbor that is closer to the destination than itself). Different position-based protocols use different strategies to pick the neighbor t...