Morphometric shape analysis using learning vector quantization neural networks - an example distinguishing two microtine vole species

Closely related species may be very difficult to distinguish morphologically, yet sometimes morphology is the only reasonable possibility for taxonomic classification. Here we present learning-vector-quantization artificial neural networks as a powerful tool to classify specimens on the basis of geometric morphometric shape measurements. As an example, we trained a neural network to distinguish between field and root voles from Procrustes transformed landmark coordinates on the dorsal side of the skull, which is so similar in these two species that the human eye cannot make this distinction. Properly trained neural networks misclassified only 3% of specimens. Therefore, we conclude that the capacity of learning vector quantization neural networks to analyse spatial coordinates is a powerful tool among the range of pattern recognition procedures that is available to employ the information content of geometric morphometrics.

On circuit functionality in boolean networks.

It has been proved, for several classes of continuous and discrete dynamical systems, that the presence of a positive (resp. negative) circuit in the interaction graph of a system is a necessary condition for the presence of multiple stable states (resp. a cyclic attractor). A positive (resp. negative) circuit is said to be functional when it "generates" several stable states (resp. a cyclic attractor). However, there are no definite mathematical frameworks translating the underlying meaning of "generates." Focusing on Boolean networks, we recall and propose some definitions concerning the notion of functionality along with associated mathematical results.

Attentional networks efficiency in preterm children.

Recent studies have reported specific executive and attentional deficits in preterm children. However, the majority of this research has used multidetermined tasks to assess these abilities, and the interpretation of the results lacks an explicit theoretical backdrop to better understand the origin of the difficulties observed. In the present study, we used the Child Attention Network Task (Child ANT; Rueda et al. 2004) to assess the efficiency of the alerting, orienting and executive control networks. We compared the performance of 25 preterm children (gestational age < or = 32 weeks) to 25 full-term children, all between 5(1/2) and 6(1/2) years of age. Results showed that, as compared to full-term children, preterm children were slower on all conditions of the Child ANT and had a specific deficit in executive control abilities. We also observed a significantly higher correlation between the orienting and executive control networks in the preterm group, suggesting less differentiation of these two networks in this population.

Recent misconceptions about the "database search problem": a probabilistic analysis using Bayesian networks

This paper analyses and discusses arguments that emerge from a recent discussion about the proper assessment of the evidential value of correspondences observed between the characteristics of a crime stain and those of a sample from a suspect when (i) this latter individual is found as a result of a database search and (ii) remaining database members are excluded as potential sources (because of different analytical characteristics). Using a graphical probability approach (i.e., Bayesian networks), the paper here intends to clarify that there is no need to (i) introduce a correction factor equal to the size of the searched database (i.e., to reduce a likelihood ratio), nor to (ii) adopt a propositional level not directly related to the suspect matching the crime stain (i.e., a proposition of the kind 'some person in (outside) the database is the source of the crime stain' rather than 'the suspect (some other person) is the source of the crime stain'). The present research thus confirms existing literature on the topic that has repeatedly demonstrated that the latter two requirements (i) and (ii) should not be a cause of concern.

As Línguas de Cabo Verde: uma Radiografia Sociolinguística

Esta dissertação constitui um estudo de caso, exploratório e de carácter descritivo. Tem como objectivo fazer uma radiografia sociolinguística de Cabo Verde, particularmente centrada no actual uso das duas línguas faladas no arquipélago, o português (PCV) e o crioulo cabo-verdiano (LCV). A linha de pesquisa adoptada inspira-se fortemente nos estudos de macrosociolinguística, tomando a situação de contacto de línguas, caracterizadora da sociedade cabo-verdiana, como ponto de partida para o enquadramento de um conjunto de questões seleccionadas para investigação mais aprofundada. São, assim, explorados os processos implicados nesta situação de contacto concreta e os resultados linguísticos decorrentes da mesma, como o bilinguismo ou a diglossia (cf. Cap. 3). Recorrendo a contributos teóricos de áreas associadas e complementares (cf. Cap. 1), foca-se a importância da análise dos domínios em que cada uma das línguas é usada, das redes sociais dos falantes ou das suas atitudes linguísticas. A investigação partiu de uma recolha de dados realizada para o efeito, nas nove ilhas habitadas. As unidades de análise retidas correspondem a uma amostragem de dois grupos sociais distintos: falantes jovens, alunos do ensino secundário (inquiridos por questionário), e falantes adultos cuja profissão implica uma intensa actividade linguística (professores e ‘líderes’, inquiridos por entrevistas semi-dirigidas). Foi usada uma metodologia de recolha o mais rigorosa possível e adoptado o tratamento estatístico de dados (cf. Cap. 2). O confronto dos comportamentos linguísticos e das atitudes das duas gerações inquiridas, com diferentes características (cf. Introdução), forneceu importantes informações sobre a dinâmica linguística da sociedade cabo-verdiana, conclusões essas que serão importantes para a definição de orientações no âmbito da política linguística (cf. Cap. 5). É apresentada, como complemento, uma análise exploratória de alguns aspectos sintácticos atestados nas produções dos indivíduos inquiridos com instrução superior (cf. Cap. 4), um contributo, embora modesto, para a definição da variedade padrão do PCV

