Abstract: A brain activity determination device is equipped with a chaos index value calculation unit 201 for calculating a chaos index value, which is an index for determining the chaotic nature in chronologically ordered data; and a determination unit 205, which stores outputs obtained by inputting the RRI data obtained from a subject placed in a first state where the load on the brain is for obtaining reference value data, calculates an index value ratio that is a ratio of the reference value data and the chaos index value to be evaluated by inputting the RRI data obtained from a determination subject whose brain load is in a second state where evaluation target data is obtained to the chaos index value calculation unit 201 after obtaining the chaos index value to be evaluated, which is the data to be evaluated; and determines the brain activity state of the determination subject based on a comparison between the brain activity threshold and the index value ratio to determine the brain activity state.

Abstract: To achieve high accuracy and high processing speed, a time series data evaluation device is equipped with a probability calculation unit 201 that calculates the probability p(i) that ?t?Ai; a division entropy calculation unit 202 that calculates division entropy using the measure in the subdivision interval by setting a subdivision section Bi (i=1, 2, . . . , M×Q) by further dividing the divided section Ai (i=1, 2, . . . , M) into Q equal parts; and a summation calculation unit 203 that performs a summation calculation of the divided interval range regarding the multiplication of the probability p(i) and the division entropy.

Abstract: A demand prediction device derives a first exponential function indicating the time-series transition of the number of bookings until a service provision time point for a first customer group based on the transition of the number of bookings until a time point t1 for the first group. A demand prediction device derives a second exponential function indicating the time-series transition of the number of bookings until a service provision time point for a second customer group based on the transition of the number of bookings until a time point t2 for the second customer group different from the first group. The demand prediction device generates information supporting a service providing entity based on the time-series transition of the number of bookings until an analysis target time point for the first customer group indicated by the first exponential function and that for the second customer group by the second exponential function.

Abstract: It is aimed to provide a power supply device and a power supply system which enable consumers to freely choose electrical power and specify transmission sources when receiving electrical power, and enable parties involved in transactions (power supply side and power receiving side) to reliably and safely perform transmission between them. There are provided a power supply device and a power supply system. The power supply device includes a baseband unit that generates a power signal, a modulation processing unit that modulates the power signal generated by the baseband unit to impart a code thereto for specifying a transmission source of the power signal and generates a modulated signal that can be demodulated by a power receiving device, and a transmission unit that transmits the modulated signal generated by the modulation processing unit.

Abstract: It is aimed to provide a power supply device and a power supply system which enable consumers to freely choose electrical power and specify transmission sources when receiving electrical power, and enable parties involved in transactions (power supply side and power receiving side) to reliably and safely perform transmission between them. There are provided a power supply device and a power supply system. The power supply device includes a baseband unit that generates a power signal, a modulation processing unit that modulates the power signal generated by the baseband unit to impart a code thereto for specifying a transmission source of the power signal and generates a modulated signal that can be demodulated by a power receiving device, and a transmission unit that transmits the modulated signal generated by the modulation processing unit.

Abstract: A computer calculates a change amount of a total number of electrons from an observation start time in the ionosphere between an observation station and a satellite based on observation data of a signal received from the satellite by the observation station on the ground. The computer estimates the change amount of the total number of electrons to be calculated next based on the time change of the change amount of the total number of electrons from the observation start time in the ionosphere and calculates a difference (estimation error) between the estimated change amount of the total number of electrons and the actually calculated change amount of the total number of electrons. The computer calculates a correlation value between the estimation error calculated for each observation station and the estimation error calculated for a predetermined number of the observation stations in the vicinity of each observation station.

Abstract: A computer calculates a change amount of a total number of electrons from an observation start time in the ionosphere between an observation station and a satellite based on observation data of a signal received from the satellite by the observation station on the ground. The computer estimates the change amount of the total number of electrons to be calculated next based on the time change of the change amount of the total number of electrons from the observation start time in the ionosphere and calculates a difference (estimation error) between the estimated change amount of the total number of electrons and the actually calculated change amount of the total number of electrons. The computer calculates a correlation value between the estimation error calculated for each observation station and the estimation error calculated for a predetermined number of the observation stations in the vicinity of each observation station.

