bluuebunny/crossref_metadata_2025 huggingface dataset:
Evaluation of “Test to Return” after COVID‐19 Diagnosis in a Massachusetts Public School District
Authors: Nelson Sandra B. , Brenner Isaac Ravi , Homan Elizabeth , Lee Sarah Bott , Bongiorno Christine , Pollock Nira R. , Ciaranello Andrea
Published: June 2023

BACKGROUND

Per Centers for Disease Control and Prevention guidance, students with COVID‐19 may end isolation after 5 days if symptoms are improving; some individuals may still be contagious. Rapid antigen testing identifies possibly infectious virus. We report on a test‐to‐return (TTR) program in a Massachusetts school district to inform policy decisions about return to school after COVID‐19.

METHODS

During the 2021‐2022 Omicron BA.1 surge, students with COVID‐19 could return on day 6‐10 if they met symptom criteria and had a negative rapid test; students with positive rapid tests and those who declined TTR remained isolated until day 11. TTR positivity rates were compared by grade level, vaccination status, symptom status, and day of infection.

RESULTS

31.4% of students had a positive TTR rapid test; there were no differences by grade or vaccination status. Ever‐symptomatic students were more likely to have a positive rapid test (75/174 [43.1%] vs 18/104 [17.3%]). For ever‐symptomatic students, TTR positivity decreased by day of infection.

CONCLUSIONS

A substantial proportion of students may still be contagious 6 days after onset of COVID‐19 infection. TTR programs may increase or reduce missed school days, depending on when return is otherwise allowed (day 6 or 11). The impact of TTR programs on school‐associated transmission remains unknown.
Artificial intelligence for supply chain management: Disruptive innovation or innovative disruption?
Authors: Hendriksen Christian
Published: June 2023

This article examines the theoretical and practical implications of artificial intelligence (AI) integration in supply chain management (SCM). AI has developed dramatically in recent years, embodied by the newest generation of large language models (LLMs) that exhibit human‐like capabilities in various domains. However, SCM as a discipline seems unprepared for this potential revolution, as existing perspectives do not capture the potential for disruption offered by AI tools. Moreover, AI integration in SCM is not only a technical but also a social process, influenced by human sensemaking and interpretation of AI systems. This article offers a novel theoretical lens called the AI Integration (AII) framework, which considers two key dimensions: the level of AI integration across the supply chain and the role of AI in decision‐making. It also incorporates human meaning‐making as an overlaying factor that shapes AI integration and disruption dynamics. The article demonstrates that different ways of integrating AI will lead to different kinds of disruptions, both in theory and in practice. It also discusses the implications of AI integration for SCM theorizing and practice, highlighting the need for cross‐disciplinary collaboration and sociotechnical perspectives.
Distance spectacle‐wearing habits in older patients in England
Authors: Hughes Amy R. , Elliott David B.
Published: June 2023

Purpose

To report the proportion of older people in England who wear distance spectacles full time, part time and rarely, and to investigate factors that influence how much the distance vision (DV) correction is worn.

Methods

A two‐part questionnaire investigating the spectacle‐wearing habits of older people was developed and completed by 322 participants (age 72 years ±7.7, range 60–94). A subcohort of 209 DV correction wearers with a mean spherical equivalent (MSE) of <±4.00DS was selected for a logistic regression to investigate which factors influence how much the DV correction is used.

Results

In total, 43% of emmetropic, and 55% of pseudophakic, DV spectacle wearers wear their correction full time. Lens type, MSE and the age that participants first wore a DV correction significantly predicted DV correction wearing habit (adjusted R2 = 0.36), with lens type being the strongest predicting factor and progressive users wearing their spectacles 37% more than those using single vision lenses.

Conclusions

Many patients appear to consider convenience more important than being spectacle independent at distance, with lens type the most significant influencing factor of how much those with low/moderate refractive error wear their distance correction. Many emmetropes and pseudophakes choose to wear their progressive or bifocal spectacles full time, and the emmetropia provided by cataract surgery does not provide independence from full‐time spectacle wear for many patients. The optometrist has a key role in discussing both choice of spectacle lens correction and the refractive outcome options of cataract surgery with patients.
Locating religion in contemporary art
Authors: Arya Rina
Published: June 2023

The place of religion in the context of contemporary art is fraught and complex. This article discusses three prominent ways in which religion is explored in contemporary art: in sociopolitics, in art that transgresses, and in the creation of spaces of contemplation, some of which may be ‘religious’. Each of these ways have in common the exploration of religion primarily in terms of its lived experience and practices (within identity and the material world) rather than through religious belief or the institutions of religion.
The accuracy of commercially available instrumented insoles (ARION) for measuring spatiotemporal running metrics
Authors: Van Hooren Bas , Willems Paul , Plasqui Guy , Meijer Kenneth
Published: June 2023

