Proactive Spectrum Monitoring for Suspicious Wireless Powered Communications in Dynamic Spectrum Sharing Networks

This paper studies the proactive spec-trum monitoring with one half-duplex spectrum moni-tor(SM)to cope with the potential suspicious wireless powered communications(SWPC)in dynamic spec-trum sharing networks.The jamming-assisted spec-trum monitoring scheme via spectrum monitoring data(SMD)transmission is proposed to maximize the sum ergodic monitoring rate at SM.In SWPC,the suspi-cious communications of each data block occupy mul-tiple independent blocks,with a block dedicated to the wireless energy transfer by the energy-constrained suspicious nodes with locations in a same cluster(symmetric scene)or randomly distributed(asymmet-ric scene)and the remaining blocks used for the in-formation transmission from suspicious transmitters(STs)to suspicious destination(SD).For the sym-metric scene,with a given number of blocks for SMD transmission,namely the jamming operation,we first reveal that SM should transmit SMD signal(jam the SD)with tolerable maximum power in the given blocks.The perceived suspicious signal power at SM could be maximized,and thus so does the correspond-ing sum ergodic monitoring rate.Then,we further reveal one fundamental trade-off in deciding the op-timal number of given blocks for SMD transmission.For the asymmetric scene,a low-complexity greedy block selection scheme is proposed to guarantee the optimal performance.Simulation results show that the jamming-assisted spectrum monitoring schemes via SMD transmission achieve much better perfor-mance than conventional passive spectrum monitor-ing,since the proposed schemes can obtain more accu-rate and effective spectrum characteristic parameters,which provide basic support for fine-grained spectrum management and a solution for spectrum security in dynamic spectrum sharing network.

Optimization on Bicycle Sharing Network

In this paper, we propose an ordinal optimization based simulation optimization algorithm to determine a target distribution of bicycles for a bicycle sharing network to minimize an expected cost. The proposed algorithm consists of two stages. The first stage is using GA （genetic algorithm） assisted by a surrogate model to select an estimated good enough subset of solutions. The second stage is to identify the best solution among the solutions obtained from stage one using optimal computing budget allocation technique. We have tested the proposed algorithm on a bicycle sharing network and compared the test results with those obtained by the GA with exact model. The test results demonstrate that the proposed algorithm can obtain a good enough solution within reasonable computing time and outperforms the comparing method.

Research on Data Tampering Prevention Method for ATC Network Based on Zero Trust

The traditional air traffic control information sharing data has weak security characteristics of personal privacy data and poor effect,which is easy to leads to the problem that the data is usurped.Starting from the application of the ATC(automatic train control)network,this paper focuses on the zero trust and zero trust access strategy and the tamper-proof method of information-sharing network data.Through the improvement of ATC’s zero trust physical layer authentication and network data distributed feature differentiation calculation,this paper reconstructs the personal privacy scope authentication structure and designs a tamper-proof method of ATC’s information sharing on the Internet.From the single management authority to the unified management of data units,the systematic algorithm improvement of shared network data tamper prevention method is realized,and RDTP(Reliable Data Transfer Protocol)is selected in the network data of information sharing resources to realize the effectiveness of tamper prevention of air traffic control data during transmission.The results show that this method can reasonably avoid the tampering of information sharing on the Internet,maintain the security factors of air traffic control information sharing on the Internet,and the Central Processing Unit(CPU)utilization rate is only 4.64%,which effectively increases the performance of air traffic control data comprehensive security protection system.

A distributed authentication and authorization scheme for in-network big data sharing

Big data has a strong demand for a network infrastructure with the capability to support data sharing and retrieval efficiently. Information-centric networking （ICN） is an emerging approach to satisfy this demand, where big data is cached ubiquitously in the network and retrieved using data names. However, existing authentication and authorization schemes rely mostly on centralized servers to provide certification and mediation services for data retrieval. This causes considerable traffic overhead for the secure distributed sharing of data. To solve this problem, we employ identity-based cryptography （IBC） to propose a Distributed Authentication and Authorization Scheme （DAAS）, where an identity-based signature （IBS） is used to achieve distributed verifications of the identities of publishers and users. Moreover, Ciphertext-Policy Attribnte-based encryption （CP-ABE） is used to enable the distributed and fine-grained authorization. DAAS consists of three phases： initialization, secure data publication, and secure data retrieval, which seamlessly integrate authentication and authorization with the in- terest/data communication paradigm in ICN. In particular, we propose trustworthy registration and Network Operator and Authority Manifest （NOAM） dissemination to provide initial secure registration and enable efficient authentication for global data retrieval. Meanwhile, Attribute Manifest （AM） distribution coupled with automatic attribute update is proposed to reduce the cost of attribute retrieval. We examine the performance of the proposed DAAS, which shows that it can achieve a lower bandwidth cost than existing schemes.

