| 1. |
- Abgrall, N., et al.
(författare)
-
The large enriched germanium experiment for neutrinoless double beta decay (LEGEND)
- 2017
-
Ingår i: AIP Conference Proceedings. - : Author(s). - 1551-7616 .- 0094-243X. ; 1894
-
Konferensbidrag (refereegranskat)abstract
- The observation of neutrinoless double-beta decay (0νββ) would show that lepton number is violated, reveal that neu-trinos are Majorana particles, and provide information on neutrino mass. A discovery-capable experiment covering the inverted ordering region, with effective Majorana neutrino masses of 15 - 50 meV, will require a tonne-scale experiment with excellent energy resolution and extremely low backgrounds, at the level of ∼0.1 count /(FWHM·t·yr) in the region of the signal. The current generation 76Ge experiments GERDA and the Majorana Demonstrator, utilizing high purity Germanium detectors with an intrinsic energy resolution of 0.12%, have achieved the lowest backgrounds by over an order of magnitude in the 0νββ signal region of all 0νββ experiments. Building on this success, the LEGEND collaboration has been formed to pursue a tonne-scale 76Ge experiment. The collaboration aims to develop a phased 0νββ experimental program with discovery potential at a half-life approaching or at 1028 years, using existing resources as appropriate to expedite physics results.
|
|
| 2. |
|
|
| 3. |
- Adaldo, Antonio, et al.
(författare)
-
Cooperative coverage for surveillance of 3D structures
- 2017
-
Ingår i: IEEE International Conference on Intelligent Robots and Systems. - Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE). - 9781538626825 ; , s. 1838-1845
-
Konferensbidrag (refereegranskat)abstract
- In this article, we propose a planning algorithm for coverage of complex structures with a network of robotic sensing agents, with multi-robot surveillance missions as our main motivating application. The sensors are deployed to monitor the external surface of a 3D structure. The algorithm controls the motion of each sensor so that a measure of the collective coverage attained by the network is nondecreasing, while the sensors converge to an equilibrium configuration. A modified version of the algorithm is also provided to introduce collision avoidance properties. The effectiveness of the algorithm is demonstrated in a simulation and validated experimentally by executing the planned paths on an aerial robot.
|
|
| 4. |
- Adaldo, Antonio, et al.
(författare)
-
Coordination of multi-agent systems with intermittent access to a cloud repository
- 2017
-
Ingår i: Workshop on Sensing and Control for Autonomous Vehicles. - Cham : Springer. - 9783319553719 ; , s. 453-471
-
Konferensbidrag (refereegranskat)abstract
- A cloud-supported multi-agent system is composed of autonomous agents required to achieve a common coordination objective by exchanging data over a shared cloud repository. The repository is accessed asychronously by different agents, and direct inter-agent commuication is not possible. This model is motivated by the problem of coordinating a fleet of autonomous underwater vehicles, with the aim to avoid the use of expensive and power-hungry modems for underwater communication. For the case of agents with integrator dynamics, a control law and a rule for scheduling the cloud access are formally defined and proven to achieve the desired coordination. A numerical simulation corroborate the theoretical results.
|
|
| 5. |
- Agmell, Mathias, et al.
(författare)
-
The Influence the Uncut Chip Thickness has on the Stagnation Point in Orthogonal Cutting
- 2017
-
Ingår i: 16th CIRP Conference on Modelling of Machining Operations (16th CIRP CMMO). - : Elsevier BV. - 2212-8271. - 9781510842762 ; 58, s. 13-18
-
Konferensbidrag (refereegranskat)abstract
- The effect of cutting data on the stagnation zone of a machining operation is of great interest since it governs the material flow around the cutting edge. The material flow has a significant influence on the mechanical properties of the machined surface. This paper presents a numerical model that is able to determine the effect that the uncut chip thickness has on the stagnation zone and the connection between the stagnation zone and the deformation layer in the machined subsurface.
|
|
| 6. |
|
|
| 7. |
- Boccia, Antonio, et al.
(författare)
-
Tracking a mobile target by multi-robot circumnavigation using bearing measurements
- 2017
-
Ingår i: 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017. - : IEEE. - 9781509028733 ; , s. 1076-1081
-
Konferensbidrag (refereegranskat)abstract
- In this paper, we study a problem of target tracking and circumnavigation with a network of autonomous agents. We propose a distributed algorithm to estimate the position of the target and drive the agents to rotate around it while forming a regular polygon and keeping a desired distance. We formally show that the algorithm attains exponential convergence of the agents to the desired polygon if the target is stationary, and bounded convergence if the target is moving with bounded speed. Numerical simulations corroborate the theoretical results and demonstrate the resilience of the network to addition and removal of agents.
|
|
| 8. |
|
|
| 9. |
- Hayward, N, et al.
(författare)
-
Novel high risk genes of melanoma
- 2017
-
Ingår i: JOURNAL OF THE EUROPEAN ACADEMY OF DERMATOLOGY AND VENEREOLOGY. - 0926-9959. ; 31, s. 9-9
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)
|
|
| 10. |
- Mai, Vien V., et al.
(författare)
-
Lock-Free Incremental Coordinate Descent
- 2017
-
Ingår i: 2017 IEEE 56th Annual Conference on Decision and Control, CDC 2017. - : Institute of Electrical and Electronics Engineers (IEEE). - 9781509028733
-
Konferensbidrag (refereegranskat)abstract
- We study a flexible algorithm for minimizing a sum of component functions, each of which depends on a large number of decision variables. The algorithm combines aspects of incremental gradient method with that of coordinate descent. In contrast to earlier algorithms of this kind, our algorithm is lock-free and does not require synchronization of access to the shared memory. We prove convergence of the algorithm under asynchronous operation and provide explicit bounds on how the solution times depend on the degree of asynchrony. Numerical experiments confirm our theoretical results.
|
|
