456,466 research outputs found
Muon and Cosmogenic Neutron Detection in Borexino
Borexino, a liquid scintillator detector at LNGS, is designed for the
detection of neutrinos and antineutrinos from the Sun, supernovae, nuclear
reactors, and the Earth. The feeble nature of these signals requires a strong
suppression of backgrounds below a few MeV. Very low intrinsic radiogenic
contamination of all detector components needs to be accompanied by the
efficient identification of muons and of muon-induced backgrounds. Muons
produce unstable nuclei by spallation processes along their trajectory through
the detector whose decays can mimic the expected signals; for isotopes with
half-lives longer than a few seconds, the dead time induced by a muon-related
veto becomes unacceptably long, unless its application can be restricted to a
sub-volume along the muon track. Consequently, not only the identification of
muons with very high efficiency but also a precise reconstruction of their
tracks is of primary importance for the physics program of the experiment. The
Borexino inner detector is surrounded by an outer water-Cherenkov detector that
plays a fundamental role in accomplishing this task. The detector design
principles and their implementation are described. The strategies adopted to
identify muons are reviewed and their efficiency is evaluated. The overall muon
veto efficiency is found to be 99.992% or better. Ad-hoc track reconstruction
algorithms developed are presented. Their performance is tested against muon
events of known direction such as those from the CNGS neutrino beam, test
tracks available from a dedicated External Muon Tracker and cosmic muons whose
angular distribution reflects the local overburden profile. The achieved
angular resolution is 3-5 deg and the lateral resolution is 35-50 cm, depending
on the impact parameter of the crossing muon. The methods implemented to
efficiently tag cosmogenic neutrons are also presented.Comment: 42 pages. 32 figures on 37 files. Uses JINST.cls. 1 auxiliary file
(defines.tex) with TEX macros. submitted to Journal of Instrumentatio
Muon and Cosmogenic Neutron Detection in Borexino
Borexino, a liquid scintillator detector at LNGS, is designed for the
detection of neutrinos and antineutrinos from the Sun, supernovae, nuclear
reactors, and the Earth. The feeble nature of these signals requires a strong
suppression of backgrounds below a few MeV. Very low intrinsic radiogenic
contamination of all detector components needs to be accompanied by the
efficient identification of muons and of muon-induced backgrounds. Muons
produce unstable nuclei by spallation processes along their trajectory through
the detector whose decays can mimic the expected signals; for isotopes with
half-lives longer than a few seconds, the dead time induced by a muon-related
veto becomes unacceptably long, unless its application can be restricted to a
sub-volume along the muon track. Consequently, not only the identification of
muons with very high efficiency but also a precise reconstruction of their
tracks is of primary importance for the physics program of the experiment. The
Borexino inner detector is surrounded by an outer water-Cherenkov detector that
plays a fundamental role in accomplishing this task. The detector design
principles and their implementation are described. The strategies adopted to
identify muons are reviewed and their efficiency is evaluated. The overall muon
veto efficiency is found to be 99.992% or better. Ad-hoc track reconstruction
algorithms developed are presented. Their performance is tested against muon
events of known direction such as those from the CNGS neutrino beam, test
tracks available from a dedicated External Muon Tracker and cosmic muons whose
angular distribution reflects the local overburden profile. The achieved
angular resolution is 3-5 deg and the lateral resolution is 35-50 cm, depending
on the impact parameter of the crossing muon. The methods implemented to
efficiently tag cosmogenic neutrons are also presented.Comment: 42 pages. 32 figures on 37 files. Uses JINST.cls. 1 auxiliary file
(defines.tex) with TEX macros. submitted to Journal of Instrumentatio
Muon and Cosmogenic Neutron Detection in Borexino
Borexino, a liquid scintillator detector at LNGS, is designed for the
detection of neutrinos and antineutrinos from the Sun, supernovae, nuclear
reactors, and the Earth. The feeble nature of these signals requires a strong
suppression of backgrounds below a few MeV. Very low intrinsic radiogenic
contamination of all detector components needs to be accompanied by the
efficient identification of muons and of muon-induced backgrounds. Muons
produce unstable nuclei by spallation processes along their trajectory through
the detector whose decays can mimic the expected signals; for isotopes with
half-lives longer than a few seconds, the dead time induced by a muon-related
veto becomes unacceptably long, unless its application can be restricted to a
sub-volume along the muon track. Consequently, not only the identification of
muons with very high efficiency but also a precise reconstruction of their
tracks is of primary importance for the physics program of the experiment. The
Borexino inner detector is surrounded by an outer water-Cherenkov detector that
plays a fundamental role in accomplishing this task. The detector design
principles and their implementation are described. The strategies adopted to
identify muons are reviewed and their efficiency is evaluated. The overall muon
veto efficiency is found to be 99.992% or better. Ad-hoc track reconstruction
algorithms developed are presented. Their performance is tested against muon
events of known direction such as those from the CNGS neutrino beam, test
tracks available from a dedicated External Muon Tracker and cosmic muons whose
angular distribution reflects the local overburden profile. The achieved
angular resolution is 3-5 deg and the lateral resolution is 35-50 cm, depending
on the impact parameter of the crossing muon. The methods implemented to
efficiently tag cosmogenic neutrons are also presented.Comment: 42 pages. 32 figures on 37 files. Uses JINST.cls. 1 auxiliary file
(defines.tex) with TEX macros. submitted to Journal of Instrumentatio
Genetic algorithms for the scheduling in additive manufacturing
[EN] Genetic Algorithms (GAs) are introduced to tackle the packing problem. The scheduling in Additive Manufacturing (AM) is also dealt with to set up a managed market, called “Lonja3D”. This will enable to determine an alternative tool through the combinatorial auctions, wherein the customers will be able to purchase the products at the best prices from the manufacturers. Moreover, the manufacturers will be able to optimize the production capacity and to decrease the operating costs in each case.This research has been partially financed by the project: “Lonja de Impresión 3D para la Industria
4.0 y la Empresa Digital (LONJA3D)” funded by the Regional Government of Castile and Leon and
the European Regional Development Fund (ERDF, FEDER) with grant VA049P17Castillo-Rivera, S.; De Antón, J.; Del Olmo, R.; Pajares, J.; López-Paredes, A. (2020). Genetic algorithms for the scheduling in additive manufacturing. International Journal of Production Management and Engineering. 8(2):59-63. https://doi.org/10.4995/ijpme.2020.12173OJS596382Ahsan, A., Habib, A., Khoda, B. (2015). Resource based process planning for additive manufacturing. Computer-Aided Design, 69, 112-125. https://doi.org/10.1016/j.cad.2015.03.006Araújo, L., Özcan, E., Atkin, J., Baumers, M., Tuck, C., Hague, R. (2015). Toward better build volume packing in additive manufacturing: classification of existing problems and benchmarks. 26th Annual International Solid Freeform Fabrication Symposium - an Additive Manufacturing Conference, 401-410.Berman, B. (2012). 3-D printing: The new industrial revolution. Business Horizons, 55: 155-162. https://doi.org/10.1016/j.bushor.2011.11.003Canellidis, V., Dedoussis, V., Mantzouratos, N., Sofianopoulou, S. (2006). Preprocessing methodology for optimizing stereolithography apparatus build performance. Computers in Industry, 57, 424-436. https://doi.org/10.1016/j.compind.2006.02.004Chergui, A., Hadj-Hamoub, K., Vignata, F. (2018). Production scheduling and nesting in additive manufacturing. Computers & Industrial Engineering, 126, 292-301. https://doi.org/10.1016/j.cie.2018.09.048Demirel, E., Özelkan, E.C., Lim, C. (2018). Aggregate planning with flexibility requirements profile. International Journal of Production Economics, 202, 45-58. https://doi.org/10.1016/j.ijpe.2018.05.001Fera, M., Fruggiero, F., Lambiase, A., Macchiaroli, R., Todisco, V. (2018). A modified genetic algorithm for time and cost optimization of an additive manufacturing single-machine scheduling. International Journal of Industrial Engineering Computations, 9, 423-438. https://doi.org/10.5267/j.ijiec.2018.1.001Hopper, E., Turton, B. (1997). Application of genetic algorithms to packing problems - A Review. Proceedings of the 2nd Online World Conference on Soft Computing in Engineering Design and Manufacturing, Springer Verlag, London, 279-288. https://doi.org/10.1007/978-1-4471-0427-8_30Ikonen, I., Biles, W.E., Kumar, A., Wissel, J.C., Ragade, R.K. (1997). A genetic algorithm for packing three-dimensional non-convex objects having cavities and holes. ICGA, 591-598.Kim, K.H., Egbelu, P.J. (1999). Scheduling in a production environment with multiple process plans per job. International Journal of Production Research, 37, 2725-2753. https://doi.org/10.1080/002075499190491Lawrynowicz, A. (2011). Genetic algorithms for solving scheduling problems in manufacturing systems. Foundations of Management, 3(2), 7-26. https://doi.org/10.2478/v10238-012-0039-2Li, Q., Kucukkoc, I., Zhang, D. (2017). Production planning in additive manufacturing and 3D printing. Computers and Operations Research, 83, 157-172. https://doi.org/10.1016/j.cor.2017.01.013Milošević, M., Lukić, D., Đurđev, M., Vukman, J., Antić, A. (2016). Genetic Algorithms in Integrated Process Planning and Scheduling-A State of The Art Review. Proceedings in Manufacturing Systems, 11(2), 83-88.Pour, M.A., Zanardini, M., Bacchetti, A., Zanoni, S. (2016). Additive manufacturing impacts on productions and logistics systems. IFAC, 49(12), 1679-1684. https://doi.org/10.1016/j.ifacol.2016.07.822Wilhelm, W.E., Shin, H.M. (1985). Effectiveness of Alternate Operations in a Flexible Manufacturing System. International Journal of Production Research, 23(1), 65-79. https://doi.org/10.1080/00207548508904691Xirouchakis, P., Kiritsis, D., Persson, J.G. (1998). A Petri net Technique for Process Planning Cost Estimation. Annals of the CIRP, 47(1), 427-430. https://doi.org/10.1016/S0007-8506(07)62867-4Zhang, Y., Bernard, A., Gupta, R.K., Harik, R. (2014). Evaluating the design for additive manufacturing: a process planning perspective. Procedia CIRP, 21, 144-150. https://doi.org/10.1016/j.procir.2014.03.17
Route Planning in Transportation Networks
We survey recent advances in algorithms for route planning in transportation
networks. For road networks, we show that one can compute driving directions in
milliseconds or less even at continental scale. A variety of techniques provide
different trade-offs between preprocessing effort, space requirements, and
query time. Some algorithms can answer queries in a fraction of a microsecond,
while others can deal efficiently with real-time traffic. Journey planning on
public transportation systems, although conceptually similar, is a
significantly harder problem due to its inherent time-dependent and
multicriteria nature. Although exact algorithms are fast enough for interactive
queries on metropolitan transit systems, dealing with continent-sized instances
requires simplifications or heavy preprocessing. The multimodal route planning
problem, which seeks journeys combining schedule-based transportation (buses,
trains) with unrestricted modes (walking, driving), is even harder, relying on
approximate solutions even for metropolitan inputs.Comment: This is an updated version of the technical report MSR-TR-2014-4,
previously published by Microsoft Research. This work was mostly done while
the authors Daniel Delling, Andrew Goldberg, and Renato F. Werneck were at
Microsoft Research Silicon Valle
Benchmarks for Parity Games (extended version)
We propose a benchmark suite for parity games that includes all benchmarks
that have been used in the literature, and make it available online. We give an
overview of the parity games, including a description of how they have been
generated. We also describe structural properties of parity games, and using
these properties we show that our benchmarks are representative. With this work
we provide a starting point for further experimentation with parity games.Comment: The corresponding tool and benchmarks are available from
https://github.com/jkeiren/paritygame-generator. This is an extended version
of the paper that has been accepted for FSEN 201
A novel object tracking algorithm based on compressed sensing and entropy of information
Acknowledgments This research is supported by (1) the Ph.D. Programs Foundation of Ministry of Education of China under Grant no. 20120061110045, (2) the Science and Technology Development Projects of Jilin Province of China under Grant no. 20150204007G X, and (3) the Key Laboratory for Symbol Computation and Knowledge Engineering of the National Education Ministry of China.Peer reviewedPublisher PD
- …