A Bitcoin Address Multi-Classification Mechanism Based on Bipartite Graph-Based Maximization Consensus

Bitcoin is widely used as the most classic electronic currency for various electronic services such as exchanges,gambling,marketplaces,and also scams such as high-yield investment projects.Identifying the services operated by a Bitcoin address can help determine the risk level of that address and build an alert model accordingly.Feature engineering can also be used to flesh out labeled addresses and to analyze the current state of Bitcoin in a small way.In this paper,we address the problem of identifying multiple classes of Bitcoin services,and for the poor classification of individual addresses that do not have significant features,we propose a Bitcoin address identification scheme based on joint multi-model prediction using the mapping relationship between addresses and entities.The innovation of the method is to(1)Extract as many valuable features as possible when an address is given to facilitate the multi-class service identification task.(2)Unlike the general supervised model approach,this paper proposes a joint prediction scheme for multiple learners based on address-entity mapping relationships.Specifically,after obtaining the overall features,the address classification and entity clustering tasks are performed separately,and the results are subjected to graph-basedmaximization consensus.The final result ismade to baseline the individual address classification results while satisfying the constraint of having similarly behaving entities as far as possible.By testing and evaluating over 26,000 Bitcoin addresses,our feature extraction method captures more useful features.In addition,the combined multi-learner model obtained results that exceeded the baseline classifier reaching an accuracy of 77.4%.

CRB:A new rumor blocking algorithm in online social networks based on competitive spreading model and influence maximization

The virtuality and openness of online social platforms make networks a hotbed for the rapid propagation of various rumors.In order to block the outbreak of rumor,one of the most effective containment measures is spreading positive information to counterbalance the diffusion of rumor.The spreading mechanism of rumors and effective suppression strategies are significant and challenging research issues.Firstly,in order to simulate the dissemination of multiple types of information,we propose a competitive linear threshold model with state transition(CLTST)to describe the spreading process of rumor and anti-rumor in the same network.Subsequently,we put forward a community-based rumor blocking(CRB)algorithm based on influence maximization theory in social networks.Its crucial step is to identify a set of influential seeds that propagate anti-rumor information to other nodes,which includes community detection,selection of candidate anti-rumor seeds and generation of anti-rumor seed set.Under the CLTST model,the CRB algorithm has been compared with six state-of-the-art algorithms on nine online social networks to verify the performance.Experimental results show that the proposed model can better reflect the process of rumor propagation,and review the propagation mechanism of rumor and anti-rumor in online social networks.Moreover,the proposed CRB algorithm has better performance in weakening the rumor dissemination ability,which can select anti-rumor seeds in networks more accurately and achieve better performance in influence spread,sensitivity analysis,seeds distribution and running time.

Sum-Rate Maximization in Active RIS-Assisted Multi-Antenna WPCN

In this paper,we propose an active reconfigurable intelligent surface(RIS)enabled hybrid relaying scheme for a multi-antenna wireless powered communication network(WPCN),where the active RIS is employed to assist both wireless energy transfer(WET)from the power station(PS)to energyconstrained users and wireless information transmission(WIT)from users to the receiving station(RS).For further performance enhancement,we propose to employ both transmit beamforming at the PS and receive beamforming at the RS.We formulate a sumrate maximization problem by jointly optimizing the RIS phase shifts and amplitude reflection coefficients for both the WET and the WIT,transmit and receive beamforming vectors,and network resource allocation.To solve this non-convex problem,we propose an efficient alternating optimization algorithm with the linear minimum mean squared error criterion,semidefinite relaxation(SDR)and successive convex approximation techniques.Specifically,the tightness of applying the SDR is proved.Simulation results demonstrate that our proposed scheme with 10 reflecting elements(REs)and 4 antennas can achieve 17.78%and 415.48%performance gains compared to the single-antenna scheme with 10 REs and passive RIS scheme with 100 REs,respectively.

Kinematic calibration under the expectation maximization framework for exoskeletal inertial motion capture system

This study presents a kinematic calibration method for exoskeletal inertial motion capture (EI-MoCap) system with considering the random colored noise such as gyroscopic drift.In this method, the geometric parameters are calibrated by the traditional calibration method at first. Then, in order to calibrate the parameters affected by the random colored noise, the expectation maximization (EM) algorithm is introduced. Through the use of geometric parameters calibrated by the traditional calibration method, the iterations under the EM framework are decreased and the efficiency of the proposed method on embedded system is improved. The performance of the proposed kinematic calibration method is compared to the traditional calibration method. Furthermore, the feasibility of the proposed method is verified on the EI-MoCap system. The simulation and experiment demonstrate that the motion capture precision is significantly improved by 16.79%and 7.16%respectively in comparison to the traditional calibration method.

