Associate Professor Yuqing Lin
Associate Professor
School of Information and Physical Sciences (Computer Science and Software Engineering)
 Email:yuqing.lin@newcastle.edu.au
 Phone:(02) 4921 6076
Career Summary
Biography
Yuqing Lin was awarded PhD from The University of Newcastle in 2004. Fulltime acedmic staff of the University of Newcastle since 2004.
Research Expertise
Dr. Yuqing Lin's principal area is Graph Theory, he is interested in the structural properties of graphs and also the construction of graphs. Dr. Yuqing Lin's other area of research is Software Engineering and his main focus in that area is software reuse and software product line engineering.
Teaching Expertise
Software Engineering Operating Systems Web Engineering
Administrative Expertise
Currently the Program Convenor of Software Engineering Program and Postgraduate Coordinator.
Qualifications
 PhD, University of Newcastle
 Bachelor of Science, Lanzhou University  China
 Master of Information Technology, University of Newcastle
Keywords
 Combinatorics
 Computer Science
 Graph Theory
 Software Engineering
 Software Enineering
Languages
 Mandarin (Fluent)
Fields of Research
Code  Description  Percentage 

461207  Software quality, processes and metrics  100 
Professional Experience
UON Appointment
Title  Organisation / Department 

Associate Professor  University of Newcastle School of Electrical Engineering and Computing Australia 
Academic appointment
Dates  Title  Organisation / Department 

1/9/2003   Lecturer  University of Newcastle School of Electrical Engineering and Computing Australia 
Membership
Dates  Title  Organisation / Department 

Member  The Institute of Combinatorics and its Application  The Institute of Combinatorics and its Application Australia 
Publications
For publications that are currently unpublished or inpress, details are shown in italics.
Chapter (2 outputs)
Year  Citation  Altmetrics  Link  

2020 
Javed M, Lin Y, 'Automated assessment of ER model using the domain knowledge', Studies in Computational Intelligence, Springer Nature, Cham, Switzerland 143162 (2020) [B1]


2019 
Chiong R, Hu Z, Fan Z, Lin Y, Chalup S, Desmet A, 'A bioinspired clustering model for anomaly detection in the mining industry', Bioinspired Computing Models and Applications, World Scientific Publishing, Singapore 133155 (2019) [B1]

Journal article (72 outputs)
Year  Citation  Altmetrics  Link  

2021 
Cheers H, Lin Y, Smith SP, 'Academic Source Code Plagiarism Detection by Measuring Program Behavioural Similarity', IEEE Access, 9 5039150412 (2021) [C1]


2021 
Javed M, Lin Y, 'iMER: Iterative process of entity relationship and business process model extraction from the requirements', Information and Software Technology, 135 (2021) [C1] Context: Extracting conceptual models, e.g., entity relationship model or Business Process model, from software requirement document is an essential task in the software developme... [more] Context: Extracting conceptual models, e.g., entity relationship model or Business Process model, from software requirement document is an essential task in the software development life cycle. Business process model presents a clear picture of required system's functionality. Operations in business process model together with the data entity consumed, help the software developers to understand the database design and operations to be implemented. Researchers have been aiming at automatic extraction of these artefacts from the requirement document. Objective: In this paper, we present an automated approach to extract the entity relationship and business process models from requirements, which are possibly in different formats such as general requirements, use case specification and user stories. Our approach is based on the efficient natural language processing techniques. Method: It is an iterative approach of Models Extraction from the Requirements (iMER). iMER has multiple iterations where each iteration is to address a subproblem. In the first iteration, iMER extracts the data entities and attributes. Second iteration is to find the relationships between data entities, while extracting cardinalities is in the third step. Business process model is generated in the fourth iteration, containing the external (actors¿) and internal (system's) operations. Evaluation: To evaluate the performance and accuracy of iMER, experiments are conducted on various formats of the requirement documents. Additionally, we have also evaluated our approaches using the requirement documents which been modified by shuffling the sentences and by merging with other requirements. Comparative study is also performed. The preliminary results show a noticeable improvement. Conclusion: The iMER is an efficient automated iterative approach that is able to extract the conceptual models from the various formats of requirements.


2021 
Zhang F, Lin Y, 'A lower bound on the number of perfect matchings in benzenoid systems', Match, 85 711 (2021) [C1] The number of perfect matchings in a benzenoid system increases when its size grows. This raises a question on the lower bound of the number of perfect matchings in benzenoid syst... [more] The number of perfect matchings in a benzenoid system increases when its size grows. This raises a question on the lower bound of the number of perfect matchings in benzenoid systems. In this paper, we show that this lower bound is 9. Further more, we construct an infinite family of benzenoid system whose number of perfect matchings reaches the lower bound. 

2021 
Cheers H, Lin Y, Smith SP, 'Evaluating the robustness of source code plagiarism detection tools to pervasive plagiarismhiding modifications', Empirical Software Engineering, 26 (2021) Source code plagiarism is a common occurrence in undergraduate computer science education. In order to identify such cases, many source code plagiarism detection tools have been p... [more] Source code plagiarism is a common occurrence in undergraduate computer science education. In order to identify such cases, many source code plagiarism detection tools have been proposed. A source code plagiarism detection tool evaluates pairs of assignment submissions to detect indications of plagiarism. However, a plagiarising student will commonly apply plagiarismhiding modifications to source code in an attempt to evade detection. Subsequently, prior work has implied that currently available source code plagiarism detection tools are not robust to the application of pervasive plagiarismhiding modifications. In this article, 11 source code plagiarism detection tools are evaluated for robustness against plagiarismhiding modifications. The tools are evaluated with data sets of simulated undergraduate plagiarism, constructed with source code modifications representative of undergraduate students. The results of the performed evaluations indicate that currently available source code plagiarism detection tools are not robust against modifications which apply finegrained transformations to the source code structure. Of the evaluated tools, JPlag and Plaggie demonstrates the greatest robustness to different types of plagiarismhiding modifications. However, the results also indicate that graphbased tools, specifically those that compare programs as program dependence graphs, show potentially greater robustness to pervasive plagiarismhiding modifications.


