Minimal Subspaces with Maximal Dimensioanal Diameters

Владимир Тодоров - Нека X е компактно метрично пространство с dim X = n. Тогава за n − 1 - мерния диаметър dn−1(X) на X е изпълнено неравенството dn−1(X) > 0, докато dn(X) = 0 (да отбележим, че това е една от характеристиките на размерността на Лебег). От тук се получава, че X съдържа минимално по включване затворено подмножество Y , за което dn−1(Y ) = dn−1(X). Известен резултат е, че от това следва, че Y е Канторово Многообразие. В тази бележка доказваме, че всяко такова (минимално) подпространство Y е даже континуум V^n. Получени са също така някои следствия.

On Optimal Quadratic Lagrange Interpolation: Extremal Node Systems with Minimal Lebesgue Constant via Symbolic Computation

ACM Computing Classification System (1998): G.1.1, G.1.2.

A template for externalisation-internalisation decisions in virtual enterprises

Recognising the importance of alliance decision making in a virtual enterprise (VE), this paper proposes an analysis template to facilitate this process. The existing transaction-cost and resource-based theories in the literature are first reviewed, showing some deficiencies in both type of theories, and the potential of the resource based explanations. The paper then goes on to propose a resource-based analysis template, integrating both the motives of using certain business forms and the factors why different forms help achieve different objectives, Resource-combination effectiveness, management complexity and flexibility are identified as the three factors providing fundamental explanations of an organization's alliance making decision process. The template provides a comprehensive and generic approach for analysing alliance decisions.

A template model predicts detection of sparse stimul

Contemporary models of contrast integration across space assume that pooling operates uniformly over the target region. For sparse stimuli, where high contrast regions are separated by areas containing no signal, this strategy may be sub-optimal because it pools more noise than signal as area increases. Little is known about the behaviour of human observers for detecting such stimuli. We performed an experiment in which three observers detected regular textures of various areas, and six levels of sparseness. Stimuli were regular grids of horizontal grating micropatches, each 1 cycle wide. We varied the ratio of signals (marks) to gaps (spaces), with mark:space ratios ranging from 1 : 0 (a dense texture with no spaces) to 1 : 24. To compensate for the decline in sensitivity with increasing distance from fixation, we adjusted the stimulus contrast as a function of eccentricity based on previous measurements [Baldwin, Meese & Baker, 2012, J Vis, 12(11):23]. We used the resulting area summation functions and psychometric slopes to test several filter-based models of signal combination. A MAX model failed to predict the thresholds, but did a good job on the slopes. Blanket summation of stimulus energy improved the threshold fit, but did not predict an observed slope increase with mark:space ratio. Our best model used a template matched to the sparseness of the stimulus, and pooled the squared contrast signal over space. Templates for regular patterns have also recently been proposed to explain the regular appearance of slightly irregular textures (Morgan et al, 2012, Proc R Soc B, 279, 2754–2760)

Synthesis of highly efficient and recyclable visible-light responsive mesoporous g-C3N4 photocatalyst via facile template-free sonochemical route

Herein we demonstrate a facile template-free sonochemical strategy to synthesize mesoporous g-C3N4 with a high surface area and enhanced photocatalytic activity. The TEM and nitrogen adsorption–desorption studies confirm mesoporous structure in g-C3N4 body. The photocatalytic activity of mesoporous g-C3N4 is almost 5.5 times higher than that of bulk g-C3N4 under visible-light irradiation. The high photocatalytic performance of the mesoporous g-C3N4 was attributed to the much higher specific surface area, efficient adsorption ability and the unique interfacial mesoporous structure which can favour the absorption of light and separation of photoinduced electron–hole pairs more effectively. A possible photocatalytic mechanism was discussed by the radicals and holes trapping experiments. Interestingly, the synthesized mesoporous g-C3N4 possesses high reusability. Hence the mesoporous g-C3N4 can be a promising photocatalytic material for practical applications in water splitting as well as environmental remediation.

Template-free and eco-friendly synthesis of hierarchical Ag3PO4 microcrystals with sharp corners and edges for enhanced photocatalytic activity under visible light

