Search

The interaction and exchange between local culture and Islamic culture dominate in influencing the social system. This research aims to explore the perspective of Hadith on the Gerudo and Topeng celebrations in Jambi. This research relies on an analytical descriptive method based on collecting library data from various paper and electronic sources and field data through observation and interviews. The researcher then used thematic methods in the takhrīj of hadith, involving the search for hadiths based on sentences related to the topic. In analyzing hadith texts, the researcher has employed a contextual method with comparison approach and has compared them with the opinions of 'ulamā' who are both supportive and critical of these approaches. The key finding of this research is that the taswīr prohibited by the Prophet Muhammad refers to taswīr that contains an 'illah or reason for its prohibition. This prohibition applies to taswīr used as a rival to Allah's creation, for worship, or due to elements in its form that contradict Islam. Therefore, Gerudo and Topeng are not considered prohibited taswīr because current practices no longer embody the reasons for their prohibition. [ABSTRACT FROM AUTHOR]

The article discusses the importance of reproducibility in academic research, particularly in the field of structural engineering. It acknowledges the challenges in achieving reproducibility, such as data storage and computing requirements, as well as proprietary issues. The authors argue for the development of a reproducibility policy in the Journal of Structural Engineering and the Journal of Bridge Engineering, taking into account the nature and culture of research in these subdisciplines. They propose a classification system that emphasizes the availability of data and metadata, and encourage authors to go beyond data availability by making models and other materials accessible. To incentivize research and data availability, the journals will provide a visible recognition badge for papers with open data/models/codes and may consider special recognition for these papers. The authors also outline the review process for data-verified papers, which involves three associate editors verifying the availability and representativeness of the data. [Extracted from the article]

Background Data papers have emerged as a powerful instrument for open data publishing, obtaining credit, and establishing priority for datasets generated in scientific experiments. Academic publishing improves data and metadata quality through peer review and increases the impact of datasets by enhancing their visibility, accessibility, and reusability. Objective We aimed to establish a new type of article structure and template for omics studies: the omics data paper. To improve data interoperability and further incentivize researchers to publish well-described datasets, we created a prototype workflow for streamlined import of genomics metadata from the European Nucleotide Archive directly into a data paper manuscript. Methods An omics data paper template was designed by defining key article sections that encourage the description of omics datasets and methodologies. A metadata import workflow, based on REpresentational State Transfer services and Xpath, was prototyped to extract information from the European Nucleotide Archive, ArrayExpress, and BioSamples databases. Findings The template and workflow for automatic import of standard-compliant metadata into an omics data paper manuscript provide a mechanism for enhancing existing metadata through publishing. Conclusion The omics data paper structure and workflow for import of genomics metadata will help to bring genomic and other omics datasets into the spotlight. Promoting enhanced metadata descriptions and enforcing manuscript peer review and data auditing of the underlying datasets brings additional quality to datasets. We hope that streamlined metadata reuse for scholarly publishing encourages authors to create enhanced metadata descriptions in the form of data papers to improve both the quality of their metadata and its findability and accessibility. [ABSTRACT FROM AUTHOR]

Complications of detrital zircons databases provide a means for statistically analysing a variety of significant geological problems. In this work, we tried to collect a database about the South China Phanerozoic detrital zircon geochronology data. The data statistics of this paper rely on the OneSediment Working Group of The Deep‐time Digital Earth program (DDE). By November 2022, the database contains a total of 699 samples with 55,532 U–Pb ages and 3,770 effective Hf isotope data, from 130 papers. Abundant information including reference title, sample ID, locality, rock type, research institution, GPS coordinates, U–Pb ages, εHf(t) values, etc., have been involved in our database, and all data can be downloaded from DDE Data Publish & Repository website, https://repository.deep‐time.org/. Through the integrated data, we can improve the previous studies and avoid the waste of resources caused by a large number of repeated studies. [ABSTRACT FROM AUTHOR]

Detrital zircon U–Pb chronology database of Precambrian deposits provides a context for the interpretation of the origin and evolution of ancient crust. Here, we tried to summarize the published literature containing detrital zircon U–Pb ages and Hf isotope data of Precambrian deposits in South China and then established a database, which contains details of information, such as reference, sample ID, locality, rock type, research institution, GPS coordinates, U–Pb ages and εHf(t) values. The data statistics of this paper rely on the OneSediment Working Group of The Deep‐time Digital Earth program (DDE). By November 2022, 610 samples with 38,278 U–Pb ages and 8,798 Lu‐Hf isotope data were collected from 136 papers, and these data can be downloaded from DDE Data Publish & Repository website, https://repository.deep‐time.org/. The purpose of the establishment of the dataset is to provide guidance and convenience for the research direction of future generations in South China and to improve the previous studies through the integrated data to avoid the waste of resources caused by a large number of repeated studies. [ABSTRACT FROM AUTHOR]

Stable isotope data have made pivotal contributions to nearly every discipline of the physical and natural sciences. As the generation and application of stable isotope data continues to grow exponentially, so does the need for a unifying data repository to improve accessibility and promote collaborative engagement. This paper provides an overview of the design, development, and implementation of IsoBank (www.isobank.org), a community-driven initiative to create an open-access repository for stable isotope data implemented online in 2021. A central goal of IsoBank is to provide a web-accessible database supporting interdisciplinary stable isotope research and educational opportunities. To achieve this goal, we convened a multi-disciplinary group of over 40 analytical experts, stable isotope researchers, database managers, and web developers to collaboratively design the database. This paper outlines the main features of IsoBank and provides a focused description of the core metadata structure. We present plans for future database and tool development and engagement across the scientific community. These efforts will help facilitate interdisciplinary collaboration among the many users of stable isotopic data while also offering useful data resources and standardization of metadata reporting across eco-geoinformatics landscapes. [ABSTRACT FROM AUTHOR]

This paper focuses on developing effective algorithms for solving a bilevel program. The most popular approach is to replace the lower-level problem with its Karush-Kuhn-Tucker conditions to generate a mathematical program with complementarity constraints (MPCC). However, MPCC does not satisfy the Mangasarian-Fromovitz constraint qualification (MFCQ) at any feasible point. In this paper, inspired by a recent work using the lower-level Wolfe duality (WDP), we apply the lower-level Mond-Weir duality to present a new reformulation, called MDP, for bilevel program. It is shown that, under mild assumptions, they are equivalent in globally or locally optimal sense. An example is given to show that, different from MPCC, MDP may satisfy the MFCQ at its feasible points. Relations among MDP, WDP, and MPCC are investigated. On this basis, we extend the MDP reformulation to present another new reformulation (called eMDP), which has similar properties to MDP. Furthermore, to compare two new reformulations with the MPCC and WDP approaches, we design a procedure to generate 150 tested problems randomly and comprehensive numerical experiments show that MDP has quite evident advantages over MPCC and WDP in terms of feasibility to the original bilevel programs, success efficiency, and average CPU time, whereas eMDP is far superior to all other three reformulations. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: This work was supported by the National Natural Science Foundation of China [Grants 12071280 and 11901380]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0108) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2023.0108). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Nash equilibrium is arguably the most fundamental concept in game theory, which is used to analyze and predict the behavior of the players. In many games, there exist multiple equilibria, with different expected payoffs for the players, which in turn raises the question of equilibrium selection. In this paper, we study the NP -hard problem of identifying a socially optimal Nash equilibrium in two-player normal-form games (called bimatrix games), which may be represented by a mixed integer linear program (MILP). We characterize the properties of the equilibria and develop several classes of valid inequalities accordingly. We use these theoretical results to provide a decomposition-based reformulation of the MILP, which we solve by a branch-and-cut algorithm. Our extensive computational experiments demonstrate superiority of our approach over solving the MILP formulation through feeding it into a commercial solver or through the "traditional" Benders' decomposition. Of note, our proposed approach can find provably optimal solutions for many instances. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms. Funding: This work was supported by the National Institute of Dental and Craniofacial Research [Grant R01DE028283]. The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Institutes of Health. The funding agreements ensured the authors' independence in designing the study, interpreting the data, writing, and publishing the report. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0072) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0072). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

