Abstract: A method of decreasing conversion of nicotine to nornicotine is provided herein. The methods includes administering at least one basic region/leucine zipper (bZIP) type transcription factor inhibitor to an organism in need thereof. Also provided herein is a method of decreasing conversion of nicotine to nornicotine including mutating a bZIP type transcription factor binding site on a promoter of a nicotine N-demethylase (NND). Further provided herein is a method of decreasing conversion of nicotine to nornicotine including mutating a plant genome to knockout at least one bZIP type transcription factor.

Abstract: A method of decreasing conversion of nicotine to nornicotine is provided herein. The methods includes administering at least one basic region/leucine zipper (bZIP) type transcription factor inhibitor to an organism in need thereof. Also provided herein is a method of decreasing conversion of nicotine to nornicotine including mutating a bZIP type transcription factor binding site on a promoter of a nicotine N-demethylase (NND). Further provided herein is a method of decreasing conversion of nicotine to nornicotine including mutating a plant genome to knockout at least one bZIP type transcription factor.

Abstract: There is a need for more effective and efficient document summarization. This need can be addressed by, for example, techniques for contextual summarization using semantic intelligence. In one example, a method includes identifying a plurality of senses associated with a plurality of words in a document; for each word-sense pair, determining a word-sense probability score; determining, based at least in part on each word-sense probability score for a word-sense pair, one or more context buckets for the document and one or more sense buckets for the document; determining, based at least in part on the one or more context buckets for the document and the one or more sense buckets for the document, the contextual summarization of the document; and performing one or more document processing actions based at least in part on the contextual summarization.

Abstract: A method of decreasing conversion of nicotine to nornicotine is provided herein. The methods includes administering at least one basic region/leucine zipper (bZIP) type transcription factor inhibitor to an organism in need thereof. Also provided herein is a method of decreasing conversion of nicotine to nornicotine including mutating a bZIP type transcription factor binding site on a promoter of a nicotine N-demethylase (NND). Further provided herein is a method of decreasing conversion of nicotine to nornicotine including mutating a plant genome to knockout at least one bZIP type transcription factor.

Abstract: There is a need for more effective and efficient document summarization. This need can be addressed by, for example, techniques for contextual summarization using semantic intelligence. In one example, a method includes identifying a plurality of senses associated with a plurality of words in a document; for each word-sense pair, determining a word-sense probability score; determining, based at least in part on each word-sense probability score for a word-sense pair, one or more context buckets for the document and one or more sense buckets for the document; determining, based at least in part on the one or more context buckets for the document and the one or more sense buckets for the document, the contextual summarization of the document; and performing one or more document processing actions based at least in part on the contextual summarization.

Abstract: A method of decreasing conversion of nicotine to nornicotine is provided herein. The methods includes administering at least one basic region/leucine zipper (bZIP) type transcription factor inhibitor to an organism in need thereof. Also provided herein is a method of decreasing conversion of nicotine to nornicotine including mutating a bZIP type transcription factor binding site on a promoter of a nicotine N-demethylase (NND). Further provided herein is a method of decreasing conversion of nicotine to nornicotine including mutating a plant genome to knockout at least one bZIP type transcription factor.

Abstract: A method for providing cloud-based communication for blood bank collection and management is provided. The method may include detecting and registering a plurality of cloud systems. The method may further include enabling cloud communications for the plurality of cloud systems. Additionally, the method may include receiving at least one blood donation request and blood donation event using the plurality of cloud communications for the plurality of cloud systems. The method may also include recommending and generating lists of blood donors based on the at least one blood donation request and the plurality of cloud systems. The method may further include presenting to users associated with the plurality of cloud systems the at least one blood donation request and blood donation event using the plurality of cloud communications, wherein the users associated with the plurality of cloud systems are based on the plurality of lists of blood donors.

Abstract: A method for providing cloud-based communication for blood bank collection and management is provided. The method may include detecting and registering a plurality of cloud systems. The method may further include enabling cloud communications for the plurality of cloud systems. Additionally, the method may include receiving at least one blood donation request and blood donation event using the plurality of cloud communications for the plurality of cloud systems. The method may also include recommending and generating lists of blood donors based on the at least one blood donation request and the plurality of cloud systems. The method may further include presenting to users associated with the plurality of cloud systems the at least one blood donation request and blood donation event using the plurality of cloud communications, wherein the users associated with the plurality of cloud systems are based on the plurality of lists of blood donors.

Abstract: According to one exemplary embodiment, a method for solving combinatorial optimization problems is provided. The method may include receiving a plurality of problem instance parameters associated with a graph. The method may also include determining a dynamic path change indicator exists. The method may then include initializing the graph based on the determining the dynamic path change indicator does not exist. The method may further include inserting a placeholder node and at least one placeholder node edge based on the determining the dynamic path change indicator exists. The method may also include reinitializing the graph with the inserted place holder node and the at least one placeholder node edge. The method may then include initializing the reinitialized graph. The method may further include executing a hybrid algorithm on the initialized graph or on the reinitialized graph, wherein the hybrid algorithm comprises an ant colony optimization algorithm and a genetic algorithm.

Abstract: According to one exemplary embodiment, a method for solving combinatorial optimization problems is provided. The method may include receiving a plurality of problem instance parameters associated with a graph. The method may also include determining a dynamic path change indicator exists. The method may then include initializing the graph based on the determining the dynamic path change indicator does not exist. The method may further include inserting a placeholder node and at least one placeholder node edge based on the determining the dynamic path change indicator exists. The method may also include reinitializing the graph with the inserted place holder node and the at least one placeholder node edge. The method may then include initializing the reinitialized graph. The method may further include executing a hybrid algorithm on the initialized graph or on the reinitialized graph, wherein the hybrid algorithm comprises an ant colony optimization algorithm and a genetic algorithm.

