Search

Depth images obtained from lightweight, real-time depth estimation models and consumer-oriented sensors typically have low-resolution issues. Traditional interpolation methods for depth image up-sampling result in a significant information loss, especially in edges with discontinuous depth variations (depth discontinuities). To address this issue, this paper proposes a semi-coupled deformable convolution network (SCD-Net) based on the idea of guided depth map super-resolution (GDSR). The method employs a semi-coupled feature extraction scheme to learn unique and similar features between RGB images and depth images. We utilize a Coordinate Attention (CA) to suppress redundant information in RGB features. Finally, a deformable convolutional module is employed to restore the original resolution of the depth image. The model is tested on NYUv2, Middlebury, Lu, and a Real-Sense real-world dataset created using an Intel Real-sense D455 structured-light camera. The super-resolution accuracy of SCD-Net at multiple scales is much higher than that of traditional methods and superior to recent state-of-the-art (SOTA) models, which demonstrates the effectiveness and flexibility of our model on GDSR tasks. In particular, our method further solves the problem of an RGB texture being over-transferred in GDSR tasks. [ABSTRACT FROM AUTHOR]

Block graphs are graphs in which every block (biconnected component) is a clique. A graph G = ( V , E ) is said to be an (unpartitioned) k -probe block graph if there exist k independent sets N i ⊆ V , 1 ≤ i ≤ k , such that the graph G ′ obtained from G by adding certain edges between vertices inside the sets N i , 1 ≤ i ≤ k , is a block graph; if the independent sets N i are given, G is called a partitioned k -probe block graph. In this paper we give good characterizations for 2 -probe block graphs, in both unpartitioned and partitioned cases. As an algorithmic implication, partitioned and unpartitioned probe block graphs can be recognized in linear time, improving a recognition algorithm of cubic time complexity previously obtained by Chang et al. (2011). [ABSTRACT FROM AUTHOR]

Given a source node and a node set, the node-to-set disjoint paths problem is to find disjoint paths from the source node to all nodes from the node set. In this paper, we propose an improved algorithm for the node-to-set disjoint paths problem on bi-rotator graphs. Our result improves the complexity of previous result from to , where n is the dimension of the input graph. [ABSTRACT FROM AUTHOR]

Multiple edge-disjoint Hamiltonian cycles (EDHCs) provide the advantages of data broadcast in parallel and edge fault-tolerance in network communications. This paper investigates how to construct more EDHCs in a hypercube-variant network called crossed cube, denoted as C Q n . The topology of C Q n has more wealth than normal hypercubes in network properties, e.g., it has about half of the diameter of a hypercube with the same dimension. Then, we obtain the following results in this paper: (1) We first provide the construction of three EDHCs in C Q 6 . (2) According to the recursive structure of C Q n , we prove by induction that there exist also three EDHCs in C Q n for n ⩾ 7 . (3) Finally, we evaluate the performance of data broadcasting by simulation through three EDHCs and compare it against the best previous result in [18] using two EDHCs. In particular, our findings significantly improved the average success rate in edge fault-tolerant data broadcasting and two specific metrics concerning the broadcasting delivery time (latency). [ABSTRACT FROM AUTHOR]

Block graphs are graphs in which every block (biconnected component) is a clique. A graph G = ( V , E ) is said to be an (unpartitioned) probe block graph if there exist an independent set N ⊆ V and some set E ′ ⊆ ( N 2 ) such that the graph G ′ = ( V , E ∪ E ′ ) is a block graph; if such an independent set N is given, G is called a partitioned probe block graph. In this note we give good characterizations for probe block graphs, in both unpartitioned and partitioned cases. As a result, partitioned and unpartitioned probe block graphs can be recognized in linear time. [ABSTRACT FROM AUTHOR]