Hybrid Block Diagonalization Precoding for Multi-User Weighted Sum-Rate Maximization

This paper studies large-scale multi-input multi-output(MIMO)orthogonal frequency division multiplexing(OFDM)communications in a broadband frequency-selective channel,where a massive MIMO base station(BS)communicates with multiple users equipped with multi-antenna.We develop a hybrid precoding design to maximize the weighted sum-rate(WSR)of the users by optimizing the digital and the analog precoders alternately.For the digital part,we employ block-diagonalization to eliminate inter-user interference and apply water-filling power allocation to maximize the WSR.For the analog part,the optimization of the PSN is formulated as an unconstrained problem,which can be efficiently solved by a gradient descent method.Numerical results show that the proposed block-diagonal hybrid precoding algorithm can outperform the existing works.

An Influence Maximization Algorithm Based on Improved K-Shell in Temporal Social Networks

Influence maximization of temporal social networks(IMT)is a problem that aims to find the most influential set of nodes in the temporal network so that their information can be the most widely spread.To solve the IMT problem,we propose an influence maximization algorithm based on an improved K-shell method,namely improved K-shell in temporal social networks(KT).The algorithm takes into account the global and local structures of temporal social networks.First,to obtain the kernel value Ks of each node,in the global scope,it layers the network according to the temporal characteristic of nodes by improving the K-shell method.Then,in the local scope,the calculation method of comprehensive degree is proposed to weigh the influence of nodes.Finally,the node with the highest comprehensive degree in each core layer is selected as the seed.However,the seed selection strategy of KT can easily lose some influential nodes.Thus,by optimizing the seed selection strategy,this paper proposes an efficient heuristic algorithm called improved K-shell in temporal social networks for influence maximization(KTIM).According to the hierarchical distribution of cores,the algorithm adds nodes near the central core to the candidate seed set.It then searches for seeds in the candidate seed set according to the comprehensive degree.Experiments showthatKTIMis close to the best performing improved method for influence maximization of temporal graph(IMIT)algorithm in terms of effectiveness,but runs at least an order of magnitude faster than it.Therefore,considering the effectiveness and efficiency simultaneously in temporal social networks,the KTIM algorithm works better than other baseline algorithms.

Topology Driven Cooperative Self Scheduling for Improved Lifetime Maximization in WSN

In Wireless Sensor Network(WSN),scheduling is one of the important issues that impacts the lifetime of entire WSN.Various scheduling schemes have been proposed earlier to increase the lifetime of the network.Still,the results from such methods are compromised in terms of achieving high lifetime.With this objective to increase the lifetime of network,an Efficient Topology driven Cooperative Self-Scheduling(TDCSS)model is recommended in this study.Instead of scheduling the network nodes in a centralized manner,a combined approach is proposed.Based on the situation,the proposed TDCSS approach performs scheduling in both the ways.By sharing the node statistics in a periodic manner,the overhead during the transmission of control packets gets reduced.This in turn impacts the lifetime of all the nodes.Further,this also reduces the number of idle conditions of each sensor node which is required for every cycle.The proposed method enables every sensor to schedule its own conditions according to duty cycle and topology constraints.Central scheduler monitors the network conditions whereas total transmissions occurs at every cycle.According to this,the source can infer the possible routes in a cycle and approximate the available routes.Further,based on the statistics of previous transmissions,the routes towards the sink are identified.Among the routes found,a single optimal route with energy efficiency is selected to perform data transmission.This cooperative approach improves the lifetime of entire network with high throughput performance.

The study of a neutron spectrum unfolding method based on particle swarm optimization combined with maximum likelihood expectation maximization

