摘要：There is a sharp decline in the network performance when the wireless link fails as a data path in the Wireless Network-on-Chip(WiNoC).To counteract this problem,we propose a fault-tolerance mechanism for the efficient retransmission of data in the *** an error is detected in the data transmission process,this mechanism works to feed back the fault information to the source node in real time via fault signal *** the source node,the highest transmission priority is assigned to the backup retransmitted data,and the corresponding direct link is positioned to enable the data packet for its efficient retransmission to the destination node,thereby ensuring efficiency in fault ***,we have improved the receiving port of the wireless router,added the corresponding redundant buffers and mux,and dynamically selected the retransmitted non-faulty data packets to be written to the local router in order to avoid the disorderly retransmission of the data *** evaluation results of this paper demonstrate that compared with the methods which are under different fault conditions,this fault-tolerant method drastically improves the data throughput rate,reduces the delay,effectively guarantees the reliability of the network,and improves the system performance.

摘要：In this paper a new theory referred to as the decrease-radix design （DRD） is proposed, which is found in the research of logic units of ternary （tri-valued） optical computer. Based on the theory proposed, the principles and the regulations of the DRD for making operation units of multi-valued operation with carrying/borrowing free are also presented. The research work has come to the following important conclusion： let D be a special state contained in n physical informative states, then one may figure out any multi-valued processors within n^（n×n） carrying/borrowing free n-valued units by the composition some of n×n×（n-1） simplest basic operating units according to the regulations of DRD proposed in this paper. The detailed systematic way of our design regulations is highlighted step by step in the paper with an example of design of a tri-valued logic optical operating unit. The real architecture, the procedure, and the experimental results of our sample in tri-valued logic operating unit are given. Finally, a re-constructible model of ternary logical optical processor is introduced. The theory proposed in the paper has laid down a solid foundation for the design of re-constructible carrying/borrowing free operating units in ternary optical computers and can be widely used as the designing reference in a variety of multi-valued logic operating units.

摘要：KTX（Keda Torus for eXperiment）is a new reversed field pinch *** KTX plasma control system（PCS）can provide real-time,stable,flexible plasma control which is designed by ASIPP（Institute of Plasma Physics,Chinese Academy of sciences）,based on the Linux cluster system and EPICS（Experimental Physics and Industrial Control System）framework,and developed from DIII-D（Doublet III-D）*** control of the equilibrium field in KTX uses a PID（Proportional-Integral-Derivative）feedback *** control of the gas injection is an open loop *** plasma control simulation system is one part of the plasma control system,which is used to test the plasma control algorithm if it is revised and *** KTX PCS has been successfully tested using HT-7（Hefei Torus 7）experiment data in simulation *** the next phase,an error field feedback control and KTX simulator will be added to the KTX PCS,and the KTX PCS will be applied in experiments in the future.

摘要：In this paper, a class of disturbed networked Euler-Lagrangian systems is investigated to track a general virtual signal under a general directed communication network. Firstly, a class of fixed-time distributed observer is constructed to estimate the leader's state. Secondly, a local anti-disturbance tracking control based on the previous distributed observer is proposed for each follower to achieve the tracking consensus in a fixed time. A simulation example is finally conducted to verify the proposed algorithm.

摘要：Fuzzy entropy was designed for non convex fuzzy membership function using well known Hamming distance *** proposed fuzzy entropy had the same structure as that of convex fuzzy membership *** procedure of fuzzy entropy was proposed by considering fuzzy membership through distance measure,and the obtained results contained more flexibility than the general fuzzy membership ***,characteristic analyses for non convex function were also *** on the mutual information were carried out through the proposed fuzzy entropy and similarity measure,which was also dual structure of fuzzy *** the illustrative example,mutual information was discussed.

