this paper exhibits the power of programming with dependent types by dint of embedding three domain-specific languages: Cryptol, a language for cryptographic protocols;a small data description language;and relational ...
详细信息
this paper exhibits the power of programming with dependent types by dint of embedding three domain-specific languages: Cryptol, a language for cryptographic protocols;a small data description language;and relational algebra. Each example demonstrates particular design patterns inherent to dependently-typed programming. Documenting these techniques paves the way for further research in domain-specific embedded type systems.
Massively Multiplayer Online Human in the Loop Simulation (MMOHILS) is a novel simulation technique which borrows heavily from the field of gaming. this naturally raises the question: is a general-purpose programming ...
详细信息
ISBN:
(纸本)9781424417865
Massively Multiplayer Online Human in the Loop Simulation (MMOHILS) is a novel simulation technique which borrows heavily from the field of gaming. this naturally raises the question: is a general-purpose programming language such as Java (which has been used to program games) suitable for implementing a MMOHILS? Our work shows that, yes, Java can meet the demands of a real-time, multiple-man-in-the-loop simulation.
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP) that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show ...
详细信息
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP) that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation dominates the one in [D. Cvetkovic, M. Cangalovic, and V. Kovacevic-Vujcic, Semidefinite programming methods for the symmetric traveling salesman problem, in Proceedings of the 7thinternational IPCO conference on Integer programming and Combinatorial Optimization, Springer-Verlag, London, UK, 1999, pp. 126-136]. Unlike the bound of Cvetkovic et al., the new SDP bound is not dominated by the Held-Karp linear programming bound, or vice versa.
Control Network programming (CNP) is a style of high-level programming created to be especially convenient for solving problems with natural graph-like representation. Showing that this goal has been achieved is the p...
详细信息
ISBN:
(纸本)9780769531311
Control Network programming (CNP) is a style of high-level programming created to be especially convenient for solving problems with natural graph-like representation. Showing that this goal has been achieved is the purpose of the current report. CNP solutions to four problems representative of four important problem classes are presented. Most of the problem descriptions are nondeterministic and declarative, without specifying an algorithmic solution. these natural problem descriptions are easily converted into working Control Network programs.
Military task programming is an important foundation in military warfare simulations. Presently, scenarios in joint military warfare are built not so good to meet the requirement of aggregate-level warfare simulations...
详细信息
ISBN:
(纸本)9781424417865
Military task programming is an important foundation in military warfare simulations. Presently, scenarios in joint military warfare are built not so good to meet the requirement of aggregate-level warfare simulations and the requirement of intelligent decision in real time simulations. A method based on FSM model of aggregate-level military warfare decision-making and vehicle-level action decision-making is proposed in this paper. the programming process of joint military warfare with decision-making functions can be realized through the programming of these two levels, and the dynamic decision-making and execution of mission can be completed successfully.
In this paper, a tabu search (TS) method is proposed to find a global solution for fuzzy linear programming (FLP). Two additional factors, distribution factor (DF) and similarity factor (SF), are also introduced for T...
详细信息
ISBN:
(纸本)9780769531311
In this paper, a tabu search (TS) method is proposed to find a global solution for fuzzy linear programming (FLP). Two additional factors, distribution factor (DF) and similarity factor (SF), are also introduced for TS to enhance the searching performance. the application of DF and SF makes the TS to surf in a larger search space and reduces the possibility of re-searching the visited areas. A simulation is done to show the efficiency of the proposed study.
Cultivating high quality talents major in simulation is important to developing simulation discipline. Combined withthe Northwestern Polytechnical University's education on master and doctor of simulation discipl...
详细信息
ISBN:
(纸本)9781424417865
Cultivating high quality talents major in simulation is important to developing simulation discipline. Combined withthe Northwestern Polytechnical University's education on master and doctor of simulation discipline recently, this paper presents the education goals, methods and products etc, Having analyzed it and giving some solutions on the problems such as student's subject changing, government's investment, discipline system building. the paper has some worthiness to reference by other colleges on simulation subject education and talents cultivating.
Minimally Synchronous Parallel ML (MSPML) is a functional parallel programming language. It is based on a small number of primitives on a parallel data structure. MSPML programs are written like usual sequential ML pr...
详细信息
ISBN:
(纸本)9783540681052
Minimally Synchronous Parallel ML (MSPML) is a functional parallel programming language. It is based on a small number of primitives on a parallel data structure. MSPML programs are written like usual sequential ML program and use this small set of functions. MSPML is deterministic and deadlock free. the execution time of the programs can be estimated. Divide-and-conquer is a natural way of expressing parallel algorithms. MSPML is a flat language: it is not possible to split the parallel machine in order to implement divide-and-conquer parallel algorithms. this paper presents an extension of MSPML to deal withthis kind of algorithms: a parallel composition primitive.
暂无评论