Spatiotemporal metrics such as step frequency have been associated with running injuries in some studies. Wearables can measure these metrics and provide real‐time feedback in‐field, but are often not validated. This study assessed the validity of commercially available wireless instrumented insoles (ARION) for quantifying spatiotemporal metrics during level running at different speeds (2.78–5.0 m s−1,) and slopes (3° and 6° up/downhill) to an instrumented treadmill. Mean raw, percentage and absolute percentage error, and limits of agreement (LoA) were calculated. Agreement was statistically quantified using four thresholds: excellent, <5%; good, <10%; acceptable, <15%; and poor, >15% error. Excellent agreement (<5% error) was achieved for stride time across all conditions, and for step frequency across all but one condition with good agreement. Contact time and swing time generally showed at least good agreement. The mean difference across all conditions was −0.95% for contact time, 0.11% for stride time, 0.6% for swing time, −0.11% for step frequency, and −0.09% when averaged across all outcomes and conditions. The accuracy at an individual level was generally good to excellent, being <10% for all but two conditions, with these conditions being <15%. Additional experiments among four runners showed that step length could also be measured with an accuracy of 1.76% across different speeds with an updated version of the insoles. These findings suggests that the ARION wearable may not only be useful for large‐scale in‐field studies investigating group differences, but also to quantify spatiotemporal metrics with generally good to excellent accuracy for individual runners.
Rice‐farming areas report more anxiety across two years of the COVID‐19 pandemic in China
Authors: Zhang Xinyi , English Alexander , Talhelm Thomas , Nam Benjamin H. , Wei Liuqing
Published: June 2023

Cultures responded to the COVID‐19 pandemic differently. We investigated cultural differences in mental health during the pandemic. We found regional differences in people's reports of anxiety in China over two years from 2020 to 2021 (N = 1186). People in areas with a history of rice farming reported more anxiety than people in wheat‐farming areas. Next, we explored more proximal mechanisms that could help link the distal, historical factor of rice farming to people's modern experience of anxiety. Rice areas scored higher on collectivism and tight social norms than wheat areas, and collectivism, rather than norm tightness, mediated the rice‐anxiety relationship. These findings advance our understanding of the distal sources of cultural differences, the proximal mechanisms, and mental health problems during the pandemics.
A Pilot Analysis of Factors Affecting Defense Against Social Engineering Attacks in the Armed Forces Environment
Authors: Shahrom Muhammad Farhan , Maarop Nurazean , Narayana Samy Ganthan , Hassan Noor Hafizah , Abdul Rahim Fiza , Magalingam Pritheega , Kamaruddin Norshaliza
Published: June 2023

Social engineering is a technique of deceiving people into giving away confidential information that could be useful to gain unauthorized access to an information system. Even to the most secured system, social engineering is a formidable threat. It is one of the most devastating threats to organizations and businesses. Unlike traditional hacking, social engineering is less or non-technological. It manipulates characteristics of human nature, exploiting people’s desire to be kind and helpful. The psychology leverage makes social engineering hard to defend against. This paper presents the identification of factors related to social engineering in the context of armed forces through a review of related literature. Prior works from previous studies are discussed, and factors have been identified based on certain criterion. This study executed a pilot analysis on 30 samples of respondents among Malaysian armed forces personnel. As a result, nine factors are identified that may affect defense against social engineering in the armed forces: Authority, Reciprocation, Commitment and Consistency, Diffusion of Responsibility, Scarcity, Friendliness and Liking, Awareness, Social Proof, and Trust.
Nonlocal Harnack inequality for fractional elliptic equations with Orlicz growth
Authors: Byun Sun‐Sig , Kim Hyojin , Song Kyeong
Published: June 2023

We prove Harnack inequality for weak solutions to nonlinear nonlocal equations of fractional ‐Laplace type, under natural assumptions on the ‐function .
Call properties of the large yellow croaker (Larimichthys
crocea) during reproduction with insight into directivity
Authors: Su Yingnan , Song Zhongchang , Li Hongquan , Zhang Yi , Xiang Wenjie , Hui Jiangang , Sun Shengyao , Xiao Zhen , Zhang Yu
Published: June 2023

The investigation of the large yellow croaker (Larimichthys crocea) deserves more attention due to its high commercial value as an important aquaculture fish species. This study was initiated by deploying a passive acoustic monitoring device to record the calls from the L. crocea during the spawning process in an aquaculture facility. The subsequent analysis suggested the croakers produced at least two types of calls with considerable energy distributed up to 1000 Hz. The acoustic data and the computed tomography scanning of an adult croaker were used to develop a numerical model to address the directivity of the calls at frequencies up to 1000 Hz. The radiation patterns at all frequencies were assigned with respective weights and then combined to estimate an overall acoustic radiation pattern for both types of the calls. The backward transmission was greater for both types of calls by 1.85 dB on average. The reduction of size by 20% in the swim bladder resulted in a stronger sidelobe in the frontal direction, indicating its influence on call directivity. These results provided information on the directivity of the croaker calls and understanding of fish acoustics.
Dynamic Social Media Content in Sport Communication Research
Authors: Clavio Galen
Published: June 2023