2021 
Bong NH, Lin Y, 'Some properties of the multiset dimension of graphs', Electronic Journal of Graph Theory and Applications, 9 215221 (2021) [C1] The multiset dimension was introduced by Rinovia Simanjuntak et al. as a variation of metric dimension. In this problem, the representation of a vertex v with respect to a resolvi... [more] The multiset dimension was introduced by Rinovia Simanjuntak et al. as a variation of metric dimension. In this problem, the representation of a vertex v with respect to a resolving set W is expressed as a multiset of distances between v and all vertices in W, including their multiplicities. The multiset dimension is defined to be the minimum cardinality of the resolving set. Clearly, this is at least the metric dimension of a graph. In this paper, we study the properties of the multiset dimension of graphs.


2021 
Javed M, Lin Y, 'IMERFM: Iterative Process of System Feature Model Extraction from the Requirements', International Journal of Software Engineering and Knowledge Engineering, 31 435475 (2021) [C1] Software product line engineering (SPLE) is a paradigm to promote systematic software reuse. A Feature Model (FM) is a common means to illustrate the commonality and variability o... [more] Software product line engineering (SPLE) is a paradigm to promote systematic software reuse. A Feature Model (FM) is a common means to illustrate the commonality and variability of software products in a family. In most existing FM extraction approaches, keywords in the requirement document or certain types of system behavior or external events are considered features. The resulting FM is a combination of user activities and system actions (SAs), making it hard to understand. In this paper, we present an automatic approach to generate a product line FM from multiple requirement documents. We consider user activity and SAs separately in our approach and focus on the expected behaviors of the software system, together with the data being processed. The resulting FM clearly illustrates the expected functionalities of the software system and their variability in the product line. We also compared our approach with existing techniques by processing the same textual documents, and noted improvements in our results.


2021 
Jin XA, Ge J, Cheng XS, Lin YQ, 'The Number of Circles of a Maximum State of a Plane Graph with Applications', Acta Mathematicae Applicatae Sinica, 37 409420 (2021) [C1] Motivated by the connection with the genus of the corresponding link and its application on DNA polyhedral links, in this paper, we introduce a parameter smax(G), which is the max... [more] Motivated by the connection with the genus of the corresponding link and its application on DNA polyhedral links, in this paper, we introduce a parameter smax(G), which is the maximum number of circles of states of the link diagram D(G) corresponding to a plane (positive) graph G. We show that smax(G) does not depend on the embedding of G and if G is a 4edgeconnected plane graph then smax(G) is equal to the number of faces of G, which cover the results of S. Y. Liu and H. P. Zhang as special cases.


2020 
Fan Z, Chiong R, Hu Z, Lin Y, 'A multilayer fuzzy model based on fuzzyrule clustering for prediction tasks', Neurocomputing, 410 114124 (2020) [C1]


2020 
Fan Z, Chiong R, Hu Z, Lin Y, 'A fuzzy weighted relative error support vector machine for reverse prediction of concrete components', Computers and Structures, 230 (2020) [C1]


2020 
Rylands L, Seberry J, Yi X, Kelarev A, Ryan J, Lin Y, 'Collusionresistant protocols for private processing of aggregated queries in distributed databases', DISTRIBUTED AND PARALLEL DATABASES, 39 97127 (2020) [C1]


2019 
Yu QR, Lin Y, 'Preface', Journal of Interconnection Networks, 19 (2019)


2019 
Hu Z, Chiong R, Pranata I, Bao Y, Lin Y, 'Malicious web domain identification using online credibility and performance data by considering the class imbalance issue', INDUSTRIAL MANAGEMENT & DATA SYSTEMS, 119 676696 (2019) [C1]


2019 
Fan Z, Chiong R, Hu Z, Dhakal S, Lin Y, 'A twolayer WangMendel fuzzy approach for predicting the residuary resistance of sailing yachts', JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 36 62196229 (2019) [C1]


2018 
Wang M, Lin Y, Wang S, 'The 1goodneighbor connectivity and diagnosability of Cayley graphs generated by complete graphs', Discrete Applied Mathematics, 246 108118 (2018) Diagnosability is a significant metric to measure the reliability of multiprocessor systems. In 2012, a new measure for fault tolerance of the system was proposed by Peng et al. T... [more] Diagnosability is a significant metric to measure the reliability of multiprocessor systems. In 2012, a new measure for fault tolerance of the system was proposed by Peng et al. This measure is called the ggoodneighbor diagnosability that restrains every faultfree node to contain at least g faultfree neighbors. The Cayley graph CKn generated by the complete graph Kn has many good properties as other Cayley graphs. In this paper, we show that the connectivity of CKn is [Formula presented], the 1goodneighbor connectivity of CKn is n2n2 and the 1goodneighbor diagnosability of CKn under the PMC model is n2n1 for n=4 and under the MM* model is n2n1 for n=5.


2018 
Wang M, Lin Y, Wang S, Wang M, 'Sufficient conditions for graphs to be maximally 4restricted edge connected', The Australasian Journal of Combinatorics, 70 123136 (2018) [C1]


2017 
Lu H, Lin Y, 'On the number of disjoint perfect matchings of regular graphs with given edge connectivity', Discrete Mathematics, 340 305310 (2017) [C1]


2017 
Bong NH, Lin Y, Slamin, 'On distanceirregular labelings of cycles and wheels', AUSTRALASIAN JOURNAL OF COMBINATORICS, 69 315322 (2017) [C1]


2017  Lin Y, Wang M, Xu L, Zhang F, 'The maximum forcing number of a polyomino', Australasian Journal of Combinatorics, 69 306314 (2017) [C1]  
2017 
Wang M, Ren Y, Lin Y, Wang S, 'The Tightly Super 3Extra Connectivity and Diagnosability of Locally Twisted Cubes', American Journal of Computational Mathematics, 07 127144 (2017) [C1]


