CN109840755A - A kind of financial payment data inputting robot - Google Patents
A kind of financial payment data inputting robot Download PDFInfo
- Publication number
- CN109840755A CN109840755A CN201910140720.0A CN201910140720A CN109840755A CN 109840755 A CN109840755 A CN 109840755A CN 201910140720 A CN201910140720 A CN 201910140720A CN 109840755 A CN109840755 A CN 109840755A
- Authority
- CN
- China
- Prior art keywords
- robot
- data
- opt
- financial payment
- payment data
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 claims abstract description 22
- 238000003780 insertion Methods 0.000 claims abstract description 8
- 230000037431 insertion Effects 0.000 claims abstract description 8
- 238000006243 chemical reaction Methods 0.000 claims description 8
- 238000012546 transfer Methods 0.000 claims description 7
- 238000010276 construction Methods 0.000 claims description 4
- 238000013461 design Methods 0.000 description 11
- 238000012545 processing Methods 0.000 description 4
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012795 verification Methods 0.000 description 2
- 241000406668 Loxodonta cyclotis Species 0.000 description 1
- 238000012938 design process Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 239000003292 glue Substances 0.000 description 1
- 230000009191 jumping Effects 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 238000012958 reprocessing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Landscapes
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The invention discloses a kind of financial payment data inputting robots, including entity USB flash disk, financial payment data inputting robot system is equipped in the entity USB flash disk, after the insertion of financial payment data inputting robot is equipped with the host of robot wake up procedure, robot starting, imitate staff's logging data, robot wake up procedure includes Timer timer, and timer at regular intervals, executes following logic: whether the robot for detecting certification is inserted into, if it is, starting robot；If it is not, then closing all robot processes.The advantages of the present invention over the prior art are that: by this robot, 2 employee's darg amounts can be completed with 1 hour, greatly improve working efficiency, and valuable human resources are saved for unit.
Description
Technical field
The present invention relates to secure payment field, in particular to a kind of financial payment data inputting robots.
Background technique
In recent years, the development of scientific and technical fast development, especially computer technology, the great convenience work of people
And life, along with the promotion of the demand and living standard of people's work, computer user's quantity is in global explosive increasing
It is long, while producing that large amount of data information is to be handled, this allows for people and the capability requirement of computer is continuously improved,
Around how improve data processing, data manipulation, data reprocessing ability, the present invention to data automatic processing expansion grind
Study carefully.
Using telephone exchange as the finite automata of principle example, it is the basis of automaton theory, is also applied to simultaneously
It automatically controls, in biosystem, automaton theory is a kind of using the construction of discrete mathematics system, effect and relationship as research pair
The mathematical theory of elephant, automatic machine are the mathematical models of finite state machine (FSM), and FSM is given symbol input, according to transfer function
A kind of machine of " jumping " excessively a series of states, state of automata have beginning state and end state, and the present invention is provided with automatic
Entry condition, that is, handshake authentication of machine, handshake authentication model are based on cartesian product, and cartesian product refers in mathematics, two set
The flute card Lovell product (Cartesianproduct) of X and Y, is expressed as X × Y, first object is the member of X and second object is
One of member of all possible ordered pairs of Y, to sum up, the present invention is based on deterministic finite automation (DFA) it is theoretical and
Cartesian product constructs a kind of database preparation robot model.
According to database preparation robot model, the present invention has devised and embodied certain finance payment system data and records automatically
Enter robot.Since certain finance payment system and certain financial system are two sets of independent software systems, this has been resulted in finance
Paying link, there are a disconnections, i.e. financial system can not be obtained effectively and using these settlement informations, at present using artificial
Mode realizes settlement information typing one by one, and working efficiency is low, has been unable to meet the needs of future work.The wealth that the present invention designs
Settlement information in financial system will be transported to finance payment system by political affairs payment data automatic input robot, effectively be solved
Certainly this " disconnection " problem greatly improves working efficiency so that clearing payment information is fully used, so that finance branch
It is more smooth to pay process.
Summary of the invention
The technical problem to be solved by the present invention is to, a kind of wakeup process and robot process be provided in view of the above problems, one
To the financial payment data inputting robot of a certification.
In order to solve the above technical problems, technical solution provided by the invention are as follows: a kind of financial payment data inputting robot,
After financial payment data inputting robot is equipped with the host of robot wake up procedure by USB interface insertion, start to recognize
Card, certification are based on cartesian product handshake authentication model, authenticate successfully, and staff's logging data is imitated in robot starting, described
Financial payment data inputting robot system is equipped in robot, financial payment data inputting robot system is based on DFA data
It is automatically brought into operation model.
The robot is based on cartesian product handshake authentication model:
1. identifying factor set:
T={ t1, t2, t3... ti..., tn}
2. identifying factor relationships:
R={ R1, R2}
3. identifying the factor to divide:
T1=x, y | xR1Y, x ∈ T, y ∈ T }
T2=x, y | xR2Y, x ∈ T, y ∈ T }
4. handshake authentication model
A × B=(a, b) | a ∈ A, b ∈ B, f (b1) ∈ U, g (a1)∈V}
The robot authenticating step are as follows:
1. read machine human sequence number；
2. handshake authentication, identifying machine people；
3. authenticating successfully, start robot.
A kind of financial payment data inputting robot according to claim 1, which is characterized in that the robot base
It is automatically brought into operation model in DFA data, steps are as follows for model construction:
1. information word set U
U={ u1, u2, u3..., un}n∈N
2. set U is divided
R={ r1, r2, r3..., rm}m∈N
Si=x, y | xriY, x ∈ U, y ∈ U, ri∈ R } i≤m, i ∈ N
3. information sequence set LQ
Information sequence is that M- tuple is denoted as Q
Q=<u1, u2, u3...ui..., uM>
Information sequence set LQ
LQ={ <u1, u2, u3...ui..., uM>|ui∈Si}
Information sequence state set
4. information word mode of operation factor set
A={ a ,-a }
Information sequence QA with operation
5. the information sequence set LQA with operation
| LQA |=2M
6. the information sequence QASk that band successively operates:
7. the information sequence set LQAS that band successively operates
LQAS={ QASk}k≤M
| LQAS |=M
8. operational set POpt
Location sets P
P={<x, y>| x, y ∈ N, x≤W, y≤H } W, H is natural number constant；
Operate first set Opt
Opt={ Opt1, Opt2, Opt3... Opti..., OptN}
POpt=p ∧ opt | p ∈ P, opt ∈ Opt }
9. transfer function
NFA conversion:
DFA conversion:
10. initial state and final state
To sum up, model is automatically brought into operation to be described as follows:
The automaton model AOM of non-sequential operation:
AOM=(LQA, POpt, f (QAk, popt), s, F), AOM is NFA；
The automaton model AOM-S successively operated:
AOM-S=(LQAS, POpt, f (QASk, popt), s, F), AOM-S is DFA
The robot data automatic input process step is suddenly as follows:
1. reading in typing file；
2. reading the i-th data；
3. reading j-th of data；
4. simulating mouse-click operation；
5. simulating keyboard data copy operation；
6. j++ is directed toward next data；
It is finished 7. verifying the i-th data and whether reading；
8. finishing if read, i++ is directed toward next data；
It is finished 9. whether verify data file reads；
10. being finished if read, terminate.
The advantages of the present invention over the prior art are that: insertion robot (essence: has the u disk of robot program stationed),
Host processes wake up robot, robot starting, automatic input financial system payment information, " financial payment data inputting machine
People " design has the advantage that 1 partial code is realized by C++, directly generates machine code, prevents core technology from revealing；2 is main
Machine and robot, one-to-one certification.One host, can only authenticate some robot；After certification, which can only be in machine
Upper enabling." financial payment data inputting robot " main performance index: pass through this robot, 2 employee's dargs
Amount, can be completed with 1 hour, greatly improve working efficiency, and valuable human resources are saved for unit.
As an improvement, the robot verification step are as follows:
1. reading USB flash disk sequence number, authentication failed then closing machine people program；
2. read machine human sequence number, authentication failed then closing machine people program；
3. identifying machine people, authentication failed then closing machine people program；
4. starting robot, starting failure is verified since step is 1..
As an improvement, robot program's process are as follows:
1. reading in typing file；
2. reading the i-th data；
3. reading j-th strip data；
4. simulating mouse-click operation；
5. simulating keyboard data copy operation；
6. j++ is directed toward next data；
It is finished 7. verifying the i-th data and whether reading, otherwise return step is 2.；
9. finishing if read, i++ is directed toward next data；
It is finished 10. whether verify data file reads, otherwise return step is 3.；
If reading finishes, terminate.
Detailed description of the invention
Fig. 1 is a kind of one-to-one identifying procedure schematic diagram of financial payment data inputting robot.
Fig. 2 is a kind of financial payment data inputting robot wake up procedure flow chart.
Fig. 3 is a kind of financial payment data inputting robot program's flow chart.
Specific embodiment
Present invention will be described in further detail below with reference to the accompanying drawings.
In the specific implementation, the present invention provides a kind of financial payment data inputting robots in view of the above problems by the present invention
And its scheme of the invention.
In order to solve the above technical problems, technical solution provided by the invention are as follows: financial payment data inputting robot
After the host of robot wake up procedure is installed by USB interface insertion, start to authenticate, certification is based on cartesian product handshake authentication
Model authenticates successfully, robot starting, imitates staff's logging data, is equipped with financial payment data in the robot and records
Enter robot system, financial payment data inputting robot system is based on DFA data and is automatically brought into operation model.
One model construction
(1), cartesian product handshake authentication model
This modelling is based on cartesian product theory, and for designing the entry condition of automatic machine, successfully automatic machine of shaking hands is opened
It is dynamic.
1 mark factor set:
T={ t1,t2,t3,...ti...,tn}
2 mark factor relationships:
R={ R1,R2}
The 3 mark factors divide:
T1=x, y | xR1y,x∈T,y∈T}
T2=x, y | xR2y,x∈T,y∈T}
4 handshake authentication models
A × B=(a, b) | a ∈ A, b ∈ B, f (b1)∈U,g(a1)∈V}
Wherein b1、a1The 1st metadata respectively in element (triple)
A × B is can handshake authentication set
(2), model is automatically brought into operation based on DFA data
Deterministic finite automation
It is by the state set Q of a nonempty finite；
∑ one input alphabet (character set of nonempty finite)；
One δ: Q × ∑ of transfer function → Q (such as: δ (q, σ)=p, (p, q ∈ Q, σ ∈ ∑))；
One beginning state s ∈ Q；
One receives the set of state
Composed 5- tuple.Therefore a DFA can be write as such form [1]:
1 information word set U
U={ u1, u2, u3..., un}n∈N
2 set U are divided
The division of equivalence class is based on following theorem: the equivalence relation that R is defined on set A is set, then the equivalence class structure of R
At the division of S.
R={ r1, r2, r3..., rm}m∈N
Si=x, y | xriY, x ∈ U, y ∈ U, ri∈ R } i≤m, i ∈ N
3 information sequence set LQ
Information sequence is that M- tuple is denoted as Q
Q=<u1, u2, u3…ui..., uM>
Information sequence set LQ
LQ=(<u1, u2, u3…ui..., uM>|ui∈Si}
4 information sequence state sets
Information word mode of operation factor set
A={ a ,-a }
Information sequence QA with operation
Information sequence set LQA with operation
It can obtain: | LQA |=2M
LQA-S is the nonvoid subset of LQA
The information sequence QAS that band successively operates:
The information sequence set LQAS that band successively operates
LQAS=(QASk}k≤M
It can obtain: | LQAS |=M
5 location sets P
{ < x, W, H are natural number constant to P=；
Operate first set Opt
Opt=(Opt1, Opt2, Opt3... Opti..., OptN}
POpt=p ∧ opt | p ∈ P, opt ∈ Opt }
6 transfer functions
NFA conversion:
DFA conversion:
7 initial states and final state
Summary, theoretical based on FA, the model that is automatically brought into operation established herein is described as follows:
The automaton model AOM of non-sequential operation:
AOM=(LQA, POpt, f (QAk, popt), s, F), AOM is NFA；
The automaton model AOM-S successively operated:
AOM-S=(LQAS, POpt, f (QASk, popt), s, F), AOM-S is DFA
Two financial data automatic input Robot Designs
(1), financial data automatic input robot
Financial data typing robot AOM-S=(LQAS, POpt, f (QASk, popt), s, F), wherein
1 LQAS={ QASkK≤M, M=5；
Wherein, ui∈Si, i≤M, aj∈A
Specifically,
S1: name on account
S2: account account
S3: row information of opening an account
S4: abstract
S5: the amount of money
A={ processed, untreated }
And QASk meets
2 POpt=p ∧ opt | p ∈ P, opt ∈ Opt }, in which:
P={<x, y>| x, y ∈ N, x≤W, y≤H } W, H is screen resolution
Opt={ duplication, is clicked, and is pasted }
3
4 Wherein ui∈Si
5 Wherein ui∈Si
(2), handshake authentication designs
The application definition for starting financial data automatic input robot is that robot wakes up system, the definition of handshake authentication model
It is as follows:
A × B=(a, b) | a ∈ A, b ∈ B, f (b1) ∈ U, g (a1)∈V}
A is that robot wakes up system set, and t is that robot wakes up system identity mark, and f is rule of shaking hands, and U is f rule
Under the identity of qualified financial data automatic input robot.
B is financial data automatic input collection of bots, and s is the identity of financial data automatic input robot, and g is to hold
Hand rule, V are that qualified robot wakes up system identity mark under g rule.
f(b1)∈U,g(a1) ∈ V be cartesian product computation rule.
(3) scheme is realized
Implementation: insertion financial payment data inputting robot, host machine people wake up system wake-up robot program,
Robot starting, is loaded into data, completes the automatic input of financial payment information；Robot is extracted, robot process is accordingly turned off.
The design of financial payment data inputting robot includes two parts program: host wake-up program and robot program.
(1), host wake-up program
Programmed logic design: including Timer timer, and timer at regular intervals, executes following logic: with insertion
Robot handshake authentication authenticates successfully, then starts robot；If certification is unsuccessful, all robot processes are closed.
(2), robot program
Program interface indicates.
Programmed logic design: data are read, typing position is found for the information word of each data, logging data mentions
Intersection number evidence, until all data processings finish.
It is based on .NETFrameWork4.0 herein, financial payment data inputting robot is realized.By this
Robot, 2 employee one day typing workloads can be completed with 1 hour, greatly improve working efficiency.
As an improvement, the robot verification step are as follows:
1. reading USB flash disk sequence number；
2. read machine human sequence number；
3. identifying machine people；
4. starting robot.
As an improvement, robot program's process are as follows:
1. reading in typing file；
2. reading the i-th data；
3. reading j-th strip data；
4. simulating mouse-click operation；
5. simulating keyboard data copy operation；
6. j++ is directed toward next data；
It is finished 7. verifying the i-th data and whether reading, otherwise return step is 2.；
9. finishing if read, i++ is directed toward next data；
It is finished 10. whether verify data file reads, otherwise return step is 3.；
If reading finishes, terminate.
The working principle of the invention: it " financial payment data inputting robot " realization principle: is based on
.NETFrameWork4.0, the data inputting operation of financial payment personnel is simulated.The design process includes two parts program: host
Wake up procedure and robot program.
Deterministic finite automation
It is by the state set Q of a nonempty finite；
∑ one input alphabet (character set of nonempty finite)；
One δ: Q × ∑ of transfer function → Q (such as: δ (q, σ)=p, (p, q ∈ Q, σ ∈ ∑))；
One beginning state s ∈ Q；
One receives the set of state
Composed 5- tuple.Therefore a DFA can be write as such form [1]:
1 information word set U
U={ u1, u2, u3..., un}n∈N
2 set U are divided
The division of equivalence class is based on following theorem: the equivalence relation that R is defined on set A is set, then the equivalence class structure of R
At the division of S.
R={ r1, r2, r3..., rm}m∈N
Si=x, y | xriY, x ∈ U, y ∈ U, ri∈ R } i≤m, i ∈ N
3 information sequence set LQ
Information sequence is that M- tuple is denoted as Q
Q=<u1, u2, u3…ui..., uM>
Information sequence set LQ
LQ={ <u1, u2, u3…ui..., uM>|ui∈Si}
4 information sequence state sets
Information word mode of operation factor set
A={ a ,-a }
Information sequence QA with operation
Information sequence set LQA with operation
It can obtain: | LQA |=2M
LQA-S is the nonvoid subset of LQA
The information sequence QAS that band successively operates:
The information sequence set LQAS that band successively operates
LQAS={ QASk}k≤M
It can obtain: | LQAS |=M
5 location sets P
{ < x, W, H are natural number constant to P=；
Operate first set Opt
Opt={ Opt1, Opt2, Opt3... Opti..., OptN}
POpt=p ∧ opt | p ∈ P, opt ∈ Opt }
6 transfer functions
NFA conversion:
DFA conversion:
7 initial states and final state
Summary, theoretical based on FA, what the present invention established, which be automatically brought into operation model, is described as follows:
The automaton model AOM of non-sequential operation:
AOM=(LQA, POpt, f (QAk, popt), s, F), AOM is NFA；
The automaton model AOM-S successively operated:
AOM-S=(LQAS, POpt, f (QASk, popt), s, F), AOM-S is DFA
2.2 cartesian product handshake authentication models
This modelling is based on cartesian product theory, and for designing the entry condition of automatic machine, successfully automatic machine of shaking hands is opened
It is dynamic.
1 mark factor set:
T={ t1,t2,t3,...ti...,tn}
2 mark factor relationships:
R={ R1,R2}
The 3 mark factors divide:
T1=x, y | xR1y,x∈T,y∈T}
T2=x, y | xR2y,x∈T,y∈T}
4 handshake authentication models
A × B=(a, b) | a ∈ A, b ∈ B, f (b1)∈U,g(a1)∈V}
Wherein b1、a1The 1st metadata respectively in element (triple)
A × B is can handshake authentication set
Financial data automatic input Robot Design
Financial data automatic input robot:
Financial data typing robot AOM-S=(LQAS, POpt, f (QASk, popt), s, F), wherein
1 LQAS={ QASk }k≤ M, M=5；
Wherein, ui∈Si, i≤M, aj∈A
Specifically,
S1: name on account
S2: account account
S3: row information of opening an account
S4: abstract
S5: the amount of money
A={ processed, untreated }
And QASk meets
2 POpt=p ∧ opt | p ∈ P, opt ∈ Opt }, in which:
P={<x, y>| x, y ∈ N, x≤W, y≤H } W, H is screen resolution
Opt={ duplication, is clicked, and is pasted }
3
4 Wherein ui∈Si
5 Wherein ui∈Si
The design of 3.2 handshake authentications
The application definition for starting financial data automatic input robot is that robot wakes up system, the definition of handshake authentication model
It is as follows:
A × B=(a, b) | a ∈ A, b ∈ B, f (b1) ∈ U, g (a1)∈V}
A is that robot wakes up system set, and t is that robot wakes up system identity mark, and f is rule of shaking hands, and U is f rule
Under the identity of qualified financial data automatic input robot.
B is financial data automatic input collection of bots, and s is the identity of financial data automatic input robot, and g is to hold
Hand rule, V are that qualified robot wakes up system identity mark under g rule.
f(b1) ∈ U, g (a1) ∈ V be cartesian product computation rule.
One, host wake-up program
1 program interface indicates.
Voluntarily start with host, runnable interface appears in the desktop lower right corner.
The design of 2 programmed logics.
Comprising Timer timer, timer at regular intervals, executes following logic: detect certification robot whether
Insertion, if it is, starting robot；If it is not, then closing all robot processes.
3 program carriers.
Wake up procedure needs to be installed to host operation.
Two, robot program
1 program interface indicates.
There can only be host wake-up program invocation, could run.
The design of 2 programmed logics.
Comprising Timer timer, timer at regular intervals, executes following logic: Excel data is read, for every
One data, finds typing position, and logging data submits data, until all data processings finish.
3 program carriers.
Robot program, resides USB flash disk, and USB flash disk appearance is flexible glue body robot shape.
The present invention and its embodiments have been described above, this description is no restricted, it is illustrated above also only
It is one of embodiments of the present invention, actual structure is not limited to this.All in all if the ordinary skill people of this field
Member is enlightened by it, without departing from the spirit of the invention, is not inventively designed similar to the technical solution
Frame mode and embodiment, be within the scope of protection of the invention.
Claims (5)
1. a kind of financial payment data inputting robot, it is characterised in that: financial payment data inputting robot passes through USB
After interface insertion is equipped with the host of robot wake up procedure, start to authenticate, certification is based on cartesian product handshake authentication model, recognizes
It demonstrate,proves successfully, robot starting, imitates staff's logging data, be equipped with financial payment data inputting robot in the robot
System, financial payment data inputting robot system are based on DFA data and are automatically brought into operation model.
2. a kind of financial payment data inputting robot according to claim 1, which is characterized in that the robot is based on
Cartesian product handshake authentication model:
1. identifying factor set:
T={ t1, t2, t3... ti..., tn}
2. identifying factor relationships:
R={ R1, R2}
3. identifying the factor to divide:
T1=x, y | xR1Y, x ∈ T, y ∈ T }
T2=x, y | xR2Y, x ∈ T, y ∈ T }
4. handshake authentication model
A × B=(a, b) | a ∈ A, b ∈ B, f (b1) ∈ U, g (a1)∈V}。
3. a kind of financial payment data inputting robot according to claim 1, which is characterized in that the robot certification
Step are as follows:
1. read machine human sequence number；
2. handshake authentication, identifying machine people；
3. authenticating successfully, start robot.
4. a kind of financial payment data inputting robot according to claim 1, which is characterized in that the robot is based on
DFA data are automatically brought into operation model, and steps are as follows for model construction:
1. information word set U
U={ u1, u2, u3..., un}n∈N
2. set U is divided
R={ r1, r2, r3..., rm}m∈N
Si=x, y | xriY, x ∈ U, y ∈ U, ri∈ R } i≤m, i ∈ N
3. information sequence set LQ
Information sequence is that M- tuple is denoted as Q
Q=<u1, u2, u3...ui..., uM>
Information sequence set LQ
LQ={ <u1, u2, u3...ui..., uM>|ui∈Si}
4. information sequence state set
Information word mode of operation factor set
A={ a ,-a }
Information sequence QA with operation
5. the information sequence set LQA with operation
| LQA |=2M
6. the information sequence QAS that band successively operatesk:
7. the information sequence set LQAS that band successively operates
LQAS={ QASk}k≤M
| LQAS |=M
8. operational set POpt
Location sets P
P={<x, y>| x, y ∈ N, x≤W, y≤H } W, H is natural number constant；Operate first set Opt
Opt={ Opt1, Opt2, Opt3... Opti..., OptN}
POpt=p ∧ opt | p ∈ P, opt ∈ Opt }
9. transfer function
NFA conversion:
DFA conversion:
10. initial state and final state
To sum up, model is automatically brought into operation to be described as follows:
The automaton model AOM of non-sequential operation:
AOM=(LQA, POpt, f (QAk, popt), s, F), AOM is NFA；
The automaton model AOM-S successively operated:
AOM-S=(LQAS, POpt, f (QASk, popt), s, F), AOM-S is DFA.
5. a kind of financial payment data inputting robot according to claim 1, which is characterized in that the robot data
Automatic input process step is suddenly as follows:
1. reading in typing file；
2. reading the i-th data；
3. reading j-th of data；
4. simulating mouse-click operation；
5. simulating keyboard data copy operation；
6. j++ is directed toward next data；
It is finished 7. verifying the i-th data and whether reading；
8. finishing if read, i++ is directed toward next data；
It is finished 9. whether verify data file reads；
10. being finished if read, terminate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910140720.0A CN109840755A (en) | 2019-02-26 | 2019-02-26 | A kind of financial payment data inputting robot |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910140720.0A CN109840755A (en) | 2019-02-26 | 2019-02-26 | A kind of financial payment data inputting robot |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109840755A true CN109840755A (en) | 2019-06-04 |
Family
ID=66885014
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910140720.0A Pending CN109840755A (en) | 2019-02-26 | 2019-02-26 | A kind of financial payment data inputting robot |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109840755A (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003108901A (en) * | 2001-09-29 | 2003-04-11 | Kokuyo Co Ltd | Card payment system and card payment assisting method |
| RU2005130948A (en) * | 2005-10-05 | 2007-04-10 | Открытое акционерное общество Специальное конструкторское бюро вычислительной техники "Искра" (RU) | FISCAL RECORDER |
| US20080082484A1 (en) * | 2006-09-28 | 2008-04-03 | Ramot At Tel-Aviv University Ltd. | Fast processing of an XML data stream |
| JP2008117079A (en) * | 2006-11-01 | 2008-05-22 | Mizuho Bank Ltd | Cash payment system, financial institution terminal device, and method of paying cash |
| US20120246079A1 (en) * | 2011-03-24 | 2012-09-27 | Dave William Wilson | Authentication using application authentication element |
| US20140101187A1 (en) * | 2012-10-10 | 2014-04-10 | H. Jonathan Chao | Using a tunable finite automaton for regular expression matching |
| US8782514B1 (en) * | 2008-12-12 | 2014-07-15 | The Research Foundation For The State University Of New York | Parallel XML parsing using meta-DFAs |
| RU2014142862A (en) * | 2014-10-24 | 2016-05-20 | Закрытое акционерное общество "Энергетические системы и коммуникации" | METHOD FOR PROCESSING DATA ON CASH MONEY AND / OR CALCULATIONS USING PAYMENT CARDS ON THE SERVER OF THE OPERATOR OF FISCAL DATA WHEN OPERATING A LOT OF FUNCTIONS OF FUNCTIONS CONTROL CASH CARS |
| CN109325849A (en) * | 2018-09-15 | 2019-02-12 | 孙宇翔 | A kind of automatic collecting system based on financial system |
-
2019
- 2019-02-26 CN CN201910140720.0A patent/CN109840755A/en active Pending
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2003108901A (en) * | 2001-09-29 | 2003-04-11 | Kokuyo Co Ltd | Card payment system and card payment assisting method |
| RU2005130948A (en) * | 2005-10-05 | 2007-04-10 | Открытое акционерное общество Специальное конструкторское бюро вычислительной техники "Искра" (RU) | FISCAL RECORDER |
| US20080082484A1 (en) * | 2006-09-28 | 2008-04-03 | Ramot At Tel-Aviv University Ltd. | Fast processing of an XML data stream |
| JP2008117079A (en) * | 2006-11-01 | 2008-05-22 | Mizuho Bank Ltd | Cash payment system, financial institution terminal device, and method of paying cash |
| US8782514B1 (en) * | 2008-12-12 | 2014-07-15 | The Research Foundation For The State University Of New York | Parallel XML parsing using meta-DFAs |
| US20120246079A1 (en) * | 2011-03-24 | 2012-09-27 | Dave William Wilson | Authentication using application authentication element |
| US20140101187A1 (en) * | 2012-10-10 | 2014-04-10 | H. Jonathan Chao | Using a tunable finite automaton for regular expression matching |
| RU2014142862A (en) * | 2014-10-24 | 2016-05-20 | Закрытое акционерное общество "Энергетические системы и коммуникации" | METHOD FOR PROCESSING DATA ON CASH MONEY AND / OR CALCULATIONS USING PAYMENT CARDS ON THE SERVER OF THE OPERATOR OF FISCAL DATA WHEN OPERATING A LOT OF FUNCTIONS OF FUNCTIONS CONTROL CASH CARS |
| CN109325849A (en) * | 2018-09-15 | 2019-02-12 | 孙宇翔 | A kind of automatic collecting system based on financial system |
Non-Patent Citations (7)
| Title |
|---|
| 周佩等: "财务机器人,路能走多远", 《西部经济管理论坛》 * |
| 周佩等: "财务机器人,路能走多远", 《西部经济管理论坛》, no. 06, 29 November 2018 (2018-11-29), pages 35 - 39 * |
| 朱保平等: "《离散数学 第2版》", 28 February 2014, pages: 94 - 95 * |
| 武传坤: ""现代保密通信中的安全技术——(1)消息认证"", 《自然杂志》, pages 219 - 220 * |
| 王宇杰等: "基于Petri网和有限状态机方法构建工作流引擎", 《信息技术》 * |
| 王宇杰等: "基于Petri网和有限状态机方法构建工作流引擎", 《信息技术》, no. 06, 25 June 2010 (2010-06-25) * |
| 许清等: "《普通高等教育创新型人才培养规划教材 编译方法及应用》", 31 August 2016, pages: 50 - 71 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11915238B2 (en) | Blockchain-implemented systems and methods for concurrent bytecode interpretation | |
| EP3669313B1 (en) | Methods and systems for blockchain-implemented script-based byte interpretation | |
| Dumas II | Computer architecture: Fundamentals and principles of computer design | |
| CN101261679A (en) | Multi-fingerprint password recognition method and system based on field programmable gate array | |
| CN107436762A (en) | A kind of register Code document generating method, device and electronic equipment | |
| CN112883116A (en) | Supply chain finance AI DaaS algorithm warehouse platform based on block chain | |
| CN110222780A (en) | Object detecting method, device, equipment and storage medium | |
| CN109992285A (en) | Block chain code block standalone upgrade method, apparatus and electronic equipment | |
| CN110084596A (en) | A kind of method and apparatus of processing block chain mixing common recognition | |
| CN110019194A (en) | Verification of data method, apparatus, computer equipment and storage medium | |
| US20220229904A1 (en) | Privacy-protection-based data processing model acquisition method and apparatus, terminal device and storage medium | |
| WO2021031137A1 (en) | Artificial intelligence application development system, computer device and storage medium | |
| CN110400129A (en) | A kind of method and apparatus of item examination & approval | |
| CN102364440A (en) | System for establishing software demand model and method for establishing software demand model | |
| CN112711633B (en) | Block chain-based BIM drawing multi-person collaborative creation method and system | |
| CN109325615A (en) | A kind of Intelligent worker assigning method and device | |
| CN111144139B (en) | Uniqueness authentication method and identification system of translation result based on block chain | |
| CN112800614A (en) | Design method for applying probability time automaton to intelligent factory process | |
| Yu et al. | The music education and teaching innovation using blockchain technology supported by artificial intelligence | |
| CN109840755A (en) | A kind of financial payment data inputting robot | |
| CN108228857A (en) | A kind of solar energy unmanned plane accessory method for maintaining, device and computer storage media | |
| CN113837753A (en) | Intelligent contract template design method based on block chain contract model | |
| CN110222693A (en) | The method and apparatus for constructing character recognition model and identifying character | |
| CN111985928B (en) | Verification method, verification device, electronic equipment and storage medium | |
| CN111858832B (en) | Dialogue method, dialogue device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |