作物保护剂对磺酰脲类除草剂解毒效应述评

结合国内外学者以及作者自己对作物保护剂和磺酰脲类除草剂的研究,概述了保护剂对磺酰脲类除草剂的解毒作用。不同环境条件对保护剂的解毒作用有一定的影响,并从理论上证明保护剂通过抑制核苷二磷酸（RDP）,并间接抑制乙酰乳酸合成酶（ALS）的活性,从而对磺酰脲类除草剂进行解毒效应．     

定量结构-活性关系研究中变量挑选的进化算法

本文将进化算法引入定量结构-活性关系研究中，以解决变量挑选的难题．对杀幼虫剂和磺酸际除草剂两个体系的应用表明，该进化算法是一种非常有效的变量挑选方法，并且可以获得多个高质量的定量结构-活性关系模型，另外，算法中用于评价模型质显的评价函数的选取是非常关键的。     

磺酰脲类除草剂定量结构-生物降解性关系(QSBR)研究

选取了分子量、熔点、蒸气压、溶解度、LogKOW pKa,MCI,ELUMO和几个代表性原子所带的电荷等具有代表性的参数,结合化合物好氧生物降解作用的半衰期(HL),通过多元线性回归方法对磺酰脲类除草剂的生物降解性进行了定量结构一生物降解性(QSBR)研究,建立了相应的QSBR模型,R^2=0．941。并利用该模型对氯磺隆进行预测,结果表明,该模型对氯磺隆的好氧生物降解性具有良好的预测能力。     

HelSweeper: Screw-sweeps of canal surfaces

A tube is a solid bounded by the union of a one-parameter family of circles that may be decomposed into canal-surfaces and planar disks or annuli. A screw-sweep is the region swept by a shape during a screw motion. HelSweeper computes the boundary of a screw-sweep of an arbitrary union of tubes and polyhedra. To do so, it generates a superset of faces, splits them at their intersections, and selects the face portions that form the desired boundary. The novelty of the proposed approach lies in the fact that the faces contributed to this superset by a tube are each a screw-sweeps of a rigid curve (generator), which is the locus of grazing points, and that each grazing point is formulated as the intersection of a circle of the tube with a corresponding screw-plane. Hence, each such face is a one-parameter family of helices, each being the screw-sweep of a grazing point.     

High-Order Accurate Adaptive Kernel Compression Time-Stepping Schemes for Fractional Differential Equations

We present a goal-oriented a posteriori error estimator for finite element approximations of a class of homogenization problems. As a rule, homogenization problems are defined through the coupling of a macroscopic solution and the solution of auxiliary problems. In this work we assume that the homogenized problem is known and that it depends on a finite number of auxiliary problems. The accuracy in the goal functional depends therefore on the discretization error of the macroscopic and the auxiliary solutions. We show that it is possible to compute the error contributions of all solution components separately and use this information to balance the different discretization errors. Additionally, we steer a local mesh refinement for both the macroscopic problem and the auxiliary problems. The high efficiency of this approach is shown by numerical examples. These include the upscaling of a periodic diffusion tensor, the case of a Stokes flow over a porous bed, and the homogenization of a fuel cell model which includes the flow in a gas channel over a porous substrate coupled with a multispecies nonlinear transport equation.     

Control of Motion of an Actively Bending Body in Channels with Dry Friction

Mechanics is described and equations are given of the motion of an actively bending homogeneous body of a finite thickness in a channel with dry friction under conditions of a weak bending. Control is suggested of the motion of a body in a sinusoidal channel, which retains a continuous first derivative of the controlling moment and a bounded second derivative. A process is described of the maximization of the speed of motion by control and then by the choice of the best parameters of a channel. Control is also considered of other modes of the motion of a body in the same channel.     

Exact combinatorial bounds on the probability of overfitting for empirical risk minimization

