Search results for "HM"
showing 10 items of 10594 documents
Overview on Sequential Mining Algorithms and Their Extensions
2018
The main purpose of data mining is to extract hidden, important and nontrivial information from a database. Sequential Pattern Mining is a data mining technique that aims to obtain and analyze frequent subsequences from sequences of events or items with or without time constraint. The importance of a sequence can be measured based on different factors such as the frequency of their occurrence, their length and also their profit. The pattern mining or the discovery of important and unexpected patterns and information was first introduced in 1990 with the well-known Apriori algorithm. Then, and after many studies on frequent pattern mining, a new approach appeared: Sequential Pattern Mining. …
Hop: Histogram of patterns for human action representation
2017
This paper presents a novel method for representing actions in terms of multinomial distributions of frequent sequential patterns of different length. Frequent sequential patterns are series of data descriptors that occur many times in the data. This paper proposes to learn a codebook of frequent sequential patterns by means of an apriori-like algorithm, and to represent an action with a Bag-of-Frequent-Sequential-Patterns approach. Preliminary experiments of the proposed method have been conducted for action classification on skeletal data. The method achieves state-of-the-art accuracy value in cross-subject validation.
The selection of aptamers specific for membrane molecular targets
2010
AbstractA growing number of RNA aptamers have been selected experimentally using the SELEX combinatorial approach, and these aptamers have several advantages over monoclonal protein antibodies or peptides with respect to their applications in medicine and nanobiotechnology. Relatively few successful selections have been reported for membrane molecular targets, in contrast to the situation with non-membrane molecular targets. This review compares the procedures and techniques used in selections against membrane proteins and membrane lipids. In the case of membrane proteins, the selections were performed against soluble protein fragments, detergent-membrane protein mixed micelles, whole cells…
Polycyclic aromatic hydrocarbons and trace metal contamination of coastal sediment and biota from Togo
2011
The state of contamination of tropical environments, particularly in Africa, remains a relatively under explored subject. Here, we determined polycyclic aromatic hydrocarbon (PAH) and trace metal concentrations in coastal sediment and biota samples (fish and mussels) from Togo (West Africa). In the sediments, the ∑21 PAH concentrations ranged from4 ng g(-1) to 257 ng g(-1), averaging 92 ng g(-1). Concentration ratios of low molecular weight PAHs (2-3 rings) versus high molecular weight PAHs (≥4 rings) were always lower than 1 (ranging from 0.08 to 0.46) indicating that high molecular weight PAHs were dominant in all sediment samples, and that PAHs originated mainly from anthropogenic combus…
Morphogenetic (Mucin Expression) as Well as Potential Anti-Corona Viral Activity of the Marine Secondary Metabolite Polyphosphate on A549 Cells
2020
The mucus layer of the nasopharynx and bronchial epithelium has a barrier function against inhaled pathogens such as the coronavirus SARS-CoV-2. We recently found that inorganic polyphosphate (polyP), a physiological, metabolic energy (ATP)-providing polymer released from blood platelets, blocks the binding of the receptor binding domain (RBD) to the cellular ACE2 receptor in vitro. PolyP is a marine natural product and is abundantly present in marine bacteria. Now, we have approached the in vivo situation by studying the effect of polyP on the human alveolar basal epithelial A549 cells in a mucus-like mucin environment. These cells express mucins as well as the ectoenzymes alkaline phospha…
External labeling and algorithms for hierarchic networks
1988
Algorithms for generating internal data structures for networks are given. Data bases for networks can be partitioned hierarchically. Nodes of lower class networks may also be in the interior of a higher class arc which will be split if it is included into the final network. Naming is based either on nodes or on arcs.
A comparison of two different formulations for Arc Routing Problems on Mixed graphs
2006
[EN] Arc routing problems on mixed graphs have been modelled in the literature either using just one variable per edge or associating to each edge two variables, each one representing its traversal in the corresponding direction. In this paper, and using the mixed general routing problem as an example, we compare theoretical and computationally both formulations as well as the lower bounds obtained from them using Linear Programming based methods. Extensive computational experiments, including some big and newly generated random instances, are presented.
New Heuristic Algorithms for the Windy Rural Postman Problem
2005
[EN] In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. (c) 2004 Elsevier Ltd. All rights reserved.
A branch-and-cut algorithm for the Profitable Windy Rural Postman Problem
2016
[EN] In this paper we study the profitable windy rural postman problem. This is an arc routing problem with profits defined on a windy graph in which there is a profit associated with some of the edges of the graph, consisting of finding a route maximizing the difference between the total profit collected and the total cost. This problem generalizes the rural postman problem and other well-known arc routing problems and has real-life applications, mainly in snow removal operations. We propose here a formulation for the problem and study its associated polyhedron. Several families of facet-inducing inequalities are described and used in the design of a branch-and-cut procedure. The algorithm…
The Windy clustered prize-collecting arc-routing problem
2011
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.