Short packet communication in underlay cognitive network assisted by an intelligent reflecting surface

We propose short packet communication in an underlay cognitive radio network assisted by an intelligent reflecting surface (IRS) composed of multiple reconfigurable reflectors. This scheme, called the IRS protocol, operates in only one time slot (TS) using the IRS. The IRS adjusts its phases to give zero received cumulative phase at the secondary destination, thereby enhancing the end-to-end signal-to-noise ratio. The transmitting power of the secondary source is optimized to simultaneously satisfy the multi-interference constraints, hardware limitations, and performance improvement. Simulation and analysis results of the average block error rates (BLERs) show that the performance can be enhanced by installing more reconfigurable reflectors, increasing the blocklength, lowering the number of required primary receivers, or sending fewer information bits. Moreover, the proposed IRS protocol always outperforms underlay relaying protocols using two TSs for data transmission, and achieves the best average BLER at identical transmission distances between the secondary source and secondary destination. The theoretical analyses are confirmed by Monte Carlo simulations.     

Recognition and analysis of cell nuclear phases for high-content screening based on morphological features

Automated analysis of molecular images has increasingly become an important research in computational life science. In this paper some new and efficient algorithms for recognizing and analyzing cell phases of high-content screening are presented. The conceptual frameworks are based on the morphological features of cell nuclei. The useful preprocessing includes: smooth following and linearization; extraction of morphological structural points; shape recognition based morphological structure; issue of touching cells for cell separation and reconstruction. Furthermore, the novel detecting and analyzing strategies of feed-forward and feed-back of cell phases are proposed based on gray feature, cell shape, geometrical features and difference information of corresponding neighbor frames. Experiment results tested the efficiency of the new method.     

Optimal assembly plan generation: a simplifying approach

The main difficulty in the overall process of optimal assembly plan generation is the great number of different ways to assemble a product (typically thousands of solutions). This problem confines the application of most existing automated planning methods to products composed of only a limited number of components. The presented method of assembly plan generation belongs to the approach called “disassembly” and is founded on a new representation of the assembly process, with introduction of a new concept, the equivalence of binary trees. This representation allows to generate the minimal list of all non-redundant (really different) assembly plans. Plan generation is directed by assembly operation constraints and plan-level performance criteria. The method was tested for various assembly applications and compared to other generation approaches. Results show a great reduction in the combinatorial explosion of the number of plans. Therefore, this simplifying approach of assembly sequence modeling allows to handle more complex products with a large number of parts.     

Fuzzy posterior-probabilistic fusion

The paradigm of the permanence of updating ratios, which is a well-proven concept in experimental engineering approximation, has recently been utilized to construct a probabilistic fusion approach for combining knowledge from multiple sources. This ratio-based probabilistic fusion, however, assumes the equal contribution of attributes of diverse evidences. This paper introduces a new framework of a fuzzy probabilistic data fusion using the principles of the permanence of ratios paradigm, and the theories of fuzzy measures and fuzzy integrals. The fuzzy sub-fusion of the proposed approach allows an effective model for incorporating evidence importance and interaction.     

A spreadsheet approach to facilitate visualization of uncertainty in information

Information uncertainty is inherent in many problems and is often subtle and complicated to understand. Although visualization is a powerful means for exploring and understanding information, information uncertainty visualization is ad hoc and not widespread. This paper identifies two main barriers to the uptake of information uncertainty visualization: firstly, the difficulty of modeling and propagating the uncertainty information; and secondly, the difficulty of mapping uncertainty to visual elements. To overcome these barriers, we extend the spreadsheet paradigm to encapsulate uncertainty details within cells. This creates an inherent awareness of the uncertainty associated with each variable. The spreadsheet can hide the uncertainty details, enabling the user to think simply in terms of variables. Furthermore, the system can aid with automated propagation of uncertainty information, since it is intrinsically aware of the uncertainty. The system also enables mapping the encapsulated uncertainty to visual elements via the formula language and a visualization sheet. Support for such low-level visual mapping provides flexibility to explore new techniques for information uncertainty visualization.     

A spatially constrained fuzzy hyper-prototype clustering algorithm

We present in this paper a fuzzy clustering algorithm which can handle spatially constraint problems often encountered in pattern recognition. The proposed method is based on the notions of hyperplanes, the fuzzy c-means, and spatial constraints. By adding a spatial regularizer into the fuzzy hyperplane-based objective function, the proposed method can take into account additionally important information of inherently spatial data. Experimental results have demonstrated that the proposed algorithm achieves superior results to some other popular fuzzy clustering models, and has potential for cluster analysis in spatial domain.     

Supervised restoration of degraded medical images using multiple-point geostatistics

Reducing noise in medical images has been an important issue of research and development for medical diagnosis, patient treatment, and validation of biomedical hypotheses. Noise inherently exists in medical and biological images due to the acquisition and transmission in any imaging devices. Being different from image enhancement, the purpose of image restoration is the process of removing noise from a degraded image in order to recover as much as possible its original version. This paper presents a statistically supervised approach for medical image restoration using the concept of multiple-point geostatistics. Experimental results have shown the effectiveness of the proposed technique which has potential as a new methodology for medical and biological image processing.     

Unsupervised active contours driven by density distance and local fitting energy with applications to medical image segmentation

This study presents an efficient variational region-based active contour model for segmenting images without priori knowledge about the object or background. In order to handle intensity inhomogeneities and noise, we propose to integrate into the region-based local intensity model a global density distance inspired by the Bhattacharyya flow. The local term based on local information of segmented image allows the model to deal with bias field artifact, which arises in data acquisition processes. The global term, which is based on the density distance between the probability distribution functions of image intensity inside and outside the active contour, provides information for accurate segmentation, keeps the curve from spilling, and addresses noise in the image. Intensive 2D and 3D experiments on many imaging modalities of medical fields such as computed tomography, magnetic resonance imaging, and ultrasound images demonstrate the effectiveness of the model when dealing with images with blurred object boundary, intensity inhomogeneities, and noise.     

Generalized Linear Quadratic Gaussian Techniques for the Wind Benchmark Problem

This paper presents a comprehensive study of the stage-3 benchmark problem for response control of wind-excited tall buildings based on the linear quadratic gaussian (LQG) approach, and on its generalization, the k-cost-cumulant control method. For control design, the original nodal building model is first transformed into balanced modal space. The Hankel singular values (HSVs) and the power spectral density of the wind disturbances are calculated; and, based on them, a reduced-order model is derived by keeping the first six low-frequency modes. A balanced LQG (BLQG) controller is then determined by adopting the HSVs as a basis to choose the design weights. The main results of the paper are that the BLQG control design is able to come within 5–10% of the performance of the sample LQG controller supplied with the benchmark, but with control actions on the order of one-third less than the sample LQG, and with stability improvement features of a substantial nature over the range of stiffness perturbations specified in the benchmark. Finally, if the low authority BLQG controller is regarded as a one-cost-cumulant design, then with the appropriate use of the second-cost cumulant, the latter methodology is able to demonstrate how higher-authority controllers can give certain improvements in performance, but at the expense of significant investment in control action.