Iterative equalization combining algorithm in intersymbol interference channel

To realize joint optimization of spatial diversity and equalization combining in the intersymbol interference (ISI) channel, an iterative equalization combining algorithm is proposed. The proposed algorithm uses the coefficients of Turbo equalization to calculate the combination weights without estimating the signal to noise ratio in each diversity branch. The equalized symbols from different diversity branches are combined, and the extrinsic information output from the decoder is fed back to the equalizers, so as to exchange soft information between the equalizers and the decoder. The performance of the proposed algorithm is analyzed using the extrinsic information transfer (EXIT) chart and verified by simulations. Results show that our approach fully exploits time domain information from the multipath channel and spatial domain information from multi receiving antennas, which efficiently improve the performance of the receiver in the severe ISI channel.     

The analysis and comparison of two novel kinds of focusing elements as reflectors

In this article, two novel kinds of focusing elements as reflectors are analyzed and compared. One is the grooved Fresnel zone plate reflector with continuous phase‐correcting. The other called subzone paraboloid reflector, has the profile that consists of a series of paraboloids. Their diffraction efficiencies and bandwidths are described. The two elements still preserve the advantages of Fresnel zone plates, namely, low profile, high efficiency, and simple fabrication. Two dual‐reflector antennas using the proposed focusing elements as the main reflectors are simulated and the results show that these antennas have good radiation performances. © 2014 Wiley Periodicals, Inc. Int J RF and Microwave CAE 25:101–108, 2015.     

Software assurance practices for mobile applications

Mobile software applications have to cope with a particular environment that involves small size, limited resources, high autonomy requirements, competitive business models and many other challenges. To provide development guidelines that respond to these needs, several practices have been introduced; however, it is not clear how these guidelines may contribute to solve the issues present in the mobile domain. Furthermore, the rapid evolution of the mobile ecosystem challenges many of the premises upon which the proposed practices were designed. In this paper, we present a survey of the literature on software assurance practices for mobile applications, with the objective of describing them and assessing their contribution and success. We identified, organized and reviewed a body of research that spans in three levels: software development processes, software product assurance practices, and software implementation practices. By carrying out this literature survey, we reviewed the different approaches that researchers on Software Engineering have provided to address the needs that raise in the mobile software development arena. Moreover, we review the evolution of these practices, identifying how the constant changes and modernization of the mobile execution environment has impacted the methods proposed in the literature. Finally, we introduced discussion on the application of these practices in a real productive setting, opening an area for further research that may determine if practitioners have followed the proposed assurance paradigms.     

On stochastic comparisons of finite mixtures for some semiparametric families of distributions

In this paper, we consider the classical finite mixture model, which is an effective tool for modeling lifetime distributions for random samples from heterogeneous populations. We discuss new results on stochastic comparison for two finite mixtures when each of them is drawn from one of the following semiparametric families, i.e., proportional hazards, accelerated lifetime and proportional reversed hazards.     

Is the List of Incomplete Open Cubes Complete?

Variations of Incomplete Open Cubes is the major project by the twentieth-century conceptual artist Sol LeWitt. In this paper we interpret the enumerative component of the project as embeddings of graphs. This formulation permits use of an algorithm to check the completeness of the list of the structures produced by the artist. Our conclusion is that the artist found the correct number of structures (that is, 122), but that his list contains a mistake in the presentation of a pair of incomplete cubes, a discovery that appears not to have been noted before.