An optimal triangulation for second-order elliptic problems

Let Ω be a polygonal domain in $\text{R}{}^{\mathrm{n}}$, τ_h an associated triangulation and u_h the finite element solution of a well-posed second-order elliptic problem on (Ω, τ_h). Let M = {M_i}^{p + q}_{i = 1} be the set of nodes which defines the vertices of the triangulation τ_h: for each i,$\text{M}{}_{\mathrm{i}}\text{= {x}{}_{\mathrm{i}}{}^{\mathrm{l}}\text{¦1 ? l ?n}}$ in Rⁿ. The object of this paper is to provide a computational tool to approximate the best set of positions M? of the nodes and hence the best triangulation $\text{}\text{?}\text{gt}{}_{\mathrm{h}}$ which minimizes the solution error in the natural norm associated with the problem.The main result of this paper are theorems which provide explicit expressions for the partial derivatives of the associated energy functional with respect to the coordinates x_i^l, 1 ? l ? n, of each of the variable nodes M_i, i = 1,…, p.     

Unsteady micropolar fluid flow in a thin domain with Tresca fluid–solid interface law

We consider a micropolar fluid flow in a two-dimensional domain. We assume that the velocity field satisfies a non-linear slip boundary condition of friction type on a part of the boundary while the micro-rotation field satisfies non-homogeneous Dirichlet boundary conditions. We prove the existence and uniqueness of a solution. Then motivated by lubrication problems we assume that the thickness and the roughness of the domain are of order $0<\epsilon <<1$ and we study the asymptotic behaviour of the flow as $\epsilon$ tends to zero. By using the two-scale convergence technique we derive the limit problem which is totally decoupled for the limit velocity and pressure $(v^0,p^0)$ on one hand and the limit micro-rotation $Z^0$ on the other hand. Moreover we prove that $v^0$, $p^0$ and $Z^0$ are uniquely determined via auxiliary well-posed problems.     

On Space Efficient Two Dimensional Range Minimum Data Structures

The two dimensional range minimum query problem is to preprocess a static m by n matrix (two dimensional array) A of size N=m⋅n, such that subsequent queries, asking for the position of the minimum element in a rectangular range within A, can be answered efficiently. We study the trade-off between the space and query time of the problem. We show that every algorithm enabled to access A during the query and using a data structure of size O(N/c) bits requires Ω(c) query time, for any c where 1≤c≤N. This lower bound holds for arrays of any dimension. In particular, for the one dimensional version of the problem, the lower bound is tight up to a constant factor. In two dimensions, we complement the lower bound with an indexing data structure of size O(N/c) bits which can be preprocessed in O(N) time to support O(clog ² c) query time. For c=O(1), this is the first O(1) query time algorithm using a data structure of optimal size O(N) bits. For the case where queries can not probe A, we give a data structure of size O(N⋅min {m,log n}) bits with O(1) query time, assuming m≤n. This leaves a gap to the space lower bound of Ω(Nlog m) bits for this version of the problem.     

Average-case analysis of the Modified Harmonic algorithm

In this paper we analyze the average-case performance of the Modified Harmonic algorithm for on-line bin packing. We first analyze the average-case performance for arbitrary distribution of item sizes over (0,1]. This analysis is based on the following result. Letf ₁ andf ₂ be two linear combinations of random variables {N _i } _i=1 ^k where theN _i 's have a joint multinomial distribution for eachn=σ _i=1 ^k ,N _i . LetE(f ₁) ≠ O andE(f ₂)≠ 0. Then lim_{n →}∞E(max(_{f 1},f ₂ ))/n = lim _n →∞ max(E(f ₁),E(f ₂))/n. We then consider the special case when the item sizes are uniformly distributed over (0,1]. For specific values of the parameters, the Modified Harmonic algorithm turns out to be better than the other two linear-time on-line algorithms—Next Fit and Harmonic—in both the worst case as well as the average case. We also obtain optimal values for the parameters of the algorithm from the average-case standpoint. For these values of the parameters, the average-case performance ratio is less than 1.19. This compares well with the performance ratios 1.333. and 1.2865. of the Next Fit algorithm and the Harmonic algorithm, respectively.     

Improved deterministic algorithms for weighted matching and packing problems

