Skip to main content

qiuhua zheng

Followers

0

Following

1

Public Views

University of Macau

Nara Institute of Science and Technology (NAIST)

Hiroshi Arakawa

Sultan Aljahdali

Taif University, Kingdom of Saudi Arabia

mehrdad yadollahi

University of Tehran

Hyunwoo Hwangbo

University of Pennsylvania

Tsinghua University

Interests

Uploads

Papers by qiuhua zheng

Article A Framework for Mining Actionable Navigation Patterns from In-Store RFID Datasets via Indoor Mapping

With the quick development of RFID technology and the decreasing prices of RFID devices, RFID is ... more With the quick development of RFID technology and the decreasing prices of RFID devices, RFID is becoming widely used in various intelligent services. Especially in the retail application domain, RFID is increasingly adopted to capture the shopping tracks and behavior of in-store customers. To further enhance the potential of this promising application, in this paper, we propose a unified framework for RFID-based path analytics, which uses both in-store shopping paths and RFID-based purchasing data to mine actionable navigation patterns. Four modules of this framework are discussed, which are: (1) mapping from the physical space to the cyber space, (2) data preprocessing, (3) pattern mining and (4) knowledge understanding and utilization. In the data preprocessing module, the critical problem of how to capture the mainstream shopping path sequences while wiping out unnecessary redundant and repeated details is addressed in detail. To solve this problem, two types of redundant patterns, i.e., loop repeat pattern and palindrome-contained pattern are recognized and the corresponding processing algorithms are proposed. The experimental results show that the redundant pattern filtering functions are effective and scalable. Overall, this work builds a bridge between indoor positioning and advanced data mining technologies, and provides a feasible way to study customers' shopping behaviors via multi-source RFID data.

Sparse Self-Represented Network Map: A fast representative-based clustering method for large dataset and data stream

Engineering Applications of Artificial Intelligence, 2018

The demand of fast clustering increases rapidly as we keep collecting tremendously large amount o... more The demand of fast clustering increases rapidly as we keep collecting tremendously large amount of data in the last decade. In this paper, we propose a nonparametric and representative-based Sparse Self-Represented Network Map for fast clustering on large dataset. Each node in the network generates a heat map for the dataset by receiving stimulations from data within its Accepting Field. We developed a weight adjusting method to learn and summarize the clustering pattern of the data. Such learned map is used for computing clustering results, by breaking weak links and finding connected components Rather than employing an iterative process to find local minima, our network passes the dataset only once and is able to capture the global pattern of the dataset as well as detecting natural number of clusters. As a nonparametric method, we propose Sparse Dynamic Instantiation to avoid the curse of dimensionality, namely a node or a link is instantiated only when stimulated by input data. As a result, the overall complexity is linear to the data dimension. Our algorithm is tested on synthetic and real datasets and compare with popular clustering algorithms (K-means++, Expectation-Maximization, Mean-Shift and StreamKM++) as well as state-of-art clustering algorithm (Affinity Propagation and Density Peak). We also applied our clustering algorithm to mobile location clustering, building a Visual Dictionary for image recognition, and clustering data streams. Our experiments indicate that our algorithm can be a better alternative for all compared popular clustering algorithms especially when efficiency is the primary consideration, namely we drastically improve time and space complexity but retain equal level of accuracy.

A Novel Image Secret Sharing Scheme without Third-Party Scrambling Method

Mobile Networks and Applications, 2018

Values such as cellular sum in initial configurations and neighbor radius can potentially affect ... more Values such as cellular sum in initial configurations and neighbor radius can potentially affect confusion and diffusion in cellular automata. Specifically, both confusion and diffusion characteristics in cellular automata usually are not sufficient to break up the high correlation between the secret image pixels when these two parameters are too small. Thus, using only One-Dimensional Reversible Memory Cellular Automata (ODRM-CA) to generate shadow images will lead to the leakage of original secret image's information by some shadow images. In order to solve this problem, in this paper, we propose an image secret sharing (ISS) scheme with no third-party scrambling method. This is realized by increasing the values of cellular sum and neighbor radius to implement the scrambling process for the secret image, thus both processes of image scrambling and image secret sharing can be achieved by ODRM-CA. Experimental results show that this scheme can generate strong random shadow images to avoid leaking information of the original secret image.

Performance evaluation for SDN deployment: an approach based on stochastic network calculus

China Communications, 2016

