29554681
Uniqueness of the generalized Barker sequence of length 6
It is proven that there is a unique generalized Barker sequence of length 6, modulo the group of Barker-preserving transformations. >
37809849
Sixty-phase generalized Barker sequences
The extension of the list of known generalized Barker sequences to length 19 is proposed. Examples for all lengths up to 19 where the terms of the sequence are sixtieth roots of unity are given. >
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.
17411195
Offer Group Generation and Delayed Processing in Multi-Issue Negotiation
In this paper we describe a mechanism for automated negotiation in which artificial agents can deal with a multi-issue negotiation in a one-to-many way based on some strategies. The negotiation process are governed dynamically by some strategies that emphasize on the diverse processing methods under the considering of different commodity attributes, including dynamic delayed evaluation and response to the received offers, generation of offer group with the same utility. Our analysis shows that the mechanism ensures that bargaining agents could reach a better agreement automatically. We also implement a prototype system to verify the advantages of our mechanism.
10814228
Effective hole-injection layer for non-doped inverted top-emitting organic light-emitting devices
Non-doped inverted top-emitting organic light-emitting diode with high efficiency is demonstrated through employing an effective hole-injection layer composed of MoO"x. One reason for high efficiency lies on the energy-level matching between MoO"x and hole-transport, and another is due to the Ohmic contact formed between MoO"x and Ag. Both of them lead to an improvement of the hole-injection capability from Ag top anode. Moreover, the symmetrical current of ''hole-only'' device with MoO"x shows better hole-injection capability, which is independent of the deposition sequence. The optimized device with MoO"x hole-injection layer exhibits maximum current efficiency of 3.7cd/A at a raised luminance level of 14,900cd/m^2 and a maximum luminance of 47,000cd/m^2 under 18V.
598542
XSEED: Accurate and Fast Cardinality Estimation for XPath Queries
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel, and then incrementally updates information of the synopsis. With such an incremental construction, a synopsis structure can be dynamically configured to accommodate different memory budgets. Cardinality estimation based on XSEED can be performed very efficiently and accurately. Extensive experiments on both synthetic and real data sets show that even with less memory, XSEED could achieve accuracy that is an order of magnitude better than that of other synopsis structures. The cardinality estimation time is under 2% of the actual querying time for a wide range of queries in all test cases.
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.