Annual fecundity, batch fecundity, and oocyte atresia of Atka mackerel (Pleurogrammus monopterygius) in Alaskan waters

Annual potential fecundity, batch fecundity, and oocyte atresia were estimated for Atka mackerel (Pleurogrammus monopterygius) collected in Alaskan waters during 1993−94. Atka mackerel were assumed to be determinate spawners on the basis of decreasing fecundity after batch spawning events. Histological examination of the ovaries indicated that oocytes in the vitellogenic stage and higher had been spawned in the current spawning season. For an average female of 40 cm, potential annual fecundity was estimated to be 41,994 eggs, average batch size (i.e., batch fecundity) was estimated to be 6689 eggs, and there were 6.13 batches per spawning season. Atresia was estimated by examining postspawning specimens and was found to be substantial. The average amount of atresia for a 40-cm fish was estimated to be 11,329 eggs, resulting in an estimated realized fecundity of only 30,664 eggs and 4.64 batches of eggs per spawning season.

Review of size- and age-dependence in batch spawning: implications for stock assessment of fish species exhibiting indeterminate fecundity

Most assessments of fish stocks use some measure of the reproductive potential of a population, such as spawning biomass. However, the correlation between spawning biomass and reproductive potential is not always strong, and it likely is weakest in the tropics and subtropics, where species tend to exhibit indeterminate fecundity and release eggs in batches over a protracted spawning season. In such cases, computing annual reproductive output requires estimates of batch fecundity and the annual number of batches—the latter subject to spawning frequency and duration of spawning season. Batch fecundity is commonly measured by age (or size), but these other variables are not. Without the relevant data, the annual number of batches is assumed to be invariant across age. We reviewed the literature and found that this default assumption lacks empirical support because both spawning duration and spawning frequency generally increase with age or size. We demonstrate effects of this assumption on measures of reproductive value and spawning potential ratio, a metric commonly used to gauge stock status. Model applications showed substantial sensitivity to age dependence in the annual number of batches. If the annual number of batches increases with age but is incorrectly assumed to be constant, stock assessment models would tend to overestimate the biological reference points used for setting harvest rates. This study underscores the need to better understand the age- or size-dependent contrast in the annual number of batches, and we conclude that, for species without evidence to support invariance, the default assumption should be replaced with one that accounts for age- or size-dependence.

On a rational criterion for assigning batch number to processed products of shrimps

Investigations were conducted to find the variability of processed shrimps with respect to two quality characteristics, namely, the numbers of deteriorated and discoloured pieces. Samples were collected for three days from two arbitrarily selected processing factories from Cochin at the pre-freezing stages. Results show that both the quality characteristics vary significantly between different size-grades, but while the variation in the number of deteriorated pieces between days is not significant, the variation in the number of discoloured pieces between days is significant.

Enhanced anthocyanin production by repeated-batch culture of strawberry cells with medium shift

Repeated-batch cultures of strawberry cells (Fragaria ananassa cv. Shikinari) subjected to four medium-shift procedures (constant LS medium, constant B5 medium, alternation between LS and B5 starting from LS and alternation between LS and B5 starting from B5) were investigated for the enhanced anthocyanin productivity. To determine the optimum period for repeated batch cultures, two medium-shift periods of 9 and 14 days were studied, which represent the end of the exponential growth phase and the stationary phase. By comparison with the corresponding batch cultures, higher anthocyanin productivity was achieved for all the repeated-batch cultures at a 9-day medium-shift period. The average anthocyanin productivity was enhanced 1.7-and 1.76-fold by repeated-batch cultures in constant LS and constant B5 medium at a 9-day shift period for 45 days, respectively. No further improvement was observed when the medium was alternated between LS (the growth medium) and B5 (the production medium). Anthocyanin production was unstable at a 14-day shift period regardless of the medium-shift procedures. The results show that it is feasible to improve anthocyanin production by a repeated-batch culture of strawberry cells.

A decentralized batch-based group key management potocol for mobile Internet of Thngs (DBGK).

It is anticipated that constrained devices in the Internet of Things (IoT) will often operate in groups to achieve collective monitoring or management tasks. For sensitive and mission-critical sensing tasks, securing multicast applications is therefore highly desirable. To secure group communications, several group key management protocols have been introduced. However, the majority of the proposed solutions are not adapted to the IoT and its strong processing, storage, and energy constraints. In this context, we introduce a novel decentralized and batch-based group key management protocol to secure multicast communications. Our protocol is simple and it reduces the rekeying overhead triggered by membership changes in dynamic and mobile groups and guarantees both backward and forward secrecy. To assess our protocol, we conduct a detailed analysis with respect to its communcation and storage costs. This analysis is validated through simulation to highlight energy gains. The obtained results show that our protocol outperforms its peers with respect to keying overhead and the mobility of members.

