ON THE DANGLING-BOND RELAXATION PROBLEM IN HYDROGENATED AMORPHOUS-SILICON

The influence of pulsed bias light excitation on the absorption in the defect region of undoped a-Si:H film has been investigated. Ac constant photocurrent method has been used to measure the absorption spectrum. The absorption in the defect region increases with the light pulse duration.The analysis of obtained results does not support the existence of a long time relaxation process of dangling-bond states in a-Si:H.

Solving MIN UR problem by triangle evolution algorithm with archiving and niche techniques

In this paper, as an extension of minimum unsatisfied linear relations problem (MIN ULR), the minimum unsatisfied relations (MIN UR) problem is investigated. A triangle evolution algorithm with archiving and niche techniques is proposed for MIN UR problem. Different with algorithms in literature, it solves MIN problem directly, rather than transforming it into many sub-problems. The proposed algorithm is also applicable for the special case of MIN UR, in which it involves some mandatory relations. Numerical results show that the algorithm is effective for MIN UR problem and it outperforms Sadegh's algorithm in sense of the resulted minimum inconsistency number, even though the test problems are linear.

A multi-moment finite volume formulation for shallow water equations on unstructured mesh

A novel and accurate finite volume method has been presented to solve the shallow water equations on unstructured grid in plane geometry. In addition to the volume integrated average (VIA moment) for each mesh cell, the point values (PV moment) defined on cell boundary are also treated as the model variables. The volume integrated average is updated via a finite volume formulation, and thus is numerically conserved, while the point value is computed by a point-wise Riemann solver. The cell-wise local interpolation reconstruction is built based on both the VIA and the PV moments, which results in a scheme of almost third order accuracy. Efforts have also been made to formulate the source term of the bottom topography in a way to balance the numerical flux function to satisfy the so-called C-property. The proposed numerical model is validated by numerical tests in comparison with other methods reported in the literature. (C) 2010 Elsevier Inc. All rights reserved.

Solving the coastal eutrophication problem by large scale seaweed cultivation

Eutrophication is becoming a serious problem in coastal waters in many parts of the world. It induces the phytoplankton blooms including 'Red Tides', followed by heavy economic losses to extensive aquaculture area. Some cultivated seaweeds have very high productivity and could absorb large quantities of N, P, CO2, produce large amount of O-2 and have excellent effect on decreasing eutrophication. The author believes that seaweed cultivation in large scale should be a good solution to the eutrophication problem in coastal waters. To put this idea into practice, four conditions should be fulfilled: (a) Large-scale cultivation could be conducted within the region experiencing eutrophication. (b) Fundamental scientific and technological problems for cultivation should have been solved. (c) Cultivation should not impose any harmful ecological effects. (d) Cultivation must be economically feasible and profitable. In northern China, large-scale cultivation of Laminaria japonica Aresch. has been encouraged for years to balance the negative effects from scallop cultivation. Preliminary research in recent years has shown that Gracilaria lemaneiformis (Bory) Daws. and Porphyra haitanensis Chang et Zheng are the two best candidates for this purpose along the Chinese southeast to southern coast from Fujian to Guangdong, Guangxi and Hong Kong. Gracilaria tenuistipitata var. liui Chang et Xia is promising for use in pond culture condition with shrimps and fish.

Evaluation of a combined wavelet and a combined principal component analysis classification system for BCG diagnostic problem

Heart disease is one of the main factor causing death in the developed countries. Over several decades, variety of electronic and computer technology have been developed to assist clinical practices for cardiac performance monitoring and heart disease diagnosis. Among these methods, Ballistocardiography (BCG) has an interesting feature that no electrodes are needed to be attached to the body during the measurement. Thus, it is provides a potential application to asses the patients heart condition in the home. In this paper, a comparison is made for two neural networks based BCG signal classification models. One system uses a principal component analysis (PCA) method, and the other a discrete wavelet transform, to reduce the input dimensionality. It is indicated that the combined wavelet transform and neural network has a more reliable performance than the combined PCA and neural network system. Moreover, the wavelet transform requires no prior knowledge of the statistical distribution of data samples and the computation complexity and training time are reduced.

