Converting interpreters into compilers

There is an effective and quite general method of manually deriving compilers from programming-language interpreters without dealing directly with machine language. The method is an implementation of the largely theoretical and under-appreciated concept of partial computation, but can be understood on its own terms. It involves the translation of a source program's intermediate form into the interpreter's implementation language. This paper shows how the method can be used to transform both a sample iterative interpreter and a sample recursive interpreter into compilers. The result can be a large gain in program execution speed. Other advantages of the method, including the ease and practicality of applying it, are discussed.     

The Lazy Cook Problem, or Scheduling Two Parallel Machines to Optimize Vehicle Utilization

A cook has to prepare n cakes using an oven with two racks. According to the recipe, the i-th cake has to be baked for exactly a _i minutes. Cakes to be cooked are taken from a table and carried to the oven, and once cooked are carried back to the table by means of a trolley that can carry two cakes at a time. What is the minimum number q ^* of round trips required of the cook? This problem has application to the operation scheduling of transportation systems and to material cutting. A different problem arises according to whether the cook accepts or not to stay near the oven for awhile with the trolley. If the trolley cannot be idle at the oven, an optimum schedule with no oven idle-time always exists: consequently, the trolley schedule is trivial, and the problem is transformed into a set packing. For this case, we propose and test a heuristic method which generates all of the promising columns of the set packing, and solves the resulting problem by branch-and-bound. Instead, if the trolley can be idle at the oven for a limited amount of time, a problem arises to find an optimal schedule of the trolley: in this case we show how to use a scaling technique in order to obtain a very good feasible solution by the method above.     

Bridging the generation gap between text planning and linguistic realization

Text planning is traditionally done as a separate process, independent of linguistic realization. However, I show in this paper that it is essential for a text planner to know the linguistic consequences of its actions. The choice of how to realize an element affects how much information is conveyed (e.g., “Floyd arrived safely in Boston” vs. “Floyd landed safely at Logan”) and what other information can be added (e.g., “Peter was deciding for an hour” vs. *“Peter made a decision for an hour”). The choice of realization also affects how the relative salience of the elements being expressed will be perceived (e.g., “The green car is in the garage” vs. “The car in the garage is green”). I have defined an intermediate level of representation for text planning, called the Text Structure. It is an abstract linguistic level that reflects germane linguistic constraints while abstracting away from syntactic detail. This representation allows the text planner to have greater control over the decisions, so that it can take advantage of the expressiveness of language to convey subtleties of meaning. More importantly, the Text Structure allows the generation process overall to be incremental, since it ensures that the text plan being composed will always be expressible in the language. La planification de textes est habituellement réalisée séparément, sans tenir compte de la réalisation linguistique. Cependant, ľauteur demontre dans cet article qu'il est essentiel à un planificateur de textes de connai̊tre les conséquences linguistiques de ses actions. Le choix de la méhode de réalisation ?un élément influe sur la quantité?informations qui est transmise (par ex.: 〈〈 Floyd est arrivé sain et sauf à Boston 〉〉 et 〈〈 Floyd a atterri sain et sauf àľaéroport Logan 〉〉) et sur quelle autre information peut ětre ajoutée. Le choix de la méthode de réalisation influe également sur la façon dont les caractères saillants des ééments qui sont exprimés seront perçus (par ex.: 〈〈 la voiture verte est dans le garage 〉〉 et 〈〈 la voiture dans le garage est verte 〉〉). L'auteur a défini un niveau intérmediaire de représentation pour la planification de textes qu'il a appelé structure de texte. Il; s'agit ?'un niveau linguistique abstrait qui refléte les contraintes linguistiques appropriées tout en s'éloignant du détail syntaxique. Cette représentation permet au planificateur de textes ?avoir un meilleur contrǒle des décisions, et done de tirer profit de la force ?expression du langage afin de tenir compte des subtiliés de sens. Plus important encore, la structure de texte permet au processus de génération ?ětre incrémentiel, car elle s'assure que le plan de texte en voie de composition soit toujours exprimable dans le langage.     

An integrated automatic test data generation system

The Godzilla automatic test data generator is an integrated collection of tools that implements a relatively new test data generation method—constraint-based testing—that is based on mutation analysis. Constraint-based testing integrates mutation analysis with several other testing techniques, including statement coverage, branch coverage, domain perturbation, and symbolic evaluation. Because Godzilla uses a rule-based approach to generate test data, it is easily extendible to allow new testing techniques to be integrated into the current system. This article describes the system that has been built to implement constraint-based testing. Godzilla's design emphasizes orthogonality and modularity, allowing relatively easy extensions. Godzilla's internal structure and algorithms are described with emphasis on internal structures of the system and the engineering problems that were solved during the implementation.Parts of this research were supported by Contract F30602-85-C-0255 through Rome Air Development Center while the author was a graduate student at the Georgia Institute of Technology.     

