Abstract: Disclosed is a pharmaceutical composition, comprising a first component and a second component, wherein the first component is selected from at least one of a farnesoid X receptor agonist and a precursor, an active metabolite, a stereoisomer, a pharmaceutically acceptable salt, an ester and a solvate thereof; and the second component is selected from at least one of a NPC1L1 receptor inhibitor and a precursor, an active metabolite, a stereoisomer, a pharmaceutically acceptable salt, an ester and a solvate thereof. The composition can be used in preventing and/or treating non-alcoholic fatty liver disease, diabetes or cardiovascular disease.

Abstract: This disclosure relates to CB1 receptor antigen-binding proteins, e.g. antibodies and methods of using the CB1 receptor antibodies. The CB1 receptor antibodies may comprise an antagonistic antibody to CB1 receptors and may be used to treat various health conditions. The health conditions can comprise obesity or diabetes or any disease that benefits from antagonism of the CB1 receptor.

Abstract: An automatic door seal seals the gap between the lower edge of a door and a threshold. The seal is magnetically actuated so as to move downward into sealing engagement with the threshold when the door is closed and raises out of engagement when the door is opened. A transmission assembly converts horizontal movement from the magnetic force into vertical movement for the seal. Springs provide a reset force when the magnetic force is eliminated so as to retract the seal strip whenever the door is moved from the closed position.

Abstract: Described are shape memory polymers and methods of making shape memory polymers and actuators from the shape memory polymers.

Abstract: Described are shape-memory polymers that have a composite prepolymer crosslinked with a stoichiometric amount of a multifunctional crosslinker, the composite prepolymer having a branched or telechelic prepolymer having a low polydispersity reacted with a non-crystalline chain extender. Also described are methods of making shape-memory polymers by reacting a branched or telechelic prepolymer having a low polydispersity with a non-crystalline chain extender to form a composite prepolymer, and crosslinking a stoichiometric amount of a multifunctional crosslinker with the composite prepolymer, thereby forming the shape-memory polymer.

Abstract: Described are shape-memory polymers that have a branched or telechelic prepolymer having a low polydispersity crosslinked with a stoichiometric amount of a multifunctional crosslinker. Also described are methods of making shape-memory polymers by crosslinking a stoichiometric amount of a multifunctional crosslinker with a branched or telechelic prepolymer having a low polydispersity. Methods of measuring the energy storage capacity of a shape-memory polymer are also disclosed.

Abstract: An automatic door seal is provided for sealing the gap between the lower edge of a door and a threshold. The seal is magnetically actuated so as to move downward into sealing engagement with the threshold when the door is closed and raises out of engagement when the door is opened. A transmission assembly converts horizontal movement from the magnetic force into vertical movement for the seal. Springs provide a reset force when the magnetic force is eliminated so as to retract the seal strip whenever the door is moved from the closed position.

Abstract: Described are shape memory polymers and methods of making shape memory polymers and actuators from the shape memory polymers.

Abstract: Described are shape memory polymers and methods of making shape memory polymers and actuators from the shape memory polymers.

Abstract: Systems and methods for the creation of hierarchical networks of overlapping informational web neighborhoods using percolation crawling. Each neighborhood comprises a set of closely linked pages that share a common set of concepts and intent and purpose. The neighborhoods represent web pages that share a common set of underlying concepts and semantic associations. Each such neighborhood can be semantically tagged.

Abstract: This disclosure relates to CB1 receptor antigen-binding proteins, e.g. antibodies and methods of using the CB1 receptor antibodies. The CB1 receptor antibodies may comprise an antagonistic antibody to CB1 receptors and may be used to treat various health conditions. The health conditions can comprise obesity or diabetes or any disease that benefits from antagonism of the CB1 receptor.

Abstract: Described are shape memory polymers and methods of making shape memory polymers and actuators from the shape memory polymers.

Abstract: Systems and methods for the creation of hierarchical networks of overlapping informational web neighborhoods using percolation crawling. Each neighborhood comprises a set of closely linked pages that share a common set of concepts and intent and purpose. The neighborhoods represent web pages that share a common set of underlying concepts and semantic associations. Each such neighborhood can be semantically tagged.

Abstract: Systems and methods are described that facilitate exploration and mining of a corpus of documents using concepts and knowledge, rather than keywords and enable interactive visualization, management, monetization, and personalization of knowledge search results on a user interface. Underlying documents can be mapped into overlapping clusters of knowledge dimensions and the documents can be further partitioned into narrower knowledge dimensions, resulting in a hierarchical structure. Content of knowledge dimensions may be filtered using a knowledge dimension map. Knowledge may be personalized by a user and shared in collaborative and social networks. Knowledge-based advertisement systems and methods are described that associate products and services with knowledge dimensions and concepts. Advertisers can bid on concepts and KDs. Systems and methods are described that distribute a percentage of CPC revenue among content owners and provide revenue to content providers based on relevancy scores.

Abstract: Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.

Abstract: Systems and methods are described for the creation of hierarchical networks of overlapping informational Web neighborhoods, where each neighborhood comprises a set of closely linked pages that share a common set of concepts and intent and purpose. A general description of a category of information can be used to generate a network of overlapping communities of web pages and objects, where the neighborhoods represent pages or objects that share a common set of underlying concepts and semantic associations. Each such neighborhood can be semantically tagged. Overlaps among neighborhoods and the hierarchical structure of the network capture complex relationships among the concepts that the corresponding informational neighborhoods represent. All informational neighborhoods of the web can be mapped. The systems and methods can be adapted for any digital content and constitute a hybrid network of contents and their relationships.

Abstract: Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.

Abstract: Comprehensive methods and systems are described for creating, managing, searching, personalizing, and monetizing a knowledge system defined over a corpus of digital content. Systems and methods are described in which a user can initiate in-depth searches of subject matter and can browse, navigate, pinpoint, and select relevant contexts, concepts, and documents to gain knowledge. Systems and methods are described in which knowledge can be personalized through tagged, personalized context, and personalized context can be shared within social and professional networks, securely and confidentially and with the desired access control. Systems and methods are described in which products and services can be advertised in context and advertising can be selected through a bidding process. Systems and methods are described by which a user can navigate contexts and concepts to obtain relevant information, products and services.

Abstract: Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.

Abstract: A data scrambling method for scrambling raw data from a host system is provided. The data scrambling method includes generating a random number and storing the random number into a storage unit. The data scrambling method also includes receiving a user password from the host system, generating a padded value by using a first function unit based on the random number and the user password, and generating a nonce value by using a second function unit based on the padded value and a key. The data scrambling method further includes generating scrambled data corresponding to the raw data by using a third function unit based on the nonce value and the raw data. Accordingly, the raw data of the host system can be effectively protected.