Performance evaluation of an importance sampling technique in a Jackson network

Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even the simplest network settings. Estimating probabilities associated with rare events has been a topic of great importance in queueing theory, and in applied probability at large. In this article, we analyse the performance of an importance sampling estimator for a rare event probability in a Jackson network. This article carries out strict deadlines to a two-node Jackson network with feedback whose arrival and service rates are modulated by an exogenous finite state Markov process. We have estimated the probability of network blocking for various sets of parameters, and also the probability of missing the deadline of customers for different loads and deadlines. We have finally shown that the probability of total population overflow may be affected by various deadline values, service rates and arrival rates.     

CAR T Cell Therapy in Hematological Malignancies: Implications of the Tumor Microenvironment and Biomarkers on Efficacy and Toxicity

Chimeric antigen receptor (CAR) T cell therapy has ushered in a new era in cancer treatment. Remarkable outcomes have been demonstrated in patients with previously untreatable relapsed/refractory hematological malignancies. However, optimizing efficacy and reducing the risk of toxicities have posed major challenges, limiting the success of this therapy. The tumor microenvironment (TME) plays an important role in CAR T cell therapy’s effectiveness and the risk of toxicities. Increasing research studies have also identified various biomarkers that can predict its effectiveness and risk of toxicities. In this review, we discuss the various aspects of the TME and biomarkers that have been implicated thus far and discuss the role of creating scoring systems that can aid in further refining clinical applications of CAR T cell therapy and establishing a safe and efficacious personalised medicine for individuals.     

Blocking the PCNA/NKp44 Checkpoint to Stimulate NK Cell Responses to Multiple Myeloma

Simple SummaryMembrane-associated PCNA is expressed on the surface of human MM cell lines and primary MM cells. Mab 14-25-9 interacts with membrane-associated PCNA and blocks its binding to NK-expressed NKp44, thus activating NK function. We showed that mAb 14-25-9 can serve as an immune checkpoint blocker, enhancing the function of NK cells on target human MM cell lines and primary cells.AbstractMultiple Myeloma (MM) is a devastating malignancy that evades immune destruction using multiple mechanisms. The NKp44 receptor interacts with PCNA (Proliferating Cell Nuclear Antigen) and may inhibit NK cells’ functions. Here we studied in vitro the expression and function of PCNA on MM cells. First, we show that PCNA is present on the cell membrane of five out of six MM cell lines, using novel anti-PCNA mAb developed to recognize membrane-associated PCNA. Next, we stained primary bone marrow (BM) mononuclear cells from MM patients and showed significant staining of membrane-associated PCNA in the fraction of CD38⁺CD138⁺ BM cells that contain the MM cells. Importantly, blocking of the membrane PCNA on MM cells enhanced the activity of NK cells, including IFN-γ-secretion and degranulation. Our results highlight the possible blocking of the NKp44-PCNA immune checkpoint by the mAb 14-25-9 antibody to enhance NK cell responses against MM, providing a novel treatment option.     

Performance Analysis of Space-Time Block Codes with Transmit Antenna Selection in Nakagami-m Fading Channels

In this paper, multiple-input multiple-output systems employing space-time block codes (STBCs) with transmit antenna selection (TAS) are examined for flat Nakagami-m fading channels. Exact symbol error rate (SER) expressions for M-ary modulation techniques are derived by using the moment generating function based analysis method. In the SER analysis, the receiver is assumed to use maximal ratio combining whereas a subset of transmit antennas that maximizes the instantaneous received signal-to-noise ratio (SNR) is selected for STBC transmission. The analytical SER results are validated by Monte Carlo simulations. By deriving upper and lower bounds for SER expressions, it is shown that TAS/STBC schemes achieve full diversity orders at high SNRs.     

An efficient weighted trust‐based malicious node detection scheme for wireless sensor networks

