Search results

Traditionally, file transfer protocol (FTP) servers are major archive providers and users apply the Archie server to locate FTP archives. With the extreme popularity of the WWW, Web servers are now important archive providers and users download archives via HTTP. To reduce HTTP traffic, proxy cache servers are deployed on the Internet. However, we find the hit rate of archives in cache servers is quite low. This study proposes a combination of caching and better searching mechanisms to alleviate the problem. We enable a proxy server to automatically collect WWW and FTP archives from its cache, organize them in the form of an FTP directory, and then offer the directory list to the Archie. Accordingly, users can find archives on WWW and FTP servers through the Archie, and they can directly download archives from the proxy server, thus improving the reuse of cached archives. A system was implemented and operated in a real environment to evaluate the approach and results are discussed.

The World Wide Web (WWW) has become an extremely popular information service. Large HTTP packets result in network congestion. Proxy cache servers are widely deployed on the Internet to overcome this obstacle. However, the approach yields an undesirable phenomenon – a small set of users misuse proxy servers to mirror the entire contents of Web sites. This behavior wastes network resources, increases WWW servers’ loads, increases users’ waiting time, and violates copyrights. Approaches to designing a proxy server with WWW usage control and to making the proxy server effective on local area networks are proposed to prevent such abnormal WWW access and to prioritize WWW usage. Finally, a system, ProxyBreaker, is implemented to demonstrate the approaches. The implementation reveals that the proposed approaches are effective, such that the abnormal Web access does not reoccur.

An archive is a file containing several related files. Many Internet resources, such as freeware, shareware and trail software, are often packaged into archives for easy installation and taking. Additionally, thousands of users search for archives and download them from different sources everyday. In this paper, previous research on archive downloading is extended via proxy cache to support archive searching. Internet proxy cache servers are used to gather a significant number of Web pages, detect those that contain archive links, and then use the obtained data to search archives by description or filename. Two schemes, iterative and backtracking, are proposed to obtain Web pages with archive links. The experimental results indicate that the precision that both of the schemes can achieve is about the same; however, the backtracking scheme reduces the number of checked pages by a factor of 26. Finally, a real system was implemented to demonstrate the proposed approaches.

Presents a framework for deciding on a good execution strategy for a given program based on the available data and task parallelism in the program on PC laboratory clusters. Proposes a virtual cluster scheduling scheme to take account of the relationships between tasks for task parallelism, and also processor speed, processor load and network environment to balance load for data parallelism in a PC cluster environment. The approach is very effective in terms of the overall execution time, and demonstrates the feasibility of automatic cluster assignment, processor set selection and data partition functions for data and task parallel programs.

Consulting experts is an effective way to utilize tacit resource. The purpose of the paper is to optimize the matching between panels of experts and groups of demanders to improve the efficiency of tacit knowledge sharing.

Experts and demanders express preferences using linguistic terms. The estimate method based on trust is developed to get missing ratings. Weights of demanders are determined and knowledge needs are identified. Three kinds of satisfaction are measured based on grey relational analysis. To maximize satisfaction of experts and demanders and safeguard meetings of knowledge needs as well as the workload of experts, the optimization model is constructed and the solution is optimal matching results.

The presented approach not only optimizes the matching between demanders and experts but also sets up a panel of experts in case that knowledge needs exceed a single expert’s capacity.

The approach expands research works of methods for tacit knowledge sharing. The continuous updating of matching results and the processing of the data with mixing formats need to be studied further.

The presented approach acts as a valuable reference for the development of knowledge management systems. It can be used in any scene that needs the match between experts and demanders.

The approach provides a new way of helping demanders to find appropriate experts. Both experts’ and demanders’ preferences are considered. A panel of experts is set up when needed. Expert resources are utilized more efficiently and knowledge needs are met more comprehensively.

This research examined the social interactions of online game players based on the proposed motivation model in order to understand the transitions of motivation of online game. The authors also separated samples into four categories to compare the difference of different type of online game players.

This study proposed a motivation model for online game player based on existence–relatedness–growth theory. The authors also analyze the transitions of motivations via first-order and second-order Markov chain switching model to obtain the journey of online to offline socialization.

Teamwork–socialization players preferred to make friends in their online gaming network to socialize. Competition–socialization players were mostly students who played games to compete and socialize and may share experience in online or offline activities. Teamwork–mechanics players purely derived pleasure from gaming and were not motivated by other factors in their gaming activities. Competition–mechanics players may already have friends with other gamers in real life.

More samples can be added to generate more generalizable findings and the proposed motivation model can be extended by other motivations related to online gaming behavior. The authors proposed a motivation model for online to offline socialization and separated online game players into four categories: teamwork–socialization, competition–socialization, teamwork–mechanics and competition–mechanics. The category of teamwork–socialization may contribute to online to offline socialization area. The category of competition–mechanics may add value to the area of traditional offline socialization. The categories of competition–socialization and teamwork–mechanics may help extant literature understand critical stimulus for online gaming behavior.

The authors’ findings can help online gaming industry understand the motivation journey of players through transition. Different types of online games may have various online game player's journey that can assist companies in improving the quality of online games. Online game companies can also offer official community to players for further interaction and experience exchange or the platform for offline activities in the physical environment.

This research proposed a novel motivation model to examine online to offline socializing behavior for online game research. The motivations in model were interconnected via the support of literature. The authors also integrated motivations by Markov chain switching model to obtain the transitions of motivational status. It is also the first attempt to analyze first-order and second-order Markov chain switching model for analysis. The authors’ research examined the interconnected relationships among motivations in addition to the influential factors to online gaming behavior from previous research. The results may contribute to extend the understanding of online to offline socialization in online gaming literature.

This study aims at providing exploratory insights into the initiative and capabilities of Chinese SMEs to develop and utilize diverse networks to support internationalization. Such network development and utilization efforts are fundamental to the analysis and explanation of Chinese firms’ internationalization patterns and outcomes. Extending from the existing network studies in the Chinese context that generally put emphasis on strong‐tie and ethnic‐oriented networks, this paper investigates and explains explicitly the use and effects of both strong‐ and weak‐tie networks in the international development of Chinese SMEs. Indepth case studies on four rapidly internationalized Chinese SMEs are conducted. The case findings demonstrate that weak‐tie networks are essential to the firms’ business development in foreign markets; and were proactively developed and utilized in the course of the firms’ development. The cases also provide alternative perspectives to the beliefs and values underpinning strong‐tie networks presumed in existing literature. The findings draw attention to the changing business values and approaches of the Chinese firms aiming at developing internationally. Managerial implications concerning the significant influence of effective networking on internationalization are pinpointed.