An optimal sorting algorithm on the reconfigurable mesh is proposed. The sorts n numbers in constant time using n*n processors. best known previous result uses O(n*nlog/sup 2/n) presented satisfies AT/sup 2/ lower bound of Omega (n/sup 2/) for word model VLSI. Modification to area-time trade-off shown, achieve optimality over 1<or=T<or= square root n. Previously, was achieved log n<or=T<or= n.<<ETX>>

In this study, dietary supplementations of Korean Meju, fermented soybean meal (F-SBM) by Aspergillus oryzae, and A. oryzae itself were evaluated on growth performance, feed utilization, immune responses phosphorus availability in juvenile parrot fish, a marine aquaculture fish species.Four isonitrogenous isocaloric diets formulated to contain 8% (control diet), 4% Meju (50% was replaced Meju), F-SBM F-SBM), or 0.08% itself.One the four experimental fed triplicate groups for 8 weeks.At end...

In this paper, given a composite integer n, we propose method of constructing quaternary low correlation zone (LCZ) sequences period 2/sup n/-1 from binary the same length with ideal autocorrelation. These new are optimal respect to bound by Tang, Fan, and Matsufuji. The distributions these LCZ constructed m-sequences Gordon-Mills-Welch (GMW) derived.

In this correspondence, three methods of constructing low-correlation zone (LCZ) sequences are proposed. the first method, we constructed binary LCZ sequence sets period 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> -1 using Legendre xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> as a column when m|n. second devise set length xmlns:xlink="http://www.w3.org/1999/xlink">m+1</sup> from having ideal autocorrelation property and is...

We prove the existence of global-in-time weak solutions to volume-preserving mean curvature flow with in presence obstacles by phase field method spatial dimensions two and three. Namely, we convergence Allen-Cahn equation a multiplier family integral varifolds, which is solution flow. The choice motivated from \cite{MSS16,KK20,T23}, enables us complete comparison between forcing that stops intrusion into obstacle.

The Patlak-Keller-Segel system of equations (PKS) is a classical example aggregation-diffusion equation. It describes the aggregation some organisms via chemotaxis, limited by nonlinear diffusion. known that for choice this diffusion, PKS model asymptotically leads to phase separation and mean-curvature driven free boundary problems. In paper, we focus on Elliptic-Parabolic obtain first unconditional convergence result in dimension $2$ $3$ towards volume preserving flow. This work builds up...

Silicon-doped tetrahedral amorphous carbon (ta-C:Si) coatings are promising materials for achieving ultralow friction in water-lubricated environments, attributed to the formation of Si(OH)x-based tribofilms. However, deposition process via filtered cathodic vacuum arc (FCVA) often introduces large particles into film, increasing surface roughness and causing accelerated wear during initial sliding phase, despite high hardness coating. In this study, ball-on-disk tribological tests were...

In this paper, for an odd prime p, new quaternary sequences of even period 2p with ideal autocorrelation property are constructed using the Legendre p. The distribution function proposed is also derived.

In this paper, a new generation method of quaternary sequences period 2(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> -1) with ideal autocorrelation and balance property is proposed using the binary 2 - 1 reverse Gray mapping. The distribution also derived.

We propose a new construction of quaternary sequences using the reverse Gray mapping pair binary Sidel'nikov sequences. The proposed provides even period N with maximum nontrivial auto-correlation magnitude, R <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">max</inf> = 2. For ≡ 0 mod 4, have optimal 2 and are almost-balanced in contrast to only earlier S xmlns:xlink="http://www.w3.org/1999/xlink">j</inf> [1].

The authors present fast parallel algorithms for computing the histogram on PARBUS and RMESH models. Compared with approach of J. Jeng S. Sahni (1992), proposed algorithm improves time complexity by using a constant amount memory in each processing element. In modification algorithm, entire range h is considered. connections used model are same as those allowed MRN model. Thus, this runs well. results obtained imply that number 1's N*N 0/1 table can be counted O(log* N) an reconfigurable...

It is shown that multiplication of two N-bit integers can be performed in O(1) time on N*N reconfigurable mesh. This result obtained by combining the algorithm N*N/sup 2/ mesh, Rader transform, and decomposition one-dimensional convolution into multidimensional convolution. Choosing Radar transform at expense long word length frees one from storing twiddle factors advance, which needed other designs. also present simulated restricted mesh models without asymptotic increase or number...

For an odd prime p and integers n, m, k such that n=(2m+1)k, a new family of p-ary sequences period p/sup n/-1 with optimal correlation property is constructed using the Helleseth-Gong ideal autocorrelation, where size sequence n/. That is, maximum nontrivial value R/sub max/ all pairs distinct in does not exceed n/2/+1, which means has terms Welch's lower bound. The symbol distribution enumerated. It also shown linear span (m+2)n except for m-sequence family.

In this paper, we present several construction methods for low-correlation zone (LCZ) sequence sets. First, propose a design scheme binary LCZ sets with parameters (2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n+1</sup> -2,M,L,2). scheme, can freely set the length L and resulting have size M, which is almost optimal respect to Tang, Fan, Matsufuji bound. Second, given q-ary (N,M,L,epsi) even q, construct another (2N,2M,L,2epsi) or...

Abstract We study the rate of convergence in periodic homogenization for convex Hamilton–Jacobi equations with multiscales, where Hamiltonian <?CDATA $H = H(x, y, p): \mathbb{R}^n \times \mathbb{T}^n \to \mathbb{R}$?> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" overflow="scroll"> <mml:mi>H</mml:mi> <mml:mo>=</mml:mo> <mml:mo stretchy="false">(</mml:mo> <mml:mi>x</mml:mi> <mml:mo>,</mml:mo> <mml:mi>y</mml:mi> <mml:mi>p</mml:mi> stretchy="false">)</mml:mo> <mml:mo>:</mml:mo>...

The authors propose a robust end-to-end loss differentiation scheme to identify the packet losses because of congestion for transport control protocol (TCP) connections over wired/wireless networks. use measured round trip time (RTT) values determine whether cause is wired path or regular bit errors wireless paths. classification should be as accurate possible achieve high throughput and maximum fairness TCP sharing accuracies previous schemes in literature depends on varying network...

In this paper, given an integer e and n such that e|n, a prime p, we propose method of constructing optimal p2-ary low correlation zone (LCZ) sequence set with parameters (pn-1, pe-1, (pn-1)/(pe-1), 1) from p-ary the same length ideal autocorrelation. The resulting LCZ can be viewed as generalization quaternary by Kim, Jang, No, Chung in respect alphabet size. This becomes possible due to completely new proof comprising any p. Under proof, case considered specific example for p = 2.

In this paper, two new construction methods of quaternary periodic complementary sequence (PCS) sets are proposed using a binary PCS set with even period. The apply the Gray mapping to set. only necessary condition is that employed should have an

Polar codes are the first family of error correcting that provably achieve capacity symmetric binary-input discrete memoryless channels with low complexity. Since development polar codes, there have been many studies to improve their finite-length performance. As a result, now adopted as channel code for control 5G new radio 3rd generation partnership project. However, decoder implementation is one big practical problems and complexity decoding has studied. This paper addresses successive...

Rendezvous is a process that assists nodes in cognitive radio networks (CRNs) to discover each other. In CRNs where common control channel unknown and number of channels are given, it important how two find other known search region. this letter, we have analyzed hopping sequence considering p-ray m-sequence by which node visits an available channels. We analyze the maximum expected time-to-rendezvous (TTR) mathematically. The proposed performs significantly better compared existing ones term TTR.