Abstract: For a given graph , the interval completion problem of G is to find an edge set F such that the supergraph of G is an interval graph and is minimum. It has been shown that it is equivalent to the minimum sum cut problem, the profile minimization problem and a kind of graph searching problems. Furthermore, it has applications in computational biology, archaeology, and clone fingerprinting. In this paper, we show that it is NP-complete on split graphs and propose an efficient algorithm on primitive starlike graphs. [Copyright &y& Elsevier]

An efficient minus (respectively, signed) dominating function of a graph G=(V,E) is a function f : V→{−1,0,1} (respectively, {−1,1}) such that ∑u∈N[v] f(u)=1 for all v∈V, where N[v]={v}∪{u | (u,v)∈E}. The efficient minus (respectively, signed) domination problem is to find an efficient minus (respectively, signed) dominating function of G. In this paper, we show that the efficient minus (respectively, signed) domination problem is NP-complete on chordal graphs, chordal bipartite graphs, planar bipartite graphs and planar graphs of maximum degree 4 (respectively, on chordal graphs). Based on the forcing property on blocks of vertices and automata theory, we provide a uniform approach to show that in a special class of interval graphs, every graph (respectively, every graph with no vertex of odd degree) has an efficient minus (respectively, signed) dominating function. We also give linear-time algorithms to find these functions. Besides, we show that the efficient minus domination problem is equivalent to the efficient domination problem on trees. [Copyright &y& Elsevier]

In order to avoid the direct depth reconstruction of the original image pair and improve the accuracy of the results, we proposed a coarse-to-fine stereo matching network combining multi-level residual optimization and depth map super-resolution (ASR-Net). First, we used the u-net feature extractor to obtain the multi-scale feature pair. Second, we reconstructed global disparity in the lowest resolution. Then, we regressed the residual disparity using the higher-resolution feature pair. Finally, the lowest-resolution depth map was refined by using the disparity residual. In addition, we introduced deformable convolution and group-wise cost volume into the network to achieve adaptive cost aggregation. Further, the network uses ABPN instead of the traditional interpolation method. The network was evaluated on three datasets: scene flow, kitti2015, and kitti2012 and the experimental results showed that the speed and accuracy of our method were excellent. On the kitti2015 dataset, the three-pixel error converged to 2.86%, and the speed was about six times and two times that of GC-net and GWC-net. [ABSTRACT FROM AUTHOR]

Let d-claw (or d-star) stand for K 1 , d , the complete bipartite graph with 1 and d ≥ 1 vertices on each part. The d-claw vertex deletion problem, d -claw-vd, asks for a given graph G and an integer k if one can delete at most k vertices from G such that the resulting graph has no d-claw as an induced subgraph. Thus, 1 -claw-vd and 2 -claw-vd are just the famous vertex cover problem and the cluster vertex deletion problem, respectively. In this paper, we strengthen a hardness result recently proved in Jena and Subramani (in: Du, Du, Wu, and Zhu (eds) Theory and applications of models of computation - 17th annual conference, TAMC 2022, Tianjin, China, September 16–18, 2022, Proceedings, 2022), by showing that cluster vertex deletion remains NP -complete even when restricted to planar bipartite graphs of maximum degree 3 and arbitrary large girth. Moreover, for every d ≥ 3 , we show that d -claw-vd is NP -complete even when restricted to planar bipartite graphs of maximum degree d. These hardness results are optimal with respect to degree constraint. By extending the hardness result in Bonomo-Braberman et al (in: Computing and combinatorics - 26th international conference, COCOON 2020, Proceedings, Lecture Notes in Computer Science, vol 12273, Springer, 2020, pp 14–26, 2020), we show that, for every d ≥ 3 , d -claw-vd is NP -complete even when restricted to split graphs without (d + 1) -claws, and split graphs of diameter 2. On the positive side, we prove that d -claw-vd is polynomially solvable on what we call d-block graphs, a class properly contains all block graphs. This result extends the polynomial-time algorithm in Cao et al (Theor Comput Sci, 2018) for 2 -claw-vd on block graphs to d -claw-vd for all d ≥ 2 and improves the polynomial-time algorithm proposed by Bonomo-Brabeman et al. for (unweighted) 3 -claw-vd on block graphs to 3-block graphs. [ABSTRACT FROM AUTHOR]

