Mesophilic and thermophilic activated sludge post-treatment of paper mill process water

Increasing system closure in paper mills and higher process water temperatures make the applicability of thermophilic treatment systems increasingly important. The use of activated sludge as a suitable thermophilic post-treatment system for anaerobically pre-treated paper process water from a paper mill using recycled wastepaper was studied. Two lab-scale plug flow activated sludge reactors were run in parallel for 6 months; a thermophilic reactor at 55 degrees C and a reference reactor at 30 degrees C. Both reactors were operated simultaneously at 20, 15 and 10 days SRT. The effects of temperature and SRT on sludge settleability and chemical oxygen demand (COD) removal efficiencies of different fractions were studied. Total COD removal percentages over the whole experimental period were 58+/-5% at 30 degrees C and 48 +/- 10% at 55 degrees C. The effect of the SRT on the total COD removal was negligible. Differences in total COD removal between both systems were due to a lesser removal of soluble and colloidal COD at 55 degrees C compared to the reference system. At 30 degrees C, colloidal COD removal percentages were 65+/-25%, 75+/-17% and 86+/-22% at 20, 15 and 10 days SRT, respectively. At 55 degrees C, these percentages were 48+/-34%, 40+/-28% and 70+/-25%, respectively. The effluent concentrations of colloidal COD in both systems were related to the influent concentration of colloidal material. The thermophilic sludge was not able to retain influent colloidal material as well as the mesophilic sludge causing a higher thermophilic effluent turbidity. Sludge settling properties were excellent in both reactor systems. These were neither temperature nor SRT dependent but were rather caused by extensive calcium precipitation in the aeration tanks creating a very dense sludge. For application in the board industry, a thermophilic in line treatment system seems feasible. The higher effluent turbidity is most likely offset by the energy gains of treatment under thermophilic conditions.     

Evaluation of ergonomic adjustments of catering carts to reduce external pushing forces

An existing standard catering cart was compared with two prototypes for pushbar and castor design. The first objective of this study was to find out which cart was accompanied with the lowest manually exerted external forces in pushing in a straight way and in pushing a 90 turn. The second objective was to explore effects of the pushbar and castor design of the carts. In the initial and ending phase, the prototypes were accompanied with higher exerted forces compared with the standard catering cart. In pushing straight. the reversed start position of the bigger castors of the prototypes hampered a fluent acceleration and caused higher initial forces. In decelerating, the lower rolling friction of the bigger castors required higher forces to stop the prototypes compared to the standard cart. During the sustained phase, the prototype carts were more favourable. Effects of pushbar and castor design were studied during a turn. The vertical pushbars of the prototypes resulted in lower time-integrated pushing forces. Providing an axis of rotation for turning activities by means of a fixed wheel was proven to be advantageous.     

An adaptive technique for content-based image retrieval

We discuss an adaptive approach towards Content-Based Image Retrieval. It is based on the Ostensive Model of developing information needs—a special kind of relevance feedback model that learns from implicit user feedback and adds a temporal notion to relevance. The ostensive approach supports content-assisted browsing through visualising the interaction by adding user-selected images to a browsing path, which ends with a set of system recommendations. The suggestions are based on an adaptive query learning scheme, in which the query is learnt from previously selected images. Our approach is an adaptation of the original Ostensive Model based on textual features only, to include content-based features to characterise images. In the proposed scheme textual and colour features are combined using the Dempster-Shafer theory of evidence combination. Results from a user-centred, work-task oriented evaluation show that the ostensive interface is preferred over a traditional interface with manual query facilities. This is due to its ability to adapt to the user's need, its intuitiveness and the fluid way in which it operates. Studying and comparing the nature of the underlying information need, it emerges that our approach elicits changes in the user's need based on the interaction, and is successful in adapting the retrieval to match the changes. In addition, a preliminary study of the retrieval performance of the ostensive relevance feedback scheme shows that it can outperform a standard relevance feedback strategy in terms of image recall in category search.     

A Model-based Integration and Testing Method to Reduce System Development Effort

New methods and techniques are needed to reduce the very costly integration and test effort (in terms of lead time, costs, resources) in the development of high-tech multi-disciplinary systems. To facilitate this effort reduction, we propose a method called model-based integration. This method allows to integrate formal executable models of system components that are not yet physically realized with available realizations of other components. The combination of models and realizations is then used for early analysis of the integrated system by means of validation, verification, and testing. This analysis enables early detection and prevention of problems that would otherwise occur during real integration, resulting in a significant reduction of effort invested in the the real integration and test phases. This paper illustrates how models of components, developed for model-based integration, can be used for automated model-based testing, which allows time-efficient determination of the conformance of component realizations with respect to their requirements. The combination of model-based integration and model-based testing is practically illustrated in a realistic industrial case study. Results obtained from this study encourage further research on model-based integration as a prominent method to reduce the integration and test effort.     

Self-sacrificial leadership and follower self-esteem: When collective identification matters.

