Greater Seattle Area
59K followers 500+ connections

Join to view profile

About

Leads the design, product development and engineering teams responsible for creating…

Articles by Charles

See all articles

Activity

Join now to see all activity

Experience & Education

  • Microsoft

View Charles’s full experience

See their title, tenure and more.

or

By clicking Continue to join or sign in, you agree to LinkedIn’s User Agreement, Privacy Policy, and Cookie Policy.

Publications

  • Determination of Specificity Residues in Two Component Systems using Graphlets

    Biocomp

    This work presents a novel method for the identification of specificity residues in two component systems based on the discovery of graphlet signatures. We use network representations of 3-D structures and sequence of proteins, experimental data and graph-based learning to detect graphlet signatures that potentially are responsible for phosphotranfer specificity between Histidine Kinase (HK) and Response Regulator (RR) domains.

    Other authors
    • Morcos F.
    • Nitesh C.
    • Izaguirre J.
    See publication

  • Cytoprophet: A Cytoscape plug-in for protein and domain interaction networks inference

    Oxford Journal of Bioinformatics.

    Cytoprophet is a software tool that allows prediction and visualization of protein and domain interaction networks. It is implemented as a plug-in of Cytoscape, an open source software framework for analysis and visualization of molecular networks. Cytoprophet implements three algorithms that predict new potential physical interactions using the domain composition of proteins and experimental assays.

    Other authors
    • Morcos F.
    • Sikora M.
    • Izaguirre J.
    See publication