Research focusing on social media usage in sport communication and its related media has made significant strides in the last 2 decades. Researchers have provided key insights into how social media content is created by sport entities and media members, how sport fans and consumers feel about social media content, and how aspects of social media content inform public perception of matters pertaining to race, gender, ethnicity, politics, and other key cultural areas. However, the changing natures of social media technology and user preferences for content have often moved faster than the body of research surrounding them. This commentary highlights a gap in published sport communication studies focusing on dynamic social media content and provides suggestions for addressing a key present, and future, need for scholarly inquiry in the field.
A Critical Analysis of Coaches’ Perceptions of Athletic Department Involvement in Team-Related Social Media Activism
Authors: Bunch Natalie , Cianfrone Beth A. , Beasley Lauren
Published: June 2023

National Collegiate Athletic Association (NCAA) coaches are among the most visible leaders on campuses. With recent calls for diversity efforts, coaches are faced with decisions regarding supporting or promoting their teams’ and athletes’ racial justice actions on team social media accounts. However, sport information staff often manage the team’s social media strategy and may not reflect the coaches’ goals. Framed by the theory of racialized organizations, we examined NCAA coaches’ attitudes toward their athletic department’s role in social media activism on their team pages. We surveyed 174 coaches across divisions and investigated differences based on coaches’ gender, race, and division. Findings suggest that coaches supported activism but were less confident in the role of the athletic department in posting about racial justice on team accounts. Interpreting results through the theory of racialized organizations, coaches, specifically White coaches, may view their college athletic departments as race-neutral organizations. There is opportunity for those managing team platforms to further promote social justice messaging to demonstrate organizational support.
Repeated High-Intensity Technique Training and Repeated Sprint Training Elicit Similar Adjustment in Physiological Responses But Divergent Perceptual Responses and Combat-Related Performances in Adolescent Taekwondo Matches
Authors: Ouergui Ibrahim , Delleli Slaheddine , Messaoudi Hamdi , Bridge Craig Alan , Chtourou Hamdi , Franchini Emerson , Ardigò Luca Paolo
Published: June 2023

Purpose: This study investigated the effects of 4 weeks of repeated sprint training (RST) versus repeated high-intensity technique training (RTT) on the physiological responses (ie, blood lactate), mean and peak heart rate, rating of perceived exertion, technical–tactical performance, and time–motion variables during simulated taekwondo combats. Methods: Twenty-four taekwondo athletes (18 male and 6 female; age: 16 [1] y) were randomly and equally assigned to RST (10 × 35-m running sprints interspersed by 10-s rest) or RTT (10 × 6-s bandal-tchagui kicking executions interspersed by 10-s rest) groups in addition to their regular training. Both groups performed simulated combats before and after training. Results: Delta lactate and peak heart rate were attenuated following training (P < .001 and P = .03, respectively), with no differences identified between RTT and RST conditions. Rating of perceived exertion decreased after training only in the RTT (P = .002). Time fighting and preparatory activities increased following training (P < .001), with higher values observed following RTT than RST (P < .001). Nonpreparatory time decreased after training (P < .001), with more pronounced reductions observed following RTT when compared to RST (P < .001). The number of single attacks decreased only following RST (P < .001), whereas combined attacks increased only after RTT training (P < .001). Conclusions: Similar adjustments in the physiological responses to combat were observed following 4 weeks of either RST or RTT, but RTT elicited more favorable perceptual responses and combat-related performance. This highlights the importance of specificity of training and its effective transfer to combat.
Frequent Emergence of Resistance Mutations Following Complex Intra-Host Genomic Dynamics in SARS-CoV-2 Patients Receiving Sotrovimab
Authors: Palomino-Cabrera Rosalía , Tejerina Francisco , Molero-Salinas Andrea , Ferris María , Veintimilla Cristina , Catalán Pilar , Rodríguez Macias Gabriela , Alonso Roberto , Muñoz Patricia , García de Viedma Darío , Pérez-Lago Laura , Alcalá Luis , Aldámiz Teresa , Alonso Roberto , Álvarez-Uría Ana , Bermúdez Elena , Bouza Emilio , Buenestado-Serrano Sergio , Burillo Almudena , Carrillo Raquel , Catalán Pilar , Cercenado Emilia , Cobos Alejandro , Díez Cristina , Escribano Pilar , Estévez Agustín , Fanciulli Chiara , Galar Alicia , García Ma Dolores , García de Viedma Darío , Gijón Paloma , Guillén Helmuth , Guinea Jesús , Herranz Marta , Irigoyen Álvaro , Kestler Martha , López Juan Carlos , Machado Marina , Marín Mercedes , Martín-Rabadán Pablo , Molero-Salinas Andrea , Montilla Pedro , Muñoz Patricia , Padilla Belén , Palomino-Cabrera Rosalía , Palomo María , Pérez-Granda María Jesús , Peñas-Utrilla Daniel , Pérez-Lago Laura , Pérez Leire , Reigadas Elena , Rincón Cristina , Rodríguez Belén , Rodríguez Sara , Rodríguez-Grande Cristina , Rojas Adriana , Ruiz-Serrano María Jesús , Sánchez Carlos , Sánchez Mar , Sanz-Pérez Amadeo , Serrano Julia , Tejerina Francisco , Valerio Maricela , Veintimilla Ma Cristina , Vesperinas Lara , Vicente Teresa , de la Villa Sofía
Published: June 2023

