The deposition of small particles from a turbulent air flow in a curved duct

The paper describes an experimental and theoretical study of the deposition of small spherical particles from a turbulent air flow in a curved duct. The objective was to investigate the interaction between the streamline curvature of the primary flow and the turbulent deposition mechanisms of diffusion and turbophoresis. The experiments were conducted with particles of uranine (used as a fluorescent tracer) produced by an aerosol generator. The particles were entrained in an air flow which passed vertically downwards through a long straight channel of rectangular cross-section leading to a 90° bend. The inside surfaces of the channel and bend were covered with tape to collect the deposited particles. Following a test run the tape was removed in sections, the uranine was dissolved in sodium hydroxide solution and the deposition rates established by measuring the uranine concentration with a luminescence spectrometer. The experimental results were compared with calculations of particle deposition in a curved duct using a computer program that solved the ensemble-averaged particle mass and momentum conservation equations. A particle density-weighted averaging procedure was used and the equations were expressed in terms of the particle convective, rather than total, velocity. This approach provided a simpler formulation of the particle turbulence correlations generated by the averaging process. The computer program was used to investigate the distance required to achieve a fully-developed particle flow in the straight entry channel as well as the variation of the deposition rate around the bend. The simulations showed good agreement with the experimental results. © 2012 Elsevier Ltd.

The aeroacoustics of transonic helicopter blades

One of the most important issues facing the helicopter industry today is helicopter noise, in particular transonic rotor noise. It is the main factor limiting cruise speeds, and there is real demand for efficient and reliable prediction methods which can be used in the rotor design process. This paper considers the Ffowcs Williams-Hawkings equation applied to a permeable control surface. The surface is chosen to be as small as possible, while enclosing both the blade and any transonic flow regions. This allows the problematic quadrupole term to always be neglected, and requires only near field CFD input data. It is therefore less computationally intensive than existing prediction methods, and moreover retains the physical interpretation of the sources in terms of thickness, loading and shock-associated noise. A computer program has been developed which implements the permeable surface form of retarded time formulation. The program has been validated and subsequently used to validate an acoustic 2-D CFD code. It is fast and reliable for subsonic motion, but it is demonstrated that it cannot be used at high subsonic or supersonic speeds. A second computer program implementing a more general formulation has also been developed and is presently being validated. This general formulation can be applied at high subsonic and supersonic speeds, except under one specific condition. © 2002 by the author(s). Published by the American Institute of Aeronautics and Astronautics, Inc.

AI in the 21st century - With historical reflections

The discipline of Artificial Intelligence (AI) was born in the summer of 1956 at Dartmouth College in Hanover, New Hampshire. Half of a century has passed, and AI has turned into an important field whose influence on our daily lives can hardly be overestimated. The original view of intelligence as a computer program - a set of algorithms to process symbols - has led to many useful applications now found in internet search engines, voice recognition software, cars, home appliances, and consumer electronics, but it has not yet contributed significantly to our understanding of natural forms of intelligence. Since the 1980s, AI has expanded into a broader study of the interaction between the body, brain, and environment, and how intelligence emerges from such interaction. This advent of embodiment has provided an entirely new way of thinking that goes well beyond artificial intelligence proper, to include the study of intelligent action in agents other than organisms or robots. For example, it supplies powerful metaphors for viewing corporations, groups of agents, and networked embedded devices as intelligent and adaptive systems acting in highly uncertain and unpredictable environments. In addition to giving us a novel outlook on information technology in general, this broader view of AI also offers unexpected perspectives into how to think about ourselves and the world around us. In this chapter, we briefly review the turbulent history of AI research, point to some of its current trends, and to challenges that the AI of the 21st century will have to face. © Springer-Verlag Berlin Heidelberg 2007.

Automated voltammetric system for shipboard determination of metal speciation in sea water

An automated and semi-intelligent voltammetric system is described for trace metal analysis. The system consists of a voltammeter interfaced with a personal computer, a sample changer, 2 peristaltic pumps, a motor burette and a hanging mercury drop electrode. The system carries out fully automatically approximately 5 metal determinations per hour (including at least 3 repetitive scans and calibration by standard addition) at trace levels encountered in clean sea water. The computer program decides what level of standard addition to use and evaluates the data prior to switching to the next sample. Alternatively, the system can be used to carry out complexing ligand titration with copper whilst recording the labile copper concentration; in this mode up to 8 full titrations are carried out per day. Depth profiles for chromium speciation in the Mediterranean Sea and a profile for copper complexing ligand concentrations in the North Atlantic Ocean measured on board-ship with the system are presented. The chromium speciation was determined using a new method to differentiate between Cr(III) and Cr(VI) utilizing adsorption of Cr(III) on silica particles.