Herein, we demonstrate a template-free and eco-friendly strategy to synthesize hierarchical Ag3PO4 microcrystals with sharp corners and edges via silver–ammine complex at room temperature. The as-synthesized hierarchical Ag3PO4 microcrystals were characterized by X-ray diffraction, field-emission scanning electron microscope (FESEM), UV–vis diffuse reflectance spectroscopy (UV–vis DRS), BET surface area analyzer, and photoluminescence analysis (PL). Our results clearly indicated that the as-synthesized Ag3PO4 microcrystals possess a hierarchical structure with sharp corners and edges. More attractively, the adsorption ability and visible light photocatalytic activity of the as-synthesized hierarchical Ag3PO4 is much higher than that of conventional Ag3PO4.

Modifying the hierarchical porosity of SBA-15 via mild-detemplation followed by secondary treatments

Fenton-chemistry-based detemplation combined with secondary treatments offers options to tune the hierarchical porosity of SBA-15. This approach has been studied on a series of SBA-15 mesophases and has been compared to the conventional calcination. The as-synthesized and detemplated materials were studied with regard to their template content (TGA, CHN), structure (SAXS, TEM), surface hydroxylation (Blin-Carterets approach), and texture (high-resolution argon physisorption). Fenton detemplation achieves 99% of template removal, leading to highly hydroxylated materials. The structure is better preserved when a secondary treatment is applied after the Fenton oxidation, due to the intense capillary forces during drying in water. Two successful approaches are presented: drying in a low-surface-tension solvent (such as n-BuOH) and a hydrothermal stabilization to further condense the structure and make it structurally more robust. Both approaches give rise to remarkably low structural shrinkage, lower than calcination and the direct water-dried Fenton. Interestingly, the derived textural features are remarkably different. The n-BuOH exchange route gives rise to highly hierarchical structures with enhanced interconnecting pores and the highest surface areas. The hydrothermal stabilization produces large-pore SBA-15 structures with high pore volume, intermediate interconnectivity, and minimal micropores. Therefore, the hierarchical texture can be fine-tuned in these two fashions while the template is removed under mild conditions.

Handwritten and machine-printed text discrimination using a template matching approach

We propose a novel template matching approach for the discrimination of handwritten and machine-printed text. We first pre-process the scanned document images by performing denoising, circles/lines exclusion and word-block level segmentation. We then align and match characters in a flexible sized gallery with the segmented regions, using parallelised normalised cross-correlation. The experimental results over the Pattern Recognition & Image Analysis Research Lab-Natural History Museum (PRImA-NHM) dataset show remarkably high robustness of the algorithm in classifying cluttered, occluded and noisy samples, in addition to those with significant high missing data. The algorithm, which gives 84.0% classification rate with false positive rate 0.16 over the dataset, does not require training samples and generates compelling results as opposed to the training-based approaches, which have used the same benchmark.

Web-based report generators, data visualization, and Web-to-database connectivity

Because some Web users will be able to design a template to visualize information from scratch, while other users need to automatically visualize information by changing some parameters, providing different levels of customization of the information is a desirable goal. Our system allows the automatic generation of visualizations given the semantics of the data, and the static or pre-specified visualization by creating an interface language. We address information visualization taking into consideration the Web, where the presentation of the retrieved information is a challenge. ^ We provide a model to narrow the gap between the user's way of expressing queries and database manipulation languages (SQL) without changing the system itself thus improving the query specification process. We develop a Web interface model that is integrated with the HTML language to create a powerful language that facilitates the construction of Web-based database reports. ^ As opposed to other papers, this model offers a new way of exploring databases focusing on providing Web connectivity to databases with minimal or no result buffering, formatting, or extra programming. We describe how to easily connect the database to the Web. In addition, we offer an enhanced way on viewing and exploring the contents of a database, allowing users to customize their views depending on the contents and the structure of the data. Current database front-ends typically attempt to display the database objects in a flat view making it difficult for users to grasp the contents and the structure of their result. Our model narrows the gap between databases and the Web. ^ The overall objective of this research is to construct a model that accesses different databases easily across the net and generates SQL, forms, and reports across all platforms without requiring the developer to code a complex application. This increases the speed of development. In addition, using only the Web browsers, the end-user can retrieve data from databases remotely to make necessary modifications and manipulations of data using the Web formatted forms and reports, independent of the platform, without having to open different applications, or learn to use anything but their Web browser. We introduce a strategic method to generate and construct SQL queries, enabling inexperienced users that are not well exposed to the SQL world to build syntactically and semantically a valid SQL query and to understand the retrieved data. The generated SQL query will be validated against the database schema to ensure harmless and efficient SQL execution. (Abstract shortened by UMI.)^

