TW536675B - Scheduling arrangement system and method - Google Patents

Scheduling arrangement system and method Download PDF

Info

Publication number
TW536675B
TW536675B TW89113346A TW89113346A TW536675B TW 536675 B TW536675 B TW 536675B TW 89113346 A TW89113346 A TW 89113346A TW 89113346 A TW89113346 A TW 89113346A TW 536675 B TW536675 B TW 536675B
Authority
TW
Taiwan
Prior art keywords
analysis
user
scope
item
patent application
Prior art date
Application number
TW89113346A
Other languages
Chinese (zh)
Inventor
Chih-Min Chen
Original Assignee
Pcyi Network Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Pcyi Network Corp filed Critical Pcyi Network Corp
Priority to TW89113346A priority Critical patent/TW536675B/en
Application granted granted Critical
Publication of TW536675B publication Critical patent/TW536675B/en

Links

Abstract

A scheduling arrangement system and method comprises a memory module, an analysis module and a scheduling module, in which the memory module stores the information inputted by user, the analysis module performs analysis by virtue of the information in memory module and multiple scheduling criteria inputted by user to at least obtain an optimal managed time to engage in terms of each scheduling criteria and the scheduling module proceeds scheduling with respect to scheduling criteria in accordance with the obtained optimal time to engage to obtain at least a scheduling result. The scheduling result is given to user as reference. The invention also discloses a scheduling method.

Description

536675 五、發明說明(1) 【習知技術】 行事曆為一般安排行程常用的工具。若有任何欲辦理 事項’均可預先紀錄於行事曆中,以安棑行程並達到提醒 的功效。536675 V. Description of the invention (1) [Knowledge technology] Calendar is a commonly used tool for general schedules. If there is anything you want to do, it can be recorded in the calendar in advance, so as to secure the schedule and achieve the effect of reminding.

由於電腦科技的發達,目前已有多種實施於電腦上, 甚至網際網路上的行事曆出現,且其功能亦日益多元化。 又’隨者電腦與網際網路發展,行事曆除了單純的記事功 月b以外’已成為一種多功能之行事安排系統。例如,行事 安排系統可主動地提醒使用者欲辦理事項的時間將至,而 不需使用者去檢閱。又如,行事安排系統可與通訊錄等配 合’主動提醒使用者家人或朋友的生日,而不需使用者輸 入’以提醒使用者其親友的生日將至。 然而,現今仍缺乏一種 議之行事安排系統與方法。 錄待辦事項之外,還能夠主 議,對使用者而言,可以節 間;對提供行事安排系統的 的的使用意願,進而吸引更 之行事安排系統。 能夠主動地提供使用者行程建 若行事安排系統除了單純地紀 動地提供較佳辦理時間的建 痛' 使用者自行安排行程的時 業者而言,則可以增加使用者 $的使用者前來使用其所提供 承上所述 可知如何提俾 行程建議之行事安排系統與方 題0 —種能夠主動地提供使用者 法,已成為一亟待解決之課Due to the development of computer technology, there have been various implementations on computers, and even calendars appearing on the Internet, and their functions have become increasingly diverse. In addition, with the development of the computer and the Internet, the calendar has become a multifunctional schedule system in addition to the simple memorizing function b. For example, the scheduling system can proactively remind users that the time to do things is approaching, without the user having to review them. As another example, the action scheduling system can be combined with an address book and the like to proactively remind users of the birthdays of family members or friends, without requiring users to enter, to remind users that the birthdays of their relatives and friends are approaching. However, there is still a lack of a deliberate system and approach to conduct arrangements. In addition to recording to-do items, it is also possible to suggest that for users, it is time-saving; and the willingness to use the system to provide an action arrangement system, thereby attracting more action arrangement systems. Can actively provide user itinerary. If the scheduling system is in addition to simply discontinuing the provision of better processing time, as for the user who arranges the itinerary by himself, users who increase the user's $ can come to use What it provides is an action arrangement system and formula 0 for knowing how to suggest itineraries—a method that can actively provide user methods has become an urgent problem.

【發明概要】[Summary of Invention]