2017 
Lin Y, Zhang F, 'A linear algorithm for a perfect matching in polyomino graphs', Theoretical Computer Science, 675 8288 (2017) [C1]


2017  Wang M, Lin Y, Wang S, 'The Nature Diagnosability of Bubblesort Star Graphs under the PMC Model and MM Model', International Journal of Engineering and Applied Sciences, 4 5560 (2017) [C1]  
2017 
Wang M, Lin Y, Wang S, 'THE CONNECTIVITY AND NATURE DIAGNOSABILITY OF EXPANDED kARY nCUBES', RAIROTHEORETICAL INFORMATICS AND APPLICATIONS, 51 7189 (2017) [C1]


2017 
Baca M, Baskoro ET, Brankovic L, Jendrol' S, Lin Y, Phanalasy O, et al., 'A survey of faceantimagic evaluations of graphs', AUSTRALASIAN JOURNAL OF COMBINATORICS, 69 382393 (2017) [C1]


2016 
Houliston T, Fountain J, Lin Y, Mendes A, Metcalfe M, Walker J, Chalup SK, 'NUClear: A Loosely Coupled Software Architecture for Humanoid Robot Systems', Frontiers in Robotics and AI, 3 115 (2016) [C1]


2016 
Wang M, Lin Y, Wang S, 'The 2goodneighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model', THEORETICAL COMPUTER SCIENCE, 628 92100 (2016) [C1]


2016 
Liu SY, Zhang HP, Lu HL, Lin YQ, 'A note on the strong edgecoloring of outerplanar graphs with maximum degree 3', Acta Mathematicae Applicatae Sinica, 32 883890 (2016) [C1]


2015 
Yang Q, Zhang H, Lin Y, 'On the antiforcing number of fullerene graphs', Match, 74 673692 (2015) [C1] The antiforcing number of a connected graph G is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching. In thi... [more] The antiforcing number of a connected graph G is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching. In this paper, we show that the antiforcing number of every fullerene has at least four. We give a procedure to construct all fullerenes whose antiforcing numbers achieve the lower bound four. Furthermore, we show that, for every even n = 20 (n 6= 22; 26), there exists a fullerene with n vertices that has the antiforcing number four, and the fullerene with 26 vertices has the antiforcing number five.


2015 
Lu HL, Wang W, Lin Y, 'On edge connectivity and parity factor', Acta Mathematica Sinica, English Series, 31 772776 (2015) [C1]


2015 
Lu H, Lin Y, 'Maximum spectral radius of graphs with given connectivity, minimum degree and independence number', Journal of Discrete Algorithms, 31 113119 (2015) [C1]


2014 
Zhang G, Ye H, Lin Y, 'Quality attribute modeling and quality aware product configuration in software product lines', Software Quality Journal, 22 137 (2014) [C1]


2013  Hongliang L, Yuqing L, 'Note on parity factors of regular graphs', Electronic Journal of Graph Theory and Applications, 1 5055 (2013) [C1]  
2013 
Lu H, Wu Y, Lin Y, Yu Q, Balbuena C, Marcote X, 'On Superconnectivity of (4, g)Cages', Graphs and Combinatorics, 29 105119 (2013) [C1] A (k, g)cage is a graph that has the least number of vertices among all kregular graphs with girth g. It has been conjectured (Fu et al. in J. Graph Theory, 24:187191, 1997) th... [more] A (k, g)cage is a graph that has the least number of vertices among all kregular graphs with girth g. It has been conjectured (Fu et al. in J. Graph Theory, 24:187191, 1997) that all (k, g)cages are kconnected for every k = 3. A kconnected graph G is called superconnected if every kcutset S is the neighborhood of some vertex. Moreover, if GS has precisely two components, then G is called tightly superconnected. In this paper, we prove that every (4, g)cage is tightly superconnected when g = 11 is odd. © 2011 Springer.


2013 
Zhang G, Ye H, Lin Y, 'An approach for validating feature models in software product lines', Journal of Software Engineering, 7 129 (2013) [C1]


2012 
Yang Q, Ye D, Zhang H, Lin Y, 'On the antiKekule number of fullerenes', MatchCommunications in Mathematical and in Computer Chemistry, 67 281288 (2012) [C1]


2011 
Lu HL, Wu YJ, Yu QL, Lin Y, 'New improvements on connectivity of cages', Acta Mathematica Sinica, 27 11631172 (2011) [C1]


2010 
Tang J, Lin Y, Miller M, 'New results on EX graphs', Mathematics in Computer Science, 3 119126 (2010) [C1]


2010 
Lin Y, Lu H, Wu Y, Yu Q, 'On superconnectivity of (4,g)cages with even girth', Networks, 56 143148 (2010) [C1]


2010 
Baca M, Lin Y, MuntanerBatle FA, 'Edgeantimagic labelings of forests', Utilitas Mathematica, 81 3140 (2010) [C1]


2010  Balbuena C, GonzalazMoreno D, Lin Y, Marcote X, 'On the lower bound of vertex connectivity of semiregular cages', Utilitas Mathematica, 83 5768 (2010) [C1]  
2009 
Delorme C, Flandrin E, Lin Y, Miller M, Ryan JF, 'On extremal graphs with bounded girth', Electronic Notes in Discrete Mathematics, 34 653657 (2009) [C2]


2009 
Ali G, Baca M, Lin Y, SemanicovaFenovcikova A, 'Supervertexantimagic total labelings of disconnected graphs', Discrete Mathematics, 309 60486054 (2009) [C1]


2009 
Lin Y, Balbuena C, Miller M, 'On the number of components of (k, g)cages after vertex deletion', Discrete Applied Mathematics, 157 17601765 (2009) [C1]


2009 
Balbuena C, Tang J, Marshall KL, Lin Y, 'Superconnectivity of regular graphs with small diameter', Discrete Applied Mathematics, 157 13491353 (2009) [C1]


2009 
Baca M, Lin Y, MuntanerBatle FA, 'Normalized embedding of pathlike trees', Utilitas Mathematica, 78 1131 (2009) [C1]


