Providing youth with skills, training and employment opportunities through ICT Initiatives

Youth population is increasing explosively particularly in developing countries as a result of rapid urbanization. This increase is bringing large number of social and economic problems. For instance the impacts of job and training availability, and the physical, social and cultural quality of urban environment on young people are enormous, and affect their health, lifestyles, and well-being (Gleeson and Sipe 2006). Besides this, globalization and technological developments are affecting youth in urban areas in all parts of the world, both positively and negatively (Robertson 1995). The rapidly advancing information and communications technologies (ICTs) helps in addressing social and economic problems caused by the rapid growth of urban youth populations in developing countries. ICTs offer opportunities to young people for learning, skill development and employment. But there are downsides: young people in many developing countries lack of having broad access to these new technologies, they are vulnerable to global market changes, and ICTs link them into global cultures which promote consumer goods, potentially eroding local cultures and community values (Manacorda and Petrongolo 1999). However we believe that the positives outweigh such negatives. At the beginning of the twenty-first century, the world’s young population number more than they ever have. There are over a billion young people between the ages of 15 and 24, which 85 per cent of them live in developing countries and mainly in urban environments. Many of these young people are in the process of making, or have already made, the transition from school to work. During the last two decades all around the world, these young people, as new workers, have faced a number of challenges associated with globalization and technological advances on labour markets (United Nations 2004). The continuous decrease in the manufacturing employment is made many of the young people facing three options: getting jobs in the informal economy with insecurity and poor wages and working conditions, or getting jobs in the low-tier service industries, or developing their vocational skills to benefit from new opportunities in the professional and advanced technical/knowledge sectors. Moreover in developing countries a large portion of young people are not even lucky enough to choose among any of these options, and consequently facing long-term unemployment, which makes them highly vulnerable. The United Nations’ World Youth Employment report (2004) indicates that in almost all countries, females tend to be far more vulnerable than males in terms of long-term unemployment, and young people who have advanced qualifications are far less likely to experience long-term unemployment than others. In the limited opportunities of the formal labour market, those with limited vocational skills resort to forced entrepreneurship and selfemployment in the informal economy, often working for low pay under hazardous conditions, with only few prospects for the future (United Nations 2005a). The International Labour Organization’s research (2004) revealed that the labour force participation rates for young people decreased by almost four per cent (which is equivalent of 88 million young people) between 1993 and 2003. This is largely as a result of the increased number of young people attending school, high overall unemployment rates, and the fact that some young people gave up any hope of finding work and dropped out of the labour market. At the regional level, youth unemployment was highest in Middle East and North Africa (MENA) (25.6%) and sub-Saharan Africa (21%) and lowest in East Asia (7%) and the industrialized economies(13.4%) (International Labour Organization 2004). The youth in economically disadvantaged regions (e.g. the MENA region) face many challenges in education and training that delivers them the right set of skills and knowledge demanded by the labour market. As a consequence, the transition from school to work is mostly unsuccessful and young population end up either unemployed or underemployed in the informal sectors (United Nations 2005b). Unemployment and lack of economic prospects of the urban youth are pushing many of them into criminal acts, excessive alcohol use, substance addiction, and also in many cases resulting in processes of social or political violence (Fernandez-Maldonado 2004; United Nations 2005a). Long-term unemployment leads young people in a process of marginalisation and social exclusion (United Nations 2004). The sustained high rates of long-term youth unemployment have a number of negative effects on societies. First, it results in countries failing to take advantage of the human resources to increase their productive potential, at a time of transition to a globalized world that inexorably demands such leaps in productive capacity. Second, it reinforces the intergenerational transmission of poverty. Third, owing to the discrepancy between more education and exposure to the mass media and fewer employment opportunities, it may encourage the spread of disruptive behaviours, recourse to illegal alternatives for generating income and the loss of basic societal values, all of which erode public safety and social capital. Fourth, it may trigger violent and intractable political conflicts. And lastly, it may exacerbate intergenerational conflicts when young people perceive a lack of opportunity and meritocracy in a system that favours adults who have less formal education and training but more wealth, power and job stability (Hopenhayn 2002). To assist in addressing youth’s skill training and employment problems this paper scrutinises useful international practices, policies, initiatives and programs targeting youth skill training, particularly in ICTs. The MENA national governments and local authorities could consider implementing similar initiative and strategies to address some of the youth employment issues. The broader aim of this paper is to investigate the successful practice and strategies for the information and communication related income generation opportunities for young people to: promote youth entrepreneurship; promote public-private partnerships; target vulnerable groups of young people; narrow digital divide; and put young people in charge. The rest of this paper is organised in five parts. First, the paper provides an overview of the literature on the knowledge economy, skill, education and training issues. Secondly, it reviews the role of ICTs for vocational skill development and employability. Thirdly, it discusses the issues surrounding the development of the digital divide. Fourthly, the paper underlines types and the importance of developing ICT initiatives targeting young people, and reviews some of the successful policy implementations on ICT-based initiatives from both developed and developing countries that offer opportunities to young people for learning, skill development and employment. Then the paper concludes by providing useful generalised recommendations for the MENA region countries and cities in: advocating possible opportunities for ICT generated employment for young people; and discussing how ICT policies could be modified and adopted to meet young people’s needs.