$ 4頁 536675 五、發明說明(2) 姑你ί對上述問題’本發明之目的為提供一種行事安排系 1 ^盘法,其能夠對使用者所輸入之複數個行事要件進行 分析與排彳’並提供使用者排序結果以供其參考要件進订 括-ίΐίΓ的:本發明係提供一種行事安排系統,包 禮έ二ί 一析模組以及一排程模組。其中,圮憶 組ΐΐϊΓ吏輸入之資料;分析模組係藉由記憶模 析,以分別針對;;事;:進行分 間·妯招伊4 寸仃争罟仵,付到至少一較佳辦理時 $ # ^ $吴、、且則依所得到之較佳辦理時間對該等行事要件 用Γ以得到至少一排序結果,該排序結果係 該使用者以供其參考。 Τ攸仏、,口 ,發明亦提供一種行事安排方 一分析程序以及一妯链和生^ ^ 。己11'耘序、 用者所輸入之資料·八f序。/、中,記憶程序係儲存該使 行事要件進彳ϋ 析程序係依使用者所輸入之複數個 二爭要件進仃分析,以分別對各該等行事要 :ί 排程程序則依所得到之較佳辦理時㈣ 結ϊ ;;::n:,rr至少一排序結該排序 吸1、、'、口遠使用者以供其參考。 【較佳貫施例之詳細說明】 以下將參照相關圖式,句 事安排系統盥方法,直Φ二本毛明較佳實施例之行 照符號表示:、/、中相同的兀件或步驟將以相同的參 凊參照圖1 ’依本發明較佳實施例之行事安排系紹包$ 4 页 536675 V. Description of the invention (2) Regarding the above-mentioned problem, the purpose of the present invention is to provide a behavior arrangement system, which can analyze and sort out a plurality of behavior elements input by the user. 'And provide the user's ranking results for their reference requirements to include-ΐ Γ Γ: The present invention provides an action scheduling system, including an analysis module and a scheduling module. Among them, the data input by the 圮 memory group; the analysis module is based on the memory analysis to target separately; the thing ;: the division · 妯 招 伊 4 inch competition, paid at least one better time $ # ^ $ Wu, and according to the better processing time obtained, Γ is used for these acting elements to obtain at least one sorting result, and the sorting result is for the user's reference. The invention also provides an analysis program and an analysis program, as well as a chain of links. 11's preface, the information entered by the user, 8f preface. / 、 In the memory program, the analysis procedure for storing the required elements is analyzed based on a plurality of second-competition elements input by the user, so as to separately analyze each of these behaviors: The scheduling procedure is obtained according to the obtained The best time to handle is ㈣ ㈣;; :: n :, rr At least one sorting result should sort 1, 1, ', far away users for their reference. [Detailed description of the preferred embodiment] The following will refer to the related diagrams, the method of sentence arrangement system, and the two symbols of the preferred embodiment of Maoming indicate the same elements or steps: With reference to FIG. 1 with the same reference, the operation arrangement according to the preferred embodiment of the present invention

第5頁 536675 五、發明說明(3) 括一記憶模組11、一分析模組12以及一排程模組13。豆 中,記憶模組11係儲存使用者50所輸入,且於分析模組12 進行分析時所需之資料。至於該資料的内容為何,需視分 析模組12係進行何種分析而定。例如,若分析模組12係進 行二方为析,亦即,推异某方位為吉利方位的時間,則記 憶模組11就必須至少儲存進行吉方分析所需之資料。、° 在記憶模組1 1中,可採用硬碟機或可讀寫式光碟機 。可=間儲存資料之記憶裝i,亦可為隨機存取記憶 田糸統關閉後所儲存資料也隨之消失之記憶裝置。 二而,若在記憶模組11中,僅採用如隨機存取記憶體等, 所2資料也隨之消失之記憶裝£,則每當 新於ί =入仃事女排糸統1後,就必須將所有的資料重 新輸入一遍’造成使用者50的不便。 里 1關閉後所儲存資料也隨之消失之記憶褒置並二 神’本發明之發明人仍建議於記憶模組“ 可長時間儲存資料之記憶裝置。 彳木用 :析模組12係依使用者5。所輸入之複 :丁刀:广別得到各行事要件之一較佳辦理時間。:進 ’ ^用者50輸入其拜訪客户前的起始位置(如 者50本身辦公室的所在地),以及複數 ☆ 使用 2拜訪客戶之地址)後,分 組 :, 對於使用者50之起始位置的方位,丄十=的立置相 :對t個客戶之所在位置進行分析後心;:各二’ -別付到其相對於起始位置方位為吉方的時間。此時Page 5 536675 V. Description of the invention (3) Includes a memory module 11, an analysis module 12, and a scheduling module 13. In the bean, the memory module 11 stores data input by the user 50 and required for analysis by the analysis module 12. As for the content of the data, it depends on what kind of analysis is performed by the analysis module 12 series. For example, if the analysis module 12 performs two-way analysis, that is, the time when a certain bearing is auspicious, then the memory module 11 must store at least the data required for performing auspicious analysis. , ° In the memory module 1 1, a hard disk drive or a rewritable optical disk drive can be used. It can be a memory device that stores data occasionally, and it can also be a random access memory. The memory device that the stored data also disappears after the system is closed. Secondly, if the memory module 11 only adopts a memory device such as random access memory, etc., all the data will also disappear. Whenever new is added to the volleyball system 1, it will be All information must be re-entered 'causing inconvenience to user 50. The memory of the stored data also disappears after Li 1 closes, and the two gods' the inventor of the present invention still recommends in the memory module "memory device that can store data for a long time. For Tochigi: Analysis module 12 series according to User 5. Entered reply: Ding Dao: Guangbei get one of the best processing time for each of the requirements .: Enter '^ User 50 enter the starting position before visiting the customer (such as the location of the office of 50) , And plural ☆ using the address of 2 visiting customers), grouping: For the orientation of the starting position of user 50, 丄 ten = standing position: analysis of the locations of t customers; two each '-Don't pay until it's agitated relative to the starting position. At this time

