Determination of optimum pH and temperature for pasteurization of citrus juices by response surface methodology

Summary Optimization of microbial death, enzyme inactivation and vitamin C retention during pasteurization of pH-adjusted orange juice is discussed free of equipmentdependent parameters such as the heating lag. The pH-temperature optimum was determined by response surface methodology in the range of 65° C–75° C and pH 2.5–4.0. The results implied that there was no pectinesterase activity below pH 3.5.Leuconostoc mesenteroides had its maximum and minimum thermal resistance at pH 3.5 and pH 2.7, respectively. For an ideal theoretical process requiring four log cycles of microbial reduction the optimum pasteurization conditions were 12 min at 75° C and pH 2.7.

---

Bestimmung der optimalen Temperatur- und pH-Wert-Bedingungen für die Pasteurisierung von Citrussäften mit der response surface-Methode

Zusammenfassung Die Optimierung der mikrobiellen Abtötung, Enzyminaktivierung und Vitamin-C-Retention während der Pasteurisierung von Orangensaft mit verschiedenen pH-Werten wird, frei von Anlageneinflüssen, wie z. B. Erhitzungsverzögerungen, diskutiert. Das Temperatur-pH-Wert-Optimum wurde mit der response surface-Methode im Temperaturbereich von 65 bis 75 °C und pH-Werten zwischen 2,5 und 4,0 untersucht. Die Ergebnisse lassen darauf schließen, daß unter pH 3,5 keine Pectinesteraseaktivität mehr vorliegt.Leuconostoc mesentroides wies bei pH 2,7 minimale und bei pH 3,5 maximale Hitzeresistenz auf. In einem idealen theoretischen Pasteurisierungsprozeß, der eine Reduzierung der mikrobiellen Belastung um vier Größenordnungen erfordert, liegen die optimalen Bedingungen bei 12 min, 75 °C und einem pH-Wert von 2,7.

     

Towards the Optimal Learning Rate for Backpropagation

A backpropagation learning algorithm for feedforward neural networks withan adaptive learning rate is derived. The algorithm is based uponminimising the instantaneous output error and does not include anysimplifications encountered in the corresponding Least Mean Square (LMS)algorithms for linear adaptive filters. The backpropagation algorithmwith an adaptive learning rate, which is derived based upon the Taylorseries expansion of the instantaneous output error, is shown to exhibitbehaviour similar to that of the Normalised LMS (NLMS) algorithm. Indeed,the derived optimal adaptive learning rate of a neural network trainedby backpropagation degenerates to the learning rate of the NLMS for a linear activation function of a neuron. By continuity, the optimal adaptive learning rate for neural networks imposes additional stabilisationeffects to the traditional backpropagation learning algorithm.     

Ranking alternatives in a preferential voting system using fuzzy concepts and data envelopment analysis

In this paper, a new method for aggregating the opinions of experts in a preferential voting system is proposed. The method, which uses fuzzy concept in handling crisp data, is computationally efficient and is able to completely rank the alternatives. Through this method, the number of votes for certain rank position that each alternative receives are first grouped together to form fuzzy numbers. The nearest point to a fuzzy number concept is then used to introduce an artificial ideal alternative. Data envelopment analysis is next used to find the efficiency scores of the alternatives in a pair-wise comparison with the artificial ideal alternative. Alternatives are rank based on these efficiency scores. If the alternatives are not completely ranked, a weight restriction method also based on fuzzy concept is used on the un-discriminated alternatives until they are completely ranked. Two examples are given for illustration of the method.     

An Analytical Approach to the Concept of Counter-UA Operations (CUAOPS)

Unmanned Aircraft (UA) have become an integral part of the present-day joint air operations. UA have potential to be employed across the full spectrum of Air Force functions. On the other hand, UA technology could be a subject of an asymmetric use by state actors in high or low density conflict, and/or by non-state actors in many ways including terrorism, drug smuggling, and limited attack with unconventional payloads i.e. biological or chemical agents. Therefore countering the threat associated with the hostile UA use could be necessary in the future. First part of the research revealed that UA can be a threat in the future. In the second part of the research, the SWOT (Strengths-Weaknesses-Opportunities-Threats) analysis supplemented with the Tree analysis (SWOT+Tree) provided a broader look for investigating the factors related to hostile UA use analytically. In literature, there is little information about the concepts for CUAOPS. The final goal of the paper is to find possible solutions and means for a better understanding of the nature of CUAOPS.     

Developing robust vision modules for microsystems applications

In this work, several robust vision modules are developed and implemented for fully automated micromanipulation. These are autofocusing, object and end-effector detection, real-time tracking and optical system calibration modules. An image based visual servoing architecture and a path planning algorithm are also proposed based on the developed vision modules. Experimental results are provided to assess the performance of the proposed visual servoing approach in positioning and trajectory tracking tasks. Proposed path planning algorithm in conjunction with visual servoing imply successful micromanipulation tasks.     

