37 results on '"Niu, Xinxin"'
Search Results
2. Macrocycle-on-COF photocatalyst constructed by in-situ linker exchange for efficient photocatalytic CO2 cycloaddition
- Author
-
Li, Xiaojuan, Niu, Xinxin, Fu, Peng, Song, Yaru, Zhang, Enbing, Dang, Yanfeng, Yan, Jing, Feng, Guangyuan, Lei, Shengbin, and Hu, Wenping
- Published
- 2024
- Full Text
- View/download PDF
3. End-organ damage from neonatal invasive fungal infection: a 14-year retrospective study from a tertiary center in China
- Author
-
Han, Tao, Qiu, Meng, Niu, Xinxin, wang, Shumei, Wang, Feng, Cao, Jingke, Tang, Shanghong, Cheng, Liping, Mei, Yabo, Liang, Huayu, Feng, Zhichun, Chen, Geyu, and Li, Qiuping
- Published
- 2024
- Full Text
- View/download PDF
4. Tailoring oxygenated groups of monolithic cobalt-nitrogen-carbon frameworks for highly efficient hydrogen peroxide production in acidic media
- Author
-
Liu, Wenxian, Feng, Jinxiu, Yin, Ruilian, Ni, Yifeng, Zheng, Dong, Que, Wenbin, Niu, Xinxin, Dai, Xiaojing, Shi, Wenhui, Wu, Fangfang, Yang, Jintao, and Cao, Xiehong
- Published
- 2022
- Full Text
- View/download PDF
5. Structural advantages and enhancement strategies of heterostructure water-splitting electrocatalysts
- Author
-
Zheng, Dong, Yu, Linhai, Liu, Wenxian, Dai, Xiaojing, Niu, Xinxin, Fu, Wangqin, Shi, Wenhui, Wu, Fangfang, and Cao, Xiehong
- Published
- 2021
- Full Text
- View/download PDF
6. A genre trust model for defending shilling attacks in recommender systems
- Author
-
Yang, Li and Niu, Xinxin
- Published
- 2021
- Full Text
- View/download PDF
7. A Wide‐Temperature Adaptive Aqueous Zinc‐Air Battery‐Based on Cu–Co Dual Metal–Nitrogen‐Carbon/Nanoparticle Electrocatalysts.
- Author
-
Feng, Jinxiu, Zheng, Dong, Yin, Ruilian, Niu, Xinxin, Xu, Xilian, Meng, Shibo, Ma, Suli, Shi, Wenhui, Wu, Fangfang, Liu, Wenxian, and Cao, Xiehong
- Published
- 2023
- Full Text
- View/download PDF
8. Comparative Pathogenicity of Three Strains of Infectious Bursal Disease Virus Closely Related to Poultry Industry.
- Author
-
Li, Kailin, Niu, Xinxin, Jiang, Nan, Zhang, Wenying, Wang, Guodong, Li, Kai, Huang, Mengmeng, Gao, Yulong, Qi, Xiaole, and Wang, Xiaomei
- Subjects
- *
POULTRY industry , *B cells , *PATHOGENIC viruses , *POULTRY farms , *CHICKEN diseases - Abstract
Infectious bursal disease (IBD) is an acute, highly contagious, immunosuppressive, and fatal infectious disease of young chickens caused by infectious bursal disease virus (IBDV). Since 2017, a new trend has been discovered in the IBDV epidemic, with very virulent IBDV (vvIBDV) and novel variant IBDV (nVarIBDV) becoming the two current dominant strains in East Asia including China. In this study, we compared the biological characteristics of the vvIBDV (HLJ0504 strain), nVarIBDV (SHG19 strain), and attenuated IBDV (attIBDV, Gt strain) using specific-pathogen-free (SPF) chicken infection model. The results showed that vvIBDV distributed in multiple tissues, replicated the fastest in lymphoid organs such as bursa of Fabricius, induced significant viremia and virus excretion, and is the most pathogenic virus with a mortality of more than 80%. The nVarIBDV had a weaker replication capability and did not kill the chickens but caused severe damage to the central immune organ bursa of Fabricius and B lymphocytes and induced significant viremia and virus excretion. The attIBDV strain was found not to be pathogenic. Further studies preliminarily suggested that the expression level of inflammatory factors triggered by HLJ0504 was the highest, followed by the SHG19 group. This study is the first to systematically compare the pathogenic characteristics of three IBDVs closely related to poultry industry from the perspectives of clinical signs, micro-pathology, virus replication, and distribution. It is of great importance to obtain an extensive knowledge of epidemiology, pathogenicity, and comprehensive prevention, and control of various IBDV strains. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
9. MOF–Derived N–Doped C @ CoO/MoC Heterojunction Composite for Efficient Oxygen Reduction Reaction and Long-Life Zn–Air Battery.
- Author
-
Yin, Ruilian, Ma, Suli, Ying, Jiaping, Lu, Zhentao, Niu, Xinxin, Feng, Jinxiu, Xu, Feng, Zheng, Yifan, Liu, Wenxian, and Cao, Xiehong
- Subjects
HETEROJUNCTIONS ,DOPING agents (Chemistry) ,OXYGEN reduction ,METAL-air batteries ,OXYGEN evolution reactions ,POWER density ,STORAGE batteries - Abstract
The high activity and reliability of bifunctional oxygen catalysts are imperative for rechargeable metal–air batteries. However, the preparation of bifunctional non–noble metal electrocatalysts with multiple active sites remains a great challenge. Herein, an MOF–derived N–doped C–loaded uniformly dispersed CoO/MoC heterojunction catalyst for high–performance dual function was prepared by a simple "codeposition–pyrolysis" method. Experimental investigations revealed that the formation of the heterojunction can tailor the valence of Co and Mo sites, which impressively modulates the electronic properties of the active sites and promotes the electrocatalytic processes. The optimal catalyst reveals a high–wave half potential (E
1/2 = 0.841 V) for ORR and a low overpotential (E10 = 348 mV) for OER. The NCCM–600–based Zn–air battery displays a high peak power density of 133.36 mW cm−2 and a prolonged cycling life of more than 650 h. This work provides avenues for the development of functional materials with enhanced properties in a variety of practical energy applications. [ABSTRACT FROM AUTHOR]- Published
- 2023
- Full Text
- View/download PDF
10. A genre trust model for defending shilling attacks in recommender systems.
- Author
-
Yang, Li and Niu, Xinxin
- Subjects
TRUST ,RECOMMENDER systems ,VALUES (Ethics) - Abstract
Shilling attacks have been a significant vulnerability of collaborative filtering (CF) recommender systems, and trust in CF recommender algorithms has been proven to be helpful for improving the accuracy of system recommendations. As a few studies have been devoted to trust in this area, we explore the benefits of using trust to resist shilling attacks. Rather than simply using user-generated trust values, we propose the genre trust degree, which differ in terms of the genres of items and take both trust value and user credibility into consideration. This paper introduces different types of shilling attack methods in an attempt to study the impact of users' trust values and behavior features on defending against shilling attacks. Meanwhile, it improves the approach used to calculate user similarities to form a recommendation model based on genre trust degrees. The performance of the genre trust-based recommender system is evaluated on the Ciao dataset. Experimental results demonstrated the superior and comparable genre trust degrees recommended for defending against different types of shilling attacks. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
11. Coupling of NiFe Layered Double Hydroxides with Sulfides for Highly Efficient Urea Electrolysis and Hydrogen Evolution.
- Author
-
Liu, Wenxian, Qin, Zhengguang, Dai, Xiaojing, Meng, Shibo, Niu, Xinxin, Shi, Wenhui, Wu, Fangfang, and Cao, Xiehong
- Subjects
LAYERED double hydroxides ,ELECTROLYSIS ,UREA ,HYDROGEN evolution reactions ,SULFIDES ,HYDROXIDES - Abstract
Urea electrolysis is regarded as a prospective method for energy-saving hydrogen production. However, the practical application of this technology is limited by the lack of high-performance bifunctional catalysts for hydrogen evolution reaction (HER) and urea oxidation reaction (UOR). Herein, a heterostructure catalyst composed of NiFe layered double hydroxide (LDH) and sulfides (NiFe LDH-NiFeS
x /NF) catalysts is prepared via a simple one-step hydrothermal approach. Remarkably, the prepared NiFe LDH-NiFeSx /NF required 138 mV and 1.34 V to achieve 10 mA cm−2 for HER and UOR in 1 M KOH and 0.33 M urea, respectively. Furthermore, when NiFe LDH-NiFeSx /NF is used as a cathode for urea electrolysis, only 1.44 V is required at 10 mA cm−2 , which is much lower than the 1.53 V needed for overall water splitting. [ABSTRACT FROM AUTHOR]- Published
- 2023
- Full Text
- View/download PDF
12. Audio steganalysis in DCT domain
- Author
-
Lei, Min, Yang, Yu, Niu, Xinxin, and Luo, Shoushan
- Published
- 2010
- Full Text
- View/download PDF
13. A strong multi-designated verifiers signature scheme
- Author
-
Yang, Bo, Xiao, Zibi, Yang, Yixian, Hu, Zhengming, and Niu, Xinxin
- Published
- 2008
- Full Text
- View/download PDF
14. Gradient energy detection of LSB steganography
- Author
-
Li Zhi, Sui Aifen, Niu Xinxin, and Yang Yixian
- Published
- 2005
- Full Text
- View/download PDF
15. Adv-Emotion: The Facial Expression Adversarial Attack.
- Author
-
Sun, Yudao, Wu, Chunhua, Zheng, Kangfeng, and Niu, Xinxin
- Subjects
FACIAL expression ,ARTIFICIAL intelligence ,DEEP learning ,HUMAN-computer interaction - Abstract
Artificial intelligence is developing rapidly in the direction of intellectualization and humanization. Recent studies have shown the vulnerability of many deep learning models to adversarial examples, but there are fewer studies on adversarial examples attacking facial expression recognition systems. Human–computer interaction requires facial expression recognition, so the security demands of artificial intelligence humanization should be considered. Inspired by facial expression recognition, we want to explore the characteristics of facial expression recognition adversarial examples. In this paper, we are the first to study facial expression adversarial examples (FEAEs) and propose an adversarial attack method on facial expression recognition systems, a novel measurement method on the adversarial hardness of FEAEs, and two evaluation metrics on FEAE transferability. The experimental results illustrate that our approach is superior to other gradient-based attack methods. Finding FEAEs can attack not only facial expression recognition systems but also face recognition systems. The transferability and adversarial hardness of FEAEs can be measured effectively and accurately. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
16. Representativeness-Based Instance Selection for Intrusion Detection.
- Author
-
Zhao, Fei, Xin, Yang, Zhang, Kai, and Niu, Xinxin
- Subjects
ALGORITHMS ,STORAGE - Abstract
With the continuous development of network technology, an intrusion detection system needs to face detection efficiency and storage requirement when dealing with large data. A reasonable way of alleviating this problem is instance selection, which can reduce the storage space and improve intrusion detection efficiency by selecting representative instances. An instance is representative not only in its class but also in different classes. This representativeness reflects the importance of an instance. Since the existing instance selection algorithm does not take into account the above situations, some selected instances are redundant and some important instances are removed, increasing storage space and reducing efficiency. Therefore, a new representativeness of instance is proposed and considers not only the influence of all instances of the same class on the selected instance but also the influence of instances of different classes on the selected instance. Moreover, it considers the influence of instances of different classes as an advantageous factor. Based on this representativeness, two instance selection algorithms are proposed to handle balanced and imbalanced data problems for intrusion detection. One is a representative-based instance selection for balanced data, which is named RBIS and selects the same proportion of instances from each class. The other is a representative-based instance selection for imbalanced data, which is named RBIS-IM and selects important majority instances according to the number of instances of the minority class. Compared with other algorithms on the benchmark data sets of intrusion detection, experimental results verify the effectiveness of the proposed RBIS and RBIS-IM algorithms and demonstrate that the proposed algorithms can achieve a better balance between accuracy and reduction rate or between balanced accuracy and reduction rate. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
17. Game Theoretic Suppression of Forged Messages in Online Social Networks.
- Author
-
Wang, Xu, Zha, Xuan, Ni, Wei, Liu, Ren Ping, Guo, Y. Jay, Niu, Xinxin, and Zheng, Kangfeng
- Subjects
ONLINE social networks ,FORGING ,BEHAVIORAL assessment ,ELECTRONIC books - Abstract
Online social networks (OSNs) suffer from forged messages. Current studies have typically been focused on the detection of forged messages and do not provide the analysis of the behaviors of message publishers and network strategies to suppress forged messages. This paper carries out the analysis by taking a game theoretic approach, where infinitely repeated games are constructed to capture the interactions between a publisher and a network administrator and suppress forged messages in OSNs. Critical conditions, under which the publisher is disincentivized to publish any forged messages, are identified in the absence and presence of misclassification on genuine messages. Closed-form expressions are established for the maximum number of forged messages that a malicious publisher could publish. Confirmed by the numerical results, the proposed infinitely repeated games reveal that forged messages can be suppressed by improving the payoffs for genuine messages, increasing the cost of bots, and/or reducing the payoffs for forged messages. The increasing detection probability of forged messages or decreasing misclassification probability of genuine messages also has a strong impact on the suppression of forged messages. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
18. Development of a loop-mediated isothermal amplification assay for the detection of chicken anemia virus.
- Author
-
Han, Chunyan, Niu, Xinxin, Li, Jing, Zeng, Xiangwei, Liu, Lanlan, Li, Jiukuan, Yao, Shuai, Song, Xiuqing, Gao, Honglei, Gao, Yulong, Qi, Xiaole, Wang, Yongqiang, and Wang, Xiaomei
- Subjects
- *
ANEMIA , *POULTRY industry , *CHICKENS , *DNA , *POLYMERASE chain reaction - Abstract
Chicken anemia virus (CAV) infection has been reported in various poultry industries worldwide. Since CAV infection is becoming increasingly prevalent, especially in local chickens of China, rapid CAV detection has become essential. The conventional diagnostic methods are time consuming and need special expertise. Therefore, in this study, we developed a specific and sensitive loop-mediated isothermal amplification (LAMP) assay for CAV detection by using multiple sequence alignment of VP2. This assay was performed at 61°C for 1 h, and there was no non-specific reaction to common avian disease viruses. The detection limit was 65 copies of viral DNA; thus, this assay showed similar sensitivity to quantitative polymerase chain reaction (qPCR) but it was more sensitive than conventional PCR. Moreover, this assay was performed using clinical samples. The LAMP assay results were 83.6% correlated to the PCR results of the clinical samples, indicating that this method is an effective tool for the rapid detection of CAV. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
19. Building an Effective Intrusion Detection System Using the Modified Density Peak Clustering Algorithm and Deep Belief Networks.
- Author
-
Yang, Yanqing, Zheng, Kangfeng, Wu, Chunhua, Niu, Xinxin, and Yang, Yixian
- Subjects
INTRUSION detection systems (Computer security) ,CLOUD computing ,MACHINE learning - Abstract
Featured Application: The model proposed in this paper can be deployed to the enterprise gateway, dynamically monitor network activities, and connect with the firewall to protect the company network from attacks. It can be deployed in cloud computing environment or in software-defined networks to monitor network behavior and alerts in real time. Machine learning plays an important role in building intrusion detection systems. However, with the increase of data capacity and data dimension, the ability of shallow machine learning is becoming more limited. In this paper, we propose a fuzzy aggregation approach using the modified density peak clustering algorithm (MDPCA) and deep belief networks (DBNs). To reduce the size of the training set and the imbalance of the samples, MDPCA is used to divide the training set into several subsets with similar sets of attributes. Each subset is used to train its own sub-DBNs classifier. These sub-DBN classifiers can learn and explore high-level abstract features, automatically reduce data dimensions, and perform classification well. According to the nearest neighbor criterion, the fuzzy membership weights of each test sample in each sub-DBNs classifier are calculated. The output of all sub-DBNs classifiers is aggregated based on fuzzy membership weights. Experimental results on the NSL-KDD and UNSW-NB15 datasets show that our proposed model has higher overall accuracy, recall, precision and F1-score than other well-known classification methods. Furthermore, the proposed model achieves better performance in terms of accuracy, detection rate and false positive rate compared to the state-of-the-art intrusion detection methods. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
20. Group-Based Susceptible-Infectious-Susceptible Model in Large-Scale Directed Networks.
- Author
-
Zheng, Kangfeng, Wang, Xu, Niu, Xinxin, Liu, Ren Ping, Guo, Y. Jay, Song, Bo, and Ni, Wei
- Subjects
MARKOV processes ,EPIDEMIOLOGICAL models ,TOPOLOGY ,DIRECTORY services (Computer network technology) ,JACOBIAN matrices - Abstract
Epidemic models trade the modeling accuracy for complexity reduction. This paper proposes to group vertices in directed graphs based on connectivity and carries out epidemic spread analysis on the group basis, thereby substantially reducing the modeling complexity while preserving the modeling accuracy. A group-based continuous-time Markov SIS model is developed. The adjacency matrix of the network is also collapsed according to the grouping, to evaluate the Jacobian matrix of the group-based continuous-time Markov model. By adopting the mean-field approximation on the groups of nodes and links, the model complexity is significantly reduced as compared with previous topological epidemic models. An epidemic threshold is deduced based on the spectral radius of the collapsed adjacency matrix. The epidemic threshold is proved to be dependent on network structure and interdependent of the network scale. Simulation results validate the analytical epidemic threshold and confirm the asymptotical accuracy of the proposed epidemic model. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
21. A Privacy Measurement Framework for Multiple Online Social Networks against Social Identity Linkage.
- Author
-
Li, Xuefeng, Yang, Yixian, Chen, Yuling, and Niu, Xinxin
- Subjects
DATA privacy ,ONLINE social networks ,GROUP identity - Abstract
Recently, the number of people who are members of multiple online social networks simultaneously has increased. However, if these people share everything with others, they risk their privacy. Users may be unaware of the privacy risks involved with sharing their sensitive information on a network. Currently, there are many research efforts focused on social identity linkage (SIL) on multiple online social networks for commercial services, which exacerbates privacy issues. Many existing studies consider methods of encrypting or deleting sensitive information without considering if this is unreasonable for social networks. Meanwhile, these studies ignore privacy awareness, which is rudimentary and critical. To enhance privacy awareness, we discuss a user privacy exposure measure for users who are members of multiple online social networks. With this measure, users can be aware of the state of their privacy and their position on a privacy measurement scale. Additionally, we propose a straightforward method through our framework to reduce information loss and foster user privacy awareness by using spurious content for required fields. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
22. A Filter Feature Selection Algorithm Based on Mutual Information for Intrusion Detection.
- Author
-
Zhao, Fei, Zhao, Jiyong, Niu, Xinxin, Luo, Shoushan, and Xin, Yang
- Subjects
FEATURE selection ,INTRUSION detection systems (Computer security) ,ALGORITHMS - Abstract
For a large number of network attacks, feature selection is used to improve intrusion detection efficiency. A new mutual information algorithm of the redundant penalty between features (RPFMI) algorithm with the ability to select optimal features is proposed in this paper. Three factors are considered in this new algorithm: the redundancy between features, the impact between selected features and classes and the relationship between candidate features and classes. An experiment is conducted using the proposed algorithm for intrusion detection on the KDD Cup 99 intrusion dataset and the Kyoto 2006+ dataset. Compared with other algorithms, the proposed algorithm has a much higher accuracy rate (i.e., 99.772%) on the DOS data and can achieve better performance on remote-to-login (R2L) data and user-to-root (U2R) data. For the Kyoto 2006+ dataset, the proposed algorithm possesses the highest accuracy rate (i.e., 97.749%) among the other algorithms. The experiment results demonstrate that the proposed algorithm is a highly effective feature selection method in the intrusion detection. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
23. Image Captioning with Word Gate and Adaptive Self-Critical Learning.
- Author
-
Zhu, Xinxin, Li, Lixiang, Liu, Jing, Guo, Longteng, Fang, Zhiwei, Peng, Haipeng, and Niu, Xinxin
- Subjects
ADAPTIVE control systems ,REINFORCEMENT learning ,IMAGE processing - Abstract
Although the policy-gradient methods for reinforcement learning have shown significant improvement in image captioning, how to achieve high performance during the reinforcement optimizing process is still not a simple task. There are at least two difficulties: (1) The large size of vocabulary leads to a large action space, which makes it difficult for the model to accurately predict the current word. (2) The large variance of gradient estimation in reinforcement learning usually causes severe instabilities in the training process. In this paper, we propose two innovations to boost the performance of self-critical sequence training (SCST). First, we modify the standard long short-term memory (LSTM)based decoder by introducing a gate function to reduce the search scope of the vocabulary for any given image, which is termed the word gate decoder. Second, instead of only considering current maximum actions greedily, we propose a stabilized gradient estimation method whose gradient variance is controlled by the difference between the sampling reward from the current model and the expectation of the historical reward. We conducted extensive experiments, and results showed that our method could accelerate the training process and increase the prediction accuracy. Our method was validated on MS COCO datasets and yielded state-of-the-art performance. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
24. A Secure and Efficient Transmission Method in Connected Vehicular Cloud Computing.
- Author
-
Yang, Yixian, Niu, Xinxin, Li, Lixiang, and Peng, Haipeng
- Subjects
- *
CLOUD computing , *VEHICULAR ad hoc networks , *INTELLIGENT transportation systems , *MOBILE computing , *GAME theory , *INFORMATION theory - Abstract
Connected vehicular cloud computing (CVCC) and the VANET can realize real-time monitoring and intelligent adjustment of traffic conditions. With the data collected by vehicles and the guidance provided by cloud computing platforms, the current traffic is facing new opportunities. CVCC is a mobile computing model, which extends the fixed nodes of traditional cloud infrastructure into mobile nodes composed of vehicles. Thus, compared to the traditional cloud infrastructures, CVCC requires a more complex mechanism to ensure the secure and efficient information transmission in both cloud platform-to-vehicle communication and vehicle-to-vehicle communication. Channel capacity, as the key parameter to measure the channel utilization, plays an important role in ensuring the reliability of CVCC service and the integrity of transmission data. In recent decades, the existing calculation methods could not solve the channel capacities problem in multi-participant VANETs. Different from the traditional calculation methods, we propose a novel calculation method in this article, which combines the core concepts of game theory and information theory, to calculate the channel capacities of multiple vehicular networks. The proposed method refreshes the concept of communication, which has potential applications in different services of CVCC. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
25. Captioning Transformer with Stacked Attention Modules.
- Author
-
Zhu, Xinxin, Li, Lixiang, Liu, Jing, Peng, Haipeng, and Niu, Xinxin
- Subjects
SHORT-term memory ,IMAGE processing - Abstract
Image captioning is a challenging task. Meanwhile, it is important for the machine to understand the meaning of an image better. In recent years, the image captioning usually use the long-short-term-memory (LSTM) as the decoder to generate the sentence, and these models show excellent performance. Although the LSTM can memorize dependencies, the LSTM structure has complicated and inherently sequential across time problems. To address these issues, recent works have shown benefits of the Transformer for machine translation. Inspired by their success, we develop a Captioning Transformer (CT) model with stacked attention modules. We attempt to introduce the Transformer to the image captioning task. The CT model contains only attention modules without the dependencies of the time. It not only can memorize dependencies between the sequence but also can be trained in parallel. Moreover, we propose the multi-level supervision to make the Transformer achieve better performance. Extensive experiments are carried out on the challenging MSCOCO dataset and the proposed Captioning Transformer achieves competitive performance compared with some state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
26. Games Based Study of Nonblind Confrontation.
- Author
-
Yang, Yixian, Niu, Xinxin, and Peng, Haipeng
- Subjects
- *
CHANNEL capacity (Telecommunications) , *GAME theory , *PROBABILITY theory , *MATHEMATICAL equivalence , *MATHEMATICAL models - Abstract
Security confrontation is the second cornerstone of the General Theory of Security. And it can be divided into two categories: blind confrontation and nonblind confrontation between attackers and defenders. In this paper, we study the nonblind confrontation by some well-known games. We show the probability of winning and losing between the attackers and defenders from the perspective of channel capacity. We establish channel models and find that the attacker or the defender wining one time is equivalent to one bit transmitted successfully in the channel. This paper also gives unified solutions for all the nonblind confrontations. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
27. Evaluation of Somatosensory Evoked Potential and Pain Rating Index in a Patient with Spinal Cord Injury Accepted Cell Therapy.
- Author
-
Hua, Rongrong, Li, Ping, Wang, Xiaodong, Yang, Jing, Zheng, Pei, Niu, Xinxin, Li, Yan, and An, Yihua
- Published
- 2016
28. Noise Folding in Completely Perturbed Compressed Sensing.
- Author
-
Zhou, Limin, Niu, Xinxin, and Yuan, Jing
- Subjects
- *
NOISE measurement , *COMPRESSED sensing , *PERTURBATION theory , *MATRICES (Mathematics) , *RESTRICTED isometry property , *COMPUTER simulation - Abstract
This paper first presents a new generally perturbed compressed sensing (CS) model y=(A+E)(x+u)+e, which incorporated a general nonzero perturbation E into sensing matrix A and a noise u into signal x simultaneously based on the standard CS model y=Ax+e and is called noise folding in completely perturbed CS model. Our construction mainly will whiten the new proposed CS model and explore in restricted isometry property (RIP) and coherence of the new CS model under some conditions. Finally, we use OMP to give a numerical simulation which shows that our model is feasible although the recovered value of signal is not exact compared with original signal because of measurement noise e, signal noise u, and perturbation E involved. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
29. Identification of Coupled Map Lattice Based on Compressed Sensing.
- Author
-
Xie, Dong, Li, Lixiang, Niu, Xinxin, and Yang, Yixian
- Subjects
COUPLED map lattices ,COMPRESSED sensing ,PARAMETER identification ,COMPUTER algorithms ,LINEAR systems - Abstract
A novel approach for the parameter identification of coupled map lattice (CML) based on compressed sensing is presented in this paper. We establish a meaningful connection between these two seemingly unrelated study topics and identify the weighted parameters using the relevant recovery algorithms in compressed sensing. Specifically, we first transform the parameter identification problem of CML into the sparse recovery problem of underdetermined linear system. In fact, compressed sensing provides a feasible method to solve underdetermined linear system if the sensing matrix satisfies some suitable conditions, such as restricted isometry property (RIP) and mutual coherence. Then we give a low bound on the mutual coherence of the coefficient matrix generated by the observed values of CML and also prove that it satisfies the RIP from a theoretical point of view. If the weighted vector of each element is sparse in the CML system, our proposed approach can recover all the weighted parameters using only about M samplings, which is far less than the number of the lattice elements N. Another important and significant advantage is that if the observed data are contaminated with some types of noises, our approach is still effective. In the simulations, we mainly show the effects of coupling parameter and noise on the recovery rate. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
30. A Secure and Effective Anonymous Integrity Checking Protocol for Data Storage in Multicloud.
- Author
-
Song, Lingwei, Zhao, Dawei, Chen, Xuebing, Cao, Chenlei, and Niu, Xinxin
- Subjects
DATA warehousing ,CLOUD storage ,INFORMATION science ,INTEGRITY ,INFORMATION storage & retrieval systems - Abstract
How to verify the integrity of outsourced data is an important problem in cloud storage. Most of previous work focuses on three aspects, which are providing data dynamics, public verifiability, and privacy against verifiers with the help of a third party auditor. In this paper, we propose an identity-based data storage and integrity verification protocol on untrusted cloud. And the proposed protocol can guarantee fair results without any third verifying auditor. The theoretical analysis and simulation results show that our protocols are secure and efficient. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
31. Identification and Pathogenicity Evaluation of a Novel Reassortant Infectious Bursal Disease Virus (Genotype A2dB3).
- Author
-
Wang, Yulong, Jiang, Nan, Fan, Linjin, Niu, Xinxin, Zhang, Wenying, Huang, Mengmeng, Gao, Li, Li, Kai, Gao, Yulong, Liu, Changjun, Cui, Hongyu, Liu, Aijing, Pan, Qing, Zhang, Yanping, Wang, Xiaomei, and Qi, Xiaole
- Subjects
INFECTIOUS bursal disease virus ,GENOTYPES ,DOUBLE-stranded RNA ,POULTRY diseases ,POULTRY industry - Abstract
Infectious bursal disease virus (IBDV) is a non-enveloped, bi-segmented double-stranded RNA virus and the causative agent of a poultry immunosuppressive disease known as infectious bursal disease (IBD). The novel variant IBDV (nVarIBDV) recently posed a great threat to the development of the poultry industry. In this study, we identified a novel segment-reassortant IBDV strain, IBDV-JS19-14701 (Genotype A2dB3). Phylogenic analysis showed that Segments A and B of IBDV-JS19-14701 were derived from emerging nVarIBDV (Genotype A2dB1) and long-prevalent HLJ0504-like strains (Genotype A3B3) in China, respectively. The pathogenicity of IBDV-JS19-14701 was further evaluated via animal experiments. IBDV-JS19-14701 exhibited a similar virulence to chickens with the nVarIBDV. The identification of this reassortment event is beneficial for understanding the epidemiology of nVarIBDV and will contribute to the efficient prevention and control of IBD. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
32. Development of a Viral-Like Particle Candidate Vaccine Against Novel Variant Infectious Bursal Disease Virus.
- Author
-
Wang, Yulong, Jiang, Nan, Fan, Linjin, Gao, Li, Li, Kai, Gao, Yulong, Niu, Xinxin, Zhang, Wenying, Cui, Hongyu, Liu, Aijing, Pan, Qing, Liu, Changjun, Zhang, Yanping, Wang, Xiaomei, Qi, Xiaole, and Dimitrov, Kiril
- Subjects
INFECTIOUS bursal disease virus ,VACCINES ,VIRUS-like particles ,AMMONIUM sulfate ,ANTIBODY titer ,CHICKEN diseases - Abstract
Infectious bursal disease (IBD), an immunosuppressive disease of young chickens, is caused by infectious bursal disease virus (IBDV). Novel variant IBDV (nVarIBDV), a virus that can evade immune protection against very virulent IBDV (vvIBDV), is becoming a threat to the poultry industry. Therefore, nVarIBDV-specific vaccine is much needed for nVarIBDV control. In this study, the VP2 protein of SHG19 (a representative strain of nVarIBDV) was successfully expressed using an Escherichia coli expression system and further purified via ammonium sulfate precipitation and size-exclusion chromatography. The purified protein SHG19-VP2-466 could self-assemble into 25-nm virus-like particle (VLP). Subsequently, the immunogenicity and protective effect of the SHG19-VLP vaccine were evaluated using animal experiments, which indicated that the SHG19-VLP vaccine elicited neutralization antibodies and provided 100% protection against the nVarIBDV. Furthermore, the protective efficacy of the SHG19-VLP vaccine against the vvIBDV was evaluated. Although the SHG19-VLP vaccine induced a comparatively lower vvIBDV-specific neutralization antibody titer, it provided good protection against the lethal vvIBDV. In summary, the SHG19-VLP candidate vaccine could provide complete immune protection against the homologous nVarIBDV as well as the heterologous vvIBDV. This study is of significance to the comprehensive prevention and control of the recent atypical IBD epidemic. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
33. Research Note: A novel recombinant subgroup E isolate of the avian leukosis virus with a subgroup B-like Gp85 region in China.
- Author
-
Li, Jing, Liu, Lanlan, Niu, Xinxin, Li, Jiukuan, Kang, Zhonghui, Han, Chunyan, Gao, Yulong, Qi, Xiaole, Wang, Yongqiang, Wang, Xiaomei, and Zeng, Xiangwei
- Subjects
- *
AVIAN leukosis , *RECOMBINANT viruses , *VIRUSES - Abstract
The avian leukosis virus (ALV) strain DL00766 was isolated from a farm in China. The phylogenetic analysis showed that env had the highest homology with the E subgroup reference strain, ranging from 94.5% to 94.9%, whereas gp85 had the highest homology with the B and E subgroups, which were 89.0% to 91.3% and 91.3% to 91.8%. In addition, point mutation analysis of gp85 showed that a 400 bp long fragment in gp85 of DL00766 had the highest homology with subgroup B, ranging from 90.1% to 97.5%, and only 82.7% to 83.1% with E subgroup. These results indicate, DL00766 may be an AVL subgroup E isolate with a subgroup B-like gp85 region. This is also the first finding that the E subgroup is used as a recombinant subject, and the subgroup B provides a recombinant virus of an exogenous gene. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
34. Fuzzy–synthetic minority oversampling technique: Oversampling based on fuzzy set theory for Android malware detection in imbalanced datasets.
- Author
-
Xu, Yanping, Wu, Chunhua, Zheng, Kangfeng, Niu, Xinxin, and Yang, Yixian
- Subjects
- *
SET theory , *FUZZY sets , *MINORITIES , *CLASS size - Abstract
In previous work, imbalanced datasets composed of more benign samples (the majority class) than the malicious one (the minority class) have been widely adopted in Android malware detection. These imbalanced datasets bias learning toward the majority class, so that the minority class examples are more likely to be misclassified. To solve the problem, we propose a new oversampling method called fuzzy–synthetic minority oversampling technique, which is based on fuzzy set theory and the synthetic minority oversampling technique method. As the sample size of the majority class increases relative to that of the minority class, fuzzy–synthetic minority oversampling technique generates more synthetic examples for each minority class examples in the fuzzy region, where the minority examples have a low degree of membership to the minority class and are more likely to be misclassified. Using the new synthetic examples, the classifiers build larger decision regions that contain more minority examples, and they are no longer biased to the majority class. Compared with synthetic minority oversampling technique and Borderline–synthetic minority oversampling technique methods, fuzzy–synthetic minority oversampling technique achieves higher accuracy on both the minority class and the entire datasets. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
35. Efficient Dynamic Replicated Data Possession Checking in Distributed Cloud Storage Systems.
- Author
-
Wei, Jinxia, Liu, Jianyi, Zhang, Ru, and Niu, Xinxin
- Subjects
- *
CLOUD storage , *CLOUD computing , *DATA replication software , *DATA encryption , *DATA analysis - Abstract
More and more organizations outsource their data to remote cloud servers (RCSs). Data owners rent the cloud service providers (CSPs) infrastructure to store their unlimited resources by paying fees metered in month or gigabyte. For increasing the availability and scalability of data, the data owners store their data replicas on multiple servers across multiple data centers. Data owners should ensure that the CSPs actually store all their copies according to the service contract. In this paper, we present an efficient dynamic multicopies possession checking scheme that has the following properties: (1) the data owner uses fully homomorphic encryption (FHE) algorithm to generate multiple copies; (2) the scheme supports data block dynamic operation; (3) the scheme supports third-party auditor’s public validation. Finally, security analysis and experimental results show that our scheme can resist forgery, replacement, and replay attack and perform better than some other related scheme published recently. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
36. A Novel Identity-Based Multi-Signcryption Scheme.
- Author
-
Zhang, Jianhong, Yang, Yixian, and Niu, Xinxin
- Subjects
- *
CRYPTOGRAPHY research , *DIGITAL signatures , *PUBLIC key cryptography , *COMPUTER security research , *DATA encryption - Abstract
Message security and the sender's identity authentication for communication in the open channel is a basic and important technology of the internet. For keeping the message confidential and unforgeable, the sender can use a digital signature algorithm with his private key to sign the message, and then encrypts the signature on the message. Signcryption which was proposed by Zheng et. al in 1997 is a novel cryptographic primitive that simultaneously provides the authentication and encryption in a single logic step and at lower computational costs and communication overheads than the above sign-then-encrypt way. Since then, there are many signcryption schemes proposed. Only recently, a formal security proof model is formalized providing security proof for Zheng's signcryption in the random oracle model. In the ID-based cryptography, the complexity of the managing certificate is reduced. In this work, by combining a multisignature with an ID-based signcryption scheme, we build a security model of multi-signcryption to define confidentiality and unforgeability of the ID-based signcryption scheme and have proposed an ID-based multi-signcryption scheme based on the bilinear pairings to adapt to a multi-user setting. Given a message m, a receiver's identity IDB, and n sender's identities IDA1, IDA2, ... , IDAn, for each sender Ai, it executes the followings steps: randomly pick xi ε Zq to compute Ri = xiP and ωi = xiQIDB; send (Ri, ωi) to the other senders by a secure channel; (3)after receiving the other senders (Ri, ωi), Ai computes ω = e(Ppub, Σωj) to set c = H2(ω)≈m and R = ΣRj; compute Si = xiH4(m) + H3(R,ω)SIDAi, where SIDAi is the private key of sender Ai. Then the resulting ciphertext is (c,S,R). To unsigcrypt the ciphertext (c,S,R) in the sender list L = (IDA1, IDA2, ... , IDAn), the receiver with identity IDB can compute the following steps to recover and verify the message validity. compute ω = e(R,SIDB) and m = H2(ω)≈c, where SIDB is private key of the receiver; accept the message if and only if the following equation holds [image omitted] By security analysis, we show that our scheme satisfies the two important properties of signcryption: confidentiality and unforgeability, and is proven to have been secure in the random oracle model. The security of the scheme is closely related to the Decisional Bilinear Diffie-Hellman assumption and the computational Diffie-Hellman assumption. Finally, by analyzing the efficiency of the scheme, we show that our scheme is very efficient, and only one pairing computation is needed in the signcryption phase, three pairing operators are needed in the unsigncrytion phase, and the ciphertext size is about 420 bits. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
37. Pairing-free equality test over short ciphertexts.
- Author
-
Zhu, Huijun, Wang, Licheng, Ahmad, Haseeb, and Niu, Xinxin
- Subjects
- *
PUBLIC key cryptography , *CLOUD computing , *CLOUD storage , *QUADRATIC forms , *DATA encryption , *ECONOMICS - Abstract
The concept of public key encryption with equality test was introduced at CT-RSA 2010. It has been used in many fields, especially in cloud storage. However, the previous schemes do not provide an effective authorization mechanism. To fill this gap, Ma et al. presented a public key encryption with equality test supporting flexible authorization based on the bilinear pairings. Recently, Lin et al. presented a pairing-free scheme that employs quadratic curve to perform the equality tests, which can achieve a trade-off between computational cost and storage space. In this article, we show that the equality test can be better performed by using a straight line, rather than a quadratic curve. Moreover, we simplify the encryption algorithm, as well as reduce the ciphertext storage space. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.