Evaluating the Java Virtual Machine as a Target for Languages Other Than Java

The portability and runtime safety of programs which are executed on the Java Virtual Machine (JVM) makes the JVM an attractive target for compilers of languages other than Java. Unfortunately, the JVM was designed with language Java in mind, and lacks many of the primitives required for a straighforward implementation of other languages. Here, we discuss how the JVM may be used to implement other object-oriented languages. As a practical example of the possibilities, we report on a comprehensive case study. The open source Gardens Point Component Pascal compiler compiles the entire Component Pascal language, a dialect of Oberon-2, to JVM bytecodes. This compiler achieves runtime efficiencies which are comparable to native-code implementations of procedural languages.

Implementing languages other than Java on the Java Virtual Machine

The portability and runtime safety of programs which are executed on the Java Virtual Machine (JVM) makes the JVM an attractive target for compilers of languages other than Java. Unfortunately, the JVM was designed with language Java in mind, and lacks many of the primitives required for a straight forward implementation of other languages. Here, we discuss how the JVM may be used to implement other object oriented languages. As a practical example of the possibilities, we report on a comprehensive case study. The open source Gardens Point Component Pascal compiler compiles the entire Component Pascal language, a dialect of Oberon 2, to JVM bytecodes. This compiler achieves runtime efficiencies which are comparable to native code implementations of procedural languages.

From conceptual process models to running systems: A holistic approach for the configuration of enterprise system processes

This paper proposes a method which aims at increasing the efficiency of enterprise system implementations. First, we argue that existing process modeling languages that feature different degrees of abstraction for different user groups exist and are used for different purposes which makes it necessary to integrate them. We describe how to do this using the meta models of the involved languages. Second, we argue that an integrated process model based on the integrated meta model needs to be configurable and elaborate on the enabling mechanisms. We introduce a business example using SAP modeling techniques to illustrate the proposed method.

Labelled silhouettes for human pose estimation

This paper proposes a new method of using foreground silhouette images for human pose estimation. Labels are introduced to the silhouette images, providing an extra layer of information that can be used in the model fitting process. The pixels in the silhouettes are labelled according to the corresponding body part in the model of the current fit, with the labels propagated into the silhouette of the next frame to be used in the fitting for the next frame. Both single and multi-view implementations are detailed, with results showing performance improvements over only using standard unlabelled silhouettes.

Contrasting scenarios : embracing speech recognition

The purpose of this chapter is to describe the use of caricatured contrasting scenarios (Bødker, 2000) and how they can be used to consider potential designs for disruptive technologies. The disruptive technology in this case is Automatic Speech Recognition (ASR) software in workplace settings. The particular workplace is the Magistrates Court of the Australian Capital Territory.----- Caricatured contrasting scenarios are ideally suited to exploring how ASR might be implemented in a particular setting because they allow potential implementations to be “sketched” quickly and with little effort. This sketching of potential interactions and the emphasis of both positive and negative outcomes allows the benefits and pitfalls of design decisions to become apparent.----- A brief description of the Court is given, describing the reasons for choosing the Court for this case study. The work of the Court is framed as taking place in two modes: Front of house, where the courtroom itself is, and backstage, where documents are processed and the business of the court is recorded and encoded into various systems.----- Caricatured contrasting scenarios describing the introduction of ASR to the front of house are presented and then analysed. These scenarios show that the introduction of ASR to the court would be highly problematic.----- The final section describes how ASR could be re-imagined in order to make it useful for the court. A final scenario is presented that describes how this re-imagined ASR could be integrated into both the front of house and backstage of the court in a way that could strengthen both processes.

Managing process model complexity via abstract syntax modifications

