374 research outputs found
Infer user interests via link structure regularization
Learning user interests from online social networks helps to better understand user behaviors and provides useful guidance to design user-centric applications. Apart from analyzing users' online content, it is also important to consider users' social connections in the social Web. Graph regularization methods have been widely used in various text mining tasks, which can leverage the graph structure information extracted from data. Previously, graph regularization methods operate under the cluster assumption that nearby nodes are more similar and nodes on the same structure (typically referred to as a cluster or a manifold) are likely to be similar. We argue that learning user interests from complex, sparse, and dynamic social networks should be based on the link structure assumption under which node similarities are evaluated based on the local link structures instead of explicit links between two nodes. We propose a regularization framework based on the relation bipartite graph, which can be constructed from any type of relations. Using Twitter as our case study, we evaluate our proposed framework from social networks built from retweet relations. Both quantitative and qualitative experiments show that our proposed method outperforms a few competitive baselines in learning user interests over a set of predefined topics. It also gives superior results compared to the baselines on retweet prediction and topical authority identification
Theoretical approach and impact of correlations on the critical packet generation rate in traffic dynamics on complex networks
Using the formalism of the biased random walk in random uncorrelated networks
with arbitrary degree distributions, we develop theoretical approach to the
critical packet generation rate in traffic based on routing strategy with local
information. We explain microscopic origins of the transition from the flow to
the jammed phase and discuss how the node neighbourhood topology affects the
transport capacity in uncorrelated and correlated networks.Comment: 6 pages, 5 figure
An effective local routing strategy on the BA network
In this paper, We propose a effective routing strategy on the basis of the
so-called nearest neighbor search strategy by introducing a preferential
delivering exponent alpha. we assume that the handling capacity of one vertex
is proportional to its degree when the degree is smaller than a cut-off value
, and is infinite otherwise. It is found that by tuning the parameter alpha,
the scale-free network capacity measured by the order parameter is considerably
enhanced compared to the normal nearest-neighbor strategy. Traffic dynamics
both near and far away from the critical generating rate R_c are discussed. We
also investigate R_c as functions of m (connectivity density), K (cutoff
value). Due to the low cost of acquiring nearest-neighbor information and the
strongly improved network capacity, our strategy may be useful and reasonable
for the protocol designing of modern communication networks.Comment: 9 pages, 5 figure
Non-Markovian dynamics in a spin star system: The failure of thermalization
In most cases, a small system weakly interacting with a thermal bath will
finally reach the thermal state with the temperature of the bath. We show that
this intuitive picture is not always true by a spin star model where non-Markov
effect predominates in the whole dynamical process. The spin star system
consists a central spin homogeneously interacting with an ensemble of identical
noninteracting spins. We find that the correlation time of the bath is
infinite, which implies that the bath has a perfect memory, and that the
dynamical evolution of the central spin must be non- Markovian. A direct
consequence is that the final state of the central spin is not the thermal
state equilibrium with the bath, but a steady state which depends on its
initial state.Comment: 8 page
Performance investigation of hybrid excited switched flux permanent magnet machines using frozen permeability method
This study investigates the electromagnetic performance of a hybrid excited switched flux permanent magnet (SFPM) machine using the frozen permeability (FP) method. The flux components due to PMs, field excitation windings and armature windings have been separated using the FP method. It has been used to separate the torque components due to the PMs and excitations, providing a powerful insight into the torque generation mechanism of hybrid excited SFPM machines. It also allows the accurate calculation of d- and q-axis inductances, which will then be used to calculate the torque, power and power factor against rotor speed to compare the relative merits of hybrid excited SFPM machines with different types of PMs (i.e. NdFeB, SmCo and Ferrite). This offers the possibility of choosing appropriate PMs for different applications (maximum torque or maximum speed). Although only one type of hybrid excited PM machine has been employed to carry out the investigations, the method used in this study can also be extended to other hybrid excited PM machines. The predicted results have been validated by tests
Direct Measurements of the Branching Fractions for and and Determinations of the Form Factors and
The absolute branching fractions for the decays and
are determined using singly
tagged sample from the data collected around 3.773 GeV with the
BES-II detector at the BEPC. In the system recoiling against the singly tagged
meson, events for and events for decays are observed. Those yield
the absolute branching fractions to be and . The
vector form factors are determined to be
and . The ratio of the two form
factors is measured to be .Comment: 6 pages, 5 figure
Measurements of J/psi Decays into 2(pi+pi-)eta and 3(pi+pi-)eta
Based on a sample of 5.8X 10^7 J/psi events taken with the BESII detector,
the branching fractions of J/psi--> 2(pi+pi-)eta and J/psi-->3(pi+pi-)eta are
measured for the first time to be (2.26+-0.08+-0.27)X10^{-3} and
(7.24+-0.96+-1.11)X10^{-4}, respectively.Comment: 11 pages, 6 figure
BESII Detector Simulation
A Monte Carlo program based on Geant3 has been developed for BESII detector
simulation. The organization of the program is outlined, and the digitization
procedure for simulating the response of various sub-detectors is described.
Comparisons with data show that the performance of the program is generally
satisfactory.Comment: 17 pages, 14 figures, uses elsart.cls, to be submitted to NIM
Search for the Lepton Flavor Violation Processes and
The lepton flavor violation processes and are
searched for using a sample of 5.8 events collected with
the BESII detector. Zero and one candidate events, consistent with the
estimated background, are observed in and
decays, respectively. Upper limits on the branching ratios are determined to be
and at the 90% confidence level (C.L.).Comment: 9 pages, 2 figure
The pole in
Using a sample of 58 million events recorded in the BESII detector,
the decay is studied. There are conspicuous
and signals. At low mass, a large
broad peak due to the is observed, and its pole position is determined
to be - MeV from the mean of six analyses.
The errors are dominated by the systematic errors.Comment: 15 pages, 6 figures, submitted to PL
- âŠ