-
公开(公告)号:US10318552B2
公开(公告)日:2019-06-11
申请号:US14278433
申请日:2014-05-15
摘要: A computer processor generates a topic-based dataset based on parsing content received from a plurality of information sources, which includes historical data and scientific data, associated with a location of a natural resource. The processor generates a plurality of clusters, respectively corresponding to like-topic data of the topic-based dataset. The processor determines a plurality of hypotheses, respectively corresponding to the plurality of clusters of the like-topic data, wherein the plurality of hypotheses are based on features associated with each of the plurality of clusters of the like-topic data. The processor combines pairs of clusters, based on a similarity heuristic applied to the one or more pairs of clusters, and the processor determines a plurality of probabilities respectively corresponding to a validity of each hypothesis of the plurality of hypotheses, associated with the location of a natural resource.
-
公开(公告)号:US20180191851A1
公开(公告)日:2018-07-05
申请号:US15399725
申请日:2017-01-05
摘要: Social media inputs specific to a content of a broadcast program and received from a plurality of users are analyzed to determine a sentiment value expressed relative to a portion of the content. A group is formed of those users whose sentiment values expressed relative to the portion of the content are within a specified tolerance value of sentiment value and are expressed within a defined period during the broadcast of the program. A historical data from the inputs unrelated to the content is analyzed to extract an entity. A time zone of a geographical location of the entity is associated with the group. a sentiment of the group expressed relative to the portion of the content is shifted by an amount of time on a program continuum timeline, such that the sentiment of the group aligns with a time when the portion was broadcast in the time zone.
-
公开(公告)号:US09860134B2
公开(公告)日:2018-01-02
申请号:US14834723
申请日:2015-08-25
发明人: Richard J. Bogdany , Thomas B. Harrison , Cameron Niall-Kerr McAvoy , Brian M. O'Connell , Herbert D. Pearthree , Shengzhi Sun , Clay T. Upton
CPC分类号: H04L41/145 , G06T11/206 , H04L41/142 , H04L41/147
摘要: An approach is provided for allowing a network computing (e.g., cloud computing) infrastructure to modify its resource allocation plan (e.g., an instance count) by using a Kth derivative vector plot, which may be generated using historical logs. Among other things, this approach enables an infrastructure to project an allocation forecast for a specified duration and adapt to changes in network traffic.
-
公开(公告)号:US10602208B2
公开(公告)日:2020-03-24
申请号:US16183338
申请日:2018-11-07
IPC分类号: H04N21/21 , H04N21/442 , H04N21/45 , H04N21/4788 , H04N21/234 , G06Q30/02 , H04N21/25
摘要: Social media inputs from users, and specific to a content of a broadcast program, are analyzed to determine a sentiment value expressed relative to a portion of the content by a user. A group is formed of those users whose sentiment values expressed relative to the portion within a defined period during the broadcast of the program are within a specified tolerance value of sentiment value expressed by the user. A time zone of a location extracted from a social media input of the user is assigned to the group. A fabricated event that evokes a predicted sentiment is inserted in the broadcast program. A confidence value for the time zone is computed by comparing a sentiment value of a response by the group to the fabricated event with the predicted sentiment value. The group's placement in the time zone is confirmed when the confidence value exceeds a threshold.
-
公开(公告)号:US20190075345A1
公开(公告)日:2019-03-07
申请号:US16183338
申请日:2018-11-07
IPC分类号: H04N21/25 , H04N21/234 , H04N21/4788 , H04N21/442 , H04N21/45
CPC分类号: H04N21/252 , G06Q30/02 , G06Q30/0201 , G06Q30/0244 , G06Q30/0251 , H04N21/23424 , H04N21/44213 , H04N21/4524 , H04N21/4788
摘要: Social media inputs from users, and specific to a content of a broadcast program, are analyzed to determine a sentiment value expressed relative to a portion of the content by a user. A group is formed of those users whose sentiment values expressed relative to the portion within a defined period during the broadcast of the program are within a specified tolerance value of sentiment value expressed by the user. A time zone of a location extracted from a social media input of the user is assigned to the group. A fabricated event that evokes a predicted sentiment is inserted in the broadcast program. A confidence value for the time zone is computed by comparing a sentiment value of a response by the group to the fabricated event with the predicted sentiment value. The group's placement in the time zone is confirmed when the confidence value exceeds a threshold.
-
公开(公告)号:US20180288455A1
公开(公告)日:2018-10-04
申请号:US15471894
申请日:2017-03-28
IPC分类号: H04N21/25 , H04N21/442 , H04N21/45 , H04N21/4788 , H04N21/234
CPC分类号: H04N21/252 , H04N21/23424 , H04N21/44213 , H04N21/4524 , H04N21/4788
摘要: Social media inputs from users, and specific to a content of a broadcast program, are analyzed to determine a sentiment value expressed relative to a portion of the content by a user. A group is formed of those users whose sentiment values expressed relative to the portion within a defined period during the broadcast of the program are within a specified tolerance value of sentiment value expressed by the user. A time zone of a location extracted from a social media input of the user is assigned to the group. A fabricated event that evokes a predicted sentiment is inserted in the broadcast program. A confidence value for the time zone is computed by comparing a sentiment value of a response by the group to the fabricated event with the predicted sentiment value. The group's placement in the time zone is confirmed when the confidence value exceeds a threshold.
-
公开(公告)号:US10073756B2
公开(公告)日:2018-09-11
申请号:US15806976
申请日:2017-11-08
发明人: Aaron K. Baughman , Thomas B. Harrison , Cody A. Clements , Michael P. Lazos , Robert J. Lewis , Brian M. O'Connell , Mary C. Zabriskie
CPC分类号: G06F11/3457 , G06F9/5072 , G06F11/26 , G06F11/3696 , H04L41/083 , H04L43/50
摘要: A method and associated systems for optimizing a computing platform. A processor joins sets of configurable parameters into groups that each identifies a configuration of the computing environment or of a component or subsystem of the computing environment. The processor generates a set of variations of each group, where each variation identifies a candidate configuration of the component, subsystem, or platform, and where each candidate configuration identifies a distinct set of values of the group of parameters associated with that component, subsystem, or platform. Each configuration of this first generation of configurations undergoes a massively parallel iterative procedure that generates a next generation of configurations by performing operations upon the first generation that are similar to those of a natural-selection process. The procedure repeats until successive generations converge, within resource constraints, to a fittest generation that represents an optimal or most nearly optimal configuration of the computing platform.
-
公开(公告)号:US20180074932A1
公开(公告)日:2018-03-15
申请号:US15806976
申请日:2017-11-08
发明人: Aaron K. Baughman , Thomas B. Harrison , Cody A. Clements , Michael P. Lazos , Robert J. Lewis , Brian M. O'Connell , Mary C. Zabriskie
CPC分类号: G06F11/3457 , G06F9/5072 , H04L41/083 , H04L43/50
摘要: A method and associated systems for optimizing a computing platform. A processor joins sets of configurable parameters into groups that each identifies a configuration of the computing environment or of a component or subsystem of the computing environment. The processor generates a set of variations of each group, where each variation identifies a candidate configuration of the component, subsystem, or platform, and where each candidate configuration identifies a distinct set of values of the group of parameters associated with that component, subsystem, or platform. Each configuration of this first generation of configurations undergoes a massively parallel iterative procedure that generates a next generation of configurations by performing operations upon the first generation that are similar to those of a natural-selection process. The procedure repeats until successive generations converge, within resource constraints, to a fittest generation that represents an optimal or most nearly optimal configuration of the computing platform.
-
公开(公告)号:US10158897B2
公开(公告)日:2018-12-18
申请号:US15471894
申请日:2017-03-28
IPC分类号: H04N21/442 , H04N21/25 , H04N21/45 , H04N21/4788 , H04N21/234
摘要: Social media inputs from users, and specific to a content of a broadcast program, are analyzed to determine a sentiment value expressed relative to a portion of the content by a user. A group is formed of those users whose sentiment values expressed relative to the portion within a defined period during the broadcast of the program are within a specified tolerance value of sentiment value expressed by the user. A time zone of a location extracted from a social media input of the user is assigned to the group. A fabricated event that evokes a predicted sentiment is inserted in the broadcast program. A confidence value for the time zone is computed by comparing a sentiment value of a response by the group to the fabricated event with the predicted sentiment value. The group's placement in the time zone is confirmed when the confidence value exceeds a threshold.
-
公开(公告)号:US09852043B2
公开(公告)日:2017-12-26
申请号:US15602213
申请日:2017-05-23
发明人: Aaron K. Baughman , Thomas B. Harrison , Cody A. Clements , Michael P. Lazos , Robert J. Lewis , Brian M. O'Connell , Mary C. Zabriskie
CPC分类号: G06F11/3457 , G06F9/5072 , H04L41/083 , H04L43/50
摘要: A method and associated systems for optimizing a computing platform. A processor joins sets of configurable parameters into groups that each identifies a configuration of the computing environment or of a component or subsystem of the computing environment. The processor generates a set of variations of each group, where each variation identifies a candidate configuration of the component, subsystem, or platform, and where each candidate configuration identifies a distinct set of values of the group of parameters associated with that component, subsystem, or platform. Each configuration of this first generation of configurations undergoes a massively parallel iterative procedure that generates a next generation of configurations by performing operations upon the first generation that are similar to those of a natural-selection process. The procedure repeats until successive generations converge, within resource constraints, to a fittest generation that represents an optimal or most nearly optimal configuration of the computing platform.
-
-
-
-
-
-
-
-
-