Variants Of Miyachi’S Theorem For Nilpotent Lie Groups

We formulate and prove two versions of Miyachi’s theorem for connected, simply connected nilpotent Lie groups. This allows us to prove the sharpness of the constant 1/4 in the theorems of Hardy and of Cowling and Price for any nilpotent Lie group. These theorems are proved using a variant of Miyachi’s theorem for the group Fourier transform.

Hardness results for computing optimal locally Gabriel graphs

Delaunay and Gabriel graphs are widely studied geo-metric proximity structures. Motivated by applications in wireless routing, relaxed versions of these graphs known as Locally Delaunay Graphs (LDGs) and Lo-cally Gabriel Graphs (LGGs) have been proposed. We propose another generalization of LGGs called Gener-alized Locally Gabriel Graphs (GLGGs) in the context when certain edges are forbidden in the graph. Unlike a Gabriel Graph, there is no unique LGG or GLGG for a given point set because no edge is necessarily in-cluded or excluded. This property allows us to choose an LGG/GLGG that optimizes a parameter of interest in the graph. We show that computing an edge max-imum GLGG for a given problem instance is NP-hard and also APX-hard. We also show that computing an LGG on a given point set with dilation ≤k is NP-hard. Finally, we give an algorithm to verify whether a given geometric graph G= (V, E) is a valid LGG.

On t-designs and bounds relating query complexity to error resilience in locally correctable codes

An n-length block code C is said to be r-query locally correctable, if for any codeword x ∈ C, one can probabilistically recover any one of the n coordinates of the codeword x by querying at most r coordinates of a possibly corrupted version of x. It is known that linear codes whose duals contain 2-designs are locally correctable. In this article, we consider linear codes whose duals contain t-designs for larger t. It is shown here that for such codes, for a given number of queries r, under linear decoding, one can, in general, handle a larger number of corrupted bits. We exhibit to our knowledge, for the first time, a finite length code, whose dual contains 4-designs, which can tolerate a fraction of up to 0.567/r corrupted symbols as against a maximum of 0.5/r in prior constructions. We also present an upper bound that shows that 0.567 is the best possible for this code length and query complexity over this symbol alphabet thereby establishing optimality of this code in this respect. A second result in the article is a finite-length bound which relates the number of queries r and the fraction of errors that can be tolerated, for a locally correctable code that employs a randomized algorithm in which each instance of the algorithm involves t-error correction.

On Locally Gabriel Geometric Graphs