2009  Lin Y, Smyth B, Baskoro ET, 'Guest editors', Journal of Combinatorial Mathematics and Combinatorial Computing, 71 (2009) [C2]  
2009  Baca M, Lin Y, MuntanerBatle FA, 'A note on even disjoint union of paths', AKCE International Journal of Graphs and Combinatorics, 6 4145 (2009) [C1]  
2009  Baca M, Lin Y, SemanicovaFenovcikova A, 'Note on super antimagicness of disconnected graphs', AKCE International Journal of Graphs and Combinatorics, 6 4755 (2009) [C1]  
2009 
Baca M, Lin Y, MuntanerBatle FA, RiusFont M, 'Strong labelings of linear forests', Acta Mathematica SinicaEnglish Series, 25 19511964 (2009) [C1]


2008 
Tang J, Miller M, Lin Y, 'HSAGA and its application for the construction of nearMoore digraphs', Journal of Discrete Algorithms, 6 7384 (2008) [C1]


2008 
Lin Y, Balbuena C, Marcote X, Miller M, 'On the connectivity of (k, g)cages of even girth', Discrete Mathematics, 308 32493256 (2008) [C1]


2008 
Balbuena C, Lin Y, Miller M, 'Diametersufficient conditions for a graph to be superrestricted connected', Discrete Applied Mathematics, 156 28272834 (2008) [C1]


2007 
Baca M, Lin Y, 'Antimagic labelings of grids', Utilitas Mathematica, 72 6575 (2007) [C1]


2007 
Baca M, Lin Y, MuntanerBatle FA, 'Super edgeantimagic labelings of the pathlike trees', Utilitas Mathematica, 73 117128 (2007) [C1]


2007 
Balbuena C, Jiang T, Lin Y, Marcote X, Miller M, 'A lower bound on the order of regular graphs with given girth pair', Journal of Graph Theory, 55 153163 (2007) [C1]


2007 
Baca M, Lin Y, Miller M, Youssef MZ, 'Edgeantimagic graphs', Discrete Mathematics, 307 12321244 (2007) [C1]


2006 
Lin Y, Miller M, Balbuena C, Marcote X, 'All (k;g)Cages Are EdgeSuperconnected', Networks, 47 102110 (2006) [C1]


2006 
Sugeng KA, Miller M, Lin Y, Baca M, 'Face antimagic labelings of prisms', Utilitas Mathematica, 71 269286 (2006) [C1]


2006 
Baca M, Lin Y, Miller M, Ryan JF, 'Antimagic labelings of Mobius grids', Ars Combinatoria, 78 313 (2006) [C1]


2006 
Lin Y, Sugeng KA, 'Face antimagic labelings of plane graphs Pa(b)', Ars Combinatoria, 80 259273 (2006) [C1]


2006  Tang J, Lin Y, Milller M, 'Calculating the extremal number ex (v ; {C3, C4, ..., Cn})', Electronic Notes in Discrete Mathematics, 27 101102 (2006) [C3]  
2006 
Balbuena C, Barker E, Das KC, Lin Y, Miller M, Ryan J, et al., 'On the degrees of a strongly vertexmagic graph', Discrete Mathematics, 306 539551 (2006) [C1]


2006 
Balbuena C, Barker E, Lin Y, Miller M, Sugeng K, 'Consecutive magic graphs', Discrete Mathematics, 306 18171829 (2006) [C1]


2005 
Lin Y, Miller M, Balbuena C, 'Improved lower bound for the vertex connectivity of ([delta];g)cages', Discrete Mathematics, 299 162171 (2005) [C1]


2005 
Lin Y, Miller M, Rodger C, 'All (k;g)cages are kedgeconnected', Journal of Graph Theory, 48 219227 (2005) [C1]


2004 
Lin Y, Slamin, Baca M, Miller M, 'On dantimagic labelings of prisms', ARS Combinatoria, 72 6576 (2004) [C1]


2003 
Lin Y, Slamin, Miller M, 'On dantimagic labelings of antiprisms', Utilitas Mathematica, 64 213220 (2003) [C1]


2002  Slamin, Baca M, Lin Y, Miller M, Simanjuntak RMG, 'Edgemagic total labelings of wheels, fans and friendship graphs', Bulletin of the Institute of Combinatorics and its Applications, 35 8998 (2002) [C1]  
2001 
Lin Y, Miller M, Simanjuntak RMG, Baca M, 'New constructions of magic and antimagic graph labelings', Utilitas Mathematica, 60 229239 (2001) [C1]


2001  Lin Y, Miller M, 'Vertex magic total Labellings of complete graphs', Bulletin of the Institute of Combinatorics and its Applications, 33 6876 (2001) [C1]  
Show 69 more journal articles 
Conference (42 outputs)
Year  Citation  Altmetrics  Link  

2021 
Cheers H, Lin Y, 'Modelling Dynamics in AspectOriented Programs', Proceedings of the IEEE International Conference on Software Engineering and Service Sciences, ICSESS (2021) Aspectoriented programming is an extension to the objectoriented programming paradigm that aims to provide greater modularization of source code through the identification of as... [more] Aspectoriented programming is an extension to the objectoriented programming paradigm that aims to provide greater modularization of source code through the identification of aspects. Aspects are the representation of crosscutting concerns. These are design elements of code that are scattered or duplicated across multiple classes, and hence cannot be cleanly implemented in objectoriented languages. Though the use of aspects, cross cutting concerns are modularized and can be implemented in a single unit of code. However, aspects effectively allow the extension and modification of existing classes through the injection of new advising code. This ability to inject code provides a degree of dynamism not seen in objectoriented languages, and hence, cannot be modelled with standard objectoriented modelling techniques. In this paper an extension to UML for modelling the dynamics of aspectoriented programs is proposed. This extension affords the modelling any introduced dynamic behavior and its effect on base objectoriented code.


