International Journal of Advanced Science and Technology

10

Authors: Bahman Nikkhahan, Akbar Jangi Aghdam and Sahar Sohrabi

Security is one of the most important issues in E-government. All of the security approaches that are common in E-commerce are applicable to E-government. But E-government is a little different from E-commerce. Usually government networks can communicate to each other better than business networks, because, most of them are connected for transferring information, but businesses are competitors and they don't disclose their sensitive information. Utilizing "honeypots" is a good solution for tracing hackers and revealing their tools. In this paper, "connectedness" of E-government networks and honeypots are employed to propose an approach for securing an E-government network. This framework provides suitable resources for hackers; and simultaneously, it prevents them from misusing those resources for future attacks.

14

Authors: Peilin Shi

The interests of web users can be revealed by their visited web pages and time duration on these web pages during their surfing. Time duration on a web page is characterized as a fuzzy linguistic variable because linguistic variable makes users easily understand the expression of time duration and can disregard subtle difference between two time durations. Each web access pattern from web logs is transformed as corresponding fuzzy web access pattern, which is a fuzzy vector composed of fuzzy linguistic variables or 0. Each element in fuzzy web access patterns represents visited web page and time duration on this web page. This paper proposed a rough k-means clustering algorithm based on properties of rough variable to group the gained fuzzy web access patterns. Finally, an example and experiment is provided to illustrate the clustering process. Using this approach, users can effectively mine web logs records to discover interesting user access patterns.

20

Authors: Anestis A. Toptsis, Rahul A. Chaturvedi, and Avaz Feroze

Multi-process bidirectional heuristic search algorithms (such as PBA*) that utilize island nodes have been shown to have the potential for exponential speedup over their plain counterparts that do not utilize island nodes. PBA* (Parallel Bidirectional A*) is a primary algorithm in this area and, to the best of our knowledge, unique in its usage of island nodes for reducing the size of the traversed search space and in its usage of multidimensional heuristics for reducing interprocess communication cost. Both, island nodes use and reference nodes use within the context of multidimensional heuristics have been reported to provide excellent performance, compared to plain heuristic search counterparts. However, both of these two features have also resisted refinements for over two decades. Specifically, the two main issues are: how to identify well-placed (in the state space) island nodes, and how to generate well-placed reference nodes. The work presented in this paper is an initial step toward this end. We present two methods, one employing Voronoi diagrams for the purpose of identifying well-placed island nodes, and one employing Kohonen Networks for the purpose of identifying well-placed reference nodes. We implement and compare our methods against a plain version of PBA*. Our finding indicate that the cost of incorporating the proposed improvements into PBA* is negligible; and when PBA* is equipped with the island identification method, or with the reference node identification method, it outperforms its random island nodes counterpart and its random reference nodes counterpart, respectively, for the vast majority of test cases.