Twofold adaptive partition of unity implicits

Partition of Unity Implicits (PUI) has been recently introduced for surface reconstruction from point clouds. In this work, we propose a PUI method that employs a set of well-observed solutions in order to produce geometrically pleasant results without requiring time consuming or mathematically overloaded computations. One feature of our technique is the use of multivariate orthogonal polynomials in the least-squares approximation, which allows the recursive refinement of the local fittings in terms of the degree of the polynomial. However, since the use of high-order approximations based only on the number of available points is not reliable, we introduce the concept of coverage domain. In addition, the method relies on the use of an algebraically defined triangulation to handle two important tasks in PUI: the spatial decomposition and an adaptive polygonization. As the spatial subdivision is based on tetrahedra, the generated mesh may present poorly-shaped triangles that are improved in this work by means a specific vertex displacement technique. Furthermore, we also address sharp features and raw data treatment. A further contribution is based on the PUI locality property that leads to an intuitive scheme for improving or repairing the surface by means of editing local functions.

Multilevel Training of Binary Morphological Operators

The design of binary morphological operators that are translation-invariant and locally defined by a finite neighborhood window corresponds to the problem of designing Boolean functions. As in any supervised classification problem, morphological operators designed from a training sample also suffer from overfitting. Large neighborhood tends to lead to performance degradation of the designed operator. This work proposes a multilevel design approach to deal with the issue of designing large neighborhood-based operators. The main idea is inspired by stacked generalization (a multilevel classifier design approach) and consists of, at each training level, combining the outcomes of the previous level operators. The final operator is a multilevel operator that ultimately depends on a larger neighborhood than of the individual operators that have been combined. Experimental results show that two-level operators obtained by combining operators designed on subwindows of a large window consistently outperform the single-level operators designed on the full window. They also show that iterating two-level operators is an effective multilevel approach to obtain better results.

Spaces of compact operators on C(2(m) circle plus [0, alpha]) spaces

