Joint Information and Jamming Beamforming for Secrecy Rate Maximization in Cognitive Radio Networks

In this paper, we consider the secure beamforming design for an underlay cognitive radio multiple-input singleoutput broadcast channel in the presence of multiple passive eavesdroppers. Our goal is to design a jamming noise (JN) transmit strategy to maximize the secrecy rate of the secondary system. By utilizing the zero-forcing method to eliminate the interference caused by JN to the secondary user, we study the joint optimization of the information and JN beamforming for secrecy rate maximization of the secondary system while satisfying all the interference power constraints at the primary users, as well as the per-antenna power constraint at the secondary transmitter. For an optimal beamforming design, the original problem is a nonconvex program, which can be reformulated as a convex program by applying the rank relaxation method. To this end, we prove that the rank relaxation is tight and propose a barrier interior-point method to solve the resulting saddle point problem based on a duality result. To find the global optimal solution, we transform the considered problem into an unconstrained optimization problem. We then employ Broyden-Fletcher-Goldfarb-Shanno (BFGS) method to solve the resulting unconstrained problem which helps reduce the complexity significantly, compared to conventional methods. Simulation results show the fast convergence of the proposed algorithm and substantial performance improvements over existing approaches.

Implementation and Validation of a Self-Consumption Maximization Energy Management Strategy in a Vanadium Redox Flow BIPV Demonstrator

This paper presents the results of the implementation of a self-consumption maximization strategy tested in a real-scale Vanadium Redox Flow Battery (VRFB) (5 kW, 60 kWh) and Building Integrated Photovoltaics (BIPV) demonstrator (6.74 kWp). The tested energy management strategy aims to maximize the consumption of energy generated by a BIPV system through the usage of a battery. Whenever possible, the residual load is either stored in the battery to be used later or is supplied by the energy stored previously. The strategy was tested over seven days in a real-scale VRF battery to assess the validity of this battery to implement BIPV-focused energy management strategies. The results show that it was possible to obtain a self-consumption ratio of 100.0%, and that 75.6% of the energy consumed was provided by PV power. The VRFB was able to perform the strategy, although it was noticed that the available power (either to charge or discharge) varied with the state of charge.

Mathematical Programming Models for Influence Maximization on Social Networks

In this dissertation, we apply mathematical programming techniques (i.e., integer programming and polyhedral combinatorics) to develop exact approaches for influence maximization on social networks. We study four combinatorial optimization problems that deal with maximizing influence at minimum cost over a social network. To our knowl- edge, all previous work to date involving influence maximization problems has focused on heuristics and approximation. We start with the following viral marketing problem that has attracted a significant amount of interest from the computer science literature. Given a social network, find a target set of customers to seed with a product. Then, a cascade will be caused by these initial adopters and other people start to adopt this product due to the influence they re- ceive from earlier adopters. The idea is to find the minimum cost that results in the entire network adopting the product. We first study a problem called the Weighted Target Set Selection (WTSS) Prob- lem. In the WTSS problem, the diffusion can take place over as many time periods as needed and a free product is given out to the individuals in the target set. Restricting the number of time periods that the diffusion takes place over to be one, we obtain a problem called the Positive Influence Dominating Set (PIDS) problem. Next, incorporating partial incentives, we consider a problem called the Least Cost Influence Problem (LCIP). The fourth problem studied is the One Time Period Least Cost Influence Problem (1TPLCIP) which is identical to the LCIP except that we restrict the number of time periods that the diffusion takes place over to be one. We apply a common research paradigm to each of these four problems. First, we work on special graphs: trees and cycles. Based on the insights we obtain from special graphs, we develop efficient methods for general graphs. On trees, first, we propose a polynomial time algorithm. More importantly, we present a tight and compact extended formulation. We also project the extended formulation onto the space of the natural vari- ables that gives the polytope on trees. Next, building upon the result for trees---we derive the polytope on cycles for the WTSS problem; as well as a polynomial time algorithm on cycles. This leads to our contribution on general graphs. For the WTSS problem and the LCIP, using the observation that the influence propagation network must be a directed acyclic graph (DAG), the strong formulation for trees can be embedded into a formulation on general graphs. We use this to design and implement a branch-and-cut approach for the WTSS problem and the LCIP. In our computational study, we are able to obtain high quality solutions for random graph instances with up to 10,000 nodes and 20,000 edges (40,000 arcs) within a reasonable amount of time.

