758 resultados para Tutorial programs
Resumo:
This doctoral thesis aims to demonstrate the importance of incentives to technology-based firms as a strategy to promote knowledge-based economic development (KBED). To remain competitive, technology-based firms must innovate and seek new markets; therefore, this study aims to propose an incentive model to technology-based firms as a strategy to promote knowledge-based urban development, according to framework described by Yigitcanlar (2011). This is an exploratory and descriptive research with a qualitative approach. Surveys were carried out with national trade associations that represented technology-based firms both in Brazil and Australia. After analysing the surveys, structured interviews were conducted with government representatives, trade associations and businessmen who had used financial support by the federal government. When comparing both countries, the study found the importance of direct incentives through tax incentives, for it is a less bureaucratic, quicker and more direct process for firms. We suggest to include the terms incentives in the framework of knowledge-based urban development, as one of the pillars that contribute to knowledge-based economic development.
Resumo:
A diversity of programs oriented to young people seek to develop their capacities and their connection to the communities in which they live. Some focus on ameliorating a particular issue or ‘deficit’ whilst others, such as sporting, recreation and youth groups are more grounded in the community. This article reports a qualitative study undertaken in three remote Indigenous communities in Central Australia. Sixty interviews were conducted with a range of stakeholders involved in a diversity of youth programs. A range of critical challenges for and characteristics of remote Indigenous youth programs are identified if such programs are to be ‘fit for context’. ‘Youth centred-context specific’ provides a positive frame for the delivery of youth programs in remote Central Australia, encouraging an explicit focus on program logic; program content and processes; and relational, temporal, and, spatial aspects of the practice context. These provide lenses with which youth program planning and delivery may be enhanced in remote communities. Culturally safe service planning and delivery suggests locally determined processes for decision-making and community ownership. In some cases, this may mean a community preference for all ages to access the service to engage in culturally relevant activities. Where activities are targeted at young people, yet open to and inclusive of all ages, they provide a medium for cross-generational interaction that requires a high degree of flexibility on the part of staff and funding programs. Although the findings are focused in Central Australia, they may be relevant to similar contexts elsewhere.
Resumo:
NK model, proposed by Kauffman (1993), is a strong simulation framework to study competing dynamics. It has been applied in some social science fields, for instance, organization science. However, like many other simulation methods, NK model has not received much attention from Management Information Systems (MIS) discipline. This tutorial, thus, is trying to introduce NK model in a simple way and encourage related studies. To demonstrate how NK model works, this tutorial reproduces several Levinthal’s (1997) experiments. Besides, this tutorial attempts to make clear the relevance between NK model and agent-based modeling (ABM). The relevance can be a theoretical basis to further develop NK model framework for other research scenarios. For example, this tutorial provides an NK model solution to study IT value cocreation process by extending network structure and agent interactions.
Resumo:
The study addressed a phenomenon that has become common marketing practice, customer loyalty programs. Although a common type of consumer relationship, there is limited knowledge of its nature. The purpose of the study was to create structured understanding of the nature of customer relationships from both the provider’s and the consumer’s viewpoints by studying relationship drivers and proposing the concept of relational motivation as a provider of a common framework for the analysis of these views. The theoretical exploration focused on reasons for engaging in customer relationships for both the consumer and the provider. The themes of buying behaviour, industrial and network marketing and relationship marketing, as well as the concepts of a customer relationship, customer loyalty, relationship conditions, relational benefits, bonds and commitment were explored and combined in a new way. Concepts from the study of business-to-business relationships were brought over and their power in explaining the nature of consumer relationships examined. The study provided a comprehensive picture of loyalty programs, which is an important contribution to the academic as well as the managerial discussions. The consumer study provided deep insights into the nature of customer relationships. The study provides a new frame of reference to support the existing concepts of loyalty and commitment with the introduction of the relationship driver and relational motivation concepts. The result is a novel view of the nature of customer relationships that creates new understanding of the forces leading to loyal behaviour and commitment. The study concludes with managerial implications.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.
Resumo:
In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0. In a min-max LP, the objective is to minimise ρ subject to Ax ≤ ρ1, Cx ≥ 1, and x ≥ 0. The matrices A and C are nonnegative and sparse: each row ai of A has at most ΔI positive elements, and each row ck of C has at most ΔK positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ΔI ≥ 2, ΔK ≥ 2, and ε > 0 there exists a local algorithm that achieves the approximation ratio ΔI (1 − 1/ΔK) + ε. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ΔI (1 − 1/ΔK) for any ΔI ≥ 2 and ΔK ≥ 2.
Resumo:
We study the problem of finding a set of constraints of minimum cardinality which when relaxed in an infeasible linear program, make it feasible. We show the problem is NP-hard even when the constraint matrix is totally unimodular and prove polynomial-time solvability when the constraint matrix and the right-hand-side together form a totally unimodular matrix.