Krishna Mehra

Krishna Mehra

San Francisco Bay Area
8K followers 500+ connections

About

Dynamic and results-oriented engineering executive with 15+ years of experience in…

Articles by Krishna

Activity

Join now to see all activity

Experience

  • Meta Graphic

    Meta

    Menlo Park, California, United States

  • -

    San Francisco Bay Area

  • -

    San Francisco Bay Area

  • -

    San Francisco Bay Area

  • -

    San Francisco Bay Area

  • -

  • -

  • -

Education

Publications

  • HOLMES: Effective statistical debugging via efficient path profiling

    ICSE 2009

Patents

  • Extract, Transform and Load (ETL) System and Method

    Issued US US20150186481 A1

    An ETL system for extracting transactional data from a plurality of source machines is provided. The ETL system includes a data query module configured to provide an interface to enable a data analyst to define an input query to extract transactional data, which is present on a plurality of source machines. The source machines form a multi-tenant system and each source machine is identified by a unique tenant identifier. The system also includes a query parsing module coupled to the data query…

    An ETL system for extracting transactional data from a plurality of source machines is provided. The ETL system includes a data query module configured to provide an interface to enable a data analyst to define an input query to extract transactional data, which is present on a plurality of source machines. The source machines form a multi-tenant system and each source machine is identified by a unique tenant identifier. The system also includes a query parsing module coupled to the data query module and configured to deconstruct the input query to create a tree structure. The tree structure comprises a plurality of distinct queries. The system further includes a data extraction module coupled to the query parsing module and configured to extract transactional data based on the distinct queries and copy the transactional data to a destination system wherein the transactional data comprises a plurality of data types.

    See patent
  • System and method for optimizing customer engagement

    Issued IN PCT/IN2013/000023

    In one embodiment, a system (100) for optimizing customer engagement is provided. The system (100) comprises an event management module (102) that is configured for recording one or more activities performed by a customer and one or more events that occur externally, a customer database (103) configured for storing customer data, a rule engine (110) coupled to the customer database (103) and the event management module (102), the rule engine (110) configured for mapping customer data to a set…

    In one embodiment, a system (100) for optimizing customer engagement is provided. The system (100) comprises an event management module (102) that is configured for recording one or more activities performed by a customer and one or more events that occur externally, a customer database (103) configured for storing customer data, a rule engine (110) coupled to the customer database (103) and the event management module (102), the rule engine (110) configured for mapping customer data to a set of actions based on a rule set, a timeline execution module (104) configured for generating at least one timeline for performing the set of actions in order to generate an adaptive customer engagement model and a communication module (112) configured for communicating to a customer one or more actions that are to be performed amongst the set of actions.

    See patent
  • Statistical debugging using paths and adaptive profiling

    Issued US US8065565 B2

    The method executes the application and if there are no errors from the execution of the application, the method ends. If errors exist, the errors are collected from the execution of the application in an error report. Labeled application paths are created by adding a unique label to individual application paths where the application paths are individual loops and individual functions in the application. An analysis is created of the labeled application paths by executing the application with…

    The method executes the application and if there are no errors from the execution of the application, the method ends. If errors exist, the errors are collected from the execution of the application in an error report. Labeled application paths are created by adding a unique label to individual application paths where the application paths are individual loops and individual functions in the application. An analysis is created of the labeled application paths by executing the application with the labeled paths, reviewing the error report for data related to the labels and if an error is sufficiently related to application paths with labels, storing the path that created the errors in a report. If an error is not sufficient related to the application path with labels, the method is repeated by the creating the analysis again by substituting additional application paths for the application paths.

    See patent
  • Object relational map verification system

    Issued US US7702695 B2

    An object relational map verification system is described. In some embodiments, the object relational map verification system can verify object relational maps and identify counterexamples when an object relational map cannot be verified. The object relational map verification system can verify an object relational map by (1) receiving objects, database schemas, query views, and update views; (2) generating first order logic formulae corresponding to the received objects, database schemas…

    An object relational map verification system is described. In some embodiments, the object relational map verification system can verify object relational maps and identify counterexamples when an object relational map cannot be verified. The object relational map verification system can verify an object relational map by (1) receiving objects, database schemas, query views, and update views; (2) generating first order logic formulae corresponding to the received objects, database schemas, query views, and update views; and (3) proving theorems indicated by the generated first order logic formulae. When the theorems are proved, the object relational map is verified. In some embodiments, the object relational map verification system can also generate models illustrating counterexamples when the theorem cannot be proved. The counterexamples provide data that the object relational map does not consistently store and then retrieve.

    See patent
  • mobile phone based mobile customer relationship loyalty methodology and servicing system with instant analytics features thereof

    Issued US 20120010931 A1

    A mobile phone based mobile customer relationship and loyalty servicing system and method thereof which involves media such as SMS, e-mail, instant messenger or a notification to a mobile application or website as well to identify and communicate with the customer in a customer friendly manner. It includes a unique code based operation and special feature of instant analytics for the customer, points/voucher validation and redemption, incentivized referral program, integrated campaigns and the…

    A mobile phone based mobile customer relationship and loyalty servicing system and method thereof which involves media such as SMS, e-mail, instant messenger or a notification to a mobile application or website as well to identify and communicate with the customer in a customer friendly manner. It includes a unique code based operation and special feature of instant analytics for the customer, points/voucher validation and redemption, incentivized referral program, integrated campaigns and the like right at the POS terminal at client outlet enabling real time integration, analytics and communication. The system involving Mobile phones/like mobile operative devices of the end users/customers, at least one client component at the retail/sales outlets and a server component comprising an MCRLP main server system for operative connection to said one client component for customer relationship and loyalty servicing. The Customer interacts with the system and his behavior is modeled.

    See patent
  • In-store customer engagement systems and methods

    Filed US US 14/500,702

    An in-store customer engagement system is provided. The system includes a retail processing device located in a store, wherein the retail processing device is configured to process transactions of a customer. The system also includes a customer registration device configured to receive customer data from the customer and to register the customer with a customer relationship management (CRM) application of the store. The system further includes a first server communicatively coupled to the…

    An in-store customer engagement system is provided. The system includes a retail processing device located in a store, wherein the retail processing device is configured to process transactions of a customer. The system also includes a customer registration device configured to receive customer data from the customer and to register the customer with a customer relationship management (CRM) application of the store. The system further includes a first server communicatively coupled to the retail processing device and to the customer registration device wherein the first server is configured to transmit the customer data to the retail processing device upon registration of the customer with the customer relationship management application.

    See patent
  • Calculating Resource Bounds Of Programs Manipulating Recursive Data ...

    Filed US US8397221 B2

    Bounding resource consumption of code that processes recursive data structures and collections includes making use of quantitative functions (based on user input) that are associated with a tuple of data-structures and whose semantics is specified by describing the effect of various data-structure methods on the relevant quantitative functions. Counter variables are incorporated into source code to count loop iterations (and number of recursive procedure call invocations). Relevant quantitative…

    Bounding resource consumption of code that processes recursive data structures and collections includes making use of quantitative functions (based on user input) that are associated with a tuple of data-structures and whose semantics is specified by describing the effect of various data-structure methods on the relevant quantitative functions. Counter variables are incorporated into source code to count loop iterations (and number of recursive procedure call invocations). Relevant quantitative functions are incorporated into the source code to allow computation of invariants (and hence bounds) on the incorporated counter variables in terms of the quantitative functions.

    See patent
  • DOMAIN-SPECIFIC GUIDANCE SERVICE FOR SOFTWARE DEVELOPMENT

    Filed US 12/146,611

    During software development, both before and after release, information may be collected and stored that may provide insight to developers as a generalized service. For example, data from past debugging sessions, source code in various repositories, bug repositories, discussion groups, and various documents may provide relevant information for software developers to fix current problems when this information is coherently matched with the problem. Using various sources, a system may mine the…

    During software development, both before and after release, information may be collected and stored that may provide insight to developers as a generalized service. For example, data from past debugging sessions, source code in various repositories, bug repositories, discussion groups, and various documents may provide relevant information for software developers to fix current problems when this information is coherently matched with the problem. Using various sources, a system may mine the stored data to give the current developer information related to past code development, and reveal why the code changed throughout previous development. Using sophisticated analyses to identify similar code patterns across multiple large software projects, discovering patterns in normal and abnormal uses of particular software interfaces, and employing other mining techniques, a developer may find domain-specific information to facilitate ongoing software development.

    See patent
  • Automated Task Centered Collaboration

    Filed US 12/143,891

    An automated task centered collaboration technique is described that significantly lowers the technological entry barrier for the development and deployment of a broad class of collaborative applications, which are termed Task Centered Collaboration (TCC) applications. TCC applications facilitate the processing of a large number of work items, or tasks, by people working independently or in small, synchronously collaborating groups. The technique also provides a mechanism for the study of…

    An automated task centered collaboration technique is described that significantly lowers the technological entry barrier for the development and deployment of a broad class of collaborative applications, which are termed Task Centered Collaboration (TCC) applications. TCC applications facilitate the processing of a large number of work items, or tasks, by people working independently or in small, synchronously collaborating groups. The technique also provides a mechanism for the study of computer mediated communication and human-computer interactions for this class of applications. The technique creates an abstraction applicable to the broad class of TCC applications, which enables the factoring out of significant portions of the application into a common infrastructure. It provides a programming model that enables a developer to focus on the User Interface and logic associated with operations on a single task, without being exposed to issues such as security, authentication,...

    See patent
  • Bounding Resource Consumption Using Abstract Interpretation

    Filed US 12/115,435

    Bounding resource consumption of code using abstract interpretation includes a static analysis to estimate a code's resource consumption in terms of units of resources utilized at any point during execution, expressed as a function of its scalar inputs. An instrumentation mechanism and an abstract interpretation mechanism are employed to compute bounds on the code resource consumption. The instrumentation mechanism includes incorporating one or more counter variables in the source code to count…

    Bounding resource consumption of code using abstract interpretation includes a static analysis to estimate a code's resource consumption in terms of units of resources utilized at any point during execution, expressed as a function of its scalar inputs. An instrumentation mechanism and an abstract interpretation mechanism are employed to compute bounds on the code resource consumption. The instrumentation mechanism includes incorporating one or more counter variables in the source code to count the number of loop iterations and recursive procedure call invocations. The abstract interpretation mechanism includes computing invariants on the instrumented counter variables and scalar program variables to obtain bounds on the number of loop iterations and recursive procedure call invocations, which are then composed together to obtain resource bounds for the entire program.

    See patent

Honors & Awards

  • Young Alumni Achiever Award

    IIT Kharagpur

    Young Alumni Achiever Award is awarded by IIT Kharagpur to select distinguished alumni that have demonstrated significant success in their chosen career fields and are a role model.

Languages

  • Hindi

    -

Recommendations received

More activity by Krishna

View Krishna’s full profile

  • See who you know in common
  • Get introduced
  • Contact Krishna directly
Join to view full profile

Other similar profiles

Explore collaborative articles

We’re unlocking community knowledge in a new way. Experts add insights directly into each article, started with the help of AI.

Explore More

Others named Krishna Mehra

Add new skills with these courses