node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
8,486 | 2 | Funtouch_OS:funtouch os funtouchos operating system created vivo fork google operating system android major difference android funtouch os latter includes features unavailable former features include customizable gestures communication drawer bottom top swipe security centre lock screen resize options long screen shot eye protection changing warmer color temperature others funtouch os respects looks similar ios made apple list funtouchos releases | [
4995,
5892,
5637,
1670,
7428,
9610,
2828,
5262,
8719,
3600,
10129,
5522,
1427,
7700,
10645,
280,
10009,
10393,
7835,
9244,
10525,
798,
11294,
288,
673,
2978,
2852,
8870,
1191,
1959,
937,
1578,
5546,
6057,
5677,
7595,
7983,
10537,
3380,
54... | Test |
8,487 | 2 | Ethernut:ethernut ethernut open source hardware software project use embedded-ethernet-system currently four different reference designs exist ethernut 1 ethernut 2 ethernut 3 ethernut 5 available ready use boards reference designs share set interfaces designs mainly differ used microcontroller ethernut 1 2 8-bit avr ethernut 3 5 32-bit arm available memory size since ethernut 3 board mmc slot available ethernut 5 also includes usb host device interfaces rise idea internet things different groups people different aims started around 2000 developing embedded systems would able integrate existing tcp/ip networks limited resources mostly 8-bit embedded systems rarely reached exceeded 64 kb main memory imposed great challenge year 2000 british developer dave hudson released source code real-time operating system integrated tcp/ip stack named liquorice another challenge suitable hardware kind development nearly non-existing nearly network controllers time used pci-bus interface complex small microcontrollers one still-in-production controllers isa-bus interface also recommended new designs used together atmega103 microcontroller create single board computer layout board released bsd license one early open hardware projects one year hudson ceased work project source code liquorice used software foundation new ethernut project aimed integrate software hardware development first versions released avr freaks board project switched sourceforge 2002 open source operating system boards called nut/os modular real-time operating system licensed bsd license characteristics nut/os supported popular ssl/tls libraries wolfssl embedded security ethernut project implements network stack called nut/net implements substantial protocol socket api use nut/os programs supported protocols configuring nut/os nut/net quite simple download source packages nut/os configurator executed build needed libraries selected hardware configuration application programmers use nut/os nut/net libraries write software beside nut/os libraries application programmer use standard c libraries programming languages c used c++ mostly supported well additionally lua interpreter exists lua scripts executed interactively runtime board multitude simple sample applications exists easy introduction nut/os following architectures supported actively maintained research group distributed systems eth zurich developed distributed sensor network nodes based avr sensor nodes communicate via bluetooth system software open source btnut bluetooth stack used btnut stack based nut/os system extends nut/os functionality bluetooth access functions although btnut stack developed mainly btnode sensor nodes easily ported applications according german manufacturer egnite gmbh 33.000 ethernut boards sold state december 2013 several manufacturers compatible hardware achatz electronics netherlands proconx australia propox poland soc robotics canada hw group s.r.o czech republic thermotemp embedded-it germany beside nut/os operating system used base btnode sensor network eth zurich | [
6273,
7170,
11413,
9366,
5402,
5531,
4777,
682,
10924,
7983,
8625,
9780,
5437,
6207,
7364,
2887,
5457,
2517,
4569,
5472,
9320,
9964,
5358,
8432,
5368,
2045
] | Test |
8,488 | 4 | H._D._Moore:h. d. moore h moore network security expert open source programmer hacker developer metasploit framework penetration testing software suite founder metasploit project served chief research officer boston based security firm rapid7 provider security data analytics software cloud solutions remained chief architect metasploit framework departure rapid7 2016 since leaving rapid7 moore joined atredis partners vice president research development founded critical research corporation software firm develops rumble network discovery referred industry famous white hat hacker moore developed security software utilities united states department defense teenager founded metasploit project summer 2003 goal becoming public resource exploit code research development known work warvox axman metasploit decloaking engine rogue network link detection tools. started month browser bugs mobb initiative 2006 experiment fast-paced vulnerability discovery full disclosure started month bugs project meme resulted number web browser patches improved security measures moore discovered involved discovery number critical security vulnerabilities metasploit framework development platform creating security tools exploits framework used network security professionals perform penetration testing system administrators verify patch installations product vendors perform regression testing security researchers worldwide framework written ruby programming language includes components written c assembly language october 2009 metasploit project acquired rapid7 metasploit framework continues free rapid7 added commercial edition called metasploit express acquisition project hd moore became chief security officer rapid7 remaining chief architect metasploit warvox software suite exploring classifying auditing telephone systems unlike normal wardialing tools warvox processes raw audio call use modem directly model allows warvox find classify wide range interesting lines including modems faxes voice mail boxes pbxs loops dial tones ivrs forwarders using signal processing techniques axman activex fuzzing engine goal axman discover vulnerabilities com objects exposed internet explorer since axman web-based security changes browser also affect results fuzzing process metasploit decloaking engine system identifying real ip address web user regardless proxy settings using combination client-side technologies custom services vulnerabilities exploited tool properly configured tor setup result identifying information exposed rogue network link detection tools designed detect unauthorized outbound network links large corporate networks tools send spoofed tcp syn icmp echo requests original destination ip encoded packet read back external listening host moore work gained praise antagonism industry companies microsoft credited discovering vulnerabilities yet criticism metasploit similar tools due capacity used criminal purposes instead offensive security criticism fallen upon moore moore warned us law enforcement involvement critical.io scanning project according moore though 're always chasing bad guys – good guys never ahead 're ones wrote exploits often found wild defenders generally following black hats | [
161,
5636,
1926,
10026,
3473,
8050,
1429,
2262,
6712,
5373
] | Validation |
8,489 | 2 | X-Agent:x-agent x-agent xagent spyware malware program designed collect transmit hacked files machines running windows linux ios android servers operated hackers employs phishing attacks program designed hop device device 2016 crowdstrike identified android variant malware first time claimed malware targeted members ukrainian military distributing infected version app control d-30 howitzer artillery ukrainian army denied crowdstrike report stated losses howitzer artillery pieces nothing stated cause slovakian computer security company eset obtained x-agent source code 2015 described inner workings report released october 2016 washington dc grand jury indictment resulting robert mueller investigation russian election interference charges agents russian gru moscow developed customized monitored x-agent malware used hack dccc democratic congressional campaign committee dnc democratic national committee networks beginning around april 2016 item 15 end page 4 beginning page 5 | [
1024,
8320,
131,
3843,
5636,
5764,
10502,
2187,
4240,
11152,
10003,
10132,
4117,
8726,
535,
1688,
2717,
9375,
1440,
5024,
9761,
4644,
4133,
5028,
11175,
297,
2857,
5547,
11052,
9518,
7983,
176,
7601,
1970,
9395,
9904,
8886,
1337,
441,
197... | Test |
8,490 | 2 | The_Debian_System:debian system debian system 2005 non-fiction book written martin krafft deals exclusively debian gnu/linux detailing internal workings book mostly experienced users seeking in-depth technical knowledge rather beginners author native language german decided write debian de facto language english book written publication open source press later licensed co-publication starch press english version thus released two different isbns due popular demand book later translated german japanese french chinese translation works languages planned | [] | None |
8,491 | 2 | Cabal_(software):cabal software haskell cabal common architecture building applications libraries aids packaging distribution software packages contained haskell platform cabal introduced simplify packaging haskell software modules added glasgow haskell compiler version 6.4 default package manager along ghc internal manager ghc-pkg actual binary cabal library cabal developed different packages throughout development gained additional features sandboxes allow escape so-called cabal hell see cabalizing process making library written haskell programming language conformant requirements cabal library infrastructure cabalizing may required library initially developed without taking requirements consideration developed prior introduction cabal haskell community cabal packages provide standard set metadata build process thus possible develop tools upload cabal packages cpan-like community repository software hackage even allow automated downloading compilation installation desired packages hackage since cabal uses global package repository default version conflicts dependencies lead cabal hell state certain packages get installed without re-installing already existing ones therefore breaking packages although version 1.18 introduced sandboxes improved dependency hell non-proper use sandboxes could still lead problems since packages hackage might build version boundaries dependencies loose result stable less bleeding edge variant hackage called stackage created fp complete | [
4769,
3876,
6566,
2281,
5067,
6797,
7983,
2804,
1813,
5397
] | Test |
8,492 | 3 | KiKi_KaiKai:kiki kaikai set feudal japan player must assume role shinto shrine maiden named sayo-chan must use o-fuda scrolls ohari gohei wand defeat number renegade spirits monsters japanese mythology game noteworthy using traditional fantasy setting genre otherwise filled science fiction motifs game follows adventures sayo-chan young shinto shrine maiden living feudal japan one night sayo-chan fanning ceremonial fire visited seven lucky gods warn great impending danger suddenly band mischievous youkai appear kidnap gods quickly retreating faraway mountain range sayo-chan determined help gods sets journey across countryside confronts number strange creatures japanese mythology including obake yurei defeating several powerful youkai leaders sayo must battle leader ancient serpent orochi kiki kaikai overhead multi-directional shooter game requires player move four directions various levels attacking harmful enemies approach screen sayo-chan player attack either throwing special o-fuda scrolls eight separate directions swinging purification rod directly front techniques upgraded finding special paper slips left defeated enemies either enhance power improve range sayo damaged coming contact enemy hit knocked must resume level preset continuation point end level player must face powerful boss monster takes several attacks defeat difficult normal enemies several hidden items found attacking objects sayo purification rod used either enhance attack grant player points certain number points gained player gain another life additional chance complete level player lives exhausted number match screen appears random 3-digit number 50-base increments 100 150 200 250 last three digits player total score match number displayed granted free game game ends family computer disk system version kiki kaikai introduced gameplay changes original arcade version including new levels enemies well limiting number times player may use sayo-chan ranged o-fuda attack along second playable character miki-chan another shrine maiden designated player two character though several additional ports would made years one would rely basic game mechanics kiki kaikai originally created 1986 taito game designer hisaya yabusaki pulling inspiration tales japanese mythology well several top-down arcade shooters popular era game put conventional spin usually technologically driven science-fiction shoot 'em titles time utilizing action game elements player free move screen choose instead forced forward normal scrolling shooter fashion similar earlier released game commando style presentation kiki kaikai described taito lovely action game offering exotic asian atmosphere shortly game japanese debut bootleg version called knight boy released arcades various countries version though officially licensed taito exact duplicate original kiki kaikai altered title screen contained new gameplay elements features kiki kaikai ported numerous home consoles personal computer systems since original arcade release game first home version released msx2 february 10 1987 minor gameplay adjustments august 28 1987 version disk system released entitled kiki kaikai dotouhen added two-player support new playable character miki-chan pc engine version released three years later march 27 1990 largely based previous disk system instalment game made jump consoles june 12 2003 taito developed java-based version kiki kaikai mobile phones called kiki kaikai bizarre world port programmed mediakite appeared may 14 2004 windows-based pcs web-based game service launched taito japanese website later year courtesy ezweb kiki kaikai also made available along various classic taito titles number compilations would appear japanese-only taito memories vol 1 playstation 2 july 28 2005 taito pocket memories playstation portable 2006 game would officially released english first time part taito legends 2 playstation 2 pc xbox released north america may 2007 later taito legends power-up playstation portable kiki kaikai soundtrack composed hisayoshi ogura reflective traditional japanese folk music mostly utilizing woodwind string instruments like shamisen electronic beat music originally presented mono format composed entirely synth-based chiptunes standard audio development system older video game hardware exclusive game soundtrack never released commercially music game featured 1987 album taito game music catalog number 28xa-110 published alfa music single track medley song later presented individualized tracks 2002 re-release taito game music scdc-00156 time published sci-tron digital content kiki kaikai garnered harsh reviews long initial release gamespot considers games one taito sleepier titles overall less quality classic games like bubble bobble double dragon latter licensed technos u.s. game graphics though unique time produced preserve well allgame remarking get initial amusement game smiling ghosts comical skeletons 'll find graphics dull controls seen simplistic yet responsive though game levels found monotonous like ninja warriors kiki kaikai one-off work 1992 taito allowed natsume release kiki kaikai nazo kuro mantle would known pocky rocky north american release natsume would follow pocky rocky 2 years later would help altron release pocky rocky becky modern continuation kiki kaikai kiki kaikai 2 originally development playstation 2 console starfish entertainment set 2006 release canceled early development reemerge unlicensed spiritual successor title kiki kai world later became heavenly guardian published protagonist game design well ghost enemies would later become heavy influences characters reimu hakurei equivalent ghost enemies respectively touhou project games pc-98 sayo-chan kiki kaikai appeared one microgames | [
8709,
4043,
10316,
6797,
4690,
11477,
6390,
9501,
5275,
1693,
4894
] | Test |
8,493 | 4 | AV-TEST:av-test av-test independent organization evaluates rates antivirus security suite software microsoft windows android operating systems according variety criteria every month researchers publish results testing list products awarded certification organisation based magdeburg germany 2013 security specialist ceo security company kaspersky lab eugene kaspersky criticized av-test changing certification process | [
7809,
4994,
1417,
7948,
6797,
9488,
2213,
550,
6823,
2859,
6699,
4659,
7739,
9537,
4435,
10708,
1242,
7515,
2654,
6382,
4464,
9713
] | Test |
8,494 | 9 | Commodore_BASIC:commodore basic commodore basic also known pet basic dialect basic programming language used commodore international 8-bit home computer line stretching pet 1977 c128 1985 core based 6502 microsoft basic shares many characteristics 6502 basics time applesoft basic commodore licensed basic microsoft pay royalties basis jack tramiel turned bill gates offer 3 per unit fee stating 'm already married would pay 25,000 perpetual license commodore took source code flat-fee basic developed internally 8-bit home computers commodore 128 v7.0 microsoft copyright notice displayed however microsoft built easter egg version 2 upgrade commodore basic proved provenance typing obscure command codice_1 would result codice_2 appearing screen easter egg well-obfuscated—the message show disassembly interpreter popular commodore 64 came basic v2.0 rom despite computer released pet/cbm series version 4.0 64 intended home computer pet/cbm series targeted business educational use built-in programming language presumed heavily used saved manufacturing costs v2 fit smaller roms convenient feature commodore rom-resident basic interpreter kernal full-screen editor although commodore keyboards featured two cursor keys alternated direction shift key held screen editor allowed users enter direct commands input edit program lines anywhere screen line prefixed line number tokenized stored program memory lines beginning number executed pressing key whenever cursor happened line marked significant upgrade program entry interfaces compared common home computer basics time typically used line editors invoked separate codice_3 command copy cursor truncated line cursor position also capability saving named files device including cassette – popular storage device days pet one remained use throughout lifespan 8-bit commodores inexpensive form mass storage systems supported filenames diskette made saving multiple files devices difficult user one systems note recorder counter display location file inaccurate prone error pet basic 2.0 files cassettes could requested name device would search filename reading data sequentially ignoring non-matching filenames file system also supported powerful record structure could loaded saved files commodore cassette data recorded digitally rather less expensive less reliable analog methods used manufacturers therefore specialized datasette required rather standard tape recorder adapters available used analog digital converter allow use standard recorder cost little less datasette command may used optional parameter load program memory address contained first two bytes file bytes discarded retained memory parameter used program load start basic program area widely differs machines commodore basic variants supplied codice_4 codice_5 commands worked like counterparts applesoft basic loading saving bitmaps specified memory locations pet support relocatable programs command always load first two bytes contained program file created problem trying load basic programs saved commodore machines would load higher address pet basic expected program workarounds move programs proper location program saved cbm-ii machine way load pet modifying first two bytes disk sector editor cbm-ii series basic program area 0 would result pet attempting load zero page locking like original microsoft basic interpreter based commodore basic slower native machine code test results shown copying 16 kilobytes rom ram takes less second machine code compared minute basic execute faster interpreter programmers started using various techniques speed execution one store often-used floating point values variables rather using literal values interpreting variable name faster interpreting literal number since floating point default type commands faster use floating point numbers arguments rather integers speed important programmers converted sections basic programs 6502 6510 assembly language loaded separately file poked memory data statements end basic program executed basic using codice_6 command either direct mode program execution speed machine language great game waiting user input programmers could poll reading selected memory locations c6 64 d0 128 denoting size keyboard queue delay halt execution commodore basic keywords could abbreviated entering first unshifted keypress shifted keypress next letter set high bit causing interpreter stop reading parse statement according lookup table meant statement high bit set accepted substitute typing entire command however since basic keywords stored memory single byte tokens convenience statement entry rather optimization default uppercase-only character set shifted characters appear graphics symbol e.g command codice_7 could abbreviated codice_8 resembled codice_9 onscreen commands two letters long cases longer cases like ambiguity unshifted letters command needed codice_10 codice_11 required codice_12 commands abbreviated form either due brevity ambiguity commands example command codice_13 abbreviation spelling collided separate codice_14 keyword located nearer beginning keyword lookup table heavily used codice_15 command single codice_16 shortcut common microsoft basic dialects abbreviating commands shifted letters unique commodore basic abbreviating keywords possible fit code single line line lengths usually limited 2 4 screen lines depending specific machine allowed slight saving overhead store otherwise necessary extra program lines nothing basic commands tokenized took 1 byte two case several commands basic 7 basic 10 memory matter way entered long lines could difficult edit codice_17 command displayed entire command keyword extending program line beyond 2 4 screen lines could entered program memory unique feature commodore basic use control codes perform tasks clearing screen positioning cursor within program invoked either issuing command x corresponds control code issued example control code clear screen pressing key question quote marks thus pressing following quote mark cause basic display visual representation control code case reversed heart acted upon program execution directly printing control codes uses less memory executes faster invoking function comparison implementations basic typically dedicated commands clear screen move cursor basic 3.5 proper commands clearing screen moving cursor program lines commodore basic require spaces anywhere command always display one line number statement e.g. common write programs spacing feature added conserve memory since tokenizer never removes space inserted keywords presence spaces results extra codice_18 bytes tokenized program merely skipped execution spaces line number program statement removed tokenizer program lines 80 characters total machines machines 40 column text would cause line wrap around next line screen vic-20 22 column display program lines could occupy many four basic 7.0 commodore 128 increased limit program line 160 characters four 40-column lines two 80-column lines using abbreviations instead possible fit even line basic 7.0 displays error user enters program line 160 characters length earlier versions produced error simply display ready prompt two lines line length exceeded line number counted number characters program line five digit line number result four fewer characters allowed one digit number order execution commodore basic lines determined line numbering instead followed order lines linked memory program lines stored memory singly linked list line number pointer containing address beginning next program line tokenized code line program entered basic would constantly reorder program lines memory line numbers pointers ascending order however program entered manually altering line numbers pointers poke commands could allow out-of-order execution even give line line number early days basic used commercially software protection technique discourage casual modification program line numbers range 0 65520 take five bytes store regardless many digits line number although execution faster fewer digits putting multiple statements line use less memory execute faster variable names significant 2 characters thus variable names codice_19 codice_20 codice_21 refer variable commodore basic also supports bitwise operators although feature part core microsoft 6502 basic code usually omitted implementations applesoft basic native number format commodore basic like parent ms basic floating point contemporary basic implementations used one byte characteristic exponent three bytes mantissa accuracy floating point number using three-byte mantissa 6.5 decimal digits round-off error common 6502 implementations microsoft basic utilized 40-bit floating point arithmetic meaning variables took five bytes store four byte mantissa one byte exponent unlike 32-bit floating point found basic-80 8080/z80 implementations microsoft basic supported integer double precision variables 6502 implementations floating point although commodore basic supports signed integer variables denoted percent sign range -32768 32767 practice used array variables serve function conserving memory limiting array elements two bytes array 2000 elements occupy 10,000 bytes declared floating point array 4000 declared integer array denoting variable integer simply causes basic convert back floating point slowing program execution wasting memory percent sign takes one additional byte store since also applies integer arrays programmer avoid using unless large arrays used would exceed available memory stored floating point also possible memory locations 32767 address defined signed integer period used place number 0 thus instead instead execute slightly faster statement used start machine language programs added commodore original microsoft basic code featured usr function invoking machine language routines automatically loads cpu registers values c64 varies machines -- used pass data machine language routines means calling kernal functions basic example clears screen since commodore 8-bit machines c128 automatically boot disk software usual technique include basic stub like begin program execution possible automatically start software loading require user type statement done piece code hooks basic ready vector versions microsoft basic array declared statement automatically set ten elements practice 11 since array elements counted 0 larger arrays must declared basic display error program run array re-dimensioned program unless variables wiped via clr statement numeric arrays automatically filled zeros created may momentary delay program execution large array dimensioned string variables represented tagging variable name dollar sign thus variables codice_22 codice_23 codice_24 would understood distinct array variables also considered distinct simple variables thus refer variable size string array merely refers many strings stored array size element allocated dynamically unlike implementations microsoft basic commodore basic require string space reserved start program unlike 8-bit machines apple ii commodore machines built-in clock initialized 0 power updated every tick pia/via/ted/cia timer thus 60 times per second assigned two system variables basic contain current time ti read-only modified result syntax error message may used set time via six number string error results using string six numbers clock reliable method timekeeping since stops whenever interrupts turned done kernal routines accessing iec ieee port pet port slow clock update ticks function commodore basic use clock generate random numbers accomplished however relatively limited use numbers 0 255 returned otherwise works implementations microsoft basic pseudo-random sequence used via fixed 5-byte seed value stored power memory locations c64 location differs machines number higher 0 generate random number amalgamated value included function seed value updated 1 time rnd function executed negative number goes point sequence current seed value specified number since true random number generation impossible statement typical c64 c128 utilize sid chip white noise channel random numbers basic 2.0 notoriously suffered extremely slow garbage collection strings garbage collection automatically invoked time function executed many string variables arrays manipulated course program clearing take hour worst conditions also possible abort garbage collection basic scan run/stop key performing routine basic 4.0 introduced improved garbage collection system back pointers later implementations commodore basic also function basic 2.0 suffered another technical flaw handle signed numbers 32768 thus function invoked c64 38k basic memory negative amount free basic memory displayed adding 65535 reported number obtain correct amount free memory pet vic-20 never 32k total memory available basic limitation become apparent c64 developed function basic 3.5 7.0 corrected problem basic 7.0 also split two functions one display free basic program text memory display free variable memory many basic extensions released commodore 64 due relatively limited capabilities native basic 2.0 one popular extensions dos wedge included commodore 1541 test/demo disk 1 kb extension basic added number disk-related commands including ability read disk directory without destroying program memory features subsequently incorporated various third-party extensions popular epyx fastload cartridge basic extensions added additional keywords make easier code sprites sound high-resolution graphics like simons basic although basic 2.0 lack sound graphics features frustrating many users critics argued ultimately beneficial since forced user learn machine language limitations basic 2.0 c64 led use built-in rom machine language basic load file designated memory location filename drive device number would read call location would specified x registers load routine would called disk magazine c64 loadstar venue hobbyist programmers shared collections proto-commands basic called command modern programming point view earlier versions commodore basic presented host bad programming traps programmer issues derived microsoft basic virtually every home computer basic era suffered similar deficiencies every line microsoft basic program assigned line number programmer common practice increment numbers value 5 10 100 make inserting lines program editing debugging easier bad planning meant inserting large sections program often required restructuring entire code common technique start program low line number jump table body program structured sections starting designated line number like 1000 2000 large section needed added could assigned next available major line number inserted jump table later basic versions commodore platforms included command well auto line numbering command would automatically select insert line numbers according selected increment addition variables treated global variables clearly defined loops hard create often causing programmer rely command later rectified basic 3.5 addition commands flag variables often needed created perform certain tasks earlier basics commodore also lack debugging commands meaning bugs unused variables hard trap structures standard part z80 microsoft basics added basic 3.5 unavailable earlier versions commodore basic common home computers commodore machines booted directly basic interpreter basic file programming commands could entered direct mode load execute software program execution halted using run/stop key variable values would preserved ram could printed debugging 128 even dedicated second 64k bank variable storage allowing values persist codice_25 codice_26 command issued along advanced screen editor included commodore basic gave programming environment repl-like feel programmers could insert edit program lines screen location interactively building program contrast business-oriented operating systems time like cp/m ms-dos typically booted command line interface programming language required platforms loaded separately versions commodore basic included disk-specific codice_27 codice_28 commands version built commodore 64 lacked requiring user specify disk drive device number typically 8 9 standard codice_29 command otherwise defaulted tape another omission commodore 64s basic 2.0 codice_30 command display disk contents without clearing main memory 64 viewing files disk implemented loading program listed showed directory pseudo basic program file block size line number effect overwriting currently loaded program addons like dos wedge overcame rendering directory listing direct screen memory list cbm basic versions chronological order successively added features | [
3718,
7691,
1805,
9997,
786,
11412,
22,
3736,
3481,
9881,
4764,
797,
3233,
11683,
5925,
8101,
10533,
4136,
10666,
5293,
303,
7343,
11315,
4409,
315,
7355,
7486,
7870,
4160,
4674,
8262,
10750,
712,
9549,
9166,
847,
2383,
1879,
9563,
92,
... | Train |
8,495 | 7 | Heroku:heroku heroku cloud platform service paas supporting several programming languages one first cloud platforms heroku development since june 2007 supported ruby programming language supports java node.js scala clojure python php go reason heroku said polyglot platform features developer build run scale applications similar manner across languages heroku acquired salesforce.com 2010 212 million heroku initially developed james lindenbaum adam wiggins orion henry supporting projects compatible ruby programming platform known rack prototype development took around six months later heroku faced drawbacks lack proper market customers many app developers used tools environment jan 2009 new platform launched built almost scratch three-month effort october 2009 byron sebastian joined heroku ceo december 8 2010 salesforce.com acquired heroku wholly owned subsidiary salesforce.com july 12 2011 yukihiro matz matsumoto chief designer ruby programming language joined company chief architect ruby month heroku added support node.js clojure september 15 2011 heroku facebook introduced heroku facebook present heroku supports redis databases addition standard postgresql name heroku portmanteau heroic haiku japanese theme nod matz creating ruby name pronounced similarly “ widening ” japanese though creators heroku want name project particular meaning japanese language chose invent name applications run heroku typically unique domain typically applicationname.herokuapp.com used route http requests correct dyno application containers dynos spread across dyno grid consists several servers heroku git server handles application repository pushes permitted users heroku services hosted amazon ec2 cloud-computing platform | [
1539,
526,
4623,
10265,
9245,
5662,
1568,
5666,
9766,
39,
5159,
5677,
3121,
5681,
564,
10820,
8262,
4683,
8779,
8269,
590,
1102,
7248,
5202,
4194,
5732,
11376,
3705,
2170,
4236,
10893,
6307,
2217,
11439,
9906,
7347,
7352,
4289,
3269,
1224... | Test |
8,496 | 3 | Gun.Smoke:gun.smoke gun.smoke 1985 vertical scrolling shooter arcade game capcom wild west-themed game designed yoshiki okamoto gun.smoke centers character named billy bob nes version bounty hunter vicious criminals wild west red dead revolver first installment red dead series spiritual successor gun.smoke gun.smoke similar 1942 commando also developed capcom differences game scrolling shooter screen scrolls upward automatically players three ways shoot using three buttons left right center shooting player also change way gunman shoots button combinations player dies getting shot struck enemies getting caught obstacle bottom screen player collect special items including horse protection three hits get killed obstacle boots speed movement bullets faster shots rifles longer shot range items found shooting barrels rifles boots bullets stock five items add score points include stars bottles bags dragonflies cows two items watch yashichi 1up cattle skull reduces billy power note two versions gun.smoke released license america romstar one fixed sequence bosses third sixth levels swapped roy followed wolf chief pig joe followed ninja version also removes boss rundown gun.smoke ported many systems game later ported nintendo entertainment system family computer disk system 1988 objective free town hicksville band criminals known wingates order capture dangerous henchmen stage player must retrieve wanted sign said henchman otherwise impossible clear stage nes version also different music game main character bounty hunter named billy bob even though nes version stayed true gameplay arcade version major changes done although virtually identical nes version fds version featured several differences soundtrack arcade version composed ayako mori august 25 1986 alfa records released limited edition soundtrack featuring music arcade version well two unused tracks catalog number capcom game music – 28xa-94 | [
11238,
8937,
10316,
9006,
1776,
4082
] | Validation |
8,497 | 4 | SpoonWEP/WPA:spoonwep/wpa spoonwep/wpa gui uses aircrack-ng autonomously crack wep wpa keys tool included so-called network-scrounging cards chinese usb wi-fi adapters promise internet access free | [
4580,
7983,
1232,
2739,
1429,
823,
10329,
8922,
10332
] | Test |
8,498 | 3 | Interoperation:interoperation engineering interoperation setup ad hoc components methods make two systems work together combined system partial functionality certain time possibly requiring human supervision perform necessary adjustments corrections contrasts interoperability theoretically permits number systems compliant given standard work together long time smoothly unattended combined system full functionality standard another definition interoperation services effectively combining multiple resources domains ... requires interoperability interoperation usually performed systems combined designed standardization example legacy systems standard compliance expensive difficult immature interoperation may use following mechanisms components methods area data processing interoperation may also use following components methods | [
531,
2948
] | Test |
8,499 | 2 | Pipeline_(Unix):pipeline unix unix-like computer operating systems pipeline mechanism inter-process communication using message passing pipeline set processes chained together standard streams output text process stdout passed directly input stdin next one first process completed second started executed concurrently concept pipelines championed douglas mcilroy unix ancestral home bell labs development unix shaping toolbox philosophy named analogy physical pipeline key feature pipelines hiding internals ritchie thompson 1974 turn allows clarity simplicity system article anonymous pipes data written one process buffered operating system read next process uni-directional channel disappears processes completed differs named pipes messages passed pipe named making file remains processes completed standard shell syntax anonymous pipes list multiple commands separated vertical bars pipes common unix verbiage example list files current directory retain lines output containing string view result scrolling page user types following command line terminal codice_1 produces process output stdout piped input stdin process grep key likewise process less process takes input previous process produces output next process via standard streams codice_2 tells shell connect standard output command left standard input command right inter-process communication mechanism called anonymous pipe implemented operating system pipes unidirectional data flows pipeline left right widely used unix shells special syntax construct creation pipelines usage one writes commands sequence separated ascii vertical bar character codice_2 reason often called pipe character shell starts processes arranges necessary connections standard streams including amount buffer storage default standard error streams stderr processes pipeline passed pipe instead merged directed console however many shells additional syntax changing behavior csh shell instance using codice_4 instead codice_2 signifies standard error stream also merged standard output fed next process bourne shell also merge standard error codice_4 since bash 4.0 using codice_7 well redirect different file commonly used simple pipelines shell connects series sub-processes via pipes executes external commands within sub-process thus shell direct processing data flowing pipeline however possible shell perform processing directly using so-called mill pipemill since codice_8 command used mill results initial command construct generally looks something like pipemill may perform intended body loop includes commands codice_9 codice_10 read codice_11 loop first iteration program let call drain read remaining output codice_12 loop terminate results depending specifics drain couple possible ways avoid behavior first drains support option disable reading codice_11 e.g codice_14 alternatively drain need read input codice_11 something useful given codice_16 input pipelines created program control unix codice_17 system call asks operating system construct new anonymous pipe object results two new opened file descriptors process read-only end pipe write-only end pipe ends appear normal anonymous file descriptors except ability seek avoid deadlock exploit parallelism unix process one new pipes generally call codice_18 create new processes process close end pipe using producing consuming data alternatively process might create new thread use pipe communicate named pipes may also created using codice_19 codice_20 presented input output file programs invoked allow multi-path pipes created especially effective combined standard error redirection codice_21 unix-like systems processes pipeline started time streams appropriately connected managed scheduler together processes running machine important aspect setting unix pipes apart pipe implementations concept buffering example sending program may produce 5000 bytes per second receiving program may able accept 100 bytes per second data lost instead output sending program held buffer receiving program ready read data next program pipeline reads buffer linux size buffer 65,536 bytes 64kib open source third-party filter called bfr available provide larger buffers required tools like netcat socat connect pipes tcp/ip sockets pipeline concept invented douglas mcilroy first described man pages version 3 unix mcilroy noticed much time command shells passed output file one program input another ideas implemented 1973 one feverish night wrote mcilroy ken thompson added codice_17 system call pipes shell several utilities version 3 unix next day mcilroy continued saw unforgettable orgy one-liners everybody joined excitement plumbing mcilroy also credits thompson codice_2 notation greatly simplified description pipe syntax version 4 idea eventually ported operating systems dos os/2 microsoft windows beos often notation although developed independently unix pipes related preceded 'communication files developed ken lochner 1960s dartmouth time sharing system tony hoare communicating sequential processes csp mcilroy pipes developed robot icon apple automator also uses pipeline concept chain repetitive commands together holds pipe homage original unix concept feature unix borrowed operating systems taos ms-dos eventually became pipes filters design pattern software engineering | [
5249,
515,
9735,
4492,
6797,
4750,
8846,
3856,
4369,
8975,
9874,
3733,
5397,
1561,
6813,
7325,
671,
5537,
9507,
5029,
6694,
2599,
7975,
10407,
5036,
2222,
7983,
8369,
1586,
11442,
8631,
2621,
5698,
4423,
8522,
8523,
2380,
9166,
1359,
5714... | Train |
8,500 | 4 | Null_session:null session null session anonymous connection inter-process communication network service windows-based computers service designed allow named pipe connections may used attackers remotely gather information system | [
6797
] | None |
8,501 | 3 | Instruction_pipelining:instruction pipelining computer science instruction pipelining technique implementing instruction-level parallelism within single processor pipelining attempts keep every part processor busy instruction dividing incoming instructions series sequential steps eponymous pipeline performed different processor units different parts instructions processed parallel allows faster cpu throughput would otherwise possible given clock rate may increase latency due added overhead pipelining process central processing units cpus driven clock clock pulse need thing rather logic cpu directs successive pulses different places perform useful sequence many reasons entire execution machine instruction happen pipelining effects happen time made dependent steps instruction example one clock pulse latches value register begins calculation take time value stable outputs register calculation complete another example reading instruction memory unit done time instruction writes result memory unit number dependent steps varies machine architecture example pipeline made deeper greater number dependent steps given step implemented simpler circuitry may let processor clock run faster pipelines may called superpipelines processor said fully pipelined fetch instruction every cycle thus instructions conditions require delays inhibit fetching new instructions processor fully pipelined seminal uses pipelining illiac ii project ibm stretch project though simple version used earlier z1 1939 z3 1941 pipelining began earnest late 1970s supercomputers vector processors array processors one early supercomputers cyber series built control data corporation main architect seymour cray later headed cray research cray developed xmp line supercomputers using pipelining multiply add/subtract functions later star technologies added parallelism several pipelined functions working parallel developed roger chen 1984 star technologies added pipelined divide circuit developed james bradley mid-1980s pipelining used many different companies around world pipelining limited supercomputers 1976 amdahl corporation 470 series general purpose mainframe 7-step pipeline patented branch prediction circuit today pipelining innovations implemented instruction unit microprocessors model sequential execution assumes instruction completes next one begins assumption true pipelined processor situation expected result problematic known hazard imagine following two register instructions hypothetical processor processor 5 steps listed initial illustration instruction 1 would fetched time execution would complete instruction 2 would fetched would complete first instruction might deposit incremented number r5 fifth step register write back second instruction might get number r5 copy r6 second step instruction decode register fetch time seems first instruction would incremented value code invokes hazard writing computer programs compiled language might raise concerns compiler could designed generate machine code avoids hazards early dsp risc processors documentation advises programmers avoid dependencies adjacent nearly adjacent instructions called delay slots declares second instruction uses old value rather desired value example processor might counter-intuitively copy unincremented value declares value uses undefined programmer may unrelated work processor meantime ensure correct results programmer may insert nops code partly negating advantages pipelining pipelined processors commonly use three techniques work expected programmer assumes instruction completes next one begins branch normal instruction sequence often involves hazard unless processor give effect branch single time cycle pipeline continue fetching instructions sequentially instructions allowed take effect programmer diverted control another part program conditional branch even problematic processor may may branch depending calculation yet occurred various processors may stall may attempt branch prediction may able begin execute two different program sequences eager execution assuming branch taken discarding work pertains incorrect guess processor implementation branch prediction usually makes correct predictions minimize performance penalty branching however branches predicted poorly may create work processor flushing pipeline incorrect code path begun execution resuming execution correct location programs written pipelined processor deliberately avoid branching minimize possible loss speed example programmer handle usual case sequential execution branch detecting unusual cases using programs gcov analyze code coverage lets programmer measure often particular branches actually executed gain insight optimize code right generic pipeline four stages fetch decode execute write-back top gray box list instructions waiting executed bottom gray box list instructions execution completed middle white box pipeline execution follows pipelined processor may deal hazards stalling creating bubble pipeline resulting one cycles nothing useful happens illustration right cycle 3 processor decode purple instruction perhaps processor determines decoding depends results produced execution green instruction green instruction proceed execute stage write-back stage scheduled purple instruction stalled one cycle fetch stage blue instruction due fetched cycle 3 stalled one cycle red instruction bubble blue ovals illustration processor decode circuitry idle cycle 3 execute circuitry idle cycle 4 write-back circuitry idle cycle 5 bubble moves pipeline cycle 6 normal execution resumes everything one cycle late take 8 cycles cycle 1 8 rather 7 completely execute four instructions shown colors | [
7173,
9739,
2066,
7699,
5655,
10779,
10781,
10786,
6181,
8231,
3630,
6705,
7218,
2623,
2113,
7234,
3142,
2638,
2140,
1122,
4194,
3175,
5223,
8810,
4205,
8301,
8815,
630,
6774,
8822,
7802,
6268,
3197,
7313,
6815,
8352,
5793,
2210,
6818,
47... | None |
8,502 | 9 | PL/I:pl/i pl/i programming language one pronounced procedural imperative computer programming language developed published ibm designed scientific engineering business system programming used academic commercial industrial organizations since introduced 1960s still used pl/i main domains data processing numerical computation scientific computing system programming supports recursion structured programming linked data structure handling fixed-point floating-point complex character string handling bit string handling language syntax english-like suited describing complex data formats wide set functions available verify manipulate 1950s early 1960s business scientific users programmed different computer hardware using different programming languages business users moving autocoders via comtran cobol scientific users programmed general interpretive programme gip fortran algol george others ibm system/360 announced 1964 delivered 1966 designed common machine architecture groups users superseding existing ibm architectures similarly ibm wanted single programming language users hoped fortran could extended include features needed commercial programmers october 1963 committee formed composed originally three ibmers new york three members share ibm scientific users group propose extensions fortran given constraints fortran unable embarked design new programming language based loosely algol labeled npl acronym conflicted uk national physical laboratory replaced briefly mppl multipurpose programming language 1965 pl/i roman numeral first definition appeared april 1964 ibm took npl starting point completed design level first compiler could written npl definition incomplete scope detail control pl/i language vested initially new york programming center later ibm uk laboratory hursley share guide user groups involved extending language role ibm process controlling language pl/i projects experience defining large language showed need formal definition pl/i project set 1967 ibm laboratory vienna make unambiguous complete specification led turn one first large scale formal methods development vdm fred brooks credited ensuring pl/i character data type language first specified detail manual pl/i language specifications c28-6571 written new york 1965 superseded pl/i language specifications gy33-6003 written hursley 1967 ibm continued develop pl/i late sixties early seventies publishing gy33-6003 manual manuals used multics group early implementers first compiler delivered 1966 standard pl/i approved 1976 goals pl/i evolved early development language competitiveness cobol record handling report writing required language scope usefulness grew include system programming event-driven programming additional goals pl/i achieve goals pl/i borrowed ideas contemporary languages adding substantial new capabilities casting distinctive concise readable syntax many principles capabilities combined give language character important meeting language goals language designed things programmers summary extracted ansi pl/i standard ansi pl/i general-purpose subset standard pl/i program consists set procedures written sequence statements codice_5 construct used include text sources program translation statement types summarized groupings give overview language standard uses organization names may declared represent data following types either single values aggregates form arrays lower-bound upper-bound per dimension structures comprising nested structure array scalar variables codice_6 type comprises attributes base scale precision scale factor codice_7 type encoded within codice_8 mode specified separately codice_9 applied real imaginary parts values computed expressions written using specific set operations builtin functions may applied aggregates well single values together user-defined procedures likewise may operate return aggregate well single values assignment statement assigns values one variables reserved words pl/i statement terminated semi-colon maximum length statement implementation defined comment may appear anywhere program space permitted preceded characters forward slash asterisk terminated characters asterisk forward slash i.e statements may label-prefix introducing entry name codice_10 codice_11 statements label name condition prefix enabling disabling computational condition e.g codice_12 entry label names may single identifiers identifiers followed subscript list constants codice_13 sequence statements becomes group preceded codice_4 statement followed codice_15 statement groups may include nested groups begin blocks codice_16 statement specifies group single statement codice_17 part codice_18 part see sample program group unit iteration begin block codice_19 may contain declarations names internal procedures local block procedure starts codice_11 statement terminated syntactically codice_15 statement body procedure sequence blocks groups statements contains declarations names procedures local procedure codice_22 procedure on-unit single statement block statements written executed one conditions occur computational condition input/output condition one conditions declaration identifier may contain one following attributes need mutually consistent current compilers kednos micro focus particularly ibm implement many extensions standardized version language ibm extensions summarised implementation sub-section compiler later although extensions common compilers lack current standard means compatibility guaranteed language standardization began april 1966 europe ecma tc10 1969 ansi established composite language development committee nicknamed kludge later renamed x3j1 pl/i standardization became joint effort ecma tc/10 ansi x3j1 subset gy33-6003 document offered joint effort ibm became base document standardization major features omitted base document multitasking attributes program optimization e.g codice_27 codice_28 proposals change base document voted upon committees event committees disagreed chairs initially michael marcotty general motors c.a.r hoare representing icl resolve disagreement addition ibm honeywell cdc data general digital equipment prime computer burroughs rca univac served x3j1 along major users eastman kodak mitre union carbide bell laboratories various government university representatives development language occurred standards bodies continuing improvements structured programming internal consistency omission obscure contentious features language development neared end x3j1/tc10 realized number problems document written english text discussion single item might appear multiple places might might agree difficult determine omissions well inconsistencies consequently david beech ibm robert freiburghouse honeywell milton barber cdc m. donald maclaren argonne national laboratory craig franklin data general lois frampton digital equipment editor d.j andrews ibm undertook rewrite entire document producing one complete chapters standard couched formal definition using pl/i machine specify semantics first possibly programming language standard written semi-formal definition pl/i general-purpose subset subset-g standard issued ansi 1981 revision published 1987 general purpose subset widely adopted kernel pl/i implementations pl/i first implemented ibm hursley laboratories united kingdom part development system/360 first production pl/i compiler pl/i f compiler os/360 operating system built john nash team hursley uk runtime library team managed i.m nobby clarke pl/i f compiler written entirely system/360 assembly language release 1 shipped 1966 os/360 real-memory environment compiler designed systems little 64 kilobytes real storage – f 64 kb s/360 parlance fit large compiler 44 kilobytes memory available 64-kilobyte machine compiler consists control phase large number compiler phases approaching 100 phases brought memory disk one time handle particular language features aspects compilation phase makes single pass partially-compiled program usually held memory aspects language still designed pl/i f implemented omitted later releases pl/i record i/o shipped pl/i f release 2 list processing functions based variables pointers areas offsets locate-mode i/o first shipped release 4 major attempt speed pl/i code compete fortran object code pl/i f release 5 substantial program optimization do-loops facilitated reorder option procedures version pl/i f released tss/360 timesharing operating system system/360 model 67 adapted ibm mohansic lab ibm la gaude lab france developed language conversion programs convert fortran cobol algol programs pl/i f level pl/i pl/i compiler using 16 kilobytes memory developed ibm germany dos/360 low end operating system implements subset pl/i language requiring strings arrays fixed extents thus simplifying run-time environment reflecting underlying operating system lacks dynamic storage allocation controlled storage class shipped within year pl/i f. compilers implemented several groups early 1960s multics project mit one first develop operating system high-level language used early pl/i epl subset dialect pl/i implementation language 1964 epl developed bell labs mit douglas mcilroy robert morris others influential multics pl/i compiler source compiler technology used number manufacturers software groups honeywell pl/i compiler series 60 implementation full ansi x3j1 standard pl/i optimizer checkout compilers produced hursley support common level pl/i language aimed replace pl/i f compiler checkout compiler rewrite pl/i f bsl ibm pl/i-like proprietary implementation language later pl/s performance objectives set compilers shown ibm presentation bcs compilers produce identical results checkout compiler used debug programs would submitted optimizer given compilers entirely different designs handling full pl/i language goal challenging achieved pl/i optimizing compiler took pl/i f compiler ibm workhorse compiler 1970s 1990s like pl/i f multiple pass compiler 44 kilobyte design point entirely new design unlike f compiler perform compile time evaluation constant expressions using run-time library reducing maximum memory compiler phase 28 kilobytes second-time around design succeeded eliminating annoyances pl/i f cascading diagnostics written s/360 macro assembler team led tony burbridge worked pl/i f. macros defined automate common compiler services shield compiler writers task managing real-mode storage allowing compiler moved easily memory models gamut program optimization techniques developed contemporary ibm fortran h compiler deployed optimizer equaled fortran execution speeds hands good programmers announced ibm s/370 1970 shipped first dos/360 operating system august 1971 shortly afterward os/360 first virtual memory ibm operating systems os/vs1 mvs vm/cms developers unaware shoehorning code 28 kb sections ibm poughkeepsie finally ready ship virtual memory support os/360 supported batch programming environments tso cms could run interactively compiler went many versions covering mainframe operating systems including operating systems japanese plug-compatible machines pcms compiler superseded ibm pl/i os/2 aix linux z/os pl/i checkout compiler colloquially checker announced august 1970 designed speed improve debugging pl/i programs team led brian marks three-pass design cut time compile program 25 taken f compiler run interactive terminal converting pl/i programs internal format h-text format interpreted checkout compiler run-time detecting virtually types errors pointers represented 16 bytes containing target address description referenced item thus permitting bad pointer use diagnosed conversational environment error detected control passed user inspect variables introduce debugging statements edit source program time debugging capability mainframe programming environments developed functions offered compiler withdrawn 1990s perhaps commercially successful implementation aside ibm digital equipment 1988 release ansi pl/i 1987 subset implementation strict superset ansi x3.4-1981 pl/i general purpose subset provides features new ansi x3.74-1987 pl/i general purpose subset front end designed robert freiburghouse code generator implemented dave cutler managed design implementation vax/vms runs vms vax alpha tru64 uniprise systems inc. responsible compiler late 1960s early 1970s many us canadian universities establishing time-sharing services campus needed conversational compiler/interpreters use teaching science mathematics engineering computer science dartmouth developing basic pl/i popular choice concise easy teach ibm offerings unsuitable number schools built subsets pl/i interactive support examples compiler developed cornell university teaching dialect called pl/c unusual capability never failing compile program use extensive automatic correction many syntax errors converting remaining syntax errors output statements language almost pl/i implemented ibm pl/c fast compiler plago created polytechnic institute brooklyn used simplified subset pl/i language focused good diagnostic error messages fast compilation times computer systems research group university toronto produced sp/k compilers supported sequence subsets pl/i called sp/1 sp/2 sp/3 ... sp/8 teaching programming programs ran without errors sp/k compilers produced results contemporary pl/i compilers ibm pl/i f compiler ibm checkout compiler cornell university pl/c compiler examples pl0 p. grouse university new south wales plum marvin zelkowitz university maryland. pluto university toronto major revamp pl/i ibm santa teresa california launched entirely new compiler 1992 initial shipment os/2 included ansi-g features many new pl/i features subsequent releases covered additional platforms mvs vm os/390 aix windows -although support windows since withdrawn continued add functions make pl/i fully competitive languages offered pc particularly c c++ areas overtaken corresponding ibm language environment supports inter-operation pl/i programs database transaction systems programs written c c++ cobol compiler supports data types needed intercommunication languages pl/i design principles retained withstood major extension comprising several new data types new statements statement options new exception conditions new organisations program source resulting language compatible super-set pl/i standard earlier ibm compilers major topics added pl/i latest series pl/i compilers z/os called enterprise pl/i z/os leverage code generation latest z/architecture processors z14 z13 zec12 zbc12 z196 z114 via use archlvl parm control passed compilation second high level language supported z/os language environment xl c/c++ first enterprise cobol v5 last codice_30 new computational data type ordinal facilities like pascal e.g codice_39 addition name internal values accessible via built-in functions built-in functions provide access ordinal value predecessor successor codice_40 see allows additional codice_33s declared composed pl/i built-in attributes codice_42 locator data type similar codice_43 data type strongly typed bind particular data structure codice_44 operator used select data structure using handle codice_34 attribute equivalent codice_46 early pl/i specifications permits several scalar variables arrays structures share storage unit occupies amount storage needed largest alternative attributes added new string-handling functions added centre text edit using picture format trim blanks selected characters head tail text codice_63 codice_64 right codice_65 codice_66 functions compound assignment operators la c e.g codice_67 codice_68 codice_69 codice_70 added codice_71 equivalent codice_72 additional parameter descriptors attributes added omitted arguments variable length argument lists codice_73 attribute declares identifier constant derived specific literal value restricted expression parameters codice_74 pass address codice_37 pass value attributes codice_76 codice_77 attributes prevent unintended assignments codice_78 obviates need contrived construct codice_79 codice_40 introduces user-specified names e.g codice_81 combinations built-in attributes e.g codice_82 thus codice_83 creates codice_33 name codice_81 alias set built-in attributes fixed binary 31.0 codice_31 applies structures members provides codice_33 name set structure attributes corresponding substructure member declarations use structure declaration generalisation codice_88 attribute codice_89 statement exit loop codice_90 continue next iteration loop codice_56 codice_57 options iterative groups package construct consisting set procedures declarations use unit variables declared outside procedures local package use codice_93 codice_94 codice_95 storage procedure names used package also local made external means codice_96 option codice_97 codice_98 executed on-unit terminates execution on-unit raises condition procedure called current one thus passing control corresponding on-unit procedure codice_99 condition handles invalid operation codes detected pc processor well illegal arithmetic operations subtraction two infinite values codice_100 condition provided intercept conditions specific on-unit provided current procedure codice_101 condition raised codice_102 statement unable obtain sufficient storage number vendors produced compilers compete ibm pl/i f optimizing compiler mainframes minicomputers 1970s 1980s target usually emerging ansi-g subset pl/i implementations developed mainframes late 1960s mini computers 1970s personal computers 1980s 1990s although main use mainframes pl/i versions dos microsoft windows os/2 aix openvms unix widely used business data processing system use writing operating systems certain platforms complex powerful systems built pl/i sas system initially written pl/i sas data step still modeled pl/i syntax pioneering online airline reservation system sabre originally written ibm 7090 assembler s/360 version largely written using sabretalk purpose built subset pl/i compiler dedicated control program pl/i used write executable formal definition interpret ibm system network architecture pl/i fulfill supporters hopes would displace fortran cobol become major player mainframes remained minority significant player definitive explanation trends 1970s 1980s militated success progressively reducing territory pl/i enjoyed competitive advantage first nature mainframe software environment changed application subsystems database transaction processing cics ims oracle system 370 application generators became focus mainframe users application development significant parts language became irrelevant need use corresponding native features subsystems tasking much input/output fortran used application areas confining pl/i cobol territory users stayed cobol pc became dominant environment program development fortran cobol pl/i became minority languages overtaken c++ java like second pl/i overtaken system programming field ibm system programming community ready use pl/i instead ibm developed adopted proprietary dialect pl/i system programming – pl/s success pl/s inside ibm c outside ibm unique pl/i strengths system programming became less valuable third development environments grew capabilities interactive software development made unique pl/i interactive debugging strengths less valuable fourth cobol fortran added features structured programming character string operations object orientation reduced pl/i relative advantages mainframes substantial business issues stake ibm hardware competitors little gain much lose success pl/i compiler development expensive ibm compiler groups in-built competitive advantage many ibm users wished avoid locked proprietary solutions early support pl/i vendors best avoid pl/i article uses pl/i standard reference point language features number features significance early implementations standard offered non-ibm compilers de facto language continued grow standard ultimately driven developments personal computer multi tasking implemented pl/i f optimizer newer aix z/os compilers comprised data types codice_104 codice_105 codice_106 codice_107 fork codice_108 join codice_109 codice_110s record i/o statements codice_111 statement unlock locked records codice_112 files event data identify particular event indicate whether complete 1 b incomplete 0 b task data items identify particular task process indicate priority relative tasks first ibm compile time preprocessor built ibm boston advanced programming center located cambridge mass shipped pl/i f compiler codice_5 statement standard rest features dec kednos pl/i compilers implemented much set features ibm additions ibm continued add preprocessor features compilers preprocessor treats written source program sequence tokens copying output source file acting token encountered following compile time statement executed identifier token encountered identifier codice_114d codice_115d assigned compile time value identifier replaced value tokens added output stream require action e.g codice_116 values activated compile time expressions thus compile time variable codice_117 could declared activated assigned using codice_118 subsequent occurrences codice_117 would replaced codice_120 data type supported codice_121 integers codice_122 strings varying length maximum length structure statements simple statements also may label-list feature allowed programmers use identifiers constants e.g product part numbers mathematical constants superseded standard named constants computational data conditional compiling iterative generation source code possible compile-time facilities supported standard several manufacturers implemented facilities structured programming additions made pl/i standardization accepted standard features codice_133 exit iterative codice_4 codice_135 codice_136 added codice_4 case statement general form codice_138 br features included dec pl/i pl/i f offered debug facilities put forward standard implemented others notably check variable-list condition prefix codice_139 on-condition codice_140 option ibm optimizing checkout compilers added additional features appropriate conversational mainframe programming environment e.g codice_141 condition several attempts made design structure member type could one several datatypes codice_46 early ibm growth classes programming theory approaches became possible pl/i base codice_34 codice_33 etc added several compilers pl/i conceived single-byte character world support japanese chinese language becoming essential developments international code pages character string concept expanded accommodate wide non-ascii/ebcdic strings time date handling overhauled deal millennium problem introduction datetime function returned date time one 35 different formats several date functions deal conversions days seconds though language easy learn use implementing pl/i compiler difficult time-consuming language large pl/i needed subsets vendors could produce users master resolved ansi g published compile time facilities unique pl/i took added implementation effort additional compiler passes pl/i compiler two four times large comparable fortran cobol compilers also much slower—supposedly offset gains programmer productivity anticipated ibm first compilers written argue pl/i unusually hard parse pl/i keywords reserved programmers use variable procedure names programs original pl/i f compiler attempts auto-correction encounters keyword used incorrect context often assumes variable name leads cascading diagnostics problem solved later compilers effort needed produce good object code perhaps underestimated initial design language program optimization needed compete excellent program optimization carried available fortran compilers unusually complex owing side effects pervasive problems aliasing variables unpredictable modification occur asynchronously exception handlers may provided statements unseen callers together make difficult reliably predict program variables might modified runtime typical use however user-written error handlers codice_145 often make assignments variables spite aforementioned difficulties ibm produced pl/i optimising compiler 1971 pl/i contains many rarely-used features multitasking support ibm extension language add cost complexity compiler co-processing facilities require multi-programming environment support non-blocking multiple threads processes operating system compiler writers free select whether implement features undeclared variable default declared first occurrence—thus misspelling might lead unpredictable results implicit declaration different fortran programs pl/i f however attribute listing enables programmer detect misspelled undeclared variable many programmers slow move cobol fortran due perceived complexity language immaturity pl/i f compiler programmers sharply divided scientific programmers used fortran business programmers used cobol significant tension even dislike groups pl/i syntax borrowed cobol fortran syntax instead noticing features would make job easier fortran programmers time noticed cobol syntax opinion business language cobol programmers noticed fortran syntax looked upon scientific language cobol fortran programmers viewed bigger version language somewhat intimidated language disinclined adopt another factor pseudo -similarities cobol fortran algol pl/i elements looked similar one languages worked differently pl/i frustrations left many experienced programmers jaundiced view pl/i often active dislike language early unix fortune file contained following tongue-in-cheek description language speaking someone delved intricacies pl/i sure real men could written machine-hogging cycle-grabbing all-encompassing monster allocate array free middle third sure multiply character string times bit string assign result float decimal go ahead free controlled variable procedure parameter reallocate passing back overlay three different types variable memory location anything say write recursive macro well real men use rescan could language obviously designed written real men intended real man use positive side full support pointers data types including pointers structures recursion multitasking string handling extensive built-in functions pl/i indeed quite leap forward compared programming languages time however enough persuade majority programmers shops switch pl/i pl/i f compiler compile time preprocessor unusual outside lisp world using target language syntax semantics e.g compared c preprocessor directives pl/i provides several 'storage classes indicate lifetime variables storage managed codice_146 codice_94 simplest implement codice_93 indicates memory allocated initialized load-time done cobol working-storage early fortran default codice_22 variables pl/i default storage class codice_150 variables codice_151 similar block-structured languages influenced algol like auto storage class c language default storage allocation pascal local-storage ibm cobol storage codice_151 variables allocated upon entry codice_153 procedure on-unit declared compiler runtime system allocate memory stack frame contain housekeeping information variable declared codice_154 code set initial value executed time care required manage use initialization properly large amounts code executed initialize variables every time scope entered especially variable array structure storage codice_151 variables freed block exit codice_156 codice_94 variables used retain variables contents invocations procedure block codice_95 storage also managed using stack pushing popping allocations stack managed programmer using codice_102 codice_160 statements storage codice_94 variables managed using codice_162 instead stack allocations independent lifetimes addressed codice_163 codice_43 variables codice_23 attribute used declare programmer-defined heaps data allocated freed within specific area area deleted read written unit several ways accessing allocated storage different data declarations well defined safe used safely careful programming inherently unsafe and/or machine dependent passing variable argument parameter reference allows argument allocated storage referenced using parameter codice_166 attribute e.g codice_167 allows part variable storage used different consistent declaration language definition includes codice_46 attribute later renamed codice_34 allow different definitions data share storage supported many early ibm compilers usages safe machine independent record i/o list processing produce situations programmer needs fit declaration storage next record item knowing type data structure based variables pointers key programs data structures must designed appropriately typically using fields data structure encode information type size fields held preceding structure constraints current one encoding preceding structure program needs allocate based variable declaration matches current item using expressions extents needed type size information kept current structure self defining structures type-defining fields must ahead type dependent items place every version data structure codice_103-option used self-defining extents e.g string lengths codice_171 codice_172 used allocate instances data structure self-defining structures typing codice_173 fields placed ahead real data records data set items list data structures organised way handled safely machine independent way pl/i implementations except pl/i checkout compiler keep track data structure used storage first allocated codice_94 declaration used pointer storage access storage inherently unsafe machine dependent however usage become important pointer arithmetic typically adding certain amount known address contentious subject computer science addition problem wild references buffer overruns issues arise due alignment length data types used particular machines compilers many cases pointer arithmetic might needed involve finding pointer element inside larger data structure codice_175 function computes pointers safely machine independently pointer arithmetic may accomplished aliasing binary variable pointer codice_176 relies pointers length codice_177 integers aligned boundaries prevalence c free easy attitude pointer arithmetic recent ibm pl/i compilers allow pointers used addition subtraction operators giving simplest syntax compiler options disallow practices safety machine independence paramount pl/i designed programs ran batch mode possible intervention programmer terminal exceptional condition division zero would abort program yielding hexadecimal core dump pl/i exception handling via on-units allowed program stay control face hardware operating system exceptions recover debugging information closing gracefully program became properly debugged exception handling could removed disabled level control became less important conversational execution became commonplace computational exception handling enabled disabled condition prefixes statements blocks including on-units procedures – e.g codice_178 operating system exceptions input/output storage management always enabled on-unit single statement codice_179-block introduced codice_180 executing statement enables condition specified e.g. codice_181 exception condition occurs condition enabled on-unit condition executed on-units inherited call chain block procedure on-unit activated on-units established invoking activation inherited new activation may over-ridden another codice_180 reestablished codice_183 exception simulated using codice_184 – e.g help debug exception handlers dynamic inheritance principle on-units allows routine handle exceptions occurring within subroutines uses on-unit effect condition raised standard system action taken often raise codice_25 condition system action reestablished using codice_186 option codice_180 conditions possible complete executing on-unit return point interrupt e.g. codice_188 conditions resume normal execution conditions codice_189 codice_25 condition raised attempted on-unit may terminated codice_191 preventing return point interrupt permitting program continue execution elsewhere determined programmer on-unit needs designed deal exceptions occur on-unit codice_192 statement allows nested error trap error occurs within on-unit control might pass operating system system dump might produced computational conditions continue execution mentioned pl/i codice_193 i/o statements relatively simple syntax offer options many situations end-of-file record transmission errors occur record read written instead complexities handled on-units various file conditions approach adopted codice_23 sub-allocation codice_23 condition existence exception handling on-units effect optimization variables inspected altered on-units values variables might otherwise kept registers statements may need returned storage statements discussed section implementation issues | [
512,
7173,
3594,
6160,
9751,
5658,
3613,
10280,
5677,
7217,
7733,
3642,
3142,
8262,
9298,
2138,
2652,
96,
6242,
10340,
9829,
6248,
107,
6772,
2168,
2172,
9345,
1673,
6797,
5277,
4255,
3238,
10415,
6846,
1219,
6342,
10438,
721,
10469,
6378... | Validation |
8,503 | 9 | FOCAL_(programming_language):focal programming language focal interpreted programming language resembling joss name acronym formulating on-line calculations algebraic language largely creation richard merrill focal initially written largest impact pdp-8 computers made digital equipment corporation dec merrill wrote original 1968 classic focal-69 interpreters pdp-8 dec described focal joss-like language like early versions basic focal complete programming environment requiring operating system mumps commands could practice abbreviated single letter alphabet creative choices words used make command uniquely defined leading character digital made available several european-language versions command words translated target language focal ran low-end pdp-8 systems even systems 4k words 6k bytes memory lacking mass storage focal interpreter written assembly language typically used 3k 12-bit words leaving somewhat limiting 1k words hold user program variables system upgraded adding one extra 4k banks memory focal could use extra memory either single user split extra memory across several time-sharing users focal made extensive use interrupt-driven terminal i/o could keep four teleprinters busy without pause memory space precious storing textual error messages focal used clever workaround error messages instead displayed start address error-managing routine floating-point number example focal-69 implementation division zero error managed code starting memory address octal 4333 division zero program line numbered codice_1 produced error message codice_2 codice_3 represents memory page 28 plus offset 73 words focal sites error number error message list posted near terminals comparisons focal basic inevitable since languages common minicomputers era focal lacked inherent support strings data elements could assigned variables generally thought serious deficiency compared string capabilities basics deficiency serious utterly crippling might sound surprising amount string usage focal programs devoted formatting user output since focal output character-stream-oriented outputting two strings sequentially could sometimes substitute concatenating procedural tools could written performing complex formatted output limited amount string input could done program could ask simple yes/no questions really kludge example one typed hello input statement focal would convert h 8 interpret e starting exponent would try compute 8 llo power would take several seconds cpu time result value 0.76593020e+103 particularly helpful response generally agreed focal efficient use resources comparable basic systems typical machine day often 6 24 kilobytes magnetic-core memory focal could handle larger complex programming tasks basic focal pdp-8 implementation used floating point representation represented numbers four 12-bit words thirty-six bits mantissa twelve bits exponent allowed significantly higher precision significantly wider range values low-end programming systems made reasonable choice serious numerical work high precision good choices default decimal output formatting meant difficulties binary-to-decimal rounding evident beginning users coca-cola corporation used customized version focal called coke focal later implemented pdp-7 pdp-9 pdp-10 pdp-11 pdp-12 pdp-5 linc-8 focal manual showed add commands focal parser many sites added specialized commands operating custom hardware digital equipment computer users society collected many patches enhancements focal even major enhanced offshoots focal focal-w added many features including better mass storage file i/o even virtual variable memory russia saw use late early 1990s mass-produced home computers electronika bk series focal15 v6b program takes year birth calculates year a.f focal born program lines focal program grouped line groups line numbers within group first line program line 01.10 line 10 group 01 line numbers targets goto statements ask statement prompts attached teleprinter input type statement outputs text teleprinter multiple items output teleprinter appending item comma exclamation mark causes linefeed carriage return sent set statement assigns value variable value result expression conditional statement receive three line numbers parameters arithmetic program branches first linenumber result expression parentheses less zero second result zero third result zero go command focal begins run program focal prompts single asterisk beginning line expecting input | [
3650,
7076,
1061,
8262,
10475,
1804,
8910,
7983,
6448,
9714,
11635,
1716,
8732
] | None |
8,504 | 5 | Berkeley_r-commands:berkeley r-commands berkeley r-commands suite computer programs designed enable users one unix system log issue commands another unix computer via tcp/ip computer network r-commands developed 1982 computer systems research group university california berkeley based early implementation tcp/ip protocol stack internet csrg incorporated r-commands unix operating system berkeley software distribution bsd r-commands premiered bsd v4.1 among programs suite remote copy remote execution remote login remote shell remote r-commands significant innovation became de facto standards unix operating systems wider public adoption internet inherent security vulnerabilities became problem beginning development secure shell protocols applications 1995 adoption entirely supplanted deployment use r-commands telnet networked systems original berkeley package provides rlogin also features rcp remote-copy allowing files copied network rsh remote-shell allowing commands run remote machine without user logging share hosts.equiv .rhosts access-control scheme although connect different daemon rshd enables user log another server via computer network using tcp network port 513. rlogin also name application layer protocol used software part tcp/ip protocol suite authenticated users act physically present computer rfc 1282 defined states rlogin facility provides remote-echoed locally flow-controlled virtual terminal proper flushing output rlogin communicates daemon rlogind remote host rlogin similar telnet command customizable able connect unix-like hosts rsh opens shell remote computer without login procedure connected user execute commands remote computer shell command-line interface rsh passes input output standard streams sends standard output user console network standard input standard flow tcp port 514 standard error flows different tcp port rsh daemon rshd opens like rsh rexec enables user run shell commands remote computer however unlike rsh server rexec server rexecd requires login authenticates users reading username password unencrypted network socket rexec uses tcp port 512. rcp copy file directory local system remote system remote system local system one remote system another command line arguments cp rcp similar rcp remote files prefixed name remote system unix copy command cp rcp overwrites existing file name target unlike cp provides mechanism warning user overwriting target file like rsh rcp uses tcp port 514 command lists users logged local unix system rwho lists users logged multi-user unix systems local network rwho daemon rwhod maintains database status unix systems local network daemon database also used ruptime program command shows long unix system running since last restart requests status report computers local network returns uptime report computer respond within time limit ruptime reports system information tracked stored daemon rwhod also used rwho command r-commands involve user authentication rcp rexec rlogin rsh share several serious security vulnerabilities due problems r-commands fell relative disuse many unix linux distributions longer including default many networks formerly relied rlogin telnet replaced ssh rlogin-equivalent slogin | [
10242,
515,
9733,
9735,
10271,
2085,
562,
5179,
3133,
5181,
8265,
3659,
4687,
10341,
9320,
10344,
5759,
649,
9868,
4750,
3218,
9365,
2198,
11413,
6812,
7325,
3742,
9380,
9381,
3751,
3752,
7847,
10924,
9909,
7356,
4797,
8386,
7364,
8395,
5... | Validation |
8,505 | 2 | Miller_columns:miller columns miller columns also known cascading lists browsing/visualization technique applied tree structures columns allow multiple levels hierarchy open provide visual representation current location closely related techniques used earlier smalltalk browser independently invented mark s. miller 1980 yale university technique used project xanadu datapoint next datapoint miller generalized technique browse directed graphs labeled nodes arcs cases technique appropriate structures high degree large fanout low-degree structures outline editors graph viewers effective miller columns well known today “ columns view ” mode mac os x finder well browser view itunes columns finder descend directly nextstep file viewer use miller columns going back 1986 gnustep project continues offer miller column browser closely follows next approach bringing advantages column browser linux bsd operating systems large tree structures ipod browsing categories audio file tag attributes reminiscent column browsing although one column visible time many software music players implement tag browsing feature utilizes miller columns miller columns several issues usability standpoint | [
576,
6797,
5294,
7983,
8304,
823,
7806
] | None |
8,506 | 3 | MIPS-3D:mips-3d mips-3d extension mips v instruction set architecture isa added 13 new instructions improving performance 3d graphics applications instructions improved performance reducing number instructions required implement four common 3d graphics operations vertex transformation clipping transformation lighting vertex transformation clipping perspective division normalization | [
8450,
2821,
1798,
4491,
6924,
4237,
6038,
9369,
9500,
2088,
9391,
8120,
1085,
8125,
8126,
833,
7234,
9541,
3142,
5326,
977,
2514,
5844,
9428,
8795,
2655,
1122,
7783,
10985,
9964,
5358,
9582,
8944,
499,
1399,
9976,
4603,
10620
] | Validation |
8,507 | 2 | Job_File_Table:job file table job file table jft dos data structure program segment prefix psp starts psp offset 0x18 20 bytes long open file handle dos stores index system file table sft file handle returned codice_1 codice_2 similar functions simply index jft dos stored sft entry index file device program opened program starts first 5 entries jft preconnected standard devices handles marked closed setting value entry 0xff standard devices initialised follows handles 0-2 connected console device program execution get modified closed redirected like handle size jft psp limited 20 bytes originally 15 files 20-5 standard devices could open time ms-dos 2.0 extended job file table introduced allowed 254 files opened ms-dos 3.30 size jft modified call codice_3 | [
8529
] | Test |
8,508 | 3 | LEON:leon leon meaning lion 32-bit cpu microprocessor core based sparc-v8 risc architecture instruction set designed sun microsystems originally designed european space research technology centre estec part european space agency esa gaisler research described synthesizable vhdl leon dual license model lgpl/gpl floss license used without licensing fee proprietary license purchased integration proprietary product core configurable vhdl generics used system-on-a-chip soc designs research commercial settings leon project started european space agency esa late 1997 study develop high-performance processor used european space projects objectives project provide open portable non-proprietary processor design capable meet future requirements performance software compatibility low system cost another objective able manufacture single event upset seu tolerant sensitive semiconductor process maintain correct operation presence seus extensive error detection error handling functions needed goals detect tolerate one error register without software intervention suppress effects single event transient set errors combinational logic leon family includes first leon1 vhsic hardware description language vhdl design used leonexpress test chip developed 0.25 μm technology prove fault-tolerance concept second leon2 vhdl design used processor device at697 atmel f various system-on-chip devices two leon implementations developed esa gaisler research part cobham aeroflex gaisler developed third leon3 design announced availability fourth generation leon leon4 processor leon processor implemented programmable logic fpga manufactured asic section subsequent subsections focus leon processors soft ip cores summarise main features processor version infrastructure processor packaged referred leon distribution processors leon series based sparc-v8 risc architecture leon2 -ft five-stage pipeline later versions seven-stage pipeline leon2 leon2-ft distributed system-on-chip design modified using graphical configuration tool leon2 -ft design extended re-used designs structure emphasise re-using parts design building blocks enable designers easily incorporate new ip cores design standard leon2 -ft distribution includes following support cores leon3 leon3ft leon4 cores typically used together grlib ip library leon2 distributions contain one design used several target technologies grlib contains several template designs fpga development boards asic targets modified using graphical configuration tool similar one leon2 distribution leon/grlib package contains larger number cores compared leon2 distributions also include plug play extension on-chip amba bus ip cores available grlib include design flow documentation leon fpga available manufacturer third party resources term leon2/leon2-ft often refer leon2 system-on-chip design leon2 processor core together standard set peripherals available leon2 -ft distribution later processors leon series used wide range designs therefore tightly coupled standard set peripherals leon3 leon4 name typically refers processor core leon/grlib used refer complete system-on-chip design leon2 following characteristics leon2-ft processor single event upset fault tolerant ft version leon2 processor flip-flops protected triple modular redundancy internal external memories protected edac parity bits special licence restrictions apply ip distributed european space agency among satellites processor used esa intermediate experimental vehicle ixv 2015 china chang e 4 lunar lander leon3 synthesisable vhdl model 32-bit processor compliant sparc v8 architecture model highly configurable particularly suitable system-on-a-chip soc designs full source code available gnu gpl license allowing use purpose without licensing fee leon3 also available proprietary license allowing used proprietary applications several differences two leon2 processor models leon3 leon3 includes smp support seven-stage pipeline leon2 support smp five-stage pipeline leon3ft fault-tolerant version standard leon3 sparc v8 processor designed operation harsh space environment includes functionality detect correct single event upset seu errors on-chip ram memories leon3ft processor supports functionality standard leon3 processor adds following features following features standard leon3 processor supported leon3ft leon3ft core distributed together special ft version grlip ip library netlist distribution possible fpga implementation called leon3ft-rtax proposed critical space applications january 2010 fourth version leon processor released release following new features real-time operating systems support leon core currently rtlinux pikeos ecos rtems nucleus threadx opencomrtos vxworks per port gaisler research lynxos also per port gaisler research pok free arinc653 implementation released bsd licence ork+ open-source real-time kernel high-integrity real-time applications ravenscar profile | [
9857,
9366,
9371,
4773,
10789,
3886,
9391,
2224,
3762,
10675,
6716,
6207,
9665,
6979,
11333,
3911,
8523,
3159,
10974,
11487,
5861,
3175,
10984,
5355,
1776,
10483,
11125,
1399
] | Test |
8,509 | 2 | Conversational_Monitor_System:conversational monitor system conversational monitor system cms – originally cambridge monitor system simple interactive single-user operating system cms originally developed part ibm cp/cms operating system went production use 1967 cms part ibm vm family runs ibm mainframe computers vm first announced 1972 still use today z/vm cms runs guest operating system private virtual machine created vm control program control program plus cms together create multi-user time-sharing operating system cms originally developed part ibm cp/cms operating system time acronym meant cambridge monitor system also console monitor system 1972 ibm released vm/370 operating system re-implementation cp/cms system/370 announcement also added virtual memory hardware system/370 series unlike cp/cms vm/370 supported ibm vm went series versions still use today z/vm distinct versions releases cms platform remained still quite recognizable close descendant original cms version running cp-40 many key user interface decisions familiar today users already made 1965 part cp-40 effort see cms cp-40 examples vm cp/cms checkered histories ibm vm one ibm strategic operating systems primarily os dos families suffered ibm political infighting time-sharing versus batch processing goals conflict cp/cms originally released unsupported system vm often limited development support resources within ibm exceptionally strong user community first established self-support days cp/cms remaining active launch vm made substantial contributions operating system mitigated difficulties running ibm operating system cms intrinsic part vm/cms architecture established cp/cms cms user control private virtual machine – simulated copy underlying physical computer – cms runs stand-alone operating system approach remained consistent years based details cms interacts virtual machine environment found vm cp/cms articles cms originally built stand-alone operating system capable running bare machine though course nobody would choose however cms longer run outside vm environment provides hypervisor interface needed various critical functions cms provides users environment running applications batch jobs managing data files creating debugging applications cross-platform development communicating systems users cms still development wide use today users log vm providing userid password boot virtual machine done issuing command ipl cms ipl initial program load traditional ibm jargon booting machine though normally done automatically user personal customization done standard shell script file named profile exec sets user-specified environmental defaults disks libraries accessed cms started era teletype-style paper terminals later glass teletype dumb terminals late 1970s however vm users connecting via full-screen terminals – particularly ibm 3270 ubiquitous transaction processing terminal ibm mainframes 3270 played strategic role ibm product line making selection natural choice large data centers day many manufacturers eventually offered bisync terminals emulated 3270 protocol 3270s local buffer storage processing capabilities generally dealt entire screen data time handled editing tasks locally transmitted set fields entire page enter key program function key pfk pressed 3270 family incorporated smart control units concentrators network processing elements communicating mainframe dedicated circuits relatively high speeds via bisync synchronous data transmission protocol mainframe-oriented communication technologies provided capabilities taken granted modern communication networks device addressing routing error correction support variety configurations multipoint multidrop topologies historical note 3270 approach differed lower-cost dumb terminals period point-to-point asynchronous commercial time-sharing users important segment early cp/cms vm sites relied devices could connect via 300- 1200 bit/s modems normal voice-grade telephone circuits installing dedicated circuit 3270 often practical economical timely 3270 block-oriented approach consistent ibm batch- punched card-oriented view computing particularly important ibm mainframes day unlike contemporary minicomputers ibm mainframes equipped character-at-a-time interrupts dumb terminal support relied terminal control units ibm 270x see ibm 3705 memorex 1270 asynchronous terminal controllers assembled line characters fixed maximum length return key pressed typing many characters would result error familiar situation users day data centers include equipment except needed dial-up access 3270 approach preferred block-oriented terminals like 3270 made practical implement screen-oriented editors mainframes – opposed line-oriented editors previous norm important advantage contemporary minicomputers character-oriented systems availability via 3270 warmly welcomed gulf developed 3270 world focused page-oriented mainframe transaction processing especially via cics asynch terminal world focused character-oriented minicomputers dial-up timesharing asynchronous terminal vendors gradually improved products range smart terminal features usually accessed via escape sequences however devices rarely competed 3270 users ibm maintained dominance mainframe data center hardware purchase decisions viewed retrospect major philosophical divergence block-oriented character-oriented computing asynchronous terminal controllers 3270s provided mainframe block-oriented interactions – essentially made terminal input look like card reader approach preferred ibm led development entirely different user interface paradigms programming strategies character-oriented systems evolved differently difference apparent comparing atomic transaction approach dominant cics interactive stream-oriented style unix vm/cms evolved somewhere extremes cms command-driven stateful interactive environment rather adopting cics approach stateless transaction-oriented interface yet cms responds page- line-at-a-time interaction instead character interrupts cms earned good reputation efficient good human factors ease use relative standards time course prior widespread use graphical user interface environments commonly used today uncommon hundreds later thousands concurrent cms interactive users vm mainframe sub-second response times common 'trivial functions vm/cms consistently outperformed mvs ibm operating systems terms support simultaneous interactive users many cms users programmed languages cobol fortran pl/i c/370 apl scripting language rexx vm/cms often used development platform production systems ran ibm operating systems mvs cms users worked commercial software packages focus nomad spss sas one time cms also major environment e-mail office productivity important product ibm profs later renamed officevision two commonly used cms tools editor xedit rexx programming language products ported platforms widely used outside mainframe environment see vm operating system vm-related sources source citations | [
2432,
5378,
4996,
2181,
7053,
11539,
789,
5658,
284,
6557,
9762,
5678,
7983,
8879,
5041,
7217,
8627,
7477,
7733,
8502,
10040,
11075,
5450,
1999,
7507,
5463,
2519,
2395,
2652,
5612,
2811,
2045
] | None |
8,510 | 2 | Apple_Pascal:apple pascal apple pascal implementation pascal apple ii apple iii computer series based ucsd pascal like ucsd pascal implementations ran operating system apple pascal operating system derivative ucsd p-system graphical extensions originally released apple ii august 1979 apple dos 3.2 apple pascal pioneered number features would later incorporated dos 3.3 well others would seen introduction prodos apple pascal software package also included disk maintenance utilities assembler meant complement apple built-in monitor assembler fortran compiler written silicon valley software sunnyvale california compiling p-code pascal also available apple pascal operating system introduced new disk format instead dividing disk 256-byte sectors dos 3.2 apple pascal divides blocks 512 bytes each.. p-system also introduced different method saving retrieving files apple dos files saved available sector os could find regardless location time could lead file system fragmentation slowing access disk apple pascal attempted rectify saving consecutive blocks disk innovations introduced file system included introduction timestamp feature previously file name basic type size would shown disks could also named first time limitations p-system included new restrictions naming files writing files consecutive blocks also created problems time free space tended become fragmented store new files utility called krunch included package consolidate free space biggest problem apple pascal system big fit one floppy disk meant system one floppy disk drive frequent disk swapping needed system needed least two disk drives order use operating system properly br br | [
512,
2179,
8774,
428,
4844,
5663,
6414,
8524,
8767,
8082,
5363,
9008,
4341,
11411,
7479,
1145,
6558,
2687
] | Validation |
8,511 | 9 | Calculus_of_constructions:calculus constructions mathematical logic computer science calculus constructions coc type theory created thierry coquand serve typed programming language constructive foundation mathematics second reason coc variants basis coq proof assistants variants include calculus inductive constructions adds inductive types calculus co inductive constructions adds coinduction predicative calculus inductive constructions removes impredicativity coc higher-order typed lambda calculus initially developed thierry coquand well known top barendregt lambda cube possible within coc define functions integers integers well integers types types types types integers coc strongly normalizing although impossible prove property within coc since implies consistency gödel incompleteness theorem impossible prove within system coc developed alongside coq proof assistant features added possible liabilities removed theory became available coq variants coc used proof assistants matita calculus constructions considered extension curry–howard isomorphism curry–howard isomorphism associates term simply typed lambda calculus natural-deduction proof intuitionistic propositional logic calculus constructions extends isomorphism proofs full intuitionistic predicate calculus includes proofs quantified statements also call propositions term calculus constructions constructed using following rules words term syntax bnf calculus constructions five kinds objects calculus constructions allows proving typing judgments read implication valid judgments calculus constructions derivable set inference rules following use formula_7 mean sequence type assignments formula_8 use k mean either p t. shall write formula_9 mean result substituting term formula_10 free variable formula_11 term formula_6 inference rule written form means 1. formula_16 3. formula_17 4. formula_18 5. formula_19 calculus constructions basic operators logical operator forming propositions formula_20 however one operator sufficient define logical operators basic data types used computer science defined within calculus constructions note booleans naturals defined way church encoding however additional problems arise propositional extensionality proof irrelevance | [
5796,
6188,
4791,
8924,
6239
] | Test |
8,512 | 4 | Amy_Koch:amy koch amy t. koch born october 8 1971 american politician former majority leader minnesota senate represented portions hennepin wright counties koch first female senate majority leader state history also regular commentator minnesota local media koch grew buffalo minnesota graduating buffalo high school 1990 briefly attending concordia college moorhead minnesota koch joined united states air force 1992 serving military koch met former husband christopher gave birth daughter rachel koch studied russian defense language institute california assigned national security agency fort meade maryland graduated honors stages military training received joint service commendation medal contribution intelligence community receiving honorable discharge air force 1996 koch returned buffalo minnesota attended st cloud state university earned bachelor degree 1999 managed expanded family power utility service company next years koch received mba capella university 2009 koch volunteered adult leader 4-h served vice chair st. francis xavier parish council well liaison education advisory board 2016 koch began working political strategist hylden advocacy law minneapolis koch part owner hbk properties llc buffalo 2013 koch bought maple lake bowl bowling alley north home buffalo mn koch owned operated bowling alley sold summer 2016 leaving military returning minnesota koch became active local republican politics addition serving local party unit board koch actively volunteered former congressman mark kennedy former secretary state mary kiffmeyer koch first elected minnesota senate 2005 special election replacing mark ourada resigned months earlier re-elected 2006 2010 koch former assistant minority leader first woman serve majority leader minnesota senate first republican since party affiliation inheriting 6.2 billion budget deficit 2011 koch helped integrate 20 new members caucus negotiated budget deficit turned surplus december 15 2011 surprise announcement koch said would resign post majority leader minnesota senate republican state senators indicated koch inappropriate relationship staffer whose identity would later confirmed former state senate aide michael brodkorb koch later apologized seek re-election another term minnesota senate | [
7887
] | None |
8,513 | 4 | Ophcrack:ophcrack ophcrack free open-source gpl licensed program cracks windows log-in passwords using lm hashes rainbow tables program includes ability import hashes variety formats including dumping directly sam files windows computers ophcrack crack passwords within minutes rainbow tables lm hashes provided free developers default ophcrack bundled tables allows crack passwords longer 14 characters using alphanumeric characters available free download four windows xp tables four windows vista tables objectif sécurité even larger tables purchase intended professional use larger rainbow tables ntlm hash cracking windows vista/windows 7 ophcrack also available live cd distributions automate retrieval decryption cracking passwords windows system one live cd distribution available windows xp lower well another windows vista windows 7 live cd distributions ophcrack built slitaz gnu/linux starting version 2.3 ophcrack also cracks ntlm hashes necessary generation lm hash disabled default windows vista password longer 14 characters case lm hash stored starting version 3.7.0 source code moved sourceforge gitlab | [
7426,
6916,
7556,
7557,
3079,
6797,
3984,
3477,
10135,
2716,
4140,
7983,
823,
7754,
733,
3937,
4580,
7914,
8827,
2045,
1150
] | None |
8,514 | 3 | General-purpose_computing_on_graphics_processing_units:general-purpose computing graphics processing units general-purpose computing graphics processing units gpgpu rarely gpgp use graphics processing unit gpu typically handles computation computer graphics perform computation applications traditionally handled central processing unit cpu use multiple video cards one computer large numbers graphics chips parallelizes already parallel nature graphics processing addition even single gpu-cpu framework provides advantages multiple cpus offer due specialization chip essentially gpgpu pipeline kind parallel processing one gpus cpus analyzes data image graphic form gpus operate lower frequencies typically many times number cores thus gpus process far pictures graphical data per second traditional cpu migrating data graphical form using gpu scan analyze create large speedup gpgpu pipelines developed beginning 21st century graphics processing e.g. better shaders pipelines found fit scientific computing needs well since developed direction principle arbitrary boolean function including addition multiplication mathematical functions built-up functionally complete set logic operators 1987 conway game life became one first examples general purpose computing using early stream processor called blitter invoke special sequence logical operations bit vectors general-purpose computing gpus became practical popular 2001 advent programmable shaders floating point support graphics processors notably problems involving matrices and/or vectors especially two- three- four-dimensional vectors easy translate gpu acts native speed support types scientific computing community experiments new hardware began matrix multiplication routine 2001 one first common scientific programs run faster gpus cpus implementation lu factorization 2005 early efforts use gpus general-purpose processors required reformulating computational problems terms graphics primitives supported two major apis graphics processors opengl directx cumbersome translation obviated advent general-purpose programming languages apis sh/rapidmind brook accelerator followed nvidia cuda allowed programmers ignore underlying graphical concepts favor common high-performance computing concepts newer hardware vendor-independent offerings include microsoft directcompute apple/khronos group opencl means modern gpgpu pipelines leverage speed gpu without requiring full explicit conversion data graphical form language allows code running cpu poll gpu shader return values create gpgpu framework opencl dominant open general-purpose gpu computing language open standard defined khronos group opencl provides cross-platform gpgpu platform additionally supports data parallel compute cpus opencl actively supported intel amd nvidia arm platforms khronos group also standardised implemented sycl higher-level programming model opencl single-source domain specific embedded language based pure c++11 dominant proprietary framework nvidia cuda nvidia launched cuda 2006 software development kit sdk application programming interface api allows using programming language c code algorithms execution geforce 8 series later gpus programming standards parallel computing include opencl vendor-independent openacc openhmpp mark harris founder gpgpu.org coined term gpgpu created xcelerit designed accelerate large existing c++ c code-bases gpus minimal effort provides simplified programming model automates parallelisation manages devices memory compiles cuda binaries additionally multi-core cpus accelerators targeted source code openvidia developed university toronto 2003-2005 collaboration nvidia. created altimesh compiles common intermediate language cuda binaries supports generics virtual functions debugging profiling integrated visual studio nsight available visual studio extension visual studio marketplace microsoft introduced directcompute gpu computing api released directx 11 api. created quantalea introduces native gpu computing capabilities microsoft .net language f c alea gpu also provides simplified gpu programming model based gpu parallel-for parallel aggregate using delegates automatic memory management matlab supports gpgpu acceleration using parallel computing toolbox matlab distributed computing server third-party packages like jacket gpgpu processing also used simulate newtonian physics physics engines commercial implementations include havok physics fx physx typically used computer video games close metal called stream amd gpgpu technology ati radeon-based gpus c++ accelerated massive parallelism c++ amp library accelerates execution c++ code exploiting data-parallel hardware gpus due trend increasing power mobile gpus general-purpose programming became available also mobile devices running major mobile operating systems google android 4.2 enabled running renderscript code mobile device gpu apple introduced proprietary metal api ios applications able execute arbitrary code apple gpu compute shaders computer video cards produced various vendors nvidia amd ati cards vendors differ implementing data-format support integer floating-point formats 32-bit 64-bit microsoft introduced shader model standard help rank various features graphic cards simple shader model version number 1.0 2.0 3.0 etc. pre-directx 9 video cards supported paletted integer color types various formats available containing red element green element blue element sometimes another alpha value added used transparency common formats early fixed-function limited programmability graphics i.e. including directx 8.1-compliant gpus sufficient also representation used displays important note representation certain limitations given sufficient graphics processing power even graphics programmers would like use better formats floating point data formats obtain effects high dynamic range imaging many gpgpu applications require floating point accuracy came video cards conforming directx 9 specification directx 9 shader model 2.x suggested support two precision types full partial precision full precision support could either fp32 fp24 floating point 32- 24-bit per component greater partial precision fp16 ati radeon r300 series gpus supported fp24 precision programmable fragment pipeline although fp32 supported vertex processors nvidia nv30 series supported fp16 fp32 vendors s3 graphics xgi supported mixture formats fp24 implementations floating point nvidia gpus mostly ieee compliant however true across vendors implications correctness considered important scientific applications 64-bit floating point values double precision float commonly available cpus universally supported gpus gpu architectures sacrifice ieee compliance others lack double-precision efforts occurred emulate double-precision floating point values gpus however speed tradeoff negates benefit offloading computing onto gpu first place operations gpu operate vectorized fashion one operation performed four values example one color r1 g1 b1 modulated another color r2 g2 b2 gpu produce resulting color r1*r2 g1*g2 b1*b2 one operation functionality useful graphics almost every basic data type vector either 2- 3- 4-dimensional examples include vertices colors normal vectors texture coordinates many applications put good use higher performance vector instructions termed single instruction multiple data simd long available cpus originally data simply passed one-way central processing unit cpu graphics processing unit gpu display device time progressed however became valuable gpus store first simple complex structures data passed back cpu analyzed image set scientific-data represented 2d 3d format video card understand gpu access every draw operation analyze data forms quickly whereas cpu must poll every pixel data element much slowly speed access cpu larger pool random-access memory even worse case hard drive slower gpus video cards typically contain smaller amounts expensive memory much faster access transferring portion data set actively analyzed gpu memory form textures easily readable gpu forms results speed increase distinguishing feature gpgpu design ability transfer information bidirectionally back gpu cpu generally data throughput directions ideally high resulting multiplier effect speed specific high-use algorithm gpgpu pipelines may improve efficiency especially large data sets and/or data containing 2d 3d imagery used complex graphics pipelines well scientific computing fields large data sets like genome mapping two- three-dimensional analysis useful especially present biomolecule analysis protein study complex organic chemistry pipelines also vastly improve efficiency image processing computer vision among fields well parallel processing generally heavily optimized pipelines yielded speed increases several hundred times original cpu-based pipeline one high-use task simple example would gpu program collects data average lighting values renders view either camera computer graphics program back main program cpu cpu make adjustments overall screen view advanced example might use edge detection return numerical information processed image representing outlines computer vision program controlling say mobile robot gpu fast local hardware access every pixel picture element image analyze average first example apply sobel edge filter convolution filter second much greater speed cpu typically must access slower random-access memory copies graphic question gpgpu fundamentally software concept hardware concept type algorithm piece equipment specialized equipment designs may however even enhance efficiency gpgpu pipelines traditionally perform relatively algorithms large amounts data massively parallelized gigantic-data-level tasks thus may parallelized even via specialized setups rack computing many similar highly tailored machines built rack adds third layer many computing units using many cpus correspond many gpus bitcoin miners used setups high-quantity processing historically cpus used hardware-managed caches earlier gpus provided software-managed local memories however gpus increasingly used general-purpose applications state-of-the-art gpus designed hardware-managed multi-level caches helped gpus move towards mainstream computing example geforce 200 series gt200 architecture gpus feature l2 cache fermi gpu 768 kib last-level cache kepler gpu 1.5 mib last-level cache maxwell gpu 2 mib last-level cache pascal gpu 4 mib last-level cache gpus large register files allow reduce context-switching latency register file size also increasing different gpu generations e.g. total register file size maxwell gm200 pascal gpus 6 mib 14 mib respectively comparison size register file cpus small typically tens hundreds kilobytes several research projects compared energy efficiency gpus cpus fpgas gpus designed specifically graphics thus restrictive operations programming due design gpus effective problems solved using stream processing hardware used certain ways following discussion referring vertices fragments textures concerns mainly legacy model gpgpu programming graphics apis opengl directx used perform general-purpose computation introduction cuda nvidia 2007 opencl vendor-independent 2008 general-purpose computing apis new gpgpu codes longer necessary map computation graphics primitives stream processing nature gpus remains valid regardless apis used see e.g. gpus process independent vertices fragments process many parallel especially effective programmer wants process many vertices fragments way sense gpus stream processors processors operate parallel running one kernel many records stream stream simply set records require similar computation streams provide data parallelism kernels functions applied element stream gpus vertices fragments elements streams vertex fragment shaders kernels run element read input perform operations write output permissible multiple inputs multiple outputs never piece memory readable writable arithmetic intensity defined number operations performed per word memory transferred important gpgpu applications high arithmetic intensity else memory access latency limit computational speedup ideal gpgpu applications large data sets high parallelism minimal dependency data elements variety computational resources available gpu fact program substitute write texture output instead framebuffer done either render texture rtt render-to-backbuffer-copy-to-texture rtbctt recent stream-out common form stream take gpgpu 2d grid fits naturally rendering model built gpus many computations naturally map grids matrix algebra image processing physically based simulation since textures used memory texture lookups used memory reads certain operations done automatically gpu compute kernels thought body loops example programmer operating grid cpu might code looks like gpu programmer specifies body loop kernel data loop invoking geometry processing sequential code possible control flow program using if-then-else statements various forms loops flow control structures recently added gpus conditional writes could performed using properly crafted series arithmetic/bit operations looping conditional branching possible recent gpus allow branching usually performance penalty branching generally avoided inner loops whether cpu gpu code various methods static branch resolution pre-computation predication loop splitting z-cull used achieve branching hardware support exist map operation simply applies given function kernel every element stream simple example multiplying value stream constant increasing brightness image map operation simple implement gpu programmer generates fragment pixel screen applies fragment program one result stream size stored output buffer computations require calculating smaller stream possibly stream 1 element larger stream called reduction stream generally reduction performed multiple steps results prior step used input current step range operation applied reduced one stream element remains stream filtering essentially non-uniform reduction filtering involves removing items stream based criteria scan operation also termed parallel prefix sum takes vector stream data elements arbitrary associative binary function '+ identity element input a0 a1 a2 a3 ... exclusive scan produces output a0 a0 a1 a0 a1 a2 ... inclusive scan produces output a0 a0 a1 a0 a1 a2 a0 a1 a2 a3 ... require identity exist first glance operation may seem inherently serial efficient parallel scan algorithms possible implemented graphics processing units scan operation uses e.g. quicksort sparse matrix-vector multiplication scatter operation naturally defined vertex processor vertex processor able adjust position vertex allows programmer control information deposited grid extensions also possible controlling large area vertex affects fragment processor perform direct scatter operation location fragment grid fixed time fragment creation altered programmer however logical scatter operation may sometimes recast implemented another gather step scatter implementation would first emit output value output address immediately following gather operation uses address comparisons see whether output value maps current output slot dedicated compute kernels scatter performed indexed writes gather reverse scatter scatter reorders elements according map gather restore order elements according map scatter used dedicated compute kernels gather may performed indexed reads shaders performed texture-lookups sort operation transforms unordered set elements ordered set elements common implementation gpus using radix sort integer floating point data coarse-grained merge sort fine-grained sorting networks general comparable data search operation allows programmer find given element within stream possibly find neighbors specified element gpu used speed search individual element instead used run multiple searches parallel mostly search method used binary search sorted elements variety data structures represented gpu following areas gpus used general purpose computing gpgpu usage bioinformatics † expected speedups highly dependent system configuration gpu performance compared multi-core x86 cpu socket gpu performance benchmarked gpu supported features may kernel kernel performance comparison details configuration used view application website speedups per nvidia in-house testing isv documentation ‡ q=quadro gpu t=tesla gpu nvidia recommended gpus application check developer isv obtain certification information | [
3585,
7173,
9739,
9741,
2066,
7699,
5655,
10779,
10781,
2594,
6181,
8231,
6184,
1578,
3630,
9774,
2045,
6705,
7218,
1087,
2623,
2113,
7234,
3142,
2635,
1614,
2638,
2140,
1122,
4194,
3175,
5223,
8810,
4205,
8815,
3698,
118,
630,
2680,
6774... | Test |
8,515 | 7 | Enstratius:enstratius enstratius formerly enstratus cloud computing infrastructure management platform intended address governance issues associated deploying systems public private hybrid clouds twenty public private clouds supported well configuration management tools chef puppet enstratius supports saas on-premises deployment models company originally formed 2008 enstratus networks spin-off marketing software maker valtira software forming backbone enstratus set cloud management tools valtira developed support cloud operations company announced publicly minnedemo conference february 2009 began accepting on-demand accounts co-founders david bagley george reese enstratius moved focus purely security wider problem governance multiple cloud computing environments 2010 enstratius spun part intellectual property open source project hosted github apache license called dasein cloud dasein cloud java abstraction api enstratius uses talk clouds supports company raised series financing 4.5 million november 2011 el dorado ventures vesbridge partners citrix march 2013 enstratus networks changed name enstratius inc. enstratius headquartered eden prairie minnesota remote workers across united states offices auckland new zealand edinburgh scotland may 2013 company acquired dell two weeks later dell discontinued cloud computing service june 2016 dell shifted enstratius product line support-only continue support customers longer selling cloud management platform | [
5384,
6153,
11146,
4236,
10893,
911,
1935,
4623,
8592,
5499,
2965,
2328,
4377,
8986,
10615,
6307,
9766,
5159,
6444,
7983,
8495,
3121,
54,
7352,
2496,
4289,
1224,
8520,
4429,
7248,
1362,
467,
9682,
11221,
8022,
6367,
4194,
11646,
5732,
100... | Test |
8,516 | 2 | Advanced_Programming_in_the_Unix_Environment:advanced programming unix environment advanced programming unix environment computer programming book w. richard stevens describing application programming interface unix family operating systems book illustrates unix application programming c programming language first edition book published addison-wesley 1992 covered programming two popular families unix operating system berkeley software distribution particular 4.3 bsd 386bsd unix system v particularly svr4 book covers system calls operations single file descriptors special calls like ioctl operate file descriptors operations files directories covers stdio section c standard library parts library needed several chapters concern apis control processes process groups daemons inter-process communication signals one chapter devoted unix terminal control another pseudo terminal concept libraries like termcap curses build atop stevens adds three chapters giving concrete examples unix programming implements database library communicates postscript printer modem book cover network programming subject stevens 1990 book unix network programming subsequent three-volume tcp/ip illustrated stevens died 1999 leaving second edition incomplete increasing popularity technical diversification unix derivatives largely compatible systems like linux environment code coverage stevens original became increasingly outdated working stevens unfinished notes stephen a. rago completed second edition addison-wesley published 2005 added support freebsd linux sun solaris apple darwin added coverage multithreaded programming posix threads second edition features foreword dennis ritchie unix-themed dilbert strip scott adams book widely lauded well written well crafted comprehensive received hearty recommendation linux journal review osnews describes one best tech books ever published review second edition | [
4320,
98,
6813,
4423,
9067,
7983,
592,
2995,
8628,
823,
2045,
9151
] | Validation |
8,517 | 6 | Tree_(command):tree command computing codice_1 recursive directory listing command program produces depth-indented listing files available unix unix-like systems well dos digital research flexos ibm/toshiba 4690 os pts-dos freedos ibm os/2 microsoft windows reactos arguments codice_1 lists files current directory directory arguments given codice_1 lists files directories found given directories turn upon completion listing files directories found codice_1 returns total number files directories listed options change characters used output use color output command available ms-dos versions 3.2 later ibm pc dos releases 2 later dr dos 6.0 includes implementation command tree unix utility developed steve baker freedos version developed dave dunfield reactos version developed asif bahrainwala three implementations licensed gpl | [
3970,
515,
6148,
8834,
9733,
9735,
2568,
3976,
6281,
6921,
8713,
6797,
4750,
10631,
3856,
6674,
5397,
2198,
4248,
8729,
6812,
4001,
4771,
292,
7847,
808,
4398,
7983,
7088,
10033,
178,
9780,
823,
1336,
1978,
7356,
5437,
7486,
10428,
960,
... | Test |
8,518 | 1 | Database_audit:database audit database auditing involves observing database aware actions database users database administrators consultants often set auditing security purposes example ensure without permission access information access | [
2688,
9481,
10505,
10258,
10518,
4376,
9112,
7968,
290,
1314,
7461,
8742,
5550,
5808,
10418,
9527,
3768,
3004,
9661,
9663,
4416,
2369,
5441,
11457,
72,
853,
2901,
9942,
9177,
8666,
987,
860,
9183,
11362,
10471,
8808,
6383,
9079,
2681,
946... | Test |
8,519 | 4 | Ben_Wizner:ben wizner ben wizner born 1971 american lawyer writer civil liberties advocate american civil liberties union since july 2013 lead attorney nsa whistleblower edward snowden wizner born 1971 new connecticut grew campus yale university father stephen wizner professor law yale law school mother dean described drawn social justice work least early high school graduating harvard college 1993 worked organization provided legal assistance homeless near-homeless people new york university school law planned work legal services impoverished communities capital punishment cases graduating clerked judge stephen reinhardt united states court appeals ninth circuit wizner began working american civil liberties union los angeles august 2001 initially focusing prison reform following september 11 attacks wizner focus shifted civil liberties issues relating u.s. national security around 2004 moved aclu headquarters new york city argued legal cases relating airport security government watchlists surveillance practices targeted killing extraordinary rendition torture made several trips guantanamo bay detention camp many cases wizner took dismissed later commented worst days believed ... n't litigation traditional sense n't trying get court something creating record ... people would able look back decide whether right decision disastrous decision starting 2005 wizner represented khalid el-masri german citizen arrested travelling macedonia suspicion links al qaeda held cia black site afghanistan five months despite evidence wrong person el-masri suit dismissed u.s. grounds state secrecy though cia ultimately admitted making mistake report released u.s. senate european court human rights ruled macedonia case 2011 wizner became director aclu speech privacy technology project wizner adjunct professor new york university school law contributor website lawfare written time freedom press foundation several media outlets testified u.s. congress regularly appeared television news analysis programs including democracy meet press politicking larry king 2013 edward snowden contacted journalist glenn greenwald filmmaker laura poitras longtime acquaintances wizner releasing classified information nsa programs poitras consulted wizner travelling meet snowden hong kong greenwald later put wizner contact snowden july 2013 snowden stranded transit zone moscow passport revoked u.s. government wizner snowden exchanged encrypted communications time snowden legal team also includes jesselyn radack advocate whistleblowers wolfgang kaleck european attorney attorneys expertise criminal asylum law team works pro bono ensure snowden continued freedom ability contribute public conversation began disclosures wizner describes gatekeeper media requests snowden said believes snowden return u.s. eventually wizner called snowden case work lifetime traditional legal work means previously spent decade trying bring cases u.s. intelligence agencies cases often dismissed lack standing snowden revelations verizon delivering metadata u.s. government aclu standing sue wizner defended right privacy critical use extensive surveillance enforce law highlighted role lawbreaking positive social change pointing lgbt civil rights movement drug prohibition areas illegal activities contributed positive changes law public opinion speaking u.s. intelligence apparatus said nsa uniquely evil uniquely capable wizner forcefully defended snowden calls punishment stating broke law public good noting elected officials held criminally liable torture human rights violations since 9/11 following april 2019 arrest wikileaks founder julian assange london ecuadorian embassy ben wizner said authorities prosecute assange violating u.s. secrecy laws would set especially dangerous precedent u.s. journalists routinely violate foreign secrecy laws deliver information vital public interest | [
7887,
8134,
3495
] | Test |
8,520 | 2 | Libvirt:libvirt libvirt open-source api daemon management tool managing platform virtualization used manage kvm xen vmware esxi qemu virtualization technologies apis widely used orchestration layer hypervisors development cloud-based solution libvirt c library bindings languages notably python perl ocaml ruby java javascript via node.js php libvirt programming languages composed wrappers around another class/package called libvirtmod libvirtmod implementation closely associated counterpart c/c++ syntax functionality various virtualization programs platforms use libvirt virtual machine manager others provide graphical interfaces popular command line interface virsh higher level tools ovirt gnome boxes uses libvirt development libvirt backed red hat significant contributions organisations individuals libvirt available linux distributions remote servers also accessible apple microsoft windows clients | [
1539,
526,
10265,
9245,
5662,
5666,
9766,
39,
5677,
3121,
5681,
10820,
11332,
3654,
4683,
590,
1102,
7248,
5202,
4194,
5732,
4729,
2170,
4734,
7812,
4236,
6797,
10893,
2723,
2212,
6307,
2217,
9906,
7352,
4289,
3269,
6367,
2795,
9455,
2804... | None |
8,521 | 2 | Bondwell-2:bondwell-2 bondwell-2 early laptop personal computer running cp/m operating system introduced bondwell 1985 came zilog z80 cpu clocked 4 mhz 64 kb ram 4 kb rom 3.5 floppy disk drive highly unusual cp/m system os largely outmoded time 3.5 drives introduced model 2 main attraction price 995 usd also included micropro complete line cp/m software including wordstar also unusually cp/m system bondwell-2 capable displaying bitmapped graphics flip-up lcd display resolution 640x200 pixels 80x25 text characters 300 baud modem available option | [
1776,
1121,
7983,
4409
] | Validation |
8,522 | 9 | Bc_(programming_language):bc programming language bc basic calculator often referred bench calculator arbitrary-precision calculator language syntax similar c programming language bc typically used either mathematical scripting language interactive mathematical shell typical interactive usage typing command codice_1 unix command prompt entering mathematical expression whereupon output bc work arbitrary precision actually defaults zero digits decimal point expression yields surprise new bc users unaware fact option bc sets default scale digits decimal point 20 adds several additional mathematical functions language bc first appeared version 6 unix 1975 written robert morris lorinda cherry bell labs bc preceded dc earlier arbitrary-precision calculator written authors dc could arbitrary-precision calculations reverse polish notation rpn syntax inconvenient users therefore bc written front-end dc bc simple compiler single yacc source file hundred lines converted new c-like bc syntax dc postfix notation piped results dc 1991 posix rigorously defined standardized bc two implementations standard survive today first traditional unix implementation front-end dc survives unix plan 9 systems second free software gnu bc first released 1991 philip a. nelson gnu implementation numerous extensions beyond posix standard longer front-end dc bytecode interpreter posix standardized bc language traditionally written program dc programming language provide higher level access features dc language without complexities dc terse syntax form bc language contains single-letter variable array function names standard arithmetic operators well familiar control-flow constructs codice_2 codice_3 codice_4 c. unlike c codice_5 clause may followed codice_6 functions defined using codice_7 keyword values returned using codice_8 followed return value parentheses codice_9 keyword optional c used declare variable local function numbers variable contents arbitrary-precision numbers whose precision decimal places determined global codice_10 variable numeric base input interactive mode output program constants may specified setting reserved codice_11 input base codice_12 output base variables output generated deliberately assigning result calculation variable comments may added bc code use c codice_13 codice_14 start end comment symbols following posix bc operators behave exactly like c counterparts modulus operators codice_15 codice_16 behave exactly like c counterparts global codice_10 variable set 0 i.e calculations integer-only otherwise computation done appropriate scale codice_18 defined codice_19 examples operators superficially resemble c bitwise exclusive-or operators fact bc integer exponentiation operators particular note use codice_20 operator negative numbers follow c operator precedence codice_21 gives answer 4 bc rather −4 bitwise boolean conditional operators available posix bc codice_22 function calculating square roots posix bc built-in mathematical function functions available external standard library codice_23 function determining precision codice_10 variable argument codice_25 function determining number significant decimal digits argument also built-in bc standard math library defined -l option contains functions calculating sine cosine arctangent natural logarithm exponential function two parameter bessel function j standard mathematical functions including inverse trigonometric functions constructed using see external links implementations many functions -l option changes scale 20 things modulo may work unexpectedly example writing codice_26 command codice_27 outputs 0 writing codice_28 codice_26 command codice_27 output 1 plan 9 bc identical posix bc additional codice_31 statement gnu bc derives posix standard includes many enhancements entirely separate dc-based implementations posix standard instead written c. nevertheless fully backwards compatible posix bc programs run unmodified gnu bc programs gnu bc variables arrays function names may contain one character operators included c notably codice_5 clause may followed codice_6 output achieved either deliberately assigning result calculation variable posix way using added codice_31 statement furthermore codice_35 statement allows interactive input number running calculation addition c-style comments codice_36 character cause everything next new-line ignored value last calculation always stored within additional built-in codice_37 variable following logical operators additional posix bc available use conditional statements within codice_5 statement note however still equivalent bitwise assignment operations functions available gnu bc inherited posix functions provided standard gnu distribution since bc codice_20 operator allows integer power right one first functions bc user might write power function floating-point exponent assume standard library included /* function return integer part x */ calculate pi using builtin arctangent function bc -lq scale=10000 4*a 1 atan 1 45 degrees pi/4 radians syntax bc similar c published numerical functions written c often translated bc quite easily immediately provides arbitrary precision bc example journal statistical software july 2004 volume 11 issue 5 george marsaglia published following c code cumulative normal distribution double phi double x necessary changes accommodate bc different syntax realizing constant 0.9189 ... actually log 2*pi /2 translated following gnu bc code define phi x bc used non-interactively input pipe useful inside shell scripts example contrast note bash shell performs integer arithmetic e.g one also use here-string idiom bash ksh csh | [
515,
9733,
9735,
3976,
521,
5256,
6281,
6664,
4750,
8975,
11663,
4369,
10387,
5397,
2198,
6812,
7196,
1952,
3488,
4001,
6138,
292,
2599,
7847,
8236,
4398,
7983,
8499,
310,
1336,
8504,
7356,
451,
1987,
965,
2245,
8517,
9542,
5706,
3659,
... | Test |
8,523 | 3 | Pipeline_(computing):pipeline computing computing pipeline also known data pipeline set data processing elements connected series output one element input next one elements pipeline often executed parallel time-sliced fashion amount buffer storage often inserted elements computer-related pipelines include operating systems may provide unix-like syntax string several program runs pipeline implement latter simple serial execution rather true pipelining — namely waiting program finish starting next one pipelining commonly used concept everyday life example assembly line car factory specific task — installing engine installing hood installing wheels — often done separate work station stations carry tasks parallel different car car one task performed moves next station variations time needed complete tasks accommodated buffering holding one cars space stations and/or stalling temporarily halting upstream stations next station becomes available suppose assembling one car requires three tasks take 20 10 15 minutes respectively three tasks performed single station factory would output one car every 45 minutes using pipeline three stations factory would output first car 45 minutes new one every 20 minutes example shows pipelining decrease latency total time one item go whole system however increase system throughput rate new items processed first one since throughput pipeline better slowest element designer try divide work resources among stages take time complete tasks car assembly example three tasks took 15 minutes instead 20 10 15 minutes latency would still 45 minutes new car would finished every 15 minutes instead 20 ideal circumstances processing elements synchronized take amount time process item received element released previous one single clock cycle way items flow pipeline constant speed like waves water channel wave pipelines synchronization buffering needed stages besides storage needed data items generally buffering pipeline stages necessary processing times irregular items may created destroyed along pipeline example graphics pipeline processes triangles rendered screen element checks visibility triangle may discard invisible may output two triangular pieces partly hidden buffering also needed accommodate irregularities rates application feeds items first stage consumes output last one buffer two stages may simply hardware register suitable synchronization signalling logic two stages stage stores data item register sends data available signal next stage b b used data responds data received signal stage halts waiting signal storing next data item register stage b halts waiting data available signal ready process next item stage provided yet processing times element variable whole pipeline may often stop waiting element previous ones consume items input buffers frequency pipeline stalls reduced providing space one item input buffer stage multiple-item buffer usually implemented first-in first-out queue upstream stage may still halted queue gets full frequency events decrease buffer slots provided queuing theory tell number buffer slots needed depending variability processing times desired performance stage takes may take much longer others sped designer provide two processing elements carry task parallel single input buffer single output buffer element finishes processing current data item delivers common output buffer takes next data item common input buffer concept non-linear dynamic pipeline exemplified shops banks two cashiers serving clients single waiting queue applications processing item stage may depend results effect processing previous item x later stage b pipeline case stage correctly process item item x cleared stage b situation occurs often instruction pipelines example suppose arithmetic instruction reads contents register supposed modified earlier instruction x let stage fetches instruction operands b stage writes result specified register stage tries process instruction instruction x reaches stage b register may still contain old value effect would incorrect order handle conflicts correctly pipeline must provided extra circuitry logic detects takes appropriate action strategies include pipelined system typically requires resources circuit elements processing units computer memory etc one executes one batch time stages share resources buffering additional synchronization logic may needed elements moreover transfer items separate processing elements may increase latency especially long pipelines additional complexity cost pipelining may considerable dependencies processing different items especially guess-and-backtrack strategy used handle indeed cost implementing strategy complex instruction sets motivated radical proposals simplify computer architecture risc vliw compilers also burdened task rearranging machine instructions improve performance instruction pipelines | [
4098,
7173,
6663,
9739,
7699,
2071,
10781,
10786,
8231,
7218,
2623,
2113,
7234,
2638,
3159,
2140,
3680,
4194,
5223,
8810,
4205,
8815,
6774,
8822,
7802,
7305,
1677,
7313,
8851,
10387,
3226,
6815,
8863,
2210,
4773,
5798,
6821,
682,
7852,
10... | Test |
8,524 | 9 | Pascal_(programming_language):pascal programming language pascal imperative procedural programming language designed niklaus wirth small efficient language intended encourage good programming practices using structured programming data structuring named honor french mathematician philosopher physicist blaise pascal pascal developed pattern algol 60 language wirth involved process improve language part algol x efforts proposed version known algol w. accepted algol x process bogged 1968 wirth decided abandon algol x process improve algol w releasing pascal 1970 pascal became successful 1970s notably burgeoning minicomputer market compilers also available many microcomputers field emerged late 1970s widely used teaching language university-level programming courses 1980s also used production settings writing commercial software period displaced c programming language late 1980s early 1990s unix-based systems became popular especially release c++ derivative known object pascal designed object-oriented programming developed 1985 used apple computer borland late 1980s later developed delphi microsoft windows platform extensions pascal concepts led languages modula-2 oberon much history computer language design 1960s traced algol 60 language algol developed 1950s explicit goal able clearly describe algorithms included number features structured programming remain common languages day shortly introduction 1962 wirth began working dissertation helmut weber euler programming language euler based algol syntax many concepts derivative primary goal add dynamic lists types allowing used roles similar lisp language published 1965 time number problems algol identified notably lack standardized string system group tasked maintaining language begun algol x process identify improvements calling submissions wirth tony hoare submitted conservative set modifications add strings clean syntax considered minor worth using new standard algol wirth wrote compiler language became known algol w. algol x efforts would go choose dramatically complex language algol 68 complexity language led considerable difficulty producing high-performance compilers widely used industry left opening newer languages pascal influenced algol w efforts explicit goals producing language would efficient compiler run-time allow development well-structured programs useful teaching students structured programming generation students used pascal introductory language undergraduate courses one early successes language introduction ucsd pascal version ran custom operating system could ported different platforms key platform apple ii saw widespread use led use pascal becoming primary high-level language used development apple lisa later macintosh parts original macintosh operating system hand-translated motorola 68000 assembly language pascal sources typesetting system tex donald e. knuth written web original literate programming system based dec pdp-10 pascal successful commercial applications like adobe photoshop written macintosh programmer workshop pascal applications like total commander skype macromedia captivate written delphi object pascal apollo computer used pascal systems programming language operating systems beginning 1980 variants pascal also used everything research projects pc games embedded systems newer pascal compilers exist widely used work lisa larry tesler began corresponding wirth idea adding object oriented extensions language led initially clascal introduced 1983 lisa program faded replaced mac version known object pascal created introduced macintosh 1985 part macapp application framework became apple primary development language early 1990s object pascal extensions added turbo pascal release version 5.5 1989 years object pascal became basis delphi system microsoft windows still used developing windows applications cross-compile code systems free pascal open source cross-platform alternative wirth intention create efficient language regarding compilation speed generated code based structured programming recently popularized concept promoted book algorithms data structures programs pascal roots algol 60 language also introduced concepts mechanisms top algol scalars arrays enabled programmers define complex structured datatypes also made easier build dynamic recursive data structures lists trees graphs important features included records enumerations subranges dynamically allocated variables associated pointers sets make possible meaningful pascal strong typing objects means one type data converted interpreted another without explicit conversions similar mechanisms standard many programming languages today languages influenced pascal development simula 67 wirth algol w. pascal like many programming languages today unlike languages c family allows nested procedure definitions level depth also allows kinds definitions declarations inside subroutines procedures functions enables simple coherent syntax complete program syntactically nearly identical single procedure function except heading one three keywords first pascal compiler designed zürich cdc 6000 series mainframe computer family niklaus wirth reports first attempt implement fortran 1969 unsuccessful due fortran inadequacy express complex data structures second attempt implemented c-like language scallop max engeli translated hand r. schild pascal boot-strapping operational mid-1970 many pascal compilers since similarly self-hosting compiler written pascal compiler usually capable recompiling new features added language compiler ported new environment gnu pascal compiler one notable exception written c. first successful port cdc pascal compiler another mainframe completed welsh quinn queen university belfast qub 1972 target icl 1900 series compiler turn parent pascal compiler information computer systems ics multum minicomputer multum port developed – view using pascal systems programming language – findlay cupples cavouras davis working department computing science glasgow university thought multum pascal completed summer 1973 may first 16-bit implementation completely new compiler completed welsh et al qub 1977 offered source-language diagnostic feature incorporating profiling tracing type-aware formatted postmortem dumps implemented findlay watt glasgow university implementation ported 1980 icl 2900 series team based southampton university glasgow university standard pascal model implementation also based compiler adapted welsh hay manchester university 1984 check rigorously conformity bsi 6192/iso 7185 standard generate code portable abstract machine first pascal compiler written north america constructed university illinois donald b. gillies pdp-11 generated native machine code propagate language rapidly compiler porting kit created zurich included compiler generated code virtual stack machine i.e code lends reasonably efficient interpretation along interpreter code – pascal-p system p-system compilers termed pascal-p1 pascal-p2 pascal-p3 pascal-p4 pascal-p1 first version pascal-p4 last come zurich version termed pascal-p1 coined fact many different sources pascal-p existed compiler redesigned enhance portability issued pascal-p2 code later enhanced become pascal-p3 intermediate code backward compatible pascal-p2 pascal-p4 backward compatible pascal-p4 compiler/interpreter still run compiled systems compatible original pascal however accepts subset pascal language pascal-p5 created outside zurich group accepts full pascal language includes iso 7185 compatibility ucsd pascal branched pascal-p2 kenneth bowles utilized create interpretive ucsd p-system ucsd p-system one three operating systems available launch original ibm personal computer ucsd pascal used intermediate code based byte values thus one earliest byte code compilers pascal-p1 pascal-p4 rather based cdc 6600 60 bit word length compiler based pascal-p4 compiler created native binaries released ibm system/370 mainframe computer australian atomic energy commission called aaec pascal compiler abbreviation name commission apple computer created lisa pascal lisa workshop 1982 ported compiler apple macintosh mpw 1985 1985 larry tesler consultation niklaus wirth defined object pascal extensions incorporated lisa pascal mac pascal compilers 1980s anders hejlsberg wrote blue label pascal compiler nascom-2 reimplementation compiler ibm pc marketed names compas pascal polypascal acquired borland renamed turbo pascal turbo pascal became hugely popular thanks aggressive pricing strategy one first full-screen ides fast turnaround time seconds compile link run written highly optimized entirely assembly language making smaller faster much competition 1986 anders ported turbo pascal macintosh incorporated apple object pascal extensions turbo pascal extensions added back pc version turbo pascal version 5.5 time microsoft also implemented object pascal compiler turbo pascal 5.5 large influence pascal community began concentrating mainly ibm pc late 1980s many pc hobbyists search structured replacement basic used product also began adopted professional developers around time number concepts imported c let pascal programmers use c-based api microsoft windows directly extensions included null-terminated strings pointer arithmetic function pointers address-of operator unsafe typecasts turbo pascal derivatives units module concepts modular languages however provide nested module concept qualified import export specific symbols super pascal variant added non-numeric labels return statement expressions names types tmt pascal first borland-compatible compiler 32-bit dos protected mode os/2 win32 operating systems tmt pascal language first one allow function operator overloading universities wisconsin-madison zürich karlsruhe wuppertal developed pascal-sc pascal-xsc extensions scientific computation compilers aimed programming numerical computations development pascal-sc started 1978 supporting iso 7185 pascal level 0 level 2 support added later stage pascal-sc originally targeted z80 processor later rewritten dos x86 68000 pascal-xsc various times ported unix linux sunos hp-ux aix microsoft/ibm dos emx os/2 windows operating systems operates generating intermediate c source code compiled native executable pascal-sc language extensions adopted gnu pascal pascal sol designed around 1983 french team implement unix-like systems named sol standard pascal level-1 parametrized array bounds definition allowed alternative keywords predefined identifiers french language included extensions ease system programming e.g equivalent lseek sol team later moved chorusos project design distributed operating system ip pascal implementation pascal programming language using micropolis dos moved rapidly cp/m-80 running z80 moved 80386 machine types 1994 exists today windows/xp linux implementations 2008 system brought new level resulting language termed pascaline pascal calculator includes objects namespace controls dynamic arrays along many extensions generally features functionality type protection c implementation also compatible original pascal implementation standardized iso 7185 pascal original form purely procedural language includes traditional array algol-like control structures reserved words else case ranging single statement begin-end statements block pascal also data structuring constructs included original algol 60 types like records variants pointers enumerations sets procedure/pointers constructs part inherited inspired simula 67 algol 68 niklaus wirth algol w suggestions c. a. r. hoare pascal programs start program keyword list external file descriptors parameters ref name= iso/iec 7185:1990 6.10 pascal iso 7185:1990 6.10 /ref required turbo pascal etc follows main block bracketed begin end keywords semicolons separate statements full stop i.e. period ends whole program unit letter case ignored pascal source example source code use simple hello world program type pascal several popular programming languages defines variable way defines range values variable capable storing also defines set operations permissible performed variables type predefined types range values allowed except boolean implementation defined functions provided data conversions conversion codice_1 codice_2 following functions available codice_3 rounds integer using banker rounding codice_4 rounds towards zero programmer freedom define commonly used data types e.g byte string etc terms predefined types using pascal type declaration facility example subranges ordinal data type simple type except real also made contrast programming languages time pascal supports set type set fundamental concept modern mathematics may used many algorithms feature useful may faster equivalent construct language support sets example many pascal compilers executes faster sets non-contiguous values particularly useful terms performance readability examples involve sets small domains improved performance usually achieved compiler representing set variables bit vectors set operators implemented efficiently bitwise machine code operations types defined types using type declarations complex types constructed simple types shown example pascal files sequences components every file buffer variable denoted f^ procedures get reading put writing move buffer variable next element read introduced read f x x f^ get f write introduced write f x f^ x put f type text predefined file char buffer variable could used inspecting next character used check digit reading integer leads serious problems interactive programs early implementations solved later lazy i/o concept jensen wirth pascal strings represented packed arrays chars therefore fixed length usually space-padded pascal supports use pointers variable nodeptr pointer data type node record pointers used declared forward declaration exception rule things must declared used create new record assign value 10 character fields b record initialise pointer c null pointer nil pascal statements would could also done using statement follows inside scope statement b refer subfields record pointer nodeptr record node pointer type pnode linked lists stacks queues created including pointer type field c record unlike many languages feature pointers pascal allows pointers reference dynamically created variables anonymous allow reference standard static local variables pointers also must associated type pointer one type compatible pointer another type e.g pointer char compatible pointer integer helps eliminate type security issues inherent pointer implementations particularly used pl/i c. also removes risks caused dangling pointers ability dynamically deallocate referenced space using dispose function effect free library function found c means risk dangling pointers entirely eliminated languages java c provide automatic garbage collection entirely eliminate related problem memory leaks restrictions lifted newer dialects pascal structured programming language meaning flow control structured standard statements usually without 'goto commands pascal structures programs procedures functions procedures functions nested depth 'program construct logical outermost block default parameters passed value 'var precedes parameter name passed reference procedure function declarations goto labels constants types variables procedures functions must order ordering requirement originally intended allow efficient single-pass compilation however dialects embarcadero delphi strict ordering requirement declaration sections relaxed pascal adopted many language syntax features algol language including use semicolon statement separator contrast languages pl/i c etc use semicolon statement terminator semicolon needed end keyword record type declaration block case statement keyword repeat statement else keyword statement presence extra semicolon permitted early versions pascal however addition algol-like empty statements 1973 revised report later changes language iso 7185:1983 allow optional semicolons cases semicolon still permitted immediately else keyword statement else follows single statement statement sequence case nested ifs semicolon used avoid dangling else problem inner else outer putatively terminating nested semicolon – instead terminates clauses instead explicit codice_5 block must used several pascal compilers interpreters available general use 1983 language standardized international standard iec/iso 7185 several local country specific standards including american ansi/ieee770x3.97-1983 iso 7185:1983 two standards differed iso standard included level 1 extension conformant arrays array boundaries array known run time ansi allow extension original wirth version language 1989 iso 7185 revised iso 7185:1990 correct various errors ambiguities found original document iso 7185 stated clarification wirth 1974 language detailed user manual report jensen wirth also notable adding conformant array parameters level 1 standard level 0 pascal without conformant arrays addition made request c. a. r. hoare approval niklaus wirth precipitating cause hoare wanted create pascal version nag numerical algorithms library originally written fortran found possible without extension would allow array parameters varying size similar considerations motivated inclusion iso 7185 facility specify parameter types procedural functional parameters niklaus wirth referred 1974 language standard example differentiate machine specific features cdc 6000 compiler language documented pascal report second part pascal users manual report large machines mainframes minicomputers pascal originated standards generally followed ibm pc ibm pcs borland standards turbo pascal delphi greatest number users thus typically important understand whether particular implementation corresponds original pascal language borland dialect ibm pc versions language began differ advent ucsd pascal interpreted implementation featured several extensions language along several omissions changes many ucsd language features survive today including borland dialect 1990 extended pascal standard created iso/iec 10206 identical technical content ref name= iso/ansi identical /ref ieee/ansi 770x3.160-1989 2019 support extended pascal freepascal compiler planned niklaus wirth zurich version pascal issued outside eth two basic forms cdc 6000 compiler source porting kit called pascal-p system pascal-p compiler left several features full language required bootstrap compiler example procedures functions used parameters undiscriminated variant records packing dispose interprocedural gotos features full compiler omitted ucsd pascal professor kenneth bowles based pascal-p2 kit consequently shared several pascal-p language restrictions ucsd pascal later adopted apple pascal continued several versions although ucsd pascal actually expanded subset pascal pascal-p kit adding back standard pascal constructs still complete standard installation pascal early 1990s alan burns geoff davies developed pascal-fc extension pl/0 niklaus book 'algorithms+data structures=programs several constructs added use pascal-fc teaching tool concurrent programming semaphores monitors channels remote-invocation resources able demonstrate concurrency compiler output kind p-code could executed virtual machine virtual machine simulated normal – fair – environment could also simulate extreme conditions unfair mode borland turbo pascal written anders hejlsberg written assembly language independent ucsd zurich compilers however adopted much subset extensions ucsd compiler probably ucsd system common pascal system suitable developing applications resource-limited microprocessor systems available time shrink-wrapped turbo pascal version 3 later incarnations including borland object pascal delphi non-borland near-compatibles became popular programmers including shareware authors swag library pascal code features large amount code written versions delphi mind software products compilers ide/rapid application development rad category pascal generated wide variety responses computing community critical complimentary popular 1980s early 1990s implementations pascal closely followed wirth initial definition language widely criticized unsuitable use outside teaching brian kernighan popularized c language outlined notable criticisms pascal early 1981 article pascal favorite programming language serious problem described array sizes string lengths part type possible write function would accept variable-length arrays even strings parameters made unfeasible write example sorting library kernighan also criticized unpredictable order evaluation boolean expressions poor library support lack static variables raised number smaller issues also stated language provide simple constructs escape knowingly forcibly ignore restrictions limitations general complaints sources noted scope declarations clearly defined original language definition sometimes serious consequences using forward declarations define pointer types record declarations led mutual recursion identifier may may used enumeration list another difficulty like algol 60 language allow procedures functions passed parameters predefine expected type parameters kernighan criticisms directly addressed article pascal programming language bill catambay specifically myth 6 pascal serious programmers despite initial criticisms pascal continued evolve kernighan points apply versions language enhanced suitable commercial product development borland turbo pascal kernighan predicted article extensions fix issues incompatible compiler compiler since early 1990s however varieties seem condensed two categories iso borland-like extended pascal addresses many early criticisms supports variable-length strings variable initialization separate compilation short-circuit boolean operators default codice_6 clauses case statements | [
512,
10752,
11269,
1031,
3594,
6154,
10764,
2062,
11279,
6160,
8720,
4114,
5651,
3613,
5149,
5663,
8221,
9245,
9759,
547,
10786,
4137,
2603,
8235,
45,
5677,
9264,
5684,
3126,
1079,
58,
2619,
3642,
6718,
576,
8771,
8262,
8775,
2120,
585,
... | Test |
8,525 | 3 | PowerBook_170:powerbook 170 powerbook 170 released apple inc. 1991 along powerbook 100 powerbook 140 identical form factor 140 high end original powerbook line featuring faster 25 mhz motorola 68030 processor floating point unit fpu expensive significantly better quality active matrix display replaced powerbook 180 1992 though powerbook 100 direct descendant macintosh portable based internal architecture 170 portable direct successor no-compromise portable version desktop macintosh 170 includes virtually features incorporated original portable comparable desktop day smaller sleeker case design initiated suitable replacement portable features first generation 170 include reduced space external video port internal rom pds expansion slots indeed apple canceled external monitor adapter portable shortly announced instead relying numerous third party providers solutions still applicable 170 fcc regulations day prevented real use pds expansion slot restricting external connections powerbook 180 replacement would address external video less year later expansion slots would return macintosh portables three years later powerbook 500 series form pcmcia cards 170 also dropped external floppy disk port macintosh classic ii still one made provision second internal floppy disk port feature also missing rest desktop line time overall roughly equivalent features performance powerful macintosh iici desktop laptop 170 introduced system 7.0.1 specifically support new power management unique hardware features however due ram prices 1991 combined already high list price 170 like 100 140 2 megabytes mb ram soldered directly onto logicboard critics felt restrictive use system 7 since localized versions system 7 yet available worldwide japanese 6.0.7 kanjitalk version apple system software modified support three new powerbooks released version j-6.0.7.1 result version unofficially adapted use standard 6.0.7 allowing many users run system 6 powerbooks rather upgrading on-board ram expensive proprietary ram card 6 mb card us 899 170 shipped additional 2 mb ram card already installed less problem however 4 mb minimum recommended ram size use system 7 practical use ram disk battery power-saving feature though released time powerbook 140 powerbook 100 140 170 designed entirely apple 100 miniaturized sony full-sized macintosh portable result 170 represents first powerbook created apple 100 actually representing first design improvements though internal architecture oldest series | [
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
4139,
7211,
8253,
1090,
4180,
10838,
10840,
9312,
8806,
6258,
10357,
4220,
10365,
10878,
6783,
7299,
4741,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
7844,
7869,
8893,
8896,
4807,
... | None |
8,526 | 4 | INCA_Internet:inca internet inca internet corporation also known nprotect corporation sells computer software inca internet founded young heum joo current ceo president inca internet 2000 offers anti-virus anti-spyware game security unified corporate security headquartered seoul republic korea inca internet selected one deloitte technology fast 50 korea 2007 deloitte technology fast 500 asia pacific 2007 inca internet information security company based republic korea develops 'nprotect line computer security products young heum joo founded company january 31 2000 currently ceo president company currently holds 70 market share information security korean financial institutions 90 game portal security public company limited shares young hem joo largest stockholder followed jaic japan meespierson netherlands major investors include jaic japan largest independent venture capital firm kdb korea development bank main business areas inca internet include online pc security services financial institutions internet business corporations online game corporations among others online game security solutions united pc security solution corporate internal security b2c business online anti-virus normal internet users inca internet one first application service provider asp companies online pc security industry products widely used korean japanese financial institutions public institutions worldwide on-line game companies inca internet awarded ir52 jang yeong-sil award regarded highest reputable award korean industrial technology field acquired iso 9000 certificate tuvit certification institution affiliated german rwtuv group inca internet information security company korea included deloitte technology fast500 asia pacific 2007 inca internet currently client companies 23 countries total 200 million users 170 countries inca internet first entered market january 2000 acquired global patent 'nprotect netizen first program provide real-time client pc information security service inca internet developed strong corporation independent technology leading korean japanese security market financial electronic commerce industry inca internet first founded internet usage fast spread ill-intended cyber attack pattern diversification user niche various complicated malware started show limit single one-time purchase security solutions hw-based information security products since inca internet quickly adjusted information security market trend provided end-user based user friendly pc security solution optimized today internet environment since december 2005 inca internet located within guro digital complex largest industrial complex korea played pivotal role economic growth korea referred miracle han contributing 10 national exports 1970s futuristic industrial hub centering research development advanced information technology knowledge industries relocation great synergy effect inca internet many corporations located benefited information sharing partnerships inca internet nprotect products apply saas software service model first company security industry provide internet banking security online since spread saas model pc security web security company currently holds 70 market share information security korean financial institutions 90 game portal security internationally inca internet mainly provides security solutions china japan south-east asia europe companies jcb card ufj tokyo star bank among corporations using inca internet protection online game security system asp based pc security anti-virus solution unified solution web security programs widely used korean internet environment depend activex microsoft windows internet banks korea need programs law users using linux mac os x browsers operating systems besides internet explorer microsoft windows access online banks functions run kernel level os versions windows use uac user account control windows vista windows 7 higher unable run smoothly moreover program crash kernel x64 windows system input devices especially usb keyboard conjunction nprotect caused reason nprotect netizen nprotect personal nprotect keycrypt programs used mostly internet banking korea programmed terminate processes associated banking processes terminated indiscriminately deemed threat thus may compromise system stability programs also inject existing processes startup sometimes collide anti-viruses problematically korean banks update program every time inca releases update | [
6303,
7739,
8998,
1994,
10026,
6797,
9293,
7983,
9791,
823,
10392,
537,
5754,
7515,
4956,
5373,
2558,
2943
] | Test |
8,527 | 3 | Interchangeable_parts:interchangeable parts interchangeable parts parts components practical purposes identical made specifications ensure nearly identical fit assembly type one part freely replace another without custom fitting filing interchangeability allows easy assembly new devices easier repair existing devices minimizing time skill required person assembly repair concept interchangeability crucial introduction assembly line beginning 20th century become important element modern manufacturing missing important industries interchangeability parts achieved combining number innovations improvements machining operations invention several machine tools slide rest lathe screw-cutting lathe turret lathe milling machine metal planer additional innovations included jigs guiding machine tools fixtures holding workpiece proper position blocks gauges check accuracy finished parts electrification allowed individual machine tools powered electric motors eliminating line shaft drives steam engines water power allowing higher speeds making modern large scale manufacturing possible modern machine tools often numerical control nc evolved cnc computerized numeric control microprocessors became available methods industrial production interchangeable parts united states first developed nineteenth century term american system manufacturing sometimes applied time distinction earlier methods within decades methods use various countries american system term historical reference rather current industrial nomenclature evidence use interchangeable parts traced back two thousand years carthage first punic war carthaginian ships standardized interchangeable parts even came assembly instructions akin tab slot b marked east asia warring states period later qin dynasty bronze crossbow triggers locking mechanisms mass-produced made interchangeable late 18th century french general jean-baptiste vaquette de gribeauval promoted standardized weapons became known système gribeauval issued royal order 1765 focus time artillery muskets handguns one accomplishments system solid cast cannons bored precise tolerances allowed walls thinner cannons poured hollow cores however cores often center wall thickness determined size bore standardized boring allowed cannons shorter without sacrificing accuracy range tighter fit shells also allowed standardization shells 18th century devices guns made one time gunsmiths unique manner one single component firearm needed replacement entire firearm either sent expert gunsmith custom repairs discarded replaced another firearm 18th early 19th centuries idea replacing methods system interchangeable manufacture gradually developed development took decades involved many people gribeauval provided patronage honoré blanc attempted implement système gribeauval musket level around 1778 honoré blanc began producing first firearms interchangeable flint locks although carefully made craftsmen blanc demonstrated front committee scientists muskets could fitted flint locks picked random pile parts muskets interchangeable locks caught attention thomas jefferson efforts honoré blanc jefferson ambassador france 1785 jefferson tried persuade blanc move america successful wrote american secretary war idea returned usa worked fund development president george washington approved idea 1798 contract issued eli whitney 12,000 muskets built new system louis de tousard fled french revolution joined u.s. corp artillerists 1795 wrote influential artillerist manual stressed importance standardization numerous inventors began try implement principle blanc described development machine tools manufacturing practices required would great expense u.s ordnance department years trying achieve interchangeability firearms produced cost manufacture 1853 evidence interchangeable parts perfected federal armories led savings ordnance department freely shared techniques used outside suppliers us eli whitney saw potential benefit developing interchangeable parts firearms united states military july 1801 built ten guns containing exact parts mechanisms disassembled united states congress placed parts mixed pile help reassembled firearms right front congress much like blanc done years congress captivated ordered standard united states equipment use interchangeable parts removed problems earlier eras concerning difficulty impossibility producing new parts old equipment one firearm part failed another could ordered firearm would discarded catch whitney guns costly handmade skilled workmen charles fitch credited whitney successfully executing firearms contract interchangeable parts using american system historians merritt roe smith robert b. gordon since determined whitney never actually achieved interchangeable parts manufacturing family arms company however death mass production using interchangeable parts first achieved 1803 marc isambard brunel cooperation henry maudslay simon goodrich management contributions brigadier-general sir samuel bentham inspector general naval works portsmouth block mills portsmouth dockyard hampshire england time napoleonic war height royal navy state expansion required 100,000 pulley blocks manufactured year bentham already achieved remarkable efficiency docks introducing power-driven machinery reorganising dockyard system marc brunel pioneering engineer maudslay founding father machine tool technology developed first industrially practical screw-cutting lathe 1800 standardized screw thread sizes first time collaborated plans manufacture block-making machinery proposal submitted admiralty agreed commission services 1805 dockyard fully updated revolutionary purpose-built machinery time products still built individually different components total 45 machines required perform 22 processes blocks could made three different sizes machines almost entirely made metal thus improving accuracy durability machines would make markings indentations blocks ensure alignment throughout process one many advantages new method increase labour productivity due less labour-intensive requirements managing machinery richard beamish assistant brunel son engineer isambard kingdom brunel wrote ten men aid machinery accomplish uniformity celerity ease formerly required uncertain labour one hundred ten 1808 annual production reached 130,000 blocks equipment still operation late mid-twentieth century eli terry using interchangeable parts using milling machine early 1800 ward francillon horologist concluded study terry already accomplished interchangeable parts early 1800 study examined several terry clocks produced 1800-1807 parts labeled interchanged needed study concluded clock pieces interchangeable first mass production using interchangeable parts america eli terry 1806 porter contract called production 4000 clocks three years contract terry crafted four-thousand wooden gear tall case movements time annual average dozen unlike eli whitney terry manufactured products without government funding terry saw potential clocks becoming household object use milling machine terry able mass-produce clock wheels plates dozen time jigs templates used make uniform pinions parts could assembled using assembly line crucial step toward interchangeability metal parts taken simeon north working miles eli terry north created one world first true milling machines metal shaping done hand file diana muir believes north milling machine online around 1816 muir merritt roe smith robert b. gordon agree 1832 simeon north john hall able mass-produce complex machines moving parts guns using system entailed use rough-forged parts milling machine milled parts near-correct size filed gage hand aid filing jigs historians differ question whether hall north made crucial improvement merrit roe smith believes done hall muir demonstrates close personal ties professional alliances simeon north neighboring mechanics mass-producing wooden clocks argue process manufacturing guns interchangeable parts probably devised north emulation successful methods used mass-producing clocks may possible resolve question absolute certainty unless documents unknown surface future skilled engineers machinists many armory experience spread interchangeable manufacturing techniques american industries including clockmakers sewing machine manufacturers wilcox gibbs wheeler wilson used interchangeable parts 1860 late adopt interchangeable system singer corporation sewing machine 1870s reaper manufacturer mccormick harvesting machine company 1870s–1880s several large steam engine manufacturers corliss mid-1880s well locomotive makers typewriters followed years later large scale production bicycles 1880s began use interchangeable system decades true interchangeability grew scarce difficult achievement everyday capability throughout manufacturing industries 1950s 1960s historians technology broadened world understanding history development people outside academic discipline knew much topic recently 1980s 1990s academic knowledge began finding wider audiences recently 1960s alfred p. sloan published famous memoir management treatise years general motors even longtime president chair largest manufacturing enterprise ever existed knew little history development say nowiki /nowiki henry m. leland believe one mainly responsible bringing technique interchangeable parts automobile manufacturing … called attention eli whitney long started development interchangeable parts connection manufacture guns fact suggests line descent whitney leland automobile industry one better-known books subject first published 1984 enjoyed readership beyond academia david a. hounshell american system mass production 1800–1932 development manufacturing technology united states principle interchangeable parts flourished developed throughout 19th century led mass production many industries based use templates jigs fixtures applied semi-skilled labor using machine tools augment later largely replace traditional hand tools throughout century much development work done creating gauges measuring tools calipers micrometers standards screw threads processes scientific management principle interchangeability remained constant introduction assembly line beginning 20th century interchangeable parts became ubiquitous elements manufacturing interchangeability relies parts dimensions falling within tolerance range common mode assembly design manufacture long part reaches assembly within tolerance mating parts totally random value reasons already discussed earlier another mode assembly called selective assembly gives randomness capability trade-off value two main areas application benefit economically selective assembly tolerance ranges tight quite held reliably making total randomness unavailable tolerance ranges reliably held fit finish final assembly maximized voluntarily giving randomness makes available ideally desirable either case principle selective assembly parts selected mating rather mated random parts inspected graded separate bins based end range fall violate falling within high low end range usually called heavy light violating high low end range usually called oversize undersize examples given french vierck provide one-paragraph description selective assembly aptly summarizes concept one might ask parts must selected mating makes selective assembly different oldest craft methods fact significant difference selective assembly merely grades parts several ranges within range still random interchangeability quite different older method fitting craftsman mated set parts specifically filed fit part specific unique counterpart contexts application requires extremely tight narrow tolerance ranges requirement may push slightly past limit ability machining processes stamping rolling bending etc stay within range cases selective assembly used compensate lack total interchangeability among parts thus pin must sliding fit hole free sloppy dimension may spec 'd 12.00 +0 −0.01 mm pin 12.00 +.01 −0 hole pins came oversize say pin 12.003mm diameter necessarily scrap mated counterparts also came oversize say hole 12.013mm true matching size parts size counterparts inherent example product application 12 mm dimension require extreme accuracy desired fit parts require good precision see article accuracy precision allows makers cheat little total interchangeability order get value manufacturing effort reducing rejection rate scrap rate sound engineering decision long application context support example machines intention future field service parts-replacing nature rather simple replacement whole unit makes good economic sense lowers unit cost products impede future service work example product might benefit approach could car transmission expectation field service person repair old transmission instead simply swap new one therefore total interchangeability absolutely required assemblies inside transmissions would specified anyway simply general principle except certain shaft required precision high cause great annoyance high scrap rates grinding area decent accuracy required long fit hole good every case money could saved saving many shafts scrap bin examples like one common real commerce conceivably could mostly separation concerns part complex system expected give performance make limiting assumptions parts system car transmission example separation concerns individual firms customers accept lack freedom options others supply chain example car buyer view car manufacturer within rights assume field-service mechanic ever repair old transmission instead replacing customer expects decision preserved make later repair shop based option less expensive time figuring replacing one shaft cheaper replacing whole transmission logic always valid reality might better customer total ownership cost pay lower initial price car especially transmission service covered standard warranty 10 years buyer intends replace car anyway pay higher initial price car preserve option total interchangeability every last nut bolt shaft throughout car going taken advantage anyway commerce generally chaotically multivariate logic prevail total interchangeability ends specified achieved even adds expense needless holistic view commercial system may avoided extent customers experience overall value minds detect appreciate without understand logical analysis thus buyers amazingly affordable car surprisingly low initial price probably never complain transmission field-serviceable long never pay transmission service lifespan ownership analysis important manufacturer understand even lost customer carve competitive advantage marketplace accurately predict cut corners ways customer never pay thus could give lower transmission unit cost however must sure transmissions using reliable replacement covered long warranty expense main area application selective assembly contexts total interchangeability fact achieved fit finish final products enhanced minimizing dimensional mismatch mating parts consider another application similar one 12 mm pin say example precision important produce desired fit accuracy also important 12 mm pin must interact something else accurately sized 12 mm implications example rejection rate lowered parts must fall within tolerance range scrapped savings salvaging oversize undersize parts scrap however still one bit value selective assembly mated pairs close identical sliding fit possible opposed tighter fits looser fits—all sliding varying resistance example product might benefit approach could toolroom-grade machine tool accuracy highly important also fit finish | [
6777
] | None |
8,528 | 8 | OutWit_Hub:outwit hub outwit hub web data extraction software application designed automatically extract information online local resources recognizes grabs links images documents contacts recurring vocabulary phrases rss feeds converts structured unstructured data formatted tables exported spreadsheets databases first version released 2010 version 8.0 released june 2019 program includes mozilla-based browser side bar gives access number views pre-set extractors web pages textual documents broken different constituents presented tables views application navigate series links sequences search engine results pages extract information elements organize tables export various formats predefined extractors allow collect structured tables lists feeds custom scrapers also created extract data less structured page elements regular expressions included scrapers well parts application define variable recognition markers although outwit hub presented tool non-technical users fact application n't use document object model structure extractions prevents visual point grab data scraping forces user wants create custom scrapers define markers source code page advantage approach however allows precise definition extraction masks html nodes faster execution document object model tree n't need rendered browser extraction time program exists two versions standalone application mozilla firefox add-on include identical features limited free version downloaded publisher site shareware enterprise edition application includes advanced extraction automation features specific large volume extractions sending series automatically generated http post queries uploading scraped data ftp servers | [
7983,
2901,
6797,
823
] | None |
8,529 | 2 | Program_Segment_Prefix:program segment prefix program segment prefix psp data structure used dos systems store state program resembles zero page cp/m operating system psp following structure psp often used get command line arguments dos program example command foo.exe /a /f executes foo.exe arguments '/a '/f segment address psp passed ds register program executed also determined later using int 21h function 51h int 21h function 62h either function return psp address register bx alternatively .com programs loaded offset 100h one address psp directly using offsets listed offset 000h points beginning psp 0ffh points end etc example following code displays command line arguments dos 1.x necessary cs code segment register contain segment psp program termination thus standard programming practice involved saving ds register stack program start since ds register loaded psp segment terminating program retf instruction would pop saved segment value stack jump address 0 psp contained int 20h instruction executable .com file procedure unnecessary program could terminated merely direct int 20h instruction else calling int 21h function 0 however programmer still ensure cs register contained segment address psp program termination thus dos 2.x higher program termination accomplished instead int 21h function 4ch require cs register contain segment value psp | [
7847,
2729,
8301,
9166,
2672,
4409,
8507,
2942
] | None |
8,530 | 3 | PowerPC_e300:powerpc e300 powerpc e300 family 32-bit powerpc microprocessor cores developed freescale primary use system-on-a-chip soc designs speed ranging 800 mhz thus making ideal embedded applications e300 superscalar risc core 16/16 32/32 kb l1 data/instruction caches four-stage pipeline load/store system register branch prediction integer unit optional double precision fpu e300 core completely backwards compatible g2 powerpc 603e cores derives e300 core cpu part several soc processors freescale | [
6914,
7299,
3844,
4868,
1158,
3846,
4743,
6663,
5642,
3467,
1548,
1933,
7302,
7305,
3472,
4881,
2073,
7065,
1563,
1309,
6815,
3493,
6949,
6311,
8102,
1321,
8231,
9391,
10543,
4017,
5297,
11314,
1461,
11447,
8120,
6715,
9020,
1725,
1983,
1... | None |
8,531 | 9 | Uninitialized_variable:uninitialized variable computing uninitialized variable variable declared set definite known value used value predictable one programming error common source bugs software common assumption made novice programmers variables set known value zero declared true many languages true potential error languages c use stack space variables collection variables allocated subroutine known stack frame computer set aside appropriate amount space stack frame usually simply adjusting value stack pointer set memory new state typically efficiency concerns therefore whatever contents memory time appear initial values variables occupy addresses simple example c final value codice_1 undefined answer must 10 assumes started zero may may true note example variable codice_2 initialized zero first clause codice_3 statement another example dealing structs code snippet codice_4 contains variables describing information student function codice_5 leaks memory fails fully initialize members codice_6 take closer look beginning codice_7 codice_8 codice_9 initialized initialization codice_10 codice_11 members incorrect length codice_10 codice_11 character arrays less 16 bytes codice_14 fail fully initialize entire 16 bytes memory reserved members hence codice_15'ing resulted struct codice_16 leak stack memory caller case even variable implicitly initialised default value like 0 typically correct value initialised mean correct value default one however default initialisation 0 right practice pointers arrays pointers since makes invalid actually initialised correct value c variables static storage duration initialized explicitly initialized zero null pointers uninitialized variables frequent cause bugs kind bug particularly serious may reproducible instance variable may remain uninitialised branch program cases programs uninitialized variables may even pass software tests uninitialized variables powerful bugs since exploited leak arbitrary memory achieve arbitrary memory overwrite gain code execution depending case exploiting software utilizes address space layout randomization often required know base address software memory exploiting uninitialized variable way force software leak pointer address space used bypass aslr uninitialized variables particular problem languages assembly language c c++ designed systems programming development languages involved design philosophy conflicts performance safety generally resolved favor performance programmer given burden aware dangerous issues uninitialized variables languages variables often initialized known values created examples include even languages uninitialized variables allowed many compilers attempt identify uninitialized variables report compile-time errors | [
1952,
8289,
8545,
2627,
1801,
8554,
779,
9482,
5165,
5677,
655,
9871,
11446,
5176,
10011,
2045,
5598,
9432
] | None |
8,532 | 0 | Symbolic_linguistic_representation:symbolic linguistic representation symbolic linguistic representation representation utterance uses symbols represent linguistic information utterance information phonetics phonology morphology syntax semantics symbolic linguistic representations different non-symbolic representations recordings use symbols represent linguistic information rather measurements typical kind symbolic linguistic representation phonetic transcription symbolic linguistic representations frequently used computational linguistics | [
1890,
3533
] | Train |
8,533 | 4 | Security_event_manager:security event manager security event management sem related sim siem computer security disciplines use data inspection tools centralize storage interpretation logs events generated software running network acronyms sem sim siem sometimes used interchangeably generally refer different primary focus products practice many products area mix functions often overlap – many commercial vendors also promote terminology many systems applications run computer network generate events kept event logs logs essentially lists activities occurred records new events appended end logs occur protocols syslog snmp used transport events occur logging software host events generated better sems provide flexible array supported communication protocols allow broadest range event collection beneficial send events centralized sem system following reasons although centralised logging existed long time sems relatively new idea pioneered 1999 small company called e-security still evolving rapidly key feature security event management tool ability analyse collected logs highlight events behaviors interest example administrator super user logon outside normal business hours may include attaching contextual information host information value owner location etc identity information user info related accounts referenced event like first/last name workforce id manager name etc forth contextual information leveraged provide better correlation reporting capabilities often referred meta-data products may also integrate external remediation ticketing workflow tools assist process incident resolution better sems provide flexible extensible set integration capabilities ensure sem work customer environments sems often sold help satisfy u.s. regulatory requirements sarbanes-oxley pci-dss glba one major problems sem space difficulty consistently analyzing event data every vendor indeed many cases different products one vendor uses different proprietary event data format delivery method even cases standard used part chain like syslog standards n't typically contain enough guidance assist developers generate events administrators gather correctly reliably consumers analyze effectively attempt combat problem couple parallel standardization efforts underway first open group updating circa 1997 xdas standard never made past draft status new effort dubbed xdas v2 attempt formalize event format including data included events expressed xdas v2 standard include event delivery standards standards development dmtf may provide wrapper addition mitre also midst standardization effort called cee somewhat broader scope – attempts define event structure well delivery methods | [
6273,
10940,
10213,
8975,
11611,
700,
3133
] | Validation |
8,534 | 3 | Macintosh_LC_II:macintosh lc ii macintosh lc ii personal computer designed manufactured sold apple computer inc. march 1992 march 1993 lc ii update original macintosh lc replacing motorola 68020 processor 68030 increasing onboard memory 4 mb lc ii priced 1,699 usd fully 800 less original lc introduced september 1992 apple introduced macintosh performa family consumer-oriented computers lc ii repackaged performa 400 lc ii replaced macintosh lc iii early 1993 lc ii discontinued north america two new performa models 405 430 introduced place october performa 400 405 430 discontinued new lc ii-based model called performa 410 introduced became apple new entry-level computer lc ii continued sold markets time lc ii apple highest-selling macintosh product 1992 lc ii retains original lc 16-bit system bus 10 mb ram limit making performance roughly earlier model main benefit 68030 processor lc ii onboard paged memory management unit system 7 uses enable new virtual memory feature apple opted get quick update lc door instead spending additional time required full architectural update happened following year macintosh lc iii lc ii sold time macintosh iisi 800 expensive lc ii 10 mb memory limit 16-bit data bus mono audio output iisi also includes nubus expansion slot lc ii lacks powered via button keyboard unlike lc range power switch back unit case lc ii retains predecessor pizza box form factor design updated lc ii production run auto-inject floppy drive substituted manual-inject unit revised front bezel longer featured horizontal indentation aligning floppy drive defining characteristic snow white design language logic board lc ii retains much original lc logic board design including 16-bit data path 10 mb memory limit limitations limited machine ability take full advantage 68030 cpu storage lc ii shipped one floppy drive standard options 40 80 mb hard drives original lc two internal floppy drive connectors lc ii one 5 lc units sold two floppy drives internal hard disks becoming common 1992 second connector removed video lc ii logic board one video ram slot filled 256 kb simm standard high-end configuration shipped 512 kb simm instead vram simms original lc supported lc ii upgrades apple sold 599 upgrade kit replaced lc ii logic board lc iii introduced march 23 1992 introduced september 4 1992 introduced april 12 1993 introduced october 18 1993 | [
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
4139,
7211,
8253,
1090,
4180,
10838,
10840,
9312,
8806,
6258,
10357,
7286,
4220,
10365,
10878,
6783,
7299,
4741,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
7844,
7869,
8893,
8896,
... | Test |
8,535 | 2 | Libipq:libipq libipq development library iptables userspace packet queuing libipq provides api communicating ip_queue libipq deprecated favour newer libnetfilter_queue linux kernel-2.6.14 onwards libipq used widely deployed applications interface linux kernel-space iptables packet filter | [
9824,
2804,
3486
] | Test |
8,536 | 7 | Comm100:comm100 comm100 comm100 network corporation provider customer service communication products products available saas software service company serves 200,000 businesses around globe company founded 3 july 2009 vancouver british columbia canada first product comm100 live chat introduced 5 august 2009 company reached 100,000 registered business users milestone april 2011 company products services offered free christmas 2011 may 2013 company joined m3aawg supporter 2013 comm100 silver winner best biz awards international year company provides suite business communication tools customer service marketing two popular products comm100 live chat live support software allows users track chat website visitors real time comm100 email marketing bulk email software helps users send opt-in email newsletters subscribers products developed microsoft technologies asp.net microsoft sql server iis internet information services etc | [
3634,
11030,
4439
] | Test |
8,537 | 4 | Four_Horsemen_of_the_Infocalypse:four horsemen infocalypse four horsemen infocalypse term internet criminals imagery internet criminals play four horsemen apocalypse refers types criminals use internet facilitate crime consequently jeopardize rights honest internet users appear exact definition horsemen usually described terrorists drug dealers pedophiles organized crime sources use slightly different descriptions generally refer types criminals term coined timothy c. may 1988 referred child pornographers terrorists drug dealers etc discussing reasons limited civilian use cryptography tools among famous cypherpunk faq states term seems used less often discussions online criminal activity often discussions negative chilling effects activity regular users daily experiences online also used frequently describe political tactic think children message mailing list states four supposed threats may used individually depending circumstances aj 2013 director safe internet league voluntary censorship group russia claimed pedophiles perverts drug dealers “ creeps ” using tor anonymity software reason software outlawed list mention terrorists money-launderers directly use catch-all phrase creeps potentially includes 2015 uk conservative party claimed proposed “ new communications data legislation strengthen ability disrupt terrorist plots criminal networks organised child grooming gangs ” echoing child pornographers terrorists drug dealers etc quote timothy c. may later 2015 gamma group released statement claiming surveillance technology used terrorist threats drug cartels major organised crime paedophile rings justification concerns used target opposition politicians media groups uganda money-laundering treated major organised crime quote matches closely list given cypherpunk faq | [
3192
] | Validation |
8,538 | 0 | Automated_essay_scoring:automated essay scoring automated essay scoring aes use specialized computer programs assign grades essays written educational setting method educational assessment application natural language processing objective classify large set textual entities small number discrete categories corresponding possible grades—for example numbers 1 6 therefore considered problem statistical classification several factors contributed growing interest aes among cost accountability standards technology rising education costs led pressure hold educational system accountable results imposing standards advance information technology promises measure educational achievement reduced cost use aes high-stakes testing education generated significant backlash opponents pointing research computers yet grade writing accurately arguing use purposes promotes teaching writing reductive ways i.e teaching test historical summaries aes trace origins field work ellis batten page 1966 argued possibility scoring essays computer 1968 published successful work program called project essay grade™ peg™ using technology time computerized essay scoring would cost-effective page abated efforts two decades eventually page sold peg measurement incorporated 1990 desktop computers become powerful widespread aes practical possibility early 1982 unix program called writer workbench able offer punctuation spelling grammar advice collaboration several companies notably educational testing service page updated peg ran successful trials early 1990s peter foltz thomas landauer developed system using scoring engine called intelligent essay assessor™ iea iea first used score essays 1997 undergraduate courses product pearson educational technologies used scoring within number commercial products state national exams intellimetric® vantage learning aes engine development began 1996 first used commercially score essays 1998 educational testing service offers e-rater® automated essay scoring program first used commercially february 1999 jill burstein team leader development ets criterion online writing evaluation service uses e-rater engine provide scores targeted feedback lawrence rudner done work bayesian scoring developed system called betsy bayesian essay test scoring system results published print online commercial system incorporates betsy yet leadership howard mitzel sue lottridge pacific metrics developed constructed response automated scoring engine crase® currently utilized several state departments education u.s. department education-funded enhanced assessment grant pacific metrics ’ technology used large-scale formative summative assessment environments since 2007 measurement inc. acquired rights peg 2002 continued develop 2012 hewlett foundation sponsored competition kaggle called automated student assessment prize asap 201 challenge participants attempted predict using aes scores human raters would give thousands essays written eight different prompts intent demonstrate aes reliable human raters competition also hosted separate demonstration among 9 aes vendors subset asap data although investigators reported automated essay scoring reliable human scoring claim substantiated statistical tests vendors required tests performed precondition participation moreover claim hewlett study demonstrated aes reliable human raters since strongly contested including randy e. bennett norman o. frederiksen chair assessment innovation educational testing service major criticisms study five eight datasets consisted paragraphs rather essays four eight data sets graded human readers content rather writing ability rather measuring human readers aes machines true score average two readers scores study employed artificial construct resolved score four datasets consisted higher two human scores disagreement last practice particular gave machines unfair advantage allowing round datasets beginning basic procedure aes start training set essays carefully hand-scored program evaluates surface features text essay total number words number subordinate clauses ratio uppercase lowercase letters—quantities measured without human insight constructs mathematical model relates quantities scores essays received model applied calculate scores new essays recently one mathematical model created isaac persing vincent ng evaluates essays features also argument strength evaluates various features essay agreement level author reasons adherence prompt topic locations argument components major claim claim premise errors arguments cohesion arguments among various features contrast models mentioned model closer duplicating human insight grading essays various aes programs differ specific surface features measure many essays required training set significantly mathematical modeling technique early attempts used linear regression modern systems may use linear regression machine learning techniques often combination statistical techniques latent semantic analysis bayesian inference method assessment must judged validity fairness reliability instrument valid actually measures trait purports measure fair effect penalize privilege one class people reliable outcome repeatable even irrelevant external factors altered computers entered picture high-stakes essays typically given scores two trained human raters scores differed one point third experienced rater would settle disagreement system easy way measure reliability inter-rater agreement raters consistently agree within one point training may fault rater consistently disagrees whichever raters look essays rater probably needs training various statistics proposed measure inter-rater agreement among percent agreement scott π cohen κ krippendorf α pearson correlation coefficient r spearman rank correlation coefficient ρ lin concordance correlation coefficient percent agreement simple statistic applicable grading scales scores 1 n usually 4 ≤ n ≤ 6 reported three figures percent total number essays scored exact agreement two raters gave essay score adjacent agreement raters differed one point includes exact agreement extreme disagreement raters differed two points expert human graders found achieve exact agreement 53 81 essays adjacent agreement 97 100 inter-rater agreement applied measuring computer performance set essays given two human raters aes program computer-assigned scores agree one human raters well raters agree aes program considered reliable alternatively essay given true score taking average two human raters scores two humans computer compared basis agreement true score researchers reported aes systems fact better human page made claim peg 1994 scott elliot said 2003 intellimetric typically outperformed human scorers aes machines however appear less reliable human readers kind complex writing test current practice high-stakes assessments gmat always scored least one human aes used place second rater human rater resolves disagreements one point aes criticized various grounds yang et al mention overreliance surface features responses insensitivity content responses creativity vulnerability new types cheating test-taking strategies several critics concerned students motivation diminished know human read writing among telling critiques reports intentionally gibberish essays given high scores march 12 2013 humanreaders.org launched online petition professionals machine scoring student essays high-stakes assessment within weeks petition gained thousands signatures including noam chomsky cited number newspapers including new york times number education technology blogs petition describes use aes high-stakes testing trivial reductive inaccurate undiagnostic unfair secretive detailed summary research aes petition site notes research findings show one—students parents teachers employers administrators legislators—can rely machine scoring essays ... machine scoring measure therefore promote authentic acts writing petition specifically addresses use aes high-stakes testing says nothing possible uses resources automated essay scoring proprietary | [
5122,
2440,
2059,
6798,
11538,
1044,
5399,
538,
7599,
4531,
4662,
3127,
2488,
10557,
6208,
3533,
5197,
6223,
5857,
7780,
7918,
8046,
8688,
10231,
8440,
7164
] | None |
8,539 | 1 | PostgreSQL:postgresql postgresql also known postgres free open-source relational database management system rdbms emphasizing extensibility technical standards compliance designed handle range workloads single machines data warehouses web services many concurrent users default database macos server also available linux freebsd openbsd windows postgresql features transactions atomicity consistency isolation durability acid properties automatically updatable views materialized views triggers foreign keys stored procedures postgresql developed postgresql global development group diverse group many companies individual contributors postgresql developers pronounce postgresql abbreviated postgres ubiquitous support sql standard among relational databases originally named postgres name post ingres refers project origins rdbms originated university california berkeley review postgresql core team announced 2007 product would continue use name postgresql postgresql evolved ingres project university california berkeley 1982 leader ingres team michael stonebraker left berkeley make proprietary version ingres returned berkeley 1985 began post-ingres project address problems contemporary database systems become increasingly clear early 1980s turing award 2014 projects techniques pioneered new project postgres aimed add fewest features needed completely support data types features included ability define types fully describe relationships – something used widely maintained entirely user postgres database understood relationships could retrieve information related tables natural way using rules postgres used many ideas ingres code starting 1986 published papers described basis system prototype version shown 1988 acm sigmod conference team released version 1 small number users june 1989 followed version 2 re-written rules system june 1990 version 3 released 1991 re-wrote rules system added support multiple storage managers improved query engine 1993 number users began overwhelm project requests support features releasing version 4.2 june 30 1994 – primarily cleanup – project ended berkeley released postgres mit license variant enabled developers use code use time postgres used ingres-influenced postquel query language interpreter could interactively used console application named monitor 1994 berkeley graduate students andrew yu jolly chen replaced postquel query language interpreter one sql query language creating postgres95 monitor also replaced psql yu chen announced first version 0.01 beta testers may 5 1995 version 1.0 postgres95 announced september 5 1995 liberal license enabled software freely modifiable july 8 1996 marc fournier hub.org networking services provided first non-university development server open-source development effort participation bruce momjian vadim b. mikheev work began stabilize code inherited berkeley 1996 project renamed postgresql reflect support sql online presence website postgresql.org began october 22 1996 first postgresql release formed version 6.0 january 29 1997 since developers volunteers around world maintained software postgresql global development group project continues make releases available free open-source software postgresql license code comes contributions proprietary vendors support companies open-source programmers postgresql manages concurrency multiversion concurrency control mvcc gives transaction snapshot database allowing changes made without affecting transactions largely eliminates need read locks ensures database maintains acid principles postgresql offers three levels transaction isolation read committed repeatable read serializable postgresql immune dirty reads requesting read uncommitted transaction isolation level provides read committed instead postgresql supports full serializability via serializable snapshot isolation ssi method postgresql includes built-in binary replication based shipping changes write-ahead logs wal replica nodes asynchronously ability run read-only queries replicated nodes allows splitting read traffic among multiple nodes efficiently earlier replication software allowed similar read scaling normally relied adding replication triggers master increasing load postgresql includes built-in synchronous replication ensures write transaction master waits least one replica node written data transaction log unlike database systems durability transaction whether asynchronous synchronous specified per-database per-user per-session even per-transaction useful workloads require guarantees may wanted data slow performance due requirement confirmation transaction reaching synchronous standby standby servers synchronous asynchronous synchronous standby servers specified configuration determines servers candidates synchronous replication first list actively streaming used current synchronous server fails system fails next line synchronous multi-master replication included postgresql core postgres-xc based postgresql provides scalable synchronous multi-master replication licensed license postgresql related project called postgres-xl postgres-r yet another fork bidirectional replication bdr asynchronous multi-master replication system postgresql tools repmgr make managing replication clusters easier several asynchronous trigger-based replication packages available remain useful even introduction expanded core abilities situations binary replication full database cluster inappropriate postgresql includes built-in support regular b-tree hash table indexes four index access methods generalized search trees gist generalized inverted indexes gin space-partitioned gist sp-gist block range indexes brin addition user-defined index methods created although quite involved process indexes postgresql also support following features postgresql schema holds objects except roles tablespaces schemas effectively act like namespaces allowing objects name co-exist database default newly created databases schema called public schemas added public schema n't mandatory setting determines order postgresql checks schemas unqualified objects without prefixed schema default set refers currently connected database user default set database role level session parameter freely changed even multiple times client session affecting session non-existent schemas listed search_path silently skipped objects lookup new objects created whichever valid schema one presently exists appears first search_path.schema outline database wide variety native data types supported including addition users create data types usually made fully indexable via postgresql indexing infrastructures – gist gin sp-gist examples include geographic information system gis data types postgis project postgresql also data type called domain data type optional constraints defined creator domain means data entered column using domain conform whichever constraints defined part domain data type represents range data used called range types discrete ranges e.g integer values 1 10 continuous ranges e.g. time 10:00 11:00 built-in range types available include ranges integers big integers decimal numbers time stamps without time zone dates custom range types created make new types ranges available ip address ranges using inet type base float ranges using float data type base range types support inclusive exclusive range boundaries using characters respectively e.g. represents integers starting including 4 including 9 range types also compatible existing operators used check overlap containment right etc new types almost objects inside database created including tables set inherit characteristics parent table data child tables appear exist parent tables unless data selected parent table using keyword i.e adding column parent table cause column appear child table inheritance used implement table partitioning using either triggers rules direct inserts parent table proper child tables feature fully supported yet – particular table constraints currently inheritable check constraints not-null constraints parent table automatically inherited children types constraints unique primary key foreign key constraints inherited inheritance provides way map features generalization hierarchies depicted entity relationship diagrams erds directly postgresql database postgresql link systems retrieve data via foreign data wrappers fdws take form data source file system another relational database management system rdbms web service means regular database queries use data sources like regular tables even join multiple data-sources together postgresql several interfaces available also widely supported among programming language libraries built-in interfaces include libpq postgresql official c application interface ecpg embedded c system external interfaces include procedural languages allow developers extend database custom subroutines functions often called stored procedures functions used build database triggers functions invoked modification certain data custom data types aggregate functions procedural languages also invoked without defining function using command sql level languages divided two groups procedures written safe languages sandboxed safely created used user procedures written unsafe languages created superusers allow bypassing database security restrictions also access sources external database languages like perl provide safe unsafe versions postgresql built-in support three procedural languages addition postgresql allows procedural languages loaded database extensions three language extensions included postgresql support perl python tcl external projects add support many languages including java javascript pl/v8 r ruby others triggers events triggered action sql data manipulation language dml statements example insert statement might activate trigger checks values statement valid triggers activated either insert update statements triggers fully supported attached tables triggers per-column conditional update triggers target specific columns table triggers told execute set conditions specified trigger clause triggers attached views using instead condition multiple triggers fired alphabetical order addition calling functions written native pl/pgsql triggers also invoke functions written languages like pl/python pl/perl postgresql provides asynchronous messaging system accessed notify listen unlisten commands session issue notify command along user-specified channel optional payload mark particular event occurring sessions able detect events issuing listen command listen particular channel functionality used wide variety purposes letting sessions know table updated separate applications detect particular action performed system prevents need continuous polling applications see anything yet changed reducing unnecessary overhead notifications fully transactional messages sent transaction sent committed eliminates problem messages sent action performed rolled back many connectors postgresql provide support notification system including libpq jdbc npgsql psycopg node.js used external applications rules allow query tree incoming query rewritten query re-write rules attached table/class re-write incoming dml select insert update and/or delete one queries either replace original dml statement execute addition query re-write occurs dml statement parsing query planning postgresql server process-based threaded uses one operating system process per database session multiple sessions automatically spread across available cpus operating system starting postgresql 9.6 many types queries also parallelized across multiple background worker processes taking advantage multiple cpus cores client applications use threads create multiple database connections thread postgresql manages internal security per-role basis role generally regarded user role log group role roles members permissions granted revoked object column level also allow/prevent creation new objects database schema table levels postgresql security label feature extension sql standards allows additional security bundled loadable module supports label-based mandatory access control mac based security-enhanced linux selinux security policy postgresql natively supports broad number external authentication mechanisms including gssapi sspi kerberos peer ident certificate methods also use specified map file lists users matched authentication system allowed connect specific database user methods specified cluster host-based authentication configuration file pg_hba.conf determines connections allowed allows control user connect database connect ip address ip address range domain socket authentication system enforced whether connection must use transport layer security tls postgresql claims high complete conformance sql standard one exception handling unquoted identifiers like table column names postgresql folded – internal – lower case characters whereas standard says unquoted identifiers folded upper case thus equivalent according standard many informal performance studies postgresql done performance improvements aimed improving scalability began heavily version 8.1 simple benchmarks version 8.0 version 8.4 showed latter 10 times faster read-only workloads least 7.5 times faster read write workloads first industry-standard peer-validated benchmark completed june 2007 using sun java system application server proprietary version glassfish 9.0 platform edition ultrasparc t1-based sun fire server postgresql 8.2 result 778.14 specjappserver2004 jops standard compares favourably 874 jops standard oracle 10 itanium-based hp-ux system august 2007 sun submitted improved benchmark score 813.73 specjappserver2004 jops standard system test reduced price price/performance improved 84.98/jops 70.57/jops default configuration postgresql uses small amount dedicated memory performance-critical purposes caching database blocks sorting limitation primarily older operating systems required kernel changes allow allocating large blocks shared memory postgresql.org provides advice basic recommended performance practice wiki april 2012 robert haas enterprisedb demonstrated postgresql 9.2 linear cpu scalability using server 64 cores matloob khushi performed benchmarking postgresql 9.0 mysql 5.6.15 ability process genomic data performance analysis found postgresql extracts overlapping genomic regions eight times faster mysql using two datasets 80,000 forming random human dna regions insertion data uploads postgresql also better although general searching ability databases almost equivalent postgresql available following operating systems linux recent distributions windows windows 2000 sp4 later compilable e.g visual studio recent 2017 version freebsd openbsd netbsd macos os x aix hp-ux solaris unixware officially tested dragonfly bsd bsd/os irix openindiana opensolaris openserver tru64 unix unix-like systems could also work modern support postgresql works following instruction set architectures x86 x86-64 windows operating systems supported windows ia-64 itanium external support hp-ux powerpc powerpc 64 s/390 s/390x sparc sparc 64 armv8-a 64-bit older arm 32-bit including older armv6 raspberry pi mips mipsel pa-risc also known work alpha dropped 9.5 m68k m32r ns32k vax beyond possible build postgresql unsupported cpu disabling spinlocks open source front-ends tools administering postgresql include number companies offer proprietary tools postgresql often consist universal core adapted various specific database products tools mostly share administration features open source tools offer improvements data modeling importing exporting reporting notable organizations products use postgresql primary database include notable vendors offer postgresql software service | [
6145,
9729,
3,
3080,
6153,
1546,
1035,
8201,
2062,
1553,
6166,
1049,
3609,
5658,
9245,
3103,
546,
2083,
1579,
5165,
5677,
10286,
3636,
9782,
4663,
5691,
6718,
7234,
580,
5700,
3142,
9286,
9290,
6219,
11338,
8781,
5198,
7248,
597,
5723,
... | Test |
8,540 | 3 | Macintosh_128K:macintosh 128k macintosh 128k originally released apple macintosh original apple macintosh personal computer beige case consisted crt monitor came keyboard mouse handle built top case made easier computer lifted carried initial selling price 2,495 macintosh introduced now-famous 370,000 television commercial ridley scott 1984 aired cbs third quarter super bowl xviii january 22 1984 sales macintosh strong initial release january 24 1984 reached 70,000 units may 3 1984 upon release successor macintosh 512k rebranded macintosh 128k computer model number heart computer motorola 68000 microprocessor running connected 128 kb ram shared processor display controller boot procedure operating system routines contained additional rom chip apple offer ram upgrades unlike apple ii source code listings macintosh system roms offered ram macintosh consisted sixteen 4164 64k×1 drams 68000 video controller took turns accessing dram every four cpu cycles display frame buffer 68000 unrestricted access dram vertical horizontal blanking intervals arrangement reduced overall performance cpu much 35 code display logic often blocked cpu access ram caused computer run slower several competitors despite nominally high clock rate mac 128s 512s commonly equipped micron-branded 4164 ram chips cost reasons however micron quality control poor chips common failure point built-in display one-bit black-and-white crt fixed resolution 512×342 pixels establishing desktop publishing standard 72 ppi expansion networking achieved using two non-standard rs-422 de-9 serial ports named printer modem support hardware handshaking external floppy disk drive could added using proprietary connector 19-pin d-sub keyboard mouse used simple proprietary protocols allowing third-party upgrades original keyboard arrow keys numeric keypad function keys intentional decision apple keys common older platforms thought addition keys would encourage software developers simply port existing applications mac rather design new ones around gui paradigm later apple would make numeric keypad available macintosh 128k keyboard sold newer macintosh plus model would include numeric keypad arrow keys still function keys apple lisa mouse single button standard headphones could also connected monaural jack apple also offered 300 1200 bit/s modems originally released apple ii line initially printer available apple imagewriter dot matrix printer designed produce 144 dpi wysiwyg output mac 72 dpi screen eventually laserwriter printers capable connected using appletalk apple built-in networking system macintosh contained single 400 kb single-sided -inch floppy disk drive dedicating space internal mechanical storage mac os disk-based beginning ram conserved startup disk could still temporarily ejected ejecting root filesystem remained unusual feature classic mac os system 7 one floppy disk sufficient store system software application data files created application indeed 400 kb drive capacity larger pc xt 360 kb 5.25-inch drive however sophisticated work environments time required separate disks documents system installation due memory constraints 128 kb original macintosh fact floppies could hold 400 kb users frequently swap disks floppy drive reason external floppy drives frequently used macintosh external disk drive mechanically identical internal one piggybacking controller popular add-on us 495 third-party hard drives considerably expensive usually connected slower serial port specified apple though manufacturers chose use faster nonstandard floppy port 128k use original macintosh file system storage unit include fan relying instead convection cooling made quiet operation steve jobs insisted macintosh ship without fan persisted introduction macintosh se 1987 allegedly source many common costly component failures first four macintosh models enough problem prompt introduction third-party external cooling fan fan unit fitted inside macintosh carrying-handle slot produced forced draft computer existing ventilation holes macintosh shipped first system finder application known public system 1.0 formally known system 0.97 finder 1.0 original macintosh saw three upgrades discontinued apple recommends system 2.0 finder 4.2 system 3.2 finder 5.3 maximum system 4.0 officially dropped support macintosh 128k distributed 800 kb floppy disks could used 128k applications macpaint macwrite bundled mac programs available included macproject macterminal microsoft word programming languages available time included macbasic macpascal macintosh 68000 development system macintosh also came manual unique guided tour cassette tape worked together guided tour diskette tutorial macintosh bundled applications since new macintosh users never used mouse much less manipulated graphical user interface computer released january 1984 simply apple macintosh following release macintosh 512k september expanded memory 128 kb 512 kb original macintosh re-branded macintosh 128k nicknamed thin mac new 512k model nicknamed fat mac functionally closed systems macintosh macintosh 128k technically two different computers re-badged 128k containing completely redesigned logic board easily accommodate 128 kb 512 kb ram configurations manufacturing though ram still permanently soldered logic board new design allowed easier though unsanctioned third-party upgrades 512 kb addition newer models contained 1984 revision b rom accommodate changes 400 kb floppy disk drive system software contains support unreleased macintosh 256k increased ram 512k vitally important macintosh finally allowed powerful software applications then-popular program microsoft multiplan however apple continued market 128k year entry-level computer mid-level 512k high-end lisa claiming could easily expanded user ever need ram jobs stated customization really mostly software ... options computers mac unlike apple ii macintosh 128k need slots described costly requiring larger size power upgradable user apple service centers permitted open case accessories external maccharlie added ibm pc compatibility provision adding internal storage ram upgrade cards however macintosh engineers objected jobs ideas secretly developed workarounds example macintosh supposed 17 address lines motherboard enough support 128k system ram design team added additional two address lines without jobs knowledge making possible expand computer 512k although actual act upgrading system ram difficult required piggybacking additional ram chips overtop onboard 4164 chips september 1984 months complaints mac inadequate ram apple released official 512k machine although always planned beginning steve jobs maintained user desired ram mac 128 provided simply pay extra money mac 512 rather upgrade computer mac 512 released apple rebranded original model macintosh 128k modified motherboard allow easier ram upgrades improving hard-wired ram thus required motherboard replacement priced similarly new computer third-party chip replacement upgrade expensive would void apple warranty difficulty fitting software limited free memory coupled new interface event driven programming model discouraged software vendors supporting leaving 128k relatively small software library whereas macintosh plus lesser extent macintosh 512k compatible much later software 128k limited specially crafted programs stock mac 128k original 64k rom neither compatible apple external 800 kb drive hfs apple hard disk 20 mac 128k upgraded newer 128k rom called macintosh 128ke use internal external 800 kb drives hfs well hd20 print appleshare network neither file sharing limited ram early 1985 much macintosh software required 512k memory apple sold official memory upgrade macintosh 128k included motherboard replacement effectively making macintosh 512k price us 995 additionally apple offered 800 kb floppy disk drive kit including updated 128k roms finally mac 128k could upgraded macintosh plus swapping logic board well case back accommodate slightly different port configuration optionally adding macintosh plus extended keyboard kits could purchased alone together time partial full upgrade macintosh 128k upgrades required performed professional apple technicians reportedly refused work macintosh upgraded 512k without apple official upgrade us 700 much expensive 300 third-party versions original macintosh unusual included signatures macintosh division early 1982 molded inside case names peggy alexio colette askeland bill atkinson steve balog bob belleville mike boich bill bull matt carter berry cash debi coleman george crow donn denman christopher espinosa bill fernandez martin haeberli andy hertzfeld joanna hoffman rod holt bruce horn hap horn brian howard steve jobs larry kenyon patti king daniel kottke angeline lo ivan mach jerrold manock mary ellen mccammon vicki milledge mike murray ron nicholson jr. terry oyama benjamin pang jef raskin ed riddle brian robertson dave roots patricia sharp burrell smith bryan stearns lynn takahashi guy bud tribble randy wigginton linda wilkin steve wozniak pamela wyman laszlo zidek macintosh 128/512k models also included easter eggs os rom user went system debugger typed codice_1 graphic reading stolen apple computers would appear upper left corner screen designed prevent unauthorized cloning macintosh numerous apple ii clones appeared many simply stole apple copyrighted system roms steve jobs allegedly planned macintosh clone appeared market court case happened could access easter egg computer prove using pirated macintosh roms macintosh se would later augment easter egg slideshow 4 photos apple design team codice_2 entered erik sandberg-diment new york times january 1984 stated macintosh presages revolution personal computing although preferring larger screens calling lack color mistake praised refreshingly crisp clear display lack fan noise unsure whether would become second standard big blue ronald rosenberg boston globe wrote february euphoria macintosh change america computes anyone tries pint-size machine gets hooked features gregg williams byte month found hardware software design predicted would imitated copied impressive criticized lack standard second disk drive predicted computer would popularize 3½-inch floppy disk drive standard macintosh would improve apple reputation delay ibm domination personal computer market williams concluded macintosh important development computers last five years brings us one step closer ideal computer appliance follow-up article may 1984 issue byte williams added initial reaction macintosh strongly overpoweringly favorable traditional computer users see mouse windows desktop metaphor silly useless frills others outraged lack color graphics users impressed machine capabilities still people expressed concern relatively small 128k-byte ram size lack computer language sent part basic unit inconvenience single disk drive jerry pournelle also byte added macintosh bargain get heavily discounted price offered faculty students favored 24 universities macintosh consortium noted however macintosh attracted people previously hated computers ... apparently something mice pull-down menus icons appeal people previously intimidated like | [
3598,
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
4139,
7211,
9778,
8253,
576,
1090,
4180,
10838,
10840,
9312,
7269,
8806,
8301,
6258,
7285,
10357,
4220,
10365,
10878,
6783,
4741,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
... | None |
8,541 | 5 | T.37:t.37 t.37 itu standard deals sending fax messages using email also referred ifax internet fax store-forward-fax fax machine supporting t.37 send fax email address converting document tiff-f image attaching email using mime format sending document using smtp destination fax receives email prints attached document interface regular fax machines | [
6880,
9909
] | None |
8,542 | 3 | Gnome_Ranger:gnome ranger gnome ranger text adventure game level 9 released 1987 followed sequel titled ingrid back gnome ingrid bottomlow displeased family un-gnomelike behaviour going university getting education teleported village faulty scroll must find way back.. game standard text adventure limited graphics platforms comes short novella peter mcbride gnettlefield journal explaining ingrid predicament setting background story gameplay similar earlier level 9 adventure knight orc uses game engine kaos player must explore settings collecting useful items interacting various non-player characters solve puzzles problems game takes place three areas characterized non-player characters ingrid meet first contains characters animal nature second vegetable nature third mineral nature | [
9674,
8650,
9166,
9006,
10931
] | None |
8,543 | 3 | Millicode:millicode computer architecture millicode higher level microcode used implement instruction set computer millicode runs top microcoded instructions uses instructions implement complex instructions visible user system implementation millicode requires special processor mode called millimode provides set registers possibly special instructions invisible user ibm invented concept term millicode system/390 9672-g4 processor 1997 following cited advantages millicode i370 code capitol chipset used es/9370 models similar millicode written combination system/370 instructions code access special hardware features | [
7173,
9739,
2066,
7699,
5655,
10779,
10781,
6181,
8231,
3630,
6705,
7218,
2623,
2113,
7234,
2638,
3175,
8815,
6268,
3197,
7313,
6815,
5793,
6818,
6821,
7852,
9391,
2224,
2226,
7858,
9911,
8890,
4286,
9932,
5329,
10966,
731,
11487,
7911,
1... | Test |
8,544 | 3 | Macintosh_512K:macintosh 512k macintosh 512k personal computer designed manufactured sold apple computer inc. september 1984 april 1986 first update original macintosh 128k virtually identical previous macintosh differing primarily amount built-in random-access memory increased memory turned macintosh business-capable computer gained ability run software mac 512k originally shipped macintosh system 1.1 able run versions mac os system 4.1 replaced macintosh 512ke macintosh plus support mac 512k discontinued september 1 1998 like macintosh 128k 512k contained motorola 68000 connected 512 kb dram 16-bit data bus though memory quadrupled could upgraded large increase earned nickname fat mac 64 kb rom chip boosts effective memory 576 kb offset display 22 kb framebuffer shared dma video controller shared arrangement reduces cpu performance 35 shared revised logic board re-badged macintosh 128k previously called macintosh streamlined manufacturing resolution display 512x342 apple sold memory upgrade macintosh 128k 995 initially reduced price 256k dram prices fell months later applications macpaint macwrite still bundled mac soon model released several applications became available including macdraw macproject macintosh pascal others particular microsoft excel written specifically macintosh required minimum 512 kb ram solidified macintosh serious business computer models enhanced rom also supported apple switcher allowing cooperative multitasking among necessarily applications laserwriter printer became available shortly 512k introduction well number pad mic tablet keyboard mouse basic mouse much utilized apple built-in networking scheme localtalk allows sharing devices among several users 512k oldest macintosh capable supporting apple appleshare built-in file sharing network introduced 1987 expanded memory 512k allowed better handle large word-processing documents make better use graphical user interface generally increased speed 128k model original 512k could accept macintosh system software version 4.1 system software 5 possible used hard disk 20 updated version replaced macintosh 512k debuted macintosh 512k enhanced april 1986 differed original 512k 800 kb floppy disk drive improved rom macintosh plus exception new model number m0001e otherwise cosmetically identical stock 512k could also use 800 kb floppy disk drive well hard disk 20 first hard disk manufactured apple exclusively use 512k required special system file required 512k e loaded improved rom code ram thus reducing available ram uses apple offered upgrade kit replaced floppy disk drive roms essentially turning 512k e one oem upgrade replaced logicboard rear case entirely macintosh plus original macintosh 512k designed slots upgrade boards hard-disk controller internal upgrades available 512k general computer us 2,795 hyperdrive hard drive plug directly 68000 processor socket upgrades included snap-on scsi cards ram upgrades 2 mb | [
7697,
4114,
6165,
11289,
7706,
8222,
1057,
6183,
1576,
4139,
7211,
8253,
576,
1090,
4180,
10838,
10840,
9312,
7269,
8806,
6258,
10357,
4220,
10365,
10878,
6783,
4741,
8842,
6283,
7824,
147,
7830,
6807,
4258,
7842,
7844,
7335,
7869,
8893,
... | None |
8,545 | 2 | C_dynamic_memory_allocation:c dynamic memory allocation c dynamic memory allocation refers performing manual memory management dynamic memory allocation c programming language via group functions c standard library namely c++ programming language includes functions however operators provide similar functionality recommended language authors still myriad situations using codice_1 applicable garbage collection code performance-sensitive code combination codice_2 codice_3 may required instead higher-level codice_4 operator many different implementations actual memory allocation mechanism used available performance varies execution time required memory c programming language manages memory statically automatically dynamically static-duration variables allocated main memory usually along executable code program persist lifetime program automatic-duration variables allocated stack come go functions called return static-duration automatic-duration variables size allocation must compile-time constant except case variable-length automatic arrays required size known run-time example data arbitrary size read user disk file using fixed-size data objects inadequate lifetime allocated memory also cause concern neither static- automatic-duration memory adequate situations automatic-allocated data persist across multiple function calls static data persists life program whether needed many situations programmer requires greater flexibility managing lifetime allocated memory limitations avoided using dynamic memory allocation memory explicitly flexibly managed typically allocating free store informally called heap area memory structured purpose c library function codice_2 used allocate block memory heap program accesses block memory via pointer codice_2 returns memory longer needed pointer passed codice_7 deallocates memory used purposes platforms provide library calls allow run-time dynamic allocation c stack rather heap e.g codice_8 memory automatically freed calling function ends c dynamic memory allocation functions defined codice_9 header codice_10 header c++ creating array ten integers automatic scope straightforward c however size array fixed compile time one wishes allocate similar array dynamically following code used computes number bytes ten integers occupy memory requests many bytes codice_2 assigns result pointer named codice_19 due c syntax pointers arrays used interchangeably situations codice_2 might able service request might return null pointer good programming practice check program longer needs dynamic array must eventually call codice_7 return memory occupies free store memory set aside codice_2 initialized may contain cruft remnants previously used discarded data allocation codice_2 elements array uninitialized variables command codice_24 return allocation already cleared realloc resize amount memory pointer points example pointer acting array size formula_1 want change array size formula_2 use realloc note realloc must assumed changed base address block i.e failed extend size original block therefore allocated new larger block elsewhere copied old contents therefore pointers addresses within original block also longer valid codice_2 returns void pointer codice_26 indicates pointer region unknown data type use casting required c++ due strong type system whereas case c. lack specific pointer type returned codice_2 type-unsafe behaviour according programmers codice_2 allocates based byte count type different c++ new operator returns pointer whose type relies operand see c type safety one may cast see type conversion pointer specific type advantages disadvantages performing cast improper use dynamic memory allocation frequently source bugs include security bugs program crashes often due segmentation faults common errors follows implementation memory management depends greatly upon operating system architecture operating systems supply allocator malloc others supply functions control certain regions data dynamic memory allocator often used implement codice_2 operator codice_4 c++ implementation allocator commonly done using heap data segment allocator usually expand contract heap fulfill allocation requests heap method suffers inherent flaws stemming entirely fragmentation like method memory allocation heap become fragmented sections used unused memory allocated space heap good allocator attempt find unused area already allocated memory use resorting expanding heap major problem method heap two significant attributes base beginning heap virtual memory space length size heap requires enough system memory fill entire length base never change thus large areas unused memory wasted heap get stuck position small used segment exists end heap could waste amount address space lazy memory allocation schemes often found linux operating system large heap necessarily reserve equivalent system memory first write time reads non-mapped memory pages return zero granularity depends page size doug lea developed dlmalloc doug lea malloc general-purpose allocator starting 1987 gnu c library glibc uses ptmalloc allocator based dlmalloc memory heap allocated chunks 8-byte aligned data structure contains header usable memory allocated memory contains 8 16 byte overhead size chunk usage flags unallocated chunks also store pointers free chunks usable space area making minimum chunk size 16 bytes 32-bit systems 24/32 depends alignment bytes 64-bit systems unallocated memory grouped bins similar sizes implemented using double-linked list chunks pointers stored unallocated space inside chunk requests 256 bytes smallbin request simple two power best fit allocator used free blocks bin block next highest bin split two requests 256 bytes mmap threshold recent versions dlmalloc use in-place bitwise trie algorithm free space left satisfy request dlmalloc tries increase size heap usually via brk system call requests mmap threshold largebin request memory always allocated using mmap system call threshold usually 256 kb mmap method averts problems huge buffers trapping small allocation end expiration always allocates entire page memory many architectures 4096 bytes size since freebsd 7.0 netbsd 5.0 old codice_2 implementation phkmalloc replaced jemalloc written jason evans main reason lack scalability phkmalloc terms multithreading order avoid lock contention jemalloc uses separate arenas cpu experiments measuring number allocations per second multithreading application shown makes scale linearly number threads phkmalloc dlmalloc performance inversely proportional number threads openbsd implementation codice_2 function makes use mmap requests greater size one page entire allocation retrieved using codice_52 smaller sizes assigned memory pools maintained codice_2 within number bucket pages also allocated codice_52 call codice_7 memory released unmapped process address space using codice_56 system designed improve security taking advantage address space layout randomization gap page features implemented part openbsd codice_52 system call detect use-after-free bugs—as large memory allocation completely unmapped freed use causes segmentation fault termination program hoard allocator whose goal scalable memory allocation performance like openbsd allocator hoard uses codice_52 exclusively manages memory chunks 64 kilobytes called superblocks hoard heap logically divided single global heap number per-processor heaps addition thread-local cache hold limited number superblocks allocating superblocks local per-thread per-processor heap moving mostly-empty superblocks global heap reused processors hoard keeps fragmentation low achieving near linear scalability number threads every thread local storage small allocations large allocations mmap sbrk used tcmalloc malloc developed google garbage-collection local storage dead threads tcmalloc considered twice fast glibc ptmalloc multithreaded programs operating system kernels need allocate memory application programs implementation codice_2 within kernel often differs significantly implementations used c libraries however example memory buffers might need conform special restrictions imposed dma memory allocation function might called interrupt context necessitates codice_2 implementation tightly integrated virtual memory subsystem operating system kernel codice_2 relatives strong impact performance program uncommon override functions specific application custom implementations optimized application allocation patterns c standard provides way operating systems found various ways exploiting dynamic linking one way simply link different library override symbols another employed unix system v.3 make codice_2 codice_7 function pointers application reset custom functions largest possible memory block codice_2 allocate depends host system particularly size physical memory operating system implementation theoretically largest number maximum value held codice_65 type implementation-dependent unsigned integer representing size area memory c99 standard later available codice_66 constant codice_67 although guaranteed iso c usually c library implementations shipping various operating systems compilers may come alternatives extensions standard codice_2 package notable among | [
2304,
9482,
4747,
8975,
5008,
9490,
11539,
7702,
1435,
541,
3871,
7071,
10143,
1954,
2605,
814,
5165,
5040,
9008,
2995,
7479,
3512,
5176,
2625,
1474,
2627,
6338,
8773,
1736,
4424,
6730,
4173,
6221,
5840,
5074,
8531,
468,
6868,
86,
9559,
... | None |
8,546 | 2 | Light_Weight_Kernel_Threads:light weight kernel threads light weight kernel threads lwkt computer science term dragonflybsd particular lwkts differ normal kernel threads preempt normal kernel threads according matt dillon dragonflybsd creator | [
1891,
1637,
7983,
274,
850,
11698,
2168,
4571,
3197
] | Test |
8,547 | 7 | Big_V_Telecom:big v telecom big v telecom indian cloud telephony company serves direct clients also works partnership network franchises company first incubated tata elxsi 2013 part 140 billion tata group based pune india big v telecom founded keshor daga 2008 flagship product yocc contact centre 2012 part company corporate social responsibility drive big v telecom established call anna virtual contact centre anti-corruption activist anna hazare indian anti-corruption movement 2012 big v telecom partnered western central railways providing 131 railway enquiry number firm also partnered bsnl providing value added services maharashtra august 2015 firm launched product named voter first propagated india first voter engagement issue resolution application custom built politicians interact constituents download android ios stores reports suggest voter first name sub-division big v telecom firm name appear app stores instead politician apps appear respective names picture identity mobile app firm past also partnered tv18 commoditycontrol.com providing on-spot updates commodity rates via phone calls consumers self-funded company recently announced looking venture capital funding expansion within outside india ndtv profit business services excellence award innovative franchise business service sector 2010 aegis graham bell award innovative managed services 2012 tata elxsi takes big v telecom incubator programme tata elxsi incubates big v telecom tata elxsi picks big v telecom first startup new incub te program tata elxsi sets business incubator cloud telephony firm big v telecom looking raise 6.5m funding big v telecom incubated tata elxsi expands footprints delhi/ncr big v telecom incubated tata elxsi expands footprints delhi/ncr big v telecom incubated tata elxsi expands footprints delhi/ncr | [] | Test |
8,548 | 4 | Chinese_National_Vulnerability_Database:chinese national vulnerability database chinese national vulnerability database cnnvd people republic china nstional vulnerability database maintained chinese ministry state security | [
2558,
2446
] | Test |
8,549 | 9 | Ballerina_(programming_language):ballerina programming language ballerina general-purpose programming language features optimized network distributed applications easy write modify suitable application programmers open source project started 2015 architects wso2 code-based alternative configuration-based integration tools eai esb workflow products ballerina various constructs geared toward cloud-native development including support modern data formats protocols reliability distributed transactions apis event streams simple hello world service depicted // start service navigate directory contains // .bal file execute ballerina run command import ballerina/http import ballerina/log service hello new http listener 9090 print “ hello world ” parallel using workers import ballerina/io public function main | [
3462,
8582,
10387,
1435,
668,
9245,
7326,
3876,
4777,
5677,
7983,
6074,
6718,
8644,
8262,
5833,
8524,
7889,
11219,
11221,
2519,
477,
6502,
10470,
8554,
5612,
10991,
3960,
3705,
7292,
2045
] | None |
8,550 | 4 | Mohamed_Elnoby:mohamed elnoby mohamed abdelbasset elnouby famous egyptian programmer information security specialist one famous white hat arabic hackers start point 2013 penetrated discovered vulnerabilitya facebook resulted website gave reward focused name many arabic global media channels paid big attention also discovered many vulnerabilities many famous global websites like google yahoo amazon adobe others honored effort plus adding name add value hall fame list white hat security experts 20 global websites founder member chief technonogy officer google business community upper egypt ex general moderator arabic version foursquare app facebook added name hall fame list white hat security experts 2013 2014 2015 2016 row born 1988 esna qena upper egypt graduated faculty tourism hotels elmenia university started working programming computer networks field since 1999 code name facebook symbiansymoh worked many organizations like s3geeks cooperated volunteering works like arabization famous social media website twitter also worked general moderator arabic version foursquare app working freelance programmer chief technonogy officer google business community upper egypt took first step penetration hacking others computers stealing accounts turned moral hacker call white hat hacker start point discovering vulnerability famous website facebook got financial reward plus adding name honor list white hat security experts continued discovering vulnerabilities till got 5 ones processes vulnerabilities discovery global websites continued till got 22 websites famous hunter vulnerabilities rewards | [] | Train |
8,551 | 2 | Memory_protection:memory protection memory protection way control memory access rights computer part modern instruction set architectures operating systems main purpose memory protection prevent process accessing memory allocated prevents bug malware within process affecting processes operating system protection may encompass accesses specified area memory write accesses attempts execute contents area attempt access unowned memory results hardware fault called segmentation fault storage violation exception generally causing abnormal termination offending process memory protection computer security includes additional techniques address space layout randomization executable space protection segmentation refers dividing computer memory segments reference memory location includes value identifies segment offset within segment x86 architecture multiple segmentation features helpful using protected memory architecture x86 architecture global descriptor table local descriptor tables used reference segments computer memory pointers memory segments x86 processors also stored processor segment registers initially x86 processors 4 segment registers cs code segment ss stack segment ds data segment es extra segment later another two segment registers added – fs gs paging memory address space divided equal-sized blocks called pages using virtual memory hardware page reside location computer physical memory flagged protected virtual memory makes possible linear virtual memory address space use access blocks fragmented physical memory address space computer architectures support paging also use pages basis memory protection page table maps virtual memory physical memory page table usually invisible process page tables make easier allocate additional memory new page allocated anywhere physical memory impossible application access page explicitly allocated every memory address either points page allocated application generates interrupt called page fault unallocated pages pages allocated application addresses application point view page fault may necessarily indicate error page faults used memory protection operating system may manage page table way reference page previously swapped disk causes page fault operating system intercepts page fault loads required memory page application continues fault occurred scheme known virtual memory allows in-memory data currently use moved disk storage back way transparent applications increase overall memory capacity systems page fault mechanism also used executable space protection w^x memory protection key mpk mechanism divides physical memory blocks particular size e.g. 4 kib associated numerical value called protection key process also protection key value associated memory access hardware checks current process protection key matches value associated memory block accessed exception occurs mechanism introduced system/360 architecture available today system z mainframes heavily used system z operating systems subsystems system/360 protection keys described associated physical addresses different protection key mechanism used architectures hewlett-packard/intel ia-64 hewlett-packard pa-risc associated virtual addresses allow multiple keys per process itanium pa architectures translations tlb entries keys itanium access ids pa associated running process several protection key registers 16 itanium 4 hp/pa translation selected virtual address key compared protection key registers match plus possible checks access permitted none match fault exception generated software fault handler desired check missing key larger list keys maintained software thus protection key registers inside processor may treated software-managed cache larger list keys associated process pa 15–18 bits key itanium mandates least 18 keys usually associated protection domains libraries modules etc x86 protection keys architecture allows tagging virtual addresses user pages 16 protection keys pages tagged protection key constitute protection domain new register contains permissions associated protection domain load store operations checked page table permissions protection key permissions associated protection domain virtual address allowed permissions allow access protection key permissions set user space allowing applications directly restrict access application data without os intervention since protection keys associated virtual address protection domains per address space processes running different address spaces use 16 domains simulation use monitoring program interpret machine code instructions computer architectures instruction set simulator provide memory protection using segmentation-like scheme validating target address length instruction real time actually executing simulator must calculate target address length compare list valid address ranges holds concerning thread environment dynamic memory blocks acquired since thread inception plus valid shared static memory slots meaning valid may change throughout thread life depending upon context may sometimes allowed alter static block storage sometimes depending upon current mode execution may may depend storage key supervisor state generally advisable use method memory protection adequate facilities exist cpu takes valuable processing power computer however generally used debugging testing purposes provide extra fine level granularity otherwise generic storage violations indicate precisely instruction attempting overwrite particular section storage may storage key unprotected storage capability-based addressing method memory protection unused modern commercial computers method pointers replaced protected objects called capabilities created using privileged instructions may executed kernel process authorized effectively lets kernel control processes may access objects memory need use separate address spaces context switches commercial products used capability based security plessey system 250 ibm system/38 intel iapx 432 architecture keykos capability approaches widely used research systems eros combex darpa browser used conceptually basis virtual machines notably smalltalk java currently darpa-funded cheri project university cambridge working create modern capability machine also supports legacy software dynamic tainting technique protecting programs illegal memory accesses memory allocated runtime technique taints memory corresponding pointer using taint mark taint marks suitably propagated program executes checked every time memory address accessed pointer p taint marks associated p differ execution stopped illegal access reported sparc m7 processors higher implement dynamic tainting hardware oracle markets feature silicon secured memory ssm previously branded application data integrity adi lowrisc cpu design includes dynamic tainting name tagged memory protection level particular implementation may measured closely adheres principle minimum privilege different operating systems use different forms memory protection separation although memory protection common mainframes many minicomputer systems 1960s true memory separation used home computer operating systems os/2 risc os released 1987 prior systems lack protection even used form interprocess communication sending pointer processes possible processes access system memory windows 9x family operating systems operating systems implement memory protection include unix-like systems codice_1 system call used control memory protection | [
2560,
6155,
3603,
6675,
7187,
10776,
25,
4637,
3615,
9762,
4643,
6180,
5158,
3624,
7217,
10803,
1592,
5176,
9784,
10809,
576,
2625,
8259,
8773,
6730,
6221,
1614,
10835,
3160,
2653,
10333,
97,
11363,
6760,
10856,
8298,
9835,
7285,
4727,
21... | Validation |
8,552 | 3 | LGA_1150:lga 1150 lga 1150 also known socket h3 microprocessor socket used intel central processing units cpus built haswell microarchitecture socket also used haswell successor broadwell microarchitecture successor lga 1155 succeeded lga 1151 2016 motherboards lga 1150 socket support varying video outputs vga dvi hdmi depending model intel clear video technology intel platform controller hub pch lga 1150 cpus codenamed lynx point intel xeon processors socket lga 1150 use intel c222 c224 c226 chipsets 4 holes fastening heatsink motherboard placed square lateral length 75 mm intel sockets lga 1156 lga 1155 lga 1150 lga 1151 cooling solutions therefore interchangeable may 12 2014 intel announced release two 9-series chipsets h97 z97 differences new features two chipsets compared h87 z87 counterparts following motherboards based h97 z97 chipsets available purchase day chipsets announced | [
3588,
5901,
398,
5523,
2455,
3992,
8855,
11417,
3995,
4252,
6175,
7714,
10019,
4523,
2604,
2350,
6192,
8625,
9649,
4537,
2237,
7105,
4805,
7110,
8394,
3403,
4427,
4179,
3798,
4185,
7002,
9945,
10715,
2525,
11484,
9570,
10468,
613,
1515,
1... | Validation |
8,553 | 2 | Interactive_Systems_Corporation:interactive systems corporation interactive systems corporation styled interactive systems corporation abbreviated isc us-based software company first vendor unix operating system outside operating santa monica california founded 1977 peter g. weiner rand corporation researcher previously founded yale university computer science department ph d. advisor brian kernighan one unix developers weiner joined heinz lycklama also veteran previously author version 6 unix port lsi-11 computer isc acquired eastman kodak company 1988 sold isc unix operating system assets sun microsystems september 26 1991 kodak sold remaining parts isc shl systemhouse inc 1993 several former isc staff founded segue software partnered lotus development develop unix version lotus 1-2-3 peter norton computing develop unix version norton utilities isc 1977 offering is/1 version 6 unix variant enhanced office automation running pdp-11 is/3 is/5 enhanced versions unix system iii system v pdp-11 vax isc unix ports ibm pc included variant system iii developed contract ibm known pc/ix personal computer interactive executive also abbreviated pc-ix later versions branded 386/ix finally interactive unix system v/386 based system v release 3.2 isc principal publisher system v.4 intel platform isc also involved development vm/ix unix guest os vm/370 enhancements ix/370 tss/370-based unix system ibm originally developed jointly ca.1980 also developed aix 1.0 advanced interactive executive ibm rt pc contract ibm although ibm awarded development contract aix version 2 aix/386 aix/370 competing locus computing corporation although observers early 1980s expected ibm would choose microsoft xenix version corporation unix microcomputer pc/ix first unix implementation ibm pc xt available directly ibm according bob blake pc/ix product manager ibm primary objective make credible unix system ... try 'ibm-ize product pc-ix system iii unix pc/ix however first unix port xt venix/86 preceded pc/ix year although based older version 7 unix main addition pc/ix ined screen editor isc ined offered multiple windows context-sensitive help paragraph justification margin changes although fully fledged word processor pc/ix omitted system iii fortran compiler tar file archiver add bsd tools like vi c shell one reason porting pc/ix individual applications limited single segment 64 kb ram achieve good filesystem performance pc/ix directly addressed xt hard-drive rather bios gave significant speed advantage compared ms-dos lack true memory protection 8088 chips ibm sold single-user licenses pc/ix pc/ix distribution came 19 floppy disks accompanied 1,800-page manual installed pc/ix took approximately 4.5 mb disk space editorial bill machrone pc magazine time pc/ix launch flagged 900 price show stopper given lack compatibility ms-dos applications pc/ix commercial success although byte august 1984 described complete usable single-user implementation done 8088 noting pc/ix pc outperformed venix pdp-11/23 pc/ix succeeded 386/ix 1985 system vr3 derivative later versions termed interactive unix system v/386 based system v 3.2 though elements bsd added svr3.2 kernel meant diminished compatibility unix ports early nineties interactive unix system praised pc magazine reviewer stability acquisition interactive sun microsystems continued maintain interactive unix system offering low-end alternative system v.4-based solaris even latter ported x86-based desktop machines last version system v/386 release 3.2 version 4.1.1 released july 1998 official support ended july 23 2006 five years sun withdrew product sale version isa 3.0.1 interactive unix system supported 16 mb ram next versions supported 256mb ram pci bus eisa versions always supported 256mb ram | [
640,
3488,
9665,
2179,
6787,
7460,
9444,
9829,
1515,
2995,
5492,
9141,
11604,
3323,
9151
] | Validation |
8,554 | 9 | Python_(programming_language):python programming language python interpreted high-level general-purpose programming language created guido van rossum first released 1991 python design philosophy emphasizes code readability notable use significant whitespace language constructs object-oriented approach aim help programmers write clear logical code small large-scale projects python dynamically typed garbage-collected supports multiple programming paradigms including procedural object-oriented functional programming python often described batteries included language due comprehensive standard library python conceived late 1980s successor abc language python 2.0 released 2000 introduced features like list comprehensions garbage collection system capable collecting reference cycles python 3.0 released 2008 major revision language completely backward-compatible much python 2 code run unmodified python 3 due concern amount code written python 2 support python 2.7 last release 2.x series extended 2020 language developer guido van rossum shouldered sole responsibility project july 2018 shares leadership member five-person steering council python interpreters available many operating systems global community programmers develops maintains cpython open source reference implementation non-profit organization python software foundation manages directs resources python cpython development python conceived late 1980s guido van rossum centrum wiskunde informatica cwi netherlands successor abc language inspired setl capable exception handling interfacing amoeba operating system implementation began december 1989 van rossum continued python lead developer july 12 2018 announced permanent vacation responsibilities python benevolent dictator life title python community bestowed upon reflect long-term commitment project chief decision-maker january 2019 active python core developers elected brett cannon nick coghlan barry warsaw carol willing van rossum five-member steering council lead project python 2.0 released 16 october 2000 many major new features including cycle-detecting garbage collector support unicode python 3.0 released 3 december 2008 major revision language completely backward-compatible many major features backported python 2.6.x 2.7.x version series releases python 3 include codice_1 utility automates least partially translation python 2 code python 3 python 2.7 end-of-life date initially set 2015 postponed 2020 concern large body existing code could easily forward-ported python 3 january 2017 google announced work python 2.7 go transcompiler improve performance concurrent workloads python multi-paradigm programming language object-oriented programming structured programming fully supported many features support functional programming aspect-oriented programming including metaprogramming metaobjects magic methods many paradigms supported via extensions including design contract logic programming python uses dynamic typing combination reference counting cycle-detecting garbage collector memory management also features dynamic name resolution late binding binds method variable names program execution python design offers support functional programming lisp tradition codice_2 codice_3 codice_4 functions list comprehensions dictionaries sets generator expressions standard library two modules itertools functools implement functional tools borrowed haskell standard ml language core philosophy summarized document zen python pep 20 includes aphorisms rather functionality built core python designed highly extensible compact modularity made particularly popular means adding programmable interfaces existing applications van rossum vision small core language large standard library easily extensible interpreter stemmed frustrations abc espoused opposite approach python strives simpler less-cluttered syntax grammar giving developers choice coding methodology contrast perl one way motto python embraces one—and preferably one—obvious way design philosophy alex martelli fellow python software foundation python book author writes describe something 'clever considered compliment python culture python developers strive avoid premature optimization reject patches non-critical parts cpython reference implementation would offer marginal increases speed cost clarity speed important python programmer move time-critical functions extension modules written languages c use pypy just-in-time compiler cython also available translates python script c makes direct c-level api calls python interpreter important goal python developers keeping fun use reflected language name—a tribute british comedy group monty python—and occasionally playful approaches tutorials reference materials examples refer spam eggs famous monty python sketch instead standard foo bar common neologism python community pythonic wide range meanings related program style say code pythonic say uses python idioms well natural shows fluency language conforms python minimalist philosophy emphasis readability contrast code difficult understand reads like rough transcription another programming language called unpythonic users admirers python especially considered knowledgeable experienced often referred pythonists pythonistas pythoneers python meant easily readable language formatting visually uncluttered often uses english keywords languages use punctuation unlike many languages use curly brackets delimit blocks semicolons statements optional fewer syntactic exceptions special cases c pascal python uses whitespace indentation rather curly brackets keywords delimit blocks increase indentation comes certain statements decrease indentation signifies end current block thus program visual structure accurately represents program semantic structure feature also sometimes termed off-side rule python statements include among others python support tail call optimization first-class continuations according guido van rossum never however better support coroutine-like functionality provided 2.5 extending python generators 2.5 generators lazy iterators information passed unidirectionally generator python 2.5 possible pass information back generator function python 3.3 information passed multiple stack levels python expressions similar languages c java python distinction expressions statements rigidly enforced contrast languages common lisp scheme ruby leads duplicating functionality example statements part expression list comprehensions lambda expressions expressions contain statements particular case assignment statement codice_78 form part conditional expression conditional statement advantage avoiding classic c error mistaking assignment operator codice_79 equality operator codice_36 conditions codice_81 syntactically valid probably unintended c code codice_82 causes syntax error python methods objects functions attached object class syntax codice_83 normal methods functions syntactic sugar codice_84 python methods explicit codice_85 parameter access instance data contrast implicit codice_85 codice_87 object-oriented programming languages e.g. c++ java objective-c ruby python uses duck typing typed objects untyped variable names type constraints checked compile time rather operations object may fail signifying given object suitable type despite dynamically typed python strongly typed forbidding operations well-defined example adding number string rather silently attempting make sense python allows programmers define types using classes often used object-oriented programming new instances classes constructed calling class example codice_88 codice_89 classes instances metaclass codice_90 instance allowing metaprogramming reflection version 3.0 python two kinds classes old-style new-style syntax styles difference whether class codice_91 inherited directly indirectly new-style classes inherit codice_91 instances codice_90 versions python 2 python 2.2 onwards kinds classes used old-style classes eliminated python 3.0 long term plan support gradual typing python 3.5 syntax language allows specifying static types checked default implementation cpython experimental optional static type checker named mypy supports compile-time type checking python usual c language arithmetic operators codice_50 codice_95 codice_96 codice_33 codice_58 also codice_34 exponentiation e.g codice_100 codice_101 new matrix multiply codice_35 operator included version 3.5 additionally unary operator codice_103 essentially inverts bits one argument integers means codice_104 operators include bitwise shift operators codice_105 shifts codice_106 left codice_107 places codice_108 codice_109 shifts codice_106 right codice_107 places codice_112 behavior division changed significantly time division integers produces accurate floating point results rounding towards negative infinity though different languages adds consistency instance means equation codice_126 always true also means equation codice_127 valid positive negative values codice_128 however maintaining validity equation means result codice_129 expected half-open interval 0 b codice_130 positive integer lie interval b 0 codice_130 negative python provides codice_132 function rounding float nearest integer tie-breaking versions 3 use round-away-from-zero codice_133 1.0 codice_134 −1.0 python 3 uses round even codice_135 2 codice_136 2 python allows boolean expressions multiple equality relations manner consistent general use mathematics example expression codice_137 tests whether codice_128 less codice_130 codice_130 less codice_141 c-derived languages interpret expression differently c expression would first evaluate codice_142 resulting 0 1 result would compared codice_141 python extensive built-in support arbitrary precision arithmetic integers transparently switched machine-supported maximum fixed-precision usually 32 64 bits belonging python type codice_144 arbitrary precision belonging python type codice_145 needed latter l suffix textual representation python 3 distinction codice_144 codice_145 types eliminated behavior entirely contained codice_144 class codice_149 type/class module codice_150 since version 2.4 provides decimal floating point numbers arbitrary precision several rounding modes codice_151 type module codice_152 since version 2.6 provides arbitrary precision rational numbers due python extensive mathematics library third-party library numpy extends native capabilities frequently used scientific scripting language aid problems numerical data processing manipulation python large standard library commonly cited one greatest strengths provides tools suited many tasks internet-facing applications many standard formats protocols mime http supported includes modules creating graphical user interfaces connecting relational databases generating pseudorandom numbers arithmetic arbitrary precision decimals manipulating regular expressions unit testing parts standard library covered specifications example web server gateway interface wsgi implementation codice_153 follows pep 333 modules specified code internal documentation test suites supplied however standard library cross-platform python code modules need altering rewriting variant implementations python implementations including cpython include read–eval–print loop repl permitting function command line interpreter user enters statements sequentially receives results immediately shells including idle ipython add abilities auto-completion session state retention syntax highlighting well standard desktop integrated development environments web browser-based ides sagemath intended developing science math-related python programs pythonanywhere browser-based ide hosting environment canopy ide commercial python ide emphasizing scientific computing cpython reference implementation python written c meeting c89 standard several select c99 features compiles python programs intermediate bytecode executed virtual machine cpython distributed large standard library written mixture c native python available many platforms including windows modern unix-like systems platform portability one earliest priorities pypy fast compliant interpreter python 2.7 3.5 just-in-time compiler brings significant speed improvement cpython stackless python significant fork cpython implements microthreads use c memory stack thus allowing massively concurrent programs pypy also stackless version micropython circuitpython python 3 variants optimised microcontrollers includes lego mindstorms ev3 just-in-time python compilers developed unsupported 2005 nokia released python interpreter series 60 mobile phones named pys60 includes many modules cpython implementations additional modules integrate symbian operating system project kept up-to-date run variants s60 platform several third-party modules available nokia n900 also supports python gtk widget libraries enabling programs written run target device several compilers high-level object languages either unrestricted python restricted subset python language similar python source language performance comparison various python implementations non-numerical combinatorial workload presented euroscipy '13 python development conducted largely python enhancement proposal pep process primary mechanism proposing major new features collecting community input issues documenting python design decisions python coding style covered pep 8 outstanding peps reviewed commented python community steering council enhancement language corresponds development cpython reference implementation mailing list python-dev primary forum language development specific issues discussed roundup bug tracker maintained python.org development originally took place self-hosted source-code repository running mercurial python moved github january 2017 cpython public releases come three types distinguished part version number incremented many alpha beta release-candidates also released previews testing final releases although rough schedule release often delayed code ready python development team monitors state code running large unit test suite development using buildbot continuous integration system community python developers also contributed 86,000 software modules python package index pypi official repository third-party python libraries major academic conference python pycon also special python mentoring programmes pyladies python name derived british comedy group monty python python creator guido van rossum enjoyed developing language monty python references appear frequently python code culture example metasyntactic variables often used python literature spam eggs instead traditional foo bar official python documentation also contains various references monty python routines prefix py- used show something related python examples use prefix names python applications libraries include pygame binding sdl python commonly used create games pyqt pygtk bind qt gtk python respectively pypy python implementation originally written python python api documentation generators include since 2003 python consistently ranked top ten popular programming languages tiobe programming community index third popular language behind java c selected programming language year 2007 2010 2018 empirical study found scripting languages python productive conventional languages c java programming problems involving string manipulation search dictionary determined memory consumption often better java much worse c c++ large organizations use python include wikipedia google yahoo cern nasa facebook amazon instagram spotify smaller entities like ilm ita social news networking site reddit written entirely python python serve scripting language web applications e.g. via mod_wsgi apache web server web server gateway interface standard api evolved facilitate applications web frameworks like django pylons pyramid turbogears web2py tornado flask bottle zope support developers design maintenance complex applications pyjs ironpython used develop client-side ajax-based applications sqlalchemy used data mapper relational database twisted framework program communications computers used example dropbox libraries numpy scipy matplotlib allow effective use python scientific computing specialized libraries biopython astropy providing domain-specific functionality sagemath mathematical software notebook interface programmable python library covers many aspects mathematics including algebra combinatorics numerical mathematics number theory calculus python successfully embedded many software products scripting language including finite element method software abaqus 3d parametric modeler like freecad 3d animation packages 3ds max blender cinema 4d lightwave houdini maya modo motionbuilder softimage visual effects compositor nuke 2d imaging programs like gimp inkscape scribus paint shop pro musical notation programs like scorewriter capella gnu debugger uses python pretty printer show complex structures c++ containers esri promotes python best choice writing scripts arcgis also used several video games adopted first three available programming languages google app engine two java go python commonly used artificial intelligence projects help libraries like tensorflow keras scikit-learn scripting language modular architecture simple syntax rich text processing tools python often used natural language processing many operating systems include python standard component ships linux distributions amigaos 4 freebsd package netbsd openbsd package macos used command line terminal many linux distributions use installers written python ubuntu uses ubiquity installer red hat linux fedora use anaconda installer gentoo linux uses python package management system portage python used extensively information security industry including exploit development sugar software one laptop per child xo developed sugar labs written python raspberry pi single-board computer project adopted python main user-programming language libreoffice includes python intends replace java python python scripting provider core feature since version 4.0 7 february 2013 python design philosophy influenced many programming languages python development practices also emulated languages example practice requiring document describing rationale issues surrounding change language python pep also used tcl erlang python received tiobe programming language year awards 2007 2010 2018 award given language greatest growth popularity year measured tiobe index | [
0,
8201,
6154,
10250,
2062,
4112,
6160,
19,
2069,
8213,
8221,
6176,
6177,
6191,
8240,
50,
8244,
2105,
58,
8262,
74,
4171,
6219,
6227,
84,
6228,
4182,
6233,
10340,
102,
4200,
8297,
8303,
8304,
113,
8323,
2181,
2186,
8331,
10387,
148,
1... | Test |
8,555 | 7 | Salesforce_Tower_(Indianapolis):salesforce tower indianapolis opened 1990 near monument circle indianapolis salesforce tower formerly known bank one tower chase tower originally conceived american fletcher tower tallest building u.s. state indiana 58th tallest building united states surpassed aul tower oneamerica tower indianapolis distinction building twin spires pierce indianapolis skyline 49 floors office retail space 2 building equipment floors peak roof regional headquarters salesforce moved tower late-2010 currently occupies large amount space building tower two spires equal height one functional transmission antenna mast merely architectural decoration building designed klingstubbins built indianapolis-based huber hunt nichols tower step pyramidal cap reflects design indiana war memorial three blocks due north war memorial turn reflects descriptions original mausoleum height building roof specifically designed house communications relay equipment order provide additional revenue building owners past several years two large banners occasionally placed outside north south communication bullpen areas roof support two city professional sports franchises go pacers go colts signs highly visible tallest structure city tower official observation deck views city seen floors 21 27 31 32 33 35 39 40 41 43 44 common areas ohio street side tower side complex additionally views monument circle immediate downtown area seen floors 2 7 10 common areas circle side complex 2017 electronic turnstiles implemented tower security measure turn elevators longer accessible public however visitors passes attained security desk circle tower-side lobbies tower seen various spots around greater indianapolis tower originally conceived late 1970s frank e. mckinney jr. chairman american fletcher corporation holding company american fletcher national bank trust company afnb time indiana largest financial institution allow consolidation expansion company headquarters land slowly assembled building several predecessor structures along ohio street pennsylvania street demolished years early 1980s clear way mckinney hoped would soon indiana tallest office tower construction building began american fletcher became first major indianapolis bank holding company sold out-of-state financial institution agreeing spring 1986 merge ohio rapidly growing banc one corporation upon consummation merger mr. mckinney became chairman bank one indiana operations tower planning picked momentum ground broken construction began 1988 newly designated bank one center tower integrated afnb existing headquarters complex monument circle adjacent market street done mainly secure prestigious monument circle address new tower rises ohio street wabash street east-west alley market ohio thus ohio street entrance tower complex back door concourse-style passageway second level running scioto street north-south alley pennsylvania meridian connect skyscraper attached parking garage along pennsylvania street main entrance original 1960 american national bank building 111 monument circle separate skywalk across scioto connected circle building adjacent fletcher trust building 10 e. market street later removed bank moved operations formerly located structure new tower fletcher trust building subsequently sold since renovated hilton garden inn hotel banc one corporation later renamed bank one corporation went several additional major acquisitions bought j.p. morgan chase early 2000s upon consummation merger indianapolis structure renamed become known chase tower chase allowed attach name logo top building 2013 building changed owners may 6 2016 salesforce announced plans lease hundreds thousands square feet building start moving employees early 2017 building rebranded salesforce tower indianapolis | [
10090,
8555,
5398
] | Test |
8,556 | 9 | MAPPER:mapper sperry univac 'mapper 4gl originated 1970s based work 1960s kept current renamed also given extension named ice internet commerce enabler originally available sperry univac 1108 implementations also exist windows nt sun solaris linux gui windows advanced mapper maintain prepare p'roduce executive reports since officially renamed bis business information server called mapper fans began internal product first customer santa fe railway started punched card era input 80 columns data printed reports 120 132 columns attempted go beyond modeling filing cabinet typical era written assember language initially limited string manipulation since corrected macro capability also subsequently added bis product still use still job postings | [
4042,
2477,
8976,
823,
477,
6335
] | Test |
8,557 | 5 | ICab:icab icab web browser mac os alexander clauss derived crystal atari browser cab atari tos compatible computers one browsers still updated classic mac os prior version discontinued version 3.0.5 2008 today classilla browser still maintained os downloadable product fully functional nagware—periodically displaying dialog box asking user register product upgrade pro version icab 2.9.9 supports 68k powerpc macintosh systems running system 7.5 mac os 9.2.2 longer maintained icab 2.9.9 still available download registration icab 2.9.8 runs natively early versions mac os x mac os x compatible versions icab 2.x longer officially available download icab 3.x run powerpc systems running mac os 8.5 mac os 9.2.2 powerpc intel systems running mac os x 10.1 later icab 3 last updated january 2008. icab 4 rewritten use cocoa api webkit rendering engine run powerpc intel systems running mac os 10.3.9 later icab 5 released june 12 2012 runs mac os 10.5 later first versions icab criticized supporting css dom icab 3 introduced improved rendering capabilities including support css2 unicode via atsui toolkit icab 4 switched webkit rendering engine giving rendering abilities apple safari browser 7 june 2009 icab 4.6 using webkit rendering engine became first desktop browser released display score 100/100 pass acid3 test apple safari 4 browser released one day later officially credited first official release browser pass acid3 test score 100/100 icab features filter manager allows users avoid downloading advertisements content currently icab comes two filters advertisements video kinds filters add features youtube video filter adds download link youtube page views icab features website developers including html validity checker automatic page refresh option web inspector dom inspector javascript debugger console icab automatic update option page rendering directly local hard disk automatically reload page changes saved disk html syntax validity checker displays smiley face status bar also optionally toolbar clicking smiley bring list errors page error report tools menu double clicking error display page source offending syntax highlighted html syntax validator first seen author earlier web browser cab icab download manager allows user start stop resume review downloads maintains download history supports downloading individual page whole site crawling many user-selectable crawl-constraint options save portable web archives zip archive containing html images files individual files local hard drive icab also contains following features | [
513,
6657,
9736,
2579,
6171,
2076,
9757,
7713,
10791,
9770,
559,
4661,
3639,
10808,
3643,
9275,
64,
576,
5707,
10834,
5205,
6231,
8281,
2139,
6747,
6237,
1642,
9834,
8303,
9841,
115,
9843,
119,
4728,
637,
1664,
2182,
11418,
10910,
8351,
... | None |
8,558 | 9 | Erik_Naggum:erik naggum erik naggum june 13 1965 – june 17 2009 norwegian computer programmer recognized work fields sgml emacs lisp since early 1990s also provocative participant various usenet discussion groups naggum made significant contributions rfc 1123 defines discusses requirements internet host software rfc 2049 defines electronic information transfer various binary formats e-mail 1999 newspaper article dagbladet interviewed aggressive confrontational participation usenet discussion groups erik later stated motto people little herd animals flocking together whenever world becomes uncomfortable … one people motto would probably herd thither hither premature death age 44 june 17 2009 caused massive bleeding ulcer related ulcerative colitis diagnosed 15 years death naggum chairman sgml sighyper sgml special interest group hypertext multimedia see hytime technical commentary iso 8879:1986 archives comp.text.sgml terms high quality sheer mass especially appreciated long painful history time article naggum describes concept universal time time zones handled well lisp code erik contributed enormous number postings usenet 14,300 record many cases erik used x-no-archive header posting parameter requesting services like google groups archive message 1995 erik started journalism watch-group project web campaigning get journalist sacked aftenposten following publication sensationalist story internet relay chat channels used trade child pornography erik naggum contributed free software project emacs text editor almost decade working group member posix.1-2008 ieee std 1003.1-2008 open group technical standard base specifications issue 7 erik listed major contributor rfc 1123 contributed requirement internet mail include four-digit representation years thus avoid y2k issues erik naggum highly controversial passionate something many subjects eagerly often harshly argued point view example rant xml misdesigned especially misused one example would diatribe martin bryan posted 1992 erik naggum hated perl passion considered perl problem problem solver disliked c++ though much hated perl generally thought c++ difficult understand degree 5 people planet truly understood hence little value humanity erik naggum several times stated stupidity rather lacking willingness individuals acquire knowledge subject argument read people arguments open mind less criminal offense known polemic aggression towards considered ignorant individuals much wrote full sarcasm irony could difficult understand truly believed general exaggerations made make point | [
4707,
5251,
6502,
8582,
205,
3350,
479
] | Test |
8,559 | 1 | ObjectDatabase++:objectdatabase++ objectdatabase++ odbpp embeddable object-oriented database designed server applications require minimal external maintenance written c++ real-time isam level database ability auto recover system crashes maintaining database integrity unique transaction process allows maintenance indexes tables preventing double allocation index entries could prohibit rollback transactions features odbpp include full multi-process multi-thread transaction control auto real-time database recovery hierarchical object data design native code script access static hash index object ids numerous supported index methods including full-text biometric pattern matching odbpp supports objects hierarchical design similar xml json serialized php hierarchical object separates object databases relational cousins process keeping entire object one record rather spreading multiple tables give object databases distinction relational model traditionally databases designed relational model would separate data several tables use common identifier relate child records back parent model based row within table containing individual pieces data sql databases based design would create joins would reconnect entire relation back together suffering performance limitations object database design instead using multiple tables store data object stored one single record keeps entire object intact reducing need join data back together process storing entire object one table reduces total amount lock reads write operations required also ability store object one record reduce amount file reads writes enables object design maintain efficiency large complex database designs looking images right depicts relational model data spread two tables parent amber children blue object model parent children stored one data record information previously stored within related table stored within sub nested table foo odbpp implements transaction control allows process continue another terminated unique transaction control allows continuing process identify terminated transaction recover database integrity continue mid transaction ability terminate transaction point enables real-time transactions implementation server using method transaction control utilizes four separate file implement entire process flushed change state drive continuing next state creates time consuming process individual write file three separate states entire transaction required pass three separate files initially adds edit deletes written shared memory file enables transaction know resource index value allocated memory file destroy os starts without interfering database integrity used ipc purposes transaction call commit transaction method database bulk work writes entire transaction memory file log file done three stages process first identify changes needed flushed plans rear file written drive header updated indicate presences update secondly file updated finally header modified finalized update state process ensure consistency file always valid process ceases first stage file simply truncated file returned original state transaction ceases second stage next transaction opens file identifies saved plans re-executes saved instructions four files updated manner transaction starts memory file written one update log file transaction protection transaction secured log file odbms able update index table files entire commit process executed concurrently multiple transactions committing simultaneously greatly benefited using solid-state drive although process caching entire transaction memory file committing drive end help reduce entire transaction time comparable non-flushing dbms contrary earlier object database models isam level database odbpp supports large variety indexes initial development object model basic design use schema contained serialized binary object referred id provided index access prevented basic search labels done due fact underlining architecture still based related model since odbpp always designed object model understands hierarchical nature objects capable indexing data contained within objects within database referenced object identifier managed via static hash index static hash index simply array index location containing address object deduced taking id value multiplying 12 adding offset value reveals location physical address object method translating id physical address enables true order one 1 retrieval data regardless many objects stored within database imposing static index table schemata allows real-time compaction file object locks index object allows even locked objects moved within file transactions require space deleting objects file ability move objects within file time also imposes need access via index sql databases may scan records scanning file beginning end real-time compaction prohibits style access b+ tree index primary workhorse databases odbpp exception majority searches carried via seeking index position repetitively call next largest value odbpp supports large number filters b+ tree make results usable example set convert lower case characters upper case set removal white spaces non-alphanumerical characters also provide natural sort order 9 '10 one features odbpp standard dbms data stored within hierarchical object also indexed create situation 0…n index values created one object spatial indexes used allow searching two- three-dimensional coordinates spaces temporal indexes similar idea along one dimensional time odbpp also supports sets spatial data represent key points two three dimension objects finger print human faces sets indexed via spatial index allow group searching search create temporary index many objects least search pattern points within given error odbpp provides full text indexing via token list indexes indexes combination b+ tree bucket overflow text string broken individual tokens indexed b+ tree since multiple object token value id stored bucket overflow similar dynamic hashing design full text searches done scanning tokens b+ tree leaves identifying tokens fit search criteria retrieving matching ids full text search query also provide set logic functions reduce search results number usable allow user search objects contain token token b example odbpp designed function procedural style encapsulated object c++ style although object style still uses procedural method interface database low level example procedural method demonstrated equivalent tscript example reading object database name fooname follows objectdatabase++ also exposed via com wrapper class 'odbpplib.odbpp equivalent c example reading object database name fooname follows | [
8644,
9828,
8201,
8393,
10413,
7983,
823,
6398,
479
] | None |
8,560 | 4 | Cyber_sovereignty:cyber sovereignty cyber sovereignty phrase used field internet governance describe governments desire exercise control internet within borders including political economic cultural technological activities 2015 book data goliath american security expert bruce schneier says cyber sovereignty movement countries russia china france saudi arabia given enormous boost 2013 revelations widespread international nsa surveillance countries pointed justification activities evidence u.s. hypocrisy internet freedom issues | [
1315,
7893
] | Test |
8,561 | 3 | Sound_Blaster:sound blaster sound blaster family sound cards de facto standard consumer audio ibm pc compatible system platform widespread transition microsoft windows 95 standardized programming interface application level eliminating importance backward compatibility sound blaster evolution pc design led onboard audio electronics commoditized pc audio functionality 1995 sound blaster cards sold 15 million units worldwide accounted seven ten sound card sales creator sound blaster singapore-based firm creative technology limited also known name united states subsidiary creative labs history creative sound cards started release creative music system c/ms ct-1300 board august 1987 contained two philips saa1099 circuits together provided 12 channels square-wave bee-in-a-box stereo sound 4 channels used noise circuits featured earlier various popular electronics magazines around world many years creative tended use off-the-shelf components manufacturers reference designs early products various integrated circuits white black paper stickers fully covering top thus hiding identity c/ms board particular philips chips white pieces paper fantasy cms-301 inscription real creative parts usually consistent ct number references surprisingly board also contained large 40-pin dip integrated circuit bearing ct 1302a ctpl 8708 creative technology programmable logic serigraphed inscription looking exactly like dsp later sound blaster chip allows software automatically detect card certain register reads writes year later 1988 creative marketed c/ms via radio shack name game blaster card identical every way precursor c/ms hardware whereas c/ms package came five floppy disks full utilities song files creative supplied single floppy basic utilities game patches allow sierra online games using sierra creative interpreter engine play music card also included later revision game silpheed added c/ms support 2017 hobbyists developed clone ct1300 pcb sound blaster 1.0 code named killer kard ct1320a released 1989 addition game blaster features 11-voice fm synthesizer using yamaha ym3812 chip also known opl2 provided perfect compatibility market leader adlib sound card gained support pc games preceding year creative used dsp acronym designate digital audio part sound blaster actually stood digital sound processor rather common digital signal processor really simple micro-controller intel mcs-51 family supplied intel matra mhs among others could play back 8-bit monaural sampled sound 23 khz sampling frequency record 8-bit 12 khz sole dsp-like features circuit adpcm decompression primitive non-mpu-401 compatible midi interface adpcm decompression schemes supported 2 1 3 1 4 1 ct1320b variety sound blaster 1.0 typically c/ms chips installed sockets rather soldered pcb though units exist c/ms chips soldered sources note original sound blaster 1.0 produced ct1310 number however topic ongoing debate creative refers ct1310 sound blaster 1.0 website spite limitations less year sound blaster became top-selling expansion card pc achieved providing fully adlib-compatible product additional features often lower price inclusion game port importance early success often forgotten overlooked pcs era include game port game port cards costly around 50 used one expansion slots pcs time given choice adlib card fully compatible sound blaster card came game port saved slot included dsp much price many consumers opted sound blaster in-game support digital portion card happen sound blaster gained dominance microsoft announced multimedia pc mpc november 1990 suggested developers use sound blaster sound card came close complying mpc standard press speculated microsoft based mpc standard sound blaster specifications 1993 computer gaming world wondered would gamer buy competing adlib card sound blaster-compatible creative advertised sound blaster 16 16-bit sound standard slogan get real emphasizing real 100 sound blaster compatibility rhetorically asking manufacturers spend much time comparing sound blaster compute 1989 stated sound blaster ibm-compatible computers taken lead sound music personal computers naming compute choice magazine described quality opening music space quest iii card extraordinary praising quality compared roland mt-32 ad lib versions compute approved card dma creative dissemination technical information concluded more-expensive mt-32 superior sound blaster audio quality better ad lib game blaster released 1990 sound blaster 1.5 ct1320c dropped c/ms chips longer popular game developers instead board two empty sockets could user upgraded purchasing c/ms chips directly creative phillips saa-1099s another source otherwise card functions identically sound blaster 1.0 ct1320u variety layout ct1320c final revision original sound blaster sound blaster 2.0 released october 1991 ct1350 added support auto-init dma assisted producing continuous loop double-buffered sound output similar version 1.0 1.5 used 1-channel 8-bit dac however maximum sampling rate increased 44 khz playback 15 khz record dsp midi uart upgraded full-duplex offered time stamping features yet compatible mpu-401 interface used professional midi equipment sound blaster 2.0 pcb-layout used highly integrated components shrinking board size reducing manufacturing cost owners previous revision sound blaster boards could upgrade board purchasing v2.00 dsp chip creative labs swapping older dsp v1.0x newer replacement upgraded board gained auto-init dma new midi capabilities sound blaster 2.0 expanded sampling rates upgrade necessary full compatibility windows 3.0 multimedia extensions upgrade sound blaster mcv ct5320 version created ibm ps/2 model 50 higher isa-incompatible micro channel architecture bus mcv soundblaster issues outputting audio running ps/2s cpus running faster 16 mhz however joystick interface still inoperable ps/2s designed due slow-speed schottky chips installed none timing issues affect yamaha ym3812 mcv soundblasters released faster schottkys eradicated problems model ct1330 announced may 1991 first significant redesign card core features complied microsoft mpc standard.. sound blaster pro supported faster digital input output sampling rates 22.05 khz stereo 44.1 khz mono added mixer provide crude master volume control independent volume sound sources feeding mixer crude high pass low pass filter sound blaster pro used pair ym3812 chips provide stereo music-synthesis one channel sound blaster pro fully backward compatible original sound blaster line extension adlib sound card sound blaster pro first creative sound card built-in cd-rom interface sound blaster pro cards featured proprietary interface panasonic matsushita mke drive sound blaster pro cards basically 8-bit isa cards use lower 8 data bits isa bus first glance appears 16-bit isa card 'fingers data transfer higher portion bus connector uses 16-bit extension isa bus provide user additional choice irq 10 dma 0 channel found 16-bit portion edge connector short lived joint developed project creative tandy resulted creative/tandy multimedia sound adapter 849-3030 sound blaster pro derived card factory installed tandy multimedia pcs combined ct1330 tandy joystick midi ports mpu-401 compatible revised version sound blaster pro 2 ct1600 replaced ym3812s advanced yamaha ymf262 opl3 otherwise functionally identical original sound blaster pro shortly release sound blaster pro 2 version creative discontinued original sound blaster pro sound blaster pro 2 also sold following on-board cd-rom controllers packaged sound blaster cards initially marketed sold retail-channel creative domination pc audiocard business soon selling sound blaster pro 2 oem ct1680 customers integration pre-assembled pcs creative also sold multimedia upgrade kits containing sound blaster pro kit bundled sound card matsushita cd-rom drive model 531 single-speed 562/3 later double-speed 2x drives several cd-roms multimedia software titles cd-rom technology new kit included cd-rom software representing good value customers one kit named omnicd included 2x matsushita drive along isa controller card software including software toolworks encyclopedia aldus photostyler se compliant mpc level 2 standard sound blaster pro 2 mcv ct5330 version created ibm ps/2 model 50 higher microchannel bus next model sound blaster 16 announced june 1992 introduced sound blaster 16 retained yamaha opl-3 fm synthesis backward compatible programming interface software titles written older sound blasters sound blaster pros would run without modification eventually design proved popular creative made pci version card creative audio revenue grew us 40 million per year nearly us 1 billion following launch sound blaster 16 related products rich sorkin general manager global business time responsible product planning product management marketing oem sales moving card isa bus already approaching obsolescence meant line host-controlled isa dma available pci slot offers line instead card used pci bus mastering transfer data main memory d/a converters since existing dos programs expected able initiate host-controlled isa dma producing sound backward compatibility older sound blaster cards dos programs required software driver work-around since work-around necessarily depended virtual 8086 mode pc cpu order catch reroute accesses isa dma controller card failed number dos games either fully compatible cpu mode needed much free conventional memory could loaded driver occupying part memory microsoft windows problem creative windows driver software could handle isa pci cards correctly sound blaster vibra16 inexpensive single-chip implementation sound blaster 16 oem market creative labs also used chip sound blaster 32 phone blaster phone blaster 28.8 vibra modem ct3120 ct3220 many value-edition cards external yamaha opl3 fm music synthesis retained earlier boards built around vibra16 vibra16s controllers whilst later common vibra16 boards used cqm creative quadratic modulation developed e-mu systems series included vibra16 ct2501 vibra16s ct2502 ct2504 vibra16c ct2505 pnp vibra16xv ct2511 chips primary advantage vibra16 inclusion 14.4 kbit/s telephony modem also functioned telephone released march 1994 sound blaster awe32 advanced waveffects introduced new midi synthesizer section based emu8000 awe32 consisted two distinct audio sections creative digital audio section audio codec optional csp/asp chip socket yamaha opl3 e-mu midi synthesizer section synthesizer section consisted emu8000 sampler effects processor emu8011 1 mb sample rom 512 kb sample ram expandable 28 mb fit new hardware awe32 full-length isa card measuring derivative awe32 design sound blaster 32 sb32 value-oriented offering creative announced june 6 1995 sb32 became new entry-level card awe32 product-line previously held awe32 value sb32 retained awe32 emu8000/emu8011 midi-synthesis engine built-in instrument rom dropped onboard ram wave blaster header csp port sb32 used vibra chip reduce component count meant bass/treble/gain control limited compared awe32 loss onboard ram offset inclusion 30-pin simm ram sockets allow 28 mb ram installed used emu engine awe32 successor sound blaster awe64 november 1996 significantly smaller half-length isa card term misleading — see pictures size comparison offered similar features awe32 also notable improvements including support greater polyphony although product 32 extra software-emulated channels 30-pin simm slots awe32/sb32 replaced proprietary memory format could expensively purchased creative main improvements better compatibility older sb models improved signal-to-noise ratio awe64 came two versions standard version later rebranded value 512kb ram gold version 4 mb ram separate s/pdif output 1998 creative acquired ensoniq corporation manufacturer audiopci card popular oems time full-featured solution wavetable midi sample-based synthesizer 4-speaker directsound3d surround sound a3d emulation dos legacy support via tsr program cheap due lack hardware acceleration full-duplex least ms windows play back several sources creative released many cards using original audiopci chip ensoniq es1370 several boards using revised versions chip es1371 es1373 creative-labeled audiopci chips boards using audiopci tech usually easily identifiable board design chip size look quite similar boards include sound blaster pci64 april 1998 pci128 july 1998 creative ensoniq audiopci vibra pci sound blaster 16 pci es137x chip contains 3 stereo sample rate converters buffers pci busmaster interface analogue interfacing done codec chip runs fixed sampling frequency 44 ensoniq audio pci 48 khz creative versions isa soundcards resampled switched different time bases es137x support soundfonts filter-less midi engine wavetable sample table sets 2 4 8mb size sound blaster live introduced august 1998 use programmable digital signal processor pc-audio unprecedented ibm already done cheap mwave sound- modem-cards turtle beach professional hurricane soundcards live built around creative new emu10k1 chip contained 2.44 million transistors advertised processing flashy 1,000 mips emu10k1 successors use on-card ram/rom storage instrument samples instead used pci busmaster interface access sample-data stored host-pc system memory a/d- d/a- converters well analogue mixing done ac'97 chip running 48 khz sampling rate members sb live family least four-channel analog audio outputs 15-pin midi/joystick multiport game titles eax 1.0 later 2.0 environmental audio extensions briefly competed defunct a3d 2.0 added hardware-accelerated acoustic effects emu10k1 provided high-quality 64-voice sample-based synthesizer a.k.a wavetable self-produced third-party customized patches soundfonts ability resample audio output input apply range real-time dsp effects set audio subchannels present device first model flagship sb/live family sb live gold featuring gold tracings major analog traces external sockets emi-suppressing printed circuit board substrate lacquer gold came standard daughterboard implemented separate 4-channel alternative mini-din digital output creative-branded internal-dac speaker sets s/p-dif digital audio input output separate software mappings fully decoded midi interface separate input output along mini-din converter gold highlighted many features aimed music composition ease-of-use plug-and-play musicians realtime loopback-recording midi-synthesizer full freedom soundfonts environmental effects reverb etc bundled midi-software mainstream model sound blaster live like gold live featured multi-speaker analog output four channels identical music/sound generation capabilities without bundled midi software interfacing-equipment later versions live usually called live 5.1 offered 5.1-channel support adds center channel speaker lfe subwoofer output useful movie watching live 5.1 could also use one 3.5 mm jack ports spdif allowed connection external decoder creative also released soundblaster live player 1024 edition identical regular soundblaster live addition extra software sound blaster pci 512 ct4790 emu10k1-based sound card designed fill lower cost segment live value capable live value features aside limited 512 midi voice polyphony software-based limitation lacking digital i/o removal expansion headers stereo quadraphonic output support card circuit layout somewhat simpler live series sound blaster audigy august 2001 featured audigy processor emu10k2 improved version emu10k1 processor shipped sound blaster live audigy could process four eax environments simultaneously upgraded on-chip dsp native eax 3.0 advanced hd support supported 5.1-channel output audigy controversially advertised 24-bit sound card emu10k2 audio transport dma engine fixed 16-bit sample precision 48 khz like emu10k1 original live audio resampled 48 khz order accepted dsp recording rendering output sound blaster audigy 2 september 2002 featured updated emu10k2 processor sometimes referred emu10k2.5 improved dma engine capable 24-bit precision 192 khz supported stereo playback/record 6.1 capped 96 khz addition audigy 2 supported 6.1 later 7.1 speakers improved signal-to-noise ratio snr audigy 106 vs. 100 decibels also featured built-in dolby digital ex 6.1 7.1 decoding improved dvd play-back audigy 2 line first sound cards receive thx certification sound blaster audigy 2 zs september 2003 essentially audigy 2 updated dac op-amps audigy 2 zs uses cirrus logic cs4382 dac together op-amps produce output snr 108 db slight printed circuit board modifications 7.1 audio support added sound blaster audigy 4 pro november 2004 audigy 2 zs updated dacs adcs new dac cirrus logic cs4398 boosting output snr 113 db breakout box distinguishable difference audigy 2 zs dsp identical audigy 2 zs creative put audigy 4 sticker cover chip making appear new chip audigy 4 pro confused audigy 4 value contains lower quality dacs golden plated jacks audigy 4 value line audigy 2 value series audigy 4 shorter life span predecessors due short window next-generation sound blaster x-fi sound blaster audigy rx september 2013 similar audigy 4 pro dedicated 600-ohm headphone amplifier pcie 1x interface sound blaster audigy fx september 2013 also features 600-ohm amplifier pcie interface lacks emu10k dsp x-fi extreme fidelity released august 2005 came xtremegamer titanium titanium fatal1ty professional titanium fatal1ty champion elite pro configurations 130 nm emu20k1 emu20k2 titanium series models audio chip operates 400 mhz 51 million transistors computational power processor i.e performance estimated 10,000 mips 24 times higher estimated performance predecessor audigy processor beginning 2008 titanium models newer x-fi cards switched pci pci express x1 connectors x-fi active modal architecture ama user choose one three optimization modes gaming entertainment creation enabling combination features chipset x-fi uses eax 5.0 supports 128 3d-positioned voices four effects applied release also included 24-bit crystallizer intended pronounce percussion elements placing emphasis low high pitched parts sound x-fi release offered powerful mixing capabilities available making powerful entry-level card home musicians big improvement x-fi previous audigy designs complete overhaul resampling engine card previous audigy cards dsps locked 48/16 meaning content match resampled card hardware done poorly resulted lot intermodulation distortion many hardcore users worked around means resampling content using high quality software decoders usually form plugin media player creative completely re-wrote resampling method used x-fi dedicated half power dsp process resulting clean resample recon3d series announced september 2011 includes recon3d pcie recon3d fatal1ty professional recon3d fatal1ty champion cards use new integrated sound core3d chip features quartet dsp x-fi series well integrated dac adc i/o interface 56-pin package asia-only recon3d professional audio basically recon3d pcie extra accessories cables recon3d series sound cards support asio recon3d comes bundled software called sbx pro studio sbx pro studio allows users adjust amount virtual surround crystallizer bass smart volume dialog plus recon3d sound cards recon3d also got crystal voice feature reduces pickup background noises like hairdryer vacuum cleaner beamforming microphone used reviews generally positive pricing small model differences raised questions especially low mid priced models recon3d pcie recon3d fatal1ty professional cosmetic differences considerable price difference fatal1ty professional adds beamforming microphone red led lights metal shroud board real hardware improvements sound blaster z-series announced august 2012 includes pci express x1 cards z zx zxr use sound core3d chip previous sound blaster recon3d series z-series improved sound quality recon3d series including dedicated audio hardware op-amps dacs adcs sound blasterx ae-5 announced june 2017 first discrete sound card made creative five years since introduction z-series card first sound blaster series use 32-bit/384 khz sabre 32 ultra dac es9016k2m along custom-designed discrete headphone amplifier 1w output power low output impedance 1 ohm provide high damping factor virtually dynamic headphone card additional rgb lighting courtesy molex power connection accompanying rgb led strip late 2017 white colored model sound card called sound blasterx ae-5 pure edition released 4 rgb led strips instead one standard black model sound blaster ae-7 released july 2019 alongside sound blaster ae-9.it equipped ess sabre 9018 dac features acm audio control module connects sound card via two audio ports available card n't feature rgb lighting contrary ae-5 n't require external power either sound blaster ae-9 announced december 2018 targeting audiophile audience soundcard equipped ess sabre 9038 dac features external audio control module connects sound card mini-hdmi cable containing xlr port microphone toggleable 48 volt phantom power rail sound card features replaceable operational amplifiers sound card external dac consumes 75w thus first sound card creative requires auxiliary power using 6-pin pci-e connector supply power external dac card officially released july 10 2019 celebrate 30 years since introduction original sound blaster sound blasterx series announced gamescom 2015 sound blasterx brand consists usb audio devices gaming headsets gaming mousepads gaming speakers discrete sound card gaming mouse gaming keyboard sound blasterx h3 h5 p5 come blasterx acoustic engine lite software blasterx acoustic engine lite software comes preset audio profiles different game types settings profiles adjustable unlike blasterx acoustic engine pro blasterx acoustic engine lite software available windows pc blasterx acoustic engine pro allows users adjust amount effects save also scout mode voice fx users bind key combinations enable/disable blasterx acoustic engine scout mode voice fx also equalizer tab software users load profiles create profiles equalizer blasterx acoustic engine pro software available windows pc sound blasterx h3 sound blasterx h5 headsets 3.5mm audio jacks sound blasterx p5 earphone inline microphone come audio/mic splitter cable sound blasterx h3 h5 p5 come software called blasterx acoustic engine lite sound blasterx h7 gaming headset usb 3.5mm jack connectivity maximum playback bitrate sample rate 24-bit 96 khz supports 7.1 virtual surround sound blasterx h7 comes blasterx acoustic engine pro software unlike sound blaster e5 built-in microphones rechargeable battery bluetooth connectivity blasterx acoustic engine profiles saved onto device windows used mac computer mac os x software well android ios apps sound blasterx g5 sound blasterx g1 uses blasterx acoustic engine pro software like sound blasterx g5 got 4-pole headphones microphone audio port maximum playback bitrate sample rate 24-bit 96 khz supports 7.1 virtual surround headphones amplifier supports headphones impedances 16 ohms 300 ohms sound blasterx g1 sb-axx1 audio chip able save profiles blasterx acoustic engine device able save profiles x-plus configurator running x-plus mode x-plus configurator software available windows pc profiles x-plus configurator apply equalizer settings tuned certain games sound blasterx g1 support u hear sound blaster cards since 1999 conform microsoft pc 99 standard color-coding external connectors follows awe line 1994 creative cards short text inscriptions backplane card indicating port i.e mic spk aux aux later cards text inscriptions changed icons latest cards creative cards changed use numbers ports flexi-jacks different functions assigned run-time i.e changed speaker output mic color overlay sticker included retail units help consumers identify commonly used functions ports default modes lot audio/data pin connectors jumpers-setting present internal body sound blaster different card card along years productions common pin connector common pin jumper setting especially plug-and-play features drivers audigy 2 zs soft-modded enthusiasts installed creative older cards including sound blaster live audigy audigy 2 claimed offer improved sound quality hardware acceleration higher eax versions games 64-channel mixing audigy 1 overall improvement card performance several forum posts across web reported favorable results technique excepting live users drivers add ability use newer software applications i.e newer mixer applet comments forums developers software mod said live hardware capable eax3 64-channels hardware sound mixing later 2004 creative released updated drivers top-to-bottom audigy audigy 4 line put cards basically feature parity software level 2006 entire audigy lineup uses driver package dsp decoding driver level cards audigy 2 zs 4 still supported official drivers works soft-modded drivers cards hardware dsp like audigy 2 6.1 windows vista released single beta driver creative audigy series usable operating system minimal functionality frequent instability reported users creative forum activist named daniel k. modified drivers x-fi applied audigy live series restoring features came original xp setup cd vista x-fi drivers noticeably better sound quality vista bug fixes newer build last modified version 2.15.0004eq april managed enable x-fi crystallizer work audigy series cards software however patents involved forced remove modified drivers dll patch creative released newer official audigy vista driver 2.18.0000 28 july 2008 due public consumer pressure however form agreement creative daniel k achieved returned creative forums posting updated versions modified drivers released final version modded driver package january 12 2012 recent linux distributions support sound blaster cards via kernel drivers case non-plug-and-play isa cards configuration file /etc/modules must reconfigured writing example sound blaster 16 card installed snd-sb16 isapnp=0 x-fi series cards basic support linux however advanced features like signal routing relay control external i/o consoles supported support newer sound blaster cards z ae series added kernel 4.19-4.20 release timeframe | [
5377,
10369,
10371,
6150,
6797,
8080,
5009,
5265,
9363,
10360,
4641,
683,
10363,
2861,
9525,
6971,
2368,
5702,
9799,
6730,
4047,
4699,
10076,
1501,
6510,
6129,
8945,
10359,
5368,
3323
] | Test |
8,562 | 0 | Johanna_Moore:johanna moore johanna doris moore computational linguist cognitive scientist research publications include contributions natural language generation spoken dialogue systems computational models discourse intelligent tutoring training systems human-computer interaction user modeling knowledge representation received b.s mathematics computer science summa cum laude 1980 m.s computer science 1982 ph.d advisors william swartout gerald estrin 1989 ucla moore held posts ucla 1976–1986 usc information sciences institute 1983–1989 university pittsburgh 1990–1998 since 1998 held chair artificial intelligence within school informatics university edinburgh served director human communication research centre co-director institute language cognition computation 2014-2018 head school informatics succeeded role professor jane hillston moore elected ucla chapter phi beta kappa 1980 held office naval research fellowship 1982 1985 ibm fellow 1985 1987 held national science foundation national young investigator award 1994 1999 chair cognitive science society president association computational linguistics 2004 fellow british computer society 2003 elected fellow royal society edinburgh moore carrying research project june 2015 may 2016 connected digital economy | [
1890,
2440,
7724,
4916,
1783
] | Validation |
8,563 | 4 | Japan_Vulnerability_Notes:japan vulnerability notes japan vulnerability notes jvn japan national vulnerability database maintained japan computer emergency response team coordination center japanese government information-technology promotion agency | [
2558,
2446
] | Train |
8,564 | 4 | Special_Communications_Service_of_Russia:special communications service russia special communications information service federal protective service russian federation spetssvyaz spetssviaz cryptologic intelligence agency federal protective service russia responsible collection analysis foreign communications foreign signals intelligence well protecting russian government communications information systems involves information security cryptanalysis/cryptography service established march 11 2003 successor fapsi created 8th main directorate government communications 16th directorate electronic intelligence kgb september 25 1991 following august coup soviet president mikhail gorbachev dismantled kgb several independent departments one became committee government communications president soviet union december 24 1991 disbanding soviet union organization became federal agency government communications information president russian federation march 11 2003 agency reorganized service special communications information spetssviaz federal security service fsb august 7 2004 spetssviaz incorporated structural sub unit federal protective service fso service created result reform march 11 2003 basis federal agency government communications information fapsi initially special communication service fso according direction regulations service special communications information federal service russian federation service special communication information special communication russia federal special communication information exercising powers within organization provision service security development improving governmental systems kinds special links information gathering federal government agencies public authorities russian federation state bodies august 7 2004 vladimir putin signed decree federal service russian federation according decree service become part fso 16th centre “ military unit 71330 ” inherited fapsi fsb ’ main structural unit signals intelligence consists central unit housed unmarked administrative buildings many different locations across moscow secluded forest enclosures satellite dishes several metres diameter facing different directions located mainly along russia ’ borders signals intelligence facilities also referred information reception centres direct reference main function 16th centre ’ signals intelligence facilities closest estonia krasnoye selo lenin-grad oblast verbnoye kaliningrad oblast neyolovo pskov oblast last one 25 kilometres estonian border 2003 2010 spetssviaz director yuri korneev director special communications service deputy director russian federal protective service | [
6344,
4937,
7887,
1169,
11089,
4595,
1941,
7893,
10935,
5373
] | Validation |
8,565 | 0 | Coh-Metrix:coh-metrix coh-metrix computational tool produces indices linguistic discourse representations text developed arthur c. graesser danielle mcnamara coh-metrix calculates coherence texts many different measures coh-metrix used many different ways investigate cohesion explicit text coherence mental representation text definition cohesion consists characteristics explicit text play role helping reader mentally connect ideas text graesser mcnamara louwerse 2003 definition coherence subject much debate theoretically coherence text defined interaction linguistic representations knowledge representations coherence defined characteristics text i.e. aspects cohesion likely contribute coherence mental representation coh-metrix measurements provide indices cohesion characteristics according empirical study coh-metrix l2 reading index performs significantly better traditional readability formulas | [
1890,
2562
] | Test |
8,566 | 7 | SmartBear_Software:smartbear software smartbear software privately-held information technology company delivers tools application performance monitoring apm software development software testing api management company based assembly square somerville greater boston area current smartbear company founded 2009 original smart bear company founded jason cohen 2003 current smartbear software result insight venture partners acquiring three companies smart bear automatedqa pragmatic software 2007 early 2009 companies operated aqa holdings rebranded smartbear software 2010 rebranding company acquired eviware 2011 leading api promoter soapui founder ole lensmar joining company later served chief technology officer cto smartbear year company acquired apm vendor alertsite 2013 smartbear acquired spanish apm vendor lucierna smartbear acquired open source community swagger 2015 founder tony tam joined company head products swagger commercial version swagger swaggerhub 2016 smartbear acquired crossbrowsertesting.com cbt ken hamric founder cbt joined company general manager crossbrowsertesting.com 2017 francisco partners acquired majority stake smartbear software smartbear based greater boston area u.s. offices texas tennessee florida smartbear also offices development centers ireland sweden smartbear current ceo justin teague smartbear software offers 16 commercial products following categories api readiness software testing monitoring code collaboration code optimization two open-source tools soapui swagger api readiness smartbear products include soapui pro api functional testing secure pro api security testing loadui pro api load testing swaggerhub swagger-based api editor smartbear software testing tools include testcomplete automated testing loadcomplete load testing testleft functional testing crossbrowsertesting cloud testing platform monitoring alertsite smartbear application quality performance monitoring tool code collaboration code optimization smartbear offers collaborator code review document review tool aqtime pro performance profiling | [
1657,
170,
6507,
1740
] | None |
8,567 | 4 | Global_Telecoms_Exploitation:global telecoms exploitation global telecoms exploitation reportedly secret british telephonic mass surveillance programme run british signals intelligence computer security agency government communications headquarters gchq existence revealed along sister programme mastering internet june 2013 part global surveillance disclosures former national security agency contractor edward snowden | [
3495,
7887,
1169,
4595,
7893,
8156,
2558
] | None |
8,568 | 4 | Cyveillance:cyveillance 2015 cyveillance acquired lookingglass cyber solutions following information date december 2015 cyveillance company involved cyber intelligence industry cyveillance uses proprietary technology platform human analysts identify risks early prevention mitigation cyveillance founded 1997 based reston virginia united states company ’ subscription-based product cyveillance intelligence center hosted solution companies hire cyveillance monitor internet risks information leaks phishing malware attacks online fraud schemes sale stolen credit debit card numbers threats executives events counterfeiting trademark brand abuse united states secret service contracts cyveillance search available information related secret service missions information obtained cyveillance incorporated protective research information management system prism surveillance program existing secret service system cyveillance bought may 2009 uk firm qinetiq initial cash consideration 40 million current management also entitled additional 40 million anniversary closing dependent hitting certain performance numbers cyveillance clients include firms financial services energy technology retail pharmaceutical industries cyveillance provides open source internet intelligence 400 clients including half fortune 100 cyveillance founded 1997 brandy thomas christopher young mark bildner jason thomas originally called online monitoring services renamed 1998 cyveillance 1997 2009 cyveillance privately held qinetiq north america provider information technology engineering solutions u.s. government acquired cyveillance may 2009 2013 qinetiq north america expanded cyveillance management team appointment technical marketing executives qinetiq senior management cyveillance management team numerous websites complained cyveillance traffic following reasons 2 july 2014 cyveillance sent dmca takedown notice github behalf qualcomm caused 116 files repositories blocked github blocked repositories owned cyanogenmod sony mobile even one qualcomms repositories leading speculation notices automatically generated poorly checked 5 july 2014 qualcomm retracted takedown notices apologized reviewing files | [
865,
9863,
6344,
6797,
113,
11221
] | Validation |
8,569 | 7 | Melomics109:melomics109 melomics109 computer cluster three cabinets customized front panels located universidad de málaga part spanish supercomputing network designed increase computational power provided iamus powered melomics technology composing module melomics109 able create synthesize music variety musical styles music made freely accessible everyone 0music first album composed interpreted melomics109 launched july 21 name melomics aims freely distributing melomics109 production formats album first one released audio mp3 editable format midi cc0 public domain licensing rest melomics109 production browsed listened downloaded free melomics | [
7983,
3647,
823
] | Test |
8,570 | 3 | Butasan:butasan player controls pig aim game blow pigs throwing bombs bombs randomly spawned across map picked thrown pigs bombs given number 5 30 bomb thrown takes number seconds explode bombs directly hit pigs explode contact various power ups available throughout game gas makes characters fall asleep bonus sub-game involves random pigs popping holes player must knock back hole pig similar mode gameplay whack-a-mole game released various home computer systems zx spectrum commodore 64 msx amstrad cpc u.s. gold psycho pigs u.x.b several criticisms sexism advert game showing semi-naked model holding video game case published specialized magazines | [
9006
] | None |
8,571 | 7 | Kaavo:kaavo kaavo cloud computing management company kaavo founded november 2007 u.s. kaavo pioneered top-down application-centric management cloud infrastructure across public private hybrid clouds traditional infrastructure associated management intrinsically ties applications servers servers ip addresses ip addresses switches routers tightly coupled model according experts leaves little room address dynamic nature virtual infrastructure often seen cloud computing models subject matter experts supporting kaavo approach claims cloud applications decoupled servers deployed network infrastructure supports delivers effectively managed unless recognized individual components infrastructure-as-a-service iaas delivers on-demand infrastructure resources however users still need deploy configure applications workloads iaas layer kaavo provides framework automate deployment run-time management production support applications workloads multiple clouds infrastructure-as-a-service layer kaavo claims bottom-up approach traditional data center management tools makes harder manage infrastructure especially dealing scale distributed nature cloud kaavo takes top-down application-centric approach deploying managing applications cloud application-centric cloud management approach systems specific applications managed rather managing servers routers required resources given application managed unified system information deploying managing runtime services levels resources required given application captured top-down single system definition contrast infrastructure-centric bottom-up approach resources servers storage network resources managed individually one key innovations kaavo ability capture deployment run-time management behavior complex application workload single xml document kaavo system definition kaavo published xsd system definition file kaavo imod product uses patented technology based kaavo top-down application-centric management philosophy kaavo uses technology deliver two cloud management products delivered web based product hosted amazon ec2 integrated following public cloud providers amazon ec2 ibm smartcloud logicworks infinicloud rackspace cloud terremark cloud integrated following private cloud platforms cloud.com cloudstack eucalyptus ibm smartcloud openstack vmware vcloud director imod supports multiple cloud providers platforms across application workload service deployments well within single deployment imod also include on-premises physical resources within deployments onsite deployment available enterprise customers within private clouds supports imod saas capabilities api configuring managing applications supported cloud providers platforms kaavo web services use document/literal wrapped style soap compared server-level api provided iaas cloud providers platforms provides higher level abstraction managing systems configuring software web services api allows users deploy applications/workloads across public private hybrid clouds single web services call also provides interface trigger complex workflows response deployment-specific events following registered trademarks kaavo | [
8592,
6153,
4194,
10893
] | Validation |
8,572 | 4 | GoBack:goback norton goback previously wildfile goback adaptec goback roxio goback disk utility microsoft windows record 8 gb disk changes filesystem idle seconds marks safe points product allows disk drive restored point within available history also allows older versions files restored previous versions whole disk browsed depending disk activity typical history might cover hours days goback replaces master boot record also replaces partition table single partition allows hard drive changed back even event operating system unable boot also protecting filesystem alteration revert information remains correct goback compatible hardware raid drives due changes made partition table cause problems dual booting operating systems hard disk possible retain dual-boot compatibility involve saving partition table enabling goback enabling goback re-writing partition table back disk booting different device live cd may also necessary disable goback prior using certain low level disk utilities formatting software low level utilities first check presence goback combination goback cause data become corrupted another example incompatible program windows version true image windows goback also incompatible products drive vaccine pc restore rollback rx products require access master boot record | [
5512,
6797,
2193,
7955,
10903,
6297,
925,
5924,
1708,
7983,
8368,
2870,
2744,
11065,
11256,
2107,
3520,
2378,
8398,
7380,
9569,
6643,
10872,
1150,
9983
] | None |
8,573 | 2 | Zram:zram zram formerly called compcache linux kernel module creating compressed block device ram i.e ram disk on-the-fly disk compression block device created zram used swap general-purpose ram disk two common uses zram storage temporary files /tmp swap disk initially zram latter function hence original name compcache compressed cache four years linux driver staging area zram introduced mainline linux kernel version 3.14 released march 30 2014 linux kernel version 3.15 onwards released june 8 2014 zram supports multiple compression streams multiple compression algorithms compression algorithms include lz4 lzo default lz4 faster compressing/decompressing compress quite efficiently lzο like system parameters compression algorithm selected via sysfs used compressed swap space zram similar zswap general-purpose ram disk rather in-kernel compressed cache swap pages however unlike zswap zram use hard disk backing store currently possible see patch config_zram_writeback i.e move less-frequently used pages disk hand zswap requires backing store zram used swap zram like zswap also allows linux make efficient use ram since operating system hold pages memory compressed swap amount ram used application memory disk cache particularly effective machines much memory 2012 ubuntu briefly considered enabling zram default computers small amounts installed ram compressed swap space zram/zswap also offers advantages low-end hardware devices embedded devices netbooks devices usually use flash-based storage limited lifespan due write amplification also use provide swap space reduction swap usage result using zram effectively reduces amount wear placed flash-based storage resulting prolonging usable life also using zram results significantly reduced i/o linux systems require swapping google chromeos uses zram default since 2013 android includes zram since version 4.4 lubuntu also started using zram version 13.10 | [
4616,
3082,
5139,
6675,
7187,
10776,
25,
10780,
541,
4637,
10785,
9762,
6180,
5158,
5681,
7217,
8242,
9266,
9784,
10809,
576,
2625,
4161,
8772,
6213,
6730,
8268,
589,
6221,
593,
86,
10333,
97,
6244,
5222,
2152,
10856,
8298,
4207,
7285,
... | None |
8,574 | 4 | Air_gap_(networking):air gap networking air gap air wall air gapping network security measure employed one computers ensure secure computer network physically isolated unsecured networks public internet unsecured local area network means computer network network interfaces connected networks physical conceptual air gap analogous air gap used plumbing maintain water quality air-gapped computer network one network interfaces either wired wireless connected outside networks many computers even plugged wired network wireless network interface controller wifi connected nearby wireless networks access internet update software represents security vulnerability air-gapped computers either wireless interface controller permanently disabled physically removed move data outside world air-gapped system necessary write data physical medium thumbdrive physically move computers physical access easier control electronic network interface attacked time exterior insecure system malware infects secure system used export secure data environments networks devices rated handle different levels classified information two disconnected devices networks referred low side high side low unclassified high referring classified classified higher level also occasionally referred red classified black unclassified access policies often based bell–lapadula confidentiality model data moved low-to-high minimal security measures high-to-low requires much stringent procedures ensure protection data higher level classification concept represents nearly maximum protection one network another save turning device way transfer data outside world air-gapped system copy data removable storage medium removable disk usb flash drive physically carry storage system access easily controlled upside network generally regarded closed system terms information signals emissions security unable accessed outside world downside transferring information outside world analyzed computers secure network extraordinarily labor-intensive often involving human security analysis prospective programs data entered onto air-gapped networks possibly even human manual re-entry data following security analysis sophisticated computer viruses use cyberwarfare stuxnet agent.btz designed infect air-gapped systems exploiting security holes related handling removable media possibility using acoustic communication also demonstrated researchers researchers also demonstrated feasibility data exfiltration using fm frequency signals examples types networks systems may air gapped include many systems since added features connect public internet longer effectively air gapped including thermostats internet connections automobiles bluetooth wi-fi cellular phone connectivity limitations imposed devices used environments may include ban wireless connections secure network similar restrictions em leakage secure network use tempest faraday cage scientists 2013 demonstrated viability air gap malware designed defeat air gap isolation using acoustic signaling shortly network security researcher dragos ruiu badbios received press attention 2014 researchers introduced airhopper bifurcated attack pattern showing feasibility data exfiltration isolated computer nearby mobile phone using fm frequency signals 2015 bitwhisper covert signaling channel air-gapped computers using thermal manipulations introduced bitwhisper supports bidirectional communication requires additional dedicated peripheral hardware later 2015 researchers introduced gsmem method exfiltrating data air-gapped computers cellular frequencies transmission generated standard internal bus renders computer small cellular transmitter antenna projectsauron malware discovered 2016 demonstrates infected usb device used remotely leak data air-gapped computer malware remained undetected 5 years relied hidden partitions usb drive visible windows transport channel air-gapped computer computer connected internet presumably way share files two systems nfcdrip name given discovery stealthy data exfiltration nfc near-field communication radio abuse signal detection 2018 although nfc enables devices establish effective communication bringing within centimeters researchers showed abused transmit information much longer range expected 100 meters general malware exploit various hardware combinations leak sensitive information air-gapped systems using air-gap covert channels hardware combinations use number different mediums bridge air-gap including acoustic light seismic magnetic thermal radio-frequency | [
5986,
3843,
6917,
8998,
7527,
10697,
939,
10968,
1970,
10867,
7127,
9688,
7739,
2426,
7515,
28,
1087,
2111
] | None |
8,575 | 4 | Tom_Cross_(computer_security):tom cross computer security tom cross also known decius american computer security expert hacker cross born 1976 toronto ontario canada grew tennessee father worked telecommunications policy mother registered nurse assistant attended brentwood high school brentwood tennessee attending georgia tech atlanta receiving bachelor degree computer engineering co-founded efga electronic frontiers georgia 1995 1996 co-founded computer sentry software known award-winning cyberangel software laptop anti-theft program 1999-2000 chief engineer dataway computer security firm san francisco 2000-2001 worked iasiaworks director global security engineering 2001 founded industrial memetics developed popular collaborative blogging community memestreams cross speaker several technology conferences including phreaknic summercon first international hackers conference seoul korea is2k internetworld singapore apricot asia-pacific regional internet conference operational technologies also among attendees first ever def con known extensive rant essays speeches technology policy also co-host episodes binary revolution cryptography expert | [
11576,
5579,
4956,
2558
] | Validation |
8,576 | 3 | Windows_IoT:windows iot windows iot formerly windows embedded family operating systems microsoft designed use embedded systems microsoft currently three different subfamilies operating systems embedded devices targeting wide market ranging small-footprint real-time devices point sale pos devices like kiosks windows embedded operating systems available original equipment manufacturers oems make available end users preloaded hardware addition volume license customers cases april 2018 microsoft released azure sphere another operating system designed iot applications running linux kernel mid-1998 microsoft worked venturcom company specialized software embedded systems windows nt embedded product windows nt embedded 4.0 got start 1998 small team developers microsoft project known within microsoft impala released 1999 windows nt embedded 4.0—a set tools database approximately 250 components allowed developers put together small windows nt 4.0 run-time images embedded devices tools allowed oems embedded developers create components encapsulating binaries add seamlessly windows nt embedded runtimes containing limited functionality devices minimum run-time images small 9 mb system featuring full win32 api shortly release early 2000 microsoft decided best take architecture make new product leveraging new windows code new windows embedded team formed leadership bruce beachman served product unit manager pum first windows embedded – started recruiting engineers within microsoft team set sights next version decision made stop development windows 2000 embedded start work windows xp embedded product called whistler plans drawn team expanded work started whistler embedded codenamed mantis component count risen 250 10,000—most device-driver components feature set embedded tools enriched include things like basic version control component scripting expandability tools also added make easier start blank slab hardware deploy embedded os quickly easily august 26 2001 beta 2 windows xp embedded released full release planned later year initial team consisted target designer component designer two-parts suite first version windows embedded suite first test team manager bombo sofa lead first xpe test team starting 2000 bruce beachman leadership microsoft shipped first version windows embedded xpe devcon windows hardware conference 2001 2002 bruce beachman left microsoft peter wilson took xpe team pum team merged windows deployment team released xpe sp1 devcon las vegas late 2003 microsoft rebranded windows embedded windows iot starting release embedded versions windows 10 windows 10 iot enterprise based windows 10 enterprise cbb/ltsc/ltsb/sac updated version embedded industry embedded standard plain unlabeled retail/thin client tablet small tablet versions available differing licensing windows 10 iot mobile based windows 10 mobile successor embedded handheld windows 10 iot mobile enterprise adds arm support multiple user profiles advanced lockdown capabilities otherwise identical normal mobile version windows 10 iot core considered successor windows embedded compact although maintains little compatibility optimized smaller lower-cost industry devices also provided free charge use devices like raspberry pi hobbyist use windows 10 iot core pro provides ability defer control updates licensed via distributors otherwise identical normal iot core version windows embedded compact previously known windows embedded ce windows ce version windows embedded small computers embedded systems including consumer electronics devices like set-top boxes video game consoles windows embedded compact modular real-time operating system specialized kernel run 1 mb memory comes platform builder tool used add modules installation image create custom installation depending device used windows embedded compact available arm mips superh x86 processor architectures microsoft made available specialized version windows embedded compact known windows mobile use mobile phones customized image windows embedded compact along specialized modules use mobile phones windows mobile available four variants windows mobile classic pocket pc windows mobile standard smartphones windows mobile professional pda/pocket pc phone edition windows mobile automotive communication/entertainment/information systems used automobiles modified versions windows mobile used portable media centers 2010 windows mobile replaced windows phone 7 also based windows embedded compact compatible previous products windows embedded compact 2013 real-time operating system runs arm x86 sh derivatives architectures included .net framework ui framework various open source drivers services 'modules windows embedded standard brand windows embedded operating systems designed provide enterprises device manufacturers freedom choose capabilities part industry devices intelligent system solutions intended build atms devices healthcare manufacturing industries creating industry-specific devices brand consists windows nt 4.0 embedded windows xp embedded windows embedded standard 2009 wes09 windows embedded standard 7 windows embedded 8 standard provides full win32 api windows embedded standard 2009 includes silverlight .net framework 3.5 internet explorer 7 windows media player 11 rdp 6.1 network access protection microsoft baseline security analyzer support managed windows server update services system center configuration manager windows embedded standard 7 based windows 7 previously codenamed windows embedded 'quebec windows embedded standard 7 includes windows vista windows 7 features aero superfetch readyboost windows firewall windows defender address space layout randomization windows presentation foundation silverlight 2 windows media center among several packages available ia-32 x64 versions released 2010 larger minimum footprint ~300 mb compared 40 mb xpe also requires product activation windows embedded standard 7 released april 27 2010 windows embedded 8 standard released march 20 2013 currently divided two brands fes products binary identical versions oses available retail licensed exclusively use embedded devices available ia-32 well x64 processors windows embedded pro formerly windows embedded enterprise brand consists non server fes products including windows nt workstation windows 2000 professional windows xp professional windows vista business ultimate windows 7 professional ultimate windows 8 pro windows 8.1 pro microsoft renamed windows embedded enterprise windows embedded pro starting windows embedded 8 pro windows embedded server brand consists fes server products including server home server sql server storage server dpm server isa server uag server tmg server unified data storage server etc various years including 2000 2003 2003 r2 2004 2005 2006 2007 2008 2008 r2 2012 2012 r2 etc windows embedded industry brand windows embedded operating systems industry devices point sale systems brand limited windows embedded point service operating system released 2006 based windows xp embedded microsoft also updated version windows embedded point service named windows embedded posready 2009 however windows embedded posready 7 based windows 7 sp1 released 2011 succeeded posready 2009 microsoft since changed name product windows embedded posready windows embedded industry microsoft released windows embedded 8 industry april 2013 followed 8.1 industry october 2013 windows embedded navready also called navigation ready plug-in component windows ce 5.0 useful building portable handheld navigation devices windows embedded automotive formerly microsoft auto windows ce automotive windows automotive windows mobile automotive embedded operating system based windows ce use computer systems automobiles latest release windows embedded automotive 7 announced october 19 2010 january 10 2011 microsoft announced windows embedded handheld 6.5 operating system compatibility windows mobile 6.5 presented enterprise handheld device targeting retailers delivery companies companies rely handheld computing windows embedded handheld retains backward compatibility legacy windows mobile applications windows embedded 8.1 handheld released manufacturing april 23 2014 known simply windows embedded 8 handheld we8h prior release designed next generation windows embedded handheld line-of-business handheld devices built windows phone 8.1 also compatibility five windows embedded 8.1 handheld devices released manufactured bluebird honeywell panasonic listed | [
516,
11283,
7713,
10273,
11301,
5673,
6697,
1581,
2605,
5176,
1083,
7234,
582,
1098,
8798,
10338,
8296,
5225,
8299,
7796,
6265,
8315,
636,
1148,
639,
641,
2179,
6787,
8326,
8328,
651,
6797,
10896,
2196,
9366,
154,
10921,
3250,
9910,
10957... | None |
8,577 | 2 | Nokia_N82:nokia n82 nokia n82 high-end smartphone produced nokia announced 14 november 2007 part company nseries line n82 runs symbian os v9.2 s60 3rd edition fp1 n82 inherits much nokia n95 features specifications including gps wi-fi hsdpa major addition xenon flash time n82 called many best camera phone market result sometimes called n95 successor people like n95 nokia n82 critically acclaimed often considered one best symbian devices although sell much available worldwide n82 also perhaps nokia last high-end device candybar form successors opted sliders later touchscreen devices nokia n82 model leaked may 2007 along nokia n81 made official six months later november introduced month nokia n95 8gb latest firmware nokia n82 v35.0.002 released december 2009 n86 8mp 2009 slider considered n82 spiritual successor due high-end camera technology despite lack xenon flash however similar top-of-the-line device candybar form never appeared nokia n82 nokia 6220 classic 2008 second nokia xenon flash n82 includes built-in accelerometer video stabilisation photo orientation keep landscape portrait shots oriented taken automatic 270 degree screen rotation compatible n-gage gaming platform 2.4-inch tft display features 332 mhz processor found n95 n82 almost identical specifications n95 leading called n95 candybar form apart xenon camera flash addition minor technologic differences models 128 mb ram 64 mb n95 8gb variant also 128 mb cif resolution 352x288 front camera qvga 320x240 microusb port rather miniusb removal infrared port first nokia phone xenon flash n82 5-megapixel camera carl zeiss optics considered best camera phone market arrival samsung gt-i8510 discussions head head comparisons two models demonstrate n86 8mp 2009 equipped dual led flash consistently capable outperforming n82 variable lighting primary advantage using led light source video recording whereas xenon flash stronger burst light used recording videos due technical composition mainland china market version n82 different hardware platform wi-fi umts radio removed 3g support different product code rm-314 opposed rm-313 firmware incompatible regular model version readily identified lack wlan scanning display idle screen | [
1537,
3205,
11655,
9359,
1424,
529,
2449,
8083,
10770,
5143,
2072,
7063,
5274,
5019,
5659,
669,
8472,
11545,
4003,
4132,
6310,
167,
40,
3626,
5290,
10410,
9262,
10802,
7220,
821,
5175,
7866,
1083,
1728,
7617,
4291,
7877,
10053,
199,
967,
... | Test |
8,578 | 3 | IBM_ThinkPad_380:ibm thinkpad 380 ibm thinkpad 380 notebook computer manufactured 1997 ibm part thinkpad laptop series notable incorporating cd-rom floppy drive considered mid-range laptop ibm time sold well 380 shipped windows 95 capable running windows 3.11 windows nt os/2 warp windows 98 windows red hat linux well various linux distributions originally two models base thinkpad 380 thinkpad 380d equipped cd-rom drive 380 came intel pentium processor running 150 mhz without optional mmx feature 16 mb base ram included base hard drive 1.08 gb size windows 3.11 better operating system choice base model however 32 mb installed could run windows 95 properly models—apart base 380—could run versions windows including windows xp windows xp run smoothly however would need configured least 64 mb ram 2.0 gb hard drive larger | [
1121,
3304,
3496,
9353,
7983,
8976,
3323,
8125
] | Test |
8,579 | 3 | Xenon_(video_game):xenon video game xenon 1988 vertical scrolling shooter video game first developed bitmap brothers published melbourne house owned mastertronic featured play-by-phone game saturday-morning kids show get fresh xenon followed 1989 according game instruction manual player assumes role darrian future space pilot federation currently war mysterious violent alien species called xenites lasted decade response mayday transmission captain xod following attack trading fleet darrian forced travel xenite occupied territory order support unlike vertically scrolling shooters player craft two modes flying plane ground tank transition crafts initiated almost time play except mid- end-of-level boss sections well certain levels certain mode forced mode chosen depends nature threat player faces destroying enemies released power-ups player could catch enhance ship originally released atari st xenon quickly ported platforms amiga amstrad cpc commodore 64 dos msx zx spectrum arcade machine version game also released mastertronic arcadia division ran commodore amiga hardware xenon almost universally well received launch reviewers magazines covering range platforms scoring game highly german magazine power play bucked trend awarding score 4.5 10 | [
9006
] | Test |
8,580 | 4 | Indicator_of_compromise:indicator compromise indicator compromise ioc computer forensics artifact observed network operating system high confidence indicates computer intrusion typical iocs virus signatures ip addresses md5 hashes malware files urls domain names botnet command control servers iocs identified via process incident response computer forensics used early detection future attack attempts using intrusion detection systems antivirus software initiatives standardize format iocs efficient automated processing known indicators usually exchanged within industry traffic light protocol used | [
2945,
1861,
2213,
9319,
7560,
7210,
10539,
10858,
7983,
1886,
4883,
11198,
7515,
5245,
2558
] | Validation |
8,581 | 3 | System_integration:system integration system integration defined engineering process bringing together component sub-systems one system aggregation subsystems cooperating system able deliver overarching functionality ensuring subsystems function together system information technology process linking together different computing systems software applications physically functionally act coordinated whole system integrator integrates discrete systems utilizing variety techniques computer networking enterprise application integration business process management manual programming system integration involves integrating existing often disparate systems way focuses increasing value customer e.g. improved product quality performance time providing value company e.g. reducing operational costs improving response time modern world connected internet role system integration engineers important systems designed connect within system construction systems already deployed vertical integration opposed horizontal integration process integrating subsystems according functionality creating functional entities also referred silos benefit method integration performed quickly involves necessary vendors therefore method cheaper short term hand cost-of-ownership substantially higher seen methods since case new enhanced functionality possible way implement scale system would implementing another silo reusing subsystems create another functionality possible star integration also known spaghetti integration process systems integration system interconnected remaining subsystems observed perspective subsystem integrated connections reminiscent star overall diagram system presented connections look like spaghetti hence name method cost varies interfaces subsystems exporting case subsystems exporting heterogeneous proprietary interfaces integration cost substantially rise time costs needed integrate systems increase exponentially adding additional subsystems feature perspective method often seems preferable due extreme flexibility reuse functionality horizontal integration enterprise service bus esb integration method specialized subsystem dedicated communication subsystems allows cutting number connections interfaces one per subsystem connect directly esb esb capable translating interface another interface allows cutting costs integration provides extreme flexibility systems integrated using method possible completely replace one subsystem another subsystem provides similar functionality exports different interfaces completely transparent rest subsystems action required implement new interface esb new subsystem horizontal scheme misleading however thought cost intermediate data transformation cost shifting responsibility business logic avoided common data format integration method avoid every adapter convert data to/from every applications formats enterprise application integration eai systems usually stipulate application-independent common data format eai system usually provides data transformation service well help convert application-specific common formats done two steps adapter converts information application format bus common format semantic transformations applied converting zip codes city names splitting/merging objects one application objects applications | [
1952,
4802,
2948,
10603,
7149,
9710,
4591,
530,
467,
11039,
10301,
10303
] | None |
8,582 | 9 | Perl:perl perl family two high-level general-purpose interpreted dynamic programming languages perl usually refers perl 5 may also refer redesigned sister language perl 6 though perl officially acronym various backronyms use including practical extraction reporting language perl originally developed larry wall 1987 general-purpose unix scripting language make report processing easier since undergone many changes revisions perl 6 began redesign perl 5 2000 eventually evolved separate language languages continue developed independently different development teams liberally borrow ideas one another perl languages borrow features programming languages including c shell script sh awk sed wall also alludes basic lisp introduction learning perl schwartz christiansen provide text processing facilities without arbitrary data-length limits many contemporary unix commandline tools facilitating manipulation text files perl 5 gained widespread popularity late 1990s cgi scripting language part due unsurpassed regular expression string parsing abilities addition cgi perl 5 used system administration network programming finance bioinformatics applications guis nicknamed swiss army chainsaw scripting languages flexibility power also ugliness 1998 also referred duct tape holds internet together reference ubiquitous use glue language perceived inelegance larry wall began work perl 1987 working programmer unisys released version 1.0 comp.sources.misc newsgroup december 18 1987 language expanded rapidly next years perl 2 released 1988 featured better regular expression engine perl 3 released 1989 added support binary data streams originally documentation perl single lengthy man page 1991 programming perl known many perl programmers camel book cover published became de facto reference language time perl version number bumped 4 mark major change language identify version well documented book perl 4 went series maintenance releases culminating perl 4.036 1993 whereupon wall abandoned perl 4 begin work perl 5 initial design perl 5 continued 1994 perl5-porters mailing list established may 1994 coordinate work porting perl 5 different platforms remains primary forum development maintenance porting perl 5 perl 5.000 released october 17 1994 nearly complete rewrite interpreter added many new features language including objects references lexical variables modules importantly modules provided mechanism extending language without modifying interpreter allowed core interpreter stabilize even enabled ordinary perl programmers add new language features perl 5 active development since perl 5.001 released march 13 1995 perl 5.002 released february 29 1996 new prototypes feature allowed module authors make subroutines behaved like perl builtins perl 5.003 released june 25 1996 security release one important events perl 5 history took place outside language proper consequence module support october 26 1995 comprehensive perl archive network cpan established repository perl language perl modules may 2017 carries 185,178 modules 35,190 distributions written 13,071 authors mirrored worldwide 245 locations perl 5.004 released may 15 1997 included among things universal package giving perl base object classes automatically derived ability require versions modules another significant development inclusion cgi.pm module contributed perl popularity cgi scripting language perl 5.004 also added support microsoft windows several operating systems perl 5.005 released july 22 1998 release included several enhancements regex engine new hooks backend codice_1 modules codice_2 regex quote operator large selection new core modules added support several operating systems including beos perl 5.6 released march 22 2000 major changes included 64-bit support unicode string representation support files 2 gib keyword developing perl 5.6 decision made switch versioning scheme one similar open source projects 5.005_63 next version became 5.5.640 plans development versions odd numbers stable versions even numbers 2000 wall put forth call suggestions new version perl community process resulted 361 rfc request comments documents used guiding development perl 6 2001 work began apocalypses perl 6 series documents meant summarize change requests present design next generation perl presented digest rfcs rather formal document point perl 6 existed description language perl 5.8 first released july 18 2002 nearly yearly updates since perl 5.8 improved unicode support added new i/o implementation added new thread implementation improved numeric accuracy added several new modules 2013 version still remains popular version perl used red hat 5 suse 10 solaris 10 hp-ux 11.31 aix 5 2004 work began synopses documents originally summarized apocalypses became specification perl 6 language february 2005 audrey tang began work pugs perl 6 interpreter written haskell first concerted effort towards making perl 6 reality effort stalled 2006 december 18 2007 20th anniversary perl 1.0 perl 5.10.0 released perl 5.10.0 included notable new features brought closer perl 6 included switch statement called given regular expressions updates smart match operator ~~ around time development began earnest another implementation perl 6 known rakudo perl developed tandem parrot virtual machine november 2009 rakudo perl regular monthly releases complete implementation perl 6 major change development process perl 5 occurred perl 5.11 development community switched monthly release cycle development releases yearly schedule stable releases plan bugfix point releases follow stable releases every three months april 12 2010 perl 5.12.0 released notable core enhancements include new codice_3 syntax yada yada operator intended mark placeholder code yet implemented implicit strictures full y2038 compliance regex conversion overloading dtrace support unicode 5.2 january 21 2011 perl 5.12.3 released contains updated modules documentation changes version 5.12.4 released june 20 2011 latest version branch 5.12.5 released november 10 2012 may 14 2011 perl 5.14 released json support built-in 5.14.0 latest version branch 5.14.4 released march 10 2013 may 20 2012 perl 5.16 released notable new features include ability specify given version perl one wishes emulate allowing users upgrade version perl still run old scripts would normally incompatible perl 5.16 also updates core support unicode 6.1 may 18 2013 perl 5.18 released notable new features include new dtrace hooks lexical subs core subs overhaul hash security reasons support unicode 6.2 may 27 2014 perl 5.20 released notable new features include subroutine signatures hash slices/new slice syntax postfix dereferencing experimental unicode 6.3 rand using consistent random number generator observers credit release perl 5.10 start modern perl movement particular phrase describes style development embraces use cpan takes advantage recent developments language rigorous creating high quality code book modern perl may visible standard-bearer idea groups enlightened perl organization taken cause late 2012 2013 several projects alternative implementations perl 5 started perl5 perl6 rakudo perl team moe stevan little friends p2 perl11 team reini urban gperl goccy rperl kickstarter project led braswell affiliated perll11 project ponie acronym perl new internal engine ponie project existed 2003 2006 bridge perl 5 perl 6 effort rewrite perl 5 interpreter run parrot perl 6 virtual machine goal ensure future millions lines perl 5 code thousands companies around world ponie project ended 2006 longer actively developed improvements made perl 5 interpreter part ponie folded project perl originally named pearl wall wanted give language short name positive connotations claims considered every three- four-letter word dictionary also considered naming wife gloria wall discovered existing pearl programming language perl official release changed spelling name referring language name normally capitalized perl proper noun referring interpreter program name often uncapitalized perl unix-like file systems case-sensitive release first edition programming perl common refer language perl randal l. schwartz however capitalized language name book make stand better typeset case distinction subsequently documented canonical name occasionally expanded practical extraction report language backronym expansions suggested equally canonical including wall pathologically eclectic rubbish lister manual page perl indeed wall claims name intended inspire many different expansions programming perl published o'reilly media features picture dromedary camel cover commonly called camel book image camel become unofficial symbol perl well general hacker emblem appearing t-shirts clothing items o'reilly owns image trademark licenses non-commercial use requiring acknowledgement link www.perl.com licensing commercial use decided case case basis o'reilly also provides programming republic perl logos non-commercial sites powered perl buttons site uses perl perl foundation owns alternative symbol onion licenses subsidiaries perl mongers perlmonks perl.org others symbol visual pun pearl onion sebastian riedel creator mojolicious created logo depicting raptor dinosaur available cc-sa license version 4.0 logo remixed used different places symbolising perl 5 analogue raptor comes series talks given matt trout beginning 2010 talks aimed perl 5 community-centric period perl 6 hot topic according wall perl two slogans first one way commonly known tmtowtdi second slogan easy things easy hard things possible overall structure perl derives broadly c. perl procedural nature variables expressions assignment statements brace-delimited blocks control structures subroutines perl also takes features shell programming variables marked leading sigils allow variables interpolated directly strings however unlike shell perl uses sigils accesses variables unlike programming languages use sigils sigil n't denote type variable type expression example access list values hash sigil array used sigil hash perl also many built-in functions provide tools often used shell programming although many tools implemented programs external shell sorting calling operating system facilities perl takes lists lisp hashes associative arrays awk regular expressions sed simplify facilitate many parsing text-handling data-management tasks also shared lisp implicit return last value block fact statements value thus also expressions used larger expressions perl 5 added features support complex data structures first-class functions closures values object-oriented programming model include references packages class-based method dispatch lexically scoped variables along compiler directives example codice_4 pragma major additional feature introduced perl 5 ability package code reusable modules wall later stated whole intent perl 5 module system encourage growth perl culture rather perl core versions perl automatic data-typing automatic memory management interpreter knows type storage requirements every data object program allocates frees storage necessary using reference counting deallocate circular data structures without manual intervention legal type conversions — example conversions number string — done automatically run time illegal type conversions fatal errors design perl understood response three broad trends computer industry falling hardware costs rising labor costs improvements compiler technology many earlier computer languages fortran c aimed make efficient use expensive computer hardware contrast perl designed computer programmers could write programs quickly easily perl many features ease task programmer expense greater cpu memory requirements include automatic memory management dynamic typing strings lists hashes regular expressions introspection codice_5 function perl follows theory built-in limits idea similar zero one infinity rule wall trained linguist design perl much informed linguistic principles examples include huffman coding common constructions short good end-weighting important information come first large collection language primitives perl favors language constructs concise natural humans write even complicate perl interpreter perl syntax reflects idea things different look different example scalars arrays hashes different leading sigils array indices hash keys use different kinds braces strings regular expressions different standard delimiters approach contrasted language lisp basic syntax composed simple universal symbolic expressions used purposes perl enforce particular programming paradigm procedural object-oriented functional others even require programmer choose among broad practical bent perl language community culture surround preface programming perl begins perl language getting job done one consequence perl tidy language includes many features tolerates exceptions rules employs heuristics resolve syntactical ambiguities forgiving nature compiler bugs sometimes hard find perl function documentation remarks variant behavior built-in functions list scalar contexts saying general want unless want consistency written specification standard perl language exists perl versions perl 5 plans create one current version perl one implementation interpreter language evolved along interpreter together functional tests stands de facto specification language perl 6 however started specification several projects aim implement specification perl many varied applications compounded availability many standard third-party modules perl chiefly used write cgi scripts large projects written perl include cpanel slash bugzilla rt twiki movable type high-traffic websites use perl extensively include priceline.com craigslist imdb livejournal duckduckgo slashdot ticketmaster also optional component popular lamp technology stack web development lieu php python perl used extensively system programming language debian gnu/linux distribution perl often used glue language tying together systems interfaces specifically designed interoperate data munging converting processing large amounts data tasks creating reports fact strengths intimately linked combination makes perl popular all-purpose language system administrators particularly short programs often called one-liner programs entered run single command line perl code made portable across windows unix code often used suppliers software cots bespoke simplify packaging maintenance software build- deployment-scripts graphical user interfaces guis may developed using perl example perl/tk wxperl commonly used enable user interaction perl scripts interaction may synchronous asynchronous using callbacks update gui perl implemented core interpreter written c together large collection modules written perl c. interpreter 150,000 lines c code compiles 1 mb executable typical machine architectures alternatively interpreter compiled link library embedded programs nearly 500 modules distribution comprising 200,000 lines perl additional 350,000 lines c code much c code modules consists character encoding tables interpreter object-oriented architecture elements perl language—scalars arrays hashes coderefs file handles—are represented interpreter c structs operations structs defined large collection macros typedefs functions constitute perl c api perl api bewildering uninitiated entry points follow consistent naming scheme provides guidance use life perl interpreter divides broadly compile phase run phase perl phases major stages interpreter life-cycle interpreter goes phase phases follow fixed sequence happens perl compile phase compilation happens perl run phase execution significant exceptions perl makes important use capability execute perl code compile phase perl also delay compilation run phase terms indicate kind processing actually occurring moment compile time run time perl compile time points compile phase compile time may also entered run phase compile time code string argument passed codice_6 built-in occurs run phase perl often run time compile phase spends run phase run time code codice_7 blocks executes run time compile phase compile time interpreter parses perl code syntax tree run time executes program walking tree text parsed syntax tree subject optimization executed execution relatively efficient compile-time optimizations syntax tree include constant folding context propagation peephole optimization also performed perl turing-complete grammar parsing affected run-time code executed compile phase therefore perl parsed straight lex/yacc lexer/parser combination instead interpreter implements lexer coordinates modified gnu bison parser resolve ambiguities language often said perl parse perl meaning perl interpreter codice_8 parse perl language perl even general true perl interpreter simulate turing machine compile phase would need decide halting problem order complete parsing every case long-standing result halting problem undecidable therefore even perl always parse perl perl makes unusual choice giving user access full programming power compile phase cost terms theoretical purity high practical inconvenience seems rare programs undertake parse perl source-code analyzers auto-indenters contend ambiguous syntactic constructs also undecidability perl parsing general case adam kennedy ppi project focused parsing perl code document retaining integrity document instead parsing perl executable code even perl always kennedy first conjectured parsing perl suffers 'halting problem later proved perl distributed 250,000 functional tests core perl language 250,000 functional tests core modules run part normal build process extensively exercise interpreter core modules perl developers rely functional tests ensure changes interpreter introduce software bugs additionally perl users see interpreter passes functional tests system high degree confidence working properly perl dual licensed artistic license 1.0 gnu general public license distributions available operating systems particularly prevalent unix unix-like systems ported modern many obsolete platforms six reported exceptions perl compiled source code posix-compliant otherwise-unix-compatible platforms unusual changes required classic mac os environment special port called macperl shipped independently comprehensive perl archive network carries complete list supported platforms links distributions available cpan also source publicly available perl modules part core perl distribution users microsoft windows typically install one native binary distributions perl win32 commonly strawberry perl activeperl compiling perl source code windows possible installations lack requisite c compiler build tools also makes difficult install modules cpan particularly partially written c. activeperl closed source distribution activestate regular releases track core perl releases distribution also includes perl package manager ppm popular tool installing removing upgrading managing use common perl modules included also perlscript windows script host wsh engine implementing perl language visual perl activestate tool adds perl visual studio .net development suite vbscript perl converter well perl compiler windows converters awk sed perl also produced company included activestate cd windows includes distributions plus komodo ide first unix/linux/posix variant thereof 2002 subsequently strawberry perl open source distribution windows regular quarterly releases since january 2008 including new modules feedback requests come strawberry perl aims able install modules like standard perl distributions platforms including compiling xs modules cygwin emulation layer another way running perl windows cygwin provides unix-like environment windows perl cpan available standard pre-compiled packages cygwin setup program since cygwin also includes gcc compiling perl source also possible perl executable included several windows resource kits directory scripting tools implementations perl come mks toolkit interix base earlier implementations windows services unix uwin perl text-handling capabilities used generating sql queries arrays hashes automatic memory management make easy collect process returned data example tim bunce perl dbi application programming interface api arguments api text sql queries thus possible program multiple languages time e.g. generating web page using html javascript sql document use perl variable interpolation programmatically customize sql queries specification perl arrays hashes structures programmatically hold resulting data sets sql query allows high-level mechanism handling large amounts data post-processing perl subprogram early versions perl database interfaces created relinking interpreter client-side database library sufficiently difficult done most-important widely used databases restricted resulting codice_8 executable using one database interface time perl 5 database interfaces implemented perl dbi modules dbi database interface module presents single database-independent interface perl applications dbd database driver modules handle details accessing 50 different databases dbd drivers ansi sql databases dbi provides caching database handles queries greatly improve performance long-lived execution environments mod perl helping high-volume systems avert load spikes slashdot effect modern perl applications especially written using web frameworks catalyst dbi module often used indirectly via object-relational mappers generate sql queries handle data transparently application author computer language benchmarks game compares performance implementations typical programming problems several programming languages submitted perl implementations typically perform toward high end memory-usage spectrum give varied speed results perl performance benchmarks game typical interpreted languages large perl programs start slowly similar programs compiled languages perl compile source every time runs talk yapc :europe 2005 conference subsequent article timely start jean-louis leroy found perl programs took much longer run expected perl interpreter spent significant time finding modules within over-large include path unlike java python ruby perl experimental support pre-compiling therefore perl programs pay overhead penalty every execution run phase typical programs long enough amortized startup time substantial benchmarks measure short execution times likely skewed due overhead number tools introduced improve situation first tool apache mod perl sought address one most-common reasons small perl programs invoked rapidly cgi web development activeperl via microsoft isapi provides similar performance improvements perl code compiled additional overhead execution phase typically n't present programs written compiled languages c c++ examples overhead include bytecode interpretation reference-counting memory management dynamic type-checking perl interpreted language give problems efficiency critical situations critical routines written languages c connected perl via simple inline modules complex flexible xs mechanism perl 5 language usually referred perl continues actively developed perl 5.12.0 released april 2010 new features influenced design perl 6 followed perl 5.14.1 released june 17 2011 perl 5.16.1 released august 9 2012 perl 5.18.0 released may 18 2013 perl 5 development versions released monthly basis major releases coming per year relative proportion internet searches perl programming compared similar searches programming languages steadily declined 10 2005 2 2011 1 2019 2000 perl conference jon orwant made case major new language-initiative led decision begin work redesign language called perl 6 proposals new language features solicited perl community large submitted 300 rfcs wall spent next years digesting rfcs synthesizing coherent framework perl 6 presented design perl 6 series documents called apocalypses numbered correspond chapters programming perl developing specification perl 6 encapsulated design documents called synopsesnumbered correspond apocalypses thesis work bradley m. kuhn overseen wall considered possible use java virtual machine runtime perl kuhn thesis showed approach problematic 2001 decided perl 6 would run cross-language virtual machine called parrot mean languages targeting parrot gain native access cpan allowing level cross-language development 2005 audrey tang created pugs project implementation perl 6 haskell acted continues act test platform perl 6 language separate development actual implementation allowing language designers explore pugs project spawned active perl/haskell cross-language community centered around freenode perl6 irc channel many functional programming influences absorbed perl 6 design team 2012 perl 6 development centered primarily around two compilers 2013 moarvm “ metamodel runtime ” c language-based virtual machine designed primarily rakudo announced rakudo perl implementation moarvm support virtual machines java virtual machine javascript active development perl culture community developed alongside language usenet first public venue perl introduced course evolution perl community shaped growth broadening internet-based services including introduction world wide web community surrounds perl fact topic wall first state onion talk state onion name wall yearly keynote-style summaries progress perl community characterized hallmark humor employing references perl culture wider hacker culture wall linguistic background sometimes family life occasionally even christian background talk first given various perl conferences eventually also published online number irc channels offer support language modules also many examples code written purely entertainment cpan codice_10 example allows writing programs latin upon execution program module translates source code regular perl runs perl community set aside acme namespace modules fun nature scope widened include exploratory experimental code module meant ever used production acme modules deliberately implemented amusing ways includes codice_11 one first modules codice_12 namespace allows program source code whitened i.e. characters replaced whitespace yet still work older versions perl one would write hello world program complex perl program counts seconds given threshold perl interpreter also used one-off scripts command line following example invoked sh-compatible shell bash translates string bob files ending .txt current directory robert perl referred line noise programmers claim syntax makes write-only language earliest mention first edition book learning perl perl 4 tutorial book written randal l. schwartz first chapter states yes sometimes perl looks like line noise uninitiated seasoned perl programmer looks like checksummed line noise mission life also stated accusation perl write-only language could avoided coding proper care perl overview document perlintro states names built-in magic scalar variables look like punctuation line noise however english module provides long short english alternatives perlstyle document states line noise regular expressions could mitigated using codice_13 modifier add whitespace according perl 6 faq perl 6 designed mitigate usual suspects elicit line noise claim perl 5 critics including removal majority punctuation variables sanitization regex syntax perl 6 faq also states sometimes referred perl line noise actual syntax language gerunds prepositions part english language december 2012 blog posting despite claiming rakudo perl 6 failed continue fail unless gets adult supervision chromatic stated design perl 6 well-defined grammar well improved type system unified object system intelligent metamodel metaoperators clearer system context provides niceties pervasive laziness also stated perl 6 coherence consistency perl 5 lacks | [
6145,
8201,
2060,
8204,
2062,
6160,
10258,
8213,
10266,
8221,
6176,
10276,
8236,
8240,
10292,
58,
10308,
8262,
8266,
6219,
84,
6228,
6241,
8289,
10340,
102,
8297,
8303,
8304,
119,
2181,
10387,
148,
155,
8347,
4255,
2217,
6313,
10413,
6333... | Test |
8,583 | 4 | BotHunter:bothunter bothunter free utility unix aims detecting botnet activity within network analyzing network traffic comparing patterns characteristic malicious processes version 1.7.2 current earlier version ran microsoft windows xp mentioned web site release 1.7.2 order support application developer sri international collected 10,000 samples malware 2008 bothunter web site states software made possible part research grant u.s. army research office | [
4883,
5492
] | None |
8,584 | 5 | Opera_(web_browser):opera web browser opera web browser microsoft windows android ios macos linux operating systems developed opera software opera software norwegian software company publicly listed nasdaq stock exchange majority ownership control belonging chinese businessman zhou yahui founder beijing kunlun tech specialises mobile games chinese cybersecurity company qihoo 360 opera chromium-based browser using blink layout engine differentiates distinct user interface features opera conceived telenor research project 1994 bought opera software 1995 commercial software first ten years proprietary presto layout engine presto versions opera received many awards presto development ended milestone transition chromium 2013 also three mobile versions called opera mobile opera touch opera mini gaming browser called opera gx launched 11 june 2019 opera began 1994 research project telenor largest norwegian telecommunications company 1995 branched separate company named opera software opera first publicly released 1996 version 2.10 ran microsoft windows attempt capitalize emerging market internet-connected handheld devices project port opera mobile device platforms started 1998 opera 4.0 released 2000 included new cross-platform core facilitated creation editions opera multiple operating systems platforms point opera trialware purchased trial period ended version 5.0 released 2000 saw end requirement instead opera became ad-sponsored displaying advertisements users paid later versions opera gave user choice seeing banner ads targeted text advertisements google version 8.5 released 2005 advertisements completely removed primary financial support browser came revenue google contract opera default search engine among new features introduced version 9.1 released 2006 fraud protection using technology geotrust digital certificate provider phishtank organization tracks known phishing web sites feature improved expanded version 9.5 geotrust replaced netcraft malware protection haute secure added 2006 opera software asa released well internet channel nintendo ds browser nintendo ds wii gaming systems new javascript engine called carakan javanese alphabet introduced version 10.50 according opera software carakan made opera 10.50 seven times faster sunspider opera 10.10 16th december 2010 opera 11 released featuring extensions tab stacking dragging one tab another allows create group tabs visual mouse gestures changes address bar opera 12 released 14 june 2012 12 february 2013 opera software announced would drop presto layout engine favour webkit implemented google chrome browser using code chromium project opera software planned well contribute code webkit 3 april 2013 google announced would fork components webkit form new layout engine known blink day opera software confirmed would follow google implementing blink layout engine 28 may 2013 beta release opera 15 made available first version based chromium project many distinctive opera features previous versions dropped opera mail separated standalone application derived opera 12 november 2016 original norwegian owner opera sold stake business chinese consortium name golden brick capital private equity fund limited partnership 600 million earlier deal approved regulators january 2017 source code opera 12.15 one last versions still based presto layout engine leaked demonstrate radically different browser could look opera neon dubbed concept browser released january 2017 pc world compared demo models automakers hardware vendors release show visions future instead speed dial also explained following chapter features displays frequently accessed websites resemblance desktop computer icons scattered artistic formation opera originated features later adopted web browsers including speed dial pop-up blocking re-opening recently closed pages private browsing tabbed browsing opera includes bookmarks bar download manager opera also speed dial allows user add unlimited number pages shown thumbnail form page displayed new tab opened speed dial allows user easily navigate selected web pages possible control aspects browser using keyboard shortcuts page zooming allows text images content adobe flash player java platform scalable vector graphics increased decreased size help impaired vision opera software claims opera turbo mode enabled compression servers compress requested web pages except https pages 50 depending upon content sending users process reduces amount data transferred particularly useful crowded slow network connections making web pages load faster costs dependent total amount data usage technique also used opera mini mobile devices smartwatches one security feature option delete private data http cookies browsing history items cache passwords click button lets users erase personal data browsing shared computer visiting site opera displays security badge address bar shows details website including security certificates opera fraud malware protection warns suspicious web pages enabled default checks requested page several databases known phishing malware websites called blacklists january 2007 asa dotzler competing mozilla corporation accused opera software downplaying information security vulnerabilities opera fixed december 2006 dotzler claimed users clearly informed security vulnerabilities present previous version opera thus would realize needed upgrade latest version else risk exploited hackers opera software responded accusations next day 2016 free virtual private network vpn service implemented browser opera said would allow encrypted access websites otherwise blocked provide security public wifi networks either vpn turbo enabled july 2018 opera listed nasdaq stock exchange new york city initial offering 12 per share 2018 built-in cryptocurrency wallet opera web browser released announcing would first browser built-in crypto wallet 13 december 2018 released video showing many decentralized applications like cryptokitties running android version opera web browser opera one first browsers support cascading style sheets css opera software uses release cycle consisting three streams correspond phases development downloaded installed independently developer beta stable new features first introduced developer build depending user feedback may progress beta version eventually released developer stream allows early testing new features mainly targeting developers extension creators early adopters opera developer intended everyday browsing unstable prone failure crashing enables advanced users try new features still development without affecting normal installation browser new versions browser released frequently generally times week beta stream formerly known opera next feature complete package allowing stability quality mature final release new version released every couple weeks streams installed alongside official release without interference different icon help user distinguish variants 2005 adobe systems opted integrate opera rendering engine presto adobe creative suite applications opera technology employed adobe golive adobe photoshop adobe dreamweaver components adobe creative suite opera layout engine also found virtual mechanics sitespinner pro internet channel version opera 9 web browser use nintendo wii created opera software nintendo opera software also implemented nintendo ds browser nintendo handheld systems versions presto layout engine positively reviewed although criticized website compatibility issues issue opera 8.01 higher included workarounds help certain popular problematic web sites display properly versions blink layout engine criticized users missing features ui customization abandoning opera software presto layout engine despite versions blink layout engine praised fast stable handling latest web standards better website compatibility modern-style user interface years opera personal computers received several awards awards include related web browsers web browsers essential features | [
513,
6657,
9736,
2579,
6171,
2076,
7708,
1054,
9757,
7713,
10791,
9768,
9770,
1067,
559,
3634,
2611,
4661,
3639,
7736,
10808,
9786,
3643,
2108,
9275,
64,
9281,
3657,
2635,
5707,
9803,
5199,
10831,
11345,
10834,
5205,
6231,
8281,
2139,
572... | Validation |
8,585 | 4 | WebScarab:webscarab webscarab web security application testing tool serves proxy intercepts allows people alter web browser web requests http https web server replies webscarab also may record traffic review webscarab open source tool developed open web application security project owasp implemented java could run across multiple operating systems 2013 official development webscarab slowed appears owasp zed attack proxy zap project another java-based open source proxy tool features active development webscarab official successor although zap forked paros proxy webscarab | [
225,
9293,
3604,
4725,
119,
4797
] | None |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.