The Odorant-Binding Protein Gene obp11 Shows Different Spatiotemporal Roles in the Olfactory System of Apis mellifera ligustica and Apis cerana cerana

Odorant-binding proteins participate in the olfactory system of the honeybee. Apis mellifera ligustica and Apis cerana cerana are species of honeybee that have different biologic functions. The two species have diversified olfactory systems, with A. cerana displaying sensitive olfactory involvement in collecting nectar and pollen from small plants; and A. mellifera collecting from large nectariferous plants. We hypothesized that, given this difference in biologic activity, the gene obp11 of A. mellifera and A. cerana may show different olfactory expression patterns. We cloned and sequenced the obp11 genes from A. mellifera (Amobp11) and A. cerana (Acobp11). Using quantitative real-time PCR, we demonstrated that nurse workers, which have the highest olfactory sensitivity in the A. mellifera hive, have the highest expression of Amobp11; whereas 1-day-emerged  workers, which have lowest olfactory sensitivity, have correspondingly low expression. However, the highest expression of Acobp11 is observed for foragers, which display the highest olfactory sensitivity in the A. cerana population. The OBP11 protein from the two species is highly conserved, with an apparent molecular weight and predicted extracellular localization that is similar to other OBP proteins. The expression of the obp11 gene in A. mellifera and A. cerana correlates with the different roles of the olfactory system for the two different species. These findings support the critical role of odorant-binding proteins in the Apis olfactory syste

A study on like-attracts-like versus elitist selection criterion for human-like social behavior of memetic mulitagent systems

Memetic multi agent system emerges as an enhanced version of multiagent systems with the implementation of meme-inspired computational agents. It aims to evolve human-like behavior of multiple agents by exploiting the Dawkins' notion of a meme and Universal Darwinism. Previous research has developed a computational framework in which a series of memetic operations have been designed for implementing humanlike agents. This paper will focus on improving the human-like behavior of multiple agents when they are engaged in social interactions. The improvement is mainly on how an agent shall learn from others and adapt its behavior in a complex dynamic environment. In particular, we design a new mechanism that supervises how the agent shall select one of the other agents for the learning purpose. The selection is a trade-off between the elitist and like-attracts-like principles. We demonstrate the desirable interactions of multiple agents in two problem domains

On Information Coverage for Location Category Based Point-of-Interest Recommendation

Point-of-interest(POI) recommendation becomes a valuable service in location-based social networks. Based on the norm that similar users are likely to have similar preference of POIs, the current recommendation techniques mainly focus on users' preference to provide accurate recommendation results. This tends to generate a list of homogeneous POIs that are clustered into a narrow band of location categories(like food, museum, etc.) in a city. However, users are more interested to taste a wide range of flavors that are exposed in a global set of location categories in the city.In this paper, we formulate a new POI recommendation problem, namely top-K location category based POI recommendation, by introducing information coverage to encode the location categories of POIs in a city.The problem is NP-hard. We develop a greedy algorithm and further optimization to solve this challenging problem. The experimental results on two real-world datasets demonstrate the utility of new POI recommendations and the superior performance of the proposed algorithms

Edge control in a computer controlled optical surfacing process using a heterocercal tool influence function

Edge effect is regarded as one of the most difficult technical issues in a computer controlled optical surfacing (CCOS) process. Traditional opticians have to even up the consequences of the two following cases. Operating CCOS in a large overhang condition affects the accuracy of material removal, while in a small overhang condition, it achieves a more accurate performance, but leaves a narrow rolled-up edge, which takes time and effort to remove. In order to control the edge residuals in the latter case, we present a new concept of the ‘heterocercal’ tool influence function (TIF). Generated from compound motion equipment, this type of TIF can ‘transfer’ the material removal from the inner place to the edge, meanwhile maintaining the high accuracy and efficiency of CCOS. We call it the ‘heterocercal’ TIF, because of the inspiration from the heterocercal tails of sharks, whose upper lobe provides most of the explosive power. The heterocercal TIF was theoretically analyzed, and physically realized in CCOS facilities. Experimental and simulation results showed good agreement. It enables significant control of the edge effect and convergence of entire surface errors in large tool-to-mirror size-ratio conditions. This improvement will largely help manufacturing efficiency in some extremely large optical system projects, like the tertiary mirror of the Thirty Meter Telescope

SWAT Modeling of Non-Point Source Pollution in Depression-Dominated Basins under Varying Hydroclimatic Conditions

Non-point source (NPS) pollution from agricultural lands is the leading cause of various water quality problems across the United States. Particularly, surface depressions often alter the releasing patterns of NPS pollutants into the environment. However, most commonly-used hydrologic models may not be applicable to such depression-dominated regions. The objective of this study is to improve water quantity/quality modeling and its calibration for depression-dominated basins under wet and dry hydroclimatic conditions. Specifically, the Soil and Water Assessment Tool (SWAT) was applied for hydrologic and water quality modeling in the Red River of the North Basin (RRB). Surface depressions across the RRB were incorporated into the model by employing a surface delineation method and the impacts of depressions were evaluated for two modeling scenarios, MS1 (basic scenario) and MS2 (depression-oriented scenario). Moreover, a traditional calibration scheme (CS1) was compared to a wet-dry calibration scheme (CS2) that accounted for the effects of hydroclimatic variations on hydrologic and water quality modeling. Results indicated that the surface runoff simulation and the associated water quality modeling were improved when topographic characteristics of depressions were incorporated into the model (MS2). The Nash–Sutcliffe efficiency (NSE) coefficient indicated an average increase of 30.4% and 19.6% from CS1 to CS2 for the calibration and validation periods, respectively. Additionally, the CS2 provided acceptable simulations of water quality, with the NSE values of 0.50 and 0.74 for calibration and validation periods, respectively. These results highlight the enhanced capability of the proposed approach for simulating water quantity and quality for depression-dominated basins under the influence of varying hydroclimatic conditions

