CN108805559B - Two-dimensional code pushing method, mobile terminal and computer readable storage medium - Google Patents
Two-dimensional code pushing method, mobile terminal and computer readable storage medium Download PDFInfo
- Publication number
- CN108805559B CN108805559B CN201810825394.2A CN201810825394A CN108805559B CN 108805559 B CN108805559 B CN 108805559B CN 201810825394 A CN201810825394 A CN 201810825394A CN 108805559 B CN108805559 B CN 108805559B
- Authority
- CN
- China
- Prior art keywords
- dimensional code
- priority
- pushing
- code page
- irrelevant
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
- G06Q20/32—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using wireless devices
- G06Q20/327—Short range or proximity payments by means of M-devices
- G06Q20/3276—Short range or proximity payments by means of M-devices using a pictured code, e.g. barcode or QR-code, being read by the M-device
-
- 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/50—Network services
- H04L67/55—Push-based network services
-
- 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/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/61—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources taking into account QoS or priority requirements
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Business, Economics & Management (AREA)
- Signal Processing (AREA)
- Accounting & Taxation (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a two-dimensional code pushing method, which comprises the following steps: when a two-dimensional code pushing instruction is received, acquiring a two-dimensional code page process corresponding to the two-dimensional code pushing instruction; acquiring a first priority of the two-dimensional code page process; and pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority. The invention also discloses a mobile terminal and a computer readable storage medium. The method and the device realize the rapid pushing of the two-dimension code, so that a user can rapidly acquire the two-dimension code at the first time, the time is saved, the excessive occupation of resources is avoided when more applications run simultaneously at the same time, and the reasonable distribution and dynamic adjustment of system resources are further realized.
Description
Technical Field
The present invention relates to the field of mobile terminals, and in particular, to a two-dimensional code pushing method, a mobile terminal, and a computer readable storage medium.
Background
With the development of two-dimension code information technology, the payment of the cost of riding public transportation means by the way of sweeping the code and riding is also gradually popularized, and more people begin to pay the current cost by using the two-dimension code when riding.
Through the mode of sweeping the code and riding, the time for buying and checking the ticket by the user can be greatly saved, and the change is not needed, so that the method is safe, convenient and quick. However, when the two-dimensional code is used for scanning and riding, the two-dimensional code payment page is started slowly and can not be refreshed later, so that the problem that the two-dimensional code payment can not be rapidly scanned is caused.
The foregoing is provided merely for the purpose of facilitating understanding of the technical solutions of the present invention and is not intended to represent an admission that the foregoing is prior art.
Disclosure of Invention
The invention mainly aims to provide a two-dimension code pushing method, a mobile terminal and a computer readable storage medium, and aims to solve the technical problem that a current two-dimension code payment page is started slowly when a user takes a car with a scanning code.
In order to achieve the above object, the present invention provides a two-dimensional code pushing method, which includes the following steps:
when a two-dimensional code pushing instruction is received, acquiring a two-dimensional code page process corresponding to the two-dimensional code pushing instruction;
acquiring a first priority of the two-dimensional code page process;
and pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority.
In an embodiment, the step of obtaining the first priority of the two-dimensional code page process includes:
Acquiring the marking information of the two-dimensional code page process;
and determining the first priority of the two-dimensional code page process according to the marking information.
In an embodiment, the step of pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority includes:
determining an ongoing irrelevant process in a current processor, and acquiring a second priority of the irrelevant process;
and pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority and the second priority.
In one embodiment, the step of determining the ongoing unrelated processes in the current processor comprises:
acquiring an association process related to the two-dimensional code page process in the current processor;
and screening irrelevant processes currently in the processor according to the associated processes.
In an embodiment, the step of obtaining the association process related to the two-dimensional code page process in the current processor includes:
acquiring the memory occupation information of a current processor;
and determining an association process related to the two-dimensional code page process in the current processor according to the memory occupation information.
In an embodiment, the step of pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority and the second priority includes:
determining the level of the first priority and the second priority;
and when the first priority is not smaller than the second priority, performing invalidation processing on the irrelevant process, and preferentially pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction.
In one embodiment, the step of invalidating the unrelated process includes:
acquiring traffic occupation information of the irrelevant process;
and adjusting the occupied flow of the irrelevant process according to the flow occupied information.
In an embodiment, after the step of determining the level of the first priority and the level of the second priority, the two-dimensional code pushing method further includes:
and when the first priority is smaller than the second priority, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the priority sequence corresponding to the first priority.
In addition, to achieve the above object, the present invention also provides a mobile terminal including: the two-dimensional code pushing device comprises a memory, a processor and a two-dimensional code pushing program which is stored in the memory and can run on the processor, wherein the two-dimensional code pushing program realizes the steps of any one of the two-dimensional code pushing methods when being executed by the processor.
In addition, in order to achieve the above object, the present invention further provides a computer readable storage medium, on which a two-dimensional code pushing program is stored, the two-dimensional code pushing program implementing the steps of any one of the two-dimensional code pushing methods described above when executed by a processor.
According to the method and the device, when the two-dimension code pushing instruction is received, the two-dimension code page process corresponding to the two-dimension code pushing instruction is obtained, then the first priority of the two-dimension code page process is obtained, and then the two-dimension code page corresponding to the two-dimension code pushing instruction is pushed according to the first priority, so that the quick pushing of the two-dimension code is realized, a user can quickly obtain the two-dimension code in first time, time is saved, excessive occupation of resources when more applications are simultaneously operated at the same time is avoided, and reasonable allocation and dynamic adjustment of system resources are further realized.
Drawings
Fig. 1 is a schematic diagram of a hardware structure of a mobile terminal implementing various embodiments of the present invention;
fig. 2 is a schematic diagram of a communication network system according to an embodiment of the present invention;
FIG. 3 is a flowchart of a first embodiment of a two-dimension code pushing method according to the present invention;
Fig. 4 is a schematic flow chart of a second embodiment of the two-dimensional code pushing method of the present invention;
FIG. 5 is a flowchart of a third embodiment of a two-dimension code pushing method according to the present invention;
FIG. 6 is a flowchart of a second embodiment of the two-dimension code pushing method according to the present invention;
fig. 7 is a schematic flow chart of a fifth embodiment of a two-dimensional code pushing method according to the present invention;
FIG. 8 is a flowchart of a second embodiment of a two-dimension code pushing method according to the present invention;
fig. 9 is a schematic flow chart of a seventh embodiment of a two-dimensional code pushing method according to the present invention;
fig. 10 is a flowchart of an eighth embodiment of a two-dimensional code pushing method according to the present invention.
The achievement of the objects, functional features and advantages of the present invention will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
In the following description, suffixes such as "module", "component", or "unit" for representing elements are used only for facilitating the description of the present invention, and have no specific meaning per se. Thus, "module," "component," or "unit" may be used in combination.
The terminal may be implemented in various forms. For example, the terminals described in the present invention may include mobile terminals such as cell phones, tablet computers, notebook computers, palm computers, personal digital assistants (Personal Digital Assistant, PDA), portable media players (Portable Media Player, PMP), navigation devices, wearable devices, smart bracelets, pedometers, and fixed terminals such as digital TVs, desktop computers, and the like.
The following description will be given taking a mobile terminal as an example, and those skilled in the art will understand that the configuration according to the embodiment of the present invention can be applied to a fixed type terminal in addition to elements particularly used for a moving purpose.
Referring to fig. 1, which is a schematic diagram of a hardware structure of a mobile terminal implementing various embodiments of the present invention, the mobile terminal 100 may include: an RF (Radio Frequency) unit 101, a WiFi module 102, an audio output unit 103, an a/V (audio/video) input unit 104, a sensor 105, a display unit 106, a user input unit 107, an interface unit 108, a memory 109, a processor 110, and a power supply 111. Those skilled in the art will appreciate that the mobile terminal structure shown in fig. 1 is not limiting of the mobile terminal and that the mobile terminal may include more or fewer components than shown, or may combine certain components, or a different arrangement of components.
The following describes the components of the mobile terminal in detail with reference to fig. 1:
the radio frequency unit 101 may be used for receiving and transmitting signals during the information receiving or communication process, specifically, after receiving downlink information of the base station, processing the downlink information by the processor 110; and, the uplink data is transmitted to the base station. Typically, the radio frequency unit 101 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, and the like. In addition, the radio frequency unit 101 may also communicate with networks and other devices via wireless communications. The wireless communication may use any communication standard or protocol, including but not limited to GSM (Global System of Mobile communication, global System for Mobile communications), GPRS (General Packet Radio Service ), CDMA2000 (Code Division Multiple Access, CDMA 2000), WCDMA (Wideband Code Division Multiple Access ), TD-SCDMA (Time Division-Synchronous Code Division Multiple Access, time Division synchronous code Division multiple Access), FDD-LTE (Frequency Division Duplexing-Long Term Evolution, frequency Division Duplex Long term evolution), and TDD-LTE (Time Division Duplexing-Long Term Evolution, time Division Duplex Long term evolution), etc.
WiFi belongs to a short-distance wireless transmission technology, and a mobile terminal can help a user to send and receive e-mails, browse web pages, access streaming media and the like through the WiFi module 102, so that wireless broadband Internet access is provided for the user. Although fig. 1 shows a WiFi module 102, it is understood that it does not belong to the necessary constitution of a mobile terminal, and can be omitted entirely as required within a range that does not change the essence of the invention.
The audio output unit 103 may convert audio data received by the radio frequency unit 101 or the WiFi module 102 or stored in the memory 109 into an audio signal and output as sound when the mobile terminal 100 is in a call signal reception mode, a talk mode, a recording mode, a voice recognition mode, a broadcast reception mode, or the like. Also, the audio output unit 103 may also provide audio output (e.g., a call signal reception sound, a message reception sound, etc.) related to a specific function performed by the mobile terminal 100. The audio output unit 103 may include a speaker, a buzzer, and the like.
The a/V input unit 104 is used to receive an audio or video signal. The a/V input unit 104 may include a graphics processor (Graphics Processing Unit, GPU) 1041 and a microphone 1042, the graphics processor 1041 processing image data of still pictures or video obtained by an image capturing device (e.g., a camera) in a video capturing mode or an image capturing mode. The processed image frames may be displayed on the display unit 106. The image frames processed by the graphics processor 1041 may be stored in the memory 109 (or other storage medium) or transmitted via the radio frequency unit 101 or the WiFi module 102. The microphone 1042 can receive sound (audio data) via the microphone 1042 in a phone call mode, a recording mode, a voice recognition mode, and the like, and can process such sound into audio data. The processed audio (voice) data may be converted into a format output that can be transmitted to the mobile communication base station via the radio frequency unit 101 in the case of a telephone call mode. The microphone 1042 may implement various types of noise cancellation (or suppression) algorithms to cancel (or suppress) noise or interference generated in the course of receiving and transmitting the audio signal.
The mobile terminal 100 also includes at least one sensor 105, such as a light sensor, a motion sensor, and other sensors. Specifically, the light sensor includes an ambient light sensor and a proximity sensor, wherein the ambient light sensor can adjust the brightness of the display panel 1061 according to the brightness of ambient light, and the proximity sensor can turn off the display panel 1061 and/or the backlight when the mobile terminal 100 moves to the ear. As one of the motion sensors, the accelerometer sensor can detect the acceleration in all directions (generally three axes), and can detect the gravity and direction when stationary, and can be used for applications of recognizing the gesture of a mobile phone (such as horizontal and vertical screen switching, related games, magnetometer gesture calibration), vibration recognition related functions (such as pedometer and knocking), and the like; as for other sensors such as fingerprint sensors, pressure sensors, iris sensors, molecular sensors, gyroscopes, barometers, hygrometers, thermometers, infrared sensors, etc. that may also be configured in the mobile phone, the detailed description thereof will be omitted.
The display unit 106 is used to display information input by a user or information provided to the user. The display unit 106 may include a display panel 1061, and the display panel 1061 may be configured in the form of a liquid crystal display (Liquid Crystal Display, LCD), an Organic Light-Emitting Diode (OLED), or the like.
The user input unit 107 may be used to receive input numeric or character information and to generate key signal inputs related to user settings and function control of the mobile terminal. In particular, the user input unit 107 may include a touch panel 1071 and other input devices 1072. The touch panel 1071, also referred to as a touch screen, may collect touch operations thereon or thereabout by a user (e.g., operations of the user on the touch panel 1071 or thereabout by using any suitable object or accessory such as a finger, a stylus, etc.) and drive the corresponding connection device according to a predetermined program. The touch panel 1071 may include two parts of a touch detection device and a touch controller. The touch detection device detects the touch azimuth of a user, detects a signal brought by touch operation and transmits the signal to the touch controller; the touch controller receives touch information from the touch detection device, converts it into touch point coordinates, and sends the touch point coordinates to the processor 110, and can receive and execute commands sent from the processor 110. Further, the touch panel 1071 may be implemented in various types such as resistive, capacitive, infrared, and surface acoustic wave. The user input unit 107 may include other input devices 1072 in addition to the touch panel 1071. In particular, other input devices 1072 may include, but are not limited to, one or more of a physical keyboard, function keys (e.g., volume control keys, switch keys, etc.), a trackball, mouse, joystick, etc., as specifically not limited herein.
Further, the touch panel 1071 may overlay the display panel 1061, and when the touch panel 1071 detects a touch operation thereon or thereabout, the touch panel 1071 is transferred to the processor 110 to determine the type of touch event, and then the processor 110 provides a corresponding visual output on the display panel 1061 according to the type of touch event. Although in fig. 1, the touch panel 1071 and the display panel 1061 are two independent components for implementing the input and output functions of the mobile terminal, in some embodiments, the touch panel 1071 may be integrated with the display panel 1061 to implement the input and output functions of the mobile terminal, which is not limited herein.
The interface unit 108 serves as an interface through which at least one external device can be connected with the mobile terminal 100. For example, the external devices may include a wired or wireless headset port, an external power (or battery charger) port, a wired or wireless data port, a memory card port, a port for connecting a device having an identification module, an audio input/output (I/O) port, a video I/O port, an earphone port, and the like. The interface unit 108 may be used to receive input (e.g., data information, power, etc.) from an external device and transmit the received input to one or more elements within the mobile terminal 100 or may be used to transmit data between the mobile terminal 100 and an external device.
Memory 109 may be used to store software programs as well as various data. The memory 109 may mainly include a storage program area that may store an operating system, application programs required for at least one function (such as a sound playing function, an image playing function, etc.), and a storage data area; the storage data area may store data (such as audio data, phonebook, etc.) created according to the use of the handset, etc. In addition, memory 109 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device.
The processor 110 is a control center of the mobile terminal, connects various parts of the entire mobile terminal using various interfaces and lines, and performs various functions of the mobile terminal and processes data by running or executing software programs and/or modules stored in the memory 109 and calling data stored in the memory 109, thereby performing overall monitoring of the mobile terminal. Processor 110 may include one or more processing units; preferably, the processor 110 may integrate an application processor that primarily handles operating systems, user interfaces, applications, etc., with a modem processor that primarily handles wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 110.
The mobile terminal 100 may further include a power source 111 (e.g., a battery) for supplying power to the respective components, and preferably, the power source 111 may be logically connected to the processor 110 through a power management system, so as to perform functions of managing charging, discharging, and power consumption management through the power management system.
Although not shown in fig. 1, the mobile terminal 100 may further include a bluetooth module or the like, which is not described herein.
In order to facilitate understanding of the embodiments of the present invention, a communication network system on which the mobile terminal of the present invention is based will be described below.
Referring to fig. 2, fig. 2 is a schematic diagram of a communication network system according to an embodiment of the present invention, where the communication network system is an LTE system of a general mobile communication technology, and the LTE system includes a UE (User Equipment) 201, an e-UTRAN (Evolved UMTS Terrestrial RadioAccess Network ) 202, an epc (EvolvedPacket Core, evolved packet core) 203, and an IP service 204 of an operator that are sequentially connected in communication.
Specifically, the UE201 may be the terminal 100 described above, and will not be described herein.
The E-UTRAN202 includes eNodeB2021 and other eNodeB2022, etc. The eNodeB2021 may be connected with other eNodeB2022 by a backhaul (e.g., an X2 interface), the eNodeB2021 is connected to the EPC203, and the eNodeB2021 may provide access from the UE201 to the EPC 203.
EPC203 may include MME (Mobility Management Entity ) 2031, hss (Home Subscriber Server, home subscriber server) 2032, other MMEs 2033, SGW (Serving GateWay) 2034, pgw (PDN GateWay) 2035 and PCRF (Policy and Charging Rules Function, policy and tariff function entity) 2036, and the like. The MME2031 is a control node that handles signaling between the UE201 and EPC203, providing bearer and connection management. HSS2032 is used to provide registers to manage functions such as home location registers (not shown) and to hold user specific information about service characteristics, data rates, etc. All user data may be sent through SGW2034 and PGW2035 may provide IP address allocation and other functions for UE201, PCRF2036 is a policy and charging control policy decision point for traffic data flows and IP bearer resources, which selects and provides available policy and charging control decisions for a policy and charging enforcement function (not shown).
IP services 204 may include the internet, intranets, IMS (IP Multimedia Subsystem ), or other IP services, etc.
Although the LTE system is described above as an example, it should be understood by those skilled in the art that the present invention is not limited to LTE systems, but may be applied to other wireless communication systems, such as GSM, CDMA2000, WCDMA, TD-SCDMA, and future new network systems.
Based on the above-mentioned mobile terminal hardware structure and communication network system, various embodiments of the present invention are presented.
The invention provides a two-dimensional code pushing method, referring to fig. 3, fig. 3 is a flow chart of a first embodiment of the two-dimensional code pushing method of the invention.
In this embodiment, the two-dimensional code pushing method includes:
step S100, when a two-dimension code pushing instruction is received, acquiring a two-dimension code page process corresponding to the two-dimension code pushing instruction;
in this embodiment, the two-dimensional code pushing instruction is a pushing instruction corresponding to the received two-dimensional code, and the two-dimensional code pushing instruction may be triggered based on an application page related to the user terminal, for example, a fare payment application page; and acquiring a currently corresponding two-dimensional code page through the two-dimensional code pushing instruction. Specifically, when a two-dimensional code pushing instruction is received, a two-dimensional code page process corresponding to the two-dimensional code pushing instruction is called; the two-dimension code page process is a two-dimension code interface pushed according to the two-dimension code pushing instruction. Different two-dimensional codes are corresponding to different moments, so that when a two-dimensional code pushing instruction at the current moment is obtained, a corresponding two-dimensional code page process can be obtained according to the two-dimensional code pushing instruction.
Step S200, acquiring a first priority of the two-dimensional code page process;
in this embodiment, in the terminal application, there may be multiple application processes running simultaneously at the same time, and if there are too many application processes running simultaneously, the terminal system will be blocked, so that the two-dimensional code page process corresponding to the two-dimensional code pushing instruction at the current time cannot be acquired at the first time. Therefore, when the two-dimensional code page process is acquired, determining a first priority of the two-dimensional code page process, wherein the first priority is a priority order corresponding to the two-dimensional code page process, and determining the pushing order of the current two-dimensional code page process according to the first priority.
Specifically, when the two-dimensional code page process is acquired, acquiring the marking information of the two-dimensional code page process, wherein the marking information is the level identification of the two-dimensional code page process, and the first priority corresponding to the two-dimensional code page process can be determined according to the marking information. The method comprises the steps that white list marking is carried out on some application processes needing to be started at a high speed in advance, and the priority corresponding to the application processes marked by the white list is highest; if the marking information is the marking information of the white list, the first priority of the two-dimensional code page process corresponding to the marking information is the highest priority. When the first priority of the two-dimensional code page process is the highest priority, the two-dimensional code page process is pushed first in a plurality of page processes in progress at the same time. Different marking information corresponds to different priority levels, when the two-dimensional code page process is acquired, the marking information of the two-dimensional code page process is acquired, and the first priority corresponding to the two-dimensional code page process can be determined by analyzing the marking information.
Step S300, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority.
In this embodiment, when determining a first priority corresponding to the two-dimensional code page process, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority. Specifically, when a first priority corresponding to the two-dimensional code page process is acquired, determining an ongoing irrelevant process in the current processor, wherein the irrelevant process is an application process which is not associated with the two-dimensional code page process and is currently running, and determining the irrelevant process according to memory occupation information in the current system processor. Specifically, when determining the first priority corresponding to the two-dimensional code page process, acquiring memory occupation information in a current processor, wherein the memory occupation information is currently running application process information in the processor, and determining the currently running application process according to the memory occupation information. In general, in the running process of an application process, the application process needs to be associated with other application processes to realize the functions corresponding to the application process; of course, there are also independent application processes that implement functions independently, and for such independent application processes, they do not correspond to any associated processes. When the memory occupation information is acquired, determining an association process associated with the two-dimensional code page process in the currently running application process according to the memory occupation information, namely determining whether the association process associated with the two-dimensional code page process exists in the currently running application process; when the associated process corresponding to the two-dimension code page process is obtained, all running application processes except the associated process are irrelevant processes corresponding to the two-dimension code page process.
When the irrelevant process is acquired, acquiring a second priority of the irrelevant process, wherein the second priority is the priority corresponding to the irrelevant process; according to the first priority corresponding to the two-dimensional code page process and the second priority corresponding to the irrelevant process, the two-dimensional code page corresponding to the two-dimensional code pushing instruction can be determined. The two-dimensional code page is a two-dimensional code page corresponding to the two-dimensional code pushing instruction at the current moment, and two-dimensional codes contained in the two-dimensional code pages at different moments are different. And determining the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the acquired first priority corresponding to the two-dimensional code page process and the second priority corresponding to the irrelevant process. Specifically, when a first priority corresponding to the two-dimensional code page process and a second priority corresponding to the irrelevant process are obtained, determining the level of the first priority and the second priority; when the first priority is not less than the second priority, performing invalidation processing on the irrelevant process; the invalidation process is to perform operations such as network speed limiting on the irrelevant process at the current moment or in a certain time period. Specifically, acquiring traffic occupation information of the irrelevant process, and performing invalidation processing on the irrelevant process according to the traffic occupation information; the traffic occupation information is network traffic occupation information of the current irrelevant process, and the occupation traffic of the irrelevant process is adjusted according to the traffic occupation information, for example, the occupation traffic of the irrelevant process is limited, so that the situation that the current irrelevant process is excessively occupied is avoided, and the pushing of the current two-dimensional code page process is affected.
Further, the invalidation process further comprises operations such as suspending operation of the irrelevant process, forcibly stopping operation of the irrelevant process, or prohibiting network access to the irrelevant process, so as to ensure that the two-dimensional code page process corresponding to the current first priority can be quickly pushed to the terminal display interface at the first time.
And when the first priority is smaller than the second priority, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the priority sequence corresponding to the first priority. For the two-dimensional code page process with the first priority smaller than the second priority of the irrelevant process, namely the current irrelevant process is the necessary application process, and the application process of the basic function of the terminal is the necessary application process; therefore, when the first priority is smaller than the second priority, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the priority sequence of the current first priority relative to the second priority.
According to the two-dimension code pushing method, when the two-dimension code pushing instruction is received, the two-dimension code page process corresponding to the two-dimension code pushing instruction is obtained, then the first priority of the two-dimension code page process is obtained, and then the two-dimension code page corresponding to the two-dimension code pushing instruction is pushed according to the first priority, so that the two-dimension code can be quickly pushed, a user can quickly obtain the two-dimension code at the first time, the time is saved, meanwhile, excessive occupation of resources when more applications are simultaneously operated at the same time is avoided, and further reasonable allocation and dynamic adjustment of system resources are realized.
Based on the first embodiment, a second embodiment of the two-dimensional code pushing method of the present invention is proposed, referring to fig. 4, in this embodiment, step S2000 includes:
step S2100, obtaining the marking information of the two-dimensional code page process;
step S2200, determining the first priority of the two-dimensional code page process according to the marking information.
In this embodiment, the marking information is a level identifier of the two-dimensional code page process, and according to the marking information, a first priority corresponding to the two-dimensional code page process can be determined; the first priority is the priority order corresponding to the two-dimensional code page process, and the pushing order of the current two-dimensional code page process can be determined according to the first priority. The marking information can be determined by marking the two-dimensional code page process in advance, and when the two-dimensional code page process is not preset, the marking information corresponding to the two-dimensional code page process is default marking information. Specifically, when a two-dimensional code page process corresponding to the two-dimensional code pushing instruction is obtained, marking information of the two-dimensional code page process is obtained, and a first priority corresponding to the two-dimensional code page process is determined according to the marking information.
For example, when preset, the two-dimensional code page corresponding to the two-dimensional code page process is a fast start page, the two-dimensional code page process is marked by a white list in advance, the priority corresponding to the application process marked by the white list is the highest, at this time, the marking information is the marking information of the white list, and the first priority of the two-dimensional code page process corresponding to the marking information is the highest priority. When the two-dimensional code page process is acquired, the marking information corresponding to the two-dimensional code page process can be acquired as the marking information of the white list; therefore, the first priority corresponding to the two-dimensional code page process can be determined to be the highest priority according to the marking information.
According to the two-dimensional code pushing method, the first priority of the two-dimensional code page process is determined by acquiring the marking information of the two-dimensional code page process, and the determination of the first priority corresponding to the two-dimensional code page process is achieved, so that reasonable resource allocation can be performed when the two-dimensional code page process is pushed by the first priority, and the pushing efficiency of the two-dimensional code page is further improved.
Based on the first embodiment, a third embodiment of the two-dimensional code pushing method of the present invention is provided, referring to fig. 5, in this embodiment, step S3000 includes:
step S3100, determining an ongoing irrelevant process in a current processor, and acquiring a second priority of the irrelevant process;
step S3200, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority and the second priority.
In this embodiment, when the first priority corresponding to the two-dimensional code page process is obtained, an ongoing irrelevant process in the current processor needs to be determined, where the irrelevant process is a page process that is not associated with the current two-dimensional code page process. And acquiring a second priority of the irrelevant process, and pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority and the second priority.
Specifically, when the first priority corresponding to the two-dimensional code page process is obtained, traversing the occupation condition of the current system CPU (Central Processing Unit central processing unit), and obtaining the memory occupation information in the current system processor, and determining the currently running application process according to the memory occupation information. Determining an association process associated with the two-dimensional code page process in the currently running application process, namely determining whether the association process associated with the two-dimensional code page process exists in the currently running application process; when the associated process corresponding to the two-dimension code page process is obtained, all running application processes except the associated process are irrelevant processes corresponding to the two-dimension code page process.
When the irrelevant process is acquired, namely a second priority of the irrelevant process is acquired, and when a first priority corresponding to the two-dimensional code page process and a second priority corresponding to the irrelevant process are acquired, determining the level of the first priority and the second priority; when the first priority is not less than the second priority, performing invalidation processing on the irrelevant process; the invalidation process is to perform operations such as network speed limiting on the irrelevant process at the current moment or in a certain time period. And when the first priority is smaller than the second priority, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the priority sequence corresponding to the first priority.
According to the two-dimension code pushing method, the second priority of the irrelevant process is obtained by determining the irrelevant process which is in progress in the current processor, and then the two-dimension code page corresponding to the two-dimension code pushing instruction is pushed according to the first priority and the second priority, so that reasonable allocation of processor resources in the current system according to the first priority and the second priority is realized, and the application process with high priority can be operated preferentially and rapidly at the same time.
Based on the third embodiment, a fourth embodiment of the two-dimensional code pushing method of the present invention is proposed, referring to fig. 6, in this embodiment, step S3100 includes:
step S3110, obtaining an association process related to the two-dimensional code page process in the current processor;
step S3120, filtering irrelevant processes currently in progress in the processor according to the associated process.
In this embodiment, the associated process is an application process associated with the two-dimensional code page process currently in operation, and the irrelevant process is an application process not associated with the two-dimensional code page process currently in operation; and screening irrelevant processes in the current processor according to the relevant processes. Specifically, when the first priority of the two-dimension code page process is obtained, memory occupation information in the current processor is obtained, wherein the memory occupation information is currently running application process information in the processor, and the currently running application process can be determined according to the memory occupation information. Determining whether an associated process associated with the two-dimensional code page process exists in the currently running application process; when the associated process corresponding to the two-dimension code page process is obtained, all running application processes except the associated process are irrelevant processes corresponding to the two-dimension code page process.
According to the two-dimension code pushing method, the association process related to the two-dimension code page process in the current processor is obtained, and then the ongoing irrelevant process in the current processor is screened according to the association process, so that the irrelevant process in the current processor is obtained quickly, occupation of resources by the irrelevant process is further avoided, and the pushing rate of the two-dimension code is improved.
Based on the fourth embodiment, a fifth embodiment of the two-dimensional code pushing method of the present invention is proposed, referring to fig. 7, in this embodiment, step S3110 includes:
step S3111, obtaining current processor memory occupation information;
step S3112, determining an association process related to the two-dimension code page process in the current processor according to the memory occupation information.
In this embodiment, the memory occupation information is currently running application process information in the processor, and the associated process is currently running application process associated with the two-dimensional code page process; and determining an associated process corresponding to the two-dimensional code page process according to the memory occupation information. Specifically, when a first priority corresponding to the two-dimensional code page process is obtained, obtaining memory occupation information in a current system processor; when the memory occupation information is acquired, determining whether an associated process associated with the two-dimensional code page process exists in the currently running application process according to the memory occupation information; when the association process corresponding to the two-dimension code page process is obtained, determining that the association process associated with the two-dimension code page process exists in the currently running application process; when the association process corresponding to the two-dimension code page process cannot be obtained, it is determined that the association process associated with the two-dimension code page process does not exist in the currently running application process.
According to the two-dimensional code pushing method, the memory occupation information of the current processor is obtained, then the associated process related to the two-dimensional code page process in the current processor is determined according to the memory occupation information, and the management process corresponding to the two-dimensional code page process is obtained, so that the rapid obtaining of the irrelevant process in the current processor is further achieved.
Based on the third embodiment, a sixth embodiment of the two-dimensional code pushing method of the present invention is proposed, referring to fig. 8, in this embodiment, step S3200 includes:
step S3210, determining the level of the first priority and the second priority;
in step S3220, when the first priority is not less than the second priority, invalidating the irrelevant process, and preferentially pushing the two-dimension code page corresponding to the two-dimension code pushing instruction.
In this embodiment, when the first priority corresponding to the two-dimensional code page process and the second priority corresponding to the unrelated process are obtained, the two-dimensional code page corresponding to the two-dimensional code pushing instruction may be determined according to the first priority corresponding to the two-dimensional code page process and the second priority corresponding to the unrelated process. Specifically, when the first priority and the second priority are acquired, determining the level of the first priority and the second priority; when the first priority is not less than the second priority, performing invalidation processing on the irrelevant process; and when the first priority is smaller than the second priority, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the priority sequence corresponding to the first priority.
The invalidation process is to perform operations such as network speed limiting on the irrelevant process at the current moment or in a certain time period; and when the first priority is not smaller than the second priority, acquiring traffic occupation information of the irrelevant process, wherein the traffic occupation information is the network traffic occupation information of the current irrelevant process, and adjusting the occupied traffic of the irrelevant process according to the traffic occupation information. When the traffic occupation information of the irrelevant process is obtained, the occupation traffic of the irrelevant process is adjusted according to the traffic occupation information, and the optimal traffic resource is preferentially allocated to the two-dimension code page process so as to rapidly push the two-dimension code page corresponding to the two-dimension code pushing instruction.
According to the two-dimension code pushing method, the level of the first priority and the level of the second priority are determined, then when the first priority is not smaller than the second priority, invalid processing is carried out on the irrelevant process, the two-dimension code page corresponding to the two-dimension code pushing instruction is pushed preferentially, reasonable distribution of network resources of the two-dimension code page process and the irrelevant process according to the level of the priority is achieved, and further when the first priority is not smaller than the second priority, priority operation of the two-dimension code page process is achieved, and pushing efficiency of the two-dimension code page is improved.
Based on the sixth embodiment, a seventh embodiment of the two-dimensional code pushing method of the present invention is proposed, referring to fig. 9, in this embodiment, step S3220 includes:
step S3221, acquiring traffic occupation information of the irrelevant process;
step S3222, according to the traffic occupation information, the occupation traffic of the irrelevant process is adjusted.
In this embodiment, when the first priority of the two-dimensional code page process is not less than the second priority of the unrelated process, the invalidation process is performed on the unrelated process. Specifically, when the first priority is not smaller than the second priority, acquiring traffic occupation information of the irrelevant process, wherein the traffic occupation information is network traffic occupation information of the current irrelevant process; and adjusting the occupied flow of the irrelevant process according to the flow occupied information, wherein if the occupied flow of the irrelevant process is not smaller than the occupied flow corresponding to the two-dimensional code page process according to the flow occupied information, the occupied flow corresponding to the irrelevant process is reduced. If the occupied flow of the current irrelevant process is smaller than the occupied flow corresponding to the two-dimensional code page process according to the flow occupied information, adjusting the occupied flow of the current irrelevant process according to a preset control rule; if the occupied flow of the irrelevant process is determined to be unnecessary to change at the current moment according to the preset control rule, the current occupied flow of the irrelevant process is maintained; if the occupied flow of the irrelevant process at the current moment needs to be changed according to the preset control rule, the occupied flow corresponding to the irrelevant process at the current moment is further reduced.
According to the two-dimensional code pushing method, the traffic occupation information of the irrelevant process is obtained, then the occupation traffic of the irrelevant process is adjusted according to the traffic occupation information, so that when the second priority of the irrelevant process is smaller than the first priority of the two-dimensional code page process, the occupation traffic of the irrelevant process is adjusted, the occupation of traffic resources by the irrelevant process is avoided, and the running speed of the two-dimensional code page process is further improved.
Based on the sixth embodiment, an eighth embodiment of the two-dimensional code pushing method of the present invention is provided, referring to fig. 10, in this embodiment, after step S3210, the two-dimensional code pushing method further includes:
step S3230, when the first priority is less than the second priority, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the priority order corresponding to the first priority.
In this embodiment, when it is determined that the first priority of the two-dimensional code page process is smaller than the second priority of the unrelated process, the two-dimensional code page corresponding to the two-dimensional code pushing instruction is pushed according to the priority order corresponding to the first priority. For the two-dimensional code page process with the first priority smaller than the second priority of the irrelevant process, namely the current irrelevant process is the necessary application process, and the application process of the basic function of the terminal is the necessary application process; therefore, when the first priority is smaller than the second priority, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the priority sequence of the current first priority relative to the second priority.
According to the two-dimensional code pushing method, when the first priority is smaller than the second priority, the two-dimensional code pages corresponding to the two-dimensional code pushing instructions are pushed according to the priority sequence corresponding to the first priority, so that when the first priority of the two-dimensional code page process is smaller than the second priority of the irrelevant process, the two-dimensional code page process is processed in sequence, and the error processing of the necessary process in the current system is avoided, so that the overall performance of the current system is reduced.
In addition, the embodiment of the invention also provides a mobile terminal, which comprises: the two-dimensional code pushing device comprises a memory, a processor and a two-dimensional code pushing program which is stored in the memory and can run on the processor, wherein the two-dimensional code pushing program realizes the following operations when being executed by the processor:
when a two-dimensional code pushing instruction is received, acquiring a two-dimensional code page process corresponding to the two-dimensional code pushing instruction;
acquiring a first priority of the two-dimensional code page process;
and pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
Acquiring the marking information of the two-dimensional code page process;
and determining the first priority of the two-dimensional code page process according to the marking information.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
determining an ongoing irrelevant process in a current processor, and acquiring a second priority of the irrelevant process;
and pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority and the second priority.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
acquiring an association process related to the two-dimensional code page process in the current processor;
and screening irrelevant processes currently in the processor according to the associated processes.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
acquiring the memory occupation information of a current processor;
and determining an association process related to the two-dimensional code page process in the current processor according to the memory occupation information.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
determining the level of the first priority and the second priority;
And when the first priority is not smaller than the second priority, performing invalidation processing on the irrelevant process, and preferentially pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
acquiring traffic occupation information of the irrelevant process;
and adjusting the occupied flow of the irrelevant process according to the flow occupied information.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
and when the first priority is smaller than the second priority, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the priority sequence corresponding to the first priority.
In addition, the embodiment of the invention also provides a computer readable storage medium, wherein the computer readable storage medium is stored with a two-dimensional code pushing program, and the two-dimensional code pushing program realizes the following operations when being executed by a processor:
when a two-dimensional code pushing instruction is received, acquiring a two-dimensional code page process corresponding to the two-dimensional code pushing instruction;
acquiring a first priority of the two-dimensional code page process;
and pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
acquiring the marking information of the two-dimensional code page process;
and determining the first priority of the two-dimensional code page process according to the marking information.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
determining an ongoing irrelevant process in a current processor, and acquiring a second priority of the irrelevant process;
and pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority and the second priority.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
acquiring an association process related to the two-dimensional code page process in the current processor;
and screening irrelevant processes currently in the processor according to the associated processes.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
acquiring the memory occupation information of a current processor;
and determining an association process related to the two-dimensional code page process in the current processor according to the memory occupation information.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
Determining the level of the first priority and the second priority;
and when the first priority is not smaller than the second priority, performing invalidation processing on the irrelevant process, and preferentially pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
acquiring traffic occupation information of the irrelevant process;
and adjusting the occupied flow of the irrelevant process according to the flow occupied information.
Further, when the two-dimensional code pushing program is executed by the processor, the following operations are further realized:
and when the first priority is smaller than the second priority, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the priority sequence corresponding to the first priority.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The foregoing embodiment numbers of the present invention are merely for the purpose of description, and do not represent the advantages or disadvantages of the embodiments.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) comprising instructions for causing a terminal (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the method according to the embodiments of the present invention.
The embodiments of the present invention have been described above with reference to the accompanying drawings, but the present invention is not limited to the above-described embodiments, which are merely illustrative and not restrictive, and many forms may be made by those having ordinary skill in the art without departing from the spirit of the present invention and the scope of the claims, which are to be protected by the present invention.
Claims (9)
1. The two-dimensional code pushing method is characterized by comprising the following steps of:
when a two-dimensional code pushing instruction is received, a two-dimensional code page process corresponding to the two-dimensional code pushing instruction is obtained, wherein the two-dimensional code pushing instruction is triggered based on a vehicle fee payment application page in a preset user terminal;
acquiring a first priority of the two-dimensional code page process;
pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority;
the step of obtaining the first priority of the two-dimensional code page process comprises the following steps:
the method comprises the steps of obtaining marking information of a two-dimensional code page process, wherein the marking information comprises marking information of a white list, and a two-dimensional code page marked as the white list is a very fast starting page;
when the marking information is the marking information of the white list, determining a first priority of the two-dimensional code page process, and determining the first priority as the highest priority, wherein the corresponding two-dimensional code page is a very fast starting page.
2. The two-dimensional code pushing method according to claim 1, wherein the step of pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority comprises:
Determining an ongoing irrelevant process in a current processor, and acquiring a second priority of the irrelevant process;
and pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority and the second priority.
3. The two-dimensional code pushing method according to claim 2, wherein the step of determining an irrelevant process currently in progress in the processor comprises:
acquiring an association process related to the two-dimensional code page process in the current processor;
and screening irrelevant processes currently in the processor according to the associated processes.
4. The two-dimensional code pushing method as set forth in claim 3, wherein the step of acquiring an association process related to the two-dimensional code page process in the current processor comprises:
acquiring the memory occupation information of a current processor;
and determining an association process related to the two-dimensional code page process in the current processor according to the memory occupation information.
5. The two-dimensional code pushing method according to claim 2, wherein the step of pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the first priority and the second priority comprises:
Determining the level of the first priority and the second priority;
and when the first priority is not smaller than the second priority, performing invalidation processing on the irrelevant process, and preferentially pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction.
6. The two-dimensional code pushing method according to claim 5, wherein the step of invalidating the unrelated process comprises:
acquiring traffic occupation information of the irrelevant process;
and adjusting the occupied flow of the irrelevant process according to the flow occupied information.
7. The two-dimensional code pushing method according to claim 5, wherein after the step of determining the level of the first priority and the second priority, the two-dimensional code pushing method further comprises:
and when the first priority is smaller than the second priority, pushing the two-dimensional code page corresponding to the two-dimensional code pushing instruction according to the priority sequence corresponding to the first priority.
8. A mobile terminal, the mobile terminal comprising: the two-dimensional code pushing device comprises a memory, a processor and a two-dimensional code pushing program which is stored in the memory and can run on the processor, wherein the two-dimensional code pushing program realizes the steps of the two-dimensional code pushing method according to any one of claims 1 to 7 when being executed by the processor.
9. A computer-readable storage medium, wherein a two-dimensional code pushing program is stored on the computer-readable storage medium, and the two-dimensional code pushing program, when executed by a processor, implements the steps of the two-dimensional code pushing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810825394.2A CN108805559B (en) | 2018-07-25 | 2018-07-25 | Two-dimensional code pushing method, mobile terminal and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810825394.2A CN108805559B (en) | 2018-07-25 | 2018-07-25 | Two-dimensional code pushing method, mobile terminal and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108805559A CN108805559A (en) | 2018-11-13 |
| CN108805559B true CN108805559B (en) | 2023-12-15 |
Family
ID=64078012
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810825394.2A Active CN108805559B (en) | 2018-07-25 | 2018-07-25 | Two-dimensional code pushing method, mobile terminal and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108805559B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266637A (en) * | 2019-04-30 | 2019-09-20 | 努比亚技术有限公司 | A kind of network request control method, terminal and computer readable storage medium |
| CN114153358B (en) * | 2021-11-16 | 2024-12-13 | 中电信数智科技有限公司 | Barcode display method, device, electronic device and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104125220A (en) * | 2014-07-08 | 2014-10-29 | 上海仪电智能电子有限公司 | Method for achieving rapid data exchange and response of cell phone application and background database |
| WO2015175619A1 (en) * | 2014-05-15 | 2015-11-19 | Alibaba Group Holdiing Limited | Method, apparatus, and system for operating an electronic account in connection with an electronic transaction |
| CN105337946A (en) * | 2014-08-13 | 2016-02-17 | 阿里巴巴集团控股有限公司 | Webpage forgery prevention verification method and device |
| CN106445660A (en) * | 2016-09-12 | 2017-02-22 | 广东欧珀移动通信有限公司 | Application control method of mobile terminal and mobile terminal |
| CN107402804A (en) * | 2017-07-31 | 2017-11-28 | 广东欧珀移动通信有限公司 | Background process control method, device, storage medium and electronic device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2015191507A (en) * | 2014-03-28 | 2015-11-02 | ソニー株式会社 | Information processing device and program |
-
2018
- 2018-07-25 CN CN201810825394.2A patent/CN108805559B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015175619A1 (en) * | 2014-05-15 | 2015-11-19 | Alibaba Group Holdiing Limited | Method, apparatus, and system for operating an electronic account in connection with an electronic transaction |
| CN104125220A (en) * | 2014-07-08 | 2014-10-29 | 上海仪电智能电子有限公司 | Method for achieving rapid data exchange and response of cell phone application and background database |
| CN105337946A (en) * | 2014-08-13 | 2016-02-17 | 阿里巴巴集团控股有限公司 | Webpage forgery prevention verification method and device |
| CN106445660A (en) * | 2016-09-12 | 2017-02-22 | 广东欧珀移动通信有限公司 | Application control method of mobile terminal and mobile terminal |
| CN107402804A (en) * | 2017-07-31 | 2017-11-28 | 广东欧珀移动通信有限公司 | Background process control method, device, storage medium and electronic device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108805559A (en) | 2018-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112004173B (en) | Bluetooth headset switching method, mobile terminal and computer readable storage medium | |
| CN108391025B (en) | Network access management method, mobile terminal and computer readable storage medium | |
| CN110784898B (en) | Network switching method, mobile terminal and computer readable storage medium | |
| CN109618316B (en) | Network sharing method, mobile terminal and storage medium | |
| CN109890022B (en) | Data transmission control method, mobile terminal and computer readable storage medium | |
| CN108512625B (en) | Anti-interference method for camera, mobile terminal and storage medium | |
| CN107027114A (en) | A kind of SIM card switching method, equipment and computer-readable recording medium | |
| CN109195143B (en) | Network access method, mobile terminal and readable storage medium | |
| CN109195213B (en) | Mobile terminal screen control method, mobile terminal and computer readable storage medium | |
| CN110113779B (en) | eSIM card testing method, system and medium | |
| CN109144705B (en) | Application management method, mobile terminal and computer readable storage medium | |
| CN112667339B (en) | Screen refresh rate setting method, terminal and computer readable medium | |
| CN109753210B (en) | Information display method of mobile terminal, mobile terminal and readable storage medium | |
| CN110096375B (en) | Method and device for sharing data by application programs and computer readable storage medium | |
| CN112433690B (en) | Data processing method, terminal and computer readable storage medium | |
| CN112770279B (en) | Network sharing method, mobile terminal and computer readable storage medium | |
| CN112866804B (en) | Screen projection self-adaption method, mobile terminal and readable storage medium | |
| CN111970738B (en) | Network switching control method, device and computer readable storage medium | |
| CN109711850B (en) | Secure payment method, device and computer readable storage medium | |
| CN108805559B (en) | Two-dimensional code pushing method, mobile terminal and computer readable storage medium | |
| CN109389394B (en) | Multi-screen payment control method, equipment and computer readable storage medium | |
| CN112947831B (en) | Screen-throwing reverse control method, mobile terminal and computer readable storage medium | |
| CN113301251B (en) | Auxiliary shooting method, mobile terminal and computer readable storage medium | |
| CN112888084B (en) | Full-band communication method and device and mobile terminal | |
| CN109740374B (en) | Hiding method, mobile terminal and computer readable 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |