Tag based collaborative filtering for recommender systems

Collaborative tagging can help users organize, share and retrieve information in an easy and quick way. For the collaborative tagging information implies user’s important personal preference information, it can be used to recommend personalized items to users. This paper proposes a novel tag-based collaborative filtering approach for recommending personalized items to users of online communities that are equipped with tagging facilities. Based on the distinctive three dimensional relationships among users, tags and items, a new similarity measure method is proposed to generate the neighborhood of users with similar tagging behavior instead of similar implicit ratings. The promising experiment result shows that by using the tagging information the proposed approach outperforms the standard user and item based collaborative filtering approaches.

Collaborative Filtering Recommender Systems based on Popular Tags

The social tags in web 2.0 are becoming another important information source to profile users' interests and preferences for making personalized recommendations. However, the uncontrolled vocabulary causes a lot of problems to profile users accurately, such as ambiguity, synonyms, misspelling, low information sharing etc. To solve these problems, this paper proposes to use popular tags to represent the actual topics of tags, the content of items, and also the topic interests of users. A novel user profiling approach is proposed in this paper that first identifies popular tags, then represents users’ original tags using the popular tags, finally generates users’ topic interests based on the popular tags. A collaborative filtering based recommender system has been developed that builds the user profile using the proposed approach. The user profile generated using the proposed approach can represent user interests more accurately and the information sharing among users in the profile is also increased. Consequently the neighborhood of a user, which plays a crucial role in collaborative filtering based recommenders, can be much more accurately determined. The experimental results based on real world data obtained from Amazon.com show that the proposed approach outperforms other approaches.

Collaborative filtering recommender systems using tag information

Recommender Systems is one of the effective tools to deal with information overload issue. Similar with the explicit rating and other implicit rating behaviours such as purchase behaviour, click streams, and browsing history etc., the tagging information implies user’s important personal interests and preferences information, which can be used to recommend personalized items to users. This paper is to explore how to utilize tagging information to do personalized recommendations. Based on the distinctive three dimensional relationships among users, tags and items, a new user profiling and similarity measure method is proposed. The experiments suggest that the proposed approach is better than the traditional collaborative filtering recommender systems using only rating data.

The importance of a new kind of learning in collaborative networks

There is wide agreement that in order to manage the increasingly complex and uncertain tasks of business, government and community, organizations can no longer operate in supreme isolation, but must develop a more networked approach. Networks are not ‘business as usual’. Of particular note is what has been referred to as collaborative networks. Collaborative networks now constitute a significant part of our institutional infrastructure. A key driver for the proliferation of these multiorganizational arrangements is their ability to facilitate the learning and knowledge necessary to survive or to respond to increasingly complex social issues In this regard the emphasis is on the importance of learning in networks. Learning applies to networks in two different ways. These refer to the kinds of learning that occur as part of the interactive processes of networks. This paper looks at the importance of these two kinds of learning in collaborative networks. The first kind of learning relates to networks as learning networks or communities of practice. In learning networks people exchange ideas with each other and bring back this new knowledge for use in their own organizations. The second type of learning is referred to as network learning. Network learning refers to how people in collaborative networks learn new ways of communicating and behaving with each other. Network learning has been described as transformational in terms of leading to major systems changes and innovation. In order to be effective, all networks need to be involved as learning networks; however, collaborative networks must also be involved in network learning to be effective. In addition to these two kinds of learning in collaborative networks this paper also focuses on the importance of how we learn about collaborative networks. Maximizing the benefits of working through collaborative networks is dependent on understanding their unique characteristics and how this impacts on their operation. This requires a new look at how we specifically teach about collaborative networks and how this is similar to and/or different from how we currently teach about interorgnizational relations.

Robot path planning in dynamic environments using a simulated annealing based approach

Mobile robots are widely used in many industrial fields. Research on path planning for mobile robots is one of the most important aspects in mobile robots research. Path planning for a mobile robot is to find a collision-free route, through the robot’s environment with obstacles, from a specified start location to a desired goal destination while satisfying certain optimization criteria. Most of the existing path planning methods, such as the visibility graph, the cell decomposition, and the potential field are designed with the focus on static environments, in which there are only stationary obstacles. However, in practical systems such as Marine Science Research, Robots in Mining Industry, and RoboCup games, robots usually face dynamic environments, in which both moving and stationary obstacles exist. Because of the complexity of the dynamic environments, research on path planning in the environments with dynamic obstacles is limited. Limited numbers of papers have been published in this area in comparison with hundreds of reports on path planning in stationary environments in the open literature. Recently, a genetic algorithm based approach has been introduced to plan the optimal path for a mobile robot in a dynamic environment with moving obstacles. However, with the increase of the number of the obstacles in the environment, and the changes of the moving speed and direction of the robot and obstacles, the size of the problem to be solved increases sharply. Consequently, the performance of the genetic algorithm based approach deteriorates significantly. This motivates the research of this work. This research develops and implements a simulated annealing algorithm based approach to find the optimal path for a mobile robot in a dynamic environment with moving obstacles. The simulated annealing algorithm is an optimization algorithm similar to the genetic algorithm in principle. However, our investigation and simulations have indicated that the simulated annealing algorithm based approach is simpler and easier to implement. Its performance is also shown to be superior to that of the genetic algorithm based approach in both online and offline processing times as well as in obtaining the optimal solution for path planning of the robot in the dynamic environment. The first step of many path planning methods is to search an initial feasible path for the robot. A commonly used method for searching the initial path is to randomly pick up some vertices of the obstacles in the search space. This is time consuming in both static and dynamic path planning, and has an important impact on the efficiency of the dynamic path planning. This research proposes a heuristic method to search the feasible initial path efficiently. Then, the heuristic method is incorporated into the proposed simulated annealing algorithm based approach for dynamic robot path planning. Simulation experiments have shown that with the incorporation of the heuristic method, the developed simulated annealing algorithm based approach requires much shorter processing time to get the optimal solutions in the dynamic path planning problem. Furthermore, the quality of the solution, as characterized by the length of the planned path, is also improved with the incorporated heuristic method in the simulated annealing based approach for both online and offline path planning.

Planning for knowledge-based urban development : global perspectives

Purpose: The purpose of this article is to investigate the engineering of creative urban regions through knowledge-based urban development. In recent years city administrators realised the importance of engineering and orchestrating knowledge city formation through visioning and planning for economic, socio-cultural and physical development. For that purpose a new development paradigm of ‘‘knowledge-based urban development’’ is formed, and quickly finds implementation ground in many parts of the globe.----- Design/methodology/approach: The paper reviews the literature and examines global best practice experiences in order to determine how cities are engineering their creative urban regions so as to establish a base for knowledge city formation.----- Findings: The paper sheds light on the different development approaches for creative urban regions, and concludes with recommendations for urban administrations planning for knowledge-based development of creative urban regions.----- Originality/value: The paper provides invaluable insights and discussion on the vital role of planning for knowledge-based urban development of creative urban regions.

Enabling authentic collaborative education in an online environment : the QUT Virtual Law Placement

This paper explores an innovative model for work-integrated learning using a virtual paradigm – The Virtual Law Placement Unit at Queensland University of Technology (QUT) Australia. It builds upon the conceptual model previously explored at WACE 2007 and provides an account of the lessons learned from the pilot offering of the unit which was conducted and evaluated in 2008. ----- The Virtual Placement Unit offers students the opportunity to complete an authentic workplace task under the guidance of a real-life workplace supervisor, where student-student communication and student-supervisor communication is all conducted virtually (and potentially asynchronously) to create an engaging but flexible learning environment using a combination of Blackboard and SharePoint technologies. This virtual experience is pioneering in the sense that it enables law students to access an unprecedented range of law graduate destination workplaces and projects, including international and social justice placements, absent the constraints traditionally associated with arranging physical placements. ----- All aspects of this unit have been designed in conjunction with community partners with a view to balancing student learning objectives with community needs through co-operative education. This paper will also explore how the implementation of the project is serving to strengthen those partnerships with the wider community, simultaneously addressing the community engagement agenda of the University and enabling students to engage meaningfully with local, national and international community partners in the real world of work.

Recommending best answer in a collaborative question answering system

