Economics of food irradiation

The number of products being radiation processed worldwide is constantly increasing and today includes such diverse items as medical disposables, fruits and vegetables, spices, meats, seafoods and waste products. This range of products to be processed has resulted in a wide range of irradiator designs and capital and operating cost requirements.This paper discusses the economics of low dose food irradiation applications and the effects of various parameters on unit processing costs. It provides a model for calculating specific unit processing costs by correlating known capital costs with annual operating costs and annual throughputs. It is intended to provide the reader with a general knowledge of how unit processing costs are derived.     

Unraveling the mystery of efficacy in Chinese medicine formula: New approaches and technologies for research on pharmacodynamic substances

Traditional Chinese medicine (TCM) is the key to unlock treasures of Chinese civilization. TCM and its compound play a beneficial role in medical activities to cure diseases, especially in major public health events such as novel coronavirus epidemics across the globe. The chemical composition in Chinese medicine formula is complex and diverse, but their effective substances resemble “mystery boxes”. Revealing their active ingredients and their mechanisms of action has become focal point and difficulty of research for herbalists. Although the existing research methods are numerous and constantly updated iteratively, there is remain a lack of prospective reviews. Hence, this paper provides a comprehensive account of existing new approaches and technologies based on previous studies with an in vitro to in vivo perspective. In addition, the bottlenecks of studies on Chinese medicine formula effective substances are also revealed. Especially, we look ahead to new perspectives, technologies and applications for its future development. This work reviews based on new perspectives to open horizons for the future research. Consequently, herbal compounding pharmaceutical substances study should carry on the essence of TCM while pursuing innovations in the field.     

Joint optimal fair cooperative spectrum sensing and transmission in cognitive radio

Since the sensing power consumption of cooperative spectrum sensing (CSS) will decrease the throughput of secondary users (SU) in cognitive radio (CR), a joint optimal model of fair CSS and transmission is proposed in this paper, which can compensate the sensing overhead of cooperative SUs. The model uses the periodic listen-before-transmission method, where each SU is assigned a portion of channel bandwidth, when the primary user (PU) is estimated to be free by the coordinator. Then, a joint optimization problem of local sensing time, number of cooperative SUs, transmission bandwidth and power is formulated, which can compensate the sensing overhead of cooperative SUs appropriately through choosing suitable compensating parameter. The proposed optimization problem can be solved by the Polyblock algorithm. Simulation results show that compared with the traditional model, the total system throughput of the fairness cooperation model decreases slightly, but the total throughput of the cooperative SUs improves obviously.     

Periodic schedules for linear precedence constraints

We consider the computation of periodic cyclic schedules for linear precedence constraints graphs: a linear precedence constraint is defined between two tasks and induces an infinite set of usual precedence constraints between their executions such that the difference of iterations is a linear function. The objective function is the minimization of the maximal period of a task.We recall first that this problem may be modelled using linear programming. A polynomial algorithm is then developed to solve it for a particular class of linear precedence graphs called unitary graphs. We also show that a periodic schedule may not exist for unitary graphs. In the general case, a decomposition of the linear precedence graph into unitary components is computed and we assume that a periodic schedule exists for each of these components. Lower bounds on the periods are exhibited and we show that an optimal periodic schedule may not achieve them. The notion of quasi-periodic schedule is then introduced and we prove that this new class of schedules always reaches these bounds.     

On the impact of IQI on cooperative NOMA with direct links in the presence of imperfect CSI

Cooperative non-orthogonal multiple access (CNOMA) is considered as a promising technique to improve network coverage, reliability and transmission for future wireless communication networks. Meanwhile, transceivers can suffer from a number of hardware imperfections that will significantly reduce their performance, such as phase noise and in-phase/quadrature-phase imbalance (IQI). In this paper, we investigate the effect of in-phase and quadrature-phase imbalance (IQI) on CNOMA with direct links in the presence of imperfect channel state information (ICSI). The outage probability (OP) and throughput expressions are derived to evaluate the performance behaviors of the CNOMA with direct links under the IQI and ICSI imperfections. Theoretical analyzes are verified by Monte Carlo simulation. The effect of the IQI on the CNOMA with the direct links has been studied with different parameters (image rejection ratio (IRR), power allocation) and compared with conventional NOMA to clearly observe the degrading effects of imperfections on the systems. The simulation results demonstrate that the IQI and ICSI have a negative impact on the outage and throughput performance.     

Delay optimization and energy balancing algorithm for improving network lifetime in fixed wireless sensor networks

