A simple formula for local burnup based on constant relative reaction rate per nuclei

A simple and analytical formula is suggested to solve the problems of the local burnup and the isotope distributions. The present method considers two extreme conditions of neutrons penetrating the fuel rod. Based on these considerations, the formula is obtained to calculate the reaction rates of $^{235}$U, $^{238}$U, and $^{239}$Pu and straightforward the local burnup and the isotope distributions. Starting from an initial burnup level, the parameters of the formula are fitted to the reaction rates given by a Monte Carlo (MC) calculation. Then the present formula independently gives very similar results as the MC calculation from the starting to high burnup level, but takes just a few minutes. The relative reaction rates are found to be almost independent on the radius (except $(n,\gamma)$ of $^{238}$U) and the burnup, providing a solid background for the present formula. A more realistic examination is also performed when the fuel rods locate in an assembly. A combination of the present formula and the MC calculation is expected to have a nice balance on the accuracy and the cost on time

End to End Performance Analysis of Relay Cooperative Communication Based on Parked Cars

Parking lots (PLs) are usually full with cars. If these cars are formed into a self-organizing vehicular network, they can be new kind of road side units (RSUs) in urban area to provide communication data forwarding between mobile terminals nearby and a base station. However cars in PLs can leave at any time, which is neglected in the existing studies. In this paper, we investigate relay cooperative communication based on parked cars in PLs. Taking the impact of the car's leaving behavior into consideration, we derive the expressions of outage probability in a two-hop cooperative communication and its link capacity. Finally, the numerical results show that the impact of a car's arriving time is greater than the impact of the duration the car has parked on outage probability.Comment: 7 pages, 7 figures, accepted by ICACT201

Adaptive semi-supervised affinity propagation clustering algorithm based on structural similarity

Uzimajući u obzir nezadovoljavajuće djelovanje grupiranja srodnog širenja algoritma grupiranja, kada se radi o nizovima podataka složenih struktura, u ovom se radu predlaže prilagodljivi nadzirani algoritam grupiranja srodnog širenja utemeljen na strukturnoj sličnosti (SAAP-SS). Najprije se predlaže nova strukturna sličnost rješavanjem nelinearnog problema zastupljenosti niskoga ranga. Zatim slijedi srodno širenje na temelju podešavanja matrice sličnosti primjenom poznatih udvojenih ograničenja. Na kraju se u postupak algoritma uvodi ideja eksplozija kod vatrometa. Prilagodljivo pretražujući preferencijalni prostor u dva smjera, uravnotežuju se globalne i lokalne pretraživačke sposobnosti algoritma u cilju pronalaženja optimalne strukture grupiranja. Rezultati eksperimenata i sa sintetičkim i s realnim nizovima podataka pokazuju poboljšanja u radu predloženog algoritma u usporedbi s AP, FEO-SAP i K-means metodama.In view of the unsatisfying clustering effect of affinity propagation (AP) clustering algorithm when dealing with data sets of complex structures, an adaptive semi-supervised affinity propagation clustering algorithm based on structural similarity (SAAP-SS) is proposed in this paper. First, a novel structural similarity is proposed by solving a non-linear, low-rank representation problem. Then we perform affinity propagation on the basis of adjusting the similarity matrix by utilizing the known pairwise constraints. Finally, the idea of fireworks explosion is introduced into the process of the algorithm. By adaptively searching the preference space bi-directionally, the algorithm’s global and local searching abilities are balanced in order to find the optimal clustering structure. The results of the experiments with both synthetic and real data sets show performance improvements of the proposed algorithm compared with AP, FEO-SAP and K-means methods

An Improved K-means Algorithm and Its Application for Assessment of Culture Industry Listed Companies

Owing to K-means algorithm has the shortcoming that it always neglects the influence of cluster size when the Euclidean distances between samples and cluster center is calculated. In order to overcome the lack, the influence of cluster size is introduced into K-means algorithm in this paper. Therefore an improved K-means algorithm based on gravity is proposed, namely GK-means algorithm. The experimental simulation results show that GK-means algorithm has better performance compared with K-means algorithm. So the GK-means algorithm is adopted for assessing the performance of culture industry listed companies in this paper. Furthermore some satisfactory results are also obtained

Beamforming Design and Trajectory Optimization for UAV-Empowered Adaptable Integrated Sensing and Communication

Unmanned aerial vehicle (UAV) has high flexibility and controllable mobility, therefore it is considered as a promising enabler for future integrated sensing and communication (ISAC). In this paper, we propose a novel adaptable ISAC (AISAC) mechanism in the UAV-enabled system, where the UAV performs sensing on demand during communication and the sensing duration is configured flexibly according to the application requirements rather than keeping the same with the communication duration. Our designed mechanism avoids the excessive sensing and waste of radio resources, therefore improving the resource utilization and system performance. In the UAV-enabled AISAC system, we aim at maximizing the average system throughput by optimizing the communication and sensing beamforming as well as UAV trajectory while guaranteeing the quality-of-service requirements of communication and sensing. To efficiently solve the considered non-convex optimization problem, we first propose an efficient alternating optimization algorithm to optimize the communication and sensing beamforming for a given UAV location, and then develop a low-complexity joint beamforming and UAV trajectory optimization algorithm that sequentially searches the optimal UAV location until reaching the final location. Numerical results validate the superiority of the proposed adaptable mechanism and the effectiveness of the designed algorithm.Comment: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

Posterior Inference in Bayesian Quantile Regression with Asymmetric Laplace Likelihood

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135059/1/insr12114.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/135059/2/insr12114_am.pd

Rejoinder

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/134939/1/insr12181.pdfhttp://deepblue.lib.umich.edu/bitstream/2027.42/134939/2/insr12181_am.pd