The emergence of the Omicron variant of SARS-CoV-2 represented a challenge to the treatment of COVID-19 using monoclonal antibodies. Only Sotrovimab maintained partial activity, allowing it to be used in high-risk patients infected with the Omicron variant.
Structures of Langya Virus Fusion Protein Ectodomain in Pre- and Postfusion Conformation
Authors: May Aaron J. , Pothula Karunakar Reddy , Janowska Katarzyna , Acharya Priyamvada
Published: June 2023

The
Henipavirus
genus is quickly expanding into new animal hosts and geographic locations. This study compares the structure and antigenicity of the Langya virus fusion protein to other henipaviruses, which have important vaccine and therapeutic development implications. Furthermore, the study proposes a new mechanism to explain the early steps of the fusion initiation process that can be more broadly applied to the
Paramyxoviridae
family.
Southwest Borneo, an autochthonous Pangea-Eurasia assembly proxy: Insights from detrital zircon record
Authors: Quek Long Xiang , Li Shan , Morley Christopher K. , Ghani Azman A. , Zhu Junbin , Roselee Muhammad Hatta , Murthadha Sayed , Rahmat Rezal , Lai Yu-Ming , Lintjewas Lediyantje
Published: June 2023

The current tectonic model for Borneo in SE Asia suggests that the SW Borneo block rifted from NW Australia at ca. 190 Ma and drifted across the Tethyan Ocean to collide with Eurasia in the Early Cretaceous. But, the global zircon Hf trend after 200 Ma indicates that circum-Pacific-style accretionary orogens prevail. The SW Borneo detrital zircon data set, which combines our new data with previous data, shows consistent age peaks (ca. 250 Ma, 1.9–1.8 Ga, and 2.5–2.4 Ga) in late Permian to Early Cretaceous samples. The Banda terranes, a notable block derived from NW Australia, have distinct detrital zircon age peaks for pre-breakup and post-breakup. Available Borneo detrital zircon εHf(t) values for ca. 1.8 Ga and 2.4 Ga are indistinguishable from those of NW Australia sources, but εHf(t) values for 300–200 Ma are more negative than those from the Gondwanide orogen and are more similar to those from the Peninsular Malaysia Indosinian orogen. We suggest SW Borneo is a Triassic accretion zone at eastern Cimmeria that rifted from NW Australia in the Permian. The ca. 250 Ma negative εHf(t) values present in samples are characteristic of Tethyan-style collisional orogens and show participation in Pangea assembly. SW Borneo underwent further autochthonous accretion along its SE margin (ca. 186 Ma and ca. 140 Ma) in a Jurassic Meso-Tethys and Paleo-Pacific supra–subduction zone setting. Our revision locates SW Borneo with other SE Tethysides blocks in Eurasia where accretionary orogens have influenced rises after 200 Ma.
Jordan Property for the Cremona Group over a Finite Field
Authors: Prokhorov Yuri G. , Shramov Constantin A.
Published: June 2023

We show that the Cremona group of rank $$2$$ over a finite field is Jordan, and provide an upper bound for its Jordan constant which is sharp when the number of elements in the field is different from $$2$$, $$4$$, and $$8$$.
Phase shift and cross section analysis of nucleon–nucleon and nucleon–nucleus scattering using second Pöschl–Teller potential
Authors: Sahoo P. , Laha U.
Published: June 2023

In view of nuclear structure calculations, the second Pöschl–Teller potential is parameterized to study nucleon–nucleon and nucleon–nucleus elastic scattering. By exploiting the variable phase approach to potential scattering, phase parameters, cross sections, analyzing powers, etc., are computed and compared with earlier works. The calculated cross sections agree with the experiments below 25 MeV within the error bars for the (n-p) and (n-d) systems.
Coincident $$f(\mathbb {Q})$$ gravity: black holes, regular black holes, and black bounces
Authors: Junior José Tarciso S. S. , Rodrigues Manuel E.
Published: June 2023

In this paper, we will use the coincident gauge to investigate new solutions of the$$f(\mathbb {Q})$$f(Q)theory applied in the context of black holes, regular black holes, and the black-bounce spacetime. For each of these approaches, we compute the linear solutions and the solutions with the constraint that the non-metricity scalar is zero. We also analyze the geodesics of each solution to interpret whether the spacetime is extensible or not, find the Kretschmann scalar to determine the regularity along spacetime, and in the context of regular black holes and black-bounce, we calculate the energy conditions. In the latter black-bounce case we realize that the null energy condition (NEC), specifically the$$NEC_1=WEC_1=SEC_1\leftrightarrow \rho +p_{r}\ge 0$$NEC1=WEC1=SEC1↔ρ+pr≥0, is satisfied outside the event horizon.
ON MODIFIED VARIANTS OF CLASSICAL TROJAN Y CHROMOSOME MODEL WITH GLOBAL SOLUTIONS
Authors: TAKYI ERIC M. , BEAUREGARD MATTHEW A. , PARSHAD RANA D.
Published: June 2023

