Meat Quality of Lambs Fed on Palm Kernel Meal, a By-product of Biodiesel Production

This study aimed to establish the optimum level of palm kernel meal in the diet of Santa Ines lambs based on the sensorial characteristics and fatty acid profile of the meat. We used 32 lambs with a starting age of 4 to 6 months and mean weight of 22 2.75 kg, kept in individual stalls. The animals were fed with Tifton-85 hay and a concentrate mixed with 0.0, 6.5, 13.0 or 19.5% of palm kernel meal based on the dry mass of the complete diet. These levels formed the treatments. Confinement lasted 80 days and on the last day the animals were fasted and slaughtered. After slaughter, carcasses were weighed and sectioned longitudinally, along the median line, into two antimeres. Half-carcasses were then sliced between the 12th and 13th ribs to collect the loin (longissimus dorsi), which was used to determine the sensorial characteristics and fatty acid profile of the meat. For sensorial evaluation, samples of meat were given to 54 judges who evaluated the tenderness, juiciness, appearance, aroma and flavor of the meat using a hedonic scale. Fatty acids were determined by gas chromatography. The addition of palm kernel meal to the diet had no effect on the sensorial characteristics of meat juiciness, appearance, aroma or flavor. However, tenderness showed a quadratic relationship with the addition of the meal to the diet. The concentration of fatty acids C12:0, C14:0 and C16:0 increased with the addition of palm kernel meal, as did the sum of medium-chain fatty acids and the atherogenicity index. Up to of 19.5% of the diet of Santa Ines lambs can be made up of palm kernel meal without causing significant changes in sensorial characteristics. However, the fatty acid profile of the meat was altered.

Population balance modelling of granulation with a physically based coalescence kernel

It was previously published by the authors that granules can either coalesce through Type I (when granules coalesce by viscous dissipation in the surface liquid layer before their surfaces touch) or Type II (when granules are slowed to a halt during rebound, after their surfaces have made contact) (AIChE J. 46 (3) (2000) 529). Based on this coalescence mechanism, a new coalescence kernel for population balance modelling of granule growth is presented. The kernel is constant such that only collisions satisfying the conditions for one of the two coalescence types are successful. One constant rate is assigned to each type of coalescence and zero is for the case of rebound. As the conditions for Types I and II coalescence are dependent on granule and binder properties, the coalescence kernel is thus physically based. Simulation results of a variety of binder and granule materials show good agreement with experimental data. (C) 2002 Elsevier Science Ltd. All rights reserved.

The effect of water, brine and ethanol flotation on the quality and shelf life of macadamia kernels 2. Kernel pieces

Raw macadamia kernel pieces were immersed in water (specific gravity 1.00 g/cm(3)), brine (SG 1.02 g/cm(3)) or ethanol solution (SG 0.97 g/cm(3)) for 30 or 60 s, then re-dried to below 1.5% moisture (wet basis) and stored under vacuum for 0, 4 and 12 months. Flotation in water had no effect on the quality or shelf life of the kernel pieces over 12 months storage, as measured by sensory evaluation of the kernels and chemical analysis of the kernel oil. Immersion in a salt solution caused unacceptable changes in quality during storage, increasing as storage time increased. Flotation in dilute ethanol also caused unacceptable quality changes during storage. Therefore, only flotation of macadamia kernel pieces in water can be recommended for commercial operations. Microbiological concerns with such a process still need to be addressed.

Error bounds for low-rank approximations of the first exponential integral kernel

A hierarchical matrix is an efficient data-sparse representation of a matrix, especially useful for large dimensional problems. It consists of low-rank subblocks leading to low memory requirements as well as inexpensive computational costs. In this work, we discuss the use of the hierarchical matrix technique in the numerical solution of a large scale eigenvalue problem arising from a finite rank discretization of an integral operator. The operator is of convolution type, it is defined through the first exponential-integral function and, hence, it is weakly singular. We develop analytical expressions for the approximate degenerate kernels and deduce error upper bounds for these approximations. Some computational results illustrating the efficiency and robustness of the approach are presented.

Sistema de aquisição de dados em tempo real