This paper describes a catalog of simultaneous observations of the Earth's magnetosheath by ESA's Cluster and NASA's MMS missions. The catalog is built from a visual inspection of summary plots provided by the two missions complemented by an analysis of high‐resolution magnetic field data. The catalog includes 117 events when Cluster 4 and MMS 4 crossed simultaneously the magnetosheath between January–April, 2017–2021. The dynamical and turbulent features of the magnetosheath are strongly influenced by θBn, the angle between the interplanetary magnetic field (IMF) and the shock normal direction. To facilitate such investigations, we also determine the bow shock geometry for each event based on two different approaches: (a) a minimum variance analysis of in‐situ magnetic field measurements, and (b) a geometrical approach which considers a bow shock model parameterized by OMNI data. A description of spacecraft trajectory during each event is also provided. Additional data describe the relative distances between Cluster 4 and MMS 4, a classification of each event as either quasi‐parallel or quasi‐perpendicular, and the distribution of events per magnetospheric flank. The time intervals for the Cluster ‐ MMS conjunctions are included in the catalog, as well as all associated figures and tables discussed in this paper are made available through an independent online data repository, and can be freely downloaded and used by any interested researcher. Key Points: We use in‐situ measurements from Cluster 4 and MMS 4 to build a catalog/database of simultaneous observations of the Earth's magnetosheathEmpirical models and minimum variance analysis of the magnetic field allow for an estimation of the bow‐shock orientation for each eventWe also provide details on the relative spacecraft position and an analysis of the bow‐shock geometry [ABSTRACT FROM AUTHOR]

We present a new service of Arachnologische Gesellschaft -- data publication in Arachnologische Mitteilungen / Arachnology Letters. A first exemplary dataset is published in this volume. Here we inform about the goals, criteria for acceptance of manuscripts and data, the foreseen editorial procedures, formats, the websites of the digital publication and the data repository ARAMOB used to archive, manage and mobilize the data. [ABSTRACT FROM AUTHOR]

A recent study on the classical capacitated vehicle routing problem (CVRP) introduced an adaptive version of the widely used iterated local search paradigm, hybridized with a path-relinking (PR) strategy. The solution method, called adaptive iterated local search (AILS)-PR, outperformed existing meta-heuristics for the CVRP on benchmark instances. However, tests on large-scale instances suggest that PR is too slow, making AILS-PR less advantageous in this case. To overcome this challenge, this paper presents an AILS combined with mechanisms to handle large CVRP instances, called AILS-II. The computational cost of this implementation is reduced, whereas the algorithm also searches the solution space more efficiently. AILS-II is very competitive on smaller instances, outperforming the other methods from the literature with respect to the average gap to the best-known solutions. Moreover, AILS-II consistently outperforms the state of the art on larger instances with up to 30,000 vertices. History: Accepted by Ted Ralphs, Area Editor for Software Tools. This paper has been accepted for the INFORMS Journal on Computing Special Issue on Software Tools for Vehicle Routing. Funding: This work was supported by the Fundação de Amparo à Pesquisa do Estado de São Paulo [Grants 2013/07375-0, 2019/22067-6, and 2022/05803-3] and the Conselho Nacional de Desenvolvimento Científico e Tecnológico [Grants 309385/2021-0 and 403735/2021-1]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0106) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2023.0106). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

The optimization community has made significant progress in solving vehicle routing problems (VRPs) to optimality using sophisticated branch-cut-and-price (BCP) algorithms. VRPSolver is a BCP algorithm with excellent performance in many VRP variants. However, its complex underlying mathematical model makes it hardly accessible to routing practitioners. To address this, VRPSolverEasy provides a Python interface to VRPSolver that does not require any knowledge of mixed integer programming modeling. Instead, routing problems are defined in terms of familiar elements, such as depots, customers, links, and vehicle types. VRPSolverEasy can handle several popular VRP variants and arbitrary combinations of them. History: Accepted by Ted Ralphs, Area Editor for Software Tools. This paper has been accepted for the INFORMS Journal on Computing Special Issue on Software Tools for Vehicle Routing. Funding: This work was supported by Faperj [Grant E-26/202.887/2017] and Conselho Nacional de Desenvolvimento Científico e Tecnológico [Grant 305684/2022-1]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0103) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2023.0103). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

We introduce PyVRP, a Python package that implements hybrid genetic search in a state-of-the-art vehicle routing problem (VRP) solver. The package is designed for the VRP with time windows (VRPTW) but can be easily extended to support other VRP variants. PyVRP combines the flexibility of Python with the performance of C++ by implementing (only) performance-critical parts of the algorithm in C++ while being fully customizable at the Python level. PyVRP is a polished implementation of the algorithm that ranked first in the 2021 DIMACS VRPTW challenge and, after improvements, ranked first on the static variant of the EURO meets NeurIPS 2022 vehicle routing competition. The code follows good software engineering practices and is well documented and unit tested. PyVRP is freely available under the liberal MIT license. Through numerical experiments, we show that PyVRP achieves state-of-the-art results on the VRPTW and capacitated VRP. We hope that PyVRP enables researchers and practitioners to easily and quickly build on a state-of-the-art VRP solver. History: Accepted by Ted Ralphs, Area Editor for Software Tools. This paper has been accepted for the INFORMS Journal on Computing Special Issue on Software Tools for Vehicle Routing. Funding: Funding was provided by TKI Dinalog, Topsector Logistics, and the Dutch Ministry of Economic Affairs and Climate Policy. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0055) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2023.0055). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. There is a video associated with this paper. Click here to view the Video Overview. To save the file, right click and choose "Save Link As" from the menu. [ABSTRACT FROM AUTHOR]