A common approach to scale up a network is by connecting several small-scale networks to form a larger network. A multigraph composition network is a typical network structure obtained by adding an edge set between several connected graphs in the same order. This paper investigates the diagnosability on two categories of multigraph composition networks, that is, multigraph alternating composition networks and multigraph 2-matching composition networks, under the PMC and MM⁎ models. As corollaries, the diagnosability of several known networks, such as alternating group graphs, k -ary n -cubes, and round matching composition networks, can be derived directly. [ABSTRACT FROM AUTHOR]

Traditional model compression techniques are dependent on handcrafted features and require domain experts, with a tradeoff between model size, speed, and accuracy. This study proposes a new approach toward resolving model compression problems. Our approach combines reinforcement-learning-based automated pruning and knowledge distillation to improve the pruning of unimportant network layers and the efficiency of the compression process. We introduce a new state quantity that controls the size of the reward and an attention mechanism that reinforces useful features and attenuates useless features to enhance the effects of other features. The experimental results show that the proposed model is superior to other advanced pruning methods in terms of the computation time and accuracy on CIFAR-100 and ImageNet dataset, where the accuracy is approximately 3% higher than that of similar methods with shorter computation times. [ABSTRACT FROM AUTHOR]

The generalized |$k$| -connectivity of a graph |$G$| is a parameter that can measure the reliability of a network |$G$| to connect any |$k$| vertices in |$G$|⁠ , which is a generalization of traditional connectivity. Let |$S\subseteq V(G)$| and |$\kappa _{G}(S)$| denote the maximum number |$r$| of edge-disjoint trees |$T_{1}, T_{2}, \cdots , T_{r}$| in |$G$| such that |$V(T_{i})\bigcap V(T_{j})=S$| for any |$i, j \in \{1, 2, \cdots , r\}$| and |$i\neq j$|⁠. For an integer |$k$| with |$2\leq k\leq n$|⁠ , the generalized |$k$| -connectivity of a graph |$G$| is defined as |$\kappa _{k}(G)= min\{\kappa _{G}(S)|S\subseteq V(G)$| and |$|S|=k\}$|⁠. In this paper, we introduce a family of regular graph |$G_{n}$| that can be constructed recursively and each vertex with exactly one outside neighbor. The generalized |$3$| -connectivity of the regular graph |$G_{n}$| is studied, which attains a previously proven upper bound on |$\kappa _{3}(G)$|⁠. As applications of the main result, the generalized |$3$| -connectivity of some important networks including some known results such as the alternating group network |$AN_{n}$|⁠ , the star graph |$S_{n}$| and the pancake graphs |$P_{n}$| can be obtained directly. [ABSTRACT FROM AUTHOR]

Sentiment analysis aimed to automate the task of discriminating the sentiment tendency of a textual review, which expresses a simple sentiment as positive, negative, or neutral. In general, the basic sentiment analysis solution used for feature extraction is the word embedding technique, which only focuses on the contextual or global semantic information and ignores the sentiment polarity of text. Thus, the word embedding technique leads to biased analysis results, especially for some words that have the same semantic context but an opposite sentiment. In this paper, we propose an integrated sentiment embedding method to combine context and sentiment information using a dual-task learning algorithm to perform sentiment analysis. First, we propose three sentiment language models by encoding the sentiment information of texts into word embedding based on three existing semantic models, namely, continuous bag-of-words, prediction, and log-bilinear. Next, based on semantic language models and the proposed sentiment language models, we propose a dual-task learning algorithm to generate hybrid word embedding named integrated sentiment embedding, in which the joint learning method and parallel learning method are applied to jointly process tasks. Experiments on sentence-level and document-level sentiment classification tasks demonstrate that the proposed integrated sentiment embedding has better classification performances compared with basic word embedding methods. [ABSTRACT FROM AUTHOR]