2020 
Cheers H, Lin Y, 'A novel graphbased program representation for java code plagiarism detection', Proceedings of the 3rd International Conference on Software Engineering and Information Management, Sydney, Australia (2020) [E1]


2020 
Cheers H, Lin Y, 'Reverse engineering UML sequence diagrams for program comprehension activities', CITISIA 2020  IEEE Conference on Innovative Technologies in Intelligent Systems and Industrial Applications, Proceedings (2020) Program comprehension is a required activity for many software development and maintenance tasks. A common means of understanding software is though UML diagrams. UML diagrams mod... [more] Program comprehension is a required activity for many software development and maintenance tasks. A common means of understanding software is though UML diagrams. UML diagrams model the design and implementation of an application, describing both its structure and behaviour. However with rapid software development life cycles, UML diagrams often become inconsistent with the implementation of an application. This limits their effectiveness in program comprehension activities. This paper presents a program analysis framework to reverse engineer sequence diagrams from application source code. Part of this framework is the ability to filter out irrelevant operations from a sequence diagram in order to simplify the representation of an application. This is achieved by identifying important data, and following its use in the application. The purpose of this framework is to aid in program comprehension activities by providing up to date representations of an application; while also enabling developers to identify the logical operation of a program without interference from irrelevant or supporting operations.


2020 
Cheers H, Lin Y, Smith SP, 'Detecting Pervasive Source Code Plagiarism through Dynamic Program Behaviours', Proceedings of the TwentySecond Australasian Computing Education Conference, Melbourne, Australia (2020) [E1]


2019 
Cheers H, Javed M, Lin Y, Smith S, 'Exploring a Comprehensive Approach for the Automated Assessment of UML', 2019 8th International Congress on Advanced Applied Informatics (IIAIAAI), Toyama, Japan (2019) [E1]


2019 
Cheers H, Lin Y, Smith SP, 'SPPlagiarise: A Tool for Generating Simulated SemanticsPreserving Plagiarism of Java Source Code', 2019 IEEE 10th International Conference on Software Engineering and Service Science (ICSESS), Beijing, China (2019) [E1]


2019 
Cheers H, Lin Y, Smith SP, 'A Novel Approach for Detecting Logic Similarity in Plagiarised Source Code', 2019 IEEE 10th International Conference on Software Engineering and Service Science (ICSESS), Beijing, China (2019) [E1]


2018 
Javed M, Lin Y, 'Iterative process for generating ER diagram from unrestricted requirements', ENASE 2018  Proceedings of the 13th International Conference on Evaluation of Novel Approaches to Software Engineering, Madeira, Portugal (2018) [E1]


2017 
Zhao L, Wang M, Zhang X, Lin Y, Wang S, 'An Algorithm for the Orientation of Complete Bipartite Graphs', Proceedings of The 2017 International Conference On Applied Mathematics, Modelling And Statistics Application (AMMSA 2017), Beijing, China (2017) [E1]


2017 
Fan Z, Chiong R, Hu Z, Lin Y, 'Investigating the effects of varying cluster numbers on anomalies detected in mining machines', International Conference on Computer and Drone Applications (IConDA 2017), Kuching, Sarawak, Malaysia (2017) [E1]


2016 
Bille RJ, Lin Y, Chalup SK, 'RTCSS: a framework for developing realtime peertopeer web applications', Proceeding ACSW '16 Proceedings of the Australasian Computer Science Week Multiconference, Canberra, Australia (2016) [E1]


2015 
Tan L, Lin Y, 'Using aspectoriented approach for software product line development', ICSOFTEA 2015  10th International Conference on Software Engineering and Applications, Proceedings; Part of 10th International Joint Conference on Software Technologies, ICSOFT 2015 (2015) Software Product Line Engineering (SPLE) is a software development paradigm to improve systematic software reuse. SPLE is intended to develop a set of similar software systems whi... [more] Software Product Line Engineering (SPLE) is a software development paradigm to improve systematic software reuse. SPLE is intended to develop a set of similar software systems which share great commonalities within a particular application domain. There are two key assets underpin Software Product Line (SPL) development: feature model and reference architecture. To deal with complex crosscutting behaviors in SPL and also manage the impact of NonFunctional Requirements (NFRs), we propose an aspectoriented framework in this paper. The proposed framework is able to improve the modeling of interrelationships between design factors and representation of the variabilities in product families. We introduce a small case study to illustrate our approach at the end.


2015 
Lin Y, Tan L, 'An AspectOriented Feature Modelling Framework for Software Product Line Engineering', ASWEC ' 15 Vol. II Proceedings of the ASWEC 2015 24th Australasian Software Engineering Conference, Adelaide (2015) [E1]


2014 
Tan L, Lin Y, Liu L, 'Quality ranking of features in software product line engineering', Proceedings  AsiaPacific Software Engineering Conference, APSEC (2014) [E1] Software Product Line Engineering (SPLE) is a systematic software reuse approach that developing a set of similar software products as a family. All the visible characters of the ... [more] Software Product Line Engineering (SPLE) is a systematic software reuse approach that developing a set of similar software products as a family. All the visible characters of the products in a product family are represented as features and their relationships are modelled in a feature model. During application engineering, desired features are selected from the feature model in a configuration process based on the requirements. In this process, the quality of final product should be considered as early as possible which requires identifying and ranking associated features' contributions to related quality attributes before configuring member products. In this paper, we propose a ranking approach to address the issues in current qualitybased feature ranking approaches, we also include a case study to illustrate our approach at the end.


2014 
Liu L, Zhang M, Lin Y, Qian L, 'A Survey on Workflow Management and Scheduling in Cloud Computing', 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid) 2014, Chicago, IL (2014) [E1]


2014 
Tan L, Bille R, Lin Y, Chalup SK, Tucker C, 'Software Development in the City Evolutions Project', Fun and Games: Proceedings of the 2014 Conference on Interactive Entertainment, Newcastle, NSW (2014) [E1]


