JP2007257176A - Information processing method, information processor and information processing program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an information processing method, an information processor and an information processing program for improving the degree of freedom of the display of graphics converted from a numerical value. <P>SOLUTION: An input numerical value N is defined as N=350460. In (A), when the input numerical value N is input, a route R is set. In (B), 9 branches are generated based on a numerical sequence S4. A numerical value arranged at the top end of the branch is defined as a branch destination node. As shown by (C), the branch destination node is converted into a leaf (displayed with a black dot which is smaller than a node R in (C)). As to a node whose numerical value is 2 or more, factorization in prime factors is made possible. In (D), three branches are generated from a node whose numerical value is "12", and each numerical value configuring the numerical sequence S4 is defined as a branch destination node. The branch destination node whose numerical value is 1 is converted into a leaf (displayed with a black dot which is smaller than the node R in (D)). In (D), as to the node whose numerical value is 2 or more, factorization in prime factors is made possible. Thus, as shown by (E), it is possible to generate tree structure data T(N) unique to the input numerical value N. <P>COPYRIGHT: (C)2008,JPO&INPIT

Description

  The present invention relates to an information processing method, an information processing apparatus, and an information processing program for converting a numerical value of a natural number into unique tree structure data and converting the tree structure data into unique numerical values.

  Conventionally, a progressive system (decimal system, hexadecimal system, etc.) is used for numerical expression. Further, in merchandise management and personal authentication, numerical representation methods such as barcodes (see FIG. 11) and two-dimensional barcodes are used (for example, see Non-Patent Document 1). Furthermore, in the field of security, a technique for encrypting numerical values such as a user ID, a password, and a credit card number is used.

Japan Standards Association, JIS Handbook Information Processing Hardware Edition Published by Japan Standards Association April 21, 1999

  However, there is a problem that when the numerical value is increased, the number of digits is increased, the display area is elongated in one direction, and display is difficult. In addition, when numerical values are expressed by barcodes or two-dimensional barcodes, there is a problem that the degree of freedom in display is low because the display size and shape are limited by standards.

  The present invention provides an information processing method, an information processing apparatus, and an information processing program capable of improving the degree of freedom of display of a figure converted from a numerical value in order to eliminate the above-described problems caused by the prior art. With the goal.

  In order to solve the above-described problems and achieve the object, an information processing method, an information processing apparatus, and an information processing program according to the present invention accept an input of an arbitrary natural number, set a route for an input value, and at least A node that is not a leaf and is not a branching source is extracted from a group of nodes including a root, a numerical value associated with the extracted node is primed, and at least the root is included based on a prime factorization result Tree structure data is generated, and the generated tree structure data is output.

  Moreover, in the said invention, it is good also as determining whether the said input numerical value is 2 or more, and outputting the said tree structure data based on the determination result. That is, when it is determined that the input numerical value is not 2 or more, tree structure data including only the root is output. When it is determined that the input numerical value is 2 or more, the node group including at least the root is output. Extract nodes excluding leaves from inside.

  In the above invention, a numerical sequence unique to the numerical value of the decomposition source may be calculated based on the prime factorization result, and tree structure data specific to the calculated numerical sequence may be generated.

  Further, in the above invention, a combination of a prime number obtained from a prime factorization result and an exponent of the prime number arranged in the order of the prime number and the exponent is arranged in ascending order of the value of the prime number, and the number sequence obtained by the arrangement All prime numbers are converted into prime numbers assigned in ascending order of the prime values, and one prime number in the converted number sequence is arranged from the one prime number immediately before the one prime number. Convert to a difference value obtained by subtracting another prime number, determine whether the numerical value at the end of the numerical sequence is 1, and based on the converted numerical sequence and the determination result, the numerical sequence unique to the numerical value of the decomposition source May be calculated.

  Further, in the above invention, when it is determined that the numerical value at the end is 1, the numerical sequence unique to the numerical value at the decomposition source may be calculated by deleting the numerical value at the end from the converted numerical sequence. Good.

  Further, in the above invention, when it is determined that the numerical value at the end is not 1, the numerical sequence unique to the numerical value of the decomposition source is calculated by subtracting the numerical value at the end from the numerical sequence after the prime number conversion. Also good.

  Further, in the above invention, the number of branches corresponding to the number of numerical values (hereinafter referred to as “number sequence constituent numerical values”) constituting a numerical sequence unique to the numerical values of the decomposition source are generated from the nodes extracted by the extraction step. A branch destination node for the branch source node is generated by associating each numerical sequence constituent value with a tip of each branch, and based on the numerical sequence constituent value associated with the generated branch destination node, the branch destination node May be converted into the leaf, and tree structure data including the root, the branch source node, the branch, and the leaf may be generated.

  In the above invention, the tree structure data may be displayed on a display screen.

  Moreover, in the said invention, it is good also as receiving the parameter regarding the said tree structure data, and displaying the said tree structure data on the said display screen based on the input parameter.

  In the above invention, the tree structure data may be deformed and displayed on the display screen according to the size of the display screen.

  In the above invention, the tree structure data may be transmitted from a computer device that is a generation source of the tree structure data to another computer device.

  In the above invention, the input numerical value may be an identification code related to a user or an identification code related to an article.

  According to these inventions, an input numerical value can be represented in a planar manner by tree structure data unique to the input numerical value.

  An information processing method, an information processing apparatus, and an information processing program according to the present invention acquire tree structure data, and convert the tree structure data into the tree structure data based on a connection relationship between nodes constituting the acquired tree structure data. A unique numerical value is specified, and the specified numerical value is output.

  Moreover, in the said invention, it is good also as acquiring the said tree structure data by reading the image regarding a tree structure.

  In the above invention, the tree structure data may be received from a computer device storing the tree structure data.

  In the above invention, the numerical value may be an identification code related to a user or an identification code related to an article.

  According to these inventions, the tree structure data expressed in a plane can be converted into a numerical value unique to the tree structure data.

  According to the information processing method, the information processing apparatus, and the information processing program according to the present invention, it is possible to improve the degree of freedom of numerical expression. In addition, there is an effect that security can be improved by flattening the numerical expression.

  Exemplary embodiments of an information processing method, an information processing apparatus, and an information processing program according to the present invention will be explained below in detail with reference to the accompanying drawings.

