公开(公告)号：JPH0962846A

公开(公告)日：1997-03-07

申请号：JP1724996

申请日：1996-02-02

Applicant: IBM

Inventor： TOKUYAMA TAKESHI

IPC: G06F17/30 ,  G06T5/00 ,  G06T7/00

Abstract: PROBLEM TO BE SOLVED: To control the size of an image and to cut a partial clear image in prescribed size at high speed by newly introducing an objective function and increasing/reducing a parameter. SOLUTION: (k) indicating the size of the image to be detected is inputted to a comparison part 5. A detection processing part 3 takes out one image which is to be processed from an image storage part 1. The detection processing part 3 deals with the objective function shown in an expression. In the expression, the number of the picture elements of the whole image to be processed is set to be (n), the gray level of the pixel (i, j) of (i)-rows (j)-columns in the image to be g(i, j), and the area of the partial image which is to be cut to be S. Then, α is a real number parameter and |S| represents the number (the size of S) of the pixels in the partial image S. The comparison part 5 compares the desired size K of the image which is previously inputted with |S|. When K |S|.

公开(公告)号：JPH11187013A

公开(公告)日：1999-07-09

申请号：JP35440197

申请日：1997-12-24

Applicant: IBM JAPAN

Inventor： MARUYAMA HIROSHI ,  TOKUYAMA TAKESHI ,  URAMOTO NAOHIKO

IPC: H04L9/08 ,  G09C1/00 ,  H04L9/20

Abstract: PROBLEM TO BE SOLVED: To provide a method and a system for minimizing procedures required for updating a cryptographic key by structuring the cryptographic key into tree structure. SOLUTION: First of all, plural keys more than the number of recipients are generated 710, and the plural keys are hierarchically arranged 720 in the form of tree structure. Next, the plural recipients are made correspondent to the keys hierarchically arranged in the form of tree structure, and the cryptographic keys of the respective recipients are generated as a key stream having keys from the root of tree structure to positions corresponding to the said recipients in the tree structure. Thus, after the cryptographic key is generated 730, the generated cryptographic key is distributed 740 to the correspondent recipient.

公开(公告)号：JPH10240747A

公开(公告)日：1998-09-11

申请号：JP3460597

申请日：1997-02-19

Applicant: IBM

Inventor： YODA KUNIKAZU ,  FUKUDA TSUYOSHI ,  TOKUYAMA TAKESHI ,  MORISHITA SHINICHI

IPC: G06F17/18 ,  G06F9/44 ,  G06F17/30 ,  G06F19/00 ,  G06N5/04 ,  G06Q40/00 ,  G06Q40/02

Abstract: PROBLEM TO BE SOLVED: To make it easy to find a connection rule between data by composing a plane of two numeric attributes that an analyzed body has and cutting an orthogonal projection area between true and false attributes under specific conditions. SOLUTION: A database having data including two kinds of numeric attribute and one kind of true/false attribute has two axes corresponding to two kinds of numeric attribute and stores the number v(i, j) of data belonging to respective pixels (i row, j column) of a plane divided into N×N pixels and the number v(i, j) of data whose true/false attributes are true. Then a specific condition θis inputted to cut an orthogonal projection area S of pixels, maximizing an equation I, out of a plane. Thus, the area in the orthogonal projection shape is cut out to make it easy for people to grasp the connection rule. Lastly, data included in the cut orthogonal projection area S are outputted.

公开(公告)号：JPH09179883A

公开(公告)日：1997-07-11

申请号：JP4466096

申请日：1996-03-01

Applicant: IBM

Inventor： FUKUDA TSUYOSHI ,  MORIMOTO YASUHIKO ,  MORISHITA SHINICHI ,  TOKUYAMA TAKESHI

IPC: G06F12/00 ,  G06F9/44 ,  G06F17/30 ,  G06N5/04

Abstract: PROBLEM TO BE SOLVED: To make it possible to find the correlation between data which have a two-term numeral attribute and a true/false attribute. SOLUTION: A plane is constituted with two numeral attributes first and divided into meshes, and data in the meshes (packet) and data which have true attributes are counted. This plane can be grasped as the plane image that the number of data corresponds to the gray level and the number of data having true attributes corresponds to the saturation. Then a permissible image which is an area that is convex to one axis of the plane is cut under specific conditions and a part where the correlation of data is strong is found. Then when the area as the cut permissible area meets conditions of a support maximization rule, etc., the area is shown to a user. Further, necessary attributes of data included in the area are extracted from a data base at need.

公开(公告)号：JP2000076332A

公开(公告)日：2000-03-14

申请号：JP24155998

申请日：1998-08-27

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレイション

Inventor： KAWAZOE HIROSHI ,  TOKUYAMA TAKESHI ,  SHIBUYA TETSUO ,  MARUYAMA HIROSHI

IPC: G06F15/16 ,  G06F13/00 ,  G06F19/00 ,  G06Q20/00 ,  G06Q20/06 ,  G06Q30/04 ,  G06Q30/06 ,  G06Q50/00 ,  G06F17/60

Abstract: PROBLEM TO BE SOLVED: To reduce the communication number of a resource managing system by distributed servers by requesting the transmission of resources to at least, one servers among plural servers to gather the resources to transmit in the case that resources more than a requested one do not exist in a home server. SOLUTION: The system optimizes the number of transmission between the plural servers. Namely, it is first judged whether all the servers to which money has been transferred before are inspected or not (S420). In the case of judging that all of them are not inspected, increment is executed and a transmitting request is sent to a server of an i-numbered largest remainder in a remainder written estimate (S430, S440). Then, an answer from a server is waited (S450). When the answer comes from the server, the remainder of the i-numbered server of the remainder written estimate is updated to be a sent transmission amount (S460). The reason is that as the server sends a half of the possessed money of the server to a home server, the same amount is left on a sending side. Then, whether the money amount was sufficient is judged (S470) and when it is sufficient, the processing is finished.

Abstract translation: 要解决的问题：为了减少分布式服务器的资源管理系统的通信号码，通过向多个服务器中的至少一个服务器请求资源传送，以便在超过所请求的资源的资源的情况下收集资源进行传输 不存在于家庭服务器中。 解决方案：系统优化多台服务器之间的传输次数。 即，首先判断是否检查了所有已转移货币的服务器（S420）。 在判断为全部未被检查的情况下，执行递增，并且将发送请求发送到剩余写入估计中的第i个最大余数的服务器（S430，S440）。 然后，等待服务器的答案（S450）。 当答案来自服务器时，其余写入估计的i编号服务器的其余部分被更新为发送传输量（S460）。 原因是当服务器将服务器的一半占有的服务器发送到家庭服务器时，发送方将保留相同的金额。 然后，判断金额是否足够（S470），如果满足，则处理结束。

公开(公告)号：JPH09134365A

公开(公告)日：1997-05-20

申请号：JP28483695

申请日：1995-11-01

Applicant: IBM

Inventor： MORIMOTO YASUHIKO ,  FUKUDA TSUYOSHI ,  MORISHITA SHINICHI ,  TOKUYAMA TAKESHI

IPC: G06F12/00 ,  G06F17/17 ,  G06F17/30

Abstract: PROBLEM TO BE SOLVED: To detect at high speed the correlation between the data having both numerical and specific (0-1) attributes by dividing a numerical attribute axis into plural sections, counting the number of data included in every divided section and also the number of data on the (0-1) attribute and then performing a specific processing. SOLUTION: A bucket processing part 1510 divides a numerical attribute axis corresponding to the numerical attribute into plural sections and counts the number of data and the number of data having the (0-1) attributes equal to 1 included in every divided section. A plane constitution processing part 1520 virtually constitutes a plane by means of a 1st axis corresponding to the total number of data on every section and a 2nd axis corresponding to the total number of data having the (0-1) attribute equaling to 1 on every section. Then the part 1520 virtually plots the points corresponding to the values to the sections on the plane. Furthermore, a largest tilt line extraction part 1530 extracts a pair of points having their connection line of the largest tilt among those pairs of points having intervals larger than T.N (T: rate, N: total data number) set toward the 1st axis and then outputs the corresponding section between the extracted pair of points.

公开(公告)号：JPH09134363A

公开(公告)日：1997-05-20

申请号：JP28541695

申请日：1995-11-01

Applicant: IBM

Inventor： MORIMOTO YASUHIKO ,  FUKUDA TSUYOSHI ,  MORISHITA SHINICHI ,  TOKUYAMA TAKESHI

IPC: G06F17/30

Abstract: PROBLEM TO BE SOLVED: To derive connection rules that are set between numerical value attribute and (0-1) attribute. SOLUTION: A numerical attribute is divided into plural sections (buckets), and each of data is put into a bucket according to the value of the numerical attribute. Then the number of data contained in every bucket and the number of data having the (0-1) attribute equals to 1 are counted. Then, (s) satisfying the condition of the formula is detected, and the starting section to be detected is actually detected. In this expression, ui is the number of data included in a certain section and vi is the number of data whose (0-1) attributes in the section are equal to 1 respectively. Then the ending section corresponding to the starting one is detected, so that the largest section having the certainty higher than a prescribed level α is detected. A pair of sections including the largest number of customers is defined as an answer among those detected pairs of starting and ending sections. Then the necessary data attributes are taken out of the data which are included in the answer section.