The neutron spectrum unfolding by Bonner sphere spectrometer(BSS) is considered a complex multidimensional model,which requires complex mathematical methods to solve the first kind of Fredholm integral equation. In order to solve the problem of the maximum likelihood expectation maximization(MLEM) algorithm which is easy to suffer the pitfalls of local optima and the particle swarm optimization(PSO) algorithm which is easy to get unreasonable flight direction and step length of particles, which leads to the invalid iteration and affect efficiency and accuracy, an improved PSO-MLEM algorithm, combined of PSO and MLEM algorithm, is proposed for neutron spectrum unfolding. The dynamic acceleration factor is used to balance the ability of global and local search, and improves the convergence speed and accuracy of the algorithm. Firstly, the Monte Carlo method was used to simulated the BSS to obtain the response function and count rates of BSS. In the simulation of count rate, four reference spectra from the IAEA Technical Report Series No. 403 were used as input parameters of the Monte Carlo method. The PSO-MLEM algorithm was used to unfold the neutron spectrum of the simulated data and was verified by the difference of the unfolded spectrum to the reference spectrum. Finally, the 252Cf neutron source was measured by BSS, and the PSO-MLEM algorithm was used to unfold the experimental neutron spectrum.Compared with maximum entropy deconvolution(MAXED), PSO and MLEM algorithm, the PSO-MLEM algorithm has fewer parameters and automatically adjusts the dynamic acceleration factor to solve the problem of local optima. The convergence speed of the PSO-MLEM algorithm is 1.4 times and 3.1 times that of the MLEM and PSO algorithms. Compared with PSO, MLEM and MAXED, the correlation coefficients of PSO-MLEM algorithm are increased by 33.1%, 33.5% and 1.9%, and the relative mean errors are decreased by 98.2%, 97.8% and 67.4%.

二分图中高效计算top-n maximalα-biclique的方法研究

针对当二分图中一类节点的数量固定时,如何搜索另一类型节点数量排序为前n的maximalα-biclique的问题,提出了一种基础搜索算法和一种基于共同邻居概念的改进搜索算法。在使用(1,α)-core剪枝方法加快搜索的算法基础上,基于共同邻居搜索算法使用共同邻居的概念对算法进行了改进,该算法只遍历节点的二跳邻居,并利用节点顺序和最小阈值提高搜索效率。实验结果表明,两种算法都可以有效且高效地搜索节点数量排名为前n的maximalα-biclique。与基础搜索算法相比,基于共同邻居搜索算法的搜索效率提升了80%,在实际应用场景中更具优势。

DeepWalk Based Influence Maximization (DWIM): Influence Maximization Using Deep Learning

Big Data and artificial intelligence are used to transform businesses.Social networking sites have given a new dimension to online data.Social media platforms help gather massive amounts of data to reach a wide variety of customers using influence maximization technique for innovative ideas,products and services.This paper aims to develop a deep learning method that can identify the influential users in a network.This method combines the various aspects of a user into a single graph.In a social network,the most influential user is the most trusted user.These significant users are used for viral marketing as the seeds to influence other users in the network.The proposed method combines both topical and topological aspects of a user in the network using collaborativefiltering.The proposed method is DeepWalk based Influence Maximization(DWIM).The proposed method was able tofind k influential nodes with computable time using the algorithm.The experiments are performed to assess the proposed algorithm,and centrality measures are used to compare the results.The results reveal its performance that the proposed method canfind k influential nodes in computable time.DWIM can identify influential users,which helps viral marketing,outlier detection,and recommendations for different products and services.After applying the proposed methodology,the set of seed nodes gives maximum influence measured with respect to different centrality measures in an increased computable time.

VARIATIONAL ANALYSIS FOR THE MAXIMAL TIME FUNCTION IN NORMED SPACES

For a general normed vector space,a special optimal value function called a maximal time function is considered.This covers the farthest distance function as a special case,and has a close relationship with the smallest enclosing ball problem.Some properties of the maximal time function are proven,including the convexity,the lower semicontinuity,and the exact characterizations of its subdifferential formulas.

Quantized Decoders that Maximize Mutual Information for Polar Codes

In this paper,we innovatively associate the mutual information with the frame error rate(FER)performance and propose novel quantized decoders for polar codes.Based on the optimal quantizer of binary-input discrete memoryless channels(BDMCs),the proposed decoders quantize the virtual subchannels of polar codes to maximize mutual information(MMI)between source bits and quantized symbols.The nested structure of polar codes ensures that the MMI quantization can be implemented stage by stage.Simulation results show that the proposed MMI decoders with 4 quantization bits outperform the existing nonuniform quantized decoders that minimize mean-squared error(MMSE)with 4 quantization bits,and yield even better performance than uniform MMI quantized decoders with 5 quantization bits.Furthermore,the proposed 5-bit quantized MMI decoders approach the floating-point decoders with negligible performance loss.

Maximal operators of pseudo-differential operators with rough symbols