水文学的研究方法与理论创新

回顾了水文学在其 30 0余年的形成和发展中曾出现过的若干引人入胜、富有启发性、对学科发展起着重要推动作用的研究成果 .论述了“假设”、“猜想”、“推理”、“比拟”、“综合”和“实验”等研究方法的运用在水文学理论创新中的重要作用 .     

Microstructural change of ultrafine-grained aluminum during high-speed plastic deformation

Effect of strain rate on microstructural change in deformation of the ultrafine grained (UFG) aluminum produced by severe plastic deformation (SPD) was studied. Commercial purity 1100 aluminum sheets were highly strained up to an equivalent strain of 4.8 by the Accumulative Roll-Bonding (ARB) process at ambient temperature. The ARB-processed sheets were found to be filled with pancake-shaped ultrafine grains surrounded by high-angle grain boundaries. The ultrafine grains had a mean grain thickness of 200 nm and a mean grain length of 1100 nm. The ultrafine-grained aluminum sheets were deformed at various strain rates ranging from 2 to 6.0×10⁴ s⁻¹ by conventional rolling, ultra-high-speed rolling, and impact compression. High-speed plastic deformation generates a large amount of heat, inducing coarsening of the ultrafine grains during and after deformation. On the other hand, it was also suggested that high-speed plastic deformation is effective for grain-subdivision, in other words, ultra-grain refinement, if the effect of heat generation is extracted.     

天然气:通向氢能时代的桥梁

文章概述了人类能源利用从柴薪、煤到石油、天然气的探索与转变历程,着重对天然气利用在解决城市燃料和空气污染、提高发电效率、推动分布式发电、生产合成氨和合成甲醇、推动燃料电池转向氢能经济时代等方面的优越性进行了阐述。     

The medium matters: Mining the long-promised merit of group interaction in creative idea generation tasks in a meta-analysis of the electronic group brainstorming literature

This meta-analysis examines the influence of electronic communication media on group idea generation tasks. Data from the following three areas of the brainstorming literature are synthesized to assess differences across performance variables and group member satisfaction: (1) electronic brainstorming (EBS) groups versus traditional face-to-face (FTF) interacting groups, (2) EBS groups versus nominal groups, and (3) EBS versus electronic nominal (e-nominal) groups. The results of this integration show that EBS groups are more productive and more satisfied with the interaction process than FTF groups. Additionally, large EBS groups outperformed nominal groups, whereas small nominal groups outperformed EBS groups. These findings have important implications for electronic collaboration and teamwork in both academic and organizational settings, especially given the recent proliferation of virtual teamwork.     

Chalcogenide Glasses Based on Germanium Disulfide for Second Harmonic Generation

High second‐order susceptibilities are created by thermal poling in bulk germanium disulfide based chalcogenide glasses. Experimental conditions of the poling treatment (temperature, voltage, time) were optimized for each glass composition. The second‐order nonlinear signals were recorded by using the Maker fringes experiment and a second‐order coefficient χ⁽²⁾ up to 8 pm V^–1 was measured in the Ge₂₅Sb₁₀S₆₅ glass. This value is obtained using a simulation based on accurate knowledge of the thickness of the nonlinear layer. Two mechanisms are proposed to explain the creation of a nonlinear layer under the anode: the formation and the migration of charged defects towards the anode may mainly occur in Ge₂₀Ga₅Sb₁₀S₆₅ and Ge₂₅Ga₅S₇₀ glasses, whereas the migration of Na⁺ ions towards the cathode may be responsible for the accumulation of negative charges under the anode in Ge₃₃S₆₇ and Ge₂₅Sb₁₀S₆₅ glasses. Different electronic conductivity behaviors seem to be at the origin of the phenomenon. In parallel, the potential effect of the poling treatment on the structural and electronic properties is studied using Raman spectroscopy and secondary ion mass spectroscopy measurements.     

A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry

The molten iron allocation problem (MIAP) is to allocate molten iron from blast furnaces to steel-making furnaces. The allocation needs to observe the release times of the molten iron defined by the draining plan of the blast furnaces and the transport time between the iron-making and steel-making stages. Time window constraints for processing the molten iron must be satisfied to avoid freezing. The objective is to find a schedule with minimum total weighted completion time. This objective reflects the practical consideration of improving steel-making efficiency and reducing operation cost caused by the need for reheating. Such a problem can be viewed as a parallel machine scheduling problem with time windows which is known to be NP-hard. In this paper, we first formulate the molten iron allocation problem as an integer programming model and then reformulate it as a set partitioning model by applying the Dantzig–Wolfe decomposition. We solve the problem using a column generation-based branch-and-price algorithm. Since the subproblem of column generation is still NP-hard, we propose a state-space relaxation-based dynamic programming algorithm for the subproblem. Computational experiments demonstrate that the proposed algorithm is capable of solving problems with up to 100 jobs to optimality within a reasonable computation time.