Summer diet of two sympatric species of raptors Upland Buzzard (Buteo hemilasius) and Eurasian Eagle Owl (Bubo bubo) in alpine meadow: problem of coexistence

Summer diets of two sympatric raptors Upland Buzzards (Buteo hemilasius Temminck et Schlegel) and Eurasian Eagle Owls (Bubo bubo L. subsp. Hemachalana Hume) were studied in an alpine meadow (3250 m a.s.l.) on Qinghai-Tibet Plateau, China. Root voles Microtus oeconomus Pallas, plateau pikas Ochotona curzoniae Hodgson, Gansu pikas O. cansus Lyon and plateau zokors Myospalax baileyi Thomas were the main diet components of Upland Buzzards as identified through the pellets analysis with the frequency of 57, 20, 19 and 4%, respectively. The four rodent species also were the main diet components of Eurasian Eagle Owls basing on the pellets and prey leftovers analysis with the frequency of 53, 26, 13 and 5%, respectively. The food niche breadth indexes of Upland Buzzards and Eurasian Eagle Owls were 1.60 and 1.77 respectively (higher value of the index means the food niche of the raptor is broader), and the diet overlap index of the two raptors was larger (C-ue = 0.90) (the index range from 0 - no overlap - to I - complete overlap). It means that the diets of Upland Buzzards and Eurasian Eagle Owls were similar (Two Related Samples Test, Z = -0.752, P = 0.452). The classical resource partitioning theory can not explain the coexistence of Upland Buzzards and Eurasian Eagle Owls in alpine meadows of Qinghai-Tibet Plateau. However, differences in body size, predation mode and activity rhythm between Upland Buzzards and Eurasian Eagle Owls may explain the coexistence of these two sympatric raptors.

工艺计划选择的图论方法

Kusiak和Finke讨论了工艺计划选择问题,并对此建立了图论和整数规划模型。本文给出一个修改的模型,模型求解归结为求非循环有向图的最短路径,使问题求解大为简化。

Generalized Low-Rank Approximations

We study the frequent problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving {\\em weighted} low rank approximation problems, which, unlike simple matrix factorization problems, do not admit a closed form solution in general. We analyze, in addition, the nature of locally optimal solutions that arise in this context, demonstrate the utility of accommodating the weights in reconstructing the underlying low rank representation, and extend the formulation to non-Gaussian noise models such as classification (collaborative filtering).

The Grasping Problem: Toward Task-Level Programming for an Articulated Hand

This report presents a system for generating a stable, feasible, and reachable grasp of a polyhedral object. A set of contact points on the object is found that can result in a stable grasp; a feasible grasp is found in which the robot contacts the object at those contact points; and a path is constructed from the initial configuration of the robot to the stable, feasible final grasp configuration. The algorithm described in the report is designed for the Salisbury hand mounted on a Puma 560 arm, but a similar approach could be used to develop grasping systems for other robots.

Natural Language Input for a Computer Problem Solving System

The STUDENT problem solving system, programmed in LISP, accepts as input a comfortable but restricted subset of English which can express a wide variety of algebra story problems. STUDENT finds the solution to a large class of these problems. STUDENT can utilize a store of global information not specific to any one problem, and may make assumptions about the interpretation of ambiguities in the wording of the problem being solved. If it uses such information or makes any assumptions, STUDENT communicates this fact to the user. The thesis includes a summary of other English language questions-answering systems. All these systems, and STUDENT, are evaluated according to four standard criteria. The linguistic analysis in STUDENT is a first approximation to the analytic portion of a semantic theory of discourse outlined in the thesis. STUDENT finds the set of kernel sentences which are the base of the input discourse, and transforms this sequence of kernel sentences into a set of simultaneous equations which form the semantic base of the STUDENT system. STUDENT then tries to solve this set of equations for the values of requested unknowns. If it is successful it gives the answers in English. If not, STUDENT asks the user for more information, and indicates the nature of the desired information. The STUDENT system is a first step toward natural language communication with computers. Further work on the semantic theory proposed should result in much more sophisticated systems.

