CN115409621A - Marking method and system for financial futures - Google Patents
Marking method and system for financial futures Download PDFInfo
- Publication number
- CN115409621A CN115409621A CN202210525521.3A CN202210525521A CN115409621A CN 115409621 A CN115409621 A CN 115409621A CN 202210525521 A CN202210525521 A CN 202210525521A CN 115409621 A CN115409621 A CN 115409621A
- Authority
- CN
- China
- Prior art keywords
- vector
- price vector
- line data
- highest
- line
- 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 title claims abstract description 29
- 239000000284 extract Substances 0.000 claims description 9
- 238000004891 communication Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 5
- 230000015654 memory Effects 0.000 description 5
- 238000004590 computer program Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000007774 longterm Effects 0.000 description 3
- 238000001228 spectrum Methods 0.000 description 2
- 235000010469 Glycine max Nutrition 0.000 description 1
- 244000068988 Glycine max Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 239000010779 crude oil Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 235000015277 pork Nutrition 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T11/00—2D [Two Dimensional] image generation
- G06T11/20—Drawing from basic elements, e.g. lines or circles
- G06T11/203—Drawing of straight lines or curves
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Physics & Mathematics (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The application provides a marking-out method system of financial futures, which comprises the following steps: the terminal determines a financial futures type A selected by a user, requests K line data of the type A from the network equipment, and displays the K line data on a display screen of the terminal; the terminal detects the number x of K lines of a display screen page, if the number x is larger than or equal to 5, the K line data is subjected to scribing operation to obtain scribed K line data; and the terminal displays the scribed K-line data on a display screen. The technical scheme provided by the application has the advantage of high user experience.
Description
Technical Field
The invention relates to the field of finance and Internet, in particular to a method and a system for marking off financial futures.
Background
Financial futures typically represent changes in price over time using K-lines, such as day K-line, 5 minute K-line, etc., which have become the primary price representations for financial products. In financial analysis, technical analysis for realizing financial futures through a section of line segment belongs to a commonly used auxiliary means in the field, but the auxiliary means is realized by a user, and cannot be realized automatically, so that the automatic realization of line drawing cannot be realized for the existing K line graph, and the user experience degree is reduced.
Disclosure of Invention
The embodiment of the invention provides a method and a system for marking off financial futures, which can realize automatic marking off of a K line chart, further assist a user in analyzing finance and improve the user experience.
In a first aspect, an embodiment of the present invention provides a method for marking out a financial futures, where the method includes the following steps:
the terminal determines a financial futures type A selected by a user, requests K line data of the type A from the network equipment, and displays the K line data on a display screen of the terminal;
the terminal detects the number x of K lines of a display screen page, if the number x is larger than or equal to 5, the K line data is subjected to scribing operation to obtain scribed K line data;
and the terminal displays the K line data after scribing on a display screen.
In a second aspect, there is provided a line drawing system for financial futures, the system comprising:
the acquisition unit is used for determining the financial futures type A selected by the user, requesting K line data of the type A from the network equipment and displaying the K line data on a display screen of the terminal;
the processing unit is used for detecting the number x of K lines of a display screen page, and if the number x is larger than or equal to 5, carrying out scribing operation on the K line data to obtain scribed K line data; displaying the K line data after scribing on the display screen
In a third aspect, a computer-readable storage medium is provided, which stores a program for electronic data exchange, wherein the program causes a terminal to execute the method provided in the first aspect.
The embodiment of the invention has the following beneficial effects:
it can be seen that, according to the technical scheme provided by the application, the terminal determines the financial futures type a selected by the user, requests the network device for the K line data of the type a, displays the K line data on the display screen of the terminal, the terminal detects the number x of K lines on the display screen page, if the number x is greater than or equal to 5, executes the scribing operation to obtain scribed K line data, and the terminal displays the scribed K line data on the display screen. Therefore, the user can realize the scribing operation of the K line through the automatic scribing tool, and further make a decision on the financial operation of the user, and the experience degree of the user is improved.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.
Fig. 1 is a schematic structural diagram of a terminal;
fig. 2 is a flow chart diagram of a method of marking out financial futures;
fig. 3 is a schematic diagram of a construction of a marking system for financial futures;
FIG. 4 is a schematic view of a section of a K line provided by the present application;
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
The terms "first," "second," "third," and "fourth," etc. in the description and claims of the invention and in the accompanying drawings are used for distinguishing between different elements and not for describing a particular sequential order. Furthermore, the terms "include" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements but may alternatively include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, result, or characteristic described in connection with the embodiment can be included in at least one embodiment of the invention. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein may be combined with other embodiments.
Referring to fig. 1, fig. 1 provides a terminal, which may be a terminal of an IOS system, an android system, or a terminal of another system, such as a hong meng system, etc., where the present application does not limit the specific system, and as shown in fig. 1, the terminal device may specifically include: the processor, the memory, the display screen, the communication circuit and the audio component (optional), and the above components may be connected through a bus, and may also be connected in other manners, and the present application does not limit the specific manner of the above connection.
The above connections may also be connected by a communication system. The communication system may be: a Global System for Mobile communications (GSM) System, a Code Division Multiple Access (CDMA) System, a Wideband Code Division Multiple Access (WCDMA) System, a General Packet Radio Service (GPRS), a Long Term Evolution (Long Term Evolution, LTE) System, an Advanced Long Term Evolution (LTE-a) System, a New Radio (NR) System, an Evolution System of an NR System, an LTE System over unlicensed spectrum (LTE-U), an NR System over unlicensed spectrum (NR-based Access localized space, NR-U), a Universal Mobile Telecommunications System (UMTS) System, or other next generation communication systems.
Referring to fig. 4, fig. 4 is a schematic diagram of financial K lines, as shown in fig. 4, which shows that a group of K lines generally connects the lowest price and the highest price of the group of K lines to obtain a line segment, which is commonly called a line segment, and is a very common technical analysis means in the financial field, but the change is unusual for financial data, as shown in fig. 4, which belongs to an actual K line graph, and the automatic line segment of the unusual K line graph directly affects the financial decision (whether to buy or sell) of a user.
Referring to fig. 2, fig. 2 provides a method for drawing lines on financial futures, which is shown in fig. 2 and can be implemented in a terminal, where the terminal is connected to a network device in a wireless manner, and the wireless manner may be specifically a wireless communication system.
As shown in fig. 2, the foregoing method may specifically include:
step S201, the terminal determines the financial futures category a selected by the user, requests the network device for K-line data of the category a, and displays the K-line data on the display screen of the terminal.
Illustratively, the futures category a may be domestic or foreign futures categories, such as crude oil, soybean, pork, etc., and the futures category is not limited in the present application.
Step S202, the terminal detects the number x of K lines of a display screen page, and if the number x is larger than or equal to 5, the scribing operation is carried out on the K line data to obtain scribed K line data.
And S203, the terminal displays the scribed K-line data on a display screen.
According to the technical scheme, the terminal determines the financial futures type A selected by a user, requests K line data of the type A from network equipment, displays the K line data on a display screen of the terminal, detects the number x of K lines on a display screen page, executes scribing operation to obtain scribed K line data if the number x is larger than or equal to 5, and displays the scribed K line data on the display screen. Therefore, the user can realize the scribing operation of the K line through the automatic scribing tool, and further make a decision on the financial operation of the user, and the experience degree of the user is improved.
Illustratively, the obtaining the scribed K-line data by performing the scribing operation on the K-line data may specifically include:
the terminal extracts the highest price and the lowest price of each K line in the K line data, the highest price of the K lines is filled into a highest price vector according to the sequence of the K lines, the lowest price is filled into a lowest price vector according to the sequence of the K lines, each element value in the highest price vector is traversed to obtain a vertex identification position in the highest price vector, each element value in the lowest price vector is traversed to obtain a bottom point identification position in the lowest price vector, the K line quantity x1 between a first vertex identification position and a first bottom point identification position is obtained, if x1 is larger than or equal to 5, a first low price corresponding to the first vertex identification position and a first low price corresponding to a first place identification position are connected to form a line segment, the K line quantity x2 between a second vertex identification position and the first bottom point identification position is obtained, if x2 is larger than or equal to 5, the first low price is connected with a second high price corresponding to the second vertex identification position to obtain another line segment, and all K line data of the K lines in the highest price vector and the lowest price vector are obtained after traversing all the K line segments in the lowest price vector.
Illustratively, the traversing each element value in the maximum price vector to obtain the vertex identification bit in the maximum price vector may specifically include:
if the element i is a middle element (not the first 2 or the last 2 elements) of the highest price vector, extracting the first 2 and the last 2 elements of the element i from the highest price vector, if the value of the element i is the maximum of 5 element values, determining that the element i is a vertex identification bit, if the element i is an edge element of the highest price vector, extracting 4 element values adjacent to the element i, if the element i is the highest of 5 element values, determining that the element i is the vertex identification bit, and traversing all elements of the highest price vector to determine all vertex identification bits.
Illustratively, the traversing each element value in the lowest price vector to obtain the bottom point identifier in the lowest price vector may specifically include:
if the element i is a middle element (i.e. not the first 2 or the last 2 elements) of the highest price vector, extracting the first 2 elements and the last 2 elements of the element i from the lowest price vector, if the value of the element i is the minimum of 5 element values, determining that the element i is a low point identification bit, if the element i is an edge element of the lowest price vector, extracting 4 element values adjacent to the element i, if the element i is the minimum of 5 element values, determining that the element i is a low point identification bit, and traversing all elements of the lowest price vector to determine all low point identification bits.
By way of example, the method may further include:
the number of the K lines is indexed on each line segment, so that a user can conveniently watch whether the line segments belong to the same adjustment level.
Referring to fig. 3, fig. 3 provides a schematic structural diagram of a marking system for financial futures, which includes:
the acquisition unit is used for determining the financial futures type A selected by the user, requesting K line data of the type A from the network equipment and displaying the K line data on a display screen of the terminal;
the processing unit is used for detecting the number x of K lines of a display screen page, and if the number x is larger than or equal to 5, carrying out scribing operation on the K line data to obtain scribed K line data; and displaying the scribed K line data on a display screen.
As an example of this, it is possible to use,
the processing unit is specifically configured to extract the highest price and the lowest price of each K line in the K line data, fill the highest price of the K line into a highest price vector according to the precedence order of the K lines, fill the lowest price into a lowest price vector according to the precedence order of the K lines, traverse each element value in the highest price vector to obtain a vertex identification bit in the highest price vector, traverse each element value in the lowest price vector to obtain a bottom point identification bit in the lowest price vector, obtain a K line number x1 between a first vertex identification bit and a first bottom point identification bit, if x1 is greater than or equal to 5, connect a first low price corresponding to the first vertex identification bit and a first low price corresponding to the first location identification bit to form a line segment, obtain a K line number x2 between a second vertex identification bit and the first bottom point identification bit, if x2 is greater than or equal to 5, connect the first low price and a second high price corresponding to the second vertex identification bit to obtain another line segment, and traverse all the K line segments of the lowest price vector to obtain all K line data.
As an example of this, it is possible to use,
the processing unit is specifically configured to, if the element i is a middle element of the highest price vector, extract first 2 elements and second 2 elements of the element i from the highest price vector, determine that the element i is a vertex flag if a value of the element i is the largest among 5 element values, extract 4 element values adjacent to the element i if the element i is an edge element of the highest price vector, determine that the element i is the vertex flag if the element i is the 5 element value of the highest price vector, and traverse all elements of the highest price vector to determine all vertex flag bits.
As an example of this, it is possible to provide,
the processing unit is specifically configured to, if the element i is a middle element of the highest price vector, extract the first 2 elements and the last 2 elements of the element i from the lowest price vector, determine that the element i is a low point flag if the value of the element i is the smallest among 5 element values, extract 4 element values adjacent to the element i if the element i is an edge element of the lowest price vector, determine that the element i is a low point flag if the element i is the lowest among 5 element values, and traverse all elements of the lowest price vector to determine all low point flags.
For example, the processing unit in the embodiment of the present application may also be configured to execute a refinement scheme, an alternative scheme, and the like of the embodiment shown in fig. 2, which are not described herein again.
Embodiments of the present invention further provide a computer storage medium, wherein the computer storage medium stores a computer program for electronic data exchange, and the computer program enables a computer to execute part or all of the steps of any one of the methods for drawing lines of financial futures as described in the above method embodiments.
Embodiments of the present invention further provide a computer program product comprising a non-transitory computer readable storage medium storing a computer program operable to cause a computer to perform some or all of the steps of any one of the methods of streaking financial futures as set forth in the above method embodiments.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present invention is not limited by the order of acts, as some steps may be performed in other orders or concurrently according to the present invention. Further, those skilled in the art should also appreciate that the embodiments described in the specification are exemplary embodiments and that the acts and modules referred to are not necessarily required to practice the invention.
In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.
In the several embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one type of division of logical functions, and there may be other divisions when actually implementing, for example, a plurality of units or components may be combined or may be integrated into another system, or some features may be omitted, or not implemented. In addition, the shown or discussed coupling or direct coupling or communication connection between each other may be through some interfaces, indirect coupling or communication connection between devices or units, and may be in an electrical or other form.
Those skilled in the art will appreciate that all or part of the steps in the methods of the above embodiments may be implemented by associated hardware instructed by a program, which may be stored in a computer-readable memory, which may include: flash Memory disks, read-Only memories (ROMs), random Access Memories (RAMs), magnetic or optical disks, and the like.
The above embodiments of the present invention are described in detail, and the principle and the implementation of the present invention are explained by applying specific embodiments, and the above description of the embodiments is only used to help understanding the method of the present invention and the core idea thereof; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.
Claims (9)
1. A method for marking out financial futures, characterized in that the method comprises the following steps:
the terminal determines a financial futures type A selected by a user, requests K line data of the type A from the network equipment, and displays the K line data on a display screen of the terminal;
the terminal detects the number x of K lines of a display screen page, and if the number x is larger than or equal to 5, the K line data is subjected to scribing operation to obtain scribed K line data;
and the terminal displays the scribed K-line data on a display screen.
2. The method of claim 1, wherein the obtaining scribed K-line data by performing the scribing operation on the K-line data specifically comprises:
the terminal extracts the highest price and the lowest price of each K line in the K line data, the highest price of the K lines is filled into a highest price vector according to the sequence of the K lines, the lowest price is filled into a lowest price vector according to the sequence of the K lines, each element value in the highest price vector is traversed to obtain a vertex identification position in the highest price vector, each element value in the lowest price vector is traversed to obtain a bottom point identification position in the lowest price vector, the K line quantity x1 between a first vertex identification position and a first bottom point identification position is obtained, if x1 is larger than or equal to 5, a first low price corresponding to the first vertex identification position and a first low price corresponding to a first place identification position are connected to form a line segment, the K line quantity x2 between a second vertex identification position and the first bottom point identification position is obtained, if x2 is larger than or equal to 5, the first low price and a second high price corresponding to the second vertex identification position are connected to obtain another line segment, and all K line data of the K lines in the lowest price vector and the lowest price vector are obtained after traversing.
3. The method of claim 2, wherein traversing each element value in the highest price vector to obtain a vertex identification bit in the highest price vector comprises:
if the element i is a middle element of the highest price vector, extracting the first 2 elements and the last 2 elements of the element i from the highest price vector, if the value of the element i is the maximum of 5 element values, determining that the element i is a vertex identification position, if the element i is an edge element of the highest price vector, extracting 4 element values adjacent to the element i, if the element i is the maximum of 5 element values, determining that the element i is the vertex identification position, and traversing all elements of the highest element vector to determine all vertex identification positions.
4. The method of claim 2, wherein traversing each element value in the lowest price vector to obtain a bottom point identity bit in the lowest price vector comprises:
if the element i is a middle element of the highest price vector, extracting the first 2 elements and the last 2 elements of the element i from the lowest price vector, if the value of the element i is the minimum of 5 element values, determining that the element i is a low point identification bit, if the element i is an edge element of the lowest price vector, extracting 4 element values adjacent to the element i, if the element i is the minimum of 5 element values, determining that the element i is the low point identification bit, and traversing all elements of the lowest element vector to determine all low point identification bits.
5. A line striping system for financial futures, the system comprising:
the acquisition unit is used for determining the financial futures type A selected by the user, requesting K-line data of the type A from the network equipment and displaying the K-line data on a display screen of the terminal;
the processing unit is used for detecting the number x of K lines of a display screen page, and if the number x is larger than or equal to 5, performing scribing operation on the K line data to obtain scribed K line data; and displaying the scribed K line data on a display screen.
6. The system of claim 5,
the processing unit is specifically configured to extract a highest price and a lowest price of each K line in the K line data, fill the highest price of the K lines into a highest price vector according to a sequence of the K lines, fill the lowest price into a lowest price vector according to the sequence of the K lines, traverse each element value in the highest price vector to obtain a vertex identification bit in the highest price vector, traverse each element value in the lowest price vector to obtain a bottom point identification bit in the lowest price vector, obtain a K line number x1 between a first vertex identification bit and a first bottom point identification bit, connect a first low price corresponding to the first vertex identification bit and a first low price corresponding to the first location identification bit to form a line segment if x1 is greater than or equal to 5, connect a second high price between the second vertex identification bit and the first bottom point identification bit to obtain another line segment, traverse all K line segments of the K line identification bits in the lowest price vector and the lowest price vector to obtain another data.
7. The system of claim 6,
the processing unit is specifically configured to extract, if the element i is a middle element of the highest price vector, the first 2 elements and the last 2 elements of the element i from the highest price vector, determine, if a value of the element i is the largest among 5 element values, that the element i is a vertex identification bit, if the element i is an edge element of the highest price vector, extract 4 element values adjacent to the element i, if the element i is the highest among 5 element values, determine, that the element i is the vertex identification bit, and traverse all elements of the highest element vector to determine all vertex identification bits.
8. The system of claim 6,
the processing unit is specifically configured to, if the element i is a middle element of the highest price vector, extract the first 2 elements and the last 2 elements of the element i from the lowest price vector, determine that the element i is a low point flag if the value of the element i is the smallest among 5 element values, extract 4 element values adjacent to the element i if the element i is an edge element of the lowest price vector, determine that the element i is a low point flag if the element i is the lowest among 5 element values, and traverse all elements of the lowest price vector to determine all low point flags.
9. A computer-readable storage medium storing a program for electronic data exchange, wherein the program causes a terminal to perform the method as provided in any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210525521.3A CN115409621A (en) | 2022-05-16 | 2022-05-16 | Marking method and system for financial futures |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210525521.3A CN115409621A (en) | 2022-05-16 | 2022-05-16 | Marking method and system for financial futures |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115409621A true CN115409621A (en) | 2022-11-29 |
Family
ID=84157808
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210525521.3A Pending CN115409621A (en) | 2022-05-16 | 2022-05-16 | Marking method and system for financial futures |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115409621A (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102737344A (en) * | 2012-06-29 | 2012-10-17 | 裘海雯 | Method and system for recording security price operation trend according to security trading data |
| US20150066725A1 (en) * | 2013-08-28 | 2015-03-05 | Huiqing Cai | Trend trading method |
| CN106779167A (en) * | 2016-11-23 | 2017-05-31 | 上海银天下科技有限公司 | The method and device of forecast price tendency flex point |
| CN111199482A (en) * | 2019-12-24 | 2020-05-26 | 上海小杰教育科技有限公司 | Data analysis method and system based on financial transaction |
| US20200273104A1 (en) * | 2019-02-21 | 2020-08-27 | TrendSpider LLC | Advanced financial alerts generation based on automatic analysis of price charts |
| CN112232952A (en) * | 2020-09-11 | 2021-01-15 | 苏宁金融科技(南京)有限公司 | Data acquisition method and device for transaction dense area |
| CN113706307A (en) * | 2021-08-26 | 2021-11-26 | 杭州高能投资咨询有限公司 | Stock medium and long term trend prediction method, equipment, system and medium |
| CN114008658A (en) * | 2021-09-30 | 2022-02-01 | 富途网络科技(深圳)有限公司 | K-line form recognition method and electronic equipment |
-
2022
- 2022-05-16 CN CN202210525521.3A patent/CN115409621A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102737344A (en) * | 2012-06-29 | 2012-10-17 | 裘海雯 | Method and system for recording security price operation trend according to security trading data |
| US20150066725A1 (en) * | 2013-08-28 | 2015-03-05 | Huiqing Cai | Trend trading method |
| CN106779167A (en) * | 2016-11-23 | 2017-05-31 | 上海银天下科技有限公司 | The method and device of forecast price tendency flex point |
| US20200273104A1 (en) * | 2019-02-21 | 2020-08-27 | TrendSpider LLC | Advanced financial alerts generation based on automatic analysis of price charts |
| CN111199482A (en) * | 2019-12-24 | 2020-05-26 | 上海小杰教育科技有限公司 | Data analysis method and system based on financial transaction |
| CN112232952A (en) * | 2020-09-11 | 2021-01-15 | 苏宁金融科技(南京)有限公司 | Data acquisition method and device for transaction dense area |
| CN113706307A (en) * | 2021-08-26 | 2021-11-26 | 杭州高能投资咨询有限公司 | Stock medium and long term trend prediction method, equipment, system and medium |
| CN114008658A (en) * | 2021-09-30 | 2022-02-01 | 富途网络科技(深圳)有限公司 | K-line form recognition method and electronic equipment |
Non-Patent Citations (1)
| Title |
|---|
| 张华: "涨停板战法系列 借刀斩牛股之酒田战法解析 第3版", 四川人民出版 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110290024B (en) | Method, device and equipment for testing strategy before online | |
| CN105549936B (en) | Data table display method and device | |
| CN111328082A (en) | Base station planning method, device, equipment and storage medium | |
| CN105101171A (en) | Terminal network parameter configuration method, and terminal | |
| CN107370685A (en) | A kind of internet-of-things terminal cut-in method and device | |
| CN105677677A (en) | Information classification and device | |
| CN114173006B (en) | Off-network early warning method and server for communication user | |
| CN103260171B (en) | A kind of method of cell measurement gravity treatment and terminal | |
| CN110098966B (en) | Wireless network capacity analysis method and equipment | |
| CN115409621A (en) | Marking method and system for financial futures | |
| CN107908676A (en) | A kind of data display update method, terminal and computer-readable medium | |
| CN104484619A (en) | Method for accessing file system of smart card through application module | |
| CN108055690A (en) | Wi-Fi hotspot recommends method, application server and computer readable storage medium | |
| CN105338097A (en) | Terminal screen size-based flow control method, terminal and business server | |
| CN109582829A (en) | A kind of processing method, device, equipment and readable storage medium storing program for executing | |
| CN108616870B (en) | Method and device for identifying terminal customized preferentially | |
| CN115687023A (en) | Internet big data processing method and system | |
| CN114461867A (en) | Financial big data analysis processing method and system | |
| CN112560961B (en) | Target identification method and device based on graph clustering, electronic equipment and storage medium | |
| CN115099962A (en) | Financial analysis suggestion method and system for position holding stock | |
| CN111262871B (en) | Data processing method and device and storage medium | |
| CN113383314B (en) | User similarity calculation method and device, server and storage medium | |
| CN110751204A (en) | Data fusion method and device, storage medium and electronic device | |
| CN104994548A (en) | Switching method for use in LTE (Long Term Evolution) system and base station | |
| CN115119192B (en) | Network access method and device |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20221129 |
|
| RJ01 | Rejection of invention patent application after publication |