Dead-End Jobs or Career Opportunities? Advancement opportunities in call centers

Employment in call centers has grown significantly throughout the world over the past 15 years. In debates about the quality of these new jobs, there are few studies that specifically address promotion opportunities. Using a survey of over 2400 call centers in 16 countries, this paper documents levels and analyzes factors shaping promotions in call centers, and discusses implications for promotions in the service sector generally. On average, less than 10% of call center agents are promoted in any year--5.7% promoted internally to the call center, and 4% promoted elsewhere in the business. Firms that have more complex labor processes and require agents to have higher levels of firm-specific knowledge tend to also have greater promotion opportunities, which might be expected. There are also unexpected findings, including that increased autonomy in the workplace often provides a ‘substitute' to advancement opportunities, and that unionization is associated with fewer advancement opportunities within call centers, though more advancement opportunities to other parts of the business. Key words: promotions, service industries, call centers.

Five years of sleep apnea treatment with a mandibular advancement device. Side effects and technical complications

Objective: To determine the variation in prevalence of temporomandibular disorders (TMD), other side effects, and technical complications during 5 years of sleep apnea treatment with a mandibular advancement device. Materials and Methods: Forty patients diagnosed with obstructive sleep apnea received an adjustable appliance at 70% of the maximum protrusion. The protrusion was then progressively increased. TMD (diagnosed according to the Research Diagnostic Criteria for TMD), overjet, overbite, occlusal contacts, subjective side effects, and technical complications were recorded before and a mean of 14, 21, and 58 months after treatment and analyzed by the Wilcoxon test (P Less-than .05). Results: Fifteen patients still used the oral appliance at the 5-year follow-up, and no significant variation in TMD prevalence was observed. Subjective side effects were common, and a significant reduction was found in overjet, overbite, and in the number of occlusal contacts. Furthermore, the patients made a mean of 2.5 unscheduled dental visits per year and a mean of 0.8 appliance repairs/relines per year by a dental technician. The most frequent unscheduled visits were needed during the first year and were a result of acrylic breakage on the lateral telescopic attachment, poor retention, and other adjustments to improve comfort. Conclusions: Five-year oral appliance treatment does not affect TMD prevalence but is associated with permanent occlusal changes in most sleep apnea patients during the first 2 years. Patients seek several unscheduled visits, mainly because of technical complications.

How to improve the formal analytic reasoning and scientific motivation in the intellectual training of medical students

A review article of the The New England Journal of Medicine refers that almost a century ago, Abraham Flexner, a research scholar at the Carnegie Foundation for the Advancement of Teaching, undertook an assessment of medical education in 155 medical schools in operation in the United States and Canada. Flexner’s report emphasized the nonscientific approach of American medical schools to preparation for the profession, which contrasted with the university-based system of medical education in Germany. At the core of Flexner’s view was the notion that formal analytic reasoning, the kind of thinking integral to the natural sciences, should hold pride of place in the intellectual training of physicians. This idea was pioneered at Harvard University, the University of Michigan, and the University of Pennsylvania in the 1880s, but was most fully expressed in the educational program at Johns Hopkins University, which Flexner regarded as the ideal for medical education. (...)

A semantic model of selective dissemination of information for digital libraries

In this paper we present the theoretical and methodologicalfoundations for the development of a multi-agentSelective Dissemination of Information (SDI) servicemodel that applies Semantic Web technologies for specializeddigital libraries. These technologies make possibleachieving more efficient information management,improving agent–user communication processes, andfacilitating accurate access to relevant resources. Othertools used are fuzzy linguistic modelling techniques(which make possible easing the interaction betweenusers and system) and natural language processing(NLP) techniques for semiautomatic thesaurus generation.Also, RSS feeds are used as “current awareness bulletins”to generate personalized bibliographic alerts.

Goal recognition over POMDPs: inferring the intention of a POMDP agent