(Hardware configuration of information processing device)
First, the hardware configuration of the information processing apparatus according to the embodiment of the present invention will be described. FIG. 1 is a block diagram showing a hardware configuration of the information processing apparatus according to the embodiment of the present invention.

  In FIG. 1, the information processing apparatus includes a CPU 101, a ROM 102, a RAM 103, an HDD (hard disk drive) 104, an HD (hard disk) 105, an FDD (flexible disk drive) 106, and an example of a removable recording medium. FD (flexible disk) 107, display 108, I / F (interface) 109, keyboard 110, mouse 111, scanner 112, and printer 113. Each component is connected by a bus 100.

  Here, the CPU 101 controls the entire information processing apparatus. The ROM 102 stores a program such as a boot program. The RAM 103 is used as a work area for the CPU 101. The HDD 104 controls reading / writing of data with respect to the HD 105 according to the control of the CPU 101. The HD 105 stores data written under the control of the HDD 104.

  The FDD 106 controls reading / writing of data with respect to the FD 107 according to the control of the CPU 101. The FD 107 stores data written under the control of the FDD 106 or causes the information processing apparatus to read data stored in the FD 107.

  In addition to the FD 107, the removable recording medium may be a CD-ROM (CD-R, CD-RW), MO, DVD (Digital Versatile Disk), memory card, or the like. The display 108 displays data such as a document, an image, and function information as well as a cursor, an icon, or a tool box. As this display 108, for example, a CRT, a TFT liquid crystal display, a plasma display, or the like can be adopted.

  The I / F 109 is connected to a network 114 such as the Internet through a communication line, and is connected to other devices via the network 114. The I / F 109 controls an internal interface with the network 114 and controls data input / output from an external device. For example, a modem or a LAN adapter may be employed as the I / F 109.

  The keyboard 110 includes keys for inputting characters, numbers, various instructions, and the like, and inputs data. Moreover, a touch panel type input pad or a numeric keypad may be used. The mouse 111 performs cursor movement, range selection, window movement, size change, and the like. A trackball or a joystick may be used as long as they have the same function as a pointing device.

  The scanner 112 optically reads an image and takes in the image data into the information processing apparatus. The scanner 112 may have an OCR function. The printer 113 prints image data and document data. For example, a laser printer or an ink jet printer can be employed as the printer 113.

(Functional configuration of information processing device)
Next, a functional configuration of the information processing apparatus according to the embodiment of the present invention will be described. FIG. 2 is a block diagram showing a functional configuration of the information processing apparatus according to the embodiment of the present invention. FIG. 2 shows the functional configuration of the two information processing apparatuses 200 and 210. Here, the information processing apparatus 200 is a computer apparatus that generates tree structure data, and the information processing apparatus 210 is a computer apparatus that decodes the tree structure data. Note that these computer apparatuses may be desktop personal computers or portable terminals such as notebook personal computers, mobile phones, and music players.

  In FIG. 2, the information processing apparatus 200 includes an input unit 201, a setting unit 202, an extraction unit 203, a prime factorization unit 204, a generation unit 205, and a tree structure data output unit 206. First, the input unit 201 receives an input of an arbitrary natural number. Here, as a natural number to be input, for example, an identification code related to a user or an identification code related to an article can be used.

  The identification code related to the user is a code for authenticating or specifying who the user is, and includes, for example, various user IDs, passwords, and other numerical string data such as credit card numbers. The identification code related to the article (product or product) is a code for identifying what the article is, and includes, for example, a product code, a serial number of a product, a model number, and the like.

  As described above, the input unit 201 directly inputs a digitized identification code, but may input a numerical value converted from character string data. For example, it is possible to input a natural number by converting character string data into a character code such as an ASCII code or a JIS code, and further converting the converted character code into a decimal number.

  The setting unit 202 sets a route of a numerical value input by the input unit 201 (hereinafter referred to as “input numerical value”). Here, the root is a node that specifies the root of the tree structure data. A node is data corresponding to a section of tree structure data. Therefore, the root is a node that specifies the highest node (root) among the nodes that specify the node. The route is set when an input numerical value is input.

  Further, the extraction unit 203 extracts a node that excludes a leaf and is not a branching source from a node group including at least the route set by the setting unit 202. A leaf is data corresponding to a leaf of tree structure data. Therefore, the leaf is the node that specifies the lowest node among the nodes that specify the node, that is, the terminal node (leaf).

  A node that is not a branch source is a node that does not have a branch destination node. As such a node, a leaf corresponds, but a leaf is excluded here. Therefore, a node to be extracted is not a leaf during generation of tree structure data, and a branch destination node is selected. It is a node whose presence or absence is unknown (hereinafter referred to as “unprocessed node”).

  When the input numerical value N is N = 1, the node is only the route set by the setting unit 202, and there is no unprocessed node. In this case, it is not necessary to perform prime factorization by the prime factor decomposition unit 204 described later, and tree structure data including only the root is generated by the generation unit 205 described later.

  In addition, the prime factor decomposition unit 204 performs prime factorization on the numerical value associated with the node extracted by the extraction unit 203. Specifically, the input numerical value associated with the route is subjected to prime factorization. Also, the numerical value associated with the unprocessed node extracted by the extraction unit 203 is also subjected to prime factorization. Here, if the numerical value to be subjected to prime factorization is M, the prime factorization result is expressed by the following equation (1).

