Location:
Search - IK
Search list
Description: 反向动力学模型，可用于跟踪计算人体上肢各参数。-IK model, can be used to track human body upper arm.
Platform: |
Size: 32768 |
Author: tuzhiguo |
Hits:
Description: 克里金方法fortran编程：地球科学领域的局部不确定性的2维自动化无参数模型代码-AUTO-IK: a 2D indicator kriging program for the automated non-parametric modeling of local uncertainty in earth sciences
Platform: |
Size: 433152 |
Author: lxf |
Hits:
Description: 最经典的学习OPENGL FK 骨骼动画源码.更多游戏编程相关内容,如场景导入和管理,碰撞和物理引擎,刚性动力学,IK动画,场景编辑器,T&L和可编程SHADER,特效等,都可依照此例为基础扩展下去.NEHE的教程只是一个个分散的历程,但自己亲自动手写引擎的话,最好有一个基础的稳定架构,此例作基础比较合适.-The most classic of learning OPENGL FK skeleton animation source, the original author along the source can find the source notes and additional documentation, understanding, after some slight modifications, they can reverse their own dynamics into animation IK
Platform: |
Size: 2050048 |
Author: 何中求 |
Hits:
Description: 计算机所的专家们写的IK反向动力学原理说明,非常详细.顺着文章中的专业术语和参考文献指引,可以找到更多相关的详细资料.-The computer experts note written response dynamics, very detailed.
Platform: |
Size: 84992 |
Author: 何中求 |
Hits:
Description: assignmentsneed to me performede as ad af ik long need ghost
Platform: |
Size: 201728 |
Author: cguru |
Hits:
Description: 最长公共子序列问题描述与实验目的：
序列Z=<B，C，D，B>是序列X=<A，B，C，B，D，A，B>的子序列，相应的递增下标序列为<2，3，5，7>。
一般地，给定一个序列X=<x1,x2,…,xm>，则另一个序列Z=<z1,z2,…,zk>是X的子序列，是指存在一个严格递增的下标序列〈i1,i2,…,ik〉使得对于所有j=1,2,…,k使Z中第j个元素zj与X中第ij个元素相同。
给定2个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。
你的任务是：给定2个序列X、Y，求X和Y的最长公共子序列Z。
输入样例
2
7 6
A B C B D A B
B D C A B A
8 9
b a a b a b a b
a b a b b a b b a
输出
Case 1
4 LCS(X,Y):B C B A
Case 2
6 LCS(X,Y):a b a b a b
-Longest common subsequence problem
Description and Purpose:
Z = <B,C,D,B> sequence is the sequence X = <A,B,C,B,D,A,B> the sequence, the corresponding sequence of increasing subscript <2,3,5,7 >.
In general, given a sequence X = <x1,x2,…,xm>, then another sequence Z = <z1,z2,…,zk> is a sub-sequence of X, is the existence of a strictly increasing sequence subscript <i1,i2,…,ik> such that for all j = 1,2, ..., k so that the first j elements Z zj and X the same as the first element ij.
Given two sequences X and Y, when another sequence Z as X, Y promoter sequence is a sub sequence, said sequence of X and Y Z is the common subsequence.
Your task is: given two sequences X, Y, X and Y find the longest common subsequence Z.
Input sample
2
76
A B C B D A B
B D C A B A
89
b a a b a b a b
a b a b b a b b a
Output
Case 1
4 LCS (X, Y): B C B A
Case 2
6 LCS (X, Y): a b a b a b
Platform: |
Size: 872448 |
Author: wscnwps |
Hits:
Description: IK ANALYZER 一个进行中文分词的软件-a chinese word-splitting tool
Platform: |
Size: 1192960 |
Author: zhuth |
Hits:
Description: 实验电路如图25，按虚线连接电路：CLK0接1MHz，GATE0，GATE1，接+5V，OUT0接CLK1，OUT1接PA0，PC0接继电器驱动电路的开关输入端Ik。继电器常开触点串联一个220V灯泡，接交流220V。编程使用8253定时，让继电器周而复始的闭合5秒钟（指示灯灯亮），断开5秒钟（指示灯灯灭）-The experimental circuit shown in Figure 25, connected by dotted line circuit: CLK0 connected 1MHz, GATE0, GATE1, then+5 V, OUT0 then CLK1, OUT1 connected PA0, PC0 then switch relay drive circuit input Ik. Relay normally open contact in series a 220V light bulb, then AC 220V. Programming using the 8253 timer, so that the relay closed cycle of 5 seconds (LED lights), off 5 seconds (LED OFF)
Platform: |
Size: 1024 |
Author: 张琪 |
Hits:
Description: 寄予IK分词器以及lucene框架完成的全文检索模块，提供接口接收记录参数，支持多线程并发以及设置更新点等，内附说明注释-IK word breaker and sent to the framework of the completion of the full-text search lucene module provides the interface to receive records of parameters, to support multi-threaded concurrency, and set update points, etc. Explanatory notes included
Platform: |
Size: 2597888 |
Author: JZ_YAMU |
Hits:
Description: 用java实现的一个类似于记事本的小程序。
实现功能添加记录、查询记录、修改记录、删除记录。无按钮，全由快捷键操作，这是根据本人的需求设置的。包含的技术，IK分词技术，lucence搜索技术，文件操作（容易修改为扩展为BDB轻量级数据库）-Use Java a similar to realize the notepad small programs.Functions added records, inquires the record, modify records, deleting records. No button, all the shortcuts operation, this is according to the demand of my set. Contains technology, IK participle technology, lucence search technology, and is easier to modify file operations (for expanded to BDB lightweight database)
Platform: |
Size: 4327424 |
Author: 刘平浪 |
Hits:
Description: 实现XMPP的基本功能，包括其相关的通信方式以及连接方式。-To achieve the basic functions of XMPP，Including their means of communication and connection.
Platform: |
Size: 430080 |
Author: 兰覅 |
Hits:
Description: IK Analyzer是一个开源的，基于java诧言开发的轻量级的中文分词工具包。最初，它是以开源项目Luence为应用主体的，结合词典分词和文法分析算法的中文分词组件。新版本的IK Analyzer 3.X则发展为面吐Java的公用分词组件，独立于Lucene项目，同时提供了对Lucene的默认优化实现。-IK Analyzer 3.X
Platform: |
Size: 715776 |
Author: flymoon |
Hits:
Description: 问题描述：字符序列的子序列是指从给定字符序列中随意地（不一定连续）去掉若干个字符（可能一个也不去掉）后所形成的字符序列。令给定的字符序列X=“x0，x1，…，xm-1”，序列Y=“y0，y1，…，yk-1”是X的子序列，存在X的一个严格递增下标序列<i0，i1，…，ik-1>，使得对所有的j=0，1，…，k-1，有xij=yj。例如，X=“ABCBDAB”，Y=“BCDB”是X的一个子序列。 -Problem Description: character sequence is the sequence of a given sequence of characters from arbitrarily (not necessarily consecutive) to remove a number of characters (perhaps a not removed) after the formation of character sequence. So that a given character sequence X = " x0, x1, ..., xm-1" , the sequence Y = " y0, y1, ..., yk-1" is a sequence of X, X, there is a strictly increasing sequence subscript <i0，i1，…，ik-1> So for all j = 0,1, ..., k-1, with xij = yj. For example, X = " ABCBDAB" , Y = " BCDB" is a sequence of X.
Platform: |
Size: 1024 |
Author: 明达 |
Hits:
Description: 序列Z=<B，C，D，B>是序列X=<A，B，C，B，D，A，B>的子序列，相应的递增下标序列为<2，3，5，7>。
一般地，给定一个序列X=<x1,x2,…,xm>，则另一个序列Z=<z1,z2,…,zk>是X的子序列，是指存在一个严格递增的下标序列〈i1,i2,…,ik〉使得对于所有j=1,2,…,k使Z中第j个元素zj与X中第ij个元素相同。
给定2个序列X和Y，当另一序列Z既是X的子序列又是Y的子序列时，称Z是序列X和Y的公共子序列。
你的任务是：给定2个序列X、Y，求X和Y的最长公共子序列Z。
-Sequence Z = <B，C，D，B> Is a sequence X = <A，B，C，B，D，A，B> Sub-sequence, the corresponding sequence of increasing subscript < 2,3,5,7> . In general, given a sequence X = <x1,x2,…,xm> , Another sequence Z = <z1,z2,…,zk> Subsequence of X, there is a strictly increasing sequence < i1,i2,…,ik> subscript such that for all j = 1,2, ..., k so that the first j elements Z and X in the ij zj the same elements. Given two sequences X and Y, when another sequence Z is X, Y sequence is the sequence when said sequence of X and Y, Z is the common sub-sequences. Your task is: given two sequences X, Y, X and Y find the longest common subsequence Z.
Platform: |
Size: 4096 |
Author: 杨思翔 |
Hits:
Description: simulation puma560 6 dof IK and FK
Platform: |
Size: 52224 |
Author: tin |
Hits:
Description: 2D骨骼动画中骨骼层次的生成和反向运动学(IK)的循环坐标下降算法求解的实现-the generation of skeleton hierarchy in 2D skeleton animation and the realize of IK solution by cyclic coordinate descent method
Platform: |
Size: 3817472 |
Author: 侯定勇 |
Hits:
Description: 全文检索的实现，用lucence开 IK 分词，实现全库 全文 搜索-The realization of the full-text search
Platform: |
Size: 5249024 |
Author: juhn |
Hits:
Description: 逆向运动压缩学算法论文（英文版翻译过来的）-Reverse movement to compress the learning algorithm papers
Platform: |
Size: 715776 |
Author: 蒋树政 |
Hits:
Description: usin rgm130 to read and write on mifare ik classic
Platform: |
Size: 237568 |
Author: ashkan |
Hits:
Description: struts2,spring,hibernate,lucene+IK分词器，实现的手机信息搜索引擎。-struts2, spring, hibernate, lucene+IK word phone information search engine implementation.
Platform: |
Size: 41822208 |
Author: xuming |
Hits: