Study of 3d - 4f and 3d - 5f quartet and doublet transitions of doubly excited three-electron ions

We present the first observation of optical transitions between doubly excited doublet states in the term systems N V, 0 VI and F VII. The spectra were produced by foil excitation of fast ion beams. The assignment of the spectral lines was made by comparison with the results of MCDP calculations along the isoelectronic sequence. The same method also led to the identification of two 3d - 4f quartet transitions in Mg X.

Auger transitions in Li-like and Be-like ions

Measurements of the Auger decay of beam-foil excited Be II and Be I levels are reported along with a proposed assignment of the experimental spectra. The Li I, Be II and Be III (1s 2s^2) ^2 S \rightarrow (1s^2 2s)^2 S Auger transitions as presented in this letter represents the first observation of such states in positive ions with Z \le 5.

Transitions between quintet states of doubly excited four-electron ions

Following an earlier observation in F VI we identified the line pair 1s2s2p^2 {^5P}-1s2s2p3d {^5P^0} , {^5D^0} for the elements N, O, Mg, and tentatively for A1 and Si in beam-foil spectra. Assignment was established by comparison with Multi-Configuration Dirac-Fock calculations along the isoelectronic sequence. Using this method we also identified some quartet lines of lithium-like ions with Z > 10.

Global Optimization Algorithms and their Application to Distributed Systems

In this report, we discuss the application of global optimization and Evolutionary Computation to distributed systems. We therefore selected and classified many publications, giving an insight into the wide variety of optimization problems which arise in distributed systems. Some interesting approaches from different areas will be discussed in greater detail with the use of illustrative examples.

Generalization over contrast and mirror reversal, but not figure-ground reversal, in an "edge-based

Baylis & Driver (Nature Neuroscience, 2001) have recently presented data on the response of neurons in macaque inferotemporal cortex (IT) to various stimulus transformations. They report that neurons can generalize over contrast and mirror reversal, but not over figure-ground reversal. This finding is taken to demonstrate that ``the selectivity of IT neurons is not determined simply by the distinctive contours in a display, contrary to simple edge-based models of shape recognition'', citing our recently presented model of object recognition in cortex (Riesenhuber & Poggio, Nature Neuroscience, 1999). In this memo, I show that the main effects of the experiment can be obtained by performing the appropriate simulations in our simple feedforward model. This suggests for IT cell tuning that the possible contributions of explicit edge assignment processes postulated in (Baylis & Driver, 2001) might be smaller than expected.

The Benefits of Re-Evaluating Real-Time Fulfillment Decisions

At the time of a customer order, the e-tailer assigns the order to one or more of its order fulfillment centers, and/or to drop shippers, so as to minimize procurement and transportation costs, based on the available current information. However this assignment is necessarily myopic as it cannot account for all future events, such as subsequent customer orders or inventory replenishments. We examine the potential benefits from periodically re-evaluating these real-time order-assignment decisions. We construct near-optimal heuristics for the re-assignment for a large set of customer orders with the objective to minimize the total number of shipments. We investigate how best to implement these heuristics for a rolling horizon, and discuss the effect of demand correlation, customer order size, and the number of customer orders on the nature of the heuristics. Finally, we present potential saving opportunities by testing the heuristics on sets of order data from a major e-tailer.

Quantifying rock fabrics: a test of autocorrelation of the spatial distribution of cristals