The significant increase in the use of cloud computing, has led to an interest in partitioning ap... more The significant increase in the use of cloud computing, has led to an interest in partitioning applications over a set of public and private clouds in order to meet a range of non-functional requirements including performance (for example where private cloud resources alone are insufficient), dependability (e.g. to allow the application to continue to operate even if one cloud fails) and security (for example to ensure that sensitive data is restricted to sufficiently secure clouds and networks). This paper describes a novel deployment planning algorithm to partition complex workflow-based applications over federated clouds, while meeting security requirements. The security issues are based on our previous work which extends the Bell-LaPadula model to encompass cloud computing. Selecting the cheapest option for partitioning a workflow over a set of resources has been shown to be an NP-hard problem, which can take impractically long for partitioning large workflows over multiple clouds. We therefore introduce a novel adaptive partitioning algorithm to handle these large workflow applications, which significantly reduces the time required to choose a sufficientlygood partitioning option. This is based on generating an initial partitioning, and then adapting it to see if a better solution can be found by bringing together on the same node services with significant communication costs. The algorithm has been implemented and evaluated by using both randomly generated and real world scientific workflows. The experiment results show that our algorithm is thousands times quicker than the exhaustive algorithm presented in our previous work. Yet, on average it generates only 25% more costly solutions. We also compared this algorithm with two other methods commonly used to partition workflows over a set of clouds.

International Trade Modelling Using Open Flow Networks: A Flow-Distance Based Analysis

PloS one, 2015

This paper models and analyzes international trade flows using open flow networks (OFNs) with the... more This paper models and analyzes international trade flows using open flow networks (OFNs) with the approaches of flow distances, which provide a novel perspective and effective tools for the study of international trade. We discuss the establishment of OFNs of international trade from two coupled viewpoints: the viewpoint of trading commodity flow and that of money flow. Based on the novel model with flow distance approaches, meaningful insights are gained. First, by introducing the concepts of trade trophic levels and niches, countries' roles and positions in the global supply chains (or value-added chains) can be evaluated quantitatively. We find that the distributions of trading "trophic levels" have the similar clustering pattern for different types of commodities, and summarize some regularities between money flow and commodity flow viewpoints. Second, we find that active and competitive countries trade a wide spectrum of products, while inactive and underdeveloped...

A Network Event Correlation Algorithm Based on Fault Filtration

Lecture Notes in Computer Science, 2006

This paper proposed a new event correlation technique to enhance the heuristic of the increment h... more This paper proposed a new event correlation technique to enhance the heuristic of the increment hypothesis updating (IHU) algorithm. This approach estimates the likelihood of each fault in the faults set and removes these faults with less likelihood. By this approach we also can determine whether an event is spurious or not. Simulation shows that this approach can get a high accuracy and fast speed of correlation even if the network has a high event loss and spuriousness.

A Novel Approach for Network Event Correlation Based on Set Covering

2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery, 2008

This paper proposes a novel network event correlation approach based on set covering. Firstly, we... more This paper proposes a novel network event correlation approach based on set covering. Firstly, we present a triple-layer belief network FPM by considering alarm loss and spurious faults into the bipartite graph FPM which used by IHU algorithm, then present the measurement of fault hypothesis. On basic of this model, we present a recursive algorithm for creating fault hypotheses. Compared

A solution based on Model-integrated Computing for Embedded OS graphical configuration

2010 International Conference on Computer Application and System Modeling (ICCASM 2010), 2010

Purpose-This research aims to supplement or replace the existing embedded OS with architecture of... more Purpose-This research aims to supplement or replace the existing embedded OS with architecture of semi-network OS, so as to form a co-mobile computing system and to create a new type of networked mobile devices. Method-Co-mobile computing system can only be realized by combining network resources with local resources, then this combination of resources is used to promote intelligent mobile devices to integrate into modern network environment more quickly and comprehensively, and then intelligent mobile devices become real networked one. Result-Under co-mobile computing system, networked mobile devices can not only safely use local resources to maintain the stability and reliability of devices operation, which is mainly attributed to the base portion of semi-network OS (similar to existing embedded OS), but also make full use of network resources to remedy the defect of existing embedded OS, which is mainly attributed to the expanded portion of seminetwork OS. Conclusion-The concept of co-mobile computing mentioned here is defined as a data computing system specially designed for networked mobile devices, which is based on semi-network resources and formed by the merging of multiple networked mobile 190 devices with different embedded OS and functions, now, the semi-network OS architecture will pave a new way for advancement of co-mobile computing system. The semi-network OS refers to that a complete operating system is divided into an expanded portion and a base portion, where the expanded portion of OS is stored on network server, which is ready to be downloaded at any time (similar to a supplement to embedded OS), and the base portion of OS is stored in OSPU located on local platform (similar to embedded OS); wherein the OSPU is a key hardware component in seminetwork OS architecture and is movably installed on different local platforms by users.