Abstract: The communication method using an almost periodic function code includes using, for modulation, almost periodic function codes the number of which is in accordance with the number of users or the number of channels, among K almost periodic function codes. Where k is an integer from 1 to K and is an identifier for identifying each of the K almost periodic function codes, a parameter that determines each of the K almost periodic function codes is represented by ?+(k?1)/K. The symbol K is N or 2N, where N is a code length of each almost periodic function code. The symbol ? is a real number greater than 0 and less than 1/N.

Abstract: A computer calculates a change amount of a total number of electrons from an observation start time in the ionosphere between an observation station and a satellite based on observation data of a signal received from the satellite by the observation station on the ground. The computer estimates the change amount of the total number of electrons to be calculated next based on the time change of the change amount of the total number of electrons from the observation start time in the ionosphere and calculates a difference (estimation error) between the estimated change amount of the total number of electrons and the actually calculated change amount of the total number of electrons. The computer calculates a correlation value between the estimation error calculated for each observation station and the estimation error calculated for a predetermined number of the observation stations in the vicinity of each observation station.

Abstract: The communication method using an almost periodic function code includes using, for modulation, almost periodic function codes the number of which is in accordance with the number of users or the number of channels, among K almost periodic function codes. Where k is an integer from 1 to K and is an identifier for identifying each of the K almost periodic function codes, a parameter that determines each of the K almost periodic function codes is represented by ?+(k?1)/K. The symbol K is N or 2N, where N is a code length of each almost periodic function code. The symbol ? is a real number greater than 0 and less than 1/N.

Abstract: An electronic price-proposing server is provided with: a secret-key recording means for recording identification codes assigned individually to multiple user terminals and calculation values thereof, in association with each of the users as secret keys thereof, an encrypting means for generating encryption data with the chaotic encryption method, a price-data recording means for recording the encryption data in association with the corresponding item and user, a searching means for searching for and reading encryption data corresponding to requests from user terminals, and a transmitting means for transmitting the result thereof to the user terminals. Meanwhile, the user terminals are provided with: a decrypting means for decrypting the received encrypted data, using an identification-code value read out from an identification-code value reading means, and generating the original price data, and a displaying means for displaying the decrypted price data.

Abstract: A signal separating device includes an iterative estimator, a repeating calculator, a result output unit, and a repetition controller. The repeating calculator repeatedly causes the iterative estimator to iteratively perform independent component analysis on an observed signal matrix, and to further perform independent component analysis on the source signal matrix obtained as a result. The result output unit outputs the product of the respective mixing matrices obtained during each repetition as a mixing matrix with respect to the observed signal matrix, while also outputting the source signal matrix obtained during the final repetition as a source signal matrix with respect to the observed signal matrix. The repetition controller causes the repeating calculator to repeat the calculation control until all mixing matrices and all source signal matrices satisfy a convergence condition. The iterative estimator may perform a fixed number of iterations, or perform iterations until convergence is obtained.

Abstract: A converter uses a predetermined parameter a. A generating unit accepts generated inputs x1, . . . , xn, and generates generated outputs, y1, . . . , yn, using recurrence formulas, y1=F1(x1, a) and yi+1=Fi+1(xi+1, y1)(1?i?n?1). A key accepting unit accepts key inputs, k1, . . . , kn, and gives them as generated inputs to said generating unit. A repetition controller gives the generated outputs as generated inputs to said generating unit, for an “m” (m?0) number of times, and sets one of the generated outputs to be given at the end as a random number string, r1, . . . , rn. The data accepting unit accepts data inputs, d1, . . . , dn. The converting unit converts data using, ei=di?ri, and, outputs data outputs, e1, . . . , en. The converter can be used both for encrypting and decrypting data.

Abstract: Random number generating, encrypting, and decrypting apparatus, method thereof, program thereof, and recording medium thereof are provided. Random numbers for cryptographic applications are generated by a CA core. The CA core is composed of one-dimensional, two-state, and three-neighbor cell automaton. A total of three inputs for the own cell and both neighbor cells are input to each cell. Each cell performs a logical operation and outputs the result of the logical operation. Each cell contains a register. Each register captures the result of the logical operation in synchronization with a clock and stores the result. An output of a cell is fed back to the cell to perform an arithmetic calculation at the next time step. In this case, a rotation shift operation of which outputs of cells are shifted to the left and fed back to the cells is performed. To output random numbers having many bits, 40 bits of outputs of cells are selected.

