arXiv subjects

Wilson Wong

Publications and source records attributed to Wilson Wong.

8 recordsLinked to original sources

arXiv2026

Student Perceptions and Preferences Regarding AI-Generated Instructional Videos in Computing Education

Students differ in how they prefer to engage with learning resources, with some favoring textual materials and others visual or video-based content. Recent advances in generative AI have led CS education research to focus on text-based AI tools for developing learning resources. However, advances in AI video models and the rapid proliferation of AI video generation tools have made it possible for instructors to create high-quality personalized educational videos efficiently and cost-effectively. Understanding students' perceptions of AI-generated videos is thus critical for helping CS instructors know when and how to use them purposefully. To address this gap, we conducted a descriptive post-test survey study in which 170 computing students at two U.S. institutions watched three 3-minute AI videos on the Markdown markup language created with Knowlify. Students then completed a survey about their perceptions of the Markdown videos and their broader views on the use of AI-generated videos in education. Students rated the Markdown videos as high-quality, accurate, and usable, with nearly half unable to determine whether the videos were AI-generated. At the same time, students expressed limited comfort with the widespread adoption of AI videos in the classroom. They preferred AI videos for simple, supplemental, and visual use cases, while expressing concerns about lower-quality or inaccurate content, reduced instructor interaction, and diminished educational value.

cs.HC↗

arXiv2020

Fingerprint Spectroscopic SRS Imaging of Single Living Cells and Whole Brain by Ultrafast Tuning and Spatial-Spectral Learning

Label-free vibrational imaging by stimulated Raman scattering (SRS) provides unprecedented insight into real-time chemical distributions in living systems. Specifically, SRS in the fingerprint region can resolve multiple chemicals in a complex bio-environment using specific and well-separated Raman signatures. Yet, fingerprint SRS imaging with microsecond spectral acquisition has not been achieved due to the small fingerprint Raman cross-sections and the lack of ultrafast acquisition scheme with high spectral resolution and high fidelity. Here, we report a fingerprint spectroscopic SRS platform that acquires a distortion-free SRS spectrum with 10 cm-1 spectral resolution in 20 microseconds using a lab-built ultrafast delay-line tuning system. Meanwhile, we significantly improve the signal-to-noise ratio by employing a spatial-spectral residual learning network, reaching comparable quality to images taken with two orders of magnitude longer pixel dwell times. Collectively, our system achieves reliable fingerprint spectroscopic SRS with microsecond spectral acquisition speed, enabling imaging and tracking of multiple biomolecules in samples ranging from a live single microbe to a tissue slice, which was not previously possible with SRS imaging in the highly congested carbon-hydrogen region. To show the broad utility of the approach, we have demonstrated high-speed compositional imaging of lipid metabolism in living pancreatic cancer Mia PaCa-2 cells. We then performed high-resolution mapping of cholesterol, fatty acid, and protein in the mouse whole brain. Finally, we mapped the production of two biofuels in microbial samples by harnessing the superior spectral and temporal resolutions of our system.

physics.med-ph↗

arXiv2019

Alexander and Jones polynomials of surgerized tst links

This paper is a continuation on the 2012 paper on "Cutting Twisted Solid Tori (TSTs)", in which we considered twisted solid torus links (tst links). We generalize the notion of tst links to "surgerized tst links": recall that when performing $Φ^μ(n(τ), d(τ), M)$ on a tst $\langle τ\rangle$ where $M$ is odd, we obtain the tst link, $[Φ^μ(n(τ), d(τ), M)]$ that contains a trivial knot as one of its components. We then perform another operation $Φ^{μ'}(n(τ'), d(τ'), M')$ on that trivial knot to create a new link, which we call a "surgerized tst link" (stst link). If $M'$ is odd, we can repeat the process to give more complicated stst links. We compute braid words, Alexander and Jones polynomials of such links.

math.GT↗

arXiv2008

Automatic Construction of Lightweight Domain Ontologies for Chemical Engineering Risk Management

The need for domain ontologies in mission critical applications such as risk management and hazard identification is becoming more and more pressing. Most research on ontology learning conducted in the academia remains unrealistic for real-world applications. One of the main problems is the dependence on non-incremental, rare knowledge and textual resources, and manually-crafted patterns and rules. This paper reports work in progress aiming to address such undesirable dependencies during ontology construction. Initial experiments using a working prototype of the system revealed promising potentials in automatically constructing high-quality domain ontologies using real-world texts.

cs.AI↗

arXiv2008

Enhanced Integrated Scoring for Cleaning Dirty Texts

An increasing number of approaches for ontology engineering from text are gearing towards the use of online sources such as company intranet and the World Wide Web. Despite such rise, not much work can be found in aspects of preprocessing and cleaning dirty texts from online sources. This paper presents an enhancement of an Integrated Scoring for Spelling error correction, Abbreviation expansion and Case restoration (ISSAC). ISSAC is implemented as part of a text preprocessing phase in an ontology engineering system. New evaluations performed on the enhanced ISSAC using 700 chat records reveal an improved accuracy of 98% as compared to 96.5% and 71% based on the use of only basic ISSAC and of Aspell, respectively.

cs.AI↗

arXiv2008

Determining the Unithood of Word Sequences using a Probabilistic Approach

Most research related to unithood were conducted as part of a larger effort for the determination of termhood. Consequently, novelties are rare in this small sub-field of term extraction. In addition, existing work were mostly empirically motivated and derived. We propose a new probabilistically-derived measure, independent of any influences of termhood, that provides dedicated measures to gather linguistic evidence from parsed text and statistical evidence from Google search engine for the measurement of unithood. Our comparative study using 1,825 test cases against an existing empirically-derived function revealed an improvement in terms of precision, recall and accuracy.

cs.AI↗

arXiv2008

Determining the Unithood of Word Sequences using Mutual Information and Independence Measure

Most works related to unithood were conducted as part of a larger effort for the determination of termhood. Consequently, the number of independent research that study the notion of unithood and produce dedicated techniques for measuring unithood is extremely small. We propose a new approach, independent of any influences of termhood, that provides dedicated measures to gather linguistic evidence from parsed text and statistical evidence from Google search engine for the measurement of unithood. Our evaluations revealed a precision and recall of 98.68% and 91.82% respectively with an accuracy at 95.42% in measuring the unithood of 1005 test cases.

cs.AI↗

arXiv2007

Practical Approach to Knowledge-based Question Answering with Natural Language Understanding and Advanced Reasoning

This research hypothesized that a practical approach in the form of a solution framework known as Natural Language Understanding and Reasoning for Intelligence (NaLURI), which combines full-discourse natural language understanding, powerful representation formalism capable of exploiting ontological information and reasoning approach with advanced features, will solve the following problems without compromising practicality factors: 1) restriction on the nature of question and response, and 2) limitation to scale across domains and to real-life natural language text.

cs.CL↗