Non-deterministic Event Correlation Based on C-F Model

Lecture Notes in Computer Science, 2005

An Event Correlation Approach Based on the Combination of IHU and Codebook

Lecture Notes in Computer Science, 2005

This paper proposes a new event correlation technique, which integrates the increment hypothesis ... more This paper proposes a new event correlation technique, which integrates the increment hypothesis updating (IHU) technique with the codebook approach. The technique allows multiple simultaneous independent faults to be identified when the system's codebook only includes the codes of the single fault and lacks the information of prior fault probability and the conditional probability of fault lead to symptoms occur. The method utilizes the refined IHU technique to create and update fault hypotheses that can explain these events, and ranks these hypotheses by the codebook approach. The result of event correlation is the hypothesis with maximum hamming distance to the code of the received events. Simulation shows that this approach can get a high accuracy and a fast speed of correlation even if the network has event loss and spuriousness.

A Framework for Mining Actionable Navigation Patterns from In-Store RFID Datasets via Indoor Mapping

Sensors (Basel, Switzerland), Jan 5, 2015

With the quick development of RFID technology and the decreasing prices of RFID devices, RFID is ... more With the quick development of RFID technology and the decreasing prices of RFID devices, RFID is becoming widely used in various intelligent services. Especially in the retail application domain, RFID is increasingly adopted to capture the shopping tracks and behavior of in-store customers. To further enhance the potential of this promising application, in this paper, we propose a unified framework for RFID-based path analytics, which uses both in-store shopping paths and RFID-based purchasing data to mine actionable navigation patterns. Four modules of this framework are discussed, which are: (1) mapping from the physical space to the cyber space, (2) data preprocessing, (3) pattern mining and (4) knowledge understanding and utilization. In the data preprocessing module, the critical problem of how to capture the mainstream shopping path sequences while wiping out unnecessary redundant and repeated details is addressed in detail. To solve this problem, two types of redundant patter...

An Interactive Image Segmentation Algorithm Based on Graph Cut

Procedia Engineering, 2012

This paper introduces a new interactive image segmentation algorithm. This algorithm gets better ... more This paper introduces a new interactive image segmentation algorithm. This algorithm gets better result with fewer users interactive when segmenting single-object from images with complex foreground and background. Experiments show that this algorithm effectively solve the common over-segmentation and less-segmentation in graph cut, as well as resolve the problem of small regions error segmented in grab cut algorithm.

Model Interpretation Development: Analysis Design of Automatic Control System

Journal of Software Engineering and Applications, 2009

Currently the development of automatic control system is mainly based on manual design. This has ... more Currently the development of automatic control system is mainly based on manual design. This has made the development process complicated and has made it difficult to guarantee system requirement. This paper presents a Model interpretation development architecture built on meta-models and model interpretation. In this modeling and developing process, different meta-models or domain models may be constructed in terms of various system requirements. Interpreters are used to transform the meta-model into relevant domain model and generate some other formats from domain models, typically with different semantic domains. An interpretation extension interface is introduced, which can be accelerated to develop the model interpreter. This development architecture can improve system reusability and enhance development efficiency. Finally, an example is introduced to explain the advantage of method.

A CORBA Replication Voting Mechanism for Maintaining the Replica Consistent

Journal of Software Engineering and Applications, 2009

Nowadays, more and more applications are being developed through distributed object computing mid... more Nowadays, more and more applications are being developed through distributed object computing middleware, such as CORBA, their requirements for fault-tolerance, especially real time and critical system, become more and more critical. Despite almost ten years have passed since the earliest FT-CORBA standard was promulgated by Object Management Group (OMG), CORBA is still facing many challenges when it is used for distributed applications developing, as the standard is complex and lack of understanding. This paper focus on the consistency of the replicated object and the network partition problem, it incorporates a CORBA Replication Voting Mechanism (CRVM) to meet the challenge which makes a good performance.

Multi-Step Attack Detection Based on Pre-Trained Hidden Markov Models

Sensors