Three general methods for obtaining exact bounds on the probability of overfitting are proposed within statistical learning theory: a method of generating and destroying sets, a recurrent method, and a blockwise method. Six particular cases are considered to illustrate the application of these methods. These are the following model sets of predictors: a pair of predictors, a layer of a Boolean cube, an interval of a Boolean cube, a monotonic chain, a unimodal chain, and a unit neighborhood of the best predictor. For the interval and the unimodal chain, the results of numerical experiments are presented that demonstrate the effects of splitting and similarity on the probability of overfitting.     

A Case Study on Integrated Production Planning and Scheduling in a Three-Stage Manufacturing System

This paper presents an integrated optimization model of production planning and scheduling for a three-stage manufacturing system, which is composed of a forward chain of three kinds of workshops: a job shop, a parallel flow shop consisting of parallel production lines, and a single machine shop. As the products at the second stage are assembled from the parts produced in its upstream workshop, a complicated production process is involved. On the basis of the analysis of the batch production, a dynamic batch splitting and amalgamating algorithm is proposed. Then, a heuristic algorithm based on a genetic algorithm (known as the integrated optimization algorithm) is proposed for solving the problem. Note to Practitioners-This paper presents a method for integrated production planning and scheduling in a three-stage manufacturing system consisting of a forward chain of three kinds of workshops, which is common in such enterprises as producers of automobiles and household electric appliances, as in the case of an autobody plant usually with the stamping workshop, the welding and assembling workshop, and the painting workshop. Herein, the production planning and scheduling problems are simultaneously addressed in the way that a feasible production plan can be obtained and the inventory reduced. A batch splitting and amalgamating algorithm is proposed for balancing the production time of the production lines. And a case study of the integrated planning and scheduling problem in a real autobody plant verifies the effectiveness of our method     

Motion of a rigid cylinder between parallel plates in stokes flow : Part 1: Motion in a quiescent fluid and sedimentation

A general numerical scheme for solution of two-dimensional Stokes equations in a multiconnected domain of arbitrary shape [1, 2] is applied to the motion of a rigid circular cylinder between plane parallel boundaries. Numerically generated boundary-conforming coordinates are used to transform the flow domain into a domain with rectilinear boundaries. The transformed Stokes equations in vorticity-stream function form are then solved on a uniform grid using an iterative algorithm. In Part I coefficients of the resistance matrix representing the forces and torque on the cylinder due to its translational motion parallel or perpendicular to the boundaries or due to rotation about its axis are calculated. The solutions are obtained for a wide range of particle radii and positions across the channel. It is found that the force on a particle translating parallel to the boundaries without rotation exhibits a minimum at a position between the channel centerline and the wall and a local maximum on the centerline.

The resistance matrix is utilized to calculate translational and angular velocities of a free particle settling under gravity in a vertical channel. It is found that the translational velocity has a maximum at some lateral position and a minimum on the centerline; the particle angular velocity is opposite in sign to that of a particle rolling along the nearer channel wall except when the gap between the particle and the wall is very small. These results are compared with existing analytical solutions for a small cylindrical particle situated on the channel centerline, and with solutions of related 3-D problems for a spherical particle in a circular tube and in a place channel. It is shown that the behavior of cylindrical and spherical particles in a channel in many cases is qualitatively different. This is attributed to different flow patterns in these two cases. The motion of a spherical particle in a circular tube has qualitative and quantitative features similar to those for a cylindrical particle in a plane channel.     

The probabilistic orienteering problem

The probabilistic orienteering problem (POP) is defined on a directed graph where a cost is associated with each arc and a prize is associated with each node. Moreover, each node will be available for visit only with a certain probability. A server starts from a fixed origin, has a given budget to visit a subset of nodes, and ends at a fixed destination. In a first stage, a node subset has to be selected and a corresponding a priori path has to be determined such that the server can visit all nodes in the subset and reach the destination without exceeding the budget. The list of available nodes in the subset is then revealed. In a second stage, the server follows the a priori path by skipping the absent nodes. The POP consists in determining a first-stage solution that maximizes the expected profit of the second-stage path, where the expected profit is the difference between the expected total prize and the expected total cost.We discuss the relevance of the problem and formulate it as a linear integer stochastic problem. We develop a branch-and-cut approach for the POP and several matheuristic methods, corresponding to different strategies to reduce the search space of the exact method. Extensive computational tests on instances with up to 100 nodes show the effectiveness of the exact method and the efficiency of the matheuristics in finding high quality solutions in a few minutes. Moreover, we provide an extended analysis on a subset of instances to show the value of explicitly modeling the stochastic information in the problem formulation.     

