英语过去完成时所表示的复杂时间概念

英语过去完成时所表示的复杂时间概念王军过去完成时是英文叙述性文章中较为常见的时态。国内有的语法书称之为过去完成体，国外语法界对此也有各种叫法，如：ＴｈｅＰａｓｔＰｅｒｆｅｃｔＴｅｎｓｅ，ＴｈｅＰａｓｔＰｅｒｆｅｃｔＡｓｐｅｃｔ，ＴｈｅＰｌｕｐｅｒｆｅ...

The Calculation of Parameters for DNA Kinetic Structure Based on Monte-Carlo Multiple Integrals

Based on protein-DNA complex crystal structural data in up-to-date Nucleic Acid Database,the related parameters of DNA Kinetic Structure were investigated by Monte-Carlo Multiple Integrals on the base of modified DNA structure statistical mechanical model,and time complexity and precision were analyzed on the calculated results.

Recommending Authors and Papers Based on ACTTM Community and Bilayer Citation Network

Citation network is often used for academic recommendation. However, it is difficult to achieve high recommendation accuracy and low time complexity because it is often very large and sparse and different citations have different purposes. What's more, some citations include unreasonable information, such as in case of intentional self-citation. To improve the accuracy of citation network-based academic recommendation and reduce the time complexity, we propose an academic recommendation method for recommending authors and papers. In which, an author-paper bilayer citation network is built, then an enhanced topic model, Author Community Topic Time Model(ACTTM) is proposed to detect high quality author communities in the author layer, and a set of attributes are proposed to comprehensively depict the author/paper nodes in the bilayer citation network. Experimental results prove that the proposed ACTTM can detect high quality author communities and facilitate low time complexity, and the proposed academic recommendation method can effectively improve the recommendation accuracy.

Breeding of New Japonica-indica Hybrid Rice Combination Chunyou 59

Chunyou 59 is a japonica-indica hybrid rice combination developed from Chunjiang 16A(a late japonica CMS line with dwarfness and early anthesis time)and CH59(an indicaclinous wide compatibility restorer line).It has the characteristics of strong heterosis,strong stem,good lodging resistance,large panicles,good cold tolerance,high yield and wide adaptability.It was registered and released by Jiangxi Provincial Crop Variety Appraisal Committee in March 2009.The breeding procedure,characteristics,major techniques of cultivation and seed production of Chunyou 59 were introduced in the paper.

Evolvement of the System Complexity Degree under Different Time Scalings:an Illustration of the Traffic Flow System

It is investigable how the system scaling affects the system complexity degree. The traffic flow system is taken in this paper as an illustration to study this question. First, the Lempel-Ziv algorithm is introduced for accurate depiction of the complexity degree of the traffic flow system. We gain 3 actual sequences and 20s period traffic flow sequences on the basis of the measure of the traffic flow data; we gain 5 traffic flow sequences whose periods are between 1-5min by simulating the traffic flow system. By calculating the complicacy of the 11 sequences, we obtain two hypothesis: the complicacies of the same system are different under different time scalings; negative correlation exists between the complicacy and the time scaling of the system.

NLoS Mitigation in ToA Localization Based on Spatial Correlation Filter and Iterative Minimum Residual

To mitigate the Non-Line-of-Sight (NLoS) error which seriously affects the localization accuracy and robustness in complex indoor environment,a novel Iterative Minimum Residual (IMR) based on the consistency hypothesis of the residual and the error is proposed in this paper.It chooses the best subset of measurements to calculate the coordinates of the unknown node by comparing the residuals obtained with different subsets of beacons.To reduce the time complexity of the IMR algorithm,Spatial Correlation Filter (SCF) is also proposed,which can remove the most serious NLoS distance with low calculation cost.Combined with the proposed SCF and IMR algorithm,nodes can be localized with high accuracy and low time complexity.Experimental results with real dataset demonstrate that the proposed algorithm can identify the NLoS range effectively with about 50% time cost of employing SCF only.

Traffic Flow States in a Freeway with Bottleneck

The system of mixture of single lane and double lane is studied by a cellular automata model, which is developed by us based on the Nagel and Schreckenberg＇s models. We justify that the model can reach a stable states quickly. The density distributions of the stable state is presented for several cases, which illustrate the manner of the congestion. The relationship between the outflow rate and the total number of vehicles and that between the outflow rate and the density just before the bottleneck are both given. Comparing with the relationship that occurring in the granular flow, we conclude that the transition from the free traffic flow to the congested traffic flow can also be attributed to the abrupt variation through unstable flow state, which can naturally explain the discontinuities and the complex time variation behavior observed in the traffic flow experiments.

An Adaptive Tag Anti-Collision Protocol in RFID Wireless Systems

