Biclustering meets triadic concept analysis

Biclustering numerical data became a popular data-mining task at the beginning of 2000’s, especially for gene expression data analysis and recommender systems. A bicluster reflects a strong association between a subset of objects and a subset of attributes in a numerical object/attribute data-table. So-called biclusters of similar values can be thought as maximal sub-tables with close values. Only few methods address a complete, correct and non-redundant enumeration of such patterns, a well-known intractable problem, while no formal framework exists. We introduce important links between biclustering and Formal Concept Analysis (FCA). Indeed, FCA is known to be, among others, a methodology for biclustering binary data. Handling numerical data is not direct, and we argue that Triadic Concept Analysis (TCA), the extension of FCA to ternary relations, provides a powerful mathematical and algorithmic framework for biclustering numerical data. We discuss hence both theoretical and computational aspects on biclustering numerical data with triadic concept analysis. These results also scale to n-dimensional numerical datasets.     

Preoperative anxiety and fear: a comparison of assessments by patients and anesthesia and surgery residents

We sought to compare self-assessment of preoperative anxiety levels and selection of worst fears by surgical patients with the assessments made by the anesthesia and surgery residents providing intraoperative care for those patients. One hundred inpatients at a Veterans Affairs hospital (Group 1) and 45 patients at a University hospital (Group 2) were asked to complete a brief questionnaire; the residents were asked to complete the same questionnaire. Group 1 results showed that median patient visual analog scale (VAS) scores were lower for anxiety about anesthesia compared to surgery (16 vs 22, P < or = 0.05). Anesthesia resident VAS scores were higher than patient or surgery resident scores. Neither type of resident was able to predict their individual patient's VAS score (Kendall's tau). The fear chosen with the greatest incidence by Group 1 patients and residents was "whether surgery would work". A significant number of residents (34%, anesthesia or surgery, P < or = 0.05) matched their patient's fear choice. Residents commonly chose fears related to their specialty (e.g., anesthesia residents chose anesthesia-related fears more often than surgery residents, 50% vs 28%, P < or = 0.001). In Group 2, residents demonstrated an improved ability to predict patient scores. For instance, both surgery and anesthesia residents were able to predict individual University patient VAS scores (P < or = 0.01). The fear chosen with the greatest frequency by Group 2 patients was "pain after the operation". Sixty percent of anesthesia residents matched their patients' fear choice (P < or = 0.001). This study indicates a variable ability of anesthesia and surgery residents to predict patient anxiety and fear which may be due, in part, to difficulty in understanding a Veterans Affairs hospital patient population.     

On the Power of Las Vegas for One-Way Communication Complexity, OBDDs, and Finite Automata

The study of the computational power of randomized computations is one of the central tasks of complexity theory. The main goal of this paper is the comparison of the power of Las Vegas computation and deterministic respectively nondeterministic computation. We investigate the power of Las Vegas computation for the complexity measures of one-way communication, ordered binary decision diagrams, and finite automata.(i) For the one-way communication complexity of two-party protocols we show that Las Vegas communication can save at most one half of the deterministic one-way communication complexity. We also present a language for which this gap is tight.(ii) The result (i) is applied to show an at most polynomial gap between determinism and Las Vegas for ordered binary decision diagrams.(iii) For the size (i.e., the number of states) of finite automata we show that the size of Las Vegas finite automata recognizing a language L is at least the square root of the size of the minimal deterministic finite automaton recognizing L. Using a specific language we verify the optimality of this lower bound.     

NMR study on reaction processes from aluminum chloride hydroxides to alpha alumina powders

Starting from gelatinous aluminum chloride hydroxide, the transformation process toward α-Al₂O₃ was examined using ²⁷Al NMR, both in the liquid and solid states, as a main analytical tool. By increasing the hydrolysis ratio (h, defined as [OH⁻]/[Al³⁺]) of the starting aqueous precursor up to h = 2.5, the transition temperature to the final product, α-Al₂O₃, decreased to as low as 500°C. In this case, the structural change from amorphous alumina to α-Al₂O₃ took place without intermediate transition Al₂O₃ phases. Examining the process of networking during the transition from aqueous sol–through the state of xerogel–to final anhydrous oxide by nuclear magnetic resonance (NMR) revealed the presence of highly polymeric species mainly ascribed to δ-[Al₂O₈Al₂₈(OH)₅₆(H₂O)₂₄]¹⁸⁺ (δ-Al₃₀). δ-Al₃₀ species were found in the solution phase and became predominant after drying. We conclude that the lower temperature synthesis of α-Al₂O₃ became possible due to preformation of polymerized AlO₆ construction units in the precursor, reducing the energy barrier for the nucleation of the final α-Al₂O₃ phase.     

