The Use of Vacuum Impregnation for Debittering Green Olives

The aim of this research was to assess the possibility of shortening the length of the debittering process for green table olive ‘Domat’ cultivar by vacuum impregnation (VI). For this purpose, debittering was carried out with NaCl (3 %), NaOH (1.5 %) and NaOH (1.5 %) + NaCl (3 %) solutions at atmospheric conditions and under vacuum (68 kPa). The effects of these applications on some physicochemical properties (total dry matter, total ash, titratable acidity, salt, protein, oil, oleuropein, total phenolics, antioxidant activity and colour) of the processed samples were determined. Total dry matter, titratable acidity, salt, protein and oil contents of the samples changed between 24.23 and 27.90, 0.22 and 0.45, 2.27 and 2.58, 0.50 and 1.26 and 6.79 and 9.42 % (w/w), respectively. Colour parameters (lightness (L*); redness (a*); yellowness (b*)) of the processed olives were measured as between 41.72 and 51.29, 15.09 and 13.30 and 22.79 and 34.84, respectively. Hue angles of the processed samples were changed between 59.78 and 68.52. VI was a useful tool for the shortening of the period of debittering process. Use of NaOH combined with NaCl in VI process caused the debittering period to decrease to 6 h. However, reduction of the amount of total phenolic compounds was the highest (21.43 %) in this condition. Use of alkali for debittering caused more dry matter diffusion from olive to the solution. There was no statistically significant difference between the oleuropein and total ash contents of the processed samples (p?<?0.01). Alkali treatment also caused more oil loss from the olives. Antioxidant activity of the samples reduced up to 59.89 %. This research was the first using VI for debittering of olives; further studies are necessary to optimise process conditions of debittering for limiting loss of natural antioxidants and other components and to ensure maximum benefits to the consumer.     

Hierarchical watermarking for secure image authentication withlocalization

Several fragile watermarking schemes presented in the literature are either vulnerable to vector quantization (VQ) counterfeiting attacks or sacrifice localization accuracy to improve security. Using a hierarchical structure, we propose a method that thwarts the VQ attack while sustaining the superior localization properties of blockwise independent watermarking methods. In particular, we propose dividing the image into blocks in a multilevel hierarchy and calculating block signatures in this hierarchy. While signatures of small blocks on the lowest level of the hierarchy ensure superior accuracy of tamper localization, higher level block signatures provide increasing resistance to VQ attacks. At the top level, a signature calculated using the whole image completely thwarts the counterfeiting attack. Moreover, "sliding window" searches through the hierarchy enable the verification of untampered regions after an image has been cropped. We provide experimental results to demonstrate the effectiveness of our method.     

A parallel householder tridiagonalization stratagem using scattered row decomposition

Householder's method for tridiagonalizing a real symmetric matrix, a major step in evaluating eigenvalues of the matrix, is modified into a parallel algorithm for a concurrent machine of message passing type. Each processor of the concurrent machine has its own CPU, communications control and local memory. Messages are passed through connections between processors. Although the basic algorithm is inherently serial, the computations can be spread over all processors by scattering different rows of the matrix into processors, hence the term “Scattered Row Decomposition”. The steps in the serial and the parallel algorithms are identified. Expressions for efficiency and speedup are given in terms of problem and machine parameters. For a concurrent machine of ring type interconnection, a selected representative problem of large order exhibits efficiency approaching 66 per cent.     

Solution errors in finite element analysis

The development of the finite element method so far indicates that it is a discretization technique especially suited for positive definite, self-adjoint, elliptic systems, or systems with such components. The application of the method leads to the discretized equations in the form of $\text{u}\text{?}\text{=}\text{f(u)}$, where u lists the response of the discretized system at n preselected points called nodes. Instead of explicit expressions, vector function f and its Jacobian f,_u are available only numerically for a numerically given u. The solution of $\text{u}\text{?}\text{=}\text{f(u)}$ is usually a digital computer. Due to finiteness of the computer wordlength, the numerical solution $\text{u}{}_{\mathrm{c}}$ is in general different from u. Let $\text{u}\text{(}\text{x}\text{, t)}$ denote the actual response of the system in continuum at points corresponding to those of u. In the literature. $\text{u}\text{(}\text{x}\text{, t)-}\text{u}$ is called the discretization errors, $\text{u}\text{-}\text{u}{}_{\mathrm{c}}$ the round-off errors, and the s is. $\text{u}\text{(}\text{x}\text{, t)-}\text{u}{}_{\mathrm{c}}$ is called the solution errors. In this paper, a state-of-the-art survey is given on the identification, growth, relative magnitudes, estimation, and control of the components of the solution errors.     

