China
Africa
Explore chapters and articles related to this topic
HDF5
Published in Praveen Kumar, Jay Alameda, Peter Bajcsy, Mike Folk, Momcilo Markus, Hydroinformatics: Data Integrative Approaches in Computation, Analysis, and Modeling, 2005
Atomic types are distinguished by the fact that they are always dealt with in their entirety. It is not possible to read or write part of an atomic type. They include common integer and floating point numbers, as well as user-defined integer and floating point types. (The HDF5 format fully describes datatypes, so virtually any type of integer or floating point value can be represented.) Variable-length types can be defined, including character strings, but also including variable-length strings of any other atomic type. References are a datatype that refer to other objects in an HDF5 file. Region references refer to regions within the multidimensional array of a dataset. Enumeration types are types whose range of values include nominal values (e.g., names) that are mapped to integers. Array datatypes are multidimensional arrays that cannot be subdivided.
Scheduling flowline manufacturing cells with inter-cellular moves: non-permutation schedules and material flows in the cell scheduling problem
Published in International Journal of Production Research, 2020
J. S. Neufeld, F. F. Teucher, U. Buscher
Advantages and disadvantages of the tested algorithms are illustrated by means of the example presented in Section 3.2. For the sake of clarity all job sequences are assumed to be fixed with , and . Detailed steps of SVS algorithm to sequence the families are illustrated as supplementary data. For both objectives a pairwise comparison leads to a score of 2 for family 3, 1 for family 2 and 0 for family 1. Thus, the family sequence (3,2,1) is chosen and leads to a makespan of 19 and total cell makespan of 47, respectively. Figure 7 displays this solution together with the optimal permutation schedule and optimal non-permutation schedule, that can easily be determined by complete enumeration. It is obvious that SVS does not lead to the optimal permutation solution (makespan of 17, total cell makespan 41). The main reason can be seen in the third operation of job 4: as job 4 has to proceed family 1 on the bottleneck machine M2 and at the same time, its operation on M2 is the last operation, the third operation of job 4 blocks the completion of the jobs 1 and 2 (family 1) unnecessarily. However, in the pairwise comparison of families 1 and 2 during SVS this is not evident.
Small-world architecture of networked control systems
Published in International Journal of Control, 2018
The rank ri induces a partial ordering of the vertices . Consequently, the vertices can be enumerated according to their rank starting with the vertex 0 towards the vertices with the rank . The new enumeration results from a permutation of the set represented by the function Perm (i). Obviously, hold. The permutation matrix has the elements: The adjacency matrix of the graph with the re-named vertices is An important property of the graph and its adjacency matrix is stated in the following lemma.
A general system for heuristic minimization of convex functions over non-convex sets
Published in Optimization Methods and Software, 2018
S. Diamond, R. Takapoui, S. Boyd
Depending on the set , the problem (1) can be solved globally by a variety of algorithms, including (or mixing) branch-and-bound [10,54,62], branch-and-cut [64,80,82], semidefinite hierarchies [76], or even direct enumeration when is a finite set. In each iteration of these methods, a convex optimization problem derived from (1) is solved, with removed, and (possibly) additional variables and convex constraints added. While for many applications these methods are effective, they are generally thought to have high worst-case complexities and indeed can be very slow for some problems.