Automatic detection and classification of football players

Color segmentation of images usually requires a manual selection and classification of samples to train the system. This paper presents an automatic system that performs these tasks without the need of a long training, providing a useful tool to detect and identify figures. In real situations, it is necessary to repeat the training process if light conditions change, or if, in the same scenario, the colors of the figures and the background may have changed, being useful a fast training method. A direct application of this method is the detection and identification of football players.

A hardware solution on multi-field packet classification

In this paper, a hardware solution for packet classification based on multi-fields is presented. The proposed scheme focuses on a new architecture based on the decomposition method. A hash circuit is used in order to reduce the memory space required for the Recursive Flow Classification (RFC) algorithm. The implementation results show that the proposed architecture achieves significant performance advantage that is comparable to that of some well-known algorithms. The solution is based on Altera Stratix III FPGA technology.

Stereotypes of Age Differences in Personality Traits: Universal and Accurate?

Age trajectories for personality traits are known to be similar across cultures. To address whether stereotypes of age groups reflect these age-related changes in personality, we asked participants in 26 countries (N = 3,323) to rate typical adolescents, adults, and old persons in their own country. Raters across nations tended to share similar beliefs about different age groups; adolescents were seen as impulsive, rebellious, undisciplined, preferring excitement and novelty, whereas old people were consistently considered lower on impulsivity, activity, antagonism, and Openness. These consensual age group stereotypes correlated strongly with published age differences on the five major dimensions of personality and most of 30 specific traits, using as criteria of accuracy both self-reports and observer ratings, different survey methodologies, and data from up to 50 nations. However, personal stereotypes were considerably less accurate, and consensual stereotypes tended to exaggerate differences across age groups.

A universal measure of chaotropicity and kosmotropicity

Diverse parameters, including chaotropicity, can limit the function of cellular systems and thereby determine the extent of Earth's biosphere. Whereas parameters such as temperature, hydrophobicity, pressure, pH, Hofmeister effects, and water activity can be quantified via standard scales of measurement, the chao-/kosmotropic activities of environmentally ubiquitous substances have no widely accepted, universal scale. We developed an assay to determine and quantify chao-/kosmotropicity for 97 chemically diverse substances that can be universally applied to all solutes. This scale is numerically continuous for the solutes assayed (from +361kJkg^-1mol^-1 for chaotropes to -659kJkg^-1mol^-1 for kosmotropes) but there are key points that delineate (i) chaotropic from kosmotropic substances (i.e. chaotropes =+4; kosmotropes =-4kJkg^-1mol^-1); and (ii) chaotropic solutes that are readily water-soluble (log P<1.9) from hydrophobic substances that exert their chaotropic activity, by proxy, from within the hydrophobic domains of macromolecular systems (log P>1.9). Examples of chao-/kosmotropicity values are, for chaotropes: phenol +143, CaCl₂ +92.2, MgCl₂ +54.0, butanol +37.4, guanidine hydrochloride +31.9, urea +16.6, glycerol [>6.5M] +6.34, ethanol +5.93, fructose +4.56; for kosmotropes: proline -5.76, sucrose -6.92, dimethylsulphoxide (DMSO) -9.72, mannitol -6.69, trehalose -10.6, NaCl -11.0, glycine -14.2, ammonium sulfate -66.9, polyethylene glycol- (PEG-)1000 -126; and for relatively neutral solutes: methanol, +3.12, ethylene glycol +1.66, glucose +1.19, glycerol [<5M] +1.06, maltose -1.43 (kJkg^-1mol^-1). The data obtained correlate with solute interactions with, and structure-function changes in, enzymes and membranes. We discuss the implications for diverse fields including microbial ecology, biotechnology and astrobiology.

Gender Classification via Lips: Static and Dynamic Features

Automatic gender classification has many security and commercial applications. Various modalities have been investigated for gender classification with face-based classification being the most popular. In some real-world scenarios the face may be partially occluded. In these circumstances a classification based on individual parts of the face known as local features must be adopted. We investigate gender classification using lip movements. We show for the first time that important gender specific information can be obtained from the way in which a person moves their lips during speech. Furthermore our study indicates that the lip dynamics during speech provide greater gender discriminative information than simply lip appearance. We also show that the lip dynamics and appearance contain complementary gender information such that a model which captures both traits gives the highest overall classification result. We use Discrete Cosine Transform based features and Gaussian Mixture Modelling to model lip appearance and dynamics and employ the XM2VTS database for our experiments. Our experiments show that a model which captures lip dynamics along with appearance can improve gender classification rates by between 16-21% compared to models of only lip appearance.

Classification of fundus autofluorescence patterns in early age-related macular disease

