Search

Keita Okoshi,1 Shotaro Ito,1 Megumi Matsuoka,1 Yoshinori Kinugasa,1 Eri Shimizu,2 Kosei Tanaka,2 Joji Okada,3 Takahiro Nishizaka,1 Azumi Nagasawa,1 Tsuyoshi Seki,1 Makoto Iijima,1 Masatoshi Abe,4 Osamu Nemoto4 1Human Health Care Products Research, Kao Corporation, Tokyo, Japan; 2Analytical Science Research, Kao Corporation, Tochigi, Japan; 3Skin Care Products Research, Kao Corporation, Tokyo, Japan; 4Sapporo Skin Clinic, Sapporo, JapanCorrespondence: Azumi Nagasawa, Human Health Care Products Research, Kao Corporation, 2-1-3, Bunka, Sumida-ku, Tokyo, 131-8501, Japan, Tel +81-3-5630-7690, Fax +81-3-5630-9342, Email nagasawa.azumi@kao.comPurpose: Atopic dermatitis is characterized by chronic inflammation and dryness accompanied by severe itching. The combined use of moisturizers and topical anti-inflammatory drugs is essential for alleviating atopic dermatitis. We have developed a topical anti-inflammatory drug with a steroid and a moisturizer with heparinoid, both in lamellar structure-based formulations containing synthetic pseudo-ceramides. Here, assessed the efficacy of this combination in the treatment of atopic dermatitis.Methods: We included 22 patients with mild to moderate atopic dermatitis and subjected them to a seven-week treatment with the test formulations, followed by a four-week post-treatment period.Results: Clinical findings and the quality of life of participants remarkably improved after one week of treatment. Furthermore, skin hydration and transepidermal water loss considerably improved at weeks one and three, respectively. The Cer [NP]/[NS] ratio, an indicator of epidermal turnover, substantially increased during the treatment period and remained elevated even thereafter. The improvement in stratum corneum function was distinctive in participants with lower barrier function.Conclusion: These findings indicated that the combined use of the anti-inflammatory drug and moisturizer, both in lamellar structure-based formulations, is effective in treat

SQL is one of the most popular tools for data analysis, and it is now used by an increasing number of users without having expertise in databases. Several studies have proposed programming-by-example approaches to help such non-experts to write correct SQL queries. While existing methods support a variety of SQL features such as aggregation and nested query, they suffer a significant increase in computational cost as the scale of example tables increases. In this paper, we propose an efficient algorithm utilizing properties known in relational algebra to synthesize SQL queries from input and output tables. Our key insight is that a projection operator in a program sketch can be lifted above other operators by applying transformation rules in relational algebra, while preserving the semantics of the program. This enables a quick inference of appropriate columns in the projection operator, which is an essential component in synthesis but causes combinatorial explosions in prior work. We also introduce a novel form of constraints and its top-down propagation mechanism for efficient sketch completion. We implemented this algorithm in our tool PATSQL and evaluated it on 226 queries from prior benchmarks and Kaggle's tutorials. As a result, PATSQL solved 68% of the benchmarks and found 89% of the solutions within a second. Our tool is available at https://naist-se.github.io/patsql/.

Legacy systems are important in business but difficult to maintain. One of the causes of the difficulties is a large number of code clones in the systems; Those clones implement similar functionalities using common loop idioms in a company. Since the loop idioms have been developed to implement popular functionalities, most of them are likely to be translated into simple SQL statements in a new, modernized version of a system. To investigate the feasibility of the approach, we propose a method to automatically extract cloned loop idioms embedded in COBOL program files. We manually classified the extracted idioms and labeled them according to their functionalities. We evaluated the accuracy of our classification result with three experts., IWSC 2019 : 2019 IEEE 13th International Workshop on Software Clones, 24-24 Feb. 2019, Hangzhou, China

SQL is one of the most popular tools for data analysis, and it is now used by an increasing number of users without having expertise in databases. Several studies have proposed programming-by-example approaches to help such non-experts to write correct SQL queries. While existing methods support a variety of SQL features such as aggregation and nested query, they suffer a significant increase in computational cost as the scale of example tables increases. In this paper, we propose an efficient algorithm utilizing properties known in relational algebra to synthesize SQL queries from input and output tables. Our key insight is that a projection operator in a program sketch can be lifted above other operators by applying transformation rules in relational algebra, while preserving the semantics of the program. This enables a quick inference of appropriate columns in the projection operator, which is an essential component in synthesis but causes combinatorial explosions in prior work. We also introduce a novel form of constraints and its top-down propagation mechanism for efficient sketch completion. We implemented this algorithm in our tool PATSQL and evaluated it on 226 queries from prior benchmarks and Kaggle's tutorials. As a result, PATSQL solved 68% of the benchmarks and found 89% of the solutions within a second. Our tool is available at https://naist-se.github.io/patsql/., identifier:2150-8097

Megumi Matsuoka,1 Keita Okoshi,1 Shotaro Ito,1 Takuji Kume,2 Tsuyoshi Seki,1 Takahiro Nishizaka,1 Joji Okada,3 Azumi Nagasawa,1 Makoto Iijima,1 Masatoshi Abe,4 Osamu Nemoto4 1Health & Wellness Products Research, Kao Corporation, Sumida-ku, Tokyo, Japan; 2Analytical Science Research, Kao Corporation, Wakayama, Japan; 3Skin Care Products Research, Kao Corporation, Sumida-ku, Tokyo, Japan; 4Sapporo Skin Clinic, Sapporo, Hokkaido, JapanCorrespondence: Azumi NagasawaHealth & Wellness Products Research, Kao Corporation, 2-1-3, Bunka, Sumida-ku, Tokyo, 131-8501, JapanTel +81-3-5630-9443Fax +81-3-5630-9342Email nagasawa.azumi@kao.comPurpose: Atopic dermatitis (AD) is characterized by chronic inflammation, which frequently recurs, is exacerbated, and enters remission. A maintenance remission period is important for AD patients. We developed a formulation for use during AD remission, containing heparinoid and pseudo-ceramide that forms a lamellar structure. We evaluated the allergen permeability and examined the formulation’s efficacy in maintaining remission in patients with AD.Materials and Methods: Seventeen AD patients applied a cream containing 0.3% heparinoid and pseudo-ceramide (test cream group, n = 10), or a general cream containing 0.3% heparinoid (control cream group, n = 7) to their arm for four weeks after inducing remission with the application of a steroid cream for two weeks.Results: The lamellar structure of the test cream was confirmed with small- and wide-angle x-ray scattering analysis and observation by transmission electron microscopy. The test cream inhibited the penetration of V8 protease significantly compared to the control cream in vitro. According to AD severity score by dermatologists, the effects remission maintenance of the test cream group were comparable to those of the control cream group. However, the test cream group had a significantly increased skin hydration value compared to the control cream group. A significant decrease in t

Legacy systems are important in business but difficult to maintain. One of the causes of the difficulties is a large number of code clones in the systems; Those clones implement similar functionalities using common loop idioms in a company. Since the loop idioms have been developed to implement popular functionalities, most of them are likely to be translated into simple SQL statements in a new, modernized version of a system. To investigate the feasibility of the approach, we propose a method to automatically extract cloned loop idioms embedded in COBOL program files. We manually classified the extracted idioms and labeled them according to their functionalities. We evaluated the accuracy of our classification result with three experts.