Different Storing and Processing Conditions of Human Lymphocytes do not Alter P-Glycoprotein Rhodamine 123 Efflux.

P-glycoprotein (Pgp), a protein codified by Multi Drug Resistance (MDR1) gene, has a detoxifying function and might influence the toxicity and pharmacokinetics and pharmacodynamics of drugs. Sampling strategies to improve Pgp studies could be useful to optimize the sensitivity and the reproducibility of efflux assays. This study aimed to compare Pgp expression and efflux activity by measuring Rhodamine123 (Rh123) retention in lymphocytes stored under different conditions, in order to evaluate the potential utility of any of the storing conditions in Pgp functionality. Our results show no change in protein expression of Pgp by confocal studies and Western blotting, nor changes at the mRNA level (qRT-PCR). No differences in Rh123 efflux by Pgp activity assays were found between fresh and frozen lymphocytes after 24 hours of blood extraction, using either of the two Pgp specific inhibitors (VP and PSC833). Different working conditions in the 24 hours post blood extraction do not affect Rh123 efflux. These results allow standardization of Pgp activity measurement in different individuals with different timing of blood sampling and in different geographic areas. _______________

Image processing of false identity documents for forensic intelligence

Forensic intelligence has recently gathered increasing attention as a potential expansion of forensic science that may contribute in a wider policing and security context. Whilst the new avenue is certainly promising, relatively few attempts to incorporate models, methods and techniques into practical projects are reported. This work reports a practical application of a generalised and transversal framework for developing forensic intelligence processes referred to here as the Transversal model adapted from previous work. Visual features present in the images of four datasets of false identity documents were systematically profiled and compared using image processing for the detection of a series of modus operandi (M.O.) actions. The nature of these series and their relation to the notion of common source was evaluated with respect to alternative known information and inferences drawn regarding respective crime systems. 439 documents seized by police and border guard authorities across 10 jurisdictions in Switzerland with known and unknown source level links formed the datasets for this study. Training sets were developed based on both known source level data, and visually supported relationships. Performance was evaluated through the use of intra-variability and inter-variability scores drawn from over 48,000 comparisons. The optimised method exhibited significant sensitivity combined with strong specificity and demonstrates its ability to support forensic intelligence efforts.

Gridifying IBM's Generic Log Adapter to Speed-Up the Processing of Log Data

Peer-reviewed

Microstructural Brain Differences Predict Functional Hemodynamic Responses in a Reward Processing Task

Many aspects of human behavior are driven by rewards, yet different people are differentially sensitive to rewards and punishment. In this study, we showthat white matter microstructure inthe uncinate/inferiorfronto-occipitalfasciculus, defined byfractional anisotropy values derived from diffusion tensor magnetic resonance images, correlates with both short-term (indexed by the fMRI blood oxygenation level-dependent response to reward in the nucleus accumbens) and long-term (indexed by the trait measure sensitivity to punishment) reactivityto rewards.Moreover,traitmeasures of reward processingwere also correlatedwith reward-relatedfunctional activation in the nucleus accumbens. The white matter tract revealed by the correlational analysis connects the anterior temporal lobe with the medial and lateral orbitofrontal cortex and also supplies the ventral striatum. The pattern of strong correlations suggests an intimate relationship betweenwhitematter structure and reward-related behaviorthatmay also play a rolein a number of pathological conditions, such as addiction and pathological gambling.

An update on EMU sovereign yield spread drivers in times of crisis: A panel data analysis

We empirically investigate the determinants of EMU sovereign bond yield spreads with respect to the German bund. Using panel data techniques, we examine the role of a wide set of potential drivers. To our knowledge, this paper presents one of the most exhaustive compilations of the variables used in the literature to study the behaviour of sovereign yield spreads and, in particular, to gauge the effect on these spreads of changes in market sentiment and risk aversion. We use a sample of both central and peripheral countries from January 1999 to December 2012 and assess whether there were significant changes after the outbreak of the euro area debt crisis. Our results suggest that the rise in sovereign risk in central countries can only be partially explained by the evolution of local macroeconomic variables in those countries.

An update on EMU sovereign yield spread drivers in times of crisis: A panel data analysis