Abstract: A communication system (101), which uses a primitive root “q” of a prime number “p”, uses b[k]=(1, exp(2?i×q0+k/p), exp(2?i×q1+k/p), . . . , exp(2?i×q(p?2)+k/p)) for each value of an integer k=0, 1, . . . , (p?2), “p” number of p-dimensional vectors b[i] each defined by b[p?1]=(1, 1, 1, . . . , 1), and their conjugate complex vectors c[i]. A transmitting device (111) converts a signal to be transmitted into a parallel form, calculates the inner products between the parallel signals and the vectors b[i] respectively, inserts guard intervals to convert them into a serial form and transmits the serial signal. A receiving device (131) eliminates the guard intervals from the received signal, synchronizes with the signal, converts the signal into a parallel form, calculates the inner products between the parallel signals and the vectors c[i] respectively, converts the signals into a serial form to obtain the signal that has been transmitted.

Abstract: A chaos spreading code c(n) is inputted to a spreading unit 32. Data D1 and c(n) are multiplied in the spreading unit 32. A chaos spreading code d(n) is inputted to a spreading unit 42. Data D2 and d(n) are multiplied in the spreading unit 42. The chaos spreading codes c(n) and d(n) orthogonally cross each other. Outputs of the spreading units 32 and 42 are added by an adder 35 and transmitted through a transmitting unit 36 to a transmission path 38. By making an initial value which is set in a chaos sequence generator having a construction of a digital circuit different, the chaos spreading codes which orthogonally cross can be formed. Since the chaos spreading codes c(n) and d(n) orthogonally cross, an orthogonal modulating unit having a construction of an analog circuit for amplitude-modulating carriers which orthogonally cross can be made unnecessary and the construction can be simplified.

Abstract: In order to transmit and receive not less than a binary digital signal using a code table in which chaotic map is used and an independent component analysis, a transmitting device (121) and a receiving device (141) of a communication system (101) use the same chaos function T(•) and the same applying function A(•, •) to generate and hold a corresponding table that makes a sequence of a predetermined length correspond to each of bit sequences of a predetermined length as a code by using a code table generating device (161).

Abstract: A converter uses a predetermined parameter a. A generating unit accepts generated inputs x1, . . . , xn, and generates generated outputs, y1, . . . , yn, using recurrence formulas, y1=F1 (x1, a) and yi+1=Fi+1 (xi+1, y1) (1?i?n?1). A key accepting unit accepts key inputs, k1, . . . , kn, and gives them as generated inputs to said generating unit. A repetition controller gives the generated outputs as generated inputs to said generating unit, for an “m” (m?0) number of times, and sets one of the generated outputs to be given at the end as a random number string, r1, . . . , rn. The data accepting unit accepts data inputs, d1, . . . , dn. The converting unit converts data using, ei=di?ri, and, outputs data outputs, e1, . . . , en. The converter can be used both for encrypting and decrypting data.

Abstract: A signal separating device includes an iterative estimator, a repeating calculator, a result output unit, and a repetition controller. The repeating calculator repeatedly causes the iterative estimator to iteratively perform independent component analysis on an observed signal matrix, and to further perform independent component analysis on the source signal matrix obtained as a result. The result output unit outputs the product of the respective mixing matrices obtained during each repetition as a mixing matrix with respect to the observed signal matrix, while also outputting the source signal matrix obtained during the final repetition as a source signal matrix with respect to the observed signal matrix. The repetition controller causes the repeating calculator to repeat the calculation control until all mixing matrices and all source signal matrices satisfy a convergence condition. The iterative estimator may perform a fixed number of iterations, or perform iterations until convergence is obtained.

Abstract: An input receiving section 102 of a transmitter apparatus 101 receives inputs of multiple synchronized signals r1, . . . , rN, an asynchronizing section 103 outputs multiple asynchronized signals v1, . . . , vN that are obtained by delaying the multiple synchronized signals r1, . . . , rN by time t1, . . . , tN, a modulating section 104 modulates the multiple output asynchronized signals v1, . . . , vN to output modulated signal w1, . . . wL (1?L?N), a transmitting section 105 transmits the output modulated signal w1, . . . wL, and the delay time t1, . . . , tN is shorter than a reciprocal number of a minimum value of clock rates of the multiple input received synchronized signals r1, . . . , rN, and is desirably proportional to one generated by a chaos random number in particular.