Patents by Inventor Takeo Imai

Takeo Imai 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).

  • Publication number: 20240118575
    Abstract: An optical device includes an optical element including a liquid crystal cell configured to distribute light emitted from a light source, a power supply part configured to generate first and second potentials, a control signal generation circuit part configured to generate a control signal that controls a pulse width of each of the first and second potentials, and a switch circuit part configured to output a first potential signal including the first potential with a first pulse width and the second potential with a second pulse width based on the control signal. The liquid crystal cell includes a first substrate on which first and second transparent electrodes are alternately arranged in a first direction, and a second substrate on which third and fourth transparent electrodes are alternately arranged in a second direction. The first potential signal is input to the first transparent electrode.
    Type: Application
    Filed: December 20, 2023
    Publication date: April 11, 2024
    Inventors: Takayuki IMAI, Kojiro IKEDA, Takeo KOITO
  • Patent number: 9330298
    Abstract: The face impression analyzing device (100) includes a facial form acquiring unit (10), a face component analyzing unit (50), a face impression determining unit (60), and a storage unit (70). The facial form acquiring unit (10) acquires facial form information representing a form of a face surface of a subject. The storage unit (70) stores one or more feature values obtained by applying multivariate analysis to target population face information representing three-dimensional forms of facial surfaces of a target population formed by a plurality of persons, and tendency information indicating an impression tendency of a facial shape associated with each of the one or more feature values. The face component analyzing unit (50) calculates an amount of revelation of each of the one or more feature values of the face of the subject on the basis of the facial form information of the subject, and the feature value extracted from the target population face information.
    Type: Grant
    Filed: July 6, 2012
    Date of Patent: May 3, 2016
    Assignee: KAO CORPORATION
    Inventor: Takeo Imai
  • Patent number: 9298973
    Abstract: The face impression analyzing device (100) includes a facial form acquiring unit (10), a face component analyzing unit (50), a face impression determining unit (60), and a storage unit (70). The facial form acquiring unit (10) acquires facial form information representing a form of a face surface of a subject. The storage unit (70) stores one or more feature values obtained by applying multivariate analysis to target population face information representing three-dimensional forms of facial surfaces of a target population formed by a plurality of persons, and tendency information indicating an impression tendency of a facial shape associated with each of the one or more feature values. The face component analyzing unit (50) calculates an amount of revelation of each of the one or more feature values of the face of the subject on the basis of the facial form information of the subject, and the feature value extracted from the target population face information.
    Type: Grant
    Filed: July 6, 2012
    Date of Patent: March 29, 2016
    Assignee: KAO CORPORATION
    Inventor: Takeo Imai
  • Publication number: 20150169301
    Abstract: In a program specification estimation device, first circuitry generates a plurality of negative covering sets; second circuitry lists first unsatisfiable cores on a basis of all the predicates included in the plurality of negative covering sets; third circuitry obtains a program logical formula by converting the program to a form of a logical formula by symbolic execution; and fourth circuitry obtains a solution that makes the logical formula including a conjunction of (1) a disjunction of each of relaxing variable and the predicate corresponding to each of the relaxing variable, (2) the program logical formula and (3) an additional constraint be true, and converts a correction subset that is a set of the predicates for which the relaxing variables have become true to a second unsatisfiable core.
    Type: Application
    Filed: December 10, 2014
    Publication date: June 18, 2015
    Applicant: Kabushiki Kaisha Toshiba
    Inventor: Takeo IMAI
  • Publication number: 20140226896
    Abstract: The face impression analyzing device (100) includes a facial form acquiring unit (10), a face component analyzing unit (50), a face impression determining unit (60), and a storage unit (70). The facial form acquiring unit (10) acquires facial form information representing a form of a face surface of a subject. The storage unit (70) stores one or more feature values obtained by applying multivariate analysis to target population face information representing three-dimensional forms of facial surfaces of a target population formed by a plurality of persons, and tendency information indicating an impression tendency of a facial shape associated with each of the one or more feature values. The face component analyzing unit (50) calculates an amount of revelation of each of the one or more feature values of the face of the subject on the basis of the facial form information of the subject, and the feature value extracted from the target population face information.
    Type: Application
    Filed: July 6, 2012
    Publication date: August 14, 2014
    Applicant: KAO CORPORATION
    Inventor: Takeo Imai
  • Publication number: 20140128180
    Abstract: A golf tee includes a ball seat portion on which a golf ball is placed; and a rod-shaped support shaft portion formed downward from the ball seat portion. The support shaft portion has a projection that is laterally formed on and projected from the support shaft portion. The ball seat portion and the support shaft portion are formed plane-symmetrically on a single plane including a central axis line of the support shaft portion and a point of the projection. In the single plane, a virtual plane including contact portion that contacts with a golf ball when the golf ball is placed on the ball seat portion and a central axis line of the support shaft portion form an obtuse angle on one side of the axis line and form an acute angle on the other side of the axis line.
    Type: Application
    Filed: February 17, 2012
    Publication date: May 8, 2014
    Inventor: Takeo Imai
  • Patent number: 8707273
    Abstract: There is provided a precondition generating apparatus in which a storage stores a set “S” of logical expressions; a creating unit creates a first logical expression being a logical product of the “S”, logical expressions of a program and a negation of a logical expression indicating a postcondition; a solver finds a solution that makes the first logical expression true and specifies a set of clauses that cannot be simultaneously true in the first logical expression if not found; wherein the creating unit sets relaxing variables for the logical expressions belonging to the set “S” in the set of clauses wherein the logical expressions indicates a precondition of the program, generates a second logical expression by alleviating the clauses of logical expressions corresponding to the relaxing variables in the first logical expression, and applies same process as in the first logical expression to the second logical expression.
    Type: Grant
    Filed: April 23, 2012
    Date of Patent: April 22, 2014
    Assignee: Kabushiki Kaisha Toshiba
    Inventors: Takeo Imai, Masahiro Sakai
  • Patent number: 8584093
    Abstract: A device includes: a storage storing second logical expressions; an storage storing an essential condition which indicates a set of one or more second logical expressions selected such that a proposition is not satisfied that the post-condition is satisfied immediately after a program is executed when a logical product of other second logical expressions obtained by excluding the set indicated by the essential condition from the storage is satisfied; a generator generating a candidate condition represented by a logical product of one or more second logical expressions to include a common second logical expression with the set indicated by the essential condition; a judging unit judging whether satisfied is a proposition that the post-condition is satisfied immediately after the program is executed when the candidate condition is satisfied, and an output unit configured to output the candidate condition determined to satisfy the proposition as representing a pre-condition of the program.
    Type: Grant
    Filed: March 11, 2010
    Date of Patent: November 12, 2013
    Assignee: Kabushiki Kaisha Toshiba
    Inventors: Masahiro Sakai, Takeo Imai
  • Patent number: 8578308
    Abstract: A variable is allocated to a statement that designates an event associated with a function call in an assertion. Generation of the event at an arbitrary time on a continuous time series is detected, and a value corresponding to a meaning of the statement is assigned to the variable. Whether or not a condition corresponding to the meaning of the statement is satisfied is determined based on the value of the variable at each time on a discrete time series.
    Type: Grant
    Filed: June 27, 2008
    Date of Patent: November 5, 2013
    Assignee: Kabushiki Kaisha Toshiba
    Inventors: Yusuke Endoh, Takeo Imai, Hideji Kawata, Noritaka Kawakatsu
  • Publication number: 20120266133
    Abstract: There is provided a precondition generating apparatus in which a storage stores a set “S” of logical expressions; a creating unit creates a first logical expression being a logical product of the “S”, logical expressions of a program and a negation of a logical expression indicating a postcondition; a solver finds a solution that makes the first logical expression true and specifies a set of clauses that cannot be simultaneously true in the first logical expression if not found; wherein the creating unit sets relaxing variables for the logical expressions belonging to the set “S” in the set of clauses wherein the logical expressions indicates a precondition of the program, generates a second logical expression by alleviating the clauses of logical expressions corresponding to the relaxing variables in the first logical expression, and applies same process as in the first logical expression to the second logical expression.
    Type: Application
    Filed: April 23, 2012
    Publication date: October 18, 2012
    Applicant: KABUSHIKI KAISHA TOSHIBA
    Inventors: Takeo Imai, Masahiro Sakai
  • Patent number: 8037002
    Abstract: A design automaton extractor extracts a design automaton from design description data, and a property automaton extractor extracts a property automaton from property description data corresponding to the design description data. A matched state detector counts all states of the design automaton, detects matched states matching the property automaton from all the states of the design automaton, and counts the matched states. A coverage calculator obtains a ratio of the number of matched states to the number of all the states of the design automaton, thereby calculating a coverage representing the degree of correspondence of the property description data to the design description data.
    Type: Grant
    Filed: March 25, 2008
    Date of Patent: October 11, 2011
    Assignee: Kabushiki Kaisha Toshiba
    Inventors: Takeo Imai, Yusuke Endoh
  • Patent number: 7886274
    Abstract: Comparison indices each for two components incorporated in a source program are used for easy and quantitative evaluation of functional redundancy in the program, effective and accurate extraction of redundant code segments from the program and also effective and accurate extraction of components to be modified simultaneously. A tree T is entered and an initial level of functional redundancy m(P) is set at 0 in a program P expressed by the tree T. The top node of the tree T is selected as a node N. A specific computation is performed for the top node selected as the node N with attribute information including the similarity and the number of children of the node N to obtain a level ?. The level ? is added to the functional redundancy m(P). The specific computation is performed for every node in the tree T, to obtain functional redundancy m(P) including the total of ? for all nodes.
    Type: Grant
    Filed: May 7, 2007
    Date of Patent: February 8, 2011
    Assignee: Kabushiki Kaisha Toshiba
    Inventor: Takeo Imai
  • Publication number: 20100235818
    Abstract: A device includes: a storage storing second logical expressions; an storage storing an essential condition which indicates a set of one or more second logical expressions selected such that a proposition is not satisfied that the post-condition is satisfied immediately after a program is executed when a logical product of other second logical expressions obtained by excluding the set indicated by the essential condition from the storage is satisfied; a generator generating a candidate condition represented by a logical product of one or more second logical expressions to include a common second logical expression with the set indicated by the essential condition; a judging unit judging whether satisfied is a proposition that the post-condition is satisfied immediately after the program is executed when the candidate condition is satisfied, and an output unit configured to output the candidate condition determined to satisfy the proposition as representing a pre-condition of the program.
    Type: Application
    Filed: March 11, 2010
    Publication date: September 16, 2010
    Applicant: KABUSHIKI KAISHA TOSHIBA
    Inventors: Masahiro Sakai, Takeo Imai
  • Publication number: 20090019406
    Abstract: A variable is allocated to a statement that designates an event associated with a function call in an assertion. Generation of the event at an arbitrary time on a continuous time series is detected, and a value corresponding to a meaning of the statement is assigned to the variable. Whether or not a condition corresponding to the meaning of the statement is satisfied is determined based on the value of the variable at each time on a discrete time series.
    Type: Application
    Filed: June 27, 2008
    Publication date: January 15, 2009
    Inventors: Yusuke Endoh, Takeo Imai, Hideji Kawata, Noritaka Kawakatsu
  • Publication number: 20080243747
    Abstract: A design automaton extractor extracts a design automaton from design description data, and a property automaton extractor extracts a property automaton from property description data corresponding to the design description data. A matched state detector counts all states of the design automaton, detects matched states matching the property automaton from all the states of the design automaton, and counts the matched states. A coverage calculator obtains a ratio of the number of matched states to the number of all the states of the design automaton, thereby calculating a coverage representing the degree of correspondence of the property description data to the design description data.
    Type: Application
    Filed: March 25, 2008
    Publication date: October 2, 2008
    Applicant: KABUSHIKI KAISHA TOSHIBA
    Inventors: Takeo Imai, Yusuke Endoh
  • Publication number: 20080244492
    Abstract: There is provided with a designing apparatus, including: an input accepting unit configured to accept an input of design description which describes a design of a system that includes components and a plurality of channels each of which connects between components communicating with each other; component constraint description which describes constraints that should be met by respective components; channel constraint description which describes constraints that should be met by respective channels; a connection constraint description calculator configured to calculate connection constraint description which describes constraints that should be met between components connected by each channel: a specifying unit configured to specify communication medium or communication protocol to be used in the system; an overall constraint description calculator configured to calculate overall constraint description which describes constraints that should be met between all of the components.
    Type: Application
    Filed: March 14, 2008
    Publication date: October 2, 2008
    Applicant: KABUSHIKI KAISHA TOSHIBA
    Inventor: Takeo Imai
  • Publication number: 20070209033
    Abstract: Comparison indices each for two components incorporated in a source program are used for easy and quantitative evaluation of functional redundancy in the program, effective and accurate extraction of redundant code segments from the program and also effective and accurate extraction of components to be modified simultaneously. A tree T is entered and an initial level of functional redundancy m(P) is set at 0 in a program P expressed by the tree T. The top node of the tree T is selected as a node N. A specific computation is performed for the top node selected as the node N with attribute information including the similarity and the number of children of the node N to obtain a level ?. The level ? is added to the functional redundancy m(P). The specific computation is performed for every node in the tree T, to obtain functional redundancy m(P) including the total of ? for all nodes.
    Type: Application
    Filed: May 7, 2007
    Publication date: September 6, 2007
    Applicant: Kabushiki Kaisha Toshiba
    Inventor: Takeo IMAI
  • Patent number: 7228530
    Abstract: Comparison indices each for two components incorporated in a source program are used for easy and quantitative evaluation of functional redundancy in the program, effective and accurate extraction of redundant code segments from the program and also effective and accurate extraction of components to be modified simultaneously. A tree T is entered and an initial level of functional redundancy m(P) is set at 0 in a program P expressed by the tree T. The top node of the tree T is selected as a node N. A specific computation is performed for the top node selected as the node N with attribute information including the similarity and the number of children of the node N to obtain a level ?. The level ? is added to the functional redundancy m(P). The specific computation is performed for every node in the tree T, to obtain functional redundancy m(P) including the total of ? for all nodes.
    Type: Grant
    Filed: February 3, 2003
    Date of Patent: June 5, 2007
    Assignee: Kabushiki Kaisha Toshiba
    Inventor: Takeo Imai
  • Publication number: 20030149968
    Abstract: Comparison indices each for two components incorporated in a source program are used for easy and quantitative evaluation of functional redundancy in the program, effective and accurate extraction of redundant code segments from the program and also effective and accurate extraction of components to be modified simultaneously. A tree T is entered and an initial level of functional redundancy m(P) is set at 0 in a program P expressed by the tree T. The top node of the tree T is selected as a node N. A specific computation is performed for the top node selected as the node N with attribute information including the similarity and the number of children of the node N to obtain a level &agr;. The level &agr; is added to the functional redundancy m(P). The specific computation is performed for every node in the tree T, to obtain functional redundancy m(P) including the total of &agr; for all nodes.
    Type: Application
    Filed: February 3, 2003
    Publication date: August 7, 2003
    Applicant: Kabushiki Kaisha Toshiba
    Inventor: Takeo Imai
  • Patent number: 5849318
    Abstract: Disclosed herein is an oil-based solid cosmetic composition comprising the following components (A) and (B): (A) 0.1-10 wt. % of a fluoroalkyl (meth)acrylate copolymer represented by the following general formula (1): ##STR1## wherein R.sup.1 and R.sup.2 are independently a hydrogen atom or a methyl group, R.sup.3 is a hydrocarbon group having 1-32 carbon atoms, R.sub.f is a group obtained by substituting part or the whole of hydrogen atoms of a hydrocarbon group having 1-32 carbon atoms with the corresponding number of fluorine atoms, and n and m are independently a number of 2-2,000 on the average; and (B) 2.9-50 wt. % of a solid oily substance having a melting point of 60.degree.-120.degree. C. The cosmetic composition is good in shape retention and a feeling upon use, has excellent gloss upon its application and can retain the good gloss and color after the application over a long period of time.
    Type: Grant
    Filed: June 10, 1997
    Date of Patent: December 15, 1998
    Assignee: Kao Corporation
    Inventors: Takeo Imai, Yuko Yago, Masashi Shibata