-
公开(公告)号：US11386337B2
公开(公告)日：2022-07-12
申请号：US16417924
申请日：2019-05-21
Applicant: International Business Machines Corporation
Inventor： Aaron Keith Baughman , Bridget Briana Beamon , Dong Chen , Peter Kenneth Malkin
IPC: G06N5/02
Abstract: A method, system, and non-transitory compute readable medium for hidden evidence correlation and causation linking including a forecasting device configured to forecast hidden evidence found in relation to a user input in hidden cycle measurements into future forecasted cycle measurements, where the forecasted hidden cycles are transformed into an amplitude versus frequency histogram with each histogram being compared to each other histogram and determined if causation is a candidate, and if causation is a candidate, a probability density function is applied to produce a degree of causation of a causation link for the hidden evidence in relation to the user input.
-
公开(公告)号：US20220092211A1
公开(公告)日：2022-03-24
申请号：US17026360
申请日：2020-09-21
Applicant: International Business Machines Corporation
Inventor： Jun Su , Jin Zhang , Dong Chen , XI MEI KONG
Abstract: Embodiments of the present invention provide a computer system a computer program product, and a method that comprises identifying privacy data within received data by identifying markers that are indicative of privacy data within the received data; generating a respective classification of an object within the identified privacy data; assigning values to the generated respective classification of the object based on a perceived threat level associated with the identified privacy data; and in response to determining that the assigned value of the received data triggers an alert associated with a predetermined threshold for privacy, automatically preventing distribution of the received data from a computing device to another computing device.
-
公开(公告)号：US11165686B2
公开(公告)日：2021-11-02
申请号：US16057015
申请日：2018-08-07
Applicant: International Business Machines Corporation
Inventor： Philip Heidelberger , Dong Chen , Yutaka Sugawara , Paul W. Coteus
IPC: H04L12/707 , H04L12/727 , H04L12/721 , H04L12/933
Abstract: A switch-connected dragonfly network and method of operating. A plurality of groups of row switches is organized according to multiple rows and columns, each row including multiple groups of row switches connected to form a two-level dragonfly network. A plurality of column switches interconnect groups of row switches along respective columns, a column switch associated with a corresponding group of row switches in a row. A switch port with a same logical port on a row switch at a same location in each group along the respective column connects to a same column switch. The switch-connected dragonfly network is expandable by adding additional rows, an added row comprising a two-level dragonfly network. A switch group of said added row associated with a column being connects to an available port at an existing column switch of said column by corresponding added S path link with no re-cabling of the switched network required.
-
公开(公告)号：US11044169B2
公开(公告)日：2021-06-22
申请号：US16241128
申请日：2019-01-07
Applicant: International Business Machines Corporation
Inventor： Dong Chen , Sameer Kumar
Abstract: In a L×M×N 3D torus network of computer nodes, a 2-dimensional plane comprising M×N torus network of nodes mapped into M/2 meshes×2*N torus network of nodes. N can be k*M, k is an integer greater than zero, and M and N are even numbers. Each of M/2 mesh of the 2*N torus is contiguous in the 2D plane. Mapping is performed for each of the L planes of the L×M×N 3D torus network. The M/2 meshes are combined with a remaining torus network dimension comprising L planes, the combining creating another 2*N pattern, wherein an L*M/2×2*N communication pattern is created. Application entities are executed according to the mapped L*M/2×2*N communication pattern.
-
公开(公告)号：US10834672B2
公开(公告)日：2020-11-10
申请号：US14862178
申请日：2015-09-23
Applicant: International Business Machines Corporation
Inventor： Dong Chen , Paul W. Coteus , Noel A. Eisley , Philip Heidelberger , Robert M. Senger , Burkhard Steinmacher-Burow , Yutaka Sugawara
Abstract: A first method includes determining a total length of pending packets for a network link, determining a currently preferred power mode for the network link based on the total length of pending packets for the network link, and changing a current power mode for the network link to the currently preferred power mode. A corresponding apparatus is also disclosed herein. A second method includes determining a utilization for a network link, determining a currently preferred power mode for the network link based on the utilization for the network link, and changing a current power mode for the network link to the currently preferred power mode. A corresponding apparatus is also disclosed herein.
-
Patent Agency Ranking
公开(公告)号：US20200053002A1
公开(公告)日：2020-02-13
申请号：US16057015
申请日：2018-08-07
Applicant: International Business Machines Corporation
Inventor： Philip Heidelberger , Dong Chen , Yutaka Sugawara , Paul W. Coteus
IPC: H04L12/707 , H04L12/933 , H04L12/721 , H04L12/727
Abstract: A switch-connected dragonfly network and method of operating. A plurality of groups of row switches is organized according to multiple rows and columns, each row including multiple groups of row switches connected to form a two-level dragonfly network. A plurality of column switches interconnect groups of row switches along respective columns, a column switch associated with a corresponding group of row switches in a row. A switch port with a same logical port on a row switch at a same location in each group along the respective column connects to a same column switch. The switch-connected dragonfly network is expandable by adding additional rows, an added row comprising a two-level dragonfly network. A switch group of said added row associated with a column being connects to an available port at an existing column switch of said column by corresponding added S path link with no re-cabling of the switched network required.
-
公开(公告)号：US20190356698A1
公开(公告)日：2019-11-21
申请号：US16514607
申请日：2019-07-17
Applicant: International Business Machines Corporation
Inventor： Dong Chen , Wu Mi Zhong , Ting Yin , Zhi Li Guan , Yang Liang , Shao Jun Ding
Abstract: A method, computer program product, and system includes a processor(s) obtaining an authorization failure from a target application because an access request was denied based on insufficient permissions of a user. The processor(s) institutes a mock interface with a visual appearance of the target application. The mock interface displays predefined data and the target application displays dynamic data, from the server(s) executing the target application. The processor(s) obtains, via the mock interface, a request to change the permissions of the user to the target application, which includes a selection, by the user, through the mock interface, of one or more individual permissions displayed in the mock interface. The processor(s) automatically generates a customized security policy comprising the selection, where based on applying the customized security policy, repeating the access request results in authorized access to the target application.
-
公开(公告)号：US10348609B2
公开(公告)日：2019-07-09
申请号：US15956235
申请日：2018-04-18
Applicant: International Business Machines Corporation
Inventor： Dong Chen , Noel A. Eisley , Philip Heidelberger
IPC: G06F15/173 , H04L12/701 , H04L12/721
Abstract: A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.
-
公开(公告)号：US20180241661A1
公开(公告)日：2018-08-23
申请号：US15956235
申请日：2018-04-18
Applicant: International Business Machines Corporation
Inventor： Dong Chen , Noel A. Eisley , Philip Heidelberger
IPC: H04L12/701 , G06F15/173 , H04L12/721
CPC classification number: H04L45/00 , G06F15/17387 , H04L45/06
Abstract: A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.
-
公开(公告)号：US20180188914A1
公开(公告)日：2018-07-05
申请号：US15396948
申请日：2017-01-03
Applicant: International Business Machines Corporation
Inventor： Dong Chen , Shao Jun Ding , Zhi Li Guan , Yang Liang , Ting Yin , Wu Mi Zhong
IPC: G06F3/0484 , G06F17/24 , G06F17/22
Abstract: Embodiments of the present disclosure relate to text resources in an application. According to a method, an updated application is run, wherein information displayed on at least one text resource in the updated application is editable and the information displayed on at least one text resource in an original application of the updated application is not editable. Then, in response to a first piece of information displayed on a text resource of the at least one text resource being changed to a second piece of information, ID of the text resource of the at least one text resource in the updated application is obtained; and the second piece of information is mapped to the ID of the text resource in a file corresponding to the at least one text resource in the updated application.
-
-
-
-
-
-
-
-
-
Search Results
109
records
(took 0.024 seconds)