摘要：XML data can be represented by a tree or graph and the query processing for XML data requires the structural information among nodes. Designing an efficient labeling scheme for the nodes of Order-Sensitive XML trees is one of the important methods to obtain the excellent management of XML data. Previous labeling schemes such as region and prefix often sacrifice updating performance and suffer increasing labeling space when inserting new nodes. To overcome these limitations, in this paper we propose a new labeling idea of separating structure from order. According to the proposed idea, a novel Prime-based Middle Fraction Labeling Scheme(PMFLS) is designed accordingly, in which a series of algorithms are proposed to obtain the structural relationships among nodes and to support updates. PMFLS combines the advantages of both prefix and region schemes in which the structural information and sequential information are separately expressed. PMFLS also supports Order-Sensitive updates without relabeling or recalculation, and its labeling space is stable. Experiments and analysis on several benchmarks are conducted and the results show that PMFLS is efficient in handling updates and also significantly improves the performance of the query processing with good scalability.

摘要：The efficient and safe operation of large fusion devices strongly relies on the plasma configuration inside the vacuum *** is important to construct the proper plasma equilibrium with a desired plasma *** order to construct the target configuration,a shape constraint module has been developed in the tokamak simulation code（TSC）,which controls the poloidal flux and the magnetic field at several defined control *** is used to construct the double null,lower single null,and quasi-snowflake configurations for the required target shape and calculate the required PF coils *** flexibility and practicability of this method have been verified by the simulated results.

摘要：Visible-Light Communication(VLC) has the potential to provide dense and fast connectivity at low cost. In this paper we propose SFNet, a novel VLC-enabled hybrid data center network that extends the design of wireless Data Center Networks(DCNs) into three further dimensions:(1) fully wireless at the inter-rack level;(2) no need for a centralized control mechanism on wireless links;and(3) no need for any infrastructure-level alterations to data centers. Previous proposals typically cannot realize these three rationales simultaneously. To achieve this vision,the proposed SFNet augments fat-tree by organizing all racks into a wireless small-world network via VLC links. The use of VLC links eliminates hierarchical switches and cables in the wireless network, and thus reduces hardware investment and maintenance costs. To fully exploit the benefits of the topology of SFNet, we further propose its topology design and optimization method, routing scheme, and online flow scheduling algorithm. Comprehensive experiments indicate that SFNet exhibits good topological properties and network performance.

摘要：A dynamic geometry system,as an important application in the field of geometric constraint solving,is widely used in elementary mathematics education;moreover,the dynamic geometry system is also a fundamental environment for automated theorem proving in *** a geometric constraint solving process,a situation involving a critical point is often encountered,and geometric element degeneracy may occur at this ***,the degeneracy situation must be substantively focused on during the learning and exploration ***,many degeneracy situations cannot be completely presented even by the well-known dynamic geometry *** this paper,the mechanisms causing the degeneracy of a geometric element are analyzed,and relevant definitions and formalized descriptions for the problem are provided according to the relevant modern Euclidean geometry *** solve the problem,the data structure is optimized,and a domain model design for the geometric element and the constraint relationships thereof in the dynamic geometry system are formed;furthermore,an update algorithm for the element is proposed based on the novel domain *** addition,instances show that the proposed domain model and the update algorithm can effectively cope with the geometric element degeneracy situations in the geometric constraint solving process,thereby achieving unification of the dynamic geometry drawing and the geometric intuition of the user.

摘要：As the hot line in NP-hard problems research in recent years, backbone analysis is crucial for phase transition, hardness, and algorithm design. Whereas theoretical analysis of backbone and its applications in algorithm design are still at a begin- ning state yet, this paper took the quadratic assignment problem （QAP） as a case study and proved by theoretical analysis that it is NP-hard to find the backbone, i.e., no algorithm exists to obtain the backbone of a QAP in polynomial time. Results of this paper showed that it is reasonable to acquire approximate backbone by inter- section of local optimal solutions. Furthermore, with the method of constructing biased instances, this paper proposed a new meta-heuristic -- biased instance based approximate backbone （BI-AB）, whose basic idea is as follows： firstly, construct a new biased instance for every QAP instance （the optimal solution of the new instance is also optimal for the original one）; secondly, the approximate backbone is obtained by intersection of multiple local optimal solutions computed by some existing algorithm; finally, search for the optimal solutions in the reduced space by fixing the approximate backbone. Work of the paper enhanced the research area of theoretical analysis of backbone. The meta-heuristic proposed in this paper provided a new way for general algorithm design of NP-hard problems as well.