^{_{M = P 1 E1 × P 2}} E2 × ... × P j Ej × ... × P n En ··· (1)

In the formula (1), j = 1 to n. P _j is a prime number, and E _j is an exponent of the prime number P _j . Note that P ₁ <P ₂ <P _j ... <P _n .

Also, the generation unit 205 generates tree structure data including at least a root based on the decomposition result decomposed by the prime factor decomposition unit 204. Specifically, tree structure data unique to the input numerical value is generated using a combination of a prime number P _j and an exponent E _j that are the result of prime factorization.

  Specifically, tree structure data is generated by the following processing. Here, the input numerical value N is N ≧ 2. In this case, the route of the input numerical value N is set by the setting unit 202, and this input numerical value N is prime factorized (the above formula (1)) as the numerical value M to be subject to prime factorization.

Unprocessed node (including the root) is prime a combination of the exponent E _j primes P _j and the prime number P _j obtained as a result of factoring - referred to as index set PE _j. In the above equation (1), n prime-exponential sets PE _j exist. The prime-exponent set PE _j is an array [P _j , E _j ] having a prime P _{j at} the beginning and an exponent E _j at the end.

First, the prime-exponential set PE _j is arranged in ascending order of the prime P _j . The numerical sequence S1 obtained as a result of the arrangement is as shown in the following formula (2).

_{S1 = [P 1, E 1} , P 2, E 2, ..., P j, E j, ..., P n, E n] ··· (2)

All odd numbers (P ₁ , P ₂ ,..., P _j ,..., P _n ) from the top (left end) of this sequence S1 are all prime numbers. This prime number P _j is converted into a prime number I _j . FIG. 3 is an explanatory diagram showing a prime-prime number conversion table.

In FIG. 3, the prime number I _j is an order in which all prime numbers of 2 or more are arranged in ascending order. That is, the prime number of prime number 2 is 1, the prime number of prime number 3 is 2, the prime number of prime number 5 is 3,... The prime number of prime number 17 is 7,. Thus, sequence S2 of After converting the prime P _j of the sequence S1 to the prime number I _j, is as the formula (3).

_{S2 = [I 1, E 1} , I 2, E 2, ..., I j, E j, ..., I n, E n] ··· (3)

Next, the second and subsequent prime numbers I _j in the sequence S2 are converted into a difference from the immediately preceding prime number I _j−1 . The number sequence S3 after conversion is as shown in the following formula (4).

S3 = [I ₁ , E ₁ , I ₂ −I ₁ , E ₂ , I ₃ −I ₂ , E ₃ ,..., I _n −I _n−1 , E _n ]
... (4)

Next, focusing on the index (E _n ) at the end (right end) of the sequence S3, the sequence S3 is converted to the sequence S4. If the end of the exponent E _n is E _n = 1, to remove the exponent E _n from the sequence S3. In this case, the converted sequence S4 is as shown in the following formula (5).

S4 = [I ₁ , E ₁ , I ₂ −I ₁ , E ₂ , I ₃ −I ₂ , E ₃ ,..., I _n −I _n−1 ]
... (5)

On the other hand, if the end of the exponent E _n is E _n ≧ 2, subtract 1 from the exponent E _n. In this case, the converted sequence S4 is as shown in the following formula (6).

