Search Results 1-20 of 29

  • 1 / 2
  • Selecting inversions in a chord progression with the triad by a lexicographic bi-criteria optimization

    KARUNO Yoshiyuki , YOSHII Ryota

    … jobs are served by the <i>m</i>-machine system in their indexing order. … The lexicographic machine subset selection problem is motivated by a musical issue of selecting inversions in a chord progression with the triad. … In this paper, we propose a polynomial time exact algorithm for the lexicographic machine subset selection problem. …

    Journal of Advanced Mechanical Design, Systems, and Manufacturing 14(5), JAMDSM0068-JAMDSM0068, 2020

    J-STAGE 

  • Product Extension Rings and Partially Ordered Rings

    Yoshimi KITAMURA , Yoshio TANAKA

    Bulletin of Tokyo Gakugei University. Natural sciences 68, 13-23, 2016-09

    IR 

  • Cognitive Effort and Accuracy of Decision Strategies in Multi-Attribute Decision Making Process::A Behavioral Decision Theoretic Approach Using Computer Simulation Technique  [in Japanese]

    Takemura Kazuhisa , Haraguchi Ryohei , Tamari Yuki

    … The elementary strategies<br>examined in the simulation were nine decision strategies: lexicographic, lexicographic<br>semi-order, elimination by aspect, conjunctive, disjunctive, weighted additive, equally<br>weighted additive, additive difference, and majority of confirming dimensions strategies.<br>Elementary information process and relative accuracy were computed for all combina-<br>tion of two decision strategies for two-phased decision making process. …

    Cognitive Studies 22(3), 368-388, 2015

    J-STAGE 

  • A NOTE ON GRADED BETTI NUMBERS OF COOMPLETELY m-FULL IDEALS

    Harima Tadahito , Isogawa Satoru , Watanabe Junzo

    … We give a new proof of the characterization theorem for completely m-full ideals stated as follows: completely m-full ideals are characterized as the ideals that have the same graded Betti numbers as those of their generic initial ideals with respect to the reverse lexicographic order, provided their generic initial ideals are stable. …

    新潟大学教育学部研究紀要. 自然科学編 7(1), 1-6, 2014

    IR 

  • Ranking and Unranking of Non-regular Trees in Gray-Code Order

    WU Ro-Yu , CHANG Jou-Ming , CHEN An-Hang , KO Ming-Tat

    … (2010) introduced a concise representation called RD-sequences to represent all non-regular trees and proposed a loopless algorithm for generating all non-regular trees in a Gray-code order. … In this paper, based on such a Gray-code order, we present efficient ranking and unranking algorithms of non-regular trees with <i>n</i> …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 96(6), 1059-1065, 2013-06-01

    J-STAGE  References (23)

  • THE INCIDENCE ALGEBRA OF POSETS AND ACYCLIC CATEGORIES

    QUINN David

    … We show that this ideal has a quadratic Gröbner basis with a lexicographic monomial order if and only if the poset or acyclic category is lexshellable. …

    Kyushu Journal of Mathematics 67(1), 117-127, 2013

    J-STAGE 

  • Lexicographic ranking and unranking of derangements in cycle notation  [in Japanese]

    MIKAWA Kenji , TANAKA Ken

    … We present lexicographic ranking and unranking algorithms for derangements represented in cycle notation. …

    Technical report of IEICE. VLD 112(114), 93-96, 2012-06-25

    References (8)

  • Lexicographic ranking and unranking of derangements in cycle notation  [in Japanese]

    MIKAWA Kenji , TANAKA Ken

    … We present lexicographic ranking and unranking algorithms for derangements represented in cycle notation. …

    IEICE technical report. Circuits and systems 112(113), 93-96, 2012-06-25

    References (8) Cited by (1)

  • Lexicographic ranking and unranking of derangements in cycle notation  [in Japanese]

    MIKAWA Kenji , TANAKA Ken

    … We present lexicographic ranking and unranking algorithms for derangements represented in cycle notation. …

    Mathematical Systems Science and its Applications : IEICE technical report 112(116), 93-96, 2012-06-25

    References (8)

  • Lexicographic ranking and unranking of derangements in cycle notation  [in Japanese]

    MIKAWA Kenji , TANAKA Ken

    … We present lexicographic ranking and unranking algorithms for derangements represented in cycle notation. …

    IEICE technical report. Signal processing 112(115), 93-96, 2012-06-25

    References (8)

  • Faster analysis of malware log using Knuth Bendix completion algorithm  [in Japanese]

    安藤 類央 , 三輪 信介

    コンピュータセキュリティシンポジウム2011 論文集 2011(3), 101-106, 2011-10-12

    IPSJ 

  • Ranking and Unranking of t-Ary Trees Using RD-Sequences

    WU Ro-Yu , CHANG Jou-Ming , WANG Yue-Li

    … A result reveals that there exists a close relationship between the representation and the well-formed sequences suggested by Zaks [Lexicographic generation of ordered trees, <i>Theoretical Computer Science</i> … Consequently, we develop efficient algorithms for determining the rank of a given <i>t</i>-ary tree in lexicographic order (i.e., a ranking algorithm), and for converting a positive integer to its corresponding RD-sequence (i.e., an unranking algorithm). …

    IEICE Transactions on Information and Systems E94-D(2), 226-232, 2011

    J-STAGE  Cited by (1)

  • APPARENT CONTOURS WITH MINIMAL NUMBER OF SINGULARITIES

    YAMAMOTO Takahiro

    … In this paper, in a given homotopy class, we will determine the minimal triples (<I>c</I>, <I>i</I>, <I>n</I>), (<I>n</I>, <I>c</I>, <I>i</I>) and (<I>i</I>, <I>n</I>, <I>c</I>) with respect to the lexicographic order. …

    Kyushu Journal of Mathematics 64(1), 1-16, 2009

    IR  J-STAGE 

  • On State-Merging Strategies of RPNI Algorithm that Guarantee Identifiability in the Limit

    NUMAI Yuji , KOBAYASHI Satoshi

    … RPNI employs the length-lexicographic total order as a state-merging strategy (SMS). …

    IPSJ SIG Notes 118, 9-16, 2008-05-20

    References (8)

  • A Model of Advancement Rate and Intergenerational Social Mobility

    HAMADA Hiroshi

    … In order to derive general propositions that do not depend on the particular values of parameters, we simply assume that a society consists of four types of subgroups, namely, the combinations of high/low education and high/low class origin, and that a person with high education is more likely to enter the high class. … The former is called the lexicographic order model; …

    Japanese Sociological Review 58(4), 608-624, 2008

    J-STAGE 

  • Algebraic Expression of Solutions for Harmonic Balance Method using Error Bound

    YAGI Masakazu , HISAKADO Takashi

    … In order to obtain the zero dimensional ideal using Grobner base of lexicographic order, we need tremendously large computational cost. …

    IEICE technical report 106(413), 33-38, 2006-12-06

    References (12)

  • Lexicographic Path Ordering for Proving Termination of Functional Programs  [in Japanese]

    HOSHINO Yumi , KUSAKARI Keiichirou , SAKAI Masahiko , SAKABE Toshiki , NISHIDA Naoki

    … Reduction order is an important tool for proving termination. … As typical reduction orders, we know lexicographic path orderings whose well-foundedness are ensured by the notion of simplification order. … In this paper, we propose three extended lexicographic path orderings in order to deal with higher-order functions. …

    IEICE technical report 105(597), 13-18, 2006-02-03

    References (4)

  • AVOIDING CANNIBALISATION AND/OR COMPETITOR REACTION IN PLANAR SINGLE FACILITY LOCATION

    Plastria Frank

    … We study the lexicographic optimisation problem with primary objective to maximise the total market share of the chain, and secondarily to minimise the market losses of friendly facilities and/or the risk that competing facilities would raise their current quality in order to gain back lost customers. …

    Journal of the Operations Research Society of Japan 48(2), 148-157, 2005

    J-STAGE  References (24)

  • Higher-Order Path Orders Based on Computability

    KUSAKARI Keiichirou

    … STRSs can be naturally handle higher order functions, which are widely used in existing functional programming languages. … In this paper we design recursive and lexicographic path orders, which can efficiently prove the termination of STRSs. …

    IEICE transactions on information and systems 87(2), 352-359, 2004-02-01

    IR  References (17) Cited by (11)

  • Succinct Data Structures for Longest Common Preflx Information

    SADAKANE Kunihiko

    … It occupies only 2n+o(n) bits for a string of length n for computing the length of lcp between adjacent suffixes in lexicographic order inconstant time, and 6n+o(n) bits between two arbitrary suffixes. …

    IPSJ SIG Notes 83, 19-26, 2002-03-15

    References (16)

  • 1 / 2
Page Top