The classic pump scheduling or optimal water flow (OWF) problem for water distribution networks (WDNs) minimizes the cost of power consumption for a given WDN over a fixed time horizon. In its exact form, the OWF is a computationally challenging mixed-integer nonlinear program (MINLP). It is complicated by nonlinear equality constraints that model network physics, discrete variables that model operational controls, and intertemporal constraints that model changes to storage devices. To address the computational challenges of the OWF, this paper develops tight polyhedral relaxations of the original MINLP, derives novel valid inequalities (or cuts) using duality theory, and implements novel optimization-based bound tightening and cut generation procedures. The efficacy of each new method is rigorously evaluated by measuring empirical improvements in OWF primal and dual bounds over 45 literature instances. The evaluation suggests that our relaxation improvements, model strengthening techniques, and a thoughtfully selected polyhedral relaxation partitioning scheme can substantially improve OWF primal and dual bounds, especially when compared with similar relaxation-based techniques that do not leverage these new methods. History: Accepted by David Alderson, Area Editor for Network Optimization: Algorithms & Applications. Funding: This work was supported by the U.S. Department of Energy (DOE) Advanced Grid Modeling project, Coordinated Planning and Operation of Water and Power Infrastructures for Increased Resilience and Reliability. Incorporation of the PolyhedralRelaxations Julia package was supported by Los Alamos National Laboratory's Directed Research and Development program under the project Fast, Linear Programming-Based Algorithms with Solution Quality Guarantees for Nonlinear Optimal Control Problems [Grant 20220006ER]. All work at Los Alamos National Laboratory was conducted under the auspices of the National Nuclear Security Administration of the U.S. DOE, Contract No. 89233218CNA000001. This work was also authored in part by the National Renewable Energy Laboratory, operated by the Alliance for Sustainable Energy, LLC, for the U.S. DOE, Contract No. DE-AC36-08GO28308. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0233) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0233). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Discrete-event simulation models generate random variates from input distributions and compute outputs according to the simulation logic. The input distributions are typically fitted to finite real-world data and thus are subject to estimation errors that can propagate to the simulation outputs: an issue commonly known as input uncertainty (IU). This paper investigates quantifying IU using the output confidence intervals (CIs) computed from bootstrap quantile estimators. The standard direct bootstrap method has overcoverage due to convolution of the simulation error and IU; however, the brute-force way of washing away the former is computationally demanding. We present two new bootstrap methods to enhance direct resampling in both statistical and computational efficiencies using shrinkage strategies to down-scale the variabilities encapsulated in the CIs. Our asymptotic analysis shows how both approaches produce tight CIs accounting for IU under limited input data and simulation effort along with the simulation sample-size requirements relative to the input data size. We demonstrate performances of the shrinkage strategies with several numerical experiments and investigate the conditions under which each method performs well. We also show advantages of nonparametric approaches over parametric bootstrap when the distribution family is misspecified and over metamodel approaches when the dimension of the distribution parameters is high. History: Accepted by Bruno Tuffin, Area Editor for Simulation. Funding: This work was supported by the National Science Foundation [CAREER CMMI-1834710, CAREER CMMI-2045400, DMS-1854659, and IIS-1849280]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0044) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0044). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

The scientific community has been developing and refining digital data standards to ensure that biodiversity data can be easily exchanged between different databases, systems and institutions. However, scientists still face the challenge of effectively analysing this vast amount of data. Variations in the quality, documentation and availability of metadata often make it difficult for scientists to compile appropriate datasets for their research. One contribution towards this task is the research data repository ARAMOB of the Arachnologische Gesellschaft (AraGes), which focuses on systematically collected data on spider assemblages. Mandatory requirements have been developed to ensure the quality and utility of the data for ecological research during a given project. A next step towards enhancing the data basis for convincing analyses of spider assemblages in Central Europe is the offer to now publish data in the society's open access journal Arachnologische Mitteilungen/Arachnology Letters, which are integrated into the data repository and thus made effectively accessible and usable. These data papers will be presented as one printed page in the journal, accessible on the website of the AraGes and from the BioOne Digital Library, accompanied by a PDF-document containing metadata to effectively use the published data. The original dataset is published as spreadsheet tables, but also deposited in the ARAMOB data repository, which is managed with the modularized database software and virtual research environment Diversity Workbench. By this means, the published data packages are also accessible and analysable within a wider context through the ARAMOB web portal. On request, scientists can also exploit data with the free and well-documented Diversity Workbench software tools. The data pipelines involved are defined in the context of the National Research Data Infrastructure (NFDI). [ABSTRACT FROM AUTHOR]

The majority of available climate data in global digital archives consist of data only from the 1940s or 1950s onwards, and many of these series have gaps and/or are available for only a subset of the variables which were actually observed. However, there exist billions of historical weather observations from the 1700s, 1800s, and early 1900s that are still in hard‐copy form and are at risk of being lost forever due to deterioration. An assessment of changes in climate extremes in several IPCC regions was not possible in IPCC AR6 WGI owing, in many cases, to the lack of available data. One such region is Africa, where the climate impact research and the ability to predict climate change impacts are hindered by the paucity of access to consistent good‐quality historical observational data. The aim of this innovative project was to use classroom‐based participatory learning to help transcribe some of the many meteorological observations from Africa that are thus far unavailable to researchers. This project transcribed quickly and effectively station series by enrolling the help of second‐year undergraduate students at Maynooth University in Ireland. The newly digitized African data will increase the temporal and spatial coverage of data in this important data‐sparse region. Students gained new skills while helping the global scientific community unearth new insight into past African climate. The project managed to transcribe 79 months of data at Andapa in Madagascar and 56 months of data for Macenta in Guinea. The digitized data will be openly and freely shared with the scientific and wider community via the Pangaea data repository, the C3S Climate Data Store, and the National Oceanic and Atmospheric Administration's (NOAA) National Centers for Environmental Information (NCEI) data centre in the US. The project model has the potential for a broader roll‐out to other educational contexts and there is no shortage of data to be rescued. This paper provides details of the project, and all supporting information such as project guidelines and templates to enable other organizations to instigate similar programs. [ABSTRACT FROM AUTHOR]

Background: Lung cancer screening (LCS) using low-dose computed tomography (LDCT) is a strategy for early-stage diagnosis. The implementation of LDCT screening in countries with a high prevalence/incidence of tuberculosis (TB) is controversial. This systematic review and meta-analysis aim to identify whether LCS using LDCT increases early-stage diagnosis and decreases mortality, as well as the false-positive rate, in regions with a high prevalence of TB. Methods/Design: Studies were identified by searching BVS, PUBMED, EMBASE, and SCOPUS. RCT and cohort studies (CS) that show the effects of LDCT in LC screening on mortality and secondary outcomes were eligible. Two independent reviewers evaluated eligibility and a third judged disagreements. We used the Systematic Review Data Repository (SRDR+) to extract the metadata and record decisions. The analyses were stratified by study design and incidence of TB. We used the Cochrane "Risk of bias" assessment tool. Results: The Preferred Reporting Items for Systematic Reviews and Meta-Analysis (PRISMA) were used. Thirty-seven papers were included, referring to 22 studies (10 RCTs and 12 cohorts). Few studies were from regions with a high incidence of TB (One RCT and four cohorts). Nonetheless, the evidence is compatible with European and USA studies. RCTs and CS also had consistent results. There is an increase in early-stage (I-II) diagnoses and reduced LC mortality in the LCDT arm compared to the control. Although false-positive rates varied, they stayed within the 20 to 30% range. Discussion: This is the first meta-analysis of LDCT for LCS focused on its benefits in regions with an increased incidence/prevalence of TB. Although the specificity of Lung-RADS was higher in participants without TB sequelae than in those with TB sequelae, our findings point out that the difference does not invalidate implementing LDCT LCS in these regions. Trial registration: Systematic review registration Systematic review registration PROSPERO CRD42022309581. [ABSTRACT FROM AUTHOR]

In derivative pricing and hedging, the consistency between the price and Greek surfaces (i.e., the Greek surfaces can be obtained by differentiating the price surface) is important in stabilizing the balance sheet and reducing the hedging cost. To build consistent surfaces of the price and Greeks for real-time decisions, we propose to use the gradient-enhanced stochastic kriging method, based on the data collected through extensive simulation experiments conducted when the market is closed. In addition to the naturally guaranteed consistency, we prove that the constructed price and Greek surfaces are more accurate than those constructed separately using stochastic kriging. Besides the consistency between the price and Greeks, we show that the partial differential equation relation between the price and Greeks, implied by the famous Feynman-Kac formula, can also be used to further improve the accuracy of the constructed surfaces. The numerical studies show that our proposed metamodeling methods work well for derivative pricing and hedging. History: Accepted by Bruno Tuffin, Area Editor for Simulation. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72161160340, 72293562, 72121001, 72031006, and 72171060]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0292) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2023.0292). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