Distributed planning and control systems for the virtual enterprise: organizational requirements and development life-cycle

This paper describes the requirements analysis and system specification of an Order Promise module to be used as part of a broader Decision Support System for production and operations planning of a Virtual Enterprise. This work is part of a broader project with a particular focus on the microelectronics industry which is a good example of Virtual Enterprise, and where a quick response to the customers needs and to unpredictable changes in production conditions is considered a major factor for success. First, the analysis and specification are presented within a development framework that involves the study of organizational issues of semiconductor enterprises. The use of ontological engineering for supporting the communication and shared understanding of the system concepts is explained and a virtual enterprise ontology is outlined. Following the clarification of the concept of virtual enterprise, the generic techno-organizational requirements for the information system are derived. Finally, a specification of the global planning module and a more detailed one regarding the order promise module is presented.     

A proposal of bargaining solution for cooperative contract in a supply chain

As a problem in supply chain management, the decision problem of terms and conditions of a contract between a supplier and a retailer is recognized commonly. The concept of cooperative bargaining between a supplier and a retailer is the key concepts to resolve this problem in the supply chain. Then, the bargaining evaluation function by Nash in the game theory exists as a tool to obtain the solution by cooperation bargaining. The Nash bargaining solution is derived under the premise that a power balance between a supplier and a retailer is equal. However, the situation where the power balance between a supplier and a retailer in actual bargaining is not equal is supposed frequently. For the purpose of reflecting the power balance in obtaining the bargaining solution, the concept of a general bargaining solution was proposed and then the general bargaining evaluation function for obtaining the general bargaining solution was devised. However, in the case of adopting the general bargaining evaluation function as a bargaining tool, some problems are included. In this article, we address the problems in the general bargaining solution. Then, we propose a new concept of bargaining process to obtain a solution under considering the existence of power balance between a supplier and a retailer.     

A new deterministic approach in a decision support system for ship’s trajectory planning

The paper introduces a Decision Support System for ships, developed to solve a problem of collision avoidance with static and dynamic obstacles. The system maps the decision making capability of a human (navigation) expert to solve the path planning problem for a ship in a complex navigation environment. It can be further developed to provide automatic control of a ship. It utilizes a new, fast and effective, deterministic method, called the Trajectory Base Algorithm, to calculate a safe, optimal path for a ship. The system structure, a detailed explanation of a new method, followed by results of simulation tests are all presented in the paper. The results proof a successful application of the method to solve a path planning problem for ships with the consideration of both static and dynamic obstacles in the environment, marine traffic regulations and dynamic properties of a ship, what makes this approach applicable in commercial systems. The approach can also be adapted for application in mobile robots path planning. The experimental results and ability of the system to achieve a new functionality of full autonomy show significance of this contribution to the development of Expert and Intelligent Systems domain. The author believes that autonomous systems constitute the future of Expert and Intelligent Systems.     

Vortex pattern and wave motion produced by a bottom blunt body moving at a critical speed

An underwater object moving at a near-critical speed in a shallow-water domain had been observed to generate a sequence of upstream propagating solitary waves with an elongated depression of water surface and a train of dispersive waves followed in the downstream. This study presents the development of a two-dimensional stream function–vorticity based viscous fluid model with satisfied nonlinear free-surface conditions to study the generation of solitary waves and the induced vortex motion under the forcing of a moving object. A combined finite analytic and finite difference method is adopted to solve the flow field equations and free-surface boundary conditions in a transient curvilinear coordinate system. The model is shown to produce free-surface elevations in fairly good agreements with published results for a test case of a moving smooth bump. Other tests for the generation of recirculation zone behind a body of square shape in a confined fluid domain are also conducted to further verify the model performance. The results showing the generation of upstream advancing solitary waves and downstream vortex pattern by a blunt rectangular body moving at a critical speed along the bottom in a domain with free surface are presented. Comparisons of results from potential flow and viscous flow conditions are made to demonstrate the importance of viscosity to the wave generation. Different from the relatively regular vortex pattern occurred under the case of Re = 3500, the transition of the vortex motion for a larger Reynolds number (e.g. Re = 35,000) evolves without a regular pattern throughout the generation process of the advancing solitons. The effects of the size and bluntness of a moving object on the generated flow field and free-surface elevations are also analyzed and discussed.     