S4 = [I ₁ , E ₁ , I ₂ −I ₁ , E ₂ , I ₃ −I ₂ , E ₃ ,..., I _n −I _n−1 , E _n −1]
... (6)

  Finally, based on the obtained sequence S4, branches are generated from the nodes (including the root) to generate branches. A branch is line data that connects a branch source node (including a route) and a branch destination node. The thickness of the branch is the thick line only at the head (leftmost) branch extending from the root, and the other is a thin line. Branches are generated for the number of numerical values in the sequence S4. A branch destination node is generated at the tip of the branch, and the numerical values at the head (left end) of the sequence S4 are sequentially associated, for example, clockwise. By performing this process before there are no unprocessed nodes, tree structure data is generated. The extended node has a large black circle for the root and a small black circle for the other nodes.

  The tree structure data output unit 206 outputs the tree structure data generated by the generation unit 205. Specifically, the tree structure data output unit 206 includes a display control unit 207, for example. The display control unit 207 displays the tree structure on the display screen 208. When a parameter related to tree structure data is input from the input unit 201, the tree structure is displayed on the display screen 208 based on the parameter.

  In addition, the display control unit 207 may display tree structure data so as to fit on the display screen 208 by setting parameters and changing the angle and length of the branch according to the size of the display screen 208. it can. The displayed tree structure data may be printed out. In addition, the tree structure data output unit 206 includes a transmission unit 209. The transmission unit 209 transmits tree structure data to the information processing apparatus 210.

  Note that the input unit 201, the setting unit 202, the extraction unit 203, the prime factorization unit 204, the generation unit 205, and the tree structure data output unit 206 described above specifically include, for example, the ROM 102, the RAM 103, The function is realized by causing the CPU 101 to execute a program recorded on a recording medium such as the HD 105 or by the I / F 109.

  Further, the information processing apparatus 210 includes an acquisition unit 211, a specification unit 214, and a numerical value output unit 215. The acquisition unit 211 acquires tree structure data. Specifically, the acquisition unit 211 includes a reading unit 212 and a receiving unit 213. The reading unit 212 acquires tree structure data by scanning a tree structure image displayed on the display screen 208 of the information processing apparatus 200 or a printed tree structure image. The receiving unit 213 receives tree structure data transmitted from the information processing apparatus 200.

  The specifying unit 214 specifies a numerical value unique to the tree structure data acquired by the acquiring unit 211. Specifically, a unique numerical value is specified by the connection relation of nodes constituting the tree structure data.

  That is, since the numerical value is a value unique to the tree structure data, the connection relation of the nodes is different for each numerical value. Therefore, if the connection relation of nodes can be specified, a unique numerical value can be determined by following the reverse procedure of the tree structure data generation from paragraph number [0041] to paragraph number [0059].

  The numerical value output unit 215 outputs the numerical value specified by the specifying unit 214. Specifically, the numerical value output unit 215 includes a display control unit 216 and displays the specified numerical value on the display screen 217. The output format is not limited to display, but may be print output or audio output.

  Note that the acquisition unit 211, the specifying unit 214, and the numerical value output unit 215 described above execute, for example, the CPU 101 with a program recorded in a recording medium such as the ROM 102, the RAM 103, and the HD 105 illustrated in FIG. Or the function is realized by the I / F 109.

(Generation example of tree structure data)
Next, an example of generating tree structure data will be described. FIG. 4 is an explanatory diagram showing a generation process of tree structure data. Here, the input numerical value N is described as N = 350460.

  First, in (A), when the input numerical value N is first input, the setting unit 202 sets the route R. Next, when the input numerical value N (= 350460) is prime factorized in ascending order of prime numbers, the following equation (7) is obtained.

350460 = 2 ² × 3 ³ × 5 ¹ × 11 ¹ × 59 ¹ (7)

In Equation (7), 2 ² prime-exponential set is [2,2], 3 ³ prime-exponential set is [3,3], 5 ¹ prime-exponential set is [5,1], 11 ¹ The prime number-exponential set of [11,1] and the prime number-exponential set of 59 become [59,1].

  This prime number-exponential set is arranged in ascending order of prime numbers. The numerical sequence S1 obtained as a result of the arrangement is as shown in the following formula (8).

  S1 = [2,2,3,3,5,1,11,1,59,1] (8)

  The prime numbers in the sequence S1 of the formula (8) are converted into prime numbers using a prime-prime number conversion table. The converted sequence S2 is as shown in the following formula (9).

  S2 = [1,2,2,3,3,1,5,1,17,1] (9)

  Next, the second and subsequent prime numbers in the sequence S2 shown in Expression (9) are converted into a difference from the immediately preceding prime number. The converted sequence S3 is as shown in the following formula (10).

  S3 = [1,2,1,3,1,1,2,1,12,1] (10)

  Next, paying attention to the index 1 at the end (right end) of the sequence S3 shown in Expression (10), the sequence S3 is converted into the sequence S4. Since the last exponent is 1, the last exponent 1 is deleted from the sequence S3. In this case, the converted sequence S4 is as shown in the following formula (11).

  S4 = [1,2,1,3,1,1,2,1,12] (11)

  Since there are nine numerical values constituting the number sequence S4, in FIG. 4B, nine branches are generated based on the number sequence S4 of the equation (11). The leftmost branch is a thick line because it is the first branch from node R. The numerical values of the sequence S4 are arranged clockwise from the top at the tip of each branch. A numerical value arranged at the tip of this branch becomes a branch destination node. When the value of this branch destination node is 1, no further prime factorization is possible. Therefore, as shown in (C), it is converted into a leaf (indicated by a small circle in (C) smaller than the node R).

