CN108599991A - The key node searching method of Trust transitivity is influenced in social Internet of Things - Google Patents
The key node searching method of Trust transitivity is influenced in social Internet of Things Download PDFInfo
- Publication number
- CN108599991A CN108599991A CN201810235534.0A CN201810235534A CN108599991A CN 108599991 A CN108599991 A CN 108599991A CN 201810235534 A CN201810235534 A CN 201810235534A CN 108599991 A CN108599991 A CN 108599991A
- Authority
- CN
- China
- Prior art keywords
- node
- user
- key
- nodes
- user node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Abstract
The invention discloses the key node searching methods that Trust transitivity is influenced in a kind of social Internet of Things, can find all key nodes in asymmetric, weighting, the SIoT networks not being fully connected, be conducive to ensure SIoT normal works；At the same time it can also improve SIoT nodes degrees of communication.
Description
Technical field
The present invention relates to the crucial sections that Trust transitivity is influenced in internet of things field more particularly to a kind of social Internet of Things
Point searching method.
Background technology
Internet of Things (IoT) is developing into an attractive next generation network pattern and service infrastructure.Object
The target of networking be by anyone and anything (such as computer, camera, wrist-watch, washing machine, bicycle, automobile, the mankind, plant,
Animal) it connects, and by providing service whenever and wherever possible in conjunction with network.IoT covers many technologies, including framework, biography
Sensor, coding, transmission, data processing, network, discovery, trust etc..It provides solution appropriate to be widely applied,
As traffic safety, waste management, safety, resource management, logistics, retail industry, Industry Control, health care and tracking are stolen wealth
Production etc..Compared with wireless sensor network (WSN), the sensitive zones of Internet of Things are more extensive, are more focused on the daily life of people
Living and working environment.Since things is substantially by human manipulation and work, so the concept of community network is integrated into object
In networking solution, it forms a kind of novel network, i.e., social Internet of Things (SIoT).
In community network, people may frequently encounter other and not recognize completely or the not no use of interaction experiences before
Family.These users will be enlarged by the trusting relationship for having the contemporary of same interest and preference in same field with them.In this way, user
Between be formed one with isomery trust large-scale users to trust network (UTN).It is also referred to as isomery trust network
(HTN).In HTN, the interaction of people is built upon on the basis of trust, so the prediction that is delivered in trusted does not join directly
It plays an important role when trust between the user of system.If trust can not be transmitted, will be always maintained between stranger
Strange state.Therefore, new interaction cannot be formed between them.This will lead to the low connectivity of network, and task and service are not
It can be by appropriate processing.Therefore, Trust transitivity appropriate is very important for SIoT.
The node that trust can be transmitted is known as intermediate node, and the collection of intermediate node is collectively referred to as path.However, only in part
Intermediate node is key node, these key nodes can significantly affect the transitivity of trust.When the node in SIoT is based on trusting
Transitive relation when establishing network, if we remove the key node of network, the performance of network will be affected.In other words
It says, because transmission path is destroyed, some nodes possibly can not access service.Therefore, it is necessary to retrieve in entire SIoT
Key node, to ensure SIoT work normally.
Invention content
The object of the present invention is to provide the key node searching methods that Trust transitivity is influenced in a kind of social Internet of Things.
The purpose of the present invention is what is be achieved through the following technical solutions：
It is a kind of society Internet of Things in influence Trust transitivity key node searching method, including：
Social Internet of Things is a weighting and oriented network, and social Internet of Things are indicated using the figure G with vertex V and side E
Net, vertex therein are user node, and user node is divided into commission node, be commissioned node and intermediate node；Definition, which is trusted, to be passed
Path TP is passed, to indicate the set for entrusting node to the intermediate node between node of being commissioned；Key node is to influence Trust transitivity
The intermediate node of path performance；
If residing context is identical between user node, and the confidence value between user node and user node is big
In threshold value, then confidence level transmission can be carried out between relative users node, that is, there is access, then carried out by following manner crucial
Node searching：
Initialize the nearest key node of each user node；
All user nodes and side are initialized as not searching for；
When executing key node search, Trust transitivity path TP is updated by active user's node v；User node v and its
Neighbor user node j shares identical context and confidence value between the two is more than threshold value, if user node v is adjacent with it
The side occupied between user node j is not searched, then it is to have searched to record the side between user node v and its neighbor user node j
Rope；Meanwhile neighbor user node j is scanned for if it is first time, then user node v is the nearest of neighbor user node j
Key node；If not once being scanned for neighbor user node j, then user node v be not neighbor user node j most
Nearly key node updates the nearest key node of user node j again；It repeats the above process, until not nearest key node
Or the nearest key node found belongs to TP；
Search is iterated according to above-mentioned identical mode for other users node；
The nearest key node of each user node obtained in above-mentioned iterative process will be recorded, and pass through
The mode of the nearest key node of iterative search finds all key nodes in network.
It as seen from the above technical solution provided by the invention, can be in asymmetric, weighting, be fully connected
All key nodes are found in SIoT networks, are conducive to ensure SIoT normal works；It is saved at the same time it can also improve in SIoT networks
Point-connectivity.
Description of the drawings
In order to illustrate the technical solution of the embodiments of the present invention more clearly, required use in being described below to embodiment
Attached drawing be briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for this
For the those of ordinary skill in field, without creative efforts, other are can also be obtained according to these attached drawings
Attached drawing.
Fig. 1 is the key node searching method that Trust transitivity is influenced in a kind of social Internet of Things provided in an embodiment of the present invention
Flow chart.
Specific implementation mode
With reference to the attached drawing in the embodiment of the present invention, technical solution in the embodiment of the present invention carries out clear, complete
Ground describes, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.Based on this
The embodiment of invention, every other implementation obtained by those of ordinary skill in the art without making creative efforts
Example, belongs to protection scope of the present invention.
Since things is substantially by human manipulation and work, so the concept of community network is integrated into Internet of Things solution
Certainly in scheme.In Internet of Things, trustee generates and delegates duties, and trustee receives task and provides clothes to successfully complete task
Business.But how to find suitable trustee is critical issue when trustee delegates duties.In general, it can use to trust and make
Suitable trustee is selected for module.In SIoT, trust be one in certain context based on to confidence level
Actively it is expected, risk task is entrusted to the process for the trustee for being equipped with suitable equipment by trustee.Trustee puts into practice simultaneously
Trustee is evaluated.Finally, evaluation result will influence the attitude of both sides in turn.It includes many factors that trust, which is one,
Dynamic process, however fixed certain two people of expression of confidence level are directed to some task to mutual trusted degree, therefore trust
It is not equal to confidence level.
When whether trustee is based on trusting go one trustee of assessment credible, do not handed between trustee and the trustee
The possibility of mutual experience is very big.Therefore, it is necessary to intermediate nodes to transmit trust.Intermediate node determines whether trust can be passed
It passs.It is meant that if commission nodes X request service, the node Y that is commissioned provides service for the transitivity trusted in SIoT, and X with
Without direct social bond between Y, then confidence level needs to transmit by intermediate node I.We discuss Trust transitivity below
A kind of classical case：If X trusts I, I trusts Y, then X can trust Y
Trust is transmitted by intermediate node, therefore the Trust transitivity in intermediate node between any two constitutes final committee
The confidence level asked someone between trustee.The Trust transitivity between arbitrary two adjacent node can be measured using confidence level.It is non-
The confidence value TW of task i is directed between adjacent node X and Yi XYBy the confidence level of each pair of adjacent intermediate node in its transmission path
Value is folded to be multiplied：
Indicate the intermediate node sequence in the selected path between X and Y in SIoT.Specifically, confidence value
TWiXY is by trustee Y, trustee Y, intermediate nodeSpecific tasks i and contextInfluence：
In order to establish the defence mental model of trust, used in the embodiment of the present invention general purpose function g as with context
Relevant function.ContextBe in trusting one it is extremely important but through commonly overlooked element.Trustee X must be assessed up and down
TextIt is advantageous to trustee Y or task i, less favorably, or it is harmful.Because context is an external influence factors, it
It can greatly influence the behavior of Y and final result.In SIoT, context<CX,CY,CI＞ includes the upper of commission nodes X
Hereafter CX, the context of the node Y that is commissioned, intermediate node I context CI；If entrusting nodes X, be commissioned node Y and intermediate node
Context residing for I is identical, and the confidence value between adjacent node is more than threshold value, then can carry out confidence level transmission, no
Then transmitting will be blocked：
Wherein, TWi XY、TWi XI、TWi IYThe corresponding expression commission nodes X and node Y that is commissioned, commission nodes X and intermediate node
I, the intermediate node I and node Y that is commissioned is directed to the confidence value of task i；ω1And ω2For pre-set two believability thresholds.
Pay attention to：Formula (1) has ignored a part for confidence level：(1-TWiAB)*(1-TWiBC), it is contained in formula (3)
In.It indicate commission nodes X to intermediate node I can not reliability be multiplied by false judgments of the intermediate node I to the node Y that is commissioned.
In general, social Internet of Things can be indicated using the figure G with vertex V and side E, and vertex therein is to use
Family node, user node (hereinafter node) are divided into commission node, be commissioned node and intermediate node；G is schemed by adjacency matrix An×n
Description, its element axyIndicate the intensity between vertex x and vertex y.Element on leading diagonal does not define, and is arranged to
Zero.If two nodes are connected by a line, they in scheming G are adjacent.If network be connection and it is right
(a claimedxy=ayx), key node can be found by cut point algorithm.However, it is asymmetric to trust, i.e., in their friendship
During mutually, there is directionality and otherness between node.For example, being 0.9 to the confidence value of Bob from Alice；On the contrary,
Bob may be 0.5 to the confidence value of Alice.Therefore, the Trust transitivity network of social Internet of Things is a weighting, orientation net
Network.In addition, connection can change according to different ISPs, since these servers have different contexts.In order to
Key node is found out, the embodiment of the present invention, which defines, transmits trust path TPn XY, it is illustrated between trustee X to trustee Y
Intermediate node set, X can assess and obtain the service provided by Y；Because there is a plurality of transmission path, n, which is represented, transmits road
The serial number of diameter, including the transmission path set of all transmission paths is denoted as TPSXY.Based on the process for trusting transition, trust transmitting
Some constraintss are applied in network.If a, l ∈ TPn XY, and(this means that l is trusty as one a
Intermediate node), thenWith regard to nonsensical, because l trusts a and does not represent a trusts l.In other words, Trust transitivity path
Closed circulation be nonsensical.
As previously mentioned, if context residing between user node and user node in figure G is identical, and user node with
Confidence value between user node is more than threshold value, then confidence level transmission can be carried out between relative users node, that is, exists logical
Road；Crucial point search can be carried out by following methods later, its pseudocode of crucial point search is as follows：
The first step is initiation parameter：Nearest_key_node (*) (the 2nd row).Nearest_key_node (*) is recorded
The nearest key node of each node in Trust transitivity network is kept away by search record purge before before formally starting search
Exempt to influence this search result.All key nodes of some node can be found by the nearest key node of iterative search.It is adjacent
It connects matrix and has recorded node relationships (the 4th row) in Trust transitivity network.
TP has recorded current transmission path, i.e., all between ISP (trustee) and requestor (trustee)
Intermediate node.TP is initialized as empty (the 5th row).Before attempting to find key node, node and side are initialized as not searching for
(6-7 rows).It is since trustee can be serviced by oneself, the nearest_key_node of trustee is (crucial recently
Node) it is set as empty (eighth row).
When executing key node searching algorithm (KNS, the 9th row), TP is updated by active user's node v (the 15th row).With
The node v neighbor user nodes to be searched in family had an interactive node (being present in TP) before should not being, but should be with
User node v shares same context and confidence value between the two is more than the node of threshold value, trusts to transmit.It should note
Meaning, some nodes may have multiple roles, and belong to multiple contexts.Assuming that user node j saves for active user
The neighbor node of point v, the side between user node v and user node j should not be searched (16-17 rows).If user saves
It is not searched before side between point v and user node j, then it is to record the side between user node v and user node j
Search.If being scanned for for the first time to user node j, then the nearest key node of user node j is user node v, because
Not to be searched before user node v to the side of user node j, and it is to search for user node j for the first time, so with current
The path of update out, the path that can reach user node j can only be by user node v.If not search user saves for the first time
Point j had search to user node j before just representing and was not by user node v, it is meant that also has other paths that can arrive
Up to user node j, then user node v is not the nearest key node of user node j.And the road of user node j can be reached now
Diameter is added to a path by user node v, then what the nearest key node of user node j may be newly added
Path effects, so needing the nearest key node (the 22nd row) of user node j of update.For the sake of simplicity, it does not show
The pseudocode of upd_nearest_k_node.The function principle：If the nearest key node k of user node j is not belonging to TP,
Mean that original key node k recently is no longer key node, then the nearest key node of user node j is altered to the nearest of k
Key node, and recursive call upd_nearest_k_node；This process is repeated, until not nearest key node or discovery
Nearest key node belongs to TP.
Then, it is iterated search (the 24th row), updates TP correctly to record current transmission path (the 27th row).Most
Afterwards, all key nodes (the 11st row) of each node are shown.
Meanwhile in iterative search procedures, the nearest key node of each user node will be recorded, by repeatedly
Generation, which searches nearest key node, can find all key nodes in network.Illustratively, the nearest key node of a is b, b
Nearest key node be c, c is without nearest key node.Then a key nodes are b, c.
It will be understood by those skilled in the art that 14~28 rows of above-mentioned pseudocode are the expansion to the 9th row.It is opened from the 1st row
Begin to execute, jump to the 14th row when to 9 row and start to execute, executes 14~28 rows (period meeting recursive call oneself), after
The 10th row of rebound continues to 13 rows, entire program finishes execution.KNS () is a function, and the 9th row is to this function
It calls, the 14th~28 row is the definition to this function.
Said program of the embodiment of the present invention can find institute in asymmetric, weighting, the SIoT networks not being fully connected
There is key node, is conducive to ensure SIoT normal works；At the same time it can also improve SIoT nodes degrees of communication.
Through the above description of the embodiments, those skilled in the art can be understood that above-described embodiment can
By software realization, the mode of necessary general hardware platform can also be added to realize by software.Based on this understanding,
The technical solution of above-described embodiment can be expressed in the form of software products, the software product can be stored in one it is non-easily
In the property lost storage medium (can be CD-ROM, USB flash disk, mobile hard disk etc.), including some instructions are with so that a computer is set
Standby (can be personal computer, server or the network equipment etc.) executes the method described in each embodiment of the present invention.
The foregoing is only a preferred embodiment of the present invention, but scope of protection of the present invention is not limited thereto,
Any one skilled in the art is in the technical scope of present disclosure, the change or replacement that can be readily occurred in,
It should be covered by the protection scope of the present invention.Therefore, protection scope of the present invention should be with the protection model of claims
Subject to enclosing.
Claims (2)
1. influencing the key node searching method of Trust transitivity in a kind of society's Internet of Things, which is characterized in that including：
Social Internet of Things is a weighting and oriented network, and social Internet of Things is indicated using the figure G with vertex V and side E,
In vertex be user node, user node is divided into commission node, be commissioned node and intermediate node；Define Trust transitivity path
TP, to indicate the set for entrusting node to the intermediate node between node of being commissioned；Key node is to influence Trust transitivity path property
The intermediate node of energy；
If residing context is identical between user node, and the confidence value between user node and user node is more than threshold
Value, then can carry out confidence level transmission, that is, there is access, then carry out key node by following manner between relative users node
Search：
Initialize the nearest key node of each user node；
All user nodes and side are initialized as not searching for；
When executing key node search, Trust transitivity path TP is updated by active user's node v；User node v and its neighbour
User node j shares identical context and confidence value between the two is more than threshold value, if user node v is used with its neighbour
Side between the node j of family is not searched, then it is to have searched for record the side between user node v and its neighbor user node j；Together
When, neighbor user node j is scanned for if it is first time, then the nearest crucial section that user node v is neighbor user node j
Point；If not once being scanned for neighbor user node j, then user node v is not the nearest key of neighbor user node j
Node updates the nearest key node of user node j again；It repeats the above process, until not nearest key node or discovery
Nearest key node belong to TP；
Search is iterated according to above-mentioned identical mode for other users node；
The nearest key node of each user node obtained in above-mentioned iterative process will be recorded, and pass through iteration
The mode of nearest key node is searched to find all key nodes in network.
2. the key node searching method of Trust transitivity is influenced in a kind of social Internet of Things according to claim 1, it is special
Sign is,
Commission nodes X and the node Y that is commissioned are two non-adjacent user nodes, for the task i of commission nodes X publication, if
Commission nodes X, be commissioned node Y and the two intermediate node I residing for context it is identical, and the confidence level between adjacent node
Value is more than threshold value, then can carry out confidence level transmission, and otherwise transmitting will be blocked：
Wherein, TWi XY、TWi XI、TWi IYThe corresponding expression commission nodes X and node Y that is commissioned, commission nodes X and intermediate node I, in
The intermediate node I and node Y that is commissioned is directed to the confidence value of task i；ω1And ω2For pre-set two believability thresholds；Up and down
Text<CX,CY,CI＞ C thereinX、CY、CIBe corresponding in turn to commission nodes X, be commissioned node Y, intermediate node I context.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810235534.0A CN108599991B (en) | 2018-03-21 | 2018-03-21 | Method for searching key nodes influencing trust transfer in social Internet of things |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810235534.0A CN108599991B (en) | 2018-03-21 | 2018-03-21 | Method for searching key nodes influencing trust transfer in social Internet of things |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108599991A true CN108599991A (en) | 2018-09-28 |
| CN108599991B CN108599991B (en) | 2020-12-29 |
Family
ID=63627127
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810235534.0A Active CN108599991B (en) | 2018-03-21 | 2018-03-21 | Method for searching key nodes influencing trust transfer in social Internet of things |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108599991B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080201447A1 (en) * | 2007-02-15 | 2008-08-21 | Young Wook Kim | Online social networking method based on third party's evaluation and system therefor |
| CN103150399A (en) * | 2013-03-26 | 2013-06-12 | 常州德诗蓝电子科技有限公司 | Information recommending method based on trust in social network |
| CN103995823A (en) * | 2014-03-25 | 2014-08-20 | 南京邮电大学 | Information recommending method based on social network |
| CN104008163A (en) * | 2014-05-29 | 2014-08-27 | 上海师范大学 | Trust based social network maximum influence node calculation method |
| CN104268171A (en) * | 2014-09-11 | 2015-01-07 | 东北大学 | Activity similarity and social trust based social networking website friend recommendation system and method |
| CN104765825A (en) * | 2015-04-10 | 2015-07-08 | 清华大学 | Method and device for predicting social network links based on cooperative fusion theory |
| CN104838411A (en) * | 2015-02-11 | 2015-08-12 | 深圳市仁盟互动网络科技有限公司 | Method and system for establishing friendship based on trust recommendation social networking services |
| CN107330461A (en) * | 2017-06-27 | 2017-11-07 | 安徽师范大学 | Collaborative filtering recommending method based on emotion with trust |
-
2018
- 2018-03-21 CN CN201810235534.0A patent/CN108599991B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20080201447A1 (en) * | 2007-02-15 | 2008-08-21 | Young Wook Kim | Online social networking method based on third party's evaluation and system therefor |
| CN103150399A (en) * | 2013-03-26 | 2013-06-12 | 常州德诗蓝电子科技有限公司 | Information recommending method based on trust in social network |
| CN103995823A (en) * | 2014-03-25 | 2014-08-20 | 南京邮电大学 | Information recommending method based on social network |
| CN104008163A (en) * | 2014-05-29 | 2014-08-27 | 上海师范大学 | Trust based social network maximum influence node calculation method |
| CN104268171A (en) * | 2014-09-11 | 2015-01-07 | 东北大学 | Activity similarity and social trust based social networking website friend recommendation system and method |
| CN104838411A (en) * | 2015-02-11 | 2015-08-12 | 深圳市仁盟互动网络科技有限公司 | Method and system for establishing friendship based on trust recommendation social networking services |
| CN104765825A (en) * | 2015-04-10 | 2015-07-08 | 清华大学 | Method and device for predicting social network links based on cooperative fusion theory |
| CN107330461A (en) * | 2017-06-27 | 2017-11-07 | 安徽师范大学 | Collaborative filtering recommending method based on emotion with trust |
Non-Patent Citations (3)
| Title |
|---|
| ZHITING LIN等: ""Clarifying Trust in Social Internet of Things"", 《IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING》 * |
| 张群: ""基于双连通性的在线社交网络关键用户发现"", 《中国优秀硕士学位论文全文数据库》 * |
| 蒋昌礼: ""微博网络关键节点和关键链路识别方法研究与软件研制"", 《中国优秀硕士学位论文全文数据库》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108599991B (en) | 2020-12-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Rathore et al. | BlockSecIoTNet: Blockchain-based decentralized security architecture for IoT network | |
| Wang et al. | The evolution of the Internet of Things (IoT) over the past 20 years | |
| Kong et al. | k-core: Theories and applications | |
| CN105991521B (en) | Network risk assessment method and device | |
| Borge-Holthoefer et al. | Absence of influential spreaders in rumor dynamics | |
| CN110677433B (en) | Method, system, equipment and readable storage medium for predicting network attack | |
| Chen et al. | FCM technique for efficient intrusion detection system for wireless networks in cloud environment | |
| CN107733877B (en) | Management method and system for wireless communication architecture of Internet of things | |
| Kaur et al. | Edge computing: Classification, applications, and challenges | |
| Savenko et al. | Botnet detection technique for corporate area network | |
| Jaouadi et al. | Influence maximization problem in social networks: An overview | |
| Bhale et al. | Energy efficient approach to detect sinkhole attack using roving IDS in 6LoWPAN network | |
| Ayaz et al. | Energy Efficient Intrusion Detection in a heterogeneous environment of Wireless sensor networks | |
| Feng et al. | Predicting the intrusion intentions by observing system call sequences | |
| Hsieh et al. | Applying an ontology to a patrol intrusion detection system for wireless sensor networks | |
| Wang et al. | Exploiting social circle broadness for influential spreaders identification in social networks | |
| Poongothai et al. | A noncooperative game approach for intrusion detection in mobile adhoc networks | |
| Khamayseh et al. | Dynamic framework to mining internet of things for multimedia services | |
| Król | On modelling social propagation phenomenon | |
| CN108599991A (en) | The key node searching method of Trust transitivity is influenced in social Internet of Things | |
| Perez et al. | A dynamic approach to detecting suspicious profiles on social platforms | |
| Chen et al. | Dynamic threshold strategy optimization for security protection in Internet of Things: An adversarial deep learning‐based game‐theoretical approach | |
| Yang et al. | Research on detection and prevention of mobile device botnet in cloud service systems | |
| Shalaginov et al. | Modern cybercrime investigation: technological advancement of smart devices and legal aspects of corresponding digital transformation | |
| Tseng et al. | Building a self-organizing phishing model based upon dynamic EMCUD |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |