EDBT 2026 Demo / reviewers in the wild / expert
T. C. E. Cheng
dblp:41/1715 · also T. C. Edwin Cheng, Tai Chiu Edwin Cheng
· DBLP profile ↗
28ranked-venue papers in the field
7as first author
3since 2021 · last 2026
0000-0001-5127-6419ORCID · verified
Domains — venue-derived; a paper can count in several
Other / Interdisciplinary · 16 (4 first)Knowledge Engineering, Semantic Web & Information Systems · 11 (3 first)Information Retrieval & Web Search · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | SMR-agents: Synergistic medical reasoning agents for zero-shot medical visual question answering with MLLMs
Dujuan Wang, T. C. E. Cheng, Sutong Wang, Youhua (Frank) Chen, Yunqiang Yin |
Inf. Process. Manag. | 2 |
| 2021 | A cluster-based intelligence ensemble learning method for classification problems
Shaoze Cui, Yanzhang Wang, Yunqiang Yin, T. C. E. Cheng, Dujuan Wang, Mingyu Zhai |
Inf. Sci. | 4 |
| 2021 | Believe It or Not: Employees Intend to Comply With Information Security Policy Because of the Desire for Trade-OffsabstractMost theories of information security policy (ISP), except a few focused on the insider-centric view, are grounded in the control-centric perspective, and most ISP compliance models stem from Western countries. Regulatory focus theory (RFT) proposes two modes of motivational regulation, promotion and prevention focused that are supposed to motivate employee compliance in a trade-off. Culture is crucial to the study of ISP that puts control over human connections. Chinese guanxi, a specific dimension of Chinese culture, is better understood underlying the trust-distrust frame. To bridge the theoretical gap between the control-centric and the insider-centric perspectives, we develop an ISP behavioral model by taking an integrated approach from RFT and the trust-distrust frame. We employed scenario-based events about information security misconduct in the workplace to examine employees’ compliance intention and non-violation choice of ISP upon counterfactual thinking. Our empirical results improve the theoretical and practical implications of security practices. Hung-Pin Shih, Kee-hung Lai, Xitong Guo, T. C. E. Cheng |
J. Glob. Inf. Manag. | 4 |
| 2019 | Should firms invest in social commerce? An integrative perspective
Hugo K. S. Lam, Andy C. L. Yeung, Chris K. Y. Lo, T. C. E. Cheng |
Inf. Manag. | 4 |
| 2017 | Constraint-based and dedication-based mechanisms for encouraging online self-disclosure: Is personalization the only thing that matters?abstractConsumer-generated self-disclosure is better than firm-generated advertising and sales reports in increasing contact opportunities and also more credible for firms to foster alignment with future market expectations. Previous research mostly assesses online self-disclosure from the rational approach of anticipated benefits and privacy risks without considering the “privacy paradox” phenomenon (users behave contrarily to privacy concern) in social networking sites (SNSs). We develop a theoretical model, grounded in constraint-based (lock-in) and dedication-based (trust-building) mechanisms and social identity theory, to predict online self-disclosure. We test the proposed theoretical model by surveying 395 consumers with participation experience in an online SNS. Different from the rational approach behind personalization, we advance knowledge on how to apply social identity, as well as constraint-based and dedication-based mechanisms, to motivate online self-disclosure induced by consumers. We provide theoretical and practical insights based on our research findings for managing the motivational mechanisms of online self-disclosure. Hung-Pin Shih, Kee-hung Lai, T. C. E. Cheng |
Eur. J. Inf. Syst. | 3 |
| 2015 | Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines
Yong Wu 0004, T. C. E. Cheng, Min Ji 0001 |
Inf. Process. Lett. | 2 |
| 2014 | Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost
Jueliang Hu, Longcheng Liu, Yuqing Zhu 0002, T. C. E. Cheng |
Inf. Sci. | 5 |
| 2013 | Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position
T. C. E. Cheng, Wen-Hung Kuo, Dar-Li Yang |
Inf. Sci. | 1 |
| 2013 | Four single-machine scheduling problems involving due date determination decisions
Yunqiang Yin, Min Liu 0013, T. C. E. Cheng, Chin-Chia Wu, Shuenn-Ren Cheng |
Inf. Sci. | 3 |
| 2011 | Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time
Chou-Jung Hsu, T. C. E. Cheng, Dar-Li Yang |
Inf. Sci. | 2 |
| 2010 | Online scheduling on two parallel-batching machines with limited restarts to minimize the makespan
Ruyan Fu, T. C. E. Cheng, Chi To Ng 0001, Jinjiang Yuan |
Inf. Process. Lett. | 2 |
| 2010 | Scheduling with job-dependent learning effects and multiple rate-modifying activities
Min Ji 0001, T. C. E. Cheng |
Inf. Process. Lett. | 2 |
| 2009 | Online scheduling on unbounded parallel-batch machines to minimize the makespan
Ji Tian, T. C. E. Cheng, Chi To Ng 0001, Jinjiang Yuan |
Inf. Process. Lett. | 2 |
| 2009 | Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
T. C. E. Cheng, Peng-Jen Lai, Chin-Chia Wu, Wen-Chiung Lee |
Inf. Sci. | 1 |
| 2008 | A coordination-theoretic investigation of the impact of electronic integration on logistics performance
Kee-hung Lai, Christina W. Y. Wong, T. C. E. Cheng |
Inf. Manag. | 3 |
| 2008 | An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan
Min Ji 0001, T. C. E. Cheng |
Inf. Process. Lett. | 2 |
| 2008 | Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
T. C. E. Cheng, Chin-Chia Wu, Wen-Chiung Lee |
Inf. Sci. | 1 |
| 2007 | An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
Min Ji 0001, T. C. E. Cheng |
Inf. Process. Lett. | 2 |
| 2007 | Absorbant of generalized de Bruijn digraphs
Erfang Shan, T. C. E. Cheng, Liying Kang |
Inf. Process. Lett. | 2 |
| 2006 | A new algorithm for online uniform-machine scheduling to minimize the makespan
T. C. E. Cheng, Chi To Ng 0001, Vladimir Kotov |
Inf. Process. Lett. | 1 |
| 2003 | 3/2-approximation for two-machine no-wait flowshop scheduling with availability constraints
T. C. E. Cheng, Zhaohui Liu 0001 |
Inf. Process. Lett. | 1 |
| 2002 | Scheduling with job release dates, delivery times and preemption penalties
Zhaohui Liu 0001, T. C. E. Cheng |
Inf. Process. Lett. | 2 |
| 2002 | Three scheduling problems with deteriorating jobs to minimize the total completion time
Chi To Ng 0001, T. C. E. Cheng, Aleksander Bachman, Adam Janiak |
Inf. Process. Lett. | 2 |
| 2002 | Strong NP-hardness of the single machine multi-operation jobs total completion time scheduling problem
Chi To Ng 0001, T. C. E. Cheng, Jinjiang Yuan |
Inf. Process. Lett. | 2 |
| 2001 | Heuristics for two-machine no-wait flowshop scheduling with an availability constraint
T. C. E. Cheng |
Inf. Process. Lett. | 2 |
| 1999 | Two-Machine Flowshop Scheduling with Consecutive Availability Constraints
T. C. E. Cheng |
Inf. Process. Lett. | 1 |
| 1999 | Scheduling Groups of Unit Length Jobs on Two Identical Parallel Machines
Zhaohui Liu 0001, Wenci Yu, T. C. E. Cheng |
Inf. Process. Lett. | 3 |
| 1998 | The Complexity of Scheduling Starting Time Dependent Tasks with Release Times
T. C. E. Cheng |
Inf. Process. Lett. | 1 |