“可算”词汇化补议

现代汉语中的“可算”可做多解。语气副词“可算3”的形成经历了属于行域的“可算”、属于知域的“可算1”以及语气副词“可”与评议动词“是”组合的“可算2”。“可算”的功能扩展和词汇化的内在动因是“可”与“算”主观性发展的影响以及“可算”主观化的推动。“算”评判条件和结果的主观性增强及“可”对评判结果的进一步确认,使“可算”由表达主观判断向表达事件情态发展。此外,进入状位是“可算”副词化的机制之一。

从情态化到词汇化:语气副词“可算”的形成与发展——兼论副词“可算”与“总算”的表达差异

文章主要讨论语气副词"可算"的形成与发展。考察表明,语气副词"可算"由语气副词"可"与表"算是"义的动词"算"词汇化而来。发展过程中,"可"经由表道义情态的助动词"可"到表认识情态的语气副词"可",动词"算"经历了"不带宾语→带‘数’类体词宾语→带抽象体词性宾语→带谓词性成分"三次功能扩展。动词"算"由不带宾语扩展至带谓词性成分,受制于"可"的情态化表达。"可算"带谓词性成分后,逐渐副词化,副词化的主要动因是主观化导致的情态功用突显和使用频率的不断提升,主要机制是重新分析和语境义吸收。当代汉语里,语气副词"可算"进一步情态化,出现了主观意愿弱化和如意情态淡化的使用情况。文章还比较了副词"可算"与近义副词"总算"的用法,发现二者在语义偏向、表达预期、主观性强弱和突显语气程度等方面存在差异。

Reconfigurable implementation of AES algorithm IP core based on pipeline structure

In order to improve the data throughput of the advanced encryption standard （AES） IP core while reducing the hardware resource consumption and finally achieving a tradeoff between speed and area, a mixed pipeline architecture and reconfigurable technology for the design and implementation of the AES IP core is proposed. The encryption and decryption processes of the AES algorithm are achieved in the same process within the mixed pipeline structure. According to the finite field characterizations, the Sbox in the AES algorithm is optimized. ShiftRow and MixColumn, which are the main components in AES round transformation, are optimized with the reconfigurable technology. The design is implemented on the Xilinx Virtex2p xc2vp20-7 field programmable gate array （FPGA） device. It can achieve a data throughput above 2.58 Gbit/s, and it only requires 3 233 slices. Compared with other related designs of AES IP cores on the same device, the proposed design can achieve a tradeoff between speed and area, and obtain satisfactory results in both data throughput and hardware resource consumption.

Approach to obtaining weights of uncertain ordered weighted geometric averaging operator

The ordered weighted geometric averaging（OWGA） operator is extended to accommodate uncertain conditions where all input arguments take the forms of interval numbers. First, a possibility degree formula for the comparison between interval numbers is introduced. It is proved that the introduced formula is equivalent to the existing formulae, and also some desired properties of the possibility degree is presented. Secondly, the uncertain OWGA operator is investigated in which the associated weighting parameters cannot be specified, but value ranges can be obtained and the associated aggregated values of an uncertain OWGA operator are known. A linear objective-programming model is established; by solving this model, the associated weights vector of an uncertain OWGA operator can be determined, and also the estimated aggregated values of the alternatives can be obtained. Then the alternatives can be ranked by the comparison of the estimated aggregated values using the possibility degree formula. Finally, a numerical example is given to show the feasibility and effectiveness of the developed method.

The Reliability Design of a Kind of Multioption Fuze

On the basis of analysing the reliability problems existing in the general design of a kind of multioption fuze. some problems such as the reliability model. the reliability distribution of the electronic part of the fuze are discussed. For a particular multioption fuze, then.according to three different setting ways. the calculating methods of its operating reliability in six different operating states are given.

AVAILABILITY SIMULATION OF MULTI-COMPONENT SYSTEM BASED ON OPPORTUNISTIC MAINTENANCE POLICY