Impact of utilization of hepatitis C positive organs in liver transplant:Analysis of united network for organ sharing database

BACKGROUND The utility of hepatitis C virus(HCV)organs has increased after the Food and Drug Administration approval of direct acting anti-viral(DAA)medications for the HCV treatment.The efficacy of DAA in treating HCV is nearly 100%.AIM To analyze the United Network for Organ Sharing(UNOS)database to compare the survival rates between the hepatitis C positive donors and negative recipients and hepatitis C negative donors and recipients.METHODS We analyzed the adult patients in UNOS database who underwent deceased donor liver transplant from January 2014 to December 2017.The primary endpoint was to compare the survival rates among the four groups with different hepatitis C donor and recipient status:(Group 1)Both donor and recipient negative for HCV(Group 2)Negative donor and positive recipient for HCV(Group 3)Positive donor and negative recipient for HCV(Group 4)Both positive donor and recipient for HCV.SAS 9.4 software was used for the data analysis.Kaplan Meier log rank test was used to analyze the estimated survival rates among the four groups.RESULTS A total of 24512 patients were included:Group 1:16436,Group 2:6174,Group 3:253 and Group 4:1649.The 1-year(Group 1:91.8%,Group 2:92.12%,Group 3:87%,Group 4:92.8%),2-year(Group 1:88.4%,Group 2:88.1%,Group 3:84.3%,Group 4:87.5%),3-year(Group 1:84.9%,Group 2:84.3%,Group 3:75.9%,Group 4:83.2%)survival rates showed no statistical significance among the four groups.Kaplan Meier log rank test did not show any statistical significance difference in the estimated survival rates between Group 3 vs all the other groups.CONCLUSION The survival rates in hepatitis C positive donors and negative recipients are similar as compared to both hepatitis C negative donors and recipients.This could be due to the use of DAA therapy with cure rates of nearly 100%.This study supports the use of hepatitis C positive organs in the selected group of recipients with and without HCV infection.Further long-term studies are needed to further validate these findings.

SHARING AND PLANNING OF DISTRIBUTED EQUIPMENT FOR NETWORKED MANUFACTURING

Efficient utilization of the equipment distributed in different enterprises and optimal allocation of these resources is an important concern for networked manufacturing. The third party based equipment sharing approach is put forward to optimize the utilization of distributed equipment for networked manufacturing; Taking advantage of the shared equipment offered by equipment providers by means of lease agreement, the third party carries out production by establishing networked virtual factory. Operational mechanism of the third party based equipment sharing is discussed, and characteristics of this approach in achieving resource allocation are analyzed. Shared equipment planning is formulated as an optimization problem with the objective of maximizing profits for equipment coordinator, a mathematical model for shared equipment planning is developed. Finally a case study is discussed to show the effectiveness of the planning model.

On Measuring the Privacy of Anonymized Data in Multiparty Network Data Sharing

This paper aims to find a practical way of quantitatively representing the privacy of network data. A method of quantifying the privacy of network data anonymization based on similarity distance and entropy in the scenario involving multiparty network data sharing with Trusted Third Party (TTP) is proposed. Simulations are then conducted using network data from different sources, and show that the measurement indicators defined in this paper can adequately quantify the privacy of the network. In particular, it can indicate the effect of the auxiliary information of the adversary on privacy.

Key Technologies of 3G WCDMA Network Sharing

Based on the latest research findings of 3GPP on network sharing, this paper introduces 4 solutions to WCDMA 3G network sharing: site sharing, common network sharing, geographically split network sharing, and radio access network sharing. It also analyzes the key network sharing technologies, including the lu-Flex function in Release 5, the UTRAN sharing mechanism in the connected mode in Release 5 and the mechanism of network sharing support enhancement in Release 6.

Intelligent Spectrum Management Based on Radio Map for Cloud-Based Satellite and Terrestrial Spectrum Shared Networks