The Trojan Y Chromosome (TYC) strategy is a biological control method for controlling invasive populations with an XX–XY sex determinism, wherein a modified organism is introduced into an invasive population to skew the sex ratio over time, causing local extinction. However, the classical three compartment TYC model possesses blow-up solutions, for large initial conditions [Takyi EM, Beauregard MA, Griffin T, Bobo L, Parshad RD, On large and small data blow-up solutions in the Trojan Y Chromosome model, Axioms 11(3):120, 2022]. We investigate model improvements via accounting for a modified logistic term, female mating preference, competition between males and supermales and pair formation. Each one of these models is dynamically explored and is shown to possess global in-time non-negative solutions, in any parameter and initial data regime, and the models are also effective in facilitating extinction of the invasive wild type.
Dual Kasch rings
Authors: Büyükaşık Engin , Lomp Christian , Yurtsever Haydar Baran
Published: June 2023

It is well known that a ring [Formula: see text] is right Kasch if each simple right [Formula: see text]-module embeds in a projective right [Formula: see text]-module. In this paper we study the dual notion and call a ring [Formula: see text] right dual Kasch if each simple right [Formula: see text]-module is a homomorphic image of an injective right [Formula: see text]-module. We prove that [Formula: see text] is right dual Kasch if and only if every finitely generated projective right [Formula: see text]-module is coclosed in its injective hull. Typical examples of dual Kasch rings are self-injective rings, V-rings and commutative perfect rings. Skew group rings of dual Kasch rings by finite groups are dual Kasch if the order of the group is invertible. Many examples are given to separate the notion of Kasch and dual Kasch rings. It is shown that commutative Kasch rings are dual Kasch, and a commutative ring with finite Goldie dimension is dual Kasch if and only if it is a classical ring (i.e. every element is a zero divisor or invertible). We obtain that, for a field [Formula: see text], a finite dimensional [Formula: see text]-algebra is right dual Kasch if and only if it is left Kasch. We also discuss the rings over which every simple right module is a homomorphic image of its injective hull, and these rings are termed strongly dual Kasch.
Obstruction theories of extensions via track categories
Authors: Pirashvili Mariam
Published: June 2023

Abelian track categories can be classified via the third Baues–Wirsching cohomology of small categories. This approach is used in this paper to derive the different generalizations of the obstruction theory of non-abelian group extensions, due to Cegarra, Garzón and Grandjean, Cegarra, Garzón and Ortega, and Chen, Du and Wang as particular cases of a general theory of abelian track categories and to give unified proofs of the main properties of these obstruction classes.
Bounds for Betti numbers and the degrees of the generators of syzygies in graded resolutions
Authors: Da Silva W. A. , Hassanzadeh S. H. , Simis A.
Published: June 2023

The main goal of this paper is to size up the minimal graded free resolution of a homogeneous ideal in terms of its generating degrees, by itself an ambitious objective. As understood, sizing up means looking closely at the two available parameters: the shifts and the Betti numbers. Since, in general, bounds for the shifts can behave quite steeply, we filter the difficulty by the subadditivity of the syzygies. The method we applied is hopefully new and sheds additional light on the structure of the minimal free resolution. For the Betti numbers, we apply the Boij–Söderberg techniques in order to get polynomial upper bounds for them. It is expected that the landscape of hypersurface singularities already contains most of the difficult corners of the arbitrary case. In this regard, we treat some facets of this case, including an improvement of one of the basic results of a recent work by Busé–Dimca–Schenck–Sticlaru.
Knowledge Management in Higher Education in Vietnam: Insights from Higher Education Leaders — An Exploratory Study
Authors: Ngoc-Tan Nguyen
Published: June 2023

This paper aims at increasing awareness of knowledge management (KM), its challenges as well as benefits in Higher Education (HE) system of Vietnam. An exploratory qualitative research design was deployed using semi-structured interviews. Nine senior institutional leaders from nine Vietnamese universities participated in the study. Thematic analysis, informed by the literature, was undertaken on English translated transcripts of the interviews. The findings shared senior HE leaders’ perspectives on how KM in higher education institutions (HEI) of Vietnam was being conceptualised and operationalised, as well as insights into how KM associates with six dimensions of HEIs’ performance so as to gear up KM’s benefits and anticipate challenges when a HEI embarking on the KM journey. Further research of different methods on the topic to enlighten the role of KM in HE system of Vietnam, and beyond, is recommended. The role and importance of KM is wildly recognised in business communities. However, studies exploring KM application in HE system remain scarce especially HE of developing countries. In Vietnam, no qualitative studies of KM in HEIs have been located. Vietnam is a nation on its way to transform from a state-based to market-driven economy; and a comprehensive education reform is deemed to shoulder the key task. KM deployment in the whole HE system is essential to comprehensive education reform and then to the global integration of its HE system. Besides, the study helps enrich the literature of KM in HE sector and provide insights of KM to campus chiefs, KM officers, administrator in HEIs.
Wide-spectrum detector based on hierarchical flower-like In2S3 nanostructures by solvothermal process
Authors: Liang Zhao , Yu Naisen , Du Shiyu , Liu Benkang , Wu Yunfeng
Published: June 2023