We empirically investigate the determinants of EMU sovereign bond yield spreads with respect to the German bund. Using panel data techniques, we examine the role of a wide set of potential drivers. To our knowledge, this paper presents one of the most exhaustive compilations of the variables used in the literature to study the behaviour of sovereign yield spreads and, in particular, to gauge the effect on these spreads of changes in market sentiment and risk aversion. We use a sample of both central and peripheral countries from January 1999 to December 2012 and assess whether there were significant changes after the outbreak of the euro area debt crisis. Our results suggest that the rise in sovereign risk in central countries can only be partially explained by the evolution of local macroeconomic variables in those countries.

New Distance Transforms for Gray Level Image Compression

This thesis deals with distance transforms which are a fundamental issue in image processing and computer vision. In this thesis, two new distance transforms for gray level images are presented. As a new application for distance transforms, they are applied to gray level image compression. The new distance transforms are both new extensions of the well known distance transform algorithm developed by Rosenfeld, Pfaltz and Lay. With some modification their algorithm which calculates a distance transform on binary images with a chosen kernel has been made to calculate a chessboard like distance transform with integer numbers (DTOCS) and a real value distance transform (EDTOCS) on gray level images. Both distance transforms, the DTOCS and EDTOCS, require only two passes over the graylevel image and are extremely simple to implement. Only two image buffers are needed: The original gray level image and the binary image which defines the region(s) of calculation. No other image buffers are needed even if more than one iteration round is performed. For large neighborhoods and complicated images the two pass distance algorithm has to be applied to the image more than once, typically 3 10 times. Different types of kernels can be adopted. It is important to notice that no other existing transform calculates the same kind of distance map as the DTOCS. All the other gray weighted distance function, GRAYMAT etc. algorithms find the minimum path joining two points by the smallest sum of gray levels or weighting the distance values directly by the gray levels in some manner. The DTOCS does not weight them that way. The DTOCS gives a weighted version of the chessboard distance map. The weights are not constant, but gray value differences of the original image. The difference between the DTOCS map and other distance transforms for gray level images is shown. The difference between the DTOCS and EDTOCS is that the EDTOCS calculates these gray level differences in a different way. It propagates local Euclidean distances inside a kernel. Analytical derivations of some results concerning the DTOCS and the EDTOCS are presented. Commonly distance transforms are used for feature extraction in pattern recognition and learning. Their use in image compression is very rare. This thesis introduces a new application area for distance transforms. Three new image compression algorithms based on the DTOCS and one based on the EDTOCS are presented. Control points, i.e. points that are considered fundamental for the reconstruction of the image, are selected from the gray level image using the DTOCS and the EDTOCS. The first group of methods select the maximas of the distance image to new control points and the second group of methods compare the DTOCS distance to binary image chessboard distance. The effect of applying threshold masks of different sizes along the threshold boundaries is studied. The time complexity of the compression algorithms is analyzed both analytically and experimentally. It is shown that the time complexity of the algorithms is independent of the number of control points, i.e. the compression ratio. Also a new morphological image decompression scheme is presented, the 8 kernels' method. Several decompressed images are presented. The best results are obtained using the Delaunay triangulation. The obtained image quality equals that of the DCT images with a 4 x 4

Development a distributed simulation environment on a cluster of workstations

Simulation has traditionally been used for analyzing the behavior of complex real world problems. Even though only some features of the problems are considered, simulation time tends to become quite high even for common simulation problems. Parallel and distributed simulation is a viable technique for accelerating the simulations. The success of parallel simulation depends heavily on the combination of the simulation application, algorithm and message population in the simulation is sufficient, no additional delay is caused by this environment. In this thesis a conservative, parallel simulation algorithm is applied to the simulation of a cellular network application in a distributed workstation environment. This thesis presents a distributed simulation environment, Diworse, which is based on the use of networked workstations. The distributed environment is considered especially hard for conservative simulation algorithms due to the high cost of communication. In this thesis, however, the distributed environment is shown to be a viable alternative if the amount of communication is kept reasonable. Novel ideas of multiple message simulation and channel reduction enable efficient use of this environment for the simulation of a cellular network application. The distribution of the simulation is based on a modification of the well known Chandy-Misra deadlock avoidance algorithm with null messages. The basic Chandy Misra algorithm is modified by using the null message cancellation and multiple message simulation techniques. The modifications reduce the amount of null messages and the time required for their execution, thus reducing the simulation time required. The null message cancellation technique reduces the processing time of null messages as the arriving null message cancels other non processed null messages. The multiple message simulation forms groups of messages as it simulates several messages before it releases the new created messages. If the message population in the simulation is suffiecient, no additional delay is caused by this operation A new technique for considering the simulation application is also presented. The performance is improved by establishing a neighborhood for the simulation elements. The neighborhood concept is based on a channel reduction technique, where the properties of the application exclusively determine which connections are necessary when a certain accuracy for simulation results is required. Distributed simulation is also analyzed in order to find out the effect of the different elements in the implemented simulation environment. This analysis is performed by using critical path analysis. Critical path analysis allows determination of a lower bound for the simulation time. In this thesis critical times are computed for sequential and parallel traces. The analysis based on sequential traces reveals the parallel properties of the application whereas the analysis based on parallel traces reveals the properties of the environment and the distribution.