Secure architectures for pairing based public key cryptography

Along with the growing demand for cryptosystems in systems ranging from large servers to mobile devices, suitable cryptogrophic protocols for use under certain constraints are becoming more and more important. Constraints such as calculation time, area, efficiency and security, must be considered by the designer. Elliptic curves, since their introduction to public key cryptography in 1985 have challenged established public key and signature generation schemes such as RSA, offering more security per bit. Amongst Elliptic curve based systems, pairing based cryptographies are thoroughly researched and can be used in many public key protocols such as identity based schemes. For hardware implementions of pairing based protocols, all components which calculate operations over Elliptic curves can be considered. Designers of the pairing algorithms must choose calculation blocks and arrange the basic operations carefully so that the implementation can meet the constraints of time and hardware resource area. This thesis deals with different hardware architectures to accelerate the pairing based cryptosystems in the field of characteristic two. Using different top-level architectures the hardware efficiency of operations that run at different times is first considered in this thesis. Security is another important aspect of pairing based cryptography to be considered in practically Side Channel Analysis (SCA) attacks. The naively implemented hardware accelerators for pairing based cryptographies can be vulnerable when taking the physical analysis attacks into consideration. This thesis considered the weaknesses in pairing based public key cryptography and addresses the particular calculations in the systems that are insecure. In this case, countermeasures should be applied to protect the weak link of the implementation to improve and perfect the pairing based algorithms. Some important rules that the designers must obey to improve the security of the cryptosystems are proposed. According to these rules, three countermeasures that protect the pairing based cryptosystems against SCA attacks are applied. The implementations of the countermeasures are presented and their performances are investigated.

Approximation algorithms for two-machine flow shop scheduling with batch setup times

In many practical situations, batching of similar jobs to avoid setups is performed while constructing a schedule. This paper addresses the problem of non-preemptively scheduling independent jobs in a two-machine flow shop with the objective of minimizing the makespan. Jobs are grouped into batches. A sequence independent batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. Besides its practical interest, this problem is a direct generalization of the classical two-machine flow shop problem with no grouping of jobs, which can be solved optimally by Johnson's well-known algorithm. The problem under investigation is known to be NP-hard. We propose two O(n logn) time heuristic algorithms. The first heuristic, which creates a schedule with minimum total setup time by forcing all jobs in the same batch to be sequenced in adjacent positions, has a worst-case performance ratio of 3/2. By allowing each batch to be split into at most two sub-batches, a second heuristic is developed which has an improved worst-case performance ratio of 4/3. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

Group technology approach to the open shop scheduling problem with batch setup times

This paper studies the problem of scheduling jobs in a two-machine open shop to minimize the makespan. Jobs are grouped into batches and are processed without preemption. A batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. For this NP-hard problem, we propose a linear-time heuristic algorithm that creates a group technology schedule, in which no batch is split into sub-batches. We demonstrate that our heuristic is a -approximation algorithm. Moreover, we show that no group technology algorithm can guarantee a worst-case performance ratio less than 5/4.

Single-Element and Competitive Metal Mobility Measured with Column Infiltration and Batch Tests

The distribution coefficient, K-d, is often used to quantify heavy metal mobility in soils. Batch sorption or column infiltration tests may be used to measure K-d. The latter are closer to natural soil conditions, but are difficult to conduct in clays. This difficulty can be overcome by using a laboratory centrifuge. An acceleration of 2600 gravities was applied to columns of London Clay, an Eocene clay sub-stratum, and Cu, Ni, and Zn mobility was measured in centrifuge infiltration tests, both as single elements and in dual competition. Single-element K-d values were also obtained from batch sorption tests, and the results from the two techniques were compared. It was found that K-d values obtained by batch tests vary considerably depending on the metal concentration, while infiltration tests provided a single K-d value for each metal. This was typically in the lower end of the range of the batch test K-d values. For both tests, the order of mobility was Ni > Zn > Cu. Metals became more mobile in competition than when in single-element systems: Ni K-d decreased 3.3 times and Zn K-d 3.4 times when they competed with Cu, while Cu decreased only 1.2 times when in competition with either Ni or Zn. Our study showed that competitive sorption between metals increases the mobility of those metals less strongly bound more than it increases the mobility of more strongly bound metals.