The World Wide Web has become a medium for people to share information. People use Web-based collaborative tools such as question answering (QA) portals, blogs/forums, email and instant messaging to acquire information and to form online-based communities. In an online QA portal, a user asks a question and other users can provide answers based on their knowledge, with the question usually being answered by many users. It can become overwhelming and/or time/resource consuming for a user to read all of the answers provided for a given question. Thus, there exists a need for a mechanism to rank the provided answers so users can focus on only reading good quality answers. The majority of online QA systems use user feedback to rank users’ answers and the user who asked the question can decide on the best answer. Other users who didn’t participate in answering the question can also vote to determine the best answer. However, ranking the best answer via this collaborative method is time consuming and requires an ongoing continuous involvement of users to provide the needed feedback. The objective of this research is to discover a way to recommend the best answer as part of a ranked list of answers for a posted question automatically, without the need for user feedback. The proposed approach combines both a non-content-based reputation method and a content-based method to solve the problem of recommending the best answer to the user who posted the question. The non-content method assigns a score to each user which reflects the users’ reputation level in using the QA portal system. Each user is assigned two types of non-content-based reputations cores: a local reputation score and a global reputation score. The local reputation score plays an important role in deciding the reputation level of a user for the category in which the question is asked. The global reputation score indicates the prestige of a user across all of the categories in the QA system. Due to the possibility of user cheating, such as awarding the best answer to a friend regardless of the answer quality, a content-based method for determining the quality of a given answer is proposed, alongside the non-content-based reputation method. Answers for a question from different users are compared with an ideal (or expert) answer using traditional Information Retrieval and Natural Language Processing techniques. Each answer provided for a question is assigned a content score according to how well it matched the ideal answer. To evaluate the performance of the proposed methods, each recommended best answer is compared with the best answer determined by one of the most popular link analysis methods, Hyperlink-Induced Topic Search (HITS). The proposed methods are able to yield high accuracy, as shown by correlation scores: Kendall correlation and Spearman correlation. The reputation method outperforms the HITS method in terms of recommending the best answer. The inclusion of the reputation score with the content score improves the overall performance, which is measured through the use of Top-n match scores.

Railways, Urban Development and Town Planning in Britain: 1948–2008, Haywood R. Ashgate (2009). £65.00, ISBN: 9780754673927

This book is a thorough investigation of the relationship between land use planning and the railways in Britain, through review of the factors affecting the two sectors and their integration during the period of public ownership. The rationale behind the book is explained as a timely analysis of the dynamic correlation involving town planning and management of the railway in a period when growing congestion on the road network is forcing people to look for alternative modes and capacity is badly needed to accommodate this increased demand for travel. The book calls for a modal shift from road to rail for passenger and freight traffic.

Supply chain collaboration : capabilities for continuous innovation

Purpose – The purpose of this study is to investigate how collaborative relationships enhance continuous innovation in the supply chain using case studies. Design/methodology/approach – The data were collected from semi-structured interviews with 23 managers in ten case studies. The main intention was to comprehend how these firms engaged in collaborative relationships and their importance for successful innovation. The study adopted a qualitative approach to investigating these factors. Findings – The findings demonstrate how differing relationships can impact on the operation of firms and their capacities to innovate. The ability to work together with partners has enabled firms to integrate and link operations for increased effectiveness as well as embark on both radical and incremental innovation. Research limitations/implications – The research into the initiatives and strategies for collaboration was essentially exploratory. A qualitative approach using case studies acknowledged that the responses from managers were difficult to quantify or gauge the extent of these factors. Practical implications – The findings have shown various methods where firms integrated with customers and suppliers in the supply chain. This was evident in the views of managers across all the firms examined, supporting the importance of collaboration and efficient allocation of resources throughout the supply chain. They were able to set procedures in their dealings with partners, sharing knowledge and processes, and subsequently joint-planning and investing with them for better operations, systems and processes in the supply chain. Originality/value – The case studies serve as examples for managers in logistics organisation who are contemplating strategies and issues on collaborative relationships. The study provides important lessons on how such relationships can impact on the operation of firms and their capability to innovate. Keywords Supply chain management, Innovation, Relationship marketing

Blogs, wikis and podcasts : collaborative knowledge building tools in a design and technology course

Design and Technology has become an important part of the school curriculum. In Queensland, Australia, Technology (which encompasses Design) is one of the Key Learning Areas (KLAs) for students in the first ten years of schooling. This KLA adopts a student-centred, hands-on constructivist approach to teaching and learning. The ability to conceptualise and implement appropriate learning experiences, however, has been a challenge for some early career teachers. This paper describes how Design and Technology is being taught to pre-service primary teachers at an Australian University through their involvement in a range of authentic problem-solving activities supported by social learning tools such as wikis and blogs. An interview with a sample from this group (N=5) provides an insight into how these social software tools enhanced their knowledge and learning. This paper will describe how these social learning tools impact on the agency of learning.