Hierarchical flower-like In2S3 nanostructures were synthesized using a solvothermal process. The device based on In2S3 nanostructure was fabricated and the photoresponse properties were investigated. The flower-like In2S3 nanostructures display a strong quantum confinement with a wide band response in range from ultraviolet (UV) to the visible region. The results indicated that the photodetector based on hierarchical flower-like [Formula: see text]-In2S3 nanostructures will have important applications in multiple band detection devices.
A Theoretical Analysis of Spin-Dependent Tunneling in ZnO-Based Heterostructures
Authors: Chandrasekar L. Bruno , Karunakaran M.
Published: June 2023

The electron tunneling in ZnO/ZnCdO semiconductor heterostructure is studied using the matrix method. The spin-polarization is examined due to Dresselhaus spin–orbit interaction and Rashba spin–orbit interaction. The total spin-polarization is mainly due to Dresselhaus spin–orbit interaction and the Rashba spin–orbit interaction is small. The high degree of spin polarization can be achieved at a high barrier width. With the increasing cadmium concentration in this heterostructure, the spin polarization efficiency is enhanced. The dwell time is reported and discussed.
About this title - Geology's Significant Sites and their Contributions to Geoheritage
Authors: Clary R. M. , Pyle E. J. , Andrews W. M.
Published: June 2023

This volume samples global geoheritage locales that impacted the history of geological understanding. From internationally celebrated sites to sacred indigenous areas, contributing authors celebrate a rich geological history and the preservation of Earth's geodiversity – providing cautionary tales of exceptional sites that were almost lost to future generations.
Modular Control Plane Verification via Temporal Invariants
Authors: Alberdingk Thijm Timothy , Beckett Ryan , Gupta Aarti , Walker David
Published: June 2023

Monolithic control plane verification cannot scale to hyperscale network architectures with tens of thousands of nodes, heterogeneous network policies and thousands of network changes a day. Instead, modular verification offers improved scalability, reasoning over diverse behaviors, and robustness following policy updates. We introduce Timepiece, a new modular control plane verification system. While one class of verifiers, starting with Minesweeper, were based on analysis of stable paths, we show that such models, when deployed naïvely for modular verification, are unsound. To rectify the situation, we adopt a routing model based around a logical notion of time and develop a sound, expressive, and scalable verification engine.

Our system requires that a user specifies interfaces between module components. We develop methods for defining these interfaces using predicates inspired by temporal logic, and show how to use those interfaces to verify a range of network-wide properties such as reachability or access control. Verifying a prefix-filtering policy using a non-modular verification engine times out on an 80-node fattree network after 2 hours. However, Timepiece verifies a 2,000-node fattree in 2.37 minutes on a 96-core virtual machine. Modular verification of individual routers is embarrassingly parallel and completes in seconds, which allows verification to scale beyond non-modular engines, while still allowing the full power of SMT-based symbolic reasoning.
Discrete Adversarial Attack to Models of Code
Authors: Gao Fengjuan , Wang Yu , Wang Ke
Published: June 2023

The pervasive brittleness of deep neural networks has attracted significant attention in recent years. A particularly interesting finding is the existence of adversarial examples, imperceptibly perturbed natural inputs that induce erroneous predictions in state-of-the-art neural models. In this paper, we study a different type of adversarial examples specific to code models, called
discrete adversarial examples
, which are created through program transformations that preserve the semantics of original inputs.In particular, we propose a novel, general method that is highly effective in attacking a broad range of code models. From the defense perspective, our primary contribution is a theoretical foundation for the application of adversarial training — the most successful algorithm for training robust classifiers — to defending code models against discrete adversarial attack. Motivated by the theoretical results, we present a simple realization of adversarial training that substantially improves the robustness of code models against adversarial attacks in practice.

We extensively evaluate both our attack and defense methods. Results show that our discrete attack is significantly more effective than state-of-the-art whether or not defense mechanisms are in place to aid models in resisting attacks. In addition, our realization of adversarial training improves the robustness of all evaluated models by the widest margin against state-of-the-art adversarial attacks as well as our own.
Garbage-Collection Safety for Region-Based Type-Polymorphic Programs
Authors: Elsman Martin
Published: June 2023

Region inference offers a mechanism to reduce (and sometimes entirely remove) the need for reference-tracing garbage collection by inferring where to insert allocation and deallocation instructions in a program at compile time. When the mechanism is combined with techniques for reference-tracing garbage collection, which is helpful in general to support programs with very dynamic memory behaviours, it turns out that region-inference is complementary to adding generations to a reference-tracing collector. However, region-inference and the associated region-representation analyses that make such a memory management strategy perform well in practice are complex, both from a theoretical point-of-view and from an implementation point-of-view.