Consider a pseudo-differential operator T_(a)f(x)=∫_(R^(n))e^(ix,ζ)a(x,ζ)f(ζ)dζwhere the symbol a is in the rough Hormander class L^(∞)S_(ρ)^(m)with m∈R andρ∈[0,1].In this note,when 1≤p≤2,if n(ρ-1)/p and a∈L^(∞)S_(ρ)^(m),then for any f∈S(R^(n))and x∈R^(n),we prove that M(T_(a)f)(x)≤C(M(|f|^(p))(x))^(1/p) where M is the Hardy-Littlewood maximal operator.Our theorem improves the known results and the bound on m is sharp,in the sense that n(ρ-1)/p can not be replaced by a larger constant.

Maximal Resonance of{(3,4),4}-Fullerene Graphs

A{(3,4),4}-fullerene graph S is a 4-regular map on the sphere whose faces are of length 3 or 4.It follows from Euler s formula that the number of triangular faces is eight.A set H of disjoint quadrangular faces of S is called resonant pattern if S has a perfect matching M such that every quadrangular face in H is M-alternating.Let k be a positive integer,S is k-resonant if any i≤k disjoint quadrangular faces of S form a resonant pattern.Moreover,if graph S is k-resonant for any integer k,then S is called maximally resonant.In this paper,we show that the maximally resonant{(3,4),4}-fullerene graphs are S_6,S_8,S_(10)^(2),S_(12)^(2),S_(12)^(4),S_(12)^(5),S_(14)^(3),S_(14)^(5),S_(16)^(3),S_(18)^(5),S_(24)as shown in Fig.1.As a corollary,it is shown that if a{(3,4),4}-fullerene graph is 4-resonant,then it is also maximally resonant.

PERIODIC SYSTEMS WITH TIME DEPENDENT MAXIMAL MONOTONE OPERATORS

We consider a first order periodic system in R^(N),involving a time dependent maximal monotone operator which need not have a full domain and a multivalued perturbation.We prove the existence theorems for both the convex and nonconvex problems.We also show the existence of extremal periodic solutions and provide a strong relaxation theorem.Finally,we provide an application to nonlinear periodic control systems.

MAXIMAL FUNCTION CHARACTERIZATIONS OF HARDY SPACES ASSOCIATED WITH BOTH NON-NEGATIVE SELF-ADJOINT OPERATORS SATISFYING GAUSSIAN ESTIMATES AND BALL QUASI-BANACH FUNCTION SPACES

Assume that L is a non-negative self-adjoint operator on L^(2)(ℝ^(n))with its heat kernels satisfying the so-called Gaussian upper bound estimate and that X is a ball quasi-Banach function space onℝ^(n) satisfying some mild assumptions.Let HX,L(ℝ^(n))be the Hardy space associated with both X and L,which is defined by the Lusin area function related to the semigroup generated by L.In this article,the authors establish various maximal function characterizations of the Hardy space HX,L(ℝ^(n))and then apply these characterizations to obtain the solvability of the related Cauchy problem.These results have a wide range of generality and,in particular,the specific spaces X to which these results can be applied include the weighted space,the variable space,the mixed-norm space,the Orlicz space,the Orlicz-slice space,and the Morrey space.Moreover,the obtained maximal function characterizations of the mixed-norm Hardy space,the Orlicz-slice Hardy space,and the Morrey-Hardy space associated with L are completely new.

Screening for Anti-tumor Activity of Fractions from Buddleja officinalis Maxim

[Objectives]The anti-tumor activity of fractions from Buddleja officinalis Maxim.by petroleum ether,ethyl acetate,n-butanol and water solvent was studied.[Methods]The ethanol extract from B.officinalis Maxim.was extracted and then concentrated with petroleum ether,ethyl acetate,n-butanol and water,respectively,and the extracts were obtained.The inhibitory effects of the four different fractions on the growth of three tumor cell lines in vitro were detected by CCK-8 method,and the median inhibitory concentration(IC 50 value)was calculated.[Results]The four fractions inhibited the growth of the three tumor cell lines in vitro,among which the n-butanol fraction had the best anti-tumor activity.The IC 50 values of the n-butanol fraction on human gastric cancer(SGC-7901),human breast cancer(MCF-7)and human liver cancer(BEL-7404)cell lines were 0.08,1.58 and 0.12 mg/mL,respectively.[Conclusions]Petroleum ether,ethyl acetate,n-butanol and water fractions from the ethanol extract of B.officinalis Maxim.had certain anti-tumor effects,and the n-butanol fraction had the best anti-tumor activity.

