Variability of dissolution rates at constant undersaturation

Dissolution processes play an important role in marble weathering. Investigation of the dissolution kinetics of powdered Pentelic marble, a calcitic natural stone, showed that the rates measured at constant undersaturation decreased with time. It was found that the rate of dissolution decreased sharply to about 50% of the initial value before 5% of the initially suspended powder was dissolved. Past a dissolution extent corresponding to 25% with respect to the suspended solid, the rates of dissolution at the same constant undersaturation reached a stable value corresponding to 20-25% of the initial rate measured. The reduction in the rates of dissolution up to 25% of mass loss was in agreement with the reduction in the total surface area exposed to the solution, suggesting a dependence of the rate on the number of active sites on the surface of the dissolving material. The decrease in the dissolution rates did not depend on the undersaturation of the solution or on the physical characteristics of the particles such as specific surface area, porosity, and particle size distribution. Equal mass losses, with respect to the initially suspended solid, of different samples exhibited the same relative decrease in rate regardless of the conditions of the aqueous solutions.     

Spectroscopic determination of the degree of esterification of pectic substances from kenaf

Pectins were isolated from bark, wood and pith of four kenaf (Hibiscus cannabinus L.) varieties. The degree of esterification of isolated pectins was studied using Fourier transform infrared spectroscopy. It was determined as being between 57 and 90% and there were no notable differences between kenaf varieties. The higher value of the degree of esterification was presented in wood pectins (86-90%), the interim in pith (75-83%) and the lower in bark (57-64%).     

A second-order unsplit Godunov scheme for cell-centered MHD: The CTU-GLM scheme

We assess the validity of a single step Godunov scheme for the solution of the magnetohydrodynamics equations in more than one dimension. The scheme is second-order accurate and the temporal discretization is based on the dimensionally unsplit Corner Transport Upwind (CTU) method of Colella. The proposed scheme employs a cell-centered representation of the primary fluid variables (including magnetic field) and conserves mass, momentum, magnetic induction and energy. A variant of the scheme, which breaks momentum and energy conservation, is also considered. Divergence errors are transported out of the domain and damped using the mixed hyperbolic/parabolic divergence cleaning technique by Dedner et al. (2002) [11]. The strength and accuracy of the scheme are verified by a direct comparison with the eight-wave formulation (also employing a cell-centered representation) and with the popular constrained transport method, where magnetic field components retain a staggered collocation inside the computational cell. Results obtained from two- and three-dimensional test problems indicate that the newly proposed scheme is robust, accurate and competitive with recent implementations of the constrained transport method while being considerably easier to implement in existing hydro codes.     

A Web-based ERP system for business services and supply chain management: Application to real-world process scheduling

A Web-based ERP system developed for attacking business problems and managing real-world business processes ranging from simple office automation procedures to complicated supply chain planning is presented. The system’s Web-aspect provides significant advantages, as the system is distributed through interoperable, cross-platform and highly pluggable Web-service components. The system involves a powerful workflow engine that manages the entire process event flow within the enterprise increasing efficiency and control at the same time. Business processes, when needed, are controlled by the enterprise quality management system and consequently the ISO directives are accurately followed. A real-world process scheduling system developed for the specific needs of Greek Construction Manufacturing Enterprises is illustrated as a detailed paradigm of the system’s capabilities. The problem was formulated to assign project tasks in form of lots to enterprise resources in order that resources idle time and delays in project preparation time were minimized. The problem was solved by a simple and effective heuristic algorithm.     

A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows

This paper presents a solution methodology for the heterogeneous fleet vehicle routing problem with time windows. The objective is to minimize the total distribution costs, or similarly to determine the optimal fleet size and mix that minimizes both the total distance travelled by vehicles and the fixed vehicle costs, such that all problem’s constraints are satisfied. The problem is solved using a two-phase solution framework based upon a hybridized Tabu Search, within a new Reactive Variable Neighborhood Search metaheuristic algorithm. Computational experiments on benchmark data sets yield high quality solutions, illustrating the effectiveness of the approach and its applicability to realistic routing problems. This work is supported by the General Secretariat for Research and Technology of the Hellenic Ministry of Development under contract GSRT NM-67.     

A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector

Effective routing of vehicles remains a focal goal of all modern enterprises, thriving for excellence in project management with minimal investment and operational costs. This paper proposes a metaheuristic methodology for solving a practical variant of the well-known Vehicle Routing Problem, called Heterogeneous Fixed Fleet VRP (HFFVRP). Using a two-phase construction heuristic, called GEneralized ROute Construction Algorithm (GEROCA), the proposed metaheuristic approach enhances its flexibility to easily adopt various operational constraints. Via this approach, two real-life distribution problems faced by a dairy and a construction company were tackled and formulated as HFFVRP. Computational results on the aforementioned case studies show that the proposed metaheuristic approach (a) consistently outperforms previous published metaheuristic approaches we have developed to solve the HFFVRP, and (b) substantially improves upon the current practice of the company. The key result that impressed both companies’ management was the improvement over the bi-objective character of their problems: the minimization of the total distribution cost as well as the minimization of the number of the given heterogeneous number of vehicles used.     

Faster least squares approximation

Least squares approximation is a technique to find an approximate solution to a system of linear equations that has no exact solution. In a typical setting, one lets n be the number of constraints and d be the number of variables, with n >> d{n \gg d}. Then, existing exact methods find a solution vector in O(nd ²) time. We present two randomized algorithms that provide accurate relative-error approximations to the optimal value and the solution vector of a least squares approximation problem more rapidly than existing exact algorithms. Both of our algorithms preprocess the data with the Randomized Hadamard transform. One then uniformly randomly samples constraints and solves the smaller problem on those constraints, and the other performs a sparse random projection and solves the smaller problem on those projected coordinates. In both cases, solving the smaller problem provides relative-error approximations, and, if n is sufficiently larger than d, the approximate solution can be computed in O(nd ln d) time.     

Univalent Functions, <Emphasis Type="Italic">VMOA</Emphasis> and Related Spaces

This paper is concerned mainly with the logarithmic Bloch space ℬ_log which consists of those functions f which are analytic in the unit disc \mathbbD{\mathbb{D}} and satisfy sup_{|z| < 1}(1-|z|)log\frac11-|z||f^￠(z)| < ￥\sup_{\vert z\vert <1}(1-\vert z\vert )\log\frac{1}{1-\vert z\vert}\vert f^{\prime}(z)\vert <\infty , and the analytic Besov spaces B ^p , 1≤p<∞. They are all subspaces of the space VMOA. We study the relation between these spaces, paying special attention to the membership of univalent functions in them. We give explicit examples of:

Bayesian Analysis of Extreme Values by Mixture Modeling

Modeling of extreme values in the presence of heterogeneity is still a relatively unexplored area. We consider losses pertaining to several related categories. For each category, we view exceedances over a given threshold as generated by a Poisson process whose intensity is regulated by a specific location, shape and scale parameter. Using a Bayesian approach, we develop a hierarchical mixture prior, with an unknown number of components, for each of the above parameters. Computations are performed using Reversible Jump MCMC. Our model accounts for possible grouping effects and takes advantage of the similarity across categories, both for estimation and prediction purposes. Some guidance on the specification of the prior distribution is provided, together with an assessment of inferential robustness. The method is illustrated throughout using a data set on large claims against a well-known insurance company over a 15-year period.