Consensus scoring for enriching near-native structures from protein-protein docking decoys

The identification of near native protein-protein complexes among a set of decoys remains highly challenging. A stategy for improving the success rate of near native detection is to enrich near native docking decoys in a small number of top ranked decoys. Recently, we found that a combination of three scoring functions (energy, conservation, and interface propensity) can predict the location of binding interface regions with reasonable accuracy. Here, these three scoring functions are modified and combined into a consensus scoring function called ENDES for enriching near native docking decoys. We found that all individual scores result in enrichment for the majority of 28 targets in ZDOCK2.3 decoy set and the 22 targets in Benchmark 2.0. Among the three scores, the interface propensity score yields the highest enrichment in both sets of protein complexes. When these scores are combined into the ENDES consensus score, a significant increase in enrichment of near-native structures is found. For example, when 2000 dock decoys are reduced to 200 decoys by ENDES, the fraction of near-native structures in docking decoys increases by a factor of about six in average. ENDES was implemented into a computer program that is available for download at http://sparks.informatics.iupui.edu.

DNA fingerprinting of selected Laminaria (Phaeophyta) gametophytes by RAPD markers

Random amplified polymorphism DNA (RAPD) analysis was applied to germplasm characterization in 33 different selected Laminaria male and female gametophytes. The positional homology of the RAPD analysis using sequence characterized applied region (SCAR) method was successfully conducted. A total of 233 polymorphic loci were obtained from 18 selected primers after screening, of which 27 stable and clear bands were selected to construct a fingerprint map for discrimination of each gametophyte. Seven RAPD markers from five primers were finally determined by a computer program to construct the fingerprint map. Three specific markers closely related with gametophytes were obtained and were converted to gametophytic SCAR markers, the first SCAR marker report on Laminaria germplasm and applicable to cultivars identification. These results demonstrated the feasibility of applying RAPD markers to germplasm characterization in selected Laminaria gametophytes, and can provide a molecular basis for breeding new Laminaria strains. (C) 2004 Elsevier B.V. All rights reserved.

机器人语言研究

本文从信息控制的角度出发将机器人语言定义为能处理某些特定的“外部设备”的计算机程序设计语言。并将机器人语言成份分为两大部分,即机器人核心语言和机器人专用语言。然后分别综述了机器人专用语言和机器人核心语言的进展情况。

Descriptive Simulation: Combining Symbolic and Numerical Methods in the Analysis of Chemical Reaction Mechanisms

The Kineticist's Workbench is a computer program currently under development whose purpose is to help chemists understand, analyze, and simplify complex chemical reaction mechanisms. This paper discusses one module of the program that numerically simulates mechanisms and constructs qualitative descriptions of the simulation results. These descriptions are given in terms that are meaningful to the working chemist (e.g., steady states, stable oscillations, and so on); and the descriptions (as well as the data structures used to construct them) are accessible as input to other programs.

The Bifurcation Interpreter: A Step Towards the Automatic Analysis of Dynamical Systems

The Bifurcation Interpreter is a computer program that autonomously explores the steady-state orbits of one-parameter families of periodically- driven oscillators. To report its findings, the Interpreter generates schematic diagrams and English text descriptions similar to those appearing in the science and engineering research literature. Given a system of equations as input, the Interpreter uses symbolic algebra to automatically generate numerical procedures that simulate the system. The Interpreter incorporates knowledge about dynamical systems theory, which it uses to guide the simulations, to interpret the results, and to minimize the effects of numerical error.

Toward a Theory of Representation Design

This research is concerned with designing representations for analytical reasoning problems (of the sort found on the GRE and LSAT). These problems test the ability to draw logical conclusions. A computer program was developed that takes as input a straightforward predicate calculus translation of a problem, requests additional information if necessary, decides what to represent and how, designs representations capturing the constraints of the problem, and creates and executes a LISP program that uses those representations to produce a solution. Even though these problems are typically difficult for theorem provers to solve, the LISP program that uses the designed representations is very efficient.