For a node whose numerical value is 2 or more, prime factorization is possible. Here, in (C), when “12” is prime factorized in ascending order of prime numbers, 12 = 2 ² × 3 ¹ is obtained. As a result, the numerical sequence S1 = [2, 2, 3, 1]. When a prime number is converted into a prime number, S2 = [1,2,2,1]. When the prime number is converted into a difference from the immediately preceding prime number, S3 = [1,2,1,1]. Since the last exponent in the sequence S3 is 1, if deleted, S4 = [1,2,1].

  Since there are three numerical values constituting the sequence S4, in (D), three branches are generated from the node of the numerical value “12”, and each numerical value constituting the sequence S4 is set as a branch destination node. A branch destination node whose numerical value is 1 is converted into a leaf (indicated by a small circle in (D) smaller than the node R).

Further, in (D), prime factorization is possible for nodes having a numerical value of 2 or more. Here, in (D), when “2” is prime factorized in ascending order of prime numbers, 2 = 2 ¹ is obtained. As a result, the sequence S1 = [2, 1]. When a prime number is converted into a prime number, S2 = [1,1]. Since there is only one prime number, the difference cannot be obtained and S3 = [1, 1]. Since the last exponent in the sequence S3 is 1, if deleted, S4 = [1].

  Since there is one numerical value that constitutes the sequence S4, in (E), one branch is generated from the node of the numerical value “2”, and the numerical value 1 that constitutes the sequence S4 is set as the branch destination node. Since the value of the branch destination node is 1, the branch destination node is converted into a leaf (indicated by a small circle in (E) smaller than the node R). In this way, tree structure data T (N) unique to the input numerical value N (= 350460) can be generated as shown in (E).

(Tree structure data generation processing procedure)
Next, a tree structure data generation processing procedure by the information processing apparatus 200 according to the embodiment of the present invention will be described. 5 and 6 are flowcharts showing a tree structure data generation processing procedure by the information processing apparatus 200 according to the embodiment of the present invention.

  First, in FIG. 5, it waits until the numerical value N is input by the input unit 201 (step S501: No). When the numerical value N is input (step S501: Yes), the route of the numerical value N is set (step S502). . Then, it is determined whether or not the numerical value N set for the route is N ≧ 2 (step S503).

  When N ≧ 2 is not satisfied (step S503: No), since the numerical value N is N = 1, the tree structure data of the numerical value N (N = 1), that is, the tree structure data of only the root is stored in the memory (for example, FIG. 1). It is held in the RAM 103 and HD 105 shown (step S504) and output by the tree structure data output unit 206 (step S505).

  On the other hand, if N ≧ 2 (step S503: Yes), the process proceeds to step S601 in FIG. In FIG. 6, in step S601, it is determined whether there is an unprocessed node. In FIG. 4, an unprocessed node is a node in a numerical state that is not a small black circle.

  If there is an unprocessed node (step S601: Yes), an unprocessed node is extracted from the tree structure data in an incomplete state (step S602). The prime factorization unit 204 then primes the numerical value M of the unprocessed node (step S603).

Then, the prime number-exponential set PE _j is arranged in ascending order of the prime number P _j to obtain a numerical sequence S1 (step S604). Then, the prime number P _j of this number sequence S1 is converted into a prime number I _j to obtain a number sequence S2 (step S605). Then, for the sequence S2, the prime number I _j is converted to I _j −I _j−1 (step S606) to obtain the sequence S3.

Next, it is determined whether or not the index E _n at the end of the sequence S3 is E _n = 1 (step S607). When E _n = 1 (step S607: Yes), a sequence S4 from which E _n is deleted is obtained (step S608). On the other hand, if E _n = 1 is not satisfied (step S607: No), a sequence S4 with E _n = E _n −1 is obtained (step S609).

  Then, branches corresponding to the number of numerical values in the sequence S4 are generated from unprocessed nodes (step S610), and the numerical values in the sequence S4 are generated as branch destination nodes (step S611). Then, it is determined whether or not the value of the branch destination node is 2 or more (step S612). When the value is 2 or more (step S612: Yes), the branch destination node is determined as a new unprocessed node (step S613), and the process returns to step S601.

  On the other hand, if the value is not 2 or more (step S612: No), since the node is a numerical value 1, the node is converted into a leaf (step S614). An unprocessed node becomes a processed node at this point. In FIG. 4, it is a small black circle other than the leaf.

  On the other hand, if there is no unprocessed node in step S601 (step S601: No), the process proceeds to step S504 shown in FIG. 5, and the tree structure data of numerical value N is held in the memory (step S504). The output unit 206 outputs the tree structure data of the numerical value N (step S505). As a result, the series of processes is completed.

  FIG. 7 shows various tree structure data generated by the tree structure data generation processing procedure of FIGS. FIG. 7 is an explanatory diagram showing various tree structure data generated by the tree structure data generation processing procedure. FIG. 7 shows tree structure data up to an input numerical value N (N = 1 to 20).

