Location:
Search - RE N
Search list
Description: 描述：设编号为1,2,…,n(n>0)个人按顺时针方向围坐一圈，每人持有一个正整数密码。开始时任意给出一个报数上限值m，从第一个人开始顺时针方向自1起顺序报数，报到m时停止报数，抱m的人出列，从他在顺时针方向上的下一个人起重新自1起顺序报数；如此下去，直到所有人全部出列为止。要求设计一个程序模拟此过程，并给出出列人的编号序列。
．算法思想：
Jeseph函数是实现问题要求的主要函数，其算法思想是：从1至m对带头结点的单循环链表循环计数，到m时，输出该结点的编号值，，再从该结点的下一个结点起重新自1起循环计数；如此下去，直到单循环链表空时循环过程结束。
-Description : Let numbered 1, 2, ..., n (NGT; 0) clockwise direction by individuals sitting around a circle, each holding a positive integer code. At the beginning of a given arbitrary reported few limits on m, started from the first clockwise direction from the starting sequence reported a few, when they report back m reported few, hold out the m out from the clockwise direction in the next personal re-order starting from a newspaper; This situation continues until all people so far shown up. Asked to design a simulation of this process, and give out the number of people out sequence. . Algorithm thinking : Jeseph function is to seek to achieve the main function of the algorithm is thinking : m from a right to take the lead in the 19th nodes Listless cycle count, m, the output node number
Platform: |
Size: 21028 |
Author: 王俊 |
Hits:
Description: 任务：参加运动会有n个学校，学校编号为1……n。比赛分成m个男子项目，和w个女子项目。项目编号为男子1……m，女子m+1……m+w。不同的项目取前五名或前三名积分；取前五名的积分分别为：7、5、3、2、1，前三名的积分分别为：5、3、2；哪些取前五名或前三名由学生自己设定。（m=10 , w=8 , n=15）
功能要求：
1). 可以输入各个项目的前三名或前五名的成绩；
2)．能统计各学校总分（用链表）；
3)．可以按学校编号、学校总分、男女团体总分排序输出（快速、基数）；
4). 可按学校编号查询学校某个项目的情况；可按项目编号查询取得前三或前五名的学校。
界面要求：有合理的提示，每个功能可以设立菜单，根据提示，可以完成相关的功能要求。
b)概要设计：
本程序所使用的数据结构是二维数祖和线形链表。
所使用的算法有：快速、基数、归并排序等。-mission : participation in the Games is n, the school No. 1 ... n. Competition is divided into men m, and w-woman project. Item No. 1 man ... m, a woman m m w .... Different items from the top five or top three integration; From the top five points were : 7,5,3,2,1, and the top three points were : red; From what the top five or top three, set by the students themselves. (M = 10, w = 8, n = 15) functional requirements : 1). The importation of various items in the top three or top five results; 2). Statistics schools score (with Chain); 3). According No. schools, the school scores and scores of men and women groups sorting out (fast base); 4). School No. inquiries can be a school project; Item numbers can be made for the first three or top five schools. Interface requirements : there is a re
Platform: |
Size: 4434 |
Author: 李韦纬 |
Hits:
Description: The Fast Fourier Transform (FFT) allows users to view the spectrum content of an audio signal. The FFT code presented here was written by Don Cross though his homepage appears to have subsequently been taken down. Rather than explain the mathematical theory of the FFT, I will attempt to explain its usefulness as it relates to audio signals-The Fast Fourier Transform (FFT) allows us ers spectrum to view the content of an audio sign al. The FFT code presented here was written by Do n Cross though his homepage appears to have subs equently been taken down. Rather than explain t he mathematical theory of the FFT. I will attempt to explain its usefulness as it re Lates to audio signals
Platform: |
Size: 22612 |
Author: 冰城 |
Hits:
Description: Ex3.6 车皮编序问题
.问题描述：
在一个列车调度站中，1 条轨道连接到1 条侧轨处，形成1 个铁路转轨栈，如下图所示。
其中左边轨道为车皮入口，右边轨道为出口，编号为1，2，…，n 的n 个车皮从入口依次进
入转轨栈，由调度室安排车皮进出栈次序，并对车皮按其出栈次序重新编序a1, a2,., an 。
.编程任务：
给定正整数n，编程计算左边轨道车皮编号依次为1，2，…，n 时，在右边轨道最多可
以得到多少个不同的车皮编序方案。
例如当n=3 时，最多得到5 组不同的编序方案如下：
1 2 3
1 3 2
2 1 3
2 3 1
3 2 1
.数据输入：
由文件input.txt 给出输入数据。第一行有1 个正整数n，表示有n 个车皮。
.结果输出:
将计算出的所有不同的编序方案，以及不同的编序方案数输出到文件output.txt 。文件
的每行是一个编序方案。文件的最后一行是编序方案数。-Ex3.6 wagon sequence problem. Problem description : In a train station, a connecting track to a side track, the formation of a railway transition stack, as shown in Fig. Which left orbit for imported cars, the right orbit for export, numbered 1, 2, ..., n n cars were imported from the stack into the transition from the dispatch room arrangements wagon Stack access priorities, as well as cars stack up according to the order re-sequence a1, a2,. , An . . Programming tasks : Given a positive integer n, the left orbital calculation programming wagon followed by No. 1, 2, ..., n, on the right track can get at the maximum number of different cars sequence program. For example, when n = 3, a maximum of five different sequence of the program are as follows : 1 2 3 1 3 2 2 1 3 2 3 1 3 2 1. Data inp
Platform: |
Size: 26243 |
Author: 无翼 |
Hits:
Description: Tribe FloodNet 2k
Distributed Denial Of Service Network
分布式拒绝服务工具的源代码，下面为英文说明：
TFN can be seen as the yet most functional DoS attack tool with the best
performance that is now almost impossible to detect. What is my point in
releasing this? Let me assure you it isn t to harm people or companies. It
is, however, to scare the heck out of everyone who does not care about
systematically securing his system, because tools sophisticated as this one
are out, currently being improved drastically, kept PRIVATE, and some of them
not with the somewhat predictable functionality of Denial Of Service. It is
time for everyone to wake up, and realize the worst scenario that could happen
to him if he does not care enough about security issues.
Therefore, this program is also designed to compile on a maximum number of
various operating systems, to show that almost no modern operating system is
specifically secure, including Windows, Solaris, most UNIX flavors and Linux.
-Tribe FloodNet 2k Distributed Denial Of Se rvice Network Distributed denial of service tools source code for the English below : TFN can be seen as the most functional yet DoS att Ack tool with the best performance that is now al most impossible to detect. What is my point in re this leasing Let me assure you it isn t to harm peo ple or companies. It is, however, to scare the heck out of everyone who does not car e about systematically securing his system, because tools sophisticated as this one are out , currently being improved drastically. PRIVATE kept, and some of them not with the somewhat predictab le functionality of Denial Of Service. It is tim e for everyone to wake up. and realize the worst scenario that could Happe n to him if he does not care enough about security issues. There
Platform: |
Size: 44662 |
Author: onlyu |
Hits:
Description: huffman完整源代码C语言实现，有本人超级详细解释（看不懂你去跳楼吧）
算法设计:
1、对给定的n个权值{W1,W2,W3,...,Wi,...,Wn}构成n棵二叉树的初始集合F={T1,T2,T3,...,Ti,...,Tn}，其中每棵二叉树Ti中只有一个权值为Wi的根结点，它的左右子树均为空。（为方便在计算机上实现算法，一般还要求以Ti的权值Wi的升序排列。）
2、在F中选取两棵根结点权值最小的树作为新构造的二叉树的左右子树，新二叉树的根结点的权值为其左右子树的根结点的权值之和。
3、从F中删除这两棵树，并把这棵新的二叉树同样以升序排列加入到集合F中。
4、重复二和三两步，直到集合F中只有一棵二叉树为止。
-Huffman complete C source code language, I have super-detailed explanation (you do not understand it jumped) algorithm design : one, the right to the right values n (W1, W2, W3 ,..., Wi ,..., Wn) n trees constitute the binary tree initial pool F = (T1, T2, T3, ... Ti ,..., Tn), which is indeed a binary tree Ti only a right to the value of Wi Root. it's about subtrees are empty. (For the convenience of the computer algorithm, the general also demanded the right to Ti Wi value of ascending.) 2. in 1984 two F Root weights smallest tree as a new structure of the binary tree around subtrees, new Binary Tree Root in the right value for their son around the tree Root and the right value. 3, F deleted from this two trees, and how the new binary tree in the same ascending into the pool F. 4, re
Platform: |
Size: 11903 |
Author: 乐乐 |
Hits:
Description: 一， 一般步骤
（1），消除或减小恒定系差
（2），求测量数据的数学期望 ，即算术平均值 ：
， 其中n为测量数据次数， 为第 次测量的数据。
（3），求剩余误差 ：
（4），根据贝塞尔公式求标准偏差 ：
（5），检查是否有粗大误差。检查时用了肖维纳准则。如果某次测量的结果 所对应的 ，则认为是坏值，予以剔除。
（6），如有坏值，剔除后重新进行步骤（2）～（5）的计算，直至无坏值为止。
（7），判断有无变值系差。判断是可用马利科夫准则或阿卑—赫梅特准则。
（8），求出算术平均值的标准偏差 ：
必须注意，如前面计算中曾出现坏值，则这里的 应为剔除后重新计算出的标准偏差。
（9），求算术平均值的不确定度
-a general steps (a) to eliminate or reduce the lines is constant (2), the measurement data for the mathematical expectation, that arithmetic average :, in which n is the number of measurement data for the first time measurement data. (3), for the remaining error : (4), according to Bessel formula for standard deviation : (5) to check whether there is a large error. Check with the Xiaoweina criteria. If a certain measurements corresponding to the results, think it is bad value, be removed. (6), if a bad value, after excluding re-steps (2) to (5), until no bad value date. (7), with or without value judgment is poor. Judgment is available Malikefu guidelines or A 171-Hemeite criteria. (8), calculated arithmetic average of the standard deviation : the need attention, as previously had calculat
Platform: |
Size: 35928 |
Author: jack |
Hits:
Description: 基于UDP实现简单的可靠数据传输
由于数据是在不可靠的信道上传输的，因此数据在信道上传输时可能会发生比特错误，数据丢失。Rdt3.0及之前的版本都是停止—等待协议，它限制了网络底层硬件的能力。为克服这个问题引入了流水线技术，两个能恢复流水线中的错误的基本方法：第N个分组重发和选择性重复。综上，要实现差错编码，顺序号，计时器，分组确认，滑动窗口，拥塞控制。-simple UDP based on the reliable data transmission of data is not reliable transmission of the channel, therefore the data transmission channel may occur bit error, data loss. Rdt3.0 and earlier versions are stop-wait for the agreement, which limits the underlying network hardware capabilities. To overcome this problem the introduction of pipeline technology, both of which can restore pipeline error in the basic methods : section N to a re-issued and selective repeat. In sum, to achieve error coding, sequencing, the timer, a confirmation, sliding window, congestion control.
Platform: |
Size: 124739 |
Author: 周崇青 |
Hits:
Description: 主要函数介绍：
Init1() 程序启动时加载初始化
Init() 重新布棋初始化
Image0MouseDown 点到主棋盘空白处进行判断是否可以在此处布棋
Image1MouseDown 点到自方棋子记录原始的oldID、oldX、oldY的值
Image26MouseDown 点到对面棋进行判断
Image101MouseDown 点到副棋盘空白处进行判断是否可以在此处放棋
-main function presentations : Init1 () commencement load initialization Init () to re-initialize the chess cloth Image0Mous eDown points to the main board space can be conducted to determine whether the cloth here chess Image1MouseDow n points from the side pawn to the original records oldID, oldX, oldY value Image26MouseDown point to the opposite chess judgment Image101M ouseDown point blank chessboard to the vice judgment whether we can take here che
Platform: |
Size: 248897 |
Author: 雪阳 |
Hits:
Description: You are given a String[] grid representing a rectangular grid of letters. You are also given a String find, a word you are to find within the grid. The starting point may be anywhere in the grid. The path may move up, down, left, right, or diagonally from one letter to the next, and may use letters in the grid more than once, but you may not stay on the same cell twice in a row (see example 6 for clarification).
You are to return an int indicating the number of ways find can be found within the grid. If the result is more than 1,000,000,000, return -1.
Definition-You are given a String [] grid representing a rectangular grid of letters. You are also give n find a String. a word you are to find within the grid. The starti ng point may be anywhere in the grid. The path may move up, down, left, right, or diagonally from one letter to the next, and may use letters in the grid more than once. but you may not stay on the same cell twice in a row (see example for clarification 6). You are to re turn an int indicating the number of ways find ca n be found within the grid. If the result is more t han 1,000,000,000, return -1. Definition
Platform: |
Size: 2292 |
Author: 王军 |
Hits:
Description: Wavelets have widely been used in many signal and image processing applications. In this paper, a new
serial-parallel architecture for wavelet-based image compression is introduced. It is based on a 4-tap wavelet
transform, which is realised using some FIFO memory modules implementing a pixel-level pipeline
architecture to compress and decompress images. The real filter calculation over 4 · 4 window blocks is
done using a tree of carry save adders to ensure the high speed processing required for many applications.
The details of implementing both compressor and decompressor sub-systems are given. The primarily analysis
reveals that the proposed architecture, implemented using current VLSI technologies, can process a
video stream in real time.-Wavelets have been widely used in many sign al and image processing applications. In this p aper. a new serial-parallel architecture for wavele t-based image compression is introduced. It is based on a 4-tap wavelet transform. which is realized using some FIFO memory module 's implementing a pixel-level pipeline archite cture to compress and decompress images. The're al filter calculation over 4 blocks window is done using a tree of carry save adders to ensure t he high speed processing required for many appl ications. The details of implementing both com pressor decompressor and sub-systems are give n. The primarily analysis reveals that the prop osed architecture, VLSI implemented using current technologies, can process a video stream in real time.
Platform: |
Size: 2837459 |
Author: sdfafaf |
Hits:
Description: 从一个模式识别toolbox中摘取的计算zernike不变矩的源代码，结果为图像的n阶m重zernike不变矩-From a pattern recognition toolbox extracted Zernike moment invariants calculation of the source code, the results of image re-n-order m Zernike moment invariants
Platform: |
Size: 28672 |
Author: bill |
Hits:
Description: state of art language modeling methods:
An Empirical Study of Smoothing Techniques for Language Modeling.pdf
BLEU, a Method for Automatic Evaluation of Machine Translation.pdf
Class-based n-gram models of natural language.pdf
Distributed Language Modeling for N-best List Re-ranking.pdf
Distributed Word Clustering for Large Scale Class-Based Language Modeling in.pdf
-state of art language modeling methods: An Empirical Study of Smoothing Techniques for Language Modeling.pdfBLEU, a Method for Automatic Evaluation of Machine Translation.pdfClass-based n-gram models of natural language.pdfDistributed Language Modeling for N-best List Re-ranking . pdfDistributed Word Clustering for Large Scale Class-Based Language Modeling in.pdf
Platform: |
Size: 2016256 |
Author: wen6860 |
Hits:
Description: n-arq算法实现。这是一个数据链路层协议连续请求重发的实现算法。-Algorithm n-arq. This is a data link layer protocol request for re-implementation of the algorithm hair.
Platform: |
Size: 1024 |
Author: mikeli |
Hits:
Description: 用 C++编写简单的语句,实现输出 N重二进制码!-Using C++ to prepare a simple statement, re-N achieve output binary code!
Platform: |
Size: 506880 |
Author: |
Hits:
Description: 这是由RE转NFA再转DFA，最后识别的程序。参考了龙书和陈火旺的书，此程序最终完成的是下面网站要求的功能。http://info.ruc.edu.cn/wangqiuyue/comp_theory.htm-这是由RE转NFA再转DFA，最后识别的程序。参考了龙书和陈火旺的书，http://info.ruc.edu.cn/wangqiuyue/comp_theory.htm
Platform: |
Size: 16384 |
Author: lixmin |
Hits:
Description: 人工智能中的经典算法之一。对问题的多个分支选择一支进行探索，当探索到某一步时，发现原先选择并不优或达不到目标，就退回一步重新选择
回溯法适合用栈实现。探索过程当中入栈，退栈时返回分支选择的现场
-One of the classic algorithms in artificial intelligence. Multiple branches of the problem, choose one to explore, explore a step that the original selection is not excellent or reach the goal, you step back and re-retrospective method is suitable to use the stack to achieve. Exploring the process, stack, stack retreat back to the site of the branch selection
Platform: |
Size: 954368 |
Author: |
Hits:
Description: 神经网络是单个并行处理元素的集合，我们从生物学神经系统得到启发。在自然界，网络络功能主要由神经节决定，我们可以通过改变连接点的权重来训练神经网络完成特定的功能
-The neural network is a collection of a single parallel processing elements, we are inspired by biological nervous system. In nature, the network network function is determined by the ganglion, we can change the connection point of the right to re-train the neural network to perform the specific function
Platform: |
Size: 244736 |
Author: zhengguoo |
Hits:
Description: 中文翻译
LED是如何工作的
通常被称为LED的发光二极管，使电子世界中真正的无名英雄。LED的功能多达几十种，被广泛的应用于各种装置之中。在其他应用场合，LED可以作为数字钟的数码显示、传送-TRANSIENT VOLTAGE SUPPRESSOR(TVS) Diode PRESENTATION
• High protection on sensitive mobile electronic devices
• Follow strictly to the IEC 61000-4-2 ESD test standard
• Using the behavior of diode P/N junction to achieve ESD protection
Platform: |
Size: 9216 |
Author: 万利 |
Hits:
Description: 行人再识别。人再次鉴定的准确性可以显著提高给定一个训练集,演示了外表的变化与非重叠的两个摄像头。我们测试时是否能保持这种优势直接标注的训练集并非对所有现场camera-pairs可用。给定的训练集捕捉相机A和B之间的对应关系和不同的训练集捕捉相机B和C之间的对应关系,传递鉴定算法(TRID)建议提供了一个分类器(A,C)对外观。该方法是基于统计建模和使用一个边缘化的推理过程。这种方法可以显著减少注释工作固有的学习系统。-Person re-identification accuracy can be significantly improved given a training set that demonstrates changes in appearances associated with the two non-overlapping cameras involved. Here we test whether this advantage can be maintained when directly annotated training sets are not available for all camera-pairs at the site. Given the training sets capturing correspondences between cameras A and B and a different training set capturing correspondences between cameras B and C, the Transitive Re-IDentification algorithm (TRID) suggested here provides a classifier for (A,C) appearance pairs. The proposed method is based on statistical modeling and uses a marginalization process for the inference. This approach significantly reduces the annotation effort inherent in a learning system, which goes down O(N^2) to O(N), for a site containing N cameras. Moreover, when adding camera (N+1), only one inter-camera training set is required for establishing all correspondences. In our experiments w
Platform: |
Size: 1342464 |
Author: 李娇 |
Hits: