Chuang-Chieh Lin - Academia.edu (original) (raw)
Papers by Chuang-Chieh Lin
IEEE Computational Intelligence Magazine
Lecture Notes in Computer Science, 2023
arXiv (Cornell University), Jan 16, 2020
In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-p... more In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-party election system, especially regarding the nomination process. Each of the two parties has its own candidates, and each of them brings utilities for the people including the supporters and nonsupporters. In an election, each party nominates exactly one of its candidates to compete against the other party's. The candidate wins the election with higher odds if he or she brings more utility for all the people. We model such competition as a two-party election game such that each party is a player with two or more pure strategies corresponding to its potential candidates, and the payoff of each party is a mixed utility from a selected pair of competing candidates. By looking into the three models, namely, the linear link, Bradley-Terry, and the softmax models, which differ in how to formulate a candidate's winning odds against the competing candidate, we show that the two-party election game may neither have any pure Nash equilibrium nor a bounded price of anarchy. Nevertheless, by considering the conventional egoism, which states that any candidate benefits his/her party's supporters more than any candidate from the competing party does, we prove that the two-party election game in both the linear link model and the softmax model always has pure Nash equilibria, and furthermore, the price of anarchy is constantly bounded.
Communications in computer and information science, 2022
arXiv (Cornell University), Mar 25, 2023
arXiv (Cornell University), Mar 5, 2018
From a perspective of designing or engineering for opinion formation games in social networks, th... more From a perspective of designing or engineering for opinion formation games in social networks, the opinion maximization (or minimization) problem has been studied mainly for designing subset selecting algorithms. We define a two-player zero-sum Stackelberg game of competitive opinion optimization by letting the player under study as the leader minimize the sum of expressed opinions by doing so-called "internal opinion design", knowing that the other adversarial player as the follower is to maximize the same objective by also conducting her own internal opinion design. We furthermore consider multiagent learning, specifically using the Optimistic Gradient Descent Ascent, and analyze its convergence to equilibria in the simultaneous version of competitive opinion optimization.
Journal of the Chinese Institute of Engineers
Information Processing Letters, 2013
ABSTRACT Property testing considers the following task: given a function ψ over a domain D, a pro... more ABSTRACT Property testing considers the following task: given a function ψ over a domain D, a property P and a parameter 0<ϵ<1, by querying function values of f over o(|D|) elements in D, determine if ψ satisfies P or differs from any one which satisfies P in at least ϵ|D| elements. We focus on consistency of quartet topologies. Given a set Q of quartet topologies over an n-taxon set and an upper bound k on the number of quartets whose topologies are missing, we present a non-adaptive property tester with one-sided error, which runs in O(1.7321^k kn^3/ϵ) time and uses O(kn^3/ϵ) queries, to test if Q is consistent with an evolutionary tree.
Applied Sciences, 2022
In the past few years, with the development of information technology and the focus on informatio... more In the past few years, with the development of information technology and the focus on information security, many studies have gradually been aimed at data hiding technology. The embedding and extraction algorithms are mainly used by the technology to hide the data that requires secret transmission into a multimedia carrier so that the data transmission cannot be realized to achieve secure communication. Among them, reversible data hiding (RDH) is a technology for the applications that demand the secret data extraction as well as the original carrier recovery without distortion, such as remote medical diagnosis or military secret transmission. In this work, we hypothesize that the RDH performance can be enhanced by a more accurate pixel value predictor. We propose a new RDH scheme of prediction-error expansion (PEE) based on a multilayer perceptron, which is an extensively used artificial neural network in plenty of applications. The scheme utilizes the correlation between image pix...
In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-p... more In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-party election system, especially regarding the nomination process. Each of the two parties has its own candidates, and each of them brings utilities for the people including the supporters and non-supporters. In an election, each party nominates exactly one of its candidates to compete against the other party's. The candidate wins the election with higher odds if he or she brings more utility for all the people. We model such competition as a "two-party election game" such that each party is a player with two or more pure strategies corresponding to its potential candidates, and the payoff of each party is a mixed utility from a selected pair of competing candidates. By looking into the three models, namely, the linear link, Bradley-Terry, and the softmax models, which differ in how to formulate a candidate's winning odds against the competing candidate, we show that th...
Exercise 4.10. A casino is testing a new class of simple slot machines. Each game, the player put... more Exercise 4.10. A casino is testing a new class of simple slot machines. Each game, the player puts in 1,andtheslotmachineissupposedtoreturneither1, and the slot machine is supposed to return either 1,andtheslotmachineissupposedtoreturneither3 to the player with probability 4/25, 100withprobability1/200,ornothingwithallremainingprobability.Eachgameissupposedtobeindependentofothergames.Thecasinohasbeensurprisedtofindintestingthatthemachineshavelost100 with probability 1/200, or nothing with all remaining probability. Each game is supposed to be independent of other games. The casino has been surprised to find in testing that the machines have lost 100withprobability1/200,ornothingwithallremainingprobability.Eachgameissupposedtobeindependentofothergames.Thecasinohasbeensurprisedtofindintestingthatthemachineshavelost10,000 over the first million games. Derive a Chernoff bound for the probability of this event. You may want to use a calculator or program to help you choose appropriate values as you derive your bound.
Many scenarios in our daily life require us to infer some ranking over items or people based on l... more Many scenarios in our daily life require us to infer some ranking over items or people based on limited information. In this paper, we consider two such scenarios, one for ranking student papers in massive online open courses and one for identifying the best player (or team) in sports tournaments. For the peer grading problem, we design a mechanism with a new way of matching graders to papers. This allows us to aggregate partial rankings from graders into a global one, with an accuracy rate matching the best in previous works, but with a much simpler analysis. For the winner selection problem in sports tournaments, we cast it as the well-known dueling bandit problem and identify a new measure to minimize: the number of parallel rounds, as one normally would not like a large tournament to last too long. We provide mechanisms which can determine the optimal or an almost optimal player in a small number of parallel rounds and at the same time using a small number of competitions.
BMC plant biology, Jan 5, 2015
BackgroundCrop plants such as rice, maize and sorghum play economically-important roles as main s... more BackgroundCrop plants such as rice, maize and sorghum play economically-important roles as main sources of food, fuel, and animal feed. However, current genome annotations of crop plants still suffer false-positive predictions; a more comprehensive registry of alternative splicing (AS) events is also in demand. Comparative genomics of crop plants is largely unexplored.ResultsWe performed a large-scale comparative analysis (ExonFinder) of the expressed sequence tag (EST) library from nine grass plants against three crop genomes (rice, maize, and sorghum) and identified 2,879 previously-unannotated exons (i.e., novel exons) in the three crops. We validated 81% of the tested exons by RT-PCR-sequencing, supporting the effectiveness of our in silico strategy. Evolutionary analysis reveals that the novel exons, comparing with their flanking annotated ones, are generally under weaker selection pressure at the protein level, but under stronger pressure at the RNA level, suggesting that most...
Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive inte-... more Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive inte- ger k as the parameter, the parameterized Mini- mum Quartet Inconsistency (MQI) problem is to decide whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in at mostk quartet topologies.
Theory of Computing Systems / Mathematical Systems Theory, 2011
Property testing is a rapid growing field in theoretical computer science. It considers the follo... more Property testing is a rapid growing field in theoretical computer science. It considers the following task: given a function f over a domain D, a property ℘ and a parameter 0<ε<1, by examining function values of f over o(|D|) elements in D, determine whether f satisfies ℘ or differs from any one which satisfies ℘ in at least ε|D| elements. An algorithm that fulfills this task is called a property tester. We focus on tree-likeness of quartet topologies, which is a combinatorial property originating from evolutionary tree construction. The input function is f Q , which assigns one of the three possible topologies for every quartet over an n-taxon set S. We say that f Q satisfies tree-likeness if there exists an evolutionary tree T whose induced quartet topologies coincide with f Q . In this paper, we prove the existence of a set of quartet topologies of error number at least cnchoose4c{n\choose 4}cnchoose4 for some constant c>0, and present the first property tester for tree-likeness of quartet topologies. Our property tester makes at most O(n 3/ε) queries, and is of one-sided error and non-adaptive.
Information Processing Letters, 2010
Let S be a set of elements. We say that a collection C of subsets of S has the consecutive ones p... more Let S be a set of elements. We say that a collection C of subsets of S has the consecutive ones property if there exist a linear order on S and a 0-1 matrix M , where M ij = 1 if and only if the jth element is in the ith set in C, such that all 1's appear consecutively in each row of M . We say that a set X in a collection C is hit by a subset S ′ ⊆ S if X ∩ S ′ = ∅. Let C r (red collection) and C b (blue collection) be two collections of subsets of S respectively. The red-blue hitting set problem asks for a subset S ′ ⊆ S such that all sets in the blue collection must be hit by S ′ , while the number of sets in the red collection hit by S ′ has to be minimum. We present a shortest-path based algorithm with time complexity O(|C b ||S| + |C r ||S| + |S| 2 ) for this problem with C r ∪ C b having the consecutive ones property, which improves the previous time bound O(|C r ||C b ||S| 2 ) by Dom et al. .
Theory of Computing Systems / Mathematical Systems Theory, 2010
Let S be a set of n taxa. Given a parameter k and a set of quartet topologies Q over S such that ... more Let S be a set of n taxa. Given a parameter k and a set of quartet topologies Q over S such that there is exactly one topology for every subset of four taxa, the parameterized Minimum Quartet Inconsistency (MQI) problem is to decide whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in at most k quartet topologies. The best fixed-parameter algorithm devised so far for the parameterized MQI problem runs in time O(4k n+n 4). In this paper, first we present an O(3.0446k n+n 4) fixed-parameter algorithm and an O(2.0162k n 3+n 5) fixed-parameter algorithm for the parameterized MQI problem. Finally, we give an O *((1+ε)k ) fixed-parameter algorithm, where ε>0 is an arbitrarily small constant.
Theory of Computing Systems / Mathematical Systems Theory, 2008
Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive integ... more Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive integer k as the parameter, the parameterized Minimum Quartet Inconsistency (MQI) problem is to decide whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in at most k quartet topologies. The best fixed-parameter algorithm devised so far for the parameterized MQI problem runs in time O(4k n + n 4). In this paper, first we present an O(3.0446k n + n 4) algorithm and an O(2.0162k n 3 + n 5) algorithm. Finally, we give an O *((1 + ε)k ) algorithm with an arbitrarily small constant ε> 0.
IEEE Computational Intelligence Magazine
Lecture Notes in Computer Science, 2023
arXiv (Cornell University), Jan 16, 2020
In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-p... more In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-party election system, especially regarding the nomination process. Each of the two parties has its own candidates, and each of them brings utilities for the people including the supporters and nonsupporters. In an election, each party nominates exactly one of its candidates to compete against the other party's. The candidate wins the election with higher odds if he or she brings more utility for all the people. We model such competition as a two-party election game such that each party is a player with two or more pure strategies corresponding to its potential candidates, and the payoff of each party is a mixed utility from a selected pair of competing candidates. By looking into the three models, namely, the linear link, Bradley-Terry, and the softmax models, which differ in how to formulate a candidate's winning odds against the competing candidate, we show that the two-party election game may neither have any pure Nash equilibrium nor a bounded price of anarchy. Nevertheless, by considering the conventional egoism, which states that any candidate benefits his/her party's supporters more than any candidate from the competing party does, we prove that the two-party election game in both the linear link model and the softmax model always has pure Nash equilibria, and furthermore, the price of anarchy is constantly bounded.
Communications in computer and information science, 2022
arXiv (Cornell University), Mar 25, 2023
arXiv (Cornell University), Mar 5, 2018
From a perspective of designing or engineering for opinion formation games in social networks, th... more From a perspective of designing or engineering for opinion formation games in social networks, the opinion maximization (or minimization) problem has been studied mainly for designing subset selecting algorithms. We define a two-player zero-sum Stackelberg game of competitive opinion optimization by letting the player under study as the leader minimize the sum of expressed opinions by doing so-called "internal opinion design", knowing that the other adversarial player as the follower is to maximize the same objective by also conducting her own internal opinion design. We furthermore consider multiagent learning, specifically using the Optimistic Gradient Descent Ascent, and analyze its convergence to equilibria in the simultaneous version of competitive opinion optimization.
Journal of the Chinese Institute of Engineers
Information Processing Letters, 2013
ABSTRACT Property testing considers the following task: given a function ψ over a domain D, a pro... more ABSTRACT Property testing considers the following task: given a function ψ over a domain D, a property P and a parameter 0<ϵ<1, by querying function values of f over o(|D|) elements in D, determine if ψ satisfies P or differs from any one which satisfies P in at least ϵ|D| elements. We focus on consistency of quartet topologies. Given a set Q of quartet topologies over an n-taxon set and an upper bound k on the number of quartets whose topologies are missing, we present a non-adaptive property tester with one-sided error, which runs in O(1.7321^k kn^3/ϵ) time and uses O(kn^3/ϵ) queries, to test if Q is consistent with an evolutionary tree.
Applied Sciences, 2022
In the past few years, with the development of information technology and the focus on informatio... more In the past few years, with the development of information technology and the focus on information security, many studies have gradually been aimed at data hiding technology. The embedding and extraction algorithms are mainly used by the technology to hide the data that requires secret transmission into a multimedia carrier so that the data transmission cannot be realized to achieve secure communication. Among them, reversible data hiding (RDH) is a technology for the applications that demand the secret data extraction as well as the original carrier recovery without distortion, such as remote medical diagnosis or military secret transmission. In this work, we hypothesize that the RDH performance can be enhanced by a more accurate pixel value predictor. We propose a new RDH scheme of prediction-error expansion (PEE) based on a multilayer perceptron, which is an extensively used artificial neural network in plenty of applications. The scheme utilizes the correlation between image pix...
In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-p... more In this paper, we propose a simple and intuitive model to investigate the efficiency of the two-party election system, especially regarding the nomination process. Each of the two parties has its own candidates, and each of them brings utilities for the people including the supporters and non-supporters. In an election, each party nominates exactly one of its candidates to compete against the other party's. The candidate wins the election with higher odds if he or she brings more utility for all the people. We model such competition as a "two-party election game" such that each party is a player with two or more pure strategies corresponding to its potential candidates, and the payoff of each party is a mixed utility from a selected pair of competing candidates. By looking into the three models, namely, the linear link, Bradley-Terry, and the softmax models, which differ in how to formulate a candidate's winning odds against the competing candidate, we show that th...
Exercise 4.10. A casino is testing a new class of simple slot machines. Each game, the player put... more Exercise 4.10. A casino is testing a new class of simple slot machines. Each game, the player puts in 1,andtheslotmachineissupposedtoreturneither1, and the slot machine is supposed to return either 1,andtheslotmachineissupposedtoreturneither3 to the player with probability 4/25, 100withprobability1/200,ornothingwithallremainingprobability.Eachgameissupposedtobeindependentofothergames.Thecasinohasbeensurprisedtofindintestingthatthemachineshavelost100 with probability 1/200, or nothing with all remaining probability. Each game is supposed to be independent of other games. The casino has been surprised to find in testing that the machines have lost 100withprobability1/200,ornothingwithallremainingprobability.Eachgameissupposedtobeindependentofothergames.Thecasinohasbeensurprisedtofindintestingthatthemachineshavelost10,000 over the first million games. Derive a Chernoff bound for the probability of this event. You may want to use a calculator or program to help you choose appropriate values as you derive your bound.
Many scenarios in our daily life require us to infer some ranking over items or people based on l... more Many scenarios in our daily life require us to infer some ranking over items or people based on limited information. In this paper, we consider two such scenarios, one for ranking student papers in massive online open courses and one for identifying the best player (or team) in sports tournaments. For the peer grading problem, we design a mechanism with a new way of matching graders to papers. This allows us to aggregate partial rankings from graders into a global one, with an accuracy rate matching the best in previous works, but with a much simpler analysis. For the winner selection problem in sports tournaments, we cast it as the well-known dueling bandit problem and identify a new measure to minimize: the number of parallel rounds, as one normally would not like a large tournament to last too long. We provide mechanisms which can determine the optimal or an almost optimal player in a small number of parallel rounds and at the same time using a small number of competitions.
BMC plant biology, Jan 5, 2015
BackgroundCrop plants such as rice, maize and sorghum play economically-important roles as main s... more BackgroundCrop plants such as rice, maize and sorghum play economically-important roles as main sources of food, fuel, and animal feed. However, current genome annotations of crop plants still suffer false-positive predictions; a more comprehensive registry of alternative splicing (AS) events is also in demand. Comparative genomics of crop plants is largely unexplored.ResultsWe performed a large-scale comparative analysis (ExonFinder) of the expressed sequence tag (EST) library from nine grass plants against three crop genomes (rice, maize, and sorghum) and identified 2,879 previously-unannotated exons (i.e., novel exons) in the three crops. We validated 81% of the tested exons by RT-PCR-sequencing, supporting the effectiveness of our in silico strategy. Evolutionary analysis reveals that the novel exons, comparing with their flanking annotated ones, are generally under weaker selection pressure at the protein level, but under stronger pressure at the RNA level, suggesting that most...
Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive inte-... more Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive inte- ger k as the parameter, the parameterized Mini- mum Quartet Inconsistency (MQI) problem is to decide whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in at mostk quartet topologies.
Theory of Computing Systems / Mathematical Systems Theory, 2011
Property testing is a rapid growing field in theoretical computer science. It considers the follo... more Property testing is a rapid growing field in theoretical computer science. It considers the following task: given a function f over a domain D, a property ℘ and a parameter 0<ε<1, by examining function values of f over o(|D|) elements in D, determine whether f satisfies ℘ or differs from any one which satisfies ℘ in at least ε|D| elements. An algorithm that fulfills this task is called a property tester. We focus on tree-likeness of quartet topologies, which is a combinatorial property originating from evolutionary tree construction. The input function is f Q , which assigns one of the three possible topologies for every quartet over an n-taxon set S. We say that f Q satisfies tree-likeness if there exists an evolutionary tree T whose induced quartet topologies coincide with f Q . In this paper, we prove the existence of a set of quartet topologies of error number at least cnchoose4c{n\choose 4}cnchoose4 for some constant c>0, and present the first property tester for tree-likeness of quartet topologies. Our property tester makes at most O(n 3/ε) queries, and is of one-sided error and non-adaptive.
Information Processing Letters, 2010
Let S be a set of elements. We say that a collection C of subsets of S has the consecutive ones p... more Let S be a set of elements. We say that a collection C of subsets of S has the consecutive ones property if there exist a linear order on S and a 0-1 matrix M , where M ij = 1 if and only if the jth element is in the ith set in C, such that all 1's appear consecutively in each row of M . We say that a set X in a collection C is hit by a subset S ′ ⊆ S if X ∩ S ′ = ∅. Let C r (red collection) and C b (blue collection) be two collections of subsets of S respectively. The red-blue hitting set problem asks for a subset S ′ ⊆ S such that all sets in the blue collection must be hit by S ′ , while the number of sets in the red collection hit by S ′ has to be minimum. We present a shortest-path based algorithm with time complexity O(|C b ||S| + |C r ||S| + |S| 2 ) for this problem with C r ∪ C b having the consecutive ones property, which improves the previous time bound O(|C r ||C b ||S| 2 ) by Dom et al. .
Theory of Computing Systems / Mathematical Systems Theory, 2010
Let S be a set of n taxa. Given a parameter k and a set of quartet topologies Q over S such that ... more Let S be a set of n taxa. Given a parameter k and a set of quartet topologies Q over S such that there is exactly one topology for every subset of four taxa, the parameterized Minimum Quartet Inconsistency (MQI) problem is to decide whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in at most k quartet topologies. The best fixed-parameter algorithm devised so far for the parameterized MQI problem runs in time O(4k n+n 4). In this paper, first we present an O(3.0446k n+n 4) fixed-parameter algorithm and an O(2.0162k n 3+n 5) fixed-parameter algorithm for the parameterized MQI problem. Finally, we give an O *((1+ε)k ) fixed-parameter algorithm, where ε>0 is an arbitrarily small constant.
Theory of Computing Systems / Mathematical Systems Theory, 2008
Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive integ... more Given a set of n taxa S, exactly one topology for every subset of four taxa, and a positive integer k as the parameter, the parameterized Minimum Quartet Inconsistency (MQI) problem is to decide whether we can find an evolutionary tree inducing a set of quartet topologies that differs from the given set in at most k quartet topologies. The best fixed-parameter algorithm devised so far for the parameterized MQI problem runs in time O(4k n + n 4). In this paper, first we present an O(3.0446k n + n 4) algorithm and an O(2.0162k n 3 + n 5) algorithm. Finally, we give an O *((1 + ε)k ) algorithm with an arbitrarily small constant ε> 0.