In this study, we investigate an appointment sequencing and scheduling problem with heterogeneous user delay tolerances under service time uncertainty. We aim to capture the delay tolerance effect with heterogeneity, in an operationally effective and computationally tractable fashion, for the appointment scheduling problem. To this end, we first propose a Tolerance-Aware Delay (TAD) index that incorporates explicitly the user tolerance information in delay evaluation. We show that the TAD index enjoys decision-theoretical rationale in terms of Tolerance sensitivity, monotonicity, and convexity and positive homogeneity, which enables it to incorporate the frequency and intensity of delays over the tolerance in a coherent manner. Specifically, the convexity of TAD index ensures a tractable modeling of the collective delay dissatisfaction in the appointment scheduling problem. Using the TAD index, we then develop an appointment model with known empirical service time distribution that minimizes the overall tolerance-aware delays of all users. We analyze the impact of delay tolerance on the sequence and schedule decisions and show that the resultant TAD appointment model can be reformulated as a mixed-integer linear program (MILP). Furthermore, we extend the TAD appointment model by considering service time ambiguity. In particular, we encode into the TAD index a moment ambiguity set and a Wasserstein ambiguity set, respectively. The former captures effectively the correlation among service times across positions and user types, whereas the latter captures directly the service time data information. We show that both of the resultant TAD models under ambiguity can be reformulated as polynomial-sized, mixed-integer conic programs (MICPs). Finally, we compare our TAD models with some existing counterpart approaches and the current practice using synthetic data and a case of real hospital data, respectively. Our results demonstrate the effectiveness of the TAD appointment models in capturing the user delay tolerance with heterogeneity and mitigating the worst-case delays. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: S. Wang was supported by the National Natural Science Foundation of China [Grants 71922020, 72171221, and 71988101, entitled "Econometric Modeling and Economic Policy Studies"], the Fundamental Research Funds for the Central Universities [Grant UCAS-E2ET0808X2], and the Major Program of National Natural Science Foundation of China [Grant 72192843]. S. Wang was also supported by a grant from MOE Social Science Laboratory of Digital Economic Forecasts and Policy Simulation at UCAS. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.0025) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2023.0025). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Typically, within facility location problems, fairness is defined in terms of accessibility of users. However, for facilities perceived as undesirable by communities hosting them, fairness between the usage of facilities becomes especially important. Limited research exists on this notion of fairness. To close this gap, we develop a series of optimization models for the allocation of populations of users to facilities such that access for users is balanced with a fair utilization of facilities. The optimality conditions of the underlying nonconvex quadratic models state the precise balance between accessibility and fairness. We define new classes of fairness and a metric to quantify the extent to which fairness is achieved in both optimal and suboptimal allocations. We show that a continuous relaxation of our central model is sufficient to achieve a perfect extent of fairness, while a special case reduces to the classical notion of proportional fairness. Our work is motivated by pervasive ecological challenges faced by the waste management community as policymakers seek to reduce the number of recycling centers in the last few years. As a computational case study, applying our models on data for the state of Bavaria in Germany, we find that even after the closure of a moderate number of recycling centers, large degrees of access can be ensured, provided that the closures are conducted optimally. Fairness, however, is impacted more, with facilities in rural regions shouldering larger loads of visiting populations than those in urban regions. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: Computer resources and support provided by the Erlangen Regional Computing Center are gratefully acknowledged. B. Singh was partially financially supported by the Bavarian State Ministry for Science and Art (Bayerisches Staatsministerium für Wissenschaft und Kunst) under the Competence Network for Scientific High Performance Computing in Bavaria. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0308) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0308). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Customer data acquisition is an important task in data-driven business analytics. Recently, there has been a growing interest in the effective use of an organization's internal customer data, also known as first-party data. This work studies the acquisition of new data for business analytics based on first-party data resource. We address issues related to both acquisition cost and data quality. To reduce acquisition cost, we consider using auction-based methods, such as the generalized second price (GSP) auction, for acquiring data with differential prices for different customers. We find that the GSP-based data acquisition method incurs a lower cost and/or achieves a higher response rate than fixed price methods. To maximize data quality, we propose novel optimization models for different data acquisition methods and data quality measures. The proposed models maximize the quality of the acquired data while satisfying budget constraints. We derive and discuss the solutions to the optimization models analytically and provide managerial insights from the solutions. The proposed approach is effective in increasing customer responses, reducing selection bias, and enabling more accurate estimation and prediction for business analytics. The results of the experimental evaluation demonstrate the advantage of the proposed approach over existing data acquisition methods. History: Accepted by Ram Ramesh, Area Editor for Data Science and Machine Learning. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0037) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0037). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

The article analyzes the technological development in the historical discipline over time, focusing on the organization of archives and information processing. The author uses her own research on Jewish history in Mexico to demonstrate the usefulness of digital tools and digital humanities in historical research. In addition, the impact of Mexico's vote in favor of the UN resolution condemning Zionism is examined, including the demonstrations and tourist boycott that occurred in the United States. This episode had a significant effect on the relationship between the Jewish community and the government in Mexico. The text presents the experience of a historian in their research and the use of technological resources to gather and process information. The author highlights the importance of managing and classifying archives, as well as accessing online sources of information. It also mentions the evolution of historical research methods over time, from the use of cards and index cards to the development of more sophisticated card cabinets and classification systems. The article emphasizes the influence of these methods on the final outcome of historical research. The article discusses the use of index cards as a tool for organizing information in historical research. It is mentioned that Carl Linnaeus invented index cards in the 1760s and that they were used by naturalists, bibliographers, and historians. The archivist Daunou was one of the first to use index cards in archives, seeking to impose uniformity in the collected information. Although there were disadvantages to this method, such as a lack of progress in understanding historical facts, his methods laid the foundations for modern Western history. Despite some historians' reluctance to use digital technology, tools such as word processors are widely used. A study shows that although there have been changes in research practices, there is still a limitation in the use of digital tools to open new areas of research. The article analyzes the adoption of digital tools by historians. According to a survey, the majority of historians use library-backed databases, online archives, and digital cameras. However, there is a lack of adoption of other types of software and tools. Resistance to adopting new technologies is due to a lack of institutional support, the reluctance of more experienced historians, and a perceived lack of usefulness. Lack of time to learn new technologies is also an obstacle. The article highlights the importance of primary and secondary sources available online and how digital tools facilitate the handling of collected information. The article discusses the importance of using digital tools in historical research. The author mentions using Google Translate to translate communications from Ambassador Jova and other members of the US Foreign Service. It also highlights the usefulness of searching for newspaper sources online and warns about the need to be cautious of false information online. The author mentions the SuperNotecard program as an effective tool for organizing and transcribing information virtually. Additionally, other options such as Zotero, DEVONthink, and OneNote are mentioned. The use of digital cards allows for efficient manipulation and organization of information. The author highlights the ease of access to online archives and the ability to accumulate a large amount of data. The portability of the digital file is also mentioned as an advantage. The author concludes that there is no correct way to use these tools and that it is possible to combine digital and paper systems according to the needs of each project. The article discusses the importance of using digital tools in historical research. Different programs and platforms are mentioned, such as SuperNotecard, DEVONthink, OneNote, and Zotero, which can help historians manage sources and organize citations. The need to take precautions when working with digital files, such as making backups, is also highlighted. [Extracted from the article]