In the present research, we examine whether leader's self-sacrifice positively influences followers' self-esteem and whether followers' identification with the collective plays a role in this process. It was predicted that leader self-sacrifice would influence followers' self-esteem, but particularly so when followers exhibited strong (vs. weak) collective identification. Results from an organizational survey showed that leader self-sacrifice and collective identification interacted in predicting follower self-esteem, such that followers' self-esteem was higher when they identified strongly with the collective and when the leader was self-sacrificial (vs. self-benefiting). An experimental scenario study replicated this interactive effect between collective identification and leader's self-sacrifice on followers' self-esteem and also showed that this effect was (at least partly) mediated by followers' perceptions of whether the leader respected and valued the group. Implications with respect to the relationship between self-sacrifice and self-esteem are outlined, and possible integrations of leader self-sacrifice, identity, and empowerment are discussed. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Letter position information and printed word perception: The relative-position priming constraint.

Six experiments apply the masked priming paradigm to investigate how letter position information is computed during printed word perception. Primes formed by a subset of the target's letters facilitated target recognition as long as the relative position of letters was respected across prime and target (e.g., "arict" vs. "acirt" as primes for the target "apricot"). Priming effects were not influenced by whether or not absolute, length-dependent position was respected (e.g., "a-ric-t" vs. "arict"/"ar-i-ct"). Position of overlap of relative-position primes (e.g., apric-apricot; ricot-apricot; arict-apricot) was found to have little influence on the size of priming effects, particularly in conditions (i.e., 33 ms prime durations) where there was no evidence for phonological priming. The results constrain possible schemes for letter position coding. (PsycINFO Database Record (c) 2011 APA, all rights reserved)     

Vehicle detection with a mobile camera: spotting midrange, distant, and passing cars

In this article, a method is presented for detecting vehicles in image sequences without prior knowledge about the position of the road. A single camera placed in a moving vehicle provides image data. For the detection of midrange and distant vehicles, a combination of three clues is used: shadow, entropy, and horizontal symmetry. To detect passing vehicles, a temporal differencing and projected motion is used. The algorithms are tested by means of many different experiments. These experiments illustrate the robust and accurate performance of both approaches.     

Multiround algorithms for scheduling divisible loads

Divisible load applications occur in many fields of science and engineering and can be easily parallelized in a master-worker fashion, but pose several scheduling challenges. While a number of approaches have been proposed that allocate load to workers in a single round, using multiple rounds improves overlap of computation with communication. Unfortunately, multiround algorithms are difficult to analyze and have thus received only limited attention. In this paper, we answer three open questions in the multiround divisible load scheduling area: 1) how to account for latencies, 2) how to account for heterogeneous platforms, and 3) how many rounds should be used. To answer 1), we derive the first closed-form optimal schedule for a homogeneous platform with both computation and communication latencies, for a given number of rounds. To answer 2) and 3), we present a novel algorithm, UMR. We evaluate UMR in a variety of realistic scenarios.     

Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances

An enhanced concept of sub-optimal reverse Horn fraction of a CNF-formula was introduced in [18]. It was shown that this fraction is very useful in effectively (almost) separating 3-colorable random graphs with fixed node-edge density from the non-3-colorable ones. A correlation between this enhanced sub-optimal reverse Horn fraction and satisfiability of random 3-SAT instances with a fixed density was observed. In this paper, we present experimental evidence that this correlation scales to larger-sized instances and that it extends to solver performances as well, both of complete and incomplete solvers. Furthermore, we give a motivation for various phases in the algorithm aHS, establishing the enhanced sub-optimal reverse Horn fraction, and we present clear evidence for the fact that the observed correlations are stronger than correlations between satisfiability and sub-optimal MAXSAT-fractions established similarly to the enhanced sub-optimal reverse Horn fraction. The latter observation is noteworthy because the correlation between satisfiability and the optimal MAXSAT-fraction is obviously 100%. AMS subject classification 90C05, 03B99, 68Q01, 68W01     

Improved Competitive Guarantees for QoS Buffering

We consider a network providing Differentiated Services (DiffServ), which allow Internet Service Providers (ISPs) to offer different levels of Quality of Service (QoS) to different traffic streams. We study two types of buffering policies that are used in network switches supporting QoS. In the FIFO type, packets must be transmitted in the order they arrive. In the uniform bounded delay type, there is a maximal delay time associated with the switch and each packet must be transmitted within this time, or otherwise it is dropped. In both models the buffer space is limited, and packets are lost when the buffer overflows. Each packet has an intrinsic value, and the goal is to maximize the total value of transmitted packets. Our main contribution is an algorithm for the FIFO model with arbitrary packet values that for the first time achieves a competitive ratio better than 2, namely 2-ε for a constant ε gt; 0. We also describe an algorithm for the uniform bounded delay model which simulates our algorithm for the FIFO model, and show that it achieves the same competitive ratio.