2013 
Tan L, Lin Y, Ye H, Zhang G, 'Improving product configuration in software product line engineering', Conferences in Research and Practice in Information Technology Series (2013) [E1] Software Product Line Engineering (SPLE) is a emerging software reuse paradigm. SPLE focuses on systematic software reuse from requirement engineering to product derivation throug... [more] Software Product Line Engineering (SPLE) is a emerging software reuse paradigm. SPLE focuses on systematic software reuse from requirement engineering to product derivation throughout the software development lifecycle. Feature model is one of the most important reusable assets which represents all design considerations of a software product line. Feature model will be used in the product configuration process to produce a software. The product configuration is a decisionmaking process, where all kinds of relationships among configurable features will be considered to select the desired features for the product. To improve the efficiency and quality of product configuration, we are proposing a new approach which aims at identifying a small set of key features. The product configuration should always start from this set of features since, based on the feature dependencies, the decisions made on these features will imply decisions on the rest of the features of the product line, thus reduce the features visited in the configuration process. We have also conducted some experiments to demonstrate how the proposed approach works and evaluate the efficiency of the approach.


2013 
Lu H, Lin Y, 'Maximum spectral radius of graphs with connectivity at most k and minimum degree at least d', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) Li, Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most k, J. Math. Chem., 46 (2009), 340346] studied the spectral radius of graphs of order n with ¿... [more] Li, Shiu, Chan and Chang [On the spectral radius of graphs with connectivity at most k, J. Math. Chem., 46 (2009), 340346] studied the spectral radius of graphs of order n with ¿(G) = k and showed that among those graphs, the maximum spectral radius is obtained uniquely at , which is the graph obtained by joining k edges from k vertices of K n  1 to an isolated vertex. In this paper, we study the spectral radius of graphs of order n with ¿(G) = k and minimum degree d(G) = k. We show that among those graphs, the maximum spectral radius is obtained uniquely at K k + (Kdk+1 ¿ Knd1). © 2013 SpringerVerlag.


2012 
Tan L, Lin Y, Ye H, 'Modeling quality attributes in software product line architecture', Proceedings 2012 Spring World Congress on Engineering and Technology, SCET 2012, Xi'an, China (2012) [E1]


2011  Zhang G, Ye H, Lin Y, 'Feature model validation: A constraint propagationbased approach', Proceedings of the 2011 International Conference on Software Engineering Research & Practice: SERP 2011, Las Vegas (2011) [E1]  
2011 
Zhang G, Ye H, Lin Y, 'Using knowledgebased systems to manage quality attributes in software product lines', SPLC '11 Proceedings of the 15th International Software Product Line Conference, Volume 2, Munich, Germany (2011) [E1]


2011 
Zhang G, Ye H, Lin Y, 'Modelling quality attributes in feature models in software product line engineering', Proceedings of the 6th International Conference on Software and Data Technologies, Seville (2011) [E1]


2010  Ye H, Lin Y, Zhang W, 'Streamlined feature dependency representation in software product lines', 2010 International Conference on Software Engineering Research & Practice (SERP '10), Las Vegas, Nevada (2010) [E1]  
2010 
Zhang G, Ye H, Lin Y, 'Quality attributes assessment for featurebased product configuration in software product line', 2010 Asia Pacific Software Engineering Conference, Sydney, Australia (2010) [E1]


2010 
Lin Y, Ye H, Li G, 'An approach for modelling software product line architecture', 2010 International Conference on Computational Intelligence and Software Engineering (CiSE 2010), Wuhun, China (2010) [E1]


2010 
Lin Y, Ye H, Tang J, 'An approach to efficient product configuration in software product lines', Lecture Notes in Computer Science, Jeju Island, Korea (2010) [E1]


2009 
Lin Y, Ye H, Tang J, 'Measurement of the complexity of variation points in software product lines', Proceedings 2009 WRI World Congress on Software Engineering, Xiamen, China (2009) [E1]


2009 
Lin Y, Ye H, 'Input data representation for selforganising map in software classification', Proceedings: 2009 Second International Symposium on Knowledge Acquisition and Modeling KAM 2009, Huazhong Normal University, China (2009) [E1]


2009 
Lin Y, Ye H, Li B, 'A new parameter for product configuration in software product lines', Proceedings: 2009 Second International Symposium on Knowledge Acquisition and Modeling KAM 2009, Huazhong Normal University, China (2009) [E1]


2008  Lin Y, 'On super antimagic labeling of disconnected graphs', Proceedings of the Fourth International Workshop on Graph Labelings, Harbin, China (2008) [E3]  
2008 
Brankovic L, Lin Y, Smyth WF, 'Conference editors', Proceedings of the International Workshop on Combinatorial Algorithms 2007, Newcastle, NSW (2008) [E4]


2008  Tang J, Lin Y, Miller M, 'Construction of extremal graphs', IWOCA 2008: Proceedings of 19th International Workshop on Combinatorial Algorithms, Nagoya, Japan (2008) [E1]  
2007  Lin Y, 'A survey on the connectivity of cages and other related graphs', 15th International Conference of Forum for Interdisciplinary Mathematics on Interdisciplinary Mathematical & Statistical Techniques. Abstracts, Shanghai, China (2007) [E3]  
2007 
Ye H, Lin Y, 'A formal specification for product configuration in software product lines', Proceedings of the Nineteenth International Conference on Software Engineering & Knowledge Engineering (SEKE'2007), Boston, Massachusetts (2007) [E1]


2007  Tang J, Balbuena C, Lin Y, Miller M, 'An open problem: (4; g)cages with odd g\5 are tightly superconnected', Theory of Computing, Ballarat, VIC (2007) [E1]  
2006 
Lin Y, Tang J, Brankovic L, Miller M, 'On graphs of maximum size with given girth', Proceedings of the Seventeenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2006), Uluru, NT (2006) [E1]


2005  Lin Y, Miller M, 'A Survey on the Connectivity of Cages', Proceedings of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) : September 1821, 2005 Ballarat, Australia, Ballarat, Vic. (2005) [E1]  
2005  Tang J, Miller M, Lin Y, 'Hybrid Simulated Annealing and Genetic Algorithm for Degree/Diameter Problem', Proceedings of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) : September 1821, 2005 Ballarat, Australia, Ballarat, Vic. (2005) [E1]  
2004  Lin Y, Ahmad A, Miller M, Sugeng K, Baca M, 'Further results on dantimagic labelings of antiprisms', Proceedings from Fifteenth Australasian Workshop on Combinatorial Algorithms, Ballina NSW, Aust (2004) [E1]  
2002  Lin Y, Miller M, 'Generalisations of Directed Moore Graphs', Proceedings of the Thirteenth Australasian Workshop on Combinatorial Algorithms, Queensland (2002) [E1]  
2001  Lin Y, Miller M, Rodger C, 'Edgeconnectivity of cages', Proceedings of the Twelfth Australasian Workshop on Combinatorial Algorithms, Bandung, Indonesia (2001) [E1]  
2000  Lin Y, Miller M, Simanjuntak RMG, Slamin, 'Magic and antimagic labelings of wheels', Proceedings of the Eleventh Australasian Workshop on Combinatorial Algorithms, Hunter Valley, NSW, Australia (2000) [E1]  
Show 39 more conferences 
Creative Work (2 outputs)
Year  Citation  Altmetrics  Link  