Symbolic Mathematical Laboratory

A large computer program has been developed to aid applied mathematicians in the solution of problems in non-numerical analysis which involve tedious manipulations of mathematical expressions. The mathematician uses typed commands and a light pen to direct the computer in the application of mathematical transformations; the intermediate results are displayed in standard text-book format so that the system user can decide the next step in the problem solution. Three problems selected from the literature have been solved to illustrate the use of the system. A detailed analysis of the problems of input, transformation, and display of mathematical expressions is also presented.

Determining the Scope of English Quantifiers

How can one represent the meaning of English sentences in a formal logical notation such that the translation of English into this logical form is simple and general? This report answers this question for a particular kind of meaning, namely quantifier scope, and for a particular part of the translation, namely the syntactic influence on the translation. Rules are presented which predict, for example, that the sentence: Everyone in this room speaks at least two languages. has the quantifier scope AE in standard predicate calculus, while the sentence: At lease two languages are spoken by everyone in this room. has the quantifier scope EA. Three different logical forms are presented, and their translation rules are examined. One of the logical forms is predicate calculus. The translation rules for it were developed by Robert May (May 19 77). The other two logical forms are Skolem form and a simple computer programming language. The translation rules for these two logical forms are new. All three sets of translation rules are shown to be general, in the sense that the same rules express the constraints that syntax imposes on certain other linguistic phenomena. For example, the rules that constrain the translation into Skolem form are shown to constrain definite np anaphora as well. A large body of carefully collected data is presented, and used to assess the empirical accuracy of each of the theories. None of the three theories is vastly superior to the others. However, the report concludes by suggesting that a combination of the two newer theories would have the greatest generality and the highest empirical accuracy.

Causal and Teleological Reasoning in Circuit Recognition

This thesis presents a theory of human-like reasoning in the general domain of designed physical systems, and in particular, electronic circuits. One aspect of the theory, causal analysis, describes how the behavior of individual components can be combined to explain the behavior of composite systems. Another aspect of the theory, teleological analysis, describes how the notion that the system has a purpose can be used to aid this causal analysis. The theory is implemented as a computer program, which, given a circuit topology, can construct by qualitative causal analysis a mechanism graph describing the functional topology of the system. This functional topology is then parsed by a grammar for common circuit functions. Ambiguities are introduced into the analysis by the approximate qualitative nature of the analysis. For example, there are often several possible mechanisms which might describe the circuit's function. These are disambiguated by teleological analysis. The requirement that each component be assigned an appropriate purpose in the functional topology imposes a severe constraint which eliminates all the ambiguities. Since both analyses are based on heuristics, the chosen mechanism is a rationalization of how the circuit functions, and does not guarantee that the circuit actually does function. This type of coarse understanding of circuits is useful for analysis, design and troubleshooting.

The structure of nano sized poorly-crystalline iron oxy-hydroxides

In this thesis the structures of three nano sized poorly-crystalline iron oxy-hydroxides, feroxyhyte, ferrihydrite and schwertmannite, are studied and analyzed with the aim of clarifying some dubious structural features. The widely used Rietveld re�nement and EXAFS analysis are employed in order to address the consistency of the structural models proposed for these materials, one of which, feroxyhyte, is suggested in this thesis. Furthermore, a new computer program exploiting the Reverse Monte Carlo algorithm and the Debye Scattering Equation is presented and used in order to analyze the elusive structures of these iron oxy-hydroxides.

Pricing Algorithms For a Two-sided Internet Advertisement Market

The Google AdSense Program is a successful internet advertisement program where Google places contextual adverts on third-party websites and shares the resulting revenue with each publisher. Advertisers have budgets and bid on ad slots while publishers set reserve prices for the ad slots on their websites. Following previous modelling efforts, we model the program as a two-sided market with advertisers on one side and publishers on the other. We show a reduction from the Generalised Assignment Problem (GAP) to the problem of computing the revenue maximising allocation and pricing of publisher slots under a first-price auction. GAP is APX-hard but a (1-1/e) approximation is known. We compute truthful and revenue-maximizing prices and allocation of ad slots to advertisers under a second-price auction. The auctioneer's revenue is within (1-1/e) second-price optimal.