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.
In this paper, DNA probes tagged with fluorescent label and a surface-based DNA algorithm are proposed to solve the 0-1 programming problem which inequalities' coefficients expand to arbitrary integers. the algori...
详细信息
ISBN:
(纸本)9781424420957
In this paper, DNA probes tagged with fluorescent label and a surface-based DNA algorithm are proposed to solve the 0-1 programming problem which inequalities' coefficients expand to arbitrary integers. the algorithm works in O(m) steps for 0-1 programming problem with m constraint inequalities.
Dedicated machine constraint is one of the new challenges introduced in photolithography machinery of the semiconductor manufacturing system due to natural bias. Previous researches either did not take the constraint ...
详细信息
ISBN:
(纸本)9780769531311
Dedicated machine constraint is one of the new challenges introduced in photolithography machinery of the semiconductor manufacturing system due to natural bias. Previous researches either did not take the constraint into account or the proposed heuristic approach might not fit the fast-changing market of semiconductor manufacturing. In this paper, we propose a new framework for the issue of the dedicated machine constraint in semiconductor manufacturing based on an Integer Linear Program (ILP) framework. the ILP framework provides an efficient approach to minimize the producing cost and obtain a global optimal solution in an efficient time. We also present the experiments to validate the proposed approach.
the goal of this project is to develop a tangible programming language for use in informal science learning and to evaluate its effectiveness. As part of this effort, we will explore the relative strengths and weaknes...
详细信息
ISBN:
(纸本)9781595939944
the goal of this project is to develop a tangible programming language for use in informal science learning and to evaluate its effectiveness. As part of this effort, we will explore the relative strengths and weaknesses of tangible and graphical interaction for this task in the context of an exhibit on robotics on display at the Boston Museum of Science. We hypothesize that a tangible programming language will be practical for use in informal science settings and will offer significant advantages in terms of learning and quality of interaction.
Developing abilities to master modern technologies and skills for problem solving are among the most important capabilities of an educated future citizen in a knowledge society. Problem solving by means of programming...
详细信息
ISBN:
(纸本)9781906638221
Developing abilities to master modern technologies and skills for problem solving are among the most important capabilities of an educated future citizen in a knowledge society. Problem solving by means of programming does not lose its importance in a contemporary school equipped with modern information technologies and remains a highly important part in the understanding of information processing. programming with emphasis on algorithms remains core to the international Olympiads in Informatics and other competitions in Computer Science. Consequently, the introduction of algorithms and programming as an abstract and powerful tool for understanding the algorithmic world and information technologies is advocated and supported by expert recommendations, e.g. as given by UNESCO and IFIP. In Lithuania, the idea of teaching algorithms and programming by distance (originally by correspondence using the ordinary post service, later applying internet-based means such as electronic mail and virtual learning environments) was started in the early 1980s. the Young Programmers School was set up at the research Institute of Mathematics and Informatics in 1981 and it has continued until now. It might be one of the oldest continually running distance learning schools for programming anywhere in the world. Various teaching methods have been used to attract students and to help them to learn deeper programming e.g. an overview for each submitted work, detailed teacher comments, questions and exercises depending on the student level, additional exercises and tasks. there is no doubt that learning algorithms and programming is effective only when students are actively involved - that is why solving tasks is the highest priority in the school. Tasks have to be selected to match student ability, they must cover as many theoretical problems as possible, and teach students algorithms and programming methods. Evaluation of developed algorithms is mainly a combination of two methods: it is
this paper presents a new neural network for solving linear programming problems. After defining the neural dynamics of the proposed neural network, we have shown the existence of an equilibrium point and the asymptot...
详细信息
ISBN:
(纸本)9781424420957
this paper presents a new neural network for solving linear programming problems. After defining the neural dynamics of the proposed neural network, we have shown the existence of an equilibrium point and the asymptotic stability of the equilibrium point of the neural dynamics. As the time parameter approaches infinity, an optimal solution of the linear programming problem is shown to be the equilibrium point of the neural dynamics, and each equilibrium point is optimal to the problem. Two numerical results indicate that the proposed neural network is an efficient technique and stable independent of the starting point.
Reasoning, specification, and verification of Aspect-Oriented (AO) programs presents unique challenges especially as such programs evolve over time. Components, base-code and aspects alike, may be easily added, remove...
详细信息
ISBN:
(纸本)9781605581101
Reasoning, specification, and verification of Aspect-Oriented (AO) programs presents unique challenges especially as such programs evolve over time. Components, base-code and aspects alike, may be easily added, removed, interchanged, or presently unavailable at unpredictable frequencies. Consequently, modular reasoning of such programs is highly attractive as it enables tractable evolution, otherwise necessitating that the entire program be reexamined each time a component is changed. It is well known, however, that modular reasoning about AO programs is difficult. In this paper, we present our ongoing work in constructing a rely-guarantee style reasoning system for the Aspect-Oriented programming (AOP) paradigm, adopting a trace-based approach to deal withthe plug-n-play nature inherent to these programs, thus easing AOP evolution. Copyright 2008 ACM.
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 ...
详细信息
ISBN:
(纸本)9781595939197
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.
Instruction scheduling is an important issue in the compiler optimization for embedded systems. the instruction scheduling problem is mainly solved heuristically since finding an optimal solution requires significant ...
详细信息
ISBN:
(纸本)9781424425389
Instruction scheduling is an important issue in the compiler optimization for embedded systems. the instruction scheduling problem is mainly solved heuristically since finding an optimal solution requires significant computational resources and, in general, the problem of optimally scheduling instructions is known to be NP-Complete. the development of processors with pipelines and multiple functional units has increased the demands on compiler writers to write complex instruction scheduling algorithms. these algorithms are required to ensure that the most efficient use of resources, i.e. the functional units and pipelines of the processor, is made due to the increased complexity of processor architectures. In this paper, the specific problem of automatically creating instruction scheduling heuristics is addressed.
We present a study of the university post-enrolment timetabling problem, proposed as Track 2 of the 2007international Timetabling Competition. We approach the problem using several techniques, particularly local sear...
详细信息
暂无评论