We classify up to isomorphism the spaces of compact operators K(E, F), where E and F are Banach spaces of all continuous functions defined on the compact spaces 2(m) circle plus [0, alpha], the topological sum of Cantor cubes 2(m) and the intervals of ordinal numbers [0, alpha]. More precisely, we prove that if 2(m) and aleph(gamma) are not real-valued measurable cardinals and n >= aleph(0) is not sequential cardinal, then for every ordinals xi, eta, lambda and mu with xi >= omega(1), eta >= omega(1), lambda = mu < omega or lambda, mu is an element of [omega(gamma), omega(gamma+1)[, the following statements are equivalent: (a) K(C(2(m) circle plus [0, lambda]), C(2(n) circle plus [0, xi])) and K(C(2(m) circle plus [0, mu]), C(2(n) circle plus [0, eta]) are isomorphic. (b) Either C([0, xi]) is isomorphic to C([0, eta] or C([0, xi]) is isomorphic to C([0, alpha p]) and C([0, eta]) is isomorphic to C([0,alpha q]) for some regular cardinal alpha and finite ordinals p not equal q. Thus, it is relatively consistent with ZFC that this result furnishes a complete isomorphic classification of these spaces of compact operators. (C) 2010 Elsevier Inc. All rights reserved.

A theoretical and mass spectrometry study of the fragmentation of mycosporine-like amino acids

In the present study, the mycosporine-like amino acids (MAAs) were isolated from the marine red alga Gracilaria tenuistipitata and analysed by high-resolution accurate-mass sequential mass spectrometry (MSn). In addition to the proposed fragmentation mechanism based on the MSn analysis, it is clearly demonstrated that the elimination of mass 15 is a radical processes taking place at the methoxyl substituent of the double bond. This characteristic loss of a methyl radical was studied by theoretical calculations and the homolytic cleavage of the O-C bond is suggested to be dependent on the bond weakening. The protonation site of the MAAs was indicated by analysis of the Fukui functions and the relative Gibbs energies of the several possible protonated forms. (C) 2008 Elsevier B.V. All rights reserved.

PokerMapper: : mapping executive functions, poker playing ability and responsible gambling in online environments

Research objectives Poker and responsible gambling both entail the use of the executive functions (EF), which are higher-level cognitive abilities. The main objective of this work was to assess if online poker players of different ability show different performances in their EF and if so, which functions are the most discriminating ones. The secondary objective was to assess if the EF performance can predict the quality of gambling, according to the Gambling Related Cognition Scale (GRCS), the South Oaks Gambling Screen (SOGS) and the Problem Gambling Severity Index (PGSI). Sample and methods The study design consisted of two stages: 46 Italian active players (41m, 5f; age 32±7,1ys; education 14,8±3ys) fulfilled the PGSI in a secure IT web system and uploaded their own hand history files, which were anonymized and then evaluated by two poker experts. 36 of these players (31m, 5f; age 33±7,3ys; education 15±3ys) accepted to take part in the second stage: the administration of an extensive neuropsychological test battery by a blinded trained professional. To answer the main research question we collected all final and intermediate scores of the EF tests on each player together with the scoring on the playing ability. To answer the secondary research question, we referred to GRCS, PGSI and SOGS scores.  We determined which variables that are good predictors of the playing ability score using statistical techniques able to deal with many regressors and few observations (LASSO, best subset algorithms and CART). In this context information criteria and cross-validation errors play a key role for the selection of the relevant regressors, while significance testing and goodness-of-fit measures can lead to wrong conclusions.   Preliminary findings We found significant predictors of the poker ability score in various tests. In particular, there are good predictors 1) in some Wisconsin Card Sorting Test items that measure flexibility in choosing strategy of problem-solving, strategic planning, modulating impulsive responding, goal setting and self-monitoring, 2) in those Cognitive Estimates Test variables related to deductive reasoning, problem solving, development of an appropriate strategy and self-monitoring, 3) in the Emotional Quotient Inventory Short (EQ-i:S) Stress Management score, composed by the Stress Tolerance and Impulse Control scores, and in the Interpersonal score (Empathy, Social Responsibility, Interpersonal Relationship). As for the quality of gambling, some EQ-i:S scales scores provide the best predictors: General Mood for the PGSI; Intrapersonal (Self-Regard; Emotional Self-Awareness, Assertiveness, Independence, Self-Actualization) and Adaptability  (Reality Testing, Flexibility, Problem Solving) for the SOGS, Adaptability for the GRCS. Implications for the field Through PokerMapper we gathered knowledge and evaluated the feasibility of the construction of short tasks/card games in online poker environments for profiling users’ executive functions. These card games will be part of an IT system able to dynamically profile EF and provide players with a feedback on their expected performance and ability to gamble responsibly in that particular moment. The implementation of such system in existing gambling platforms could lead to an effective proactive tool for supporting responsible gambling. 

Optimization Of Groundwater Remediation With New Efficient Parallel Algorithm For Global Optimization

Application of optimization algorithm to PDE modeling groundwater remediation can greatly reduce remediation cost. However, groundwater remediation analysis requires a computational expensive simulation, therefore, effective parallel optimization could potentially greatly reduce computational expense. The optimization algorithm used in this research is Parallel Stochastic radial basis function. This is designed for global optimization of computationally expensive functions with multiple local optima and it does not require derivatives. In each iteration of the algorithm, an RBF is updated based on all the evaluated points in order to approximate expensive function. Then the new RBF surface is used to generate the next set of points, which will be distributed to multiple processors for evaluation. The criteria of selection of next function evaluation points are estimated function value and distance from all the points known. Algorithms created for serial computing are not necessarily efficient in parallel so Parallel Stochastic RBF is different algorithm from its serial ancestor. The application for two Groundwater Superfund Remediation sites, Umatilla Chemical Depot, and Former Blaine Naval Ammunition Depot. In the study, the formulation adopted treats pumping rates as decision variables in order to remove plume of contaminated groundwater. Groundwater flow and contamination transport is simulated with MODFLOW-MT3DMS. For both problems, computation takes a large amount of CPU time, especially for Blaine problem, which requires nearly fifty minutes for a simulation for a single set of decision variables. Thus, efficient algorithm and powerful computing resource are essential in both cases. The results are discussed in terms of parallel computing metrics i.e. speedup and efficiency. We find that with use of up to 24 parallel processors, the results of the parallel Stochastic RBF algorithm are excellent with speed up efficiencies close to or exceeding 100%.

Nonparametric entropy-based tests of independence between stochastic processes

This paper develops nonparametric tests of independence between two stationary stochastic processes. The testing strategy boils down to gauging the closeness between the joint and the product of the marginal stationary densities. For that purpose, I take advantage of a generalized entropic measure so as to build a class of nonparametric tests of independence. Asymptotic normality and local power are derived using the functional delta method for kernels, whereas finite sample properties are investigated through Monte Carlo simulations.

On the nature of income inequality across nations

In this paper, we investigate the nature of income inequality across nations. First, rather than functional forms or parameter values in calibration exercises that can potentially drives results, we estimate, test, and distinguish between types of aggregate production functions currently used in the growth literature. Next, given our panel-regression estimates, we perform several exercises, such as variance decompositions, simulations and counter-factual analyses. The picture that emerges is one where countries grew in the past for different reasons, which should be an important ingredient in policy design. Although there is not a single-factor explanation for the difference in output per-worker across nations, inequality, followed by distortions to capital accumulations and them by human capital accumulation.

Optimal IV estimation of systems with stochastic regressors and var disturbances with applications to dynamic systems

This paper considers the general problem of Feasible Generalized Least Squares Instrumental Variables (FG LS IV) estimation using optimal instruments. First we summarize the sufficient conditions for the FG LS IV estimator to be asymptotic ally equivalent to an optimal G LS IV estimator. Then we specialize to stationary dynamic systems with stationary VAR errors, and use the sufficient conditions to derive new moment conditions for these models. These moment conditions produce useful IVs from the lagged endogenous variables, despite the correlation between errors and endogenous variables. This use of the information contained in the lagged endogenous variables expands the class of IV estimators under consideration and there by potentially improves both asymptotic and small-sample efficiency of the optimal IV estimator in the class. Some Monte Carlo experiments compare the new methods with those of Hatanaka [1976]. For the DG P used in the Monte Carlo experiments, asymptotic efficiency is strictly improved by the new IVs, and experimental small-sample efficiency is improved as well.

Operational functions for innovative startups in France

Nessa tese, é buscado um maior entendimento sobre a importância das funções operacionais nas startups francesas. Uma grande flexibilidade das tarefas a ser coberta e uma gestão horizontal caracterizam as startups. Desse jeito, não é muito comum para as empresas recentemente criadas como as startups ter uma politica clara de recursos humanos. Na verdade, cada participante na start-up pode ser levado a pensar de forma diferente em termos de vendas desenvolvimento de negócios, comercialização, marketing, tecnologia ou desenvolvimento de produto. Essa tese não vai explorar cada uma dessas tarefas. Mas vai procurar para identifcar a percepção sobre a alocação ótima de recursos para cada função chave da nova empresa. Qualquer seja o setor de mercado em consideração ou o estágio de amadurecimento da startup, funções chaves que são percebidas como sendo a base para start-ups bem sucedidas são pesquisa & desenvolvimento e comercialização. Funções de liderança não são tão importantes. Somente a startup focada na tecnologia tem uma "função de chefe executivo" com maior importância do que as startups médias. Além disso, empreendedores em série, bem sucedidos ou não, focam predominantemente aspectos relacionados ao marketing e à captação de recursos em detrimento de aspectos ligados à gestão do negócio. No final, os empresários, muitas vezes tem um preconceito ao respeito da sua formação acadêmica porque ele sobrestimam funções que eles pensam poder fazer em comparação das funções que eles são capazes de fazer. Nessa tese, intent-se demonstrar a relação entre as funções ocupadas por um sócio e as ações que ele possui na startup. Essa relação depende do número de sócios (conhecido como acionistas), o tipo de sócios (acionistas principais ou acionistas segundarias) e o impacto na administração corporativa a respeito da distribuição do capital próprio.

Convergence analysis of sampling-based decomposition methods for risk-averse multistage stochastic convex programs

We consider a class of sampling-based decomposition methods to solve risk-averse multistage stochastic convex programs. We prove a formula for the computation of the cuts necessary to build the outer linearizations of the recourse functions. This formula can be used to obtain an efficient implementation of Stochastic Dual Dynamic Programming applied to convex nonlinear problems. We prove the almost sure convergence of these decomposition methods when the relatively complete recourse assumption holds. We also prove the almost sure convergence of these algorithms when applied to risk-averse multistage stochastic linear programs that do not satisfy the relatively complete recourse assumption. The analysis is first done assuming the underlying stochastic process is interstage independent and discrete, with a finite set of possible realizations at each stage. We then indicate two ways of extending the methods and convergence analysis to the case when the process is interstage dependent.

On theory multiple contraction

The one which is considered the standard model of theory change was presented in [AGM85] and is known as the AGM model. In particular, that paper introduced the class of partial meet contractions. In subsequent works several alternative constructive models for that same class of functions were presented, e.g.: safe/kernel contractions ([AM85, Han94]), system of spheres-based contractions ([Gro88]) and epistemic entrenchment-based contractions ([G ar88, GM88]). Besides, several generalizations of such model were investigated. In that regard we emphasise the presentation of models which accounted for contractions by sets of sentences rather than only by a single sentence, i.e. multiple contractions. However, until now, only two of the above mentioned models have been generalized in the sense of addressing the case of contractions by sets of sentences: The partial meet multiple contractions were presented in [Han89, FH94], while the kernel multiple contractions were introduced in [FSS03]. In this thesis we propose two new constructive models of multiple contraction functions, namely the system of spheres-based and the epistemic entrenchment-based multiple contractions which generalize the models of system of spheres-based and of epistemic entrenchment-based contractions, respectively, to the case of contractions (of theories) by sets of sentences. Furthermore, analogously to what is the case in what concerns the corresponding classes of contraction functions by one single sentence, those two classes are identical and constitute a subclass of the class of partial meet multiple contractions. Additionally, and as the rst step of the procedure that is here followed to obtain an adequate de nition for the system of spheres-based multiple contractions, we present a possible worlds semantics for the partial meet multiple contractions analogous to the one proposed in [Gro88] for the partial meet contractions (by one single sentence). Finally, we present yet an axiomatic characterization for the new class(es) of multiple contraction functions that are here introduced.

Study of postures in sugarcane cutters in the Pontal of Paranapanema-SP, Brazil

The expansion of sugarcane monoculture in Brazil in the last decades has pointed out to the necessity of considering the question of sugarcane cutters occupational health. In this work we present a cross-sectional study aiming to examine the occupational posture of a group of sugarcane cutters, which work in a cane field located in the region of Pontal do Paranapanema-SP, Brazil. The study was made using the Ergonomic Analysis of Work - EAW methodology and the postural analysis method by Win-OWAS. Through the obtained records of postures, it was observed that during a workday the sugarcane cutters remain standing erect on two legs or in one leg 66% of the time and that their trunk remain tilted and in rotation, according to 63% of the positions categorized. It was also observed that the sugarcane cutter trunk performs repetitive and boundless movements during his routine of work, which can expose this individual to additional wear of their musculoskeletal functions. The activities in which the individual engages have favorable or adverse influence on his posture. The repetitive movements involved in specialized occupations are equivalent to repeated exercises, thus may be responsible for the excessive development of certain muscle groups. The study suggests that the postures adopted by sugarcane cutters can overload their musculoskeletal system and predispose the cutters to work-related musculoskeletal diseases.

Human face verification based on multidimensional Polynomial Powers of Sigmoid (PPS)

In this paper, we described how a multidimensional wavelet neural networks based on Polynomial Powers of Sigmoid (PPS) can be constructed, trained and applied in image processing tasks. In this sense, a novel and uniform framework for face verification is presented. The framework is based on a family of PPS wavelets,generated from linear combination of the sigmoid functions, and can be considered appearance based in that features are extracted from the face image. The feature vectors are then subjected to subspace projection of PPS-wavelet. The design of PPS-wavelet neural networks is also discussed, which is seldom reported in the literature. The Stirling Universitys face database were used to generate the results. Our method has achieved 92 % of correct detection and 5 % of false detection rate on the database.

Bloch-Kohn and Wannier-Kohn functions in one dimension

Bloch and Wannier functions of the Kohn type for a quite general one-dimensional Hamiltonian with inversion symmetry are studied. Important clarifications on null minigaps and the symmetry of those functions are given, with emphasis on the Kronig-Penney model. The lack of a general selection rule on the miniband index for optical transitions between edge states in semiconductor superlattices is discussed. A direct method for the calculation of Wannier-Kohn functions is presented.