The aim of wireless sensor networks (WSNs) is to gather sensor data from a monitored environment. However, the collected or reported information might be falsified by faults or malicious nodes. Hence, identifying malicious nodes in an effective and timely manner is essential for the network to function properly and reliably. Maliciously behaving nodes are usually detected and isolated by reputation and trust‐based schemes before they can damage the network. In this paper, we propose an efficient weighted trust‐based malicious node detection (WT‐MND) scheme that can detect malicious nodes in a clustered WSN. The node behaviors are realistically treated by accounting for false‐positive and false‐negative instances. The simulation results confirm the timely identification and isolation of maliciously behaving nodes by the WT‐MND scheme. The effectiveness of the proposed scheme is afforded by the adaptive trust‐update process, which implicitly performs trust recovery of temporarily malfunctioning nodes and computes a different trust‐update factor for each node depending on its behavior. The proposed scheme is more effective and scalable than the related schemes in the literature, as evidenced by its higher detection ratio (DR) and lower misdetection ratio (MDR), which only slightly vary with the network's size. Moreover, the scheme sustains its efficient characteristics without significant power consumption overheads.     

Performance Analysis of a New MAC Protocol for Wireless Cognitive Radio Networks

Wireless Personal Communications - In this study, network performance analysis of a newly proposed cognitive radio wireless network (CRWN) medium access control (MAC) protocol is investigated in...     

Electronically tunable floating inductance simulator

In this letter, a new floating inductance simulator circuit is presented. The proposed structure consists of only one grounded capacitor without any external resistors and two different active elements. The active elements are dual-output current-controlled current conveyor (DO-CCCII) and operational transconductance amplifier (OTA). The proposed inductance simulator can be tuned electronically by changing the biasing current of the DO-CCCIIs or by changing the current of the OTA. Moreover, the circuit does not require any conditions of component matching. It has a good sensitivity performance with respect to tracking errors. As an application, the proposed inductance simulator is used to construct a fourth-order resistively terminated LC band-pass filter. The theoretical analysis is verified by the SPICE simulation results.     

Electromagnetic Scattering by an Inhomogeneous Impedance Cylinder

In this paper, the electromagnetic scattering problem related to a circular cylinder with inhomogeneous impedance boundary is solved. This kind of problem may have practical applications such as antenna design since one can obtain a certain radiation pattern by choosing thesurface impedance in an appropriate way. The approach presented in this paper is based on the series representations of the scattering and incident fields. The impedance function is also expanded into a Fourier series. By using orthogonality properties of some special functions the problem is reduced to the solution of a system of linear equations. The problem isalso solved through the extended boundary condition method (T-matrix method). Since an extensive treatment of the T-matrix method is available in the open literature the paper is weighted towards the Fourier series method. The results of both methods are compared. Some illustrative examples showing the effects of different parameters on the scattered field are given.     

Time-averaged behaviour of single and dual flying capacitor converters

The Single Flying Capacitor Converter (SFCC) and Dual Flying Capacitor Converter (DFCC) are two-quadrant power supplies for energy storage and transfer systems. They have applications in nuclear research and pulsed power systems in which superconductive coils are used. In this paper analytical expressions for the time-averaged behaviours of SFCC and DFCC are derived by using averaging technique. Because large superconductive magnet coils are used, time constants of the switched circuits are large enough compared to the switching period. Therefore, an averaged PWM switch equivalent circuit is substituted into the original converter circuits to find the averaged system equations. With this new insight in the averaged dynamics, their design and control can be optimized. Although DFCC has less coil current ripple compared to SFCC, the analysis will show that the averaged behaviours of both converters are the same.     

k‐strong privacy for radio frequency identification authentication protocols based on physically unclonable functions

This paper examines Vaudenay's privacy model, which is one of the first and most complete privacy models that featured the notion of different privacy classes. We enhance this model by introducing two new generic adversary classes, k‐strong and k‐forward adversaries where the adversary is allowed to corrupt a tag at most k times. Moreover, we introduce an extended privacy definition that also covers all privacy classes of Vaudenay's model. In order to achieve highest privacy level, we study low cost primitives such as physically unclonable functions (PUFs). The common assumption of PUFs is that their physical structure is destroyed once tampered. This is an ideal assumption because the tamper resistance depends on the ability of the attacker and the quality of the PUF circuits. In this paper, we have weakened this assumption by introducing a new definition k‐resistant PUFs. k‐PUFs are tamper resistant against at most k attacks; that is, their physical structure remains still functional and correct until at most k^th physical attack. Furthermore, we prove that strong privacy can be achieved without public‐key cryptography using k PUF‐based authentication. We finally prove that our extended proposal achieves both reader authentication and k‐strong privacy. Copyright © 2014 John Wiley & Sons, Ltd.