Autistic spectrum disorder: evaluating a possible contributing or causal role of epilepsy.

The onset of epilepsy in brain systems involved in social communication and/or recognition of emotions can occasionally be the cause of autistic symptoms or may aggravate preexisting autistic symptoms. Knowing that cognitive and/or behavioral abnormalities can be the presenting and sometimes the only symptom of an epileptic disorder or can even be caused by paroxysmal EEG abnormalities without recognized seizures, the possibility that this may apply to autism has given rise to much debate. Epilepsy and/or epileptic EEG abnormalities are frequently associated with autistic disorders in children but this does not necessarily imply that they are the cause; great caution needs to be exercised before drawing any such conclusions. So far, there is no evidence that typical autism can be attributed to an epileptic disorder, even in those children with a history of regression after normal early development. Nevertheless, there are several early epilepsies (late infantile spasms, partial complex epilepsies, epilepsies with CSWS, early forms of Landau-Kleffner syndrome) and with different etiologies (tuberous sclerosis is an important model of these situations) in which a direct relationship between epilepsy and some features of autism may be suspected. In young children who primarily have language regression (and who may have autistic features) without evident cause, and in whom paroxysmal focal EEG abnormalities are also found, the possible direct role of epilepsy can only be evaluated in longitudinal studies.

A simple access pricing rule to achieve the Ramsey outcome for interconnected networks

This paper considers a general and informationally efficient approach to determine the optimal access pricing rule for interconnected networks. It shows that there exists a simple rule that achieves the Ramsey outcome as the unique equilibrium when networks compete in linear prices without network-based price discrimination. The approach is informationally efficient in the sense that the regulator is required to know only the marginal cost structure, i.e. the marginal cost of making and terminating a call. The approach is general in that access prices can depend not only on the marginal costs but also on the retail prices, which can be observed by consumers and therefore by the regulator as well. In particular, I consider the set of linear access pricing rules which includes any fixed access price, the Efficient Component Pricing Rule (ECPR) and the Modified ECPR as special cases. I show that in this set, there is a unique rule that implements the Ramsey outcome as the unique equilibrium independently of the underlying demand conditions.

Bargaining on networks: An experiment

While markets are often decentralized, in many other cases agents in one role can only negotiate with a proper subset of the agents in the complementary role. There may be proximity issues or restricted communication flows. For example, information may be transmitted only through word-of-mouth, as is often the case for job openings, business opportunities, and confidential transactions. Bargaining can be considered to occur over a network that summarizes the structure of linkages among people. We conduct an alternating-offer bargaining experiment using separate simple networks, which are then joined during the session by an additional link. The results diverge sharply depending on how this connection is made. Payoffs can be systematically affected even for agents who are not connected by the new link. We use a graph-theoretic analysis to show that any two-sided network can be decomposed into simple networks of three types, so that our result can be generalized to more complex bargaining environments. Participants appear to grasp the essential characteristics of the networks and we observe a rather consistently high level of bargaining efficiency.

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.

Emergence of Cooperation on Static and Dynamic Networks

Game theory is a branch of applied mathematics used to analyze situation where two or more agents are interacting. Originally it was developed as a model for conflicts and collaborations between rational and intelligent individuals. Now it finds applications in social sciences, eco- nomics, biology (particularly evolutionary biology and ecology), engineering, political science, international relations, computer science, and philosophy. Networks are an abstract representation of interactions, dependencies or relationships. Net- works are extensively used in all the fields mentioned above and in many more. Many useful informations about a system can be discovered by analyzing the current state of a network representation of such system. In this work we will apply some of the methods of game theory to populations of agents that are interconnected. A population is in fact represented by a network of players where one can only interact with another if there is a connection between them. In the first part of this work we will show that the structure of the underlying network has a strong influence on the strategies that the players will decide to adopt to maximize their utility. We will then introduce a supplementary degree of freedom by allowing the structure of the population to be modified along the simulations. This modification allows the players to modify the structure of their environment to optimize the utility that they can obtain.

Causal assessment in finite extensive-form games

Two finite extensive-form games are empirically equivalent when theempirical distribution on action profiles generated by every behaviorstrategy in one can also be generated by an appropriately chosen behaviorstrategy in the other. This paper provides a characterization ofempirical equivalence. The central idea is to relate a game's informationstructure to the conditional independencies in the empirical distributionsit generates. We present a new analytical device, the influence opportunitydiagram of a game, describe how such a diagram is constructed for a givenextensive-form game, and demonstrate that it provides a complete summaryof the information needed to test empirical equivalence between two games.