Patents

  • Predictive load scaling for services

    Issued US US 14/307,759

    Embodiments are directed to determining an optimal number of concurrently running cloud resource instances, based on the projected operational metric measurements, a number of cloud resource instances that are to be concurrently running at a specified future point in time.

    See patent

  • Determining document classification probabilistically through classification rule analysis

    Issued USPTO 08972328

    A classification application identifies patterns and evidences within representative documents. The application constructs a classification rule according to an entity and an affinity determined from the patterns and evidences. The application processes the representative documents with the classification rule to evaluate whether the rules meet acceptance requirements. Subsequent to a successful evaluation, the application identifies confidence levels for patterns and evidences within other…

    A classification application identifies patterns and evidences within representative documents. The application constructs a classification rule according to an entity and an affinity determined from the patterns and evidences. The application processes the representative documents with the classification rule to evaluate whether the rules meet acceptance requirements. Subsequent to a successful evaluation, the application identifies confidence levels for patterns and evidences within other documents.

    See patent

  • DYNAMIC RULE REORDERING FOR MESSAGE CLASSIFICATION

    Filed US US-2012-0303624-A1

    Spam filters use sets of rules to identify unwanted messages. These rules are typically applied in the same static order each time a message is received. The invention uses previously processed rules to more efficiently classify similar messages received in the future. The invention identifies which rules resulted in the classification of a particular message, and, the next time a message with a similar fingerprint is received, those rules are used to classify the message. The rules may also be…

    Spam filters use sets of rules to identify unwanted messages. These rules are typically applied in the same static order each time a message is received. The invention uses previously processed rules to more efficiently classify similar messages received in the future. The invention identifies which rules resulted in the classification of a particular message, and, the next time a message with a similar fingerprint is received, those rules are used to classify the message. The rules may also be re-ordered so that the rules that are the most effective at classifying messages are moved to the top of the list and are thus executed first. Claims are directed to generating a customized classification rule execution order and to identifying optimal ordering rules for previously processed data.

  • Managing Unwanted Communications Using Template Generation And Fingerprint Comparison Features

    Filed US 20120215853

    Unwanted communication detection and/or management features are providing, including using one or more commonality measures as part of generating templates for fingerprinting and comparison operations, but the embodiments are not so limited. An computing architecture of one embodiment includes components configured to generate templates and associated fingerprints for known unwanted communications, wherein the template fingerprints can be compared to unknown communication fingerprints as part…

    Unwanted communication detection and/or management features are providing, including using one or more commonality measures as part of generating templates for fingerprinting and comparison operations, but the embodiments are not so limited. An computing architecture of one embodiment includes components configured to generate templates and associated fingerprints for known unwanted communications, wherein the template fingerprints can be compared to unknown communication fingerprints as part of determining whether the unknown communications are based on similar templates and can be properly classified as unwanted or potentially unsafe communications for further analysis and/or blocking. A method of one embodiment operates to use a number of template fingerprints to detect and classify unknown communications as spam, phishing, and/or other unwanted communications.

    See patent

  • DECOMPOSING AND MERGING REGULAR EXPRESSIONS

    Filed US 20120158768

    The present invention extends to methods, systems, and computer program products for decomposing and merging regular expressions. Embodiments of the invention decompose a regular expression into multiple simple keyword graphs, merge those keyword graphs in a compact and efficient manner, and produce a directed acyclic graph (DAG) that can execute a simplified regular expression alphabet. Several of these regular expression DAG's can then be merged together to produce a single DAG that…

    The present invention extends to methods, systems, and computer program products for decomposing and merging regular expressions. Embodiments of the invention decompose a regular expression into multiple simple keyword graphs, merge those keyword graphs in a compact and efficient manner, and produce a directed acyclic graph (DAG) that can execute a simplified regular expression alphabet. Several of these regular expression DAG's can then be merged together to produce a single DAG that represents an entire collection of regular expressions. DAGs along with other text processing algorithms and a heap collection can be combined in a multi-pass approach to expand the regular expression alphabet.

    See patent

  • INDEXING AND QUERYING HASH SEQUENCE MATRICES

    Filed US 12/943,780

    Embodiments are directed to indexing and querying a sequence of hash values in an indexing matrix. A computer system accesses a document to extract a portion of text from the document. The computer system applies a hashing algorithm to the extracted text. The hash values of the extracted text form a representative sequence of hash values. The computer system inserts each hash value of the sequence of hash values into an indexing matrix, which is configured to store multiple different hash value…

    Embodiments are directed to indexing and querying a sequence of hash values in an indexing matrix. A computer system accesses a document to extract a portion of text from the document. The computer system applies a hashing algorithm to the extracted text. The hash values of the extracted text form a representative sequence of hash values. The computer system inserts each hash value of the sequence of hash values into an indexing matrix, which is configured to store multiple different hash value sequences. The computer system also queries the indexing matrix to determine how similar the plurality of hash value sequences are to the selected hash value sequence based on how many hash values of the selected hash value sequence overlap with the hash values of the plurality of stored hash value sequences.

    See patent

  • CONDITIONAL EXECUTION OF REGULAR EXPRESSIONS

    Filed US 12/938,895

    Embodiments directed to conditionally executing regular expressions and to simplifying regular expressions by canonicalizing regular expression terms. In an embodiment, a computer system accesses identified regular expression key terms that are to appear in a selected portion of text. The regular expression key terms are identified from terms in a selected regular expression. The computer system determines whether the identified regular expression key terms appear in the selected portion of…

    Embodiments directed to conditionally executing regular expressions and to simplifying regular expressions by canonicalizing regular expression terms. In an embodiment, a computer system accesses identified regular expression key terms that are to appear in a selected portion of text. The regular expression key terms are identified from terms in a selected regular expression. The computer system determines whether the identified regular expression key terms appear in the selected portion of text. The computer system also, upon determining that none of the identified regular expression key terms appears in the selected portion of text, prevents execution of the regular expression. Upon determining that at least one of the identified regular expression key terms appears in the selected portion of text, the computer system executes the regular expression.

    See patent

  • CONTAINMENT COEFFICIENT FOR IDENTIFYING TEXTUAL SUBSETS

    Filed US 12/871,672

    Similarity is determined between documents based on a method for identifying documents that are likely to be based on another document. The method can include the determination of a containment coefficient, which can indicate when a template document is a subset or substantially a subset of another document. Based on this determination, an appropriate document management action can be taken, such as implementing a security policy or modifying the display of messages from a user interface.

    See patent

Projects

  • Active Cloud Monitoring

    -

    I developed the Active Cloud Monitoring, a service that monitors your cloud applications and automatically scales your service up or down based on rules you set.

    Other creators
    See project

Languages

  • English

    Native or bilingual proficiency

  • Spanish

    Limited working proficiency

Recommendations received

3 people have recommended Charles

Join now to view

More activity by Charles

View Charles’ full profile

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

Other similar profiles

Explore more posts

Explore top content on LinkedIn

Find curated posts and insights for relevant topics all in one place.

View top content

Add new skills with these courses

See all courses