Based on the method of (n,k)-universal sets, we present a deterministic parameterized algorithm for the weighted rd-matching problem with time complexity O^∗(4^{(r−1)k+o(k)}), improving the previous best upper bound O^∗(4^rk+o(k)). In particular, the algorithm applied to the unweighted 3d-matching problem results in a deterministic algorithm with time O^∗(16^k+o(k)), improving the previous best result O^∗(21.26^k). For the weighted r-set packing problem, we present a deterministic parameterized algorithm with time complexity O^∗(2^{(2r−1)k+o(k)}), improving the previous best result O^∗(2^2rk+o(k)). The algorithm, when applied to the unweighted 3-set packing problem, has running time O^∗(32^k+o(k)), improving the previous best result O^∗(43.62^k+o(k)). Moreover, for the weighted r-set packing and weighted rd-matching problems, we give a kernel of size O(k^r), which is the first kernelization algorithm for the problems on weighted versions.     

Thermodynamic assessment of the KCl–K2CO3–NaCl–Na2CO3 system

Phase equilibria and thermodynamic properties of the KCl–K₂CO₃–NaCl–Na₂CO₃ system were analyzed on the basis of the thermodynamic evaluation of the KCl–NaCl,KCl–K₂CO₃,NaCl–Na₂CO₃,K₂CO₃–Na₂CO₃ and KCl–K₂CO₃–NaCl–Na₂CO₃ systems. The Gibbs energies of individual phases was approximated by two-sublattice models for ionic liquids and crystals. Most of the experimental information was well described by the present set of thermodynamic parameters. The lowest monovariant eutectic temperature in the KCl–NaCl–Na₂CO₃ system is located at 573 ^°C, with a composition of X_Na2CO3=0.31,X_KCl=0.35 and X_NaCl=0.34.     

Three-machine flowshop with two operations per job to minimize makespan

This work studies three variants of a three-machine flowshop problem with two operations per job to minimize makespan (F3/o = 2/C_max). A set of n jobs are classified into three mutually exclusive families A, B and C. The families A, B and C are defined as the set of jobs that is scheduled in machine sequence (M₁, M₂), (M₁, M₃) and (M₁, M₃), respectively, where (M_x, M_y) specifies the machine sequence for the job that is processed first on M_x, and then on M_y. Specifically, jobs with the same route (machine sequence) are classified into the same family. Three variants of F3/o = 2/C_max are studied. First, F3/GT, no-idle, o = 2/C_max, in which both machine no-idle and GT restrictions are considered. The GT assumption requires that all jobs in the same family are processed contiguously on the machine and the machine no-idle assumption requires that all machines work continuously without idle time. Second, the problem F3/GT, o = 2/C_max, in which the machine no-idle restriction in the first variant is relaxed, is considered. Third, the problem F3/no-idle, o = 2/C_max with the GT assumption in the first variant relaxed is considered. Based on the dominance conditions developed, the optimal solution is polynomially derived for each variant. These results may narrow down the gap between easy and hard cases of the general problem.     

An efficient NFEM for optimal control problems governed by a bilinear state equation

In this paper, a nonconforming finite element method (NFEM) is proposed for the constrained optimal control problems (OCPs) governed by a bilinear state equation. The state and adjoint state are approximated by the nonconforming $E{Q}_1^{rot}$ element, and the control is approximated by the orthogonal projection through the state and adjoint state. Some superclose and superconvergence properties are obtained by full use of the distinguish characters of this $E{Q}_1^{rot}$ element, such as the interpolation operator equals the Ritz projection, and the consistency error is one order higher than its interpolation error in the broken energy norm. Finally, some numerical results are provided to verify the theoretical analysis.     

Mason: morphological simplification

The traditional rounding and filleting morphological filters are biased. Hence, as r grows, the rounding R_r (S) of S shrinks and the filleting F_r (S) grows. A shape S is r-regular when R_r (S) = F_r (S) = S. The combinations F_r (R_r (S)) and R_r (F_r (S)) produce nearly r-regular shapes, but retain a bias: F_r (R_r (S)) is usually smaller than S and R_r (F_r (S)) is larger. To overcome this bias, we propose a new filter, called Mason. The r-mortar M_r (S) of S is F_r (S)–R_r (S), and the stability of a point P with respect to S is the smallest value of r for which P belongs to M_r (S). Stability provides important information about the shape’s imbedding that cannot be obtained through traditional topological or differential analysis tools. F_r (R_r (S)) and R_r (F_r (S)) only affect space in M_r (S). For each maximally connected component of M_r (S), Mason performs either F_r (R_r (S)) or R_r (F_r (S)), choosing the combination that alters the smallest portion of that component. Hence, Mason acts symmetrically on the shape and on its complement. Its output is guaranteed to have a smaller symmetric difference with the original shape than that of either combination F_r (R_r (S)) or R_r (F_r (S)). Many previously proposed shape simplification algorithms were focused on reducing the combinatorial storage or processing costs of a shape at the expense of the smoothness and regularity or altered the shape in regular portions that did not exhibit any high frequency complexity. Mason is the first shape simplification operator that is independent of the particular representation and offers the advantage of preserving portions of the boundary of S that are regular at the desired scale.     