2013 
Tucker CC, Chalup S, Lin Y, Haasnoot W, Bille R, Brackenbury J, et al., City Evolutions: Shanghai, Watt Street, Newcastle (2013) [J2]


2013 
Tucker CC, Chalup S, Lin Y, Haasnoot W, Bille R, Brackenbury J, et al., City Evolutions: Major Morisset, Watt Street, Newcastle, Watt Street, Newcastle (2013) [J2]

Grants and Funding
Summary
Number of grants  14 

Total funding  $319,011 
Click on a grant title below to expand the full details for that specific grant.
20171 grants / $30,000
Efficient data mining and machine learning in highproductivity mining systems$30,000
Funding body: Joy Global Australia Pty Ltd
Funding body  Joy Global Australia Pty Ltd 

Project Team  Associate Professor Yuqing Lin, Associate Professor Stephan Chalup, Associate Professor Raymond Chiong 
Scheme  Research Project 
Role  Lead 
Funding Start  2017 
Funding Finish  2017 
GNo  G1700778 
Type Of Funding  C3100 – Aust For Profit 
Category  3100 
UON  Y 
20142 grants / $13,111
Applications of Feature Selection Methods for morphological characterization of images and subtypes of brain tumours $11,611
Funding body: University of Newcastle  Faculty of Engineering & Built Environment
Funding body  University of Newcastle  Faculty of Engineering & Built Environment 

Project Team  Professor Regina Berretta, Associate Professor Yuqing Lin, Associate Professor Stephan Chalup 
Scheme  Pilot Grant 
Role  Investigator 
Funding Start  2014 
Funding Finish  2014 
GNo  G1400970 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
International Workshop on Graph and Combinatorics 2014, Xiamen University, China, 20  24 March, 2014$1,500
Funding body: University of Newcastle  Faculty of Engineering & Built Environment
Funding body  University of Newcastle  Faculty of Engineering & Built Environment 

Project Team  Associate Professor Yuqing Lin 
Scheme  Travel Grant 
Role  Lead 
Funding Start  2014 
Funding Finish  2014 
GNo  G1400438 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
20131 grants / $1,200
The 8th GraphyMasters Workshop, Institut Teknologi Bandung Indonesia, 1617 November 2013$1,200
Funding body: University of Newcastle  Faculty of Engineering & Built Environment
Funding body  University of Newcastle  Faculty of Engineering & Built Environment 

Project Team  Associate Professor Yuqing Lin 
Scheme  Travel Grant 
Role  Lead 
Funding Start  2013 
Funding Finish  2013 
GNo  G1301175 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
20122 grants / $45,000
Group Mission : Explore and analyse structures and properties of chemical compounds using computer assisted mathematics, combinatorics and graph theory.$35,000
Funding body: Department of Industry, Innovation, Science, Research and Tertiary Education
Funding body  Department of Industry, Innovation, Science, Research and Tertiary Education 

Project Team  Associate Professor Yuqing Lin, Doctor Joe Ryan, Emeritus Professor Mirka Miller, Professor Ljiljana Brankovic, Professor Brian Alspach 
Scheme  AustraliaChina Science and Research Fund (ACSRF): Group Missions 
Role  Lead 
Funding Start  2012 
Funding Finish  2012 
GNo  G1200258 
Type Of Funding  Aust Competitive  Commonwealth 
Category  1CS 
UON  Y 
Enumerating Fullerene with Given Parameters$10,000
Funding body: University of Newcastle  Faculty of Engineering & Built Environment
Funding body  University of Newcastle  Faculty of Engineering & Built Environment 

Project Team  Associate Professor Yuqing Lin 
Scheme  Pilot Grant 
Role  Lead 
Funding Start  2012 
Funding Finish  2012 
GNo  G1200350 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
20111 grants / $1,500
International Conference on Computational Intelligence and Software Engineering 2011, Wutlan, China, 9  11 December 2011 $1,500
Funding body: University of Newcastle  Faculty of Engineering & Built Environment
Funding body  University of Newcastle  Faculty of Engineering & Built Environment 

Project Team  Associate Professor Yuqing Lin 
Scheme  Travel Grant 
Role  Lead 
Funding Start  2011 
Funding Finish  2012 
GNo  G1100980 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
20101 grants / $15,000
Perfect Matchings in Fullerenes$15,000
Funding body: University of Newcastle
Funding body  University of Newcastle 

Project Team  Associate Professor Yuqing Lin, Conjoint Professor Heping Zhang 
Scheme  Special Project Grant 
Role  Lead 
Funding Start  2010 
Funding Finish  2010 
GNo  G0900048 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
20091 grants / $1,500
2009 the 2nd International Symposium on Knowledge Aquisition and Modelling, China, 30 Nov  1 Dec 2009$1,500
Funding body: University of Newcastle  Faculty of Engineering & Built Environment
Funding body  University of Newcastle  Faculty of Engineering & Built Environment 

