On the impact of physical layer awareness on scheduling and resource allocation in broadband multicellular IEEE 802.16 systems [Radio Resource Management and Protocol Engineering for IEEE 802.16]

Multicellular networks based on the IEEE 802.16 standard appear to be very promising candidates to provide end users with broadband wireless access. However, they also pose interesting challenges in terms of radio resource management, where several design choices are not specified in the standard, intentionally left open to implementors. For this reason, we focus in this article on scheduling and resource allocation, and investigate how they could operate in a cross-layer fashion. In particular, we describe the principles of joint scheduling and resource allocation for IEEE 802.16 operating in AMC mode, and discuss the critical role played by physical layer considerations, especially intercell interference estimation and channel state awareness, in the obtained performance. This leads to identifying key open issues and possible general solutions     

A Laguerre polynomial-based bound on the symbol error probability for adaptive antennas with optimum combining

We derive a simple closed-form upper bound on the symbol error probability for coherent detection of M-ary phase-shift keying using antenna arrays with optimum combining, in the presence of multiple uncorrelated equal-power cochannel interferers and thermal noise in a Rayleigh fading environment. The new bound, based on Laguerre polynomials, is valid for an arbitrary number of antenna elements as well as arbitrary number of interferers, and it is proven to be asymptotically tight. Comparisons with Monte Carlo simulation are also provided, showing that our bound is useful in many cases of interest.     

Target Score—A Proteomics Data Selection Tool Applied to Esophageal Cancer Identifies GLUT1-Sialyl Tn Glycoforms as Biomarkers of Cancer Aggressiveness

Esophageal cancer (EC) is a life-threatening disease, demanding the discovery of new biomarkers and molecular targets for precision oncology. Aberrantly glycosylated proteins hold tremendous potential towards this objective. In the current study, a series of esophageal squamous cell carcinomas (ESCC) and EC-derived circulating tumor cells (CTCs) were screened by immunoassays for the sialyl-Tn (STn) antigen, a glycan rarely expressed in healthy tissues and widely observed in aggressive gastrointestinal cancers. An ESCC cell model was glycoengineered to express STn and characterized in relation to cell proliferation and invasion in vitro. STn was found to be widely present in ESCC (70% of tumors) and in CTCs in 20% of patients, being associated with general recurrence and reduced survival. Furthermore, STn expression in ESCC cells increased invasion in vitro, while reducing cancer cells proliferation. In parallel, an ESCC mass spectrometry-based proteomics dataset, obtained from the PRIDE database, was comprehensively interrogated for abnormally glycosylated proteins. Data integration with the Target Score, an algorithm developed in-house, pinpointed the glucose transporter type 1 (GLUT1) as a biomarker of poor prognosis. GLUT1-STn glycoproteoforms were latter identified in tumor tissues in patients facing worst prognosis. Furthermore, healthy human tissues analysis suggested that STn glycosylation provided cancer specificity to GLUT1. In conclusion, STn is a biomarker of worst prognosis in EC and GLUT1-STn glycoforms may be used to increase its specificity on the stratification and targeting of aggressive ESCC forms.     

One-Way Functions Using Algorithmic and Classical Information Theories

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K ^t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K ^t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K ^t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K ^t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H ^unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao⁺ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.     

Determinization and minimization of finite acyclic automata by incremental techniques

The determinization of a nondeterministic finite automaton (FA) is the process of generating a deterministic FA (DFA) equivalent to (sharing the same regular language of) . The minimization of is the process of generating the minimal DFA equivalent to . Classical algorithms for determinization and minimization are available in the literature for several decades. However, they operate monolithically, assuming that the FA to be either determinized or minimized is given once and for all. By contrast, we consider determinization and minimization in a dynamic context, where augments over time: after each augmentation, determinization and minimization of into is required. Using classical monolithic algorithms to solve this problem is bound to poor performance. An algorithm for incremental determinization and minimization of acyclic finite automata, called IDMA, is proposed. Despite being conceived within the narrow domain of model‐based diagnosis and monitoring of active systems, the algorithm is general‐purpose in nature. Experimental evidence indicates that IDMA is far more efficient than classical algorithms in solving incremental determinization and minimization problems. Copyright © 2015 John Wiley & Sons, Ltd.     

EDEN: An Intelligent Software Environment for Diagnosis of Discrete-Event Systems

A software environment, called EDEN, that prototypes a recent approach to model-based diagnosis of discrete-event systems, is presented. The environment integrates a specification language, called SMILE, a model base, and a diagnostic engine. SMILE enables the user to create libraries of models and systems, which are permanently stored in the model base, wherein both final and intermediate results of the diagnostic sessions are hosted as well. Given the observation of a physical system gathered during its reaction to an external event, the diagnostic engine performs the a posteriori reconstruction of all the possible evolutions of the system over time and, then, draws candidate diagnoses out of them. The diagnostic method is described using a simplified example within the domain of power transmission networks. Strong points of the method include compositional modeling, support for model update, ability to focus on any sub-system, amenability to parallel execution, management of multiple faults, and broad notions of system and observation.     

Frequency domain analysis of acoustic wave propagation in heterogeneous media considering iterative coupling procedures between the method of fundamental solutions and Kansa's method

Acoustic wave propagation in heterogeneous media is a topic of significant interest in many areas of science and engineering, including aeroacoustics and sound propagation in oceans. In the present work, numerical frequency domain models based on the joint use of the method of fundamental solutions and of the radial basis function collocation method (also known as Kansa's method) are discussed. In this context, the method of fundamental solutions is used to model the homogeneous part of the propagation domain, while Kansa's method is employed to model the presence of heterogeneities. The coupling between the two parts of the propagation domain is performed iteratively, allowing independent spatial discretization between the different subdomains of the model (i.e. matching collocation points at common surfaces are not necessary). Additionally, an optimised algorithm, based on the use of a varying relaxation parameter, is employed to speed up and/or to ensure the convergence of the iterative coupling process. At the end of the paper, numerical results illustrate the applicability and potentialities of the proposed formulations. Copyright © 2011 John Wiley & Sons, Ltd.     

Comparison of arc stability and variability of geometry of welds obtained by MIG/MAG and FCAW processes

Despite their similarity, the MIG/MAG and Tubular Electrode processes display particular features with regard to arc stability and variability in the characteristics of the beads. Thus, selection of one of these processes for a specific application will have to consider how these particular features affect the quality of the welds. To support this choice, the present study aimed to investigate how changing the average current affects the stability and regularity of metal transfer in welds carried out with constant voltage and pulsed current and compare the variability in the geometry and dilution of these welds. To achieve these aims, automatic welding was carried out, with steel ABNT 1020 as base metal and wire AWS ER70S-6 and AWS E71T-1 as filler metals. Besides the welds with variation in the average current, the tests involved determination of the parameters for occurrence of stable short circuiting, drop and pulsed transfer. The results showed that the voltage that gives the highest stability in short circuiting transfer is independent of the welding speed and increases with the wire speed, and also showed that welds made with hollow wire displayed greater variability compared to solid wire.