Generalized shogi and chess are constant-time testable

Constant-time algorithms are powerful tools, since they run by reading only a constant-sized part of each input. Property testing is the most popular research framework for constant-time algorithms. In property testing, an algorithm determines whether a given instance satisfies some predetermined property or is far from satisfying the property with high probability by reading a constant-sized part of the input. A property is said to be testable if there is a constant-time testing algorithm for the property. This chapter covers property testing on graphs and games. The fields of graph algorithms and property testing are two of the main streams of research on discrete algorithms and computational complexity. In the section on graphs in this chapter, we present some important results, particularly on the characterization of testable graph properties. At the end of the section, we show results that we published in 2020 on a complete characterization (necessary and sufficient condition) of testable monotone or hereditary properties in the bounded-degree digraphs. In the section on games, we present results that we published in 2019 showing that the generalized chess, Shogi (Japanese chess), and Xiangqi (Chinese chess) are all testable. We believe that this is the first results for testable EXPTIME-complete problems.

The testing of fail-safe software in implantable devices, such as microprocessor-controlled pacemakers, requires special testing techniques. By properly utilizing these testing techniques to verify and debug software-controlled life-supporting devices, a project has a higher probability that a program contains no encoding or design errors, and its team members have a higher degree of confidence in the fail-safe operation of the device. The testing techniques define team members, testing algorithms, and proper protocol when a problem occurs. >

An approach for Trojan circuit detection in a finite state machine is presented. It is based on a model where long sequences of inputs that are applied to the system in the functional mode can detect if Trojan hardware is triggered with high probability. An efficient and scalable input generation algorithm for broadside tests is introduced.

Nanowire addressing with randomized-contact decoders

10589 Background: Germline and somatic genetic testing are established tools for the management of cancer patients. Somatic testing is primarily used to inform therapy and germline testing is used to diagnose hereditary cancer predisposition syndromes. While somatic testing can detect germline variants, the interpretation and reporting algorithms are optimized to predict therapeutic efficacy. As a result, germline variants may be missed or only interpreted in context of their potential to act as a therapeutic target. We retrospectively reviewed a series of patients who received both germline and somatic testing to examine the opportunities for concurrent germline testing to improve somatic reporting. Methods: Our study reviewed data from 43 patients with solid cancer diagnoses who were otherwise unselected and underwent testing with a 435-gene somatic genetic test and an 83-gene germline test. The most frequent cancers were pancreatic (18), ovarian (8), and prostate (7). Results: Out of the 43 patients, 7 (16%) harbored a pathogenic or likely pathogenic germline variant (PGV) in a cancer susceptibility gene. PGVs were identified in MLH1, MSH6, CHEK2, PALB2, CDKN2A, NBN, and MUTYH. Notably, 3 of these genes ( CHEK2, PALB2, MUTYH) were not considered therapeutic targets, and therefore were only included as ancillary findings near the end of the preliminary somatic test reports (generated prior to integration of germline test results). In addition, 40 of 43 (93%) patients had at least one variant detected by somatic testing in at least one of the germline panel genes (mean number variant genes = 4.1, maximum = 10); all of these variants were within the reportable range of the germline assay, and therefore germline test results were able to resolve their germline versus somatic origins. The genes that most frequently had somatic variants identified were TP53 (79% of patients), CDKN2A (37%), SMAD4 (30%), and FLCN (21%). Conclusions: Due to the size of commonly ordered somatic gene panels, there is a high probability of detecting variants in hereditary cancer predisposition genes (> 90% of patients in this study) that can provide either therapy or cancer risk information or both. Given that a significant proportion (16% in this study) of cancer patients harbor PGVs (which can further inform treatment, disease surveillance, preventive measures, and risk assessment for family members), it is crucial to resolve the somatic versus germline origin of these variants. Since interpretation and reporting algorithms for somatic testing are optimized for therapy prediction, and variables such as specimen tumor purity, tumor ploidy, and variant allele fraction render estimates of variant origin unreliable for diagnostic purposes, it is important to take advantage of germline testing concurrently in patients receiving somatic testing to glean this critical information.

Prevalence and drivers of false-positive rifampicin-resistant Xpert MTB/RIF results: a prospective observational study in Rwanda

This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only a descending order of heuristic evaluation values. However, since the evaluation values are heuristic, a solution node group sometimes includes nodes with lower evaluation values. The tree which has a solution node group including nodes with lower evaluation values requires a long time to be solved by the conventional algorithms. The proposed algorithm allows us to search paths including nodes with lower evaluation values and paths including nodes with higher evaluation values concurrently. For searching various paths concurrently, the proposed algorithm uses pseudo-threads and a pseudo-thread scheduler managed by a user program with low overhead compared with the OS thread management. The pseudo-thread scheduler can weight the amount of search on each path and schedule the pseudo-threads. The proposed algorithm can solve trees which have solutions including nodes with lower evaluation values also quickly. For performance evaluation, the proposed algorithm was applied to a Tsume-Shogi (Japanese chess problem) solver as a typical AND/OR tree search problem. In tsume-shogi, players can reuse captured pieces. Performance evaluation results on 385 problems show that the proposed algorithm is 1.67 times faster on the average than the previous algorithm df-pn.