A novel anti-collision algorithm in RFID wireless network is proposed.As it is put forward on the basis of collision tree(CT)and improved collision tree(lCT) anti-collision protocols,we call it adaptive collision tree protocol(ACT).The main novelty of this paper is that the AD strategy is introduced and used in ACT to decrease collisions and improve the tag system throughput.AD strategy means that query strings will divide into two or four branches adaptively according to the label quantity.This scheme can decrease both depth of query and collision timeslots,and avoid producing too much idle timeslots at the same time.Both theoretical analysis and simulation results indicate that the novel proposed anticollision protocol ACT outperforms the previous CT and ICT protocols in term of time complexity,system throughput,and communication complexity.

Test Stability of Uster Advanced Fiber Information System(AFIS)

To study test stability of Advanced Fiber Information System(AFIS),card sliver produced in two experiments(12 plans in each experiment)were tested by AFIS.By a statistic analysis of the test results,the number of test times that can get a reliable test reliability(hereinafter this number of test times is referred to as Reliable Test Times,RTT)of test parameters and the coefficient of variation(CV%)values of 30 test results of each experiment plan were obtained.It's concluded that some parameters,such as length,seed coat nep(SCN)size,nep size and immature fiber content(IFC),etc.are very reliable by a test of ten or more times,but other parameters,such as SCN content,trash content,and visible foreign matter(VFM)content,etc.are not reliable until they are tested over 100 times.

Research on characters of surrounding rock in complex geology conditions and supporting time

The methods combined by test, field monitoring and theoretical analysis were adopted to do the systemic research on the rock mass from micro-structure to macro-deformation, and rheological model of Jinchuan rock mass was established to discuss the reasonable supporting time. Resuhs show that supporting after suitable stress and displacement release can benefit for the long-term stability of surrounding rock.

A Trusted Routing Protocol Based on GeoDTN＋Nav in VANET

Because the node of vehicular ad-hoc networks has the characteristics of high mobility and encounter temporary, a trust management between the nodes in the routing process becomes more difficult. To solve this problem, this paper proposes a new trusted routing protocol in VANET based on GeoDTN＋Nav by using trust management model of Bayesian and the three opportunistic routing forwarding models, which includes four steps of the routing initialization, the routing discovery, the trusted routing establishment and the routing deletion. The proposed protocol not only improves the security of routing, but also has the lower time complexity. Besides, experimental results and analysis show that the protocol has achieved good performance in the removal ratio of malicious nodes, correct reception ratio of packet and the message payload.

H4SiW6Mo6O40-Doped Polyaniline-Synthesis, characterization and catalytic properties of acetals and ketals

A new environmental friendly catalyst, HaSiWrMo6O40/PAn was prepared and identified by means of FT-IR, XRD and TG/DTA. The optimum conditions have been found, that was, mass ratio of m（PAn）： m（HaSiW6Mo6On.） was 1：1.25, volume of methanol was 20 mL, and the reflux reaction time was 2h. The structural identity of Keggin units was preserved after the incorporation into polyaniline matrix. H4SiW6Mo6040/PAn was used as catalyst in catalytic synthesis of acetals and ketals. Effects of n（aldehyde（ketone ））： n（glycol）, catalyst dosage and reaction time on yield were investingated. Optimal conditions were： n（aldehyde（ketone））： n（glycol）=1.0： 1.5; mass fraction of catalyst to reactants, 0.5%; reaction time, 1.0 h and cyclohexane as water-stripped reagent, 15 mL. Under these conditions, yields of actels and ketals were 31.9%-91.6%.

A New Codebook Design Scheme for Fast Beam Searching in Millimeter-Wave Communications

To overcome imperfection of exhaustive based beam searching scheme in IEEE 802.15.3c and IEEE 802.11 ad and accelerate the beam training process, combined with the fast beam searching algorithm previously proposed, this paper proposed a beam codebook design scheme for phased array to not only satisfy the fast beam searching algorithm's demand, but also make good use of the advantage of the searching algorithm. The simulation results prove that the proposed scheme not only performs well on flexibility and searching time complexity, but also has high success ratio.

Optimization of sensing time and cooperative user allocation for OR-rule cooperative spectrum sensing in cognitive radio network

In order to improve the throughput of cognitive radio(CR), optimization of sensing time and cooperative user allocation for OR-rule cooperative spectrum sensing was investigated in a CR network that includes multiple users and one fusion center. The frame structure of cooperative spectrum sensing was divided into multiple transmission time slots and one sensing time slot consisting of local energy detection and cooperative overhead. An optimization problem was formulated to maximize the throughput of CR network, subject to the constraints of both false alarm probability and detection probability. A joint optimization algorithm of sensing time and number of users was proposed to solve this optimization problem with low time complexity. An allocation algorithm of cooperative users was proposed to preferentially allocate the users to the channels with high utilization probability. The simulation results show that the significant improvement on the throughput can be achieved through the proposed joint optimization and allocation algorithms.

Matched Field Localization Based on CS-MUSIC Algorithm

