Search results

Start-up intention among university students is related to the image of entrepreneurship as a career alternative. University is critical in developing the levels of motivation and capabilities of graduates to effectively engage in entrepreneurial activity. The purpose of this paper is to propose an entrepreneurial intention model focussing on higher education and the implementation of the model as a practical digital application which can be used in universities to improve the entrepreneurial intention of students enrolled in different courses.

This paper first discusses the importance of entrepreneurial intention in graduate entrepreneurship. Then, it proposes an entrepreneurial intention model based on the four propositions identified from the literature. Finally, the model is implemented as a practical digital application focussing on self-skill awareness, entrepreneurial resources and entrepreneurial support network. A survey is conducted with students to evaluate the model and the application.

Entrepreneurial awareness found to have a positive effect of entrepreneurial intention. Besides the conceptual model, this study has developed a digital application to enhance entrepreneurial intention of students focussing on information technology discipline. The application is evaluated through an online survey and the results show that the application can significantly improve entrepreneurial intention.

The proposed entrepreneurial intention model and the digital application offer guidance to universities as to how online systems can be used to create an environment that fosters individual intentions to select entrepreneurship as a career option, even for students doing non-entrepreneurial courses.

The purpose of this paper is to analyse the problem of privacy disclosure of third party applications in online social networks (OSNs) through Facebook, investigate the limitations in the existing models to protect users privacy and propose a permission-based access control (PBAC) model, which gives users complete control over users’ data when accessing third party applications.

A practical model based on the defined permission policies is proposed to manage users information accessed by third party applications and improve user awareness in sharing sensitive information with them. This model is a combination of interfaces and internal mechanisms which can be adopted by any OSN having similar architecture to Facebook in managing third party applications, without much structural changes. The model implemented in Web interface connects with Facebook application programming interface and evaluates its efficacy using test cases.

The results show that the PBAC model can facilitate user awareness about privacy risks of data passed on to third party applications and allow users who are more concerned about their privacy from releasing such information to those applications.

The study provides further research in protecting users’ privacy in OSNs and thus avoid the risks associated with that, thereby increasing users’ trust in using OSNs.

The research has proven to be useful in improving user awareness on the risk associated with sharing private information on OSNs, and the practically implemented PBAC model guarantees full user privacy from unwanted disclosure of personal information to third party applications.

Despite the increasing demand for an effective XML document repository, many are still reluctant to store XML documents in their natural tree form. One main reason is the inadequacy of XML query languages to update the tree‐form XML documents. Even though some of the languages have supported minimum update facilities, they do not concern on preserving the documents constraints. The results are updated documents with very low database integrity. In this paper, we propose a methodology to accommodate XML Update without violating the conceptual constraints of the documents. The method takes form as a set of functions that perform checking mechanisms before update operations. In this paper we discuss the conceptual constraints embedded in three different relationship structures: association, aggregation and inheritance relationship. We highlight four constraints related with association relationship (nuber of participants, referential integrity, cardinality, and adhesion), five constraints related with aggregation relationship (cardinality, adhesion, ordering, homogeneity and share‐ability) and two constraints related to inheritance relationship (disjoint and number of super‐class). In addition, a specific constraint, which is collection type of children, will also be discussed. The proposed method can be implemented in different ways, for example in this paper we use XQuery language. Since the XML update requires schema, in this paper we also propose the mapping of the these constraints in the conceptual level to the XML Schema. We use XML Schema for structure validation, even though the algorithm can be used by any schema languages.

Semi‐structured data are commonly represented by labeled flat db‐graphs. In this paper, we study an extension of db‐graph model for representing nested semi‐structured data. This extension allows one to have db‐graphs whose vertex labels are db‐graphs themselves. Bringing the data model closer to the natural presentation of data stored via Web documents is the main motivation behind nesting db‐graphs. The importance of nested db‐graphs is similar to the importance of nested tables in relational model. The main purpose of the paper is to provide a mechanism to query nested semi‐structured data and Web forms in a uniform way. Most of the languages proposed so far have been designed as extensions of SQL with, among others, the advantage to provide a user‐friendly syntax and commercial flavor. The major focus of the paper is on defining a graph query language in a multi‐sorted calculus like style.