Highlights • Redefine the verification condition in (k, n)-MCPVCS. • Define a minimum (k, n)-connected graph problem. • Propose a (k , n)-MCPVCS with large size of verification image based on minimum (k, n)-connected graph. Recently, Lin et al. [29] introduced a (k , n) multi-factor cheating prevention visual cryptographic scheme (MCPVCS) by hiding verification images into shadow images. Through authenticating the verification image and the reconstructed image simultaneously, Lin et al.’s MCPVCS can prevent cheating attack that dishonest participants may collude and cheat the honest one to get a wrong secret image. However, the large n reduces the size of verification image and makes the verification difficult. In this paper, a (k , n)-MCPVCS with the large size of verification image is proposed. There are three main contributions for the proposed (k , n)-MCPVCS: (i) the verification condition in (k , n)-MCPVCS is redefined, (ii) a new minimum (k , n)-connected graph problem is introduced, on which the minimum number of verification images is determined, and (iii) the proposed (k , n)-MCPVCS with the large size of verification image can more easily authenticate the unambiguity of verification image. [ABSTRACT FROM AUTHOR]

In the single pruning algorithm, channel pruning or filter pruning is used to compress the deep convolution neural network, and there are still many redundant parameters in the compressed model. Directly pruning the filter will largely cause the loss of key information and affect the accuracy of model classification. To solve these problems, a parallel pruning algorithm combined with image enhancement is proposed. Firstly, in order to improve the generalization ability of the model, a data enhancement method of random erasure is introduced. Secondly, according to the trained batch normalization layer scaling factor, the channels with small contribution are cut off, the model is initially thinned, and then the filters are pruned. By calculating the geometric median of the filters, redundant filters similar to them are found and pruned, and their similarity is measured by calculating the distance between filters. Pruning was done using VGG19 and DenseNet40 on cifar10 and cifar100 data sets. The experimental results show that this algorithm can improve the accuracy of the model, and at the same time, it can compress the calculation and parameters of the model to a certain extent. Finally, this method is applied in practice, and combined with transfer learning, traffic objects are classified and detected on the mobile phone. [ABSTRACT FROM AUTHOR]

Tallini and Bose defined a random walk function on which an efficient encoding/decoding algorithm for second-order spectral-null (2-OSN) codes was based. Later, Yang enhanced Tallini-Bose code by using quasi 2-OSN codes. Both 2-OSN codes encode the information word into a balanced word and then append extra bits to make the length of this balanced word equal to 0 (or 2) modulo 4. The main innovation is to eliminate the need for appended bits, thereby increasing the code rate. [ABSTRACT FROM AUTHOR]

• We prove that a highly scalable data center network (HSDC) is vertex-symmetric. • We investigate the independent spanning trees (IST) problem on HSDC. • We propose an algorithm to construct n ISTs on the n -dimensional HSDC, denoted as H S n. • The algorithm can be parallelized to run in O (n) time using N = 2 n processors. • As a by-product, we obtain the connectivity of H S n to be n. An emerging datacenter network (DCN) with high scalability called HSDC is a server-centric DCN that can help cloud computing in supporting many inherent cloud services. For example, a server-centric DCN can initiate routing for data transmission. This paper investigates the construction of independent spanning trees (ISTs for short), a set of the rooted spanning trees associated with the disjoint-path property, in HSDC. Regarding multiple spanning trees as routing protocol, ISTs have applications in data transmission, e.g., fault-tolerant broadcasting and secure message distribution. We first establish the vertex-symmetry of HSDC. Then, by the structure that n -dimensional HSDC is a compound graph of an n -dimensional hypercube Q n and n -clique K n , we amend the algorithm constructing ISTs for Q n to obtain the algorithm required by HSDC. Unlike most algorithms of recursively constructing tree structures, our algorithm can find every node's parent in each spanning tree directly via an easy computation relied upon only the node address and tree index. Consequently, we can implement the algorithm for constructing n ISTs in O (n N) time, where N = n 2 n is the number of vertices of n -dimensional HSDC; or parallelize the algorithm in O (n) time using N processors. Remarkably, the diameter of the constructed ISTs is about twice the diameter of Q n. [ABSTRACT FROM AUTHOR]