A multi-component system has the long fixed maintenance time, so the opportunistic maintenance policy is adopted to put preventive replacement and corrective replacement together, so that the long fixed maintenance time can be shared by more than one component, and the system availability can be improved. Then, the generation characteristics of the random failure time are researched based on the replacement maintenance and the minima[ maintenance. Furthermore, by choosing the opportunistic replacement ages of each component as opti- mized variables, a simulation algorithm based on an opportunistic maintenance policy is designed to maximize the total availability. Finally, the simulation result shows the validity of the algorithm by an example.

COMPUTER VISUALIZATION OF ELECTROMAGNETIC WAVE INTERACTION WITH STRUCTURES

In this paper, a computer visualization approach is proposed for electromagnetic wave interaction with structures by mains of finite difference-time doain method (F-D) and computer graphics. By visualization of FDTD, Phenomena such as wave propagation, penetration through structures, renection and absorption by structures are observed. Visualization of electromagnetic wave interactions with two wing-shaped structures is demonstrated. These examples indicate that the approach describe in the paper offers an effective way for investigating electromagnetic wave phenomena and is helpful to the engineers in controlling radar signature of the targets.

Single-machine scheduling with preventive periodic maintenance and resumable jobs in remanufacturing system

A single-machine scheduling with preventive periodic maintenance activities in a remanufacturing system including resumable and non-resumable jobs is studied.The objective is to find a schedule to minimize the makespan and an LPT-LS algorithm is proposed.Non-resumable jobs are first scheduled in a machine by the longest processing time（LPT） rule,and then resumable jobs are scheduled by the list scheduling（LS） rule.And the worst-case ratios of this algorithm in three different cases in terms of the value of the total processing time of the resumable jobs（denoted as S2） are discussed.When S2 is longer than the spare time of the machine after the non-resumable jobs are assigned by the LPT rule,it is equal to 1.When S2 falls in between the spare time of the machine by the LPT rule and the optimal schedule rule,it is less than 2.When S2 is less than the spare time of the machine by the optimal schedule rule,it is less than 2.Finally,numerical examples are presented for verification.

Calculation connectivity reliability of road networks based on recursive decomposition arithmetic

In order to decrease the calculation complexity of connectivity reliability of road networks, an improved recursive decomposition arithmetic is proposed. First, the basic theory of recursive decomposition arithmetic is reviewed. Then the characteristics of road networks, which are different from general networks, are analyzed. Under this condition, an improved recursive decomposition arithmetic is put forward which fits road networks better. Furthermore, detailed calculation steps are presented which are convenient for the computer, and the advantage of the approximate arithmetic is analyzed based on this improved arithmetic. This improved recursive decomposition arithmetic directly produces disjoint minipaths and avoids the non-polynomial increasing problems. And because the characteristics of road networks are considered, this arithmetic is greatly simplified. Finally, an example is given to prove its validity.

COMPRESSIBLE FLOW SIMULATION AROUND AIRFOIL BASED ON LATTICE BOLTZMANN METHOD

The flow around airfoil NACA0012 enwrapped by the body-fitted grid is simulated by a coupled doubledistribution-function （DDF） lattice Boltzmann method （LBM） for the compressible Navier-Stokes equations. Firstly, the method is tested by simulating the low Reynolds number flow at Ma =0. 5,a=0. 0, Re=5 000. Then the simulation of flow around the airfoil is carried out at Ma：0. 5, 0. 85, 1.2; a=-0.05, 1.0, 0.0, respectively. And a better result is obtained by using a local refined grid. It reduces the error produced by the grid at Ma=0. 85. Though the inviscid boundary condition is used to avoid the problem of flow transition to turbulence at high Reynolds numbers, the pressure distribution obtained by the simulation agrees well with that of the experimental results. Thus, it proves the reliability of the method and shows its potential for the compressible flow simulation. The suecessful application to the flow around airfoil lays a foundation of the numerical simulation of turbulence.

Clause-based enhancing mode for tableau algorithm for ALCN

As the tableau algorithm would produce a lot of description overlaps when judging the satisfiabilities of concepts（thus wasting much space）,a clause-based enhancing mode designed for the language ALCN is proposed.This enhancing mode constructs a disjunctive normal form on concept expressions and keeps only one conjunctive clause,and then substitutes the obtained succinctest conjunctive clause for sub-concepts set in the labeling of nodes of a completion tree constructed by the tableau algorithm （such a process may be repeated as many times as needed）.Due to the avoidance of tremendous descriptions redundancies caused by applying ∩- and ∪-rules of the ordinary tableau algorithm,this mode greatly improves the spatial performance as a result.An example is given to demonstrate the application of this enhancing mode and its reduction in the cost of space. Results show that the improvement is very outstanding.

A Modified Algorithm for Nonliear Integer Programming

Based on the analysis to the random sear ch algorithm of LUUS, a modified random directed integer search algorithm (MRDI SA) is given for first time. And a practical example is given to show that the adva ntage of this kind of algorithm is the reliability can’t be infuenced by the ini tial value X (0) and the start search domain R (0) . Besides, i t can be applied to solve the higher dimensional constrained nonlinear integer p rogramming problem.

Infeasibility test algorithm and fast repair algorithm of job shop scheduling problem

To diagnose the feasibility of the solution of a job-shop scheduling problem（JSSP）,a test algorithm based on diagraph and heuristic search is developed and verified through a case study.Meanwhile,a new repair algorithm for modifying an infeasible solution of the JSSP to become a feasible solution is proposed for the general JSSP.The computational complexity of the test algorithm and the repair algorithm is both O（n） under the worst-case scenario,and O（2J＋M） for the repair algorithm under the best-case scenario.The repair algorithm is not limited to specific optimization methods,such as local tabu search,genetic algorithms and shifting bottleneck procedures for job shop scheduling,but applicable to generic infeasible solutions for the JSSP to achieve feasibility.

Accelerating SAGE algorithm in PET image reconstruction by rescaled block-iterative method

A new method to accelerate the convergent rate of the space-alternatinggeneralized expectation-maximization (SAGE) algorithm is proposed. The new rescaled block-iterativeSAGE (RBI-SAGE) algorithm combines the RBI algorithm with the SAGE algorithm for PET imagereconstruction. In the new approach, the projection data is partitioned into disjoint blocks; eachiteration step involves only one of these blocks. SAGE updates the parameters sequentially in eachblock. In experiments, the RBI-SAGE algorithm and classical SAGE algorithm are compared in theapplication on positron emission tomography (PET) image reconstruction. Simulation results show thatRBI-SAGE has better performance than SAGE in both convergence and image quality.

Statistical Analysis for the Birnbaum-Saunders Fatigue Life Distribution under Type-Ⅱ Bilateral Censoring and Multiply Type-II Censoring

In present paper, we obtain the inverse moment estimations of parameters of the Birnbaum-Saunders fatigue life distribution based on Type-Ⅱ bilateral censored samples and multiply Type-Ⅱ censored sample. In this paper, we also get the interval estimations of the scale parameters.

Representations of Co-regular Subsets on Euclidean Spaces

For the computability of co-regular subsets in metric spaces, the properties of the co-regular subsets and several reasonable representations on co-regular sets have been suggested in this paper. As last, the ＇weaker or stronger＇ relations of these representations have been revealed.

Reliability analysis of earth slopes using hybrid chaotic particle swarm optimization

A numerical procedure for reliability analysis of earth slope based on advanced first-order second-moment method is presented,while soil properties and pore water pressure may be considered as random variables.The factor of safety and performance function is formulated utilizing a new approach of the Morgenstern and Price method.To evaluate the minimum reliability index defined by Hasofer and Lind and corresponding critical probabilistic slip surface,a hybrid algorithm combining chaotic particle swarm optimization and harmony search algorithm called CPSOHS is presented.The comparison of the results of the presented method,standard particle swarm optimization,and selected other methods employed in previous studies demonstrates the superior successful functioning of the new method by evaluating lower values of reliability index and factor of safety.Moreover,the presented procedure is applied for sensitivity analysis and the obtained results show the influence of soil strength parameters and probability distribution types of random variables on the reliability index of slopes.

A scalable topology aggregation algorithm for QoS routing in hierarchical networks

Topology aggregation is necessary for scalable QoS routing mechanisms. Thekey issue is how to gain good performance while summarizing the topological information. In thispaper, we propose a new method to describe the logical link, which is simple and effective innetwork with additive and constrained concave parameters. We extend the method to network associatedwith multi-parameters. Furthermore, we propose a modified star aggregation algorithm. Simulationsare used to evaluate the performance. The results show that our algorithm is relatively good.

Evaluation of the computational performance of the finite-volume atmospheric model of the IAP/LASG(FAMIL) on a high-performance computer

High computational performance is extremely important for climate system models, especially in ultra-high-resolution model development. In this study, the computational performance of the Finite-volume Atmospheric Model of the IAP/LASG （FAMIL） was comprehensively evaluated on Tianhe-2, which was the world＇s top-ranked supercomputer from June 2013 to May 2016. The standardized Atmospheric Model Inter-comparison Project （AMIP） type of experiment was carried out that focused on the computational performance of each node as well as the simulation year per day （SYPD）, the running cost speedup, and the scalability of the FAMIL. The results indicated that （1） based on five indexes （CPU usage, percentage of CPU kernel mode that occupies CPU time and of message passing waiting time （CPU SW）, code vectorization （VEC）, average of Gflops （Gflops_ AVE）, and peak of Gflops （Gflops_PK））, FAMIL shows excellent computational performance on every Tianhe-2 computing node; （2） considering SYPD and the cost speedup of FAMIL systematically, the optimal Message Passing Interface （MPI） numbers of processors （MNPs） choice appears when FAMIL use 384 and 1536 MNPs for C96 （100 km） and C384 （25 km）, respectively; and （3） FAMIL shows positive scalability with increased threads to drive the model. Considering the fast network speed and acceleration card in the MIC architecture on Tianhe-2, there is still significant room to improve the computational performance of FAMIL.

New scale factor correction scheme for CORDIC algorithm

To overcome the drawbacks such as irregular circuit construction and low system throughput that exist in conventional methods, a new factor correction scheme for coordinate rotation digital computer（ CORDIC） algorithm is proposed. Based on the relationship between the iteration formulae, a new iteration formula is introduced, which leads the correction operation to be several simple shifting and adding operations. As one key part, the effects caused by rounding error are analyzed mathematically and it is concluded that the effects can be degraded by an appropriate selection of coefficients in the iteration formula. The model is then set up in Matlab and coded in Verilog HDL language. The proposed algorithm is also synthesized and verified in field-programmable gate array （FPGA）. The results show that this new scheme requires only one additional clock cycle and there is no change in the elementary iteration for the same precision compared with the conventional algorithm. In addition, the circuit realization is regular and the change in system throughput is very minimal.