Developing and executing large-scale data analysis applications in parallel and distributed environments can be a complex and time-consuming task. Developers often find themselves diverted from their application logic to handle technical details about the underlying runtime and related issues. To simplify this process, ParSoDA, a Java library, has been proposed to facilitate the development of parallel data mining applications executed on HPC systems. It simplifies the process by providing built-in scalability mechanisms relying on the Hadoop and Spark frameworks. This paper presents ParSoDA-Py, the Python version of the ParSoDA library, which allows for further support of commonly used runtimes and libraries for big data analysis. After a complete library redesign, ParSoDA can be now easily integrated with other Python-based distributed runtimes for HPC systems, such as COMPSs and Apache Spark, and with the large ecosystem of Python-based data processing libraries. The paper discusses the adaptation process, which takes into consideration the new technical requirements, and evaluates both usability and scalability through some case study applications. [ABSTRACT FROM AUTHOR]

This paper considers the problem of finding maximum volume (axis-aligned) inscribed boxes in a compact convex set, defined by a finite number of convex inequalities, and presents optimization and geometric approaches for solving them. Several optimization models are developed that can be easily generalized to find other inscribed geometric shapes such as triangles, rhombi, and squares. To find the largest volume axis-aligned inscribed rectangles in the higher dimensions, an interior-point method algorithm is presented and analyzed. For two-dimensional space, a parametrized optimization approach is developed to find the largest area (axis-aligned) inscribed rectangles in convex sets. The optimization approach provides a uniform framework for solving a wide variety of relevant problems. Finally, two computational geometric (1−ε) –approximation algorithms with sublinear running times are presented that improve the previous results. History: Accepted by Antonio Frangioni, Area Editor for Design & Analysis of Algorithms—Continuous. Funding: The author is grateful for the support of Northeastern University for this research. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0239) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0239). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

This paper studies a distributionally robust multi-item newsvendor problem, where the demand distribution is unknown but specified with a general event-wise ambiguity set. Using the event-wise affine decision rules, we can obtain a conservative approximation formulation of the problem, which can typically be further reformulated as a linear program. In order to efficiently solve the resulting large-scale linear program, we develop a column generation-based decomposition scheme and speed up the computational efficiency by exploiting a special column selection strategy and stopping early based on a Karush-Kuhn-Tucker condition test. Focusing on the Wasserstein ambiguity set and the event-wise mean absolute deviation set, a computational study demonstrates both the computational efficiency of the proposed algorithm, which significantly outperforms a commercial solver and a Benders decomposition method, and the out-of-sample superiority of distributionally robust solutions relative to their sample average approximation counterparts. History: Accepted by Nicola Secomandi, Area Editor for Stochastic Models & Reinforcement Learning. Funding: This work was supported by the Natural Sciences and Engineering Research Council of Canada [492997-2016, RGPIN-2016-05208], the National Natural Science Foundation of China [71972012], Alliance de recherche numérique du Canada, and Canada Research Chairs [CRC-2018-00105]. It was also supported by Groupe d'études et de recherche en analyse des décisions (GERAD). Finally, this research was enabled in part by support provided by Digital Research Alliance of Canada (https://alliancecan.ca/en). Supplemental Material: The software that supports the findings of this study is available within the paper and its supplemental information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0010) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0010). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

From July 2022 to December 2022, the World Data System (WDS) International Technology (ITO) and International Program (IPO) Offices conducted a review of strategic plans and technical roadmaps of all current WDS members and the set of Canadian repositories that participated in the Digital Research Alliance of Canada's CoreTrustSeal Certification Support and Funding Pilotv (Digital Research Alliance of Canada, 2022). In this paper, we describe how a new organizational assessment method was designed and utilized to identify the needs and challenges faced by the WDS and Canadian CTS Pilot members. Our method relied on reviewing public-facing documentation provided by the repositories, with a priority on strategic plans and technical road maps. In total, we reviewed 95 sources of information, including 33 strategic plans and 3 technical roadmaps describing a total of 95 out of the original 147 target organizations. In this paper, we also describe our assessment tool and the overarching challenges and goals we identified through the usage of this tool. Finally, we will describe the limitations of our methodology and provide recommendations from the World Data System on how best to assist the WDS members and the cohort of Canadian data repositories based on our findings. [ABSTRACT FROM AUTHOR]

This paper gives an overview over all currently available data sets for the European Long-term Ecosystem Research (eLTER) monitoring site Gesäuse-Johnsbachtal. The site is part of the eLTSER platform Eisenwurzen in the Alps of the province of Styria, Austria. It contains both protected (National Park Gesäuse) and non-protected areas (Johnsbachtal). Although the main research focus of the eLTER monitoring site Gesäuse-Johnsbachtal is on inland surface running waters, forests and other wooded land, the eLTER whole system (WAILS) approach was followed in regard to the data selection, systematically screening all available data in regard to its suitability as eLTER's Standard Observations (SOs). Thus, data from all system strata was included, incorporating Geosphere, Atmosphere, Hydrosphere, Biosphere and Sociosphere. In the WAILS approach these SOs are key data for a whole system approach towards long term ecosystem research. Altogether, 54 data sets have been collected for the eLTER monitoring site Gesäuse-Johnsbachtal and included in the Dynamical Ecological Information Management System – Site and Data Registry (DEIMS-SDR), which is the eLTER data platform. The presented work provides all these data sets through dedicated data repositories for FAIR use. This paper gives an overview on all compiled data sets and their main properties. Additionally, the available data is evaluated in a concluding gap analysis with regard to the needed observation data according to WAILS, followed by an outlook on how to fill these gaps. [ABSTRACT FROM AUTHOR]

This paper focuses on the cardinality constrained mean-variance portfolio optimization, in which only a small number of assets are invested. We first treat the covariance matrix of asset returns as a diagonal matrix with a special matrix processing technique. Using the dual theory, we formulate the lower bound problem of the original problem as a max-min optimization. For the inner minimization problem with the cardinality constraint, we obtain its analytical solution for the portfolio weights. Then, the lower bound problem turns out to be a simple concave optimization with respect to the Lagrangian multipliers. Thus, the interval split method and the supergradient method are developed to solve it. Based on the precise lower bound, the depth-first branch and bound method are designed to find the global optimal investment selection strategy. Compared with other lower bounds and the current popular mixed integer programming solvers, such as CPLEX and SCIP, the numerical experiments show that our method has a high searching efficiency. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: This work was supported by the National Natural Science Foundation of China [Grants 12101317, 12271071, and 11991024], the Natural Science Foundation of Jiangsu Province [Grant BK20200819], the Team Project of Innovation Leading Talent in Chongqing [Grant CQYC20210309536], the Contract System Project of Chongqing Talent Plan [Grant cstc2022ycjh-bgzxm0147], and the Philosophy and Social Science Fund of Education Department of Jiangsu Province [Grant 2020SJA0168]. K.F.C. Yiu is supported in part by the Research Grants Council of Hong Hong [Grant PolyU 15223419], the Hong Kong Polytechnic University [Grants 4-ZZPT and 1-WZ0E], and the Research Centre for Quantitative Finance [Grant 1-CE03]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0344) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0344). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

