| 1. |
|
|
| 2. |
|
|
| 3. |
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
|
|
| 10. |
|
|
| 11. |
- Elhai, M, et al.
(författare)
-
Outcomes of patients with systemic sclerosis treated with rituximab in contemporary practice: a prospective cohort study
- 2019
-
Ingår i: Annals of the rheumatic diseases. - : BMJ. - 1468-2060 .- 0003-4967. ; 78:7, s. 979-987
-
Tidskriftsartikel (refereegranskat)abstract
- To assess the safety and efficacy of rituximab in systemic sclerosis (SSc) in clinical practice.MethodsWe performed a prospective study including patients with SSc from the European Scleroderma Trials and Research (EUSTAR) network treated with rituximab and matched with untreated patients with SSc. The main outcomes measures were adverse events, skin fibrosis improvement, lung fibrosis worsening and steroids use among propensity score-matched patients treated or not with rituximab.Results254 patients were treated with rituximab, in 58% for lung and in 32% for skin involvement. After a median follow-up of 2 years, about 70% of the patients had no side effect. Comparison of treated patients with 9575 propensity-score matched patients showed that patients treated with rituximab were more likely to have skin fibrosis improvement (22.7 vs 14.03 events per 100 person-years; OR: 2.79 [1.47–5.32]; p=0.002). Treated patients did not have significantly different rates of decrease in forced vital capacity (FVC)>10% (OR: 1.03 [0.55–1.94]; p=0.93) nor in carbon monoxide diffusing capacity (DLCO) decrease. Patients having received rituximab were more prone to stop or decrease steroids (OR: 2.34 [1.56–3.53], p<0.0001). Patients treated concomitantly with mycophenolate mofetil had a trend for better outcomes as compared with patients receiving rituximab alone (delta FVC: 5.22 [0.83–9.62]; p=0.019 as compared with controls vs 3 [0.66–5.35]; p=0.012).ConclusionRituximab use was associated with a good safety profile in this large SSc-cohort. Significant change was observed on skin fibrosis, but not on lung. However, the limitation is the observational design. The potential stabilisation of lung fibrosis by rituximab has to be addressed by a randomised trial.
|
|
| 12. |
|
|
| 13. |
|
|
| 14. |
- Sloot, Frea, et al.
(författare)
-
Inventory of current EU paediatric vision and hearing screening programmes
- 2015
-
Ingår i: Journal of Medical Screening. - : SAGE Publications. - 0969-1413 .- 1475-5793. ; 22:2, s. 55-64
-
Tidskriftsartikel (refereegranskat)abstract
- Objective: To examine the diversity in paediatric vision and hearing screening programmes in Europe. Methods: Themes for comparison of screening programmes derived from literature were used to compile three questionnaires on vision, hearing, and public health screening. Tests used, professions involved, age, and frequency of testing seem to influence sensitivity, specificity, and costs most. Questionnaires were sent to ophthalmologists, orthoptists, otolaryngologists, and audiologists involved in paediatric screening in all EU full-member, candidate, and associate states. Answers were cross-checked. Results: Thirty-nine countries participated; 35 have a vision screening programme, 33 a nation-wide neonatal hearing screening programme. Visual acuity (VA) is measured in 35 countries, in 71% of these more than once. First measurement of VA varies from three to seven years of age, but is usually before age five. At age three and four, picture charts, including Lea Hyvarinen, are used most; in children over four, Tumbling-E and Snellen. As first hearing screening test, otoacoustic emission is used most in healthy neonates, and auditory brainstem response in premature newborns. The majority of hearing testing programmes are staged; children are referred after 1–4 abnormal tests. Vision screening is performed mostly by paediatricians, ophthalmologists, or nurses. Funding is mostly by health insurance or state. Coverage was reported as >95% in half of countries, but reporting was often not first-hand. Conclusion: Largest differences were found in VA charts used (12), professions involved in vision screening (10), number of hearing screening tests before referral (1–4), and funding sources (8).
|
|
| 15. |
|
|
| 16. |
- Ilic, N., et al.
(författare)
-
Adaptive sensor networks for consensus based distributed estimation
- 2012
-
Ingår i: Control Applications (CCA), 2012 IEEE International Conference on. - : IEEE. - 9781467345033 ; , s. 652-657
-
Konferensbidrag (refereegranskat)abstract
- In this paper consensus based algorithms for distributed estimation in sensor networks are discussed and a new algorithm with decentralized adaptation is proposed for solving the problem where the state of a monitored process is observed only by a relatively small percentage of the sensors at each iteration of the algorithm. The given analysis shows that adaptation of the gains in the consensus scheme is of crucial importance for getting simple yet efficient estimation algorithms. It is also shown that the exchange of an additional binary information between the nodes on whether or not a node has received the observation, along with the information on state estimates, is sufficient to obtain a robust and efficient tool for practice. Selected examples illustrate performance of the proposed algorithm in terms of the mean square estimation error and the disagreement between the nodes.
|
|
| 17. |
- Stankovic, M. S., et al.
(författare)
-
A Consensus-Based distributed calibration algorithm for sensor networks
- 2016
-
Ingår i: Serbian Journal of Electrical Engineering. - : University of Kragujevac, Faculty of Science. - 1451-4869. ; 13:1, s. 111-132
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper a novel distributed algorithm for blind macro-calibration in sensor networks based on consensus is proposed. The algorithm is formulated as a set of gradient-type recursions for estimating parameters of sensor calibration functions, starting from local criteria defined as weighted sums of mean square differences between the outputs of neighboring sensors. It is proved that the algorithm achieves asymptotic agreement for sensor gains and offsets in the mean square sense and with probability one. In the case of additive measurement noise, additive inter-agent communication noise and communication outages, a modification of the original algorithm is proposed. It is proved using stochastic approximation arguments that the modified algorithm achieves asymptotic consensus for sensor gains and offsets in the mean square sense and with probability one. Special attention is paid to the situation when one sensor is selected as a reference. Illustrative simulation examples are provided.
|
|
| 18. |
- Stanković, Milos S., et al.
(författare)
-
Consensus based multi-agent control algorithms
- 2010
-
Ingår i: Efficient Modeling and Control of Large-Scale Systems. - Boston, MA : Springer. - 9781441957566 ; , s. 197-218
-
Bokkapitel (refereegranskat)abstract
- Control of complex systems can be achieved via hierarchical multilayered agentbased structures benefiting from their inherent properties such as modularity, scalability, adaptability, flexibility and robustness. The agent-based structures consist of a number of simpler subsystems (or agents), each of which addresses in a coordinated manner a specific sub-objective or sub-task so as to attain the overall design objectives. The complexity of the behavior of such systems arises as a result of interactions between multiple agents and the environment in which they operate. More specifically, multi-agent control systems are fundamental parts of a wide range of safety-critical engineering systems, and are commonly found in aerospace, traffic control, chemical processes, power generation and distribution, flexible manufacturing, robotic system design and self-assembly structures. A multi-agent system can be considered as a loosely coupled network of problem-solver entities that work together to find answers to problems that are beyond the individual capabilities or knowledge of each entity, where local control law has to satisfy decentralized information structure constraints (see, e.g., [20]), and where no global system control (or supervision) is desired.
|
|
| 19. |
- Stankovic, M.S, et al.
(författare)
-
Distributed Blind Calibration in Lossy Sensor Networks via Output Synchronization
- 2015
-
Ingår i: IEEE Transactions on Automatic Control. - : IEEE Press. - 0018-9286 .- 1558-2523. ; 60:12, s. 3257-3262
-
Tidskriftsartikel (refereegranskat)abstract
- A novel distributed algorithm for blind macrocalibration of large sensor networks is introduced. The algorithm is in the form of a system of gradient-type recursions for estimating parameters of local sensor calibration functions. The method does not require any fusion center. The convergence analysis is based on diagonal dominance of the dynamical systems with block matrices. It is proved that the asymptotic consensus is achieved for all the equivalent sensor gains and offsets (in the mean square sense and with probability one) in lossy sensor networks with possible communication outages and additive communication noise. An illustrative simulation example is provided.
|
|
| 20. |
- Stanković, M. S., et al.
(författare)
-
Distributed drift estimation for time synchronization in lossy networks
- 2016
-
Ingår i: 24th Mediterranean Conference on Control and Automation, MED 2016. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781467383455 ; , s. 779-784
-
Konferensbidrag (refereegranskat)abstract
- Two distributed asynchronous drift estimation algorithms for time synchronization in networks with random communication delays and measurement noise are proposed. The algorithms are superior to similar existing methods. Convergence of the algorithms to consensus in the mean square sense and w.p.1 is proved. Rate of convergence of the algorithms is analyzed. It is also shown that the algorithms can be applied as flooding algorithms, with one reference node. Illustrative simulation results are also given.
|
|
| 21. |
- Stankovic, Milos S., et al.
(författare)
-
Distributed macro calibration in sensor networks
- 2012
-
Ingår i: 2012 20th Mediterranean Conference on Control and Automation, MED 2012 - Conference Proceedings. - : IEEE. - 9781467325318 ; , s. 1049-1054
-
Konferensbidrag (refereegranskat)abstract
- In this paper a novel consensus-based distributed algorithm for blind macro-calibration in sensor networks is proposed. It is proved, on the basis of an originally developed methodology for treating higher order consensus schemes, that the algorithm achieves asymptotic agreement for sensor gains and offsets in the mean square sense and with probability one. In the case of a given reference, all sensors are asymptotically calibrated. Simulation results illustrate properties of the algorithm.
|
|
| 22. |
- Stankovic, M. S., et al.
(författare)
-
Distributed Offset Correction for Time Synchronization in Networks with Random Delays
- 2018
-
Ingår i: 2018 European Control Conference, ECC 2018. - : Institute of Electrical and Electronics Engineers Inc.. - 9783952426982 ; , s. 2212-2217
-
Konferensbidrag (refereegranskat)abstract
- A new distributed asynchronous offset correction algorithm for time synchronization in networks with random communication delays, communication dropouts, and measurement noise is proposed. The algorithm is based on a specially constructed error function which includes delay compensation and unboundedly-increasing-time compensation parameters. Convergence of the algorithm in the mean square sense and w.p.l is proved. A modification of the algorithm based on consensus on the delay compensation parameter is also proposed, offering better performance in practice. Illustrative simulation results are presented.
|
|
| 23. |
- Stanković, M. S., et al.
(författare)
-
Distributed time synchronization for networks with random delays and measurement noise
- 2018
-
Ingår i: Automatica. - : Elsevier. - 0005-1098 .- 1873-2836. ; 93, s. 126-137
-
Tidskriftsartikel (refereegranskat)abstract
- In this paper a new distributed asynchronous algorithm is proposed for time synchronization in networks with random communication delays, measurement noise and communication dropouts. Three different types of the drift correction algorithm are introduced, based on different kinds of local time increments. Under nonrestrictive conditions concerning network properties, it is proved that all the algorithm types provide convergence in the mean square sense and with probability one (w.p.1) of the corrected drifts of all the nodes to the same value (consensus). An estimate of the convergence rate of these algorithms is derived. For offset correction, a new algorithm is proposed containing a compensation parameter coping with the influence of random delays and special terms taking care of the influence of both linearly increasing time and drift correction. It is proved that the corrected offsets of all the nodes converge in the mean square sense and w.p.1. An efficient offset correction algorithm based on consensus on local compensation parameters is also proposed. It is shown that the overall time synchronization algorithm can also be implemented as a flooding algorithm with one reference node. It is proved that it is possible to achieve bounded error between local corrected clocks in the mean square sense and w.p.1. Simulation results provide an additional practical insight into the algorithm properties and show its advantage over the existing methods.
|
|
| 24. |
- Stanković, S. S., et al.
(författare)
-
Distributed change detection based on a randomized consensus algorithm
- 2010
-
Ingår i: Proceedings of Papers - 5th European Conference on Circuits and Systems for Communications, ECCSC'10. - 9788674663943 ; , s. 51-54
-
Konferensbidrag (refereegranskat)abstract
- In this paper a novel consensus based distributed recursive algorithm is proposed for real time change detection using sensor networks. The algorithm is based on local statistics generated by geometric moving average control charts, and does not require any fusion center, so that the state of any node can be tested w.r.t. a given common threshold. Convergence of the algorithm to the optimal centralized solution defined by a weighted sum of the results of local signal processing is analyzed in the case of time varying random consensus gains, encompassing asymmetric "gossip" schemes and lossy networks, assuming correlated data and different local values of the parameter changes. Simulation results illustrate characteristic properties of the algorithms.
|
|
| 25. |
- Ilic, Nemanja, et al.
(författare)
-
Adaptive Consensus-Based Distributed Target Tracking in Sensor Networks With Limited Sensing Range
- 2014
-
Ingår i: IEEE Transactions on Control Systems Technology. - 1063-6536 .- 1558-0865. ; 22:2, s. 778-785
-
Tidskriftsartikel (refereegranskat)abstract
- In this brief, consensus-based algorithms for distributed target tracking are discussed, and a new algorithm with decentralized adaptation is proposed for sensor networks with limited sensing range. The given comparative analysis shows that tuning of the gains in the consensus scheme is of crucial importance for getting simple, yet efficient tracking algorithms, requiring the exchange of only local state estimates between the nodes. The proposed algorithm, which gives higher importance to the nodes currently receiving measurements, is based on the exchange of additional binary information and represents a robust and efficient tool for practice. Stability of the algorithm is theoretically discussed on a given scenario. Selected examples illustrate its performance in terms of the estimation error and the disagreement between the nodes.
|
|