The problem caused by shortness or excessiveness of snapshots and by coherent sources in underwater acoustic positioning is considered.A matched field localization algorithm based on CS-MUSIC(Compressive Sensing Multiple Signal Classification) is proposed based on the sparse mathematical model of the underwater positioning.The signal matrix is calculated through the SVD(Singular Value Decomposition) of the observation matrix.The observation matrix in the sparse mathematical model is replaced by the signal matrix,and a new concise sparse mathematical model is obtained,which means not only the scale of the localization problem but also the noise level is reduced;then the new sparse mathematical model is solved by the CS-MUSIC algorithm which is a combination of CS(Compressive Sensing) method and MUSIC(Multiple Signal Classification) method.The algorithm proposed in this paper can overcome effectively the difficulties caused by correlated sources and shortness of snapshots,and it can also reduce the time complexity and noise level of the localization problem by using the SVD of the observation matrix when the number of snapshots is large,which will be proved in this paper.

Cryptanalysis of Cryptosystems Based on General Linear Group

Advances in quantum computers threaten to break public key cryptosystems such as RSA, ECC, and EIGamal on the hardness of factoring or taking a discrete logarithm, while no quantum algorithms are found to solve certain mathematical problems on non-commutative algebraic structures until now. In this background, Majid Khan et al.proposed two novel public-key encryption schemes based on large abelian subgroup of general linear group over a residue ring. In this paper we show that the two schemes are not secure. We present that they are vulnerable to a structural attack and that, it only requires polynomial time complexity to retrieve the message from associated public keys respectively. Then we conduct a detailed analysis on attack methods and show corresponding algorithmic description and efficiency analysis respectively. After that, we propose an improvement assisted to enhance Majid Khan's scheme. In addition, we discuss possible lines of future work.

Joint Link Allocation and Rate Assignment Algorithm for Multi-Channel Wireless Networks

This paper presents a link allocation and rate assignment algorithm for multi-channel wireless networks. The objective is to reduce network con-flicts and guarantee the fairness among links. We first design a new network model. With this net-work model, the multi-channel wireless network is divided into several subnets according to the num-ber of channels. Based on this, we present a link allocation algorithm with time complexity O（l^2）to al-locate all links to subnets. This link allocation algo-rithm adopts conflict matrix to minimize the network contention factor. After all links are allocated to subnets, the rate assignment algorithm to maximize a fairness utility in each subnet is presented. The rate assignment algorithm adopts a near-optirml al-gorithm based on dual decomposition and realizes in a distributed way. Simulation results demonstrate that, compared with IEEE 802.11b and slotted see-ded channel hopping algorithm, our algorithm de-creases network conflicts and improves the net-work throughput significantly.

Three-Rainbow Coloring of Split Graphs

After a necessary condition is given, 3-rainbow coloring of split graphs with time complexity O(m) is obtained by constructive method. The number of corresponding colors is at most 2 or 3 more than the minimum number of colors needed in a 3-rainbow coloring.

Multi-stage optimum design of magazine type automatic tool changer arm

To enhance machining efficiency,tool change time has to be reduced.Thus,for an automatic tool changer attached to a machining center,the tool change time is to be reduced.Also the automatic tool changer is a main part of the machining center as a driving source.The static attributes of the automatic tool changer using the commercial code,ANSYS Workbench V12,were tried to interpret.And the optimum design of automatic tool changer arm was proposed by performing the multi-stage optimum design.The shape optimization of the automatic tool changer was proposed and the result was verified to obtain acceptable improvements.It is possible to obtain an optimized model in which the maximum deformation,maximum stress,and mass are reduced by 10.46%,12.89% and 9.26%,respectively,compared with those of the initial model.Also,the results between conventional method by the design of experiments and proposed method by the multi-stage optimum design method were compared.

Layered heuristic algorithm for multiple restriction routes

A layered algorithm by bidirectional searching is proposed in this paper to solve the problem that it is difficult and time consuming to reach an optimal solution of the route search with multiple parameter restrictions for good quality of service. Firstly, a set of reachable paths to each intermediate node from the source node and the sink node based on adjacent matrix transformation are calculated respectively. Then a temporal optimal path is selected by adopting the proposed heuristic method according to a non-linear cost function. When the total number of the accumulated nodes by bidirectional searching reaches n-2, the paths from two directions to an intermediate node should be combined and several paths via different nodes from the source node to the sink node can be obtained, then an optimal path in the whole set of paths can be taken as the output route. Some simulation examples are included to show the effectiveness and efficiency of the proposed method. In addition, the proposed algorithm can be implemented with parallel computation and thus, the new algorithm has better performance in time complexity than other algorithms. Mathematical analysis indicates that the maximum complexity in time, based on parallel computation, is the same as the polynomial complexity of O(kn2-3kn+k), and some simulation results are shown to support this analysis.