Modelling urban public transit users' route choice behaviour: review and outlook

This paper reviews the main development of approaches to modelling urban public transit users’ route choice behaviour from 1960s to the present. The approaches reviewed include the early heuristic studies on finding the least cost transit route and all-or-nothing transit assignment, the bus common line problem and corresponding network representation methods, the disaggregate discrete choice models which are based on random utility maximization assumptions, the deterministic use equilibrium and stochastic user equilibrium transit assignment models, and the recent dynamic transit assignment models using either frequency or schedule based network formulation. In addition to reviewing past outcomes, this paper also gives an outlook into the possible future directions of modelling transit users’ route choice behaviour. Based on the comparison with the development of models for motorists’ route choice and traffic assignment problems in an urban road area, this paper points out that it is rewarding for transit route choice research to draw inspiration from the intellectual outcomes out of the road area. Particularly, in light of the recent advancement of modelling motorists’ complex road route choice behaviour, this paper advocates that the modelling practice of transit users’ route choice should further explore the complexities of the problem.

The impact of distributional preferences on (experimental) markets for expert services

Theory predicts that efficiency prevails on credence goods markets if customers are able to verify which quality they receive from an expert seller. In a series of experiments with endogenous prices we observe that verifiability fails to result in efficient provision behaviour and leads to very similar results as a setting without verifiability. Some sellers always provide appropriate treatment even if own money maximization calls for over- or undertreatment. Overall our endogenous-price-results suggests that both inequality aversion and a taste for efficiency play an important role for experts’ provision behaviour. We contrast the implications of those two motivations theoretically and discriminate between them empirically using a fixed-price design. We then classify experimental experts according to their provision behaviour.

Transit users' route-choice modelling in transit assignment : a review

This paper reviews the main studies on transit users’ route choice in thecontext of transit assignment. The studies are categorized into three groups: static transit assignment, within-day dynamic transit assignment, and emerging approaches. The motivations and behavioural assumptions of these approaches are re-examined. The first group includes shortest-path heuristics in all-or-nothing assignment, random utility maximization route-choice models in stochastic assignment, and user equilibrium based assignment. The second group covers within-day dynamics in transit users’ route choice, transit network formulations, and dynamic transit assignment. The third group introduces the emerging studies on behavioural complexities, day-to-day dynamics, and real-time dynamics in transit users’ route choice. Future research directions are also discussed.

Remaining useful life prediction using elliptical basis function network and Markov Chain

This paper presents a novel method for remaining useful life prediction using the Elliptical Basis Function (EBF) network and a Markov chain. The EBF structure is trained by a modified Expectation-Maximization (EM) algorithm in order to take into account the missing covariate set. No explicit extrapolation is needed for internal covariates while a Markov chain is constructed to represent the evolution of external covariates in the study. The estimated external and the unknown internal covariates constitute an incomplete covariate set which are then used and analyzed by the EBF network to provide survival information of the asset. It is shown in the case study that the method slightly underestimates the remaining useful life of an asset which is a desirable result for early maintenance decision and resource planning.

Diversity management for innovation in social enterprises in the UK

This paper examines the linkages between diversity management (DM), innovation and high performance in social enterprises. These linkages are explicated beyond traditional framing of DM limited to workforce composition, to include discussions of innovation through networked diversity practices; reconciliation; and funding options. The paper draws upon a UK-based national survey and the case study data. Multiple data collection methods were used, including semi-structured interviews, questionnaires and workshops with participant observation. NVivo and SPSS software packages were utilized in order to analyse the qualitative and quantitative data, respectively. We used thematic coding and cropping techniques in analysing the case studies in the paper. A broad range of conflicting and supporting literature was enfolded into the conversations and discussion. The paper demonstrates that social enterprises exhibit unique characteristics in terms of size and location, as well as their double remit to add value both economically and socially. As a conclusion, we argue for social enterprises to consider options for DM in the interests of maximization of innovation and business performance. We contend that further research is needed to describe how social entrepreneurs draw upon their various ‘diversity resources’ in the process of innovation