As a result of the growing adoption of Business Process Management (BPM) technology different stakeholders need to understand and agree upon the process models that are used to configure BPM systems. However, BPM users have problems dealing with the complexity of such models. Therefore, the challenge is to improve the comprehension of process models. While a substantial amount of literature is devoted to this topic, there is no overview of the various mechanisms that exist to deal with managing complexity in (large) process models. It is thus hard to obtain comparative insight into the degree of support offered for various complexity reducing mechanisms by state-of-the-art languages and tools. This paper focuses on complexity reduction mechanisms that affect the abstract syntax of a process model, i.e. the structure of a process model. These mechanisms are captured as patterns, so that they can be described in their most general form and in a language- and tool-independent manner. The paper concludes with a comparative overview of the degree of support for these patterns offered by state-of-the-art languages and language implementations.

Control issues for velocity sourced Series Elastic Actuators

The Series Elasic Actuator has been proposed as a method for providing safe force or torque based acutation for robots that interact with humans. In this paper we look at some outstanding issues in the implementation and control of Series Elastic Actuators. The study addresses issues in making the Series Elastic Actuator respond effectively in the presence of physical difficulties such as restriction, using a computation efficient controller. The improvement over previous implementations is achieved by treating the motor as a velocity source to the elastic element, rather than as a torque source.

Elliptic curves, group law, and efficient computation

This thesis is about the derivation of the addition law on an arbitrary elliptic curve and efficiently adding points on this elliptic curve using the derived addition law. The outcomes of this research guarantee practical speedups in higher level operations which depend on point additions. In particular, the contributions immediately find applications in cryptology. Mastered by the 19th century mathematicians, the study of the theory of elliptic curves has been active for decades. Elliptic curves over finite fields made their way into public key cryptography in late 1980’s with independent proposals by Miller [Mil86] and Koblitz [Kob87]. Elliptic Curve Cryptography (ECC), following Miller’s and Koblitz’s proposals, employs the group of rational points on an elliptic curve in building discrete logarithm based public key cryptosystems. Starting from late 1990’s, the emergence of the ECC market has boosted the research in computational aspects of elliptic curves. This thesis falls into this same area of research where the main aim is to speed up the additions of rational points on an arbitrary elliptic curve (over a field of large characteristic). The outcomes of this work can be used to speed up applications which are based on elliptic curves, including cryptographic applications in ECC. The aforementioned goals of this thesis are achieved in five main steps. As the first step, this thesis brings together several algebraic tools in order to derive the unique group law of an elliptic curve. This step also includes an investigation of recent computer algebra packages relating to their capabilities. Although the group law is unique, its evaluation can be performed using abundant (in fact infinitely many) formulae. As the second step, this thesis progresses the finding of the best formulae for efficient addition of points. In the third step, the group law is stated explicitly by handling all possible summands. The fourth step presents the algorithms to be used for efficient point additions. In the fifth and final step, optimized software implementations of the proposed algorithms are presented in order to show that theoretical speedups of step four can be practically obtained. In each of the five steps, this thesis focuses on five forms of elliptic curves over finite fields of large characteristic. A list of these forms and their defining equations are given as follows: (a) Short Weierstrass form, y2 = x3 + ax + b, (b) Extended Jacobi quartic form, y2 = dx4 + 2ax2 + 1, (c) Twisted Hessian form, ax3 + y3 + 1 = dxy, (d) Twisted Edwards form, ax2 + y2 = 1 + dx2y2, (e) Twisted Jacobi intersection form, bs2 + c2 = 1, as2 + d2 = 1, These forms are the most promising candidates for efficient computations and thus considered in this work. Nevertheless, the methods employed in this thesis are capable of handling arbitrary elliptic curves. From a high level point of view, the following outcomes are achieved in this thesis. - Related literature results are brought together and further revisited. For most of the cases several missed formulae, algorithms, and efficient point representations are discovered. - Analogies are made among all studied forms. For instance, it is shown that two sets of affine addition formulae are sufficient to cover all possible affine inputs as long as the output is also an affine point in any of these forms. In the literature, many special cases, especially interactions with points at infinity were omitted from discussion. This thesis handles all of the possibilities. - Several new point doubling/addition formulae and algorithms are introduced, which are more efficient than the existing alternatives in the literature. Most notably, the speed of extended Jacobi quartic, twisted Edwards, and Jacobi intersection forms are improved. New unified addition formulae are proposed for short Weierstrass form. New coordinate systems are studied for the first time. - An optimized implementation is developed using a combination of generic x86-64 assembly instructions and the plain C language. The practical advantages of the proposed algorithms are supported by computer experiments. - All formulae, presented in the body of this thesis, are checked for correctness using computer algebra scripts together with details on register allocations.

A hybrid genetic algorithm for the optimal constrained web service selection problem in web service composition

