LLLin Lin

Lin Lin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Lin Lin has a total of 58 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    DietGlance : Dietary Monitoring and Personalized Analysis at a Glance with Knowledge-Empowered AI Assistant

    by Zhihan Jiang, Running Zhao, Lin Lin, Yue Yu, Handi Chen, Xinchen Zhang, Xuhai Xu, Yifang Wang, Xiaojuan Ma, Edith C. H. Ngai

    Growing awareness of wellness has prompted people to consider whether their dietary patterns align with their health and fitness goals. In response, researchers have introduced various wearable dietary monitoring systems and dietary assessment approaches. However, these solutions are either limited to identifying foods with simple ingredients or insufficient in providing an analysis of individual dietary behaviors with domain-specific knowledge. In this article, we present DietGlance , a system that automatically monitors dietary behaviors in daily routines and delivers personalized analysis from knowledge sources. DietGlance first detects ingestive episodes from multimodal inputs using eyeglasses, capturing privacy-preserving meal images of various dishes being consumed. Based on the inferred food items and consumed quantities from these images, DietGlance further provides nutritional analysis and personalized dietary suggestions, empowered by the retrieval-augmented generation module on a reliable nutrition library. A short-term user study (N = 33) and a 4-week longitudinal study (N = 16) demonstrate the usability and effectiveness of DietGlance , offering insights and implications for future AI-assisted dietary monitoring and personalized healthcare intervention systems using eyewear.


  • Continuous-Time Markov Networks: From Merging Rules to Synchronizing Control

    by Changxi Li, Lin Lin, Wenjun Xiong, James Lam, Ka-Wai Kwok

    This paper characterizes the state space representation and control Lyapunov theory for continuous-time Markov networks (CT-MNs), which constitute a family of Markov chains endowed with network structures, serving as the theoretical basis for the investigations of several swarm behaviors. First, the notions of coupling Markov property and conditional independent property are introduced, enabling a CT-MN to be merged as a decentralized continuous-time Markov chain (CT-MC). Then, explicit formulas for the transition rate matrix of the augmented CT-MCs are derived. Consequently, key problems in CT-MNs can be reformulated as set-stability or set-stabilization problems for the augmented CT-MCs, with feedback controllers designed via linear programming subject to Lyapunov-based stability constraints. Furthermore, master slave synchronization and output regulation of CT-MNs are addressed. Finally, numerical examples validate the theoretical results and demonstrate their effectiveness in practical applications.

  • Finite-Time Stabilizers for Large-Scale Stochastic Boolean Networks

    by Lin Lin, James Lam, Wai-Ki Ching, Qian Qiu, Liangjie Sun, Bo Min

    This article presents a distributed pinning control strategy aimed at achieving global stabilization of Markovian jump Boolean control networks. The strategy relies on network matrix information to choose controlled nodes and adopts the algebraic state space representation approach for designing pinning controllers. Initially, a sufficient criterion is established to verify the global stability of a given Markovian jump Boolean network (MJBN) with probability one at a specific state within finite time. To stabilize an unstable MJBN at a predetermined state, the selection of pinned nodes involves removing the minimal number of entries, ensuring that the network matrix transforms into a strictly lower (or upper) triangular form. For each pinned node, two types of state feedback controllers are developed: 1) mode-dependent and 2) mode-independent, with a focus on designing a minimally updating controller. The choice of controller type is determined by the feasibility condition of the mode-dependent pinning controller, which is articulated through the solvability of matrix equations. Finally, the theoretical results are illustrated by studying the T cell large granular lymphocyte survival signaling network consisting of 54 genes and 6 stimuli.


  • Connectivity Determination Algorithm for Complex Directed Networks

    by Zhiyi Zhong, Lin Lin, Zhihan Jiang, Xin Yuan, Edith C.H. Ngai, James Lam, Ka-Wai Kwok

    Connectivity characterizes the ability of information transmission in systems modeled by complex networks. It is essential to develop an efficient connectivity determination algorithm with low time complexity and minimal storage requirements. To fulfill this need, a connectivity determination algorithm is designed by incorporating Tarjan's algorithm to identify strongly connected components and leveraging a depth-first search idea to traverse the reachability. This algorithm can ascertain strong connectivity, unilateral connectivity, and weak connectivity of complex directed networks. Besides, the accessibility matrix of complex directed networks is computed and visualized through an interface. As this algorithm relies on only two depth-first searches to accomplish connectivity determination tasks, its computational complexity does not exceed $O(n^{2})$, where $n$ denotes the number of network nodes. Experiments carried out on some specific networks reveal that the probability of network connections decreases with the increasing number of nodes in directed injective graphs, while in Erdős–Rényi graphs, the likelihood of connections increases as the number of nodes increases. Finally, a comparative example and an application example are provided to demonstrate the effectiveness of the algorithm program.


  • Learning Probabilistic Logical Control Networks: From Data to Controllability and Observability

    by Lin Lin, James Lam, Peng Shi, Michael K. Ng, Hak-Keung Lam

    This paper studies controllability and observability problems for a class of mixed-valued probabilistic logical control networks (PLCNs). First, PLCN is transformed into the algebraic state space representation (ASSR)-form by resorting to the semi-tensor product method. Then, the formulas are presented to calculate the lower and upper bounds of the transition probability matrix, which further derive the controllability and observability criteria. Furthermore, the ASSR-form of a PLCN can be regarded as a Markov decision process. Using the latter framework, we prove the equivalence between the controllability probability and the optimal state-value function, which is an iteration equation. Besides, the parallel extension technique transforms the observability of PLCNs into the set stabilization of an augmented system. The correspondence between observability probability and optimal state-value function is also derived. Afterward, based on the state-value function, the algorithms via the Q-learning technique are exploited to estimate the controllability and observability probabilities along with obtaining the corresponding optimal control sequences. Finally, all the theoretical results are elaborated via a genetic regulatory p53-Mdm2 network.


  • Open Access

    Minimal‐cost route planning via Fibonacci‐heap‐typed data structure

    by Wangjia Zhan, Haohao Qiu, Bo Min, Lin Lin

    Efficient route planning in transportation networks, particularly under stochastic conditions like severe weather (i.e. snow or hail), poses a significant computational challenge. This article addresses this challenge by modeling the route planning problem as a Markov decision process (MDP) problem, establishing reachability criteria, and identifying the minimum‐weight arborescence in the directed graph. To achieve this, the reachability determination algorithm is designed to assess the courier company's reachability to all junctions based on the queue‐typed data structure and breadth‐first search idea. Subsequently, the minimal‐cost route planning algorithm is developed to find a feasible transport route with the minimal cost of clearing obstacles by resorting to the Edmonds' algorithm and some feasible data structures. In particular, the article introduces a Fibonacci‐heap‐typed data structure to the minimal‐cost route planning algorithm, resulting in a remarkable reduction of the time complexity from to , where and represent the cardinalities of the arc set and nodeset, respectively. Ultimately, the proposed method is applied to optimize route planning in a transportation network, providing a cost‐efficient solution for logistics and transportation planning.


  • Stabilization of Continuous-Time Probabilistic Logical Networks Under Sampling Dwell Time Constraints

    by Lin Lin, James Lam, Min Meng, Xiaochen Xie, Panshuo Li, Daotong Zhang, Peng Shi

    This paper investigates the sampled-data stabilization of continuous-time probabilistic logical control networks (CT-PLCNs). CT-PLCNs can provide quantitative and accurate descriptions for the transient kinetics in comparing discrete-time probabilistic logical control networks (DT-PLCNs). First, CT-PLCNs are transformed into switched continuous-time probabilistic logical networks by regarding the control input as a switching signal. In this setup, CT-PLCNs can be classified into two types: one with stable modes and the other with only unstable modes. Then the concept of average [Formula: see text]-sample dwell time is proposed to describe the scenario, where the dwell time of each mode is an integral multiple of the sampling period [Formula: see text]. Based on this, the stabilization conditions for CT-PLCNs are established by restricting the sampling dwell time of controller modes. Furthermore, a copositive Lyapunov function is constructed for the case with stable modes and is discretized for the case without stable modes, providing a new framework for studying the stabilization of CT-PLCNs. Finally, a chemical model generated by GINsim is provided to demonstrate the feasibility of the obtained theoretical results. Overall, this paper provides new insights into the stabilization of CT-PLCNs and presents practical applications for chemical models.


  • Set Stabilization of Large-Scale Stochastic Boolean Networks: A Distributed Control Strategy

    by Lin Lin, Jinde Cao, Jianquan Lu, Leszek Rutkowski

    Dear Editor, This letter deals with the set stabilization of stochastic Boolean control networks (SBCNs) by the pinning control strategy, which is to realize the full control for systems by imposing control inputs on a fraction of agents. The pinned agents are determined based on the information on the network structure, rather than the whole state transition, of an SBCN. Regarding each pinned agent, a mode-dependent pinning controller and a more economical mode-independent pinning controller are designed to stabilize SBCNs towards a given state set. Finally, a 90-nodal T-cell receptor signaling network is presented to illustrate the theoretical validity of the obtained results.


  • A Bisimulation-Based Foundation for Scale Reductions of Continuous-Time Markov Chains

    by Lin Lin, Jinde Cao, James Lam, Leszek Rutkowski, Georgi Marko Dimirovski, Shiyong Zhu

    In this paper, the scale reduction problem of continuous-time Markov chains (CT-MCs) and continuous-time controlled Markov chains (CT-CMCs) are disserted both from the bisimulation perspective. Based on the features of bisimulation, the reachability, macro-controllability, controllability, and stabilizability of CT-MCs and CT-CMCs, particularly, the large-scale ones, are addressed over the corresponding reduced chains. The bisimulation relations are defined for both CT-MCs and CT-CMCs to establish the equivalence between the original networks and their condensed networks. A computable algorithm is developed to compute the reachability-based maximal bisimulation relation for CMCs, resulting in the smallest bisimulating CMCs. Notably, one advantage of our techniques lies in their efficiency in implementing the existing analysis and control results on MCs and CMCs in a lower amount of time, with wide applications to logical networks, finite-field networks, finite automata, and Petri nets. Compared to their discrete-time counterparts, CT-MCs and CT-CMCs inherit a simplified essential network topology in the discrete-time structures while providing a quantitative description of transient functional kinetics on the micro-time scale level. Besides, all the developed theoretical results for CT-MCs and CT-CMCs are operated based on the transition rate matrices of chains rather than transition probability matrices used in the traditional methods. Finally, the derived theoretical results are validated by investigating the p53-Mdm2 signaling network and a relevant case-study involving a set of randomly generated CT-CMCs.


  • Leader–Follower Consensus Over Finite Fields

    by Lin Lin, Jinde Cao, James Lam, Shiyong Zhu, Shun-Ichi Azuma, Leszek Rutkowski

    In this paper, we investigate the leader-follower consensus of multi-agent systems over finite fields, which model agents with limited capacities for storing, processing, and transmitting the information, from the perspectives of the transition graph and the characteristic polynomial of the network matrix, respectively. By the features of dynamics over finite fields, we reveal that the transition graph of networks achieving the leader-follower consensus over finite fields is either a spanning in-tree topped at zero-state or is composed of spanning in-trees with the same structure, topped at steady states. To address the high time complexity associated with transition graphs and existing methods, we integrate the characteristic polynomial of the network matrix with the cycle and tree structures in the transition graph. As a result, a concise criterion is established only based on the characteristic polynomial, which merely requires polynomial computational complexity with respect to the number of network nodes. Finally, a numerical example is presented to validate the effectiveness of the obtained theoretical results.