TMCnet News
U.S. Patents Awarded to Inventors in New York (Aug. 31)(Targeted News Service Via Acquire Media NewsEdge) Targeted News Service Targeted News Service ALEXANDRIA, Va., Aug. 31 -- The following federal patents were awarded to inventors in New York. *** Cornell University Assigned Patent ALEXANDRIA, Va., Aug. 31 -- Cornell University, Ithaca, N.Y., has been assigned a patent (PP22,098) developed by Peter Podaras, Ithaca, N.Y., for a "buddleja plant named 'Podaras #12'." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A new and distinct cultivar of Buddleja plant named 'Podaras #12', characterized by its compact and outwardly spreading plant habit; freely flowering habit; sterile violet blue-colored flowers; and good garden performance." The patent application was filed on March 2, 2010 (12/660,668). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=PP22,098&OS=PP22,098&RS=PP22,098 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Rubinstein Assigned Patent ALEXANDRIA, Va., Aug. 31 -- Walter M. Rubinstein, Bronx, N.Y., has been assigned a patent (8,010,408) developed by Walter M. Rubinstein, Bronx, N.Y., and Simeon Marc Balban, Skokie, Ill., for a "packetized advertising utilizing information indicia." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and system for packetized advertising carried out with machine readable and decodable information indicia, where the packetized advertisements are formed by associating any combination of a plurality of products and services with the information indicia. In response to a device capturing an image of the information indicia a universal resource locator (URL) is generated. The URL generates a webpage with a series of URL that correspond to the plurality of products and services that are associated with the captured information indicia." The patent application was filed on Oct. 9, 2009 (12/576,276). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=80,10,408.PN.&OS=PN/80,10,408&RS=PN/80,10,408 Written by Ruby Maibam; edited by Jaya Anand. *** Google Assigned Patent ALEXANDRIA, Va., Aug. 31 -- Google, Mountain View, Calif., has been assigned a patent (8,010,407) developed by five co-inventors for a "business finder for locating local businesses to contact." The co-inventors are David Santoro, Menlo Park, Calif., David S. Young, Mountain View, Calif., John Callaway, Mountain View, Calif., Osi Imeokparia, Brooklyn, N.Y., and Gregory Joseph Badros, Palo Alto, Calif. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Marketing techniques are disclosed that allow companies to efficiently identify target businesses to solicit for purchase of advertising products. One embodiment includes a map-based interface for selecting a neighborhood and locating any businesses known to a company selling advertising products in that area, with the intent of allowing a company representative to select a set of those businesses to contact regarding the company's advertising products. The map displays business listings as markers on the map, with color-coding used to indicate listings the representative has already contacted, and listings that some other representative has contacted." The patent application was filed on Nov. 14, 2007 (11/940,181). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=80,10,407.PN.&OS=PN/80,10,407&RS=PN/80,10,407 Written by Ruby Maibam; edited by Jaya Anand. *** General Electric Assigned Patent ALEXANDRIA, Va., Aug. 31 -- General Electric, Niskayuna, N.Y., has been assigned a patent (8,010,315) developed by Yanyan Wu, Schenectady, N.Y., Francis Howard Little, Cincinnati, and Prabhjot Singh, Guilderland, N.Y., for a "multi-modality inspection method with data validation and data fusion." The abstract of the patent published by the U.S. Patent and Trademark Office states: "An inspection method is provided and includes acquiring at least one inspection data set. Each inspection data set comprises inspection data for a component. The inspection method further includes mapping the inspection data set onto a three-dimensional (3D) model of the component, to generate a 3D inspection model for the component, and validating the inspection data against the 3D model of the component using at least one validation criterion. A multi-modality inspection method is also provided and includes acquiring multiple inspection data sets corresponding to multiple inspection modalities for a component and fusing the inspection data sets to form a fused data set. The multi-modality inspection method further includes mapping the fused data set onto a 3D model of the component to generate a 3D multi-modality inspection model for the component." The patent application was filed on Nov. 27, 2007 (11/945,456). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=%2Fnetahtml%2FPTO%2Fsrchnum.htm&r=1&f=G&l=50&s1=8010315.PN.&OS=PN/8010315&RS=PN/8010315 Written by Ankresh Ranjan; edited by Jaya Anand. *** International Business Machines Assigned Patent ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,297) developed by four co-inventors for a protein structure analysis. The co-inventors are Prasanna Athma, Yorktown Heights, N.Y., Ajay K. Royyuru, Congers, N.Y., Benjamin David Silverman, Yorktown Heights, N.Y., and Ruhong Zhou, Fort Lee, N.J. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Techniques for analyzing one or more protein structures. In one aspect of the invention, the technique comprises the following steps. A normalized second-order hydrophobic moment is determined for a protein structure. The normalized second-order hydrophobic moment is then used for analysis of the protein structure. A scoring function in accordance with the normalized second-order hydrophobic moment for the protein structure may be determined. A score for the protein structure may then be generated using the scoring function. The scoring function may represent an integral of the normalized second-order hydrophobic moment. The scores may be generated for a plurality of protein structures. The scores generated for the plurality of protein structures may then be compared." The patent application was filed on Dec. 16, 2008 (12/335,865). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO1&Sect2=HITOFF&d=PALL&p=1&u=%2Fnetahtml%2FPTO%2Fsrchnum.htm&r=1&f=G&l=50&s1=8010297.PN.&OS=PN/8010297&RS=PN/8010297 Written by Ankresh Ranjan; edited by Jaya Anand. *** Akamai Technologies Assigned Patent ALEXANDRIA, Va., Aug. 31 -- Akamai Technologies, Cambridge, Mass., has been assigned a patent (8,010,861) developed by Adam J. Grove, Menlo Park, Calif., Michael Kharitonov, New York, and Alexei Tumarkin, Santa Barbara, Calif., for a "system for fast recovery from losses for reliable data communication protocols." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Fast recovery from losses is an important problem for reliable data communication protocols. The Internet standard TCP protocol (Transmission Control Protocol) implements two algorithms for that: an original one based on a special timer, and a later addition to TCP that is triggered when there are three packets received by the client after the missing one. Web communications are most frequently carrying rather small objects that are generally ineligible for anything other than timeout-based retransmission schemes. The present invention describes a system delivering performance improvements to TCP (and other reliable data communication protocols) that are compliant with present Internet standards. One improvement is to send duplicates of packets without waiting for a timeout to occur. Another is to split particular parts of a data stream into smaller packets. A third is to send packets out-of-order to force the remote host to acknowledge all packets that were successfully received." The patent application was filed on Oct. 19, 2009 (12/581,258). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&u=%2Fnetahtml%2FPTO%2Fsearch-adv.htm&r=593&f=G&l=50&d=PTXT&s1=20110830.PD.&p=12&OS=ISD/08/30/2011&RS=ISD/08/30/2011 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** AT&T Intellectual Property I Assigned Patent for System and Method for Applying Probability Distribution Models to Dialog Systems in the Troubleshooting Domain ALEXANDRIA, Va., Aug. 31 -- AT&T Intellectual Property I, Atlanta, has been assigned a patent (8,010,364) developed by Jason Williams, New York, for a "system and method for applying probability distribution models to dialog systems in the troubleshooting domain." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Disclosed herein are systems, methods, and computer-readable media for troubleshooting based on a probability distribution model. The method for troubleshooting based on a probability distribution model includes establishing a speech-based channel of interaction, establishing at least one non-speech-based channel of interaction, maintaining a probability distribution over time for each of a plurality of component variables describing the state of the product or service and state of the conversation, and troubleshooting a product or service by responding based on the probability distribution." The patent application was filed on Oct. 31, 2007 (11/930,366). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=80,10,364.PN.&OS=PN/80,10,364&RS=PN/80,10,364 Written by Ruby Maibam; edited by Jaya Anand. *** International Business Machines Assigned Patent for Method for Compiling Scalar Code for a Single Instruction Multiple Data (SIMD) Execution Engine ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,953) developed by Michael K. Gschwind, Chappaqua, N.Y., for a "method for compiling scalar code for a single instruction multiple data (SIMD) execution engine." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Performing scalar operations using a SIMD data parallel execution unit is provided. With the mechanisms of the illustrative embodiments, scalar operations in application code are identified that may be executed using vector operations in a SIMD data parallel execution unit. The scalar operations are converted, such as by a static or dynamic compiler, into one or more vector load instructions and one or more vector computation instructions. In addition, control words may be generated to adjust the alignment of the scalar values for the scalar operation within the vector registers to which these scalar values are loaded using the vector load instructions. The alignment amounts for adjusting the scalar values within the vector registers may be statically or dynamically determined." The patent application was filed on April 4, 2006 (11/278,639). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,953&OS=8,010,953&RS=8,010,953 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** Morgan Stanley Assigned Patent ALEXANDRIA, Va., Aug. 31 -- Morgan Stanley, New York, has been assigned a patent (8,010,393) developed by Kenneth R. Pierce, Port Washington, N.Y., for an "event-linked credit protection structure." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A process that provides protection to an entity against the risk that a third party experiences a credit-related problem as a result of, or following a fortuitous, identifiable, insurable event, where the entity is exposed to the credit risk of the third party. The process may comprise the step of entering into, by the entity, an insurance agreement with an insurer, wherein the obligations of the insurer under the insurance agreement are triggered upon the occurrence of both (1) a credit-related problem of the third party and (2) the event. The entity may be, for example, a person or a business. Where the entity is an insurance provider, the insurer may be a reinsurer, and the insurance agreement between the two may be a reinsurance agreement. The credit-related problem of the third party may be a solvency problem or a failure to borrow a certain amount of money on the part of the third party. The failure to borrow may arise out of a failure to obtain a loan on the part of the third party or a failure to raise by the third party the certain amount of money through the issuance of debt or equity securities." The patent application was filed on Jan. 11, 2008 (12/008,444). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=80,10,393.PN.&OS=PN/80,10,393&RS=PN/80,10,393 Written by Ruby Maibam; edited by Jaya Anand. *** International Business Machines Assigned Patent for Compiler for Eliminating Redundant Read-modify-write Code Sequences in Non-vectorizable Code ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,957) developed by John Kevin Patrick O'Brien, South Salem, N.Y., and Kathryn M. O'Brien, South Salem, N.Y., for a "compiler for eliminating redundant read-modify-write code sequences in non-vectorizable code." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A computer implemented method, apparatus, and computer usable program code for eliminating redundant read-modify-write code sequences in non-vectorizable code. Code is received comprising a sequence of operations. The sequence of operations includes a loop. Non-vectorizable operations are identified within the loop that modifies at least one sub-part of a storage location. The non-vectorizable operations are modified to include a single store operation for the number of sub-parts of the storage location." The patent application was filed on Aug. 1, 2006 (11/461,571). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,957&OS=8,010,957&RS=8,010,957 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Program Storage Device for Project Preparing a Procurement and Accounts Payable System ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,395) developed by seven co-inventors for a "program storage device for project preparing a procurement and accounts payable system." The co-inventors are Ray F. Barnard, Endicott, N.Y., Carl S. Baumann, Vestal, N.Y., Philip J. Cirulli, Endicott, N.Y., Kerin J. Flannery, Endicott, N.Y., Carl J. Lanuti, Endwell, N.Y., John I. Munson, Binghamton, N.Y., and Karl J. Ritch, Vestal, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A program storage device for coordinating a project for designing, implementing, and using a general procurement and accounts payable (GP/AP) system for a customer. A playbook database is created and includes templates of information relating to designing, implementing, and using the GP/AP system. The templates are particularized for the customer. A playbook summary view is generated from the playbook database. The playbook summary view displays a folders and views section, a task title display and selection area, a summary task creation button, and a detailed task creation button, which visually appear together in an undivided display area within the playbook summary view. Communication is between team members of a team and the playbook database via a server coupled to the playbook database and an intranet coupled to both the server and the team members. The team members have responsibility for the designing and implementing of the GP/AP system." The patent application was filed on March 31, 2008 (12/059,345). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=80,10,395.PN.&OS=PN/80,10,395&RS=PN/80,10,395 Written by Ruby Maibam; edited by Jaya Anand. *** American Express Travel Related Services Assigned Patent ALEXANDRIA, Va., Aug. 31 -- American Express Travel Related Services, New York, has been assigned a patent (8,010,403) developed by four co-inventors for a "system and method for targeting transaction account product holders to receive upgraded transaction account products." The co-inventors are Abhinav Kala, New Delhi, India, Susana Sung-hye Kim, New York, Subhra Shankar Purkayastha, Haryana, India, and Jill Zucker, New York. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Utilization of information in a closed loop data system further augments modeling while at the same time enabling customization of offers based on spend patterns. Data mining techniques are leveraged to identify rules to determine higher response rate populations. These rules are referred to herein as "triggers," in that the presence of particular attributes will trigger a cardholder as being more likely to respond to a particular offer. The benefit yielded by this approach is a greater acceptance rate to an offer provided by a transactional account company. To identify the triggers, records of cardmembers who already utilize a given product are analyzed to determine their spend patterns. The spend histories of customers who are eligible to use the product are analyzed according to the identified triggers. Customers whose spend patterns most closely correspond to the triggers are then targeted with offers for the given product." The patent application was filed on Dec. 29, 2006 (11/618,329). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=80,10,403.PN.&OS=PN/80,10,403&RS=PN/80,10,403 Written by Ruby Maibam; edited by Jaya Anand. *** International Business Machines Assigned Patent for Methods, Systems, and Computer Program Products for Implementing Inter-process Integrity Serialization ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,995) developed by Ernest S. Bender, Saugerties, N.Y., for "methods, systems, and computer program products for implementing inter-process integrity serialization." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method, system, and computer program product for implementing inter-process integrity serialization services is provided. The method includes enabling process states including a must-stay-controlled (MSC) state and an extended must-stay-controlled (EMSC) state for an invoking process when it is determined that only programs designated as controlled, if any, have been loaded for the invoking process. The invoking process requests loading of a target program into temporary storage for performing a security service. Based upon a control indicator of the target program, the MSC state, and the EMSC state, the method includes controlling one or more activities within the temporary storage. The activities include loading the target program into the temporary storage, executing a main program in the temporary storage, and resetting the MSC state and the EMSC state across execution of the main program during the lifetime of the invoking process." The patent application was filed on Sept. 8, 2006 (11/530,087). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,995.PN.&OS=PN/8,010,995&RS=PN/8,010,995 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Error Correcting Code with Chip Kill Capability and Power Saving Enhancement ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,875) developed by eight co-inventors for an "error correcting code with chip kill capability and power saving enhancement." The co-inventors are Alan G. Gara, Mount Kisco, N.Y., Dong Chen, Croton On Husdon, N.Y., Paul W. Coteus, Yorktown Heights, N.Y., William T. Flynn, Rochester, Minn., James A. Marcella, Rochester, Minn., Todd Takken, Brewster, N.Y., Barry M. Trager, Yorktown Heights, N.Y., and Shmuel Winograd, Scarsdale, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and system are disclosed for detecting memory chip failure in a computer memory system. The method comprises the steps of accessing user data from a set of user data chips, and testing the user data for errors using data from a set of system data chips. This testing is done by generating a sequence of check symbols from the user data, grouping the user data into a sequence of data symbols, and computing a specified sequence of syndromes. If all the syndromes are zero, the user data has no errors. If one of the syndromes is non-zero, then a set of discriminator expressions are computed, and used to determine whether a single or double symbol error has occurred. In the preferred embodiment, less than two full system data chips are used for testing and correcting the user data." The patent application was filed on June 26, 2007 (11/768,559). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&u=%2Fnetahtml%2FPTO%2Fsearch-adv.htm&r=579&f=G&l=50&d=PTXT&s1=20110830.PD.&p=12&OS=ISD/08/30/2011&RS=ISD/08/30/2011 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Clock Power Minimization with Regular Physical Placement of Clock Repeater Components ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,926) developed by five co-inventors for a "clock power minimization with regular physical placement of clock repeater components." The co-inventors are Charles J. Alpert, Cedar Park, Texas, Ruchir Puri, Baldwin Place, N.Y., Shyam Ramji, Lagrangeville, N.Y., Ashish K. Singh, Austin, Texas, and Chin Ngai Sze, Austin, Texas. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Power, routability and electromigration have become crucial issues in modern microprocessor designs. In high performance designs, clocks are the highest consumer of power. Arranging clocking components with regularity so as to minimize the capacitance on the clock nets can help reduce clock power, however, it may hurt performance due to some loss of flexibility in physically placing those components. The present invention provides techniques to optimally place clock components in a regular fashion so as to minimize clock power within a performance constraint. A rectangular grid is created and clock distribution structures are assigned to the grid intersection points. Latches are then located around the clock distribution structures to minimize an overall distance for connections between the latches and respective clock distribution structures. The horizontal and vertical pitches of the grid may be independently adjusted to achieve a more uniform spread of the clock distribution structures." The patent application was filed on Jan. 30, 2008 (12/022,849). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,926&OS=8,010,926&RS=8,010,926 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Automated Method for Buffering in a VLSI Design ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,922) developed by four co-inventors for an "automated method for buffering in a VLSI design." The co-inventors are Frank Malgioglio, Hopewell Junction, N.Y., Adam R. Jatkowski, Wyoming, Pa., Brian A. Lasseter, Austin, Texas, and Joseph J. Palumbo, Poughkeepsie, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Buffers are placed on selected nets coupled to input and output pins of entities in an IC device. This includes loading selected input and output pins of entities prior to respectively buffering nets of the entities and buffering in successive iterations, which includes setting artificial loads on selected input pins. The buffering in a current iteration is limited to i) buffering nets on the current iteration entity for receivers on the current iteration entity and ii) buffering nets on the current iteration entity directly coupled to respective nets of an immediately adjacent entity that has been buffered already in a preceding one of iterations, but only if the already buffered net is coupled to a receiver on its own net or a receiver on some other already buffered net via nets that have all been buffered via one or more of the preceding iterations." The patent application was filed on Feb. 18, 2008 (12/032,762). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,922&OS=8,010,922&RS=8,010,922 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Automatic 3D Object Generation and Deformation for Representation of Data Files Based on Taxonomy Classification ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,907) developed by Andrew J. Sullivan, Wappingers Falls, N.Y., and Sharad C. Sundararajan, Chestnut Hill, Mass., for an "automatic 3D object generation and deformation for representation of data files based on taxonomy classification." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Disclosed are a system and method for generating three-dimensional objects to represent files in a three-dimensional environment. A primary classifier classifies stored files into groups based on a first set of properties and generates three-dimensional mesh objects to represent each file. The mesh objects are the same within each group and distinguish the files from group to group. A secondary classifier further classifies each group of files into sub-groups based on a second set of properties and deforms the mesh objects in each sub-group in a particular manner to distinguish files from sub-group to sub-group. Additional classifiers modify the deformed mesh objects to further distinguish files within each sub-group (e.g., by varying the shape, texture, animation, etc.). Each three-dimensional object can then be embedded into a three-dimensional graphical user interface as a selection tool that provides visual cues regarding the contents of a particular file." The patent application was filed on June 13, 2008 (12/138,484). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,907&OS=8,010,907&RS=8,010,907 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** GLOBALFOUNDRIES Assigned Patent ALEXANDRIA, Va., Aug. 31 -- GLOBALFOUNDRIES, Grand Cayman, Ky., has been assigned a patent (8,010,915) developed by Norman Shaowen Chen, Poughkeepsie, N.Y., Scott Goad, Pflugerville, Texas, and Paul Willard Ackmann, Lakeway, Texas, for a "grid-based fragmentation for optical proximity correction in photolithography mask applications." The abstract of the patent published by the U.S. Patent and Trademark Office states: "An optical proximity correction (OPC) method for photolithography applications can be utilized to reduce the processing time, cost, and post-OPC file size associated with conventional methods. The OPC method provides a target layout pattern that represents a corresponding mask pattern for a photolithography mask, and aligns the target layout pattern relative to a suitably dimensioned fragmentation grid. Then, at least one feature of the target layout pattern is fragmented using the fragmentation grid. Thereafter, a fragment data set is generated in response to the grid-based fragmentation of the target layout pattern." The patent application was filed on July 10, 2008 (12/170,988). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,915&OS=8,010,915&RS=8,010,915 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for Method and System for Dynamically Generating Enterprise Java Beans During Installation of a Service Component Architecture Application ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,941) developed by David Andrew Booz, Rhinebeck, N.Y., and Rashmi Hunt, Palo Alto, Calif., for a "method and system for dynamically generating enterprise java beans during installation of a service component architecture application." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method of dynamically generating stateless session beans (EJBs) during installation of a Service Component Architecture (SCA) composite to expose simple SCA POJO components to Java EE callers. During SCA composite installation, an installation utility receives an installation request for a SCA composite with a simple POJO service. If EJB service binding is defined, the installation utility collects data from a service interface to generate a corresponding bean interface and implementation classes. Generic EJB home, bean and interface class templates are pre-defined using EMF JET templates. Data collected from the service interface is fed into pre-defined EMF JET Templates to generate service-specific EJB classes. The installation utility also matches the java interface to the EJB interface to ensure compatibility. Generated bean method has code snippets to delegate calls to SCA components during runtime. Given a simple SCA POJO Service, the installation utility generates Stateless Session bean without Java EE tooling." The patent application was filed on May 7, 2007 (11/745,118). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,941&OS=8,010,941&RS=8,010,941 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** New York Inventor Develops Patent for Picture Leveling/Positioning Template ALEXANDRIA, Va., Aug. 31 -- Erich George Schultz, New York, has developed a patent (RE42,649) for a picture leveling/positioning template. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention 10 discloses an inexpensive, reusable, and compact picture leveling template where the design of the device 10 would allow the user 12 to arrange picture frames 14, shadow boxes 70, shelving 77, signage, or any objects with 2 or 3 dimensions that could be mounted on a wall 16 in a preferred arrangement in limitless aesthetic combinations on a vertical surface of any size or slope along with curved wall surfaces. The template 10 has multiple leveling guides 24, 28, 32 to assist the user 12 in leveling and spacing picture frames 14 horizontally and vertically on any vertical surface 16. The present invention 10 may be a three-part, inexpensive compact kit comprised of a planar pliable material 18 with multiple leveling lines 34, 36 inscribed thereon, a non-shear adhesive 38, and bubble levels 40 for use with a non-shear adhesive." The patent application was filed on Feb. 9, 2006 (11/351,217). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=RE42,649&OS=RE42,649&RS=RE42,649 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** New York Inventor Develops Patent for Method and Apparatus for Presenting Electronic Literary Macrames on Handheld Computer systems ALEXANDRIA, Va., Aug. 31 -- Dana W. Paxson, Rochester, N.Y., has developed a patent (8,010,897) for a "method and apparatus for presenting electronic literary macrames on handheld computer systems." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Handheld computer game-playing systems and similar devices are here adapted for use as electronic readers for literature, specifically supporting complex literary and instructional forms, each a work of literature which is woven and knotted together using many threads of narrative in a nonlinear fashion supported only by programmable electronic systems such as computers. The reader experiences such electronic works on a handheld computing device using conventional Web-browser software supported by said device. The electronic work is adapted to any restrictions or special characteristics of the handheld device to facilitate its proper presentation and use." The patent application was filed on July 25, 2007 (11/828,238). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&u=%2Fnetahtml%2FPTO%2Fsearch-adv.htm&r=557&f=G&l=50&d=PTXT&s1=20110830.PD.&p=12&OS=ISD/08/30/2011&RS=ISD/08/30/2011 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for System and Method for Statistical Timing Analysis of Digital Circuits ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,921) developed by Chandramouli Visweswariah, Croton-on-Hudson, N.Y., for a "system and method for statistical timing analysis of digital circuits." The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention is a system and method for statistical or probabilistic static timing analysis of digital circuits, taking into account statistical delay variations. The delay of each gate or wire is assumed to consist of a nominal portion, a correlated random portion that is parameterized by each of the sources of variation and an independent random portion. Arrival times and required arrival times are propagated as parameterized random variables while taking correlations into account. Both early mode and late mode timing are included; both combinational and sequential circuits are handled; static CMOS as well as dynamic logic families are accommodated. The timing analysis complexity is linear in the size of the graph and the number of sources of variation. The result is a timing report in which all timing quantities such as arrival times and slacks are reported as probability distributions in a parameterized form." The patent application was filed on Sept. 12, 2008 (12/209,461). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,921&OS=8,010,921&RS=8,010,921 Written by Satyaban Rath; edited by Hemanta Panigrahi. *** International Business Machines Assigned Patent for System and Method for Indexing, Searching and Retrieving Semantic Objects ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,574) developed by Yuan-Chi Chang, New York, Matthew L. Hill, Yonkers, N.Y., and Chung-Sheng Li, Scarsdale, N.Y., for a "system and method for indexing, searching and retrieving semantic objects." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and structure for storing information for one or more semantic objects derived from raw data. A semantic object extracted from the raw data and classified to comprise the semantic object is received, the received semantic object having one or more attributes. A summary of attributes of the semantic object by calculating one or more statistics of one or more of the one or more attributes of the received semantic object, a confidence level of the received semantic object that quantifies a degree of certainty that the received semantic object has been correctly classified and/or labeled; and a compact representation of raw data of the received semantic object are generated. Indexing information for one or more of the summary of attributes and the compact representation of the semantic object is generated. The semantic object, along with its associated summary of attributes, confidence level, compact representation, and indexing information, stored in a semantic object database associated with a database storing the raw data." The patent application was filed on Feb. 16, 2010 (12/706,345). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=80,10,574.PN.&OS=PN/80,10,574&RS=PN/80,10,574 Written by Rajat Puri; edited by Jaya Anand. *** Xerox Assigned Patent ALEXANDRIA, Va., Aug. 31 -- Xerox, Norwalk, Conn., has been assigned a patent (8,010,589) developed by Wei Peng, Miami, Philip C. Rose, Sodus, N.Y., and Tong Sun, Penfield, N.Y., for a "semi-automatic system with an iterative learning method for uncovering the leading indicators in business processes." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Embodiments herein select performance indicators from raw data and measure the indicators over at least one time period to extract a time series of data for each of the indicators. The method determines a time order among the correlated indicators and determines a causal direction among the correlated indicators based on which of the correlated indicators occurs first in time so as to identify relative leading indicators among the correlated indicators. The processes of determining the time order and determining the causal direction can comprise applying Dynamic Time Warping and/or Granger Causality techniques to the time series of data." The patent application was filed on Feb. 20, 2007 (11/676,816). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=80,10,589&OS=80,10,589&RS=80,10,589 Written by Rajat Puri; edited by Jaya Anand. *** Digital Video Chip Assigned Patent ALEXANDRIA, Va., Aug. 31 -- Digital Video Chip, Woodbury, N.Y., has been assigned a patent (8,010,711) developed by Alan Amron, Brooklyn, N.Y., and Eric T. Brewer, Saratoga, Calif., for a universal multimedia. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A memory device removably insertable into or otherwise removably connected to a plurality of host devices includes a first memory storing multimedia data. A first circuit portion of the memory device determines the host device capabilities when the memory device is connected to a host device and a second circuit portion feeds the multimedia data to the host device in a format compatible with the determined capabilities of the host device." The patent application was filed on May 30, 2008 (12/130,744). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,711.PN.&OS=PN/8,010,711&RS=PN/8,010,711 Written by Arpi Sharma; edited by Jaya Anand. *** Purple Communications Assigned Patent ALEXANDRIA, Va., Aug. 31 -- Purple Communications, Rocklin, Calif., has been assigned a patent (8,010,706) developed by David Rein, Manlius, N.Y., and Jesse Odom, New Rochelle, N.Y., for a "method of and system for enabling offline applications." The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention provides a method of enabling a web application independent of Internet coverage. The application operates within a service utilized by a client device and a server. Enabling the web application may include providing a plug-in application within the service; queuing up requests from the web application within the plug-in application; submitting the requests to the server during Internet coverage; and receiving a web response from the server to be sent to the web application through the plug-in application. A system for enabling a web application independent of Internet coverage is also provided. The system comprises a server including a processor and a memory and a client device including a processor and a memory having a plug-in application stored therein. The processor is capable of queuing up requests from the web application within the plug-in application, submitting the requests to the server during Internet coverage and receiving a web response from the server to be sent to the web application through the plug-in application." The patent application was filed on Aug. 5, 2002 (10/212,862). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,706.PN.&OS=PN/8,010,706&RS=PN/8,010,706 Written by Arpi Sharma; edited by Jaya Anand. *** Microsoft Assigned Patent for Hardware Constrained Software Execution ALEXANDRIA, Va., Aug. 31 -- Microsoft, Redmond, Wash., has been assigned a patent (8,010,773) developed by six co-inventors for a "hardware constrained software execution." The co-inventors are Hakki Tunc Bostanci, Redmond, Wash., Nathan Jeffrey Ide, Bothell, Wash., Matthias Hermann Wollnik, Seattle, John Richard McDowell, Seattle, Karan Singh Dhillon, Renton, Wash., and Aaron Payne Goldsmid, New York. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Restricting execution by a computing device of instructions within an application program. The application program is modified such that execution of the selected instructions is dependent upon a corresponding expected state of one or more hardware components in the computing device. In an embodiment, the application program is modified to place the hardware components in the expected states prior to execution of the corresponding selected instructions. Creating the dependency on the hardware components prevents the unintended or malicious execution of the selected instructions." The patent application was filed on June 24, 2008 (12/144,699). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8010773.PN.&OS=PN/8010773&RS=PN/8010773 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Computational Device Power-savings ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,815) developed by four co-inventors for a computational device power-savings. The co-inventors are Rick A. Hamilton II, Charlottesville, Va., Brian M. O'Connell, Cary, N.C., Clifford A. Pickover, Yorktown Heights, N.Y., and Keith R. Walker, Austin, Texas. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A user may invoke energy savings in the operation of a computational device performing a processing task. The device performs the processing task in the invoked energy savings mode and determines an energy amount expended by the device in performing the processing task in the energy savings mode, creating a net energy savings value as a difference between the energy amount expended and a standard energy expenditure amount predicted as required for the computational device to perform the processing task in high-performance mode. The device displays the net energy savings value to the user, with the user continuing the invoking of the energy savings mode or engaging another performance mode for the computational device as a function of the displaying." The patent application was filed on May 1, 2008 (12/113,663). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,815.PN.&OS=PN/8,010,815&RS=PN/8,010,815 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Software Application Cluster Layout Pattern ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,833) developed by Benjamin W. Herta, Poughquag, N.Y., for a "software application cluster layout pattern." The abstract of the patent published by the U.S. Patent and Trademark Office states: "In forming a cluster of processors and applications among a plurality of processors connected in a network the embodiment of a pair of cluster nodes, as applications, in each server/system and arranging for communication between them in a ring or tiered ring configuration of servers/systems provides network status monitoring and failure recovery in a highly redundant and flexible manner at increased speed without the requirement of separate communication links for monitoring and control or redundant hardware such as a so-called "hot standby" processor in each server/system." The patent application was filed on Jan. 20, 2009 (12/356,219). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,833.PN.&OS=PN/8,010,833&RS=PN/8,010,833 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Hypervisor-enforced Isolation of Entities within a Single Logical Partition's Virtual Address Space ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,763) developed by five co-inventors for a "hypervisor-enforced isolation of entities within a single logical partition's virtual address space." The co-inventors are William J. Armstrong, Rochester, Minn., Orran Y. Krieger, Newton, Mass., Cathy May, Millwood, N.Y., Michal Ostrowski, Austin, Texas, and Randal C. Swanberg, Round Rock, Texas. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Access control to shared virtual address space within a single logical partition is provided. The access control includes: associating, by a hypervisor of the data processing system, a memory protection key with a portion of a single logical partition's virtual address space being shared by multiple entities, the key preventing access by one of the multiple entities to that portion of the virtual address space, and allowing access by another of the entities to that portion of the virtual address space; and locking by the hypervisor the memory protection key from modification by the one entity, wherein the locking prevents the one entity from modifying the key and thereby gaining access to the portion of the single logical partition's virtual address space with the associated memory protection key. In one embodiment, the one entity is the single logical partition itself, and the another entity is a partition adjunct." The patent application was filed on April 28, 2008 (12/111,041). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8010763.PN.&OS=PN/8010763&RS=PN/8010763 Written by Kusum Sangma; edited by Anand Kumar. *** International Business Machines Assigned Patent for Increasing Buffer Locality During Multiple Table Access Operations ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,766) developed by five co-inventors for an "increasing buffer locality during multiple table access operations." The co-inventors are Bishwaranjan Bhattacharjee, Yorktown Heights, N.Y., Christian A. Lang, New York, Timothy R. Malkemus, Round Rock, Texas, Sriram Padmanabhan, San Jose, Calif., and Kwai Wong, Sunderland, Canada. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Disclosed are a method, information processing system, and computer readable medium for managing table scan processes. The method includes monitoring a plurality of storage medium table scan processes. Each storage medium table scan process in the plurality of storage medium table scan processes is placed into a plurality of scan groups based on storage medium pages to be scanned by each of the storage medium table scan processes. Each storage medium table scan process in a scan group can share data within a storage medium page." The patent application was filed on Oct. 12, 2006 (11/548,875). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8010766.PN.&OS=PN/8010766&RS=PN/8010766 Written by Kusum Sangma; edited by Anand Kumar. *** Google Assigned Patent ALEXANDRIA, Va., Aug. 31 -- Google, Mountain View, Calif., has been assigned a patent (8,010,480) developed by Kushal B. Dave, New York, and Jeremy A. Hylton, Easton, Pa., for a "selecting high quality text within identified reviews for display in review snippets." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method and system of selecting content from reviews for display are described. A review is identified and partitioned. A subset of the partitions is selected based on predefined criteria. A snippet is generated from the selected partitions. A response that includes the snippet is generated." The patent application was filed on Sept. 30, 2005 (11/241,702). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,480.PN.&OS=PN/8,010,480&RS=PN/8,010,480 Written by Anjali Jha; edited by Jaya Anand. *** Google Assigned Patent for Phrase Based Snippet Generation ALEXANDRIA, Va., Aug. 31 -- Google, Mountain View, Calif., has been assigned a patent (8,010,539) developed by five co-inventors for a "phrase based snippet generation." The co-inventors are Sasha Blair-Goldensohn, New York, Kerry Hannan, Sunnyside, N.Y., Ryan McDonald, New York, Tyler Neylon, Mountain View, Calif., and Jeffrey C. Reynar, New York. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Disclosed herein is a method, a system and a computer product for generating a snippet for an entity, wherein each snippet comprises a plurality of sentiments about the entity. One or more textual reviews associated with the entity is selected. A plurality of sentiment phrases are identified based on the one or more textual reviews, wherein each sentiment phrase comprises a sentiment about the entity. One or more sentiment phrases from the plurality of sentiment phrases are selected to generate a snippet." The patent application was filed on Jan. 25, 2008 (12/020,483). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,539.PN.&OS=PN/8,010,539&RS=PN/8,010,539 Written by Anjali Jha; edited by Jaya Anand. *** International Business Machines Assigned Patent ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,479) developed by eight co-inventors for a "simplifying the creation of user-defined custom elements for use in a graphical modeling application." The co-inventors are Daniel C. Berg, Holly Springs, N.C., Brad L. Blancett, Raleigh, N.C., Michael D. Elder, Durham, N.C., Chad M. Holliday, Holly Springs, N.C., Narinder Makin, Morrisville, N.C., Timothy A. Pouyer, Greenville, S.C., Edward C. Snible, Bronx, N.Y., and John E. Swanke, Terryville, Conn. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The present invention can include a solution for capturing user-defined custom elements for use in a graphical modeling application. Such a system can include a graphical modeling application and a custom element definition tool. The graphical modeling application can be configured to create semantic models that contain a static graphical elements and semantic data elements. The custom element definition tool can be configured to create a user-defined custom element for the graphical modeling application. The user-defined custom element can consist of one or more static graphical element and/or one or more semantic data element." The patent application was filed on June 18, 2008 (12/141,495). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,479.PN.&OS=PN/8,010,479&RS=PN/8,010,479 Written by Anjali Jha; edited by Jaya Anand. *** New York Inventors Develop Patent for Knowledge Archival and Recollection Systems and Methods ALEXANDRIA, Va., Aug. 31 -- George Eagan, East Moriches, N.Y., and Prabhdeep Singh, Coram, N.Y., have developed a patent (8,010,553) for "knowledge archival and recollection systems and methods." The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method of extracting knowledge from a knowledge archival and recollection system, comprising the steps of: recognizing a user actuation; initiating a search application; displaying a user search interface; receiving input parameters via the search interface; identifying a query type based on the received input parameters; formulating a database query based on the received input parameters; transmitting the database query to a database; obtaining database query results from the database; providing the database query results to a result analyzer module; and displaying search result analyzer module results to a user." The patent application was filed on Oct. 29, 2007 (11/927,499). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,553.PN.&OS=PN/8,010,553&RS=PN/8,010,553 Written by Anjali Jha; edited by Jaya Anand. *** Microsoft Assigned Patent for Locally Computable Spam Detection Features and Robust Pagerank ALEXANDRIA, Va., Aug. 31 -- Microsoft, Redmond, Wash., has been assigned a patent (8,010,482) developed by eight co-inventors for a "locally computable spam detection features and robust pagerank." The co-inventors are Reid Marlow Andersen, Seattle, Christian Herwarth Borgs, Seattle, Jennifer Tour Chayes, Seattle, John E. Hopcroft, Ithaca, N.Y., Kamal Jain, Bellevue, Wash., Seyed Vahab Mirrokni, Seattle, Amit Prakash, Munhall, Pa., and Shang-Hua Teng, Somerville, Mass. The abstract of the patent published by the U.S. Patent and Trademark Office states: "The claimed subject matter provides a system and/or a method that facilitates reducing spam in search results. An interface can obtain web graph information that represents a web of pages. A spam detection component can determines one or more features based at least in part on the web graph information. The one or more features can provide indications that a particular page of the web graph is spam. In addition, a robust rank component is provided that limits amount of contribution a single page can provide to the target page." The patent application was filed on March 3, 2008 (12/041,474). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,482.PN.&OS=PN/8,010,482&RS=PN/8,010,482 Written by Anjali Jha; edited by Jaya Anand. *** International Business Machines Assigned Patent for Systems and Methods for Condensation-based Privacy in Strings ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,541) developed by Charu C. Aggarwal, Mohegan Lake, N.Y., and Philip S. Yu, Chappaqua, N.Y., for "systems and methods for condensation-based privacy in strings." The abstract of the patent published by the U.S. Patent and Trademark Office states: "Novel methods and systems for the privacy preserving mining of string data with the use of simple template based models. Such template based models are effective in practice, and preserve important statistical characteristics of the strings such as intra-record distances. Discussed herein is the condensation model for anonymization of string data. Summary statistics are created for groups of strings, and use these statistics are used to generate pseudo-strings. It will be seen that the aggregate behavior of a new set of strings maintains key characteristics such as composition, the order of the intra-string distances, and the accuracy of data mining algorithms such as classification. The preservation of intra-string distances is a key goal in many string and biological applications which are deeply dependent upon the computation of such distances, while it can be shown that the accuracy of applications such as classification are not affected by the anonymization process." The patent application was filed on Sept. 30, 2006 (11/540,406). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,541.PN.&OS=PN/8,010,541&RS=PN/8,010,541 Written by Anjali Jha; edited by Jaya Anand. *** International Business Machines Assigned Patent for System and Method for Model-driven Object Store ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,512) developed by four co-inventors for a "system and method for model-driven object store." The co-inventors are Teruo Koyanagi, Yamato, Japan, Hui Lei, Scarsdale, N.Y., Hiroyasu Ohsaki, Yokohama, Japan, and Liangzhao Zeng, Mohegan Lake, N.Y. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Disclosed is a system and method for model-driven datastore. The model-driven datastore includes an object persistence model editor for developing specific object persistence models based on an object persistence metamodel. The object persistence model consists of object model, object access pattern and user defined functions. The object model consists of a collection of object definition, said object definition supports at least one basic type or structure type of attributes. The object access pattern defines the access path that are used to retrieve the object instances, where the access path is consists of a collection of actions. The actions comprise at least one of the following a self action, parent action, or children action. User defined functions are declaratively defined and supports group operators. The model driven datastore further includes a model transformer for generating an object index based on object access patterns and executable code for supporting object access patterns and user defined functions and an object store manager for executing generated code that allows applications to create, update, retrieval or persist objects." The patent application was filed on June 16, 2008 (12/139,767). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,512.PN.&OS=PN/8,010,512&RS=PN/8,010,512 Written by Anjali Jha; edited by Jaya Anand. *** International Business Machines Assigned Patent for Hydrophobic Moment of Multi-domain Proteins ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,332) developed by four co-inventors for a "hydrophobic moment of multi-domain proteins." The co-inventors are Prasanna Athma, Yorktown Heights, N.Y., Ajay Royyuru, Congers, N.Y., Benjamin David Silverman, Yorktown Heights, N.Y., and Ruhong Zhou, Fort Lee, N.J. The abstract of the patent published by the U.S. Patent and Trademark Office states: "Techniques for protein structure analysis are provided. In one aspect, an apparatus for characterizing a multi-domain protein structure comprises the following steps. For at least one domain, a hydrophobic dipole, e.g., defined as a first-order hydrophobic moment of the domain, is calculated. A score representing the orientation of the hydrophobic dipole of the at least one domain relative to a hydrophobic dipole of one or more other domains of the multi-domain protein structure is then calculated." The patent application was filed on Aug. 13, 2009 (12/540,540). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=80,10,332.PN.&OS=PN/80,10,332&RS=PN/80,10,332 Written by Ruby Maibam; edited by Jaya Anand. *** International Business Machines Assigned Patent for Increasing Application Availability during Automated Enterprise Deployments ALEXANDRIA, Va., Aug. 31 -- International Business Machines, Armonk, N.Y., has been assigned a patent (8,010,504) developed by five co-inventors for an "increasing application availability during automated enterprise deployments." The co-inventors are Rohith Kottamangalam Ashok, Apex, N.C., Charles James Redlin, Rochester, Minn., Barry Charles Searle, Mississauga, Canada, Christopher Paul Vignola, Port Jervis, N.Y., and Leigh Allen Williamson, Austin, Texas. The abstract of the patent published by the U.S. Patent and Trademark Office states: "A method of deploying enterprise applications or updates to data processing systems in a complex data processing environment. The enterprise applications or updates are phase deployed to the target data processing systems. Phased deployment includes the steps of preparing one affected node, quiescing all affected servers in the node, stopping all affected servers in the node, synchronizing the node, delivering the applications or updates, starting all affected servers, reactivating all affected servers, restoring the affected node, and repeating these steps for each affected node one at a time until all targeted data processing systems have been affected." The patent application was filed on Oct. 27, 2008 (12/259,272). The full-text of the patent can be found at http://patft.uspto.gov/netacgi/nph-Parser?Sect1=PTO2&Sect2=HITOFF&p=1&u=%2Fnetahtml%2FPTO%2Fsearch-bool.html&r=1&f=G&l=50&co1=AND&d=PTXT&s1=8,010,504.PN.&OS=PN/8,010,504&RS=PN/8,010,504 Written by Anjali Jha; edited by Jaya Anand. For more information about Targeted News Service products and services, please contact: Myron Struck, editor, Targeted News Service LLC, Springfield, Va., 703/304-1897; [email protected]; http://targetednews.com. -1059430 (c) 2011 Targeted News Service |