Web service composition is an important problem in web service based systems. It is about how to build a new value-added web service using existing web services. A web service may have many implementations, all of which have the same functionality, but may have different QoS values. Thus, a significant research problem in web service composition is how to select a web service implementation for each of the web services such that the composite web service gives the best overall performance. This is so-called optimal web service selection problem. There may be mutual constraints between some web service implementations. Sometimes when an implementation is selected for one web service, a particular implementation for another web service must be selected. This is so called dependency constraint. Sometimes when an implementation for one web service is selected, a set of implementations for another web service must be excluded in the web service composition. This is so called conflict constraint. Thus, the optimal web service selection is a typical constrained ombinatorial optimization problem from the computational point of view. This paper proposes a new hybrid genetic algorithm for the optimal web service selection problem. The hybrid genetic algorithm has been implemented and evaluated. The evaluation results have shown that the hybrid genetic algorithm outperforms other two existing genetic algorithms when the number of web services and the number of constraints are large.

ERP systems implementation and organizational culture : the case of Jordan

Jordan is adopting Enterprise Resource Planning (ERP) systems in both its public and private sectors. Jordan's emerging private sector has historically close ties to the public sector; though a global market orientation requires a shift in its organizational culture. ERPs however embed business processes which do not necessarily fit with traditional cultural practices, and implementation success is not assured. This study looks at the perceptions of both public and private sector ERP implementations in Jordan and assesses these on various measures of success. There were few differences between public and private sectors, but the benefits actually realized in Jordanian ERPs fell short of claims made for the technology in other cultures.

secFleck: A Public Key Technology Platform for Wireless Sensor Networks

We describe the design and implementation of a public-key platform, secFleck, based on a commodity Trusted Platform Module (TPM) chip that extends the capability of a standard node. Unlike previous software public-key implementations this approach provides E- Commerce grade security; is computationally fast, energy efficient; and has low financial cost — all essential attributes for secure large-scale sen- sor networks. We describe the secFleck message security services such as confidentiality, authenticity and integrity, and present performance re- sults including computation time, energy consumption and cost. This is followed by examples, built on secFleck, of symmetric key management, secure RPC and secure software update.

A simple and systematic approach to assigning Denavit-Hartenberg Parameters

This paper presents a simple and intuitive approach to determining the kinematic parameters of a serial-link robot in Denavit– Hartenberg (DH) notation. Once a manipulator’s kinematics is parameterized in this form, a large body of standard algorithms and code implementations for kinematics, dynamics, motion planning, and simulation are available. The proposed method has two parts. The first is the “walk through,” a simple procedure that creates a string of elementary translations and rotations, from the user-defined base coordinate to the end-effector. The second step is an algebraic procedure to manipulate this string into a form that can be factorized as link transforms, which can be represented in standard or modified DH notation. The method allows for an arbitrary base and end-effector coordinate system as well as an arbitrary zero joint angle pose. The algebraic procedure is amenable to computer algebra manipulation and a Java program is available as supplementary downloadable material.

Enterprise systems in universities : a teaching case

This teaching case aims to contribute to understanding the phenomenon of Enterprise Systems (ES) implementations in universities. Through this case, students will gain understanding of the importance of ‘contextual elements’ for large scale information systems (IS) implementations, in particular ES. This teaching case illustrates how these contextual factors contribute to the success or failure of such implementations, and how they can influence the decisions that dictate the lifecycle of such systems. The case describes ES implementations at a leading Australian university, and presents a rich account of the institutional, national and industry-sector contexts that have influenced the directions and decisions taken. The journey encountered with the main Enterprise Systems that support Financials, Human Resources and Facilities are described suggesting the lifecycle phases, critical success factors and lessons learnt.

Faster pairing computations on curves with high-degree twists

Research on efficient pairing implementation has focussed on reducing the loop length and on using high-degree twists. Existence of twists of degree larger than 2 is a very restrictive criterion but luckily constructions for pairing-friendly elliptic curves with such twists exist. In fact, Freeman, Scott and Teske showed in their overview paper that often the best known methods of constructing pairing-friendly elliptic curves over fields of large prime characteristic produce curves that admit twists of degree 3, 4 or 6. A few papers have presented explicit formulas for the doubling and the addition step in Miller’s algorithm, but the optimizations were all done for the Tate pairing with degree-2 twists, so the main usage of the high- degree twists remained incompatible with more efficient formulas. In this paper we present efficient formulas for curves with twists of degree 2, 3, 4 or 6. These formulas are significantly faster than their predecessors. We show how these faster formulas can be applied to Tate and ate pairing variants, thereby speeding up all practical suggestions for efficient pairing implementations over fields of large characteristic.