Hybrid projection methods for equilibrium problems with non‐Lipschitz type bifunctions

Based on the extended extragradient‐like method and the linesearch technique, we propose three projection methods for finding a common solution of a finite family of equilibrium problems. The linesearch used in the proposed algorithms has allowed to reduce some conditions imposed on equilibrium bifunctions. The strongly convergent theorems are established without the Lipschitz‐type condition of bifunctions. The paper also helps in the design and analysis of practical algorithms and gives us a generalization of some previously known problems. Copyright © 2017 John Wiley & Sons, Ltd.     

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.     

Shocks and slip systems: Predictions from a mesoscale theory of continuum dislocation dynamics

Exploring a recently developed mesoscale continuum theory of dislocation dynamics, we derive three predictions about plasticity and grain boundary formation in crystals. (1) There is a residual stress jump across grain boundaries and plasticity-induced cell walls as they form, which self-consistently acts to attract neighboring dislocations; residual stress in this theory appears as a remnant of the driving force behind wall formation under both polygonization and plastic deformation. We derive the predicted asymptotic late-time dynamics of the grain-boundary formation process. (2) During grain boundary formation at high temperatures, there is a predicted cusp in the elastic energy density. (3) In early stages of plasticity, when only one type of dislocation is active (single-slip), cell walls do not form in the theory; instead we predict the formation of a hitherto unrecognized jump singularity in the dislocation density.     

Random Latin squares and 2-dimensional expanders

Expander graphs have been playing an important role in combinatorics and computer science over the last four decades. In recent years a theory of high dimensional expanders is emerging, but as of now all known examples of expanders (random and explicit) have unbounded degrees. The question of existence of bounded degree high dimensional expanders was raised by Gromov and by Dotterrer and Kahle. In this paper we present a new model, based on Latin squares, of 2-dimensional complexes of bounded edge degrees that are expanders with probability tending to 1.     

Graph spectra in Computer Science

In this paper, we shall give a survey of applications of the theory of graph spectra to Computer Science. Eigenvalues and eigenvectors of several graph matrices appear in numerous papers on various subjects relevant to information and communication technologies. In particular, we survey applications in modeling and searching Internet, in computer vision, data mining, multiprocessor systems, statistical databases, and in several other areas. Some related new mathematical results are included together with several comments on perspectives for future research. In particular, we claim that balanced subdivisions of cubic graphs are good models for virus resistent computer networks and point out some advantages in using integral graphs as multiprocessor interconnection networks.     

Approximation in quantale-enriched categories

Our work is a foundational study of the notion of approximation in Q-categories and in (U,Q)-categories, for a quantale Q and the ultrafilter monad U. We introduce auxiliary, approximating and Scott-continuous distributors, the way-below distributor, and continuity of Q- and (U,Q)-categories. We fully characterize continuous Q-categories (resp. (U,Q)-categories) among all cocomplete Q-categories (resp. (U,Q)-categories) in the same ways as continuous domains are characterized among all dcpos. By varying the choice of the quantale Q and the notion of ideals, and by further allowing the ultrafilter monad to act on the quantale, we obtain a flexible theory of continuity that applies to partial orders and to metric and topological spaces. We demonstrate on examples that our theory unifies some major approaches to quantitative domain theory.     

An extension of the dual complexity space and an application to Computer Science

In 1999, Romaguera and Schellekens introduced the theory of dual complexity spaces as a part of the development of a mathematical (topological) foundation for the complexity analysis of programs and algorithms [S. Romaguera, M.P. Schellekens, Quasi-metric properties of complexity spaces, Topology Appl. 98 (1999) 311-322]. In this work we extend the theory of dual complexity spaces to the case that the complexity functions are valued on an ordered normed monoid. We show that the complexity space of an ordered normed monoid inherits the ordered normed structure. Moreover, the order structure allows us to prove some topological and quasi-metric properties of the new dual complexity spaces. In particular, we show that these complexity spaces are, under certain conditions, Hausdorff and satisfy a kind of completeness. Finally, we develop a connection of our new approach with Interval Analysis.     

A distributed combustion solver for engine simulations on grids

Multi-dimensional models for predictive simulations of modern engines are an example of multi-physics and multi-scale mathematical models, since lots of thermofluiddynamic processes in complex geometrical configurations have to be considered. Typical models involve different submodels, including turbulence, spray and combustion models, with different characteristic time scales. The predictive capability of the complete models depends on the accuracy of the submodels as well as on the reliability of the numerical solution algorithms. In this work we propose a multi-solver approach for reliable and efficient solution of the stiff Ordinary Differential Equation (ODE) systems arising from detailed chemical reaction mechanisms for combustion modeling. Main aim was to obtain high-performance parallel solution of combustion submodels in the overall procedure for simulation of engines on distributed heterogeneous computing platforms. To this aim we interfaced our solver with the CHEMKIN-II package and the KIVA3V-II code and carried out multi-computer simulations of realistic engines. Numerical experiments devoted to test reliability of the simulation results and efficiency of the distributed combustion solver are presented and discussed.