Algebraic theory of minimal nondeterministic finite automata with applications

Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, respectively) has been a cornerstone of theoretical computer science. In this dissertation, our main object of study is minimal NFAs. In contrast with minimal DFAs, minimal NFAs are computationally challenging: first, there can be more than one minimal NFA recognizing a given language; second, the problem of converting an NFA to a minimal equivalent NFA is NP-hard, even for NFAs over a unary alphabet. Our study is based on the development of two main theories, inductive bases and partials, which in combination form the foundation for an incremental algorithm, ibas, to find minimal NFAs. An inductive basis is a collection of languages with the property that it can generate (through union) each of the left quotients of its elements. We prove a fundamental characterization theorem which says that a language can be recognized by an n-state NFA if and only if it can be generated by an n-element inductive basis. A partial is an incompletely-specified language. We say that an NFA recognizes a partial if its language extends the partial, meaning that the NFA’s behavior is unconstrained on unspecified strings; it follows that a minimal NFA for a partial is also minimal for its language. We therefore direct our attention to minimal NFAs recognizing a given partial. Combining inductive bases and partials, we generalize our characterization theorem, showing that a partial can be recognized by an n-state NFA if and only if it can be generated by an n-element partial inductive basis. We apply our theory to develop and implement ibas, an incremental algorithm that finds minimal partial inductive bases generating a given partial. In the case of unary languages, ibas can often find minimal NFAs of up to 10 states in about an hour of computing time; with brute-force search this would require many trillions of years.

Thermal imaging as a biometrics approach to facial signature authentication

This dissertation develops an image processing framework with unique feature extraction and similarity measurements for human face recognition in the thermal mid-wave infrared portion of the electromagnetic spectrum. The goals of this research is to design specialized algorithms that would extract facial vasculature information, create a thermal facial signature and identify the individual. The objective is to use such findings in support of a biometrics system for human identification with a high degree of accuracy and a high degree of reliability. This last assertion is due to the minimal to no risk for potential alteration of the intrinsic physiological characteristics seen through thermal infrared imaging. The proposed thermal facial signature recognition is fully integrated and consolidates the main and critical steps of feature extraction, registration, matching through similarity measures, and validation through testing our algorithm on a database, referred to as C-X1, provided by the Computer Vision Research Laboratory at the University of Notre Dame. Feature extraction was accomplished by first registering the infrared images to a reference image using the functional MRI of the Brain’s (FMRIB’s) Linear Image Registration Tool (FLIRT) modified to suit thermal infrared images. This was followed by segmentation of the facial region using an advanced localized contouring algorithm applied on anisotropically diffused thermal images. Thermal feature extraction from facial images was attained by performing morphological operations such as opening and top-hat segmentation to yield thermal signatures for each subject. Four thermal images taken over a period of six months were used to generate thermal signatures and a thermal template for each subject, the thermal template contains only the most prevalent and consistent features. Finally a similarity measure technique was used to match signatures to templates and the Principal Component Analysis (PCA) was used to validate the results of the matching process. Thirteen subjects were used for testing the developed technique on an in-house thermal imaging system. The matching using an Euclidean-based similarity measure showed 88% accuracy in the case of skeletonized signatures and templates, we obtained 90% accuracy for anisotropically diffused signatures and templates. We also employed the Manhattan-based similarity measure and obtained an accuracy of 90.39% for skeletonized and diffused templates and signatures. It was found that an average 18.9% improvement in the similarity measure was obtained when using diffused templates. The Euclidean- and Manhattan-based similarity measure was also applied to skeletonized signatures and templates of 25 subjects in the C-X1 database. The highly accurate results obtained in the matching process along with the generalized design process clearly demonstrate the ability of the thermal infrared system to be used on other thermal imaging based systems and related databases. A novel user-initialization registration of thermal facial images has been successfully implemented. Furthermore, the novel approach at developing a thermal signature template using four images taken at various times ensured that unforeseen changes in the vasculature did not affect the biometric matching process as it relied on consistent thermal features.

