Earticle

The core theme of this work is to explore barriers to R&D collaborations that can lessen the tendencies to make joint R&D clusters among public–private research organizations and academic institutes. 20th century was loaded with heaps of barriers hindering the cooperation behaviors. 21st century was the ingress to more complexities in science, technologies and rapid innovations in practical applications of science to commerce and industry. More solutions have been considered to overcome these obstacles. Shifting balance from barriers to incentives has steered the organizations to establish more articulated R&D environment. The author has used the researchers’ binoculars to probe into the phenomenon of U-I Collaborations and factors for its sustainability. The aim of this research is to highlight those factors that can lead business moguls and faculty tycoons towards successful U-I collaborations and its sustainable growth to meet the innovation challenges. This study will also direct the intentions towards the barriers triggering the firms to chaos state. Findings in this research highlights the reasons behind the growing trends of U-I collaborations. Author has concluded that if the complementary barriers are exploited to create synergies, U-I Collaborations are more productive. Barriers and incentives for U-I collaborations both are mandatory to consider for sustainable growth of joint ventures among academia and industry. For a balance among these two factors, author has proposed a U-I collaboration model for long term execution of R&D projects in an articulated R&D intensive environment.

Since the invention of Gutenberg’s printing technology, paper has been the predominant medium for the distribution of information. However, in the last century new technology such as like radio and television has emerged, partly complementing and partly replacing paper. In the 1990s the Internet established itself as another major distribution channel for information. The multiple distribution channels make it necessary to efficiently serve the different formats of the media. These efforts are termed Cross Media. Over the past few decades Cross Media and ePublishing have become regarded as important success factors not only for publishing houses and media companies but almost for any company regardless of sector. While there are many sophisticated concepts within Cross Media, a rather down-to-earth facet - the printability of Internet documents – has been investigated in this study. For example, does it make sense to offer a rotogravure, high gloss brochure that one gets in a car-dealer show room for download and print-out on an ordinary black and white home printer. Should companies offer optimized plain black and white print-outs that reduced print-out time and costs for the end user? Should companies offer even multiple formats to suit the different needs of customers. Our analysis can be taken as an indicator of the degree of maturity and awareness of Cross Media and ePublishing – if these rather simple issues are not perfectly solved then Cross Media can be regarded as still in its very beginnings. Therefore, we analysed the print-outs of institutions and companies of several industries and compared the results within the industries as well as between them.

Trust in e-commerce has become one of the most important issues in online applications. Constantly, a user will only search for the most credible of goods and service providers and then take on their transactions. How to confirm which service providers are the most trusted for a user has become the most critical problems. This paper presents a trust network and trust community clustering for the analysis of the users most trusted relationship. It uses the nodes to represent the various subjects involved in the trust and use the connection links to denote relationships. The weight of the links indicates the strength of the relationships. First, it construct a trust network diagram which has the weight value of links, and then to analyze the clustering properties of the relationship according to the weights and the path length. At last, it classifies the most trusted subjects to the same cluster for a user. Direct trust information degree and global trust information degree are used to evaluate trust relations among subjects and it gives an improved shortest path algorithm to construct trust network. A clustering algorithm based on coefficient and path length is presented for E-commerce trust network community. Experiments show that the method of building trust through the network model can well describe the main indirect E-commerce trust and the algorithm has obvious advantages in accuracy and time cost.

This paper presents a task model and task ontology based on travelers’ tasks, and an intelligent tourist information service system using them. With the recent advances in Internet and mobile technologies, there has been an increase in the use of intelligent tourist information services via the Web and mobile systems. In addition, many ontologies have been introduced in tourist domain to provide various intelligent tourist information services. However, only a few studies have been undertaken from the perspective of specific tour services for travelers’ generic tasks and activities. Thus, we considered generic tasks and task ontology based on travelers’ perspectives, and intelligent tourist information services using them. Therefore, we propose 1) a task model of travelers’ perspective based on their needs and activities, 2) a task ontology using the generic tasks, their activities, relations, and properties, and 3) an intelligent tourist information system using task ontology based on various tasks and activities of travelers. The system consists of Tourist Contents Service (TCS) and Task-Orient Menu Service (TMS) parts, and can provide various intelligent tourist information services through task-oriented menus.

Radio frequency identification (RFID) technology has been toward a mature stage. Many industries build the RFID technology into the production process. The RFID technologies can support the firms in the supply chains to share information and increase the achieved transparency of process control and complete traceability records. At present, more RFID applications have been extended to life by the logistics management application. RFID developments of the future are a large-scale deployment, and information sharing with each other to achieve the convenience of multiple applications. To achieve the above purpose, the core function of RFID middleware is to achieve effective data collection and information sharing. Since RFID can generate large amounts of data flow in a short time, RFID middleware has to fast filter duplicated data and identify valid data. In this work, we design a data processing method to achieve on effective data filtering control. We design the filtering method and the effective hash functions which use the EPC coding of characteristics combining tree structure. The proposed middleware can reduce large amounts of data from readers by filtering duplicated data. Finally, we simulated the proposed data processing control schemes and revealed the good performance results.

A multi-objective mobile robot path planning algorithm based on improved Ant-Q agent system algorithm is proposed. The most Driver has Navigation system. It is convenient if him use the Navigation system. But, Navigation systems are not able to determine optimized driving routes considering that each driver has specific driving habits and propensities and many circumstantial changes are present in every trip. Therefore, We Propose a route recommendation system as part of the personalizing information method for navigation systems by the prey pursuit problem has been put to use in multi-agent research in addition to the food chain system using multi-agents in a virtual grid space. In this paper, We suggest a limitless space like reality and a new algorithm to better explain reality using the existing grid space and obstacle environment. We suggest New algorithm is based Ant-Q(Ant Colony System – Q learning) algorithm. Ant-Q algorithms were inspired by work on the ant system (AS), a distributed algorithm for combinatorial optimization based on the metaphor of ant colonies which was recentl proposed in (Dorigo, 1992; Dorigo, Maniezzo and Colorni, 1996).