CN108446547A - A kind of method of computer booting - Google Patents

A kind of method of computer booting Download PDF

Info

Publication number
CN108446547A
CN108446547A CN201810211221.1A CN201810211221A CN108446547A CN 108446547 A CN108446547 A CN 108446547A CN 201810211221 A CN201810211221 A CN 201810211221A CN 108446547 A CN108446547 A CN 108446547A
Authority
CN
China
Prior art keywords
module
node
value
cluster head
central control
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.)
Pending
Application number
CN201810211221.1A
Other languages
Chinese (zh)
Inventor
王仕勋
孟金红
周春花
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huanggang Polytechnic College
Original Assignee
Huanggang Polytechnic College
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huanggang Polytechnic College filed Critical Huanggang Polytechnic College
Priority to CN201810211221.1A priority Critical patent/CN108446547A/en
Publication of CN108446547A publication Critical patent/CN108446547A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/30Authentication, i.e. establishing the identity or authorisation of security principals
    • G06F21/31User authentication
    • G06F21/32User authentication using biometric data, e.g. fingerprints, iris scans or voiceprints
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/22Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing
    • G06F11/2273Test methods
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/22Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing
    • G06F11/2284Detection or location of defective computer hardware by testing during standby operation or during idle time, e.g. start-up testing by power-on test, e.g. power-on self test [POST]

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Quality & Reliability (AREA)
  • Computer Security & Cryptography (AREA)
  • Software Systems (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The invention belongs to computer booting technical fields, disclose a kind of method of computer booting, and the system of the computer booting includes:Power management module, iris capturing module, sound acquisition module, central control module, data memory module, fault detection module, malfunction coefficient module, starting module.The present invention is switched on by iris scan module, sound acquisition module various ways, improves the convenience of booting, simple, practical;Booting failure cause can be detected in start process by fault detection module simultaneously, and lamp carries out display different faults problem in different colors by malfunction coefficient module, fast and easy finds out failure cause.

Description

A kind of method of computer booting
Technical field
The invention belongs to computer booting technical field more particularly to a kind of methods of computer booting.
Background technology
Computer (computer) is commonly called as computer, is a kind of modern electronic computer device for supercomputing, Ke Yijin Row numerical computations, and logical calculated can be carried out, also have the function of store-memory.It is that can be run according to program, automatic, high speed Handle the modernization intelligent electronic device of mass data.It is made of hardware system and software systems, is fitted without any software Computer be known as bare machine.Supercomputer, industrial control computer, network computer, personal computer, embedded can be divided into Five class of computer, more advanced computer have biocomputer, photonic computer, quantum computer etc..However, existing calculating For machine start-up mode by being booted up manually by power button, mode is single, troublesome in poeration;If the failure that is switched on simultaneously cannot be shown Failure cause causes maintenance difficulty to greatly increase.
In conclusion problem of the existing technology is:Existing computer booting mode by manually press power button into Row booting, mode is single, troublesome in poeration;If the failure that is switched on simultaneously cannot show failure cause, maintenance difficulty is caused to increase Add.
Invention content
In view of the problems of the existing technology, the present invention provides a kind of methods of computer booting.
The invention is realized in this way a kind of system of computer booting includes:
Power management module is connect with central control module, for being managed operation to power supply, and is powered;
Iris capturing module, connect with central control module, and the iris information for acquiring user is simultaneously saved in data and deposits Store up module;
Sound acquisition module is connect with central control module, and the acoustic information for acquiring user is simultaneously saved in data and deposits Store up module;
The sound acquisition module sound collection signal operation during cluster head variation the specific steps are:
The first step, middleware execute cluster head selection analysis algorithm, and getting around may cause the region in " cavity " to use barrier as possible Hinder the predicted method of object;To make data packet get around the node in empty boundary in advance, the probability that cavity occurs is reduced, improves communication Packet arrival rate finally carries out both candidate nodes optimization with simulated annealing;
Second step, if no adjacent node can bypass, it is necessary to which node of the selection in the region for leading to cavity then makes The node in the region only takes on a cluster head as possible;
Third walks, after cluster algorithm has executed, if no adjacent node can bypass, it is necessary to which selection, which is in, leads to sky The node in the region in hole, then make the node in the region only take on a cluster head as possible, and middleware executes LEACH in simulating WSN Algorithm, the cluster head simulated are labeled as candidate cluster head, the NLOS nodes that will be analyzed, and energy is more than the candidate cluster head of threshold value It is designated as cluster head, to evade hot-zone and NLOS, the whole network broadcast is carried out by base station and appoints cluster head;
4th step, when leader cluster node detects that self rest energy reaches energy threshold and then sends message MSG_ to base station CLUSTER_EMPTY, base station computer executes algorithm and reanalyses closed area model and energy selection algorithm, and selects replacement Cluster head;
5th step, base station send the cluster head of ID to be downgraded to ordinary node to the whole network broadcast release is primary, and appoints new choosing The pre-selection cluster head gone out;
6th step, if cluster head, due to physical cause die by visitation of God, base station does not receive the cluster in a communication cycle The data packet that head comes, then send MSG_ISALIVE information and give the cluster head, if not receiving cluster head hair in a given time period The MSG_ALIVE information and ID come, then analyze and appointed in the model area in the partial closure space of the sub-clustering and newly selected Cluster head;
7th step, when in the WSN networks interior addition new node or already present node leave, node motion, only need to send out Send MSG_JOIN or MSG_LEAVE, MSG_MOVE message and ID to base station computer, base station computer is rebuild automatically The model in the partial closure space of the node, and judge whether according to actual conditions the cluster head of the gravity treatment part;
Central control module, with power management module, iris capturing module, sound acquisition module, data memory module, event Hinder detection module, malfunction coefficient module, starting module connection, for dispatching modules normal work;
The specific calculating step of the direct trust value of the central control module is:
Acquire the interaction times of n timeslice between network observations node i and node j:
Intervals t is chosen as an observation time piece, with observer nodes i and tested node j in 1 timeslice Interior interaction times are denoted as y as observation index, true interaction timest, the y of n timeslice is recorded successivelyn, and preserved In the communications records table of node i;
Predict the interaction times of (n+1)th timeslice:
According to the interaction times settling time sequence of collected n timeslice, predicted down using third index flatness Interaction times between one timeslice n+1 interior nodes i and j are predicted interaction times, are denoted asCalculation formula is as follows:
Predictive coefficient an、bn、cnValue can be calculated by following formula:
Wherein:It is primary, secondary, Three-exponential Smoothing number respectively, is calculated by following formula It arrives:
It is the initial value of third index flatness, value is
α is smoothing factor (0 < α < 1), embodies the time attenuation characteristic of trust, i.e., timeslice closer from predicted value ytWeight is bigger, the y of the timeslice remoter from predicted valuetWeight is smaller;Usually, if data fluctuations are larger, and long-term trend Amplitude of variation is larger, and α when obviously rapidly rising or falling trend, which is presented, should take higher value (0.6~0.8), can increase in the recent period Influence of the data to prediction result;When data have a fluctuation, but long-term trend variation is little, α can between 0.1~0.4 value; If data fluctuations are steady, α should take smaller value (0.05~0.20);
Calculate direct trust value:
The direct trust value TD of node jijTo predict interaction timesWith true interaction times yn+1Relative error,
In step 2, the specific meter of indirect trust values is calculated using calculating formula obtained from multipath trust recommendation mode Calculating step is:
Collect direct trust value of the trusted node to node j:
Node i meets TD to allikThe credible associated nodes of≤φ inquire its direct trust value to node j, wherein φ For the believability threshold of recommended node, according to the precision prescribed of confidence level, the value range of φ is 0~0.4;
Calculate indirect trust values:
Trust value collected by COMPREHENSIVE CALCULATING obtains the indirect trust values TR of node jij, Wherein, had with j nodes in the associated nodes that Set (i) is observer nodes i and interacted and its direct trust value meets TDik≤ φ's Node set;
In step 3, show that the specific calculating of comprehensive trust value walks by direct trust value and indirect trust values conformity calculation Suddenly it is:
Comprehensive trust value (Tij) calculation formula it is as follows:Tij=β TDij+(1-β)TRij, wherein β (0≤β≤1) expressions are directly The weight for connecing trust value, as β=0, node i and node j do not have a direct interaction relationship, the calculating of comprehensive trust value directly from In indirect trust values, it is more objective to judge;As β=1, node i is to the synthesis trust value of node j all from directly trust Value judges more subjectivity in this case, practical to calculate the value that determine β as needed;
Data memory module is connect with central control module, for storing client iris and acoustic information;
Fault detection module is connect with central control module, for being detected to boot-strap circuit, boot program;
Malfunction coefficient module, connect with central control module, for the lamp display circuit failure by different colours, power supply The information such as failure, program mal;
Starting module is connect with central control module, for passing through iris or sound in user's matched data memory module Carry out startup booting.
A kind of method of computer booting includes the following steps:
Step 1 proceeds by power supply by power management module;User passes through iris capturing module, sound acquisition module The iris of user will be acquired, acoustic information is sent to central control module;
Step 2, central control module start starting module and are opened by iris in matched data memory module or sound Dynamic booting;
Step 3 is detected boot-strap circuit, boot program by fault detection module in start process;
Step 4, after detection, lamp display circuit failure, power failure, journey that different colours are passed through by malfunction coefficient module The information such as sequence failure.
Further, the starting module includes:Signal receiving module, startup self-detection module, program load-on module;
Signal receiving module, for receiving starting-up signal such as iris or sound;
Startup self-detection module, whether input-output system is wrong when for detecting booting, without staggering the time, starts boot program; It staggers the time, then cannot be started up;
Program load-on module is staggered the time for startup self-detection module detection nothing, loading system program.
Advantages of the present invention and good effect are:The present invention passes through iris scan module, sound acquisition module various ways Booting, improves the convenience of booting, simple, practical;Booting can be detected in start process by fault detection module simultaneously Failure cause, and lamp carries out display different faults problem in different colors by malfunction coefficient module, fast and easy finds out failure Reason.
Description of the drawings
Fig. 1 is the method flow diagram that the present invention implements the computer booting provided.
Fig. 2 is the system structure diagram that the present invention implements the computer booting provided.
In Fig. 2:1, power management module;2, iris capturing module;3, sound acquisition module;4, central control module;5、 Data memory module;6, fault detection module;7, malfunction coefficient module;8, starting module.
Specific implementation mode
In order to make the purpose , technical scheme and advantage of the present invention be clearer, with reference to embodiments, to the present invention It is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, it is not used to Limit the present invention.
Below in conjunction with the accompanying drawings and specific embodiment is further described the application principle of the present invention.
As shown in Figure 1, a kind of method of computer booting provided by the invention includes the following steps:
Step S101 proceeds by power supply by power management module;User passes through iris capturing module, sound collection mould Block will acquire the iris of user, acoustic information is sent to central control module;
Step S102, central control module starts starting module to be carried out by iris in matched data memory module or sound Start booting;
Step S103 is detected boot-strap circuit, boot program by fault detection module in start process;
Step S104, after detection, by malfunction coefficient module by the lamp display circuit failure of different colours, power failure, The information such as program mal.
As shown in Fig. 2, computer booting system provided by the invention includes:Power management module 1, iris capturing module 2, Sound acquisition module 3, central control module 4, data memory module 5, fault detection module 6, malfunction coefficient module 7, booting mould Block 8.
Power management module 1 is connect with central control module 4, for being managed operation to power supply, and is powered;
Iris capturing module 2 is connect with central control module 4, and the iris information for acquiring user is simultaneously saved in data Memory module 5;
Sound acquisition module 3 is connect with central control module 4, and the acoustic information for acquiring user is simultaneously saved in data Memory module 5;
Central control module 4 stores mould with power management module 1, iris capturing module 2, sound acquisition module 3, data Block 5, fault detection module 6, malfunction coefficient module 7, starting module 8 connect, for dispatching modules normal work;
Data memory module 5 is connect with central control module 4, for storing client iris and acoustic information;
Fault detection module 6 is connect with central control module 4, for being detected to boot-strap circuit, boot program;
Malfunction coefficient module 7 is connect with central control module 4, for the lamp display circuit failure by different colours, electricity The information such as source failure, program mal;
Starting module 8 is connect with central control module 4, for passing through iris or sound in user's matched data memory module 5 Sound carries out startup booting.
The sound acquisition module sound collection signal operation during cluster head variation the specific steps are:
The first step, middleware execute cluster head selection analysis algorithm, and getting around may cause the region in " cavity " to use barrier as possible Hinder the predicted method of object;To make data packet get around the node in empty boundary in advance, the probability that cavity occurs is reduced, improves communication Packet arrival rate finally carries out both candidate nodes optimization with simulated annealing;
Second step, if no adjacent node can bypass, it is necessary to which node of the selection in the region for leading to cavity then makes The node in the region only takes on a cluster head as possible;
Third walks, after cluster algorithm has executed, if no adjacent node can bypass, it is necessary to which selection, which is in, leads to sky The node in the region in hole, then make the node in the region only take on a cluster head as possible, and middleware executes LEACH in simulating WSN Algorithm, the cluster head simulated are labeled as candidate cluster head, the NLOS nodes that will be analyzed, and energy is more than the candidate cluster head of threshold value It is designated as cluster head, to evade hot-zone and NLOS, the whole network broadcast is carried out by base station and appoints cluster head;
4th step, when leader cluster node detects that self rest energy reaches energy threshold and then sends message MSG_ to base station CLUSTER_EMPTY, base station computer executes algorithm and reanalyses closed area model and energy selection algorithm, and selects replacement Cluster head;
5th step, base station send the cluster head of ID to be downgraded to ordinary node to the whole network broadcast release is primary, and appoints new choosing The pre-selection cluster head gone out;
6th step, if cluster head, due to physical cause die by visitation of God, base station does not receive the cluster in a communication cycle The data packet that head comes, then send MSG_ISALIVE information and give the cluster head, if not receiving cluster head hair in a given time period The MSG_ALIVE information and ID come, then analyze and appointed in the model area in the partial closure space of the sub-clustering and newly selected Cluster head;
7th step, when in the WSN networks interior addition new node or already present node leave, node motion, only need to send out Send MSG_JOIN or MSG_LEAVE, MSG_MOVE message and ID to base station computer, base station computer is rebuild automatically The model in the partial closure space of the node, and judge whether according to actual conditions the cluster head of the gravity treatment part;
The specific calculating step of the direct trust value of the central control module is:
Acquire the interaction times of n timeslice between network observations node i and node j:
Intervals t is chosen as an observation time piece, with observer nodes i and tested node j in 1 timeslice Interior interaction times are denoted as y as observation index, true interaction timest, the y of n timeslice is recorded successivelyn, and preserved In the communications records table of node i;
Predict the interaction times of (n+1)th timeslice:
According to the interaction times settling time sequence of collected n timeslice, predicted down using third index flatness Interaction times between one timeslice n+1 interior nodes i and j are predicted interaction times, are denoted asCalculation formula is as follows:
Predictive coefficient an、bn、cnValue can be calculated by following formula:
Wherein:It is primary, secondary, Three-exponential Smoothing number respectively, is calculated by following formula It arrives:
It is the initial value of third index flatness, value is
α is smoothing factor (0 < α < 1), embodies the time attenuation characteristic of trust, i.e., timeslice closer from predicted value ytWeight is bigger, the y of the timeslice remoter from predicted valuetWeight is smaller;Usually, if data fluctuations are larger, and long-term trend Amplitude of variation is larger, and α when obviously rapidly rising or falling trend, which is presented, should take higher value (0.6~0.8), can increase in the recent period Influence of the data to prediction result;When data have a fluctuation, but long-term trend variation is little, α can between 0.1~0.4 value; If data fluctuations are steady, α should take smaller value (0.05~0.20);
Calculate direct trust value:
The direct trust value TD of node jijTo predict interaction timesWith true interaction times yn+1Relative error,
In step 2, the specific meter of indirect trust values is calculated using calculating formula obtained from multipath trust recommendation mode Calculating step is:
Collect direct trust value of the trusted node to node j:
Node i meets TD to allikThe credible associated nodes of≤φ inquire its direct trust value to node j, wherein φ For the believability threshold of recommended node, according to the precision prescribed of confidence level, the value range of φ is 0~0.4;
Calculate indirect trust values:
Trust value collected by COMPREHENSIVE CALCULATING obtains the indirect trust values TR of node jij, Wherein, had with j nodes in the associated nodes that Set (i) is observer nodes i and interacted and its direct trust value meets TDik≤ φ's Node set;
In step 3, show that the specific calculating of comprehensive trust value walks by direct trust value and indirect trust values conformity calculation Suddenly it is:
Comprehensive trust value (Tij) calculation formula it is as follows:Tij=β TDij+(1-β)TRij, wherein β (0≤β≤1) expressions are directly The weight for connecing trust value, as β=0, node i and node j do not have a direct interaction relationship, the calculating of comprehensive trust value directly from In indirect trust values, it is more objective to judge;As β=1, node i is to the synthesis trust value of node j all from directly trust Value judges more subjectivity in this case, practical to calculate the value that determine β as needed;
Starting module 8 provided by the invention includes:Signal receiving module, startup self-detection module, program load-on module;
Signal receiving module, for receiving starting-up signal such as iris or sound;
Startup self-detection module, whether input-output system is wrong when for detecting booting, without staggering the time, starts boot program; It staggers the time, then cannot be started up;
Program load-on module is staggered the time for startup self-detection module detection nothing, loading system program.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all essences in the present invention All any modification, equivalent and improvement etc., should all be included in the protection scope of the present invention made by within refreshing and principle.

Claims (3)

1. a kind of system of computer booting, which is characterized in that the system of the computer booting includes:
Power management module is connect with central control module, for being managed operation to power supply, and is powered;
Iris capturing module, connect with central control module, and the iris information for acquiring user is simultaneously saved in data storage mould Block;
Sound acquisition module is connect with central control module, and the acoustic information for acquiring user is simultaneously saved in data storage mould Block;
The sound acquisition module sound collection signal operation during cluster head variation the specific steps are:
The first step, middleware execute cluster head selection analysis algorithm, and getting around may cause the region in " cavity " to use barrier as possible Predicted method;To make data packet get around the node in empty boundary in advance, the probability that cavity occurs is reduced, improves communication packet Arrival rate finally carries out both candidate nodes optimization with simulated annealing;
Second step, if no adjacent node can bypass, it is necessary to node of the selection in the region for leading to cavity, the areas Ze Shigai The node in domain only takes on a cluster head as possible;
Third walks, after cluster algorithm has executed, if no adjacent node can bypass, it is necessary to which selection, which is in, leads to cavity The node in region then makes the node in the region only take on a cluster head as possible, and middleware executes LEACH algorithms in simulating WSN, The cluster head simulated is labeled as candidate cluster head, the NLOS nodes that will be analyzed, and the candidate cluster head that energy is more than threshold value is specified As cluster head, to evade hot-zone and NLOS, the whole network broadcast is carried out by base station and appoints cluster head;
4th step, when leader cluster node detects that self rest energy reaches energy threshold and then sends message MSG_ to base station CLUSTER_EMPTY, base station computer executes algorithm and reanalyses closed area model and energy selection algorithm, and selects replacement Cluster head;
5th step, base station to the whole network broadcast exempt it is primary send the cluster head of ID to be downgraded to ordinary node, and appoint and newly select Preselect cluster head;
6th step, if cluster head, due to physical cause die by visitation of God, base station does not receive the cluster head in a communication cycle Data packet, then send MSG_ISALIVE information and give the cluster head, if not receiving what the cluster head was sent in a given time period MSG_ALIVE information and ID are then analyzed in the model area in the partial closure space of the sub-clustering and are appointed the cluster head newly selected;
7th step, when in the WSN networks interior addition new node or already present node leave, node motion, only need to send To base station computer, base station computer rebuilds this automatically by MSG_JOIN or MSG_LEAVE, MSG_MOVE message and ID The model in the partial closure space of node, and judge whether according to actual conditions the cluster head of the gravity treatment part;
Central control module is examined with power management module, iris capturing module, sound acquisition module, data memory module, failure Module, malfunction coefficient module, starting module connection are surveyed, for dispatching modules normal work;
The specific calculating step of the direct trust value of the central control module is:
Acquire the interaction times of n timeslice between network observations node i and node j:
Intervals t is chosen as an observation time piece, with observer nodes i and tested node j in 1 timeslice Interaction times are denoted as y as observation index, true interaction timest, the y of n timeslice is recorded successivelyn, and save it in section In the communications records table of point i;
Predict the interaction times of (n+1)th timeslice:
According to the interaction times settling time sequence of collected n timeslice, predicted using third index flatness next Interaction times between timeslice n+1 interior nodes i and j are predicted interaction times, are denoted asCalculation formula is as follows:
Predictive coefficient an、bn、cnValue can be calculated by following formula:
Wherein:It is primary, secondary, Three-exponential Smoothing number respectively, is calculated by following formula:
It is the initial value of third index flatness, value is
α is smoothing factor (0 < α < 1), embodies the time attenuation characteristic of trust, i.e., the y of timeslice closer from predicted valuetWeight It is bigger, the y of the timeslice remoter from predicted valuetWeight is smaller;Usually, if data fluctuations are larger, and long-term trend change Amplitude is larger, and α when obviously rapidly rising or falling trend, which is presented, should take higher value (0.6~0.8), can increase Recent data Influence to prediction result;When data have a fluctuation, but long-term trend variation is little, α can between 0.1~0.4 value;If Data fluctuations are steady, and α should take smaller value (0.05~0.20);
Calculate direct trust value:
The direct trust value TD of node jijTo predict interaction timesWith true interaction times yn+1Relative error,
In step 2, the specific calculating that indirect trust values are calculated using calculating formula obtained from multipath trust recommendation mode is walked Suddenly it is:
Collect direct trust value of the trusted node to node j:
Node i meets TD to allikThe credible associated nodes of≤φ inquire that its direct trust value to node j, wherein φ are to push away The believability threshold for recommending node, according to the precision prescribed of confidence level, the value range of φ is 0~0.4;
Calculate indirect trust values:
Trust value collected by COMPREHENSIVE CALCULATING obtains the indirect trust values TR of node jij,Its In, had with j nodes in the associated nodes that Set (i) is observer nodes i and interacted and its direct trust value meets TDikThe section of≤φ Point set;
In step 3, the specific calculating step of comprehensive trust value is obtained by direct trust value and indirect trust values conformity calculation For:
Comprehensive trust value (Tij) calculation formula it is as follows:Tij=β TDij+(1-β)TRij, wherein β (0≤β≤1) expressions directly letter The weight for appointing value, as β=0, node i and node j do not have a direct interaction relationship, between the calculating of comprehensive trust value arises directly from Trust value is connect, it is more objective to judge;As β=1, node i to the synthesis trust value of node j all from direct trust value, In this case, judge more subjectivity, it is practical to calculate the value that determine β as needed;
Data memory module is connect with central control module, for storing client iris and acoustic information;
Fault detection module is connect with central control module, for being detected to boot-strap circuit, boot program;
Malfunction coefficient module, connect with central control module, for the lamp display circuit failure by different colours, power supply event The information such as barrier, program mal;
Starting module is connect with central control module, for being carried out by iris in user's matched data memory module or sound Start booting.
2. a kind of method of the computer booting of computer booting system as described in claim 1, which is characterized in that the calculating The method of machine booting includes the following steps:
Step 1 proceeds by power supply by power management module;User will be adopted by iris capturing module, sound acquisition module Iris, the acoustic information of collection user is sent to central control module;
Step 2, central control module startup starting module by iris in matched data memory module or sound start and be opened Machine;
Step 3 is detected boot-strap circuit, boot program by fault detection module in start process;
Step 4 after detection, passes through the lamp display circuit failure of different colours, power failure, program event by malfunction coefficient module The information such as barrier.
3. the method for computer booting as described in claim 1, which is characterized in that the starting module includes:Signal receives Module, startup self-detection module, program load-on module;
Signal receiving module, for receiving starting-up signal such as iris or sound;
Startup self-detection module, whether input-output system is wrong when for detecting booting, without staggering the time, starts boot program;It is wrong When, then it cannot be started up;
Program load-on module is staggered the time for startup self-detection module detection nothing, loading system program.
CN201810211221.1A 2018-03-14 2018-03-14 A kind of method of computer booting Pending CN108446547A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810211221.1A CN108446547A (en) 2018-03-14 2018-03-14 A kind of method of computer booting

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810211221.1A CN108446547A (en) 2018-03-14 2018-03-14 A kind of method of computer booting

Publications (1)

Publication Number Publication Date
CN108446547A true CN108446547A (en) 2018-08-24

Family

ID=63195210

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810211221.1A Pending CN108446547A (en) 2018-03-14 2018-03-14 A kind of method of computer booting

Country Status (1)

Country Link
CN (1) CN108446547A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111709037A (en) * 2020-06-16 2020-09-25 常州纺织服装职业技术学院 Computer system for ensuring database security
US20220272551A1 (en) * 2019-11-26 2022-08-25 Huawei Technologies Co., Ltd. Systems and methods for estimating locations of signal shadowing obstructions and signal reflectors in a wireless communications network

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101772015A (en) * 2008-12-29 2010-07-07 卢中江 Method for starting up mobile terminal through voice password
CN202502506U (en) * 2012-04-11 2012-10-24 倪睿熙 Computer startup detection control system
CN103379576A (en) * 2013-07-02 2013-10-30 东华理工大学 Wireless sensor network clustering method based on initiative avoidance of hotspots and NLOS
CN104038928A (en) * 2014-03-26 2014-09-10 宋晓宇 Method for calculating trust values of wireless Mesh network nodes
CN106060235A (en) * 2016-05-05 2016-10-26 广东小天才科技有限公司 Startup and shutdown control method and device applied to mobile equipment and mobile equipment
CN106156590A (en) * 2016-07-07 2016-11-23 皖西学院 A kind of computer startup processing method and processing system
CN107154876A (en) * 2017-05-18 2017-09-12 贵州斯曼特信息技术开发有限责任公司 A kind of large-scale data based on cloud service platform calculates acceleration system
CN107491678A (en) * 2017-08-16 2017-12-19 合肥庆响网络科技有限公司 Computer iris recognition start-up system

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101772015A (en) * 2008-12-29 2010-07-07 卢中江 Method for starting up mobile terminal through voice password
CN202502506U (en) * 2012-04-11 2012-10-24 倪睿熙 Computer startup detection control system
CN103379576A (en) * 2013-07-02 2013-10-30 东华理工大学 Wireless sensor network clustering method based on initiative avoidance of hotspots and NLOS
CN104038928A (en) * 2014-03-26 2014-09-10 宋晓宇 Method for calculating trust values of wireless Mesh network nodes
CN106060235A (en) * 2016-05-05 2016-10-26 广东小天才科技有限公司 Startup and shutdown control method and device applied to mobile equipment and mobile equipment
CN106156590A (en) * 2016-07-07 2016-11-23 皖西学院 A kind of computer startup processing method and processing system
CN107154876A (en) * 2017-05-18 2017-09-12 贵州斯曼特信息技术开发有限责任公司 A kind of large-scale data based on cloud service platform calculates acceleration system
CN107491678A (en) * 2017-08-16 2017-12-19 合肥庆响网络科技有限公司 Computer iris recognition start-up system

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220272551A1 (en) * 2019-11-26 2022-08-25 Huawei Technologies Co., Ltd. Systems and methods for estimating locations of signal shadowing obstructions and signal reflectors in a wireless communications network
US11910207B2 (en) * 2019-11-26 2024-02-20 Huawei Technologies Co., Ltd. Systems and methods for estimating locations of signal shadowing obstructions and signal reflectors in a wireless communications network
CN111709037A (en) * 2020-06-16 2020-09-25 常州纺织服装职业技术学院 Computer system for ensuring database security

Similar Documents

Publication Publication Date Title
Xiong et al. EMC 3: Energy-efficient data transfer in mobile crowdsensing under full coverage constraint
US10267661B2 (en) Energy efficient mobile context collection
Simma et al. Real-time occupancy estimation using WiFi network to optimize HVAC operation
CN105325023B (en) Method and the network equipment for cell abnormality detection
US10200446B2 (en) Method and system to estimate user desired delay for resource allocation for mobile cloud applications
JP2018169989A (en) Diagnosing slow tasks in distributed computing
CN110147387B (en) Root cause analysis method, root cause analysis device, root cause analysis equipment and storage medium
Nováczki An improved anomaly detection and diagnosis framework for mobile network operators
US20030023719A1 (en) Method and apparatus for prediction of computer system performance based on types and numbers of active devices
CN115278741B (en) Fault diagnosis method and device based on multi-mode data dependency relationship
JP2016529858A (en) Battery consumption analysis and prediction of wireless devices
CN105933932B (en) The real-time fault diagnosis method and system of wireless sensor network under complex environment
CN105550248B (en) User information method for digging and device
TWI269990B (en) Quality prognostics system and method for manufacturing processes with generic embedded devices
JP6400834B2 (en) RECOMMENDATION DEVICE, RECOMMENDATION DETERMINING METHOD, AND COMPUTER PROGRAM
CN108446547A (en) A kind of method of computer booting
CN107844406A (en) Method for detecting abnormality and system, service terminal, the memory of distributed system
Paci et al. 0, 1, 2, many—A classroom occupancy monitoring system for smart public buildings
WO2020206699A1 (en) Predicting virtual machine allocation failures on server node clusters
CN105700946B (en) The scheduling system and method for memory access latency between multithreading is balanced under a kind of NUMA architecture
Mahmud et al. Power profiling of context aware systems: a contemporary analysis and framework for power conservation
CN109241154A (en) A kind of distributed data base monitoring analysis method and system
CN116383001A (en) Training method of dynamic current prediction model and estimation method of dynamic power consumption
Skaperas et al. A pragmatical approach to anomaly detection evaluation in edge cloud systems
CN114416415A (en) Remote online fault detection method and system for Hongmon operating system and storage medium

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