Project Team  Associate Professor Yuqing Lin 
Scheme  Travel Grant 
Role  Lead 
Funding Start  2009 
Funding Finish  2009 
GNo  G0190655 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
20081 grants / $22,000
Networks, graphs and communications$22,000
Funding body: Department of Innovation, Industry, Science and Research
Funding body  Department of Innovation, Industry, Science and Research 

Project Team  Emeritus Professor Mirka Miller, Professor Ljiljana Brankovic, Doctor Joe Ryan, Associate Professor Yuqing Lin 
Scheme  International Science Linkages Programme  French Australian Science and Technology Programme (FAST) 
Role  Investigator 
Funding Start  2008 
Funding Finish  2008 
GNo  G0188626 
Type Of Funding  Other Public Sector  Commonwealth 
Category  2OPC 
UON  Y 
20072 grants / $169,700
A framework for modelling feature variability and dependencies in software product lines$168,000
Funding body: ARC (Australian Research Council)
Funding body  ARC (Australian Research Council) 

Project Team  Associate Professor Huilin Ye, Associate Professor Yuqing Lin 
Scheme  Discovery Projects 
Role  Investigator 
Funding Start  2007 
Funding Finish  2009 
GNo  G0186308 
Type Of Funding  Aust Competitive  Commonwealth 
Category  1CS 
UON  Y 
The 15th International COnference of Interdisciplinary Mathematical & Statistical Techniques, University of Science & Technology China, 20/5/2007  23/5/2007$1,700
Funding body: University of Newcastle
Funding body  University of Newcastle 

Project Team  Associate Professor Yuqing Lin 
Scheme  Travel Grant 
Role  Lead 
Funding Start  2007 
Funding Finish  2007 
GNo  G0187730 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
20061 grants / $10,000
Graph Labelling and it's applications$10,000
Funding body: University of Newcastle
Funding body  University of Newcastle 

Project Team  Associate Professor Yuqing Lin 
Scheme  Early Career Researcher Grant 
Role  Lead 
Funding Start  2006 
Funding Finish  2006 
GNo  G0186950 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
20041 grants / $10,000
Topology and fault tolerance of interconnection network$10,000
Funding body: University of Newcastle
Funding body  University of Newcastle 

Project Team  Associate Professor Yuqing Lin 
Scheme  Early Career Researcher Grant 
Role  Lead 
Funding Start  2004 
Funding Finish  2004 
GNo  G0183762 
Type Of Funding  Internal 
Category  INTE 
UON  Y 
Research Supervision
Number of supervisions
Past Supervision
Year  Level of Study  Research Title  Program  Supervisor Type 

2021  PhD  A Machine LearningBased Fuzzy Framework for Prediction Problems  PhD (Computer Science), College of Engineering, Science and Environment, The University of Newcastle  CoSupervisor 
2021  PhD  Source Code Plagiarism Detection in the Presence of Pervasive PlagiarismHiding Source Code Modifications  PhD (Software Engineering), College of Engineering, Science and Environment, The University of Newcastle  Principal Supervisor 
2021  PhD  Affective Analysis of Visual Scenes using Face Pareidolia and SceneContext  PhD (Computer Science), College of Engineering, Science and Environment, The University of Newcastle  CoSupervisor 
2021  PhD  A Framework for Functional Feature and Crosscutting Concern Modelling in Software Product Lines  PhD (Software Engineering), College of Engineering, Science and Environment, The University of Newcastle  Principal Supervisor 
2019  PhD  Reliability of Interconnection Networks  PhD (Computer Science), College of Engineering, Science and Environment, The University of Newcastle  Principal Supervisor 
2018  PhD  Software Architecture and Computer Vision for Resource Constrained Robotics  PhD (Software Engineering), College of Engineering, Science and Environment, The University of Newcastle  CoSupervisor 
2018  PhD  Topological Analysis, NonLinear Dimensionality Reduction and Optimisation Applied to Manifolds Represented by Point Clouds  PhD (Computer Science), College of Engineering, Science and Environment, The University of Newcastle  CoSupervisor 
2017  PhD  Properties and Structures in Extremal Graphs  PhD (Computer Science), College of Engineering, Science and Environment, The University of Newcastle  CoSupervisor 
2017  PhD  PREVENT  A Pipeline Approach to Prototype Realistic Virtual Environments via the Reuse of Expert Domain Knowledge  PhD (Computer Science), College of Engineering, Science and Environment, The University of Newcastle  CoSupervisor 
2014  PhD  Feature Selection for Intelligent Transportation Systems  PhD (Information Technology), College of Engineering, Science and Environment, The University of Newcastle  CoSupervisor 
2013  PhD  Quality Attributes Modelling in Feature Models and Feature Model Validation in Software Product Lines  PhD (Software Engineering), College of Engineering, Science and Environment, The University of Newcastle  CoSupervisor 
2013  Masters  QualityOriented Software Product Line  M Philosophy(Computer Science), College of Engineering, Science and Environment, The University of Newcastle  Principal Supervisor 
2009  PhD  Variations of Classical Extremal Graph Theoretical Problems: Moore Bound and Connectivity  PhD (Computer Science), College of Engineering, Science and Environment, The University of Newcastle  CoSupervisor 
2007  PhD  Simulated AnnealingBased Hybrid Heuristics for Educational Timetabling Problems  PhD (Computer Science), College of Engineering, Science and Environment, The University of Newcastle  CoSupervisor 
Associate Professor Yuqing Lin
Position
Associate Professor
School of Information and Physical Sciences
College of Engineering, Science and Environment
Focus area
Computer Science and Software Engineering
Contact Details
yuqing.lin@newcastle.edu.au  
Phone  (02) 4921 6076 
Office
Room  ES229 

Building  Engineering Science 
Location  Callaghan University Drive Callaghan, NSW 2308 Australia 