A detailed review of the education sector in Australia as in the data provided by the 2006 edition of the OECD's annual publication, 'Education at a Glance' is presented. While the data has shown that in almost all OECD countries educational attainment levels are on the rise, with countries showing impressive gains in university qualifications, it also reveals that a large of share of young people still do not complete secondary school, which remains a baseline for successful entry into the labour market.

/pdf/education-at-a-glance-m5vl7o68j5.pdf

Education at a Glance

The ubiquity of communication devices such as smartphones has led to the emergence of context-aware services that are able to respond to specific user activities or contexts. These services allow communication providers to develop new, added-value services for a wide range of applications such as social networking, elderly care and near-emergency early warning systems. At the core of these services is the ability to detect specific physical settings or the context a user is in, using either internal or external sensors. For example, using built-in accelerometers, it is possible to determine whether a user is walking or running at a specific time of day. By correlating this knowledge with GPS data, it is possible to provide specific information services to users with similar daily routines. This article presents a survey of the techniques for extracting this activity information from raw accelerometer data. The techniques that can be implemented in mobile devices range from classical signal processing techniques such as FFT to contemporary string-based methods. We present experimental results to compare and evaluate the accuracy of the various techniques using real data sets collected from daily activities.

/pdf/preprocessing-techniques-for-context-recognition-from-3o0k2lk1mr.pdf

Preprocessing techniques for context recognition from accelerometer data

As rates of new coronavirus disease 2019 (COVID-19) cases decline across Europe owing to nonpharmaceutical interventions such as social distancing policies and lockdown measures, countries require guidance on how to ease restrictions while minimizing the risk of resurgent outbreaks. We use mobility and case data to quantify how coordinated exit strategies could delay continental resurgence and limit community transmission of COVID-19. We find that a resurgent continental epidemic could occur as many as 5 weeks earlier when well-connected countries with stringent existing interventions end their interventions prematurely. Further, we find that appropriate coordination can greatly improve the likelihood of eliminating community transmission throughout Europe. In particular, synchronizing intermittent lockdowns across Europe means that half as many lockdown periods would be required to end continent-wide community transmission.

https://science.sciencemag.org/content/sci/369/6510/1465.full.pdf

Assessing the impact of coordinated COVID-19 exit strategies across Europe

On Parallel Algorithms of some Orthogonal Transforms (S.S. Agaian and D.Z. Gevorkian). An Efficient Algorithm for Finding Peripheral Nodes (I. Arany). Computational Aspects of Assigning Characteristic Semigroup of Asynchronous Automata and Their Extensions (S. Bocian and B. Mikolajczak). Reichenbach's Propositional Logic in Algorithmic Form (P. Borowik). The Complexity of Weighted Multi-Constrained Spanning Tree Problems (P. Camerini, G. Galbiati and F. Maffioli). An Algorithm for Finding SC-Preimages of a Deterministic Finite Automaton (K. Chmiel). On Entropy Decomposition Methods and Algorithm Design (Th. Fischer). An Efficient Algorithm for Dynamic String-Storage Allocation (D. Fox). Covering Intervals with Intervals under Containment Constraints (M.R. Garey and R.Y. Pinter). How to Construct Random Functions (O. Goldreich, S. Goldwasser and S. Micali). Four Pebbles Don't Suffice to Search Planar Infinite Labyrinths (F. Hoffmann). Parallel Algorithms: The Impact of Communication Complexity (F. Hossfeld). Tight Worst-Case Bounds for Bin-Packing Algorithms (A. Ivanyi). Hypergraph Planarity and the Complexity of Drawing Venn Diagrams (D.S. Johnson and H.O. Pollak). Convolutional Charaterization of Computability and Complexity of Computations (S. Jukna). Succinct Data Representations and the Complexity of Computations (S. Jukna). Lattices, Basis Reduction and the Shortest Vector Problem (R. Kannan). The Characterization of Some Complexity Classes by Recursion Schemata (M. Liskiewicz, K. Lorys and M. Piotrow). Some Algorithmic Problems on Lattices (L. Lovasz). Linear Proofs in the Non-Negative Cone (J. Moravek). Characterizing Some Low Arithmetic Classes (J.B. Paris, W.G. Handley and A.J. Wilkie). Constructing a Simplex Form of a Rational Matrix (A. Rycerz and J. Jegier). Computing N with a Few Number of Additions (I. Ruzsa and Zs. Tuza). A Hierarchy of Polynomial Time Basis Reduction Algorithms (C.P. Schnorr). A Topological View of Some Problems in Complexity Theory (M. Sipser). v-Computations on Turing Machines and the Accepted Languages (L. Staiger). On the Greedy Algorithm for an Edge-Partitioning Problem (Gy. Turan). The Complexity of Linear Quadtrees (T.R. Walsh).

