Abstract: Traffic data while the system is in operation is collected for a certain time as a preprocess. Typical patterns are extracted from the collected traffic data. Next, stream programs are created for the individual typical patterns and stored for the future reference. Next, the IDs of alternative tasks for transition among different stream programs are stored. In actual system operation, the system measures traffic data regularly or at any time, compares the resultant patterns with the typical patterns, and selects a stream program corresponding to the closest typical pattern as the next phase. Program shutdown time when shifting from the stream program in the present phase to the next phase can be reduced by gradually shifting empty tasks in the present phase to the next stream program as alternative tasks in consideration of the cost of switching between tasks, the cost of transferring data among resources, and so on.

Abstract: Traffic data while the system is in operation is collected for a certain time as a preprocess. Typical patterns are extracted from the collected traffic data. Next, stream programs are created for the individual typical patterns and stored for the future reference. Next, the IDs of alternative tasks for transition among different stream programs are stored. In actual system operation, the system measures traffic data regularly or at any time, compares the resultant patterns with the typical patterns, and selects a stream program corresponding to the closest typical pattern as the next phase. Program shutdown time when shifting from the stream program in the present phase to the next phase can be reduced by gradually shifting empty tasks in the present phase to the next stream program as alternative tasks in consideration of the cost of switching between tasks, the cost of transferring data among resources, and so on.

Abstract: A segment including a set of blocks necessary to calculate blocks having internal states and blocks having no outputs is extracted by tracing from blocks for use in calculating inputs into the blocks having internal states and from the blocks having no outputs in the reverse direction of dependence. To newly extract segments in which blocks contained in the extracted segments are removed, a set of nodes to be temporarily removed is determined on the basis of parallelism. Segments executable independently of other segments are extracted by tracing from nodes whose child nodes are lost by removal of the nodes in the upstream direction. Segments are divided into upstream segments representing the newly extracted segments and downstream segments representing nodes temporarily removed. Upstream and downstream segments are merged so as to reduce overlapping blocks between segments such that the number of segments is reduced to the number of parallel executions.

Abstract: A segment including a set of blocks necessary to calculate blocks having internal states and blocks having no outputs is extracted by tracing from blocks for use in calculating inputs into the blocks having internal states and from the blocks having no outputs in the reverse direction of dependence. To newly extract segments in which blocks contained in the extracted segments are removed, a set of nodes to be temporarily removed is determined on the basis of parallelism. Segments executable independently of other segments are extracted by tracing from nodes whose child nodes are lost by removal of the nodes in the upstream direction. Segments are divided into upstream segments representing the newly extracted segments and downstream segments representing nodes temporarily removed. Upstream and downstream segments are merged so as to reduce overlapping blocks between segments such that the number of segments is reduced to the number of parallel executions.

Abstract: A method, system, and article of manufacture for solving ordinary differential equations described in a graphical model with nodes as blocks and dependencies as links using the processing of a computer with a plurality of processors. The method includes: generating segments of block with or without duplication for each block with an internal state and for each block without any output by traversing the graphical model from each block with an internal state to each block without any output; merging the segment to reduce duplication; compiling and converting each segment from the merged results in an executable code; and individually allocating the executable code for each segment to a plurality of processors for parallel execution.

Abstract: A parallelization method, system and program. A program expressed by a block diagram or the like is divided into strands and a balance in calculation time is made among the strands. The functional blocks are divided into strands and the strand involving the maximum calculation time from a strand set is found. One or more movable blocks in the strand involving the maximum calculation time is found. The next step is obtaining calculation time of each strand after the movable block is moved to the strand in the input or output direction according to its property, and moving the block to a strand most largely reducing the calculation time of the strand having the maximum calculation time before the movement. This process loops until calculation time is no longer reduced. Strands are then transformed into source codes. Source codes are compiled and assigned to separate cores or processors for execution.

Abstract: A computer-implemented method, system, and article of manufacture for parallelizing a code configured by coupling a functional block having an internal state and a functional block without any internal state. The method includes: creating and storing a graphical representation where functional blocks are chosen as nodes and connections between functional blocks are chosen as links; visiting the nodes on the graphical representation sequentially, detecting inputs from functional blocks without any internal state to functional blocks having an internal state and storing these functional blocks as a set of use blocks, and detecting inputs from functional blocks having an internal state to functional blocks without any internal state and storing these functional blocks as a set of definition blocks; and forming strands of functional blocks based on information on the set of use blocks and information on the set of definition blocks stored in association with the functional blocks.