Multi-objective mission flight planning in civil unmanned aerial systems

Unmanned Aerial Vehicles (UAVs) are emerging as an ideal platform for a wide range of civil applications such as disaster monitoring, atmospheric observation and outback delivery. However, the operation of UAVs is currently restricted to specially segregated regions of airspace outside of the National Airspace System (NAS). Mission Flight Planning (MFP) is an integral part of UAV operation that addresses some of the requirements (such as safety and the rules of the air) of integrating UAVs in the NAS. Automated MFP is a key enabler for a number of UAV operating scenarios as it aids in increasing the level of onboard autonomy. For example, onboard MFP is required to ensure continued conformance with the NAS integration requirements when there is an outage in the communications link. MFP is a motion planning task concerned with finding a path between a designated start waypoint and goal waypoint. This path is described with a sequence of 4 Dimensional (4D) waypoints (three spatial and one time dimension) or equivalently with a sequence of trajectory segments (or tracks). It is necessary to consider the time dimension as the UAV operates in a dynamic environment. Existing methods for generic motion planning, UAV motion planning and general vehicle motion planning cannot adequately address the requirements of MFP. The flight plan needs to optimise for multiple decision objectives including mission safety objectives, the rules of the air and mission efficiency objectives. Online (in-flight) replanning capability is needed as the UAV operates in a large, dynamic and uncertain outdoor environment. This thesis derives a multi-objective 4D search algorithm entitled Multi- Step A* (MSA*) based on the seminal A* search algorithm. MSA* is proven to find the optimal (least cost) path given a variable successor operator (which enables arbitrary track angle and track velocity resolution). Furthermore, it is shown to be of comparable complexity to multi-objective, vector neighbourhood based A* (Vector A*, an extension of A*). A variable successor operator enables the imposition of a multi-resolution lattice structure on the search space (which results in fewer search nodes). Unlike cell decomposition based methods, soundness is guaranteed with multi-resolution MSA*. MSA* is demonstrated through Monte Carlo simulations to be computationally efficient. It is shown that multi-resolution, lattice based MSA* finds paths of equivalent cost (less than 0.5% difference) to Vector A* (the benchmark) in a third of the computation time (on average). This is the first contribution of the research. The second contribution is the discovery of the additive consistency property for planning with multiple decision objectives. Additive consistency ensures that the planner is not biased (which results in a suboptimal path) by ensuring that the cost of traversing a track using one step equals that of traversing the same track using multiple steps. MSA* mitigates uncertainty through online replanning, Multi-Criteria Decision Making (MCDM) and tolerance. Each trajectory segment is modeled with a cell sequence that completely encloses the trajectory segment. The tolerance, measured as the minimum distance between the track and cell boundaries, is the third major contribution. Even though MSA* is demonstrated for UAV MFP, it is extensible to other 4D vehicle motion planning applications. Finally, the research proposes a self-scheduling replanning architecture for MFP. This architecture replicates the decision strategies of human experts to meet the time constraints of online replanning. Based on a feedback loop, the proposed architecture switches between fast, near-optimal planning and optimal planning to minimise the need for hold manoeuvres. The derived MFP framework is original and shown, through extensive verification and validation, to satisfy the requirements of UAV MFP. As MFP is an enabling factor for operation of UAVs in the NAS, the presented work is both original and significant.

The planning of airport regions and National Aviation Policy Issues and challenges in the Australian experience 2008-2009

The planning of airports has long been contentious because of their localisation of negative impacts. The globalisation, commercialisation and deregulation of the aviation industry has unleashed powerful new economic forces both on and offairport. Over the last two decades, many airports have evolved into airport cities located at the heart of the wider aerotropolis region. This shifts the appropriate scale of planning analysis towards broader regional concerns. However,governments have been slow to respond and airport planning usually remains poorly integrated with local, city and regional planning imperatives. The Australian experience exemplifies the divide. The privatization of major Australian airports from 1996 has seen billions of dollars spent on new airside and landside infrastructure but with little oversight from local and state authorities because the ultimate authority for on-airport development is the Federal Minister for Transport. Consequently, there have been growing tensions in many major airport regions between the private airport lessee and the broader community, exacerbated by both the building of highly conspicuous non-aeronautical developments and growing airport area congestion. This paper examines the urban planning content of Australia’s national aviation policy review (2008-09) with reference to current and potential opportunities for all-of-region collaboration in the planning process.