In this paper, we present BilevelJuMP.jl, a new Julia package to support bilevel optimization within the JuMP framework. The package is a Julia library that enables the user to describe both upper and lower-level optimization problems using the JuMP algebraic syntax. Because of the generality and flexibility that our library inherits from JuMP's syntax, our package allows users to model bilevel optimization problems with conic constraints in the lower level and all constraints supported by JuMP in the upper level including conic, quadratic, and nonlinear constraints. Moreover, the models defined with the syntax from BilevelJuMP.jl can be solved by multiple techniques that are based on reformulations as mathematical programs with equilibrium constraints (MPEC). Manipulations on the original problem data are possible due to MathOptInterface.jl's structures and Dualization.jl features. Hence, the proposed package allows quick modeling, deployment, and thereby experimenting with bilevel models based on off-the-shelf mixed-integer linear programming and nonlinear solvers. History: Accepted by Ted Ralphs, Area Editor for Software Tools. Funding: The authors were partially supported by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001. The work of A. Street was also partially supported by Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro (FAPERJ) and Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq). The work was partially funded by the project P&D ANEEL PD-00403-0050/2020 sponsored by ENGIE BRASIL ENERGIA S.A. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0135) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0135). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Given the abundance of images related to operations that are being captured and stored, it behooves firms to innovate systems using image processing to improve operational performance that refers to any activity that can save labor cost. In this paper, we use deep learning techniques, combined with classic image/signal processing methods, to propose a pipeline to solve certain types of object counting and layer characterization problems in firm operations. Using data obtained by us through a collaborative effort with real manufacturers, we demonstrate that the proposed pipeline method is able to achieve higher than 93% accuracy in layer and log counting. Theoretically, our study conceives, constructs, and evaluates proof of concept of a novel pipeline method in characterizing and quantifying the number of defined items with images, which overcomes the limitations of methods based only on deep learning or signal processing. Practically, our proposed method can help firms significantly reduce labor costs and/or improve quality and inventory control by recording the number of products in real time, more accurately and with minimal up-front technological investment. The codes and data are made publicly available online through the INFORMS Journal on Computing GitHub site. History: Accepted by Ram Ramesh, Area Editor for Data Science and Machine Learning. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0260) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0260). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Chemotherapy drug administration is a complex problem that often requires expensive clinical trials to evaluate potential regimens; one way to alleviate this burden and better inform future trials is to build reliable models for drug administration. This paper presents a mixed-integer program for combination chemotherapy (utilization of multiple drugs) optimization that incorporates various important operational constraints and, besides dose and concentration limits, controls treatment toxicity based on its effect on the count of white blood cells. To address the uncertainty of tumor heterogeneity, we also propose chance constraints that guarantee reaching an operable tumor size with a high probability in a neoadjuvant setting. We present analytical results pertinent to the accuracy of the model in representing biological processes of chemotherapy and establish its potential for clinical applications through a numerical study of breast cancer. History: Accepted by Paul Brooks, Area Editor for Applications in Biology, Medicine, & Healthcare. Funding: This work was supported by the National Science Foundation [Grants CMMI-1933369 and CMMI-1933373]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0207) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0207). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

A gray market emerges when some distributors divert products to unauthorized distributors/retailers to make sneaky profits from the manufacturers' differential channel incentives, such as quantity discounts. Traditionally, manufacturers rely heavily on internal audits to periodically investigate the flows of products and funds so as to deter the gray market; however, this is too costly given the large number of distributors and their huge volumes of orders. Owing to the advances in data analytics techniques, the ordering quantities of a distributor over time, which form multivariate time series, can help reveal suspicious product diversion behaviors and narrow the audit scope drastically. To that end, in this paper, we build on the recent advancement of representation learning for time series and adopt a sequence autoencoder to automatically characterize the overall demand patterns. To cope with the underlying entangled factors and interfering information in the multivariate time series of ordering quantities, we develop a disentangled learning scheme to construct more effective sequence representations. An interdistributor correlation regularization is also proposed to ensure more reliable representations. Finally, given the highly scarce anomaly labels for the detection task, an unsupervised deep generative model based on the learned representations of the distributors is developed to estimate the densities of distributions, which enables the anomaly scores generated through end-to-end learning. Extensive experiments on a real-world distribution channel data set and a larger simulated data set empirically validate our model's superior and robust performances compared with several state-of-the-art baselines. Additionally, our illustrative economic analysis demonstrates that the manufacturers can launch more targeted and cost-effective audits toward the suspected distributors recommended by our model so as to deter the gray market. History: Accepted by Ram Ramesh, Area Editor for Data Science & Machine Learning. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72031001, 72301017, 72371011, and 72242101]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0155) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0155). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

The concept of proper equilibrium was established as a strict refinement of perfect equilibrium. This establishment has significantly advanced the development of game theory and its applications. Nonetheless, it remains a challenging problem to compute such an equilibrium. This paper develops a differentiable path-following method with a compact formulation to compute a proper equilibrium. The method incorporates square-root-barrier terms into payoff functions with an extra variable and constitutes a square-root-barrier game. As a result of this barrier game, we acquire a smooth path to a proper equilibrium. To further reduce the computational burden, we present a compact formulation of an ε-proper equilibrium with a polynomial number of variables and equations. Numerical results show that the differentiable path-following method is numerically stable and efficient. Moreover, by relaxing the requirements of proper equilibrium and imposing Selten's perfection, we come up with the notion of perfect d-proper equilibrium, which approximates a proper equilibrium and is less costly to compute. Numerical examples demonstrate that even when d is rather large, a perfect d-proper equilibrium remains to be a proper equilibrium. History: Accepted by Antonio Frangioni, Area Editor for Design & Analysis of Algorithms-Continuous. Funding: This work was partially supported by General Research Fund (GRF) CityU 11306821 of Hong Kong SAR Government. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0148) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0148). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