Background: Nowadays, smart healthcare minimizes medical facilities costs, ease staff burden, achieve unified control of materials and records, and enhance patients' medical experience. Smart healthcare treatments have critical barriers to improving patient outcomes, reducing the regulatory burden, and promoting the transition from volume to benefit.Objective: In this paper, the Internet of Things-assisted Intelligent Monitoring Model (IoT-IMM) has been proposed to improve patient health and maintain health records.Method: The advanced IoT sensors can monitor patient health and insert into the patients' bodies. Information collected can be analyzed, aggregated, and mined to predict diseases at an early stage. For that, an enhanced deep learning network using Bayes theorem (EDLN-BT) benefits to obtain and verify various patient health data in a specific aspect, making it easy to supervise the patient's activities.Results: The IoT-IMM-based EDLN-BT results show the smart health care monitoring has undergone substantial growth, improving patient satisfaction for the quality of the healthcare services offered in hospitals and many other healthcare facilities. It helps predict health diseases with increased accuracy, prediction rate with minimal residual error delay, and energy consumption. [ABSTRACT FROM AUTHOR]

Background: Internet of Things (IoT) technology provides a tremendous and structured solution to tackle service deliverance aspects of healthcare in terms of mobile health and remote patient tracking. In medicine observation applications, IoT and cloud computing serves as an assistant in the health sector and plays an incredibly significant role. Health professionals and technicians have built an excellent platform for people with various illnesses, leveraging principles of wearable technology, wireless channels, and other remote devices for low-cost healthcare monitoring.Objective: This paper proposed the Fog-IoT-assisted multisensor intelligent monitoring model (FIoT-MIMM) for analyzing the patient's physical health condition.Method: The proposed system uses a multisensor device for collecting biometric and medical observing data. The main point is to continually generate emergency alerts on mobile phones from the fog system to users. For the precautionary steps and suggestions for patients' health, a fog layer's temporal information is used.Results: Experimental findings show that the proposed FIoT-MIMM model has less response time and high accuracy in determining a patient's condition than other existing methods. Furthermore, decision making based on real-time healthcare information further improves the utility of the suggested model. [ABSTRACT FROM AUTHOR]

Background: Recently, wearable technologies have gained attention in diverse applications of the medical platform to guarantee the health and safety of the sportsperson with the assistance of the Internet of things (IoT) device. The IoT device's topology varies due to the shift in users' orientation and accessibility, making it impossible to assign resources, and routing strategies have been considered the prominent factor in the current medical research. Further, for sportspersons with sudden cardiac arrests, hospital survival rates are low in which wearable IoT devices play a significant role.Objective: In this paper, the energy efficient optimized heuristic framework (EEOHF) has been proposed and implemented on a wearable device of the sportsperson's health monitoring system.Method: The monitoring system has been designed with cloud assistance to locate the nearest health centers during an emergency. The wearable sensor technologies have been used with an optimized energy-efficient algorithm that helps athletes monitor their health during physical workouts. The monitoring system has fitness tracking devices, in which health information is gathered, and workout logs are tracked using EEOHF. The proposed method is applied to evaluate and track the sportsperson's fitness based on case study analysis.Results: The simulation results have been analyzed, and the proposed EEOHF achieves a high accuracy ratio of 97.8%, a performance ratio of 95.3%, and less energy consumption of 9.4%, delay of 13.1%, and an average runtime of 98.2% when compared to other existing methods. [ABSTRACT FROM AUTHOR]

