Search - h0

Search - h0 - List

【CSharp】 railk DL : 0: 最优车皮排序问题 .问题描述：在一个列车调度站中，k 条轨道连接到k 条侧轨处，形成k 个铁路转轨栈，从左到右依次记为H1，H2，…，Hk 如下图所示。其中左边轨道为车皮入口（记为H0），右边轨道为出口（记为Hk+1），编号为a1, a2,.,an 的n 个车皮从入口依次进入转轨栈，由调度室安排车皮进出栈次序，并对车皮按其出栈次序重新排序为1，2，…，n。调度室在安排车皮进出栈次序时，遵循以下规则：（1）车皮入口H0 处的车皮可以进入转轨栈H1，H2，…，Hk 之一，或直接进入车皮出口Hk+1 。（2）转轨栈H1，H2，…，Hk 处的车皮可以进入车皮出口Hk+1 。 .编程任务：给定正整数n，和n 个车皮的初始编号a1, a2,.,an ，编程计算最少需要多少个转轨栈才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n 的顺序输出。 .数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n 个车皮的初始编号a1, a2,.,an 。-wagon optimal scheduling problem. Problem description : In a train station, k, k track connected to the side of the tracks, forming k stack rail transition from left to right followed credited to H1, H2, ..., Hk as in the figure below. Which left orbit for imported cars (credited to H0), the right track for exports (credited as a Hk), the No. a1, a2,. , An n-wagon from the entrance into the transition stack followed by the dispatch room arrangements wagon Stack access priorities, as well as cars stack up according to the order reordering of 1,2, ..., n. The dispatch room in arranging access stack wagon order, to abide by the following rules : (1) H0 wagon entrance of cars can enter the transition stack H1, H2, ..., Hk, or directly into a wagon export Hk. (2) Transition stack H1, H2, ..., H
Update : 2008-10-13 Size : 30200 Publisher : 无翼
【CSharp】 railqk DL : 0: 最优平行轨道车皮排序问题 .问题描述：在一个列车调度站中，k 条轨道平行连接到1 条侧轨处，形成1 条主轨道和k-1 条辅助调度轨道。主轨道记为Hk，辅助轨道从下到上依次记为H1，H2，…，Hk-1 如下图所示。其中主轨道左边为车皮入口（记为H0），主轨道右边为出口（仍记为Hk）。编号为a1, a2,L,an 的n 个车皮从入口依次进入主轨道，由调度室安排车皮进出轨次序，并对车皮按其出轨次序重新排序为1，2，…，n。调度室在安排车皮进出轨次序时，遵循以下规则：（1）车皮入口H0 处的车皮可以进入辅助轨道H1，H2，…，Hk-1 之一，或直接进入车皮出口Hk。（2）辅助轨道H1，H2，…，Hk-1 处的车皮可以进入车皮出口Hk。 .编程任务：给定正整数n，和n 个车皮的初始编号a1, a2,L,an ，编程计算最少需要多少个平行轨道才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n 的顺序输出。 .数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n 个车皮的初始编号a1, a2,L,an 。 .结果输出: 将计算出的最少平行轨道数输出到文件output.txt 。-optimal parallel tracks wagon scheduling problem. Problem description : In a train station, k parallel track connected to a side track, the formation of a main track and k-assisted dispatching an orbit. The main track is recorded as Hk, auxiliary track from the next turn of the last recorded as H1, H2, ..., Hk-1 are shown in Fig. Including the main track entrance to the left of the wagon (credited to H0), the main track of the right to export (still recorded as Hk). No. a1, a2, L, an n-wagons from the main entrance into orbit followed by the dispatch room arrangements into cars derailed priorities, as well as cars derailed according to reorder priorities 1,2, ..., n. Room scheduling arrangements in order wagon into the derailment, to abide by the following rules : (1) H0 wagon entrance of
Update : 2008-10-13 Size : 62547 Publisher : stzxxxstz
【Other resource】 CheatMaster_src DL : 0: Cheat Master 0.1 For DevHook with src, Real In-Game Search/Modify! -------------------------------------------------------------------------------- Intro ===== This is a prx mod written for DevHook 0.4+, which is used to search and modify/lock data in memory while playing game. HOWTO Install ============= 1. Copy directory CheatMaster to root of your PSP memorystick. 2. Modify /dh/2xx/flash0/kd/pspbtcnf_game.txt, which 2xx means your emulated firmware directory (e.g. 271 for 2.71 firmware directory), add one line: ms0:/CheatMaster/CheatMaster.prx after the line: ms0:/dh/kd/devhook.prx 3. Start game, press [Volume DOWN] + [Note] button to call up the menu. 2006-08-08 v0.1 [+] First public version [+] Search, modify and lock functions [+] Address table, with save/load functions [+] Memory dump functions [o] Memory searching may write results with large amount to disk, so keep at least 10MB free space on memorystick if you want to search values smaller than 256 with auto or byte modeCheat Master 0.1 For DevHook with src, Real In-Game Search / Modify! --------------- ---------------------------------------- ------------------------- Intro ===== This i prx's a mod written for DevHook 0.4, which is used to search and modify / lock data in m emory while playing game. HOWTO Install ======= ======= 1. Copy directory CheatMaster to root o f your PSP memorystick. 2. Modify / dh/2xx/flas h0/kd/pspbtcnf_game.txt. 2xx which means your emulated firmware directo ry (e.g. 271 for 2.71 firmware directory) add one line : ms0 : / CheatMaster / CheatMaster.prx after the line : ms0 : / dh / kd / devhook.prx 3. Start game, press [Volume DOWN] [Note] button to call up the menu. 2006-08-08 v0.1 [] First public version [ ] Search, modify and lock functions [] Address table. with save / -Cheat Master 0.1 For DevHook with src, Real In-Game Search / Modify! --------------- ---------------------------------------- ------------------------- Intro ===== This i prx's a mod written for DevHook 0.4, which is used to search and modify / lock data in m emory while playing game. HOWTO Install ======= ======= 1. Copy directory CheatMaster to root o f your PSP memorystick. 2. Modify / dh/2xx/flas h0/kd/pspbtcnf_game.txt. 2xx which means your emulated firmware directo ry (e.g. 271 for 2.71 firmware directory) add one line : ms0 : / CheatMaster / CheatMaster.prx after the line : ms0 : / dh / kd / devhook.prx 3. Start game, press [Volume DOWN] [Note] button to call up the menu. 2006-08-08 v0.1 [] First public version [ ] Search, modify and lock functions [] Address table. with save /
Update : 2008-10-13 Size : 10060 Publisher : zb
【assembly language】 FIR2 DL : 0: 用线性缓冲区和间接寻址方法实现FIR滤波器 * *N=5,y(n)=h0*x(n)+h1*x(n-1)+h2*x(n-2)+h3*x(n-3)+h4*x(n-4)
Update : 2008-10-13 Size : 1071 Publisher : hhh
【assembly language】 FIR3 DL : 0: 用线性缓冲区和带移位双操作数寻址方法实现FIR滤波器 * *N=5,y(n)=h0*x(n)+h1*x(n-1)+h2*x(n-2)+h3*x(n-3)+h4*x(n-4)*
Update : 2008-10-13 Size : 981 Publisher : hhh
【assembly language】 FIR4 DL : 0: *用循环缓冲区和双操作数寻址方法实现FIR滤波器 *N=80,y(n)=h0*x(n)+h1*x(n-1)+...+h78*x(n-78)+h79*x(n-79) *先用matlab，选择80点汉明窗设计一个截止频率为0.2pi的低通滤波器
Update : 2008-10-13 Size : 1274 Publisher : hhh
【assembly language】 FIR5 DL : 1: 系数对称的FIR滤波器设计 * *N=8,h(n)=h(N-1-n) * *y(n)=h0*[x(n)+x(n-7)]+h1*[x(n-1)+x(n-6)] * * +h2*[x(n-2)+x(n-5)]+h3*[x(n-3)+x(n-4)]
Update : 2008-10-13 Size : 1014 Publisher : hhh
【CSharp】 railk DL : 0: « 问题描述：在一个列车调度站中，k条轨道连接到k条侧轨处，形成k个铁路转轨栈，从左到右依次记为H1，H2，…，Hk如下图所示。其中左边轨道为车皮入口（记为H0），右边轨道为出口（记为Hk+1），，编号为a , a , ,an 1 2  的n 个车皮从入口依次进入转轨栈，由调度室安排车皮进出栈次序，并对车皮按其出栈次序重新排序为1，2，…，n。调度室在安排车皮进出栈次序时，遵循以下规则：（1）车皮入口H0处的车皮可以进入转轨栈H1，H2，…，Hk之一，或直接进入车皮出口Hk+1。（2）转轨栈H1，H2，…，Hk处的车皮可以进入车皮出口Hk+« 编程任务：给定正整数n，和n个车皮的初始编号n a , a , ,a 1 2  ，编程计算最少需要多少个转轨栈才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n的顺序输出。« 数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n个车皮的初始编号n a , a , ,a 1 2  。« 结果输出:将计算出的最少转轨栈数输出到文件output.txt。输入文件示例输出文件示例input.txt output.txt42 3 4 13-laquo; Problem description : In a train station, k, k track connected to the side of the tracks, forming k stack rail transition from left to right followed credited to H1, H2, ..., Hk as in the figure below. Which left orbit for imported cars (credited to H0), the right track for exports (credited as a Hk), and numbered a, a, and an 1 2 # 61516; The n followed by wagon from the entrance into the stack transition from the dispatch room arrangements wagon Stack access priorities, as well as cars stack up according to reorder priorities for 1,2, ..., n. The dispatch room in arranging access stack wagon order, to abide by the following rules : (1) H0 wagon entrance of cars can enter the transition stack H1, H2, ..., Hk, or directly into a wagon export Hk. (2) Transition stack H1, H2, ..., Hk
Update : 2008-10-13 Size : 976 Publisher : 林天
【Driver Develop】实战DeviceIoControl DL : 0: 驱动程序函数DEVICEIOCONTROL的详细说明-driver function DEVICEIOCONTROL details
Update : 2024-04-23 Size : 53248 Publisher : 将军
【JSP/Java】 Jcrontab-1.4.1 DL : 0: jcrontab是一个定时器开源项目包目前提供存取文件或数据库, 把执行结果寄发 email, 简单地设置在 Tomcat, Resin, Jetty 及 JBoss 之上, 更是可以取代 cron 单独去执行, 也提供了良好的效能-jcrontab timer is a package of open source projects currently provided access to documents or databases, the implementation of the results send email, simple to install in Tomcat, Resin, Jetty and JBoss, nor can replace cron alone enforce, but also provided a good performance
Update : 2024-04-23 Size : 3132416 Publisher : 孙永
【CSharp】 railk DL : 0: « 问题描述：在一个列车调度站中，k条轨道连接到k条侧轨处，形成k个铁路转轨栈，从左到右依次记为H1，H2，…，Hk如下图所示。其中左边轨道为车皮入口（记为H0），右边轨道为出口（记为Hk+1），，编号为a , a , ,an 1 2  的n 个车皮从入口依次进入转轨栈，由调度室安排车皮进出栈次序，并对车皮按其出栈次序重新排序为1，2，…，n。调度室在安排车皮进出栈次序时，遵循以下规则：（1）车皮入口H0处的车皮可以进入转轨栈H1，H2，…，Hk之一，或直接进入车皮出口Hk+1。（2）转轨栈H1，H2，…，Hk处的车皮可以进入车皮出口Hk+« 编程任务：给定正整数n，和n个车皮的初始编号n a , a , ,a 1 2  ，编程计算最少需要多少个转轨栈才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n的顺序输出。« 数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n个车皮的初始编号n a , a , ,a 1 2  。« 结果输出:将计算出的最少转轨栈数输出到文件output.txt。输入文件示例输出文件示例input.txt output.txt42 3 4 13-laquo; Problem description : In a train station, k, k track connected to the side of the tracks, forming k stack rail transition from left to right followed credited to H1, H2, ..., Hk as in the figure below. Which left orbit for imported cars (credited to H0), the right track for exports (credited as a Hk), and numbered a, a, and an 1 2# 61516; The n followed by wagon from the entrance into the stack transition from the dispatch room arrangements wagon Stack access priorities, as well as cars stack up according to reorder priorities for 1,2, ..., n. The dispatch room in arranging access stack wagon order, to abide by the following rules : (1) H0 wagon entrance of cars can enter the transition stack H1, H2, ..., Hk, or directly into a wagon export Hk. (2) Transition stack H1, H2, ..., Hk
Update : 2024-04-23 Size : 1024 Publisher : 林天
【SCM】 7565P3 DL : 0: 这是一个驱动LCM模块显示的51单片程序，模块点阵是128×64，使用的IC是ST7565P.-This is a drive LCM module shows the 51 single procedure, module lattice is 128 64, the IC is ST7565P.
Update : 2024-04-23 Size : 3072 Publisher : Roy
【VHDL-FPGA-Verilog】 avalon_slave_pwm DL : 0: NIOS环境PWM的USER LOGIC实例1-NIOS environment PWM USER an example LOGIC
Update : 2024-04-23 Size : 1024 Publisher : 黄建生
【Com Port】 comport DL : 0: 转载如果侵犯产权，不负责任，本程序完全参照龚建伟《串口调试助手V2.2》制作而成，原软件是用VC编写的，我将它改用Delphi编写，作为我学习串口编程的一个例子与工具使用。-reproduced if infringe on property rights, irresponsible and totally based on the procedures Dan "serial debugging assistant V2.2" produced, the original software was prepared by the VC, I will use it to prepare Delphi, as I learned a serial programming examples and the use of tools.
Update : 2024-04-23 Size : 4096 Publisher :
【CSharp】 railk DL : 0: 最优车皮排序问题 .问题描述：在一个列车调度站中，k 条轨道连接到k 条侧轨处，形成k 个铁路转轨栈，从左到右依次记为H1，H2，…，Hk 如下图所示。其中左边轨道为车皮入口（记为H0），右边轨道为出口（记为Hk+1），编号为a1, a2,.,an 的n 个车皮从入口依次进入转轨栈，由调度室安排车皮进出栈次序，并对车皮按其出栈次序重新排序为1，2，…，n。调度室在安排车皮进出栈次序时，遵循以下规则：（1）车皮入口H0 处的车皮可以进入转轨栈H1，H2，…，Hk 之一，或直接进入车皮出口Hk+1 。（2）转轨栈H1，H2，…，Hk 处的车皮可以进入车皮出口Hk+1 。 .编程任务：给定正整数n，和n 个车皮的初始编号a1, a2,.,an ，编程计算最少需要多少个转轨栈才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n 的顺序输出。 .数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n 个车皮的初始编号a1, a2,.,an 。-wagon optimal scheduling problem. Problem description : In a train station, k, k track connected to the side of the tracks, forming k stack rail transition from left to right followed credited to H1, H2, ..., Hk as in the figure below. Which left orbit for imported cars (credited to H0), the right track for exports (credited as a Hk), the No. a1, a2,. , An n-wagon from the entrance into the transition stack followed by the dispatch room arrangements wagon Stack access priorities, as well as cars stack up according to the order reordering of 1,2, ..., n. The dispatch room in arranging access stack wagon order, to abide by the following rules : (1) H0 wagon entrance of cars can enter the transition stack H1, H2, ..., Hk, or directly into a wagon export Hk. (2) Transition stack H1, H2, ..., H
Update : 2024-04-23 Size : 29696 Publisher : 无翼
【CSharp】 railqk DL : 0: 最优平行轨道车皮排序问题 .问题描述：在一个列车调度站中，k 条轨道平行连接到1 条侧轨处，形成1 条主轨道和k-1 条辅助调度轨道。主轨道记为Hk，辅助轨道从下到上依次记为H1，H2，…，Hk-1 如下图所示。其中主轨道左边为车皮入口（记为H0），主轨道右边为出口（仍记为Hk）。编号为a1, a2,L,an 的n 个车皮从入口依次进入主轨道，由调度室安排车皮进出轨次序，并对车皮按其出轨次序重新排序为1，2，…，n。调度室在安排车皮进出轨次序时，遵循以下规则：（1）车皮入口H0 处的车皮可以进入辅助轨道H1，H2，…，Hk-1 之一，或直接进入车皮出口Hk。（2）辅助轨道H1，H2，…，Hk-1 处的车皮可以进入车皮出口Hk。 .编程任务：给定正整数n，和n 个车皮的初始编号a1, a2,L,an ，编程计算最少需要多少个平行轨道才能按照规则（1）和（2）调度车皮，使车皮在车皮出口按照1，2，…，n 的顺序输出。 .数据输入：由文件input.txt 给出输入数据。第1 行有1 个正整数n，表示有n 个车皮。第2 行是n 个车皮的初始编号a1, a2,L,an 。 .结果输出: 将计算出的最少平行轨道数输出到文件output.txt 。-optimal parallel tracks wagon scheduling problem. Problem description : In a train station, k parallel track connected to a side track, the formation of a main track and k-assisted dispatching an orbit. The main track is recorded as Hk, auxiliary track from the next turn of the last recorded as H1, H2, ..., Hk-1 are shown in Fig. Including the main track entrance to the left of the wagon (credited to H0), the main track of the right to export (still recorded as Hk). No. a1, a2, L, an n-wagons from the main entrance into orbit followed by the dispatch room arrangements into cars derailed priorities, as well as cars derailed according to reorder priorities 1,2, ..., n. Room scheduling arrangements in order wagon into the derailment, to abide by the following rules : (1) H0 wagon entrance of
Update : 2024-04-23 Size : 62464 Publisher : stzxxxstz
【Windows Develop】 encsrc DL : 0: mpeg4视频编码，用c编译，ccs仿真-mpeg4 video encoding, using c compiler, simulation ccs
Update : 2024-04-23 Size : 92160 Publisher : 程航
【Other Games】 CheatMaster_src DL : 0: Cheat Master 0.1 For DevHook with src, Real In-Game Search/Modify! -------------------------------------------------------------------------------- Intro ===== This is a prx mod written for DevHook 0.4+, which is used to search and modify/lock data in memory while playing game. HOWTO Install ============= 1. Copy directory CheatMaster to root of your PSP memorystick. 2. Modify /dh/2xx/flash0/kd/pspbtcnf_game.txt, which 2xx means your emulated firmware directory (e.g. 271 for 2.71 firmware directory), add one line: ms0:/CheatMaster/CheatMaster.prx after the line: ms0:/dh/kd/devhook.prx 3. Start game, press [Volume DOWN] + [Note] button to call up the menu. 2006-08-08 v0.1 [+] First public version [+] Search, modify and lock functions [+] Address table, with save/load functions [+] Memory dump functions [o] Memory searching may write results with large amount to disk, so keep at least 10MB free space on memorystick if you want to search values smaller than 256 with auto or byte modeCheat Master 0.1 For DevHook with src, Real In-Game Search/Modify!-------------------------------------------------------------------------------- Intro ===== This i prx's a mod written for DevHook 0.4, which is used to search and modify/lock data in m emory while playing game. HOWTO Install ======= ======= 1. Copy directory CheatMaster to root o f your PSP memorystick. 2. Modify/dh/2xx/flas h0/kd/pspbtcnf_game.txt. 2xx which means your emulated firmware directo ry (e.g. 271 for 2.71 firmware directory) add one line : ms0 :/CheatMaster/CheatMaster.prx after the line : ms0 :/dh/kd/devhook.prx 3. Start game, press [Volume DOWN] [Note] button to call up the menu. 2006-08-08 v0.1 [] First public version [ ] Search, modify and lock functions [] Address table. with save/-Cheat Master 0.1 For DevHook with src, Real In-Game Search/Modify!-------------------------------------------------------------------------------- Intro ===== This i prx's a mod written for DevHook 0.4, which is used to search and modify/lock data in m emory while playing game. HOWTO Install ======= ======= 1. Copy directory CheatMaster to root o f your PSP memorystick. 2. Modify/dh/2xx/flas h0/kd/pspbtcnf_game.txt. 2xx which means your emulated firmware directo ry (e.g. 271 for 2.71 firmware directory) add one line : ms0 :/CheatMaster/CheatMaster.prx after the line : ms0 :/dh/kd/devhook.prx 3. Start game, press [Volume DOWN] [Note] button to call up the menu. 2006-08-08 v0.1 [] First public version [ ] Search, modify and lock functions [] Address table. with save/
Update : 2024-04-23 Size : 10240 Publisher : zb
【Other】 IEEE_paper_request DL : 0: IEEE的写作要求,格式,以及相关帮助说明,供大家参考借鉴-IEEE writing, format and related help to show for all to draw on
Update : 2024-04-23 Size : 354304 Publisher : 张辉
【Special Effects】 CRF2D DL : 0: CRF（条件随机场）的程序包，用于图像分析（恢复，分割），对图像进行建模-CRF (with the conditions of the airport) package for image analysis (restoration, segmentation), the image modeling
Update : 2024-04-23 Size : 143360 Publisher : 邱风云

« 12 3 4 »