In recent years, there has been an increasing need to understand the complex interdependencies between critical infrastructure systems, for example, electric power, natural gas, and potable water. Whereas open-source and commercial tools for the independent simulation of these systems are well established, frameworks for cosimulation with other systems are nascent and tools for co-optimization are scarce—the major challenge being the hidden combinatorics that arise when connecting multiple-infrastructure system models. Building toward a comprehensive solution for modeling interdependent infrastructure systems, this work presents InfrastructureModels, an extensible, open-source mathematical programming framework for co-optimizing multiple interdependent infrastructures. This work provides new insights into methods and programming abstractions that make state-of-the-art independent infrastructure models composable with minimal additional effort. To that end, this paper presents the design of the InfrastructureModels framework, documents key components of the software's implementation, and demonstrates its effectiveness with three case studies on canonical co-optimization tasks arising in interdependent infrastructure systems. History: Accepted by Ted Ralphs, Area Editor for Software Tools. Funding: The work was funded by Los Alamos National Laboratory's Directed Research and Development project "The Optimization of Machine Learning: Imposing Requirements on Artificial Intelligence" and the U.S. Department of Energy's Office of Electricity Advanced Grid Modeling projects "Joint Power System and Natural Gas Pipeline Optimal Expansion Planning" and "Coordinated Planning and Operation of Water and Power Infrastructures for Increased Resilience and Reliability." This work was carried out under the U.S. DOE contract no. [DE-AC52-06NA25396]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0118) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0118). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Rank aggregation combines the preference rankings of multiple alternatives from different voters into a single consensus ranking, providing a useful model for a variety of practical applications but posing a computationally challenging problem. In this paper, we provide an effective hybrid evolutionary ranking algorithm to solve the rank aggregation problem with both complete and partial rankings. The algorithm features a semantic crossover based on concordant pairs and an enhanced late acceptance local search method reinforced by a relaxed acceptance and replacement strategy and a fast incremental evaluation mechanism. Experiments are conducted to assess the algorithm, indicating a highly competitive performance on both synthetic and real-world benchmark instances compared with state-of-the-art algorithms. To demonstrate its practical usefulness, the algorithm is applied to label ranking, a well-established machine learning task. We additionally analyze several key algorithmic components to gain insight into their operation. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by the National Natural Science Foundation of China [Grant 72371157] and Shanghai Pujiang Programme [Grant 23PJC069]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0019) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2022.0019). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Sample average approximation (SAA), the standard approach to stochastic mixed-integer programming, does not provide guidance for cases with limited computational budgets. In such settings, variance reduction is critical in identifying good decisions. This paper explores two closely related ensemble methods to determine effective decisions with a probabilistic guarantee. (a) The first approach recommends a decision by coordinating aggregation in the space of decisions as well as aggregation of objective values. This combination of aggregation methods generalizes the bagging method and the "compromise decision" of stochastic linear programming. Combining these concepts, we propose a stopping rule that provides an upper bound on the probability of early termination. (b) The second approach applies efficient computational budget allocation for objective function evaluation and contributes to identifying the best solution with a predicted lower bound on the probability of correct selection. It also reduces the variance of the upper bound estimate at optimality. Furthermore, it adaptively selects the evaluation sample size. Both approaches provide approximately optimal solutions even in cases with a huge number of scenarios, especially when scenarios are generated by using oracles/simulators. Finally, we demonstrate the effectiveness of these methods via extensive computational results for "megascale" (extremely large scale) stochastic facility location problems. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis. Funding: This work was supported by The Office of Naval Research [Grant N00014-20-1-2077] and the Air Force Office of Scientific Research [Grant FA9550-20-1-0006]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0324) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2021.0324). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

Ride-hailing services have expanded the role of shared mobility in passenger transportation systems, creating new markets and creative planning solutions for major urban centers. In this paper, we consider their use for the first-mile or last-mile passenger transportation in coordination with a mass transit service to provide a seamless multimodal transportation experience for the user. A system that provides passengers with predictable information on travel and waiting times in their commutes is immensely valuable. We envision that the passengers will inform the system of their desired travel and arrival windows so that the system can jointly optimize the schedules of passengers. The problem we study balances minimizing travel time and the number of trips taken by the last-mile vehicles, so that long-term planning, maintenance, and environmental impact are all taken into account. We focus on the case where the last-mile service aggregates passengers by destination. We show that this problem is NP-hard, and we propose a decision diagram–based branch-and-price decomposition model that can solve instances of real-world size (10,000 passengers spread over an hour, 50 last-mile destinations, 600 last-mile vehicles) in computational time (∼1 minute) that is orders of magnitude faster than the solution times of other methods appearing in the literature. Our experiments also indicate that aggregating passengers by destination on the last-mile service provides high-quality solutions to more general settings. History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods and Analysis. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2019.0163) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2019.0163). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

