Abstract: A non-transitory computer-readable storage medium storing a planning program that causes at least one computer to execute a process, the process includes generating a plurality of priority order patterns in which priority orders are assigned to a plurality of work groups, when processes selected from the plurality of work groups are sequentially performed on each of a plurality of objects; specifying an order of processes in the work group for each of the priority orders according to the priority orders of the plurality of priority order patterns; and specifying an order of the plurality of objects corresponding to the specified order of processes.

Abstract: A non-transitory computer-readable storage medium storing a planning program that causes at least one computer to execute a process, the process includes specifying a process order of a plurality of types of objects in a work line for processing the plurality of types of objects; specifying a ratio of a number of objects of one of the plurality of types to the total number of the plurality of types for each of the plurality of types; acquiring an appearance probability obtained by subtracting the number of objects of a type of which the process order is determined, from a product of a process number and the ratio; selecting the type to be processed next by using the appearance probability; and changing a frequency of the selecting according to a completion ratio of a number of types which the selecting is completed to the total number of the plurality of types.

Abstract: A non-transitory computer-readable storage medium storing a work planning program that causes at least one computer to execute a process, the process includes dividing a plurality of objects into a plurality of groups according to a type of a constraint condition set to each of the plurality of objects, the constraint condition being related to an order in which the plurality of objects are worked in a work line; and acquiring an order of the plurality of objects in the work line so that the constraint condition is satisfied in each of the plurality of groups.

Abstract: An optimization apparatus for repeatedly obtaining a constraint violating solution, a constraint satisfying solution, and an approximate solution in a resource-constrained project scheduling problem performs setting an end time of a target optimization period at a point between a first finish time equal to a finish time of a latest version of the constraint violating solution and a second finish time equal to a finish time of a latest version of the constraint satisfying solution, followed by obtaining the approximate solution using a metaheuristic algorithm, making a determination as to whether the approximate solution violates constraint or satisfy the constraint, and performing, based on the determination, updating the first finish time with a finish time of the approximate solution when the approximate solution violates the constraint, and updating the second finish time with a finish time of the approximate solution when the approximate solution satisfies the constraint.

Abstract: An apparatus includes a memory and one or more processors coupled to the memory and configured to perform performing an annealing-based solution search for each of a plurality of single-objective functions so as to obtain first solutions produced by the solution search, the plurality of single-objective functions being each generated by adding together a plurality of objective functions after weighting the objective functions with a corresponding one of a plurality of weighting patterns, and obtaining pareto solutions or approximate solutions thereof by performing a multi-point search from an initial state comprised of at least part of the first solutions, the multi-point search being performed such that solutions including at least non-dominated solutions of the objective functions are selected from a plurality of second solutions present in any given one of iterations of the multi-point search, and then the selected solutions are retained for a next one of the iterations.

Abstract: An optimization apparatus for an optimization problem that involves a plurality of variables each taking either a first value or a second value, the plurality of variables grouped into a plurality of groups, among which any given group is under a constraint that an exactly predetermined number of variables among variables belonging to the given group take the second value, the optimization apparatus performing optimization computation with respect to first variables among variables belonging to selected groups selected from the plurality of groups so as to obtain an approximate solution satisfying the constraint, and estimating and removing, based on the approximate solution, variables that are unlikely to take the second value in an optimal solution, thereby leaving second variables to remain in each selected group, wherein optimization computation is newly performed after updating the first variables with the second variables and third variables belonging to at least one unselected group.

Abstract: A method includes: executing judgment processing for judging whether a site to carry out a first task assigned to a first robot and a site to carry out a second task assigned to a second robot are likely to overlap each other; executing comparison processing for comparing first end time with second end time when the sites to carry out the first task and the second task are likely to overlap each other; and executing determination processing for selecting the first task order when the first end time is earlier than the second end time, and selecting the second task order when the second end time is earlier than the first end time.

Abstract: An optimization apparatus for repeatedly obtaining a constraint violating solution, a constraint satisfying solution, and an approximate solution in a resource-constrained project scheduling problem performs setting an end time of a target optimization period at a point between a first finish time equal to a finish time of a latest version of the constraint violating solution and a second finish time equal to a finish time of a latest version of the constraint satisfying solution, followed by obtaining the approximate solution using a metaheuristic algorithm, making a determination as to whether the approximate solution violates constraint or satisfy the constraint, and performing, based on the determination, updating the first finish time with a finish time of the approximate solution when the approximate solution violates the constraint, and updating the second finish time with a finish time of the approximate solution when the approximate solution satisfies the constraint.

Abstract: An information processing apparatus for allocating a plurality of items each having a first-attribute value and a second-attribute value to a plurality of places of allocation each having a maximum limit for the first attribute performs calculating an evaluation value for each of the plurality of items based on the first-attribute value and the second-attribute value, allocating as many unallocated items as possible in a descending order of evaluation values to a single place of allocation, selecting one or more items from the items allocated to the single place of allocation to create a replica, followed by adding replicas to the unallocated items, deleting replicas and the items for replica creation from the places of allocation, thereby fixing allocations with respect to items left without being deleted, and executing a metaheuristic algorithm to allocate items which are among the plurality of items and for which allocation has not been fixed.