Background: Physical health monitoring may take several forms, from individual quality changes to complex health checks carried out by health staff. Present health issues are detected with monitoring, and potential health problems are expected. Wearable sensors provide users with ease in everyday tracking, although many issues must be addressed in such sensor systems. The devices take a long time to obtain the requisite detection and diagnostic expertise and produce false alarms.Objective: In this paper, the Internet of Things-assisted Health Condition Monitoring system (IoT-HCMS) has been proposed to track and analyze the patient physical health condition.Method: The proposed IoT-HCMS utilizes the intelligent monitoring model to follow the patient physical health day by day activities and instantaneously generate the health records. The system will indeed support patients in tracking psychological signs to minimize risks to their well-being.Results: The experimental results show that the IoT-HCMS improves accuracy in patient health monitoring and has less response time. [ABSTRACT FROM AUTHOR]

Background: Soccer is one of the world's most successful sports with several players. Quality player's activity management is a tough job for administrators to consider in the Internet of Things (IoT) platform. Candidates need to predict the position, intensity, and path of the shot to look back on their results and determine the stronger against low shot and blocker capacities.Objective: In this paper, the IoT-assisted wearable device for activity prediction (IoT-WAP) model has been proposed for predicting the activity of soccer players.Method: The accelerometer built wearable devices formulates the impacts of multiple target attempts from the prevailing foot activity model that reflect a soccer player's characteristics. The deep learning technique is developed to predict players' various actions for identifying multiple targets from the differentiated input data compared to conventional strategies. The Artificial Neural Network determines a football athlete's total abilities based on football activities like transfer, kick, run, sprint, and dribbling.Results: The experimental results show that the suggested system has been validated from football datasets and enhances the accuracy ratio of 97.63%, a sensitivity ratio of 96.32%, and a specificity ratio of 93.33% to predict soccer players' various activities. [ABSTRACT FROM AUTHOR]

Background: Internet of Things (IoT) is a hopeful advancement that is an accurate international link for smart devices for total initiatives. Physical Education (PE) builds students' abilities and trust to engage in various physical activities, both within and outside their classrooms. The challenging characteristics in the learning management system include lack of setting a clear goal, lack of system integration, and failure to find an implementation team is considered as an essential factor.Objective: In this paper, an IoT-based technological acceptance learning management framework (IoT-TALMF) has been proposed to identify the objectives, resource allocation, and effective team for group work in the physical education system.Method: Physical Educators primarily use the learning management framework as databases of increased management components, choosing to interact with students, teammates, organizations. Statistical course content analysis is introduced to identify and set clear goals that motivate students for the physical education system. The course instructor learning technique is incorporated with IoT-TALMF to improve system integration based on accuracy and implement an effective team to handle unexpected cost delays in the physical education system.Results: The numerical results show that the IoT-TALMF framework enhances the identity accuracy ratio of 97.33%, the performance ratio of students 96.2%, and the reliability ratio of 97.12%, proving the proposed framework's reliability. [ABSTRACT FROM AUTHOR]

Background: Health monitoring is important for early disease diagnosis and will reduce the discomfort and treatment expenses, which is very relevant in terms of prevention. The early diagnosis and treatment of multiple conditions will improve solutions to the patient's healthcare radically. A concept model for the real-time patient tracking system is the primary goal of the method. The Internet of things (IoT) has made health systems accessible for programs based on the value of patient health.Objective: In this paper, the IoT-based cloud computing for patient health monitoring framework (IoT-CCPHM), has been proposed for effective monitoring of the patients.Method: The emerging connected sensors and IoT devices monitor and test the cardiac speed, oxygen saturation percentage, body temperature, and patient's eye movement. The collected data are used in the cloud database to evaluate the patient's health, and the effects of all measures are stored. The IoT-CCPHM maintains that the medical record is processed in the cloud servers.Results: The experimental results show that patient health monitoring is a reliable way to improve health effectively. [ABSTRACT FROM AUTHOR]

