Interdisciplinary Information Sciences
Online ISSN : 1347-6157
Print ISSN : 1340-9050
ISSN-L : 1340-9050
Volume 8, Issue 1
Displaying 1-12 of 12 articles from this issue
  • How Television Advertising Reveals Political-Economic Development and Change
    Todd Joseph Miles HOLDEN
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 1-14
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    This paper focuses on how advertising formats can be utilized as inductive tools to assess the political, economic, intellectual and cultural “development” of a society. It does so by focusing on two essentially different countries: Japan and Malaysia. We find that while both countries utilize the same four formats identified by Leiss et al. (1990) in their historical survey of American and Canadian print ads, they do so in different measure. Specifically, in Malaysia Product Information and Product Image formats occur with greater frequency, whereas in Japan the Peronalization and Lifestyle forms are more common. Implicit in Leiss et al.’s work was a developmental logic. Simply put, one could hypothesize that nations at a lower level of political-economic development tend to favor the “cruder”, more product-centered formats, while those countries at the higher level more often invoke the more sophisticated, entertainment-oriented communications. The comparative data here tends to confirm this. These associations are bolstered by the fact that in Japan, though not in Malaysia, we encounter a fifth presentation format—what I call the ‘Post-modern Format’. One further task of this paper is to explore an array of postmodern approaches.
     In conclusion I seek to understand why such patterns have resulted. My explanation is twofold. From the production side it involves matters of political organization and economic development—factors impinging on ad creation. From the audience side, it entails semiotics and, in particular, an ad reader’s sign-processing capacity. We end with questions of globalization. Advertising is one of the few “language systems” which has spread worldwide that is also understandable (at some level) to all recipients. Yet, because it is dependant on semiotic literacy and because such literacy is dependent on political and economic factors rooted in the context, the question whether Malaysian advertising will ever “develop” to the level of Japanese advertising —with a similar dominant status in society—is yet an open question.
    Download PDF (2033K)
  • Tsutomu KAWAUCHI, Takahiko HARIYAMA, Yasuo TSUKAHARA
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 15-24
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    The eyes of the fly have been employed in an extensive range of studies, but the existence of diurnal rhythmicity, which is involved in the adaptation to different light environments between the day and night is still unclear. The rhythmicity of the photoreceptor cells of the blowfly Lucilia cuprina was observed over a precise time schedule under a daily light cycle. Both the morphology of the photoreceptive structure called rhabdom and the amount of the visual pigment chromophore were mostly constant. Each photoreceptor area measured from the cross sections and each amount of chromophore was ca. 22.5±1.85 μm2 and ca. 1.4 pmol, respectively. The number of the multivesicular bodies, assuming the indicator of the photoreceptive membrane turnover, was small compared with other reports of arthropods. We confirmed that there is no diurnal rhythmicity either in the morphology of rhabdom or in the visual pigment contents under the daily light cycles.
    Download PDF (7219K)
  • Hanayo HONKAWA, Osamu HISATOMI, Yoshihiro KISHIDA, Fumio TOKUNAGA
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 25-32
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    Guanylate cyclase activating protein (GCAP1 and 2) is a Ca2+-sensitive regulator of the retinal membrane guanylate cyclases (GCs). In mammalian retina, GCAP1 is localized in cones and GCAP2 is present in rods, cones and other retinal cells. Here we isolated two kinds of cDNAs encoding putative medaka GCAPs (OlGCAP1 and OlGCAP2). Sequence analysis and characterization of recombinant proteins indicate that OlGCAP1 and 2 are closely related to mammalian GCAP1 and 2, respectively, and that OlGCAP1 and 2 appear to regulate GCs in a manner similar to that of mammalian GCAPs. However, in situ hybridization and immunocytochemistry suggest that both OlGCAP1 and 2 coexist mainly in rods, and that OlGCAP1, but not OlGCAP2, is present in the inner nuclear layer and ganglion cell layer, indicating that localization of these medaka GCAPs is totally different from that of mammalian GCAPs. The Ca2+-feedback system in vertebrate retinal phototransduction may be evolved in the expression of GCs and GCAPs in photoreceptors.
    Download PDF (4237K)
  • Kazuyuki TANAKA, Tsuyoshi HORIGUCHI
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 33-50
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    For image restoration as an energy minimization problem, an energy function is expressed by using a hamiltonian of a classical spin system only with finite range interactions. The problem is formulated in terms of a probabilistic model with a Gibbs distribution and hence may be regarded as a Markov random field model. We compare the results obtained by proposed methods with those obtained by the probabilistic computational algorithms for restoration of natural images within a framework of the mean-field approximation or the pair approximation. We clarify a role of Nishimori-Wong’s inequality in the Markov random field model as for the practical algorithms to the image restoration of natural images through some numerical experiments.
    Download PDF (2678K)
  • Yasuyuki KOBAYASHI, Katumasa TARU
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 51-56
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    Backward Induction Method, which is the most basic algorithm for game tree search, has two weak points. The move selected by Backward Induction Method is assured the best move as far as the search depth of the game tree but not necessary the best move at the end of the game. Also the evaluation values for leaf nodes do not necessarily present the best advantage at the end of the game.
     In this paper for a game tree search in endgame phase we propose a new algorithm, probability method, which is useful on the game over with the constant moves such as Othello game. We show that probability method is more effective than Backward Induction Method for the selection of just before two players can search till the end of the game.
    Download PDF (304K)
  • Eikoh CHIDA, Li LI, Hiroki SHIZUYA
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 57-61
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    Intuitively, a function ƒ(fnof) is zero-way if, without a trapdoor, both computing ƒ and computing ƒ-1 are hard. We first point out that there exists a counterexample for the generic method to construct zero-way functions shown by Niemi-Renvall in Asiacrypt’94. We then give some examples of zero-way functions that are provably hard to compute, that is computing ƒ and ƒ-1 is proven to be as hard as breaking the Diffie-Hellman key exchange scheme or breaking the RSA cryptosystem.
    Download PDF (378K)
  • Ryo HIRADE, Toshiya ITOH
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 63-76
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    The metric travelling salesman problem Δ-Tsp is the traveling salesman problem in which the distances among cities satisfy the triangle inequality. In this paper, we consider the matric traveling salesman problem Δ(1,2)-Tsp with distances one and two and Δ(1,2,3)-Tsp with distances one, two, and three as the special cases of Δ-Tsp. Since Δ(1,2)-Tsp is NP-complete, it is NP-hard to find an optimal solution for Δ(1,2)-Tsp. So in polynomial time, we with to find an approximate solution for Δ(1,2)-Tsp. However Δ(1,2)-Tsp is APX-complete, there is a nontrivial approximation lower bound for Δ(1,2)-Tsp. For any ε>0, Engebretsen showed that it is NP-hard to approximate the symmetric Δ(1,2)-Tsp within 5381/5380-ε; the asymmetric Δ(1,2)-Tsp within 2805/2804-ε, and Böchenhauer, et al. showed that it is NP-hard to approximate the symmetric Δ(1,2,3)-Tsp within 3813/3812-ε. In this paper, we improve those lower bounds and show that for any ε>0, it is NP-hard to approximate the symmetric Δ(1,2)-Tsp within 1027/1026-ε (Corollary 4.5); the asymmetric Δ(1,2)-Tsp within 535/534-ε (Corollary 4.7); the symmetric Δ(1,2,3)-Tsp within 817/816-ε (Theorem 5.2); the asymmetric Δ(1,2,3)-Tsp within 364/363-ε (Theorem 5.3). We also show that for any ε>0, it is NP-hard to approximate Shortest-Superstring within 1279/1278-ε (Corollary 6.3).
    Download PDF (1000K)
  • Toshiya ITOH
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 77-88
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    In a factory, we need to make capital investments in machines for manufacturing a product. In this paper, we deal with the convex case capital investment such that more expensive machines have cheaper production costs. What we with to achieve is to design a good online algorithm that minimizes the sum of the production and capital costs when the production request and investment opportunities in the future are unknown. Azar, et al. proposed an (online) algorithm Convex for the convex case capital investment and showed that it is (4+2√2)-competitive. In this paper, we investigate the competitive ratio of the convex case capital investment more precisely and show that (1) for the convex case capital investment, the competitive ratio of the algorithm Convex is at least 4+2√2-ε for any ε>0 (Theorem 3.3). In the practical point of view, we introduce a notion of “γ-restricted” to the convex case capital investment and show that (2) for the γ-restricted convex case capital investment, the competitive ratio of the algorithm Convex is at most 5+4/(γ−4) for any γ≥6 (Theorem 4.3); (3) for the γ-restricted convex case capital investment, the competitive ratio of the algorithm Convex is at least 5−ε for any ε>0 (Theorem 4.4). Finally, we also show that the competitive ratio of the γ-restricted convex case capital investment is at least 2−ε for any ε>0 (Theorem 5.4).
    Download PDF (652K)
  • Takashi KUROSE
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 89-100
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    Conformal-projective geometry of statistical manifolds, a natural generalization of conformal geometry of Riemannian manifolds, is studied in this paper. In particular, several fundamental results in the geometry are given: a geometric criterion for two statistical manifolds to be conformally-projectively equivalent; conditions for a statistical manifold to be conformally-projectively flat; properties of umbilical hypersurfaces of a conformally-projectively flat statistical manifold.
    Download PDF (657K)
  • Masakazu NOGUCHI
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 101-113
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    The aim of this paper is to give explicitly the solution of the shifted wave equation on Damek-Ricci space which is a semidirect extension of the generalized Heisenberg groups. As its application, we show that Huygens’ principle holds for every odd-dimensional Damek-Ricci space.
    Download PDF (610K)
  • Katsushi MURAMOTO, Tatsuya OKADA, Takeshi SEKIGUCHI, Yasunobu SHIOTA
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 115-121
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    Let b(n,w) be the number of occurrences of subblock w in the p-adic expansion of n ∈ N and set B(N,w)=Σn=0Nb(n,w) for N ∈ N. Properties of the value of B(N,w) were investigated by Prodinger [8] (for p=2) and by Kirschenhofer [3] (for a general p). In this paper we give a simple representation of B(N,w) by means of previous result [5] on the explicit formula of generalized power and exponential sums of digital sums.
    Download PDF (238K)
  • Fuichi UCHIDA
    Article type: Others
    Subject area: Others
    2002 Volume 8 Issue 1 Pages 123-128
    Published: 2002
    Released on J-STAGE: October 31, 2002
    JOURNAL FREE ACCESS
    We shall study smooth SL(m,R)×SL(n,R) actions on Sm+n-1, each of which is an extension of the standard SO(m)×SO(n) action. We shall show such an action is characterized by a smooth R2-action on the circle. Moreover, we shall show there are uncountably many topologically distinct such extensions.
    Download PDF (287K)
feedback
Top