(Tree structure data decoding procedure)
Next, the tree structure data decoding processing procedure by the information processing apparatus 210 according to the embodiment of the present invention will be described. FIG. 8 is a flowchart showing a tree structure data decoding processing procedure by the information processing apparatus 210 according to the embodiment of the present invention. In FIG. 8, the process waits until the tree structure data is acquired (step S801: No). When the tree structure data is acquired by the acquisition unit 211 (step S801: Yes), a numerical value unique to the tree structure data by the specifying unit 214 Is identified (step S802).

  That is, a unique numerical value is specified by following the reverse procedure of the tree structure data generation processing procedure (flowchart in FIG. 6) from paragraph number [0087] to paragraph number [0094]. Then, the numerical value output unit 215 outputs the numerical value specified by the specifying unit 214 (step S803). As a result, the series of processes is completed.

(Example of tree structure data display)
Next, a display example of tree structure data will be described. FIG. 9 is an explanatory diagram showing a display example of tree structure data. In FIG. 9, the tree structure data generated by the generation process of FIG. 4 is used as the tree structure data T (N). In FIG. 9, (A) is a normal display form. The display form can be changed by parameters relating to the tree structure data T (N).

  For example, in (B), since the display area 901 (corresponding to the display screen 208) is substantially square, the tree structure data T (N) can be obtained by changing the angle of the branch from the node or shortening the length of the branch. Is folded and displayed so as to fit in the display area 902.

  Similarly, in (C), since the display area 902 (corresponding to the display screen 208) is a vertically long substantially rectangular shape, the tree structure data T can be changed by changing the angle of the branch from the node or shortening the length of the branch. (N) is folded and displayed so as to fit in the display area 902.

  In the information processing apparatus 210, when acquiring and specifying tree structure data, a numerical value unique to the tree structure data is specified by using the number of nodes, the number of branches, the number of leaves, the number of branches from each node, and the like as clues. Therefore, the shape of the tree structure data may be deformed as long as the information used as a clue for specifying the numerical value is the same regardless of how the nodes are bent or the lengths of the branches are different. Therefore, there is a merit that variations of tree structure data that can be expressed by the same numerical value can be increased.

  FIG. 10 is an explanatory diagram showing tree structure data when the reading surface 1000 (corresponding to the display screen 208) is tilted. Since the tree structure data T (N) is composed of elements composed of nodes (including roots and leaves) and branches, it is only necessary to identify these elements.

  Therefore, even if the reading surface 1000 is slightly inclined or distorted, the connection relationship between the nodes is maintained, so that there is an advantage that reading is easy and reading errors are small. On the other hand, the bar code shown in FIG. 11 expresses a numerical value by combining bars having different widths, and is disadvantageous in that it is difficult to read when the reading surface is inclined or distorted and reading error is large. There is.

  As described above, according to the above-described embodiment, when the numerical value N increases, the tree expands on the plane. The tree structure data is composed of nodes (including root and leaf) and branches. Therefore, as long as the node connection relationship is maintained, the numerical value unique to the tree structure data does not change, and the shape can be deformed. Therefore, there is an advantage that it is easy to display in a display area of various shapes as compared with the conventional numerical expression.

  Further, since the tree structure data and the numerical value uniquely correspond to each other, the tree structure data can be managed as a numerical value. For example, tree structure data can be converted into numerical values and stored, and restored to the original tree structure data as necessary.

  Moreover, tree structure data can be applied to personal authentication. For example, by inputting the password into a tree structure input by hand such as a touch pen in addition to entering a number, the user can memorize the number string and the tree structure in a double manner, and forget the password. Can be prevented. In addition, even if the numeric string is random, there are cases where the structure is regular if expressed by tree structure data, and there is an advantage that the user can select a tree structure that is easy to remember according to his / her preference.

  As described above, according to the information processing method, the information processing apparatus, and the information processing program, it is possible to improve the degree of freedom in displaying a graphic converted from a numerical value. In addition, there is an effect that security can be improved.

  The information processing method described in this embodiment can be realized by executing a program prepared in advance on a computer such as a personal computer or a workstation. This program is recorded on a computer-readable recording medium such as a hard disk, a flexible disk, a CD-ROM, an MO, and a DVD, and is executed by being read from the recording medium by the computer. The program may be a transmission medium that can be distributed via a network such as the Internet.

(Supplementary Note 1) An input process for receiving an input of a numerical value of an arbitrary natural number;
A setting step for setting a route of a numerical value input by the input step (hereinafter referred to as “input numerical value”);
An extraction step for extracting a node that excludes a leaf and is not a branching source from a group of nodes including at least the route set by the setting step;
A prime factorization step of prime factorizing a numerical value associated with the node extracted by the extraction step;
A generation step of generating tree structure data including at least the root based on the decomposition result decomposed by the prime factorization step;
An output step of outputting the tree structure data generated by the generation step;
An information processing method comprising:

(Additional remark 2) The input numerical value determination process which determines whether the said input numerical value is 2 or more,
The output step includes
The information processing method according to claim 1, wherein the tree structure data is output based on a determination result determined by the input numerical value determination step.

