Adaptive predistortion using threshold decomposition‐based piecewise linear modeling

A new adaptive predistortion approach for nonlinear power amplifiers based on the piecewise linear (PWL) approximation of nonlinear functions is presented. The PWL model is obtained using threshold decomposition (TD) of the input‐output characteristics. The TD based PWL model is used to develop a baseband predistorter using both the direct and the indirect learning architectures. The proposed predistorter is proved to provide a better performance in suppressing nonlinear distortion than conventional polynomial predistorters and a reduced hardware complexity as compared to lookup table (LUT) approach. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011.     

Hilbert‐shaped complementary ring resonator and application to enhanced‐performance low pass filter with high selectivity

In this article, a novel single negative metamaterial (MTM) transmission line (TL) consisting of a Hilbert‐shaped complementary ring resonator (H‐CRR) on the ground plane is initially presented and studied in depth. Then based on the proposed MTM TL, a novel six‐section Hi‐Lo microstrip low‐pass filter (LPF) with a cut‐off frequency 2.5 GHz is developed, fabricated, and measured. Measurement results indicate that: by integrating H‐CRR, the selectivity has been significantly improved which is 77.3 dB/GHz due to the single negative permittivity; by etching a crown square on low‐impedance section, the bandwidth characterized by 20 dB return loss was obviously enhanced by 26.2% and the maximal sidelobe level of in‐band return loss was reduced from 22 to 24.6 dB. What' more, the developed LPF achieved a 36.3% size reduction with respect to its conventional counterpart. The design concept, which was confirmed by the measurement data, is of practical value and can be popularized in other microwave devices where high selectivity is requested. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011.     

Extending the two‐stage information systems continuance model: incorporating UTAUT predictors and the role of context

This study presents two extensions to the two‐stage expectation‐confirmation theory of information systems (IS) continuance. First, we expand the belief set from perceived usefulness in the original IS continuance model to include three additional predictors identified in the unified theory of acceptance and use of technology, namely effort expectancy, social influence and facilitating conditions. Second, we ground the IS continuance model in the context of transactional systems that involve transmission of personal and sensitive information and include trust as a key contextual belief in the model. To test the expanded IS continuance model, we conducted a longitudinal field study of 3159 Hong Kong citizens across two electronic government (e‐government) technologies that enable citizens' access to government services. In general, the results support the expanded model that provides a rich understanding of the changes in the pre‐usage beliefs and attitudes through the emergent constructs of disconfirmation and satisfaction, ultimately influencing IS continuance intention. Finally, we discuss the theoretical and practical implications of the expanded model.     

Optimized element positions for prescribed radar cross section pattern of linear dipole arrays

Approximate closed‐form expression is derived for the scattering from dipole arrays based on the equivalent circuit theory. Then, a method is proposed for synthesis of dipole arrays to produce desired scattering pattern using genetic algorithm (GA). In the synthesis method, the element positions in an array are considered as the optimization parameter and the derived expression is used to evaluate the fitness function of GA. To assess the validity and efficiency of the proposed method, several linear dipole arrays are designed to obtain scattering pattern with low sidelobe level (SLL). A good agreement between the patterns calculated using the expression and simulated by FEKO validates the accuracy of the presented expression. In addition, the numerical results show that the maximum SLL of the scattering pattern is considerably reduced by optimization. © 2011 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2011.     

Dealing with midair collisions in dense collective aerial systems

The idea of creating collective aerial systems is appealing because several rather simple flying vehicles could join forces to cover a large area in little time in applications such as monitoring, mapping, search and rescue, or airborne communication relays. In most of these scenarios, a fleet of cooperating vehicles is dispatched to a confined airspace area and requested to fly close to a nominal altitude. Moreover, depending on the task each vehicle is assigned to, individual flight trajectories in this essentially two‐dimensional space may interfere, resulting in disastrous collisions. This paper begins by introducing a probabilistic model to predict the rate of midair collisions that would occur if nothing is done to prevent them. In a second step, a control strategy for midair collision avoidance is proposed, which is interesting because it requires only local communication and information about flight altitudes. The proposed strategy is systematically analyzed in theory and simulation as well as in experiments with five physical aerial vehicles. A significant reduction in collision rates can be achieved. Statistically, values close to zero are possible when the swarm's density is below an application‐dependent threshold. Such low collision rates warrant an acceptable level of confidence in collision‐free operation of a physical swarm. © 2011 Wiley Periodicals, Inc.     