The number of studies investigating the effects of ocean acidification on marine organisms and communities increases every year. Results are not easily comparable since the carbonate chemistry and ancillary data are not always reported in similar units and scales and are not calculated using similar sets of constants. To facilitate data comparison, a data compilation hosted by the PANGAEA Data Publisher was initiated in 2008 and is updated on a regular basis (10.1594/PANGAEA.962556; Ocean Acidification International Coordination Centre (OA-ICC), 2023). By November 2023, a total of 1501 datasets (over 25 million data points) from 1554 papers had been archived. To easily filter and access relevant biological response data from this compilation, a user-friendly portal (https://oa-icc.ipsl.fr , last access: 9 November 2023) was launched in 2018. Here, we present an update of this data compilation since its second description by Yang et al. (2016) and provide an overview of the OA-ICC portal for ocean acidification biological response data, launched in 2018. Most of the study sites from which data have been archived are in the North Atlantic Ocean, North Pacific Ocean, South Pacific Ocean, and Mediterranean Sea, while polar oceans are still relatively poorly represented. Mollusca and Cnidaria are still the best-represented taxonomic groups. The biological processes most reported in the datasets are growth and morphology. Other variables that can potentially be affected by ocean acidification and are often reported include calcification/dissolution, primary production/photosynthesis, and biomass/abundance. The majority of the compiled datasets have considered ocean acidification as a single stressor, but their relative contribution has decreased from 68 % before 2015 to 57 % today, showing a clear tendency towards more data archived from multifactorial studies. [ABSTRACT FROM AUTHOR]

Monitoring the health of lithium batteries is a crucial undertaking in ensuring the safe and dependable functioning of electric vehicles. Data‐driven methods have been proved to be an effective method for identifying the complex degradation process of batteries. To augment the precision of predicting the remaining useful life (RUL), this paper introduces a pioneering architecture for a denoising autoencoder (DAE). This architecture integrates a stacked convolutional neural network with subsequent layers of bidirectional gated recurrent units within an encoder–decoder framework. The utilization of the DAE network is employed as a means to effectively capture and represent the intricate and nonlinear knowledge associated with degradation data acquired from measured sources. Simultaneously, the reconstruction loss is incorporated into the total loss to improve the accuracy and generalization of the prediction model. The efficacy of the proposed approach is substantiated through the utilization of data sets sourced from the NASA Ames Prognostics Data Repository. The comparative findings suggest that the proposed approach demonstrates an exceptional ability to achieve precise and robust estimation in predicting the RUL, surpassing other advanced methodologies. [ABSTRACT FROM AUTHOR]

Dynamic stochastic matching problems arise in a variety of recent applications, ranging from ridesharing and online video games to kidney exchange. Such problems are naturally formulated as Markov decision processes (MDPs) that are, however, intractable in general. To improve tractability, we investigate the linear programming-based approach to approximate dynamic programming. This approach can provide both feasible control policies and bounds on the MDPs' optimal policy value, which can be used to establish optimality gaps. However, the approximate linear programs (ALPs) resulting from this approach can often be difficult to solve. To address this computational challenge, we derive novel ALP reformulations that can be used for a broad class of dynamic stochastic matching problems that incorporate, among others, possible match failures and certain restrictions on feasible matchings. We show that these ALP reformulations can be solved efficiently and applied to a broad class of dynamic matching problems. In addition, our numerical results indicate that our ALP reformulations can produce tight bounds that allow us to establish near-optimal policy performance for a broad set of problem instances. Thus, ALP reformulations can present an attractive alternative for applications that involve dynamic stochastic matching. History: Accepted by Nicola Secomandi, Area Editor for Stochastic Models & Reinforcement Learning. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0203) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2021.0203). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

We present an ice-penetrating radar data set acquired over the Greenland ice sheet by aircraft during the years 1971, 1972, 1974, 1978, and 1979. The data set comprises over 177 000 km of flight lines and contains a wealth of information on the state of the Greenland ice sheet, including information on ice thickness and englacial properties. During data collection in the 1970s, the data were recorded on optical film rolls, and in this paper, we document the digitization of these film rolls and their associated geographical information. Our data digitization enables interaction with and analysis of the data and facilitates comparison with modern-day radar observations. The complete data set in full resolution is available in the Stanford Digital Repository (10.25740/wm135gp2721;), with the associated technical reports. Part of the data set is available as low-resolution JPG files at the Technical University of Denmark's data repository (10.6084/m9.figshare.c.7235299.v1;), with associated technical reports and digitized geographical information. The Stanford Digital Repository serves as long-term storage, providing archival historic preservation in perpetuity, and is not intended as a primary data access point. The Technical University of Denmark (DTU) data repository serves as a primary entry point for data access, with files organized according to acquisition year and flight line in a simple folder structure. Here, we release the full data sets to enable the larger community to access and interact with the data. [ABSTRACT FROM AUTHOR]

An ever-increasing amount of data on a person's daily functioning is being collected, which holds information to revolutionize person-centered healthcare. However, the full potential of data on daily functioning cannot yet be exploited as it is mostly stored in an unstructured and inaccessible manner. The integration of these data, and thereby expedited knowledge discovery, is possible by the introduction of functionomics as a complementary 'omics' initiative, embracing the advances in data science. Functionomics is the study of high-throughput data on a person's daily functioning, that can be operationalized with the International Classification of Functioning, Disability and Health (ICF). A prerequisite for making functionomics operational are the FAIR (Findable, Accessible, Interoperable, and Reusable) principles. This paper illustrates a step by step application of the FAIR principles for making functionomics data machine readable and accessible, under strictly certified conditions, in a practical example. Establishing more FAIR functionomics data repositories, analyzed using a federated data infrastructure, enables new knowledge generation to improve health and person-centered healthcare. Together, as one allied health and healthcare research community, we need to consider to take up the here proposed methods. [ABSTRACT FROM AUTHOR]

Dynamic liquid level monitoring and measurement in oil wells is essential in ensuring the safe and efficient operation of oil extraction machinery and formulating rational extraction policies that enhance the productivity of oilfields. This paper presents an intelligent infrasound-based measurement method for oil wells' dynamic liquid levels; it is designed to address the challenges of conventional measurement methods, including high costs, low precision, low robustness and inadequate real-time performance. Firstly, a novel noise reduction algorithm is introduced to effectively mitigate both periodic and stochastic noise, thereby significantly improving the accuracy of dynamic liquid level detection. Additionally, leveraging the PyQT framework, a software platform for real-time dynamic liquid level monitoring is engineered, capable of generating liquid level profiles, computing the sound velocity and liquid depth and visualizing the monitoring data. To bolster the data storage and analytical capabilities, the system incorporates an around-the-clock unattended monitoring approach, utilizing Internet of Things (IoT) technology to facilitate the transmission of the collected dynamic liquid level data and computed results to the oilfield's central data repository via LoRa and 4G communication modules. Field trials on dynamic liquid level monitoring and measurement in oil wells demonstrate a measurement range of 600 m to 3000 m, with consistent and reliable results, fulfilling the requirements for oil well dynamic liquid level monitoring and measurement. This innovative system offers a new perspective and methodology for the computation and surveillance of dynamic liquid level depths. [ABSTRACT FROM AUTHOR]

Industrial control terminals play an important role in industrial control scenarios. Due to the special nature of industrial control networks, industrial control terminal systems are vulnerable to malicious attacks, which can greatly threaten the stability and security of industrial production environments. Traditional security protection methods for industrial control terminals have coarse detection granularity, and are unable to effectively detect and prevent attacks, lacking real-time responsiveness to attack events. Therefore, this paper proposes a real-time dynamic credibility evaluation mechanism based on program behavior, which integrates the matching and symmetry ideas of credibility evaluation. By conducting a real-time dynamic credibility evaluation of function call sequences and system call sequences during program execution, the credibility of industrial control terminal application program behavior can be judged. To solve the problem that the system calls generated during program execution are unstable and difficult to measure, this paper proposes a partition-based dynamic credibility evaluation method, dividing program behavior during runtime into function call behavior and system call behavior within function intervals. For function call behavior, a sliding window-based function call sequence benchmark library construction method is proposed, which matches and evaluates real-time measurement results based on the benchmark library, thereby achieving symmetry between the benchmark library and the measured data. For system call behavior, a maximum entropy system call model is constructed, which is used to evaluate the credibility of system call sequences. Experiment results demonstrate that our method performs better in both detection success rate and detection speed compared to the existing methods. [ABSTRACT FROM AUTHOR]

LU and Cholesky matrix factorization algorithms are core subroutines used to solve systems of linear equations (SLEs) encountered when solving an optimization problem. Standard floating-point algorithms are highly efficient but remain susceptible to the accumulation of round-off errors, which can lead solvers to return feasibility and optimality claims that are actually invalid. This paper introduces a novel direct solution approach for solving sequences of closely related SLEs encountered in nonlinear programming efficiently and without round-off errors. Specifically, it introduces rank-one update algorithms for the round-off error–free factorization framework, a tool set built on integer-preserving arithmetic that has led to the development and implementation of extremely reliable subroutines for solving SLEs occurring in linear programming. The formal guarantees of the presented algorithms are established through the derivation of theoretical insights. Their advantages are supported with computational experiments, which demonstrate upward of 75× improvements over exact factorization runtimes on fully dense matrices with more than one million entries. A significant advantage of the featured integer-preserving framework is that the length of any matrix coefficient produced by its algorithms is bounded polynomially in the size of the inputs without having to resort to greatest common divisor operations, which are required by and thereby hinder an efficient implementation of exact rational arithmetic approaches. History: Accepted by Antonio Frangioni, Area Editor for Design & Analysis of Algorithms–Continuous. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0331) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2021.0331). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/. [ABSTRACT FROM AUTHOR]

The recent and significant change in the architecture, engineering, and construction (AEC) industry is the increasing use of building information management (BIM) tools in design and how the generated digital data are consumed. Although designers have primarily published blueprints and model files, multiple parties are now involved in producing different aspects of the data and may be consuming data produced by others. This evolution has created new challenges in sharing and synchronizing information across organizational boundaries. Linked building data is a community effort identified as a potential means of overcoming the barriers to data interoperability. In this paper, we present how the industry can be strengthened using a peer-to-peer network based on the InterPlanetary File System (IPFS) framework to address the typical availability problems of web-based data. The paper particularly presents how Linked Data serialization of the Industry Foundation Classes (IFC) standard can be used in the context of IPFS and benchmarks the performance for the publication of models between IPFS versus HTTP protocol. We show that linked building data—in particular, IFC models converted into Resource Description Format (RDF) graphs according to the ifcOWL ontology—can be implemented using the framework, with initial indications of significant benefits of a peer-to-peer network in terms of performance, offline access, and immutable version history. Two use cases in distributed collaborative environments in the AEC/facility management (FM) sector using evolving multidomain models are used to evaluate the work. In a construction project, stakeholders must collaborate and share design data models for efficient and safe completion. Building information published using Linked Data techniques aims to facilitate data sharing between interested parties without a central intermediary. However, the challenges of Linked Data stem from using web protocols, resulting in limited availability, suboptimal performance, broken links, and lost history. This study explores using the InterPlanetary File System (IPFS), a communication protocol for computers to communicate with each other directly without needing an intermediary. It addresses issues related to data availability on the web and data-transfer performance. The study demonstrates the suitability of IPFS in addressing the challenges of sharing building data. The data are available even when the original publisher host is down. In addition, the content-based addressing provides a digital fingerprint that can ensure authenticity and uniqueness, eliminating the data's duplication. Therefore, it minimizes the storage space consumed by data backups and archives. However, because IPFS addresses and communication principles are incompatible with the Linked Data standard approach, we designed a way so that the construction data saved in IPFS can be accessed transparently as a part of the standard Linked Data network. [ABSTRACT FROM AUTHOR]