arXiv subjects

Fei Li

Publications and source records attributed to Fei Li.

At least 253 records · Page 14Linked to original sources

arXiv2018

Understanding Service Integration of Online Social Networks: A Data-Driven Study

The cross-site linking function is widely adopted by online social networks (OSNs). This function allows a user to link her account on one OSN to her accounts on other OSNs. Thus, users are able to sign in with the linked accounts, share contents among these accounts and import friends from them. It leads to the service integration of different OSNs. This integration not only provides convenience for users to manage accounts of different OSNs, but also introduces usefulness to OSNs that adopt the cross-site linking function. In this paper, we investigate this usefulness based on users' data collected from a popular OSN called Medium. We conduct a thorough analysis on its social graph, and find that the service integration brought by the cross-site linking function is able to change Medium's social graph structure and attract a large number of new users. However, almost none of the new users would become high PageRank users (PageRank is used to measure a user's influence in an OSN). To solve this problem, we build a machine-learning-based model to predict high PageRank users in Medium based on their Twitter data only. This model achieves a high F1-score of 0.942 and a high area under the curve (AUC) of 0.986. Based on it, we design a system to assist new OSNs to identify and attract high PageRank users from other well-established OSNs through the cross-site linking function.

cs.SI↗

arXiv2017

Relativistic, single-cycle tunable-infrared pulses generated by a tailored plasma density structure

The availability of intense, ultrashort coherent radiation sources in the infrared region of the spectrum is enabling the generation of attosecond X-ray pulses via high harmonic generation, pump-probe experiments in the "molecular fingerprint" region and opening up the area of relativistic-infrared nonlinear optics of plasmas. These applications would benefit from multi-millijoule single-cycle pulses in the mid to long wavelength infrared (LW-IR) region. Here we present a new scheme capable of producing tunable relativistically intense, single-cycle infrared pulses from 5-14$μ$m with a 1.7% conversion efficiency based on a photon frequency downshifting scheme that uses a tailored plasma density structure. The carrier-envelope phase (CEP) of the LW-IR pulse is locked to that of the drive laser to within a few percent. Such a versatile tunable IR source may meet the demands of many cutting-edge applications in strong-field physics and greatly promote their development.

physics.plasm-ph↗

arXiv2017

A biofilm and organomineralisation model for the growth and limiting size of ooids

Ooids are typically spherical sediment grains characterised by concentric layers encapsulating a core. There is no universally accepted explanation for ooid genesis, though factors such as agitation, abiotic and/or microbial mineralisation and size limitation have been variously invoked. We develop a mathematical model for ooid growth, inspired by work on avascular brain tumours, that assumes mineralisation in a biofilm to form a central core and concentric growth of laminations. The model predicts a limiting size with the sequential width variation of growth rings comparing favourably with those observed in experimentally grown ooids generated from biomicrospheres. In reality, this model pattern may be complicated during growth by syngenetic aggrading neomorphism of the unstable mineral phase, followed by diagenetic recrystallisation that further complicates the structure. Our model provides a potential key to understanding the genetic archive preserved in the internal structures of naturally occurring ooids.

physics.geo-ph↗

arXiv2017

Modulation of Solar Wind Energy Flux Input on Global Tropical Cyclone Activity

Studies on Sun-climate connection have been carried out for several decades, and almost all of them focused on the effects of solar total irradiation energy. As the second major terrestrial energy source from outer space, the solar wind energy flux exhibits more significant long-term variations. However, its link to the global climate change is rarely concerned and remain a mystery. As a fundamental and important aspect of the Earth's weather and climate system, tropical cyclone activity has been causing more and more attentions. Here we investigate the possible modulation of the total energy flux input from the solar wind into the Earth's magnetosphere on the global tropical cyclone activity during 1963--2012. From a global perspective, the accumulated cyclone energy increases gradually since 1963 and start to decrease after 1994. Compare to the previously frequently used parameters, e,g., the sunspot number, the total solar irradiation, the solar F10.7 irradiation, the tropical sea surface temperature, and the south oscillation index, the total solar wind energy flux input exhibits a better correlation with the global tropical cyclone activity. Furthermore, the tropical cyclones seem to be more intense with higher geomagnetic activities. A plausible modulation mechanism is thus proposed to link the terrestrial weather phenomenon to the seemly-unrelated solar wind energy input.

physics.space-ph↗

arXiv2017

Weight hierarchy of a class of linear codes relating to non-degenerate quadratic forms

In this paper, we discuss the generalized Hamming weights of a class of linear codes associated with non-degenerate quadratic forms. In order to do so, we study the quadratic forms over subspaces of finite field and obtain some interesting results about subspaces and their dual spaces. On this basis, we solve all the generalized Hamming weights of these linear codes.

cs.IT↗

arXiv2017

A class of cyclotomic linear codes and their generalized Hamming weights

Firstly, we give a formula on the generalized Hamming weight of linear codes constructed generically by defining sets. Secondly, by choosing properly the defining set we obtain a class of cyclotomic linear codes and then present two alternative formulas to calculate their generalized Hamming weights. Lastly, we determine their weight distribution and generalized Hamming weights partially. Especially, we solved the generalized Hamming weights completely in one case.

cs.IT↗

arXiv2017

An Accurate Interconnect Test Structure for Parasitic Validation in On-Chip Machine Learning Accelerators

For nanotechnology nodes, the feature size is shrunk rapidly, the wire becomes narrow and thin, it leads to high RC parasitic, especially for resistance. The overall system performance are dominated by interconnect rather than device. As such, it is imperative to accurately measure and model interconnect parasitic in order to predict interconnect performance on silicon. Despite many test structures developed in the past to characterize device models and layout effects, only few of them are available for interconnects. Nevertheless, they are either not suitable for real chip implementation or too complicated to be embedded. A compact yet comprehensive test structure to capture all interconnect parasitic in a real chip is needed. To address this problem, this paper describes a set of test structures that can be used to study the timing performance (i.e. propagation delay and crosstalk) of various interconnect configurations. Moreover, an empirical model is developed to estimate the actual RC parasitic. Compared with the state-of-the-art interconnect test structures, the new structure is compact in size and can be easily embedded on die as a parasitic variation monitor. We have validated the proposed structure on a test chip in TSMC 28nm HPM process. Recently, the test structure is further modified to identify the serious interconnect process issues for critical path design using TSMC 7nm FF process.

cs.ET↗

arXiv2016

Millimeter Spectral Line Mapping Observations Toward Four Massive Star Forming HII Regions

We present spectral line mapping observations toward four massive star-forming regions (Cepheus A, DR21S, S76E and G34.26+0.15), with the IRAM 30 meter telescope at 2 mm and 3 mm bands. Totally 396 spectral lines from 51 molecules, one helium recombination line, ten hydrogen recombination lines, and 16 unidentified lines were detected in these four sources. An emission line of nitrosyl cyanide (ONCN, 14$_{0,14}$-13$_{0,13}$) was detected in G34.26+0.15, as first detection in massive star-forming regions. We found that the $c$-C$_{3}$H$_{2}$ and NH$_{2}$D show enhancement in shocked regions as suggested by evidences of SiO and/or SO emission. Column density and rotational temperature of CH$_{3}$CN were estimated with the rotational diagram method for all four sources. Isotope abundance ratios of $^{12}$C/$^{13}$C were derived using HC$_{3}$N and its $^{13}$C isotopologue, which were around 40 in all four massive star-forming regions and slightly lower than the local interstellar value ($\sim$65). $^{14}$N/$^{15}$N and $^{16}$O/$^{18}$O abundance ratios in these sources were also derived using double isotopic method, which were slightly lower than that in local interstellar medium. Except for Cep A, $^{33}$S/$^{34}$S ratio in the other three targets were derived, which were similar to that in the local interstellar medium. The column density ratios of N(DCN)/N(HCN) and N(DCO$^{+}$)/N(HCO$^{+}$) in these sources were more than two orders of magnitude higher than the elemental [D]/[H] ratio, which is 1.5$\times$10$ ^{-5}$. Our results show the later stage sources, G34.26+0.15 in particular, present more molecular species than earlier stage ones. Evidence of shock activity is seen in all stages studied.

astro-ph.GA↗

arXiv2016

A Bi-LSTM-RNN Model for Relation Classification Using Low-Cost Sequence Features

Relation classification is associated with many potential applications in the artificial intelligence area. Recent approaches usually leverage neural networks based on structure features such as syntactic or dependency features to solve this problem. However, high-cost structure features make such approaches inconvenient to be directly used. In addition, structure features are probably domain-dependent. Therefore, this paper proposes a bi-directional long-short-term-memory recurrent-neural-network (Bi-LSTM-RNN) model based on low-cost sequence features to address relation classification. This model divides a sentence or text segment into five parts, namely two target entities and their three contexts. It learns the representations of entities and their contexts, and uses them to classify relations. We evaluate our model on two standard benchmark datasets in different domains, namely SemEval-2010 Task 8 and BioNLP-ST 2016 Task BB3. In the former dataset, our model achieves comparable performance compared with other models using sequence features. In the latter dataset, our model obtains the third best results compared with other models in the official evaluation. Moreover, we find that the context between two target entities plays the most important role in relation classification. Furthermore, statistic experiments show that the context between two target entities can be used as an approximate replacement of the shortest dependency path when dependency parsing is not used.

cs.CL↗

arXiv2016

A family of linear codes with three weights

Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three weights.

cs.IT↗

arXiv2016

Online Packet Scheduling with Bounded Delay and Lookahead

We study the online bounded-delay packet scheduling problem (BDPS), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each packet has two attributes: a non-negative weight and a deadline for its transmission. The objective is to maximize the total weight of the transmitted packets. This problem has been well studied in the literature, yet its optimal competitive ratio remains unknown: the best upper bound is $1.828$, still quite far from the best lower bound of $ϕ\approx 1.618$. In the variant of BDPS with $s$-bounded instances, each packet can be scheduled in at most $s$ consecutive slots, starting at its release time. The lower bound of $ϕ$ applies even to the special case of $2$-bounded instances, and a $ϕ$-competitive algorithm for $3$-bounded instances was given in Chin et al. Improving that result, and addressing a question posed by Goldwasser, we present a $ϕ$-competitive algorithm for $4$-bounded instances. We also study a variant of BDPS where an online algorithm has the additional power of $1$-lookahead, knowing at time $t$ which packets will arrive at time $t+1$. For BDPS with $1$-lookahead restricted to $2$-bounded instances, we present an online algorithm with competitive ratio $(\sqrt{13} - 1)/2 \approx 1.303$ and we prove a nearly tight lower bound of $(1 + \sqrt{17})/4 \approx 1.281$.

cs.DS↗

arXiv2016

Linear complexity of generalized cyclotomic sequences of order 4 over F_l

Generalized cyclotomic sequences of period pq have several desirable randomness properties if the two primes p and q are chosen properly. In particular,Ding deduced the exact formulas for the autocorrelation and the linear complexity of these sequences of order 2. In this paper, we consider the generalized sequences of order 4. Under certain conditions, the linear complexity of these sequences of order 4 is developed over a finite field F_l. Results show that in many cases they have high linear complexity.

cs.IT↗

arXiv2016

Controlling the Numerical Cerenkov Instability in PIC simulations using a customized finite difference Maxwell solver and a local FFT based current correction

In this paper we present a customized finite-difference-time-domain (FDTD) Maxwell solver for the particle-in-cell (PIC) algorithm. The solver is customized to effectively eliminate the numerical Cerenkov instability (NCI) which arises when a plasma (neutral or non-neutral) relativistically drifts on a grid when using the PIC algorithm. We control the EM dispersion curve in the direction of the plasma drift of a FDTD Maxwell solver by using a customized higher order finite difference operator for the spatial derivative along the direction of the drift ($\hat 1$ direction). We show that this eliminates the main NCI modes with moderate $\vert k_1 \vert$, while keeps additional main NCI modes well outside the range of physical interest with higher $\vert k_1 \vert$. These main NCI modes can be easily filtered out along with first spatial aliasing NCI modes which are also at the edge of the fundamental Brillouin zone. The customized solver has the possible advantage of improved parallel scalability because it can be easily partitioned along $\hat 1$ which typically has many more cells than other directions for the problems of interest. We show that FFTs can be performed locally to current on each partition to filter out the main and first spatial aliasing NCI modes, and to correct the current so that it satisfies the continuity equation for the customized spatial derivative. This ensures that Gauss' Law is satisfied. We present simulation examples of one relativistically drifting plasmas, of two colliding relativistically drifting plasmas, and of nonlinear laser wakefield acceleration (LWFA) in a Lorentz boosted frame that show no evidence of the NCI can be observed when using this customized Maxwell solver together with its NCI elimination scheme.

physics.comp-ph↗

arXiv2016

Binary linear codes with at most 4 weights

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight distribution is determined. Results show that they are at most 4-weight linear codes. Additionally, these codes can be used in secret sharing schemes.

cs.IT↗

arXiv2015

A Class of Linear Codes With Three Weights

Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp are constructed. The weight distributions of the linear codes are settled. These codes have applications in authentication codes, association schemes and data storage systems.

cs.IT↗

arXiv2015

Complete weight enumerators of two classes of linear codes

Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set. Results show that the codes are at almost seven-weight linear codes and they may have applications in secret sharing schemes.

cs.IT↗

arXiv2015

A class of three-weight and five-weight linear codes

Recently, linear codes with few weights have been widely studied, since they have applications in data storage systems, communication systems and consumer electronics. In this paper, we present a class of three-weight and five-weight linear codes over Fp, where p is an odd prime and Fp denotes a finite field with p elements. The weight distributions of the linear codes constructed in this paper are also settled. Moreover, the linear codes illustrated in the paper may have applications in secret sharing schemes.

cs.IT↗

arXiv2015

Randomization Improving Online Time-Sensitive Revenue Maximization for Green Data Centers

Green data centers have become more and more popular recently due to their sustainability. The resource management module within a green data center, which is in charge of dispatching jobs and scheduling energy, becomes especially critical as it directly affects a center's profit and sustainability. The thrust of managing a green data center's machine and energy resources lies at the uncertainty of incoming job requests and future showing-up green energy supplies. Thus, the decision of scheduling resources has to be made in an online manner. Some heuristic deterministic online algorithms have been proposed in recent literature. In this paper, we consider online algorithms for green data centers and introduce a randomized solution with the objective of maximizing net profit. Competitive analysis is employed to measure online algorithms' theoretical performance. Our algorithm is theoretical-sound and it outperforms the previously known deterministic algorithms in many settings using real traces. To complement our study, optimal offline algorithms are also designed.

cs.DC↗