14,985 research outputs found

    Cyclic inheritance detection for object-oriented database

    Get PDF
    [[abstract]]Inheritance is the main theme of schema design for the object-oriented software and object-oriented database. Misuse of inheritance will lead to cyclic inheritance which suffers from redundant classes and endless self-inheritance. For a class hierarchy with cyclic inheritance, to detect all the cyclic inheritances is a NP-complete problem. A graph-theoretical reduction methodology to reduce them in polynomial time is described. An algorithm to support this reduction is presented.[[conferencetype]]國際[[conferencedate]]19921111~19921113[[iscallforpapers]]Y[[conferencelocation]]Melbourne, Vic., Australi

    The Irrelevant Values Problem of Decision Tree for Improving a Glass Sputtering Process

    Get PDF
    [[abstract]]In this paper, we use decision tree to establish a yield improvement model for glass sputtering process; however, the tree may have irrelevant values problem. In other words, when the tree is represented by a set of rules, not only comprehensibility of the resultant rules will be detracted but also critical factors of the manufacturing process cannot be effectively identified. From the performance issue and practical issue, we have to remove irrelevant conditions from the rules; otherwise, a domain expert is needed to review the decision tree. In this paper, we use a very simple example to demonstrate this point of view. Moreover, to identify and remove irrelevant conditions from the rules, we also revise Chiang's previous algorithm such that the modified algorithm can deal not only discrete data but also quantitative data.[[notice]]補正完畢[[incitationindex]]EI[[booktype]]紙

    A privacy-preserving fuzzy interest matching protocol for friends finding in social networks

    Get PDF
    Nowadays, it is very popular to make friends, share photographs, and exchange news throughout social networks. Social networks widely expand the area of people’s social connections and make communication much smoother than ever before. In a social network, there are many social groups established based on common interests among persons, such as learning group, family group, and reading group. People often describe their profiles when registering as a user in a social network. Then social networks can organize these users into groups of friends according to their profiles. However, an important issue must be considered, namely many users’ sensitive profiles could have been leaked out during this process. Therefore, it is reasonable to design a privacy-preserving friends-finding protocol in social network. Toward this goal, we design a fuzzy interest matching protocol based on private set intersection. Concretely, two candidate users can first organize their profiles into sets, then use Bloom filters to generate new data structures, and finally find the intersection sets to decide whether being friends or not in the social network. The protocol is shown to be secure in the malicious model and can be useful for practical purposes.Peer ReviewedPostprint (author's final draft

    Universal critical properties of the Eulerian bond-cubic model

    Full text link
    We investigate the Eulerian bond-cubic model on the square lattice by means of Monte Carlo simulations, using an efficient cluster algorithm and a finite-size scaling analysis. The critical points and four critical exponents of the model are determined for several values of nn. Two of the exponents are fractal dimensions, which are obtained numerically for the first time. Our results are consistent with the Coulomb gas predictions for the critical O(nn) branch for n<2n < 2 and the results obtained by previous transfer matrix calculations. For n=2n=2, we find that the thermal exponent, the magnetic exponent and the fractal dimension of the largest critical Eulerian bond component are different from those of the critical O(2) loop model. These results confirm that the cubic anisotropy is marginal at n=2n=2 but irrelevant for n<2n<2

    Revealing two radio active galactic nuclei extremely near PSR J0437-4715

    Full text link
    Newton's gravitational constant GG may vary with time at an extremely low level. The time variability of GG will affect the orbital motion of a millisecond pulsar in a binary system and cause a tiny difference between the orbital period-dependent measurement of the kinematic distance and the direct measurement of the annual parallax distance. PSR J0437-4715 is the nearest millisecond pulsar and the brightest at radio. To explore the feasibility of achieving a parallax distance accuracy of one light-year, comparable to the recent timing result, with the technique of differential astrometry, we searched for compact radio sources quite close to PSR J0437-4715. Using existing data from the Very Large Array and the Australia Telescope Compact Array, we detected two sources with flat spectra, relatively stable flux densities of 0.9 and 1.0 mJy at 8.4 GHz and separations of 13 and 45 arcsec. With a network consisting of the Long Baseline Array and the Kunming 40-m radio telescope, we found that both sources have a point-like structure and a brightness temperature of \geq107^7 K. According to these radio inputs and the absence of counterparts in the other bands, we argue that they are most likely the compact radio cores of extragalactic active galactic nuclei rather than Galactic radio stars. The finding of these two radio active galactic nuclei will enable us to achieve a sub-pc distance accuracy with the in-beam phase-referencing very-long-baseline interferometric observations and provide one of the most stringent constraints on the time variability of GG in the near future.Comment: 9 pages, 3 tables, 3 figures. Accepted for publication in MNRA
    corecore