Let be a set of points in the plane. A geometric graph on is said to be locally Gabriel if for every edge in , the Euclidean disk with the segment joining and as diameter does not contain any points of that are neighbors of or in . A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any , there exists LGG with edges. This improves upon the previous best bound of . (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any point set, there exists an independent set of size .

Preliminary investigation on growth responses of Cyprinus carpio L. fed on locally formulated artificial diets

The growth rate and feed conversion ratios of the common carp, Cyprinus carpio were measured for five test diets in 14-day replicate laboratory studies. The young carp were fed with artificial test diets with crude protein contents ranging from 14.50 to 21.42 per cent. Within this range of feed characteristic optimum growth rates were obtained with diets containing 20.25 and 21.42 per cent crude protein. The study of the effect of varying ration levels showed that growth rates increased with increases of ration size, but the food conversion efficiency and protein efficiency ratios decreased markedly as ration size was increased

The use of locally available materials in fish feed production

In Nigeria, the culture of fish is gaining importance, but local fish farmers face a set back because of the stoppage on importation of fish feed. Locally available raw materials such as yam, plantain, banana, cowpeas, macuna, maize, cassava, millet, sorghum, groundnut, sunnhemp seed and brewery wastes are considered as potential materials for fish feed. These have been examined on their minimum protein contributions since this is the most expensive part of the fish feed. Alternative sources to animal proteins are also examined. Plant protein from groundnut, melon, mucuna and others compare favourably with bloodmeal mixture and thus can be used to replace the more expensive animal proteins. Pellet feed can be produced on a small scale or commercial basis from the locally available raw materials and the fish farmer is advised to seek assistance from qualified fisheries personnel

A Wide Band Strong Acoustic Absorption in a Locally Network Anechoic Coating

Composite materials with interpenetrating network structures usually exhibit unexpected merit due to the cooperative interaction. Locally resonant phononic crystals (LRPC) exhibit excellent sound attenuation performance based on a periodical arrangement of sound wave scatters. Inspired by the interpenetrating network structure and the LRPC concept, we develop a locally network anechoic coating (LNAC) that can achieve a wide band of underwater strong acoustic absorption. The experimental results show that the LNAC possesses an excellent underwater acoustic absorbing capacity in a wide frequency range. Moreover, in order to investigate the impact of the interpenetrating network structure, we fabricate a faultage structure sample and the network is disconnected by hard polyurethane (PU). The experimental comparison between the LNAC and the faultage structure sample shows that the interpenetrating network structure of the LNAC plays an important role in achieving a wide band strong acoustic absorption.

Locally resonant phononic woodpile: A wide band anomalous underwater acoustic absorbing material

To meet the demand of modern acoustic absorbing material for which acoustic absorbing frequency region can be readily tailored, we introduced woodpile structure into locally resonant phononic crystal (LRPC) and fabricated an underwater acoustic absorbing material, which is called locally resonant phononic woodpile (LRPW). Experimental results show that LRPW has a strong capability of absorbing sound in a wide frequency range. Further theoretical research revealed that LRPC units and woodpile structure in LRPW play an important role in realization of wide band underwater strong acoustic absorption.

Effect of locally available spices on the organoleptic and storage periods of Heterotis niloticus

Investigation were carried out on the effect of some locally available species in the enhancement of the organoleptic quality and the storage periods of smoked Heterotis niloticus using Pprosopis africana as common smoke sources. Samples of fresh H. niloticus were bought, cut into chunks while extract juice from pepper, ginger rhizomes, garlic, onion bulb were used as sources of spices. Samples of fish were divided randomly into five (5) batches dipped into spice extract juices for 10 minutes drained and smoked with common firewood. Treatment without spice extract juice served as control. Each batch of fish was smoked for 7 hours on a drum-made smoking kiln products were individually packaged in polythene bag stored at room temperature and used for sensory evaluation and microbial analysis. Results of the sensory evaluation indicated that there was significant difference (P<0.005) for taste, appearance, colour and overall acceptance for the treatments. Ginger juice extract had the best overall acceptance. Similarly there was significant difference (P>0.05) in the microbial analysis. The garlic juice extract had the longest storage period with minimum total plate and mould count after 8 weeks

Locally convex Riesz spaces and Archimedean quotient spaces

A Riesz space with a Hausdorff, locally convex topology determined by Riesz seminorms is called a locally convex Riesz space. A sequence {x_n} in a locally convex Riesz space L is said to converge locally to x ϵ L if for some topologically bounded set B and every real r ˃ 0 there exists N (r) and n ≥ N (r) implies x – x_n ϵ r^b. Local Cauchy sequences are defined analogously, and L is said to be locally complete if every local Cauchy sequence converges locally. Then L is locally complete if and only if every monotone local Cauchy sequence has a least upper bound. This is a somewhat more general form of the completeness criterion for Riesz – normed Riesz spaces given by Luxemburg and Zaanen. Locally complete, bound, locally convex Riesz spaces are barrelled. If the space is metrizable, local completeness and topological completeness are equivalent.

Two measures of the non-archimedean character of a non-archimedean Riesz space L are the smallest ideal A_o (L) such that quotient space is Archimedean and the ideal I (L) = { x ϵ L: for some 0 ≤ v ϵ L, n |x| ≤ v for n = 1, 2, …}. In general A_o (L) ᴝ I (L). If L is itself a quotient space, a necessary and sufficient condition that A_o (L) = I (L) is given. There is an example where A_o (L) ≠ I (L).

A necessary and sufficient condition that a Riesz space L have every quotient space Archimedean is that for every 0 ≤ u, v ϵ L there exist u₁ = sup (inf (n v, u): n = 1, 2, …), and real numbers m₁ and m₂ such that m₁ u₁ ≥ v₁ and m₂ v₁ ≥ u₁. If, in addition, L is Dedekind σ – complete, then L may be represented as the space of all functions which vanish off finite subsets of some non-empty set.

Increase of storage shelf life of locally produced salted/dried fish by redrying and/or packeting

Experiments were undertaken to prolong the storage life of salted/dried fish by re-drying and/or packing. The storage life under normal conditions is 51 days; re-drying the fish at 50°C for 12 hours extends the storage life only by 7 days. However, re-drying and packing gizzard shad (Gonialosa manminna ) in polyethylene maintains the fish in excellent conditions for well over 87 days. The use of air tight bags for storing good quality salted dried fish is recommended.