Abstract: A segment including a set of blocks necessary to calculate blocks having internal states and blocks having no outputs is extracted by tracing from blocks for use in calculating inputs into the blocks having internal states and from the blocks having no outputs in the reverse direction of dependence. To newly extract segments in which blocks contained in the extracted segments are removed, a set of nodes to be temporarily removed is determined on the basis of parallelism. Segments executable independently of other segments are extracted by tracing from nodes whose child nodes are lost by removal of the nodes in the upstream direction. Segments are divided into upstream segments representing the newly extracted segments and downstream segments representing nodes temporarily removed. Upstream and downstream segments are merged so as to reduce overlapping blocks between segments such that the number of segments is reduced to the number of parallel executions.

Abstract: A segment including a set of blocks necessary to calculate blocks having internal states and blocks having no outputs is extracted by tracing from blocks for use in calculating inputs into the blocks having internal states and from the blocks having no outputs in the reverse direction of dependence. To newly extract segments in which blocks contained in the extracted segments are removed, a set of nodes to be temporarily removed is determined on the basis of parallelism. Segments executable independently of other segments are extracted by tracing from nodes whose child nodes are lost by removal of the nodes in the upstream direction. Segments are divided into upstream segments representing the newly extracted segments and downstream segments representing nodes temporarily removed. Upstream and downstream segments are merged so as to reduce overlapping blocks between segments such that the number of segments is reduced to the number of parallel executions.

Abstract: Provides e-mail address forming methods to know with certainty whether or not an e-mail address was leaked. A method includes: sending a receiver's identifier and a sender's identifier to a receiver's mail server; computing a value which is encrypted by the mail server with a secret key, the secret key being only possessed by the mail server, from the receiver's identifier, the sender's identifier, and a nonce issued by the mail server, and sending the value to a receiver; and forming an e-mail address (LD address) to be used by a sender who sends a mail to a receiver, by attaching a receiver's domain name to the encrypted value. Furthermore, the present invention has an e-mail address sending method, and an e-mail sending system which uses the e-mail address forming method to know with certainty whether or not the user of an e-mail address leaked the e-mail address.

Abstract: Provides e-mail address forming methods to know with certainty whether or not an e-mail address was leaked. A method includes: sending a receiver's identifier and a sender's identifier to a receiver's mail server; computing a value which is encrypted by the mail server with a secret key, the secret key being only possessed by the mail server, from the receiver's identifier, the sender's identifier, and a nonce issued by the mail server, and sending the value to a receiver; and forming an e-mail address (LD address) to be used by a sender who sends a mail to a receiver, by attaching a receiver's domain name to the encrypted value. Furthermore, the present invention has an e-mail address sending method, and en e-mail sending system which uses the e-mail address forming method to know with certainty whether or not the user of an e-mail address leaked the e-mail address.

Abstract: A method, system, and computer readable article of manufacture to enable parallel execution of a divided source code in a multiprocessor system. The method includes the steps of: inputting an original source code by an input device into the computing apparatus; finding a critical path in the original source code by a critical path cut module; cutting the critical path in the original source code into a plurality of process block groups by the critical path cut module; and dividing the plurality of process block groups among a plurality of processors in the multiprocessor system by a CPU assignment code generation module to produce the divided source code. The system includes an input device; a critical path cut module; and a CPU assignment code generation unit to produce the divided source code. The computer readable article of manufacture includes instructions to implement the method.

Abstract: Provides e-mail address forming methods to know with certainty whether or not an e-mail address was leaked. A method includes: sending a receiver's identifier and a sender's identifier to a receiver's mail server; computing a value which is encrypted by the mail server with a secret key, the secret key being only possessed by the mail server, from the receiver's identifier, the sender's identifier, and a nonce issued by the mail server, and sending the value to a receiver; and forming an e-mail address (LD address) to be used by a sender who sends a mail to a receiver, by attaching a receiver's domain name to the encrypted value. Furthermore, the present invention has an e-mail address sending method, and en e-mail sending system which uses the e-mail address forming method to know with certainty whether or not the user of an e-mail address leaked the e-mail address.