A novel test of spatial independence of the distribution of crystals or phases in rocks based on compositional statistics is introduced. It improves and generalizes the common joins-count statistics known from map analysis in geographic information systems. Assigning phases independently to objects in RD is modelled by a single-trial multinomial random function Z(x), where the probabilities of phases add to one and are explicitly modelled as compositions in the K-part simplex SK. Thus, apparent inconsistencies of the tests based on the conventional joins{count statistics and their possibly contradictory interpretations are avoided. In practical applications we assume that the probabilities of phases do not depend on the location but are identical everywhere in the domain of de nition. Thus, the model involves the sum of r independent identical multinomial distributed 1-trial random variables which is an r-trial multinomial distributed random variable. The probabilities of the distribution of the r counts can be considered as a composition in the Q-part simplex SQ. They span the so called Hardy-Weinberg manifold H that is proved to be a K-1-affine subspace of SQ. This is a generalisation of the well-known Hardy-Weinberg law of genetics. If the assignment of phases accounts for some kind of spatial dependence, then the r-trial probabilities do not remain on H. This suggests the use of the Aitchison distance between observed probabilities to H to test dependence. Moreover, when there is a spatial uctuation of the multinomial probabilities, the observed r-trial probabilities move on H. This shift can be used as to check for these uctuations. A practical procedure and an algorithm to perform the test have been developed. Some cases applied to simulated and real data are presented. Key words: Spatial distribution of crystals in rocks, spatial distribution of phases, joins-count statistics, multinomial distribution, Hardy-Weinberg law, Hardy-Weinberg manifold, Aitchison geometry

Protección constitucional del derecho a la educación y responsabilidad estatal por falla en el servicio de la educación

La educación está definida por la Constitución Política como derecho y como servicio público con función social. A su vez, para lograr este cometido se la ha definido como política pública, es decir, de máximo interés para el Estado. No obstante, lo plasmado en norma y programas no corresponde con la realidad. Aún hay actuaciones de la administración que vulneran el derecho a la educación por deficiencias en la prestación del servicio público educativo. De ahí el interés legítimo que tiene la colectividad para exigir de la administración, mediante las acciones populares, que se garantice la prestación del servicio público de la educación en las mejores condiciones posibles. La educación como servicio público es un derecho colectivo, y la comunidad puede exigir que se garantice su prestación adecuadamente, pues en la medida en que haya más personas bien educadas, ello redunda en beneficio de la sociedad y del Estado.

G+: Enhanced Traffic Grooming in WDM Mesh Networks using Lighttours

In this article, a new technique for grooming low-speed traffic demands into high-speed optical routes is proposed. This enhancement allows a transparent wavelength-routing switch (WRS) to aggregate traffic en route over existing optical routes without incurring expensive optical-electrical-optical (OEO) conversions. This implies that: a) an optical route may be considered as having more than one ingress node (all inline) and, b) traffic demands can partially use optical routes to reach their destination. The proposed optical routes are named "lighttours" since the traffic originating from different sources can be forwarded together in a single optical route, i.e., as taking a "tour" over different sources towards the same destination. The possibility of creating lighttours is the consequence of a novel WRS architecture proposed in this article, named "enhanced grooming" (G+). The ability to groom more traffic in the middle of a lighttour is achieved with the support of a simple optical device named lambda-monitor (previously introduced in the RingO project). In this article, we present the new WRS architecture and its advantages. To compare the advantages of lighttours with respect to classical lightpaths, an integer linear programming (ILP) model is proposed for the well-known multilayer problem: traffic grooming, routing and wavelength assignment The ILP model may be used for several objectives. However, this article focuses on two objectives: maximizing the network throughput, and minimizing the number of optical-electro-optical conversions used. Experiments show that G+ can route all the traffic using only half of the total OEO conversions needed by classical grooming. An heuristic is also proposed, aiming at achieving near optimal results in polynomial time

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 6: Network Evolution and Process

In this class, we will discuss the nature of network evolution and some selected network processes. We will discuss graph generation algorithms that generate networks with different interesting characteristics. Optional : The Structure and Function of Complex Networks (chapter 8), M.E.J. Newman, SIAM Review 45 167--256 (2003); Optional: Emergence of Scaling in Random Networks, A.L. Barabasi and R. Albert, Science 286, 509 (1999)

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 3: Network Theory and Terminology

In this class, we will discuss network theory fundamentals, including concepts such as diameter, distance, clustering coefficient and others. We will also discuss different types of networks, such as scale-free networks, random networks etc. Readings: Graph structure in the Web, A. Broder and R. Kumar and F. Maghoul and P. Raghavan and S. Rajagopalan and R. Stata and A. Tomkins and J. Wiener Computer Networks 33 309--320 (2000) [Web link, Alternative Link] Optional: The Structure and Function of Complex Networks, M.E.J. Newman, SIAM Review 45 167--256 (2003) [Web link] Original course at: http://kmi.tugraz.at/staff/markus/courses/SS2008/707.000_web-science/

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 1

In this class, we will discuss the course organization and provide a basic motivation for and introduction to the course. Readings: Web science: a provocative invitation to computer science, B. Shneiderman, Communications of the ACM 50 25--27 (2007) [Web link] Readings: Chapter 1 & 2, A Framework for Web Science, T. Berners-Lee and W. Hall and J. A. Hendler and K. O'Hara and N. Shadbolt and D. J. Weitzner Foundations and Trends® in Web Science 1 (2006) [Web link] Originally from: http://kmi.tugraz.at/staff/markus/courses/SS2008/707.000_web-science/

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 4: Social Network Analysis

What are fundamental entities in social networks and what information is contained in social graphs? We will discuss some selected concepts in social network analysis, such as one- and two mode networks, prestige and centrality, and cliques, clans and clubs. Readings: Web tool predicts election results and stock prices, J. Palmer, New Scientist, 07 February (2008) [Protected Access] Optional: Social Network Analysis, Methods and Applications, S. Wasserman and K. Faust (1994)

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 7: Link Analysis and Search

What are ways of searching in graphs? In this class, we will discuss basics of link analysis, including Google's PageRank algorithm as an example. Readings: The PageRank Citation Ranking: Bringing Order to the Web, L. Page and S. Brin and R. Motwani and T. Winograd (1998) Stanford Tecnical Report

TU Graz: Course: 707.000 Web Science and Web Technology: Lecture 8: Web Technologies 1

This class focuses on a selected subset of web technologies that are of interest to the topics of this course. Readings: Chapter 5 "Representational State Transfer (REST)", in "Architectural Styles and the Design of Network-based Software Architecture", Roy Fielding, Dissertation, University of California Irvine, 2000 Optional: Chapter "Representational State Transfer (REST)" in "Pro PHP XML and Web Services", R. Richards 633--672, 2006