(Reuters) - An eight-year-old became the youngest player to defeat a grandmaster in classical chess on Sunday when Ashwath Kaushik beat Poland&#x27;s Jacek Stopa at the Burgdorfer Stadthaus Open in Switzerland.

Other Sports: Chess-Eight-year-old becomes youngest to beat grandmaster | The Star

The German teams continue to dominate the Mitropa Cup in Apolda, Germany. In round 6 both German teams won against France, and with this win Germany defended its lead in the Open while the women&#x27;s team took the sole lead. | Photos: German Chess Federation/Frank Hoppe

Mitropa Cup: Both German teams in the lead | ChessBase

The 1st Dortmund International Chess Days will take place from 10 to 18 August 2024 at the Cultural Centre Alte Schmiede in Dortmund. Frederik Sane and Leon Mendonca have already confirmed their participation in the A-Open. Elisabeth Pähtz and Dinara Wagner will play a match to find out who ...

Sparkassen Chess Trophy 2024 | ChessBase

Ashwath Kaushik of Singapore defeats 37-year-old grandmaster, beating record set days before by another eight-year-old

Eight-year-old becomes youngest chess player to beat grandmaster | Chess | The Guardian

At eight years, six months and 11 days old, Ashwath Kaushik made history by becoming the youngest player to beat a chess grandmaster in a classical tournament game.

Ashwath Kaushik: 8-year-old prodigy makes history after beating chess grandmaster | CNN

Senate Majority Leader Chuck Schumer (D-N.Y.) and 22 other Democratic senators sent a letter to Federal Trade Commission (FTC) Chair Lina Khan Wednesday demanding an investigation of two major proposed oil industry ... major U.S. energy companies dropped ...

Schumer leads 23 senators in demanding FTC probe of oil industry mergers

CEO John Hess is publicly enthusiastic about the deal, and it would be tough for another bidder to emerge given Hess’s size.

Chevron-Hess Deal on Track Despite Chevron Stock Drop

ExxonMobil's decision to buy Pioneer is a bet on the Permian Basin. On March 5, 2019, ExxonMobil revised its growth plans to produce more than 1 million barrels of oil equivalent per day (boe/d) from the Permian as early as 2024. ExxonMobil was on pace to miss that goal.

ExxonMobil and Chevron Are Betting Big on Fossil Fuels. Should You?

Milestone Environmental Services said it planned to lease about 22,000 acres in Midland and Loving counties in Texas.

Permian Basin energy companies focusing on carbon capture during region's growth

Exxon Mobil and Chevron told investors why they want to spend $114 billion combined on two megadeals. Their earnings reports revealed why they need to

Exxon and Chevron megadeals reveal why days of easy oil are over

Hess

hess

Overcoming Limitations in Scaling Biomedical Syllogistic Reasoning

DreamLLM: What We Can Conclude From This Comprehensive Framework?

Holistic Evaluation of Text-to-Image Models: Author contributions, Acknowledgments and References

Practical LLMs for Real-World Applications

Improving Text Embeddings with
Large Language Models: Conclusion and References

Efficient Detection of Defects in Magnetic Labyrinthine Patterns: Conclusion and References