Global exponential synchronization of stochastic switching networks with time‐varying delay

This paper is concerned with the global exponential synchronization of stochastic delayed switching networks via hybrid control. The network under investigation is quite general to reflect the reality, where the network topology consists of r modes and switches from one mode to another according to a Markovian chain with known transition probability. Parameter uncertainties, time varying delay and stochastic disturbances are all taken into account in this study. Based on the Lyapunov functional method and stochastic analysis techniques, some new criteria for the global robust synchronization via hybrid control are established. Finally, one example with numerical simulation is given for illustration. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Out‐of‐Core Simplification and Crack‐Free LOD Volume Rendering for Irregular Grids

We propose a novel out‐of‐core simplification and level‐of‐detail (LOD) volume rendering algorithm for large irregular grids represented as tetrahedral meshes. One important feature of our algorithm is that it creates a space decomposition as required by I/O‐efficient simplification and volume rendering, and simplifies both the internal and boundary portions of the sub‐volumes progressively by edge collapses using the (extended) quadric error metric, while ensuring any selected LOD mesh to be crack‐free (i.e., any neighboring sub‐volumes in the LOD have consistent boundaries, and all the cells in the LOD do not have negative volumes), with all computations performed I/O‐ejficiently. This has been an elusive goal for out‐of‐core progressive meshes and LOD visualization, and our novel solution achieves this goal with a theoretical guarantee to be crack‐free for tetrahedral meshes. As for selecting a desirable LOD mesh for volume rendering, our technique supports selective refinement LODs (where different places can have different error bounds), in addition to the basic uniform LODs (where the error bound is the same in all places). The proposed scalar‐value range and view‐dependent selection queries for selective refinement are especially effective in producing images of the highest quality with a much faster rendering speed. The experiments demonstrate the efficacy of our new technique.     

Context‐Dependent Crowd Evaluation

Many times, even if a crowd simulation looks good in general, there could be some specific individual behaviors which do not seem correct. Spotting such problems manually can become tedious, but ignoring them may harm the simulation's credibility. In this paper we present a data‐driven approach for evaluating the behaviors of individuals within a simulated crowd. Based on video‐footage of a real crowd, a database of behavior examples is generated. Given a simulation of a crowd, an analog analysis is performed on it, defining a set of queries, which are matched by a similarity function to the database examples. The results offer a possible objective answer to the question of how similar are the simulated individual behaviors to real observed behaviors. Moreover, by changing the video input one can change the context of evaluation. We show several examples of evaluating simulated crowds produced using different techniques and comprising of dense crowds, sparse crowds and flocks.     

Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow

This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but require careful and tedious input from the user. Others need little user input however they are sensitive to user input and need a postprocessing step to smooth the generated jaggy cutting contours. The popular geometric snake can be used to optimize the cutting contour, but it cannot deal with the topology change. In this paper, we propose a geodesic curvature flow based framework to overcome all these problems. Since in many cases the meaningful cutting contour on a 3D mesh is locally shortest in the sense of some weighted curve length, the geodesic curvature flow is an ideal tool for our problem. It evolves the cutting contour to the nearby local minimum. We should mention that the previous numerical scheme, discretized geodesic curvature flow (dGCF) is too slow and has not been applied to mesh segmentation. With a careful observation to dGCF, we devise here a fast computation scheme called fast geodesic curvature flow (FGCF), which only needs to solve a smaller and easier problem. The initial cutting contour is generated by a variant of random walks algorithm, which is very fast and gives reasonable cutting result with little user input. Experiment results on the benchmark mesh segmentation data set show that our proposed framework is robust to user input and capable of producing good results reflecting geometric features and human shape perception.