How hard is a commercial puzzle: the eternity II challenge

Recently, edge matching puzzles, an NP-complete problem, have received, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.

Edge matching puzzles as hard SAT/CSP benchmarks

Recently, edge matching puzzles, an NP-complete problem, have rececived, thanks to money-prized contests, considerable attention from wide audiences. We consider these competitions not only a challenge for SAT/CSP solving techniques but also as an opportunity to showcase the advances in the SAT/CSP community to a general audience. This paper studies the NP-complete problem of edge matching puzzles focusing on providing generation models of problem instances of variable hardness and on its resolution through the application of SAT and CSP techniques. From the generation side, we also identify the phase transition phenomena for each model. As solving methods, we employ both; SAT solvers through the translation to a SAT formula, and two ad-hoc CSP solvers we have developed, with different levels of consistency, employing several generic and specialized heuristics. Finally, we conducted an extensive experimental investigation to identify the hardest generation models and the best performing solving techniques.

Lepromatous leprosy: a review and case report

Leprosy is a contagious and chronic systemic granulomatous disease caused by Mycobacterium leprae (Hansen"s bacillus). It is transmitted from person to person and has a long incubation period (between two and six years). The disease presents polar clinical forms (the"multibacillary" lepromatous leprosy and the"paucibacillary" tuberculoid leprosy), as well as other intermediate forms with hybrid characteristics. Oral manifestations usually appear in lepromatous leprosy and occur in 20-60% of cases. They may take the form of multiple nodules (lepromas) that progress to necrosis and ulceration. The ulcers are slow to heal, and produce atrophic scarring or even tissue destruction. The lesions are usually located on the hard and soft palate, in the uvula, on the underside of the tongue, and on the lips and gums. There may also be destruction of the anterior maxilla and loss of teeth. The diagnosis, based on clinical suspicion, is confirmed through bacteriological and histopathological analyses, as well as by means of the lepromin test (intradermal reaction that is usually negative in lepromatous leprosy form and positive in the tuberculoid form). The differential diagnosis includes systemic lupus erythematosus, sarcoidosis, cutaneous leishmaniasis and other skin diseases, tertiary syphilis, lymphomas, systemic mycosis, traumatic lesions and malignant neoplasias, among other disorders. Treatment is difficult as it must be continued for long periods, requires several drugs with adverse effects and proves very expensive, particularly for less developed countries. The most commonly used drugs are dapsone, rifampicin and clofazimine. Quinolones, such as ofloxacin and pefloxacin, as well as some macrolides, such as clarithromycin and minocyclin, are also effective. The present case report describes a patient with lepromatous leprosy acquired within a contagious family setting during childhood and adolescence

Improving Pitch Tracking Performance in Hard Noise Conditions by a Preprocessing Based on Mathematical Morphology

In this paper we show how a nonlinear preprocessing of speech signal -with high noise- based on morphological filters improves the performance of robust algorithms for pitch tracking (RAPT). This result happens for a very simple morphological filter. More sophisticated ones could even improve such results. Mathematical morphology is widely used in image processing and has a great amount of applications. Almost all its formulations derived in the two-dimensional framework are easily reformulated to be adapted to one-dimensional context