(Appendix 3) The output step
3. The information processing method according to appendix 2, wherein when the input numerical value determining step determines that the input numerical value is not 2 or more, tree structure data including only the root is output.

(Supplementary Note 4) The extraction step includes:
If the input numerical value is determined to be 2 or more by the input numerical value determination step, a node excluding a leaf is extracted from a node group including at least the route set by the setting step. 3. The information processing method according to 2.

(Additional remark 5) The calculation process which calculates the numerical sequence peculiar to the numerical value of the decomposition | disassembly origin based on the decomposition | disassembly result decomposed | disassembled by the said prime factor decomposition process,
The generation step includes
The information processing method according to any one of appendices 1 to 4, wherein tree structure data unique to the numerical sequence calculated by the calculation step is generated.

(Appendix 6) An array step of arranging a combination of prime numbers obtained from the decomposition result decomposed by the prime factorization step and exponents of the prime numbers in the order of the prime numbers and the exponents, in order of increasing prime value values;
A prime number conversion step of converting all prime numbers in the number sequence obtained by the array in the array step to prime numbers assigned in ascending order of the prime values;
Prime number conversion for converting one prime number in the sequence after the conversion by the prime conversion step into a difference value obtained by subtracting another prime number arranged immediately before the one prime number from the one prime number Process,
Determining whether the numerical value at the end of the sequence after the conversion by the prime number conversion step is 1,
The calculation step includes
6. The information processing according to claim 5, wherein a number sequence unique to the numerical value of the decomposition source is calculated based on the number sequence after the conversion by the prime number conversion step and the determination result determined by the determination step. Method.

(Supplementary note 7)
When it is determined by the determining step that the numerical value at the end is 1, a numerical sequence unique to the numerical value of the decomposition source is calculated by deleting the numerical value at the end from the numerical sequence after the conversion by the prime number conversion step The information processing method according to appendix 6, wherein:

(Supplementary note 8)
When it is determined by the determination step that the numerical value at the end is not 1, a numerical sequence unique to the numerical value of the decomposition source is calculated by subtracting the numerical value at the end from the numerical sequence after the conversion by the prime number conversion step. The information processing method according to supplementary note 6, wherein

(Supplementary Note 9) Branches corresponding to the number of numerical values (hereinafter referred to as “numerical sequence constituent numerical values”) constituting a numerical sequence unique to the numerical value of the decomposition source calculated by the calculating step are extracted from the nodes extracted by the extracting step. A branch generation process to generate;
A branch destination node generating step of generating a branch destination node for the branch source node by associating each numerical sequence constituent numerical value with a tip of each branch generated by the branch generation step;
A conversion step of converting the branch destination node into the leaf based on the numerical sequence constituent value associated with the branch destination node generated by the branch destination node generation step,
The generation step includes
10. The information processing method according to any one of appendices 5 to 9, wherein tree structure data including the root, the branch source node, the branch, and a leaf converted by the conversion step is generated.

(Supplementary Note 10) The output step includes
10. The information processing method according to any one of supplementary notes 1 to 9, wherein the tree structure data is displayed on a display screen.

(Supplementary note 11) The input step is:
Accepts input of parameters related to the tree structure data,
The output step includes
The information processing method according to appendix 10, wherein the tree structure data is displayed on the display screen based on the parameter input in the input step.

(Supplementary note 12) The information processing method according to supplementary note 10 or 11, wherein the tree structure data is deformed according to a size of the display screen and displayed on the display screen.

(Supplementary note 13) The output step includes
The information processing method according to any one of appendices 1 to 12, wherein the tree structure data is transmitted from a computer device that is a generation source of the tree structure data to another computer device.

(Additional remark 14) The said input numerical value is an identification code regarding a user, The information processing method as described in any one of additional marks 1-13 characterized by the above-mentioned.

(Supplementary note 15) The information processing method according to any one of supplementary notes 1 to 13, wherein the input numerical value is an identification code related to an article.

(Supplementary Note 16) An acquisition step of acquiring tree structure data;
A specifying step of specifying a numerical value unique to the tree structure data based on a connection relationship between nodes constituting the tree structure data acquired by the acquisition step;
An output step of outputting a numerical value specified by the specifying step;
An information processing method comprising:

(Supplementary Note 17)
17. The information processing method according to appendix 16, wherein the tree structure data is acquired by reading an image related to the tree structure.

(Supplementary note 18)
18. The information processing method according to appendix 16, wherein the tree structure data is received from a computer device that stores the tree structure data.

(Supplementary note 19) The information processing method according to any one of supplementary notes 16 to 18, wherein the numerical value is an identification code relating to a user.

(Supplementary note 20) The information processing method according to any one of supplementary notes 16 to 18, wherein the numerical value is an identification code related to an article.

(Supplementary Note 21) An input means for receiving an input of an arbitrary natural number,
Setting means for setting a route of a numerical value (hereinafter referred to as “input numerical value”) input by the input means;
An extraction unit that extracts a node that is not a branch source and that excludes a leaf from a group of nodes including at least the route set by the setting unit;
Prime factorization means for prime factoring a numerical value associated with the node extracted by the extraction means;
Generating means for generating tree structure data including at least the root based on the decomposition result decomposed by the prime factor decomposition means;
Output means for outputting the tree structure data generated by the generating means;
An information processing apparatus comprising:

