Search

Recent advances in non-volatile main memory (NVM) technology have spurred research on algorithms that are resilient to intermittent failures that cause processes to crash and subsequently restart. In this paper we present a Recoverable Mutual Exclusion (RME) algorithm that supports abortability. Our algorithm guarantees FCFS and a strong liveness property: processes do not starve even in runs consisting of infinitely many crashes, provided that a process crashes at most a finite number of times in each of its attempts. On DSM and Relaxed-CC multiprocessors, a process incurs O (min (k , log n)) RMRs in a passage and O (f + min (k , log n)) RMRs in an attempt, where n is the number of processes that the algorithm is designed for, k is the point contention of the passage or the attempt, and f is the number of times that p crashes during the attempt. On a Strict CC multiprocessor, the passage and attempt complexities are O(n) and O (f + n) , respectively. Our algorithm uses only the read, write, and CAS operations, which are commonly supported by multiprocessors. Attiya, Hendler, and Woelfel proved that, with any mutual exclusion algorithm, a process incurs at least Ω (log n) RMRs in a passage, if the algorithm uses only the read, write, and CAS operations (in: Proc. of the Fortieth ACM Symposium on Theory of Computing, New York, NY, USA, 2008). This lower bound implies that the worst-case RMR complexity of our algorithm is optimal for the DSM and Relaxed CC multiprocessors. This paper is an expanded version of our conference paper as reported by Jayanti and Joshi (in: Atig and Schwarzmann (eds) Networked Systems. Springer International Publishing, Cham, 2019), which presented the first Recoverable Mutual Exclusion (RME) algorithm that supports abortability. This algorithm from our conference paper (in: Atig and Schwarzmann (eds) Networked Systems. Springer International Publishing, Cham, 2019) admits starvation when there are infinitely many aborts in a run. In this paper, we fix this shortcoming and prove the algorithm's properties by identifying an inductive invariant. [ABSTRACT FROM AUTHOR]

Science, Museums and Collecting the Indigenous Dead in Colonial Australia: By Paul Turnbull. The book's structure is chronological but has a focus on what Turnbull calls "the long nineteenth century" (14) when the collection of Indigenous remains was guided by often changing theoretical and intellectual interests. According to Turnbull, these activities resulted in the remains of approximately 6,000 Indigenous Australians being collected and sent to scientific institutions, first overseas and then to domestic museums. [Extracted from the article]