Abstract: A method for providing cloud-based communication for blood bank collection and management is provided. The method may include detecting and registering a plurality of cloud systems. The method may further include enabling cloud communications for the plurality of cloud systems. Additionally, the method may include receiving at least one blood donation request and blood donation event using the plurality of cloud communications for the plurality of cloud systems. The method may also include recommending and generating lists of blood donors based on the at least one blood donation request and the plurality of cloud systems. The method may further include presenting to users associated with the plurality of cloud systems the at least one blood donation request and blood donation event using the plurality of cloud communications, wherein the users associated with the plurality of cloud systems are based on the plurality of lists of blood donors.

Abstract: A method for providing cloud-based communication for blood bank collection and management is provided. The method may include detecting and registering a plurality of cloud systems. The method may further include enabling cloud communications for the plurality of cloud systems. Additionally, the method may include receiving at least one blood donation request and blood donation event using the plurality of cloud communications for the plurality of cloud systems. The method may also include recommending and generating lists of blood donors based on the at least one blood donation request and the plurality of cloud systems. The method may further include presenting to users associated with the plurality of cloud systems the at least one blood donation request and blood donation event using the plurality of cloud communications, wherein the users associated with the plurality of cloud systems are based on the plurality of lists of blood donors.

Abstract: According to one exemplary embodiment, a method for solving combinatorial optimization problems is provided. The method may include receiving a plurality of problem instance parameters associated with a graph. The method may also include determining a dynamic path change indicator exists. The method may then include initializing the graph based on the determining the dynamic path change indicator does not exist. The method may further include inserting a placeholder node and at least one placeholder node edge based on the determining the dynamic path change indicator exists. The method may also include reinitializing the graph with the inserted place holder node and the at least one placeholder node edge. The method may then include initializing the reinitialized graph. The method may further include executing a hybrid algorithm on the initialized graph or on the reinitialized graph, wherein the hybrid algorithm comprises an ant colony optimization algorithm and a genetic algorithm.

Abstract: According to one exemplary embodiment, a method for solving combinatorial optimization problems is provided. The method may include receiving a plurality of problem instance parameters associated with a graph. The method may also include determining a dynamic path change indicator exists. The method may then include initializing the graph based on the determining the dynamic path change indicator does not exist. The method may further include inserting a placeholder node and at least one placeholder node edge based on the determining the dynamic path change indicator exists. The method may also include reinitializing the graph with the inserted place holder node and the at least one placeholder node edge. The method may then include initializing the reinitialized graph. The method may further include executing a hybrid algorithm on the initialized graph or on the reinitialized graph, wherein the hybrid algorithm comprises an ant colony optimization algorithm and a genetic algorithm.

Abstract: According to one exemplary embodiment, a method for solving combinatorial optimization problems is provided. The method may include receiving a plurality of problem instance parameters associated with a graph. The method may also include determining a dynamic path change indicator exists. The method may then include initializing the graph based on the determining the dynamic path change indicator does not exist. The method may further include inserting a placeholder node and at least one placeholder node edge based on the determining the dynamic path change indicator exists. The method may also include reinitializing the graphiniti with the inserted place holder node and the at least one placeholder node edge. The method may then include initializing the reinitialized graph. The method may further include executing a hybrid algorithm on the initialized graph or on the reinitialized graph, wherein the hybrid algorithm comprises an ant colony optimization algorithm and a genetic algorithm.

Abstract: According to one exemplary embodiment, a method for solving combinatorial optimization problems is provided. The method may include receiving a plurality of problem instance parameters associated with a graph. The method may also include determining a dynamic path change indicator exists. The method may then include initializing the graph based on the determining the dynamic path change indicator does not exist. The method may further include inserting a placeholder node and at least one placeholder node edge based on the determining the dynamic path change indicator exists. The method may also include reinitializing the graph with the inserted place holder node and the at least one placeholder node edge. The method may then include initializing the reinitialized graph. The method may further include executing a hybrid algorithm on the initialized graph or on the reinitialized graph, wherein the hybrid algorithm comprises an ant colony optimization algorithm and a genetic algorithm.

Abstract: According to one exemplary embodiment, a method for solving combinatorial optimization problems is provided. The method may include receiving a plurality of problem instance parameters associated with a graph. The method may also include determining a dynamic path change indicator exists. The method may then include initializing the graph based on the determining the dynamic path change indicator does not exist. The method may further include inserting a placeholder node and at least one placeholder node edge based on the determining the dynamic path change indicator exists. The method may also include reinitializing the graph with the inserted place holder node and the at least one placeholder node edge. The method may then include initializing the reinitialized graph. The method may further include executing a hybrid algorithm on the initialized graph or on the reinitialized graph, wherein the hybrid algorithm comprises an ant colony optimization algorithm and a genetic algorithm.

Abstract: According to one exemplary embodiment, a method for solving combinatorial optimization problems is provided. The method may include receiving a plurality of problem instance parameters associated with a graph. The method may also include determining a dynamic path change indicator exists. The method may then include initializing the graph based on the determining the dynamic path change indicator does not exist. The method may further include inserting a placeholder node and at least one placeholder node edge based on the determining the dynamic path change indicator exists. The method may also include reinitializing the graph with the inserted place holder node and the at least one placeholder node edge. The method may then include initializing the reinitialized graph. The method may further include executing a hybrid algorithm on the initialized graph or on the reinitialized graph, wherein the hybrid algorithm comprises an ant colony optimization algorithm and a genetic algorithm.