Perturbative manifolds and the Noether generators of nth-order Poisson equations

A manifold that contains small perturbations will induce a perturbed partial differential equation. The partial differential equation that we select is the Poisson equation – in order to explore the interplay between the geometry of the manifold and the perturbations. Specifically, we show how the problem of symmetry determination, for higher-order perturbations, can be elegantly expressed via geometric conditions.     

Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

Optimal batch sizing in a multi-stage production system with rework consideration

In a production system, rework process plays an important role in eliminating waste and effectively controlling the cost of manufacturing. Determining the optimal batch size in a system that allows for rework is, therefore, a worthwhile objective to minimize the inventory cost of work-in-processes and the finished goods. In this paper, models for the optimum batch quantity in a multi-stage system with rework process have been developed for two different operational policies. Policy 1 deals with the rework within the same cycle with no shortage and policy 2 deals with the rework done after N cycles, incurring shortages in each cycle. The major components that play a role in minimizing this cost of the system are manufacturing setups, work-in-processes, storage of finished goods, rework processing, waiting-time, and penalty costs to discourage the generation of defectives. The mathematical structure of this rework processing model falls under a nonlinear convex programming problems for which a closed-form solution has been proposed and results are demonstrated through numerical examples, followed by sensitivity analyses of different important parameters. It is concluded that the total cost in policy 2 tends to be smaller than that in policy 1 at lower proportion of defectives if the in-process carrying cost is low. Policy 2 may be preferred when the work-in-process carrying cost is low and the penalty cost is negligible.     

A new branch and bound algorithm for cell formation problem

Cell formation (CF) is the first and the most important problem in designing cellular manufacturing systems. Due to its non-polynomial nature, various heuristic and metaheuristic algorithms have been proposed to solve CF problem. Despite the popularity of heuristic algorithms, few studies have attempted to develop exact algorithms, such as branch and bound (B&B) algorithms, for this problem. We develop three types of branch and bound algorithms to deal with the cell formation problem. The first algorithm uses a binary branching scheme based on the definitions provided for the decision variables. Unlike the first algorithm, which relies on the mathematical model, the second one is designed based on the structure of the cell formation problem. The last algorithm has a similar structure to the second one, except that it has the ability to eliminate duplicated nodes in branching trees. The proposed branch and bound algorithms and a hybrid genetic algorithm are compared through some numerical examples. The results demonstrate the effectiveness of the modified problem-oriented branch and bound algorithm in solving relatively large size cell formation problems.     

Entropy generation in flow field subjected to a porous block in a vertical channel

Entropy generation in the flow field subjected to a porous block situated in a vertical channel is examined. The effects of channel inlet port height (vertical height between channel inlet port and the block center), porosity, and block aspect ratio on the entropy generation rate due to fluid friction and heat transfer in the fluid are examined. The governing equations of flow, heat transfer, and entropy are solved numerically using a control volume approach. Air is used as the flowing fluid in the channel. A uniform heat flux is considered in the block and natural convection is accommodated in the analysis. It is found that entropy generation rate due to fluid friction increases with increasing inlet port height, while this increase becomes gradual for entropy generation rate due to heat transfer for the inlet port height exceeding 0.03 m. The porosity lowers entropy generation rate due to fluid friction and heat transfer. The effect of block aspect ratio on entropy generation rate is notable; in which case, entropy generation rate increases for the block aspect ratio of 1:2.     

Synthesis of 1,4-disubstituted mono and bis-triazolocarbo-acyclonucleoside analogues of 9-(4-hydroxybutyl)guanine by Cu(I)-catalyzed click azide-alkyne cycloaddition

A series of novel mono-1,2,3-triazole and bis-1,2,3-triazole acyclonucleoside analogues of 9-(4-hydroxybutyl)guanine was prepared via copper(I)-catalyzed 1,3-dipolar cycloaddition of N-9 propargylpurine, N-1-propargylpyrimidines/as-triazine with the azido-pseudo-sugar 4-azidobutylacetate under solvent-free microwave conditions, followed by treatment with K(2)CO(3)/MeOH, or NH(3)/MeOH. All compounds studied in this work were screened for their antiviral activities [against human rhinovirus (HRV) and hepatitis C virus (HCV)] and antibacterial activities against a series of Gram positive and negative bacteria.