Model Checking Abilities of Agents: A Closer Look

Alternating-time temporal logic (atl) is a logic for reasoning about open computational systems and multi-agent systems. It is well known that atl model checking is linear in the size of the model. We point out, however, that the size of an atl model is usually exponential in the number of agents. When the size of models is defined in terms of states and agents rather than transitions, it turns out that the problem is (1) Δ ₃ ^P -complete for concurrent game structures, and (2) Δ ₂ ^P -complete for alternating transition systems. Moreover, for “Positive atl” that allows for negation only on the level of propositions, model checking is (1) Σ ₂ ^P -complete for concurrent game structures, and (2) NP-complete for alternating transition systems. We show a nondeterministic polynomial reduction from checking arbitrary alternating transition systems to checking turn-based transition systems, We also discuss the determinism assumption in alternating transition systems, and show that it can be easily removed. In the second part of the paper, we study the model checking complexity for formulae of atl with imperfect information (atl _ir ). We show that the problem is Δ ₂ ^P -complete in the number of transitions and the length of the formula (thereby closing a gap in previous work of Schobbens in Electron. Notes Theor. Comput. Sci. 85(2), 2004). Then, we take a closer look and use the same fine structure complexity measure as we did for atl with perfect information. We get the surprising result that checking formulae of atl _ir is also Δ ₃ ^P -complete in the general case, and Σ ₂ ^P -complete for “Positive atl _ir ”. Thus, model checking agents’ abilities for both perfect and imperfect information systems belongs to the same complexity class when a finer-grained analysis is used.     

Longest fault-free paths in hypercubes with vertex faults

The hypercube is one of the most versatile and efficient interconnection networks (networks for short) so far discovered for parallel computation. Let f denote the number of faulty vertices in an n-cube. This study demonstrates that when f ? n − 2, the n-cube contains a fault-free path with length at least 2ⁿ − 2f − 1 (or 2ⁿ − 2f − 2) between two arbitrary vertices of odd (or even) distance. Since an n-cube is a bipartite graph with two partite sets of equal size, the path is longest in the worst-case. Furthermore, since the connectivity of an n-cube is n, the n-cube cannot tolerate n − 1 faulty vertices. Hence, our result is optimal.     

Generation of robust root loci for linear systems with parametric uncertainties in an ellipsoid

Given a parametric polynomial family p(s; Q) := {ⁿ _k=0 a_k (q)s^k : q ] Q}, Q R ^m , the robust root locus of p(s; Q) is defined as the two-dimensional zero set _p,Q := {s ] C:p(s; q) = 0 for some q ] Q}. In this paper we are concerned with the problem of generating robust root loci for the parametric polynomial family p(s; E) whose polynomial coefficients depend polynomially on elements of the parameter vector q ] E which lies in an m-dimensional ellipsoid E. More precisely, we present a computational technique for testing the zero inclusion/exclusion of the value set p(z; E) for a fixed point z in C, and then apply an integer-labelled pivoting procedure to generate the boundary of each subregion of the robust root locus _p,E . The proposed zero inclusion/exclusion test algorithm is based on using some simple sufficient conditions for the zero inclusion and exclusion of the value set p(z,E) and subdividing the domain E iteratively. Furthermore, an interval method is incorporated in the algorithm to speed up the process of zero inclusion/exclusion test by reducing the number of zero inclusion test operations. To illustrate the effectiveness of the proposed algorithm for the generation of robust root locus, an example is provided.     

Order Scheduling in an Environment with Dedicated Resources in Parallel