Currently, hidden Markov-based multi-step attack detection models are mainly trained using the un... more Currently, hidden Markov-based multi-step attack detection models are mainly trained using the unsupervised Baum–Welch algorithm. The Baum–Welch algorithm is sensitive to the initial values of model parameters. However, its training uses random or average parameter initialization methods, which frequently results in the model training into a local optimum, thus, making the model unable to fit the alert logs well and thereby reducing the detection effectiveness of the model. To solve this issue, we propose a pre-training method for multi-step attack detection models based on the high semantic similarity of alerts in the same attack phase. The method first clusters the alerts based on their semantic information and pre-classifies the attack phase to which each alert belongs. Then, the distance of the alert vector to each attack stage is converted into the probability of generating alerts in each attack stage, replacing the initial value of Baum–Welch. The effectiveness of the proposed...

Improved Single-Key Attacks on 2-GOST

Security and Communication Networks, 2020

GOST, known as GOST-28147-89, was standardized as the Russian encryption standard in 1989. It is ... more GOST, known as GOST-28147-89, was standardized as the Russian encryption standard in 1989. It is a lightweight-friendly cipher and suitable for the resource-constrained environments. However, due to the simplicity of GOST’s key schedule, it encountered reflection attack and fixed point attack. In order to resist such attacks, the designers of GOST proposed a modification of GOST, namely, 2-GOST. This new version changes the order of subkeys in the key schedule and uses concrete S-boxes in round function. But regarding single-key attacks on full-round 2-GOST, Ashur et al. proposed a reflection attack with data of 2 32 on a weak-key class of size 2 224 , as well as the fixed point attack and impossible reflection attack with data of 2 64 for all possible keys. Note that the attacks applicable for all possible keys need the entire plaintext space. In other words, these are codebook attacks. In this paper, we propose single-key attacks on 2-GOST with only about 2 32 data instead of code...

An Identity-Based Cross-Domain Authenticated Asymmetric Group Key Agreement

Information, 2021

Cross-domain authenticated asymmetric group key agreement allows group members in different domai... more Cross-domain authenticated asymmetric group key agreement allows group members in different domains to establish a secure group communication channel and the senders can be anyone. However, the existing schemes do not meet the requirement of batch verification in the group key negotiation phase, which makes the schemes have low efficiency. To address this problem, an identity-based cross-domain authenticated asymmetric group key agreement is proposed that supports batch verification. The performance analysis shows that this protocol is highly efficient. Finally, the proposed protocol is proved to be secure under the k-Bilinear Diffie–Hellman Exponent assumption.

DHS-Voting: A Distributed Homomorphic Signcryption E-Voting

Communications in Computer and Information Science, 2019

In electronic voting, voters encrypt their ballots and post them on a bulletin board, where the r... more In electronic voting, voters encrypt their ballots and post them on a bulletin board, where the results are tallied by authorities. The right to tally is fully controlled by authorities, who generates a certificate to prove the results are correct, but their attempts to tamper with the bulletin board and falsify the certificate are inevitable. Therefore, we propose an electronic voting scheme based on distributed encryption and homomorphic signcryption, DHS-Voting, which can not only enable the verification of signatures to be completed quickly, but also allows anyone to get the result of the election with the help of the authorities, making the election results more credible. In addition, we prove that DHS-Voting satisfies the ballot privacy and some necessary properties of electronic voting, which we will prove in detail in the paper.

Identification of Private ICS Protocols Based on Raw Traffic

Symmetry, 2021

With the development of the Industrial Internet in recent years, security issues have been a hot ... more With the development of the Industrial Internet in recent years, security issues have been a hot topic of the industrial control system (ICS) network management. Identifying the protocol traffic in the communication process of the ICS is an important prerequisite to avoid security problems, especially in ICSs that use many private protocols. The private protocols cannot be analyzed due to the unknown internal structure of the protocols, which makes the ICS protocol identification work more difficult. However, the Internet-oriented protocol identification method is not applicable to the scenario of the private ICS protocols network environment. With this problem in mind, this paper proposes a method of ICS protocol identification based on the raw traffic payload. The method firstly performs data preprocessing such as data selection, interception, cleaning conversion, and labeling on the raw traffic of the protocol based on the characteristics of the industrial control protocol. Then ...

DSM: Delayed Signature Matching in Deep Packet Inspection

Symmetry, 2020

Deep Packet Inspection (DPI) is widely used in network management and network security systems. T... more Deep Packet Inspection (DPI) is widely used in network management and network security systems. The core part of existing DPI is signature matching, and many researchers focus on improving the signature-matching algorithms. In this paper, we work from a different angle: The scheduling of signature matching. We propose a Delayed Signature Matching (DSM) method, in which we do not always immediately match received packets to the signatures since there may be not enough packets received yet. Instead, we predefine some rules, and evaluate the packets against these rules first to decide when to start signature matching and which signatures to match. The predefined rules are convenient to create and maintain since they support custom expressions and statements and can be created in a text rule file. The correctness and performance of the DSM method are theoretically analyzed as well. Finally, we implement a prototype of the DSM method in the open-source DPI library nDPI, and find that it ...

