TW201032128A - Method for combining data and electronic apparatus and computer program product using the method thereof - Google Patents
Method for combining data and electronic apparatus and computer program product using the method thereof Download PDFInfo
- Publication number
- TW201032128A TW201032128A TW98105015A TW98105015A TW201032128A TW 201032128 A TW201032128 A TW 201032128A TW 98105015 A TW98105015 A TW 98105015A TW 98105015 A TW98105015 A TW 98105015A TW 201032128 A TW201032128 A TW 201032128A
- Authority
- TW
- Taiwan
- Prior art keywords
- data
- time
- storage
- storage space
- percentage
- Prior art date
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
Description
且特別是有關 ❹ ❹ 201032128 六、發明說明: 【發明所屬之技術領域】 本發明是有關於一種合併資料的方法, 於一種結合時間因素的合併資料方法。 【先前技術】 隨著科技的曰新月異,投資人要掌握股市資訊已不再 侷限於藉由收聽收音機或是觀看有線頻道。目前市面上出 現Ifί各樣的股票機,其不僅攜帶方便,並且操作簡單 二,據此許多投資人紛紛改用股票機, 地、隨時的查看最新的即時股市交易資訊。現身隨 然而,可攜式的股票機受限於體積盥 記憶趙容量非常有限。據此,、二 過大,將容易導致記憶體耗盡。 又易里 【發明内容】 本發明提供-種合併資料的方法及其電 料的合併均勻分布在舰時間範圍内。 、讓貪 电以出—種電子裝置,其包括儲存模組、接收模 ^以及運减組。儲存模組中具有預設的儲存 ^模 為多個時ί二運=則:t述預設的時間範圍劃: 點並於母—個時間檢查點監測儲存模級 c/n 201032128 的儲存二間的使用狀況。當運曾、^ ^^ 用狀況達/㈣剩儲紅間的使 咬J個預汉條件%,將時間檢查點及下 ί—再所接收的資料依據預設的合併規則進行處i 後=經過處理之後的這些資料更新至儲存模組。 門。施财,電子裝置更包括-暫存空 間疋用來暫時儲存接收模組所接收的資料,以 使運异模組將這些資料更新至儲存模組内。 在本發明之一實施例中,上述 $的,分比小於或等於儲存空間的使用更;=間 依據-&併規則’增加這些資料欲進行合併的一數量,而 以此數量為合併的單位,合併這些㈣。並且, 圍的經過百分比大於儲存空間的使用百分比時,^據上^ 合併規則’減少㈣資料欲進行合併的數量,而以此數量 為合併的單位,合併這些資料。 從另一觀點來看,本發明提出一種合併資料的方法, 係應用於-電子裝置。而電子裝置具有預設的儲存空間的 儲存模組,並在預設的時間範圍内接收來自於遠端的伺服 器所傳輸的複數筆資料。上述方法首先將_範圍劃分為 多個時間檢查點。接著,於每__個時間檢查點監測儲存模 組的儲存空間的使用狀況。當儲存空間的使用狀況達到預 設條件時,將此時的時間檢查點及下一次時間檢查點之間 所接收的資料依據預設的合併規則進行處理後,再將經過 處理之後的資料更新至儲存模組。 在本發明之一實施例中,合併資料的方法更包括提供 201032128、, -個暫存空間’以暫時儲麵接㈣ 資料更新至儲存模_。 紐將k些 2發明之一實施例中,上述預設條件_ 間的使用百分比以及時間範圍的經過百分比所建立。二 在本發明之一實施例中,上述依據合併規則進行 的步驟’包括當時間範圍的經過百分 時’依據,規則,增加這丄 一 ' 里而以此數量為合併的單位,合併這些資料。 π夺間範圍的經過百分比大於儲存空間使百 比時,依據合併規則,減少上述資料欲進行合併的-數量刀, 而以此數量為合併的單位,合併這些資料。此外,, 爻百分比小於或等於儲存空間的使用百分:時: ΐ 蚊上述資料欲進行合併的優先順 序以依據優先順序合併這些資料。 鲁 在本發明之g施例中,上述將經過處理之後的資料 步驟’更可調整儲存模組的儲存格式, 8位凡組或16位元組。 電子S’ t明提出一種合併資料的方法,係應用於-,子褒置。此電子裝置係連接於遠端的股市即時 裝置中具有預設儲存空間的儲存模組,、以 範圍内接收來自於股市即時交易資湖 民时所傳輸的複數筆即時交易資料。上述方 4間乾圍劃分為多個時間檢查點。接著,於到達每一個時 5 iuc/nIn particular, it relates to ❹ ❹ 201032128. 6. Description of the Invention: [Technical Field of the Invention] The present invention relates to a method for merging data, and a method for combining data combining time factors. [Prior Art] With the rapid development of technology, it is no longer limited for investors to grasp the stock market information by listening to the radio or watching cable channels. At present, there are various stock machines on the market, which are not only easy to carry, but also easy to operate. Secondly, many investors have switched to stock machines, and they can view the latest real-time stock market trading information at any time. However, the portable stock machine is limited by the volume 记忆 memory Zhao capacity is very limited. According to this, if the two are too large, it will easily lead to the exhaustion of the memory. Further, the invention provides a method for combining data and a uniform distribution of the materials in the ship time range. Let the electricity come out as an electronic device, which includes a storage module, a receiving module, and an operation and subtraction group. When there are multiple preset storage modules in the storage module, then the second time = then: t describes the preset time range: point and monitor the storage module c/n 201032128 in the parent-time checkpoint. Usage status. When Yun Zeng, ^ ^^ used the situation up to / (4) left the storage of the red room to bite J pre-management conditions%, the time checkpoint and the next _ re-received data according to the preset merger rules after the i = The processed data is updated to the storage module. door. In addition, the electronic device further includes a temporary storage space for temporarily storing the data received by the receiving module, so that the transport module updates the data into the storage module. In an embodiment of the present invention, the above-mentioned ratio of $ is less than or equal to the use of the storage space; = the basis of the -& and the rule 'increasing the quantity of the data to be merged, and the quantity is the combined Units, merge these (four). Moreover, when the percentage of the circumference of the enclosure is greater than the percentage of use of the storage space, the number of merged rules is reduced by (4) the amount of data to be merged, and the quantity is the unit of consolidation, and the data is combined. From another point of view, the present invention proposes a method of merging data, which is applied to an electronic device. The electronic device has a storage module with a preset storage space, and receives a plurality of data transmitted from a remote server within a preset time range. The above method first divides the _ range into multiple time checkpoints. Next, the usage status of the storage space of the storage module is monitored at each __ time checkpoint. When the usage status of the storage space reaches the preset condition, the data received between the time check point and the next time check point at this time is processed according to the preset merge rule, and then the processed data is updated to Storage module. In an embodiment of the present invention, the method for merging data further includes providing 201032128, a temporary storage space to update the temporary storage (4) data to the storage module. In one embodiment of the invention, the percentage of use between the preset conditions _ and the percentage of the time range are established. In an embodiment of the present invention, the above-mentioned steps according to the merging rule include 'including the time percentage of the time range', the rule, adding the 丄 ' , and the quantity is the unit of merging, merging the data . When the percentage of the π-intercept range is greater than the storage space to make the ratio, according to the merger rule, the above-mentioned data is to be merged-quantity knives, and the quantity is the combined unit, and the data is combined. In addition, the percentage of 爻 is less than or equal to the percentage of storage space used: Hour: ΐ Mosquito The above information is prioritized for merging to combine these materials in order of priority. In the embodiment of the present invention, the above-mentioned processed data step ’ can further adjust the storage format of the storage module, 8 groups or 16-bit groups. The electronic S't proposes a method of combining data, which is applied to the -, sub-set. The electronic device is connected to a storage module having a preset storage space in the remote stock market instant device, and receives a plurality of real-time transaction data transmitted from the stock market real-time transaction. The above four sides are divided into multiple time check points. Then, at each time, 5 iuc/n
201032128 繼況。當 儲存工間的使用狀况達到預設 點及下-次時間檢查點之 J :此_時間檢查 設的合併規則進行處理後,==時交易資料依據預 資料更新至儲存模組。#將、-過處理之後的即時交易 本發明另提供一種雷腦盘^ 合併資料的方法,此電職^ : A侧讀行上述 這些程式碼片段在載入電子裝置中並 執订之後,即可元成上述合併資料的方法。 用』上:Γ:本t明加入時間因素來判斷儲存她^ 料。in μ一ί 疋是否合併自遠端伺服器所接收的資 德丰/ “ ’資料的合併將不會集巾於預設時間範圍的 不易^覺而能夠均勾分布在預設時間範圍内,以讓使用者 為讓本發明之上述特徵和優點能更明顯易懂 牛較佳實闕’並配合所關式,作詳細卿如下。、 【實施方式】 為了使本發明之内容更為日赠,町特舉實施例 本發明確實能夠據以實施的範例。 … 圖1是依照本發明一實施例之電子裝置的方塊圖。社 參照圖1,電子裝置100包括接收模組110、暫存空間以= 儲存模組130以及運算模組140。在本實施例中";B運瞀模 組HO是用以將接收模組U0所接收的複數筆資料儲 201032128 錯存模組!30 _。 詳細地說’接幻驗nG會麵設 内’經由有線或無線的方=來 自於搞關服$ (错示)所傳輪的複數筆钱= 空間120是用來暫時錯存接收模組j 的資子 ^組140將這些資料更新至健存模組 暫存空間120亦可直接由儲存模纟且i ^ ^ 130 、儲存二間,以儲存接收模組110所接收的資料。又 另外’運算模組140會將預設的時間範 儲存空_使用狀況。當儲存模組m =到預,条㈣,運算模組14〇會將此時的= 規則進檢查點之間所接收的資料依據預設的合併 Γ13ΐ 再雜過處理之後的資料更新至儲存模 Ο 個昧說’運算模組刚可將㈣至16:GG劃分為41 個時間仏查點,而運算歡14G便自早上9:⑻開 10分鐘便檢查儲存空間的使用狀況,以決定是否依據預咬 的合併規則將暫存空間㈣中的資料合併再儲存至儲存模 組130。也就是說,運算模組14〇會在時間到達9:10、 ............15:4G、15:5G時’檢查儲存空間的使用狀況。 相對於前述的電子裝置100,本發明亦提供對應的合 併資料的方法,以下則搭配上述電子裝置100中的各個^ 7 201032128_,c/n 件,再舉一實施例詳細說明之。圖2是依照本發明一實施 例之合併資料的方法流程圖。請同時參照圖1及圖2,首 先、,在步驟S210中,運异模組140將預設的時間範圍劃 分為多個時間檢查點。 一 士接著,如步驟S220所示,運算模組14〇便可於每一 個妗間檢查點監測儲存模組130的儲存空間的使用狀況 (例如,儲存空間的使用百分比)。換言之,運算模組14〇 可在母故過—段時間便檢查儲存模組130的儲存空間目前 的使用狀況。在此,上述時間檢查點兩兩相隔的時間長可 以相同,亦可視情況為不同。此外,時間檢查點的設置可 以為預設所定義,亦可由使用者自行定義。 接著,在步驟S230中,當儲存空間的使用狀況達到 ,,條件時,運算模組14〇會將此時的時間檢查點及下一 次時間檢查點之間所接收的資料依據預設的合併規則進行 處理後’再將經過處理之後的資料更新至儲存模組130。 舉例來說,當運算模組14〇於早上1〇:〇0監測到儲存 空間的使用百分比達到預設條件時,運算模組140會將 10:0(^至10:10之間接收模組110所接收的資料(此時所接 資料將暫時儲存於暫存空間120中)合併,例如將兩 筆資料合併為—筆資料。之後,運算模組140再將合併後 的資料儲存至儲存模組130中。 以下再舉—例詳細說明資料合併的合併規則。圖3是 依,本發明另一實施例之合併資料的方法流程圖。請同時 參照圖1及圖3,首先,在步驟S305中,運算模組140將 8 201032128 預設的時則 1賴分為多個時間檢查點。據此 所示,運算模組H0便可於每—個時間檢查點監= 存模組130的儲存空間的使用狀況。 川儲 接著,在步驟如5中,運算模組14〇會判 ,的經過百分比是否小於或等於儲存空間的制百分^ 二運异模組Μ0判斷時間範圍的經過百分比小於 ^空間的使用百分比時’如步驟S32q所示,模、〇 會依據合併_,增減進行合㈣數量。麻,、=4〇 方式來增加合併的數量,即2筆、3筆、4筆孝。 的數S325中’運算模組140以上述所增加 達到入合併所接收的資料。進—步地說,當 存空’時__經過百分比小於或等於儲 ❿ 資1存至儲存模Cl之後運异馳再將合併後的 料時,」在接收模組110開始自遠端祠服器接收資 組130中U〇可直接將接收到的資料儲存至儲存模 併的資料達合併條件時’運算模組140便會將欲合 運算模組2筆資料合併為1筆資料。此時, 至暫存处門先將接收模組110所接收的資料暫時存放 將此兩:暫存空間12G中存有2筆資料時,便 、/ 出進行合併。之後,運算模組再將合併後201032128 Succession. When the usage status of the storage room reaches the preset point and the next-time time check point J: This _ time check sets the merge rule to be processed, and the transaction data is updated to the storage module according to the pre-data. The present invention provides a method for merging data from a thunderbolt disk. The electric device is: the A side reads the above-mentioned code segments after being loaded into the electronic device and is bound, that is, Can be the method of combining the above materials. Use 』上:Γ: This time t is added to the time factor to judge the storage of her materials. In μ ί 疋 疋 合并 合并 合并 疋 疋 疋 疋 疋 “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ “ In order to make the above-mentioned features and advantages of the present invention more obvious and easy to understand, and to match the closed type, the details are as follows. [Embodiment] In order to make the content of the present invention more BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram of an electronic device according to an embodiment of the present invention. Referring to FIG. 1, an electronic device 100 includes a receiving module 110 and a temporary storage space. In the embodiment, the storage module 130 and the computing module 140 are used to store the plurality of data received by the receiving module U0 in the 201032128 memory module! 30 _. In detail, 'connected to the illusion nG meeting set' via wired or wireless side = multiple money from the wheel of the messenger $ (missing) = space 120 is used to temporarily store the receiving module j The sub-group 140 updates the data to the health module temporary storage 120 can also directly store the storage module and store the two rooms to store the data received by the receiving module 110. In addition, the computing module 140 stores the preset time range in the empty state. The storage module m = to pre-, bar (4), the computing module 14 〇 will update the data received between the check-in rules at this time according to the preset merge Γ 13 ΐ and then the data after the mis-processing is updated to the storage module I said that the 'operational module can just divide (4) to 16:GG into 41 time points, and the calculation 14G will check the usage of the storage space from 10:10 in the morning (8) to decide whether to pre-determine. The merging rule of the bite merges the data in the temporary storage space (4) and stores it in the storage module 130. That is, the computing module 14〇 will arrive at 9:10, ...... 15:4G, 15:5G 'Check the storage space usage status. Compared with the foregoing electronic device 100, the present invention also provides a corresponding method for combining data, and the following is matched with each of the above electronic devices 100. /n, another embodiment will be described in detail. Figure 2 is a For example, referring to FIG. 1 and FIG. 2, first, in step S210, the transport module 140 divides the preset time range into multiple time check points. In step S220, the computing module 14 can monitor the usage status of the storage space of the storage module 130 (for example, the percentage of storage space used) at each of the inter-turn checkpoints. In other words, the computing module 14 can be in the mother Therefore, the current usage status of the storage space of the storage module 130 is checked over a period of time. Here, the time lengths of the above-mentioned time check points may be the same, and may be different depending on the situation. In addition, the time checkpoint settings can be defined for the preset or by the user. Next, in step S230, when the usage status of the storage space reaches, in the condition, the computing module 14 〇 will receive the data received between the time check point and the next time check point according to the preset merge rule. After processing, the processed data is updated to the storage module 130. For example, when the computing module 14 detects that the usage percentage of the storage space reaches a preset condition in the morning, the computing module 140 will receive the module between 10:0 (^ and 10:10). The data received by 110 (the data received at this time will be temporarily stored in the temporary storage space 120) is merged, for example, the two data are combined into a pen data. Then, the computing module 140 stores the combined data in the storage mode. The following is a detailed description of the merge rule of data merge. Figure 3 is a flow chart of a method for merging data according to another embodiment of the present invention. Please refer to FIG. 1 and FIG. 3 simultaneously, first, at step S305. The calculation module 140 divides the preset time 1 of the 201032128 into a plurality of time check points. According to the calculation module H0, the operation module H0 can store the storage of the storage module 130 every time. The use of space. Chuan Chu, then, in step 5, the calculation module 14〇 will determine whether the percentage of the passage is less than or equal to the percentage of the storage space. ^When the percentage of space is used, As shown in step S32q, the modulo and 〇 will increase or decrease according to the merging _, and increase the number of merging. The numb, and 〇4〇 ways to increase the number of merging, that is, 2, 3, and 4 filial. The module 140 is increased by the above-mentioned increase to the data received by the merger. In other words, when the storage is empty, the percentage of the __ is less than or equal to the storage of the storage 1 and the storage of the storage module C1. When the receiving module 110 starts to receive the data from the remote server receiving the group 130, the data can be directly stored in the storage module and the data is merged. The computing module 140 will The data of the computing module 2 is merged into one data. At this time, the data received by the receiving module 110 is temporarily stored in the temporary storage gate. The two data are stored in the temporary storage space 12G. After that, the merge will be merged. After that, the computing modules will be merged.
201032128^ 的資料儲存至儲存模組13〇。而當欲 =3筆時’運算模組1物暫存空間; 貧料再將此3筆資料取出進行合併,以此類推。The data of 201032128^ is stored in the storage module 13〇. When you want =3 pens, the computing module 1 temporarily stores the space; the poor materials then take out the three data and merge them, and so on.
構你杜^驟S325 + ’包含有另—種實施方式,當達到合 併條件(即’ _朗的經過百分 J 分比)之後,接收模組 料將先暫時及直接合併存放於暫存空間.當暫存空 1 士20所存放及已合併之資料的數量滿足合併規财 =運算模組Μ0再將這些資料再將合併後的資料儲至 儲存模組130。 舉例來說’運算模組刚會先將接收模組丨⑴所接 的待合併的第1筆資料暫時存放至暫存空間12〇, 2組1H)接收到待合併的第2筆資料時,即直接與暫存 j 120中的第!筆資料進行合併,例如以加總方式執行 合併。之後’運算模組⑽再將合併後的資料儲存 儲存模組13G,並同時將暫存空間m内部原儲存的資 =刪除及資料的數量歸零。同理,當欲合併的資料數量設 疋增加為3筆時,運算模組140於接收到欲合併的第ι筆 ^時會先㈣齡於暫杜間m;續當減到欲合併 的第2筆資料時’即將第2筆資料直接與儲存空間12〇内 =第1筆資料進行合併;最後,當接收到欲合併的第3筆 資料時,則同樣地將第3筆資料直接與儲存空間12〇内的 第1筆與第2筆已合併的資料再以前述相同的手段進行合 併’運异模組140再將合併後的資料儲存至儲存模組13〇, 201032128 將暫存空間12G内部原儲存的資料刪除及資料的數 里%零,以此類推。 貝了叶曰]数 的儲實=Γ運算模組14。可調整儲存模組130 存這些資料。而儲存格式例如為2位元 或L式)、4位元組(中格式)、8位元組(長格式) “士組(特長格式)。例如’短格式裡的-個位元是 m 差值則可A ^ 切來就㈣筆資料之 =貝iT為16位疋。而長格式則可利用%位 據此,當儲存格式越大,所能夠存放值便越大。、; 值得-提的是,在本實施射,#時間範_經過百 等於儲存空間的使用百分比時,運算模組140 P依據5併關’蚊這些資料欲進行合併的優先順 序」而依據此-縣順序,合併所接㈣諸。並且在合 併效果不佳時(例如時間範_經過百分比 ^ 的使用百分比),運算模組陶將再次: 多葦貧料合併的機制。 舉例來說,假設接收模組丨10接收商品A、商品B盥 商品C的㈣,運義組刚便可_上述商品預先設^ 的優先順序(或者可由使用者自行設定),來合併所接收 的資料。假設預先設定的優先順序為商品A>商品B>商品 C。當運算模組140判斷已到達合併條件時,便將商品A ^資料以2筆為單位進行合併。之後,若在後續的時間檢 —點仍售是符合合併條件時,依據優先順序,將商品A、 商品B的㈣以2筆為單位進行合併。倘若商品a、商品 11 201032128If you reach the merge condition (that is, the percentage of the percentage of '_lang), the receiving module material will be temporarily and directly merged and stored in the temporary storage space. When the amount of the data stored in the temporary storage and the combined data meets the consolidated financial = computing module Μ 0, the combined data is stored in the storage module 130. For example, the 'operational module will first temporarily store the first data to be merged connected to the receiving module 1(1) to the temporary storage space 12〇, 2 groups 1H) when receiving the second data to be merged, That is directly with the temporary storage j 120 in the first! The data is merged, for example, by merging. Then, the computing module (10) stores the merged data storage storage module 13G, and at the same time, zeros the amount of data stored in the temporary storage space m and deleted. Similarly, when the number of data to be merged is increased to three, the computing module 140 will first (four) be in the temporary dum when receiving the first ι ^ that is to be merged; 2 data will be 'combined with the second data directly within 12 储存 of the storage space = the first data; finally, when the third data to be merged is received, the third data will be directly stored and stored. The first and second merged data in the space 12〇 are merged by the same means as described above. The transport module 140 stores the merged data to the storage module 13〇, 201032128 will temporarily store the space 12G. The original stored data is deleted and the number of data is zero, and so on. The storage of the number of 贝 Γ Γ Γ = Γ computing module 14. The adjustable storage module 130 stores the data. The storage format is, for example, 2-bit or L-type), 4-byte (medium format), 8-byte (long format) "student group (special format). For example, - the bit in the short format is m The difference can be A ^ cut (4) pen data = bei iT is 16 digits. The long format can use % digits according to this, when the storage format is larger, the value can be stored larger.,; It is mentioned that, in the implementation of the present invention, when the time range is equal to the percentage of use of the storage space, the operation module 140 P is based on 5 and the priority order of the mosquitoes to be combined, and according to the order of the county. The merger is connected to (four). And when the merge effect is not good (for example, the time range _ the percentage of use of the percentage ^), the operation module Tao will again: the mechanism of the combination of more and more poor materials. For example, suppose the receiving module 10 receives the item A, the item B, and the item C (four), and the operation group can just prioritize the item (or can be set by the user) to merge the received data of. It is assumed that the predetermined priority order is the item A> item B> item C. When the operation module 140 determines that the merge condition has been reached, the product A^ data is merged in units of two. After that, if it is determined that the sale is in compliance with the merger condition at the subsequent time, the (4) of the commodity A and the commodity B are combined in units of two in accordance with the priority order. If the goods a, goods 11 201032128
的資料以G為單==:合合併條件時,便將商品A ^ ^ ,51 ll # " 春划辦n ,驟S330所不,運鼻模組140將 始進所接收的資料是否已開始進行合併。若尚未開The data is G = single ==: When the combined conditions are met, the goods A ^ ^ , 51 ll # " Spring is handled n, and the S330 is not, the nose module 140 will start to receive the received data. Start the merger. If not already open
i收二=則如步驟S345所示,運算模組140直接將 二二3所接收的資料儲存至儲存模組130。 倘若運算模組⑽已經開始進行資料的合併時,如步 S335所示’運异模組14G會依據合併規則來減少欲進 行合併的數量。例如’料差方絲減少合併的數量,即 3筆、2筆、1筆等。之後,在步驟S340中,運算模組14〇 X上述所減少的數量為合併單位,合併所接收的資料,以 將合併後之資料儲存至儲存模組130。 同樣地,當運算模組140已經開始進行資料的合併 時,運算模組140亦可依據合併規則,決定這些資料減少 欲進行合併的優先順序,並依據此一優先順序,合併所接 收的資料。 換言之’當下一次時間檢查點未達到合併條件時,則 表示儲存模組130目前的儲存空間可以容納較之前多的資 料。因此’運算模組140便可將合併的數量減少。例如先 前為將3筆資料合併為1筆資料,此時便減少為將2筆資 料合併為1筆資料。 ' 最後’如步驟S350所示,運算模組140檢查目前的 12 uuc/n 201032128 時間檢查點是否為最後—個時間檢杳 — 個時間檢查點,則結束合併資二砧。右已到達最後一 -個時間檢查點,則返回重複=。料未到達最後 個時間檢查點。 丁,S310直到最後一 值得〉主意的是,在本實施例 中已合併的資料,將不會 _在儲存模組130 時間檢查點至下一次時;二斤變動者為目前的 的資料。㈣•太 間儲存在暫存空間120In the case of step S345, the computing module 140 directly stores the data received by the second and third modules to the storage module 130. If the computing module (10) has started to merge the data, as shown in step S335, the "transportation module 14G" reduces the number of combinations to be merged according to the merge rule. For example, the amount of the square yarn is reduced by the number of combinations, that is, 3 strokes, 2 strokes, 1 stroke, and the like. Then, in step S340, the reduced amount of the computing module 14 is the merged unit, and the received data is combined to store the merged data to the storage module 130. Similarly, when the computing module 140 has begun to merge data, the computing module 140 may also determine the priority order of the data to be merged according to the merge rule, and merge the received data according to the priority order. In other words, when the next time checkpoint does not reach the merge condition, it indicates that the current storage space of the storage module 130 can accommodate more data than before. Therefore, the arithmetic module 140 can reduce the number of merges. For example, in order to merge 3 pieces of data into 1 piece of data, it is reduced to combine 2 pieces of data into 1 piece of data. 'Final', as shown in step S350, the operation module 140 checks whether the current 12 uuc/n 201032128 time check point is the last time check - time check point, and ends the merged second anvil. The right has reached the last one - time checkpoint and returns to repeat =. The last time checkpoint was not reached. D, S310 until the last worthwhile, the information that has been merged in this embodiment will not be _ in the storage module 130 time check point to the next time; the two pounds change is the current data. (4) • The space is stored in the temporary storage space 120
的貧枓。以時間檢查點9:1〇至時間檢查f占 」 9:10〜9:20之間,運篡握έ aϋ " 而& ’在 次枓靳、、、,Μ〇會將接收模組110接收到的 貝存放在暫存空間12G,待暫存空間⑽ 之數里達到合併之數量時躲岐行合併。 、、” 〜應用於單向股票機中,以股票機而言,固 ΐ市日销(也就是上述預設的時間範圍),而在 市開f至收盤的交易時間範圍内盡量把有限的記伊、體 (即儲存模組130)做最佳的運用。 〜 以下即以股票機為例,再舉一實施例說明用以設定資 料儲存規_方法。目4故照本發明―實施例之設定資 料儲存規則的方法餘圖。請同時參關丨及圖4,在本 ^施财,電子裝置则為—股票機,其連魅遠端的股 即時父易資訊伺服is (未%示),並藉由接收模組11〇 在預設的交易時間範圍内接收來自於股市即時交易資訊伺 服β所傳輸的複數筆即時交易資料。 首先,在步驟S405中,運算模組14〇將預設的交易 日年間範圍劃分為多個時間檢查點。據此,如步驟^410所 201032128., 示,運算缝14G便可於每—個_檢魅時 模組130的儲存空間的使用狀況。以開盤時間為錯存 盤時間為16:〇〇為例,將9.〇〇〜丨6.蚩I丨八& ’收 點,糊將9.GG 16.GG劃分為41個時間檢香 點也就疋母隔10分鐘檢查一次。 依置 接著,在步驟S415中,運算模組14〇會判 間的使用百分比是否大於_顧_過百分比。^空 在早上9:10,依據所經過的交易時間佔交易時間範石 分比(即1/42),與儲存模組13〇的已使用的儲存、 的儲存空間的百分比來判斷是否需要將即時交易士料 _當運算模組140判斷儲存空間的使用百分比大於時間 範圍的經過百分比時,如步驟S42〇所示’運算模組14曰〇 將依據商品内容所預先設定的一優先順彳,逐漸增加—預 合併的商品内容的範圍。而當可合併的範圍皆已成立時,、 如步驟S425所示,運算模組HO將增加即時交易資料欲 合併之筆數。 上述優先順序例如是股市交易中各項商品的總量或成 父筆數,或者此商品是否為非漲跌停股或非自選股等資料 内谷。舉例來說,圖5是依照本發明一實施例之合併資料 的優先順序的示意圖。請參照圖5,在本實施例中可將優 先順序由大至小設定為:不進行合併、成交量小於設定比 率進行合併、成交筆數小於設定比率進行合併、非漲跌停 股票進行合併、非自選股進行合併等資料内容。當上述合 併範圍皆成立時’再調整合併筆數為三筆併一筆、調整合 201032128 併筆數四筆併-㈣朗合併筆朗達所設定的上 止。並且亦可選擇設定自選股永遠不合併。 值為 此商組140會先依據優先順序來判斷哪 二商α 口的即日守父易讀(例如成交明細)需要先進行 =供=自選股/非自選股以及冷/熱門股來判斷是°否需 一上述冷/朗股以成交量或成交筆數佔$ 體市场父h的百分比(例如門欄值設為G1%) ❹ 是否張跌停,#作觸依據。而若#所有可進行合 =^已進行合併之後記憶體空間仍不足時,貝,J進行多筆成 料4:1:2實施例令’更可設定各商品的即時交易資 ^併數1的上限值(例如,最多-次可合併達15筆), 據以控制即時交易資料被破壞的程度。 範鬥Z步驟8415,#齡㈣使用的百分比不大於時間 將過百分比時,如步驟S43G所示,運算模組⑽ ^无判斷目前所接收的即時交易資料是否已開始進行人 =所^已經㈣進行㈣合併,如步驟⑽所示,則減 2增加的合併資料的筆數。之後,在步驟S440中,當 減:ί筆Ϊ達到一下限值時’依照商品設定的優先順序, S45〇n併範圍。若尚未開始進行合併,則進行到下一步驟 旬斷疋否已達最後一個時間檢查點,若已到逵最德 2時,檢查點,則結束設定資料儲存規則的流程。若尚 1達最後一個時間檢查點,則返回重複執行步 415 直到最後-個時間檢查點。 201032128 以圖5而言,當可合併筆數已調整為兩筆合併為一筆 時,接著便依據“非自選股,,來減少合併範圍。 在^由上述步驟S415〜S440的判斷之後,在步驟s445 :算模組140便可開始設定資料儲存規則,以依據上 述儲f規則來儲存接收模組11〇所接收的即時交易資料。 =’如步驟S450所示,運算模組14〇檢查目前的 、曰一點是否為最後一個時間檢查點。若已到達最後— ❿ :日^檢查點’則結束合併即時交易資料的流程。若尚未 =後個時間檢查點,則返回重複執行步轉S彻直 到取後—個時間檢查點。 中,32=驟8415·是用以在接收資料的過程 ⑽定次^ U的使用狀輯行檢查,並即時改變及 Γ诚I枓猶存規則。據此,便可在接收資料的過程中, ;:=5r5r;定的資料_ 規則來儲存j:於―的商品’並且依據資料儲存 是依儲f資料的詳細步驟。圖6 灸隨r實儲存_的方法流程圖。請同時 二…圖1及圖6,在步驟S605中,透過運算 —接收模組110所接收的即時交 、π " 中的資料鍅左迪日丨^^ 父匆貝科疋否屬於步驟S445 施例中,即時交易資料為商品明細。 同口在本只 所示當===_的商品時’如步驟議 運异模组⑽將商品%細暫時存放㈣存空間⑽ 中Barren. Check the f account with time checkpoint 9:1〇 to 9:10~9:20, and hold the switch aέ " and & 'in the second, ,,, and will receive the module The received shells are stored in the temporary storage space 12G, and are merged when the number of the temporary storage space (10) reaches the combined number. ~, ~ applied to the one-way stock machine, in the case of stock machines, the daily sales of Gushu City (that is, the above-mentioned preset time range), and as far as possible within the trading time range from the market opening to the closing price The best use of the computer and the body (ie, the storage module 130) is as follows: hereinafter, the stock machine is taken as an example, and another embodiment is used to set the data storage rule_method. The method of setting the data storage rule is the same. Please refer to Figure 4 and in Figure 4, the electronic device is the stock machine, and the stock of the remote sensor is immediately the parent information servo is (not shown And receiving, by the receiving module 11〇, a plurality of real-time transaction data transmitted from the stock market real-time transaction information servo β within a preset trading time range. First, in step S405, the computing module 14〇 The range of the trading day is divided into a plurality of time check points. According to this, as shown in step ^410, 201032128., the operation seam 14G can be used in the storage space of the module 130 every time. The opening time is 16 for the wrong time. , will be 9. 〇〇 ~ 丨 6. 蚩 I 丨 eight & 'receiving points, paste will 9.GG 16.GG divided into 41 time to check the fragrant point will also check the mother 10 minutes after the separation. In step S415, the operation module 14 〇 determines whether the percentage of use is greater than the _ _ _ percentage. ^ empty at 9:10 in the morning, according to the transaction time elapsed accounted for the trading time Fan Stone (ie 1/42) And determining, according to the percentage of the used storage and storage space of the storage module 13 , whether the need to use the real-time transaction material _ when the operation module 140 determines that the usage percentage of the storage space is greater than the percentage of the time range, such as the step The "operation module 14" shown in S42〇 will gradually increase the range of the pre-merged product content according to a predetermined priority set by the product content. When the mergeable range is established, as in step S425 As shown, the computing module HO will increase the number of real-time transaction data to be merged. The above priority order is, for example, the total amount of commodities in the stock market transaction or the number of fathers, or whether the commodity is non-renewed or non-returned Self-selected stocks, etc. For example, FIG. 5 is a schematic diagram of a priority order of merged materials according to an embodiment of the present invention. Referring to FIG. 5, in this embodiment, the priority order may be set from large to small: no merge, and the transaction volume is less than Set the ratio to merge, the number of transactions is less than the set ratio for merger, the non-ups and downs of stocks to merge, the non-self-selected stocks to merge, etc. When the above scope is established, 're-adjust the number of mergers into three strokes, one stroke, Adjust the combination of 201032128 and the number of pens and - (4) Lang merged with the pennant set by Ronda. And you can also choose to set the stocks to never merge. The value of this group 140 will first determine which two firms are based on the priority order. The mouth of the day is easy to read (such as the transaction details) need to be first = for = self-selected stocks / non-self-selected stocks and cold / hot stocks to determine whether it is necessary to ° a cold / long stocks in volume or turnover accounted for $ The percentage of the body market parent h (for example, the gate bar value is set to G1%) ❹ Whether it is a limit, ##. And if #all can be combined =^ has been merged and the memory space is still insufficient, Bay, J to make multiple materials 4:1:2 example order to set up the real-time transaction of each commodity ^ and number 1 The upper limit (for example, up to - times can be combined up to 15), according to the extent to which the real-time transaction data is destroyed. Fandou Z step 8415, #龄(四) The percentage used is not greater than the time will exceed the percentage, as shown in step S43G, the operation module (10) ^ does not judge whether the currently received real-time transaction data has started to be carried out. Perform (4) merger, as shown in step (10), then subtract 2 to increase the number of consolidated data. Thereafter, in step S440, when the subtraction: Ϊ Ϊ Ϊ reaches the lower limit value, the range is S45 〇 n in accordance with the priority order set by the product. If the merging has not yet started, proceed to the next step to see if the last time check point has been reached. If the check point has been reached, the process of setting the data storage rule is ended. If the last time checkpoint is reached, return to step 415 until the last time checkpoint. 201032128 As shown in Fig. 5, when the number of combinable pens has been adjusted to be two pens combined into one, then the non-self-selected stocks are used to reduce the merge range. After the judgment by the above steps S415 to S440, in the step S445: The calculation module 140 can start setting the data storage rule to store the real-time transaction data received by the receiving module 11 according to the storage rule. = 'As shown in step S450, the operation module 14 checks the current Whether or not it is the last time checkpoint. If it has reached the last - ❿: day ^ checkpoint', the process of merging the real-time transaction data is ended. If it has not been = the next time checkpoint, Take the post-time checkpoint. In the middle, 32=step 8415· is used to check the usage of the data in the process of receiving the data (10), and immediately change the rules of the Γ 枓 I. In the process of receiving data, ;:=5r5r; fixed data _ rules to store j: in the 'products' and according to the data storage is a detailed step according to the storage f data. Figure 6 moxibustion with r real storage _ Method flow chart. Please also two 1 and FIG. 6, in step S605, the data in the instant intersection, π " received by the operation-receiving module 110, 左 左 丨 ^ ^^ 匆 匆 贝 贝 属于 属于 属于 属于 属于 属于 属于 属于 属于 属于 属于 属于 , The real-time transaction data is the product details. The same port is only when the product is ===_, as in the case of the step-by-step negotiation module (10), the item % is temporarily stored in the (four) storage space (10).
201032128 / i〇c/n is"的商ΐ=15中’運算模組140檢查暫存空間 定的合併筆^同Γ的筆數是轉資料儲存規則所設 若暫存二併之後’再寫入至儲存模組⑽。 筆::=!的商品明細所累計的筆數尚未符合合併 合併動作商°°明細所累計的筆數符合合併筆數再進行 在本實施例中,運算模組140在 仏更:寫入至鱗模組。然而’二二= ==且140亦可先直接將商品明細合併姐於暫存空間 入人二黎Ϊ暫存空間120中的商品明細所累計的筆數已符 :口 ^ ·數時’運算模組刚再將合併後的商品明細寫入 至儲存模組13〇。 ‘ 返回步驟S605,當商品明細不屬於合併範圍内 時’如步恤所示,運算模組140直接將 入至儲存模組130中。 舉例來說,圖7Α〜圖7Ε是依照本發明一實施例之股 市商品明細資料的合併示意圖。請參照圖7Α〜圖7Ε,在本 1施例中以一個商品之成交明細為例,並假設將每兩筆即 日^ 乂易資料的成交明細中的「單量」内容合併成1筆。 圖7Α為未合併前之成交明細。圖7Β〜圖7Ε為兩筆成 父明細中的「單量」内容合併為一筆的實施態樣。當時間 繞過至13:〇2Β夺,表示暫存空間120中已存在13:00與13:〇2 兩筆成交明細。因此,便可將13:00與13:02兩筆成交明 201032128^ 細合併,寫入至儲存模組130。在另一個實施例中,當時 間經過至13:00時’ 13:00的這丨筆成交明細會先暫存至暫 存空間120中’續當時間經過至13:〇2時,13:〇2這1筆成 交明細將直接與暫存空間120中13:〇〇的這1筆成交明細 進行合併後,寫入至儲存模組13〇。 由於合併是屬於破壞性的壓縮,合併的方式亦因資料 特性而有不同選擇,可依據使用這所重視之内容來決定合 ⑩ 併的内容。例如,以時間、買進、賣出、成交、單量而言, 除單量外,合併時僅記錄最後一筆的時間、買進、賣出、 成父,而將單量加總。如圖7B的13:〇2所示之成交明細, 13:〇〇的單量2加上13:02的單量28而獲得總量為3〇。 接著’在圖7B中’當時間經過至13:〇5時,暫存空間 120中僅存在13:05的成交明細。此時,圖7B的13:02的 成父明細已儲存至健存模組13〇尹。之後,在圖7C中, 备%間經過至13:06時,便可將圖7A所示之13:〇5與13:06 兩筆成父明細合併為圖7C之13:〇6的成交明細,即13:06 ® 的總量為3加上9。 在圖7D中’當時間經過至13:07時,暫存空間12〇 中,存在13:07的成交明細。此時,圖7D的13:〇2與丨3:〇6 =筆的成交明細已儲存至儲存模組13〇中。之後,在圖7E 中當時間經過至13:08時,便可將圖7A所示之13:〇7與 13.⑽兩筆成交明細合併為圖兀之a⑽的成交明細,即 13:〇6的總量為6加上146。 以此類推,當暫存空間120中存在兩筆資料時,便可 18 中已存在的上1201032128 / i〇c/n is"'s business=15' operation module 140 checks the temporary space of the merged pen ^ the number of the same number is the data storage rule set if the temporary storage and then 'rewrite To the storage module (10). The number of pens accumulated by the pen::=! has not yet met the number of pens accumulated in the merged action quotient. The number of pens is in accordance with the number of merged pens. In this embodiment, the operation module 140 is in the process of writing: Scale module. However, 'two two === and 140 can also directly merge the product details into the temporary storage space into the second product of the second Ϊ Ϊ temporary storage space 120, the number of the accumulated number of the number has been: mouth ^ · number when 'operation The module just writes the merged product details to the storage module 13〇. ‘Returning to step S605, when the item details are not within the scope of the combination', as shown in the step, the computing module 140 directly enters the storage module 130. For example, FIG. 7A to FIG. 7B are schematic diagrams showing the merger of stock product details according to an embodiment of the present invention. Referring to FIG. 7A to FIG. 7B, in the first embodiment, the transaction details of one commodity are taken as an example, and it is assumed that the "single amount" contents in the transaction details of each of the two daily data are merged into one. Figure 7 is a breakdown of the transaction before the merger. Fig. 7Β~Fig. 7Ε are the implementations in which the “single quantity” contents in the two parental details are combined into one. When the time is bypassed to 13: 〇 2, it means that there are already 13:00 and 13: 〇2 two transaction details in the temporary storage space 120. Therefore, the two transactions of 13:00 and 13:02 can be combined and written to the storage module 130. In another embodiment, when the time passes until 13:00, the number of the transaction details of '13:00 will be temporarily stored in the temporary storage space 120'. When the time passes to 13: 〇 2, 13: 〇 2 The transaction details will be directly combined with the transaction details of 13:〇〇 in the temporary storage space 120, and then written to the storage module 13〇. Since the merger is a destructive compression, the way of merging is also different depending on the characteristics of the data, and the content of the combination can be determined according to the content of the application. For example, in terms of time, buy, sell, trade, and quantity, except for a single quantity, only the last time, buy, sell, and become a parent are recorded in the merger, and the total amount is added. As shown in Fig. 7B, the transaction details shown in 13: 〇 2, 13: the singular quantity 2 of 〇〇 plus the single quantity 28 of 13:02, and the total amount is 3 获得. Then, in Fig. 7B, when the time elapses to 13: 〇 5, there is only a transaction detail of 13:05 in the temporary storage space 120. At this time, the father's details of 13:02 of FIG. 7B have been stored in the health module 13〇. After that, in FIG. 7C, when the preparation % is passed to 13:06, the 13:〇5 and 13:06 shown in FIG. 7A can be merged into the parent details into 13 of FIG. 7C: the transaction details of 〇6 That is, the total amount of 13:06 ® is 3 plus 9. In Fig. 7D, when the time passes to 13:07, there is a transaction detail of 13:07 in the temporary storage space 12〇. At this time, 13: 〇2 and 丨3: 〇6 = the transaction details of the pen have been stored in the storage module 13A. Then, in FIG. 7E, when the time passes to 13:08, the transaction details of 13:〇7 and 13.(10) shown in FIG. 7A can be merged into the transaction details of a(10) of the figure, that is, 13:〇6 The total amount is 6 plus 146. By analogy, when there are two pieces of data in the temporary storage space 120, the upper one already exists in 18
201032128 進行合併之動#。或直接與暫存空間12〇 筆資料進行合併。 另外,上述合併資料的方法可藉由一 成、k二程式碼片段在载人電子裝置令並執行之 後,即可完成上述合併資料的方法。 π上所述,在上述實施例中,加入時間因素來 t併制岐據,明鮮韻存模組 得資 料合併集中在後半段,讓制者不轉覺資料的合 股市即時^而言’隨著每日交易成交量的不同,有熱絡 也^可能交易平淡’藉由上述實施例便可在有限儲存模組 的ί境下、,,亚於㈣檢查關達前,仍保持能夠揭露相當 的資5fl。亚且,在交易量大時,不會讓儲存模組之儲存空 間迅速耗盡。 雖然本發明已以較佳實施例揭露如上,然其並非用以 限定本發明,任何所屬技術領域中具有通常知識者,在不 脫離本發明之精神和範圍内,當可作些許之更動與潤飾, 因此本發明之保護範圍當視後附之申請專利範圍所界定者 為準。 【圖式簡單說明】 圖1是依照本發明一實施例之電子裝置的方塊圖。 圖2是依照本發明一實施例之合併資料的方法流程 ν»〇/π 201032128 圖3是依照本發明另一實施例之合併資料的方法流程 圖0 圖4歧照本發明_實_之設定㈣儲存規則的流 枉圖。 _ j 5是依照本發明—實施例之合併資料的優先順序的 不思圖。 圖6疋依照本發明一實施例之儲存資料的方法流程 圖。 響 圖一7A〜圖7E是依照本發明一實施例之股市商品明細 的合併示意圖。 【主要元件符號說明】 100 :電子裝置 110 :接收模組 120 :暫存空間 130 ·错存模組 ® 140 :運算模組 S210〜S230 :本發明一實施例之合併資料的方法各步 驟 S305〜S350 :本發明另一實施例之合併資料的方法各 步驟 S405〜S450 :本發明—實施例之設定資料儲存規則的 方法各步驟 S605〜S625 :本發明一實施例之儲存資料的方法各步 20201032128 The movement of the merger #. Or directly merge with the scratch space 12〇 data. In addition, the method for merging the data may be completed by the manned electronic device and executed by the manned electronic device. As described above, in the above embodiment, the time factor is added to make the data, and the data of the fresh and vivid memory module is merged and concentrated in the second half, so that the makers do not change the information of the stock market immediately. With the difference in daily trading volume, there is a hot network and it is possible to trade plainly. 'With the above embodiment, it can be exposed under the condition of limited storage module, and before (4) checking the Guanda, it still remains open. Quite a capital of 5fl. In addition, when the transaction volume is large, the storage space of the storage module will not be exhausted. Although the present invention has been disclosed in the above preferred embodiments, it is not intended to limit the invention, and any one of ordinary skill in the art can make some modifications and refinements without departing from the spirit and scope of the invention. Therefore, the scope of the invention is defined by the scope of the appended claims. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a block diagram of an electronic device in accordance with an embodiment of the present invention. 2 is a flow chart of a method for merging data according to an embodiment of the present invention. FIG. 3 is a flow chart of a method for merging data according to another embodiment of the present invention. FIG. 4 is a view of arranging the _real_ of the present invention. (4) A rogue diagram of the storage rules. _j 5 is an unreasonable priority of the merged material in accordance with the present invention. Figure 6 is a flow chart showing a method of storing data according to an embodiment of the present invention. Figures 7A to 7E are schematic diagrams showing the merger of stock market commodity details in accordance with an embodiment of the present invention. [Description of main component symbols] 100: electronic device 110: receiving module 120: temporary storage space 130 • memory module 140: computing module S210 to S230: method for combining data according to an embodiment of the present invention, step S305~ S350: Method for merging data according to another embodiment of the present invention, steps S405 to S450: Method for setting data storage rules according to the present invention - steps S605 to S625: steps 20 of storing data according to an embodiment of the present invention
Claims (1)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
TW98105015A TWI402747B (en) | 2009-02-17 | 2009-02-17 | Method for combining data and electronic apparatus and computer program product using the method thereof |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
TW98105015A TWI402747B (en) | 2009-02-17 | 2009-02-17 | Method for combining data and electronic apparatus and computer program product using the method thereof |
Publications (2)
Publication Number | Publication Date |
---|---|
TW201032128A true TW201032128A (en) | 2010-09-01 |
TWI402747B TWI402747B (en) | 2013-07-21 |
Family
ID=44854788
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
TW98105015A TWI402747B (en) | 2009-02-17 | 2009-02-17 | Method for combining data and electronic apparatus and computer program product using the method thereof |
Country Status (1)
Country | Link |
---|---|
TW (1) | TWI402747B (en) |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4812192B2 (en) * | 2001-07-27 | 2011-11-09 | パナソニック株式会社 | Flash memory device and method for merging data stored therein |
TWI300186B (en) * | 2004-07-30 | 2008-08-21 | Mediatek Inc | Method and apparatus for data recording with pseudo-merge |
KR100684887B1 (en) * | 2005-02-04 | 2007-02-20 | 삼성전자주식회사 | Data storing device including flash memory and merge method of thereof |
-
2009
- 2009-02-17 TW TW98105015A patent/TWI402747B/en not_active IP Right Cessation
Also Published As
Publication number | Publication date |
---|---|
TWI402747B (en) | 2013-07-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN104519771B (en) | A kind of vending system and method | |
CN107369012A (en) | A kind of method for processing payment information and system and the prepaid card processing method with performance bond insurance mechanism | |
CN105135782B (en) | A kind of Intelligent refrigerator management system based on Internet of Things | |
CN103150853B (en) | A kind of system and method for rapid payment clearance | |
CN105023134A (en) | Locker terminal, automatic distribution method and automatic distribution system | |
CN109081033A (en) | Intelligent cargo cabinet control method and system | |
CN106557929A (en) | Logistics information processing method and processing device | |
CN106663305A (en) | Product of interest precedent delivery service providing device and method using unmanned courier box, and recording medium on which computer program is recorded | |
CN105981071B (en) | Product delivery service system in electronic commerce using smart phone and method thereof | |
CN109997346A (en) | Service dispatch system and method based on user behavior | |
CN104123651B (en) | The operational order identifying processing method and system of internet trading system | |
CN106652236A (en) | Locker selling method and system | |
CN109416662A (en) | Use the selective flash memory compression/de-compression of storage utilization rate ring | |
US9503580B1 (en) | Computing device assistance for phone based customer service representative interaction | |
CN110046969A (en) | Dispense marketing system and Correlation method for data processing method | |
JP2010026820A5 (en) | ||
TW201032128A (en) | Method for combining data and electronic apparatus and computer program product using the method thereof | |
CN108197827A (en) | A kind of distribution information processing method, device, equipment and medium | |
WO2023082549A1 (en) | Manufacturing task allocation method and apparatus oriented toward intermodal freight transport under multi-factor constraints | |
CN204347983U (en) | China Mobile Service Hall self-recharging fare payment system | |
CN109492016A (en) | A kind of exchange settlement method and device | |
CN104811529A (en) | Mobile terminal or intelligent handling method based on movement mode | |
CN107392341A (en) | Casing reserving method and system | |
JP4681434B2 (en) | Reception management system | |
CN114548967A (en) | Electronic payment method, electronic payment device, computer device and storage medium |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
MM4A | Annulment or lapse of patent due to non-payment of fees |