Kantamneni
Harish Kantamneni, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20080244516 | VARIABLE CAPTURE IN OBJECT ORIENTED LANGUAGES - Systems and methods facilitate variable capture with respect to closures in object oriented programming languages. In particular, multiple copies of closure variables are generated such that lifetime of variables is defined by variable scope. However, if a previous version of a variable exists, a newly created variable is initialized with the value of the previous version. | 10-02-2008 |
20110173620 | Execution Context Control - A system and method for controlling the execution of notifications in a computer system with multiple notification contexts. A RunOn operator enables context hopping between notification contexts. Push-based stream operators optionally perform error checking to determine if notifications combined into a push-based stream share a common notification context. Context boxes group together notification creators and associate their notifications with a common scheduler and notification context. Operators employ a composition architecture, in which they receive one or more push-based streams and produce a transformed push-based stream that may be further operated upon. Components may be used in combinations to implement various policies, including a strict policy in which all notifications are scheduled in a common execution context, a permissive policy that provides programming flexibility, and a hybrid policy that combines flexibility with error checking. | 07-14-2011 |
20110239186 | VARIABLE CLOSURE - A system and method for accessing closure variables from a lambda expression in certain program configurations, in which the closure variable is accessed while the closure function is active and the closure variable is within an active runtime frame stack corresponding to an instance of the closure function. In response to entering the closure function, a pointer to each closure variable is stored in a stack pointer table. Each reference to each closure variable from the lambda expression is handled by using the closure variable pointer to locate the closure variable on the runtime stack. Program code may be instrumented to insert invocations to helper functions at locations upon entering the closure function and at each reference to each closure variable from the lambda expression. | 09-29-2011 |
20110271261 | MODIFIABLE HIGH-LEVEL INTERMEDIATE REPRESENTATION OF SOURCE CODE - A computer-implemented method includes compiling one or more segments of code during run-time of a process executing at one or more processors of a computer system. The compilation produces a high-level intermediate representation of the one or more segments of the code. The high-level intermediate representation is modifiable by the process, without executing the high-level intermediate representation, to generate a modified high-level intermediate representation that is executable by the process. | 11-03-2011 |
20110276953 | DYNAMIC TOKEN RESOLUTION DURING COMPILATION - A method includes, during compilation of a portion of source code at a compiler, initiating token resolution with respect to a token included in the portion of source code. A static context and a dynamic context of the compiler are queried to identify one or more lookup results of the token. A particular lookup result is selected to resolve the token based on one or more semantic rules of the compiler. The particular lookup result is selected independently of whether the particular lookup result is sourced from the static context or from the dynamic context. The method includes resolving the token based on the selected particular lookup result. | 11-10-2011 |
Harish V. Kantamneni, Redmond, WA US
Patent application number | Description | Published |
---|---|---|
20090150864 | DECLARATIVE OBJECT IDENTITY - Systems and methods are described that enhance a programming language by introducing support for declarative object identity in both class declarations and object literals. An exemplary system includes a memory that stores code associated with a computer program and a component coupled to the memory. The component is configured to access the code, to identify a variable in the code and a modifier associated with the variable and, responsive to identifying the variable, to use the variable to determine the identity of an object associated with the variable and to determine whether the object is equal to another object based on value semantics. | 06-11-2009 |
20090199159 | DECLARATIVE EXECUTION CONTEXT SPLITTING - Various technologies and techniques are disclosed for enabling code to be executed on one or more execution contexts based upon declarative annotations contained in the code or other locations. An annotation associated with a region of code is located. The annotation specifies information about an execution context where the region of code should be executed. A caller proxy is generated that is responsible for calling a callee adapter to execute the region of code. The callee adapter is generated that is responsible for receiving a call from the caller proxy and for dispatching a call to the region of code at the execution context. At runtime, the caller proxy receives a request to call the region of code and sends an execution request to the callee adapter. The callee adapter receives the execution request and dispatches a call to an executable version of the region of code. | 08-06-2009 |
Raj Gopal Kantamneni, San Jose, CA US
Patent application number | Description | Published |
---|---|---|
20090024964 | CALCULATING COGNITIVE EFFICIENCY SCORE FOR NAVIGATIONAL INTERFACES BASED ON EYE TRACKING DATA - A method and apparatus for computing efficiency score of a page is provided and using the efficiency score to optimize page design. Eye tracking study is performed on a group of subjects where eye fixation data, gaze plot data, and qualitative information data are collected. Fixation information data for page is aggregated over the subjects in the study. The fixation information data is divided into a grid. Number of fixations is computed for every grid element. Seen and noticed thresholds are established for every grid element. Seen and noticed area of a page is computed by counting number of grid elements falling into either threshold. Ratio of area noticed over area seen is computed to yield efficiency score. Page fixation data are compared for alternate page designs. Areas of large difference are correlated with gaze plots and qualitative data to identify distinguishing features. | 01-22-2009 |
Shobha Kantamneni, Fairfax, VA US
Patent application number | Description | Published |
---|---|---|
20080315147 | PERFLUOROALKYL SUBSTITUTED ACRYLATE MONOMERS AND POLYMERS THEREOF - Fluoroalkyl amidoalkyl alcohols of the formula | 12-25-2008 |
Siva P. Kantamneni, Largo, FL US
Patent application number | Description | Published |
---|---|---|
20110131588 | SOFTWARE ARCHITECTURE THAT CAN SENSE AND RESPOND TO CONTEXTUAL AND STATE INFORMATION - A software architecture that can sense and respond to context and state information is disclosed. The software architecture includes a semantic filter to correlate individual events in an event stream to make the event stream consistent with an ontology. Events in the event stream are substituted with higher order events, resulting in an actionable event stream containing recognizable patterns. Patterns in the actionable event stream are detected and matched with event processing policies to generate an action stream indicating actions to be taken in the real world. | 06-02-2011 |
20130060945 | IDENTIFYING SERVICES AND ASSOCIATED CAPABILITIES IN A NETWORKED COMPUTING ENVIRONMENT - In general, embodiments of the present invention classify cloud computing environments based on the abstraction layers that the cloud computing environments span and by combining the re-usable capabilities/logical components from these layers. In a typical embodiment, input (e.g., a set of requirements, a set of preferences, a set of costs parameters, and/or a request for feedback) pertaining to a set of services available in the networked computing environment is received from a requester via a network node. Based on the input, a set of capabilities and a corresponding set of logical components of the networked computing environment are identified. Thereafter, a set of providers capable of providing at least one of the set of services is identified and ranked. The set of logical components is then configured to provide the set of services according to the input, and made available to the requester. | 03-07-2013 |