Article A Framework for Mining Actionable Navigation Patterns from In-Store RFID Datasets via Indoor Mapping

With the quick development of RFID technology and the decreasing prices of RFID devices, RFID is ... more With the quick development of RFID technology and the decreasing prices of RFID devices, RFID is becoming widely used in various intelligent services. Especially in the retail application domain, RFID is increasingly adopted to capture the shopping tracks and behavior of in-store customers. To further enhance the potential of this promising application, in this paper, we propose a unified framework for RFID-based path analytics, which uses both in-store shopping paths and RFID-based purchasing data to mine actionable navigation patterns. Four modules of this framework are discussed, which are: (1) mapping from the physical space to the cyber space, (2) data preprocessing, (3) pattern mining and (4) knowledge understanding and utilization. In the data preprocessing module, the critical problem of how to capture the mainstream shopping path sequences while wiping out unnecessary redundant and repeated details is addressed in detail. To solve this problem, two types of redundant patterns, i.e., loop repeat pattern and palindrome-contained pattern are recognized and the corresponding processing algorithms are proposed. The experimental results show that the redundant pattern filtering functions are effective and scalable. Overall, this work builds a bridge between indoor positioning and advanced data mining technologies, and provides a feasible way to study customers' shopping behaviors via multi-source RFID data.

Sparse Self-Represented Network Map: A fast representative-based clustering method for large dataset and data stream

Engineering Applications of Artificial Intelligence, 2018

The demand of fast clustering increases rapidly as we keep collecting tremendously large amount o... more The demand of fast clustering increases rapidly as we keep collecting tremendously large amount of data in the last decade. In this paper, we propose a nonparametric and representative-based Sparse Self-Represented Network Map for fast clustering on large dataset. Each node in the network generates a heat map for the dataset by receiving stimulations from data within its Accepting Field. We developed a weight adjusting method to learn and summarize the clustering pattern of the data. Such learned map is used for computing clustering results, by breaking weak links and finding connected components Rather than employing an iterative process to find local minima, our network passes the dataset only once and is able to capture the global pattern of the dataset as well as detecting natural number of clusters. As a nonparametric method, we propose Sparse Dynamic Instantiation to avoid the curse of dimensionality, namely a node or a link is instantiated only when stimulated by input data. As a result, the overall complexity is linear to the data dimension. Our algorithm is tested on synthetic and real datasets and compare with popular clustering algorithms (K-means++, Expectation-Maximization, Mean-Shift and StreamKM++) as well as state-of-art clustering algorithm (Affinity Propagation and Density Peak). We also applied our clustering algorithm to mobile location clustering, building a Visual Dictionary for image recognition, and clustering data streams. Our experiments indicate that our algorithm can be a better alternative for all compared popular clustering algorithms especially when efficiency is the primary consideration, namely we drastically improve time and space complexity but retain equal level of accuracy.

A Novel Image Secret Sharing Scheme without Third-Party Scrambling Method

Mobile Networks and Applications, 2018

Values such as cellular sum in initial configurations and neighbor radius can potentially affect ... more Values such as cellular sum in initial configurations and neighbor radius can potentially affect confusion and diffusion in cellular automata. Specifically, both confusion and diffusion characteristics in cellular automata usually are not sufficient to break up the high correlation between the secret image pixels when these two parameters are too small. Thus, using only One-Dimensional Reversible Memory Cellular Automata (ODRM-CA) to generate shadow images will lead to the leakage of original secret image's information by some shadow images. In order to solve this problem, in this paper, we propose an image secret sharing (ISS) scheme with no third-party scrambling method. This is realized by increasing the values of cellular sum and neighbor radius to implement the scrambling process for the secret image, thus both processes of image scrambling and image secret sharing can be achieved by ODRM-CA. Experimental results show that this scheme can generate strong random shadow images to avoid leaking information of the original secret image.

Performance evaluation for SDN deployment: an approach based on stochastic network calculus

China Communications, 2016