A Minimal History of the Cuban Revolution (Historia mínima de Ia Revolución Cubana), Book Presentation by Author Rafael Rojas

This flyer promotes the event "A Minimal History of the Cuban Revolution (Historia mínima de Ia Revolución Cubana), Book Presentation by Author Rafael Rojas", part at the SIPA at Books & Books series. This event held at Books & Books in Coral Gables.

Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications

Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, respectively) has been a cornerstone of theoretical computer science. In this dissertation, our main object of study is minimal NFAs. In contrast with minimal DFAs, minimal NFAs are computationally challenging: first, there can be more than one minimal NFA recognizing a given language; second, the problem of converting an NFA to a minimal equivalent NFA is NP-hard, even for NFAs over a unary alphabet. Our study is based on the development of two main theories, inductive bases and partials, which in combination form the foundation for an incremental algorithm, ibas, to find minimal NFAs. An inductive basis is a collection of languages with the property that it can generate (through union) each of the left quotients of its elements. We prove a fundamental characterization theorem which says that a language can be recognized by an n-state NFA if and only if it can be generated by an n-element inductive basis. A partial is an incompletely-specified language. We say that an NFA recognizes a partial if its language extends the partial, meaning that the NFA's behavior is unconstrained on unspecified strings; it follows that a minimal NFA for a partial is also minimal for its language. We therefore direct our attention to minimal NFAs recognizing a given partial. Combining inductive bases and partials, we generalize our characterization theorem, showing that a partial can be recognized by an n-state NFA if and only if it can be generated by an n-element partial inductive basis. We apply our theory to develop and implement ibas, an incremental algorithm that finds minimal partial inductive bases generating a given partial. In the case of unary languages, ibas can often find minimal NFAs of up to 10 states in about an hour of computing time; with brute-force search this would require many trillions of years.

Fragilariopsis kerguelensis images from sediment core PS1768-8

Background: Light microscopic analysis of diatom frustules is widely used both in basic and applied research, notably taxonomy, morphometrics, water quality monitoring and paleo-environmental studies. In these applications, usually large numbers of frustules need to be identified and / or measured. Although there is a need for automation in these applications, and image processing and analysis methods supporting these tasks have previously been developed, they did not become widespread in diatom analysis. While methodological reports for a wide variety of methods for image segmentation, diatom identification and feature extraction are available, no single implementation combining a subset of these into a readily applicable workflow accessible to diatomists exists. Results: The newly developed tool SHERPA offers a versatile image processing workflow focused on the identification and measurement of object outlines, handling all steps from image segmentation over object identification to feature extraction, and providing interactive functions for reviewing and revising results. Special attention was given to ease of use, applicability to a broad range of data and problems, and supporting high throughput analyses with minimal manual intervention. Conclusions: Tested with several diatom datasets from different sources and of various compositions, SHERPA proved its ability to successfully analyze large amounts of diatom micrographs depicting a broad range of species. SHERPA is unique in combining the following features: application of multiple segmentation methods and selection of the one giving the best result for each individual object; identification of shapes of interest based on outline matching against a template library; quality scoring and ranking of resulting outlines supporting quick quality checking; extraction of a wide range of outline shape descriptors widely used in diatom studies and elsewhere; minimizing the need for, but enabling manual quality control and corrections. Although primarily developed for analyzing images of diatom valves originating from automated microscopy, SHERPA can also be useful for other object detection, segmentation and outline-based identification problems.

Distinguishing tectonically-and gravity-driven synsedimentary deformation structures along the Apulian platform margin (Gargano Promontory, southern Italy)

Acknowledgements This work has been supported by Reservoir Characterisation Project (www.rechproject.com) and FAR Project 2014 "Characterisation and modelling of natural reservoirs of geofluids in fractured carbonate rocks", funded by the University of Camerino, coordinator Emanuele Tondi.