Jan Długosz University

About: Jan Długosz University is a education organization based out in Częstochowa, Poland. It is known for research contribution in the topics: Crystal structure & Luminescence. The organization has 749 authors who have published 2311 publications receiving 19395 citations. The organization is also known as: Higher Teacher Education School.

Bimolecular relaxation kinetics observed in radiation-optical properties of Ge–As(Sb)–S glasses

Abstract: Numerical parameters of decaying bimolecular relaxation kinetics are analysed for radiation-optical properties of chalcogenide glasses within ternary stoichiometric As 2 S 3 –GeS 2 and Sb 2 S 3 –GeS 2 as well as non-stoichiometric As 2 S 3 –Ge 2 S 3 systems in dependence on their composition. It is shown, that the observed compositional dependences of bimolecular relaxation parameters have a monotonic character in the glasses of both stoichiometric systems, while the anomalous extremum-like behavior is observed in the vicinity of average coordination number close to 2.7 in non-stoichiometric glasses.

Cognitive telerehabilitation in neurological patients: systematic review and meta-analysis.

Abstract: Telerehabilitation (TR) seems to be an encouraging solution for the delivery of cognitive treatments in patients with neurological disorders. This study was aimed to analyze and synthesize the evidence on the efficacy of cognitive TR interventions in patients with neurological diseases, compared with conventional face-to-face rehabilitation. From a total of 4485 records, 9 studies met the inclusion criteria for qualitative analysis. At the end of the process, 7 studies remained for quantitative analysis. By comparing TR with face-to-face treatments for cognitive impairments, we assessed improvements in global cognitive domain (Mini Mental State Exam) (MD = -0.86; 95% CI -2.43, 0.72, I2 = 0%), in learning and memory domains (SMD = 0.26, 95% CI -0.22, 0.74, I2 = 24%), in verbal fluency (SMD = 0.08, 95% CI -0.47, 0.62, I2 = 0%), and in executive functions (i.e., problem-solving, central processing speed and working memory) (SMD = 0.38, 95% CI 0.06, 0.71, I2 = 0%). In all the included studies, improvement in the performance of the TR groups was comparable to that achieved through face-to-face intervention. Significant differences between those two modalities of providing treatments were observed for working memory and total executive function comparison, in favor of TR. The results of this study can sustain the efficacy of TR and its application for the treatment of neurological patients, especially when treated for executive function impairments.

Generic Dijkstra for optical networks

Abstract: We present the generic Dijkstra shortest-path algorithm: an efficient algorithm for finding a shortest path in an optical network, in both a wavelength-division multiplexed network and an elastic optical network (EON). The proposed algorithm is an enabler of real-time softwarized control of large-scale networks and is not limited to optical networks. The Dijkstra algorithm is a generalization of the breadth-first search, and we generalize the Dijkstra algorithm further to resolve the continuity and contiguity constraints of the frequency slot units required in EONs. Specifically, we generalize the notion of a label, change what we iterate with, and reformulate the edge relaxation so that vertices are revisited, loops avoided, and worse labels discarded. We also use the typical constriction during edge relaxation to take care of the signal modulation constraints. The algorithm can be used with various spectrum allocation policies. We motivate and discuss the algorithm design, and provide our free, reliable, and generic implementation using the Boost Graph Library. We carried out 85,000 simulation runs for realistic and random networks (Gabriel graphs) of 75 vertices with about a billion shortest-path searches, and found that the proposed algorithm outperforms considerably three other competing optimal algorithms that are frequently used.