The significant increase in the use of cloud computing, has led to an interest in partitioning ap... more The significant increase in the use of cloud computing, has led to an interest in partitioning applications over a set of public and private clouds in order to meet a range of non-functional requirements including performance (for example where private cloud resources alone are insufficient), dependability (e.g. to allow the application to continue to operate even if one cloud fails) and security (for example to ensure that sensitive data is restricted to sufficiently secure clouds and networks). This paper describes a novel deployment planning algorithm to partition complex workflow-based applications over federated clouds, while meeting security requirements. The security issues are based on our previous work which extends the Bell-LaPadula model to encompass cloud computing. Selecting the cheapest option for partitioning a workflow over a set of resources has been shown to be an NP-hard problem, which can take impractically long for partitioning large workflows over multiple clouds. We therefore introduce a novel adaptive partitioning algorithm to handle these large workflow applications, which significantly reduces the time required to choose a sufficientlygood partitioning option. This is based on generating an initial partitioning, and then adapting it to see if a better solution can be found by bringing together on the same node services with significant communication costs. The algorithm has been implemented and evaluated by using both randomly generated and real world scientific workflows. The experiment results show that our algorithm is thousands times quicker than the exhaustive algorithm presented in our previous work. Yet, on average it generates only 25% more costly solutions. We also compared this algorithm with two other methods commonly used to partition workflows over a set of clouds.

International Trade Modelling Using Open Flow Networks: A Flow-Distance Based Analysis

PloS one, 2015

This paper models and analyzes international trade flows using open flow networks (OFNs) with the... more This paper models and analyzes international trade flows using open flow networks (OFNs) with the approaches of flow distances, which provide a novel perspective and effective tools for the study of international trade. We discuss the establishment of OFNs of international trade from two coupled viewpoints: the viewpoint of trading commodity flow and that of money flow. Based on the novel model with flow distance approaches, meaningful insights are gained. First, by introducing the concepts of trade trophic levels and niches, countries' roles and positions in the global supply chains (or value-added chains) can be evaluated quantitatively. We find that the distributions of trading "trophic levels" have the similar clustering pattern for different types of commodities, and summarize some regularities between money flow and commodity flow viewpoints. Second, we find that active and competitive countries trade a wide spectrum of products, while inactive and underdeveloped...

A Network Event Correlation Algorithm Based on Fault Filtration

Lecture Notes in Computer Science, 2006

This paper proposed a new event correlation technique to enhance the heuristic of the increment h... more This paper proposed a new event correlation technique to enhance the heuristic of the increment hypothesis updating (IHU) algorithm. This approach estimates the likelihood of each fault in the faults set and removes these faults with less likelihood. By this approach we also can determine whether an event is spurious or not. Simulation shows that this approach can get a high accuracy and fast speed of correlation even if the network has a high event loss and spuriousness.

A Novel Approach for Network Event Correlation Based on Set Covering

2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery, 2008

This paper proposes a novel network event correlation approach based on set covering. Firstly, we... more This paper proposes a novel network event correlation approach based on set covering. Firstly, we present a triple-layer belief network FPM by considering alarm loss and spurious faults into the bipartite graph FPM which used by IHU algorithm, then present the measurement of fault hypothesis. On basic of this model, we present a recursive algorithm for creating fault hypotheses. Compared

A solution based on Model-integrated Computing for Embedded OS graphical configuration

2010 International Conference on Computer Application and System Modeling (ICCASM 2010), 2010

Purpose-This research aims to supplement or replace the existing embedded OS with architecture of... more Purpose-This research aims to supplement or replace the existing embedded OS with architecture of semi-network OS, so as to form a co-mobile computing system and to create a new type of networked mobile devices. Method-Co-mobile computing system can only be realized by combining network resources with local resources, then this combination of resources is used to promote intelligent mobile devices to integrate into modern network environment more quickly and comprehensively, and then intelligent mobile devices become real networked one. Result-Under co-mobile computing system, networked mobile devices can not only safely use local resources to maintain the stability and reliability of devices operation, which is mainly attributed to the base portion of semi-network OS (similar to existing embedded OS), but also make full use of network resources to remedy the defect of existing embedded OS, which is mainly attributed to the expanded portion of seminetwork OS. Conclusion-The concept of co-mobile computing mentioned here is defined as a data computing system specially designed for networked mobile devices, which is based on semi-network resources and formed by the merging of multiple networked mobile 190 devices with different embedded OS and functions, now, the semi-network OS architecture will pave a new way for advancement of co-mobile computing system. The semi-network OS refers to that a complete operating system is divided into an expanded portion and a base portion, where the expanded portion of OS is stored on network server, which is ready to be downloaded at any time (similar to a supplement to embedded OS), and the base portion of OS is stored in OSPU located on local platform (similar to embedded OS); wherein the OSPU is a key hardware component in seminetwork OS architecture and is movably installed on different local platforms by users.