Background: The modern Internet of Things (IoT) makes small devices that can sense, process, interact, connect devices, and other sensors ready to understand the environment. IoT technologies and intelligent health apps have multiplied. The main challenges in the sports environment are playing without injuries and healthily.Objective: In this paper the Internet of Things-based Smart Wearable System (IoT-SWS) is introduced for monitoring sports person activity to improve sports person health and performance in a healthy way.Method: Wearable systems are commonly used to capture individual sports details on a real-time basis. Collecting data from wearable devices and IoT technologies can help organizations learn how to optimize in-game strategies, identify opponents' vulnerabilities, and make smarter draft choices and trading decisions for a sportsperson.Results: The experimental result shows that IoT-SWS achieve the highest accuracy of 98.22% and efficient in predicting the sports person's health to improve sports person performance reliably. [ABSTRACT FROM AUTHOR]

Background: Physical health is vital to the improvement of our skills and the enhancement of eye movements. The coordination of good body movement helps to establish a safe position of the body. The challenging characteristics of physical education include insufficient time allocation, inadequately trained teachers, and inadequate provision of the equipment is considered as an important factor.Objective: In this paper, IoT-based Computational Narrowband Physical Health Framework (IoT-CNPHF) has been proposed to strengthen adequate time allocation, appropriately qualified teachers, and sustainable provision in the physical education system.Method: Massive extended range analysis is introduced to enhance the duration and time allotted for physical activity that helps in creating awareness about the importance of physical activities and sports in our daily life. The multimodal supervised technique is incorporated with IoT-CNPHF to improve the knowledge of physical education for the teachers and to provide suitable provision for students in the physical education system.Results: The simulation analysis is performed based on accuracy, performance, and its efficiency proves the reliability of the proposed framework. [ABSTRACT FROM AUTHOR]

Background: Physical exercise programs are required to improve students' physical ability, physical fitness, self-responsibility, and satisfaction to remain physically active for a lifetime. The supporting system's demanding characteristics include lack of school leadership support, and lack of communication skills among students is considered an essential factor in the physical education system.Objective: In this paper, an Internet of Things (IoT)-based intelligent physical support framework (IoT-IPSF) has been proposed to encourage education leadership and student social interaction in the physical education system.Method: Training service analysis is introduced to improve adequate leadership support, helping in the physical education system's growth. Self-determination analysis is integrated with IoT-IPSF to enhance effective communication among school teachers, educational experts, and curriculum officers in the physical education system.Results: The simulation results show that the proposed method achieves a high accuracy ratio of 98.7%, an efficiency ratio of 95.6, student performance 97.8%, fitness level 82.3%, activity involvement 94.5% compared to other existing models. [ABSTRACT FROM AUTHOR]

Background: In recent years the Internet of Things (IoT) has become a popular technological culture in the physical education system. Though several technologies have grown in the physical education system domain, IoT plays a significant role due to its optimized health information processing framework for students during workouts.Objective: In this paper, an advanced dynamic information processing system (ADIPS) has been proposed with IoT assistance to explore the traditional design architecture for physical activity tracking.Method: To track and evaluate human physical activity in day-to-day living, a new paradigm has been integrated with wearable IoT devices for effective information processing during physical workouts. Continuous observation and review of the condition and operations of various students by ADIPS helps to evaluate the sensed information to analyze the health condition of the students.Results: The result of ADIPS has been implemented based on the performance factor correlation with the traditional system. [ABSTRACT FROM AUTHOR]

