2529824
Topological Structure and Interest Spectrum of the Group Interest Network
In this paper, the behavior characteristics that the specifical campus group users accessing world wide web has been studied, the dynamic group interest network has been constructed, which was a para-bipartite graph and the topological structure had been discussed. Although the users’ visiting time is random and the web pages they visited are different but the interests of a majority of the campus group are accordant. The results indicate that the incoming degree distribution of the group interest network follows power law. And the group interest spectrum was basically steady. The visiting behavior of the campus group had their special disciplinarian.
38830410
Characteristics of the Group Interest Network
By studying the behavior characteristics visiting world wide web of the specifically campus group, this paper constructed dynamic group interest network, which was a para-bipartite graph. The time features that the group user visited world-wide-web had been observed, the topological structure had been discussed. The degree exponents had been drafted for the one week data. Although the users' visiting time is random and their surfing pages were different but the interests of a majority of the campus group were accordant. The results indicate that the incoming degree distribution of the group interest network follows power law. And the group interest spectrum was basically steady. The visiting behavior of the campus group had their special disciplinarian.
16355724
The Bipartite Network Study of the Library Book Lending System
Through collecting the library lending information of the University of Shanghai for Science and Technology during one year, we build the database between the books and readers, and then construct a bipartite network to describe the relationships. We respectively establish the corresponding un-weighted and weighted bipartite network through the borrowing relationship and the reading days, thereout obtain the statistical properties via the theory and methods of complex network. We find all the properties follow exponential distribution and there is a positive correlation between the relevant properties in un-weighted and weighted networks. The un-weighted properties can describe the cooperation situation and configuration, but the properties with node weight may describe the competition results. Besides, we discuss the practical significance for the double relationship and the statistical properties. Further more, we propose a library personal recommendation system for developing the library humanity design resumptively.
7396264
Pseudo-Randomness of Discrete-Log Sequences from Elliptic Curves
We investigate an upper bound on the discrepancy and a lower bound on the linear complexity of a class of sequences, derived from elliptic curves by using discrete logarithm in this paper. The results indicate that these sequences may have `nice' pseudo-random properties. The important tool in the proof is certain character sums estimate along elliptic curves. In addition, we apply linear recurrence relation over elliptic curves to output binary sequences with very interesting pseudo-random behavior.
11505780
InterJoin: Exploiting Indexes and Materialized Views in XPath Evaluation
XML has become the standard for data exchange for a wide variety of applications, particularly in the scientific community. In order to efficiently process queries on XML representations of scientific data, we require specialized techniques for evaluating XPath expressions. Exploiting materialized views in query processing significantly enhances query processing performance. We propose a novel view definition that allows for intermediate (structural) join results to be stored and reused in XML query evaluation. Unlike current XML view proposals, our views do not require navigation in the original document or path-based pattern matching. Hence, they are evaluated significantly faster and are easily costed as part of a query plan. In general, current structural joins cannot exploit views efficiently when the view definition is not a prefix (or a suffix) of the XPath query. To increase the applicability of our proposed view definition, we propose a novel physical structural join operator called InterJoin. The InterJoin operator allows for joining interleaving XPath expressions, e.g., joining //A//C with //B to evaluate //A//B//C. InterJoin allows for more join alternatives in XML query plans. We propose several physical implementations for InterJoin, including a technique to exploit spatial indexes on the inputs. We give analytic cost models for the implementations so they can be costed in an existing XML query optimizer. Experiments on real and synthetic XML data show significant speed-ups of up to 200% using InterJoin, and speed-ups of up to 400% using our materialized views
9362943
Finding shortest paths in large network systems
This paper describes a disk-based algorithm for finding shortest paths in a large network system. It employs a strategy of processing the network piece by piece and is based on new algorithms for graph partitioning and for finding shortest paths that overcome the problem of existing approaches. To show that it is scalable to large network systems and is adaptable to different computing environments, seven states in Tiger/Line files are extracted as test cases and are experimented on machines with different configurations. The running time for finding the shortest path depends primarily on the power of the underlying systems. Moreover, to run the algorithm optimally, the memory requirement is not large, even for a very large network system such as the road system in several states in Tiger/Line file. To evaluate its performance, New Mexico state road system is used as the test case, and is compared with Dijkstra's algorithm. The average running time of the proposed algorithm is, in the worst case, about two and a half times slower than that of Dijkstra's algorithm; provided that in Dijkstra's algorithm, the whole graph can be fit into main memory and is already loaded in advance. If the I/O time for loading the whole graph is counted, the proposed algorithm is faster in essentially all cases.
2918771
DiSigncryption: an integration of agent-based signature delegation with distributed reputation management scheme
This paper presents a distributed signcryption with verifiable partial signature (DiSigncryption) protocol that allows a mobile agent owner, participating in e-commerce transaction, to securely delegate and distribute his/her signing capability among a set of trusted third party hosts (TTP-hosts) via a mobile agent. The protocol incorporates three schemes: a novel distributed reputation management scheme, a modified version of the distributed signcryption method proposed in [Y. Mu et al., (2000)], and the agent-based threshold proxy signcryption (ATPS) protocol proposed in [O. Bamasak et al., (2004)]. The most notable feature of the DiSigncryption protocol is that, in addition to allowing secure distributed proxy signature generation, it enables the agent owner to quantitatively assess the trust and reliability of each of the TTP-hosts that s/he has dealt with. These trust and reliability values are then aggregated into an index to guide the agent owner in making his/her decision as which TTP-hosts should be used in his/her next dealing. The security properties of the proposed protocol are analyzed, and the protocol is compared with the most related work.
23948133
Building Domain Ontology Based on Web Data and Generic Ontology
The automatic or semi-automatic construction of ontology has become a research topic of interest in recent years. This paper describes a mechanism for constructing domain specific ontologies automatically based on web data and generic ontology. Firstly, we employ the hierarchical agglomerative clustering(HAC) algorithm, clustering web pages hierarchically and resulting in a binary tree. Then an algorithm is proposed, which selectd from the binary tree the significative nodes as topics implying concepts of domain interests. Lastly, the Chinese generic ontology, HowNet, is introduced to evolve the topics (together with their hierarchical structures) into domain ontology. We experiment our method in the field of computer hardware based on web pages collected from Chinese BtoC web sites. An in-depth discussion on the experiment results is also given.