PURPOSE. To describe and classify patterns of abnormal fundus autofluorescence (FAF) in eyes with early nonexudative age-related macular disease (AMD). METHODS. FAF images were recorded in eyes with early AMD by confocal scanning laser ophthalmoscopy (cSLO) with excitation at 488 nm (argon or OPSL laser) and emission above 500 or 521 nm (barrier filter). A standardized protocol for image acquisition and generation of mean images after automated alignment was applied, and routine fundus photographs were obtained. FAF images were classified by two independent observers. The ? statistic was applied to assess intra- and interobserver variability. RESULTS. Alterations in FAF were classified into eight phenotypic patterns including normal, minimal change, focal increased, patchy, linear, lacelike, reticular, and speckled. Areas with abnormal increased or decreased FAF signals may or may not have corresponded to funduscopically visible alterations. For intraobserver variability, ? of observer I was 0.80 (95% confidence interval [CI]0.71-0.89) and of observer II, 0.74. (95% CI, 0.64-0.84). For interobserver variability, ? was 0.77 (95% CI, 0.67-0.87). CONCLUSIONS. Various phenotypic patterns of abnormal FAF can be identified with cSLO imaging. Distinct patterns may reflect heterogeneity at a cellular and molecular level in contrast to a nonspecific aging process. The results indicate that the classification system yields a relatively high degree of intra- and interobserver agreement. It may be applicable for determination of novel prognostic determinants in longitudinal natural history studies, for identification of genetic risk factors, and for monitoring of future therapeutic interventions to slow the progression of early AMD. Copyright © Association for Research in Vision and Ophthalmology.

Iris cysts in children:Classification, incidence, and management. The 1998 Torrence A Makley Jr Lecture

Background - Iris cysts in children are uncommon and there is relatively little information on their classification, incidence, and management. Methods - The records of all children under age 20 years who were diagnosed with iris cyst were reviewed and the types and incidence of iris cysts of childhood determined. Based on these observations recommendations were made regarding management of iris cysts in children. Results - Of 57 iris cysts in children, 53 were primary and four were secondary. There were 44 primary cysts of the iris pigment epithelium, 34 of which were of the peripheral or iridociliary type, accounting for 59% of all childhood iris cysts. It was most commonly diagnosed in the teenage years, more common in girls (68%), was not recognised in infancy, remained stationary or regressed, and required no treatment. The five mid-zonal pigment epithelial cysts were diagnosed at a mean age of 14 years, were more common in boys (83%), remained stationary, and required no treatment. The pupillary type of pigment epithelial cyst was generally recognised in infancy and, despite involvement of the pupillary aperture, also required no treatment. There were nine cases of primary iris stromal cysts, accounting for 16% of all childhood iris cysts. This cyst was usually diagnosed in infancy, was generally progressive, and required treatment in eight of the nine cases, usually by aspiration and cryotherapy or surgical resection. Among the secondary iris cysts, two were post-traumatic epithelial ingrowth cysts and two were tumour induced cysts, one arising from an intraocular lacrimal gland choristoma and one adjacent to a peripheral iris naevus. Conclusions - Most iris cysts of childhood are primary pigment epithelial cysts and require no treatment. However, the iris stromal cyst, usually recognised in infancy, is generally an aggressive lesion that requires treatment by aspiration or surgical excision.

Universal behaviour of shock precursors in the presence of efficient cosmic ray acceleration

The self-consistent interaction between energetic particles and self-generated hydromagnetic waves in a cosmic ray pressure dominated plasma is considered. Using a three-dimensional hybrid magnetohydrodynamics (MHD)-kinetic code, which utilizes a spherical harmonic expansion of the Vlasov-Fokker-Planck equation, high-resolution simulations of the magnetic field growth including feedback on the cosmic rays are carried out. It is found that for shocks with high cosmic ray acceleration efficiency, the magnetic fields become highly disorganized, resulting in near isotropic diffusion, independent of the initial orientation of the ambient magnetic field. The possibility of sub-Bohm diffusion is demonstrated for parallel shocks, while the diffusion coefficient approaches the Bohm limit from below for oblique shocks. This universal behaviour suggests that Bohm diffusion in the root-mean-squared field inferred from observation may provide a realistic estimate for the maximum energy acceleration time-scale in young supernova remnants. Although disordered, the magnetic field is not self-similar suggesting a non-uniform energy-dependent behaviour of the energetic particle transport in the precursor. Possible indirect radiative signatures of cosmic ray driven magnetic field amplification are discussed.

Erythrocytosis in children and adolescents-classification, characterization, and consensus recommendations for the diagnostic approach

During recent years, the increasing knowledge of genetic and physiological changes in polycythemia vera (PV) and of different types of congenital erythrocytosis has led to fundamental changes in recommendations for the diagnostic approach to patients with erythrocytosis. Although widely accepted for adult patients this approach may not be appropriate with regard to children and adolescents affected by erythrocytosis. The "congenital erythrocytosis" working group established within the framework of the MPN&MPNr-EuroNet (COST action BM0902) addressed this question in a consensus finding process and developed a specific algorithm for the diagnosis of erythrocytosis in childhood and adolescence which is presented here. Pediatr Blood Cancer 2013;9999:XX-XX. © 2013 Wiley Periodicals, Inc.

Analysis of Bayesian classification-based approaches for Android malware detection

Mobile malware has been growing in scale and complexity spurred by the unabated uptake of smartphones worldwide. Android is fast becoming the most popular mobile platform resulting in sharp increase in malware targeting the platform. Additionally, Android malware is evolving rapidly to evade detection by traditional signature-based scanning. Despite current detection measures in place, timely discovery of new malware is still a critical issue. This calls for novel approaches to mitigate the growing threat of zero-day Android malware. Hence, the authors develop and analyse proactive machine-learning approaches based on Bayesian classification aimed at uncovering unknown Android malware via static analysis. The study, which is based on a large malware sample set of majority of the existing families, demonstrates detection capabilities with high accuracy. Empirical results and comparative analysis are presented offering useful insight towards development of effective static-analytic Bayesian classification-based solutions for detecting unknown Android malware.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.