Authors:
(1) Vinicius Yu Okubo, B.S. in electrical engineering from the University of São Paulo in 2022 and currently, he is pursuing his M.S. in electrical engineering at the University of São Paulo;
(2) Kotaro Shimizu, B.S. degree in Physics from Waseda University, Japan, in 2019 and M.S. degree in Physics from the University of Tokyo, Japan, 2021 and He has been pursuing his Ph.D. in Physics as a JSPS research fellowship for young scientists in the University of Tokyo since 2021;
(3) B.S. Shivaram, received his B.S. degree in Physics, Chemistry and Mathematics from Bangalore University, India, in 1977 and the M.S. degree in Physics from the Indian Institute of Technology, Madras, India, in 1979 and his Ph.D. in experimental condensed matter physics from Northwestern University, Evanston, Illinois in 1984;
(4) Hae Yong Kim, He received the B.S. and M.S. degrees (with distinctions) in computer science and the Ph.D. degree in electrical engineering from the Universidade de São Paulo (USP), Brazil, in 1988, 1992 and 1997, respectively. Table of Links Abstract and I Introduction II. Related Works III Methodology IV Experiments and Results V Conclusion and References II. RELATED WORKS A. JUNCTIONS AND TERMINALS DETECTION Junctions and terminals are shapes with relevance that extend beyond materials. Within computer vision, recognizing and enumerating them has been performed in diverse contexts, such as natural landscapes [20], biology [21] and handwriting images [22]. B. CLASSICAL METHODS FOR JUNCTIONS AND TERMINALS DETECTION One prevalent approach for detecting junctions and terminals involves using skeletonization as a pre-processing step. This process reduces the image to one-pixel-wide lines to represent its structures. Points in skeleton can then be identified as terminals, junctions and crossings based on their neighboring pixels. This technique has been applied in vascular images [23] and in the analysis of handwritten Chinese characters [24]. Pre-processing techniques using contour information have also been explored for junction detection. Lee and Wu [25] investigated stroke extraction in Chinese characters. Their method segments regions according to their contour, identifying junctions by counting neighboring regions. Maire et al. [26] proposed a junction detector in natural images by locating intersecting contours. This approach applies an expectation–maximization style algorithm to iteratively select relevant contours and suggest the junction’s position. However, skeletonization and contour finding are noise-sensitive processes and a pre-processing error will lead to a detection error. Junctions and terminals can also be identified by analyzing the arrangement of linear structures within the image. Su et al. [27] describe a technique for identifying these linear structures using the Hessian Matrix. This approach has been validated in biological images such as blood vessels, neutrites and tree branches. Xia et al. [20] present a junction detection method in natural images, based on amplitudes and phases of the normalized gradients of the image. Template-based approaches quantify the similarity of the appearance of image regions and the template. Deriche and Blaszka [28] modeled this approach as energy minimization, which is calculated by the deviation between the image and a predetermined model. This enabled the detection of key image features, such as edges, corners and terminals. C. DEEP LEARNING METHODS FOR JUNCTIONS AND TERMINALS DETECTION Owing to the success of R-CNN based detection techniques, Pratt et al. [21] developed a pipeline for identifying junctions and crossings in retinal vascular structures. Their method involves two main steps: initially, detection regions are proposed centred along the blood vessels, which are then classified as junctions, crossings or background. To generate the detection regions, their approach requires a binary segmented version of the exam. Theses images undego a skeletonization process, with the resulting points serving as references for the centers of the blood vessels. Zhao et al. [29], addressing the same problem, proposed using a Mask R-CNN base model [30] for region proposal. This strategy enables inference without the need for binary segmented version of the exam. However, during training, the segmented images are still used in the Mask R-CNN model to enhance its learning capabilities. This approach surpassed the performance of previous techniques in the detection of junctions and crossings in retinal vascular images. This paper is available on arxiv under CC BY 4.0 DEED license. Authors: (1) Vinicius Yu Okubo, B.S. in electrical engineering from the University of São Paulo in 2022 and currently, he is pursuing his M.S. in electrical engineering at the University of São Paulo; (2) Kotaro Shimizu, B.S. degree in Physics from Waseda University, Japan, in 2019 and M.S. degree in Physics from the University of Tokyo, Japan, 2021 and He has been pursuing his Ph.D. in Physics as a JSPS research fellowship for young scientists in the University of Tokyo since 2021; (3) B.S. Shivaram, received his B.S. degree in Physics, Chemistry and Mathematics from Bangalore University, India, in 1977 and the M.S. degree in Physics from the Indian Institute of Technology, Madras, India, in 1979 and his Ph.D. in experimental condensed matter physics from Northwestern University, Evanston, Illinois in 1984; (4) Hae Yong Kim, He received the B.S. and M.S. degrees (with distinctions) in computer science and the Ph.D. degree in electrical engineering from the Universidade de São Paulo (USP), Brazil, in 1988, 1992 and 1997, respectively. Authors: Authors: (1) Vinicius Yu Okubo, B.S. in electrical engineering from the University of São Paulo in 2022 and currently, he is pursuing his M.S. in electrical engineering at the University of São Paulo; (2) Kotaro Shimizu, B.S. degree in Physics from Waseda University, Japan, in 2019 and M.S. degree in Physics from the University of Tokyo, Japan, 2021 and He has been pursuing his Ph.D. in Physics as a JSPS research fellowship for young scientists in the University of Tokyo since 2021; (3) B.S. Shivaram, received his B.S. degree in Physics, Chemistry and Mathematics from Bangalore University, India, in 1977 and the M.S. degree in Physics from the Indian Institute of Technology, Madras, India, in 1979 and his Ph.D. in experimental condensed matter physics from Northwestern University, Evanston, Illinois in 1984; (4) Hae Yong Kim, He received the B.S. and M.S. degrees (with distinctions) in computer science and the Ph.D. degree in electrical engineering from the Universidade de São Paulo (USP), Brazil, in 1988, 1992 and 1997, respectively. Table of Links Abstract and I Introduction Abstract and I Introduction II. Related Works II. Related Works III Methodology III Methodology IV Experiments and Results IV Experiments and Results V Conclusion and References V Conclusion and References II. RELATED WORKS A. JUNCTIONS AND TERMINALS DETECTION A. JUNCTIONS AND TERMINALS DETECTION Junctions and terminals are shapes with relevance that extend beyond materials. Within computer vision, recognizing and enumerating them has been performed in diverse contexts, such as natural landscapes [20], biology [21] and handwriting images [22]. B. CLASSICAL METHODS FOR JUNCTIONS AND TERMINALS DETECTION B. CLASSICAL METHODS FOR JUNCTIONS AND TERMINALS DETECTION One prevalent approach for detecting junctions and terminals involves using skeletonization as a pre-processing step. This process reduces the image to one-pixel-wide lines to represent its structures. Points in skeleton can then be identified as terminals, junctions and crossings based on their neighboring pixels. This technique has been applied in vascular images [23] and in the analysis of handwritten Chinese characters [24]. Pre-processing techniques using contour information have also been explored for junction detection. Lee and Wu [25] investigated stroke extraction in Chinese characters. Their method segments regions according to their contour, identifying junctions by counting neighboring regions. Maire et al. [26] proposed a junction detector in natural images by locating intersecting contours. This approach applies an expectation–maximization style algorithm to iteratively select relevant contours and suggest the junction’s position. However, skeletonization and contour finding are noise-sensitive processes and a pre-processing error will lead to a detection error. Junctions and terminals can also be identified by analyzing the arrangement of linear structures within the image. Su et al. [27] describe a technique for identifying these linear structures using the Hessian Matrix. This approach has been validated in biological images such as blood vessels, neutrites and tree branches. Xia et al. [20] present a junction detection method in natural images, based on amplitudes and phases of the normalized gradients of the image. Template-based approaches quantify the similarity of the appearance of image regions and the template. Deriche and Blaszka [28] modeled this approach as energy minimization, which is calculated by the deviation between the image and a predetermined model. This enabled the detection of key image features, such as edges, corners and terminals. C. DEEP LEARNING METHODS FOR JUNCTIONS AND TERMINALS DETECTION C. DEEP LEARNING METHODS FOR JUNCTIONS AND TERMINALS DETECTION Owing to the success of R-CNN based detection techniques, Pratt et al. [21] developed a pipeline for identifying junctions and crossings in retinal vascular structures. Their method involves two main steps: initially, detection regions are proposed centred along the blood vessels, which are then classified as junctions, crossings or background. To generate the detection regions, their approach requires a binary segmented version of the exam. Theses images undego a skeletonization process, with the resulting points serving as references for the centers of the blood vessels. Zhao et al. [29], addressing the same problem, proposed using a Mask R-CNN base model [30] for region proposal. This strategy enables inference without the need for binary segmented version of the exam. However, during training, the segmented images are still used in the Mask R-CNN model to enhance its learning capabilities. This approach surpassed the performance of previous techniques in the detection of junctions and crossings in retinal vascular images. This paper is available on arxiv under CC BY 4.0 DEED license. This paper is available on arxiv under CC BY 4.0 DEED license. available on arxiv

Stories, News & Mentions about HESS

Hess’s Stories on HackerNoon

Hess's News & Mentions