In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP -complete. While Matching Cut is trivial for graphs with minimum degree at most one, it is NP -complete on graphs with minimum degree two. In this paper, we show that, for any given constant c > 1 , Matching Cut is NP -complete in the class of graphs with minimum degree c and this restriction of Matching Cut has no subexponential-time algorithm in the number of vertices unless the Exponential-Time Hypothesis fails. We also show that, for any given constant ϵ > 0 , Matching Cut remains NP -complete in the class of n-vertex (bipartite) graphs with unbounded minimum degree δ > n 1 - ϵ . We give an exact branching algorithm to solve Matching Cut for graphs with minimum degree δ ≥ 3 in O ∗ (λ n) time, where λ is the positive root of the polynomial x δ + 1 - x δ - 1 . Despite the hardness results, this is a very fast exact exponential-time algorithm for Matching Cut on graphs with large minimum degree; for instance, the running time is O ∗ (1. 0099 n) on graphs with minimum degree δ ≥ 469 . Complementing our hardness results, we show that, for any two fixed constants 1 < c < 4 and c ′ ≥ 0 , Matching Cut is solvable in polynomial time for graphs with large minimum degree δ ≥ 1 c n - c ′ . [ABSTRACT FROM AUTHOR]

A smart city refers to a city equipped with the basic infrastructure to provide a good quality of life and a clean and sustainable environment to its citizens using smart technology-based solutions. This article (Zhang & Liu, 2022) conducts APP page management through technical analysis of mobile devices and user experience-oriented design. The selected papers present in-depth studies of practical issues and challenging problems in Big Data Analytics with IoT-oriented Infrastructures for Future Smart Cities. [Extracted from the article]

Abstract: Let be a class of graphs. A graph has -width if there are independent sets in such that can be embedded into a graph such that for every edge in which is not an edge in , there exists an such that both endvertices of are in . For the class of block graphs we show that graphs with -width at most 4 are perfect. We also show that -width is NP-complete and show that it is fixed-parameter tractable. For the class of complete graphs, similar results are also obtained. [Copyright &y& Elsevier]

Abstract: Given a class of graphs , a graph is a probe graph of if its vertices can be partitioned into two sets, , the probes, and an independent set , the nonprobes, such that can be embedded into a graph of by adding edges between certain vertices of . If the partition of the vertices into probes and nonprobes is part of the input, then we call the graph a partitioned probe graph of . In this paper, we provide a recognition algorithm for partitioned probe permutation graphs with time complexity , where is the number of vertices of the input graph. We show that a probe permutation graph has at most minimal separators. As a consequence, for probe permutation graphs there exist polynomial-time algorithms solving problems like treewidth and minimum fill-in. We also characterize those graphs for which the probe graphs must be weakly chordal. [Copyright &y& Elsevier]

Abstract: A Roman dominating function of a graph is a function such that every vertex with is adjacent to at least one vertex with . The weight of a Roman dominating function is defined to be , and the minimum weight of a Roman dominating function on a graph is called the Roman domination number of . In this paper we first answer an open question mentioned in [E.J. Cockayne, P.A. Dreyer Jr., S.M. Hedetniemi, S.T. Hedetniemi, Roman domination in graphs, Discrete Math. 278 (2004) 11–22] by showing that the Roman domination number of an interval graph can be computed in linear time. We then show that the Roman domination number of a cograph (and a graph with bounded cliquewidth) can be computed in linear time. As a by-product, we give a characterization of Roman cographs. It leads to a linear-time algorithm for recognizing Roman cographs. Finally, we show that there are polynomial-time algorithms for computing the Roman domination numbers of -free graphs and graphs with a -octopus. [Copyright &y& Elsevier]

Abstract: Given a class of graphs , a graph is a probe graph of if its vertices can be partitioned into a set of probes and an independent set of nonprobes such that can be embedded into a graph of by adding edges between certain nonprobes. If the partition of the vertices is part of the input, we call a partitioned probe graph of . In this paper we show that there exists a polynomial-time algorithm for the recognition of partitioned probe graphs of comparability graphs. This immediately leads to a polynomial-time algorithm for the recognition of partitioned probe graphs of cocomparability graphs. We then show that a partitioned graph is a partitioned probe permutation graph if and only if is at the same time a partitioned probe graph of comparability and cocomparability graphs. [Copyright &y& Elsevier]

An introduction to the journal is presented in which the editor discusses various reports within the issue on topics including communication systems, networking for pervasive computing environments, and communication algorithms and protocols.