Cloud-based satellite and terrestrial spectrum shared networks(CB-STSSN)combines the triple advantages of efficient and flexible net-work management of heterogeneous cloud access(H-CRAN),vast coverage of satellite networks,and good communication quality of terrestrial networks.Thanks to the complementary coverage characteristics,any-time and anywhere high-speed communications can be achieved to meet the various needs of users.The scarcity of spectrum resources is a common prob-lem in both satellite and terrestrial networks.In or-der to improve resource utilization,the spectrum is shared not only within each component but also be-tween satellite beams and terrestrial cells,which intro-duces inter-component interferences.To this end,this paper first proposes an analytical framework which considers the inter-component interferences induced by spectrum sharing(SS).An intelligent SS scheme based on radio map(RM)consisting of LSTM-based beam prediction(BP),transfer learning-based spec-trum prediction(SP)and joint non-preemptive prior-ity and preemptive priority(J-NPAP)-based propor-tional fair spectrum allocation is than proposed.The simulation result shows that the spectrum utilization rate of CB-STSSN is improved and user blocking rate and waiting probability are decreased by the proposed scheme.

ZTE Holds 1/4 Global CDMA Network Market Share

ZTE Corporation,a leading global provider of telecommunications equipment and network solutions,announced on July 30,2009 that it has been ranked as the second largest global CDMA network supplier with 25%

Green Multicast Grooming Based on Cross-Shared Protection in Optical WDM Networks

Currently,multicast survivability in optical network obtains more attention.This paper focuses on the field of multicast grooming shared protection in green optical network and designs a novel auxiliary graph and a shared matrix to address the survivable multicast resource consumption.This paper also proposes a new heuristic called Green Multicast Grooming algorithm based on spanning path Cross-Shared protection(GMGCSP),in which network reliability,energy efficiency and resource utilization are jointly considered.Simulation results testify that,compared to other algorithms,the proposed GMG-CSP not only has lower blocking probability and higher bandwidth utilization ratio,but also saves more energy.

ZTE Gains Second Largest Share of the Global Optical Networking Market in 2011

22 August 2012 -- ZTE Corporation, a publicly listed global provider of telecommunications equipment and network solutions, announced its interim results for the six months ended 30 June 2012. Based on both HKFRS and PRC ASBE, ZTE recorded revenue of RMB 42.64 billion for the period, an increase of 15.2% year-on-year. Pre-tax profit in the period was RMB 656 million, a decrease of 48.5% year-on-year. Basic earnings per share for the period were RMB 0.07. During the reporting period,

ZTE Gains Second Largest Share of the Global Optical Networking Market in 2011

ZTE gained the second largest share of the global optical networking market of any company for the second year in a row. ZTE gained 1.8 share points on 2010. In two years, the company moved from world No. 5 to world No. 2 in the global optical network market, and its annual revenues now surpass $1.7 billion.

Inferior outcomes of liver transplantation for hepatocellular carcinoma during early-COVID-19 pandemic in the United States

BACKGROUND Early in the coronavirus disease 2019(COVID-19)pandemic,there was a significant impact on routine medical care in the United States,including in fields of transplantation and oncology.AIM To analyze the impact and outcomes of early COVID-19 pandemic on liver transplantation(LT)for hepatocellular carcinoma(HCC)in the United States.METHODS WHO declared COVID-19 as a pandemic on March 11,2020.We retrospectively analyzed data from the United Network for Organ Sharing(UNOS)database regarding adult LT with confirmed HCC on explant in 2019 and 2020.We defined pre-COVID period from March 11 to September 11,2019,and early-COVID period as from March 11 to September 11,2020.RESULTS Overall,23.5%fewer LT for HCC were performed during the COVID period(518 vs 675,P<0.05).This decrease was most pronounced in the months of March-April 2020 with a rebound in numbers seen from May-July 2020.Among LT recipients for HCC,concurrent diagnosis of non-alcoholic steatohepatitis significantly increased(23 vs 16%)and alcoholic liver disease(ALD)significantly decreased(18 vs 22%)during the COVID period.Recipient age,gender,BMI,and MELD score were statistically similar between two groups,while waiting list time decreased during the COVID period(279 days vs 300 days,P=0.041).Among pathological characteristics of HCC,vascular invasion was more prominent during COVID period(P<0.01),while other features were the same.While the donor age and other characteristics remained same,the distance between donor and recipient hospitals was significantly increased(P<0.01)and donor risk index was significantly higher(1.68 vs 1.59,P<0.01)during COVID period.Among outcomes,90-day overall and graft survival were the same,but 180-day overall and graft were significantly inferior during COVID period(94.7 vs 97.0%,P=0.048).On multivariable Coxhazard regression analysis,COVID period emerged as a significant risk factor of post-transplant mortality(Hazard ratio 1.85;95%CI:1.28-2.68,P=0.001).CONCLUSION During COVID period,there was a significant decrease in LTs performed for HCC.While early postoperative outcomes of LT for HCC were same,the overall and graft survival of LTs for HCC after 180 days were significantly inferior.