Penalty resolution of the babuska circle paradox

If the solution for a simply-supported circular plate is approximated by a sequence of finite element solutions on successively refined polygonal domains the finite element approximations converge to the solution of a different problem. In the present study we present a finite element formulation with boundary penalty that produces valid approximations to the simply-supported plate. The penalty term is shown to require the use of reduced integration. The dependence of the penalty parameter on mesh size h is also examined. Numerical experiments confirm the validity of the method and determine rates of convergence. A second approach involving a modified corner condition is also considered and error estimates determined. This scheme is implemented also using a discrete penalty technique. The results and rates are compared with the boundary penalty method and their relative merits discussed.     

On the modelling of CDNaaS deployment

With the increasing demand for over the top media content, understanding user perception and Quality of Experience (QoE) estimation have become a major business necessity for service providers. Online video broadcasting is a multifaceted procedure and calculation of performance for the components that build up a streaming platform requires an overall understanding of the Content Delivery Network as a service (CDNaaS) concept. Therefore, to evaluate delivery quality and predicting user perception while considering NFV (Network Function Virtualization) and limited cloud resources, a relationship between these concepts is required. In this paper, a generalized mathematical model to calculate the success rate of different tiers of online video delivery system is presented. Furthermore, an algorithm that indicates the correct moment to switch between CDNs is provided to improve throughput efficiency while maintaining QoE and keeping the cloud hosting costs as lowest possible.

     

An exponentially fitted method for solving Burgers' equation

In this paper, an exponentially fitted method is used to numerically solve the one‐dimensional Burgers' equation. The performance of the method is tested on the model involving moderately large Reynolds numbers. The obtained numerical results show that the method is efficient, stable and reliable for solving Burgers' equation accurately even involving high Reynolds numbers for which the exact solution fails. Copyright © 2009 John Wiley & Sons, Ltd.     

Proximity across the distant worlds of university–industry collaborations

This paper examines the extent to which firms perceive different dimensions of proximity to be important for the formation of their interactions with universities. Furthermore, it investigates whether the importance of the different types of proximities varies depending on the type of interaction—be it about knowledge exploration, knowledge exploitation, competence enhancement, advice-seeking or marketing. Using data from a survey of 1,200 Norwegian firms, we find that most managers believe cognitive, institutional, social and geographical proximity were important for their decision to collaborate with university partners and that the importance of proximity types varies depending on the contents of the interaction.     

Does techno-stress justify cyberslacking? An empirical study based on the neutralisation theory

ABSTRACT

On the basis of neutralisation theory, this paper associates technology-induced work stress with the engagement in non-business activities while at work. When neutralisation theory is linked to organisational behaviour, the theory states that employees are prone to engage in deviant behaviours in the workplace to balance the difficulties they have suffered. In this context, employees may strive to neutralise the negative consequences of technology-induced stress and feel justified considering that it is their right to engage in deviant behaviours, such as performing non-business activities. Therefore, the aim of this study is to explore the impact of technology-induced stress (techno-stress) on engaging in non-business online activities while at work (minor cyberslacking). To do so, survey method was used and data were gathered from 252 white-collar employees working in the manufacturing sector. Results of the regression analysis suggested that out of three dimensions of techno-stress, techno-invasion is the only predictor for cyberslacking. The practical contribution of this paper is that employers could decrease cyberslacking activities by alleviating techno-invasion level of employees. Recommendations are also offered to draw up policies to cope with techno-stress and cyberslacking.