公开(公告)号：US20220245204A1

公开(公告)日：2022-08-04

申请号：US17540283

申请日：2021-12-02

Applicant: FUJITSU LIMITED

Inventor： Daichi Shimada

IPC: G06F16/953

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.

公开(公告)号：US20230015306A1

公开(公告)日：2023-01-19

申请号：US17691166

申请日：2022-03-10

Applicant: FUJITSU LIMITED

Inventor： Toshiyuki SHIBUYA ,  Daichi Shimada ,  Kenji GOTSUBO ,  Takafumi ANRAKU

IPC: G06Q10/06

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.

公开(公告)号：US20160328493A1

公开(公告)日：2016-11-10

申请号：US15099954

申请日：2016-04-15

Applicant: FUJITSU LIMITED

Inventor： Daichi Shimada ,  Masayoshi Hashima

IPC: G06F17/50

CPC classification number: G06F17/509 ,  G06F2217/36

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 translation: 信息处理装置包括存储单元和处理器。 存储单元被配置为将信息存储在三维空间内的障碍物上。 处理器被配置为将三维空间划分成正交网格。 处理器被配置为执行搜索从起点开始的路线的最后部分的线性搜索。 从第一个网格点或第二个网格点开始执行线性搜索。 第一个网格点是起始点。 第二格点是方向改变点之一，其中路线改变前进方向。 最后部分在一个方向上线性进行直到检测到障碍物。 处理器被配置为向方向改变点添加第三格点。 在检测到障碍物之前，第三格点通过最后部分。

公开(公告)号：US20140071993A1

公开(公告)日：2014-03-13

申请号：US13935432

申请日：2013-07-03

Applicant: FUJITSU LIMITED

Inventor： Shinichi Sazawa ,  YUICHI SATO ,  HIROAKI KAMEYAMA ,  Daichi Shimada

IPC: H04L12/863

CPC classification number: H04L47/54 ,  H04L1/0083 ,  H04L1/1642 ,  H04L1/1838 ,  H04L1/1867

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.

Abstract translation: 传送设备以预定的时间间隔增加相位ID的值，并且以相关联的方式在发送的数据分组和相位ID上登记在确定表上。 当从接收侧传送装置接收到响应分组时，传送装置根据接收到的响应分组中包含的接收到的分组ID和所发送的数据分组的分组ID来确定不受欢迎的分组。 然后，传送装置根据包含在接收到的响应分组中的无符号分组的相位ID与最大相位之间的关系，确定与该未分组分组对应的数据分组是否丢失或者即时地发送，并且重新发送对应的数据 数据包只有在丢失时才会出现。

公开(公告)号：US20220188480A1

公开(公告)日：2022-06-16

申请号：US17516746

申请日：2021-11-02

Applicant: FUJITSU LIMITED

Inventor： Daichi Shimada

IPC: G06F30/20 ,  G06F17/17

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.

公开(公告)号：US20210383298A1

公开(公告)日：2021-12-09

申请号：US17206184

申请日：2021-03-19

Applicant: FUJITSU LIMITED

Inventor： Daichi Shimada

IPC: G06Q10/06 ,  G06Q10/04

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.

公开(公告)号：US20210271729A1

公开(公告)日：2021-09-02

申请号：US17159220

申请日：2021-01-27

Applicant: FUJITSU LIMITED

Inventor： Daichi Shimada

IPC: G06F17/11

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.

公开(公告)号：US20160127213A1

公开(公告)日：2016-05-05

申请号：US14993023

申请日：2016-01-11

Applicant: FUJITSU LIMITED

Inventor： Daichi Shimada ,  Shinichi Sazawa ,  Masayoshi Hashima ,  YUICHI SATO

IPC: H04L12/26 ,  H04L29/08 ,  H04L12/861 ,  H04L29/06

CPC classification number: H04L43/08 ,  H04L12/6418 ,  H04L49/90 ,  H04L67/12 ,  H04L67/42

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 translation: 一种方法包括通过将频带乘以往返时间来计算包括在客户端设备中的缓冲器的大小，通过将实数转换为整数来计算整数值，并将整数值设置为未使用的大小，实数 通过将大小除以传输数据大小获得，将通过将往返时间除以整数值获得的值或通过将传输数据大小除以频带而获得的值作为传输间隔而获得，生成屏幕的图像数据 的远程桌面，并且当所述未使用的大小大于所述第一值时，将所述图像数据发送到所述客户端设备，以及从所述未使用的大小中减去第二值，并且每当接收到对所述图像数据的响应时，将所述第二值 到未使用的大小。

公开(公告)号：US12008499B2

公开(公告)日：2024-06-11

申请号：US17691166

申请日：2022-03-10

Applicant: FUJITSU LIMITED

Inventor： Toshiyuki Shibuya ,  Daichi Shimada ,  Kenji Gotsubo ,  Takafumi Anraku

IPC: G06Q10/0631 ,  G06Q10/0633

CPC classification number: G06Q10/06316 ,  G06Q10/0633

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.

公开(公告)号：US11544646B2

公开(公告)日：2023-01-03

申请号：US17206184

申请日：2021-03-19

Applicant: FUJITSU LIMITED

Inventor： Daichi Shimada

IPC: G06Q10/06 ,  G06Q10/04

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.