In this paper, we demonstrate a soundness problem with existing theoretical developments, which have to do with ensuring that, even for higher-order polymorphic programs, no dangling-pointers appear during a reference-tracing collection. This problem has materialised as a practical soundness problem in a real implementation based on region inference. As a solution, we present a modified, yet simple, region type-system that captures garbage-collection effects, even for polymorphic higher-order code, and outline how region inference and region-representation analyses are adapted to the new type system. The new type system allows for associating simpler region type-schemes with functions, compared to original work, makes it possible to combine region-based memory management with partly tag-free reference-tracing (and generational) garbage-collection, and repairs previously derived work that is based on the erroneous published results.
Generalized Policy-Based Noninterference for Efficient Confidentiality-Preservation
Authors: Mangipudi Shamiek , Chuprikov Pavel , Eugster Patrick , Viering Malte , Savvides Savvas
Published: June 2023

As more organizations are leveraging third-party cloud and edge data centers to process data efficiently, the issue of preserving data confidentiality becomes increasingly important. In response, numerous security mechanisms have been introduced and promoted in recent years including software-based ones such as homomorphic encryption, as well as hardware-based ones such as Intel SGX and AMD SEV. However these mechanisms vary in their security properties, performance characteristics, availability, and application modalities, making it hard for programmers to judiciously choose and correctly employ the right one for a given data query.

This paper presents a mechanism-independent approach to distributed confidentiality-preserving data analytics. Our approach hinges on a core programming language which abstracts the intricacies of individual security mechanisms. Data is labeled using custom confidentiality levels arranged along a lattice in order to capture its exact confidentiality constraints. High-level mappings between available mechanisms and these labels are captured through a novel expressive form of security policy. Confidentiality is guaranteed through a type system based on a novel formulation of noninterference, generalized to support our security policy definition. Queries written in a largely security-agnostic subset of our language are transformed to the full language to automatically use mechanisms in an efficient, possibly combined manner, while provably preserving confidentiality in data queries end-to-end. We prototype our approach as an extension to the popular Apache Spark analytics engine, demonstrating the significant versatility and performance benefits of our approach over single hardwired mechanisms --- including in existing systems --- without compromising on confidentiality.
Mosaic: An Interoperable Compiler for Tensor Algebra
Authors: Bansal Manya , Hsu Olivia , Olukotun Kunle , Kjolstad Fredrik
Published: June 2023

We introduce Mosaic, a sparse tensor algebra compiler that can bind tensor expressions to external functions of other tensor algebra libraries and compilers. Users can extend Mosaic by adding new functions and bind a sub-expression to a function using a scheduling API. Mosaic substitutes the bound sub-expressions with calls to the external functions and automatically generates the remaining code using a default code generator. As the generated code is fused by default, users can productively leverage both fusion and calls to specialized functions within the same compiler. We demonstrate the benefits of our dual approach by showing that calling hand-written CPU and specialized hardware functions can provide speedups of up to 206× against fused code in some cases, while generating fused code can provide speedups of up to 3.57× against code that calls external functions in other cases. Mosaic also offers a search system that can automatically map an expression to a set of registered external functions. Both the explicit binding and automatic search are verified by Mosaic. Additionally, the interface for adding new external functions is simple and general. Currently, 38 external functions have been added to Mosaic, with each addition averaging 20 lines of code.
Context Sensitivity without Contexts: A Cut-Shortcut Approach to Fast and Precise Pointer Analysis
Authors: Ma Wenjie , Yang Shengyuan , Tan Tian , Ma Xiaoxing , Xu Chang , Li Yue
Published: June 2023

Over the past decades, context sensitivity has been considered as one of the most effective ideas for improving the precision of pointer analysis for Java. Different from the extremely fast context-insensitivity approach, context sensitivity requires every program method to be analyzed under different contexts for separating the static abstractions of different dynamic instantiations of the method’s variables and heap objects, and thus reducing spurious object flows introduced by method calls. However, despite great precision benefits, as each method is equivalently cloned and analyzed under each context, context sensitivity brings heavy efficiency costs. Recently, numerous selective context-sensitive approaches have been put forth for scaling pointer analysis to large and complex Java programs by applying contexts only to the selected methods while analyzing the remaining ones context-insensitively; however, because the selective approaches do not fundamentally alter the primary methodology of context sensitivity (and do not thus remove its efficiency bottleneck), they produce much improved but still limited results.

In this work, we present a fundamentally different approach called Cut-Shortcut for fast and precise pointer analysis for Java. Its insight is simple: the main effect of cloning methods under different contexts is to filter spurious object flows that have been merged inside a callee method; from the view of a typical pointer flow graph (PFG), such effect can be simulated by cutting off (Cut) the edges that introduce precision loss to certain pointers and adding Shortcut edges directly from source pointers to the target ones circumventing the method on PFG. As a result, we can achieve the effect of context sensitivity without contexts. We identify three general program patterns and develop algorithms based on them to safely cut off and add shortcut edges on PFG, formalize them and formally prove the soundness. To comprehensively validate Cut-Shortcut’s effectiveness, we implement two versions of Cut-Shortcut for two state-of-the-art pointer analysis frameworks for Java, one in Datalog for the declarative Doop and the other in Java for the imperative Tai-e, and we consider all the large and complex programs used in recent literatures that meet the experimental requirements. The evaluation results are extremely promising: Cut-Shortcut is even able to run faster than context insensitivity for most evaluated programs while obtaining high precision that is comparable to context sensitivity (if scalable) in both frameworks. This is for the first time that we have been able to achieve such a good efficiency and precision trade-off for those hard-to-analyze programs, and we hope Cut-Shortcut could offer new perspectives for developing more effective pointer analysis for Java in the future.
Collecting Cyclic Garbage across Foreign Function Interfaces: Who Takes the Last Piece of Cake?
Authors: Yamazaki Tetsuro , Nakamaru Tomoki , Shioya Ryota , Ugawa Tomoharu , Chiba Shigeru
Published: June 2023

