Patents by Inventor Indrajit Roy

Indrajit Roy 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).

  • Patent number: 9015721
    Abstract: A plurality of array partitions are defined for use by a set of tasks of the program run-time. The array partitions can be determined from one or more arrays that are utilized by the program at run-time. Each of the plurality of computing devices are assigned to perform one or more tasks in the set of tasks. By assigning each of the plurality of computing devices to perform one or more tasks, an objective to reduce data transfer amongst the plurality of computing devices can be implemented.
    Type: Grant
    Filed: July 30, 2012
    Date of Patent: April 21, 2015
    Assignee: Hewlett-Packard Development Company, L. P.
    Inventors: Shivaram Venkataraman, Indrajit Roy, Mehul A. Shah, Robert Schreiber, Nathan Lorenzo Binkert, Parthasarathy Ranganathan
  • Patent number: 8938599
    Abstract: In a method of implementing a graph storage system, the graph storage system is stored on a plurality of computing systems. A global address space is provided for distributed graph storage. The global address space is managed with graph allocators, in which a graph allocator allocates space from a block of the distributed global memory in order to store a plurality of graphs.
    Type: Grant
    Filed: March 15, 2012
    Date of Patent: January 20, 2015
    Assignee: Hewlett-Packard Development Company, L. P.
    Inventors: Michael Mihn-Jong Lee, Indrajit Roy, Vanish Talwar, Alvin AuYoung, Parthasarathy Ranganathan
  • Patent number: 8832050
    Abstract: A distributed balanced tree having a plurality of nodes distributed across a plurality of servers is accessed. Version information associated with a node of the distributed balanced tree is retrieved. Validity of a lookup transaction performed on the balanced tree is determined by verifying a version value of only the leaf node accessed during the lookup operation against the retrieved version information.
    Type: Grant
    Filed: March 9, 2012
    Date of Patent: September 9, 2014
    Assignee: Hewlett-Packard Development Company, L.P.
    Inventors: Nathan L. Binkert, Wojciech Golab, Indrajit Roy, Mehul A. Shah, Benjamin A. Sowell
  • Patent number: 8819078
    Abstract: Examples of the present disclosure may include methods, systems, and computer readable media with executable instructions. An example method for event processing for graph-structured data can include storing graph structured data. The graph structured data includes a plurality of vertex, edge, and/or property graph elements. The example method further includes defining a first graph view of a characteristic of vertex, edge, and/or property graph elements. A subgraph is determined as a subset of the plurality of vertex, edge, and/or property graph elements that have the characteristic of vertex, edge, and/or property graph elements defined by the first graph view. The vertex, edge, and/or property graph elements of the subgraph are processed responsive to a predefined event that occurs on at least one of the vertex, edge, and/or property graph elements of the subgraph.
    Type: Grant
    Filed: July 13, 2012
    Date of Patent: August 26, 2014
    Assignee: Hewlett-Packard Development Company, L. P.
    Inventors: Indrajit Roy, Alvin AuYoung, Vanish Talwar, Michael Mihn-Jong Lee
  • Publication number: 20140137134
    Abstract: A sparse array is partitioned into first partitions and a second array is partitioned into second partitions based on an invariant relationship between the sparse array and the second array. The sparse array and the second array are associated with a computation involving the sparse array and the second array. The first partitions and the corresponding second partitions are distributed to workers. A different first partition and corresponding second partition is distributed to each of the workers. Third partitions of the sparse array and corresponding fourth partitions of the second array are determined based on the invariant relationship and measurements of load are received from each of the workers. At least one of the first partitions and the corresponding second partition is different from one of the third partitions and the corresponding fourth partition. The at least one of the first partitions and the corresponding second partition that is different is redistributed among the workers.
    Type: Application
    Filed: November 9, 2012
    Publication date: May 15, 2014
    Applicant: Hewlett-Packard Deveiopment Company, L.P.
    Inventors: Indrajit ROY, Shivaram Venkataraman, Alvin Auyoung, Robert Schreiber
  • Publication number: 20140033214
    Abstract: A plurality of array partitions are defined for use by a set of tasks of the program run-time. The array partitions can be determined from one or more arrays that are utilized by the program at run-time. Each of the plurality of computing devices are assigned to perform one or more tasks in the set of tasks. By assigning each of the plurality of computing devices to perform one or more tasks, an objective to reduce data transfer amongst the plurality of computing devices can be implemented.
    Type: Application
    Filed: July 30, 2012
    Publication date: January 30, 2014
    Inventors: Shivaram Venkataraman, Indrajit Roy, Mehul A. Shah, Robert Schreiber, Nathan Lorenzo Binkert, Parthasarathy Ranganathan
  • Publication number: 20140025415
    Abstract: A continuing analytics method includes distributing continuous analytics tasks among a number of workers. The workers execute the tasks on data elements stored in a distributed data storage system. Executing a task changes the data elements. In response to the change, a worker that executed a task invokes an update to the data storage system. The worker then increments a version number related to the changed data element, updates the data elements, and notifies other workers of the updated data element.
    Type: Application
    Filed: July 20, 2012
    Publication date: January 23, 2014
    Inventors: Shivaram Venkataraman, Indrajit Roy, Mehul A. Shah, Robert Schreiber, Nathan Lorenzo Binkert
  • Publication number: 20140019490
    Abstract: Examples of the present disclosure may include methods, systems, and computer readable media with executable instructions. An example method for event processing for graph-structured data can include storing graph structured data. The graph structured data includes a plurality of vertex, edge, and/or property graph elements. The example method further includes defining a first graph view of a characteristic of vertex, edge, and/or property graph elements. A subgraph is determined as a subset of the plurality of vertex, edge, and/or property graph elements that have the characteristic of vertex, edge, and/or property graph elements defined by the first graph view. The vertex, edge, and/or property graph elements of the subgraph are processed responsive to a predefined event that occurs on at least one of the vertex, edge, and/or property graph elements of the subgraph.
    Type: Application
    Filed: July 13, 2012
    Publication date: January 16, 2014
    Inventors: Indrajit Roy, Alvin Au Young, Vanish Talwar, Michael Mihn-Jong Lee
  • Publication number: 20130246731
    Abstract: In a method of implementing a graph storage system, the graph storage system is stored on a plurality of computing systems. A global address space is provided for distributed graph storage. The global address space is managed with graph allocators, in which a graph allocator allocates space from a block of the distributed global memory in order to store a plurality of graphs.
    Type: Application
    Filed: March 15, 2012
    Publication date: September 19, 2013
    Inventors: Michael Mihn-Jong Lee, Indrajit Roy, Vanish Talwar, Alvin AuYoung, Parthasarathy Ranganathan
  • Publication number: 20130238576
    Abstract: A distributed balanced tree having a plurality of nodes distributed across a plurality of servers is accessed. Version information associated with a node of the distributed balanced tree is retrieved. Validity of a lookup transaction performed on the balanced tree is determined by verifying a version value of only the leaf node accessed during the lookup operation against the retrieved version information.
    Type: Application
    Filed: March 9, 2012
    Publication date: September 12, 2013
    Inventors: Nathan L. Binkert, Wojciech Golab, Indrajit Roy, Mehul A. Shah, Benjamin A. Sowell
  • Publication number: 20130110774
    Abstract: An embodiment provides a system and method for transaction commitment and replication. The method includes receiving a minitransaction from a client node at one or more memory nodes, wherein each memory node includes a number of replicas. The minitransaction is a type of transaction which atomically executes any combination of reading, comparing, and writing to any of a number of memory locations. The method also includes determining, for a leader of the replicas within a memory node, whether the leader is able to commit the minitransaction and stabilizing state changes of the minitransaction within a transaction log using a consensus procedure to update the replicas. The method further includes committing the minitransaction if, at each memory node, a quorum of the replicas is able to stabilize the minitransaction, or aborting the minitransaction otherwise.
    Type: Application
    Filed: October 31, 2011
    Publication date: May 2, 2013
    Inventors: Mehul A. Shah, Wojciech Golab, Indrajit Roy, Nathan Lorenzo Binkert, Stavros Harizopoulos
  • Publication number: 20130110781
    Abstract: An embodiment provides a method for server replication and transaction commitment. The method includes receiving a transaction from a client node at one or more memory nodes, each memory node comprising a number of replicas, and determining, for each one of the replicas, whether the replica is able to commit the transaction. The method also includes sending a response from each of the replicas to a consensus node, wherein the consensus node is configured to record whether the response is a commit response. The method further includes committing the transaction if, at each memory node, a quorum of the replicas is able to commit the transaction, and aborting the transaction otherwise.
    Type: Application
    Filed: October 31, 2011
    Publication date: May 2, 2013
    Inventors: Wojciech Golab, Nathan Lorenzo Binkert, Indrajit Roy, Mehul A. Shah, Bruce Walker
  • Patent number: 8035016
    Abstract: Provided are methods and compositions for inhibiting expression of one or more target genes. The compositions contain RNA polynucleotides that can inhibit expression of a target gene via RNA interference (RNAi) electrostatically complexed with surface functionalized gold nanorods (GNRs). The RNA polynucleotides are not covalently bound to the surface functionalized GNRs. The method involves inhibiting expression of a target gene in an individual. The method is performed by administering to the individual an effective amount of a composition containing surface functionalized GNRs electrostatically complexed with RNA polynucleotides, such as siRNA, that can inhibit expression of the target gene via RNAi. The siRNA is not covalently bound to the surface functionalized GNRs.
    Type: Grant
    Filed: September 8, 2009
    Date of Patent: October 11, 2011
    Assignee: The Research Foundation of State University of New York
    Inventors: Earl J. Bergey, Adela Bonoiu, Supriya Mahajan, Paras N. Prasad, Indrajit Roy, Stanley A. Schwartz, Ken-Tye Yong
  • Publication number: 20110225425
    Abstract: A trusted read and write platform provides write-indisputability and read-undeniability for a distributed application. The platform is implemented at each node of the distributed application using a trusted platform module. To provide write-indisputability, the read and write platform of a node may generate a proof that is signed by the platform module and sent with a purportedly written result. The proof is decrypted using a public key associated with the platform module and includes indicators of the process taken by the read and write platform to write the result. To provide read-undeniability, the read and write platform may bind a key to a state of the platform module. A result to be read at the read and write platform is encrypted using the key and can only be decrypted when the read and write platform updates its state to the bound state.
    Type: Application
    Filed: March 11, 2010
    Publication date: September 15, 2011
    Applicant: Microsoft Corporation
    Inventors: Ramakrishna R. Kotla, Indrajit Roy
  • Publication number: 20100125100
    Abstract: Provided are methods and compositions for inhibiting expression of one or more target genes. The compositions contain RNA polynucleotides that can inhibit expression of a target gene via RNA interference (RNAi) electrostatically complexed with surface functionalized gold nanorods (GNRs). The RNA polynucleotides are not covalently bound to the surface functionalized GNRs. The method involves inhibiting expression of a target gene in an individual. The method is performed by administering to the individual an effective amount of a composition containing surface functionalized GNRs electrostatically complexed with RNA polynucleotides, such as siRNA, that can inhibit expression of the target gene via RNAi. The siRNA is not covalently bound to the surface functionalized GNRs.
    Type: Application
    Filed: September 8, 2009
    Publication date: May 20, 2010
    Inventors: Earl J. Bergey, Adela Bonoiu, Supriya Mahajan, Paras N. Prasad, Indrajit Roy, Stanley A. Schwartz, Ken-Tye Yong
  • Publication number: 20090114859
    Abstract: The present invention provides a method for imaging a biological specimen using non-linear optical properties of certain materials. The method comprises the steps of providing an aqueous dispersion of ZnO nanocrystals; contacting a biological specimen with an aqueous dispersion comprising ZnO nanocrystals; exposing the biological specimen to input electromagnetic radiation having a wavelength of from 600 to 1500 nm; recording the nonlinear output electromagnetic radiation; and generating an image of the biological specimen based on the nonlinear output radiation.
    Type: Application
    Filed: June 16, 2008
    Publication date: May 7, 2009
    Inventors: Paras Prasad, Aliaksandr Kachynski, Andrey Kuzmin, Marcin Nyk, Indrajit Roy
  • Patent number: 7364754
    Abstract: The present invention provides methods and compositions for photodynamic therapy. The composition comprises ceramic nanoparticles in which a photosensitive drug/dye is entrapped. The ceramic nanoparticles are made by formation of a micellar composition of the dye. The ceramic material is added to the micellar composition and the ceramic nanoparticles are precipitated by alkaline hydrolysis. The precipitated nanoparticles in which the photosensitive dye/drug is entrapped can be isolated by dialysis. The resulting drug doped nanoparticles are spherical, highly monodispersed, and stable in aqueous system. Irradiation with light of suitable wavelength of the photosensitizing drug entrapped inside nanoparticles resulted in generation of singlet oxygen, which was able to diffuse out through the pores of the ceramic matrix. The drug loaded ceramic nanoparticles of the present invention can be used as drug carriers for photodynamic therapy.
    Type: Grant
    Filed: January 26, 2004
    Date of Patent: April 29, 2008
    Assignee: Research Foundation of the State University of New York
    Inventors: Paras Prasad, Indrajit Roy, Earl J. Bergey, Tymish Y. Ohulchansky, Haridas Pudavar
  • Publication number: 20070134340
    Abstract: This invention provides nanocrystals or polymer doped nanocrystals of hydrophobic drug molecules as stably dispersed in an aqueous system which are prepared without stabilizers like surfactants and the like. In one embodiment, the drug is a tetra-pyrrole compound. An example is the hydrophobic photosensitizing anticancer drug 2-devinyl-2-(1-hexyloxyethyl)pyropheophorbide (HPPH). Pharmaceutical compositions comprising nanocrystals or polymer doped nanocrystals of hydrophobic drugs can be used for therapeutic purposes. For example pyropheophorbides such as HPPH can be used for photodynamic therapy. Drug efficacy of these nanocrystals were found to be comparable with that of same drug formulated in conventional delivery vehicles under in vitro and in vivo conditions.
    Type: Application
    Filed: June 20, 2006
    Publication date: June 14, 2007
    Inventors: Paras Prasad, Haridas Pudavar, Koichi Baba, Indrajit Roy, Tymish Ohulchanskyy, Ravindra Pandey, Allan Oseroff
  • Publication number: 20070086949
    Abstract: This invention provides nanocrystals or polymer doped nanocrystals of hydrophobic organic fluorescent dyes as stable dispersions in an aqueous system. The dispersions can be prepared without stabilizers such as surfactants and the like. The aqueous dispersions of the nanocrystals or the polymer doped nanocrystals can be used for bioimaging.
    Type: Application
    Filed: June 20, 2006
    Publication date: April 19, 2007
    Inventors: Paras Prasad, Koichi Baba, Haridas Pudavar, Indrajit Roy, Tymish Ohulchanskyy, Hachiro Nakanishi, Akito Masuhara, Hitoshi Kasai
  • Publication number: 20060088599
    Abstract: Provided are amino functionalized ORMOSIL nanoparticles. Also provided are compositions comprising such particles and compositions in which the nanoparticles are complexed to polynucleotides. The complexing of polynucleotides to the amino functionalized ORMOSIL nanoparticles protects the polynucleotides from environmental damage. These complexes can be used for delivery of polynucleotides to cells.
    Type: Application
    Filed: August 2, 2005
    Publication date: April 27, 2006
    Inventors: Paras Prasad, Earl Bergey, Purnendu Dutta, Dhruba Bharali, Michal Stachowiak, Tymish Ohulchanskyy, Ilona Klejbor, Indrajit Roy