Institutions

About Us

Help

Gaeilge
0
1000
Home
Browse
Advanced Search
Search History
Marked List
Statistics
A
A
A
Author(s)
Institution
Publication types
Funder
Year
Limited By:
Subject = Hamilton Institute;
456 items found
Sort by
Title
Author
Item type
Date
Institution
Peer review status
Language
Order
Ascending
Descending
25
50
100
per page
1
2
3
4
5
6
7
8
9
10
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Displaying Results 1  25 of 456 on page 1 of 19
Marked
Mark
802.11 Buffers: When Bigger Is Not Better?
(2013)
Malone, David; Qi, Hanghang; Botvich, Dmitri; Patras, Paul
802.11 Buffers: When Bigger Is Not Better?
(2013)
Malone, David; Qi, Hanghang; Botvich, Dmitri; Patras, Paul
Abstract:
While there have been considerable advances in the modelling of 802.11’s MAC layer in recent years, 802.11 with finite buffer space is considered difficult to analyse. In this paper, we study the impact of finite buffers’ effect on the 802.11 performance, in view of the requirements of interactive applications sensitive to delay and packet loss. Using both stateofthe art and simplified queueing models, we identify a surprising result. Specifically, we find that increased buffering throughout an 802.11 network will not only incur delay, but may actually increase the packet loss experienced by stations. By means of numerical analysis and simulations we show that this nonmonotonic behaviour arises because of the contentionbased nature of the medium access protocol, whose performance is closely related to the traffic load and the buffer size. Finally, we discuss on protocol and buffer tuning towards eliminating such undesirable effect.
http://mural.maynoothuniversity.ie/6016/
Marked
Mark
802.11 Wireless LAN Multiplayer Game Capacity and Optimization
(2009)
Qi, Hanghang; Malone, David; Botvich, Dmitri
802.11 Wireless LAN Multiplayer Game Capacity and Optimization
(2009)
Qi, Hanghang; Malone, David; Botvich, Dmitri
Abstract:
Realtime multiplayer games are a popular application of networks and as IEEE 802.11 wireless networks are widely used, games are expected to be widely played on wireless networks. However, 802.11 networks with the normal MAC (DCF) may present some challenges when supporting realtime games traffic. In this work, we present a theoretical model which can predict the performance and capacity of 802.11 WLAN for Quake 4, a realtime FPS game. Using the wireless network game model, we derive throughput, delay, jitter and MOS (mean opinion score) as the number of game clients increases in the WLAN and predict that the capacity of a default 802.11b wireless network can support around 10 players for Quake 4. In 802.11e networks, QoS (quality of service) is provided with 4 configurable MAC layer parameters. With the network game model, we show that with proper TXOP configuration at the AP and game server, the network can be optimized and its capacity improves to around 15 players.
http://mural.maynoothuniversity.ie/2216/
Marked
Mark
A Combinatorial Approach to Nearly Uncoupled Markov Chains
(2011)
Tifenbach, Ryan M.
A Combinatorial Approach to Nearly Uncoupled Markov Chains
(2011)
Tifenbach, Ryan M.
Abstract:
A discretetime Markov chain on a state space S is a sequence of random variables X = fx0; x1; : : :g that take on values in S. A Markov chain is a model of a system which changes or evolves over time; the random variable xt is the state of the system at time t. A subset E S is referred to as an almost invariant aggregate if whenever xt 2 E, then with high probability xt+1 2 E, as well. That is, if there is a small positive value such that if xt 2 E then the probability that xt+1 =2 E is less than or equal to , then E is an almost invariant aggregate. If E is such an aggregate and xt 2 E, then the probability that xt+1; : : : ; xt+s 2 E is at least (1E)s. A Markov chain tends to remain within its almost invariant aggregates (if it possesses any) for long periods of time. We refer to the Markov chain X as nearly uncoupled (with respect to some positive ) if its associated state space contains two or more disjoint almost invariant aggregates. Nearly uncoupled Markov chains are char...
http://mural.maynoothuniversity.ie/3730/
Marked
Mark
A Comparison of RF Exposure in Macro and Femtocells
(2013)
Zarikoff, Brad; Malone, David
A Comparison of RF Exposure in Macro and Femtocells
(2013)
Zarikoff, Brad; Malone, David
Abstract:
This paper assesses radio frequency exposure of a mobile handset user in the context of a new class of cellular base station: the femtocell. Traditional cellular network construction relies on using a single base station to cover a large area and serve dozens to hundreds of users. The femtocell (named after the minuscule size of the coverage area) provides a lowpower inhome cellular connection for the mobile handset. Consequently, we expect it to behave differently to a macrocell in terms of the users radio frequency energy exposure. Our work focuses on the tradeoff in incident power on the mobile handset user when connected to either a macrocell or femtocell using power loss and power control models. Contrary to many individuals initial feeling that putting a base station in your home would increase exposure, our findings indicate that having a femtocell in the home will actual reduce the mobile handset users exposure to radio frequency energy.
http://mural.maynoothuniversity.ie/4853/
Marked
Mark
A ContextSensitive Generalization of ICA
(1996)
Pearlmutter, Barak A.; Parra, Lucas C.
A ContextSensitive Generalization of ICA
(1996)
Pearlmutter, Barak A.; Parra, Lucas C.
Abstract:
Source separation arises in a surprising number of signal processing applications, from speech recognition to EEG analysis. In the square linear blind source separation problem without time delays, one must find an unmixing matrix which can detangle the result of mixing n unknown independent sources through an unknown n x n mixing matrix. The recently introduced ICA blind source separation algorithm (Baram and Roth 1994; Bell and Sejnowski 1995) is a powerful and surprisingly simple technique for solving this problem. ICA is all the more remarkable for performing so well despite making absolutely no use of the temporal structure of its input! This paper presents a new algorithm, contextual ICA, which derives from a maximum likelihood density estimation formulation of the problem. cICA can incorporate arbitrarily complex adaptive historysensitive source models, and thereby make use of the temporal structure of its input. This allows it to separate in a number of situations where sta...
http://mural.maynoothuniversity.ie/5491/
Marked
Mark
A control theoretic approach to mitigate viral escape in HIV
(2011)
Hernandez Vargas, Esteban Abelardo
A control theoretic approach to mitigate viral escape in HIV
(2011)
Hernandez Vargas, Esteban Abelardo
Abstract:
A very important scientific advance was the identification of HIV as a causative agent for AIDS. HIV infection typically involves three main stages: a primary acute infection, a long asymptomatic period and a final increase in viral load with a simultaneous collapse in healthy CD4+T cell count during which AIDS appears. Motivated by the worldwide impact of HIV infection on health and the difficulties to test in vivo or in vitro the different hypothesis which help us to understand the infection, we study the problem from a control theoretic perspective. We present a deterministic ordinary differential equation model that is able to represent the three main stages in HIV infection. The mechanism behind this model suggests that macrophages could be longterm latent reservoirs for HIV and may be important in the progression to AIDS. To avoid or slow this progression to AIDS, antiretroviral drugs were introduce in the late eighties. However, these drugs are not always successful causing ...
http://mural.maynoothuniversity.ie/2774/
Marked
Mark
A controltheoretic approach to dynamic optimization of metabolic networks
(2010)
Oyarzun Rodriguez, Diego Antonio
A controltheoretic approach to dynamic optimization of metabolic networks
(2010)
Oyarzun Rodriguez, Diego Antonio
Abstract:
The characterization of general control principles that underpin metabolic dynamics is an important part of systems analysis in biology. It has been long argued that many biological regulatory mechanisms have evolved so as to optimize cellular adaptation in response to external stimuli. In this thesis we use an optimal control framework to solve dynamic optimization problems associated with metabolic dynamics. The analysis is based on a nonlinear controlane model of a metabolic network with the enzyme concentrations as control inputs. We consider the optimization of timedependent enzyme concentrations to activate an unbranched network and reach a prescribed metabolic ux. The solution accounts for timeresource optimality under constraints in the total enzymatic abundance. We identify a temporal pattern in the solution that is consistent with previous experimental and numerical observations. Our analysis suggests that this behaviour may appear in a broader class of networks than p...
http://mural.maynoothuniversity.ie/1899/
Marked
Mark
A Convergence Result for the Kuramoto Model with AlltoAll Coupling
(2011)
Verwoerd, Mark; Mason, Oliver
A Convergence Result for the Kuramoto Model with AlltoAll Coupling
(2011)
Verwoerd, Mark; Mason, Oliver
Abstract:
We prove a convergence result for the standard Kuramoto model with alltoall coupling. Specifically, we show that the critical coupling strength associ ated with the onset of completely phaselocked behavior converges in probability as the number of oscillators tends to infinity.
http://mural.maynoothuniversity.ie/6058/
Marked
Mark
A critique of recently proposed buffersizing strategies.
(2007)
VuBrugie, G.; Stanojević, R.S.; Leith, Douglas J.; Shorten, Robert N.
A critique of recently proposed buffersizing strategies.
(2007)
VuBrugie, G.; Stanojević, R.S.; Leith, Douglas J.; Shorten, Robert N.
Abstract:
Internet router buffers are used to accommodate packets that arrive in bursts and to maintain high utilization of the egress link. Such buffers can lead to large queueing delays. Recently, several papers have suggested that it may, under general circumstances, be possible to achieve high utilisation with small network buffers. In this paper we review these recommendations. Serious issues are reported that question the utility of these recommendations.
http://mural.maynoothuniversity.ie/1734/
Marked
Mark
A CycleBased Bound for Subdominant Eigenvalues of Stochastic Matrices
(2009)
Kirkland, Steve
A CycleBased Bound for Subdominant Eigenvalues of Stochastic Matrices
(2009)
Kirkland, Steve
Abstract:
Given a primitive stochastic matrix, we provide an upper bound on the moduli of its nonPerron eigenvalues. The bound is given in terms of the weights of the cycles in the directed graph associated with the matrix. The bound is attainable in general, and we characterize a special case of equality when the stochastic matrix has a positive row. Applications to Leslie matrices and to Googletype matrices are also considered
http://mural.maynoothuniversity.ie/2191/
Marked
Mark
A Design Methodology for Switched Discrete Time Linear Systems with Applications to Automotive Roll Dynamics Control
(2008)
Solmaz, Selim; Shorten, Robert N.; Wulff, Kai; Ó Cairbre, Fiacre
A Design Methodology for Switched Discrete Time Linear Systems with Applications to Automotive Roll Dynamics Control
(2008)
Solmaz, Selim; Shorten, Robert N.; Wulff, Kai; Ó Cairbre, Fiacre
Abstract:
In this paper we consider the asymptotic stability of a class of discretetime switching linear systems, where each of the constituent subsystems is Schur stable. We first present an example to motivate our study, which illustrates that the bilinear transform does not preserve the stability of a class of switched linear systems. Consequently, continuous time stability results cannot be transformed to discrete time analogs using this transformation. We then present a subclass of discretetime switching systems, that arise frequently in practical applications. We prove that global attractivity for this subclass can be obtained without requiring the existence of a common quadratic Lyapunov function (CQLF). Using this result we present a synthesis procedure to construct switching stabilizing controllers for an automotive control problem, which is related to the stabilization of a vehicle's roll dynamics subject to switches in the center of gravity (CG) height.
http://mural.maynoothuniversity.ie/892/
Marked
Mark
A design methodology for switched discrete time linear systems with applications to automotive roll dynamics control.
(2008)
Solmaz, Selim; Shorten, Robert N.; Wulff, Kai; Ó Cairbre, Fiacre
A design methodology for switched discrete time linear systems with applications to automotive roll dynamics control.
(2008)
Solmaz, Selim; Shorten, Robert N.; Wulff, Kai; Ó Cairbre, Fiacre
Abstract:
In this paper we consider the asymptotic stability of a class of discretetime switching linear systems, where each of the constituent subsystems is Schur stable. We first present an example to motivate our study, which illustrates that the bilinear transform does not preserve the stability of a class of switched linear systems. Consequently, continuous time stability results cannot be transformed to discrete time analogs using this transformation. We then present a subclass of discretetime switching systems, that arise frequently in practical applications. We prove that global attractivity for this subclass can be obtained without requiring the existence of a common quadratic Lyapunov function (CQLF). Using this result we present a synthesis procedure to construct switching stabilizing controllers for an automotive control problem, which is related to the stabilization of a vehicle’s roll dynamics subject to switches in the center of gravity (CG) height.
http://mural.maynoothuniversity.ie/1670/
Marked
Mark
A Distributed and PrivacyAware Speed Advisory System for Optimising Conventional and Electric Vehicles Networks
(2015)
Liu, Mingming; OrdonezHurtado, Rodrigo H.; Wirth, Fabian; Gu, Yingqi; Crisostomi, Eman...
A Distributed and PrivacyAware Speed Advisory System for Optimising Conventional and Electric Vehicles Networks
(2015)
Liu, Mingming; OrdonezHurtado, Rodrigo H.; Wirth, Fabian; Gu, Yingqi; Crisostomi, Emanuele; Shorten, Robert N.
Abstract:
One of the key ideas to make Intelligent Transportation Systems (ITS) work effectively is to deploy advanced communication and cooperative control technologies among the vehicles and road infrastructures. In this spirit, we propose a consensus based distributed speed advisory system that optimally determines a recommended common speed for a given area in order that the group emissions, or group battery consumptions, are minimised. Our algorithms achieve this in a privacyaware manner; namely, individual vehicles do not reveal invehicle information to other vehicles or to infrastructure. Mathematical proofs are given to prove the convergence of the algorithm, SUMO simulations are given to illustrate the efficacy of the algorithm, and hardwareintheloop tests involving real vehicles are given to illustrate user acceptability and ease of the deployment.
http://mural.maynoothuniversity.ie/6321/
Marked
Mark
A Fast Minimal Infrequent Itemset Mining Algorithm
(2014)
Demchuk, Kostiantyn
A Fast Minimal Infrequent Itemset Mining Algorithm
(2014)
Demchuk, Kostiantyn
Abstract:
A novel fast algorithm for finding quasi identifiers in large datasets is presented. Performance measurements on a broad range of datasets demonstrate substantial reductions in runtime relative to the state of the art and the scalability of the algorithm to realisticallysized datasets up to several million records.
http://mural.maynoothuniversity.ie/6325/
Marked
Mark
A Fast Minimal Infrequent Itemset Mining Algorithm
(2014)
Demchuk, Kostyantyn; Leith, Douglas J.
A Fast Minimal Infrequent Itemset Mining Algorithm
(2014)
Demchuk, Kostyantyn; Leith, Douglas J.
Abstract:
A novel fast algorithm for finding quasi identifiers in large datasets is presented. Performance measurements on a broad range of datasets demonstrate substantial reductions in runtime relative to the state of the art and the scalability of the algorithm to realisticallysized datasets up to several million records.
http://mural.maynoothuniversity.ie/5951/
Marked
Mark
A framework for decentralised feedback connectivity control with application to sensor networks
(2009)
Knorn, F.; Stanojević, R.; Corless, M.; Shorten, Robert N.
A framework for decentralised feedback connectivity control with application to sensor networks
(2009)
Knorn, F.; Stanojević, R.; Corless, M.; Shorten, Robert N.
Abstract:
In this paper we propose a decentralised algorithm for connectivity maintenance in a distributed sensor network. Our algorithm uses the dynamics of a consensus algorithm to estimate the connectivity of a network topology in a decentralised manner. These estimates are then used to inform a decentralised control algorithm that regulates the network connectivity to some desired level. Under certain realistic assumptions we show the closed loop dynamics can be described as a consensus algorithm with an input, and eventually reduces to a scalar system. Bounds are given to ensure the stability of the algorithm and examples are given to illustrate the efficacy of the proposed algorithm.
http://mural.maynoothuniversity.ie/1655/
Marked
Mark
A Generic Algorithm for Midcall Audio Codec Switching
(2013)
Assem, Haytham; Adel, Mohamed; Jennings, Brendan; Malone, David; Dunne, Jonathan; O...
A Generic Algorithm for Midcall Audio Codec Switching
(2013)
Assem, Haytham; Adel, Mohamed; Jennings, Brendan; Malone, David; Dunne, Jonathan; O'Sullivan, Pat
Abstract:
We present and evaluate an algorithm that performs incall selection of the most appropriate audio codec given prevailing conditions on the network path between the endpoints of a voice call. We have studied the behaviour of different codecs under varying network conditions, in doing so deriving the impairment factors for nonITUT codecs so that the Emodel can be used to assess voice call quality for them. Moreover, we have studied the drawbacks of codec switching from the end user perception point of view; our switching algorithm seeks to minimise this impact. We have tested our algorithm on different packages that contain a selection of the most commonly used codecs: G.711, SILK, ILBC, GSM and SPEEX. Our results show that in many typical network scenarios, our switching codecs midcall algorithm results in better Quality of Experience (QoE) than would have been achieved had the initial codec been used throughout the call.
http://mural.maynoothuniversity.ie/6239/
Marked
Mark
A Geometrical Treatment for Obtaining Necessary and Sufficient Conditions for Joint Quadratic Lyapunov Function Existence for StateDependent, Switched Systems: A TwoDimensional Case
(2009)
Griggs, Wynita M.; King, Christopher K.; Shorten, Robert N.; Mason, Oliver; Wulff, Kai
A Geometrical Treatment for Obtaining Necessary and Sufficient Conditions for Joint Quadratic Lyapunov Function Existence for StateDependent, Switched Systems: A TwoDimensional Case
(2009)
Griggs, Wynita M.; King, Christopher K.; Shorten, Robert N.; Mason, Oliver; Wulff, Kai
Abstract:
The question of existence of joint quadratic Lyapunov functions (QLFs) for statedependent, switched dynamical systems is given a preliminary geometrical treatment in this paper. The joint QLF problem for a switched system and a collection of regions defined by state vectors that determine when switching occurs consists of finding nonempty intersections of convex sets of QLFs. The existence of a joint QLF guarantees switched system stability. Necessary and sufficient conditions for the existence of a joint QLF are obtained for a twodimensional problem.
http://mural.maynoothuniversity.ie/2220/
Marked
Mark
A global attractivity result for a class of switching discretetime systems
(2007)
Solmaz, Selim; Shorten, Robert N.; Ó Cairbre, Fiacre
A global attractivity result for a class of switching discretetime systems
(2007)
Solmaz, Selim; Shorten, Robert N.; Ó Cairbre, Fiacre
Abstract:
In this paper we present the global attractivity properties of a class of discretetime switching systems of the form x(k+1)=Aix(k), Ai A , {A1, ...,Am}, where each constituent matrices Ai Rnn are Schur stable. We show that for a special subset of such switching systems the origin is globally attractive, and it is possible to prove this without requiring the existence of a common quadratic Lyapunov function (CQLF).
http://mural.maynoothuniversity.ie/888/
Marked
Mark
A KalmanYakubovichPopovtype lemma for systems with certain statedependent constraints
(2011)
King, Christopher K.; Griggs, Wynita M.; Shorten, Robert N.
A KalmanYakubovichPopovtype lemma for systems with certain statedependent constraints
(2011)
King, Christopher K.; Griggs, Wynita M.; Shorten, Robert N.
Abstract:
In this note, a result is presented that may be considered an extension of the classical KalmanYakubovichPopov (KYP) lemma. Motivated by problems in the design of switched systems, we wish to infer the existence of a quadratic Lyapunov function (QLF) for a nonlinear system in the case where a matrix defining one system is a rank1 perturbation of the other and where switching between the systems is orchestrated according to a conic partitioning of the state space IRn. We show that a necessary and sufficient condition for the existence of a QLF reduces to checking a single constraint on a sum of transfer functions irrespective of problem dimension. Furthermore, we demonstrate that our conditions reduce to the classical KYP lemma when the conic partition of the state space is IRn, with the transfer function condition reducing to the condition of Strict Positive Realness.
http://mural.maynoothuniversity.ie/3602/
Marked
Mark
A Linear Network Code Construction for General Integer Connections Based on the Constraint Satisfaction Problem
(2015)
Cui, Ying; Medard, Muriel; Yeh, Edmund; Leith, Douglas J.; Duffy, Ken R.
A Linear Network Code Construction for General Integer Connections Based on the Constraint Satisfaction Problem
(2015)
Cui, Ying; Medard, Muriel; Yeh, Edmund; Leith, Douglas J.; Duffy, Ken R.
Abstract:
The problem of finding network codes for general connections is inherently difficult. Resource minimization for general connections with network coding is further complicated. The existing solutions mainly rely on very restricted classes of network codes, and are almost all centralized. In this paper, we introduce linear network mixing coefficients for code constructions of general connections that generalize random linear network coding (RLNC) for multicast connections. For such code constructions, we pose the problem of cost minimization for the subgraph involved in the coding solution and relate this minimization to a Constraint Satisfaction Problem (CSP) which we show can be simplified to have a moderate number of constraints. While CSPs are NPcomplete in general, we present a probabilistic distributed algorithm with almost sure convergence in finite time by applying Communication Free Learning (CFL). Our approach allows fairly general coding across flows, guarantees no greater...
http://mural.maynoothuniversity.ie/6350/
Marked
Mark
A methodology for the design of robust rollover prevention controllers for automotive vehicles with active steering
(2007)
Solmaz, Selim; Corless, Martin; Shorten, Robert N.
A methodology for the design of robust rollover prevention controllers for automotive vehicles with active steering
(2007)
Solmaz, Selim; Corless, Martin; Shorten, Robert N.
Abstract:
In this paper we present a robust controller design methodology for vehicle rollover prevention utilizing active steering. Control design is based on keeping the magnitude of the vehicle load transfer ratio (LTR) below a certain level in the presence of driver steering inputs; we also develop an exact expression for LTR. The proposed controllers have a proportionalintegral structure whose gain matrices are obtained using the results of Pancake, Corless and Brockman. These controllers reduce the transient magnitude of the LTR while maintaining the steady state steering response of the vehicle. The controllers can be designed to be robust with respect to vehicle parameters such as speed and centre of gravity height. We also provide a modification to the controllers so that they only activate when the potential for rollover is significant. Numerical simulations demonstrate the efficacy of our approach and the resulting controllers.
http://mural.maynoothuniversity.ie/889/
Marked
Mark
A methodology for the design of robust rollover prevention controllers for automotive vehicles: Part 1Differential Braking
(2006)
Solmaz, Selim; Corless, Martin; Shorten, Robert N.
A methodology for the design of robust rollover prevention controllers for automotive vehicles: Part 1Differential Braking
(2006)
Solmaz, Selim; Corless, Martin; Shorten, Robert N.
Abstract:
In this paper we apply recent results from robust control to the problem of rollover prevention in automotive vehicles. Specifically, we exploit the results of Pancake, Corless and Brockman, which provide controllers to robustly guarantee that the peak values of the performance outputs of an uncertain system do not exceed certain values. We introduce a new measure of performance for rollover prevention, the Load Transfer Ratio LTRd , and design differentialbraking based rollover controllers to keep the value of this quantity below a certain level; we also obtain controllers which yield robustness to variations in vehicle speed. We present numerical simulations to demonstrate the efficacy of our controllers.
http://mural.maynoothuniversity.ie/884/
Marked
Mark
A methodology for the design of robust rollover prevention controllers for automotive vehicles: Part 2Active steering
(2007)
Solmaz, Selim; Corless, Martin; Shorten, Robert N.
A methodology for the design of robust rollover prevention controllers for automotive vehicles: Part 2Active steering
(2007)
Solmaz, Selim; Corless, Martin; Shorten, Robert N.
Abstract:
In this paper we apply recent results from robust control to the problem of rollover prevention in automotive vehicles. Specifically, we exploit the results of Pancake, Corless and Brockman, which provide controllers to robustly guarantee that the peak magnitudes of the performance outputs of an uncertain system do not exceed certain values.We use the dynamic Load Transfer Ratio LTRd as a performance output for rollover prevention, and design activesteering based rollover controllers to keep the magnitude of this quantity below a certain level, while we use control input u as an additional performance output to limit the maximum amount of control effort. We present numerical simulations to demonstrate the efficacy of our controllers.
http://mural.maynoothuniversity.ie/887/
Marked
Mark
A minimum of two distinct heritable factors are required to explain correlation structures in proliferating lymphocytes.
(2010)
Markham, John F.; Wellard, Cameron J.; Hawkins, Edward D.; Duffy, Ken R.; Hodgkin, Phil...
A minimum of two distinct heritable factors are required to explain correlation structures in proliferating lymphocytes.
(2010)
Markham, John F.; Wellard, Cameron J.; Hawkins, Edward D.; Duffy, Ken R.; Hodgkin, Philip D.
Abstract:
During the adaptive immune response, lymphocyte populations undergo a characteristic three phase process: expansion through a series of cell divisions; cessation of expansion; and, finally, most of the accumulated lymphocytes die by apoptosis. The data used, thus far, to inform understanding of these processes, both in vitro and in vivo, is taken from flow cytometry experiments. One significant drawback of flow cytometry is that individual cells cannot be tracked, so that it is not possible to investigate interdependencies in the fate of cells within a family tree. This deficit in experimental information has recently been overcome by Hawkins et al. (2009) who report on time lapse microscopy experiments in which Bcells were stimulated through the TLR9 receptor. Cells stimulated in this way do not aggregate, so that data regarding family trees can be recorded. In this article we further investigate the Hawkins et al. (2009) data. Our conclusions are striking: in order to explain the...
http://mural.maynoothuniversity.ie/2158/
Displaying Results 1  25 of 456 on page 1 of 19
1
2
3
4
5
6
7
8
9
10
Bibtex
CSV
EndNote
RefWorks
RIS
XML
Item Type
Book chapter (59)
Conference item (69)
Doctoral thesis (20)
Journal article (265)
Master thesis (research) (11)
Report (32)
Peer Review Status
Peerreviewed (333)
Nonpeerreviewed (123)
Year
2015 (11)
2014 (22)
2013 (32)
2012 (24)
2011 (27)
2010 (40)
2009 (50)
2008 (55)
2007 (63)
2006 (49)
2005 (27)
2004 (9)
2003 (6)
2002 (9)
2001 (3)
2000 (7)
1999 (5)
1998 (5)
1997 (1)
1996 (3)
1995 (1)
1994 (1)
1991 (2)
1990 (2)
1987 (1)
1986 (1)
built by Enovation Solutions