Search

Your search keyword '"Mansouri, H."' showing total 657 results
Start Over Author "Mansouri, H."
657 results on '"Mansouri, H."'

30. Transient deformation and swelling of paper by aqueous co-solvent solutions

Author

Wong, C.-L., Wang, S., Karimnejad, S., Wijburg, M.G., Mansouri, H., Darhuber, A.A., Wong, C.-L., Wang, S., Karimnejad, S., Wijburg, M.G., Mansouri, H., and Darhuber, A.A.

Abstract

Inkjet printing inks frequently contain polar liquids of low volatility such as glycerol or poly(ethylene glycols) in addition to the main solvent water. The deposition of these liquids on paper sheets induces swelling of the cellulose fibers, which leads to an overall, anisotropic deformation of the sheet. We characterized the corresponding strain components by means of a grid projection method and white light interferometry. For pure water, most of the hydroexpansion strain vanishes again after drying is complete. However, for aqueous solutions of non-volatile co-solvents, a large fraction of the deformation persists after the water has evaporated. Because swelling occurs only after liquid enters the cellulose fibers, monitoring the dynamics of expansion provides insight into the pore-fiber distribution of co-solvents. The corresponding timescales of pore-fiber transport strongly depend on the co-solvent concentration, as a sufficient quantity of water is needed to plasticize the fiber walls.

Published
2023

40. A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems

Author

Asadi S. and Mansouri H.

Subjects
horizontal linear complementarity problem (HLCP), infeasible-interior point method, central path, Management information systems, T58.6-58.62
Abstract

In this paper we generalize an infeasible interior-point method for linear optimization to horizontal linear complementarity problem (HLCP). This algorithm starts from strictly feasible iterates on the central path of a perturbed problem that is produced by suitable perturbation in HLCP problem. Then, we use so-called feasibility steps that serves to generate strictly feasible iterates for the next perturbed problem. After accomplishing a few centering steps for the new perturbed problem, we obtain strictly feasible iterates close enough to the central path of the new perturbed problem. The complexity of the algorithm coincides with the best known iteration complexity for infeasible interior-point methods.

Published
2015
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results