Truth Maintenance Systems for Problem Solving

The thesis developed here is that reasoning programs which take care to record the logical justifications for program beliefs can apply several powerful, but simple, domain-independent algorithms to (1) maintain the consistency of program beliefs, (2) realize substantial search efficiencies, and (3) automatically summarize explanations of program beliefs. These algorithms are the recorded justifications to maintain the consistency and well founded basis of the set of beliefs. The set of beliefs can be efficiently updated in an incremental manner when hypotheses are retracted and when new information is discovered. The recorded justifications also enable the pinpointing of exactly whose assumptions which support any particular belief. The ability to pinpoint the underlying assumptions is the basis for an extremely powerful domain-independent backtracking method. This method, called Dependency-Directed Backtracking, offers vastly improved performance over traditional backtracking algorithms.

Parallelism in Manipulator Dynamics

This paper addresses the problem of efficiently computing the motor torques required to drive a lower-pair kinematic chain (e.g., a typical manipulator arm in free motion, or a mechanical leg in the swing phase) given the desired trajectory; i.e., the Inverse Dynamics problem. It investigates the high degree of parallelism inherent in the computations, and presents two "mathematically exact" formulations especially suited to high-speed, highly parallel implementations using special-purpose hardware or VLSI devices. In principle, the formulations should permit the calculations to run at a speed bounded only by I/O. The first presented is a parallel version of the recent linear Newton-Euler recursive algorithm. The time cost is also linear in the number of joints, but the real-time coefficients are reduced by almost two orders of magnitude. The second formulation reports a new parallel algorithm which shows that it is possible to improve upon the linear time dependency. The real time required to perform the calculations increases only as the [log2] of the number of joints. Either formulation is susceptible to a systolic pipelined architecture in which complete sets of joint torques emerge at successive intervals of four floating-point operations. Hardware requirements necessary to support the algorithm are considered and found not to be excessive, and a VLSI implementation architecture is suggested. We indicate possible applications to incorporating dynamical considerations into trajectory planning, e.g. it may be possible to build an on-line trajectory optimizer.

Motion Planning with Six Degrees of Freedom

The motion planning problem is of central importance to the fields of robotics, spatial planning, and automated design. In robotics we are interested in the automatic synthesis of robot motions, given high-level specifications of tasks and geometric models of the robot and obstacles. The Mover's problem is to find a continuous, collision-free path for a moving object through an environment containing obstacles. We present an implemented algorithm for the classical formulation of the three-dimensional Mover's problem: given an arbitrary rigid polyhedral moving object P with three translational and three rotational degrees of freedom, find a continuous, collision-free path taking P from some initial configuration to a desired goal configuration. This thesis describes the first known implementation of a complete algorithm (at a given resolution) for the full six degree of freedom Movers' problem. The algorithm transforms the six degree of freedom planning problem into a point navigation problem in a six-dimensional configuration space (called C-Space). The C-Space obstacles, which characterize the physically unachievable configurations, are directly represented by six-dimensional manifolds whose boundaries are five dimensional C-surfaces. By characterizing these surfaces and their intersections, collision-free paths may be found by the closure of three operators which (i) slide along 5-dimensional intersections of level C-Space obstacles; (ii) slide along 1- to 4-dimensional intersections of level C-surfaces; and (iii) jump between 6 dimensional obstacles. Implementing the point navigation operators requires solving fundamental representational and algorithmic questions: we will derive new structural properties of the C-Space constraints and shoe how to construct and represent C-Surfaces and their intersection manifolds. A definition and new theoretical results are presented for a six-dimensional C-Space extension of the generalized Voronoi diagram, called the C-Voronoi diagram, whose structure we relate to the C-surface intersection manifolds. The representations and algorithms we develop impact many geometric planning problems, and extend to Cartesian manipulators with six degrees of freedom.