Abstract: A dual solution candidate searcher receives an input of information about a constraint coefficient matrix and a cost vector, determines a dual problem of a linear programming problem being a primal problem and all active sets representing combinations of active formulas in constraints of the dual problem, finds, for each of the active sets, a feasible dual solution candidate meeting constraints, and stores the dual solution candidate into a storage in a manner associated with a corresponding one of the active sets. An optimal solution calculation device receives an input of a constraint vector as, selects an optimal one of the active sets as an optimal active set based on an inner product of the constraint vector and the dual solution candidate stored in the storage, and finds and outputs a basic feasible solution corresponding to the selected active set as an optimal solution.

Abstract: There is provided an imaging apparatus including an image sensor and a processor, in which the processor acquires distance data related to distances between the imaging apparatus and a plurality of subjects within an imaging area imaged by the image sensor, generates boundary data indicating a region of a boundary subject that is present at a distance of a boundary portion of a depth of field among the plurality of subjects, based on the distance data, generates moving image data including the boundary data based on image data obtained by imaging with the image sensor, and outputs the moving image data.

Abstract: A satellite visibility assignment device (1) includes a visibility unit setter (21), a visibility unit selector (22), and an optimization calculator (23). The visibility unit setter (21) sets visibility units each including a combination of a satellite and a station to communicate with the satellite, a lower limit of a visibility start time, and an upper limit of a visibility end time. The optimization calculator (23) determines whether the visibility start time and the visibility end time are settable for each of the one or more combinations of the visibility units within a range satisfying a set constraint and calculates the visibility start time and the visibility end time through an optimization calculation. The visibility unit selector (22) selects, from the combinations of the visibility units, a combination of the visibility units to be used based on determination of the optimization calculator (23).

Abstract: A satellite visibility assignment device (1) includes a visibility unit setter (21), a visibility unit selector (22), and an optimization calculator (23). The visibility unit setter (21) sets visibility units each including a combination of a satellite and a station to communicate with the satellite, a lower limit of a visibility start time, and an upper limit of a visibility end time. The optimization calculator (23) determines whether the visibility start time and the visibility end time are settable for each of the one or more combinations of the visibility units within a range satisfying a set constraint and calculates the visibility start time and the visibility end time through an optimization calculation. The visibility unit selector (22) selects, from the combinations of the visibility units, a combination of the visibility units to be used based on determination of the optimization calculator (23).

Abstract: A dual solution candidate searcher receives an input of information about a constraint coefficient matrix and a cost vector, determines a dual problem of a linear programming problem being a primal problem and all active sets representing combinations of active formulas in constraints of the dual problem, finds, for each of the active sets, a feasible dual solution candidate meeting constraints, and stores the dual solution candidate into a storage in a manner associated with a corresponding one of the active sets. An optimal solution calculation device receives an input of a constraint vector as, selects an optimal one of the active sets as an optimal active set based on an inner product of the constraint vector and the dual solution candidate stored in the storage, and finds and outputs a basic feasible solution corresponding to the selected active set as an optimal solution.

Abstract: In a satellite side, there are provided a satellite-side operation parameter storage and an operation planning unit; and on a ground side, there are provided a ground-side operation parameter setting unit, a ground-side operation parameter storage to store operation parameters the same as stored in the operation parameter storage of the satellite-side, and an operation plan estimation unit having the same function as that of the operation planning unit of the satellite side. The ground-side operation parameter setting unit determines operation parameters to be used for the operation plan; and when necessary, the ground-side operation parameter setting unit saves them to the ground-side operation parameter storage and uploads them to the satellite-side operation parameter storage. The ground-side operation plan estimation unit and the satellite-side operation planning unit each produce operation plans according to the same operation parameters.

Abstract: In a satellite side, there are provided a satellite-side operation parameter storage and an operation planning unit; and on a ground side, there are provided a ground-side operation parameter setting unit, a ground-side operation parameter storage to store operation parameters the same as stored in the operation parameter storage of the satellite-side, and an operation plan estimation unit having the same function as that of the operation planning unit of the satellite side. The ground-side operation parameter setting unit determines operation parameters to be used for the operation plan; and when necessary, the ground-side operation parameter setting unit saves them to the ground-side operation parameter storage and uploads them to the satellite-side operation parameter storage. The ground-side operation plan estimation unit and the satellite-side operation planning unit each produce operation plans according to the same operation parameters.

Abstract: In this inventive method and system for renting a construction machine, a network server is allowed to hold information related to specification, a rental situation and a location of a construction machine for rent, and information related to specification of construction machine desiring reception of a rental service, information related to a rental period desiring reception of the rental service, and information related to the location desiring reception of the rental service are input when a person who desires to receive the rental service gets access to a network, whereby the network server searches with information related to the specification, the rental period and the location input by the person as search items, for information related to rentable construction machines to provide a searched result to the person.