A statistical framework for natural feature representation

This paper presents a robust stochastic framework for the incorporation of visual observations into conventional estimation, data fusion, navigation and control algorithms. The representation combines Isomap, a non-linear dimensionality reduction algorithm, with expectation maximization, a statistical learning scheme. The joint probability distribution of this representation is computed offline based on existing training data. The training phase of the algorithm results in a nonlinear and non-Gaussian likelihood model of natural features conditioned on the underlying visual states. This generative model can be used online to instantiate likelihoods corresponding to observed visual features in real-time. The instantiated likelihoods are expressed as a Gaussian mixture model and are conveniently integrated within existing non-linear filtering algorithms. Example applications based on real visual data from heterogenous, unstructured environments demonstrate the versatility of the generative models.

A stochastic model for natural feature representation

This paper presents a robust stochastic model for the incorporation of natural features within data fusion algorithms. The representation combines Isomap, a non-linear manifold learning algorithm, with Expectation Maximization, a statistical learning scheme. The representation is computed offline and results in a non-linear, non-Gaussian likelihood model relating visual observations such as color and texture to the underlying visual states. The likelihood model can be used online to instantiate likelihoods corresponding to observed visual features in real-time. The likelihoods are expressed as a Gaussian Mixture Model so as to permit convenient integration within existing nonlinear filtering algorithms. The resulting compactness of the representation is especially suitable to decentralized sensor networks. Real visual data consisting of natural imagery acquired from an Unmanned Aerial Vehicle is used to demonstrate the versatility of the feature representation.

Stability and change

This special feature section of Journal of Management & Organization (Volume 17/1 - March 2011) sets out to widen understanding of the processes of stability and change in today's organizations, with a particular emphasis on the contribution of institutional approaches to organizational studies. Institutional perspectives on organization theory assume that rational, economic calculations, such as the maximization of profits or the optimization of resource allocation, are not sufficient to understand the behavior of organizations and their strategic choices. Institutionalists acknowledge the great uncertainty associated with the conduct of organizations and suggest that taken-for-granted values, beliefs and meanings within and outside organizations also play an important role in the determination of legitimate action.

Aggregate distance based clustering using Fibonacci Series -FIBCLUS

This paper proposes an innovative instance similarity based evaluation metric that reduces the search map for clustering to be performed. An aggregate global score is calculated for each instance using the novel idea of Fibonacci series. The use of Fibonacci numbers is able to separate the instances effectively and, in hence, the intra-cluster similarity is increased and the inter-cluster similarity is decreased during clustering. The proposed FIBCLUS algorithm is able to handle datasets with numerical, categorical and a mix of both types of attributes. Results obtained with FIBCLUS are compared with the results of existing algorithms such as k-means, x-means expected maximization and hierarchical algorithms that are widely used to cluster numeric, categorical and mix data types. Empirical analysis shows that FIBCLUS is able to produce better clustering solutions in terms of entropy, purity and F-score in comparison to the above described existing algorithms.

Verifiability in Markets for Credence Goods

Theory predicts that efficiency prevails on credence goods markets if customers are able to verify which quality they receive from an expert seller. In a series of experiments with endogenous prices we observe that variability fails to result in efficient provision behavior and leads to very similar results as a setting without variability. Some sellers always provide appropriate treatment even if own money maximization calls for over- or undertreatment. Overall our endogenous price-results suggests that both inequality aversion and a taste for efficiency play an important role for experts provision behavior. We contrast the implications of those two motivations theoretically and discriminate between them empirically using a �xed-price design. We then classify experimental experts according to their provision behavior.

A superdirective 3-element array for adaptive beamforming

A small array composed of three monopole elements with very small element spacing on the order of λ/6 to λ/20 is considered for application in adaptive beamforming. The properties of this 3-port array are governed by strong mutual coupling. It is shown that for signal-to-noise maximization, it is not sufficient to adjust the weights to compensate for the effects of mutual coupling. The necessity for a RF-decoupling network (RF-DN) and its simple realization are shown. The array with closely spaced elements together with the RF-DN represents a superdirective antenna with a directivity of more than 10 dBi. It is shown that the required fractional frequency bandwidth and the available unloaded Q of the antenna and RF-DN structure determine the lower limit for the element spacing.