Molecular characterization of statistical copolymers: 1. Potential and limitations of full adsorption–desorption procedure in separation of statistical copolymers

Dynamic integral desorption isotherms for a series of poly(methyl methacrylate) homopolymers and poly(methyl methacrylate)–polystyrene statistical copolymers were measured. Nonporous silica was the full adsorption–desorption (FAD) column packing and various adsorption‐promoting and desorption‐promoting liquids were used. The aim of this study was to evaluate the applicability of the FAD approach for separation of statistical copolymers. The effects of the adsorbing liquid and desorbing liquid nature were demonstrated on the positions and shapes of desorption isotherms. The desorption isotherms also strongly depended on both (co)polymer molar mass and copolymer chemical composition. This indicates large fractionation potential of the FAD procedure. Simultaneously, the interference of both above parameters prevents the direct use of FAD for fractionation of the copolymers. It is anticipated that the fractionation and/or reconcentration potential of the FAD procedure can be very effectively utilized in combination of FAD with size‐exclusion chromatography and/or with gradient elution liquid adsorption chromatography. © 2000 John Wiley & Sons, Inc. J Appl Polym Sci 75: 857–864, 2000     

The Power of Nondeterminism and Randomness for Oblivious Branching Programs

Abstract. This paper abstracts and generalizes the known approaches for proving lower bounds on the size of various variants of oblivious branching programs (oblivious BPs for short), providing an easy-to-use technique which works for all nondeterministic and randomized modes of acceptance. The technique is applied to obtain the following results concerning the power of nondeterminism and randomness for oblivious BPs: <p>— Oblivious read-once BPs, better known as OBDDs (ordered binary decision diagrams), are used in many applications and their structure is well understood in the deterministic case. It has been open so far to compare the power of nondeterministic OBDDs with so-called partitioned BDDs which are a variant of nondeterministic branching programs also used in practice. A k -partitioned BDD has a nondeterministic node at the top by which one out of k deterministic OBDDs with possibly different variable orders is chosen. It is proven here that the two models are incomparable as long as k is bounded by a logarithmic function in the input length. <p>— It is shown that deterministic oblivious read-k -times BPs for an explicitly defined function require superpolynomial size, for k logarithmic in the input length, while there are Las Vegas oblivious read-twice BPs of linear size for this function. This is in contrast to the situation for OBDDs, for which the respective size measures are polynomially related. <p>— Furthermore, an explicitly defined function is presented for which randomized oblivious read-k -times BPs with bounded error require exponential size, while the function as well as its complement can be represented in polynomial size by nondeterministic oblivious read-k -times BPs and deterministic oblivious read-(k+1) -times BPs, where k=o(log n) .     

Sketching human character animations by composing sequences from large motion database

Quick creation of 3D character animations is an important task in game design, simulations, forensic animation, education, training, and more. We present a framework for creating 3D animated characters using a simple sketching interface coupled with a large, unannotated motion database that is used to find the appropriate motion sequences corresponding to the input sketches. Contrary to the previous work that deals with static sketches, our input sketches can be enhanced by motion and rotation curves that improve matching in the context of the existing animation sequences. Our framework uses animated sequences as the basic building blocks of the final animated scenes, and allows for various operations with them such as trimming, resampling, or connecting by use of blending and interpolation. A database of significant and unique poses, together with a two-pass search running on the GPU, allows for interactive matching even for large amounts of poses in a template database. The system provides intuitive interfaces, an immediate feedback, and poses very small requirements on the user. A user study showed that the system can be used by novice users with no animation experience or artistic talent, as well as by users with an animation background. Both groups were able to create animated scenes consisting of complex and varied actions in less than 20 minutes.