A Bayesian marked spatial point processes model for basketball shot chart

The success rate of a basketball shot may be higher at locations where a player makes more shots. For a marked spatial point process, this means that the mark and the intensity are associated. We propose a Bayesian joint model for the mark and the intensity of marked point processes, where the intensity is incorporated in the mark model as a covariate. Inferences are done with a Markov chain Monte Carlo algorithm. Two Bayesian model comparison criteria, the Deviance Information Criterion and the Logarithm of the Pseudo-Marginal Likelihood, were used to assess the model. The performances of the proposed methods were examined in extensive simulation studies. The proposed methods were applied to the shot charts of four players (Curry, Harden, Durant, and James) in the 2017--2018 regular season of the National Basketball Association to analyze their shot intensity in the field and the field goal percentage in detail. Application to the top 50 most frequent shooters in the season suggests that the field goal percentage and the shot intensity are positively associated for a majority of the players. The fitted parameters were used as inputs in a secondary analysis to cluster the players into different groups

From the social learning theory to a social learning algorithm for global optimization

Traditionally, the Evolutionary Computation (EC) paradigm is inspired by Darwinian evolution or the swarm intelligence of animals. Bandura's Social Learning Theory pointed out that the social learning behavior of humans indicates a high level of intelligence in nature. We found that such intelligence of human society can be implemented by numerical computing and be utilized in computational algorithms for solving optimization problems. In this paper, we design a novel and generic optimization approach that mimics the social learning process of humans. Emulating the observational learning and reinforcement behaviors, a virtual society deployed in the algorithm seeks the strongest behavioral patterns with the best outcome. This corresponds to searching for the best solution in solving optimization problems. Experimental studies in this paper showed the appealing search behavior of this human intelligence-inspired approach, which can reach the global optimum even in ill conditions. The effectiveness and high efficiency of the proposed algorithm has further been verified by comparing to some representative EC algorithms and variants on a set of benchmarks

Preparation and electrochemical performance of hollow activated carbon fiber self-supported electrode for supercapacitor

Hollow activated carbon fiber (HACF) with high specific surface area and high charge storage capability was prepared by pre-oxidation, carbonization and KOH-activation from polyacrylonitrile (PAN). HACF was used as self-supported working electrode directly without any binder and conductive agent. The effect of the activation time on specific surface area of HACF was studied intensively. The results show that the specific surface area of HACF increased with the increase of activation time from 0.5 h to 1.5 h, and then decreased with further increase of activation time. Highest specific surface area of 1873 m(2)g(-1) and micropore volume of 0.61 cm(3)g(-1) were obtained in HACF activated for 1.5 h. Electrochemical properties of HACF can be improved with increase of activation time, but excessive activation results in the decrease of specific surface area and increase of internal resistance of HACF. The self-supported electrode of HACF possesses a large specific capacitance of 323 F g(-1) at 0.05 A g(-1) and 216 F g(-1) at 1 A g(-1). Therefore, HACF can be a promising self-supported electrode for high performance supercapacitors

Elegant design of carbon nanotube foams with double continuous structure for metamaterials in a broad frequency range

Carbon nanotube (CNT) foams with negative permittivity and permeability are successfully prepared by chemical vapor deposition (CVD) and post-treatment. A double negative metamaterial in the 1-1000 MHz frequency range with double continuous structure results by effectively compounding the CNT foam with a polymer material, i.e. epoxy or nanosilver silicone resin. The negative permeability is specifically attributed to the three-dimensional CNT interactions as clear from the study of the relation of the material microstructure and the macroscopic measurements. Compared to CNT foam/epoxy composites, CNT foam/nanosilver/silicone composites have a lower permeability but a more excellent electrical conductivity or permittivity. It is also shown that the carbon source time during CVD and post-pressurization can be adjusted to allow for both negative permittivity and permeability. This contribution highlights a convenient method to obtain a metamaterial in a much larger frequency range (ca. 1 to 1000 MHz) than the state-of-the-art. It thus supports the expansion of the application range of metamaterials and simplifies their preparation, which is of great significance for the wider use of these materials

Truthful Mechanisms for Secure Communication in Wireless Cooperative System

To ensure security in data transmission is one of the most important issues for wireless relay networks, and physical layer security is an attractive alternative solution to address this issue. In this paper, we consider a cooperative network, consisting of one source node, one destination node, one eavesdropper node, and a number of relay nodes. Specifically, the source may select several relays to help forward the signal to the corresponding destination to achieve the best security performance. However, the relays may have the incentive not to report their true private channel information in order to get more chances to be selected and gain more payoff from the source. We propose a Vickey-Clark-Grove (VCG) based mechanism and an Arrow-d'Aspremont-Gerard-Varet (AGV) based mechanism into the investigated relay network to solve this cheating problem. In these two different mechanisms, we design different "transfer payment" functions to the payoff of each selected relay and prove that each relay gets its maximum (expected) payoff when it truthfully reveals its private channel information to the source. And then, an optimal secrecy rate of the network can be achieved. After discussing and comparing the VCG and AGV mechanisms, we prove that the AGV mechanism can achieve all of the basic qualifications (incentive compatibility, individual rationality and budget balance) for our system. Moreover, we discuss the optimal quantity of relays that the source node should select. Simulation results verify efficiency and fairness of the VCG and AGV mechanisms, and consolidate these conclusions.Comment: To appear in IEEE Transactions on Wireless Communication