Theory of algorithms

The article aims at describing processes of building Business Intelligence (BI) systems. Taking the BI systems specifics into consideration, the authors present a suggested methodology of the systems creation and implementation in organisations. The considerations are focused on objectives and functional areas of the BI in organisations. Hence, in this context the approach to be used while building and implementing the BI involves two major stages that are of interactive nature, i.e. BI creation and BI "consumption". A large part of the article is devoted to presenting objectives and tasks that are realised while building and implementing BI.

Approach to Building and Implementing Business Intelligence Systems

Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. In this work we consider the impact of incorporating classical search concepts alongside Grover's algorithm into a hybrid quantum search system. Some of the crucial points examined include: (1) the reverberations of contemplating the use of non-constant branching factors; (2) determining the consequences of incorporating an heuristic perspective into a quantum tree search model.

Tree Search and Quantum Computation

Exact expectation analysis of the deficient-length LMS algorithm

Embedded systems are considered one of the most potential areas for future innovations. Two embedded fields that will most certainly take a primary role in future innovations are mobile robotics and mobile computing. Mobile robots and smartphones are growing in number and functionalities, becoming a presence in our daily life. In this paper, we study the current feasibility of a smartphone to execute navigation algorithms. As a test case, we use a smartphone to control an autonomous mobile robot. We tested three navigation problems: Mapping, Localization and Path Planning. For each of these problems, an algorithm has been chosen, developed in J2ME, and tested on the field. Results show the current mobile Java capacity for executing computationally demanding algorithms and reveal the real possibility of using smartphones for autonomous navigation.

/pdf/an-analysis-of-navigation-algorithms-for-smartphones-using-605r8ao7u2.pdf

An Analysis of Navigation Algorithms for Smartphones Using J2ME

Embedded systems are considered one of the areas with more potential for future innovations. Two embedded fields that will most certainly take a primary role in future innovations are mobile robotics and mobile computing. Mobile robots and smartphones are growing in number and functionalities, becoming a presence in our daily life. In this paper, we study the current feasibility of a smartphone to execute navigation algorithms and provide autonomous control, e.g., for a mobile robot. We tested four navigation problems: Mapping, Localization, Simultaneous Localization and Mapping, and Path Planning. We selected representative algorithms for the navigation problems, developed them in J2ME, and performed tests on the field. Results show the current mobile Java capacity for executing computationally demanding algorithms and reveal the real possibility of using smartphones for autonomous navigation.

The Feasibility of Navigation Algorithms on Smartphones using J2ME

Is quantum computing suitable for modelling problem-solving, a domain which is traditionally reserved for the symbolic approach? We propose a hybrid quantum problem-solving model. Our approach is motivated by several important theories from the fields of physics, computer science and psychology. We demonstrate our approach through a model for a quantum production system, based on the n-puzzle. The developed model can be extended in order to tackle any N-level depth search required by other problems. No preliminary knowledge concerning quantum computation is required.

/pdf/problem-solving-and-quantum-computation-agavvqr9p5.pdf

Luís Tarrataca

Papers

Tree Search and Quantum Computation

Exact expectation analysis of the deficient-length LMS algorithm

An Analysis of Navigation Algorithms for Smartphones Using J2ME

The Feasibility of Navigation Algorithms on Smartphones using J2ME

Problem-solving and Quantum Computation