CN109582295B - Data processing method and device, storage medium and processor - Google Patents
Data processing method and device, storage medium and processor Download PDFInfo
- Publication number
- CN109582295B CN109582295B CN201710894921.0A CN201710894921A CN109582295B CN 109582295 B CN109582295 B CN 109582295B CN 201710894921 A CN201710894921 A CN 201710894921A CN 109582295 B CN109582295 B CN 109582295B
- Authority
- CN
- China
- Prior art keywords
- value
- boolean
- boolean value
- sequence
- values
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/31—Programming languages or programming paradigms
- G06F8/313—Logic programming, e.g. PROLOG programming language
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Stored Programmes (AREA)
Abstract
The invention discloses a data processing method, a data processing device, a storage medium and a processor, which are used for acquiring a Boolean value sequence consisting of a plurality of Boolean values arranged in sequence. And carrying out binary conversion on the Boolean value sequence to obtain a first numerical value. Acquiring information of an updated Boolean value, wherein the information of the updated Boolean value comprises position information of the updated Boolean value in the Boolean value sequence, and the updated Boolean value is obtained by processing the Boolean value sequence. And generating a second numerical value according to the position information, and performing operation corresponding to the processing type by using the first numerical value and the second numerical value to obtain a third numerical value. That is, the boolean value sequence is processed as a whole and is no longer processed for a single boolean value. At the code level, compared with the iterative operation of a single Boolean value, the operation between numerical values has the advantages of simpler code and higher execution efficiency.
Description
Technical Field
The present invention relates to the field of electronic information, and in particular, to a data processing method, apparatus, storage medium, and processor.
Background
The boolean value includes two values, true and false, where true may be represented by 0 and false may be represented by 1. In the processing of a data set composed of a plurality of boolean values, it is common to process each boolean value separately in a code level by using a loop iteration method.
For example, in fig. 1, the seat selection data acquired by the display side as the front end from the server as the back end is typically an array consisting of a plurality of boolean values. Each value in the array corresponds to a seat, the Boolean value of the selected seat is 1, and the Boolean value of the unselected seat is 0. The display terminal displays according to the array, namely the Boolean value is 1 and shows the selected state, and the Boolean value is 0 and shows the unselected state.
When a seat is selected again or the selected seat is released, the boolean value in the array changes, and the display end needs to acquire the latest data set to update the display. And the display terminal acquires the changed Boolean values from the server according to the interactive operation of the user and/or updates the array by using the changed Boolean values.
No matter a plurality of Boolean values are updated in parallel or in series, the granularity of execution is one Boolean value at the code level, and the execution efficiency is often not high.
Therefore, how to improve the efficiency of processing multiple boolean values is a problem that needs to be solved.
Disclosure of Invention
In view of the above, the present invention has been made to provide a data processing method, apparatus, storage medium and processor that overcome or at least partially solve the above-mentioned problems.
A method of data processing, comprising:
acquiring a Boolean value sequence, wherein the Boolean value sequence is a sequence formed by a plurality of Boolean values arranged in sequence;
carrying out binary conversion on the Boolean value sequence to obtain a first numerical value;
acquiring updated information of the Boolean values, wherein the updated information of the Boolean values comprises position information of the updated Boolean values in the Boolean value sequence, and the updated Boolean values are obtained by processing the Boolean value sequence;
generating a second numerical value according to the position information, wherein the second numerical value is a sequence conversion numerical value which has the same length with the Boolean value sequence and has a first preset value as the numerical value of the position indicated by the position information and a second preset value as the numerical value of other positions;
and performing operation corresponding to the processing type by using the first numerical value and the second numerical value to obtain a third numerical value.
Optionally, the first value and the second value have the same scale.
Optionally, the first numerical value and the second numerical value are both hexadecimal numerical values.
Optionally, the updated boolean value information further includes:
updated boolean values.
Optionally, before the performing the operation corresponding to the type of the processing by using the first numerical value and the second numerical value, the method further includes:
determining the type of the processing by comparing the Boolean values before and after the updating;
and determining the operation corresponding to the processing type according to a preset corresponding relation.
A data processing apparatus comprising:
the device comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a Boolean value sequence which is a sequence formed by a plurality of Boolean values arranged in sequence;
the conversion module is used for carrying out binary conversion on the Boolean value sequence to obtain a first numerical value;
a second obtaining module, configured to obtain information of an updated boolean value, where the information of the updated boolean value includes position information of the updated boolean value in the boolean value sequence, and the updated boolean value is obtained by processing the boolean value sequence;
a generating module, configured to generate a second numerical value according to the position information, where the second numerical value is a sequence-converted numerical value having a length same as that of the boolean value sequence and indicating a position with a first preset value as a numerical value of the position indicated by the position information and indicating a second preset value as numerical values of other positions;
and the operation module is used for performing operation corresponding to the processing type by using the first numerical value and the second numerical value to obtain a third numerical value.
Optionally, the first value and the second value have the same scale;
the first and second values are hexadecimal values.
Optionally, the method further includes:
and the determining module is used for determining the processing type by comparing the Boolean values before and after updating before and after the operation module is used for performing the operation corresponding to the processing type by using the first numerical value and the second numerical value to obtain a third numerical value, and determining the operation corresponding to the processing type according to a preset corresponding relation.
A storage medium comprising a stored program, wherein the program executes the above-described data processing method.
A processor for executing a program, wherein the program executes the data processing method described above. By means of the technical scheme, the data processing method, the data processing device, the storage medium and the processor provided by the invention process the Boolean value sequence as a whole, and do not process a single Boolean value as an object any more. That is, the processing of the boolean values is converted into the operation between the numerical values, and at the code level, the operation between the numerical values is simpler in code and higher in execution efficiency than the iterative operation of a single boolean value.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
FIG. 1 illustrates a scenario of online seating;
FIG. 2 shows a flow of a data processing method disclosed in an embodiment of the present application;
fig. 3 shows a data processing apparatus disclosed in an embodiment of the present application.
Detailed Description
The data processing method disclosed in the embodiment of the application can be applied to the display end shown in fig. 1, and the processing on each boolean value is converted into operation on numerical values by converting the ordered sequence formed by the boolean values into the numerical values, so that the processing efficiency on a boolean value array is improved.
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
Fig. 2 is a data processing method disclosed in an embodiment of the present application, including the following steps:
s201: and acquiring a Boolean value sequence from the server, wherein the Boolean value sequence is a sequence formed by a plurality of Boolean values arranged in sequence.
For example, the boolean value sequence is 100.
S202: and carrying out binary conversion on the Boolean value sequence to obtain a first numerical value.
Alternatively, the binary may be binary, decimal, hexadecimal, etc. Since the hexadecimal values take up less memory space, it is preferable to use hexadecimal, i.e. to convert a plurality of ordered boolean values into hexadecimal values.
In essence, the boolean sequence is a binary sequence, and a specific way of converting the binary sequence into a hexadecimal value may be referred to in the prior art, which is not described herein again.
Following the above example, for ease of illustration, the Boolean value sequence 100 is converted to a decimal value of 256.
S203: and acquiring the position information of the updated Boolean values in the Boolean value sequence.
Because the boolean values in the boolean sequence are processed, updated boolean values are generated. I.e. the processing results in an update of the boolean value.
The updated boolean location information may be obtained from a server or through interaction with a user on a display interface.
In the above example, if the sequence numbers of the boolean values from left to right are 0, 1, and 2, respectively, and the last boolean value is updated from 0 to 1, the updated position information of the boolean value is the sequence number 2.
S204: and generating an increment value according to the position information.
Specifically, the increment sequence may be generated first, and then converted into an increment value using the same system as in S202. The increment sequence is a sequence which has the same length with the Boolean value sequence and takes the numerical value of the position indicated by the position information as a first preset value and the numerical values of other positions as second preset values.
Specifically, in this embodiment, the first preset value is 1, and the second preset value is 0.
In the above example, if the last bit of the boolean value sequence 100 is updated to 1, the increment sequence is 001, and the increment value converted from the increment sequence is 1.
In order to distinguish the increment value from the value of the boolean value sequence obtained in S202, in this embodiment, the value of the boolean value sequence obtained in S202 is referred to as a first value, and the increment value is referred to as a second value.
Optionally, the second value and the first value are in the same scale.
S205: and performing operation corresponding to the processing type by using the first numerical value and the second numerical value to obtain a third numerical value.
As described above, since the boolean value is processed, an updated boolean value is generated. I.e. the processing results in an update of the boolean value.
The types of processing are different, and the corresponding operations are different. Which processing type corresponds to which operation can be set according to actual requirements. For boolean processing, the most common types of processing include: the boolean value is updated from 0 to 1 or from 1 to 0. In this embodiment, the preset operation and processing type operation relationship is as follows: the operation type corresponding to the update of the Boolean value from 0 to 1 is addition, and the processing type corresponding to the update of the Boolean value from 1 to 0 is subtraction.
In the above example, the first value of the boolean value sequence 100 is 256, the second value of the increment value is 1, and the operation type corresponding to the boolean value updated from 0 to 1 is addition, so the third value is 257.
Alternatively, which process is performed may be determined by comparing the boolean values before and after the update. For example, if the boolean value is updated from 0 to 1, the processing type is determined to be addition. In this case, the updated boolean value also needs to be acquired.
Optionally, in S203, the updated boolean value and the location information of the updated boolean value may be acquired together. Assuming that the sequence numbers of the boolean value sequence from left to right are 0, 1, and 2 in order, and the last boolean value is updated from 0 to 1, the updated boolean value is also acquired as 1 in addition to the position information of the updated boolean value being acquired as the sequence number 2.
S206: the third value is converted into a boolean value sequence.
At this point, the processing for the boolean value is completed.
In the above example, the hexadecimal 257 is converted into the boolean value sequence of 101, and the last bit is updated from 0 to 1 as compared with the boolean value sequence 100 corresponding to the first numerical value, so that the update of the boolean value can be correctly restored by the operation between the numerical values.
As can be seen from the process shown in fig. 2, in this embodiment, the boolean value sequence is processed as a whole, and is not processed with a single boolean value as an object. That is, the processing of the boolean values is converted into the operation between the numerical values, and at the code level, the operation between the numerical values is simpler in code and higher in execution efficiency than the iterative operation of a single boolean value.
The following takes the movie on-line seat selection system shown in fig. 1 as an example, and illustrates the process shown in fig. 1 and the beneficial effects that can be achieved.
The display terminal a acquires selection data of a seat of one of the auditoriums, i.e. the array shown in fig. 1, from the server. And the display terminal A displays the seating chart according to the array, wherein the selected state is displayed when the Boolean value is 1, and the unselected state is displayed when the Boolean value is 0. When a user selects a certain seat, the terminal A is displayed and the Boolean value corresponding to the selected seat is further changed.
The display end A receives an operation instruction of a row one number (corresponding to the position serial number (1, 1)) of seats selected by a user, the display end B receives a deselection instruction of the row three number (corresponding to the position serial number (1, 3)) of the seats selected by the user, the display end A and the display end B both send the received instruction to the server, and the server updates the Boolean value in the array. The display terminal A receives the information which is sent by the server and updates the Boolean value of the (1, 3) position from 1 to 0.
The display terminal a takes the array shown in fig. 1 as a binary sequence 011000100 according to the sequence of top to bottom and left to right (i.e. according to the sequence of the position sequence numbers), and converts the binary sequence into a hexadecimal value c 4.
The display end A generates an increment numerical value of 104 according to an operation instruction of a row of seats with the first number (corresponding to the position serial number (1, 1) in the array) selected by a user, and determines that the corresponding operation is addition.
And the display end A generates an increment numerical value of 44 according to the information which is sent by the server and updates the Boolean value of the (1, 3) position from 1 to 0, and determines that the corresponding operation is subtraction.
The display end A carries out calculation: c4+ 104-44-184.
Display terminal a converts 184 to binary sequence 110000100 and displays the seat selected according to the boolean value in the binary sequence.
It can be seen that the condition of the seat finally displayed is consistent with the operation result of the user.
Here, only two clients and two seats are taken as an example for description, and the effect of the efficiency indication of the method of replacing an individual with a whole and replacing an iterative operation with a numerical operation according to the embodiment of the present application becomes more obvious as the number of operated seats is larger as the number of display terminals is larger.
Fig. 3 is a data processing apparatus disclosed in an embodiment of the present application, including: the device comprises a first acquisition module, a conversion module, a second acquisition module, a generation module and an operation module.
The first obtaining module is used for obtaining a Boolean value sequence, and the Boolean value sequence is a sequence formed by a plurality of Boolean values arranged in sequence. The conversion module is used for carrying out the binary conversion on the Boolean value sequence to obtain a first numerical value. The second obtaining module is configured to obtain information of an updated boolean value, where the information of the updated boolean value includes position information of the updated boolean value in the boolean value sequence, and the updated boolean value is obtained by processing the boolean value sequence. The generating module is used for generating a second numerical value according to the position information, wherein the second numerical value is a sequence conversion numerical value which has the same length with the Boolean value sequence and has the position numerical value indicated by the position information as a first preset value and the numerical values of other positions as second preset values. And the operation module is used for performing operation corresponding to the processing type by using the first numerical value and the second numerical value to obtain a third numerical value.
For specific implementation of the functions of the above modules, reference may be made to the above method embodiments, which are not described herein again.
The embodiment of the application also discloses a data processing device. The data processing device comprises a processor and a memory, wherein the first acquisition module, the conversion module, the second acquisition module, the generation module, the operation module and the like are stored in the memory as program modules, and the processor executes the program modules stored in the memory to realize corresponding functions.
The processor comprises a kernel, and the kernel calls the corresponding program unit from the memory. The kernel can be set to be one or more, and the efficiency of processing a plurality of Boolean values is improved by adjusting the kernel parameters.
The memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.
The data processing device converts the Boolean value sequence into the numerical values, realizes the Boolean value processing through the operation among the numerical values, and converts the processed granularity from the Boolean value to the Boolean value sequence so as to improve the processing efficiency.
The present application further provides a computer program product adapted to perform program code for initializing the following method steps when executed on a data processing device: and acquiring a Boolean value sequence which is a sequence formed by a plurality of Boolean values arranged in sequence. And carrying out binary conversion on the Boolean value sequence to obtain a first numerical value. Acquiring information of an updated Boolean value, wherein the information of the updated Boolean value comprises position information of the updated Boolean value in the Boolean value sequence, and the updated Boolean value is obtained by processing the Boolean value sequence. And generating a second numerical value according to the position information, wherein the second numerical value is a sequence conversion numerical value which has the same length with the Boolean value sequence and has the position value indicated by the position information as a first preset value and the other positions as second preset values. And performing operation corresponding to the processing type by using the first numerical value and the second numerical value to obtain a third numerical value.
The embodiment of the application also discloses a storage medium, which comprises a stored program, wherein the program executes the data processing method shown in fig. 1.
The embodiment of the application also discloses a processor, wherein the processor is used for running the program, and the data processing method shown in fig. 1 is executed when the program runs.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and so forth) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (10)
1. A data processing method is characterized in that the data processing method is applied to a movie online seating system and comprises the following steps:
the display end displays a seat map according to the array, receives an operation instruction of a user for selecting a seat and sends the operation instruction to the server, each numerical value in the array corresponds to one seat, the Boolean value of the selected seat is 1, and the Boolean value of the unselected seat is 0;
the method comprises the steps that a server obtains a Boolean value sequence, wherein the Boolean value sequence is a sequence formed by a plurality of Boolean values which are arranged in sequence;
the server carries out binary conversion on the Boolean value sequence to obtain a first numerical value;
the server acquires updated information of the Boolean values, wherein the updated information of the Boolean values comprises position information of the updated Boolean values in the Boolean value sequence, and the updated Boolean values are obtained by processing the Boolean value sequence;
the server generates a second numerical value according to the position information, wherein the second numerical value is a sequence conversion numerical value which has the same length with the Boolean value sequence and has the position numerical value indicated by the position information as a first preset value and the numerical values of other positions as second preset values;
the server uses the first numerical value and the second numerical value to carry out operation corresponding to the processing type to obtain a third numerical value, updates the Boolean value in the array and sends the Boolean value to a display end;
the display end receives the Boolean value in the updated array of the server and displays the selected condition of the seat;
wherein, the processing of the Boolean value sequence includes: the method comprises the steps that a display end obtains selection data of a seat of a play hall from a server, the display end displays a seat map according to an array, wherein a Boolean value of 1 is displayed in a selected state, a Boolean value of 0 is displayed in an unselected state, and when a user selects a certain seat, the display end updates the Boolean value corresponding to the selected seat;
the operation corresponding to the processing type comprises the following steps: the preset operation and processing type operation relationship is as follows: the operation type corresponding to the update of the Boolean value from 0 to 1 is addition, and the processing type corresponding to the update of the Boolean value from 1 to 0 is subtraction.
2. The method of claim 1, wherein the first value and the second value are in the same scale.
3. The method of claim 2, wherein the first and second values are hexadecimal values.
4. The method of claim 1, wherein the updated boolean value information further comprises:
an updated boolean value.
5. The method according to any one of claims 1 to 4, further comprising, prior to said performing an operation corresponding to the type of said processing using said first numerical value and said second numerical value:
determining the type of the processing by comparing the Boolean values before and after the updating;
and determining the operation corresponding to the processing type according to a preset corresponding relation.
6. A data processing apparatus, applied to a movie online seating system, comprising:
the display end module is used for displaying the seat map according to the array, receiving an operation instruction of a user for selecting a seat and sending the operation instruction to the server, wherein each numerical value in the array corresponds to one seat, the Boolean value of the selected seat is 1, and the Boolean value of the unselected seat is 0;
the server comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring a Boolean value sequence which is a sequence formed by a plurality of Boolean values arranged in sequence;
the conversion module is used for carrying out the binary conversion on the Boolean value sequence by the server to obtain a first numerical value;
a second obtaining module, configured to obtain, by a server, information of an updated boolean value, where the information of the updated boolean value includes position information of the updated boolean value in the boolean value sequence, and the updated boolean value is obtained by processing the boolean value sequence;
a generating module, configured to generate, by the server, a second numerical value according to the location information, where the second numerical value is a sequence-converted numerical value that has a length that is the same as that of the boolean value sequence and in which a numerical value of a location indicated by the location information is a first preset value and numerical values of other locations are second preset values;
the operation module is used for the server to perform operation corresponding to the processing type by using the first numerical value and the second numerical value to obtain a third numerical value, update the Boolean value in the array and send the updated Boolean value to the display end;
the display end module is used for receiving the Boolean values in the updated array of the server and displaying the selected condition of the seats;
wherein, the processing of the boolean value sequence includes: the method comprises the steps that a display end obtains selection data of a seat of a play hall from a server, the display end displays a seat map according to an array, wherein a Boolean value of 1 is displayed in a selected state, a Boolean value of 0 is displayed in an unselected state, and when a user selects a certain seat, the display end updates the Boolean value corresponding to the selected seat;
the operation corresponding to the processing type comprises the following steps: the preset operation and processing type operation relationship is as follows: the operation type corresponding to the update of the Boolean value from 0 to 1 is addition, and the processing type corresponding to the update of the Boolean value from 1 to 0 is subtraction.
7. The apparatus of claim 6, wherein the first and second values are equal in scale;
the first and second values are hexadecimal values.
8. The apparatus of claim 7, further comprising:
and the determining module is used for determining the processing type by comparing the Boolean values before and after updating before and after the operation module is used for performing the operation corresponding to the processing type by using the first numerical value and the second numerical value to obtain a third numerical value, and determining the operation corresponding to the processing type according to a preset corresponding relation.
9. A storage medium characterized by comprising a stored program, wherein the program executes the data processing method of any one of claims 1 to 5.
10. A processor, characterized in that the processor is configured to run a program, wherein the program is configured to execute the data processing method according to any one of claims 1 to 5 when running.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710894921.0A CN109582295B (en) | 2017-09-28 | 2017-09-28 | Data processing method and device, storage medium and processor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710894921.0A CN109582295B (en) | 2017-09-28 | 2017-09-28 | Data processing method and device, storage medium and processor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109582295A CN109582295A (en) | 2019-04-05 |
| CN109582295B true CN109582295B (en) | 2022-06-21 |
Family
ID=65912633
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710894921.0A Active CN109582295B (en) | 2017-09-28 | 2017-09-28 | Data processing method and device, storage medium and processor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109582295B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114189554B (en) * | 2021-11-17 | 2023-09-15 | 中国兵器工业计算机应用技术研究所 | Information interaction method, device and readable storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103581087A (en) * | 2013-11-21 | 2014-02-12 | 电子科技大学 | Binary digital signal space shift keying modulation and demodulation method for multi-input multi-output system |
| CN105023235A (en) * | 2015-07-09 | 2015-11-04 | 哈尔滨工程大学 | Electronic chart watermarking method based on space redundancy relation |
| CN105518737A (en) * | 2015-06-05 | 2016-04-20 | 广州华多网络科技有限公司 | Online seat-selecting social interaction method and system |
| RU2015105811A (en) * | 2015-02-20 | 2016-09-10 | Закрытое акционерное общество "Лаборатория Касперского" | Confidential Data Entry Method |
| CN106170761A (en) * | 2012-09-27 | 2016-11-30 | 英特尔公司 | For the method and apparatus instructing across the scheduling storage of multiple atomic regions in Binary Conversion |
| CN106650973A (en) * | 2016-12-26 | 2017-05-10 | 北京微影时代科技有限公司 | Seat selection method and device |
| CN106934441A (en) * | 2017-03-26 | 2017-07-07 | 袁昕喆 | A kind of multidimensional code and its coding and decoding methods |
| CN106933480A (en) * | 2017-03-27 | 2017-07-07 | 北京微影时代科技有限公司 | Seat method and device is selected in a kind of online booking |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9318108B2 (en) * | 2010-01-18 | 2016-04-19 | Apple Inc. | Intelligent automated assistant |
| CN105512564B (en) * | 2014-10-15 | 2019-01-25 | 阿里巴巴集团控股有限公司 | A kind of anti-tamper verification method of data and device |
| CN106933640B (en) * | 2017-04-26 | 2020-12-25 | 携程旅游网络技术（上海）有限公司 | Method and system for loading Web page in browser of mobile terminal |
-
2017
- 2017-09-28 CN CN201710894921.0A patent/CN109582295B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106170761A (en) * | 2012-09-27 | 2016-11-30 | 英特尔公司 | For the method and apparatus instructing across the scheduling storage of multiple atomic regions in Binary Conversion |
| CN103581087A (en) * | 2013-11-21 | 2014-02-12 | 电子科技大学 | Binary digital signal space shift keying modulation and demodulation method for multi-input multi-output system |
| RU2015105811A (en) * | 2015-02-20 | 2016-09-10 | Закрытое акционерное общество "Лаборатория Касперского" | Confidential Data Entry Method |
| CN105518737A (en) * | 2015-06-05 | 2016-04-20 | 广州华多网络科技有限公司 | Online seat-selecting social interaction method and system |
| CN105023235A (en) * | 2015-07-09 | 2015-11-04 | 哈尔滨工程大学 | Electronic chart watermarking method based on space redundancy relation |
| CN106650973A (en) * | 2016-12-26 | 2017-05-10 | 北京微影时代科技有限公司 | Seat selection method and device |
| CN106934441A (en) * | 2017-03-26 | 2017-07-07 | 袁昕喆 | A kind of multidimensional code and its coding and decoding methods |
| CN106933480A (en) * | 2017-03-27 | 2017-07-07 | 北京微影时代科技有限公司 | Seat method and device is selected in a kind of online booking |
Non-Patent Citations (4)
| Title |
|---|
| O2O模式下电影在线选座系统的设计与实现;武依文;《中国优秀硕士学位论文全文数据库 (信息科技辑)》;20170115;I138-321 * |
| 一种最优（k,p）进制转换算法;陈嘉勇;《应用科学学报 信号与信息处理》;20140221(第6期);569-578 * |
| 在线选座系统的设计与实现;谢光;《信息与电脑 软件开发与应用》;20161116;99-100 * |
| 基于条码识别的爱拍购物车和图书馆座位预订系统设计;李远青;《中国优秀硕士学位论文全文数据库 (信息科技辑)》;20141115;I138-396 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109582295A (en) | 2019-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11468366B2 (en) | Parallel development and deployment for machine learning models | |
| CN108932257B (en) | Multi-dimensional data query method and device | |
| US20180365523A1 (en) | Method and system for training machine learning system | |
| KR102111871B1 (en) | Method and apparatus for generating random string | |
| CN108228443B (en) | Web application testing method and device | |
| US20110138236A1 (en) | Apparatus and method for providing visual interface for information of error generated in multithread testing | |
| KR20180002758A (en) | DATA PROCESSING METHOD AND SYSTEM | |
| CN109426415B (en) | Method and device for generating cascade selector | |
| CN110888922A (en) | Method and device for creating target table during data synchronization | |
| CN109582295B (en) | Data processing method and device, storage medium and processor | |
| CN106886510B (en) | Method and device for displaying chart | |
| CN110019974B (en) | Chart drill-down implementation method and device | |
| CN108241620B (en) | Query script generation method and device | |
| CN106843819B (en) | Object serialization method and device | |
| CN117473949A (en) | Form dynamic layout method and system | |
| US9911217B2 (en) | Animation arrangement | |
| CN110058996B (en) | Program debugging method, device, equipment and storage medium | |
| CN110019357B (en) | Database query script generation method and device | |
| CN107562533B (en) | Data loading processing method and device | |
| CN114253845A (en) | Automatic testing method and device for special-shaped architecture integration system | |
| US10282810B2 (en) | Rendering illustrations using a two-dimensional rendering engine | |
| CN108073594B (en) | Method and device for generating thermodynamic diagram | |
| CN107122303B (en) | Test method and device | |
| CN110888865A (en) | Data processing method and device based on one-way linked list | |
| CN110704517B (en) | Method and device for generating task, storage medium and processor |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 100080 No. 401, 4th Floor, Haitai Building, 229 North Fourth Ring Road, Haidian District, Beijing Applicant after: Beijing Guoshuang Technology Co.,Ltd. Address before: 100086 Beijing city Haidian District Shuangyushu Area No. 76 Zhichun Road cuigongfandian 8 layer A Applicant before: Beijing Guoshuang Technology Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |