In this paper, we shall discuss how to construct multidimensional biorthogonal wavelets by employing a coset by coset (CBC) algorithm. We shall construct biorthogonal wavelets on the hexagonal lattice by CBC algorithm. In particular, we shall propose a CBC algorithm to construct inter-polatory biorthogonal wavelets which are derived from pairs of fundamental reenable functions. More precisely, ...

We construct a simplicial locally convex algebra, whose weak dual is the standard cosimplicial topological space. The construction is carried out in a purely categorical way, so that it can be used to construct (co)simplicial objects in a variety of categories — in particular, the standard cosimplicial topological space can be produced.

We show that there is no [24, 12, 9] doubly-even self-dual code over F4 by attempting to construct the generator matrix of this code directly.

We construct nontrivial cohomology classes of the space Imb (S, Rn) of imbeddings of the circle into Rn, by means of Feynman diagrams. More precisely, starting from a suitable linear combination of nontrivalent diagrams, we construct, for every even number n ≥ 4, a de Rham cohomology class on Imb (S, Rn). We prove nontriviality of these classes by evaluation on the dual cycles.

Radiolabeled liposomes have been employed as diagnostic tools to monitor in vivo distribution of liposomes in real-time, which helps in optimizing the therapeutic efficacy of the liposomal drug delivery. This work utilizes the platform of [111In]-Liposome as a drug delivery vehicle, encapsulating a novel 18F-labeled carboplatin drug derivative ([18F]-FCP) as a dual-molecular imaging tool as bot...

In this work, new construction methods for self-dual codes are given. The methods use the short Kharaghani array and a variation of it. These are applicable to any commutative Frobenius ring. We apply the constructions over the ring F2 + uF2 and self-dual Type I [64, 32, 12]2-codes with various weight enumerators obtained as Gray images. By the use of an extension theorem for self-dual codes we...

We give two methods for constructing many linear complementary dual (LCD short) codes from a given LCD code, by modifying some known self-dual codes. Using the methods, we construct binary and quaternary Hermitian codes, which improve previously lower bounds on largest minimum weights.

In this paper, Antczak’s -approximation approach is used to prove the equivalence between optima of multiobjective programming problems and the -saddle points of the associated -approximated vector optimisation problems. We introduce an -Lagrange function for a constructed -approximated vector optimisation problem and present some modified -saddle point results. Furthermore, we construct an -ap...