Using patterns position distribution for software failure detection

Pattern-based software failure detection is an important topic of research in recent years. In this method, a set of patterns from program execution traces are extracted, and represented as features, while their occurrence frequencies are treated as the corresponding feature values. But this conventional method has its limitation due to ignore the pattern’s position information, which is important for the classification of program traces. Patterns occurs in the different positions of the trace are likely to represent different meanings. In this paper, we present a novel approach for using pattern’s position distribution as features to detect software failure. The comparative experiments in both artificial and real datasets show the effectiveness of this method

On scrimshaw precursors: a 13th-century carved and engraved sperm whale tooth

In der einschlägigen Forschung zur Walfängervolkskunst des "Scrimshaw" - den seit den 1820er Jahren populär gewordenen Seemannsarbeiten speziell auf und aus Pottwal- und Walroßzahn, Barten und Walknochen - werden künstlerisch bearbeitete Gegenstände anderer Kulturen aus denselben Materialien als "Scrimshaw"-Vorläufer bezeichnet. Aus dem europäischen Mittelalter sind zwar zahlreiche Beispiele von Schnitzereien aus Walroßzahn und Walknochen bekannt, nicht jedoch aus Pottwalzahn, dem beinah stereotypen Werkstoff der "Scrimshander" des 19. und 20. Jahrhunderts. Der "Königsspiegel", ein um 1250/60 in Norwegen geschriebener pädagogischer Text, erwähnt gleichwohl Schnitzereien aus Pottwalzahn. Auch aus dem 16. und 17. Jahrhundert sind textliche Hinweise auf skandinavisches Kunstgewerbe aus den Zähnen dieses Meeressäugers bekannt. Im Anschluß an die Präsentation dieser Quellen wird ein konkretes Beispiel vorgestellt: Es handelt sich um ein beschnitztes und graviertes Salbenhorn aus Pottwalzahn, das sich in der Sammlung christlicher Kunst und Kultur des Museums der Universität Bergen, Norwegen, lnv. MA 437, befindet. Aus dem massiven Dentin wurde ein Greif herausgeschnitzt, der Ausguß wurde wie der Kopf eines gotischen Wasserspeiers gestaltet. Auf einer glatten Seitenfläche wurde später ein kleines Tondo mit Pflanzen- und Vogelmotiv eingraviert. Es trägt eine Inschrift, die vom Bergenser Museum als griechisch, hier aber als russisch identifiziert wurde, deren Sinn aber unklar bleibt. Anlass, die vom Museum vorgenommene Datierung des Zahns in das 13. Jahrhundert zu revidieren, besteht allerdings nicht

On dualization in products of forests, in

Abstract. Let P = P1 ×...×Pn be the product of n partially ordered sets, each with an acyclic precedence graph in which either the in-degree or the out-degree of each element is bounded. Given a subset A⊆P,it is shown that the set of maximal independent elements of A in P can be incrementally generated in quasi-polynomial time. We discuss some applications in data mining related to this dualization problem

Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules

Association rules are among the most widely employed data analysis methods in the field of Data Mining. An association rule is a form of partial implication between two sets of binary variables. In the most common approach, association rules are parameterized by a lower bound on their confidence, which is the empirical conditional probability of their consequent given the antecedent, and/or by some other parameter bounds such as "support" or deviation from independence. We study here notions of redundancy among association rules from a fundamental perspective. We see each transaction in a dataset as an interpretation (or model) in the propositional logic sense, and consider existing notions of redundancy, that is, of logical entailment, among association rules, of the form "any dataset in which this first rule holds must obey also that second rule, therefore the second is redundant". We discuss several existing alternative definitions of redundancy between association rules and provide new characterizations and relationships among them. We show that the main alternatives we discuss correspond actually to just two variants, which differ in the treatment of full-confidence implications. For each of these two notions of redundancy, we provide a sound and complete deduction calculus, and we show how to construct complete bases (that is, axiomatizations) of absolutely minimum size in terms of the number of rules. We explore finally an approach to redundancy with respect to several association rules, and fully characterize its simplest case of two partial premises.Comment: LMCS accepted pape

An automatic critical care urine meter

Nowadays patients admitted to critical care units have most of their physiological parameters measured automatically by sophisticated commercial monitoring devices. More often than not, these devices supervise whether the values of the parameters they measure lie within a pre-established range, and issue warning of deviations from this range by triggering alarms. The automation of measuring and supervising tasks not only discharges the healthcare staff of a considerable workload but also avoids human errors in these repetitive and monotonous tasks. Arguably, the most relevant physiological parameter that is still measured and supervised manually by critical care unit staff is urine output (UO). In this paper we present a patent-pending device that provides continuous and accurate measurements of patient’s UO. The device uses capacitive sensors to take continuous measurements of the height of the column of liquid accumulated in two chambers that make up a plastic container. The first chamber, where the urine inputs, has a small volume. Once it has been filled it overflows into a second bigger chamber. The first chamber provides accurate UO measures of patients whose UO has to be closely supervised, while the second one avoids the need for frequent interventions by the nursing staff to empty the containe

Compressed Subsequence Matching and Packed Tree Coloring

We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\sigma$, our algorithm uses $O(n+\frac{n\sigma}{w})$ space and $O(n+\frac{n\sigma}{w}+m\log N\log w\cdot occ)$ or $O(n+\frac{n\sigma}{w}\log w+m\log N\cdot occ)$ time. Here $w$ is the word size and $occ$ is the number of occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for $occ=o(\frac{n}{\log N})$ occurrences. The algorithm uses a new data structure that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings.Comment: To appear at CPM '1

Особливості формування етнічного складу селянської верстви Степового Побужжя

In this short paper we sketch a brief introduction to our Krimp algorithm. Moreover, we briefly discuss some of the large body of follow up research. Pointers to the relevant papers are provided in the bibliography

Family and identity. Catholic and non-Catholic intermarriage: attitudes to children, identity and sharing household responsibilities

info:eu-repo/semantics/publishe