第6頁 536675 五、發明說明(4) —___ 該拜訪時間。亦即’當行事要件為「拜 「較佳拜:時;::事要件之較佳辦理時間即為該客戶之 目的:ί照Γ客戶若1用者二欲由起始位置80去拜訪三個 可分別針對客戶一81、客戶二82與客;8三3,則分析模 的方位A、B與c ’配合使 目對於起 何時會是吉方。如此,可 間。至於i算::^別得到至少一較佳拜訪時 夕1 % 方的方法’長久以來即為命理學宕無 t课喊,故推算吉方的命理 干豕所研究 特定^的吉方= 特定的使用者,某— 數個:ΐί:的jm於記憶模組u中,預先建立複 選取即可。如此可減少輸=自記 等其所有客戶之資料,包 ==址例 通訊錄,:此,使H:1二並建立成為-易於檢索之 組”,該二 料分析模組12可自記憶模 13即針對該等較::ί 較理時間後’排程模、组 結果。請參照圖3,當針; 536675 五、發明說明(5) 戶二8 2與客戶二8 3之較佳拜訪時間後,即可對其進行排 序,以決定拜訪客戶的行程。由於客戶二82有兩個較佳拜 訪時間’故可以得到兩個不同的拜訪客戶行程,即圖3所 示之行程-與行程二。此時,使用者50即可考慮本身的狀 況,來決定採用哪一種行程來拜訪客戶人 分析模組1 2與排程椒組1 3可採用如a g I c (aPPlication-specific integrated circuU,特定鹿 用積體電路)等之元件,將分析與排序之法則内建於硬體 中’亦可採用RISC (reduced instruction set computing,精簡指令集運算)處理器或cisc (c⑽Μ” inStructlon set computing,複雜指令集運算)處理 器,並配合紀錄有所需之程式碼之記憶裝置。 * - 圖4 ’分析模組12亦可分別針對客戶-81、客 戶三83相對於起始位置80的方位,以及三者彼 旁Π方位來進行吉方分析。在圖4中,各個方位 方位為吉方的時間後的時間。在得到各個 析,並產生可行之客戶』=13即可對各種情況進行分 之後所產生之可行的拜訪 )所產生之拜訪行程。 ’(Β)則顯不由圖5 (Α 同處需;=,圖_5 (B?所示之行程與圖3所示行程之不 由起於位詈ίΓη所不的仃程,係使用者5 0每次拜訪客戶均 每㈣訪Si 圖5 (Β)所示之行程,係使用者5〇 蚪,除拜訪第一個客戶時係自起始位置8 〇出Page 6 536675 V. Description of the Invention (4) —___ The visiting time. That is, when the essentials of the event are "better worship", "better worship" ::; the better processing time of the essentials is the purpose of the customer: 照 according to the customer if the user 1 user 2 wants to visit 3 from the starting position 80 Each can be targeted at customer one 81, customer two 82, and customer; eight three three, then the orientations of the analysis module A, B, and c 'are coordinated to make when the project will be good. So, it can be time. As for i :: ^ Do n’t get at least one better method of visiting 1% of the time. 'It has been called for a long time for numerology, so it is estimated that Jifang ’s numerology is dry. The specific ^ Jifang = specific users, some — several : Ϊ́ί: jm in the memory module u, you can create a preselection. In this way, you can reduce input = self-recording and other information of all its customers, including = address book address list: this, so that H: 1 two and create "Become-easy to retrieve the group", the two-material analysis module 12 can self-memory the module 13 for these comparisons :: 理 After the comparison time, the 'scheduling mode, group results. Please refer to Figure 3, when the needle; 536675 V. Description of the invention (5) After the best visiting time of household 2 8 2 and customer 2 8 3, you can sort them to determine the schedule of visiting customers. Since customer two 82 has two better visiting time ', two different visiting customer itineraries can be obtained, namely the itinerary shown in FIG. 3-and itinerary two. At this time, the user 50 can consider his own situation to decide which itinerary to visit the customer analysis module 12 and the schedule pepper group 1 3. For example, ag I c (aPPlication-specific integrated circuU, specific deer Using integrated circuit) and other components, the analysis and sequencing rules are built into the hardware. RISC (reduced instruction set computing) processors or cisc (c⑽Μ ”in Structlon set computing, complex instructions can also be used. Set computing) processor, and cooperate with a memory device that records the required code. *-Figure 4 'The analysis module 12 can also be used for the orientation of customer-81, customer three 83 with respect to the starting position 80, and three The analysis of the Kyrgyzstan side is performed by the azimuth next to it. In Figure 4, each azimuth is the time after the Kyrgyzstan time. After each analysis is obtained and a viable customer is obtained, "= 13 can be divided into various situations. (Viable visits) produced by the visit itinerary. '(B) is obviously not shown in Figure 5 (A is required at the same place; =, Figure _5 (The trip shown in B? All Ding the drive system 50 users per each visit customers have access Si (iv) in FIG. 5 (Β) shown in the stroke-based user 5〇 tadpole, in addition to the first line when visiting a client from the starting position of the square 8

第8頁 536675 五、發明說明(6) 發外’拜訪其它的客戶時’均由上一個已拜訪的客戶處出 發。使用者5 0可視自己的需要,決定使用哪一種方式來拜 訪客戶。 請參照圖6,依本發明較佳實施例之行事 括-記憶程序21、-分析程序22以及一排程程序 中,記憶程序21係紀錄使用者所輸入之資料;分析程序。 係依該資料與使用者所輸入之複數個行事要件來進行 f ’以分別得到各行事要件之至少一較佳辦理時 程序23則㈣等較佳辦理時間對該等矛 一排序結果,該排序結果係提供給該使Π以 在記憶程序2 1中,佶用去&认 ^ 序22進行分析時所;之=者入之資係為分析程 憶程序21可將該資料幹入至 田使用者輸入資料後,記 要^ ^ ^ 料輸至一可長時間儲存資料之印忤賠 置,如硬碟機或可讀寫式光碟機等。如:存己憶裝 次進行行事安排方法2時 田使用者欲再 如此,可大幅提升使用 』的\抖就不必再次輪入。 分析程序22係針===安排方法2的便利性。 數個目的位置,較佳辦;Ϊ = 位置與欲拜訪之複 始位置之方位為吉 、為該專目的位置相對於起 數個目的位置進行吉方:::二^斤程序22係、 程序23則對所得到的較佳辦理0==訪口。排程 了间進仃排序,以得到至少Page 8 536675 V. Description of the invention (6) When sending out ‘visiting other customers’, it will be issued by the previous customer. User 50 can decide which way to visit customers according to his needs. Referring to FIG. 6, the actions according to the preferred embodiment of the present invention include-memory program 21, -analysis program 22, and a scheduling program. Memory program 21 records data input by the user; analysis program. F 'is performed according to the data and a plurality of operating requirements input by the user to obtain at least one preferred processing procedure for each of the operating requirements, 23 procedures, and other preferred processing times to sort the results. The result is provided to the ambassador to use the & cognition sequence 22 for analysis in the memory program 21; where the asset of the person is the analysis program, the program 21 can import the data to the field. After the user enters the data, remember to input ^ ^ ^ data into a seal that can store the data for a long time, such as a hard disk drive or a rewritable optical drive. For example, Cun Jiyi pretends to perform the operation arrangement method at 2 o’clock. If the user wants to do this again, the use of \ ”can be greatly improved, so you do n’t have to take turns again. Analysis program 22 series needle === convenience of arrangement method 2. Several destinations, better to do; Ϊ = The position and orientation of the restarted position to be visited are good, and the special position is compared with the several destinations. ::: 2 ^ jin Program 22 Series, Program 23 0 == visit to the better. Scheduling in order to get at least

$ 9頁 536675 五、發明說明(7) 一排序結果 序,以得到 有關記 容,與之前 再贅述。惟 明之行事安 於一紀錄媒 取該紀錄媒 此外, 修改或變更 行事要件改 等欲辦理事 事要件,為 家、打掃及 紀錄之資料 内使用者進 程序2 3以排 種不同的行 增加排序的 的條件,如 依本發 錄待辦事項 礅。所以, 法可以節省 :例如’可對目的位置之較佳拜訪時間 至少一較佳拜訪行程。 f ί:2」、分析程序22與排程程序23之詳細内 币^立=排系統1的說明大致類似,故此處不 :方2寫=該項技術者可輕易地將依本發 體上。如此’:、可:見並將該電腦程式紀錄 體,U β Y ㊉見之電腦或伺服器來讀 體’以執仃依本發明之行事安排方法。 者亦可輕易地對本發明進行等效 為發明之精神與範嘴。例如,可將 …人辦里事項,而較佳 項之吉時。請參照圖7,若二則所:為進仃該 使用者之複數個欲辦理事項用如者所:?之行 ,如-般坊間常見之C憶程序21中所 行搬家、打掃及旅遊的較佳時 ^二本週 出順序。依圖γ之狀、、只 、 並進行排程 耘。使用者亦可輸入 :出兩 r使用者可加入1家彳 步 此,就僅剩下如行程二交冉打拎」 明之行事安排系統與方、、:不:順序。 之外,還能夠主動地提供p ;;可除了單純地紀 對使用者而言,依理時間的建 其自行安排行程的時系統與方 對梃供订事安排系統 536675 五、發明說明(8) 的業者而言,依本發明之行事安排系統與方法則可以增加 使用者的的使用意願,進而吸引更多的使用者使用。 上述之實施例僅為舉例性,而非為具限制性者。任何 不脫離本發明之精神與範疇,而對本發明所進行之等效修 改或變更,均應包含於後述之申請專利範圍中。$ 9 pages 536675 V. Description of the invention (7) A sorting result ordering to get the relevant memorandum, which will be described again before. The wise act is in a record medium. Take the record medium. In addition, modify or change the performance requirements, such as changing the requirements, to enter the procedure for the users in the home, cleaning, and record data. 2 3 Sort by adding different lines. Conditions, such as the to-do list according to this post. Therefore, the method can save: for example, 'the better visiting time for the destination can be at least one better visiting schedule. f ί: 2 ", the detailed internal currency of analysis program 22 and schedule program 23 = The description of scheduling system 1 is roughly similar, so here it is not: Fang 2 writes = the technical person can easily upload . In this way :, you can: read and read the computer program record, the computer or server that U β Y sees to read the book 'to execute the method of arranging actions according to the present invention. The present invention can also be easily equivalent to the spirit and scope of the invention. For example, you can put… people into things, and the best ones are good times. Please refer to Figure 7, if the second office is used to enter the user's multiple items to be used: The best time to move, clean, and travel in C-memory program 21, which is commonly used in ordinary places ^ Tue this week. According to the picture of γ, only, and schedule. The user can also enter: two users can join 1 home. So, there is only one thing like the second schedule and the next schedule. The arrangement system and party,:, no: order. In addition, it can also actively provide p; In addition to simply disciplining the time for the user, the time system and the party-to-party supply and arrangement system 536675 can be set up based on time. V. Description of the invention (8) As for the operators, the system and method for arranging actions according to the present invention can increase the user's willingness to use, and then attract more users to use it. The above-mentioned embodiments are exemplary only, and are not restrictive. Any equivalent modification or change made to the present invention without departing from the spirit and scope of the present invention shall be included in the scope of patent application described later.

第11頁 536675 圖式簡單說明 【圖式之簡單說明】 圖1為一示意圖,顯示依本發明較佳實施例之行事安 排系統之架構。 圖2為一示意圖,顯示起始位置、目的位置與相對方 位關係的例子。 圖3為一示意圖,顯示針對圖2之狀況所得之較佳辦理 時間進行排序,所得到之排序結果。 圖4為一示意圖,顯示另一種起始位置、目的位置與 相對方位關係,以及各種方位之較佳辦理時間的例子。 圖5 ( A )為一示意圖,顯示針對圖4之狀況進行排 序 5 所 得到 之排序結 果。 圖 5 (B )為一示 意圖,顯示針對圖4之 狀 況 進 行 排 序 ) 所 得到 之排序結 果的另一種表現形式 圖 6為- -流程圖^ ,顯示依本發明較佳實 施 例 之 行 事 安 排 方 法 之流 程。 圖 7為- -示意圖^ •顯示另一依本發明較 佳 實 施 例 之 行 事 安 排 系統 與方法來 運作的例子。 [ 圖 式 符號 說明】 1 行 事安 排系統 11 記 憶模 組 12 分 析模 組 13 排 程模 組 2 行 事安 排方法Page 11 536675 Brief description of the drawings [Simplified description of the drawings] FIG. 1 is a schematic diagram showing the architecture of the operation arrangement system according to the preferred embodiment of the present invention. Fig. 2 is a schematic diagram showing an example of the relationship between the start position, the destination position, and the relative position. Fig. 3 is a schematic diagram showing the sorting results obtained by sorting the preferred processing times obtained for the situation of Fig. 2. Fig. 4 is a schematic diagram showing another example of the relationship between the starting position, the destination position and the relative position, and examples of preferred processing times for various positions. Fig. 5 (A) is a schematic diagram showing the sorting results obtained by sorting 5 for the situation of Fig. 4. FIG. 5 (B) is a schematic diagram showing another sorting result of the sorting result obtained according to the situation of FIG. 4) FIG. 6 is a flowchart of ^, which shows a method for arranging actions according to a preferred embodiment of the present invention Process. FIG. 7 is a schematic diagram ^ • showing another example of a system and method for operating according to a preferred embodiment of the present invention. [Schematic symbol description] 1 event scheduling system 11 memory module group 12 analysis module group 13 scheduling module group 2 method of scheduling tasks

第12頁 536675Page 12 536675

第13頁Page 13

Claims (1)

536675 六 申請專利範圍 1行事要種/事安排系楚统,係接收一使用者所輪入之複數個 ^牛,錢該4行事要件排序,該行事安排系統包含 。己憶杈組,其係儲存該使用者所輸入之資料· 組中::tt模組,其係依該等行事要件,由該記憶模 -較佳: 打分析’卩分別得到各行事要件之至少 孕又佳辦理時間;以及 件谁:ft程模組,#係依該等較佳辦理時間對該等行事要 給兮=I ί,以彳于到至少一排序結果,該排序結果係提供 …落使用者以供其參考。 2 ·如申請專利範圍第1項 該等行事要件係包含 使用者欲前往之複數個目 該分析模組對該等目 析; 所述之行事安排系統,其中 該使用者之一起始位置,以及該 的位置; 的位置所進行之分析係為吉方分536675 6 Application scope of patents 1. The main business types / arrangements are Chu Tong, which accepts a plurality of ^ cattle, which are ordered by a user in turn, and the four business conditions are sorted. The business scheduling system includes. Jiji Group, which stores the information entered by the user. In the group :: tt module, which acts according to these elements, from the memory module-better: type 'Analysis' to get each of the elements. At least pregnant and good processing time; and who: ft Cheng module, # is based on these better processing time to give these things to Xi = I, in order to get at least one sorting result, the sorting result is provided … For the user's reference. 2 · If item 1 of the scope of application for patents includes such multiple actions as the user intends to go, the analysis module analyzes the projects; the action scheduling system described above, in which one of the users' starting position, and The analysis of the position; 該較佳辦理時間係 之方向為吉方之時間; 該排序結果係該使 3·如申請專利範圍第i 該等行事要件係包 置; 该分析模組對該等 目的位置之吉方分析; 各該等目的位置相對於該起始位置 且 用者前往該等目的位置之順序。 項所述之行事安排系統,’其中 含該使用者欲前往之複數個目的位 目的位置所進行之分析,係為該等The preferred processing time is in the direction of Kyrgyzstan; the sorting result is that the operation elements such as the i in the scope of the patent application are packaged; the analysis module analyzes the Kyrgyzstan for these destinations; The order of the destinations is relative to the starting position and the user goes to the destinations. The operation scheduling system described in item ’, which includes the analysis of the multiple destinations that the user wants to go to, 第14頁 536675Page 14 536675 置相對於另一目的位 該較佳辦理時間係各該等目的位 置之方向為吉方之時間;且 目的位置之順序。 該排序結果係該使用者前往該等 4·如申^請專利範圍第1項所述之行事安排系統,其中 吞4行事要件係包含該使用者欲進行之待辦事項; =分析模組對該等待辦事項所進行之分析,係為該 得辦事項之吉時分析; 该較佳辦理時間係進行各該等待辦事項之吉時;且 〇排序結果係該使用者進行該等待辦事項之順序。 5·如申請專利範圍第1項所述之行事安排系統,其中 該記憶模組包含一硬碟機。 6 ·如申請專利範圍第1項所述之行事安排系統,其中 該記憶模組包含一可讀寫式光碟機。 7 ·如申請專利範圍第1項所述之行事安排系統,其中 該分析模組包含一命理分析模組。 8 ·如申請專利範圍第1項所述之行事安排系統,其中 該分析模組包含一ASIC (appHcati〇n-specific integrated circuit,特定應用積體電路)元件。Relative to another destination The preferred processing time is the time when the direction of each of these destinations is Kyrgyzstan; and the order of the destinations. The sorting result is that the user went to the 4. Arrangement system described in item 1 of the scope of patent application, in which the 4 action elements include the to-do items that the user wants to perform; = analysis module pair The analysis performed by the waiting item is the Keith analysis of the pending item; the preferred processing time is performed by the Keith hour of each of the waiting items; and the ranking result is the user's doing the waiting item. order. 5. The acting arrangement system described in item 1 of the scope of patent application, wherein the memory module includes a hard disk drive. 6. The acting arrangement system according to item 1 of the scope of patent application, wherein the memory module includes a readable and writable optical disc drive. 7. The acting arrangement system as described in item 1 of the scope of patent application, wherein the analysis module includes a fortune telling analysis module. 8. The behavior arrangement system as described in item 1 of the scope of patent application, wherein the analysis module includes an ASIC (appHcation-specific integrated circuit) component. 536675 六、申請專利範圍 9·如申請專利範圍第1項所述之行事安排系統,其中 °亥刀析模組包含一CISC (complex instruction set computing,複雜指令集運算)處理器。 10·如申請專利範圍第1項所述之行事安排系統,其中 該分析模組包含一RISC (reduced instruction set computing,簡單指令集運算)處理器。536675 6. Scope of Patent Application 9. The operation arrangement system described in item 1 of the scope of patent application, wherein the Haier Analysis Module includes a CISC (complex instruction set computing) processor. 10. The behavior scheduling system described in item 1 of the scope of patent application, wherein the analysis module includes a RISC (reduced instruction set computing) processor. 11·如申請專利範圍第1項所述之行事安排系統,其中 該排程模組包含一 ASIC (application-specific integrated circuit,特定應用積體電路)元件。 12·如申請專利範圍第1項所述之行事安排系統,其中 該排程模組包含一 CISC (complex instruction set computing,複雜指令集運算)處理器。 13. 如申請專利範圍第1項所述之行事安排系統,其中 該排程模組包含一 RISC ( reduced instruction set11. The behavior arrangement system described in item 1 of the scope of patent application, wherein the scheduling module includes an ASIC (application-specific integrated circuit) component. 12. The behavior scheduling system described in item 1 of the scope of patent application, wherein the scheduling module includes a CISC (complex instruction set computing) processor. 13. The scheduling system described in item 1 of the scope of patent application, wherein the scheduling module includes a RISC (reduced instruction set) computing,簡單指令集運算)處理器。 14. 如申請專利範圍第2項所述之行事安排系統,其中 該分析模組包含一以奇Π遁曱術進行吉方分析之命理 分析模組。computing (simple instruction set operation) processor. 14. The acting arrangement system as described in item 2 of the scope of the patent application, wherein the analysis module includes a fortune analysis module that performs auspicious side analysis using odd-numbered techniques. 第16頁 536675Page 16 536675 六、申請專利範圍 15.二”範圍第3項所述之行事安排系統,其中 口乂刀斤杈組包含—以奇門遁甲術進行 分析模組。 乃刀析之命理 16. 種行事安排方法 一畫也从 1 友,係接收一便用考所輸入之複數個 灯事要件’並將該等行事要件排序’ 序結:供其參考,該行事安排方法包纟/使用者-排 一記憶程序,其係儲存該使用者所輸入之資料· 一分析程序,其係、藉由該資料與該^亍事要件來 分析’以分別得到各行事要件之至少 —^ 』分仃爭要忏乙主夕一較佳辦理時間;以 及 一排程程序,其係依該等較佳辦理 件進行料,以得到至少一排序結果,了:要 給該使用者以供其參考。 ^卜序、,,。果係提供 17.如申請專利範圍第16項所述之行事安排方法,其中 該等行事要件係包含該使用者之—起始位置,以及該使用 者欲前往之複數個目的位置; 該分析程序對該等目的位置所進行之分析係為吉方分 析; 該較佳辦理時間係各該等目的位置相對於該起始位置 之方向為吉方之時間;且 该排序結果係該使用者前往該等目的位置之順序。6. The application arrangement system described in item 3 of the scope of “Patent Application 15.2”, in which the mouth-knife knives group includes—the analysis module based on Qimen beetle surgery. The numerology of knives analysis Yihua also received from one friend, it is to use a plurality of lanterns entered in the test, and 'order these things' order. Summary: For reference, the method of arrangement of the actions is as follows: Program, which stores the data entered by the user. An analysis program, which analyzes the data and the ^ event requirements to obtain at least each of the action requirements. A better processing time on Lunar New Year's Eve; and a scheduling procedure, which is based on these better processing documents to obtain at least one sorting result, and: the user must be given for his reference. ^ Order ,, The fruit system provides the behavior arrangement method described in item 16 of the scope of application for patents, wherein the behavior elements include the user's starting position and a plurality of destination positions to which the user wants to go; Analysis process The analysis of the destination locations is Ji Fang analysis; the preferred processing time is the time when the direction of each of these destination locations relative to the starting location is Ji Fang; and the ranking result is that the user went to those destinations Order of locations. 第17頁 536675 六、申請專利範圍 1 8·如申請專利範圍第丨6項所述之行事安排方法,其中 該等行事要件係包含該使用者欲前往之複數個目的位 置; ’、 ^ 該分析程序對該等目的位置所進行之分析係為吉方分 析; 該較佳辦理時間係各該等目的位置相對於另一目的位 置之方向為吉方之時間;且 該排序結果係該使用者前往該等目的位置之順序。 1 9 ·如申請專利範圍第1 6項所述之行事安排方法,其中 該等行事要件係包含該使用者欲進行之待辦事項; y 該分析程序對該等待辦事項所進行之分析,係為該等 待辦事項之吉時分析; _ 該較佳辦理時間係進行各該等待辦事項之吉時;且 該排序結果係該使用者進行該等待辦事項之順序。 2 0· 種電腦可讀取紀錄媒體,其係紀錄有: 一記憶程序,其係儲存一使用者所輸入之資料,以及 該使用者所輸入之複數個行事要件; 一分析程序,其係藉由該資料與該等行事要件進行分 析,以分別得到各等行事要件之δ丨、 寸丁肀I 1干之至少一較佳辦理時間;以 及 理時間對該等行事要 ’該排序結果係提供 一排程程序,其係依該等較佳辦 件進行排序,以得到至少一排序結果Page 17 536675 VI. Patent application scope 1 8. The method of operation arrangement as described in item 丨 6 of the patent application scope, where the action requirements include a plurality of destinations that the user wants to go to; ', ^ This analysis The analysis performed by the program on these destinations is Kyrgyzstan; the preferred processing time is the time when the direction of each of these destinations relative to the other destination is Kyrgyzstan; and the ranking result is that the user went to the destinations The order of the destination. 1 9 · The operation arrangement method described in item 16 of the scope of the patent application, where the action elements include the to-do items that the user wants to perform; y The analysis of the pending items by the analysis program is the An analysis of the Keith of the waiting to do; _ The preferred processing time is to carry out the Keith of each of the waiting to do; and the ranking result is the order in which the user performs the waiting to do. 2 · A computer-readable recording medium includes records of: a memory program which stores data input by a user and a plurality of actions required by the user; an analysis program which borrows Analyze from this data and these business requirements to obtain at least one preferred processing time for each of these business requirements, δ 丨, Cin Ding 肀 I 1; and the time required for these business activities. The ranking results are provided A scheduling program, which sorts according to the better parts to obtain at least one sorting result 536675 六、申請專利範圍 給該使用者以供其參考。 •々當腦可讀取紀錄媒體, 21·如申請專利範圍第2 〇項所述 其巾 多之〆起始位置’以及該 該專行事要件係包含該使用者 使用ϊ = ϊ往之複數個目的位ί所進行之分析係為吉方分 該分析程序對該等目的位i所适 析; 該較佳辦理時間係各該等目的位置相對於該起始位置 之方向為吉方之時間;且 該排序結果係該使用者前往該等目的位置之順序。 2 2·如申請專利範圍第2 〇項戶斤述之電細可肩取紀錄媒體’ 其中 ' 該等行事要件係包含該使用者欲前往之複數個目的位 置; ’、 该分析裎序對該等目的位置所進行之分析係為吉方分 析; ~ 該較佳辦理時間係各該等目的位置相對於另一目的位 置之方向為吉方之時間;且 該排序結果係該使用者前往該等目的位置之順序。 23.如申請專利範圍第2〇項所述之電腦可讀取紀錄媒體, 其中536675 6. Scope of patent application The user is provided for his reference. • When the brain can read the recording medium, 21 · As described in the scope of patent application No. 20, the “start position” and the special requirements include the use of the user ϊ = ϊ The analysis performed by the destination position is Kyrgyzstan's analysis of the analysis procedure for these destinations; the preferred processing time is the time when the direction of each of the destinations relative to the starting position is Kyrgyzstan; and The sorting result is the order in which the user goes to the destinations. 2 2 · If the details of the item No. 20 in the scope of the patent application can be used to record the media, where 'these act elements include multiple destinations that the user wants to go to;', the analysis sequence The analysis performed by other destination locations is Kyrgyzstan; ~ The preferred processing time is the time when the direction of each of these destination locations relative to the other destination location is Kyrgyzstan; and the ranking result is that the user went to the destination locations The order. 23. The computer-readable recording medium as described in item 20 of the scope of patent application, wherein 第19頁 536675Page 19 536675 該等行事要件 該分析程序對 待辦事項之吉時分 該較佳辦理時 該排序結果係 係包含該使用者欲進行之待 該等待辦事項所進行之分析 析; 間係進行各該等待辦事項之 該使用者進行該等待辦事項 辦事 ,係 吉時 之順 項,· 為該等 ;且 序〇The ordering results include the analysis and analysis of the waiting to-do items that the user wants to perform; The user's handling of the waiting to-do items is a matter of time for Jiexi, and so on; and sequence 0
TW89113346A 2000-07-05 2000-07-05 Scheduling arrangement system and method TW536675B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW89113346A TW536675B (en) 2000-07-05 2000-07-05 Scheduling arrangement system and method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW89113346A TW536675B (en) 2000-07-05 2000-07-05 Scheduling arrangement system and method

Publications (1)

Publication Number Publication Date
TW536675B true TW536675B (en) 2003-06-11

Family

ID=29268242

Family Applications (1)

Application Number Title Priority Date Filing Date
TW89113346A TW536675B (en) 2000-07-05 2000-07-05 Scheduling arrangement system and method

Country Status (1)

Country Link
TW (1) TW536675B (en)

Similar Documents

Publication Publication Date Title
KR101213929B1 (en) Systems and methods for constructing and using models of memorability in computing and communications applications
US8381088B2 (en) Flagging, capturing and generating task list items
Hangal et al. Muse: Reviving memories using email archives
EP1035489A2 (en) Personal information management
US20080021920A1 (en) Memory content generation, management, and monetization platform
US20130218888A1 (en) System and method for assigning tags in a calendar
US20160110899A1 (en) Methods and systems for creating storylines
Frohlich et al. Rediscovery of forgotten images in domestic photo collections
Margree et al. Information behaviour of music record collectors
Fuller et al. Applying contextual memory cues for retrieval from personal information archives
Ali et al. Modeling the process of personal digital archiving through ubiquitous and desktop devices: A systematic review
TW536675B (en) Scheduling arrangement system and method
Dai et al. Why use memo for all? restructuring mobile applications to support informal note taking
Guo et al. MemPhone: From personal memory aid to community memory sharing using mobile tagging
Pash et al. Lifehacker: The guide to working smarter, faster, and better
EP2174239A1 (en) Memory content generation, management, and monetization platform
Stephens Beyond news: the case for wisdom journalism
Mackall Research and information management
Rangochev et al. Encyclopaedia Slavica Sanctorum: Further Developments
Weber et al. User Interviews: Findings from the Building a National Archival Finding Aid Network Project
Holtermann Librarians Approve of This New Jay-Z Collectible.
Davis Die Hard: The Impossible, Absolutely Essential Task of Saving the Web for Scholars
Martin-Hardin Literary Archives in the Digital Age: An Overdue Conversation with Dr. Lise Jaillant
Allen Mark Philip Bradley and Mary L. Dudziak, eds. Making the Forever War: Marilyn B. Young on the Culture and Politics of American Militarism.
Stobart Susan E. Whyman. The Useful Knowledge of William Hutton: Culture and Industry in Eighteenth-Century Birmingham.

Legal Events

Date Code Title Description
GD4A Issue of patent certificate for granted invention patent
MM4A Annulment or lapse of patent due to non-payment of fees