Abstract: A system for enabling verification in traceability of a supply chain while maintaining confidentiality of private suppliers. A group signature is applied to an undisclosed supplier. The undisclosed supplier previously receives registration to the certificate authority device, and performs a group signature based on the certificate issued by the certificate authority device. A disclosed supplier and the undisclosed supplier sign and generate a signature chain when they ship parts. A verifier device receives a signature chain with products shipped from the supplier manager device, divides a signature of the disclosed supplier from a signature chain, and verifies the undisclosed supplier from the group signature. Identification of the undisclosed supplier is performed by a third-party auditor system requested to do so by the verifier device by using a group private key.

Abstract: Paralleling processing system and method. When clusters are formed based on strongly connected components, a single cluster (fat cluster) having at least a predetermined number of blocks, or an expected processing time exceeding a predetermined threshold, is formed. The fat cluster is subjected to an unrolling process to make multiple copies of the processing of the fat cluster and to assign the copies to individual processors. Processing of the fat cluster is executed by the multiple processor devices in a pipelined manner. If a fat cluster to be iteratively executed cannot be executed in the pipelined manner because a processing result of an nth iteration of the fat cluster depends on a processing result of a preceding iteration of the fat cluster an input value needed for execution of the fat cluster is generated based on a certain prediction, and the fat cluster is speculatively executed.

Abstract: Traffic data while the system is in operation is collected for a certain time as a preprocess. Typical patterns are extracted from the collected traffic data. Next, stream programs are created for the individual typical patterns and stored for the future reference. Next, the IDs of alternative tasks for transition among different stream programs are stored. In actual system operation, the system measures traffic data regularly or at any time, compares the resultant patterns with the typical patterns, and selects a stream program corresponding to the closest typical pattern as the next phase. Program shutdown time when shifting from the stream program in the present phase to the next phase can be reduced by gradually shifting empty tasks in the present phase to the next stream program as alternative tasks in consideration of the cost of switching between tasks, the cost of transferring data among resources, and so on.

Abstract: A method, system, and computer readable article of manufacture to enable parallel execution of a divided source code in a multiprocessor system. The method includes the steps of: inputting an original source code by an input device into the computing apparatus; finding a critical path in the original source code by a critical path cut module; cutting the critical path in the original source code into a plurality of process block groups by the critical path cut module; and dividing the plurality of process block groups among a plurality of processors in the multiprocessor system by a CPU assignment code generation module to produce the divided source code. The system includes an input device; a critical path cut module; and a CPU assignment code generation unit to produce the divided source code. The computer readable article of manufacture includes instructions to implement the method.

Abstract: Provides e-mail address forming methods to know with certainty whether or not an e-mail address was leaked. A method includes: sending a receiver's identifier and a sender's identifier to a receiver's mail server; computing a value which is encrypted by the mail server with a secret key, the secret key being only possessed by the mail server, from the receiver's identifier, the sender's identifier, and a nonce issued by the mail server, and sending the value to a receiver; and forming an e-mail address (LD address) to be used by a sender who sends a mail to a receiver, by attaching a receiver's domain name to the encrypted value. Furthermore, the present invention has an e-mail address sending method, and en e-mail sending system which uses the e-mail address forming method to know with certainty whether or not the user of an e-mail address leaked the e-mail address.

Abstract: Provides e-mail address forming methods to know with certainty whether or not an e-mail address was leaked. A method includes: sending a receiver's identifier and a sender's identifier to a receiver's mail server; computing a value which is encrypted by the mail server with a secret key, the secret key being only possessed by the mail server, from the receiver's identifier, the sender's identifier, and a nonce issued by the mail server, and sending the value to a receiver; and forming an e-mail address (LD address) to be used by a sender who sends a mail to a receiver, by attaching a receiver's domain name to the encrypted value. Furthermore, the present invention has an e-mail address sending method, and en e-mail sending system which uses the e-mail address forming method to know with certainty whether or not the user of an e-mail address leaked the e-mail address.

Abstract: Provides e-mail address forming methods to know with certainty whether or not an e-mail address was leaked. A method includes: sending a receiver's identifier and a sender's identifier to a receiver's mail server; computing a value which is encrypted by the mail server with a secret key, the secret key being only possessed by the mail server, from the receiver's identifier, the sender's identifier, and a nonce issued by the mail server, and sending the value to a receiver; and forming an e-mail address (LD address) to be used by a sender who sends a mail to a receiver, by attaching a receiver's domain name to the encrypted value. Furthermore, the present invention has an e-mail address sending method, and en e-mail sending system which uses the e-mail address forming method to know with certainty whether or not the user of an e-mail address leaked the e-mail address.