Non-deterministic Event Correlation Based on C-F Model

Lecture Notes in Computer Science, 2005

An Event Correlation Approach Based on the Combination of IHU and Codebook

Lecture Notes in Computer Science, 2005

This paper proposes a new event correlation technique, which integrates the increment hypothesis ... more This paper proposes a new event correlation technique, which integrates the increment hypothesis updating (IHU) technique with the codebook approach. The technique allows multiple simultaneous independent faults to be identified when the system's codebook only includes the codes of the single fault and lacks the information of prior fault probability and the conditional probability of fault lead to symptoms occur. The method utilizes the refined IHU technique to create and update fault hypotheses that can explain these events, and ranks these hypotheses by the codebook approach. The result of event correlation is the hypothesis with maximum hamming distance to the code of the received events. Simulation shows that this approach can get a high accuracy and a fast speed of correlation even if the network has event loss and spuriousness.

A Framework for Mining Actionable Navigation Patterns from In-Store RFID Datasets via Indoor Mapping

Sensors (Basel, Switzerland), Jan 5, 2015

With the quick development of RFID technology and the decreasing prices of RFID devices, RFID is ... more With the quick development of RFID technology and the decreasing prices of RFID devices, RFID is becoming widely used in various intelligent services. Especially in the retail application domain, RFID is increasingly adopted to capture the shopping tracks and behavior of in-store customers. To further enhance the potential of this promising application, in this paper, we propose a unified framework for RFID-based path analytics, which uses both in-store shopping paths and RFID-based purchasing data to mine actionable navigation patterns. Four modules of this framework are discussed, which are: (1) mapping from the physical space to the cyber space, (2) data preprocessing, (3) pattern mining and (4) knowledge understanding and utilization. In the data preprocessing module, the critical problem of how to capture the mainstream shopping path sequences while wiping out unnecessary redundant and repeated details is addressed in detail. To solve this problem, two types of redundant patter...

An Interactive Image Segmentation Algorithm Based on Graph Cut

Procedia Engineering, 2012

This paper introduces a new interactive image segmentation algorithm. This algorithm gets better ... more This paper introduces a new interactive image segmentation algorithm. This algorithm gets better result with fewer users interactive when segmenting single-object from images with complex foreground and background. Experiments show that this algorithm effectively solve the common over-segmentation and less-segmentation in graph cut, as well as resolve the problem of small regions error segmented in grab cut algorithm.

Model Interpretation Development: Analysis Design of Automatic Control System

Journal of Software Engineering and Applications, 2009

Currently the development of automatic control system is mainly based on manual design. This has ... more Currently the development of automatic control system is mainly based on manual design. This has made the development process complicated and has made it difficult to guarantee system requirement. This paper presents a Model interpretation development architecture built on meta-models and model interpretation. In this modeling and developing process, different meta-models or domain models may be constructed in terms of various system requirements. Interpreters are used to transform the meta-model into relevant domain model and generate some other formats from domain models, typically with different semantic domains. An interpretation extension interface is introduced, which can be accelerated to develop the model interpreter. This development architecture can improve system reusability and enhance development efficiency. Finally, an example is introduced to explain the advantage of method.

A CORBA Replication Voting Mechanism for Maintaining the Replica Consistent

Journal of Software Engineering and Applications, 2009

Nowadays, more and more applications are being developed through distributed object computing mid... more Nowadays, more and more applications are being developed through distributed object computing middleware, such as CORBA, their requirements for fault-tolerance, especially real time and critical system, become more and more critical. Despite almost ten years have passed since the earliest FT-CORBA standard was promulgated by Object Management Group (OMG), CORBA is still facing many challenges when it is used for distributed applications developing, as the standard is complex and lack of understanding. This paper focus on the consistency of the replicated object and the network partition problem, it incorporates a CORBA Replication Voting Mechanism (CRVM) to meet the challenge which makes a good performance.

Multi-Step Attack Detection Based on Pre-Trained Hidden Markov Models

Sensors

Currently, hidden Markov-based multi-step attack detection models are mainly trained using the un... more Currently, hidden Markov-based multi-step attack detection models are mainly trained using the unsupervised Baum–Welch algorithm. The Baum–Welch algorithm is sensitive to the initial values of model parameters. However, its training uses random or average parameter initialization methods, which frequently results in the model training into a local optimum, thus, making the model unable to fit the alert logs well and thereby reducing the detection effectiveness of the model. To solve this issue, we propose a pre-training method for multi-step attack detection models based on the high semantic similarity of alerts in the same attack phase. The method first clusters the alerts based on their semantic information and pre-classifies the attack phase to which each alert belongs. Then, the distance of the alert vector to each attack stage is converted into the probability of generating alerts in each attack stage, replacing the initial value of Baum–Welch. The effectiveness of the proposed...