Abstract: A method includes: executing judgment processing for judging whether a site to carry out a first task assigned to a first robot and a site to carry out a second task assigned to a second robot are likely to overlap each other; executing comparison processing for comparing first end time with second end time when the sites to carry out the first task and the second task are likely to overlap each other; and executing determination processing for selecting the first task order when the first end time is earlier than the second end time, and selecting the second task order when the second end time is earlier than the first end time.

Abstract: A process planning support apparatus comprising a processor that executes a process according to an embodiment includes: setting allocation of works with respect to each of work stations in an assembly line; first calculating work times corresponding to work subjects of the work stations based on library data of each of unit works, in which each unit work is expressed by a combination of element works each having motions as constituent elements, for the works allocated to the work stations, respectively; second calculating evaluation indexes of the work stations based on the calculated work times, respectively; and outputting the calculated evaluation indexes.

Abstract: A method for distributing frame data of an image to a plurality of clients via a network, the method including generating, using a processor, first frame data and second frame data as the frame data, transmitting, using the processor, the first frame data to all of the plurality of clients, and transmitting, using the processor, the second frame data to clients for whom a communication environment between the clients and the server satisfies a predetermined condition between the transmissions of the first frame data.

Abstract: A charge transfer distance of a charge conducting from a target component to a different component in the verified device is calculated. A region where the calculated charge transfer distance falls within a predetermined value is then obtained. The obtained region is output as an influence range of the electro-static discharge on the target component. According to this configuration, the time of an electro-static discharge verification is reduced.

Abstract: A clip detects that the physical link with an object, such as a document, is generated and/or the physical link with an object is eliminated. When the clip detects that the link with an object is generated, the clip transmits an identifier of the clip. Alternatively, when the clip detects that the link with an object is eliminated, the clip transmits an identifier of the clip.

Abstract: An information processing apparatus includes a storage unit and a processor. The storage unit is configured to store information on an obstacle within a three-dimensional space. The processor is configured to partition the three-dimensional space into an orthogonal grid. The processor is configured to perform a linear search of searching for a last portion of a route proceeding from a start point. The linear search is performed starting with a first grid point or a second grid point. The first grid point is the start point. The second grid point is one of direction change points where the route changes a proceeding direction. The last portion linearly proceeds in one direction until the obstacle is detected. The processor is configured to add a third grid point to the direction change points. The third grid point is passed through by the last portion immediately prior to the detection of the obstacle.

Abstract: A transfer device allocates, within the range of the maximum communication band of a network that a plurality of groups of applications use in common, a communication band equal to or larger than the minimum band for each of the groups. Furthermore, the transfer device converts, within a communication band allocated to each group, TCP data received from a transmission source of data to UDP data, transfers the UDP data to a transmission destination, and retransmits retransmission data in response to a retransmission request of the UDP data.

Abstract: A non-transitory computer-readable recording medium stores therein an image processing program that causes a computer to execute a process including determining based on image information of two images, whether to transmit to an information processing apparatus, image information of a preceding image among the two images that are consecutive in display order and to be displayed on a screen of the information processing apparatus connected via a network; and transmitting image information of the preceding image to the information processing apparatus when determining to transmit image information of the preceding image.

Abstract: According to an embodiment of the invention, a non-transitory, computer-readable recording medium stores therein an image processing program that causes a computer to execute a process including dividing an image to be displayed on a screen of an information processing apparatus connected through a network, into plural regions based on a pixel value of pixels included in the image; creating positional information that indicates positions of regions that have same shapes as respective regions of the regions and that are to be displayed at positions on the screen corresponding to positions of the respective regions in the image; and transmitting the created positional information to the information processing apparatus.

Abstract: A method includes calculating a size of a buffer included in a client device by multiplying a band by a round trip time, calculating an integer value by turning a real number into an integer, and setting the integer value as an unused size, the real number being obtained by dividing the size by a transmission data size, setting a value obtained by dividing the round trip time by the integer value or a value obtained by dividing the transmission data size by the band as a transmission interval, generating image data of a screen of a remote desktop and transmitting the image data to the client device when the unused size is greater than the first value, and subtracting a second value from the unused size, and every time a response to the image data is received, adding the second value to the unused size.

Abstract: A transfer device increments a value of a phase ID at predetermined time intervals, and registers a packet ID of a transmitted data packet and a phase ID on a determination table in an associated manner. When having received a response packet from a receiving-side transfer device, the transfer device determines an unarrived packet on the basis of received packet IDs contained in the received response packet and packet IDs of transmitted data packets. Then, the transfer device determines whether a data packet corresponding to the unarrived packet is lost or on-the-fly from a relationship between a phase ID of the unarrived packet and the maximum phase contained in the received response packet, and retransmits the corresponding data packet only if it is lost.