Alternative Techniques of Neural Signal Processing in Neuroengineering

Neural signal processing is a discipline within neuroengineering. This interdisciplinary approach combines principles from machine learning, signal processing theory, and computational neuroscience applied to problems in basic and clinical neuroscience. The ultimate goal of neuroengineering is a technological revolution, where machines would interact in real time with the brain. Machines and brains could interface, enabling normal function in cases of injury or disease, brain monitoring, and/or medical rehabilitation of brain disorders. Much current research in neuroengineering is focused on understanding the coding and processing of information in the sensory and motor systems, quantifying how this processing is altered in the pathological state, and how it can be manipulated through interactions with artificial devices including brain–computer interfaces and neuroprosthetics.

Improving the efficiency of PV low-power processing circuits by selecting an optimal inductor current of the DC/DC converter

In the context of autonomous sensors powered by small-size photovoltaic (PV) panels, this work analyses how the efficiency of DC/DC-converter-based power processing circuits can be improved by an appropriate selection of the inductor current that transfers the energy from the PV panel to a storage unit. Each component of power losses (fixed, conduction and switching losses) involved in the DC/DC converter specifically depends on the average inductor current so that there is an optimal value of this current that causes minimal losses and, hence, maximum efficiency. Such an idea has been tested experimentally using two commercial DC/DC converters whose average inductor current is adjustable. Experimental results show that the efficiency can be improved up to 12% by selecting an optimal value of that current, which is around 300-350 mA for such DC/DC converters.

Program hosting in communications environment with Reactor and thread pool approach

In this thesis concurrent communication event handling is implemented using thread pool approach. Concurrent events are handled with a Reactor design pattern and multithreading is implemented using a Leader/Followers design pattern. Main focus is to evaluate behaviour of implemented model by different numbers of concurrent connections and amount of used threads. Furthermore, model feasibility in a PeerHood middleware is evaluated. Implemented model is evaluated with created test environment which enables concurrent message sending from multiple connections to the system under test. Messages round trip times are measured in the tester application. In the evaluation processing delay into system is simulated and influence of delay to the average round trip time is analysed.

Model for interevent times with long tails and multifractality in human communications: An application to financial trading

Social, technological, and economic time series are divided by events which are usually assumed to be random, albeit with some hierarchical structure. It is well known that the interevent statistics observed in these contexts differs from the Poissonian profile by being long-tailed distributed with resting and active periods interwoven. Understanding mechanisms generating consistent statistics has therefore become a central issue. The approach we present is taken from the continuous-time random-walk formalism and represents an analytical alternative to models of nontrivial priority that have been recently proposed. Our analysis also goes one step further by looking at the multifractal structure of the interevent times of human decisions. We here analyze the intertransaction time intervals of several financial markets. We observe that empirical data describe a subtle multifractal behavior. Our model explains this structure by taking the pausing-time density in the form of a superstatistics where the integral kernel quantifies the heterogeneous nature of the executed tasks. A stretched exponential kernel provides a multifractal profile valid for a certain limited range. A suggested heuristic analytical profile is capable of covering a broader region.

One, two, or many mechanisms? The brain's processing of complex words

The heated debate over whether there is only a single mechanism or two mechanisms for morphology has diverted valuable research energy away from the more critical questions about the neural computations involved in the comprehension and production of morphologically complex forms. Cognitive neuroscience data implicate many brain areas. All extant models, whether they rely on a connectionist network or espouse two mechanisms, are too underspecified to explain why more than a few brain areas differ in their activity during the processing of regular and irregular forms. No one doubts that the brain treats regular and irregular words differently, but brain data indicate that a simplistic account will not do. It is time for us to search for the critical factors free from theoretical blinders.