Dynamic hierarchical bandwidth allocation using Russian Doll Model in EPON

This paper demonstrates a new hierarchical Dynamic Bandwidth Allocation algorithm using the Russian Doll Model (RDM) to allocate bandwidth for intra-Optical Network Unit (ONU) in an Ethernet Passive Optical Network (EPON). The allocation of bandwidth is based on the classification and prioritization of service. The algorithm addresses the requests of ONUs and provides differentiated services by balancing priority and fairness. The simulation results show that the proposed algorithm performs well in supporting the triple-play services, i.e. video, voice, and data, as well as making effective adjustment in balancing bandwidth sharing between the ONUs compared with two other existing Dynamic Bandwidth Allocation (DBA) algorithm. The proposed algorithms shows significant performance improvements in terms of bandwidth utilization, packet delay and the fairness.     

A method for real power transfer allocation using multivariable regression analysis

A multivariable regression (MVR) approach is proposed to identify the real power transfer between generators and loads. Based on solved load flow results, it first uses modified nodal equation method (MNE) to determine real power contribution from each generator to loads. Then, the results of MNE method and load flow information are utilized to determine suitable regression coefficients using MVR model to estimate the power transfer. The 25-bus equivalent system of south Malaysia is utilized as a test system to illustrate the effectiveness of the MVR output compared to that of the MNE method. The error of the estimate of MVR method ranges from 0.001 4 to 0.007 9. Furthermore, when compared to MNE method, MVR method computes generator contribution to loads within 26.40 ms whereas the MNE method takes 360 ms for the calculation of same real power transfer allocation. Therefore, MVR method is more suitable for real time power transfer allocation.     

The effect of heat treatment on high temperature mechanical properties of microalloyed medium carbon steel

In the present work, high temperature tensile properties and abrasive wear performance of a microalloyed medium carbon steel has been examined. Tensile and abrasive wear testing were carried out on as-received and heat treated specimens. The research has shown that microalloyed medium carbon steel was susceptible to dynamic strain ageing due to interaction of mobile dislocations and solid atoms, such as carbon and/or nitrogen. The interaction between dislocations and solid atoms at 200–300 °C changes the work hardening rate and contributes to dynamic strain ageing. These interactions also increased abrasive wear resistance of the microalloyed medium carbon steel at 300 °C. Therefore, the inference can be drawn that dynamic strain ageing caused an improvement on abrasion resistance.     

A knowledge-based decision support system for the management of parts and tools in FMS

Flexible manufacturing systems (FMS) are very complex systems with large part, tool, and information flows. The aim of this work is to develop a knowledge-based decision support system (KBDSS) for short-term scheduling in FMS strongly influenced by the tool management concept to provide a significant operational control tool for a wide range of machining cells, where a high level of flexibility is demanded, with benefits of more efficient cell utilization, greater tool flow control, and a dependable way of rapidly adjusting short-term production requirements. Development of a knowledge-based system to support the decision making process is justified by the inability of decision makers to diagnose efficiently many of the malfunctions that arise at machine, cell, and entire system levels during manufacturing. In this context, this paper proposes three knowledge-based models to ease the decision making process: an expert production scheduling system, a knowledge-based tool management decision support systems, and a tool management fault diagnosis system. The entire system has been created in a hierarchical manner and comprises more than 400 rules. The expert system (ES) was implemented in a commercial expert system shell, Knowledge Engineering System (KES) Production System (PS).     

A Conjecture on Wiener Indices in Combinatorial Chemistry

Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by edges between the corresponding vertices. This polygonal shape derived from a chemical compound is often called its molecular graph, and can be a path, a tree, or in general a graph. An indicator defined over this molecular graph, the Wiener index, has been shown to be strongly correlated to various chemical properties of the compound. The Wiener index conjecture for trees states that for any integer n (except for a finite set), one can find a tree with Wiener index n. This conjecture has been open for quite some time, and many authors have presented incremental progress on this problem. In this paper we present further progress towards proving this conjecture—through the design of efficient algorithms, we show that enumerating all possible trees to verify this conjecture (as done by all the previous approaches) is not necessary, but instead searching in a small special family of trees suffices, thus achieving the first polynomial (in n) time algorithm to verify the conjecture up to integer n. More precisely, we (i) present an infinite family of trees and prove various properties of these trees, (ii) show that a large number of integers, up to at least 10⁸ (compared with the previous best 10⁴) are representable as Wiener indices of trees in this succinct family, (iii) provide several efficient algorithms for computing trees with given Wiener indices, and (iv) implement our algorithms and experimentally show that their performance is asymptotically much better than their theoretical worst-case upper bound.