Simultaneous sulfide and acetate oxidation under denitrifying conditions using an inverse fluidized bed reactor

BACKGROUND: Simultaneous removal of sulfur, nitrogen and carbon compounds from wastewaters is a commercially important biological process. The objective was to evaluate the influence of the CH₃COO^?/NO₃^? molar ratio on the sulfide oxidation process using an inverse fluidized bed reactor (IFBR). RESULTS: Three molar ratios of CH₃COO^?/NO₃^? (0.85, 0.72 and 0.62) with a constant S^2?/NO₃^? molar ratio of 0.13 were evaluated. At a CH₃COO^?/NO₃^? molar ratio of 0.85, the nitrate, acetate and sulfide removal efficiencies were approximately 100%. The N₂ yield (g N₂ g^?1 NO₃^?‐N consumed) was 0.81. Acetate was mineralized, resulting in a yield of 0.65 g inorganic‐C g^?1 CH₃COO^?‐C consumed. Sulfide was partially oxidized to S⁰, and 71% of the S^2? consumed was recovered as elemental sulfur by a settler installed in the IFBR. At a CH₃COO^?/NO₃^? molar ratio of 0.72, the efficiencies of nitrate, acetate and sulfide consumption were of 100%, with N₂ and inorganic‐C yields of 0.84 and 0.69, respectively. The sulfide was recovered as sulfate instead of S⁰, with a yield of 0.92 g SO₄^2?‐S g^?1 S^2? consumed. CONCLUSIONS: The CH₃COO^?/NO₃^? molar ratio was shown to be an important parameter that can be used to control the fate of sulfide oxidation to either S⁰ or sulfate. In this study, the potential of denitrification for the simultaneous removal of organic matter, sulfide and nitrate from wastewaters was demonstrated, obtaining CO₂, S⁰ and N₂ as the major end products. Copyright © 2008 Society of Chemical Industry     

Application of piece‐wise linear weight functions for 2D 8‐node quadrilateral element in contact problems

The present study is a continuation of our previous work with the aim to reduce problems caused by standard higher order elements in contact problems. The difficulties can be attributed to the inherent property of the Galerkin method which gives uneven distributions of nodal forces resulting in oscillating contact pressures. The proposed remedy is use of piece‐wise linear weight functions. The methods to establish stiffness and/or mass matrix for 8‐node quadrilateral element in 2D are presented, i.e. the condensing and direct procedures. The energy and nodal displacement error norms are also checked to establish the convergence ratio. Interpretation of calculated contact pressures is discussed. Two new 2D 8‐node quadrilateral elements, QUAD8C and QUAD8D, are derived and tested in many examples, which show their good performance in contact problems. Copyright © 2004 John Wiley & Sons, Ltd.     

Singular Trajectories in Multi-Input Time-Optimal Problems: Application to Controlled Mechanical Systems

This paper deals with the time-optimal control problem for a class of control systems which includes controlled mechanical systems with possible dissipation terms. The Lie algebras associated with such mechanical systems have certain special properties. These properties are explored and used in conjunction with the Pontryagin maximum principle to determine the structure of singular extremals and, in particular, time-optimal trajectories. The theory is illustrated by an application to a time-optimal problem for a class of underwater vehicles.     

Frequency domain solution to delay-type Nehari problem

This paper generalizes the frequency-domain results on the delay-type Nehari problem in the stable case to the unstable case. The solvability condition of the delay-type Nehari problem is formulated in terms of the nonsingularity of three matrices. The optimal value γ_opt is the maximal γ∈(0,∞) such that one of the three matrices becomes singular. All sub-optimal compensators are parameterized in a transparent structure incorporating a modified Smith predictor.     

Maximally efficient dialogue mode algorithm

Collaboration is more efficient when the most capable participant for each goal has initiative in directing the problem-solving for that goal. The paper describes a method for using a probabilistic analysis to create a mode-switching mechanism that selects which participant should control the collaborative problem solving so that efficiency is maximized.     

小型水电站联网改造应注意的几个问题

针对铜鼓县小水电站联网时存在的问题及其不利影响进行了分析，井提出了改进途径，指出小水电站的联网改造应立足安全，争取效益。     

The pickup and delivery problem: Faces and branch-and-cut algorithm

This paper formulates the pickup and delivery problem, also known as the dial-a-ride problem, as an integer program. Its polyhedral structure is explored and four classes of valid inequalities developed. The results of a branch-and-cut algorithm based on these constraints are presented.     

电离层时域探测方法

给出了各向同性分层半空间等离子体对时域电磁脉冲后向散射的有关公式，得出了反抛物层时域响应的解析表达式，并利用时频分析方法演出了电子密度分布。     

任意曲线透视投影的逆变换

透视曲线的逆变换是透视图象三维逆变换的重要基础。本文在给出透视投影逆变换基本方程的基础上，分别提出了圆、椭圆、二次曲线、任意平面曲线的透视投影逆变换的解析方法或计算机反求方法。同时给出灭点信息不足明图象的透视参数的准确反求方法。     

Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors

We study the application of the geographic nearest neighbor approach to two problems. The first problem is the construction of an approximately minimum length rectilinear Steiner tree for a set ofn points in the plane. For this problem, we introduce a variation of a subgraph of sizeO(n) used by YaO [31] for constructing minimum spanning trees. Using this subgraph, we improve the running times of the heuristics discussed by Bern [6] fromO(n ² log n) toO(n log² n). The second problem is the construction of a rectilinear minimum spanning tree for a set ofn noncrossing line segments in the plane. We present an optimalO(n logn) algorithm for this problem. The rectilinear minimum spanning tree for a set of points can thus be computed optimally without using the Voronoi diagram. This algorithm can also be extended to obtain a rectilinear minimum spanning tree for a set of nonintersecting simple polygons.The results in this paper are a part of Y. C. Yee's Ph.D. thesis done at SUNY at Albany. He was supported in part by NSF Grants IRI-8703430 and CCR-8805782. S. S. Ravi was supported in part by NSF Grants DCI-86-03318 and CCR-89-05296.