1. For a finite set 5 of elements and a family F of subsets of S, a cover C of S from F is a subfamily CC.F such that U ( 0 = S. A cover C is called minimum if its cardinality \C\ is as small as possible. A packing D in F is a subfamily of i whose members are disjoint. I t is called maximum if its cardinality \D\ is as large as possible. Theorem 1 here is relevant to the task of finding minimum...

By using two new algebraic lemmas we obtain Chen’s inequalities for submanifolds of a Riemannian manifold of nearly quasi-constant curvature endowed with a semi-symmetric non-metric connection. Moreover, we correct a result of C. Özgür and A. Mihai’s paper (Chen inequalities for submanifolds of real space forms with a semi-symmetric non-metric connection, Canad. Math. Bull. 55 (2012), 611–622).

In Cloud Computing (CC) environment, load balancing refers to the process of optimizing resources virtual machines. Load in CC environment is one analytical approaches utilized ensure indistinguishable workload distribution and effective utilization resources. This because only by ensuring balance dynamic results higher user satisfaction optimal allocation resource, therefore improve cloud appl...

We give an introduction into the fascinating area of flows over time—also called “dynamic flows” in the literature. Starting from the early work of Ford and Fulkerson on maximum flows over time, we cover many exciting results that have been obtained over the last fifty years. One purpose of this chapter is to serve as a possible basis for teaching network flows over time in an advanced course o...

For smart city traffic flow prediction in the period of big data and industry 4.0, accuracy is low, difficult, effect different geographical locations. This paper proposes a communication forecast based on Industry 4.0 analysis application. Firstly, this theoretically explains application scenario urban fault text analyzes characteristics related problems, especially problems. Secondly, AC algo...

A set-similarity joins based semi-supervised approach is presented to mine Chinese sentiment words and sentences. The set-similarity joins is taken to join nodes in unconnected sub-graphs conducted by cutting the flow graph with Ford-Fulkerson algorithm into positive and negative sets to correct wrong polarities predicted by min-cut based semisupervised methods. Experimental results in digital,...

We present a formalization of the Ford-Fulkerson method for computing the maximum flow in a network. Our formal proof closely follows a standard textbook proof, and is accessible even without being an expert in Isabelle/HOL — the interactive theorem prover used for the formalization. We then use stepwise refinement to obtain the Edmonds-Karp algorithm, and formally prove a bound on its complexi...

TSPLIB is Gerhard Reinelt's library of some hundred instances of the traveling salesman problem. Some of these instances arise from drilling holes in printed circuit boards; others arise from X-ray crystallography; yet others have been constructed articially. None of them (with a single exception) is contrived to be hard and none of them is contrived to be easy; their sizes range from 17 to 85,...

OBJECTIVE The primary aim of this study was to assess the clinical and functional evolution of patients with total-thickness symptomatic cartilaginous injury of the patellar joint surface, treated by means of osteochondral autologous transplantation. METHODS This prospective study was conducted from June 2008 to March 2011 and involved 17 patients. The specific questionnaires of Lysholm, Kuja...

The multi-dimensional orthogonal packing problem (OPP) is a well studied optimization problem [3,9]. Given a set of items with rectangular shapes, the problem is to decide whether there is a non-overlapping packing of these items in a rectangular bin. Rotation of items is not allowed. Fekete and Schepers introduced a tuple of interval graphs as data structures to store a feasible packing, and g...