Plan recognition is the problem of inferring the goals and plans of an agent from partial observations of her behavior. Recently, it has been shown that the problem can be formulated and solved usingplanners, reducing plan recognition to plan generation.In this work, we extend this model-basedapproach to plan recognition to the POMDP setting, where actions are stochastic and states are partially observable. The task is to infer a probability distribution over the possible goals of an agent whose behavior results from a POMDP model. The POMDP model is shared between agent and observer except for the true goal of the agent that is hidden to the observer. The observations are action sequences O that may contain gaps as some or even most of the actions done by the agent may not be observed. We show that the posterior goal distribution P(GjO) can be computed from the value function VG(b) over beliefs b generated by the POMDPplanner for each possible goal G. Some extensionsof the basic framework are discussed, and a numberof experiments are reported.

Computing infinite plans for LTL goals using a classical planner

Classical planning has been notably successful in synthesizing finite plans to achieve states where propositional goals hold. In the last few years, classical planning has also been extended to incorporate temporally extended goals, expressed in temporal logics such as LTL, to impose restrictions on the state sequences generated by finite plans. In this work, we take the next step and consider the computation of infinite plans for achieving arbitrary LTL goals. We show that infinite plans can also be obtained efficiently by calling a classical planner once over a classical planning encoding that represents and extends the composition of the planningdomain and the B¨uchi automaton representingthe goal. This compilation scheme has been implemented and a number of experiments are reported.

Variable Very-High-Energy Gamma-Ray Emission from the Microquasar LS I +61 303

Microquasars are binary star systems with relativistic radio-emitting jets. They are potential sources of cosmic rays and can be used to elucidate the physics of relativistic jets. We report the detection of variable gamma-ray emission above 100 gigaelectron volts from the microquasar LS I 61 + 303. Six orbital cycles were recorded. Several detections occur at a similar orbital phase, which suggests that the emission is periodic. The strongest gamma-ray emission is not observed when the two stars are closest to one another, implying a strong orbital modulation of the emission or absorption processes.

mGPT: a probabilistic planner based on heuristic search

We describe the version of the GPT planner to be used in the planning competition. This version, called mGPT, solves mdps specified in the ppddllanguage by extracting and using different classes of lower bounds, along with various heuristic-search algorithms. The lower bounds are extracted from deterministic relaxations of the mdp where alternativeprobabilistic effects of an action are mapped into different, independent, deterministic actions. The heuristic-search algorithms, on the other hand, use these lower bounds for focusing the updates and delivering a consistent value function over all states reachable from the initial state with the greedy policy.

Planning under partial observability by classical replanning: theory and experiments

Planning with partial observability can be formulated as a non-deterministic search problem in belief space. The problem is harder than classical planning as keeping track of beliefs is harder than keeping track of states, and searching for action policies is harder than searching for action sequences. In this work, we develop a framework for partial observability that avoids these limitations and leads to a planner that scales up to larger problems. For this, the class of problems is restricted to those in which 1) the non-unary clauses representing the uncertainty about the initial situation are nvariant, and 2) variables that are hidden in the initial situation do not appear in the body of conditional effects, which are all assumed to be deterministic. We show that such problems can be translated in linear time into equivalent fully observable non-deterministic planning problems, and that an slight extension of this translation renders the problem solvable by means of classical planners. The whole approach is sound and complete provided that in addition, the state-space is connected. Experiments are also reported.

IAMG - Asociación Internacional para las Geociencias Matemáticas

We introduce the International Association for Mathematical Geosciences (IAMG) from its origins to the present and summarize the means by which is fulfilling its mission. The IAMG was set up in Prague in 1968 with the intention of “promoting throughout the world the advancement of mathematics, statistics and informatics in the Geosciences”. It is a non-profit organisation that includes among its members researchers, teachers, professionals and students dedicated to mathematical and statistical Applications in all branches of the earth sciences. The IAMG publishes three major journals and a newsletter and organises a yearly conference, whist at the same time supporting many others. It bestows 4 biannual prizes that recognise outstanding achievements in its field, organises a distinguished lecturer series, and encourages Young researchers by providing Student research and travel funds and promoting Student societies. The IAMG celebrated its 40tn anniversary in Oslo, Norway, in 2008 and continues to be a venue for a vast array of researchers in this broad field by providing a common driving force for their activities