Active Learning to Classify Macromolecular Structures in situ for Less Supervision in Cryo-Electron Tomography

Motivation: Cryo-Electron Tomography (cryo-ET) is a 3D bioimaging tool that visualizes the structural and spatial organization of macromolecules at a near-native state in single cells, which has broad applications in life science. However, the systematic structural recognition and recovery of macromolecules captured by cryo-ET are difficult due to high structural complexity and imaging limits. Deep learning based subtomogram classification have played critical roles for such tasks. As supervised approaches, however, their performance relies on sufficient and laborious annotation on a large training dataset. Results: To alleviate this major labeling burden, we proposed a Hybrid Active Learning (HAL) framework for querying subtomograms for labelling from a large unlabeled subtomogram pool. Firstly, HAL adopts uncertainty sampling to select the subtomograms that have the most uncertain predictions. Moreover, to mitigate the sampling bias caused by such strategy, a discriminator is introduced to judge if a certain subtomogram is labeled or unlabeled and subsequently the model queries the subtomogram that have higher probabilities to be unlabeled. Additionally, HAL introduces a subset sampling strategy to improve the diversity of the query set, so that the information overlap is decreased between the queried batches and the algorithmic efficiency is improved. Our experiments on subtomogram classification tasks using both simulated and real data demonstrate that we can achieve comparable testing performance (on average only 3% accuracy drop) by using less than 30% of the labeled subtomograms, which shows a very promising result for subtomogram classification task with limited labeling resources.Comment: Statement on authorship changes: Dr. Eric Xing was an academic advisor of Mr. Haohan Wang. Dr. Xing was not directly involved in this work and has no direct interaction or collaboration with any other authors on this work. Therefore, Dr. Xing is removed from the author list according to his request. Mr. Zhenxi Zhu's affiliation is updated to his current affiliatio

Optimal Region Search with Submodular Maximization

Region search is an important problem in location based services due to its wide applications. In this paper, we study the problem of optimal region search with submodular maximization (ORS-SM). This problem considers a region as a connected subgraph. We compute an objective value over the locations in the region using a submodular function and a budget value by summing up the costs of edges in the region, and aim to search the region with the largest objective score under a budget value constraint. ORS-SM supports many applications such as the most diversified region search. We prove that the problem is NP-hard and develop two approximation algorithms with guaranteed error bounds. We conduct experiments on two applications using three real-world datasets. The results demonstrate that our algorithms can achieve high quality solutions and are faster than a state-of-the art method by orders of magnitude

Identification of key genes and pathways in human clear cell renal cell carcinoma (ccRCC) by co-expression analysis

Human clear cell renal cell carcinoma (ccRCC) is the most common solid lesion within kidney, and its prognostic is influenced by the progression covering a complex network of gene interactions. In our study, we screened differential expressed genes, and constructed protein-protein interaction (PPI) network and a weighted gene co-expression network to identify key genes and pathways associated with the progression of ccRCC (n = 56). Functional and pathway enrichment analysis demonstrated that upregulated differentially expressed genes (DEGs) were significantly enriched in response to wounding, positive regulation of immune system process, leukocyte activation, immune response and cell activation. Downregulated DEGs were significantly enriched in oxidation reduction, monovalent inorganic cation transport, ion transport, excretion and anion transport. In the PPI network, top 10 hub genes were identified (TOP2A, MYC, ALB, CDK1, VEGFA, MMP9, PTPRC, CASR, EGFR and PTGS2). In co-expression network, 6 ccRCC-related modules were identified. They were associated with immune response, metabolic process, cell cycle regulation, angiogenesis and ion transport. In conclusion, our study illustrated the hub genes and pathways involved in the progress of ccRCC, and further molecular biological experiments are needed to confirm the function of the candidate biomarkers in human ccRCC

Constrained Path Search with Submodular Function Maximization

In this paper, we study the problem of constrained path search with submodular function maximization (CPS-SM). We aim to find the path with the best submodular function score under a given constraint (e.g., a length limit), where the submodular function score is computed over the set of nodes in this path. This problem can be used in many applications. For example, tourists may want to search the most diversified path (e.g., a path passing by the most diverse facilities such as parks and museums) given that the traveling time is less than 6 hours. We show that the CPS-SM problem is NP-hard. We first propose a concept called “submodular α -dominance” by utilizing the submodular function properties, and we develop an algorithm with a guaranteed error bound based on this concept. By relaxing the submodular α -dominance conditions, we design another more efficient algorithm that has the same error bound. We also utilize the way of bi-directional path search to further improve the efficiency of the algorithms. We finally propose a heuristic algorithm that is efficient yet effective in practice. The experiments conducted on several real datasets show that our proposed algorithms can achieve high accuracy and are faster than one state-of-the-art method by orders of magnitude