2025 |
Suparta IN, Lin Y, Hasni R, Budayana IN, 'On odd-graceful coloring of graphs', Communications in Combinatorics and Optimization, 10, 335-354 (2025) [C1]
For a graph G(V, E) which is undirected, simple, and finite, we denote by |V | and |E| the cardinality of the vertex set V and the edge set E of G, respectively. A graceful labeli... [more]
For a graph G(V, E) which is undirected, simple, and finite, we denote by |V | and |E| the cardinality of the vertex set V and the edge set E of G, respectively. A graceful labeling f for the graph G is an injective function f : V ¿ {0, 1, 2, . . ., |E|} such that {|f(u) - f(v)| : uv ¿ E} = {1, 2, . . ., |E|}. A graph that has a graceful-labeling is called graceful graph. A vertex (resp. edge) coloring is an assignment of color (positive integer) to every vertex (resp. edge) of G such that any two adjacent vertices (resp. edges) have different colors. A graceful coloring of G is a vertex coloring c : V ¿ {1, 2, . . ., k}, for some positive integer k, which induces edge coloring |c(u) - c(v)|, uv ¿ E. If c also satisfies additional property that every induced edge color is odd, then the coloring c is called an odd-graceful coloring of G. If an odd-graceful coloring c exists for G, then the smallest number k which maintains c as an odd-graceful coloring, is called odd-graceful chromatic number for G. In the latter case we will denote the odd-graceful chromatic number of G as Xog(G) = k. Otherwise, if G does not admit odd-graceful coloring, we will denote its odd-graceful chromatic number as Xog(G) = 8. In this paper, we derived some facts of odd-graceful coloring and determined odd-graceful chromatic numbers of some basic graphs.
|
|
Open Research Newcastle |
2025 |
Liu J, Cheng Y, Lin Y, Wu Z, Guo C, 'A scheme for emergency material allocation based on decision makers' subjective preference', Operational Research, 25 (2025) [C1]
Emergency Material Allocation (EMA) plays a critical role in emergency response efforts. To ensure the equitable allocation of limited emergency rescue materials to Emergency Dema... [more]
Emergency Material Allocation (EMA) plays a critical role in emergency response efforts. To ensure the equitable allocation of limited emergency rescue materials to Emergency Demand Points (EDPs) under conditions of limited information, this paper proposes a novel EMA approach. The proposed method accounts for Situation Factors (SFs), which capture the severity of damage at EDPs, as well as the perspectives of Emergency Decision-Makers regarding the conditions at these points. Numerical simulations demonstrate that: (i) the approach produces allocations proportional to the severity of the disaster as indicated by the SFs; and (ii) it respects the collective opinions of EDMs, ensuring an allocation aligned with their aggregated evaluations.
|
|
|
2024 |
Alghamdi J, Lin Y, Luo S, 'Cross-Domain Fake News Detection Using a Prompt-Based Approach', FUTURE INTERNET, 16 (2024) [C1]
The proliferation of fake news poses a significant challenge in today's information landscape, spanning diverse domains and topics and undermining traditional detection metho... [more]
The proliferation of fake news poses a significant challenge in today's information landscape, spanning diverse domains and topics and undermining traditional detection methods confined to specific domains. In response, there is a growing interest in strategies for detecting cross-domain misinformation. However, traditional machine learning (ML) approaches often struggle with the nuanced contextual understanding required for accurate news classification. To address these challenges, we propose a novel contextualized cross-domain prompt-based zero-shot approach utilizing a pre-trained Generative Pre-trained Transformer (GPT) model for fake news detection (FND). In contrast to conventional fine-tuning methods reliant on extensive labeled datasets, our approach places particular emphasis on refining prompt integration and classification logic within the model's framework. This refinement enhances the model's ability to accurately classify fake news across diverse domains. Additionally, the adaptability of our approach allows for customization across diverse tasks by modifying prompt placeholders. Our research significantly advances zero-shot learning by demonstrating the efficacy of prompt-based methodologies in text classification, particularly in scenarios with limited training data. Through extensive experimentation, we illustrate that our method effectively captures domain-specific features and generalizes well to other domains, surpassing existing models in terms of performance. These findings contribute significantly to the ongoing efforts to combat fake news dissemination, particularly in environments with severely limited training data, such as online platforms.
|
|
Open Research Newcastle |
2024 |
Alghamdi J, Lin Y, Luo S, 'The Power of Context: A Novel Hybrid Context-Aware Fake News Detection Approach', INFORMATION, 15 (2024) [C1]
|
|
Open Research Newcastle |
2024 |
Sundara Rajan R, Kirithiga Nandini G, Lin Y, Reji RM, 'Wide and fault diameter in Kneser graphs for enhanced fault tolerance in parallel computing', International Journal of Networking and Virtual Organisations, 31 169-190 (2024) [C1]
A system's fault tolerance is its capacity to function even if one or more of its components fail. Implementing a fault-tolerant network becomes an important criterion for re... [more]
A system's fault tolerance is its capacity to function even if one or more of its components fail. Implementing a fault-tolerant network becomes an important criterion for reliable computing. Reliability measures play a significant part in recognising the role of faulty and non-faulty processors in a parallel computing system. Parallel computing is used primarily for saving time, solving big problems, and doing multiple tasks at once at the same time. Various reliability measures have been introduced to evaluate a network's fault-tolerance capability. We have measured the wide diameter and fault diameter of the Kneser graphs in this study. Also, we have verified the fault diameter obtained using an experimental study. Further, we have described some applications of wide diameter and fault diameter in parallel and distributed computing.
|
|
|
2024 |
Almansour H, Luo S, Lin Y, 'A review of recent advances in Internet of Things-based customer relationship management to improve customer satisfaction and loyalty in the airline industry', INTERNATIONAL JOURNAL OF ADVANCED AND APPLIED SCIENCES, 11, 10-19 (2024) [C1]
Airlines use strategies to build and keep profitable, loyal customers through customer relationship management (CRM). However, as customer needs change, CRM systems must also chan... [more]
Airlines use strategies to build and keep profitable, loyal customers through customer relationship management (CRM). However, as customer needs change, CRM systems must also change. With the Internet of Things (IoT) offering new ways to improve how customers experience services, airlines are combining IoT with their CRM systems. The connections airlines have with partners, airports, hotels, and banks can help meet these changing customer needs. However, past studies have not fully looked into how IoT-enhanced CRM helps make customers more satisfied and loyal or how airlines' connections with others play a part. Therefore, this study looks into how IoT-enhanced CRM is improving customer satisfaction and loyalty in airlines. It also examines how airlines' connections with others can support the relationship between IoT-enhanced CRM and customer satisfaction and loyalty. The study suggests a model and makes suggestions about the importance of IoT-enhanced CRM in making customers more satisfied and loyal. It also outlines how to test these suggestions and suggests directions for future research.
|
|
Open Research Newcastle |
2024 |
Raza Z, ul Huda N, Yasmeen F, Ali K, Akhter S, Lin Y, 'Weighted Mostar invariants of chemical compounds: An analysis of structural stability', Heliyon, 10 (2024) [C1]
The concept of the weighted Mostar invariant is a mathematical tool used in chemical graph theory to study the stability of chemical compounds. Several recent studies have explore... [more]
The concept of the weighted Mostar invariant is a mathematical tool used in chemical graph theory to study the stability of chemical compounds. Several recent studies have explored the weighted Mostar invariant of various chemical structures, including hydrocarbons, alcohols, and other organic compounds. One of the key advantages of the weighted Mostar invariant is that it can be easily computed for large and complex chemical structures, making it a valuable tool for studying the stability of a wide range of chemical compounds. This notion has been utilized to build novel approaches for forecasting chemical compound stability, such as machine learning algorithms. The focus of the paper is to demonstrate the weighted Mostar indices of three specific nanostructures: silicon dioxide (SIO2, poly-methyl methacrylate network (PMMA(s)), and melem chains (MC(h)). The authors seek to provide the findings of their investigation of these nanostructures using the weighted Mostar invariant.
|
|
Open Research Newcastle |
2024 |
Alghamdi J, Lin Y, Luo S, 'Fake news detection in low-resource languages: A novel hybrid summarization', KNOWLEDGE-BASED SYSTEMS, 296 (2024) [C1]
The proliferation of fake news across languages and domains on social media platforms poses a significant societal threat. Current automatic detection methods for low-resource lan... [more]
The proliferation of fake news across languages and domains on social media platforms poses a significant societal threat. Current automatic detection methods for low-resource languages (e.g., Swahili, Indonesian and other low-resource languages) face limitations due to two factors: sequential length restrictions in pre-trained language models (PLMs) like multilingual bidirectional encoder representation from transformers (mBERT), and the presence of noisy training data. This work proposes a novel and efficient multilingual fake news detection (MFND) approach that addresses these challenges. Our solution leverages a hybrid extractive and abstractive summarization strategy to extract only the most relevant content from news articles. This significantly reduces data length while preserving crucial information for fake news classification. The pre-processed data is then fed into mBERT for classification. Extensive evaluations on a publicly available multilingual dataset demonstrate the superiority of our approach compared to state-of-the-art (SOTA) methods. Our analysis, both quantitative and qualitative, highlights the strengths of this method, achieving new performance benchmarks and emphasizing the impact of content condensation on model accuracy and efficiency. This framework paves the way for faster, more accurate MFND, fostering more robust information ecosystems.
|
|
Open Research Newcastle |
2024 |
Alghamdi J, Lin Y, Luo S, 'Enhancing hierarchical attention networks with CNN and stylistic features for fake news detection', EXPERT SYSTEMS WITH APPLICATIONS, 257 (2024) [C1]
The rise of social media platforms has led to a proliferation of false information in various forms. Identifying malicious entities on these platforms is challenging due to the co... [more]
The rise of social media platforms has led to a proliferation of false information in various forms. Identifying malicious entities on these platforms is challenging due to the complexities of natural language and the sheer volume of textual data. Compounding this difficulty is the ability of these entities to deliberately modify their writing style to make false information appear trustworthy. In this study, we propose a neural-based framework that leverages the hierarchical structure of input text to detect both fake news content and fake news spreaders. Our approach utilizes enhanced Hierarchical Convolutional Attention Networks (eHCAN), which incorporates both style-based and sentiment-based features to enhance model performance. Our results show that eHCAN outperforms several strong baseline methods, highlighting the effectiveness of integrating deep learning (DL) with stylistic features. Additionally, the framework uses attention weights to identify the most critical words and sentences, providing a clear explanation for the model's predictions. eHCAN not only demonstrates exceptional performance but also offers robust evidence to support its predictions.
|
|
Open Research Newcastle |
2024 |
Alghamdi J, Lin Y, Luo S, 'Unveiling the hidden patterns: A novel semantic deep learning approach to fake news detection on social media', ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 137 (2024) [C1]
The rise of social media as a source of news consumption has led to the spread of fake news, posing serious consequences for both individuals and society. The detection and preven... [more]
The rise of social media as a source of news consumption has led to the spread of fake news, posing serious consequences for both individuals and society. The detection and prevention of fake news are essential, and previous research has shown that incorporating news content along with its associated headlines and user comments can improve detection performance. However, the semantic relationships between these elements have not been fully explored. This paper proposes a novel approach that models the relationships between news bodies and associated headlines/user comments using deep learning techniques, such as fine-tuned Bidirectional Encoder Representations from Transformers (BERT) and cross-level cross-modality attention sub-networks. In our proposed model, we utilize two different configurations of BERT: pool-based representation, which provides a representation of the entire document, and sequence representation, which represents each token within the document (i.e., at the word and text levels). The approach also encodes user-posting behavioural features and fuses the output of these components to detect fake news using a classification layer. Our experiments on benchmark datasets demonstrate the superiority of the proposed method over existing state-of-the-art (SOTA) approaches, highlighting the importance of utilizing semantic relationships for improved fake news detection (FND). These findings have significant implications for combating the spread of fake news and protecting society from its negative effects.
|
|
|
2023 |
Alghamdi J, Lin Y, Luo S, 'Does Context Matter? Effective Deep Learning Approaches to Curb Fake News Dissemination on Social Media', APPLIED SCIENCES-BASEL, 13 (2023) [C1]
|
|
Open Research Newcastle |
2023 |
Zhang Q, Xu L, Lin Y, '4-Free Strong Digraphs with the Maximum Size', Parallel Processing Letters, 33 (2023) [C1]
Directed cycles in digraphs are useful in embedding linear arrays and rings, and are suitable for designing simple algorithm with low communication costs in parallel computer syst... [more]
Directed cycles in digraphs are useful in embedding linear arrays and rings, and are suitable for designing simple algorithm with low communication costs in parallel computer systems, thus the existence of directed cycles on digraphs has been largely investigated. Let n, k = 2 be integers. Bermond et al. [Journal of Graph Theory 4(3) (1980) 337-341] proved that if the size of a strong digraph D with order n is at least (n-k+2/2) + k - 1, then the girth of D is no more than k. Consequently, when D is a 4-free strong digraph with order n, which means that every directed cycle in D has length at least 5, then the maximum size of D is (n-2/2) + 2. In this paper, we mainly give the structural characterizations for all 4-free strong digraphs of order n whose arc number exactly is (n-2/2) + 2.
|
|
Open Research Newcastle |
2023 |
Alghamdi J, Lin Y, Luo S, 'Towards COVID-19 fake news detection using transformer-based models', KNOWLEDGE-BASED SYSTEMS, 274 (2023) [C1]
|
|
|
2023 |
Cheers H, Lin Y, Yan W, 'Identifying Plagiarised Programming Assignments with Detection Tool Consensus', Informatics in Education, 22, 1-19 (2023) [C1]
Source code plagiarism is a common occurrence in undergraduate computer science education. Many source code plagiarism detection tools have been proposed to address this problem. ... [more]
Source code plagiarism is a common occurrence in undergraduate computer science education. Many source code plagiarism detection tools have been proposed to address this problem. However, most of these tools only measure the similarity between assignment submissions, and do not actually identify which are suspicious of plagiarism. This work presents a semi-automatic approach that enables the indication of suspicious assignment submissions by analysing source code similarity scores among the submissions. The proposed approach seeks the consensus of multiple source code plagiarism detection tools in order to identify program pairs that are consistently evaluated with high similarity. A case study is presented to demonstrate the use of the proposed approach. The results of this case study indicate that it can accurately identify assignment submissions that are suspicious of plagiarism.
|
|
Open Research Newcastle |
2023 |
Cheers H, Lin Y, 'Identifying plagiarised programming assignments based on source code similarity scores', COMPUTER SCIENCE EDUCATION, 33, 621-645 (2023) [C1]
|
|
Open Research Newcastle |
2022 |
Chen Y, Lin Y, Yan W, 'The super-connectivity of the Kneser graph KG(n, 3)', Australasian Journal of Combinatorics, 82 201-211 (2022) [C1]
A vertex cut S of a connected graph G is a subset of vertices of G whose deletion makes G disconnected. A super vertex cut S of a connected graph G is a subset of vertices of G wh... [more]
A vertex cut S of a connected graph G is a subset of vertices of G whose deletion makes G disconnected. A super vertex cut S of a connected graph G is a subset of vertices of G whose deletion makes G disconnected and there is no isolated vertex in each component of G - S. The super-connectivity of graph G is the size of the minimum super vertex cut of G. Let KG(n, k) be the Kneser graph whose vertices are the k-subsets of {1, ¿, n}, where k is the number of labels of each vertex in G. We have shown in this paper that the conjecture from [G.B. Ekinci and J.B. Gauci, Discuss. Math. Graph Theory 39 (2019), 5¿11] on the super-connectivity of the Kneser graph KG(n, k) is true when k = 3.
|
|
Open Research Newcastle |
2022 |
Yang X, Yi X, Kelarev A, Rylands L, Lin Y, Ryan J, 'Protecting Private Information for Two Classes of Aggregated Database Queries', INFORMATICS-BASEL, 9 (2022) [C1]
|
|
Open Research Newcastle |
2022 |
Alghamdi J, Lin Y, Luo S, 'A Comparative Study of Machine Learning and Deep Learning Techniques for Fake News Detection', INFORMATION, 13 (2022) [C1]
Efforts have been dedicated by researchers in the field of natural language processing (NLP) to detecting and combating fake news using an assortment of machine learning (ML) and ... [more]
Efforts have been dedicated by researchers in the field of natural language processing (NLP) to detecting and combating fake news using an assortment of machine learning (ML) and deep learning (DL) techniques. In this paper, a review of the existing studies is conducted to understand and curtail the dissemination of fake news. Specifically, we conducted a benchmark study using a wide range of (1) classical ML algorithms such as logistic regression (LR), support vector machines (SVM), decision tree (DT), naive Bayes (NB), random forest (RF), XGBoost (XGB) and an ensemble learning method of such algorithms, (2) advanced ML algorithms such as convolutional neural networks (CNNs), bidirectional long short-term memory (BiLSTM), bidirectional gated recurrent units (BiGRU), CNN-BiLSTM, CNN-BiGRU and a hybrid approach of such techniques and (3) DL transformer-based models such as BERT (Formula presented.) and RoBERTa (Formula presented.). The experiments are carried out using different pretrained word embedding methods across four well-known real-world fake news datasets¿LIAR, PolitiFact, GossipCop and COVID-19¿to examine the performance of different techniques across various datasets. Furthermore, a comparison is made between context-independent embedding methods (e.g., GloVe) and the effectiveness of BERT (Formula presented.) ¿contextualised representations in detecting fake news. Compared with the state of the art's results across the used datasets, we achieve better results by solely relying on news text. We hope this study can provide useful insights for researchers working on fake news detection.
|
|
Open Research Newcastle |
2022 |
Lin Y, Yan W, Ouyang Z, 'On the p-restricted edge connectivity of the bipartite Kneser graph H(n, k)', Australasian Journal of Combinatorics, 83, 265-273 (2022) [C1]
Given a simple graph G, ap-restricted edge cut is a subset of edges of G whose removal disconnects G, and such that the number of vertices in each component of the resulting graph... [more]
Given a simple graph G, ap-restricted edge cut is a subset of edges of G whose removal disconnects G, and such that the number of vertices in each component of the resulting graph is at least p. The p-restricted edge connectivity is denoted by ¿p, which is the minimum cardinality over all p-restricted edge cuts. If a p-restricted edge cut (also called a ¿p-cut) exists, then the graph is called p-restricted edge connected, or, for short, ¿p-connected. Obviously, for any ¿p-cut F, G - F has exactly two components, and each component has at least p vertices. If the deletion of any ¿p-cut results in at least one component containing exactly p vertices in the resulting graph, then the graph is called super-¿p.Inthispaper,we examine the p-restricted edge connectivity of the bipartite Kneser graph H(n, k) whenn = 3k + 1 and show that the graph is super-¿p for p = 5.
|
|
Open Research Newcastle |
2022 |
Yang Z, Zhang X, Lu H, Lin Y, 'Sufficient Conditions for a Graph to Have All [a, b]-Factors and (a, b)-Parity Factors', BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 45, 1657-1667 (2022) [C1]
Let G be a graph with vertex set V and let b> a be two positive integers. We say that G has all [a,¿b]-factors if G has an h-factor for every h: V¿ N such that a= h(v) = b for ... [more]
Let G be a graph with vertex set V and let b> a be two positive integers. We say that G has all [a,¿b]-factors if G has an h-factor for every h: V¿ N such that a= h(v) = b for every v¿ V and ¿v¿Vh(v)=0(mod2). A spanning subgraph F of G is called an (a,¿b)-parity factor, if dF(v) = a= b (mod 2) and a= dF(v) = b for all v¿ V. In this paper, we have developed sufficient conditions for the existence of all [a,¿b]-factors and (a,¿b)-parity factors of G in terms of the independence number and connectivity of G. This work extended an earlier result of Nishimura (J Graph Theory 13: 63¿69, 1989). Furthermore, we show that these results are best possible in some cases.
|
|
Open Research Newcastle |
2022 |
Ma X, Kelarev A, Lin Y, Wang K, 'A survey on enhanced power graphs of finite groups', ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 10, 89-111 (2022) [C1]
We survey known results on enhanced power graphs of finite groups. Open problems, questions and suggestions for future work are also included.... [more]
We survey known results on enhanced power graphs of finite groups. Open problems, questions and suggestions for future work are also included.
|
|
Open Research Newcastle |
2021 |
Cheers H, Lin Y, Smith SP, 'Academic Source Code Plagiarism Detection by Measuring Program Behavioural Similarity', IEEE Access, 9, 50391-50412 (2021) [C1]
|
|
Open Research Newcastle |
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 sub-problem. 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.
|
|
Open Research Newcastle |
2021 |
Zhang F, Lin Y, 'A lower bound on the number of perfect matchings in benzenoid systems', Match, 85, 7-11 (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.
|
|
Open Research Newcastle |
2021 |
Cheers H, Lin Y, Smith SP, 'Evaluating the robustness of source code plagiarism detection tools to pervasive plagiarism-hiding modifications', EMPIRICAL SOFTWARE ENGINEERING, 26 (2021) [C1]
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 plagiarism-hiding 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 plagiarism-hiding modifications. In this article, 11 source code plagiarism detection tools are evaluated for robustness against plagiarism-hiding 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 fine-grained transformations to the source code structure. Of the evaluated tools, JPlag and Plaggie demonstrates the greatest robustness to different types of plagiarism-hiding modifications. However, the results also indicate that graph-based tools, specifically those that compare programs as program dependence graphs, show potentially greater robustness to pervasive plagiarism-hiding modifications.
|
|
Open Research Newcastle |
2021 |
Bong NH, Lin Y, 'Some properties of the multiset dimension of graphs', Electronic Journal of Graph Theory and Applications, 9, 215-221 (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.
|
|
Open Research Newcastle |
2021 |
Javed M, Lin Y, 'IMER-FM: Iterative Process of System Feature Model Extraction from the Requirements', International Journal of Software Engineering and Knowledge Engineering, 31 435-475 (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.
|
|
Open Research Newcastle |
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, 409-420 (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 4-edge-connected 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.
|
|
Open Research Newcastle |
2020 |
Fan Z, Chiong R, Hu Z, Lin Y, 'A multi-layer fuzzy model based on fuzzy-rule clustering for prediction tasks', Neurocomputing, 410, 114-124 (2020) [C1]
|
|
Open Research Newcastle |
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]
|
|
Open Research Newcastle |
2020 |
Rylands L, Seberry J, Yi X, Kelarev A, Ryan J, Lin Y, 'Collusion-resistant protocols for private processing of aggregated queries in distributed databases', DISTRIBUTED AND PARALLEL DATABASES, 39 97-127 (2020) [C1]
|
|
Open Research Newcastle |
2020 |
Bong NH, Lin Y, Slamin, 'On inclusive and non-inclusive vertex irregular d-distance vertex labeling', Journal of Combinatorial Mathematics and Combinatorial Computing, 113 233-247 (2020) [C1]
|
|
Open Research Newcastle |
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, 676-696 (2019) [C1]
|
|
Open Research Newcastle |
2019 |
Fan Z, Chiong R, Hu Z, Dhakal S, Lin Y, 'A two-layer Wang-Mendel fuzzy approach for predicting the residuary resistance of sailing yachts', JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 36, 6219-6229 (2019) [C1]
|
|
Open Research Newcastle |
2018 |
Wang M, Lin Y, Wang S, 'The 1-good-neighbor connectivity and diagnosability of Cayley graphs generated by complete graphs', DISCRETE APPLIED MATHEMATICS, 246, 108-118 (2018) [C1]
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 g-good-neighbor diagnosability that restrains every fault-free node to contain at least g fault-free 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 1-good-neighbor connectivity of CKn is n2-n-2 and the 1-good-neighbor diagnosability of CKn under the PMC model is n2-n-1 for n=4 and under the MM* model is n2-n-1 for n=5.
|
|
|
2018 |
Wang M, Lin Y, Wang S, Wang M, 'Sufficient conditions for graphs to be maximally 4-restricted edge connected', The Australasian Journal of Combinatorics, 70, 123-136 (2018) [C1]
|
|
Open Research Newcastle |
2017 |
Lu H, Lin Y, 'On the number of disjoint perfect matchings of regular graphs with given edge connectivity', Discrete Mathematics, 340 305-310 (2017) [C1]
|
|
Open Research Newcastle |
2017 |
Bong NH, Lin Y, Slamin , 'On distance-irregular labelings of cycles and wheels', AUSTRALASIAN JOURNAL OF COMBINATORICS, 69, 315-322 (2017) [C1]
|
|
Open Research Newcastle |
2017 |
Lin Y, Wang M, Xu L, Zhang F, 'The maximum forcing number of a polyomino', Australasian Journal of Combinatorics, 69, 306-314 (2017) [C1]
|
|
Open Research Newcastle |
2017 |
Wang M, Ren Y, Lin Y, Wang S, 'The Tightly Super 3-Extra Connectivity and Diagnosability of Locally Twisted Cubes', American Journal of Computational Mathematics, 07, 127-144 (2017) [C1]
|
|
Open Research Newcastle |
2017 |
Lin Y, Zhang F, 'A linear algorithm for a perfect matching in polyomino graphs', Theoretical Computer Science, 675, 82-88 (2017) [C1]
|
|
Open Research Newcastle |
2017 |
Wang M, Lin Y, Wang S, 'The Nature Diagnosability of Bubble-sort Star Graphs under the PMC Model and MM Model', International Journal of Engineering and Applied Sciences, 4 55-60 (2017) [C1] |
|
Open Research Newcastle |
2017 |
Wang M, Lin Y, Wang S, 'THE CONNECTIVITY AND NATURE DIAGNOSABILITY OF EXPANDED k-ARY n-CUBES', RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 51, 71-89 (2017) [C1]
|
|
Open Research Newcastle |
2017 |
Baca M, Baskoro ET, Brankovic L, Jendrol' S, Lin Y, Phanalasy O, Ryan J, Semanicova-Fenovcikova A, Slamin , Sugeng KA, 'A survey of face-antimagic evaluations of graphs', AUSTRALASIAN JOURNAL OF COMBINATORICS, 69, 382-393 (2017) [C1]
|
|
Open Research Newcastle |
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, 1-15 (2016) [C1]
|
|
Open Research Newcastle |
2016 |
Wang M, Lin Y, Wang S, 'The 2-good-neighbor diagnosability of Cayley graphs generated by transposition trees under the PMC model and MM* model', THEORETICAL COMPUTER SCIENCE, 628, 92-100 (2016) [C1]
|
|
Open Research Newcastle |
2016 |
Liu SY, Zhang HP, Lu HL, Lin YQ, 'A note on the strong edge-coloring of outerplanar graphs with maximum degree 3', Acta Mathematicae Applicatae Sinica, 32, 883-890 (2016) [C1]
|
|
Open Research Newcastle |
2015 |
Yang Q, Zhang H, Lin Y, 'On the anti-forcing number of fullerene graphs', Match, 74, 673-692 (2015) [C1]
The anti-forcing 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 anti-forcing 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 anti-forcing number of every fullerene has at least four. We give a procedure to construct all fullerenes whose anti-forcing 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 anti-forcing number four, and the fullerene with 26 vertices has the anti-forcing number five.
|
|
|
2015 |
Lu HL, Wang W, Lin Y, 'On Edge Connectivity and Parity Factor', ACTA MATHEMATICA SINICA-ENGLISH SERIES, 31, 772-776 (2015) [C1]
|
|
Open Research Newcastle |
2015 |
Lu H, Lin Y, 'Maximum spectral radius of graphs with given connectivity, minimum degree and independence number', Journal of Discrete Algorithms, 31, 113-119 (2015) [C1]
|
|
Open Research Newcastle |
2014 |
Zhang G, Ye H, Lin Y, 'Quality attribute modeling and quality aware product configuration in software product lines', Software Quality Journal, 22 1-37 (2014) [C1]
|
|
Open Research Newcastle |
2013 |
Hongliang L, Yuqing L, 'Note on parity factors of regular graphs', Electronic Journal of Graph Theory and Applications, 1, 50-55 (2013) [C1] |
|
Open Research Newcastle |
2013 |
Lu H, Wu Y, Lin Y, Yu Q, Balbuena C, Marcote X, 'On Superconnectivity of (4, g)-Cages', Graphs and Combinatorics, 29 105-119 (2013) [C1]
A (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs with girth g. It has been conjectured (Fu et al. in J. Graph Theory, 24:187-191, 1997) th... [more]
A (k, g)-cage is a graph that has the least number of vertices among all k-regular graphs with girth g. It has been conjectured (Fu et al. in J. Graph Theory, 24:187-191, 1997) that all (k, g)-cages are k-connected for every k = 3. A k-connected graph G is called superconnected if every k-cutset S is the neighborhood of some vertex. Moreover, if G-S 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.
|
|
Open Research Newcastle |
2013 |
Zhang G, Ye H, Lin Y, 'An approach for validating feature models in software product lines', Journal of Software Engineering, 7, 1-29 (2013) [C1]
|
|
Open Research Newcastle |
2012 |
Yang Q, Ye D, Zhang H, Lin Y, 'On the anti-Kekule number of fullerenes', Match-Communications in Mathematical and in Computer Chemistry, 67, 281-288 (2012) [C1]
|
|
Open Research Newcastle |
2011 |
Lu HL, Wu YJ, Yu QL, Lin Y, 'New improvements on connectivity of cages', Acta Mathematica Sinica, 27, 1163-1172 (2011) [C1]
|
|
Open Research Newcastle |
2010 |
Tang J, Lin Y, Miller M, 'New results on EX graphs', Mathematics in Computer Science, 3, 119-126 (2010) [C1]
|
|
Open Research Newcastle |
2010 |
Lin Y, Lu H, Wu Y, Yu Q, 'On superconnectivity of (4,g)-cages with even girth', Networks, 56 143-148 (2010) [C1]
|
|
Open Research Newcastle |
2010 |
Baca M, Lin Y, Muntaner-Batle FA, 'Edge-antimagic labelings of forests', Utilitas Mathematica, 81 31-40 (2010) [C1]
|
|
Open Research Newcastle |
2010 |
Balbuena C, Gonzalaz-Moreno D, Lin Y, Marcote X, 'On the lower bound of vertex connectivity of semiregular cages', Utilitas Mathematica, 83, 57-68 (2010) [C1] |
|
Open Research Newcastle |
2009 |
Delorme C, Flandrin E, Lin Y, Miller M, Ryan JF, 'On extremal graphs with bounded girth', Electronic Notes in Discrete Mathematics, 34, 653-657 (2009) [C2]
|
|
Open Research Newcastle |
2009 |
Ali G, Baca M, Lin Y, Semanicova-Fenovcikova A, 'Super-vertex-antimagic total labelings of disconnected graphs', Discrete Mathematics, 309 6048-6054 (2009) [C1]
|
|
Open Research Newcastle |
2009 |
Lin Y, Balbuena C, Miller M, 'On the number of components of (k, g)-cages after vertex deletion', Discrete Applied Mathematics, 157, 1760-1765 (2009) [C1]
|
|
Open Research Newcastle |
2009 |
Tang J, Lin Y, Balbuena C, Miller M, 'Calculating the extremal number ex(v;{C3,...,Cn})', Applied Discrete Mathematics, 157, 2198-2206 (2009) [C1]
|
|
Open Research Newcastle |
2009 |
Balbuena C, Tang J, Marshall KL, Lin Y, 'Superconnectivity of regular graphs with small diameter', Discrete Applied Mathematics, 157 1349-1353 (2009) [C1]
|
|
Open Research Newcastle |
2009 |
Baca M, Lin Y, Muntaner-Batle FA, 'Normalized embedding of path-like trees', Utilitas Mathematica, 78 11-31 (2009) [C1]
|
|
Open Research Newcastle |
2009 |
Lin Y, Smyth B, Baskoro ET, 'Guest editors', Journal of Combinatorial Mathematics and Combinatorial Computing, 71 (2009) [C2] |
|
|
2009 |
Baca M, Lin Y, Muntaner-Batle FA, 'A note on even disjoint union of paths', AKCE International Journal of Graphs and Combinatorics, 6 41-45 (2009) [C1] |
|
Open Research Newcastle |
2009 |
Baca M, Lin Y, Semanicova-Fenovcikova A, 'Note on super antimagicness of disconnected graphs', AKCE International Journal of Graphs and Combinatorics, 6 47-55 (2009) [C1] |
|
Open Research Newcastle |
2009 |
Baca M, Lin Y, Muntaner-Batle FA, Rius-Font M, 'Strong labelings of linear forests', Acta Mathematica Sinica-English Series, 25, 1951-1964 (2009) [C1]
|
|
|
2008 |
Tang J, Miller M, Lin Y, 'HSAGA and its application for the construction of near-Moore digraphs', Journal of Discrete Algorithms, 6, 73-84 (2008) [C1]
|
|
Open Research Newcastle |
2008 |
Lin Y, Miller M, Balbuena C, Marcote X, 'On the connectivity of (k,g)-cages of even girth', Discrete Mathematics, 308, 3249-3256 (2008) [C1]
|
|
Open Research Newcastle |
2008 |
Balbuena C, Lin Y, Miller M, 'Diameter-sufficient conditions for a graph to be super restricted connected', Discrete Applied Mathematics, 156, 2827-2834 (2008) [C1]
|
|
Open Research Newcastle |
2007 |
Baca M, Lin Y, 'Antimagic labelings of grids', Utilitas Mathematica, 72 65-75 (2007) [C1]
|
|
|
2007 |
Baca M, Lin Y, Muntaner-Batle FA, 'Super edge-antimagic labelings of the path-like trees', Utilitas Mathematica, 73, 117-128 (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 153-163 (2007) [C1]
|
|
Open Research Newcastle |
2007 |
Baca M, Lin Y, Miller M, Youssef MZ, 'Edge-antimagic graphs', Discrete Mathematics, 307, 1232-1244 (2007) [C1]
|
|
|
2006 |
Lin Y, Miller M, Balbuena C, Marcote X, 'All (k;g)-Cages Are Edge-Superconnected', Networks, 47 102-110 (2006) [C1]
|
|
|
2006 |
Sugeng KA, Miller M, Lin Y, Baca M, 'Face antimagic labelings of prisms', Utilitas Mathematica, 71 269-286 (2006) [C1]
|
|
|
2006 |
Baca M, Lin Y, Miller M, Ryan JF, 'Antimagic labelings of Mobius grids', Ars Combinatoria, 78 3-13 (2006) [C1]
|
|
|
2006 |
Lin Y, Sugeng KA, 'Face antimagic labelings of plane graphs P-a(b)', Ars Combinatoria, 80, 259-273 (2006) [C1]
|
|
|
2006 |
Tang J, Lin Y, Milller M, 'Calculating the extremal number ex (v ; {C3, C4, ..., Cn})', Electronic Notes in Discrete Mathematics, 27, 101-102 (2006) [C3]
|
|
Open Research Newcastle |
2006 |
Balbuena C, Barker E, Das KC, Lin Y, Miller M, Ryan J, et al., 'On the degrees of a strongly vertex-magic graph', Discrete Mathematics, 306 539-551 (2006) [C1]
|
|
|
2006 |
Balbuena C, Barker E, Lin Y, Miller M, Sugeng K, 'Consecutive magic graphs', Discrete Mathematics, 306, 1817-1829 (2006) [C1]
|
|
|
2005 |
Lin Y, Miller M, Balbuena C, 'Improved lower bound for the vertex connectivity of ([delta];g)-cages', Discrete Mathematics, 299 162-171 (2005) [C1]
|
|
|
2005 |
Lin Y, Miller M, Rodger C, 'All (k;g)-cages are k-edge-connected', Journal of Graph Theory, 48 219-227 (2005) [C1]
|
|
Open Research Newcastle |
2004 |
Lin Y, Slamin, Baca M, Miller M, 'On d-antimagic labelings of prisms', ARS Combinatoria, 72 65-76 (2004) [C1]
|
|
|
2003 |
Lin Y, Slamin , Miller M, 'On d-antimagic labelings of antiprisms', Utilitas Mathematica, 64, 213-220 (2003) [C1]
|
|
|
2002 |
Slamin, Baca M, Lin Y, Miller M, Simanjuntak RMG, 'Edge-magic total labelings of wheels, fans and friendship graphs', Bulletin of the Institute of Combinatorics and its Applications, 35 89-98 (2002) [C1] |
|
|
2001 |
Lin Y, Miller M, Simanjuntak RMG, Baca M, 'New constructions of magic and antimagic graph labelings', Utilitas Mathematica, 60 229-239 (2001) [C1]
|
|
|
2001 |
Lin Y, Miller M, 'Vertex magic total Labellings of complete graphs', Bulletin of the Institute of Combinatorics and its Applications, 33 68-76 (2001) [C1] |
|
|
|
Alghamdi J, Luo S, Lin Y, 'A comprehensive survey on machine learning approaches for fake news detection', MULTIMEDIA TOOLS AND APPLICATIONS [C1]
The proliferation of fake news on social media platforms poses significant challenges to society and individuals, leading to negative impacts. As the tactics employed by purveyors... [more]
The proliferation of fake news on social media platforms poses significant challenges to society and individuals, leading to negative impacts. As the tactics employed by purveyors of fake news continue to evolve, there is an urgent need for automatic fake news detection (FND) to mitigate its adverse social consequences. Machine learning (ML) and deep learning (DL) techniques have emerged as promising approaches for characterising and identifying fake news content. This paper presents an extensive review of previous studies aiming to understand and combat the dissemination of fake news. The review begins by exploring the definitions of fake news proposed in the literature and delves into related terms and psychological and scientific theories that shed light on why people believe and disseminate fake news. Subsequently, advanced ML and DL techniques for FND are dicussed in detail, focusing on three main feature categories: content-based, context-based, and hybrid-based features. Additionally, the review summarises the characteristics of fake news, commonly used datasets, and the methodologies employed in existing studies. Furthermore, the review identifies the challenges current FND studies encounter and highlights areas that require further investigation in future research. By offering a comprehensive overview of the field, this survey aims to serve as a guide for researchers working on FND, providing valuable insights for developing effective FND mechanisms in the era of technological advancements.
|
|
Open Research Newcastle |
|
Saraswathi M, Meera KN, Lin Y, 'Radio Mean Labeling Algorithm, Its Complexity and Existence Results', Mathematics, 13, 2057-2057
|
|
|