In this paper, we obtain the exact controllability for a refined stochastic wave equation with three controls by establishing a novel Carleman estimate for a backward hyperbolic-like operator. Compared with the known result [Q. L\"u and X Zhang, Mathematical Control Theory for Stochastic Partial Differential Equations, Springer, Cham, Switzerland, 2021], the novelty of this paper is twofold: (1) Our model contains the effects in the drift terms when we put controls directly in the diffusion terms, which is more sensible for practical applications; (2) We provide an explicit description of the waiting time which is sharp in the case of dimension one and is independent of the coefficents of lower terms. [ABSTRACT FROM AUTHOR]

Nowadays, computing on encrypted data seems to be more practical than a few years ago, thanks to the emergence of new Homomorphic Encryption schemes. In this paper, an algorithm based on Homomorphic Encryption for Arithmetic of Approximate Numbers (Cheon et al., in: Takagi, Peyrin (eds) Advances in cryptology—ASIACRYPT 2017, Springer, Cham, pp 409–437, 2017) (HEAAN, or also CKKS) scheme, that is able to perform a secure k-means algorithm which processes encrypted data, has been studied and presented. The performance of the classifier running on encrypted data has been evaluated using a standard k-means algorithm that works on plain data as a supervised structure, since the results are obtained by approximated computations. The main point of this paper is to take existent theoretical techniques (for example approximations of sgn (x) ), to use them and to observe if they are valid in practical applications. The output of the algorithm is a set of k encrypted masks that can be applied to the original dataset in order to obtain different clusters. The setting is a standard client–server one. The workload is heavily server-centric, as the client only has to execute a light masking algorithm at the end of each iteration, which, excluding the decryption, is faster than a plain k-means iteration; the main disadvantage concerns the accuracy of the results. Experiments show that the algorithm can be executed fairly quickly: the execution time of the training phase is on the order of seconds, while classification is on the order of tenths of a second. [ABSTRACT FROM AUTHOR]

More than a decade of multi-actor conflict in Syria has resulted in a complex patchwork of legal identity documentation issued by state and non-state actors. This paper considers the legal identity practices pursued by the Kurdish-led Self Administration governing large swathes of territory in the north of the country. Specifically, the paper studies the forms of identity documentation the Self Administration does and does not provide to people present under its control. Beyond this, the paper focuses on how this system coexists with that of the central state, reflective of the Self Administration's broader approach of compromise combined with competition, to operate as a de facto authority respecting the overall sovereignty, yet challenging specific policies, of the central state. Against the backdrop of somewhat contradictory accusations of collaborating with the Syrian government and simultaneously seeking independence from it, the Self Administration has refrained from mimicking the state while expanding its own de facto 'jurisdictional subjecthood'. Practices of legal identity consequently help to elucidate necessary nuance in understanding the relations between the Self Administration and the government in Damascus. [ABSTRACT FROM AUTHOR]

In this paper, a new lattice-based password-authenticated key exchange protocol (PAKE) is proposed for the post-quantum era. The constructed Saber.PAKE is designed as a PAKE version of Saber (D'Anvers, in: International conference on cryptology in Africa, Springer, Cham, 2018), one of the finalist key encapsulation mechanisms of the National Institute of Standards and Technology's post-quantum secure standardization process. It is designed as a three-pass protocol and follows an explicit authentication approach. The hardness assumption is based on the module learning with rounding (MLWR) problem. To obtain post-quantum secure lattice-based PAKE, the password-authenticated key exchange (PAK) (MacKenzie, in: a P1363. submission to the IEEE P1363 Working Group, 2002) design idea is adapted to MLWR. To the best of our knowledge, Saber.PAKE is the first PAKE protocol based on (ring/module) learning with rounding ((R/M)LWR) problems. By considering the reconciliation bounds, the correctness analysis of Saber.PAKE is presented. The robustness against dictionary and common attacks are examined in the random oracle model. The proposed PAKE also provides perfect forward secrecy and mutual authentication. The experimental results show that it has the relatively smallest CPU cycles, message size, and runtime than the other lattice-based PAKE protocols. [ABSTRACT FROM AUTHOR]

Most scholars believe that Hadrian's city of Aelia Capitolina was unwalled, with free-standing gates marking the main entrances on the north, west, east, and south sides: on the north at the site of the modern Damascus Gate; on the east near the modern Lion's Gate; on the south at the end of the eastern cardo; and on the west near the modern Jaffa Gate. The legionary camp probably occupied all or part of the southwestern hill, while the civilian settlement was located to its north and east. In this paper, we argue that archaeological and epigraphic evidence as well as topographic considerations support an earlier suggestion that Hadrian's city of Aelia Capitolina was walled; specifically, the line of the Third Wall was rebuilt to serve as the north wall of Aelia Capitolina, and incorporated a monumental, Hadrianic arched gateway that preceded the erection of the circuit. [ABSTRACT FROM AUTHOR]

As Mobile Communication and Internet Systems (MCIS) have rapidly developed, security issues related to MCIS have become increasingly important. Therefore, the development and research of security technologies for mobile communication and internet systems are actively being conducted. Hash-Based Signature (HBS) uses a hash function to construct a digital signature scheme, where its security is guaranteed by the collision resistance of the hash function used. To provide sufficient security in the post-quantum environment, the length of hash should be satisfied for the security requirement. Modern HBS can be classified into stateful and stateless schemes. Two representative stateful and stateless HBS are eXtended Merkle Signature Scheme(XMSS) and SPHINCS + , respectively. In this paper, we propose two HBS schemes: K-XMSS and K-SPHINCS + , which replace internal hash functions of XMSS and SPHINCS + with Korean cryptography algorithms. K-XMSS is a stateful signature, while K-SPHINCS + is its stateless counterpart. We showcase the reference implementation of K-XMSS and K-SPHINCS + employing Lightweight Secure Hash (LSH) and two hash functions based on block ciphers (i.e., CHAM and LEA) as the internal hash function. In addition, K-XMSS and K-SPHINCS + using Advanced Vector Extensions 2 (AVX2) have been provided, demonstrating that they can be optimized for better performance using advanced implementation techniques than previous approaches. [ABSTRACT FROM AUTHOR]

The Polyak–Łojasiewicz inequality (PŁI) in R d is a natural condition for proving convergence of gradient descent algorithms (Karimi et al. in: Frasconi et al. (eds) Machine learning and knowledge discovery in databases, Springer International Publishing, Cham, pp 795–811, 2016). In the present paper, we study an analogue of PŁI on the space of probability measures P (R d) and show that it is a natural condition for showing exponential convergence of a class of birth-death processes related to certain mean-field optimization problems. We verify PŁI for a broad class of such problems for energy functions regularised by the KL-divergence. [ABSTRACT FROM AUTHOR]

Beamforming results depend on the spatial resolution of the microphone array used, which may lead to sources close to each other being considered as one. Deconvolution methods that consider all directions simultaneously, such as DAMAS, produce better results in these situations. However, they have a high computational cost, often lack sufficient speed to be used in real-time applications, and have limited accuracy at lower frequencies. This paper introduces a hybrid method to perform deconvolution using a neural network that can improve the speed of deconvolution on high-resolution grids by more than 2 orders of magnitude, while also generating sparser maps without sacrificing accuracy compared to the compressed DAMAS method. [ABSTRACT FROM AUTHOR]

Syria has been facing a dreadful crisis for the past 11 years, which has had a significant toll on the healthcare system of the country, and its ability to adequately manage acute injuries. In this research, we study the epidemiology and outcomes of burn patients admitted to the burn center of Al-Mouwasat Hospital in Damascus, Syria. A retrospective cohort research was conducted from January 2017 to December 2021. All accessible paper-based medical records of burn injury patients admitted to the hospital were evaluated. ABSI score was used to classify injury degrees. Chi-square test and logistic regression model were used to study the association between demographic variables and outcomes. Of the 641 patients, 367 (57.3%) were males and 274 (42.7%) were females. Children represented more than half of our sample 377 (58.8%). The most common cause of burns was flame 393 (61.3%), followed by scalding 199 (31.0%). Most of the patients had a more than 10% TBSA of burns 511 (79.7%). 209 (32.6%) patients had a moderate ABSI score, followed by moderately severe in 149 (23.2%) patients. Children, patients who had high ABSI scores, and those who needed respiratory support were more likely to die than others 2.545 (1.079-6.004), 9.208 (4.061-20.879), respectively. Death was the outcome of third of the hospitalized patients. Furthermore, Children made up more than half of the sample, and had the highest rates of leaving the hospital against medical advice. These results underline the importance of an updated nationally uniformed protocol for the management of burn patients. [ABSTRACT FROM AUTHOR]

Rotational-XOR cryptanalysis is a very recent technique for ARX ciphers. In this paper, the probability propagation formula of RX-cryptanalysis in modular addition is extended, and the calculation of RX-difference probability for any rotation parameter (⁠|$0

Malicious users using quantum computers can employ quantum attacks on modern cryptography algorithms. Grover's search algorithm, a well-known quantum algorithm, can reduce the search complexity of O (2 n) to 2 n for symmetric key cryptography with an n-bit key. To apply the Grover search algorithm, the target encryption process must be implemented in a quantum circuit. In this paper, we present optimized quantum circuits for Korean block ciphers based on ARX architectures. We adopt the optimal quantum adder and design it in parallel way. Compared to previous implementations, we provide performance improvements of 78%, 85%, and 70% in terms of circuit depth for LEA, HIGHT, and CHAM, respectively, while keeping the number of qubits and quantum gates minimum. The depth of a circuit is an important factor related to its execution time. Finally, we estimate the cost of the Grover key search for Korean block ciphers and evaluate the post-quantum security based on the criteria presented by NIST. [ABSTRACT FROM AUTHOR]

In dimension n = 3 , there is a complete theory of weak solutions of Ricci flow—the singular Ricci flows introduced by Kleiner and Lott (Acta Math 219(1):65–134, 2017, in: Chen, Lu, Lu, Zhang (eds) Geometric analysis. Progress in mathematics, vol 333. Birkhäuser, Cham, 2018)—which Bamler and Kleiner (Uniqueness and stability of Ricci flow through singularities, arXiv:1709.04122v1, 2017) proved are unique across singularities. In this paper, we show that uniqueness should not be expected to hold for Ricci flow weak solutions in dimensions n ≥ 5 . Specifically, for any integers p 1 , p 2 ≥ 2 with p 1 + p 2 ≤ 8 , and any K ∈ N , we construct a complete shrinking soliton metric g K on S p 1 × R p 2 + 1 whose forward evolution g K (t) by Ricci flow starting at t = - 1 forms a singularity at time t = 0 . As t ↗ 0 , the metric g K (t) converges to a conical metric on S p 1 × S p 2 × (0 , ∞) . Moreover there exist at least K distinct, non-isometric, forward continuations by Ricci flow expanding solitons on S p 1 × R p 2 + 1 , and also at least K non-isometric, forward continuations expanding solitons on R p 1 + 1 × S p 2 . In short, there exist smooth complete initial metrics for Ricci flow whose forward evolutions after a first singularity forms are not unique, and whose topology may change at the singularity for some solutions but not for others. [ABSTRACT FROM AUTHOR]

Ibn al-Shāṭir's (1306–1375/1376 AD) star table in his Jadīd zīj, comprising of the equatorial coordinates and magnitudes of 89 stars, is edited and analyzed in this paper on the basis of the extant manuscripts going back to the late 14th and early 15th centuries. It established a new tradition of arranging the celestial coordinates in the star tables in Egypt and Syria after him. The right ascensions (mean absolute error MAE = 20.0′, mean error μ = –2.8′, standard deviation σ = 29.1′) and the declinations (MAE = 21.1′, μ = –3.2′, σ = 29.3′) are nearly of the same degree of precision. The stars in the region RA ~ 120°–180° generally have the least errors in both declination and right ascension. The declinations of the southern stars were measured more precisely than those of the northern ones. The values for the declinations of the stars in the region δ ~ –30°–0° (the middle of the sky towards the south of the horizon of Damascus) are significantly the most accurate. A systematic northward shift can be seen in the declinations of the southern stars. The declinations of 15 of 18 stars spreading out in RA ~ 67°–121° show a southerly, downward shift. More than 65% of the stars have the errors in both the declination and right ascension less than 32′. No outlier in the tabular coordinates exceeds ±98′. Also, Ibn al-Shāṭir measured the magnitudes of, at least, a few stars: he assigned a correct magnitude of +4 to λ Ori, a component of the star cluster in the Orion that was considered a nebulous object in the Almagest star catalogue, and presented more precise values for the magnitudes of α Sco, α Oph, β Cas, κ Ori, γ Gem, and β CMi than Ptolemy and al-Ṣūfi. [ABSTRACT FROM AUTHOR]

While milk is the most consumed human drink, industrial food processes exist everywhere. It consumes a massive amount of hot water at moderate temperature levels, essential to generating the final product. The integration of small and medium enterprises (SMEs) with solar thermal systems creates noticeable savings in fuel and electricity. Identifying the integration system employed can be solved using innovative engineering simulation tools like T*sol. And the maximum points and configuration can be adjusted to achieve the maximum solar yield. This paper compares the middle east and central Europe for a medium-size pasteurising plant with an average daily consumption of 20 kWh and an annual energy requirement of 7.3 MWh. The processed heating system is supported parallelly with a 25 kW boiler for two main cities, Damascus and Budapest, with different standard collector types, FPC, ETC, and CPC. It shows that for a small-medium-sized pasteurising plant with 20 kWh daily consumption, a solar system consists of 30 m2 and 20 m2 for Budapest and Damascus. With the performance of annual solar fraction 64% and 82%, and total system efficiency 14.9% and 17.2%, respectively. It shows the importance of having solar thermal technologies in the abovementioned regions. [ABSTRACT FROM AUTHOR]

A Generalized Additive Game (GAG) (Cesari et al. in Int J Game Theory 46(4):919–939, 2017) is a Transferable Utility (TU) game (N, v), where each player in N is provided with an individual value, and the worth v(S) of a coalition S ⊆ N is obtained as the sum of the individual values of players in another subset M (S) ⊆ N . Based on conditions on the map M (which associates to each coalition S a set of beneficial players M (S) not necessarily included in S), in this paper we characterize classes of GAGs that satisfy properties like monotonicity, superadditivity, (total) balancedness, PMAS-admissibility and supermodularity, for all nonnegative vectors of individual values. We also illustrate the application of such conditions on M over particular GAGs studied in the literature (e.g., glove games (Shapley and Shubik in Int Econ Rev 10:337–362, 1969), generalized airport games (Norde et al. in Eur J Oper Res 136(3):635–654, 2002), fixed tree games (Bjørndal et al. in Math Methods Oper Res 59(2):249–270, 2004), link-connection games (Moretti in Multi-agent systems and agreement technologies, vol 10767. Springer, Cham, 2008; Nagamochi et al. in Math Oper Res 22(1):146–164, 1997), simple minimum cost spanning tree games (Norde et al. in Eur J Oper Res 154(1):84–97, 2004; Tijs et al. in Eur J Oper Res 175(1):121–134, 2006) and graph coloring games (Deng et al. in Math Program 87(3):441–452, 2000; Hamers et al. in Math Program 145(1–2):509–529, 2014)). [ABSTRACT FROM AUTHOR]

In this paper, we consider the nonlinear Schrödinger equation (NLS) with a repulsive inverse power potential. First, we show some global well-posedness results and "blow-up or grow-up" results below the ground state without the potential. Then, we prove equivalence of the conditions on the initial data below the ground state without potential. Recently, we established the existence of a radial ground state and characterized it by the virial functional for NLS with a general potential in two or higher space dimensions obtained by Hamano and Ikeda ["Characterization of the ground state to the intercritical NLS with a linear potential by the virial functional," in Advances in Harmonic Analysis and Partial Differential Equations, Trends in Mathematics (Birkhäuser/Springer, Cham, 2020), pp. 279–307]. Then, we also prove a global well-posedness result and a "blow-up or grow-up" result below the radial ground state with a repulsive inverse power potential obtained by Hamano and Ikeda ["Characterization of the ground state to the intercritical NLS with a linear potential by the virial functional," in Advances in Harmonic Analysis and Partial Differential Equations, Trends in Mathematics (Birkhäuser/Springer, Cham, 2020), pp. 279–307]. [ABSTRACT FROM AUTHOR]

According to the editors of I Urban Informatics and Future Cities i , "smart cities" is an outdated discussion given that most cities are now "smart" to an extent. Overall, the chapters explore new planning support systems, analysis techniques, and games, with many of the papers involving the use of big data and, of course, "smartness" evident here and there. [Extracted from the article]

It was proved in Forti and Schwaiger (C R Math Acad Sci Soc R Can 11(6):215–220, 1989), Schwaiger (Aequ Math 35:120–121, 1988) and with different methods in Schwaiger (Developments in functional equations and related topics. Selected papers based on the presentations at the 16th international conference on functional equations and inequalities, ICFEI, Bȩdlewo, Poland, May 17–23, 2015, Springer, Cham, pp 275–295, 2017) that under the assumption that every function defined on suitable abelian semigroups with values in a normed space such that the norm of its Cauchy difference is bounded by a constant (function) is close to some additive function, i.e., the norm of the difference between the given function and that additive function is also bounded by a constant, the normed space must necessarily be complete. By Schwaiger (Ann Math Sil 34:151–163, 2020) this is also true in the non-archimedean case. Here we discuss the situation when the bound is a suitable non-constant function. [ABSTRACT FROM AUTHOR]

Acoustic beamforming methods based on microphone arrays have been widely used for sound source localization in various industrial fields. The conventional methods such as Delay and Sum (DAS) beamforming are limited by poor spatial resolution although their computational complexity is low. Efforts have been made to improve the resolution of the beamforming map, achieved by both model-based and deep network-based approaches. However, the model-based methods usually suffer from high additional computational effort and largely rely on selecting user-determined parameters. The deep network-based methods may make it difficult to guarantee generalization as well as hard to generate the beamforming map directly. In this paper, we first propose a scheme DAMAS-FISTA-LASSO to solve the inverse problem of sound imaging, significantly reducing runtime requirements. By deep unfolding the proposed algorithm, we further have designed an end-to-end interpretable model-based deep neural network termed DAMAS-FISTA-LASSO-Net (DFLNet) for real-time and high-resolution mapping of acoustic sources, which could obtain satisfying performance on both simulated and real-world data, demonstrating the strong generalization capability of the network. • The propose DAMAS-FISTA-LASSO algorithm can significantly reduce the runtime requirement of DAMAS. • We further design DFLNet, which adopts the structure of the DAMAS-FISTA-LASSO and inherits the relevant acoustic domain knowledge. • The parameters of DFLNet are learned from the data manifold, eliminating the effect of parameter tweaking on imaging results. • The DFLNet achieves promising performance in both simulated and real-world data, exhibiting its generalization properties. [ABSTRACT FROM AUTHOR]

While we can identify patterns from large pools of data, made possible by big data and digital technologies, using quantitative methods in this way only tells us the outcome (i.e. the most common routes people take) but not the I why i . Urban informatics and future cities: edited by S. C. M. Geertman, Christopher Pettit, Robert Goodspeed and Aija Staffans, Cham, Springer, 2021, 632 pp., GBP 159.50 (e-book). Overall, the chapters explore new planning support systems, analysis techniques, and games, with many of the papers involving the use of big data and, of course, "smartness" evident here and there. [Extracted from the article]

• Fixed point of DAMAS are solutions of a non-negative least-squares problem. • This problem is equivalent to the covariance matrix fitting (CMF) method. • A justification is given for the sparsity of DAMAS and CMF results. • An algorithm for large scale CMF problems is introduced. [Display omitted] Based on a theoretical analysis of the DAMAS algorithm, proposed by Brooks and Humphreys to locate and quantify acoustic sources accurately, the paper proposes an efficient method to converge faster to the same solution by implementing standard proven algorithms. We prove that when the DAMAS converges, its limit is a solution of the Covariance matrix Fitting method, and that when the solution is unique, the DAMAS algorithm converges. We analyze the properties of the solutions to this optimization problem to explain the ability of the DAMAS algorithm to recover sparse distributions of sources, even without a regularization term. A fast implementation of the Covariance Matrix Fitting problem is also proposed. Several algorithms to solve this problem are compared. From this review, it comes that the proposed method reduces drastically memory use and computational time thus allowing to address large scale problems. An application to a large-scale 3D problem using experimental data demonstrates this numerical efficiency, and simulations are used to assess the performances of source power estimation. [ABSTRACT FROM AUTHOR]