Troy Michael Volin

8326796, Dec 4, 2012

Apr 15, 2008

12/103119

Joel A. Farrell - Ashland MA, US
Jimmy M. Hsu - Austin TX, US
Troy M. Volin - Chapel Hill NC, US

International Business Machines Corporation - Armonk NY

G06F 7/00
G06F 17/00

707602

Despite the availability of mashup editors, people without programming knowledge cannot easily access the data sources to create data feeds. A data feed engine allows a user to create a data feed without protocol and/or formatting knowledge for the data source. The data feed engine automatically builds a search command with search parameters and a data source identity (e. g. , server name, network address, port number, etc. ). The data feed engine also encodes the built search command as a data feed and publishes a link for the data feed in a data feed catalog. After publication, users can access the catalog to combine data feeds, edit data feeds, etc. , and create mashups.

8386510, Feb 26, 2013

Apr 15, 2008

12/103390

Joel A. Farrell - Ashland MA, US
Jimmy M. Hsu - Austin TX, US
Troy M. Volin - Chapel Hill NC, US

International Business Machines Corporation - Armonk NY

G06F 7/00
G06F 17/30

707769, 707765, 707770, 709203

A data feed engine allows a user to create a data feed without protocol and/or formatting knowledge for the data source. The data feed engine dynamically selects a connector for any one of a variety of different types of data sources. The date feed engine can then build a search command with search parameters and a data source identity based on the automatically selected data source connector. The data feed engine publishes a reference to the generated data feed definition in a catalog of data feeds. A framework that utilizes such functionality allows creation of a mashup to with a combination of data feeds from different types of data sources.

8612407, Dec 17, 2013

Jul 18, 2012

13/552323

Albert A. DeLucca - Wantagh NY, US
Lisa Seacat DeLuca - San Francisco CA, US
Troy Michael Volin - Chapel Hill NC, US

International Business Machines Corporation - Armonk NY

G06F 17/30
G06F 7/00

707704, 707802

An embodiment of the invention provides a method for source control in a program, wherein the program includes hierarchical files for execution of processes, wherein the hierarchical files include parent files and child files. A revised process selected by a user on a graphical user interface is identified; and, files in the revised process are identified. The files in the revised process are locked with a source control processor. This includes disallowing revisions to the files in the revised process. One or more files that are descendents of a file in the revised process are identified. The one or more files that are descendents of a file in the revised process are locked with the source control processor. This includes disallowing revisions to the one or more files that are descendents of a file in the revised process.

20100005222, Jan 7, 2010

Jul 1, 2008

12/165931

CHARLES D. BRANT - RALEIGH NC, US
ESTHER M. BURWELL - DURHAM NC, US
ROBERT L. ORR - RALEIGH NC, US
TROY M. VOLIN - CHAPEL HILL NC, US
DOUGLAS A. WOOD - RALEIGH NC, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY

G06F 12/08

711 6, 711E12016

The allocation of virtual memory within a virtual machine based upon the previous mapping of virtual memory blocks to physical memory blocks is optimized. Virtual memory blocks that have been mapped to a corresponding physical memory block over virtual memory blocks that are unmapped when fulfilling an allocation request can be reallocated preferentially.

20100077401, Mar 25, 2010

Sep 25, 2008

12/238209

CHARLES D. BRANT - RALEIGH NC, US
ESTHER M. BURWELL - DURHAM NC, US
ROBERT L. ORR - RALEIGH NC, US
TROY M. VOLIN - CHAPEL HILL NC, US
DOUGLAS A. WOOD - RALEIGH NC, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - ARMONK NY

G06F 9/50

718104

Computing resource DNA associated with a computing resource of a computing system can be received. The computing resource DNA can include one or more computing resource DNA elements representing identifying characteristics of the computing resource. A set of one or more potential matches for the received computing resource DNA can be ascertained from a set of reference data. When one or more potential matches exist, a confidence factor can be calculated for each potential match. The set of potential matches can then be refined. An optimum match for the computing resource DNA can be determined from the set of refined potential matches. The computing resource DNA can then be identified as a representation of the computing resource associated with the optimum match.

20120072555, Mar 22, 2012

Sep 22, 2010

12/887773

Lisa Seacat DeLuca - San Francisco CA, US
Brian D. Goodman - Brooklyn NY, US
Troy M. Volin - Chapel Hill NC, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 15/177
G06F 3/01

709220

Embodiments of the present invention provide an approach to allow a user to link multiple cloud instances (e.g., virtual machines) together such that an action on one (cloud) instance is triggered when a second instance's state changes thereby invoking a predefined set of rules. Specifically, instances can be linked to one another via a graphical user interface (GUI or the like), and associated with a set of rules. The set of rules indicates a behavior/reaction of one instance when an action is performed with respect to another instance linked thereto. These embodiments could be implemented external to or within a cloud operating environment.

20130081120, Mar 28, 2013

Sep 28, 2011

13/247375

Lisa Seacat DeLuca - San Francisco CA, US
Troy M. Volin - Chapel Hill NC, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 21/00

726 7

A computer determines whether current location information of the computer indicates that the computer is at a home location. The computer determines a minimum number of characters to be entered by a user into a userID field to cause the computer to automatically display previously entered userIDs based on whether the computer is located at a home location. If fewer than the minimum characters are entered, previously entered userIDs are not displayed. Location information can be based on one or more of: wi-fi signal strengths, cell tower signal strengths and signal arrival timing information, whether the network connection is wireless or Ethernet cable, the wireless protocol, whether a wi-fi connection is secured or public, whether the computer is a mobile device, and satellite navigation system location.

20130151935, Jun 13, 2013

Dec 7, 2011

13/313470

Lisa Seacat DeLuca - San Francisco CA, US
Troy M. Volin - Chapel Hill NC, US

International Business Machines Corporation - Armonk NY

G06F 17/00

715205, 715222

A computer displays a screen that includes a uniform resource locator (URL). In response to a selection of a uniform resource locator (URL) by an end-user at a computer, the computer intercepts a request within the computer to prevent the request from being sent to another computer. The computer determines whether the URL includes one or more parameters that define a field with a missing value, and that need entry of one or more input values from the end-user. The computer generates an electronic form utilizing the one or more parameters to formulate a field, within the electronic form, for each of the one or more parameters. The computer displays the electronic form including the field for each of the one or more parameters, which enables the end-user to enter information into the field within the electronic form.