(Supplementary Note 22) Acquisition means for acquiring tree structure data;
Specifying means for specifying a numerical value unique to the tree structure data based on a connection relationship between nodes constituting the tree structure data acquired by the acquisition means;
Output means for outputting a numerical value specified by the specifying means;
An information processing apparatus comprising:

(Supplementary Note 23) An input process for accepting input of a numerical value of an arbitrary natural number;
A setting step for setting a route of a numerical value (hereinafter referred to as “input numerical value”) input by the input step;
An extraction step for extracting a node that is not a branching source and excluding a leaf from a node group including at least the route set by the setting step;
A prime factorization step of prime factorizing a numerical value associated with the node extracted by the extraction step;
A generation step of generating tree structure data including at least the root based on a decomposition result decomposed by the prime factorization step;
An output step of outputting the tree structure data generated by the generation step;
An information processing program that causes a computer to execute.

(Supplementary Note 24) An acquisition step of acquiring tree structure data;
A specifying step of specifying a numerical value unique to the tree structure data based on a connection relation between nodes constituting the tree structure data acquired by the acquiring step;
An output step of outputting the numerical value specified by the specifying step;
An information processing program that causes a computer to execute.

(Supplementary Note 25) A computer-readable recording medium on which the information processing program according to Supplementary Note 23 or 24 is recorded.

  As described above, the information processing method, information processing apparatus, and information processing program according to the present invention are suitable for merchandise management, security (such as personal authentication), and the like.

It is a block diagram which shows the hardware constitutions of the information processing apparatus concerning embodiment of this invention. It is a block diagram which shows the functional structure of the information processing apparatus concerning embodiment of this invention. It is explanatory drawing which shows a prime-prime number conversion table. It is explanatory drawing which shows the production | generation process of tree structure data. It is a flowchart (the 1) which shows the tree structure data generation processing procedure by the information processing apparatus 200 concerning embodiment of this invention. It is a flowchart (the 2) which shows the tree structure data generation processing procedure by the information processing apparatus 200 concerning embodiment of this invention. It is explanatory drawing which shows the various tree structure data produced | generated by the tree structure data production | generation process procedure. It is a flowchart which shows the tree structure data decoding process sequence by the information processing apparatus 210 concerning embodiment of this invention. It is explanatory drawing which shows the example of a display of tree structure data. It is explanatory drawing which shows the tree structure data at the time of inclining a reading surface. It is explanatory drawing which shows a barcode.

Explanation of symbols

200, 210 Information processing apparatus 201 Input unit 202 Setting unit 203 Extraction unit 204 Prime factorization unit 205 Generation unit 206 Tree structure data output unit 207, 216 Display control unit 208, 217 Display screen 209 Transmission unit 211 Acquisition unit 212 Reading unit 213 Reception Part 214 Identification part 215 Numerical output part

Claims (5)

An input process for receiving an input of an arbitrary natural number;
A setting step for setting a route of a numerical value input by the input step (hereinafter referred to as “input numerical value”);
An extraction step for extracting a node that excludes a leaf and is not a branching source from a group of nodes including at least the route set by the setting step;
A prime factorization step of prime factorizing a numerical value associated with the node extracted by the extraction step;
A generation step of generating tree structure data including at least the root based on the decomposition result decomposed by the prime factorization step;
An output step of outputting the tree structure data generated by the generation step;
An information processing method comprising: An acquisition process for acquiring tree structure data;
A specifying step of specifying a numerical value unique to the tree structure data based on a connection relationship between nodes constituting the tree structure data acquired by the acquisition step;
An output step of outputting a numerical value specified by the specifying step;
An information processing method comprising: An input means for receiving an input of an arbitrary natural number;
Setting means for setting a route of a numerical value (hereinafter referred to as “input numerical value”) input by the input means;
An extraction unit that extracts a node that is not a branch source and that excludes a leaf from a group of nodes including at least the route set by the setting unit;
Prime factorization means for prime factoring a numerical value associated with the node extracted by the extraction means;
Generating means for generating tree structure data including at least the root based on the decomposition result decomposed by the prime factor decomposition means;
Output means for outputting the tree structure data generated by the generating means;
An information processing apparatus comprising: Acquisition means for acquiring tree structure data;
Specifying means for specifying a numerical value unique to the tree structure data based on a connection relationship between nodes constituting the tree structure data acquired by the acquisition means;
Output means for outputting a numerical value specified by the specifying means;
An information processing apparatus comprising: An input process for accepting an input of an arbitrary natural number;
A setting step for setting a route of a numerical value (hereinafter referred to as “input numerical value”) input by the input step;
An extraction step for extracting a node that is not a branching source and excluding a leaf from a node group including at least the route set by the setting step;
A prime factorization step of prime factorizing a numerical value associated with the node extracted by the extraction step;
A generation step of generating tree structure data including at least the root based on a decomposition result decomposed by the prime factorization step;
An output step of outputting the tree structure data generated by the generation step;
An information processing program that causes a computer to execute.

Images