Exploring the molecular mechanism of Epimedium brevicornu Maxim.in treating breast cancer via network pharmacology and in vitro experiments

Objective:To evaluate the therapeutic effects of Epimedium brevicornu Maxim.(EBM,Yin Yang Huo)on breast cancer using network pharmacology and in vitro validation.It also aimed to explore the novel targets and mechanisms of EBM in the treatment of breast cancer to facilitate the discovery of new drugs and their clinical application.Methods: Network pharmacology was used to identify and screen the components and targets of EBM for breast cancer treatment.Molecular docking was further screened the effective components and targets of EBM.Wound-healing assays and flow cytometry analysis were used to detect the ability of two compounds to intervene in the migration and apoptosis of MDA-MB-231 cells,and their mechanism of action was further explored using western blotting experiments.Results: EBM contained 19 active components.Among them wereβ-anhydroicaritin(Anhy)and isoliquiritigenin(Iso),which were selected for in vitro experiments.Treatment resulted in a dose-dependent suppression of MDA-MB-231 cell viability,with an IC_(50) of 23.73μmol/L for Iso and 21.28μmol/L for Anhy.In the wound healing assay,cells in Anhy and Iso groups exhibited considerable inhibition of migration at 48 h.In flow cytometry analysis,treatment with Iso(20μmol/L)for 96 h resulted in significantly higher levels of both early and late apoptosis in the Iso group than that in the control group(P=.004 and P=.014,respectively).Additionally,both Iso(20μmol/L)and Anhy(10 and 20μmol/L)induced cell necrosis at 96 h.Western blotting revealed that Anhy and Iso increased the expression of Bax and TBK1/NAK.Conclusion: These findings suggested that Anhy and Iso,the two components of EBM,inhibit MDA-MB-231 cell proliferation and migration of and induce their apoptosis,providing substantial support for future studies on breast cancer.

Determination of Total Flavonoids in Acanthopanax senticosus(Rupr. et Maxim.) Harms by Enzymolysis and Its Technological Optimization

In order to optimize the ultrasonic extraction technique for the total flavonoid of leaf yellows plus, the contents of 21 leaf yellows plus total flavonoid from four regions in Heilongjiang Province were comparatively analyzed. The ultrasonic extraction technology was optimized by Box-Behnken response surface method, and the total flavonoid content of 21 kinds of Acanthopanax senticosus(Rupr. et Maxim.) Harms from different producing areas were analyzed by cluster analysis. The optimal process conditions were determined as ultrasonic time 30 min, solid-liquid ratio 1 : 12 and ultrasonic power 250 W, and the average yield of the total flavonoid was 1.453 mg·g^ (-1). By optimizing the ultrasonic-assisted extraction method, the total flavonoid content from different producing areas was compared in the experiment, which provided certain data support for the optimization of the extraction process in the future and laid a certain theoretical foundation for the quality analysis of Chinese medicinal materials.

Guinea Pig Maximization Test for Trichloroethylene and Its Metabolites

Objectives To study the contact allergenic activities of trichloroethylene (TCE) and its three metabolites trichloroacetic acid, trichloroethanol and chloral hydrate. Methods A modified guinea pig maximization test (GPMT) was adopted. The skin sensitization (edema and erythema) was observed in trichloroethylene, trichloroacetic acid, trichloroethanol, chloral hydrate and 2,4-dinitrochlorobenzene. Results The allergenic rate of TCE, trichloroacetic acid and 2,4-dinitrochlorobenzene was 71.4%, 58.3% and 100.0% respectively, and that of trichloroethanol and chloral hydrate was 0%. The mean response score of TCE, trichloroacetic acid and 2,4-dinitrochlorobenzene was 2.3, 1.1, 6.0 respectively. The histopathological analysis also showed an induction of allergenic transfomation in guinea pig skin by both TCE and trichloroacetic acid. Conclusion TCE appears to be a strong allergen while trichloroacetic acid a moderate one. On the other hand, both trichloroethanol and chloral hydrate are weak sensitization potentials. Immunologic reaction induced by TCE might be postulated as the pathological process of this illness. Consequently, it is suggested that in the mechanism of Occupational Dermatitis Medicamentose-Like (ODML) induced by TCE, the chemical itself might be the main cause of allergy. As one of its metabolic products, trichloroacetic acid might be a subordinate factor.