Search - a-w - CodeBus

Search - a-w - List

[Linux-Unix] linphone-1.2.0.tar DL : 0: Linphone is a web phone: it let you phone to your friends anywhere in the whole world, freely, simply by using the internet. The cost of the phone call is the cost that you spend connected to the internet. -Linphone is a web phone : it let you phone to your friends anywhere in the w hole world, freely, simply by using the internet. The cost of the PAHO ne call is the cost that you spend connected to th e internet.
Date : 2008-10-13 Size : 7.03mb User : 张海涛
[Linux-Unix] Tail-src-current DL : 0: Ever wanted to just type tail -f error_log on Windows?Envious of your Unix friends who can track changes to a file, in real time, as they happen? Well, now with the Objektiv Tail for Win32, you ll be happily monitoring your log files like you ve never done before. What s even better, you can track several files all at the same time with the patented \"Multiple Document Interface\"TM technology, with each file having its own, fabulous window.-Ever wanted to just type tail-f o error_log n Windows Unix Envious of your friends who can tr Ack changes to a file, in real time, Well as they happen. now with the Objektiv Tail for Win32, you ll be happily monitoring your log files like you ve never done before. What s even better, you can track several files all at the same time w ITH the patented "Multiple Document Interface "TM technology, with each having its own file. fabulous window.
Date : 2008-10-13 Size : 150.27kb User : 闫林
[Linux-Unix] AmericanGladiator DL : 0: American Gladiator,You are consulting for a game show in which n contestants are pitted against n gladiators in order to see which contestants are the best. The game show aims to rank the contestants in order of strength this is done via a series of 1-on-1 matches between contestants and gladiators. If the contestant is stronger than the gladiator, then the contestant wins the match otherwise, the gladiator wins the match. If the contestant and gladiator have equal strength, then they are “perfect equals” and a tie is declared. We assume that each contestant is the perfect equal of exactly one gladiator, and each gladiator is the perfect equal of exactly one contestant. However, as the gladiators sometimes change from one show to another, we do not know the ordering of strength among the gladiators. -American Gladiator. You are consulting for a game show in which n cont estants are pitted against n gladiators in orde r to see which contestants are the best. The game show aims to rank the contestants in order of str KV this is done via a series of 1-on-1 matches between contestants and gladiators. If the con testant is stronger than the gladiator. then the contestant wins the match otherwise, the gladiator wins the match. If the contestant and gladiator have equal strength. then they are "perfect equals" and a tie is decla red. We assume that each contestant is the perfe ct equal of exactly one gladiator. and each gladiator is the perfect exact equal of ly one contestant. However, as the gladiators sometimes change from one sho w to another, we do not know the ordering of stre
Date : 2008-10-13 Size : 1.81kb User : zhoushusen
[Linux-Unix] cbw.tar DL : 0: auxilary files for the Crypt Breakers Workbench (cbw). CBW is a multi-window integrated workbench of tools that help a cryptanalist read files encrypted with the BSD4.2 crypt command. Anyone may copy, modify, use, or redistribute this system. It was originally written by Robert W. Baldwin at MIT
Date : 2008-10-13 Size : 517kb User : zxang
[Linux-Unix] 2 DL : 0: 看n2实例 #Create a simulator object set ns [new Simulator] #Define different colors for data flows #$ns color 1 Blue #$ns color 2 Red #Open the nam trace file set nf [open out-1.nam w] $ns namtrace-all $nf set f0 [open out0.tr w] set f1 [open out1.tr w] #Define a finish procedure proc finish {} { global ns nf $ns flush-trace #Close the trace file close $nf #Execute nam on the trace file exit 0 } #Create four nodes set n0 [$ns node] set n1 [$ns node] set n2 [$ns node] set n3 [$ns node] #Create links between the nodes $ns duplex-link $n0 $n2 1Mb 10ms
Date : 2008-10-13 Size : 3.37kb User : shilei
[Linux-Unix] linphone-1.2.0.tar DL : 0: Linphone is a web phone: it let you phone to your friends anywhere in the whole world, freely, simply by using the internet. The cost of the phone call is the cost that you spend connected to the internet. -Linphone is a web phone : it let you phone to your friends anywhere in the w hole world, freely, simply by using the internet. The cost of the PAHO ne call is the cost that you spend connected to th e internet.
Date : 2025-12-29 Size : 7.03mb User : 张海涛
[Linux-Unix] Tail-src-current DL : 0: Ever wanted to just type tail -f error_log on Windows?Envious of your Unix friends who can track changes to a file, in real time, as they happen? Well, now with the Objektiv Tail for Win32, you ll be happily monitoring your log files like you ve never done before. What s even better, you can track several files all at the same time with the patented "Multiple Document Interface"TM technology, with each file having its own, fabulous window.-Ever wanted to just type tail-f o error_log n Windows Unix Envious of your friends who can tr Ack changes to a file, in real time, Well as they happen. now with the Objektiv Tail for Win32, you ll be happily monitoring your log files like you ve never done before. What s even better, you can track several files all at the same time w ITH the patented "Multiple Document Interface "TM technology, with each having its own file. fabulous window.
Date : 2025-12-29 Size : 150kb User : 闫林
[Linux-Unix] AmericanGladiator DL : 0: American Gladiator,You are consulting for a game show in which n contestants are pitted against n gladiators in order to see which contestants are the best. The game show aims to rank the contestants in order of strength this is done via a series of 1-on-1 matches between contestants and gladiators. If the contestant is stronger than the gladiator, then the contestant wins the match otherwise, the gladiator wins the match. If the contestant and gladiator have equal strength, then they are “perfect equals” and a tie is declared. We assume that each contestant is the perfect equal of exactly one gladiator, and each gladiator is the perfect equal of exactly one contestant. However, as the gladiators sometimes change from one show to another, we do not know the ordering of strength among the gladiators. -American Gladiator. You are consulting for a game show in which n cont estants are pitted against n gladiators in orde r to see which contestants are the best. The game show aims to rank the contestants in order of str KV this is done via a series of 1-on-1 matches between contestants and gladiators. If the con testant is stronger than the gladiator. then the contestant wins the match otherwise, the gladiator wins the match. If the contestant and gladiator have equal strength. then they are "perfect equals" and a tie is decla red. We assume that each contestant is the perfe ct equal of exactly one gladiator. and each gladiator is the perfect exact equal of ly one contestant. However, as the gladiators sometimes change from one sho w to another, we do not know the ordering of stre
Date : 2025-12-29 Size : 2kb User : zhoushusen
[Linux-Unix] cbw.tar DL : 0: auxilary files for the Crypt Breakers Workbench (cbw). CBW is a multi-window integrated workbench of tools that help a cryptanalist read files encrypted with the BSD4.2 crypt command. Anyone may copy, modify, use, or redistribute this system. It was originally written by Robert W. Baldwin at MIT
Date : 2025-12-29 Size : 520kb User : zxang
[Linux-Unix] 2 DL : 0: 看n2实例 #Create a simulator object set ns [new Simulator] #Define different colors for data flows #$ns color 1 Blue #$ns color 2 Red #Open the nam trace file set nf [open out-1.nam w] $ns namtrace-all $nf set f0 [open out0.tr w] set f1 [open out1.tr w] #Define a finish procedure proc finish {} { global ns nf $ns flush-trace #Close the trace file close $nf #Execute nam on the trace file exit 0 } #Create four nodes set n0 [$ns node] set n1 [$ns node] set n2 [$ns node] set n3 [$ns node] #Create links between the nodes $ns duplex-link $n0 $n2 1Mb 10ms -N2 examples look# Create a simulator objectset ns [new Simulator]# Define different colors for data flows# $ Ns color 1 Blue# $ Ns color 2 Red# Open the nam trace fileset nf [open out-1.nam w] $ ns namtrace-all $ nfset f0 [open out0.tr w] set f1 [open out1.tr w]# Define a finish procedureproc finish () (global ns nf $ ns flush-trace# Close the trace file close $ nf# Execute nam on the trace file exit 0)# Create four nodesset n0 [$ ns node] set n1 [$ ns node] set n2 [$ ns node] set n3 [$ ns node]# Create links between the nodes $ ns duplex-link $ n0 $ n2 1Mb 10ms
Date : 2025-12-29 Size : 3kb User : shilei
[Linux-Unix] firstGTK DL : 0: 一个基于GTK+的单词数值计算器，1、按照规则计算单词的值，如果 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 26个字母（全部用大写）的值分别为 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26，如： WINJACK这个单词的值就为：W+I+N+J+A+C+K=23+9+14+1+3+11=71％ HARDWORK=H+A+R+D+W+O+R+D=8+1+18+4+23+15+18+11=98％ LOVE=L+O+V+E=12+15+22+5=54％ LUCK=L+U+C+K=12+21+3+11=47％ ATTITUDE= A+T+T+I+T+U+D+E=1+20+20+9+20+24+4+5=100％ 2、对程序的界面布局参考如下图所示，在第一个单行文本框输入一个单词，点击“计算”按钮，按照以上算法计算出该单词的值。 3、如果在最下面的单行文本框输入一个文件路径，此文件每行记录一个单词，那么经过程序计算出各个单词的值，并把结果输出到当前目录下result.txt文件中。如果文件不存在，应该提示错误。 -err
Date : 2025-12-29 Size : 1kb User : 翔
[Linux-Unix] secret DL : 0: pass.words是弱口令字典，是一个纯文本文件，每行一个口令，可以向里面添加候选口令。 pass.c是进行口令检查的c语言原程序，有两个命令行参数 -w file: 可以使用该选项指定口令字典 -P:默认情况下对/etc/shadow中的用户检查弱口令，可以使用该选项指定检查的文件编译gcc –o pass pass.c –l crypt 由于要使用加密函数，所以要使用加密库crypt，使用选项-l crypt 运行程序：pass –w ./pass.words –p /etc/shadow -pass.words is a weak password dictionary, is a plain text file, one per line password, you can add to the inside candidate password. Password pass.c is the c language of the original inspection procedures, there are two command-line parameters-w file: You can use the password option specifies a dictionary-P: By default on/etc/shadow user to check the weak password, you can use the option to specify the documents to check the compiler gcc-o pass pass.c-l crypt function due to the use of encryption, so the use of encryption library crypt, use the option-l crypt running the program: pass-w./pass.words-- p/etc/shadow
Date : 2025-12-29 Size : 7kb User : 莫松成
[Linux-Unix] gps DL : 0: 编写一个模拟GPS的应用程序，首先向串口写入如下信息 $GPRMC,082020,A4060.9870,S21720.3278,W,000.0.000.0,070707,005.6,W*62再从串口中读出此信息，并对此信息进行解析，输出经度，纬度，北京时间-The preparation of a simulated GPS applications, first of all, write the following information to the serial port $ GPRMC, 082020, A4060.9870, S21720.3278, W, 000.0.000.0,070707,005.6, W* 62 from the serial read this information and parse this information, the output longitude, latitude, Beijing
Date : 2025-12-29 Size : 3kb User : 蜕
[Linux-Unix] w83627hf_wdt DL : 0: 主板上提供一个可按分或秒计时的，最长达255级的可编程看门狗定时器，WDT超时事件发生时系统复位。本程序(w83627hf_wdt.c)是基于Winbond83627芯片的看门狗驱动程序 -The motherboard, or can provide a second time, and the most up to 255 programmable watchdog timer, WDT time-out system reset time of the incident. This procedure (w83627hf_wdt.c) is based on the chip Winbond83627 watchdog driver
Date : 2025-12-29 Size : 21kb User : 小高
[Linux-Unix] sourcemk DL : 0: linux下利用c实现的将wav文件分割的小程序，只能够简单分割，对于想学习linux对文件操作的朋友有帮助～-under linux will use c to achieve a small wav file segmentation procedure can only be a simple division, want to learn linux for file operations on friends to help ~
Date : 2025-12-29 Size : 1kb User : 瓶盖
[Linux-Unix] SD_Partition DL : 0: 在 Fedora 8下，将一张4G的TF卡(MicroSD),格成两个2G的分区，一个主分区，一个逻辑分区。 ps：SD卡有TF卡（现在通称MicroSD），SD卡，MiniSD卡,SDHC等多种，长的不一样；除此之外，还有一种MMC卡。指令：fdisk 用途：观察硬盘之实体使用情形与分割硬盘用。使用方法：　　　　　　一、在 console 上输入 fdisk -l /dev/sdb ，观察硬盘之实体使用情形。　　　　　　二、在 console 上输入 fdisk /dev/sdb，可进入分割硬盘模式。　　　　　　　　1. 输入 m 显示所有命令列示。　　　　　　　　2. 输入 p 显示硬盘分割情形。　　　　　　　　3. 输入 a 设定硬盘启动区。　　　　　　　　4. 输入 n 设定新的硬盘分割区。　　　　　　　4.1. 输入 e 硬盘为[延伸]分割区(extend)。　　　　　　　　　4.2. 输入 p 硬盘为[主要]分割区(primary)。　　　　　　　　5. 输入 t 改变硬盘分割区属性。　　　　　　　　6. 输入 d 删除硬盘分割区属性。　　　　　　　　7. 输入 q 结束不存入硬盘分割区属性。　　　　　　　　8. 输入 w 结束并写入硬盘分割区属性。 -SD card partition tool
Date : 2025-12-29 Size : 2kb User : JkHung
[Linux-Unix] Advanced.Programming.In.The.UNIX.Environment_2nd. DL : 0: Advanced Programming in the UNIX® Environment: Second Edition By W. Richard Stevens, Stephen A. Rago ............................................... Publisher: Addison Wesley Professional Pub Date: June 17, 2005 ISBN: 0201433079 Pages: 960 -Advanced Programming in the UNIX® Environment: Second Edition By W. Richard Stevens, Stephen A. Rago ............................................... Publisher: Addison Wesley Professional Pub Date: June 17, 2005 ISBN: 0201433079 Pages: 960
Date : 2025-12-29 Size : 3.18mb User : duongtu
[Linux-Unix] AdvanceProgrammingInUnix_ed2 DL : 0: Advanced Programming in the UNIX Environment: Second Edition By W. Richard Stevens, Stephen A. Rago
Date : 2025-12-29 Size : 2.93mb User : Hugo
[Linux-Unix] UNIX-Network-Develop DL : 0: 这本书叫：UNIX网络编程(第一卷)。中文版。这本书的作者是已故的 W Ridhard Steven写的。这本书内容：详细地介绍了各种Socket API函数的用法。-The book is called: UNIX Network Programming (Volume I). Chinese version. This book was written by the late W Ridhard Steven wrote. This book: detailed description of the use of a variety of Socket API function.
Date : 2025-12-29 Size : 26.7mb User : 汤文
[Linux-Unix] datagram DL : 0: common U D P R A W code Linux I N E T implementation. -common U D P R A W code Linux I N E T implementation.
Date : 2025-12-29 Size : 6kb User : yuigoujk

« 12 3 »