Since wireless in terms of energy-restricted processes, dispersion radii, processing power limitations, buffers, bandwidth-limited connections, active network topologies, and network stream of traffic outlines, sensor networks provide difficult design issues. The number of hops and latency are decreased if there is a relay mote because it interacts directly with relay motes that are closer to the destination mote. The tremendous intensive research in the area of Wireless Sensor Networks (WSN) has gained a lot of significance among the technical community and research. The job of WSN is to sense the data using sensor motes, pass on the data to the destination detection mote which is associated with a processing center and can be used in multiple spans of Internet of Things (IoT) applications. Wireless sensor network has a set of sensor motes. By making use of sensor mote placement strategy all the sensor motes are spread in an area with each mote having its own exceptional location. Internet of things applications are delay sensitive those applications have a challenge of forming the complete path at a lower delay constraint. The proposal is to modify the game theory energy balancing algorithm by making use of relay motes so that overall network lifetime is increased. It has been proved that modified GTEB is better with respect to existing algorithms in terms of delay, figure of hops, energy depletion, figure of alive motes, figure of dead motes, lifespan ratio, routing overhead and throughput.     

Partial Pooling in Tandem Lines with Cooperation and Blocking

For a tandem line of finite, single-server queues operating under the production blocking mechanism, we study the effects of pooling several adjacent stations and the associated servers into a single station with a single team of servers. We assume that the servers are cross-trained (so that they can work at several different stations) and that two or more servers can cooperate on the same job. For such a system, we provide sufficient conditions on the service times and sizes of the input and output buffers at the pooled station under which pooling will decrease the departure time of each job from the system (and hence increase the system throughput). We also show that pooling decreases the total number of jobs in the system at any given time and the sojourn time of each job in the system if the departure time of each job from the system is decreased by pooling and there is an arrival stream at the first station. Moreover, we provide sufficient conditions under which pooling will improve the holding cost of each job in the system incurred before any given time, and extend our results to closed tandem lines and to queueing networks with either a more general blocking mechanism or probabilistic routing. Finally, we present a numerical study aimed at quantifying the improvements in system performance obtained through pooling and at understanding which stations should be pooled to achieve the maximum benefit. Our results suggest that the improvements gained by pooling may be substantial and that the bottleneck station should be among the pooled stations in order to obtain the greatest benefit. AMS subject classification: 90B22     

大孔径静态干涉成象光谱仪中的横向剪切干涉仪

介绍大孔径静态干涉成象光谱仪的光学原理,分析基于Sagnac型横向剪切分束器的干涉系统设计方案,推导了理论和实际的光程差公式,讨论了几种具体的结构形式,总结了各自的优缺点。     

Opportunistic spectrum access for TDMA-based cognitive radio networks

In this paper, opportunistic spectrum access is proposed for TDMA-based cognitive radio networks. In TDMA-based networks, the time is divided into slots with fixed length one by one. If a primary user (PU) needs to transmit data, one or several slots will be used. Otherwise, the slots are idle and can be utilized by secondary users (SUs). When SUs want to use the licensed channel, they should sense the channel at the beginning period of each slot. Then SUs exchange their sensing results and make the same decision about the channel state (idle or used by PUs), which could reduce the probability of false sensing. The aforementioned duration is called spectrum sensing phase. When SUs decide there is an idle channel, they contend to use the channel at the rest time of the slot. The duration is called access phase. In this period, SUs contend the channel with backoff counters. When the remaining time is less than one data transmission duration, SUs cannot transmit data packets. Therefore, the remaining time is wasted. To solve this problem, SUs transmit control packets with small length in the remaining time instead. The SU who exchange control packets successfully reserves the channel and sends a data packet prior to other SUs in access phase of the next idle slot. Obviously, this reserved transmission is without collision. The independent spectrum sensing, channel state decision and control packets reservation influence the performance of SUs. The proposed scheme is formulated with all above factors. Simulations which consist with the numerical results show the proposed access scheme achieve higher throughput than the existed scheme without channel reservation.     

Fairness-based user association and resource blocks allocation in satellite–terrestrial integrated networks

To meet the futuristic communications needs, a satellite–terrestrial integrated network (STIN) has been proposed and is a strong contender amongst emerging architectures. In our STIN model, we have considered a satellite-based base station (BS), dovetailed with a terrestrial N-tier heterogeneous network (HetNets). Our work considers jointly admission control of user equipment (UE), power allocation , fairness-based user association (UA), and fair spectrum resource allocation to UEs in STIN. With throughput maximization as an objective, considering such an environment, has not been investigated in the past. The formulated problem is a mixed integer non-linear programming (MINLP) problem that is Non-deterministic Polynomial-time Hard (NP-hard) and to achieve an optimal solution, it requires an exhaustive search. But, the computational load of exhaustive search increases exponentially as the number of UEs increases. Therefore, to obtain a near-optimal solution having low computational load an outer approximation algorithm (OAA) is proposed. To evaluate the proposed algorithm, extensive simulation work has been performed. The effectiveness of the proposed approach is verified by the results in terms of fairness in UA, fairness in resource block (RB) allocation, and throughput in the downlink (DL).