The impact of balancing on problem hardness in a highly structured domain

Random problem distributions have played a key role in the study and design of algorithms for constraint satisfaction and Boolean satisfiability, as well as in ourunderstanding of problem hardness, beyond standard worst-case complexity. We consider random problem distributions from a highly structured problem domain that generalizes the Quasigroup Completion problem (QCP) and Quasigroup with Holes (QWH), a widely used domain that captures the structure underlying a range of real-world applications. Our problem domain is also a generalization of the well-known Sudoku puz- zle: we consider Sudoku instances of arbitrary order, with the additional generalization that the block regions can have rectangular shape, in addition to the standard square shape. We evaluate the computational hardness of Generalized Sudoku instances, for different parameter settings. Our experimental hardness results show that we can generate instances that are considerably harder than QCP/QWH instances of the same size. More interestingly, we show the impact of different balancing strategies on problem hardness. We also provide insights into backbone variables in Generalized Sudoku instances and how they correlate to problem hardness.

On balanced CSPs with high treewidth

Tractable cases of the binary CSP are mainly divided in two classes: constraint language restrictions and constraint graph restrictions. To better understand and identify the hardest binary CSPs, in this work we propose methods to increase their hardness by increasing the balance of both the constraint language and the constraint graph. The balance of a constraint is increased by maximizing the number of domain elements with the same number of occurrences. The balance of the graph is defined using the classical definition from graph the- ory. In this sense we present two graph models; a first graph model that increases the balance of a graph maximizing the number of vertices with the same degree, and a second one that additionally increases the girth of the graph, because a high girth implies a high treewidth, an important parameter for binary CSPs hardness. Our results show that our more balanced graph models and constraints result in harder instances when compared to typical random binary CSP instances, by several orders of magnitude. Also we detect, at least for sparse constraint graphs, a higher treewidth for our graph models.

Generating hard SAT/CSP instances using expander graphs

In this paper we provide a new method to generate hard k-SAT instances. We incrementally construct a high girth bipartite incidence graph of the k-SAT instance. Having high girth assures high expansion for the graph, and high expansion implies high resolution width. We have extended this approach to generate hard n-ary CSP instances and we have also adapted this idea to increase the expansion of the system of linear equations used to generate XORSAT instances, being able to produce harder satisfiable instances than former generators.

Very-High-Energy gamma rays from a Distant Quasar: How Transparent Is the Universe?

The atmospheric Cherenkov gamma-ray telescope MAGIC, designed for a low-energy threshold, has detected very-high-energy gamma rays from a giant flare of the distant Quasi-Stellar Radio Source (in short: radio quasar) 3C 279, at a distance of more than 5 billion light-years (a redshift of 0.536). No quasar has been observed previously in very-high-energy gamma radiation, and this is also the most distant object detected emitting gamma rays above 50 gigaelectron volts. Because high-energy gamma rays may be stopped by interacting with the diffuse background light in the universe, the observations by MAGIC imply a low amount for such light, consistent with that known from galaxy counts.

INASP: la hora del protagonismo local en la cooperación al desarrollo científico y bibliotecario

La International Network for the Availability of Scientific Publications (INASP) es una ONG de cooperación al desarrollo, que persigue la mejora del acceso, producción y uso de la información científica, de forma que cada país cuente con recursos en este ámbito para afrontar sus propios retos de desarrollo. Surgió en 1992 por iniciativa del ICSU (International Council of Scientific Unions, actualmente International Council for Science) y contó con el apoyo de UNESCO, TWAS-The Academy of Sciences for the Developing World y AAAS (American Association for the Advancement of Science).