1,358 research outputs found
Spatiotemporal patterns and predictability of cyberattacks
A relatively unexplored issue in cybersecurity science and engineering is
whether there exist intrinsic patterns of cyberattacks. Conventional wisdom
favors absence of such patterns due to the overwhelming complexity of the
modern cyberspace. Surprisingly, through a detailed analysis of an extensive
data set that records the time-dependent frequencies of attacks over a
relatively wide range of consecutive IP addresses, we successfully uncover
intrinsic spatiotemporal patterns underlying cyberattacks, where the term
"spatio" refers to the IP address space. In particular, we focus on analyzing
{\em macroscopic} properties of the attack traffic flows and identify two main
patterns with distinct spatiotemporal characteristics: deterministic and
stochastic. Strikingly, there are very few sets of major attackers committing
almost all the attacks, since their attack "fingerprints" and target selection
scheme can be unequivocally identified according to the very limited number of
unique spatiotemporal characteristics, each of which only exists on a
consecutive IP region and differs significantly from the others. We utilize a
number of quantitative measures, including the flux-fluctuation law, the Markov
state transition probability matrix, and predictability measures, to
characterize the attack patterns in a comprehensive manner. A general finding
is that the attack patterns possess high degrees of predictability, potentially
paving the way to anticipating and, consequently, mitigating or even preventing
large-scale cyberattacks using macroscopic approaches
Zeroth-Order Alternating Gradient Descent Ascent Algorithms for a Class of Nonconvex-Nonconcave Minimax Problems
In this paper, we consider a class of nonconvex-nonconcave minimax problems,
i.e., NC-PL minimax problems, whose objective functions satisfy the
Polyak-\Lojasiewicz (PL) condition with respect to the inner variable. We
propose a zeroth-order alternating gradient descent ascent (ZO-AGDA) algorithm
and a zeroth-order variance reduced alternating gradient descent ascent
(ZO-VRAGDA) algorithm for solving NC-PL minimax problem under the deterministic
and the stochastic setting, respectively. The number of iterations to obtain an
-stationary point of ZO-AGDA and ZO-VRAGDA algorithm for solving
NC-PL minimax problem is upper bounded by and
, respectively. To the best of our knowledge,
they are the first two zeroth-order algorithms with the iteration complexity
gurantee for solving NC-PL minimax problems
Primal Dual Alternating Proximal Gradient Algorithms for Nonsmooth Nonconvex Minimax Problems with Coupled Linear Constraints
Nonconvex minimax problems have attracted wide attention in machine learning,
signal processing and many other fields in recent years. In this paper, we
propose a primal dual alternating proximal gradient (PDAPG) algorithm and a
primal dual proximal gradient (PDPG-L) algorithm for solving nonsmooth
nonconvex-strongly concave and nonconvex-linear minimax problems with coupled
linear constraints, respectively. The corresponding iteration complexity of the
two algorithms are proved to be
and to reach an
-stationary point, respectively. To our knowledge, they are the
first two algorithms with iteration complexity guarantee for solving the two
classes of minimax problems
Dynamical signature of fractionalization at a deconfined quantum critical point
Deconfined quantum critical points govern continuous quantum phase transitions at which fractionalized (deconfined) degrees of freedom emerge. Here we study dynamical signatures of the fractionalized excitations in a quantum magnet (the easy-plane J-Q model) that realize a deconfined quantum critical point with emergent O(4) symmetry. By means of large-scale quantum Monte Carlo simulations and stochastic analytic continuation of imaginary-time correlation functions, we obtain the dynamic spin-structure factors in the
S
x
and
S
z
channels. In both channels, we observe broad continua that originate from the deconfined excitations. We further identify several distinct spectral features of the deconfined quantum critical point, including the lower edge of the continuum and its form factor on moving through the Brillouin zone. We provide field-theoretical and lattice model calculations that explain the overall shapes of the computed spectra, which highlight the importance of interactions and gauge fluctuations to explain the spectral-weight distribution. We make further comparisons with the conventional Landau O(2) transition in a different quantum magnet, at which no signatures of fractionalization are observed. The distinctive spectral signatures of the deconfined quantum critical point suggest the feasibility of its experimental detection in neutron scattering and nuclear magnetic resonance experiments.First author draf
Functional maturation of immature β cells: A roadblock for stem cell therapy for type 1 diabetes
Type 1 diabetes mellitus (T1DM) is a chronic autoimmune disease caused by the specific destruction of pancreatic islet β cells and is characterized as the absolute insufficiency of insulin secretion. Current insulin replacement therapy supplies insulin in a non-physiological way and is associated with devastating complications. Experimental islet transplantation therapy has been proven to restore glucose homeostasis in people with severe T1DM. However, it is restricted by many factors such as severe shortage of donor sources, progressive loss of donor cells, high cost, etc. As pluripotent stem cells have the potential to give rise to all cells including islet β cells in the body, stem cell therapy for diabetes has attracted great attention in the academic community and the general public. Transplantation of islet β-like cells differentiated from human pluripotent stem cells (hPSCs) has the potential to be an excellent alternative to islet transplantation. In stem cell therapy, obtaining β cells with complete insulin secretion in vitro is crucial. However, after much research, it has been found that the β-like cells obtained by in vitro differentiation still have many defects, including lack of adult-type glucose stimulated insulin secretion, and multi-hormonal secretion, suggesting that in vitro culture does not allows for obtaining fully mature β-like cells for transplantation. A large number of studies have found that many transcription factors play important roles in the process of transforming immature to mature human islet β cells. Furthermore, PDX1, NKX6.1, SOX9, NGN3, PAX4, etc., are important in inducing hPSC differentiation in vitro. The absent or deficient expression of any of these key factors may lead to the islet development defect in vivo and the failure of stem cells to differentiate into genuine functional β-like cells in vitro. This article reviews β cell maturation in vivo and in vitro and the vital roles of key molecules in this process, in order to explore the current problems in stem cell therapy for diabetes
Construction of Quantitative Transaction Strategy Based on LASSO and Neural Network
Since the establishment of the securities market, there has been a continuous search for the prediction of stock price trend. Based on the forecasting characteristics of stock index futures, this paper combines the variable selection in the statistical field and the machine learning to construct an effective quantitative trading strategy. Firstly, the LASSO algorithm is used to filter a large number of technical indexes to obtain reasonable and effective technical indicators. Then, the indicators are used as input variables, and the average expected return rate is predicted by neural network. Finally, based on the forecasting results, a reasonable quantitative trading strategy is constructed. We take the CSI 300 stock index futures trading data for empirical research. The results show that the variables selected by LASSO are effective and the introduction of LASSO can improve the generalization ability of neural network. At the same time, the quantitative trading strategy based on LASSO algorithm and neural network can achieve good effect and robustness at different times
Engineered Production of Fungal Anticancer Cyclooligomer Depsipeptides in Saccharo-Myces Cerevisiae
Two fungal cyclooligomer depsipeptide synthetases (CODSs), BbBEAS (352 kDa) and BbBSLS (348 kDa) from Beauveria bassiana ATCC 7159, were reconstituted in Saccharomyces cerevisiae BJ5464-NpgA, leading to the production of the corresponding anticancer natural products, beauvericins and bassianolide, respectively. The titers of beauvericins (33.82±1.41 mg/l) and bassianolide (21.74±0.08 mg/l) in the engineered S. cerevisiae BJ5464-NpgA strains were comparable to those in the native producer B. bassiana. Feeding D-hydroxyisovaleric acid (D-Hiv) and the corresponding L-amino acid precursors improved the production of beauvericins and bassianolide. However, the high price of D-Hiv limits its application in large-scale production of these cyclooligomer depsipeptides. Alternatively, we engineered another enzyme, ketoisovalerate reductase (KIVR) from B. bassiana, into S. cerevisiae BJ5464-NpgA for enhanced in situ synthesis of this expensive substrate. Co-expression of BbBEAS and KIVR in the yeast led to significant improvement of the production of beauvericins. The total titer of beauvericin and its congeners (beauvericins A, B and C) was increased to 61.73±2.96 mg/l and reached 2.6-fold of that in the native producer B. bassiana ATCC 7159. Supplement of L-Val at 10 mM improved the supply of ketoisovalerate, the substrate of KIVR, which consequently further increased the total titer of beauvericins to 105.76±2.12 mg/l. Using this yeast system, we functionally characterized an unknown CODS from Fusarium venenatum NRRL 26139 as a beauvericin synthetase, which was named as FvBEAS. Our work thus provides a useful approach for functional reconstitution and engineering of fungal CODSs for efficient production of this family of anticancer molecules
- …