| 1. |
- Aamodt, K., et al.
(författare)
-
Alignment of the ALICE Inner Tracking System with cosmic-ray tracks
- 2010
-
Ingår i: Journal of Instrumentation. - 1748-0221. ; 5
-
Konferensbidrag (refereegranskat)abstract
- ALICE (A Large Ion Collider Experiment) is the LHC (Large Hadron Collider) experiment devoted to investigating the strongly interacting matter created in nucleus-nucleus collisions at the LHC energies. The ALICE ITS, Inner Tracking System, consists of six cylindrical layers of silicon detectors with three different technologies; in the outward direction: two layers of pixel detectors, two layers each of drift, and strip detectors. The number of parameters to be determined in the spatial alignment of the 2198 sensor modules of the ITS is about 13,000. The target alignment precision is well below 10 mu m in some cases (pixels). The sources of alignment information include survey measurements, and the reconstructed tracks from cosmic rays and from proton-proton collisions. The main track-based alignment method uses the Millepede global approach. An iterative local method was developed and used as well. We present the results obtained for the ITS alignment using about 10(5) charged tracks from cosmic rays that have been collected during summer 2008, with the ALICE solenoidal magnet switched off.
|
|
| 2. |
- Reifarth, R., et al.
(författare)
-
Nuclear astrophysics with radioactive ions at FAIR
- 2016
-
Ingår i: Journal of Physics: Conference Series. - : IOP Publishing. - 1742-6588 .- 1742-6596. ; 665:1
-
Konferensbidrag (refereegranskat)abstract
- The nucleosynthesis of elements beyond iron is dominated by neutron captures in the s and r processes. However, 32 stable, proton-rich isotopes cannot be formed during those processes, because they are shielded from the s-process flow and r-process beta-decay chains. These nuclei are attributed to the p and rp process. For all those processes, current research in nuclear astrophysics addresses the need for more precise reaction data involving radioactive isotopes. Depending on the particular reaction, direct or inverse kinematics, forward or time-reversed direction are investigated to determine or at least to constrain the desired reaction cross sections. The Facility for Antiproton and Ion Research (FAIR) will offer unique, unprecedented opportunities to investigate many of the important reactions. The high yield of radioactive isotopes, even far away from the valley of stability, allows the investigation of isotopes involved in processes as exotic as the r or rp processes.
|
|
| 3. |
- Tommasini, R., et al.
(författare)
-
Accepted Tutorials at The Web Conference 2022
- 2022
-
Ingår i: WWW 2022 - Companion Proceedings of the Web Conference 2022. - New York, NY, USA : Association for Computing Machinery (ACM). ; , s. 391-399
-
Konferensbidrag (refereegranskat)abstract
- This paper summarizes the content of the 20 tutorials that have been given at The Web Conference 2022: 85% of these tutorials are lecture style, and 15% of these are hands on.
|
|
| 4. |
- Onabolu, B., et al.
(författare)
-
Integrating policy, system strengthening, research and harmonized services delivery for scaling up drinking water safety in Bangladesh
- 2018
-
Ingår i: Environmental Arsenic in a ChangingWorld - 7th International Congress and Exhibition Arsenic in the Environment, 2018. - London : CRC Press/Balkema. - 9781138486096 ; , s. 535-537
-
Konferensbidrag (refereegranskat)abstract
- The WASH Sector Development Plan (2011–2025) recognizes the absence of harmonized approaches as the root challenge to scaling up drinking water safety in Bangladesh. UNICEF is supporting the Government of Bangladesh (GoB) through the Department of Public Health Engineering (DPHE) and Policy Support Branch to re-engineer its approach to drinking water safety by integrating policy, systems strengthening & sustainable services delivery at national and sub-national levels. Some of the key contributions to the sector include the implementation of the UNICEF-DPHE Arsenic Safe Union model with the declaration of 106 Arsenic Safe Villages, reduction in arsenic contamination rates of new tubewells, a system for preventing elite capture of water points, and the adoption of the ASU model in a $240 million arsenic mitigation drinking water project using domestic resources. Relatedly, a Policy Support Branch has been established, the sector coordination mechanisms revised, WASH bottleneck analysis is ongoing & the National Implementation Plan on Arsenic has been reviewed: Next steps include the professionalisation of drilling by local drillers through a partnership with KTH, Sweden, the GoB and UNICEF.
|
|
| 5. |
|
|
| 6. |
- Chattopadhyay, A., et al.
(författare)
-
Impromptu deployment of wireless relay networks : Experiences along a forest trail
- 2015
-
Ingår i: Proceedings - 11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, MASS 2014. - 9781479960354 ; , s. 232-236
-
Konferensbidrag (refereegranskat)abstract
- We are motivated by the problem of impromptu or as-you-go deployment of wireless sensor networks. As an application example, a person, starting from a sink node, walks along a forest trail, makes link quality measurements (with the previously placed nodes) at equally spaced locations, and deploys relays at some of these locations, so as to connect a sensor placed at some a priori unknown point on the trail with the sink node. In this paper, we report our experimental experiences with some as-you-go deployment algorithms. Two algorithms are based on Markov decision process (MDP) formulations, these require a radio propagation model. We also study purely measurement based strategies: one heuristic that is motivated by our MDP formulations, one asymptotically optimal learning algorithm, and one inspired by a popular heuristic. We extract a statistical model of the propagation along a forest trail from raw measurement data, implement the algorithms experimentally in the forest, and compare them. The results provide useful insights regarding the choice of the deployment algorithm and its parameters, and also demonstrate the necessity of a proper theoretical formulation.
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
- Casamitjana, Adrià, et al.
(författare)
-
Bayesian learning for time-varying linear prediction of speech
- 2015
-
Ingår i: 2015 23rd European Signal Processing Conference, EUSIPCO 2015. - : Institute of Electrical and Electronics Engineers (IEEE). - 9780992862633 ; , s. 325-329
-
Konferensbidrag (refereegranskat)abstract
- We develop Bayesian learning algorithms for estimation of time-varying linear prediction (TVLP) coefficients of speech. Estimation of TVLP coefficients is a naturally underdeter-mined problem. We consider sparsity and subspace based approaches for dealing with the corresponding underde-termined system. Bayesian learning algorithms are developed to achieve better estimation performance. Expectation-maximization (EM) framework is employed to develop the Bayesian learning algorithms where we use a combined prior to model a driving noise (glottal signal) that has both sparse and dense statistical properties. The efficiency of the Bayesian learning algorithms is shown for synthetic signals using spectral distortion measure and formant tracking of real speech signals.
|
|
| 10. |
- Ghosh, A. K., et al.
(författare)
-
Sender side intelligence for TCP throughput enhancement in wired-cum-wireless network
- 2007
-
Ingår i: 2007 IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications. - 1424411440 - 9781424411443 ; , s. 4394381-
-
Konferensbidrag (refereegranskat)abstract
- Performance of the TCP Congestion Control Algorithm has been the focus of research over the last decade. In this paper we propose modifications to TCP Congestion Control to improve its performance in wired-cum-wireless networks The key idea to determine the Optimal Congestion Window for a TCP Sender, in a particular network scenario (that corresponds to the fair share of that connection) and keep this congestion window a constant to a point where the fair share in the network has changed considerably from the instance of the calculation of the size of the last window. At this point, the TCP Congestion Window is recalculated according to the nature of new scenario. The proposed mechanism is particularly effective over wireless links, which have an inherently loss-prone nature, as Modified TCP's congestion window being independent of packet losses (be it corruption losses or it congestion losses), keeps transmitting at the same rate at before.
|
|
