A two-phase monadic approach is presented for monadically slicing programs with procedures. In the monadic slice algorithm for interprocedural programs, phase 1 initializes the slice table of formal parameters in a pr...A two-phase monadic approach is presented for monadically slicing programs with procedures. In the monadic slice algorithm for interprocedural programs, phase 1 initializes the slice table of formal parameters in a procedure with the given labels, and then captures the callees' influence on callers when analyzing call statements. Phase 2 captures the callees' dependence on callers by replacing all given labels appearing in the corresponding sets of formal parameters. By the introduction of given labels, this slice method can obtain similar summary information in system-dependence-graph(SDG)-based algorithms for addressing the calling-context problem. With the use of the slice monad transformer, this monadic slicing approach achieves a high level of modularity and flexibility. It shows that the monadic interprocedural algorithm has less complexity and it is not less precise than SDG algorithms.展开更多
Suppose f is a spirallike function of type β and order α on the unit disk D.Let Ωn,p1,p2,…,pn={z=(z2,z2,…,zn)′∈C^n:∑j=1^n|zj)^Pj〈1},where 1≤p1≤2,pj≥1,j=2,…,n,are real numbers.In this paper,we will pr...Suppose f is a spirallike function of type β and order α on the unit disk D.Let Ωn,p1,p2,…,pn={z=(z2,z2,…,zn)′∈C^n:∑j=1^n|zj)^Pj〈1},where 1≤p1≤2,pj≥1,j=2,…,n,are real numbers.In this paper,we will prove that Φn,β2,γ2,…βn,γn(f)(z)=(f(z1), preserves spirallikeness of type β and order α on Ωn,p1,p2,…,Pn.展开更多
Upon flaws of current blockchain platforms of heavyweight, large capacity of ledger, and time-consuming of synchronization of data, in this paper, we proposed a new paradigm of master-slave blockchain scheme(MSB) for ...Upon flaws of current blockchain platforms of heavyweight, large capacity of ledger, and time-consuming of synchronization of data, in this paper, we proposed a new paradigm of master-slave blockchain scheme(MSB) for pervasive computing that suitable for general PC, mobile device such as smart phones or PADs to participants in the working of mining and verification, in which we separated traditional blockchain model in 2 layer defined as master node layer and a series of slavery agents layer, then we proposed 2 approaches for partially computing model(PCM) and non-computing of model(NCM) in the MSB blockchain, Finally large amounts of simulations manifest the proposed master-slave blockchain scheme is feasible, extendible and suitable for pervasive computing especially in the 5 G generation environment, and can apply in the DRM-related applications.展开更多
N-ros is one of the transforming genes in human hepatic cancer cells. It has been found that N-ras was overexpressed at the mENA and protein level in hepatoma cells. In order to explore the biological roles of N-ras i...N-ros is one of the transforming genes in human hepatic cancer cells. It has been found that N-ras was overexpressed at the mENA and protein level in hepatoma cells. In order to explore the biological roles of N-ras in human hepatic oaroinogenesis and the potential application in control of cancer cell growth, a pseudotype retrovirus containing antisense sequence of human N-ras was constructed and packaged. A recombinant rebrovirus vector containing antisense or sense sequences of N-ras oDNA was constructed by pZIP-NeoSV(X)1. The pseudotype virus was packaged and rescued by transfeotion and infection in PA317 and ψ2 helper cells. It has been demonstrated that the pseudotype retrovirus containing antisense N-ras sequence did inhibit the growth of human PLC/PEF/5 hepatoma cells accompanied with inhibition of p21 expression, while the retrovirus containing sense sequence had none. The pseudotype virus had no effect on human diploid fibroblasts.展开更多
Given an m-sequence, the main factor influencing the least period of the Generalized Self-Shrinking (GSS) sequence is the selection of the linear combining vector G. Based on the calculation of the minimal polynomia...Given an m-sequence, the main factor influencing the least period of the Generalized Self-Shrinking (GSS) sequence is the selection of the linear combining vector G. Based on the calculation of the minimal polynomial ofL GSS sequences and the comparison of their degrees, an algorithm for selecting the linear combining vector G is presented, which is simple to understand, to implement and to prove. By using this method, much more than 2^L-l linear combining vectors G of the desired properties will be resulted. Thus in the practical application the linear combining vector G can be chosen with great arbitrariness. Additionally, this algorithm can be extended to any finite field easily.展开更多
Admission control is a key mechanism to manage the increasing number of the simultaneous demanding services, requiring a desired Quality of Service(QoS) in a spectrum efficient manner. To address this issue,we investi...Admission control is a key mechanism to manage the increasing number of the simultaneous demanding services, requiring a desired Quality of Service(QoS) in a spectrum efficient manner. To address this issue,we investigate in this work, the use of the superposition coding technique to increase the system capacity through multiuser diversity exploitation. We propose a novel joint admission control and superposition coding formalism based on different utility functions:Opportunistic(OPSC), Great Fairness(GFSC)and Proportional Fairness(PFSC). Simulation results show the superiority of our proposed approaches over other by providing higher mean of served VoIP users and higher throughput while maintaining an average VoIP packet transmission delay lower than 0.6 ms.展开更多
This paper discusses the semantic coherence in discourse translation from the perspective of thematic progression, and holds that in translating a discourse the translator should spare no effort to retain the origina...This paper discusses the semantic coherence in discourse translation from the perspective of thematic progression, and holds that in translating a discourse the translator should spare no effort to retain the original thematic progression pattern in the target text, but when the original thematic progression pattern cannot be directly retained, the translator should construct his own thematic structure and substitute progression pattern in the target text, thus to make it as readable as the original text without distorting the original information structure. This paper also attempts to explore the circumstances under which the original thematic progression pattern can be retained and the substitute should be reconstructed.展开更多
Controller vulnerabilities allow malicious actors to disrupt or hijack the Software-Defined Networking. Traditionally, it is static mappings between the control plane and data plane. Adversaries have plenty of time to...Controller vulnerabilities allow malicious actors to disrupt or hijack the Software-Defined Networking. Traditionally, it is static mappings between the control plane and data plane. Adversaries have plenty of time to exploit the controller's vulnerabilities and launch attacks wisely. We tend to believe that dynamically altering such static mappings is a promising approach to alleviate this issue, since a moving target is difficult to be compromised even by skilled adversaries. It is critical to determine the right time to conduct scheduling and to balance the overhead afforded and the security levels guaranteed. Little previous work has been done to investigate the economical time in dynamic-scheduling controllers. In this paper, we take the first step to both theoretically and experimentally study the scheduling-timing problem in dynamic control plane. We model this problem as a renewal reward process and propose an optimal algorithm in deciding the right time to schedule with the objective of minimizing the long-term loss rate. In our experiments, simulations based on real network attack datasets are conducted and we demonstrate that our proposed algorithm outperforms given scheduling schemes.展开更多
In this paper, we obtain the period of generalized Fibonacci sequence in finite rings with identity of order p2 by using equality recursively defined by Fn+2 = A1Fn+1 + A0Fn, for n ≥ 0, where F0 = 0 ( the zero of...In this paper, we obtain the period of generalized Fibonacci sequence in finite rings with identity of order p2 by using equality recursively defined by Fn+2 = A1Fn+1 + A0Fn, for n ≥ 0, where F0 = 0 ( the zero of the ring), F1 = 1 (the identity of the ring) and A0 , A1 are generators elements of finite rings with identity of order p2. Also, we get some results between the period of generalized Fibonacci sequence in the finite rings oforderp2 and characteristic of these rings.展开更多
This research seeks to contribute to translation studies by examining the illocutionary force of the speech act theory. It identifies two senses of illocutionary force: The active function of language is defined as l...This research seeks to contribute to translation studies by examining the illocutionary force of the speech act theory. It identifies two senses of illocutionary force: The active function of language is defined as lFl and the varying degrees of the strength of the speech act are defined as IF2. The implications of the two senses ofillocutionary force for translation studies are discussed in a case study of the translation of directives in Chinese versions of Shakespeare's play, The Merry Wives of Windsor. Translation shifts in transferring IF2, as manifested in pragmatic duality features of directness/indirectness, tone articles, repetition of verbs, action measure verbs, upgrader ",给我" and honorific addressing terms and vocatives are discussed. The notion's potential as a criterion to evaluate translation quality is also explored.展开更多
In this paper, some inequalities for sequence rearrangement and matrix product are established. The authors extend and improve some known results, and show that there are some errors in reference on inequalities for s...In this paper, some inequalities for sequence rearrangement and matrix product are established. The authors extend and improve some known results, and show that there are some errors in reference on inequalities for sequence rearrangement by examples.展开更多
Effects of antisense epidermal growth factor receptor (EGFR) sequence on apoptotic cell death were examined in a human hepatoma cell line BEL-7404 cells. In the cells of JX-1, a sub clone of BEL-7404 stably transfecte...Effects of antisense epidermal growth factor receptor (EGFR) sequence on apoptotic cell death were examined in a human hepatoma cell line BEL-7404 cells. In the cells of JX-1, a sub clone of BEL-7404 stably transfected with antisense EGFR vector (Cell Research, 3:75, 1993), an enhanced rate (9.5%) of spontaneous apoptosis was detected by flow cytometry, whereas the rates of spontaneous apoptosis in JX-0 cells, a sub-clone of BEL-7404 transfected by control vector, and the parellt BEL-7404 cells were almost equal and about 1.7%. Serum-starvation for 72 h increased the rate of apoptosis of JX-1cells up to 33.7%, while JX-0 and BEL-7404 cells, under the same condition, produced less than 5% of apoptotic cells. Observation with electron microscope demonstrated that condensation and fragmentation of chromatin and formation of apoptotic bodies of ten occurred in JX-1 cells, especially during serumstarvation. These results, combined with the data of DNA fragmentation Elisa test, suggested that antisense EGFR sequence enhances apoptosis in the human hepatoma cells.Comparison of intracellular Ca2+ level and the responsiveness of JX-1 cells to the induced action of EGF and tharpsigargin (TG) treatment with that of control JX-0cells indicated that antisense EGFR might interrupt the EGF/EGFR signaling pathway resulting in the decreass of intracellular Ca2+ pool content as well as the responsiveness of these cells to the extracellular signals. These findings suggest that antisense EGFR either directly or indirectly reglllates Ca2+ storage in endoplasmic reticulum,thereby enhances apoptosis in the hnman hepatoma cells.展开更多
Generally, open string boundary conditions play a nontrivial role in string theory. For example, in the presence of an antisymmetric tensor background field, they will lead the spacetime coordinates noncommutative. In...Generally, open string boundary conditions play a nontrivial role in string theory. For example, in the presence of an antisymmetric tensor background field, they will lead the spacetime coordinates noncommutative. In this paper, we mainly discuss how to build up a generalized Dirichlet normal ordered product of open bosonic string embedding operators that satisfies both the equations of motion and the generalized Dirichlet boundary conditions at the quantum level in the presence of an antisymmetric background field, as the generalized Neumann case has already been discussed in the literature. Further, we also give a brief check of the consistency of the theory under the newly introduced normal ordering.展开更多
Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Softwar...Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Software Defined Network(SDN), most of the them are focused either on the number of transmission layers or on the optimization of transmission path for specific layer. In this paper, we propose a noval optimization algorithm for SVC to dynamically adjust the number of layers and optimize the transmission paths simultaneously. We establish the problem model based on the 0/1 knapsack model, and then solve it with Artificial Fish Swarm Algorithm. Additionally, the simulations are carried out on the Mininet platform, which show that our approach can dynamically adjust the number of layers and select the optimal paths at the same time. As a result, it can achieve an effective allocation of network resources which mitigates the congestion and reduces the loss of non-SVC stream.展开更多
基金The National Outstanding Young Scientist Foundation by NSFC(No.60703086,60503020)
文摘A two-phase monadic approach is presented for monadically slicing programs with procedures. In the monadic slice algorithm for interprocedural programs, phase 1 initializes the slice table of formal parameters in a procedure with the given labels, and then captures the callees' influence on callers when analyzing call statements. Phase 2 captures the callees' dependence on callers by replacing all given labels appearing in the corresponding sets of formal parameters. By the introduction of given labels, this slice method can obtain similar summary information in system-dependence-graph(SDG)-based algorithms for addressing the calling-context problem. With the use of the slice monad transformer, this monadic slicing approach achieves a high level of modularity and flexibility. It shows that the monadic interprocedural algorithm has less complexity and it is not less precise than SDG algorithms.
基金Supported by the National Natural Science Foundation of China(10626015, 10571044) Supported by Guangdong Natural Science Foundation(06301315) Supported by the doctoral foundation of Zhanjiang Normal University(Z0420)
文摘Suppose f is a spirallike function of type β and order α on the unit disk D.Let Ωn,p1,p2,…,pn={z=(z2,z2,…,zn)′∈C^n:∑j=1^n|zj)^Pj〈1},where 1≤p1≤2,pj≥1,j=2,…,n,are real numbers.In this paper,we will prove that Φn,β2,γ2,…βn,γn(f)(z)=(f(z1), preserves spirallikeness of type β and order α on Ωn,p1,p2,…,Pn.
基金supported by the National Natural Science Foundation of China under Grant 61272519the Research Funds of Blockchain Joint Lab between BUPT and BCTthe joint Blockchain and Security Lab between BUPT and CAPSTONE
文摘Upon flaws of current blockchain platforms of heavyweight, large capacity of ledger, and time-consuming of synchronization of data, in this paper, we proposed a new paradigm of master-slave blockchain scheme(MSB) for pervasive computing that suitable for general PC, mobile device such as smart phones or PADs to participants in the working of mining and verification, in which we separated traditional blockchain model in 2 layer defined as master node layer and a series of slavery agents layer, then we proposed 2 approaches for partially computing model(PCM) and non-computing of model(NCM) in the MSB blockchain, Finally large amounts of simulations manifest the proposed master-slave blockchain scheme is feasible, extendible and suitable for pervasive computing especially in the 5 G generation environment, and can apply in the DRM-related applications.
文摘N-ros is one of the transforming genes in human hepatic cancer cells. It has been found that N-ras was overexpressed at the mENA and protein level in hepatoma cells. In order to explore the biological roles of N-ras in human hepatic oaroinogenesis and the potential application in control of cancer cell growth, a pseudotype retrovirus containing antisense sequence of human N-ras was constructed and packaged. A recombinant rebrovirus vector containing antisense or sense sequences of N-ras oDNA was constructed by pZIP-NeoSV(X)1. The pseudotype virus was packaged and rescued by transfeotion and infection in PA317 and ψ2 helper cells. It has been demonstrated that the pseudotype retrovirus containing antisense N-ras sequence did inhibit the growth of human PLC/PEF/5 hepatoma cells accompanied with inhibition of p21 expression, while the retrovirus containing sense sequence had none. The pseudotype virus had no effect on human diploid fibroblasts.
基金Supported in part by the National Natural Science Foun-dation of China (No.60273084) and Doctoral Foundation (No.20020701013).
文摘Given an m-sequence, the main factor influencing the least period of the Generalized Self-Shrinking (GSS) sequence is the selection of the linear combining vector G. Based on the calculation of the minimal polynomial ofL GSS sequences and the comparison of their degrees, an algorithm for selecting the linear combining vector G is presented, which is simple to understand, to implement and to prove. By using this method, much more than 2^L-l linear combining vectors G of the desired properties will be resulted. Thus in the practical application the linear combining vector G can be chosen with great arbitrariness. Additionally, this algorithm can be extended to any finite field easily.
文摘Admission control is a key mechanism to manage the increasing number of the simultaneous demanding services, requiring a desired Quality of Service(QoS) in a spectrum efficient manner. To address this issue,we investigate in this work, the use of the superposition coding technique to increase the system capacity through multiuser diversity exploitation. We propose a novel joint admission control and superposition coding formalism based on different utility functions:Opportunistic(OPSC), Great Fairness(GFSC)and Proportional Fairness(PFSC). Simulation results show the superiority of our proposed approaches over other by providing higher mean of served VoIP users and higher throughput while maintaining an average VoIP packet transmission delay lower than 0.6 ms.
文摘This paper discusses the semantic coherence in discourse translation from the perspective of thematic progression, and holds that in translating a discourse the translator should spare no effort to retain the original thematic progression pattern in the target text, but when the original thematic progression pattern cannot be directly retained, the translator should construct his own thematic structure and substitute progression pattern in the target text, thus to make it as readable as the original text without distorting the original information structure. This paper also attempts to explore the circumstances under which the original thematic progression pattern can be retained and the substitute should be reconstructed.
基金supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (No. 61521003)The National Key R&D Program of China (No.2016YFB0800101)+1 种基金the National Science Foundation for Distinguished Young Scholars of China (No.61602509)Henan Province Key Technologies R&D Program of China(No.172102210615)
文摘Controller vulnerabilities allow malicious actors to disrupt or hijack the Software-Defined Networking. Traditionally, it is static mappings between the control plane and data plane. Adversaries have plenty of time to exploit the controller's vulnerabilities and launch attacks wisely. We tend to believe that dynamically altering such static mappings is a promising approach to alleviate this issue, since a moving target is difficult to be compromised even by skilled adversaries. It is critical to determine the right time to conduct scheduling and to balance the overhead afforded and the security levels guaranteed. Little previous work has been done to investigate the economical time in dynamic-scheduling controllers. In this paper, we take the first step to both theoretically and experimentally study the scheduling-timing problem in dynamic control plane. We model this problem as a renewal reward process and propose an optimal algorithm in deciding the right time to schedule with the objective of minimizing the long-term loss rate. In our experiments, simulations based on real network attack datasets are conducted and we demonstrate that our proposed algorithm outperforms given scheduling schemes.
文摘In this paper, we obtain the period of generalized Fibonacci sequence in finite rings with identity of order p2 by using equality recursively defined by Fn+2 = A1Fn+1 + A0Fn, for n ≥ 0, where F0 = 0 ( the zero of the ring), F1 = 1 (the identity of the ring) and A0 , A1 are generators elements of finite rings with identity of order p2. Also, we get some results between the period of generalized Fibonacci sequence in the finite rings oforderp2 and characteristic of these rings.
文摘This research seeks to contribute to translation studies by examining the illocutionary force of the speech act theory. It identifies two senses of illocutionary force: The active function of language is defined as lFl and the varying degrees of the strength of the speech act are defined as IF2. The implications of the two senses ofillocutionary force for translation studies are discussed in a case study of the translation of directives in Chinese versions of Shakespeare's play, The Merry Wives of Windsor. Translation shifts in transferring IF2, as manifested in pragmatic duality features of directness/indirectness, tone articles, repetition of verbs, action measure verbs, upgrader ",给我" and honorific addressing terms and vocatives are discussed. The notion's potential as a criterion to evaluate translation quality is also explored.
文摘In this paper, some inequalities for sequence rearrangement and matrix product are established. The authors extend and improve some known results, and show that there are some errors in reference on inequalities for sequence rearrangement by examples.
文摘Effects of antisense epidermal growth factor receptor (EGFR) sequence on apoptotic cell death were examined in a human hepatoma cell line BEL-7404 cells. In the cells of JX-1, a sub clone of BEL-7404 stably transfected with antisense EGFR vector (Cell Research, 3:75, 1993), an enhanced rate (9.5%) of spontaneous apoptosis was detected by flow cytometry, whereas the rates of spontaneous apoptosis in JX-0 cells, a sub-clone of BEL-7404 transfected by control vector, and the parellt BEL-7404 cells were almost equal and about 1.7%. Serum-starvation for 72 h increased the rate of apoptosis of JX-1cells up to 33.7%, while JX-0 and BEL-7404 cells, under the same condition, produced less than 5% of apoptotic cells. Observation with electron microscope demonstrated that condensation and fragmentation of chromatin and formation of apoptotic bodies of ten occurred in JX-1 cells, especially during serumstarvation. These results, combined with the data of DNA fragmentation Elisa test, suggested that antisense EGFR sequence enhances apoptosis in the human hepatoma cells.Comparison of intracellular Ca2+ level and the responsiveness of JX-1 cells to the induced action of EGF and tharpsigargin (TG) treatment with that of control JX-0cells indicated that antisense EGFR might interrupt the EGF/EGFR signaling pathway resulting in the decreass of intracellular Ca2+ pool content as well as the responsiveness of these cells to the extracellular signals. These findings suggest that antisense EGFR either directly or indirectly reglllates Ca2+ storage in endoplasmic reticulum,thereby enhances apoptosis in the hnman hepatoma cells.
基金supported by National Natural Science Foundation and the Doctor Education Fund of the Ministry of Education
文摘Generally, open string boundary conditions play a nontrivial role in string theory. For example, in the presence of an antisymmetric tensor background field, they will lead the spacetime coordinates noncommutative. In this paper, we mainly discuss how to build up a generalized Dirichlet normal ordered product of open bosonic string embedding operators that satisfies both the equations of motion and the generalized Dirichlet boundary conditions at the quantum level in the presence of an antisymmetric background field, as the generalized Neumann case has already been discussed in the literature. Further, we also give a brief check of the consistency of the theory under the newly introduced normal ordering.
文摘Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Software Defined Network(SDN), most of the them are focused either on the number of transmission layers or on the optimization of transmission path for specific layer. In this paper, we propose a noval optimization algorithm for SVC to dynamically adjust the number of layers and optimize the transmission paths simultaneously. We establish the problem model based on the 0/1 knapsack model, and then solve it with Artificial Fish Swarm Algorithm. Additionally, the simulations are carried out on the Mininet platform, which show that our approach can dynamically adjust the number of layers and select the optimal paths at the same time. As a result, it can achieve an effective allocation of network resources which mitigates the congestion and reduces the loss of non-SVC stream.