Patents by Inventor Ken Naono

Ken Naono has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7707509
    Abstract: Collectively predicting input operations for plural operation object items (subwindows) belonging to a same window. A proposal window PG stores in a statistics information database and manages information about the input entity and an operation object of an input operation accepted from a user, and a window to which the operation object belongs, along with transition information indicating the transition of active windows concerned in previous input operations. When an active window transitions because of an input operation accepted from the user, it searches the statistics information database for information that contains information about a new active window and is associated with transition information matching the transition of active windows concerned in previous input operations.
    Type: Grant
    Filed: July 14, 2006
    Date of Patent: April 27, 2010
    Assignee: Hitachi, Ltd.
    Inventors: Ken Naono, Hiroaki Fujii, Masashi Egi, Shunji Takubo
  • Patent number: 7698423
    Abstract: A computer system comprising a plurality of first computers each operated by an operator and a second computer coupled via a network to the plurality of first computers. Each of the plurality of first computers executes at least one software, obtains operation information by the operator with respect to the at least one software to be executed, receives an input of information from the operator, displays a confirm window for the operator to check whether the received input information is correct or not, calculates operation time period about the displayed confirm window based on the obtained operation information; and sends the calculated operation time period about the confirm window to the second computer. The second computer receives the operation time period about the confirm window, and calculates the number of operations of which the received operation time period about the confirm window is shorter than a first threshold value.
    Type: Grant
    Filed: January 4, 2008
    Date of Patent: April 13, 2010
    Assignees: Hitachi, Ltd., Hitachi Systems & Services, Ltd.
    Inventors: Ken Naono, Masashi Egi, Takao Sakurai
  • Patent number: 7634386
    Abstract: The present invention is directed to establishment of a higher level of an assurance value. The condition setting support apparatus executes a statistical information accepting step of accepting statistical information where execution results of a program are stored with respect to each combination between each of multiple first parameter values selected from possible values for the first parameter, and each of multiple second parameter values selected from possible values for the second parameter, and a detecting step of detecting based on the statistical information, a group including at least one of the first parameter values which maximizes the assurance value, out of the multiple first parameter values.
    Type: Grant
    Filed: July 5, 2005
    Date of Patent: December 15, 2009
    Assignee: Hitachi, Ltd.
    Inventors: Ken Naono, Mitsuyoshi Igai
  • Patent number: 7555509
    Abstract: In a 3-dimensional fast Fourier transformation implemented by using a parallel-processing computer, an overhead caused by transfers of data between processors employed in the computer is reduced for the purpose of increasing the efficiency of processing parallelism. In order to reduce the overhead, data is divided into data elements each having an even X coordinate and data elements each having an odd X coordinate. In processing 34, the date elements each having an even coordinate are subjected to the transformation in the Y direction while the date elements each having an odd X coordinate are being subjected to a process of permutation among the processors at the same time. In processing 35, on the other hand, the data elements each having an odd X coordinate are subjected to the transformation in the X direction while the data elements each having even coordinate are being subjected to the process of permutation among the processors at the same time.
    Type: Grant
    Filed: February 25, 2004
    Date of Patent: June 30, 2009
    Assignee: Hitachi, Ltd.
    Inventors: Yusaku Yamamoto, Ken Naono
  • Publication number: 20080177877
    Abstract: A computer system comprising a plurality of first computers each operated by an operator and a second computer coupled via a network to the plurality of first computers. Each of the plurality of first computers executes at least one software, obtains operation information by the operator with respect to the at least one software to be executed, receives an input of information from the operator, displays a confirm window for the operator to check whether the received input information is correct or not, calculates operation time period about the displayed confirm window based on the obtained operation information; and sends the calculated operation time period about the confirm window to the second computer. The second computer receives the operation time period about the confirm window, and calculates the number of operations of which the received operation time period about the confirm window is shorter than a first threshold value.
    Type: Application
    Filed: January 4, 2008
    Publication date: July 24, 2008
    Inventors: Ken Naono, Masashi Egi, Takao Sakurai
  • Publication number: 20070288443
    Abstract: An object of this invention is to analyze history information for each of a plurality of instances, and generate a time series pattern for each of a plurality of business processes. A time series pattern generating system analyzes the history information of an instance generated upon each execution of a class that defines a series of processes and is constituted by components having a defined order, and generates a time series pattern. The history information is generated upon each execution of the components, stored in chronological order, and includes a class identifier, a component identifier, an instance identifier, and component processing time information. Information relating to the processing order of the components that are executed in each instance is created, dependence relationships between the components are estimated, and a time series pattern including a component processing order is generated.
    Type: Application
    Filed: June 4, 2007
    Publication date: December 13, 2007
    Inventors: Takao Sakurai, Ken Naono, Masashi Egi
  • Publication number: 20070282920
    Abstract: Provided is a job management system includes: a terminal for executing a job, and for collecting operation information corresponding to respective operations executed by an operator; and a management server for managing the operation information collected by the terminal, the management server being connected to the terminal via a network, in which: the terminal transmits, to the management server, operation log data including the operation information capable of identifying the respective operations executed by the operator; and the management server stores, in advance, information indicating categories for the operation information and combinations thereof which are used for interpreting the operation information transmitted from the terminal as the corresponding operation executed by the operator with respect to the terminal, and selects categories for the operation information and a combination thereof which minimize a data size of the operation log data to be transmitted by the terminal.
    Type: Application
    Filed: May 23, 2007
    Publication date: December 6, 2007
    Inventors: Masashi Egi, Ken Naono, Takao Sakurai
  • Publication number: 20070265898
    Abstract: To readily understand contents of business operations without burdening an operator, this invention provides a business analysis method including: obtaining information on operations of a user with respect to software programs selected by the user among the plurality of software programs operated by a computer; estimating one business content that is executed by the computer in each of time spans based on a combination of exploited identification information of the plurality of software programs.
    Type: Application
    Filed: May 10, 2007
    Publication date: November 15, 2007
    Inventors: Ken Naono, Masashi Egi, Takao Sakurai
  • Publication number: 20070050725
    Abstract: Collectively predicting input operations for plural operation object items (subwindows) belonging to a same window. A proposal window PG stores in a statistics information database and manages information about the input entity and an operation object of an input operation accepted from a user, and a window to which the operation object belongs, along with transition information indicating the transition of active windows concerned in previous input operations. When an active window transitions because of an input operation accepted from the user, it searches the statistics information database for information that contains information about a new active window and is associated with transition information matching the transition of active windows concerned in previous input operations.
    Type: Application
    Filed: July 14, 2006
    Publication date: March 1, 2007
    Inventors: Ken Naono, Hiroaki Fujii, Masashi Egi, Shunji Takubo
  • Publication number: 20070021849
    Abstract: When a parameter for a numerical computation library is required, an optimum parameter reflecting a user policy is provided. A program calculates, based on a preset objective function, an optimum tuning parameter for executing a numerical computation library. The program reads the numerical computation library; reads the objective function; sets a user policy regarding speed performance and computational accuracy of the numerical computation library as plural policy parameters; reads, from preset execution histories of numerical computation libraries, execution histories of the numerical computation library; calculates, in a domain where the policy parameters are met and based on the execution histories having been read in, a tuning parameter for the numerical computation library by using the objective function; and outputs a calculation result of the objective function.
    Type: Application
    Filed: July 5, 2006
    Publication date: January 25, 2007
    Inventors: Ken Naono, Masashi Egi
  • Patent number: 7137010
    Abstract: Method of acquiring solution of an optimization problem, whereby information of problem and its solution is not delivered to solving system when requesting solving system to solve, and it is also made unnecessary to send ciphering key. Problem and ciphering key are input to client. Client generates nonsingular matrix P and permutation matrix Q by using ciphering key in conversion matrix generation routine, enciphers problem by using matrices P and Q in problem conversion routine, outputs enciphered problem from problem conversion routine to problem output interface, and sends enciphered problem from output interface to server via network. Server receives enciphered problem, finds solution in solving routine, outputs solution to solution output interface, and sends solution from solution output interface to client via network. Client receives solution in solution input interface, deciphers solution by using matrices P and Q in reverse conversion routine, and thereby obtains solution of original problem.
    Type: Grant
    Filed: August 1, 2001
    Date of Patent: November 14, 2006
    Assignee: Hitachi, Ltd.
    Inventors: Yusaku Yamamoto, Ken Naono, Satoshi Ito
  • Publication number: 20060020934
    Abstract: The present invention is directed to establishment of a higher level of assurance value. The condition setting support apparatus 2 executes a statistical information accepting step of accepting statistical information where execution results of a program are stored with respect to each combination between each of multiple first parameter values selected from possible values for the first parameter, and each of multiple second parameter values selected from possible values for the second parameter, and a detecting step of detecting based on the statistical information, a group including at least one of the first parameter values which maximizes the assurance value, out of the multiple first parameter values.
    Type: Application
    Filed: July 5, 2005
    Publication date: January 26, 2006
    Inventors: Ken Naono, Mitsuyoshi Igai
  • Publication number: 20050267663
    Abstract: To reduce the man-hour required in tuning control parameters, a vehicular control system of this invention comprises a user parameter input module, an external parameter input module, a plurality of objective functions, a policy setting module, and a policy node. The user parameter input module inputs a user parameter corresponding to an operation of a user. The external parameter input module inputs an external parameter resulting from an outside environment. The objective functions are set for each control characteristic respectively so as to calculate an internal parameter of each control target from the user parameter and the external parameter. The policy setting module sets policies indicating a control index of the user for the objective functions respectively.
    Type: Application
    Filed: March 7, 2005
    Publication date: December 1, 2005
    Inventors: Ken Naono, Masaaki Shimizu, Fumio Arakawa, Nobuyasu Kanekawa, Kohei Sakurai, Masatoshi Hoshino, Kentaro Yoshimura
  • Publication number: 20050254424
    Abstract: An IT system is operated reflecting a management policy accurately. In a method for determining allocation of IT resources of an IT system shared by divisional operations of an organization based on management resources allocation among divisions in the organization, the method comprises a first and a second steps of resource allocation. In the first step, management resource allocation for each of the divisional operations is determined so as to optimize a value of an operational objective based on the assumption that IT resource allocation is equal among the divisional operations and based on the management resource allocation among the divisions of the organization. In the second step, IT resource allocation for each of the divisional operations is determined so as to optimize the operational objective value based on the management resource allocation for each of the divisional operations determined in the first step.
    Type: Application
    Filed: January 13, 2005
    Publication date: November 17, 2005
    Inventors: Ken Naono, Shunji Takubo, Masashi Egi
  • Publication number: 20050125249
    Abstract: Provided is a method of measuring the effect of investment in an IT system by calculating the correlation between data on profit derived from an IT system. Various time-series data collected from a business system are classified into a profit indicator (104), a business process progress status indicator (105), and a system operation status indicator (106), and the correlation between those data is found. From the correlation, a contribution ratio indicative of the influence of the IT system operation status on the profit is calculated, and the effect of investment in the IT system is measured based on this contribution ratio.
    Type: Application
    Filed: November 10, 2004
    Publication date: June 9, 2005
    Inventors: Shunji Takubo, Ken Naono, Masashi Egi
  • Publication number: 20040236810
    Abstract: In a 3-dimensional fast Fourier transformation implemented by using a parallel-processing computer, an overhead caused by transfers of data between processors employed in the computer is reduced for the purpose of increasing the efficiency of processing parallelism. In order to reduce the overhead, data is divided into data elements each having an even X coordinate and data elements each having an odd X coordinate. In processing 34, the date elements each having an even coordinate are subjected to the transformation in the Y direction while the date elements each having an odd X coordinate are being subjected to a process of permutation among the processors at the same time. In processing 35, on the other hand, the data elements each having an odd X coordinate are subjected to the transformation in the X direction while the data elements each having even coordinate are being subjected to the process of permutation among the processors at the same time.
    Type: Application
    Filed: February 25, 2004
    Publication date: November 25, 2004
    Applicant: Hitachi, Ltd.
    Inventors: Yusaku Yamamoto, Ken Naono
  • Publication number: 20040167793
    Abstract: There is provided a method which can check whether or not internal data for operational risk evaluation of a business organization is collected from all computers in the business organization. In application execution servers, one or more agent for collecting loss events occurring in the computers is arranged. One or more network monitoring server connected to a network of the business organization is arranged. The network monitoring server monitors the network. When the application execution servers include a computer having no agent, the network monitoring server adds the presence of the computer having no agent to a monitoring log to make it possible to check whether the agents for collecting internal data is arranged in all computers for executing an application in the business organization. Therefore, an operational risk can be faithfully evaluated.
    Type: Application
    Filed: July 30, 2003
    Publication date: August 26, 2004
    Inventors: Yoshimasa Masuoka, Ken Naono, Shin Kameyama
  • Publication number: 20020157009
    Abstract: Method of acquiring solution of an optimization problem, whereby information of problem and its solution is not delivered to solving system when requesting solving system to solve, and it is also made unnecessary to send ciphering key. Problem and ciphering key are input to client. Client generates nonsingular matrix P and permutation matrix Q by using ciphering key in conversion matrix generation routine, enciphers problem by using matrices P and Q in problem conversion routine, outputs enciphered problem from problem conversion routine to problem output interface, and sends enciphered problem from output interface to server via network. Server receives enciphered problem, finds solution in solving routine, outputs solution to solution output interface, and sends solution from solution output interface to client via network. Client receives solution in solution input interface, deciphers solution by using matrices P and Q in reverse conversion routine, and thereby obtains solution of original problem.
    Type: Application
    Filed: August 1, 2001
    Publication date: October 24, 2002
    Applicant: Hitachi. Ltd.
    Inventors: Yusaku Yamamoto, Ken Naono, Satoshi Ito
  • Patent number: 5754438
    Abstract: By using the wavelet method and the inverse Mallat transform of the wavelet theory, frequency analysis of large scale time series data is carried out at high speed while effectively utilizing the hardware of a parallel computer of distributed memory type. To be concrete, on the parallel computer of distributed memory type, data to be analyzed, a scaling function, and a Daubechies's progression are inputted to individual memories. Highest order frequency component parallel numerical integral operation is conducted to derive a frequency component of the highest order to be analyzed. Series low frequency component analyzing using the inverse Mallat transform is conducted to effect frequency analysis other than the highest frequency by using the inverse Mallat transform of the wavelet theory. Frequency data combining is conducted to put together frequencies derived by respective processors in an external memory.
    Type: Grant
    Filed: September 30, 1996
    Date of Patent: May 19, 1998
    Assignee: Hitachi, Ltd.
    Inventors: Ken Naono, Nobutoshi Sagawa