An application of small-world network on predicting the behavior of infectious disease on campus

Networks haven been widely used to understand the spread of infectious disease.This study examines the properties of small-world networks in modeling infectious disease on campus.Two different small-world models are developed and the behaviors of infectious disease in the models are observed through numerical simulations.The results show that the behavior pattern of infectious disease in a small-world network is different from those in a regular network or a random network.The spread of the infectious disease increases as the proportion of long-distance connections p increasing,which indicates that reducing the contact among people is an effective measure to control the spread of infectious disease.The probability of node position exchange in a network(p2)had no significant effect on the spreading speed,which suggests that reducing human mobility in closed environments does not help control infectious disease.However,the spreading speed is proportional to the number of shared nodes(s),which means reducing connections between different groups and dividing students into separate sections will help to control infectious disease.In the end,the simulating speed of the small-world network is tested and the quadratic relationship between simulation time and the number of nodes may limit the application of the SW network in areas with large populations.

Analysis of hepatitis C virus-positive organs in liver transplantation

The authors of this study note that in liver transplantation(LT),the survival rates of hepatitis C virus(HCV)-positive donors and HCV-negative receivers are compa-rable to those of HCV-negative donors and recipients.Direct-acting antiviral(DAA)therapies have nearly 100%effectiveness in treating HCV.Between 2006 and 2016,the percentages of HCV-positive patients on the waiting list and HCVpositive LT recipients fell by 8.2 percent and 7.6 percent,respectively.Records from April 1,2014,in which the donor and receiver were both at least 18 years old and had a positive HCV status,were the only ones eligible for the study.The analysis for this study was restricted to the first transplant recorded for each patient using a data element that documented the number of prior transplants for each recipient,although some recipients appeared multiple times in the data set.HCV-positive recipients or people with fulminant hepatic failure were the main beneficiaries of primary biliary cirrhosis among HCV-positive donors.However,there is still a reticence to use HCV-positive donor organs in HCV recipients due to clinical and ethical considerations.Similar survival rates between HCV-positive donors and recipients and HCV-negative donors and receivers illustrate the efficacy of these DAA regimens.

A potential application in quantum networks-Deterministic quantum operation sharing schemes with Bell states

In this paper, we propose certain different design ideas on a novel topic in quantum cryptography — quantum operation sharing(QOS). Following these unique ideas, three QOS schemes, the "HIEC"(The scheme whose messages are hidden in the entanglement correlation), "HIAO"(The scheme whose messages are hidden with the assistant operations) and "HIMB"(The scheme whose messages are hidden in the selected measurement basis), have been presented to share the single-qubit operations determinately on target states in a remote node. These schemes only require Bell states as quantum resources. Therefore, they can be directly applied in quantum networks, since Bell states are considered the basic quantum channels in quantum networks. Furthermore, after analyse on the security and resource consumptions, the task of QOS can be achieved securely and effectively in these schemes.

Dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network

Aiming at the problem of dynamic multicast service protection in multi-domain optical network, this paper proposes a dynamic multicast sharing protection algorithm based on fuzzy game in multi-domain optical network. The algorithm uses the minimum cost spanning tree strategy and fuzzy game theory. First, it virtualizes two planes to calculate the multicast tree and the multicast protection tree respectively. Then, it performs a fuzzy game to form a cooperative alliance to optimize the path composition of each multicast tree. Finally, it generates a pair of optimal multicast work tree and multicast protection tree for dynamic multicast services. The time complexity of the algorithm is O(k3 m2 n), where n represents the number of nodes in the networks, k represents the number of dynamic multicast requests, and m represents the number of destination nodes for each multicast request. The experimental results show that the proposed algorithm reduces significantly the blocking rate of dynamic multicast services, and improves the utilization of optical network resources within a certain number of dynamic multicast request ranges.