NON-DECREASING SEQUENCE DETERMINING DEVICE, NON-DECREASING SEQUENCE DETERMINING METHOD, AND PROGRAM
    3.
    发明公开
    NON-DECREASING SEQUENCE DETERMINING DEVICE, NON-DECREASING SEQUENCE DETERMINING METHOD, AND PROGRAM 审中-公开
    非降低序列确定装置,非降低序列确定方法和程序

    公开(公告)号:EP3206201A1

    公开(公告)日:2017-08-16

    申请号:EP15849344.5

    申请日:2015-10-05

    IPC分类号: G09C1/00 G06F9/44 H04L9/28

    摘要: Determination as to whether a nondecreasing sequence exists or not is efficiently made. A sorting part 10 sorts elements of a set P i in ascending order to generate vectors t i,i+1 and b i,i+1 . A merging part 20 generates vectors t 0,m and b 0,m by repeating the process of merging vectors (t i,j , b i,j ) and (t j,k , b j,k ) to generate (t i,k , b i,k ). A stable-sorting part 21 generates a vector e by coupling and stably sorting vectors b i,j and t j,k . A searching part 22 searches for sets of (λ, x, y) in which e[λ] is b i,j [x] and e[λ + 1] is t j,k [y] and generates a set X including all x and a set Y including all y. An extracting part 23 sorts t i,j [x] (x ∈ X) in ascending order to generate a vector t i,k and sorts b j,k [y] (y ∈ Y) in ascending order to generate a vector b j,k . If the length of a vector t 0,m is 0, a determining part 30 outputs a result of determination that indicates the absence of a nondecreasing sequence.

    摘要翻译: 确定是否存在非降序序列是有效的。 分类部分10按升序对集合Pi的元素进行排序以生成向量ti,i + 1和bi,i + 1。 合并部分20通过重复合并向量(ti,j,bi,j)和(tj,k,bj,k)以生成(ti,k,bi,k)的过程来生成向量t0,m和b0, 。 稳定分类部分21通过耦合并稳定地分类矢量bi,j和tj,k来生成矢量e。 搜索部分22搜索其中e [λ]是bi,j [x]和e [λ+ 1]是tj,k [y]的(λ,x,y)的集合并且生成包括全部x 和包含所有y的集合Y. 提取部分23按照升序对ti,j [x](x∈X)进行排序以生成向量ti,k并且按升序对bj,k [y](y∈Y)进行排序以生成向量bj,k。 如果向量t0,m的长度为0,则确定部件30输出指示不存在非减少序列的确定结果。

    NON-DECREASING SEQUENCE DETERMINING DEVICE, NON-DECREASING SEQUENCE DETERMINING METHOD, AND PROGRAM

    公开(公告)号:EP3206201A4

    公开(公告)日:2018-06-06

    申请号:EP15849344

    申请日:2015-10-05

    IPC分类号: G09C1/00 G06F9/44 H04L9/28

    摘要: Determination as to whether a nondecreasing sequence exists or not is efficiently made. A sorting part 10 sorts elements of a set P i in ascending order to generate vectors t i,i+1 and b i,i+1 . A merging part 20 generates vectors t 0,m and b 0,m by repeating the process of merging vectors (t i,j , b i,j ) and (t j,k , b j,k ) to generate (t i,k , b i,k ). A stable-sorting part 21 generates a vector e by coupling and stably sorting vectors b i,j and t j,k . A searching part 22 searches for sets of (», x, y) in which e[»] is b i,j [x] and e[» + 1] is t j,k [y] and generates a set X including all x and a set Y including all y. An extracting part 23 sorts t i,j [x] (x ˆˆ X) in ascending order to generate a vector t i,k and sorts b j,k [y] (y ˆˆ Y) in ascending order to generate a vector b j,k . If the length of a vector t 0,m is 0, a determining part 30 outputs a result of determination that indicates the absence of a nondecreasing sequence.