Bayesian recognition of local 3-d shape by approximating image intensity functions with quadric polynomials

The recognition in image data of viewed patches of spheres, cylinders, and planes in the 3-D world is discussed as a first step to complex object recognition or complex object location and orientation estimation. Accordingly, an image is partitioned into small square windows, each of which is a view of a piece of a sphere, or of a cylinder, or of a plane. Windows are processed in parallel for recognition of content. New concepts and techniques include approximations of the image within a window by 2-D quadric polynomials where each approximation is constrained by one of the hypotheses that the 3-D surface shape seen is either planar, cylindrical, or spherical; a recognizer based upon these approximations to determine whether the object patch viewed is a piece of a sphere, or a piece of a cylinder, or a piece of a plane; lowpass filtering of the image by the approximation. The shape recognition is computationally simple, and for large windows is approximately Bayesian minimum-probability-of-error recognition. These classifications are useful for many purposes. One such purpose is to enable a following processor to use an appropriate estimator to estimate shape, and orientation and location parameters for the 3-D surface seen within a window.     

A formal approach to negotiating agents development

This paper presents a formal and executable approach to capture the behaviour of parties involved in a negotiation. A party is modeled as a negotiating agent composed of a communication module, a control module, a reasoning module, and a knowledge base. The control module is expressed as a statechart, and the reasoning module as a defeasible logic program. A strategy specification therefore consists of a statechart, a set of defeasible rules, and a set of initial facts. Such a specification can be dynamically plugged into an agent shell incorporating a statechart interpreter and a defeasible logic inference engine, in order to yield an agent capable of participating in a given type of negotiations. The choice of statecharts and defeasible logic with respect to other formalisms is justified against a set of desirable criteria, and their suitability is illustrated through concrete examples of bidding and multi-lateral bargaining scenarios.     

Track-following control of a dual-stage hard disk drive using a neuro-control system

This paper describes the track-following control of a dual-stage hard disk drive system using neural-networks. A neural-network approach to on-line learning control, and a real-time implementation for a dual-stage hard disk drive, are presented. The use of the dual-stage actuator in hard disk drive systems has become a means of achieving increased servo actuator bandwidth. The dual-stage actuator presented here uses a voice-coil motor (VCM) as a coarse actuator, and a piezoelectric actuator (PZT) as a fine actuator. The control system consists of a series combination of both a plant with a feedback loop and a neural-network with a feedforward loop. The neural-network functions as the reference input filter, and it organizes a new reference signal to the closed-loop circuit. Numerical and experimental results for the track-following control system of the dual-stage hard disk drive show the validity of the proposed neuro-control system.     

Developing a vision-based auto-recharging system for mobile robots

This article describes a vision-based auto-recharging system that guides a mobile robot moving toward a docking station. The system contains a docking station and a mobile robot. The docking station contains a docking structure, a control device, a charger, a safety detection device, and a wireless RF interface. The mobile robot contains a power detection module (voltage and current), an auto-switch, a wireless RF interface, a controller, and a camera. The controller of the power detection module is a Holtek chip. The docking structure is designed with one active degree of freedom and two passive degrees of freedom. For image processing, the mobile robot uses a webcam to capture a real-time image. The image signal is transmitted to the controller of the mobile robot via a USB interface. We use an Otsu algorithm to calculate the distance and orientation of the docking station from the mobile robot. In the experiment, the proposed algorithm guided the mobile robot to the docking station.