Neste trabalho propus-me realizar um Sistema de Aquisição de Dados em Tempo Real via Porta Paralela. Para atingir com sucesso este objectivo, foi realizado um levantamento bibliográfico sobre sistemas operativos de tempo real, salientando e exemplificando quais foram marcos mais importantes ao longo da sua evolução. Este levantamento permitiu perceber o porquê da proliferação destes sistemas face aos custos que envolvem, em função da sua aplicação, bem como as dificuldades, científicas e tecnológicas, que os investigadores foram tendo, e que foram ultrapassando com sucesso. Para que Linux se comporte como um sistema de tempo real, é necessário configura-lo e adicionar um patch, como por exemplo o RTAI ou ADEOS. Como existem vários tipos de soluções que permitem aplicar as características inerentes aos sistemas de tempo real ao Linux, foi realizado um estudo, acompanhado de exemplos, sobre o tipo de arquitecturas de kernel mais utilizadas para o fazer. Nos sistemas operativos de tempo real existem determinados serviços, funcionalidades e restrições que os distinguem dos sistemas operativos de uso comum. Tendo em conta o objectivo do trabalho, e apoiado em exemplos, fizemos um pequeno estudo onde descrevemos, entre outros, o funcionamento escalonador, e os conceitos de latência e tempo de resposta. Mostramos que há apenas dois tipos de sistemas de tempo real o ‘hard’ que tem restrições temporais rígidas e o ‘soft’ que engloba as restrições temporais firmes e suaves. As tarefas foram classificadas em função dos tipos de eventos que as despoletam, e evidenciando as suas principais características. O sistema de tempo real eleito para criar o sistema de aquisição de dados via porta paralela foi o RTAI/Linux. Para melhor percebermos o seu comportamento, estudamos os serviços e funções do RTAI. Foi dada especial atenção, aos serviços de comunicação entre tarefas e processos (memória partilhada e FIFOs), aos serviços de escalonamento (tipos de escalonadores e tarefas) e atendimento de interrupções (serviço de rotina de interrupção - ISR). O estudo destes serviços levou às opções tomadas quanto ao método de comunicação entre tarefas e serviços, bem como ao tipo de tarefa a utilizar (esporádica ou periódica). Como neste trabalho, o meio físico de comunicação entre o meio ambiente externo e o hardware utilizado é a porta paralela, também tivemos necessidade de perceber como funciona este interface. Nomeadamente os registos de configuração da porta paralela. Assim, foi possível configura-lo ao nível de hardware (BIOS) e software (módulo do kernel) atendendo aos objectivos do presente trabalho, e optimizando a utilização da porta paralela, nomeadamente, aumentando o número de bits disponíveis para a leitura de dados. No desenvolvimento da tarefa de hard real-time, foram tidas em atenção as várias considerações atrás referenciadas. Foi desenvolvida uma tarefa do tipo esporádica, pois era pretendido, ler dados pela porta paralela apenas quando houvesse necessidade (interrupção), ou seja, quando houvesse dados disponíveis para ler. Desenvolvemos também uma aplicação para permitir visualizar os dados recolhidos via porta paralela. A comunicação entre a tarefa e a aplicação é assegurada através de memória partilhada, pois garantindo a consistência de dados, a comunicação entre processos do Linux e as tarefas de tempo real (RTAI) que correm ao nível do kernel torna-se muito simples. Para puder avaliar o desempenho do sistema desenvolvido, foi criada uma tarefa de soft real-time cujos tempos de resposta foram comparados com os da tarefa de hard real-time. As respostas temporais obtidas através do analisador lógico em conjunto com gráficos elaborados a partir destes dados, mostram e comprovam, os benefícios do sistema de aquisição de dados em tempo real via porta paralela, usando uma tarefa de hard real-time.

On the implementation of real-time slotbased task-splitting scheduling algorithms for multiprocessor systems

In this paper we discuss challenges and design principles of an implementation of slot-based tasksplitting algorithms into the Linux 2.6.34 version. We show that this kernel version is provided with the required features for implementing such scheduling algorithms. We show that the real behavior of the scheduling algorithm is very close to the theoretical. We run and discuss experiments on 4-core and 24-core machines.

Sporadic multiprocessor Linux scheduler

The advent of multicore systems has renewed the interest of research community on real-time scheduling on multiprocessor systems. Real-time scheduling theory for uniprocessors is considered a mature research field, but real-time scheduling theory for multiprocessors is an emerging research field. Being part of this research community I have decided to implement the Sporadic Multiprocessor Linux Scheduler that implements a new real-time scheduling algorithm, which was designed to schedule real-time sporadic tasks on multiprocessor systems. This technical reports describes the implementation of the SMLS.

