Process Modeling of Comprehensive Integrated Forest Biorefinery—An Integrated Approach

The key to expanding the energy supply, increasing energy security, and reducing the dependency on foreign oil is to develop advanced technologies to efficiently transform our renewable bioresources into domestically produced bioenergy and bioproducts. Conventional biorefineries, i.e., forest products industry’s pulp and paper mills with long history of sustainable utilization of lignocellulose (wood), offer a suitable platform for being expanded into future integrated forest biorefineries. Due to the pre-existing infrastructure in current forest products operations, this could present a very cost-effective approach to future biorefineries. In order to better understand the overall process, technical, economic, and environmental impacts, a detailed process modeling of the whole integrated forest biorefinery is presented here. This approach uses a combination of Aspen Plus®, WinGEMS®, and Microsoft Excel® to simulate the entire biorefinery in detail with sophisticated communication interface between the three simulations. Preliminary results for a simple case study of an integrated biorefinery show the feasibility of this approach. Further investigations, including additional details, more process options, and complete integration, are currently underway.     

Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs

This paper addresses sensitivity analysis questions concerning the shortest path problem and the maximum capacity path problem in an undirected network. For both problems, we determine the maximum and minimum weights that each edge can have so that a given path remains optimal. For both problems, we show how to determine these maximum and minimum values for all edges in O(m + K log K) time, where m is the number of edges in the network, and K is the number of edges on the given optimal path.     

Improved detector response characterization method in ISOCS and LabSOCS

The In-Situ Object Calibration Software (ISOCS) and the Laboratory Sourceless Calibration Software (LabSOCS) developed and patented by Canberra Industries have found widespread use in the gamma-spectrometry community. Using the ISOCS methodology, one can determine the full energy peak efficiencies of a germanium detector in the 45 keV-7 MeV energy range, for practically any source matrix and geometry. The underlying mathematical techniques used in ISOCS (and LabSOCS) have undergone significant improvements and enhancements since their first release in 1996. One of these improvements is  a spatial response characterization technique that is capable of handling the large variations in efficiency that occurs within a small region. The technique has been in use in ISOCS and LabSOCS releases since 1999, and has significantly improved the overall quality of the close-in and off-axis response characterization for HPGe detectors, especially for Canberra’s Broad Energy Germanium (BEGe) detectors. In this method, the detector response is characterized by creating a set of fine spatial efficiency grids at 15 energies in the 45 keV-7 MeV range. The spatial grids are created in (r,⊝) space about the detector, with the radius r varying from 0 to 500 meters, and the angle ⊝ varying from 0 to π. The reference efficiencies for creating the spatial grids are determined from MCNP calculations using a validated detector model. Once the efficiency grids are created, the detector response can be determined at any arbitrary point within a sphere of 500-meter radius, and at any arbitrary energy within the specified range. Results are presented highlighting the improved performance achieved using the gridding methodology.     

Synthesis of isocoumarins via Pd/C-mediated reactions of o-iodobenzoic acid with terminal alkynes

The coupling reaction of o-iodobenzoic acid with terminal alkynes by using a catalyst system of 10% Pd/C-Et3N-CuI-PPh3 has been studied in a variety of solvents. 3-Substituted isocoumarins were formed in good yields and with good regioselectivity when the reaction was performed in EtOH.     

Spatiotemporal rheochaos in nematic hydrodynamics

Motivated by recent observations of rheochaos in sheared wormlike micelles, we study the coupled nonlinear partial differential equations for the hydrodynamic velocity and order-parameter fields in a sheared nematogenic fluid. In a suitable parameter range, we find irregular, dynamic shear banding and establish by decisive numerical tests that the chaos we observe in the model is spatiotemporal in nature.     

Synthesis and characterization of LiNi<Subscript>y</Subscript>Co<Subscript>1−y</Subscript>PO<Subscript>4</Subscript> (y=0–1) cathode materials for lithium secondary batteries

In this work series of LiNi_yCo_1−yPO₄ (y=0, 0.2, 0.4, 0.6, 0.8 and 1) phospho olivines were synthesized by solution co-precipitation technique and characterized by X-ray diffraction (XRD), Fourier transform infrared (FTIR) and impedance spectroscopic analysis. The XRD patterns of LiNi_yCo_1−yPO₄ (y=0.2, 0.4, 0.6 and 0.8) revealed that they are essentially single phase and have an Olivine-type XRD patterns similar to those of their parent compounds LiCoPO₄ and LiNiPO₄. An increase in wave number for most of the dominant infrared bands in PO₄ vibrational region for the substitution of Co by Ni in LiCoPO₄ indicated the strengthening of both the P-O and Li/Ni-O bonds. Paper presented at the 2nd International Conference on Ionic Devices, Anna University, Chennai, India, Nov. 28–30, 2003.     

A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming

A cutting plane method for linear programming is described. This method is an extension of Atkinson and Vaidya's algorithm, and uses the central trajectory. The logarithmic barrier function is used explicitly, motivated partly by the successful implementation of such algorithms. This makes it possible to maintain primal and dual iterates, thus allowing termination at will, instead of having to solve to completion. This algorithm has the same complexity (O(nL ²) iterations) as Atkinson and Vaidya's algorithm, but improves upon it in that it is a long-step version, while theirs is a short-step one in some sense. For this reason, this algorithm is computationally much more promising as well. This algorithm can be of use in solving combinatorial optimization problems with large numbers of constraints, such as the Traveling Salesman Problem.