Yu-Ming Hsieh

dblp:24/177 · DBLP profile ↗
← Back
12ranked-venue papers
3as first author
4since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Databases, data management, data science and information retrieval · 2 · 1 since 2021Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge graphs
knowledge graph construction
1.012026
Efficient LLM Adaptation for Opinion Knowledge Graph Construction: Lessons from the Telecom Industry · SIGIR 2026
Natural language and speech › Information extraction and text analysis › syntactic parsing
syntactic disambiguation
0.212014
Ambiguity Resolution for Vt-N Structures in Chinese · EMNLP 2014
Natural language and speech › Information extraction and text analysis › syntactic parsing
chinese parsing
0.112014
Ambiguity Resolution for Vt-N Structures in Chinese · EMNLP 2014

Methods — techniques the papers use, named apart from their topics

large language model adaptation · 1.0semi-supervised learning · 0.2classifier · 0.2PCFG parser · 0.2
YearPublicationVenuePosition
2026 Efficient LLM Adaptation for Opinion Knowledge Graph Construction: Lessons from the Telecom Industry
Nai-Chi Yang, Yu-Ming Hsieh, Wei-Yun Ma, Kuo-Wei Chang
SIGIR2
2025 Enhancing the Resilience of IEC 61131-3 Software With Online Reconfigurations for Fault Handling
abstract
In automated production, resilience describes a system’s capacity to absorb disturbances by reconfiguring itself, thus retaining its Overall Equipment Effectiveness at least partially. This includes online behavior reconfiguration to automatically recover from or prevent faults, collectively called fault handling. Promising research exists for fault handling in automated Production Systems. In process engineering, fault diagnosis and automatic parameter adaptions are already industrially available. However, handling faults in discrete manufacturing requires a series of distinct operations, which cannot be achieved by parameter changes alone. Further, core requirements must remain fulfilled by automatic fault handling approaches, including real-time control and extra-functional requirements like changing operation modes, monitoring interlocks, and an alarming and communication system. This article proposes a concept for reconfigurable IEC 61131–3 software for automatic fault handling, validated by a public reference implementation for a demonstrator, an industrial production system, and a modified industrial test rig. Eight experiments were successfully conducted, showcasing four use cases of the concept: The prevention of faults by avoiding anomalous components, the recovery from a fault state to automatic operation, the definition of previously undefined state variables, and the monitoring of global interlocks to trigger a controlled stop. All mentioned extra-functional requirements are fulfilled. Note to Practitioners—Identification, reporting, diagnosis, and recovery of faults in automated production incur substantial effort. Project-specific code is required for diagnosis, and the recovery and re-initialization are often performed manually. To our knowledge, automatic recovery approaches from scientific literature are not widely used in discrete manufacturing. Reasons may include a frequent disregard of extra-functional requirements mentioned above. Further, some approaches are incompatible with IEC 61131–3 or industry-typical software modularization. This article proposes a PLC software concept that aims to be compatible with real-world challenges and solutions. The functional software is vertically modularized from organizational hardware-level code. The horizontal modularization separates devices or equipment groups. Support for multiple changing operation modes including two types of controlled stop (run to completion or abort), alarming, data exchange, and global interlocks are incorporated. A prototypical IEC 61131–3 implementation is publicly available that separates a reusable generic part from hardware-specific and project-specific code. The resulting control code is highly reusable, such that all modes (derived from PackML), including dynamic reconfigurations, are composed from the same software modules. Note that we do not expect the concept to be well-adoptable in continuous processes, as elaborated in the Preliminaries section.
Jan Wilch, Birgit Vogel-Heuser, Florian Sax, Simon Rüth, Ulrich Oeckl, Bernhard Wohlschläger, Yu-Ming Hsieh, Fan-Tien Cheng
IEEE Trans Autom. Sci. Eng.7
2022 A Novel Implementation Framework of Digital Twins for Intelligent Manufacturing Based on Container Technology and Cloud Manufacturing Services
abstract
Many core technologies of Industry 4.0 have gained substantial advancement in recent years. Digital Twin (DT) has become the key technology and tool for manufacturing industries to realize intelligent cyber-physical integration and digital transformation by leveraging these technologies. Although there have been many DT-related works, there is no standard definition, unified framework, and implementation approach of DT until now. Widely developing DTs for the manufacturing industry is still challenging. Thus, this paper proposes a novel implementation framework of digital twins for intelligent manufacturing, denoted as IF-DTiM, which possesses several distinct merits to distinguish itself from previous works. First, IF-DTiM fully utilizes new-generation container technology so that DT-related applications and services can be packaged in a self-contained way, rapidly deployed, and robustly operated with the capabilities of failover, autoscaling, and load balancing. Second, it leverages existing intelligent cloud manufacturing services to realize the intelligence for DT externally in a scalable and plug-and-play manner instead of using traditional approaches to embed intelligence in DT. Third, IF-DTiM contains Product DT for products, Equipment DT (i.e., EQ DT) for equipment, and Process DT for production lines, which can generically fulfill the demands and scenarios to achieve intelligent manufacturing for various manufacturing industries. Testing results show that IF-DTiM can achieve remarkable performance in rapid deployment and real-time data exchanges of DT-related applications. Finally, we develop an example DTiM system for CNC machining based on IF-DTiM to demonstrate its efficacy and applicability in facilitating the manufacturing industry to build their DT systems.Note to Practitioners—Developing Digital Twin (DT) systems to realize intelligent manufacturing is challenging. The proposed IF-DTiM (Implementation Framework of Digital Twins for Intelligent Manufacturing) provides a novel container-technology and cloud-manufacturing-service-based systematic methodology for building DTiM. In this paper, we present the system architecture and several operational scenarios (e.g., how to create and use DTs) of IF-DTiM, together with the design of its core functional mechanisms (e.g., rapid deployment scheme for DT, real-time data exchange for DT, DT interface pattern, and general workflow architecture for DT). Also, an example DTiM system for CNC machining based on IF-DTiM is presented to facilitate the practitioners to adopt the designs and niches in IF-DTiM to build their desired DTiM systems.
Min-Hsiung Hung, Yu-Chuan Lin 0004, Hung-Chang Hsiao, Chao-Chun Chen, Kuan-Chou Lai, Yu-Ming Hsieh, Hao Tieng, Tsung-Han Tsai 0004, Hsien-Cheng Huang, Haw Ching Yang, Fan-Tien Cheng
IEEE Trans Autom. Sci. Eng.6
2022 Golden Path Search Algorithm for the KSA Scheme
abstract
The concepts of Industry 4.1 for achieving Zero-Defect (ZD) manufacturing were disclosed inIEEE Robotics and Automation Lettersin January 2016. ZD of all the deliverables can be achieved by discarding the defective products via a real-time and online total inspection technology, such as Automatic Virtual Metrology (AVM). Further, the Key-variable Search Algorithm (KSA) of the Intelligent Yield Management (IYM) system developed by our research team can be utilized to find out the root causes of the defects for continuous improvement on those defective products. As such, nearly ZD of all products may be achieved. However, in a multistage manufacturing process (MMP) environment, a workpiece may randomly pass through one of the manufacturing devices with the same function in each stage. Different devices of the same type perform differently in each stage, where the performances will be accumulated through the designated manufacturing process and affect the final yield. KSA can only identify the influence of univariate variables (i.e., single devices) on the yield, yet it cannot detect the manufacturing paths that have significant influence on the yield. In order to cope with this deficiency such that the golden path with a better yield amongst all the MMP paths can be found, this research proposes the Golden Path Search Algorithm (GPSA), which can plan golden paths with high yield under the condition of the number of variables being much larger than that of samples. As a result, it makes the improvement of manufacturing yield be more comprehensive.Note to Practitioners—Traditional scheduling only considers the capacity of the manufacturing devices for allocation; while, the impact on the yield is rarely considered. In fact, in a production process, the production deviations will be gradually accumulated and affect the product quality along with the processing influence of each device. Therefore, the purpose of this paper is to propose the GPSA scheme to quickly search for high-yield manufacturing paths before the production. Manufacturers can then configure production devices based on these paths. According to the experimental results of real manufacturers’ data, GPSA can not only quickly nail down the high-yield paths from a large amount of historical data, but also alert the users to avoid paths that are prone to defective rates for their reference.
Ching-Kang Ing, Chin-Yi Lin, Po-Hsiang Peng, Yu-Ming Hsieh, Fan-Tien Cheng
IEEE Trans Autom. Sci. Eng.4
2015 Correcting Chinese Spelling Errors with Word Lattice Decoding
abstract
Chinese spell checkers are more difficult to develop because of two language features: 1) there are no word boundaries, and a character may function as a word or a word morpheme; and 2) the Chinese character set contains more than ten thousand characters. The former makes it difficult for a spell checker to detect spelling errors, and the latter makes it difficult for a spell checker to construct error models. We develop a word lattice decoding model for a Chinese spell checker that addresses these difficulties. The model performs word segmentation and error correction simultaneously, thereby solving the word boundary problem. The model corrects nonword errors as well as real-word errors. In order to better estimate the error distribution of large character sets for error models, we also propose a methodology to extract spelling error samples automatically from the Google web 1T corpus. Due to the large quantity of data in the Google web 1T corpus, many spelling error samples can be extracted, better reflecting spelling error distributions in the real world. Finally, in order to improve the spell checker for real applications, we produce n-best suggestions for spelling error corrections. We test our proposed approach with the Bakeoff 2013 CSC Datasets; the results show that the proposed methods with the error model significantly outperform the performance of Chinese spell checkers that do not use error models.
Yu-Ming Hsieh, Ming-Hong Bai, Shu-Ling Huang, Keh-Jiann Chen
ACM Trans. Asian Low Resour. Lang. Inf. Process.1
2014 Ambiguity Resolution for Vt-N Structures in Chinese
abstract
The syntactic ambiguity of a transitive verb (Vt) followed by a noun (N) has long been a problem in Chinese parsing. In this paper, we propose a classifier to resolve the ambiguity of Vt-N structures. The design of the classifier is based on three important guidelines, namely, adopting linguistically motivated features, using all available resources, and easy in-tegration into a parsing model. The lin-guistically motivated features include semantic relations, context, and morpho-logical structures; and the available re-sources are treebank, thesaurus, affix da-tabase, and large corpora. We also pro-pose two learning approaches that resolve the problem of data sparseness by auto-parsing and extracting relative knowledge from large-scale unlabeled data. Our experiment results show that the Vt-N classifier outperforms the cur-rent PCFG parser. Furthermore, it can be easily and effectively integrated into the PCFG parser and general statistical pars-ing models. Evaluation of the learning approaches indicates that world knowledge facilitates Vt-N disambigua-tion through data selection and error cor-rection. 1
Yu-Ming Hsieh, Jason S. Chang, Keh-Jiann Chen
EMNLP1
2013 Translating Chinese Unknown Words by Automatically Acquired Templates
Ming-Hong Bai, Yu-Ming Hsieh, Keh-Jiann Chen, Jason S. Chang
IJCNLP2
2008 Resolving Ambiguities of Chinese Conjunctive Structures by Divide-and-conquer Approaches
Duen-Chi Yang, Yu-Ming Hsieh, Keh-Jiann Chen
IJCNLP2
2007 Design of a dynamic distributed mobile computing environment
abstract
Many of the embedded systems have integrated the features of multimedia, networking, and mobility in a device. With the capability of wireless communication, mobile devices can be connected to share information, and even more, work together to accomplish a more complex job. In this paper, a novel distributed mobile computing model based on the concept of dynamic task group is proposed. Through this dynamic distributed mobile computing (Dynamic-DMC) model, computing resources can be added and removed dynamically according to the availability of the resources. An environment supporting the Dynamic-DMC model, called D2MCE, has also been implemented. In D2MCE, a shared memory abstraction layer is provided for the purpose of easy programming. An example D2MCE program is also given in this paper. The Dynamic-DMC model and the D2MCE implementation can also be used in traditional cluster computing. Initial result shows that the performance of D2MCE is acceptable.
Wen-Yew Liang, Yu-Ming Hsieh, Zong-Ying Lyu
ICPADS2
2005 Linguistically-Motivated Grammar Extraction, Generalization and Adaptation
Yu-Ming Hsieh, Duen-Chi Yang, Keh-Jiann Chen
IJCNLP1
2004 Chinese Treebanks and Grammar Extraction
Keh-Jiann Chen, Yu-Ming Hsieh
IJCNLP2
2002 SETM*-MaxK: An Efficient SET-Based Approach to Find the Largest Itemset
Ye-In Chang, Yu-Ming Hsieh
PAKDD2