A growing number of libraries written in managed languages, such as Python and JavaScript, are bringing about new demand for a foreign language interface (FFI) between two managed languages. Such an FFI allows a host-language program to seamlessly call a library function written in a foreign language and exchange objects. It is often implemented by a user-level library but such implementation cannot reclaim cyclic garbage, or a group of objects with circular references, across the language boundary. This paper proposes
Refgraph GC
, which enables FFI implementation that can reclaim cyclic garbage. Refgraph GC coordinates the garbage collectors of two languages and it needs to modify the managed runtime of one language only. It does not modify that of the other language. This paper discusses the soundness and completeness of the proposed algorithm and also shows the results of the experiments with our implementation of FFI with Refgraph GC. This FFI allows a Ruby program to access a JavaScript library.
Verified Density Compilation for a Probabilistic Programming Language
Authors: Tassarotti Joseph , Tristan Jean-Baptiste
Published: June 2023

This paper presents ProbCompCert, a compiler for a subset of the Stan probabilistic programming language (PPL), in which several key compiler passes have been formally verified using the Coq proof assistant. Because of the probabilistic nature of PPLs, bugs in their compilers can be difficult to detect and fix, making verification an interesting possibility. However, proving correctness of PPL compilation requires new techniques because certain transformations performed by compilers for PPLs are quite different from other kinds of languages. This paper describes techniques for verifying such transformations and their application in ProbCompCert. In the course of verifying ProbCompCert, we found an error in the Stan language reference manual related to the semantics and implementation of a key language construct.
ImageEye: Batch Image Processing using Program Synthesis
Authors: Barnaby Celeste , Chen Qiaochu , Samanta Roopsha , Dillig Işıl
Published: June 2023

This paper presents a new synthesis-based approach for batch image processing. Unlike existing tools that can only apply global edits to the entire image, our method can apply fine-grained edits to individual objects within the image. For example, our method can selectively blur or crop specific objects that have a certain property. To facilitate such fine-grained image editing tasks, we propose a neuro-symbolic domain-specific language (DSL) that combines pre-trained neural networks for image classification with other language constructs that enable symbolic reasoning. Our method can automatically learn programs in this DSL from user demonstrations by utilizing a novel synthesis algorithm. We have implemented the proposed technique in a tool called ImageEye and evaluated it on 50 image editing tasks. Our evaluation shows that ImageEye is able to automate 96% of these tasks.
Responsive Parallelism with Synchronization
Authors: Muller Stefan K. , Singer Kyle , Keeney Devyn Terra , Neth Andrew , Agrawal Kunal , Lee I-Ting Angelina , Acar Umut A.
Published: June 2023

Many concurrent programs assign priorities to threads to improve responsiveness. When used in conjunction with synchronization mechanisms such as mutexes and condition variables, however, priorities can lead to priority inversions, in which high-priority threads are delayed by low-priority ones. Priority inversions in the use of mutexes are easily handled using dynamic techniques such as priority inheritance, but priority inversions in the use of condition variables are not well-studied and dynamic techniques are not suitable.

In this work, we use a combination of static and dynamic techniques to prevent priority inversion in code that uses mutexes and condition variables. A type system ensures that condition variables are used safely, even while dynamic techniques change thread priorities at runtime to eliminate priority inversions in the use of mutexes. We prove the soundness of our system, using a model of priority inversions based on cost models for parallel programs. To show that the type system is practical to implement, we encode it within the type systems of Rust and C++, and show that the restrictions are not overly burdensome by writing sizeable case studies using these encodings, including porting the Memcached object server to use our C++ implementation.
Proving and Disproving Equivalence of Functional Programming Assignments
Authors: Milovančević Dragana , Kunčak Viktor
Published: June 2023

We present an automated approach to verify the correctness of programming assignments, such as the ones that arise in a functional programming course. Our approach takes as input student submissions and reference solutions, and uses equivalence checking to automatically prove or disprove correctness of each submission. To be effective in the context of a real-world programming course, an automated grading system must be both robust, to support programs written in a variety of style, and scalable, to treat hundreds of submissions at once. We achieve robustness by handling recursion using functional induction and by handling auxiliary functions using function call matching. We achieve scalability using a clustering algorithm that leverages the transitivity of equivalence to discover intermediate reference solutions among student submissions. We implement our approach on top of the Stainless verification system, to support equivalence checking of Scala programs. We evaluate our system and its components on over 4000 programs drawn from a functional programming course and from the program equivalence checking literature; this is the largest such evaluation to date. We show that our system is capable of proving program correctness by generating inductive equivalence proofs, and providing counterexamples for incorrect programs, with a high success rate.