Improved Single-Key Attacks on 2-GOST

Security and Communication Networks, 2020

GOST, known as GOST-28147-89, was standardized as the Russian encryption standard in 1989. It is ... more GOST, known as GOST-28147-89, was standardized as the Russian encryption standard in 1989. It is a lightweight-friendly cipher and suitable for the resource-constrained environments. However, due to the simplicity of GOST’s key schedule, it encountered reflection attack and fixed point attack. In order to resist such attacks, the designers of GOST proposed a modification of GOST, namely, 2-GOST. This new version changes the order of subkeys in the key schedule and uses concrete S-boxes in round function. But regarding single-key attacks on full-round 2-GOST, Ashur et al. proposed a reflection attack with data of 2 32 on a weak-key class of size 2 224 , as well as the fixed point attack and impossible reflection attack with data of 2 64 for all possible keys. Note that the attacks applicable for all possible keys need the entire plaintext space. In other words, these are codebook attacks. In this paper, we propose single-key attacks on 2-GOST with only about 2 32 data instead of code...

An Identity-Based Cross-Domain Authenticated Asymmetric Group Key Agreement

Information, 2021

Cross-domain authenticated asymmetric group key agreement allows group members in different domai... more Cross-domain authenticated asymmetric group key agreement allows group members in different domains to establish a secure group communication channel and the senders can be anyone. However, the existing schemes do not meet the requirement of batch verification in the group key negotiation phase, which makes the schemes have low efficiency. To address this problem, an identity-based cross-domain authenticated asymmetric group key agreement is proposed that supports batch verification. The performance analysis shows that this protocol is highly efficient. Finally, the proposed protocol is proved to be secure under the k-Bilinear Diffie–Hellman Exponent assumption.

DHS-Voting: A Distributed Homomorphic Signcryption E-Voting

Communications in Computer and Information Science, 2019

In electronic voting, voters encrypt their ballots and post them on a bulletin board, where the r... more In electronic voting, voters encrypt their ballots and post them on a bulletin board, where the results are tallied by authorities. The right to tally is fully controlled by authorities, who generates a certificate to prove the results are correct, but their attempts to tamper with the bulletin board and falsify the certificate are inevitable. Therefore, we propose an electronic voting scheme based on distributed encryption and homomorphic signcryption, DHS-Voting, which can not only enable the verification of signatures to be completed quickly, but also allows anyone to get the result of the election with the help of the authorities, making the election results more credible. In addition, we prove that DHS-Voting satisfies the ballot privacy and some necessary properties of electronic voting, which we will prove in detail in the paper.

Identification of Private ICS Protocols Based on Raw Traffic

Symmetry, 2021

With the development of the Industrial Internet in recent years, security issues have been a hot ... more With the development of the Industrial Internet in recent years, security issues have been a hot topic of the industrial control system (ICS) network management. Identifying the protocol traffic in the communication process of the ICS is an important prerequisite to avoid security problems, especially in ICSs that use many private protocols. The private protocols cannot be analyzed due to the unknown internal structure of the protocols, which makes the ICS protocol identification work more difficult. However, the Internet-oriented protocol identification method is not applicable to the scenario of the private ICS protocols network environment. With this problem in mind, this paper proposes a method of ICS protocol identification based on the raw traffic payload. The method firstly performs data preprocessing such as data selection, interception, cleaning conversion, and labeling on the raw traffic of the protocol based on the characteristics of the industrial control protocol. Then ...

DSM: Delayed Signature Matching in Deep Packet Inspection

Symmetry, 2020

Deep Packet Inspection (DPI) is widely used in network management and network security systems. T... more Deep Packet Inspection (DPI) is widely used in network management and network security systems. The core part of existing DPI is signature matching, and many researchers focus on improving the signature-matching algorithms. In this paper, we work from a different angle: The scheduling of signature matching. We propose a Delayed Signature Matching (DSM) method, in which we do not always immediately match received packets to the signatures since there may be not enough packets received yet. Instead, we predefine some rules, and evaluate the packets against these rules first to decide when to start signature matching and which signatures to match. The predefined rules are convenient to create and maintain since they support custom expressions and statements and can be created in a text rule file. The correctness and performance of the DSM method are theoretically analyzed as well. Finally, we implement a prototype of the DSM method in the open-source DPI library nDPI, and find that it ...