Run-time monitoring approach for the shark kernel

Typically common embedded systems are designed with high resource constraints. Static designs are often chosen to address very specific use cases. On contrast, a dynamic design must be used if the system must supply a real-time service where the input may contain factors of indeterminism. Thus, adding new functionality on these systems is often accomplished by higher development time, tests and costs, since new functionality push the system complexity and dynamics to a higher level. Usually, these systems have to adapt themselves to evolving requirements and changing service requests. In this perspective, run-time monitoring of the system behaviour becomes an important requirement, allowing to dynamically capturing the actual scheduling progress and resource utilization. For this to succeed, operating systems need to expose their internal behaviour and state, making it available to the external applications, usually using a run-time monitoring mechanism. However, such mechanism can impose a burden in the system itself if not wisely used. In this paper we explore this problem and propose a framework, which is intended to provide this run-time mechanism whilst achieving code separation, run-time efficiency and flexibility for the final developer.

Abstract Timers and their Implementation onto the ARM Cor tex-M family of MCUs

Presented at Embed with Linux Workshop (EWiLi 2015). 4 to 9, Oct, 2015. Amsterdam, Netherlands.

Implementation of a unified userspace time handling library under the Linux OS

An appropriate assessment of end-to-end network performance presumes highly efficient time tracking and measurement with precise time control of the stopping and resuming of program operation. In this paper, a novel approach to solving the problems of highly efficient and precise time measurements on PC-platforms and on ARM-architectures is proposed. A new unified High Performance Timer and a corresponding software library offer a unified interface to the known time counters and automatically identify the fastest and most reliable time source, available in the user space of a computing system. The research is focused on developing an approach of unified time acquisition from the PC hardware and accordingly substituting the common way of getting the time value through Linux system calls. The presented approach provides a much faster means of obtaining the time values with a nanosecond precision than by using conventional means. Moreover, it is capable of handling the sequential time value, precise sleep functions and process resuming. This ability means the reduction of wasting computer resources during the execution of a sleeping process from 100% (busy-wait) to 1-1.5%, whereas the benefits of very accurate process resuming times on long waits are maintained.

ParallelKnoppix - Rapid deployment of a linux cluster for MPI parallel processing using non-dedicated computers

This note describes ParallelKnoppix, a bootable CD that allows creation of a Linux cluster in very little time. An experienced user can create a cluster ready to execute MPI programs in less than 10 minutes. The computers used may be heterogeneous machines, of the IA-32 architecture. When the cluster is shut down, all machines except one are in their original state, and the last can be returned to its original state by deleting a directory. The system thus provides a means of using non-dedicated computers to create a cluster. An example session is documented.

Automatización de la gestión del ciclo de vida de entornos Linux y Solaris

Los requisitos del Negocio que requieren un gran crecimiento generan mayor complejidad en los Centros de Cómputo.Son los administradores quienes necesitan gestionar el creciente volumen de datos, aplicaciones, y usuarios, así como la rápida proliferación de los servidores y los diferentes sistemas operativos. En este proyecto se pretende reducir la complejidad en la gestión de los Centros de Cómputo, combinando la automatización de la gestión del ciclo de vida y todas las medidas de contingencia necesarias para mantener la integridad de los mismos.

dEICbian: una distribució GNU/LINUX personalitzada per laboratoris de docència

En aquest projecte es desenvolupa una distribució GNU/Linux adaptada als laboratoris de docència del departament d’enginyeria de la informació i de les comunicacions. Partint de una anàlisi exhaustiu de les necessitats del departament i gràcies a la col·laboració dels seus membres s’ha realitzat la distribució dEICbian, un sistema que permetrà facilitar les tasques docents als laboratoris del departament. Amb l’objectiu de mantenir el sistema actualitzat també s’ha desenvolupat un generador de noves versions de la distribució dEICbian per tal de garantir tenir, sempre, un sistema modern i lliure d’errors als laboratoris del departament. L’opinió dels usuaris, expressada mitjançant enquestes, ha estat favorable i ara només resta el darrer pas: la seva implementació als laboratoris.