We consider m machines in parallel with each machine capable of producing one specific product type. There are n orders with each one requesting specific quantities of the various different product types. Order j may have a release date r_j and a due date d_j. The different product types for order j can be produced at the same time. We consider the class of objectives ∑ f_j(C_j) that includes objectives such as the total weighted completion time ∑ w_j C_j and the total weighted tardiness ∑ w_j T_j of the n orders. We present structural properties of the various problems and a complexity result. In particular, we show that minimizing ∑ C_j when m ≥ 3 is strongly NP-hard. We introduce two new heuristics for the ∑ C_j objective. An empirical analysis shows that our heuristics outperform all heuristics that have been proposed for this problem in the literature.     

Diameter variability of cycles and tori

The diameter of a graph is an important factor for communication as it determines the maximum communication delay between any pair of processors in a network. Graham and Harary [N. Graham, F. Harary, Changing and unchanging the diameter of a hypercube, Discrete Applied Mathematics 37/38 (1992) 265-274] studied how the diameter of hypercubes can be affected by increasing and decreasing edges. They concerned whether the diameter is changed or remains unchanged when the edges are increased or decreased. In this paper, we modify three measures proposed in Graham and Harary (1992) to include the extent of the change of the diameter. Let D^-k(G) is the least number of edges whose addition to G decreases the diameter by (at least) k, D⁺⁰(G) is the maximum number of edges whose deletion from G does not change the diameter, and D^+k(G) is the least number of edges whose deletion from G increases the diameter by (at least) k. In this paper, we find the values of D^-k(C_m), D^-1(T_m,n), D^-2(T_m,n), D⁺¹(T_m,n), and a lower bound for D⁺⁰(T_m,n) where C_m be a cycle with m vertices, T_m,n be a torus of size m by n.     

Influence of tyre pressure and vertical load on coefficient of rolling resistance and simulated cycling performance

The coefficient of rolling resistance (C _r) for pneumatic tyres is dependent on hysteresis loss from tyre deformation which is affected by the vertical force applied to the tyres (F _v) and the tyre inflation pressure (P _r). The purpose of this paper was to determine the relative influence of five different levels of P _r and four different levels of F _v on C _r and to examine the relationships of C _r with P _r and F _v during cycling locomotion. F _v was modified through carriage of additional mass by the subject. C _r was determined with the coasting deceleration method from measurements performed in a level hallway. Iterations minimizing the sum of the squared difference between the actual deceleration distance and a predicted deceleration distance were used to determine C _r. This latter distance was computed from a derivation based on Newton's second law applied to the forces opposing motion. C _r was described by a hyperbolic function of P _r (C _r = 0.1071 P _r ^?0.477, r ² = 0.99, p &lt; 0.05), decreasing 62.4% from 150 kPa (C_r= 0.0101) to 1200 kPa (C_r = 0.0038). F _v was related to C _r by a polynomial function (C _r = 1.92.10^?8 F _v ² ?2.86.10^?5 F _v + 0.0142, r ² = 0.99, p = 0.084), with an added mass of 15 kg (C _r = 0.0040) resulting in an 11.4% increase in C _r compared with no added mass (C _r = 0.0035). From this study, it is concluded that the relationships of P _r and F _v with C _r for cycling are non-linear. Furthermore, a simulation model shows that changes in P _r and F _v of the magnitude examined here have an important effect on competitive cycling performance.     

Asymptotic relation of M- and P-estimators of location

Let T_n and M_n be the P-estimator (Pitman-like estimator) and M_n the M-estimator of the location parameter θ, respectively, both generated by function ρ with the derivative ψ=ρ: It is demonstrated that, under some assumptions on the underlying distribution function F, the difference M_n-T_n is of the order o_p(n^-1/2) in the case of Huber's function ψ. It is further shown that M_n-T_n=o_p(n^-1) if ψ is sufficiently smooth.     

Solubility prediction for the HCl–MgCl2–H2O system at 40 C and solubility equilibrium constant calculation for HCl ⋅ MgCl2 ⋅ 7H2O at 40 C

The component solubilities of the HCl–MgCl₂–H₂O system at 40 ^°C were calculated by using Pitzer’s ion-interaction model and the solubility equilibrium constant of HCl⋅MgCl₂⋅7H₂O at 40 ^°C was evaluated according to the solubility data for the HCl–MgCl₂–H₂O system at −19.8, 0, 20, 25 and 50 ^°C. This study can provide the parameters necessary for solubility prediction for the HCl–LiCl–MgCl₂–H₂O system at 40 ^°C and supply a theoretical basis for the manufacturing process which was proposed by Gao and employed to extract MgCl₂⋅6H₂O from salt lake brine.