node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
4,985 | 3 | IA-64:ia-64 ia-64 also called intel itanium architecture instruction set architecture isa itanium family 64-bit intel microprocessors basic isa specification originated hewlett-packard hp evolved implemented new processor microarchitecture intel hp continued partnership expertise underlying epic design concepts order establish first new isa 20 years bring entirely new product line market intel made massive investment product definition design software development tools os software industry partnerships marketing support effort intel created largest design team history new marketing industry enabling team completely separate x86 first itanium processor codenamed merced released 2001 itanium architecture based explicit instruction-level parallelism compiler decides instructions execute parallel contrasts superscalar architectures depend processor manage instruction dependencies runtime itanium models including tukwila cores execute six instructions per clock cycle 2008 itanium fourth-most deployed microprocessor architecture enterprise-class systems behind x86-64 power isa sparc 1989 hp began become concerned reduced instruction set computing risc architectures approaching processing limit one instruction per cycle intel hp researchers exploring computer architecture options future designs separately began investigating new concept known long instruction word vliw came research yale university early 1980s vliw computer architecture concept like risc cisc single instruction word contains multiple instructions encoded one long instruction word facilitate processor executing multiple instructions clock cycle typical vliw implementations rely heavily sophisticated compilers determine compile time instructions executed time proper scheduling instructions execution also help predict direction branch operations value approach useful work fewer clock cycles simplify processor instruction scheduling branch prediction hardware requirements penalty increased processor complexity cost energy consumption exchange faster execution time hp begun believe longer cost-effective individual enterprise systems companies develop proprietary microprocessors intel also researching several architectural options going beyond x86 isa address high end enterprise server high performance computing hpc requirements thus intel hp partnered 1994 develop ia-64 isa using variation vliw design concepts intel named explicitly parallel instruction computing epic intel goal leverage expertise hp developed early vliw work along develop volume product line targeted high-end enterprise class servers high performance computing hpc systems could sold original equipment manufacturers oems hp wished able purchase off-the-shelf processors built using intel volume manufacturing leading edge process technology higher performance cost effective current pa-risc processors resulting products would intel hp would one many customers order achieve volumes necessary successful product line itanium products would required meet needs broader customer base software applications os development tools available customers required itanium products designed documented manufactured quality support consistent rest intel products therefore intel took lead microarchitecture design productization packaging test steps industry software operating system enabling linux windows nt marketing part intel definition marketing process engaged wide variety enterprise oem software os vendors well end customers order understand requirements ensure reflected product family meet needs broad range customers end-users hp made substantial contribution isa definition merced/itanium microarchitecture itanium 2 productization responsibility intel original goal delivering first itanium family product codenamed merced 1998 intel product marketing industry engagement efforts substantial achieved design wins majority enterprise server oem including based risc processors time industry analysts predicted ia-64 would dominate servers workstations high-end desktops eventually supplant risc complex instruction set computing cisc architectures general-purpose applications compaq silicon graphics decided abandon development alpha mips architectures respectively favor migrating ia-64 1997 apparent ia-64 architecture compiler much difficult implement originally thought delivery itanium began slipping since itanium first ever epic processor development effort encountered unanticipated problems team accustomed addition epic concept depends compiler capabilities never implemented research needed several groups developed operating systems architecture including microsoft windows unix unix-like systems linux hp-ux freebsd solaris tru64 unix monterey/64 last three canceled reaching market 1999 intel led formation open source industry consortium port linux ia-64 named trillium later renamed trillian due trademark issue led intel included caldera systems cern cygnus solutions hewlett-packard ibm red hat sgi suse turbolinux va linux systems result working ia-64 linux delivered ahead schedule first os run new itanium processors intel announced official name processor itanium october 4 1999 within hours name itanic coined usenet newsgroup pun name titanic unsinkable ocean liner sank maiden voyage 1912 time itanium released june 2001 performance superior competing risc cisc processors recognizing lack software could serious problem future intel made thousands early systems available independent software vendors isvs stimulate development hp intel brought next-generation itanium 2 processor market year later itanium 2 processor released 2002 relieved many performance problems original itanium processor mostly caused inefficient memory subsystem 2003 amd released opteron implemented 64-bit architecture x86-64 opteron gained rapid acceptance enterprise server space provided easy upgrade x86 intel responded implementing x86-64 em64t xeon microprocessors 2004 november 2005 major itanium server manufacturers joined intel number software vendors form itanium solutions alliance promote architecture accelerate software porting 2006 intel delivered montecito marketed itanium 2 9000 series dual-core processor roughly doubled performance decreased energy consumption 20 percent itanium 9300 series processor codenamed tukwila released 8 february 2010 greater performance memory capacity tukwila originally slated release 2007 device uses 65 nm process includes two four cores 24 mb on-die caches hyper-threading technology integrated memory controllers implements double-device data correction dddc helps fix memory errors tukwila also implements intel quickpath interconnect qpi replace itanium bus-based architecture peak interprocessor bandwidth 96 gb/s peak memory bandwidth 34 gb/s quickpath processor integrated memory controllers interfaces memory directly using qpi interfaces directly connect processors i/o hubs quickpath also used intel processors using nehalem microarchitecture making probable tukwila nehalem able use chipsets tukwila incorporates four memory controllers supports multiple ddr3 dimms via separate memory controller much like nehalem-based xeon processor code-named beckton itanium 9500 series processor codenamed poulson follow-on processor tukwila features eight cores 12-wide issue architecture multithreading enhancements new instructions take advantage parallelism especially virtualization poulson l3 cache size 32 mb l2 cache size 6 mb 512 kb 256 kb per core die size 544 mm² less predecessor tukwila 698.75 mm² isscc 2011 intel presented paper called 32nm 3.1 billion transistor 12-wide-issue itanium processor mission critical servers given intel history disclosing details itanium microprocessors isscc paper likely refers poulson analyst david kanter speculates poulson use new microarchitecture advanced form multi-threading uses many two threads improve performance single threaded multi-threaded workloads new information released hotchips conference new information presents improvements multithreading resiliency improvements instruction replay ras new instructions thread priority integer instruction cache prefetching data access hints kittson 9500 poulson slightly higher clocked january 2019 intel announced kittson would discontinued last order date january 2020 planned successor intel extensively documented itanium instruction set technical press provided overviews architecture renamed several times history hp originally called pa-wideword intel later called ia-64 itanium processor architecture ipa settling intel itanium architecture still widely referred ia-64 64-bit register-rich explicitly parallel architecture base data word 64 bits byte-addressable logical address space 2 bytes architecture implements predication speculation branch prediction uses variable-sized register windowing parameter passing mechanism also used permit parallel execution loops speculation prediction predication renaming control compiler instruction word includes extra bits approach distinguishing characteristic architecture architecture implements large number registers 128-bit instruction word called bundle contains three slots holding 41-bit instruction plus 5-bit template indicating type instruction slot types m-unit memory instructions i-unit integer alu non-alu integer long immediate extended instructions f-unit floating-point instructions b-unit branch long branch extended instructions template also encodes stops indicate data dependency exists data stop instructions pair stops constitute instruction group regardless bundling must free many types data dependencies knowledge allows processor execute instructions parallel without perform complicated data analysis since analysis already done instructions written within slot instructions predicated specifying predicate register value true false determine whether instruction executed predicated instructions always execute predicated codice_4 always reads true ia-64 assembly language instruction format deliberately designed written mainly compilers humans instructions must grouped bundles three ensuring three instructions match allowed template instructions must issue stops certain types data dependencies stops also used limited places according allowed templates fetch mechanism read two bundles per clock l1 cache pipeline compiler take maximum advantage processor execute six instructions per clock cycle processor thirty functional execution units eleven groups unit execute particular subset instruction set unit executes rate one instruction per cycle unless execution stalls waiting data units group execute identical subsets instruction set common instructions executed multiple units execution unit groups include ideally compiler often group instructions sets six execute time since floating-point units implement multiply–accumulate operation single floating point instruction perform work two instructions application requires multiply followed add common scientific processing occurs processor execute four flops per cycle example 800 mhz itanium theoretical rating 3.2 gflops fastest itanium 2 1.67 ghz rated 6.67 gflops practice processor may often underutilized slots filled useful instructions due e.g data dependencies limitations available bundle templates densest possible code requires 42.6 bits per instruction compared 32 bits per instruction traditional risc processors time no-ops due wasted slots decrease density code additional instructions speculative loads hints branches cache difficult generate optimally even modern compilers 2002 2006 itanium 2 processors shared common cache hierarchy 16 kb level 1 instruction cache 16 kb level 1 data cache l2 cache unified instruction data 256 kb level 3 cache also unified varied size 1.5 mb 24 mb 256 kb l2 cache contains sufficient logic handle semaphore operations without disturbing main arithmetic logic unit alu main memory accessed bus off-chip chipset itanium 2 bus initially called mckinley bus usually referred itanium bus speed bus increased steadily new processor releases bus transfers 2×128 bits per clock cycle 200 mhz mckinley bus transferred 6.4 gb/s 533 mhz montecito bus transfers 17.056 gb/s itanium processors released prior 2006 hardware support ia-32 architecture permit support legacy server applications performance ia-32 code much worse native code also worse performance contemporaneous x86 processors 2005 intel developed ia-32 execution layer ia-32 el software emulator provides better performance montecito intel therefore eliminated hardware support ia-32 code 2006 release montecito intel made number enhancements basic processor architecture including see chipsets ... markets | [
5012,
3942,
5371,
3948,
7529,
5737,
7541,
5042,
1481,
5055,
2226,
2585,
5760,
1867,
3660,
766,
7581,
2248,
6148,
6152,
441,
2977,
4017,
5794,
1910,
4759,
6170,
4765,
817,
4047,
5483,
5487,
6198,
3717,
1568,
1570,
6922,
7666,
515,
6570,
... | Test |
4,986 | 4 | Hacking:_The_Art_of_Exploitation:hacking art exploitation hacking art exploitation book jon smibbs erickson computer security network security published starch press 2003 second edition 2008 examples book developed compiled tested gentoo linux jon erickson computer security expert background computer science 2011 worked vulnerability researcher computer security specialist california bootable cd included book provides linux-based programming debugging environment users content exploiting moves programming networking cryptography book use notable measure real-world examples discussions rarely bring specific worms exploits computer programming portion hacking takes half book section goes development design construction testing exploit code thus involves basic assembly programming demonstrated attacks range simple buffer overflows stack complex techniques involving overwriting global offset table erickson discusses countermeasures non-executable stack evade return-to-libc attacks dive deeper matters without known guaranteed exploits address space layout randomization book also cover openwall grsecurity pax projects kernel exploits networking segment hacking explains basics osi model basic networking concepts including packet sniffing connection hijacking denial service port scanning cryptology section hacking covers basic information theory addition symmetric asymmetric encryption winds cracking wep utilizing fluhrer mantin shamir attack besides basics including man-in-the-middle attacks dictionary attacks use john ripper hacking discusses quantum key distribution lov grover quantum search algorithm peter shor quantum factoring algorithm breaking rsa encryption using large quantum computer introduction book states hacking done within confines law productive reasons programming chapter book different types programs described shown via examples chapter covers control structures basic aspects programming live cd provides environment reader follow along examples book programming exploitation taking computer code set rules changing computer want finding ways holes system change important part exploitation chapter covers exploit techniques memory corruption buffer overflows format strings especially using perl bash shellcode osi model communication among computers networking osi model used osi model model provides standards computers use communicate seven layers osi model physical layer data-link layer network layer transport layer session layer presentation layer application layer packet computer sends another computer must go layer osi model sockets standard way communicate network use computer operating systems socket socket used programmer create way send receive data using layers osi two types sockets stream socket datagram socket stream sockets use transmission control protocol tcp datagram socket uses user datagram protocol udp peeling back layers 'peeling back layers describes osi layers actually work osi model described great detail images book make easy understand network sniffing switched unswitched networks exist networking switched network uses devices called switches analyze tell packets travelling network endpoint unswitched network free flow packets without stopped analyzed sniffing refers using program allows see packets network going denial service denial service attack attempt make computer resource unavailable intended users means denial service attack sends large quantity communication requests intended resource order overflow resource becomes unusable certain period time types attacks usually directed routers firewalls order shut gain access computers network router susceptible types attacks firewall usually handle attack unaffected distributed denial service attack communication requests come multiple computers greatly increasing number requests regular denial service attack types dos attacks include ping death teardrop ping flooding amplification attacks tcp/ip hijacking tcp/ip hijacking another way uses spoofed packets take connection victim host machine technique mainly used collect passwords host machine uses password connected type attack takes place victim attacker must network another form tcp/ip hijacking rst hijacking involves injecting fake reset packet port scanning port scanning simply way figure ports accepting listening connections hacker would use program lets know ports open scanning ports network trying open many type scans syn idle fin x-mas null scans reach hack someone part finding vulnerabilities typecasting network using debugger go lines code used network protocols efficient way accomplish shellcode used exploitation code like hacker code wants run gains control program usually hacker find exploit programs code able insert code shellcode found exploit assembly vs. c assembly differs c assembly low-level programming language processed communicate directly processor using c high-level programming language code must compiled sent kernel making system call making call processor words almost like taking system calling kernel picture using assembly path shellcode part shellcode inject program shellcode taken many examples code book ways accomplish task self-spawning shellcode spawning shellcode code enabled exploit found shellcode able run vulnerability found program best way accomplish shown book making sure code small port-binding shellcode type shellcode attaches network port bound port listen tcp connection finds tcp connection lot programming involved shown vividly book connect-back shellcode type shellcode mainly used getting around firewalls firewalls going block port-binding shellcode working set allow known services active ports connect-back shellcode initiates connection back hacker ip address coming firewall instead going code book depicts connect-back use shellcode ways accomplish part book defenses intrusion prevention systems stop known hacking exploits countermeasures detect administrator network aware exploit may occurring using certain tools like reading logs packet sniffing network ways catch exploits occur system daemons system daemon server program unix system receives accepts incoming connections daemon program runs background detaches controlling terminal certain way point book code shown run daemon program signals also used unix-based environment make operating system calls signal type terminal immediately send interrupt message complete task whatever signal typed uses signals displayed coding examples book tools trade hacker certain set tools needs help exploiting exploit script tool uses already written exploit code find holes system program using exploit scripts easy even non-hacker use code already written couple exams exploit tools shown book use log files stated earlier log files way check events happening computer network hacker ability change log file says help noticed code directions change log files book overlooking obvious another sign program hacked longer work correctly time programs work correctly hacker modified accomplish another task skilled hacker however modify program still works correctly wants program exploited ways tell happened finding program exploited tedious process since usually starts taking parts program looking individually putting exploited program back together see exploited shown book advanced camouflage hacker exploiting program ip address written log file camouflaging log files ip address detected shown book ip address hidden called spoofing ip address whole infrastructure use intrusion detection systems intrusion prevention systems greatly helps avoid risk exploited even firewalls routers log files show evidence hacking making sure outbound tcp connections processed one way limit found ways shown book use tcp connections easier go undetected payload smuggling using shellcode exploit programs caught intrusion detection systems usually intrusion detection system catch programs already written noticeable shell code exploit programs caught real hackers using ways hide shellcode harder detect couple examples hide shellcode found book buffer restrictions sometimes restrictions put buffers vulnerabilities exploited ways book depicts get around buffer restrictions hardening countermeasures exploits found book around long time took hackers figured take advantage vulnerabilities described book memory corruption change control use shellcode three easiest steps exploitation nonexecutable stack applications use stack type executing one defense make stack non-executable buffer overflows used exploitation program defense effective stopping use shellcode application however way get around use non-executable stack shown described book randomized stack space randomized stack type countermeasure used hacker unable tell shellcode implemented randomizes memory layout within stack also way get around countermeasure examples book cryptology use communicating secretly use ciphers cryptanalysis process cracking deciphering secret communications chapter offers information theory cryptology including work claude shannon concepts including unconditional security one-time pads quantum key distribution computational security using key encrypt decrypt messages symmetric encryption asymmetric encryption involves using different keys public private chapter gives examples kinds encryption use cipher encryption algorithm combining use symmetric cipher asymmetric cipher called hybrid cipher ways attack ciphers get around encryption methods shown described book chapter also shows methods figure encrypted passwords including brute-force attacks hash look-ups also offers methods get around wireless 802.11b wi-fi wired equivalent privacy wep encryption | [
3932,
5272,
5983,
6180,
651,
2566,
7637,
578,
3635,
1019,
7207,
6049,
3751,
6498,
1805,
3426
] | Validation |
4,987 | 6 | E2fsprogs:e2fsprogs e2fsprogs sometimes called e2fs programs set utilities maintaining ext2 ext3 ext4 file systems since file systems often default linux distributions commonly considered essential software included e2fsprogs ordered asciibetical order many utilities based codice_20 library despite name might suggest e2fsprogs works ext2 also ext3 ext4 although ext3 journaling capability reduce need use codice_7 sometimes still necessary help protect kernel bugs bad hardware ext4 e2fsck runtime come considerably userspace companion ext2 ext3 ext4 drivers linux kernel e2fsprogs commonly used gnu/linux however ported systems freebsd darwin | [
3685,
200,
6984,
5571,
578,
6033,
4987,
7498,
1793,
3587,
5789,
174,
6500
] | Validation |
4,988 | 4 | John_A._Samford:john a. samford john alexander samford august 29 1905 – december 1 1968 lieutenant general united states air force served director national security agency samford born hagerman new mexico 1905 graduated high school 1922 spent one year columbia university new york city 1924 received senatorial appointment united states military academy graduated 1928 131st class 260 samford first assignment student officer brooks field texas 1929 received pilot wings kelly field eventually rated command pilot samford next assigned fort crockett located galveston texas 1930 returned kelly field served flying instructor 1934 ordered engineering armament school chanute field illinois 1935 1942 held various assignments panama virginia louisiana florida samford assistant chief staff g-1 headquarters third air force tampa florida appointed chief staff viii air force composite command located northern ireland 1943 samford appointed deputy chief staff eighth air force later chief staff viii bomber command 1944 samford promoted brigadier general appointed chief staff eighth air force october 1944 appointed deputy assistant chief staff a-2 headquarters u.s. army air forces january 1947 samford appointed commander 24th composite wing soon thereafter became antilles air division caribbean air command may 1949 samford appointed commandant air command staff school promoted major general 1950 held brief appointment commandant air war college appointed director intelligence united states air force samford tenure director air force intelligence project blue book investigated unidentified flying objects ufos started july 29 1952 stamford conducted press conference pentagon related ufos samford mentioned beginning 1956 film ufo examined phenomena unidentified flying objects samford served vice director national security agency june august 1956 november samford appointed director national security agency promoted lieutenant general held post retirement november 23 1960 successor nsa director admiral laurence h. frost died november 20 1968 washington dc | [
4210,
4666,
202,
820,
7895,
6627,
1278,
3716,
7191,
228,
4429,
7917,
5412,
5767,
5509,
7568,
4727,
2343,
4996,
258,
3335,
1701,
4201
] | Test |
4,989 | 5 | Interarchy:interarchy interarchy ftp client macos supporting ftp sftp scp webdav amazon s3 made nolobe supports many advanced features transferring syncing managing files internet interarchy created mac programmer peter n lewis 1993 macintosh system 7 lewis went form stairways software 1995 continue development interarchy 2007 lewis sold interarchy matthew drayton nolobe continues develop interarchy day drayton employee stairways software worked developer interarchy alongside lewis since 2001 interarchy originally called anarchie archie client name changed interarchy 2000 due conflict cybersquatter | [
4453,
6905,
7838,
5571
] | Test |
4,990 | 2 | LibreSSL:libressl libressl open-source implementation transport layer security tls protocol implementation named secure sockets layer ssl deprecated predecessor tls support removed release 2.3.0 openbsd project forked libressl openssl 1.0.1g april 2014 response heartbleed security vulnerability goals modernizing codebase improving security applying development best practices heartbleed security vulnerability discovered openssl openbsd team audited codebase decided necessary fork openssl remove dangerous code libressl.org domain registered 11 april 2014 project announced name 22 april 2014 first week development 90,000 lines c code removed unused code removed support obsolete operating systems removed libressl initially developed intended replacement openssl openbsd 5.6 ported platforms stripped-down version library stable project seeking stable commitment external funding 17 may 2014 bob beck presented libressl first 30 days future holds 2014 bsdcan conference described progress made first month 5 june 2014 several openssl bugs became public several projects notified advance libressl theo de raadt accused openssl developers intentionally withholding information openbsd libressl 20 june 2014 google created another fork openssl called boringssl promised exchange fixes libressl google already relicensed contributions isc license requested libressl developers 21 june 2014 theo de raadt welcomed boringssl outlined plans libressl-portable starting 8 july code porting macos solaris began initial porting linux began 20 june libressl default provider tls libressl selectable provider tls changes include replacement custom memory calls ones standard library example codice_1 codice_2 codice_3 codice_4 etc. process may help later catch buffer overflow errors advanced memory analysis tools observing program crashes via aslr use nx bit stack canaries etc. fixes potential double free scenarios also cited vcs commit logs including explicit assignments null pointer values extra sanity checks also cited commit logs related ensuring length arguments unsigned-to-signed variable assignments pointer values method returns order maintain good programming practice number compiler options flags designed safety enabled default help spotting potential issues fixed earlier -wall -werror -wextra -wuninitialized also code readability updates help future contributors verifying program correctness knf white-space line-wrapping etc. modification removal unneeded method wrappers macros also help code readability auditing error i/o abstraction library references changes made ensure libressl year 2038 compatible along maintaining portability similar platforms addition codice_5 codice_6 calls added prevent compiler optimizing prevent attackers reading previously allocated memory changes help ensure proper seeding random number generator-based methods via replacements insecure seeding practices taking advantage features offered kernel natively terms notable additions made openbsd added support newer reputable algorithms chacha stream cipher poly1305 message authentication code along safer set elliptic curves brainpool curves rfc 5639 512 bits strength initial release libressl added number features chacha poly1305 algorithm brainpool anssi elliptic curves aes-gcm chacha20-poly1305 aead modes later versions added following initial release libressl disabled number features default code features later removed including kerberos us-export ciphers tls compression dtls heartbeat ssl v2 ssl v3 later versions disabled features initial release libressl removed number features deemed insecure unnecessary deprecated part openbsd 5.6 dual ec drbg algorithm suspected back door cut along support fips 140-2 standard required unused protocols insecure algorithms also removed including support fips 140-2 md4/md5 j-pake srp one complaints openssl number open bugs reported bug tracker gone unfixed years older bugs fixed libressl | [
363,
3932,
359,
6414,
6795,
6085,
5373,
1460,
3635,
5399,
405,
6458,
2587,
3986,
7567,
7925,
5773,
1133,
6487,
7214,
6489,
74,
5440,
4014,
1513,
2620,
794,
3350,
5808,
4759,
1168,
1173,
7975,
2644,
7258,
5824,
6540,
5488,
1559,
6553,
15... | Test |
4,991 | 2 | Snappy_(package_manager):snappy package manager snappy software deployment package management system developed canonical linux operating system packages called snaps tool using snapd work across range linux distributions allowing distro-agnostic upstream software packaging snappy originally designed ubuntu touch system designed work internet things cloud desktop computing snapcraft tool developing snap packages snap application packages software self-contained work across range linux distributions unlike traditional linux package management approaches like apt yum require specifically adapted packages linux distribution therefore adding delay application development deployment end-users snaps dependency app store obtained source therefore used upstream software deployment snaps deployed ubuntu versions linux ubuntu app store used default back-end stores enabled well developers use snaps create command line tools background services well desktop applications snap application upgrades via atomic operation deltas possible june 2016 snapd ported wide range linux distributions enable snaps used across linux distribution all-snap ubuntu core snapd also available progress arch linux centos debian fedora solus manjaro linux linux mint openembedded raspbian openwrt opensuse distribution able interpret snap metadata implement security expectations snap distribution-specific fashion snapcraft tool developers package programs snap format snappy snap file format single compressed filesystem based squashfs format mounted dynamically host operating system together declarative metadata interpreted snap system set appropriately shaped secure sandbox container application file format extension .snap snappy packaging deployed internet things environments ranging consumer-facing products enterprise device management gateways snappy included default ubuntu desktop images version 16.04 onwards developer screen capture tool peek discontinued support snap packages continuing support flatpak appimage stating developers systems administrators voiced complaints snap highly unsuitable mission-critical applications since autoupdates turned basic feature missing design choice snap developers led unexpected downtime services restart buggy software enters snap distribution system red hat employee adam williamson acknowledging bias criticized snap keeping server side closed source mechanism using third party servers sign contributor license agreement contribute development | [
5017,
5726,
4675,
2581,
7555,
2585,
2594,
1873,
781,
5092,
7619,
3366,
5480,
4778,
2297,
4059,
4435,
4441,
523,
163,
5523,
6586,
5530,
6951,
7696,
8055,
1621,
5200,
5545,
6609,
1260,
5912,
5571,
578,
2034,
2771,
6663,
1684,
952,
4187,
6... | Train |
4,992 | 2 | Install_Party_des_Savoie:install party des savoie install party des savoie kind installfest social event aims popularize linux operating system libre software day people pays de savoie savoy upper savoy departements welcomed get familiar new desktop environment linux renowned ability reliable virus-free thus local public many ways discover concept free software traditionally install party des savoie takes place may various cities amongst two savoys instance annecy chambery 2010 edition local non-profit societies agu3l alpinux marmottux take active part organisation specific installfest 2011install party des savoie took place may 21 chambery jean-jacques rousseau media librairy lugs savoy gathered together linux mint debian edition lmde system adopted presented public live dvd installed computers first time france attempt visioconferencing made two different installfeists via videoconferencing tools ekiga xmpp protocol | [
7148,
5571,
578
] | Validation |
4,993 | 3 | Hardware_scout:hardware scout hardware scout technique uses otherwise idle processor execution resources perform prefetching cache misses thread stalled cache miss processor pipeline checkpoints register file switches runahead mode continues issue instructions thread waiting memory thread execution run-ahead mode known scout thread data returns memory processor restores register file contents checkpoint switches back normal execution mode computation run-ahead mode discarded processor nevertheless scouting provides speedup memory level parallelism mlp increased cache lines brought cache hierarchy often used processor switches back normal mode sun rock processor later canceled used form hardware scout however computations run-ahead mode depend cache miss may retired immediately allows prefetching traditional instruction-level parallelism scouting simultaneous multithreading smt use hardware threads fight memory wall scouting scout thread runs instructions instruction stream instruction causes pipeline stall case smt smt thread executes instruction another context thus smt increases throughput processor scouting increases performance lowering number cache misses | [
553,
2992,
5371,
1546,
4049,
5042,
7453,
4154,
1481,
5939,
4159,
1023,
1295,
3041,
1405,
1586,
1678,
515,
2961,
8130,
2248,
1786,
3667,
2969,
7499,
1237,
4742,
5447,
357,
4839,
5890
] | Test |
4,994 | 9 | Object_type_(object-oriented_programming):object type object-oriented programming computer science object type a.k.a wrapping object datatype used object-oriented programming wrap non-object type make look like dynamic object object-oriented programming languages make distinction reference value types often referred objects non-objects platforms complex value types n't exist reasons runtime efficiency syntax semantic issues example java primitive wrapper classes corresponding primitive type etc languages like c++ little notion reference type thus use object type little interest boxing otherwise known wrapping process placing primitive type within object primitive used reference object example java change size array must fixed size one might desire class lists references dynamic objects—it list primitive types value types circumvent boxed dynamic objects added using generic parameterized types introduced j2se 5.0 type represented hand c primitive wrapper classes allows boxing value type returning generic reference boxed object always copy value object usually immutable unboxing object also returns copy stored value repeated boxing unboxing objects severe performance impact boxing dynamically allocates new objects unboxing boxed value longer used makes eligible garbage collection however modern garbage collectors default java hotspot garbage collector efficiently collect short-lived objects boxed objects short-lived performance impact may bad direct equivalence unboxed primitive type reference immutable boxed object type fact possible substitute primitive types program boxed object types whereas assignment one primitive another copy value assignment one reference boxed object another copy reference value refer object first reference however cause problems objects immutable semantically real difference two references object different objects unless look physical equality operations assignment arithmetic comparison logical operators one unbox boxed type perform operation re-box result needed thus possible store primitive types autoboxing term getting reference type value type type conversion either implicit explicit compiler automatically supplies extra source code creates object example versions java prior j2se 5.0 following code compile compilers prior 5.0 would accept last line reference objects surface different forth convert one manually instantiate integer object j2se 5.0 compiler accept last line automatically transform integer object created store value means j2se 5.0 something like compile b unboxed integer values summed result autoboxed new finally stored inside variable equality operators used way equality operators already defined reference types equality references test equality value boxed type one must still manually unbox compare primitives use method another example j2se 5.0 allows programmer treat collection contained values instead objects contradict said collection still contains references dynamic objects list primitive types must instead however compiler automatically transforms code list silently receive objects source code mentions primitive values example programmer write think added list compiler actually transformed line unboxing refers getting value associated given object type conversion either implicit explicit compiler automatically supplies extra source code retrieves value object either invoking method object means example versions java prior j2se 5.0 following code compile c n't support automatic unboxing meaning java n't separate set primitive types object types types primitive object version java automatically implemented c compiler either primitive value types object reference types languages automatic boxing downcast automatically i.e following code wo n't compile c java modern object pascal yet another way perform operations simple types close boxing called type helpers freepascal record helpers delphi freepascal delphi mode. br dialects mentioned object pascal compile-to-native languages miss features c java implement notably run-time type inference strongly typed variables. br feature related boxing. br allows programmer use constructs like | [
1616,
5506
] | Test |
4,995 | 9 | LPC_(programming_language):lpc programming language lpc short lars pensjö c object-oriented programming language derived c developed originally lars pensjö facilitate mud building lpmuds though designed game development flexibility led used variety purposes evolution language pike lpc syntax places family c-like languages c c++ strongest influences almost everything lpc object however lpc precisely use concept class mudos something called class really struct instead lpc objects blueprint objects clones blueprint objects prototype-based programming model one treat blueprint object much class object-oriented languages object variables attributes functions methods variables store object state functions executable routines called object object uniquely defined name file comes plus clone numeric identifier typical implementation clone file codice_1 third clone created current run session codice_2 blueprint object corresponding codice_1 simply codice_4 mud game common objects include rooms weapons armor non-player character npcs mudlibs define inheritable objects common things lpmud 2.4.5 mudlib example parent object rooms codice_5 lpc possible syntactically declare class-only instance-only methods attributes functions variables may accessed identically blueprints clones example codice_6 would call codice_7 function directly blueprint instance codice_8 however controversial mechanism many drivers called shadowing allows instance methods emulated extent permitting one object overlay function set onto another effect interposing external function calls shadowed object direct external access variables also supported interaction objects carried function calls notwithstanding data structures pointed variables independent objects changes visible objects referencing data structures simultaneously drivers privileged functions allowing cumbersome form external variable access permits inspection mutation lpc generally used code muds 'rooms often created objects store information describing particular scene along exits point room objects common usage lpc uses game related possible following example shows simple traditional room leverages functions defined mudlib object codice_5 however mudlibs define determine rooms way method defining room first line tells object inherit functionality codice_5 object example assumes codice_5 object defines functions codice_12 codice_13 example contains single function codice_14 drivers call set call codice_14 allow object initialize startup values standard constructor case example calls functions set basic room attributes inherited codice_5 functions called highly dependent mudlib use since mudlib defines actual room parent drivers also support applying type modifiers inherit statements causing inherited object behave respect inheritor type modifier applied functions and/or variables appropriate term object variable used means variable element object i.e attribute opposed local variable exists within function block global variable nonexistent lpc — someone speaks global variable reference lpc probably mean object variable primitive lpc types int string status float etc passed value data structure types object array mapping class struct passed reference feature powerful also lead security holes muds people building world generally less trusted staff running game object passes mapping sensitive values like access control information author another object modify thus increase access rights mudlib developers server administrators thus careful passing complex types lower access objects lpc environments generally categorize functions several major types according implemented lpc implementations generally master object specific lpc object loaded first lpc driver essentially controls happen past point master object typically tell driver simul_efun object preload objects need present startup define functions called object loaded otherwise configure driver operation driver refer back master object needs interact central point reference running environment accepting network connections handling errors validating attempts perform privileged operations | [
6507,
5983,
1356,
7739,
3547,
6029,
5056,
5510,
4543,
8137,
4906,
3677,
7952,
1803,
1435
] | Test |
4,996 | 4 | Gordon_Blake:gordon blake gordon aylesworth blake july 22 1910 – september 1 1997 lieutenant general united states air force served director national security agency 1962 1965 gordon aylesworth blake born charles city iowa july 22 1910 son george cecelia blake graduated high school charles city appointed united states military academy late gilbert n. haugen 1927 graduating june 11 1931 commissioned second lieutenant coast artillery corps detailed student officer pilot training october 1932 blake completed primary advanced flying schools transferred air corps january 25 1933 assigned pursuit squadron barksdale field louisiana entering signal school fort monmouth new jersey july 1934 completed communications officers course following june assigned communications instructor air corps technical school chanute field illinois going hawaii february 1939 blake communications officer 18th composite wing september 1941 acted communications officer first land-based aircraft flight hawaii philippines flight made b-17 bombers sent philippines reinforcements flew pioneer route – midway island wake island port moresby new guinea darwin australia clark field philippine islands members flight awarded distinguished flying cross december 7 1941 blake base operations officer rank major hickam field japanese attack pearl harbor awarded silver star gallantry action day became operations officer seventh air force base command promoted lieutenant colonel spent first months world war ii supervising operation airplane ferry route australia via christmas island – canton island – fiji – new caledonia october 1942 blake shifted back communications work commanded army airways communications system pacific rest world war ii exception period october 1943 january 1944 temporary duty alaska established air communications office alaska promoted colonel november 1942 august 28 1945 accompanied special 150-man task force japan prepare airborne occupation troop landings august 30 work world war ii blake awarded legion merit admiral chester w. nimitz plus oak leaf cluster legion merit war department air medal oak leaf cluster battle stars participation following campaigns central pacific eastern mandates new guinea north solomons guadalcanal papua south philippines luzon western pacific returned overseas november 1945 january 1946 appointed deputy commander airways air communications service langley field virginia entering air war college maxwell air force base alabama august 1947 blake graduated following june went research development work wright-patterson air force base ohio 1948 1951 electronics subdivision engineering division served chief armament laboratory summer 1951 placed charge 12 development laboratories promoted brigadier general final assignment wright field vice-commander june 1952 january 1953 transferred air force headquarters january 1953 blake appointed deputy director communications office deputy chief staff operations becoming director communications following month many changes united states air force system global communications navigation including pioneer operational circuits using tropospheric scatter communications first time carried tour director communications blake named assistant deputy chief staff operations june 2 1956 capacity served permanent joint board defense canada — us many defense projects dewline radar network planned two countries latter part washington assignment given aeronautical rating command pilot promoted major general highest permanent rank regular service blake left washington january 4 1957 become commander united states air force security service major component united states air force headquarters san antonio texas awarded air force distinguished service medal exceptionally meritorious conduct performance outstanding service command september 1 1959 blake assigned vice-commander-in-chief chief staff pacific air forces air arm joint pacific command headquarters hawaii blake came headquarters continental air command july 1961 commander-designate assumed command continental air command september 30 1961 became lieutenant general october 1 1961 blake assumed position director national security agency fort george g. meade maryland july 1 1962 held retirement 1965 us air force aircraft save award named awarded action taken air traffic controller airfield manager results safe recovery imperiled airborne aircraft help given endangered aircraft ground | [
4210,
820,
6627,
1278,
3716,
4429,
7917,
5412,
5767,
5509,
4988,
2343,
1701,
4201
] | Test |
4,997 | 3 | Java_bytecode_instruction_listings:java bytecode instruction listings list instructions make java bytecode abstract machine language ultimately executed java virtual machine java bytecode generated languages running java platform notably java programming language note referenced value refers 32-bit int per java instruction set | [
3077,
631,
7347,
7459,
3879,
2519,
2520,
6319,
2619,
4287
] | Test |
4,998 | 9 | Hack_(programming_language):hack programming language hack programming language hiphop virtual machine hhvm created facebook dialect php language implementation open-source licensed mit license hack allows programmers use dynamic typing static typing kind type system called gradual typing also implemented programming languages actionscript hack type system allows types specified function arguments function return values class properties however types local variables always inferred specified hack introduced march 20 2014 announcement new programming language facebook already implemented code battle tested large portion web site hack designed interoperate seamlessly php widely used open-source scripting language focus web development embedded html majority valid php scripts also valid hack however numerous less frequently used php features language constructs supported hack hack extends type hinting available php 5 introduction static typing adding new type hints example scalar types integer string well extending use type hints example class properties function return values however types local variables specified since hack uses gradual typing system default mode type annotations mandatory even places inferred type system assume author correct admit code however strict mode available requires annotations thus enforces fully sound code basic file structure hack script similar php script changes hack file n't include codice_1 opening markup tag forbids using top-level declarations thus would need write code within entrypoint function entrypoint functions automatically executed top-level file automatically executed file included via include require autoloader like functions hack function names must unique within project – i.e projects multiple entrypoints call main « __entrypoint » function main void script similar php executed following output sent browser hello world important point note unlike php hack html code mix normally mix php html code together file like html /html type code supported hack either xhp another template engine needs used hack allows types specified function arguments function return values functions hack thus annotated types like following // hack functions annotated types function negate bool x bool | [
2451,
5983,
4296,
4758,
6701,
7246,
993,
6428,
5117,
1737,
2740,
3368,
1643,
6628,
5571,
3542,
7370,
4705,
5141,
6029,
840,
933,
4070,
5948,
5091,
5506,
1491,
3898,
5092,
1774,
336,
7933,
4543,
5433,
5965,
3915,
7687,
6061,
2803,
2619,
... | Test |
4,999 | 9 | Fortress_(programming_language):fortress programming language fortress discontinued experimental programming language high-performance computing created sun microsystems funding darpa high productivity computing systems project one language designers guy l. steele jr. whose previous work includes scheme common lisp java name fortress intended connote secure fortran i.e. language high-performance computation provides abstraction type safety par modern programming language principles language features included implicit parallelism unicode support concrete syntax similar mathematical notation language designed similar fortran syntactically resembles scala standard ml haskell fortress designed outset multiple syntactic stylesheets source code rendered ascii text unicode prettied image would allow support mathematical symbols symbols rendered output easier reading emacs-based tool called fortify transforms ascii-based fortress source code latex output fortress also designed highly parallel rich functionality contained within libraries drawing java example codice_1 loop construct parallel operation would necessarily iterate strictly linear manner depending underlying implementation however codice_1 construct library function could replaced another version programmer liking rather built language fortress designers made syntax close possible pseudocode analyzed hundreds computer science mathematics papers courses books journals using pseudocode extract common usage patterns english language standard mathematical notation used represent algorithms pseudocode made compiler trying maintain one-to-one correspondence pseudocode executable fortress fortress one three languages created funding high productivity computing systems project others x10 ibm chapel cray inc november 2006 darpa approved funding third phase hpcs project x10 chapel funded fortress leading uncertainty future fortress january 2007 fortress transformed open-source project open-source community people outside sun write fortress code test using open-source fortress interpreter version 1.0 fortress language specification released april 2008 along compliant implementation targeting java virtual machine july 2012 steele announced active development fortress would cease brief winding-down period citing complications using fortress type system existing virtual machines fortress version archetypal hello world program presented fortress reference card export statement makes program executable every executable program fortress must implement run function file program saved compilation must name one specified initial component statement println function outputs hello world words screen | [
5098,
1254,
3606,
2820,
1445,
1258,
6886,
1923,
3619,
5288,
5117,
6505,
6270,
908,
2740,
7535,
1185,
2299,
5571,
6356,
4418,
4872,
2033,
7781,
4705,
4967,
1569,
4067,
3981,
1023,
4070,
5587,
1116,
418,
7114,
4085,
3820,
7032,
6766,
7860,
... | Test |
5,000 | 5 | Voodoo_Chat:voodoo chat voodoo chat opened late december 2001 text-based chat program voice chat features created wake excite virtual places closure due company bankruptcy following acquisition home network impending closure excite virtual places new chat venue needed house soon displaced users service initially chief software engineer excite chat service tom lang proposed subscription based service using virtual places software received response lotus software regarding license two months without word subscription based service idea considered dead development alternative chat venue mike parniak using original software rather existing virtual places software began mid-2001 two months creation would later known voodoo chat lang finally received word would granted license use virtual places subscription based service development voodoo chat continued despite removal lang obstacles first version chat opened december 2001 originally voodoo chat run server hierarchy within overlay network today service works little differently voodoo chat apart text-based chatting system also avatars images representing oneself displayed top screen foreground web page said images size width height though programs defaults set 300x300 file size limit 15kb images also effects supported in-house flipping rotating turning black white inverting pixelating blur grow shrink october 9 2007 voice chat come current version voodoo sequenced voice chat works sending clips 20 seconds voice users chat room non-real-time even streamed voice chat 'realtime given high latency typically encountered 'seems likewise nobody tests expressed feeling things 'out sync problematic way voodoo chat uses two methods security first encryption second use system hashes voodoo method encryption encrypts transfers data program increase privacy deter hackers far according website none cracked protocol plenty tried voodoo client generates set system hashes pieces serial numbers within hardware users computer gathered program starts transmitted user attempts log users hashes checked global hash ban list king checked banned hash list specific server 're logging system hash matches either ban list user barred service | [
1128,
2566,
4759,
5571,
3160,
3795,
3486
] | Test |
5,001 | 4 | Homeland_Open_Security_Technology:homeland open security technology homeland open security technology host five-year 10 million program department homeland security science technology directorate promote creation use open security open-source software united states government military especially areas pertaining computer security proponent david a. wheeler claims open-source security could also extend hardware written documents october 2011 project open source america 2011 government deployment open source award project contracted open technology research consortium consists georgia tech research institute primary center agile technology university texas austin open source software institute open information security foundation project contributed funding towards openssl software foundation open information security foundation october 2012 host hosted open cybersecurity summit washington d.c. one-day summit keynote stewart a. baker former assistant secretary policy department homeland security | [
298,
5454,
1805,
6112
] | Test |
5,002 | 2 | IAd:iad iad discontinued mobile advertising platform developed apple inc. iphone ipod touch ipad line mobile devices allowing third-party developers directly embed advertisements applications announced april 8 2010 iad part apple ios 4 originally slated release june 21 2010 actual date changed july 1 2010. iad announced apple june 7 2010 keynote ipad version appearing fall hosted sold apple iad platform expected compete google admob mobile advertising service similar admob iad facilitates integrating advertisements applications sold ios app store user tapped iad banner full-screen advertisement appeared within application unlike ads would send user safari web browser ads promised interactive advertising services users able close time returning left app former apple ceo steve jobs initially indicated apple would retain 40 ad revenue line called industry standard 60 going developers amount paid developers later increased 70 iad expected benefit free applications well iad app network discontinued june 30 2016 since technology lives apple news advertising app store search ads | [
6788,
3940,
7890,
4320,
2926,
4690,
734,
5752,
405,
6125,
2954,
1123,
6847,
4003,
6142,
2609,
1895,
1897,
4376,
5091,
4749,
5450,
7601,
6165,
3001,
2284,
120,
1940,
2300,
3025,
2665,
502,
2679,
2327,
6565,
2331,
3050,
4820,
163,
1599,
6... | Validation |
5,003 | 1 | Hypertable:hypertable hypertable open-source software project implement database management system inspired publications design google bigtable hypertable runs top distributed file system apache hdfs glusterfs cloudstore kosmos file system kfs written almost entirely c++ developers believed significant performance advantages java hypertable software originally developed company zvents 2008 doug judd promoter hypertable january 2009 baidu chinese language search engine became project sponsor version 0.9.2.1 described blog february 2009 development ended march 2016 | [
5455,
8062,
5571,
578
] | Validation |
5,004 | 4 | Information_security_awareness:information security awareness information security awareness evolving part information security focuses raising consciousness regarding potential risks rapidly evolving forms information rapidly evolving threats information target human behavior threats matured information increased value attackers increased capabilities expanded broader intentions developed attack methods methodologies acting diverse motives information security controls processes matured attacks matured circumvent controls processes attackers targeted successfully exploited individuals human behavior breach corporate networks critical infrastructure systems targeted individuals unaware information threats may unknowingly circumvent traditional security controls processes enable breach organization response information security awareness maturing cybersecurity business problem dominated agenda chief information officers cio exposing need countermeasures today cyber threat landscape goal information security awareness make everyone aware susceptible opportunities challenges today ’ threat landscape change human risk behaviors create enhance secure organizational culture information security awareness one several key principles information security information security awareness seeks understand enhance human risk behaviors beliefs perceptions information information security also understanding enhancing organizational culture countermeasure rapidly evolving threats example oecd guidelines security information systems networks include nine generally accepted principles awareness responsibility response ethics democracy risk assessment security design implementation security management reassessment context internet type awareness sometimes referred cyber security awareness focus multiple initiatives including u.s. department homeland security national cyber security awareness month president obama 2015 white house summit cybersecurity consumer protection computer based crimes something new us viruses us well 20 years spyware clocked decade since earliest incidents large-scale use phishing traced back least 2003 one reasons researchers agreed upon pace information system evolving expanding security awareness program among employees falling way behind unfortunately however seems rapid adoption online services matched corresponding embrace security culture information security awareness evolving response evolving nature cyber attacks increased targeting personal information cost scale information security breaches furthermore many individuals think security terms technical controls realizing individuals targets behavior increase risks provide countermeasures risks threats determining measuring information security awareness highlighted need accurate metrics response need information security awareness metrics rapidly evolving order understand measure human threat landscape measure change human understanding behavior measure reduce organizational risk measure effectiveness cost information security awareness countermeasure organizations want invest money information security survey conducted pricewaterhousecoopers 2014 found current employees 31 former employees 27 still contribute information security incidents survey results indicated number actual incidents attributable employees risen 25 since 2013 survey security awareness program best solution organization adopt reduce security threats caused internal employees security awareness program helps employees understand information security individual ’ responsibility responsibility everyone program also explicitly mentions employees responsible activities performed identifications furthermore program enforces standard ways handling business computers although organizations adopted standard way providing security awareness program good program include awareness data network user conduct social media use mobile devices wifi phishing emails social engineering different types viruses malware effective employee security awareness program make clear everyone organization responsible security auditors pay close attention six areas covered program data networks user conduct social media mobile devices social engineering many organizations make privacy policies complicated diverse employees always fail understand regulations privacy policy something reminded employees whenever login business computer privacy policies clearer shorter standardized enable better comprehension comparison privacy practices organizations create interactive sessions employees attend every week speak security threats interactive sessions may include awareness newer threats best practices questions answers security awareness program may beneficial organization penalize violators employees found guilty violating program reported higher executives action otherwise program effective information security authorities may perform gap analysis find deficiencies program early 2015 cios rated information security awareness related issues top strategic priorities example february 2015 wall street journal cio network event convened create prioritized set recommendations drive business policy coming year consensus seemed form around cybersecurity delivering change effective communication rest business information security awareness high-profile breaches forefront organization agenda recent study 220 security awareness officers lance spritzner uncovered three related key findings first executive financial support necessary successful security awareness program second due technical nature traditional security controls countermeasures soft skills necessary understand change human behavior lacking finally terms maturity model security awareness still infancy effectively measuring human risk behavior difficult risky behaviors beliefs perceptions often unknown addition attacks phishing social engineering incidents data leakage sensitive data posted social media sites even breaches go undetected unknown making difficult determine measure points failure often attacks incidents breaches reacted reported outside compromised organization attackers covered tracks thus researched measured proactively addition malicious traffic often goes unnoticed attackers often spy mimic known behavior order prevent intrusion detection access monitoring alerts 2016 study developed method measuring security awareness specifically measured understanding circumventing security protocols disrupting intended functions systems collecting valuable information getting caught p. 38 researchers created method could distinguish experts novices people organize different security scenarios groups experts organize scenarios based centralized security themes novices organize scenarios based superficial themes simulated phishing campaigns run regularly provide measures user compliance | [
3143,
4953,
1805
] | Validation |
5,005 | 1 | Liquibase:liquibase liquibase open-source database-independent library tracking managing applying database schema changes started 2006 allow easier tracking database changes especially agile software development environment changes database stored text files xml yaml json sql identified combination id author tag well name file list applied changes stored database consulted database updates determine new changes need applied result database version number approach allows work environments multiple developers code branches liquibase automatically creates databasechangelog table databasechangeloglock table first execute changelog file datical largest contributor liquibase project developer datical db – commercial product provides core liquibase functionality plus additional features datical db used dbas release managers devops teams application owners architects developers involved application release process manages database schema changes together application code programmatic fashion eliminates errors delays enables rapid agile releases datical db builds upon liquibase data model approach managing data structure specific content across application versions advance development test production environments datical previews impact schema changes environment deployment thus mitigating risk resulting smoother faster application changes liquibase developer nathan voxland executive datical | [
3915,
2663,
5571,
3463
] | Train |
5,006 | 9 | Mesa_(programming_language):mesa programming language mesa programming language developed late 1970s xerox palo alto research center palo alto california united states language name pun based upon programming language catchphrases time mesa high level programming language mesa algol-like language strong support modular programming every library module least two source files definitions file specifying library interface plus one program files specifying implementation procedures interface use library program higher-level library must import definitions mesa compiler type-checks uses imported entities combination separate compilation type-checking unusual time mesa introduced several innovations language design implementation notably handling software exceptions thread synchronization incremental compilation mesa developed xerox alto one first personal computers graphical user interface however alto system software written bcpl mesa system programming language later xerox star workstations globalview desktop environment xerox parc later developed cedar superset mesa mesa cedar major influence design important languages modula-2 java important vehicle development dissemination fundamentals guis networked environments advances xerox contributed field computer science mesa originally designed computer systems laboratory csl branch xerox palo alto research center alto experimental micro-coded workstation initially spread confined parc universities xerox donated altos mesa later adopted systems programming language xerox commercial workstations xerox 8010 xerox star dandelion xerox 6085 daybreak particular pilot operating system secondary development environment called xerox development environment xde allowed developers debug operating system pilot well viewpoint gui applications using world swap mechanism allowed entire state world swapped allowed low level system crashes paralyzed whole system debugged technique scale well large application images several megabytes pilot/mesa world later releases moved away world swap view micro-coded machines phased favor sparc workstations intel pcs running mesa princops emulator basic hardware instruction set mesa compiled stack-machine language purportedly highest code density ever achieved roughly 4 bytes per high-level language statement touted 1981 paper implementors xerox systems development department development arm parc tuned instruction set published paper resultant code density mesa taught via mesa programming course took people wide range technology xerox available time ended programmer writing hack workable program designed useful actual example hack bwsmagnifier written 1988 allowed people magnify sections workstation screen defined resizable window changeable magnification factor trained mesa programmers xerox well versed fundamental guis networking exceptions multi-threaded programming almost decade became standard tools trade within xerox mesa eventually superseded cedar programming language many mesa programmers developers left xerox 1985 went dec systems research center used experience mesa design modula-2+ later modula-3 mesa strongly typed programming language type-checking across module boundaries enough flexibility type system heap allocators could written mesa strict separation interface implementation mesa allows true incremental compilation encourages architecture- platform-independent programming also simplified source-level debugging including remote debugging via ethernet mesa rich exception handling facilities four types exceptions support thread synchronization via monitors mesa first language implement monitor broadcast concept introduced pilot operating system mesa imperative algebraic syntax based algol pascal rather bcpl c instance compound commands indicated keywords rather braces mesa keywords written uppercase due peculiarity ascii variant used parc alto character set included left-pointing arrow ← rather underscore result alto programmers including using mesa smalltalk etc conventionally used camelcase compound identifiers practice incorporated parc standard programming style hand availability left-pointing arrow allowed use assignment operator originally algol mesa designers wanted implement exception facility hired recent m.s graduate colorado written thesis exception handling facilities algorithmic languages led richest exception facility time primitives language type-safe checks verify full coverage signal handling uncaught exceptions common cause bugs released software xerox parc later developed cedar superset mesa number additions including garbage collection better string support called ropes later native compiler sun sparc workstations importantly cedar contained type-safe subset compiler subset-checking mode ensure deterministic execution memory leaks conformant cedar code mesa precursor programming language cedar cedar main additions garbage collection dynamic types limited form type parameterization special syntax identify type-safe parts multi-module software package | [
1616,
7700,
1522,
2005,
4589,
1361,
908,
304,
8097,
931,
5948,
6922,
5424,
7678,
6497,
3069,
971,
1435
] | Test |
5,007 | 1 | Apache_Calcite:apache calcite apache calcite open source framework building databases data management systems includes sql parser api building expressions relational algebra query planning engine framework calcite store data metadata instead allows external data metadata accessed means plug-ins several apache projects use calcite hive uses calcite cost-based query optimization drill kylin use calcite sql parsing optimization samza storm use calcite streaming sql apex phoenix flink projects development use calcite | [
7238,
894,
4303,
5728,
7805,
2741,
7444,
7896,
917,
5571,
3463,
3542,
3204,
1286,
6821,
5054,
840,
1392,
3031,
5408,
3558,
5677,
3479,
5863,
6387,
5075,
6137,
7488,
7857,
5874,
3915,
1792,
1511,
4742,
1333,
702
] | Train |
5,008 | 0 | Machine_translation:machine translation machine translation sometimes referred abbreviation mt confused computer-aided translation machine-aided human translation maht interactive translation sub-field computational linguistics investigates use software translate text speech one language another basic level mt performs simple substitution words one language words another alone usually produce good translation text recognition whole phrases closest counterparts target language needed solving problem corpus statistical neural techniques rapidly growing field leading better translations handling differences linguistic typology translation idioms isolation anomalies current machine translation software often allows customization domain profession weather reports improving output limiting scope allowable substitutions technique particularly effective domains formal formulaic language used follows machine translation government legal documents readily produces usable output conversation less standardised text improved output quality also achieved human intervention example systems able translate accurately user unambiguously identified words text proper names assistance techniques mt proven useful tool assist human translators limited number cases even produce output used e.g. weather reports progress potential machine translation debated much history since 1950s number scholars questioned possibility achieving fully automatic machine translation high quality first notably yehoshua bar-hillel critics claim in-principle obstacles automating translation process idea machine translation may traced back 17th century 1629 rené descartes proposed universal language equivalent ideas different tongues sharing one symbol field machine translation appeared warren weaver memorandum translation 1949 first researcher field yehosha bar-hillel began research mit 1951 georgetown university mt research team followed 1951 public demonstration georgetown-ibm experiment system 1954 mt research programs popped japan russia 1955 first mt conference held london 1956 researchers continued join field association machine translation computational linguistics formed u.s. 1962 national academy sciences formed automatic language processing advisory committee alpac study mt 1964 real progress much slower however alpac report 1966 found ten-year-long research failed fulfill expectations funding greatly reduced according 1972 report director defense research engineering ddr e feasibility large-scale mt reestablished success logos mt system translating military manuals vietnamese conflict french textile institute also used mt translate abstracts french english german spanish 1970 brigham young university started project translate mormon texts automated translation 1971 xerox used systran translate technical manuals 1978 beginning late 1980s computational power increased became less expensive interest shown statistical models machine translation various mt companies launched including trados 1984 first develop market translation memory technology 1989 first commercial mt system russian english german-ukrainian developed kharkov state university 1991 mt web started systran offering free translation small texts 1996 followed altavista babelfish racked 500,000 requests day 1997 franz josef och future head translation development google darpa speed mt competition 2003 innovations time included moses open-source statistical mt engine 2007 text/sms translation service mobiles japan 2008 mobile phone built-in speech-to-speech translation functionality english japanese chinese 2009 recently google announced google translate translates roughly enough text fill 1 million books one day 2012 idea using digital computers translation natural languages proposed early 1946 a. d. booth possibly others warren weaver wrote important memorandum translation 1949 georgetown experiment means first application demonstration made 1954 apexc machine birkbeck college university london rudimentary translation english french several papers topic published time even articles popular journals example article cleave zacharov september 1955 issue wireless world similar application also pioneered birkbeck college time reading composing braille texts computer human translation process may described behind ostensibly simple procedure lies complex cognitive operation decode meaning source text entirety translator must interpret analyse features text process requires in-depth knowledge grammar semantics syntax idioms etc. source language well culture speakers translator needs in-depth knowledge re-encode meaning target language therein lies challenge machine translation program computer understand text person create new text target language sounds written person general application beyond current technology though works much faster automated translation program procedure human participation produce output even close quality human translator produce however provide general though imperfect approximation original text getting gist process called gisting sufficient many purposes including making best use finite expensive time human translator reserved cases total accuracy indispensable problem may approached number ways evolution accuracy improved machine translation use method based linguistic rules means words translated linguistic way – suitable orally speaking words target language replace ones source language often argued success machine translation requires problem natural language understanding solved first generally rule-based methods parse text usually creating intermediary symbolic representation text target language generated according nature intermediary representation approach described interlingual machine translation transfer-based machine translation methods require extensive lexicons morphological syntactic semantic information large sets rules given enough data machine translation programs often work well enough native speaker one language get approximate meaning written native speaker difficulty getting enough data right kind support particular method example large multilingual corpus data needed statistical methods work necessary grammar-based methods grammar methods need skilled linguist carefully design grammar use translate closely related languages technique referred rule-based machine translation may used rule-based machine translation paradigm includes transfer-based machine translation interlingual machine translation dictionary-based machine translation paradigms type translation used mostly creation dictionaries grammar programs unlike methods rbmt involves information linguistics source target languages using morphological syntactic rules semantic analysis languages basic approach involves linking structure input sentence structure output sentence using parser analyzer source language generator target language transfer lexicon actual translation rbmt biggest downfall everything must made explicit orthographical variation erroneous input must made part source language analyser order cope lexical selection rules must written instances ambiguity adapting new domains hard core grammar across domains domain-specific adjustment limited lexical selection adjustment transfer-based machine translation similar interlingual machine translation creates translation intermediate representation simulates meaning original sentence unlike interlingual mt depends partially language pair involved translation interlingual machine translation one instance rule-based machine-translation approaches approach source language i.e text translated transformed interlingual language i.e language neutral representation independent language target language generated interlingua one major advantages system interlingua becomes valuable number target languages turned increases however interlingual machine translation system made operational commercial level kant system nyberg mitamura 1992 designed translate caterpillar technical english cte languages machine translation use method based dictionary entries means words translated dictionary statistical machine translation tries generate translations using statistical methods based bilingual text corpora canadian hansard corpus english-french record canadian parliament europarl record european parliament corpora available good results achieved translating similar texts corpora still rare many language pairs first statistical machine translation software candide ibm google used systran several years switched statistical translation method october 2007 2005 google improved internal translation capabilities using approximately 200 billion words united nations materials train system translation accuracy improved google translate similar statistical translation programs work detecting patterns hundreds millions documents previously translated humans making intelligent guesses based findings generally human-translated documents available given language likely translation good quality newer approaches statistical machine translation metis ii presemt use minimal corpus size instead focus derivation syntactic structure pattern recognition development may allow statistical machine translation operate monolingual text corpus smt biggest downfall includes dependent upon huge amounts parallel texts problems morphology-rich languages especially translating languages inability correct singleton errors example-based machine translation ebmt approach proposed makoto nagao 1984 example-based machine translation based idea analogy approach corpus used one contains texts already translated given sentence translated sentences corpus selected contain similar sub-sentential components similar sentences used translate sub-sentential components original sentence target language phrases put together form complete translation hybrid machine translation hmt leverages strengths statistical rule-based translation methodologies several mt organizations claim hybrid approach uses rules statistics approaches differ number ways recently advent neural mt new version hybrid machine translation emerging combines benefits rules statistical neural machine translation approach allows benefitting pre- post-processing rule guided workflow well benefitting nmt smt downside inherent complexity makes approach suitable specific use cases one proponents approach complex use cases omniscien technologies deep learning based approach mt neural machine translation made rapid progress recent years google announced translation services using technology preference previous statistical methods word-sense disambiguation concerns finding suitable translation word one meaning problem first raised 1950s yehoshua bar-hillel pointed without universal encyclopedia machine would never able distinguish two meanings word today numerous approaches designed overcome problem approximately divided shallow approaches deep approaches shallow approaches assume knowledge text simply apply statistical methods words surrounding ambiguous word deep approaches presume comprehensive knowledge word far shallow approaches successful claude piron long-time translator united nations world health organization wrote machine translation best automates easier part translator job harder time-consuming part usually involves extensive research resolve ambiguities source text grammatical lexical exigencies target language require resolved ideal deep approach would require translation software research necessary kind disambiguation would require higher degree ai yet attained shallow approach simply guessed sense ambiguous english phrase piron mentions based perhaps kind prisoner-of-war camp often mentioned given corpus would reasonable chance guessing wrong fairly often shallow approach involves ask user ambiguity would piron estimate automate 25 professional translator job leaving harder 75 still done human one major pitfalls mt inability translate non-standard language accuracy standard language heuristic statistical based mt takes input various sources standard form language rule-based translation nature include common non-standard usages causes errors translation vernacular source colloquial language limitations translation casual speech present issues use machine translation mobile devices name entities narrow sense refer concrete abstract entities real world including people organizations companies places etc also refers expressing time space quantity 1 july 2011 79.99 named entities occur text analyzed statistical machine translation initial difficulty arises dealing named entities simply identifying text consider list names common particular language illustrate – common names different language also constantly changing named entities recognized machine translator may erroneously translated common nouns would likely affect bleu rating translation would change text human readability also possible identified named entities omitted output translation would also implications text readability message another way deal named entities use transliteration instead translation meaning find letters target language closely correspond name source language attempts incorporate machine translation adding transliteration step translation procedure however attempts still problems even cited worsening quality translation named entities still identified incorrectly words transliterated transliterated n't example southern california first word translated directly second word transliterated however machines would often transliterate treated one entity words like hard machine translators even transliteration component process lack attention issue named entity translation recognized potentially stemming lack resources devote task addition complexity creating good system named entity translation one approach named entity translation transliterate translate words second create do-not-translate list end goal – transliteration opposed translation approaches still rely correct identification named entities however third approach successful named entity translation class-based model method named entities replaced token represent class belong example ted erica would replaced person class token way statistical distribution use person names general analyzed instead looking distributions ted erica individually problem class based model solves probability given name specific language affect assigned probability translation study stanford improving area translation gives examples different probabilities assigned david going walk ankit going walk english target language due different number occurrences name training data frustrating outcome study stanford attempts improve named recognition translation many times decrease bleu scores translation result inclusion methods named entity translation work done utilization multiparallel corpora body text translated 3 languages using methods text translated 2 languages may utilized combination provide accurate translation third language compared one source languages used alone ontology formal representation knowledge includes concepts objects processes etc domain relations stored information linguistic nature one speak lexicon nlp ontologies used source knowledge machine translation systems access large knowledge base systems enabled resolve many especially lexical ambiguities following classic examples humans able interpret prepositional phrase according context use world knowledge stored lexicons machine translation system initially would able differentiate meanings syntax change large enough ontology source knowledge however possible interpretations ambiguous words specific context reduced areas usage ontologies within nlp include information retrieval information extraction text summarization ontology generated pangloss knowledge-based machine translation system 1993 may serve example ontology nlp purposes compiled system provides holy grail fully automatic high-quality machine translation unrestricted text many fully automated systems produce reasonable output quality machine translation substantially improved domain restricted controlled despite inherent limitations mt programs used around world probably largest institutional user european commission project example coordinated university gothenburg received 2.375 million euros project support eu create reliable translation tool covers majority eu languages development mt systems comes time budget cuts human translation may increase eu dependency reliable mt programs european commission contributed 3.072 million euros via isa programme creation mt ec statistical machine translation program tailored administrative needs eu replace previous rule-based machine translation system 2005 google claimed promising results obtained using proprietary statistical machine translation engine statistical translation engine used google language tools arabic english chinese english overall score 0.4281 runner-up ibm bleu-4 score 0.3954 summer 2006 tests conducted national institute standards technology recent focus terrorism military sources united states investing significant amounts money natural language engineering in-q-tel venture capital fund largely funded us intelligence community stimulate new technologies private sector entrepreneurs brought companies like language weaver currently military community interested translation processing languages like arabic pashto dari within languages focus key phrases quick communication military members civilians use mobile phone apps information processing technology office darpa hosts programs like tides babylon translator us air force awarded 1 million contract develop language translation technology notable rise social networking web recent years created yet another niche application machine translation software – utilities facebook instant messaging clients skype googletalk msn messenger etc – allowing users speaking different languages communicate machine translation applications also released mobile devices including mobile telephones pocket pcs pdas etc due portability instruments come designated mobile translation tools enabling mobile business networking partners speaking different languages facilitating foreign language learning unaccompanied traveling foreign countries without need intermediation human translator despite labelled unworthy competitor human translation 1966 automated language processing advisory committee put together united states government quality machine translation improved levels application online collaboration medical field investigated application technology medical settings human translators absent another topic research difficulties arise due importance accurate translations medical diagnoses many factors affect machine translation systems evaluated factors include intended use translation nature machine translation software nature translation process different programs may work well different purposes example statistical machine translation smt typically outperforms example-based machine translation ebmt researchers found evaluating english french translation ebmt performs better concept applies technical documents easily translated smt formal language certain applications however e.g. product descriptions written controlled language dictionary-based machine-translation system produced satisfactory translations require human intervention save quality inspection various means evaluating output quality machine translation systems oldest use human judges assess translation quality even though human evaluation time-consuming still reliable method compare different systems rule-based statistical systems automated means evaluation include bleu nist meteor lepor relying exclusively unedited machine translation ignores fact communication human language context-embedded takes person comprehend context original text reasonable degree probability certainly true even purely human-generated translations prone error therefore ensure machine-generated translation useful human publishable-quality translation achieved translations must reviewed edited human late claude piron wrote machine translation best automates easier part translator job harder time-consuming part usually involves extensive research resolve ambiguities source text grammatical lexical exigencies target language require resolved research necessary prelude pre-editing necessary order provide input machine-translation software output meaningless addition disambiguation problems decreased accuracy occur due varying levels training data machine translating programs example-based statistical machine translation rely vast array real example sentences base translation many sentences analyzed accuracy jeopardized researchers found program trained 203,529 sentence pairings accuracy actually decreases optimal level training data seems 100,000 sentences possibly training data increases number possible sentences increases making harder find exact translation match although concerns machine translation accuracy dr. ana nino university manchester researched advantages utilizing machine translation classroom one pedagogical method called using mt bad model mt bad model forces language learner identify inconsistencies incorrect aspects translation turn individual hopefully possess better grasp language dr. nino cites teaching tool implemented late 1980s end various semesters dr. nino able obtain survey results students used mt bad model well models overwhelmingly students felt observed improved comprehension lexical retrieval increased confidence target language early 2000s options machine translation spoken signed languages severely limited common belief deaf individuals could use traditional translators however stress intonation pitch timing conveyed much differently spoken languages compared signed languages therefore deaf individual may misinterpret become confused meaning written text based spoken language researchers zhao et al 2000 developed prototype called team translation english asl machine completed english american sign language asl translations program would first analyze syntactic grammatical morphological aspects english text following step program accessed sign synthesizer acted dictionary asl synthesizer housed process one must follow complete asl signs well meanings signs entire text analyzed signs necessary complete translation located synthesizer computer generated human appeared would use asl sign english text user works original subject copyright protection scholars claim machine translation results entitled copyright protection mt involve creativity copyright issue derivative work author original work original language lose rights work translated translator must permission publish translation | [
3601,
1441,
6,
1444,
2184,
715,
1823,
2553,
6103,
3292,
1477,
2215,
7909,
2579,
4337,
3645,
3305,
6827,
3651,
1488,
4349,
2595,
6140,
5429,
5782,
2900,
2614,
1901,
92,
3349,
2629,
4760,
4037,
2645,
6526,
2648,
2321,
506,
7290,
7293,
159... | Test |
5,009 | 3 | Joe_Blade:joe blade joe blade title series budget-price platform games written colin swinbourne published players three titles flick-screen adventures player controls title character number rooms dispatching enemies rescuing innocent people manner varies three games first joe blade title portrayed blade lone commando sent evil mastermind complex release number diplomats one earliest video games placed index germany due accusations glorified war villains resembled ss troopers game still legally obtainable effectively banned game distribution technologies internet available time german publications permitted advertise titles joe blade 2 took rather different approach first game instead soldier blade time vigilante taking city rid streets criminals rescuing old-age pensioners along way blade longer armed gun jump villains touching feet dispatch almost surreal take game stark contrast comparatively gritty realism first installment game also known considerably easier first title almost point many players managed complete game one hour-long sitting spectrum version game featured version invade-a-load featuring pac man joe blade 3 returned first title formula arming blade machine gun exclusively released zx spectrum amstrad cpc included commodore 64 instructions inlay commodore 64 version ever released 1991 players game prison riot plays similarly joe blade titles hacked version identifies joe blade 4 distributed internet | [] | Validation |
5,010 | 1 | ER/Studio:er/studio er/studio data architecture database design software developed embarcadero technologies er/studio compatible multiple database platforms used data architects data modelers database administrators business analysts create manage database designs document reuse data assets 2015 embarcaero technologies acquired database infrastructure management software company idera inc since acquisition idera inc. er/studio renamed er/studio data architect updated features | [
6144
] | Train |
5,011 | 2 | Apple_Color_Emoji:apple color emoji apple color emoji color typeface used apple platforms ios macos display emoji characters inclusion emoji iphone unicode standard credited promoting spreading use emoji outside japan many apple icons past present feature design based deep saturated colors gradual transitions color often incorporating subtle gloss effects first version apple color emoji released alongside iphone os 2.2 november 2008 contained 471 individual emoji glyphs originally limited japanese iphone models restriction later lifted designers first apple color emoji typeface raymond sepulveda angela guzman ollie wagner due iphone originally launching japan softbank network apple emoji designs may created resemble softbank phones example 💃 defined unicode 'dancer specified gender feminine apple softbank phones previously masculine gender-neutral others years 2011—2018 apple color emoji font expanded 471 2,776 emoji october 2018 updated emoji keyboard released ios version 8.3 update also added varied skin tones same-gender couples included unicode 6 result human emoji faces switched neutral yellow skin tone default similar smiley emoji majority apple color emoji designs updated release ios 10.2 december 2016 many appearing 3d-rendered according apple vice president user interface design alan dye emoji redesigns due advent animoji memoji higher resolution screens 157 new emoji added ios october 2018 designers apple color emoji typeface versions initial release publicly credited following apple standard practice crediting work individuals former apple employees offered accounts created various designs prior ios 5 softbank encoding used encoding emoji apple devices beginning ios 5 emoji encoded using unicode standard emoji glyphs stored png images several resolutions strikes 20 32 40 48 64 96 160 pixels squared using proprietary sbix table later standardized opentype version 1.8 font contains number easter eggs several glyphs contain portions text apple think different advertisement crazy ones ... including 1f4cb clipboard 📋 1f4c4 page facing 📄 1f4d1 bookmark tabs 📑 1f4d6 open book 📖 among others emoji specified generic objects appear apple products example 1f4bb personal computer 💻 appears modern macbook 231a wristwatch ⌚ shows apple watch 1f301 foggy 🌁 shows golden gate bridge behind san francisco fog reference apple california headquarters 1f4f0 newspaper 📰 headline reads apple times variety styles used original sets example 🐬 🐙 dolphin octopus quite stylized 'button eyes 🐈 🐀 cat rat realistic resembling watercolor paintings mixture styles creates range possible designs example 🐏 🐑 ram sheep look clearly different 🐫 🐪 bactrian camel dromedary calendar emoji 📅 showing july 17 date chosen annual world emoji day date originally referred day apple premiered ical calendar application 2002 although primarily intended onscreen display ios limited printing capabilities printed displays signs used apple color emoji designs new york magazine used apple color emoji printed feature growing use emoji | [
7274,
6645,
6788,
117,
6909,
6067
] | Test |
5,012 | 3 | Microcode:microcode microcode computer hardware technique interposes layer organisation cpu hardware programmer-visible instruction set architecture computer microcode layer hardware-level instructions implement higher-level machine code instructions internal state machine sequencing many digital processing elements microcode used general-purpose central processing units although current desktop cpus fallback path cases faster hardwired control unit handle microcode typically resides special high-speed memory translates machine instructions state machine data input sequences detailed circuit-level operations separates machine instructions underlying electronics instructions designed altered freely also facilitates building complex multi-step instructions reducing complexity computer circuits writing microcode often called microprogramming microcode particular processor implementation sometimes called microprogram extensive microcoding allows small simple microarchitectures emulate powerful architectures wider word length execution units relatively simple way achieve software compatibility different products processor family hardware vendors especially ibm use term microcode synonym firmware way code within device termed microcode regardless microcode machine code example hard disk drives said microcode updated though typically contain microcode firmware lowest layer computer software stack traditionally raw binary machine code instructions processor microcode sits one level avoid confusion microprogram-related element differentiated micro prefix microinstruction microassembler microprogrammer microarchitecture etc engineers normally write microcode design phase processor storing read-only memory rom programmable logic array pla structure combination however machines also exist microcode stored sram flash memory traditionally denoted writeable control store context computers either read-only read-write memory latter case cpu initialization process loads microcode control store another storage medium possibility altering microcode correct bugs instruction set implement new machine instructions complex digital processors may also employ one possibly microcode-based control unit order delegate sub-tasks must performed essentially asynchronously parallel high-level programmer even assembly programmer normally see change microcode unlike machine code often retains backward compatibility among different processors family microcode runs exact electronic circuitry designed constitutes inherent part particular processor design microprograms consist series microinstructions control cpu fundamental level hardware circuitry example single typical horizontal microinstruction might specify following operations simultaneously control processor features one cycle microinstruction often wider 50 bits e.g. 128 bits 360/85 emulator feature microprograms carefully designed optimized fastest possible execution slow microprogram would result slow machine instruction degraded performance related application programs use instructions microcode originally developed simpler method developing control logic computer initially cpu instruction sets hardwired step needed fetch decode execute machine instructions including operand address calculations reads writes controlled directly combinational logic rather minimal sequential state machine circuitry efficient need powerful instruction sets multi-step addressing complex operations see made hard-wired processors difficult design debug highly encoded varied-length instructions contribute well especially irregular encodings used microcode simplified job allowing much processor behaviour programming model defined via microprogram routines rather dedicated circuitry even late design process microcode could easily changed whereas hard-wired cpu designs cumbersome change thus greatly facilitated cpu design 1940s late 1970s large portion programming done assembly language higher-level instructions mean greater programmer productivity important advantage microcode relative ease powerful machine instructions defined ultimate extension directly executable high level language designs statement high-level language pl/i entirely directly executed microcode without compilation ibm future systems project data general fountainhead processor examples 1970s cpu speeds grew quickly memory speeds numerous techniques memory block transfer memory pre-fetch multi-level caches used alleviate high-level machine instructions made possible microcode helped fewer complex machine instructions require less memory bandwidth example operation character string done single machine instruction thus avoiding multiple instruction fetches architectures instruction sets implemented complex microprograms included ibm system/360 digital equipment corporation vax approach increasingly complex microcode-implemented instruction sets later called cisc alternate approach used many microprocessors use plas roms instead combinational logic mainly instruction decoding let simple state machine without much microcode sequencing mos technology 6502 example microprocessor using pla instruction decode sequencing pla visible photomicrographs chip operation seen transistor-level simulation microprogramming still used modern cpu designs cases microcode debugged simulation logic functions substituted control store logic functions often faster less expensive equivalent microprogram memory processor microprograms operate primitive totally different much hardware-oriented architecture assembly instructions visible normal programmers coordination hardware microcode implements programmer-visible architecture underlying hardware need fixed relationship visible architecture makes easier implement given instruction set architecture wide variety underlying hardware micro-architectures ibm system/360 32-bit architecture 16 general-purpose registers system/360 implementations actually use hardware implemented much simpler underlying microarchitecture example system/360 model 30 8-bit data paths arithmetic logic unit alu main memory implemented general-purpose registers special unit higher-speed core memory system/360 model 40 8-bit data paths alu 16-bit data paths main memory also implemented general-purpose registers special unit higher-speed core memory model 50 full 32-bit data paths implements general-purpose registers special unit higher-speed core memory model 65 model 195 larger data paths implement general-purpose registers faster transistor circuits way microprogramming enabled ibm design many system/360 models substantially different hardware spanning wide range cost performance making architecturally compatible dramatically reduces number unique system software programs must written model similar approach used digital equipment corporation dec vax family computers result different vax processors use different microarchitectures yet programmer-visible architecture change microprogramming also reduces cost field changes correct defects bugs processor bug often fixed replacing portion microprogram rather changes made hardware logic wiring 1947 design mit whirlwind introduced concept control store way simplify computer design move beyond ad hoc methods control store diode matrix two-dimensional lattice one dimension accepts control time pulses cpu internal clock connects control signals gates circuits pulse distributor takes pulses generated cpu clock breaks eight separate time pulses activates different row lattice row activated activates control signals connected described another way signals transmitted control store played much like player piano roll controlled sequence wide words constructed bits played sequentially control store however song short repeated continuously 1951 maurice wilkes enhanced concept adding conditional execution concept akin conditional computer software initial implementation consisted pair matrices first one generated signals manner whirlwind control store second matrix selected row signals microprogram instruction word speak invoke next cycle conditionals implemented providing way single line control store could choose alternatives second matrix made control signals conditional detected internal signal wilkes coined term microprogramming describe feature distinguish simple control store microinstruction microprogram provides bits control functional elements internally compose cpu advantage hard-wired cpu internal cpu control becomes specialized form computer program microcode thus transforms complex electronic design challenge control cpu less complex programming challenge take advantage cpu divided several parts may also memory address register memory data register used access main computer storage together elements form execution unit modern cpus several execution units even simple computers usually one unit read write memory another execute user code elements could often brought together single chip chip comes fixed width would form slice execution unit known bit slice chips amd am2900 family one best known examples bit slice elements parts execution units execution units interconnected bundle wires called bus programmers develop microprograms using basic software tools microassembler allows programmer define table bits symbolically close relationship underlying architecture microcode several properties make difficult generate using compiler simulator program intended execute bits way electronics allows much freedom debug microprogram microprogram finalized extensively tested sometimes used input computer program constructs logic produce data program similar used optimize programmable logic array even without fully optimal logic heuristically optimized logic vastly reduce number transistors number required rom control store reduces cost producing electricity consumed cpu microcode characterized horizontal vertical referring primarily whether microinstruction controls cpu elements little decoding horizontal microcode requires extensive decoding combinatorial logic vertical microcode consequently horizontal microinstruction wider contains bits occupies storage space vertical microinstruction horizontal microcode several discrete micro-operations combined single microinstruction simultaneous operation horizontal microcode typically contained fairly wide control store uncommon word 108 bits tick sequencer clock microcode word read decoded used control functional elements make cpu typical implementation horizontal microprogram word comprises fairly tightly defined groups bits example one simple arrangement might type micromachine implement jump instruction address following opcode microcode might require two clock ticks engineer designing would write microassembler source code looking something like tick common find portions cpu used remaining groups bits microinstruction no-ops careful design hardware microcode property exploited parallelise operations use different areas cpu example case alu required first tick could potentially used complete earlier arithmetic instruction vertical microcode microinstruction significantly encoded bit fields generally pass intermediate combinatory logic turn generates actual control sequencing signals internal cpu elements alu registers etc. contrast horizontal microcode bit fields either directly produce control sequencing signals minimally encoded consequently vertical microcode requires smaller instruction lengths less storage requires time decode resulting slower cpu clock vertical microcode assembly language simple conventional computer emulating complex computer processors dec alpha processors cmos microprocessors later ibm system/390 mainframes z/architecture mainframes palcode term used alpha processors millicode term used ibm mainframe microprocessors form machine code access special registers hardware resources available regular machine code used implement instructions functions page table walks alpha processors another form vertical microcode two fields field select selects part cpu controlled word control store field value actually controls part cpu type microcode designer explicitly chooses make slower cpu save money reducing unused bits control store however reduced complexity may increase cpu clock frequency lessens effect increased number cycles per instruction transistors became cheaper horizontal microcode came dominate design cpus using microcode vertical microcode used less often vertical horizontal microcode used horizontal microcode may referred nanocode picocode computers built using writable microcode design rather storing microcode rom hard-wired logic microcode stored ram called writable control store wcs computer sometimes called writable instruction set computer wisc many experimental prototype computers use writable control stores also commercial machines use writable microcode burroughs small systems early xerox workstations dec vax 8800 nautilus family symbolics l- g-machines number ibm system/360 system/370 implementations dec pdp-10 machines data general eclipse mv/8000 many machines offer user-programmable writable control stores option including hp 2100 dec pdp-11/60 varian data machines v-70 series minicomputers ibm system/370 includes facility called initial-microprogram load iml impl invoked console part power-on reset por another processor tightly coupled multiprocessor complex commercial machines example ibm 360/85 read-only storage writable control store microcode wcs offers several advantages including ease patching microprogram certain hardware generations faster access roms provide user-programmable wcs allows user optimize machine specific purposes starting pentium pro 1995 several x86 cpus writable intel microcode example allowed bugs intel core 2 intel xeon microcodes fixed patching microprograms rather requiring entire chips replaced second prominent example set microcode patches intel offered processor architectures 10 years age bid counter security vulnerabilities discovered designs spectre meltdown went public start 2018 microcode update installed linux freebsd microsoft windows motherboard bios design trend toward heavily microcoded processors complex instructions began early 1960s continued roughly mid-1980s point risc design philosophy started becoming prominent cpu uses microcode generally takes several clock cycles execute single instruction one clock cycle step microprogram instruction cisc processors include instructions take long time execute variations interfere interrupt latency far important modern systems pipelining designing new processor hardwired control risc following advantages microcoded cisc counterpoints well many risc vliw processors designed execute every instruction long cache single cycle similar way cpus microcode execute one microinstruction per cycle vliw processors instructions behave similarly wide horizontal microcode although typically without fine-grained control hardware provided microcode risc instructions sometimes similar narrow vertical microcode microcoding popular application-specific processors network processors microcontrollers digital signal processors channel controllers disk controllers network interface controllers graphics processing units hardware modern cisc implementations x86 family decode instructions dynamically buffered micro-operations μops instruction encoding similar risc traditional microcode hardwired instruction decode unit directly emits μops common x86 instructions falls back traditional microcode rom complex rarely used instructions example x86 might look μops microcode handle complex multistep operations loop string instructions floating point unit transcendental functions unusual values denormal numbers special purpose instructions cpuid | [
2903,
1447,
5371,
3948,
7527,
7529,
3623,
5737,
2567,
4694,
5042,
1481,
5055,
1112,
2226,
1867,
5079,
2248,
5784,
6148,
6497,
441,
2266,
3347,
5100,
6170,
4047,
5483,
1556,
5487,
7990,
6198,
5494,
1568,
1570,
1207,
6922,
7666,
6567,
152,
... | Test |
5,013 | 4 | Kill_chain:kill chain term kill chain originally used military concept related structure attack consisting target identification force dispatch target decision order attack target finally destruction target conversely idea breaking opponent kill chain method defense preemptive action recently lockheed martin adapted concept information security using method modeling intrusions computer network cyber kill chain model seen adoption information security community however acceptance universal critics pointing believe fundamental flaws model one military kill chain model f2t2ea includes following phases integrated end-to-end process described chain interruption stage interrupt entire process four fs military term used united states military especially world war ii designed easy remember four fs follows new american military contingency plan called kill chain reportedly first step new strategy use satellite imagery identify north korean launch sites nuclear facilities manufacturing capability destroy pre-emptively conflict seems imminent plan mentioned joint statement united states south korea computer scientists lockheed-martin corporation described new intrusion kill chain framework model defend computer networks 2011 wrote attacks may occur phases disrupted controls established phase since cyber kill chain™ adopted data security organizations define phases cyber-attacks cyber kill chain reveals phases cyber attack early reconnaissance goal data exfiltration kill chain also used management tool help continuously improve network defense according lockheed martin threats must progress several phases model including defensive courses action taken phases u.s. senate investigation 2013 target corporation data breach included analysis based lockheed-martin kill chain framework identified several stages controls prevent detect progression attack among critiques lockheed martin cyber kill chain model threat assessment prevention tool first phases happen outside defended network making difficult identify defend actions phases similarly methodology said reinforce traditional perimeter-based malware-prevention based defensive strategies others noted traditional cyber kill chain n't suitable model insider threat particularly troublesome given likelihood successful attacks breach internal network perimeter organizations need develop strategy dealing attackers inside firewall need think every attacker potential insider ” unified version kill chain developed overcome common critiques traditional cyber kill chain uniting extending lockheed martin ’ kill chain mitre ’ att ck framework unified kill chain ordered arrangement 18 unique attack phases may occur end-to-end cyber attacks covers activities occur outside within defended network unified kill chain improves scope limitations traditional kill chain time-agnostic nature tactics mitre ’ att ck unified model used analyze compare defend end-to-end cyber attacks advanced persistent threats apts | [
1805
] | Validation |
5,014 | 7 | Multitier_architecture:multitier architecture software engineering multitier architecture often referred n -tier architecture multilayered architecture client–server architecture presentation application processing data management functions physically separated widespread use multitier architecture three-tier architecture n -tier application architecture provides model developers create flexible reusable applications segregating application tiers developers acquire option modifying adding specific layer instead reworking entire application three-tier architecture typically composed presentation tier domain logic tier data storage tier concepts layer tier often used interchangeably one fairly common point view indeed difference view holds layer logical structuring mechanism elements make software solution tier physical structuring mechanism system infrastructure example three-layer solution could easily deployed single tier personal workstation layers architectural pattern described various publications logical multilayered architecture information system object-oriented design following four common book domain driven design describes common uses four layers although primary focus domain layer application architecture explicit distinction business layer presentation layer i.e. presentation layer considered part business layer traditional client-server two-tier model implemented usual convention application layer service layer considered sublayer business layer typically encapsulating api definition surfacing supported business functionality application/business layers fact subdivided emphasize additional sublayers distinct responsibility example model–view–presenter pattern used presenter sublayer might used additional layer user interface layer business/application layer represented model sublayer also identify separate layer called business infrastructure layer bi located business layer infrastructure layer also sometimes called low-level business layer business services layer layer general used several application tiers e.g currencyconverter infrastructure layer partitioned different levels high-level low-level technical services developers often focus persistence data access capabilities infrastructure layer therefore talk persistence layer data access layer instead infrastructure layer technical services layer words kind technical services always explicitly thought part particular layer layer top another depends every layer exist without layers requires layers function another common view layers always strictly depend adjacent layer example relaxed layered system opposed strict layered system layer also depend layers three-tier architecture client-server software architecture pattern user interface presentation functional process logic business rules computer data storage data access developed maintained independent modules often separate platforms developed john j. donovan open environment corporation oec tools company founded cambridge massachusetts apart usual advantages modular software well-defined interfaces three-tier architecture intended allow three tiers upgraded replaced independently response changes requirements technology example change operating system presentation tier would affect user interface code typically user interface runs desktop pc workstation uses standard graphical user interface functional process logic may consist one separate modules running workstation application server rdbms database server mainframe contains computer data storage logic middle tier may multitiered case overall architecture called n -tier architecture web development field three-tier often used refer websites commonly electronic commerce websites built using three tiers data transfer tiers part architecture protocols involved may include one snmp corba java rmi .net remoting windows communication foundation sockets udp web services standard proprietary protocols often middleware used connect separate tiers separate tiers often necessarily run separate physical servers tier may run cluster end-to-end traceability data flows n -tier systems challenging task becomes important systems increase complexity application response measurement defines concepts apis measuring performance correlating transactions tiers generally term tiers used describe physical distribution components system separate servers computers networks processing nodes three-tier architecture three processing nodes term layers refers logical grouping components may may physically located one processing node | [
4469,
1254,
3686,
4031,
6415,
1257,
2638,
2827,
7341,
1730,
1834,
5217,
5650,
6986,
1840,
7638,
1554,
5571,
6105,
2404,
2219,
4964,
6025,
231,
7924,
235,
3396,
2054,
7391,
1407,
604,
517,
2961,
6224,
4374
] | Test |
5,015 | 9 | Java_3D:java 3d java 3d scene graph-based 3d application programming interface api java platform runs top either opengl direct3d version 1.6.0 runs top java opengl jogl since version 1.2 java 3d developed java community process java 3d scene graph directed acyclic graph dag compared solutions java 3d wrapper around graphics apis interface encapsulates graphics programming using true object-oriented approach scene constructed using scene graph representation objects shown scene graph structured tree containing several elements necessary display objects additionally java 3d offers extensive spatialized sound support java 3d documentation available download separately part java development kit jdk intel silicon graphics apple sun retained mode scene graph apis development 1996 since wanted make java version decided collaborate making project became java 3d development underway already 1997 public beta version released march 1998 first version released december 1998 mid-2003 summer 2004 development java 3d discontinued summer 2004 java 3d released community source project sun volunteers since continuing development january 29 2008 announced improvements java 3d would put hold produce 3d scene graph javafx javafx 3d support eventually released java 8 javafx 3d graphics functionality less come supersede java 3d since february 28 2008 entire java 3d source code released gpl version 2 license gpl linking exception since february 10 2012 java 3d uses jogl 2.0 hardware accelerated opengl rendering port initiated julien gouesse java 3d high-level api option render 3d java part due pause development 2003 2004 several competing java scene graph technologies emerged general purpose gaming visualization addition many c c++ scene graph apis offer java support jni lower level jogl jsr 231 opengl bindings java popular alternative scene graph apis java 3d lwjgl another binding | [
3077,
631,
7347,
5571,
7459,
3879,
7010,
2519,
2520,
3915,
6319,
2619,
4287
] | Test |
5,016 | 1 | Schema_matching:schema matching terms schema matching mapping often used interchangeably database process article differentiate two follows schema matching process identifying two objects semantically related scope article mapping refers transformations objects example two schemas db1.student name ssn level major marks db2.grad-student name id major grades possible matches would db1.student ≈ db2.grad-student db1.ssn db2.id etc possible transformations mappings would db1.marks db2.grades 100-90 90-80 b etc. automating two approaches one fundamental tasks data integration general possible determine fully automatically different correspondences two schemas — primarily differing often explicated documented semantics two schemas among others common challenges automating matching mapping previously classified especially relational db schemas – fairly comprehensive list heterogeneity limited relational model recognizing schematic vs semantic differences/heterogeneity heterogeneities exist schemas use different representations definitions represent information schema conflicts different expressions units precision result conflicting representations data data conflicts research schema matching seeks provide automated support process finding semantic matches two schemas process made harder due heterogeneities following levels discusses generic methodology task schema integration activities involved according authors one view integration approaches schema integration broadly classified ones exploit either schema information schema instance level information schema-level matchers consider schema information instance data available information includes usual properties schema elements name description data type relationship types part-of is-a etc constraints schema structure working element atomic elements like attributes objects structure level matching combinations elements appear together structure properties used identify matching elements two schemas language-based linguistic matchers use names text i.e. words sentences find semantically similar schema elements constraint based matchers exploit constraints often contained schemas constraints used define data types value ranges uniqueness optionality relationship types cardinalities etc constraints two input schemas matched determine similarity schema elements instance-level matchers use instance-level data gather important insight contents meaning schema elements typically used addition schema level matches order boost confidence match results information available schema level insufficient matchers level use linguistic constraint based characterization instances example using linguistic techniques might possible look dept deptname empname instances conclude deptname better match candidate dept empname constraints like zipcodes must 5 digits long format phone numbers may allow matching types instance data hybrid matchers directly combine several matching approaches determine match candidates based multiple criteria information sources techniques also employ additional information dictionaries thesauri user-provided match mismatch information reusing matching information another initiative re-use previous matching information auxiliary information future matching tasks motivation work structures substructures often repeat example schemas e-commerce domain reuse previous matches however needs careful choice possible reuse makes sense part new schema domains example salary income may considered identical payroll application tax reporting application several open ended challenges reuse deserves work sample prototypes typically implementation matching techniques classified either rule based learner based systems complementary nature different approaches instigated number applications using combination techniques depending nature domain application consideration relationship types objects identified end matching process typically set semantics overlap disjointness exclusion equivalence subsumption logical encodings relationships mean among others early attempt use description logics schema integration identifying relationships presented several state art matching tools today benchmarked ontology alignment evaluation initiative capable identifying many simple 1:1 1 n n:1 element level matches complex matches n:1 n element structure level matches objects quality schema matching commonly measure precision recall precision measures number correctly matched pairs pairs matched recall measures many actual pairs matched | [
7540,
2227,
2054
] | Train |
5,017 | 2 | Apper:apper apper originally named kpackagekit free open source linux front-end application packagekit package management service kde apper also one main difference compared old kpackagekit apper list applications instead listing packages makes much user-friendly allows user search install applications without added complexity dealing packages dependencies besides installation new applications also allows easy removal updates compared ubuntu software center well appstream project apper adopted distributions fedora debian opensuse 12.1 | [
8055,
1621,
2091,
5200,
5545,
1723,
1260,
4675,
5912,
3366,
4685,
5480,
4778,
6011,
5571,
578,
2034,
4603,
7092,
2581,
7555,
6743,
3559,
2415,
4891,
5162,
1406,
6663,
4991,
5530,
781,
2706,
4461,
7042
] | Test |
5,018 | 2 | Need_for_Speed:_Undercover:need speed undercover need speed undercover 2008 racing video game twelfth instalment need speed series developed ea black box published electronic arts released november 18 2008 playstation 2 playstation 3 xbox 360 wii microsoft windows playstation portable nintendo ds number mobile phone platforms edition game ios later released april 27 2009 game sees players conducting illegal street races within fictional tri-city area main mode story focused player operating undercover police officer investigate links criminal syndicate stolen cars street racers gameplay operates manner previous entries though included larger selection licensed real-world cars rpg-styled system game main mode upon release game received mixed reviews many criticised game difficulty setting repetitive elements editions receiving lower scores due severe issues undercover later succeeded 2009 2010 game players take part illegal street races focus different styles races utilizing variety licensed real-world cars available time game development release upgraded customized new parts contending involvement police efforts impede player racing events featured game include series standard circuit point-to-point checkpoint races alongside return police pursuit events featured wanted addition undercover includes new events outrun players must overtake rival stay ahead period time highway battle similar carbon duel event players attempt stay ahead rival highway battling local traffic winning instantly pull far ahead losing exact opposite game modes consisting career single event multiplayer playstation 2 wii editions also feature fourth mode challenge series operates similar function wanted carbon career mode players take role undercover police officer seeking break syndicate operating within underground street race world like wanted players achieve completing racing events pursuit events majority events mode include opportunity dominate completing faster specified time record domination undercover progress story involves completing events earn money also experience wheelman rep special performance bonus bonuses either improve player driving abilities cars provide bonuses player playthrough i.e increase race earnings earning enough experience levels player wheelman level unlocking larger performance bonus new cars upgrade parts well additional events including jobs special story-based missions player must complete specific task taking criminal car police pursuits mode function like previous editions though player wheelman level directly impacts aggressive police pursuit player higher level tactics vehicle types used pursuit players freely select event game map using hotkey move highlighted event completing current one able replay previous events reduced amount cash game features wide variety licensed real-world cars divided three tiers performance four classes exotic tuner muscle sport players begin career mode limited selection cars use purchase unlock level earn additional cars defeating criminals story cars upgrades customisation done visiting player safehouse rather separate stores fine-tuning car performance also conducted manner nintendo ds playstation 2 playstation portable wii editions game players also use police vehicles upon unlocking main mode cars receive cosmetic damage game except highway battles job events possible total car event latter per specific parameters assigned job player undertaking multiplayer mode varies across platforms game launched online multiplayer possible windows playstation 3 xbox 360 editions playstation 2 wii editions feature split-screen multiplayer mobile phone platforms include game mode online multiplayer events consist multiplayer versions sprint racing highway battle along team-based event entitled cops robbers two teams players compete score points across two rounds first round robbers collect flags deliver specified areas score points cops attempt arrest earn points whereupon second round teams switch roles team highest score winning match playstation 2 wii features cops robbers multiplayer mode albeit fewer players allowed also feature two exclusive events lap knockout players compete across circuit last player end lap knocked winner remaining player end timed circuit players compete across circuit predetermined length laps time player first place end winning event game story events take place fictional region tri-city bay name influenced real-life city tri-city oregon mainly daytime sunrise sunset region consists four borough palm harbor downtown city district port crescent industrial port also houses naval base gold coast mountains mountainous region observatories wind farms sunset hills suburban town rural farms borough linked series highways region design heavily influenced real-life city miami alongside locations visited development team across gulf coast california coast setting open world map consisting around road nintendo ds edition boroughs named metropolis north port crescent south port crescent riverton wii playstation 2 editions game setting takes place within carbon-copy two boroughs taken wanted setting player undercover police officer tri-city bay police department tcbpd called palm harbor police station superior lt. jack keller paul pape player informed current investigation region underground street racing world joined inspector chase linh maggie q federal agent fbi wants bring international criminal syndicate operating region involved smuggling stolen cars player instructed pose new street racer join major illegal street races along gaining infamy tcbpd order secure entry syndicate player achieves recruited gang works syndicate run hector maio kurt caceres brother zack joshua alba time befriend carmen mendenz christina milian member gang brothers quickly assign player steal cars racing activities upon completing jobs chase instructs player arrest gang including brothers hector gang action player sent sunset hills order get recruited crew operated gmac david rees snell former tcbpd police officer rose largo heather fox honor student turned crime brad nickel rogers lawrence b. adisa former boxer whilst conducting races along jobs crew player instructed gmac steal car chau wu daniel d. lee leader syndicate player investigating player finds confronted chau offers overlook theft exchange player help recovering car lost needs back believing stolen gmac crew meeting carmen suggests theft likely committed someone else eventually player instructed arrest gmac crew though unable locate stolen car possession shortly arresting gmac crew carmen contacts players requests meeting upon reaching reveals zack hector unknowingly stole missing car chau asks get rid chau quickly contacts player moment take possession receive instructions deliver warehouse learning knows police officer kidnapped chase coerce compliance upon delivering car chase reveals corrupt federal agent working chau recover car possessed vital evidence activities sizeable quantity cash chau dispose player chase betrays murdering henchman framing player murder escaping money evidence player forced flee tcbpd upon wanted killings finds support keller instructions proceed take chase flee region way clear name successfully arresting chase keller commends player hard work recovering evidence managing forget undercover work informing carmen made plea bargain exchange testimony arrested crews time later player meets carmen give ride local university studying med student electronic arts ceo john riccitiello stated previous release series prostreet okay game ... good undercover would much better game stated undercover would considerably longer development cycle predecessors need speed development team split two teams would work two-year development cycle future titles alternating releases riccitiello stated torturing development team tight development cycle past change implemented mid-summer 2007 one team started working undercover giving 16.5 month development cycle team finished prostreet would start working next title riccitiello also stated undercover took inspiration action films transporter large embedded narrative frank gibeau president ea games label stated development due fact sales prostreet n't live ea hopes game need speed franchise would go back roots although undercover already developed prostreet john doyle developer ea black box said undercover would feature brand new game mechanic -ish sandbox style gameplay game also provided new damage system andy blackmore senior vehicle concept artist ea explained one porsche cars conceptualized game brought life game brief description approved porsche days undercover release ea revealed plot details video uploaded showed player evading capture tri-city police department tcpd reception undercover mixed complaints game easy difficulty repetitiveness poor texture maintenance ign review went far recommending game rivals rockstar games ea burnout paradise ign review critical ps3 version undercover giving 4/10 calling poor game ton problems practically redeeming qualities ign also commented reason open world environment lost player could start event map however xbox 360 pc versions received higher score contrast ps3 version ign review due fewer severe problems occurred 1up.com review called game fairly successful praised games selection cars tighter handling vehicles however leveling system unlocks cars upgrades criticized resembling grinding general sparse traffic wide-open roads poor ai led complaints extremely low difficulty however one reviewer commented may marketing ploy target wider audience reception live-action cutscenes almost universally negative many critics noting videos poorly acted lacked purpose compared cutscenes michael bay roland emmerich film lack connection crime fighting undercover cop story racing game play particularly criticized ign said ... run missions steal cars make 'special deliveries things like never actually see sequences show cops putting evidence together anything sort chase linh tell need get inside racing group order get dirt race 'll say 'we enough let move 're left asking help finally in-game frame rate received little praise gamespot particularly criticized ps3 version problem resulting lower score platform compared xbox 360 pc versions need speed undercover sold 1.4 million copies united states | [
4759
] | Test |
5,019 | 9 | TinyScheme:tinyscheme tinyscheme free software implementation scheme programming language lightweight scheme interpreter subset rrs standard meant used embedded scripting interpreter programs much functionality tinyscheme included conditionally allow developers balance features size/footprint tinyscheme used gnu image manipulation program gimp starting version 2.4 released 2007 gimp previously used siod tinyscheme used core direct revenue adware making world widely distributed scheme runtime | [
7878,
1445,
897,
6796,
6888,
6087,
4588,
2734,
6981,
5734,
3188,
6352,
1557,
218,
1478,
5494,
4704,
3880,
4609,
6116,
3212,
5501,
6210,
1116,
144,
6471,
4981,
7481,
2144,
2600,
7298,
5515,
8025,
5077,
7032,
4543,
1889,
2156,
3749,
5883,
... | Test |
5,020 | 9 | GPSS:gpss general purpose simulation system gpss discrete time simulation general-purpose programming language simulation clock advances discrete steps system modelled transactions enter system passed one service represented blocks another used primarily process flow oriented simulation language particularly well-suited problems factory gpss developed ibm geoffrey gordon beginning 1960s named gordon programable simulation system name changed ibm decided release product general program part new name create standard waiting-line simulations original releases ibm 7044 7090 mainframes subsequently releases ibm 360 univac 1108 cdc time implementations languages targeted different size systems developed including dec vax specialized apl version large-scale univac systems macintosh among others gpss java general purpose simulation system java-based tool developed teach gpss simulation language gpss resembles lego structure blocks chosen modeller specific functions imitate particular system language neither procedural object-oriented functional programming world simulated entities moving model entities called transactions envisioned moving block block block line code represents unit actions affects transaction entities blocks facility-oriented machines job shop transaction-oriented parts work-in-process signals electronic components documents bureaucratic procedure gpss automatically keep track statistics brings fixed form end simulation standard report gpss one oldest language candidate first object-oriented approach transactions truly instances model objects blocks methods modern concept oop entities broadly classified resources computational entities statistical entities resources like facilities storages represent limited capacity resources computational entities like ampervariables variables functions random generators used represent state transactions elements environment statistical entities like queues tables histograms collect statistical information interest following example taken simulation using gpss hello world gpss illustrate main concepts aim simulate one day operation barber shop customers arrive random constant flow enter shop queue barber busy get hair cut first-come first-served basis leave shop wish know average maximum waiting line well number customers program comprised codice_1 codice_2 statements divided model segments control cards first segment models customers codice_3 block creates flow transactions schedules enter model inter-arrival time uniformly distributed range 18±6 programmer responsibility interpret transaction customers understand time counted minutes transactions start existence codice_3 block progress block block according certain rules reach codice_5 remove model normally transactions progress one block next one customer transactions leave codice_3 block enter codice_7 block block simulates waiting line collects statistics accordingly example materialize line chairs end simulation know among things maximum queue size many chairs needed average waiting time codice_8 block requires name queue parameter one queue may exist model one associated codice_9 block triggered transaction leaves queue gpss remembers transactions queue possible know average time spent check buggy transaction leaving queue without previously entering codice_10 block transaction try proceed codice_11 block block simulating capture facility named joe facilities model single servers capacity one facility busy codice_12 deny attempting transaction right enter example customer wait codice_8 block free soon becomes available transaction allowed capture facility mark busy others transactions start count service time statistics transaction passes corresponding codice_14 block codice_12 codice_16 pairs linked facility name many independent facilities may exist model model operators like barber repairman agent also pieces equipment like crane gas station authorization document etc. fact anything capacity one simulate multiple parallel servers like team five barbers oven capacity 10 gpss uses entities named codice_17s customer seizes joe proceeds next statement codice_18 whose task freeze entity prescribed length time random number picked 16-4=12 16+4=20mn service time distributions available gpss codice_19 somehow different notion function programming languages time transactions allowed move model blocking facilities may exist model joe facility busy frozen customer prescribed time customer wake proceed next statement free joe codice_5 next transaction previous block customer sitting chair able codice_11 select next transaction gpss uses first-come first-served basis priority selection policies programmed direct manipulation future event chain entity parallel first segment simulating customer behavior second model segment simulates end day time 480mn 8h entity codice_3d codice_5 next block time codice_5 parameter 1 meaning special counter decreased 1 counter reaches 0 program stops output printed special counter set codice_25 statement example set one thus simulation finish one run 480 mn simulated time output contains indicates joe busy 86.0 time gave hair cut 26 customers hair cut took 15.88 minutes average incidentally joe cutting hair customer number 26 simulation closed programming provisions taken barber finish hair cut closing shop indicates also maximum 1 customer observed waiting turn fact number waiting customer average 0.160 total 27 customers enter queue customer number 27 still sitting waiting turn joe closed shop 27 customers 12 served without wait fact queue empty 44.4 time average waiting time 2.851 min average waiting time 15=27-12 customers really wait 5.133 min | [
132,
299,
4366,
4033,
1774
] | Test |
5,021 | 3 | Microkernel:microkernel computer science microkernel often abbreviated μ-kernel near-minimum amount software provide mechanisms needed implement operating system os mechanisms include low-level address space management thread management inter-process communication ipc hardware provides multiple rings cpu modes microkernel may software executing privileged level generally referred supervisor kernel mode traditional operating system functions device drivers protocol stacks file systems typically removed microkernel instead run user space terms source code size microkernels often smaller monolithic kernels minix 3 microkernel example approximately 12,000 lines code microkernels trace roots back danish computer pioneer per brinch hansen tenure danish computer company regnecentralen led software development efforts rc 4000 computer 1967 regnecentralen installing rc 4000 prototype polish fertilizer plant puławy computer used small real-time operating system tailored needs plant brinch hansen team became concerned lack generality reusability rc 4000 system feared installation would require different operating system started investigate novel general ways creating software rc 4000 1969 effort resulted completion rc 4000 multiprogramming system nucleus provided inter-process communication based message-passing 23 unprivileged processes 8 time protected one another implemented scheduling time slices programs executed parallel initiation control program execution request running programs initiation data transfers peripherals besides elementary mechanisms built-in strategy program execution resource allocation strategy implemented hierarchy running programs parent processes complete control child processes acted operating systems following brinch hansen work microkernels developed since 1970s term microkernel first appeared later 1981 microkernels meant response changes computer world several challenges adapting existing mono-kernels new systems new device drivers protocol stacks file systems low-level systems developed time code normally located monolithic kernel thus required considerable work careful code management work microkernels developed idea services would implemented user-space programs like allowing worked monolithically started stopped like program would allow services easily worked also separated kernel code allow finely tuned without worrying unintended side effects moreover would allow entirely new operating systems built common core aiding os research microkernels hot topic 1980s first usable local area networks introduced mechanisms allowed kernel distributed user space also allowed system distributed across network links first microkernels notably mach proved disappointing performance inherent advantages appeared great major line research late 1990s however time speed computers grew greatly relation networking systems disadvantages performance came overwhelm advantages development terms many attempts made adapt existing systems better performance overhead always considerable efforts required user-space programs moved back kernel 2000 large-scale mach-like efforts ended although apple macos released 2001 uses hybrid kernel called xnu combines heavily modified hybrid osfmk 7.3 kernel code bsd unix kernel also used ios tvos watchos mach-based gnu hurd also functional included testing versions arch linux debian although major work microkernels largely ended experimenters continued development since shown many performance problems earlier designs fundamental limitation concept instead due designer desire use single-purpose systems implement many services possible using pragmatic approach problem including assembly code relying processor enforce concepts normally supported software led new series microkernels dramatically improved performance microkernels closely related exokernels also much common hypervisors latter make claim minimality specialized supporting virtual machines indeed l4 microkernel frequently finds use hypervisor capacity early operating system kernels rather small partly computer memory limited capability computers grew number devices kernel control also grew throughout early history unix kernels generally small even though contained various device drivers file system implementations address spaces increased 16 32 bits kernel design longer constrained hardware architecture kernels began grow larger berkeley software distribution bsd unix began era larger kernels addition operating basic system consisting cpu disks printers bsd added complete tcp/ip networking system number virtual devices allowed existing programs work 'invisibly network growth continued many years resulting kernels millions lines source code result growth kernels prone bugs became increasingly difficult maintain microkernel intended address growth kernels difficulties resulted theory microkernel design allows easier management code due division user space services also allows increased security stability resulting reduced amount code running kernel mode example networking service crashed due buffer overflow networking service memory would corrupted leaving rest system still functional inter-process communication ipc mechanism allows separate processes communicate usually sending messages shared memory strictly speaking also inter-process communication mechanism abbreviation ipc usually refers message passing latter particularly relevant microkernels ipc allows operating system built number small programs called servers used programs system invoked via ipc support peripheral hardware handled fashion servers device drivers network protocol stacks file systems graphics etc ipc synchronous asynchronous asynchronous ipc analogous network communication sender dispatches message continues executing receiver checks polls availability message alerted via notification mechanism asynchronous ipc requires kernel maintains buffers queues messages deals buffer overflows also requires double copying messages sender kernel kernel receiver synchronous ipc first party sender receiver blocks party ready perform ipc require buffering multiple copies implicit rendezvous make programming tricky programmers prefer asynchronous send synchronous receive first-generation microkernels typically supported synchronous well asynchronous ipc suffered poor ipc performance jochen liedtke assumed design implementation ipc mechanisms underlying reason poor performance l4 microkernel pioneered methods lowered ipc costs order magnitude include ipc system call supports send well receive operation making ipc synchronous passing much data possible registers furthermore liedtke introduced concept direct process switch ipc execution incomplete context switch performed sender directly receiver l4 part message passed registers transfers in-register part message without copying furthermore overhead invoking scheduler avoided especially beneficial common case ipc used rpc-type fashion client invoking server another optimization called lazy scheduling avoids traversing scheduling queues ipc leaving threads block ipc ready queue scheduler invoked moves threads appropriate waiting queue many cases thread gets unblocked next scheduler invocation approach saves significant work similar approaches since adopted qnx minix 3 series experiments chen bershad compared memory cycles per instruction mcpi monolithic ultrix microkernel mach combined 4.3bsd unix server running user space results explained mach poorer performance higher mcpi demonstrated ipc alone responsible much system overhead suggesting optimizations focused exclusively ipc limited impact liedtke later refined chen bershad results making observation bulk difference ultrix mach mcpi caused capacity cache-misses concluding drastically reducing cache working set microkernel solve problem client-server system communication essentially synchronous even using asynchronous primitives typical operation client invoking server waiting reply also lends efficient implementation microkernels generally followed l4 lead provided synchronous ipc primitive asynchronous ipc could implemented top using helper threads however experience shown utility synchronous ipc dubious synchronous ipc forces multi-threaded design onto otherwise simple systems resulting synchronization complexities moreover rpc-like server invocation sequentializes client server avoided running separate cores versions l4 deployed commercial products therefore found necessary add asynchronous notification mechanism better support asynchronous communication signal-like mechanism carry data therefore require buffering kernel two forms ipc nonetheless violated principle minimality versions l4 switched asynchronous ipc completely synchronous ipc blocks first party ready unrestricted use could easily lead deadlocks furthermore client could easily mount denial-of-service attack server sending request never attempting receive reply therefore synchronous ipc must provide means prevent indefinite blocking many microkernels provide timeouts ipc calls limit blocking time practice choosing sensible timeout values difficult systems almost inevitably use infinite timeouts clients zero timeouts servers consequence trend towards providing arbitrary timeouts flag indicates ipc fail immediately partner ready approach effectively provides choice two timeout values zero infinity recent versions l4 minix gone path older versions l4 used timeouts qnx avoids problem requring client specify reply buffer part message send call server replies kernel copies data client buffer without wait client receive response explicitly microkernel servers essentially daemon programs like others except kernel grants privileges interact parts physical memory otherwise limits programs allows servers particularly device drivers interact directly hardware basic set servers general-purpose microkernel includes file system servers device driver servers networking servers display servers user interface device servers set servers drawn qnx provides roughly set services offered unix monolithic kernel necessary servers started system startup provide services file network device access ordinary application programs servers running environment user application server development similar ordinary application development rather build-and-boot process needed kernel development additionally many crashes corrected simply stopping restarting server however part system state lost failing server hence approach requires applications cope failure good example server responsible tcp/ip connections server restarted applications experience lost connection normal occurrence networked system services failure less expected may require changes application code qnx restart capability offered qnx high availability toolkit device drivers frequently perform direct memory access dma therefore write arbitrary locations physical memory including various kernel data structures drivers must therefore trusted common misconception means must part kernel fact driver inherently less trustworthy part kernel running device driver user space necessarily reduce damage misbehaving driver cause practice beneficial system stability presence buggy rather malicious drivers memory-access violations driver code opposed device may still caught memory-management hardware furthermore many devices dma-capable drivers made untrusted running user space recently increasing number computers feature iommus many used restrict device access physical memory also allows user-mode drivers become untrusted user-mode drivers actually predate microkernels michigan terminal system mts 1967 supported user space drivers including file system support first operating system designed capability historically drivers less problem number devices small trusted anyway kernel simplified design avoided potential performance problems led traditional driver-in-the-kernel style unix linux windows nt proliferation various kinds peripherals amount driver code escalated modern operating systems dominates kernel code size microkernel must allow building arbitrary operating system services top must provide core functionality minimum includes minimal design pioneered brinch hansen nucleus hypervisor ibm vm since formalised liedtke minimality principle concept tolerated inside microkernel moving outside kernel i.e. permitting competing implementations would prevent implementation system required functionality everything else done usermode program although device drivers implemented user programs may processor architectures require special privileges access i/o hardware related minimality principle equally important microkernel design separation mechanism policy enables construction arbitrary systems top minimal kernel policy built kernel overwritten user level therefore limits generality microkernel policy implemented user-level servers changed replacing servers letting application choose competing servers offering similar services efficiency microkernels contain schedulers manage timers violation minimality principle principle policy-mechanism separation start booting microkernel-based system requires device drivers part kernel typically means packaged kernel boot image kernel supports bootstrap protocol defines drivers located started traditional bootstrap procedure l4 microkernels microkernels simplify placing key drivers inside kernel violation minimality principle lynxos original minix examples even include file system kernel simplify booting microkernel-based system may boot via multiboot compatible boot loader systems usually load statically-linked servers make initial bootstrap mount os image continue bootstrapping key component microkernel good ipc system virtual-memory-manager design allows implementing page-fault handling swapping usermode servers safe way since services performed usermode programs efficient means communication programs essential far monolithic kernels design ipc system makes breaks microkernel effective ipc system must low overhead also interact well cpu scheduling mainstream processors obtaining service inherently expensive microkernel-based system monolithic system monolithic system service obtained single system call requires two mode switches changes processor ring cpu mode microkernel-based system service obtained sending ipc message server obtaining result another ipc message server requires context switch drivers implemented processes function call implemented procedures addition passing actual data server back may incur extra copying overhead monolithic system kernel directly access data client buffers performance therefore potential issue microkernel systems indeed experience first-generation microkernels mach chorusos showed systems based performed poorly however jochen liedtke showed mach performance problems result poor design implementation specifically mach excessive cache footprint liedtke demonstrated l4 microkernel careful design implementation especially following minimality principle ipc costs could reduced order magnitude compared mach l4 ipc performance still unbeaten across range architectures results demonstrate poor performance systems based first-generation microkernels representative second-generation kernels l4 constitutes proof microkernel-based systems built good performance shown monolithic linux server ported l4 exhibits percent overhead native linux however single-server system exhibits advantages microkernels supposed provide structuring operating system functionality separate servers number commercial multi-server systems exist particular real-time systems qnx integrity comprehensive comparison performance relative monolithic systems published multiserver systems furthermore performance seem overriding concern commercial systems instead emphasize reliably quick interrupt handling response times qnx simplicity sake robustness attempt build high-performance multiserver operating system ibm sawmill linux project however project never completed shown meantime user-level device drivers come close performance in-kernel drivers even high-throughput high-interrupt devices gigabit ethernet seems imply high-performance multi-server systems possible security benefits microkernels frequently discussed context security minimality principle microkernels argued direct consequence principle least privilege according code privileges needed provide required functionality minimality requires system trusted computing base tcb kept minimal kernel code executes privileged mode hardware unvetted access data thus violate integrity confidentiality kernel always part tcb minimizing natural security-driven design consequently microkernel designs used systems designed high-security applications including keykos eros military systems fact common criteria cc highest assurance level evaluation assurance level eal 7 explicit requirement target evaluation simple acknowledgment practical impossibility establishing true trustworthiness complex system unfortunately term simple misleading ill-defined least department defense trusted computer system evaluation criteria introduced somewhat precise verbiage b3/a1 classes recent work microkernels focusing formal specifications kernel api formal proofs api security properties implementation correctness first example mathematical proof confinement mechanisms eros based simplified model eros api recently comprehensive set machine-checked proofs performed properties protection model version l4 led referred third-generation microkernels characterised security-oriented api resource access controlled capabilities virtualization first-class concern novel approaches kernel resource management design goal suitability formal analysis besides usual goal high performance examples coyotos nova redox fiasco.oc case sel4 complete formal verification implementation achieved i.e mathematical proof kernel implementation consistent formal specification provides guarantee properties proved api actually hold real kernel degree assurance goes beyond even cc eal7 followed proofs security-enforcement properties api proof demonstrating executable binary code correct translation c implementation taking compiler tcb taken together proofs establish end-to-end proof security properties kernel term nanokernel picokernel historically referred also least one case term nanokernel used refer small kernel one supports nanosecond clock resolution | [
1807,
2540,
2182,
4297,
4670,
5021,
6085,
13,
3271,
3276,
3279,
3626,
5041,
7546,
7550,
35,
7554,
405,
1855,
4347,
7570,
65,
7581,
5780,
4366,
2251,
4733,
5783,
6853,
5088,
6500,
785,
2266,
788,
447,
3682,
1522,
7605,
7611,
4759,
7242,
... | Test |
5,022 | 2 | System_image:system image computing system image serialized copy entire state computer system stored non-volatile form file system said capable using system images shut later restored exactly state cases system images used backup hibernation example uses image entire machine ram system state written disk system image produced simply copying disk file elsewhere often disk cloning applications many systems complete system image created disk cloning program running within system information held outside disks volatile memory example non-volatile memory like boot roms process image copy given process state given point time often used create persistence within otherwise volatile system common example database management system dbms dbms store state database databases file closed see database dump dbms restarted later information database intact proceed though software never stopped another example would hibernate feature many operating systems state ram memory stored disk computer brought energy saving mode later restored normal operation emulators provide facility save image system emulated video gaming often referred savestate another use code mobility mobile agent migrate machines state saved copying data another machine restarting programming languages provide command take system image program normally standard feature smalltalk inspired flex lisp among languages development languages often quite different many programming languages example lisp programmer may load packages code running lisp implementation using read-eval-print loop usually compiles programs data loaded running lisp system programmer may dump system image containing pre-compiled possibly customized code—and also loaded application data often image executable run machines system image form executable programs distributed—this method often used programs tex emacs largely implemented lisp smalltalk idiosyncratic languages avoid spending time repeating initialization work every time start similar lisp machines booted lisp images called worlds world contains complete operating system applications data single file also possible save incremental worlds contain changes base world saving world lisp machine operating system could optimize contents memory better memory layout compacting data structures sorting data ... although purpose different system image often similar structure core dump | [
1710,
1438,
7526,
2204,
2390,
5571,
578,
1670,
2054,
4543,
1509,
1989,
2168,
5890
] | Test |
5,023 | 3 | Epson_Equity:epson equity epson equity series ibm compatible personal computers manufactured 1985 early '90s epson inc. epson well known dot matrix printers time equity series represents entry growing pc compatible market equity first system introduced equipped intel 8088 cpu one two 5.25 floppy disk drives original equity no-frills offering ran pc standard 4.77 mhz clock rate came 256 kb ram expansion 512 kb required expansion board displayed cga video available expansion slots two half-height drive bays lacked socket 8087 math chip subsequent versions equity i+ apex 100 upped clock rate 10 mhz standard ram 640 kb supported 3.5 inch floppy drives hard disks sported 8087 socket display circuitry monochrome hercules graphics adapter epson bundled utility programs offered decent turnkey functionality novice users equity reliable compatible design half price similarly-configured ibm pc epson often promoted sales bundling one printers cost equity sold well enough warrant furtherance equity line follow-on equity ii equity iii others based i386sx | [
4277,
3275
] | Test |
5,024 | 2 | Multics_Relational_Data_Store:multics relational data store multics relational data store mrds short first commercial relational database management system written pl/1 honeywell multics operating system first sold june 1976 unlike sql systems emerged late 1970s early 80 mrds used command language basic data manipulation equivalent codice_1 codice_2 statements sql operations like creating new database general file management required use separate command program | [
6462,
5571,
2054
] | Test |
5,025 | 9 | Metasyntactic_variable:metasyntactic variable metasyntactic variable specific word set words identified placeholder computer science specifically computer programming words commonly found source code intended modified substituted applicable specific usage compilation translation executable words foo bar good examples used 330 internet engineering task force requests comments documents explaining foundational internet technologies like http websites tcp/ip email protocols mathematical analogy metasyntactic variable word variable words algebra letters used variables numbers metasyntactic variables used name entities variables functions commands whose exact identity unimportant serve demonstrate concept useful teaching programming due english foundation-language lingua franca computer programming languages variables commonly seen even programs examples programs written spoken-language audiences typical names may depend however subculture developed around given programming language metasyntactic variables used commonly across programming languages include foobar foo bar baz qux quux quuz corge grault garply waldo fred plugh xyzzy thud several words references game colossal cave adventure wibble wobble wubble flob also used uk complete reference found mit press book titled hacker dictionary spam ham eggs principal metasyntactic variables used python programming language reference comedy sketch spam monty python eponym language japanese words hoge ほげ piyo ぴよ commonly used common words variants fuga ふが hogera ほげら hogehoge ほげほげ note -ra pluralizing ending japanese reduplication also used pluralizing origin hoge metasyntactic variable known believed date early 1980s french word toto widely used variants tata titi tutu related placeholders one commonly-raised source use toto reference stock character used tell jokes tête à toto following example function name foo variable name bar metasyntactic variables lines beginning // comments spam ham eggs principal metasyntactic variables used python programming language reference famous comedy sketch spam monty python eponym language following example spam ham eggs metasyntactic variables lines beginning comments ietf rfcs computer programming languages rendered plain text making necessary distinguish metasyntactic variables naming convention since would obvious context plain text example rfc 772 cited rfc 3092 contains instance another point reflected example convention metavariable uniformly substituted instance appearances given schema contrast nonterminal symbols formal grammars nonterminals right production substituted different instances section includes bits code show metasyntactic variables used teaching computer programming concepts function prototypes different argument passing mechanisms example showing function overloading capabilities c++ language | [
1361,
4637,
5965,
7370
] | Validation |
5,026 | 4 | Deep_Instinct:deep instinct deep instinct cybersecurity company applies deep learning cybersecurity company implements advanced artificial intelligence task preventing detecting malware deep instinct founded 2014 guy caspi dr. eli david nadav maman headquarters company located new york city nvidia investor april 2019 deep instinct commissioned art project titled persistence chaos chinese artist guo dong consisting laptop infected 6 pieces malware represented 95 billion damages art auctioned final bid 1,345,000 | [] | Test |
5,027 | 2 | Service_Request_Block:service request block service request block srb data structure mvs/370 successor versions ibm mainframe operating systems employed mainly exclusively start input/output interface srb may considered abstract highly optimized task control block tcb one associated resources access processor system resources utilized srb must accessed use branch entries new entries traditional system services formerly accessed exclusively using svc instructions srb may employ purpose abnormally terminating case svc 13 abend may used however branch entry abterm really appropriate employed start input/output interface srb always paired input/output supervisor block iosb otherwise employed srb facilitates inter -address-space communication general inter -application communication particular srbs may also employed intra -address-space processes highest possible performance required case necessary resources first acquired tcb usually job step tcb srbs scheduled i.e. presented system dispatcher compete processor resources conceivable address space may one tcb job step tcb tens hundreds even thousands srbs srbs performing almost work address space tcb merely synchronizing srbs responding communications system operator purposes synchronization tcb usually issue waitr svc 1 specifying list event control blocks ecbs one ecb per srb plus one system operator srb indicate completion tcb using branch entry post system service normally svc 2 special case would call address contained cvt0pt01 specifying ecb associated srb possibly message tcb message present often placed lowest 24 bits ecb otherwise unused highest eight bits used system disk device access network device access available srbs using improved control interval processing feature vsam fast path feature vtam respectively introduction mvs/370 successor systems whole new environment introduced service request block srb generally higher priority tcb indeed two distinct priorities global srb priority local address space srbs tcbs local srb priority local address space tcbs mvs dispatcher must manage absolute consistency across many two processors mvs/370 many sixteen processors successor systems sixteen processors available z/system models z/system support ziip dramatically increased use srbs traditional start input/output usage srb highly-optimized instance process control block mvs/370 successor systems tcb general-purpose instance process control block os/360 successor systems | [
8159,
5571,
7948,
7783,
3905
] | Test |
5,028 | 1 | Digital_Notam:digital notam digital notam digitam data set made available digital services containing information concerning establishment condition change aeronautical facility service procedure hazard timely knowledge essential systems automated equipment used personnel concerned flight operations digital notam encoding based aeronautical information exchange model aixm version 5 developed cooperation european organisation safety air navigation eurocontrol united states federal aviation administration faa support international ais community.the digitam eliminates free form text contained within notam replaces text series structured facts obtain aeronautical entity concerned 2012 federal aviation administration faa successfully launched first global digital notam notice airmen system airports airplanes united states | [
2054
] | Test |
5,029 | 4 | Snowden_effect:snowden effect snowden effect part reactions global surveillance disclosures made edward snowden subject controversy snowden variously called hero whistleblower dissident patriot traitor july 2013 media critic jay rosen defined snowden effect direct indirect gains public knowledge cascade events reporting followed edward snowden leaks classified information surveillance state u.s. december 2013 nation wrote snowden sparked overdue debate national security individual privacy 2014 world economic forum internet experts saw news microsoft would let foreign customers store personal data servers outside america sign snowden leaks leading countries companies erect borders cyberspace forbes effect seen nearly united u.s. congress opposition massive post-9/11 domestic intelligence gathering system spring 2014 global attitudes survey pew research center found snowden disclosures tarnished image united states especially europe latin america may 2014 obama administration appointed william evanina former fbi special agent counter-terrorism specialty new government-wide national counterintelligence executive instead getting carried away concept leakers heroes evanina said august need get back basics means loyal undifferentiated unauthorized leaking criminal act dealing insider threats intelligence community priority since wikileaks published chelsea manning disclosures 2010 evanina said aftermath snowden june 2013 revelations process sped regional railway acela train year later 100,000 fewer people security clearances september 2014 director national intelligence james clapper said snowden leaks created perfect storm degrading intelligence community capabilities snowden leaks said clapper damaged relationships foreign corporate stakeholders restrained budget resources caused u.s. discontinue collecting intelligence certain targets putting united states greater risk october 2014 former director national counterterrorism center matthew g. olsen told cnn snowden disclosures made easier terrorist groups evade u.s. surveillance changing encryption methods olsen said intelligence collection individuals concern lost preventing insight activities july 2015 isil studied snowden disclosures said u.s. officials leaders using couriers encrypted communications western analysts could crack february 2015 national counterterrorism center director nicholas rasmussen told congress snowden disclosures damaged u.s. intelligence capabilities rasmussen said government knew specific terrorists learning snowden leaks u.s. collected intelligence increased security measures using new types encryption changing email addresses abandoning prior methods communicating reflecting effect leaks snowden wrote february 2015 biggest change awareness 2013 said nsa making records everybody phonecalls gchq monitoring lawyers journalists people raised eyebrows called conspiracy theorist days march 2015 usa today reported snowden effect hit guardian journalist michael wolff wrote guardian many years asserted recent selection katharine viner editor-in-chief read part deeply equivocal response part paper staff unusual power process selecting new editor snowden story according wolff developed sense journalistic queasiness around snowden difficult express party-line guardian questioning snowden retreat russia protection vladimir putin internally verboten technology industry snowden effect profound impact revealed nsa tapping information held u.s. cloud-based services google cisco lost business internationally due public outcry roles nsa spying study information technology innovation foundation published august 2013 estimated cloud-based computing industry could lost 35 billion 2016 wall street journal named snowden effect 2013 top tech story saying snowden leaks taught businesses convenience cloud cuts ways journal predicted effect would top 2014 news well given number documents yet revealed china profitable country u.s. tech companies suspicion either witting unwitting collaborators nsa spying according director research center chinese politics business indiana university effect also seen changes investment industry security back map according hussein kanji venture capitalist hoxton ventures august 8 2013 lavabit secure email provider snowden used discontinued service asked encryption keys would exposed u.s. government prosecutors emails 410,000 lavabit users next day similar provider called silent circle announced would shut possible sufficiently secure email october 2013 two companies joined forces announced new email service dark mail alliance designed withstand government surveillance revelations german chancellor angela merkel mobile tapped tech industry rushed create secure cell phone according techrepublic revelations nsa leaks rocked world chilling effect three biggest impacts seen increased interest encryption business leaving u.s. companies reconsideration safety cloud technology blackphone new yorker called phone age snowden —described smartphone explicitly designed security privacy created makers geeksphone silent circle pgp provided encryption phone calls emails texts internet browsing. ref name= kopstein/new yorker /ref since snowden disclosures americans used internet less things like email online shopping banking according april 2014 poll also april 2014 former nsa deputy director col. cedric leighton told bloomberg enterprise technology summit new york city snowden leaks performed significant disservice worldwide health internet leading brazil countries reconsider internet decentralized nature leighton suggested nation states efforts create versions internet beginning end internet know situation sudden everyone goes 'tribal mode—a german cloud swiss cloud separate internet—they significant nationalistic attempts said leighton happened snowden excuse policy excuse re-nationalize internet march 2014 new york times reported economic fallout snowden leaks boon foreign companies detriment u.s. firms daniel castro senior analyst information technology innovation foundation predicted united states cloud computing industry could lose 35 billion 2016 matthias kunisch german software executive switched u.s. cloud computing providers deutsche telekom said due snowden customers thought american companies connections nsa security analysts estimated u.s. tech companies since snowden collectively spent millions possibly billions dollars adding state-of-the-art encryption features consumer services cables link data centers july 2014 nonpartisan new america foundation summarized impact snowden revelations u.s. businesses erosion trust said report serious consequences u.s. tech firms executives france hong kong germany uk u.s. confirmed snowden leaks directly impacted companies around world think information communication technologies particularly cloud computing quarter british canadian multinational companies surveyed moving data outside u.s among u.s. companies attributing drops revenue part fallout snowden leaks cisco systems qualcomm ibm microsoft hewlett-packard proposed laws dozen foreign countries including germany brazil india would make harder u.s. firms business european union considering stricter domestic privacy legislation could result fines penalties costing u.s. firms billions dollars august 2014 massachusetts-based web intelligence firm recorded future announced found direct connection snowden leaks dramatic changes islamist terrorists interacted online 2010 privately held recorded future received investment in-q-tel nonprofit venture capital firm whose primary partner cia months snowden 2013 leaks said recorded future operatives al-qaeda associated groups completely overhauled 7-year-old encryption methods included homebrewed algorithms adopting instead sophisticated open-source software newly available downloads enabled encryption cellphones android products macs help disguise communications september 2014 seattle-based deep web dark web monitoring firm flashpoint global partners published report found little open source information available via jihadi online social media indicating snowden leaks impelled al-qaeda develop secure digital communications underlying public encryption methods employed online jihadists report concluded appear significantly changed since emergence edward snowden major recent technological advancements focused primarily expanding use encryption instant messenger mobile communications mediums may 2015 nation reported fallout edward snowden fiasco n't political—it largely economic soon extent nsa data collection became public overseas customers including brazilian government started abandoning u.s.-based tech companies droves privacy concerns dust n't settled yet tech-research firm forrester estimated losses may total 'as high 180 billion 25 percent industry revenue september 2014 new york times credited apple inc. update ios 8 encrypts data inside demonstrating snowden impact begun work way consumer products revelations said times killed recent efforts expand law also made nations around world suspicious every piece american hardware software—from phones servers made cisco systems—have 'back doors american intelligence law enforcement times situated development within post snowden era apple would longer comply nsa law enforcement requests user data instead maintaining apple n't possess key unlock data iphone however since new security protects information stored device data stored apple icloud service apple still able obtain customer information stored icloud response government requests times added google android would encryption enabled default upcoming versions | [
2961,
6788,
3764,
4214,
5773,
6874,
1986,
4783,
3241
] | Test |
5,030 | 7 | Qualcomm_Wi-Fi_SON:qualcomm wi-fi son qualcomm wi-fi son self-organizing network solution developed qualcomm wi-fi networks simply automatically select link different wireless networking devices together using concept mesh networking supposed improve network coverage different corners house apartment also provide improved security note technology behind solution like mesh networking cellular self-organizing network would included dynamical adjustment different access points client devices | [
6987,
6874
] | Validation |
5,031 | 4 | Chris_Klaus:chris klaus christopher w. klaus born 1973 sarasota florida american technology entrepreneur founder cto internet security systems iss company started early 1990s sold ibm 2006 1.3b 2016 ceo kaneva game company founded 2004 also main financier multiple business accelerators atlanta area klaus formed iss early 1990s student georgia institute technology eventually dropping focus growing company 2004 stepped role chief technology officer iss pursue interests although remained significant shareholder retained role company chief security advisor 2006 iss sold ibm 1.3b around 2007 klaus became one georgia tech visible contributors giving 15m naming gift build college computing new home klaus advanced computing building july 2014 klaus co-founded neurolaunch business accelerator focused towards neurotech companies atlanta october 2015 financed co-founded another accelerator cyberlaunch focuses cybersecurity machine learning startups klaus wife crissy also prominent figure fifteen years work local marketing real estate well extensive work non-profit organizations recently founded fio360 atlanta first eco-early care center | [] | Test |
5,032 | 1 | NoSQLz:nosqlz nosqlz consistent key-value big data store nosql database z/os ibm systems developed systems programmer thierry falissard 2013 purpose provide low-cost alternative proprietary mainframe dbms version 1 free software nosqlz provides basic create read update delete crud functions designed straightforward easy implement acid properties provided real transactions optimistic concurrency control timestamp-based concurrency control multiversion concurrency control mvcc unlike version 1 version 2 nosqlz chargeable supports ibm parallel sysplex nosqlz dbms interfaced rexx cobol ibm high level assembler etc | [
5571
] | Test |
5,033 | 4 | SMS_spoofing:sms spoofing sms spoofing technology uses short message service sms available mobile phones personal digital assistants set message appears come replacing originating mobile number sender id alphanumeric text spoofing legitimate uses setting company name message sent setting mobile number product name illegitimate uses impersonating another person company product also send mysterious messages look like legitimate numbers contacts sms spoofing occurs sender manipulates address information often done order impersonate user roamed onto foreign network submitting messages home network frequently messages addressed destinations outside home network – home smsc essentially “ hijacked ” send messages networks advanced cases even hijack existing contacts phone impact activity threefold legitimate use cases sms spoofing include sms spoofing attack often first detected increase number sms errors encountered bill-run errors caused spoofed subscriber identities operators respond blocking different source addresses gateway-mscs fraudsters change addresses easily by-pass measures fraudsters move using source addresses major interconnect partner may become unfeasible block addresses due potential impact normal interconnect services 2007 uk premium rate regulator phonepayplus formerly icstis concluded public consultation anonymous sms stated averse operation services however 2008 phonepayplus introduced new regulation covering anonymous sms requiring anonymous sms service providers send follow-up message recipient stating spoofed sms sent operate complaints helpline illegal send anonymous sms messages australia user prove sms sessions spoofed contact law enforcement cellular provider able track sms messages actually sent user may also modify phone settings messages authorized numbers allowed always effective since hackers could impersonating user friends well | [] | Test |
5,034 | 9 | Geometric_Description_Language:geometric description language computer-aided design geometric description language gdl programming language archicad library parts gsm file format cad objects objects similar blocks autocad unlike blocks parametric 2d 3d features connected view one get correct visualization example side view section top view plan perspective 3d view gdl scripts define archicad library part main roles 3d model 3d model projected section/elevation 2d plan 2d plan view user interface display behaviour listing quantities versions archicad contain default libraries also objects like furniture windows doors trees people cars construction elements etc several commercial websites selling high-detailed intelligent parametric objects perhaps better variable default libraries example lot environmental objects like plants people garden elements included original software gdl free technology although archicad commercial software allowed possible develop gdl based object libraries using free tools like graphisoft lp_xmlconverter graphisoft gdl web plug-in gdl programming language basic-like control flow statements variable logic 2d 3d gdl model elements linked local right-handed coordinate system placing element desired position move coordinate system desired position orientation generate element every movement rotation stretching coordinate system called transformation transformations stored stack extended transformations cut deleting one transformations top gdl maintains forward compatibility means archicad library part readable every subsequent archicad program necessarily earlier versions | [
5036,
2773
] | Validation |
5,035 | 4 | LOMAC:lomac low water-mark mandatory access control lomac mandatory access control model protects integrity system objects subjects means information flow policy coupled subject demotion via floating labels lomac system subjects objects assigned integrity labels made one hierarchical grades depending types together label elements permit labels placed partial order information flow protections demotion decisions based dominance operator describing order | [
1512,
578
] | Validation |
5,036 | 2 | ArchiCAD:archicad archicad architectural bim cad software macintosh windows developed hungarian company graphisoft archicad offers computer aided solutions handling common aspects aesthetics engineering whole design process built environment — buildings interiors urban areas etc development archicad started 1982 original apple macintosh following launch 1987 graphisoft virtual building concept archicad became regarded first implementation bim archicad recognized first cad product personal computer able create 2d 3d geometry well first commercial bim product personal computers considered revolutionary ability store large amounts information within 3d model today 120,000 users archicad complete design suite 2d 3d drafting visualization building information modeling functions architects designers planners wide range software applications integrated archicad cover design needs architectural office archicad allows user work data-enhanced parametric objects often called smart objects users differs operational style cad programs created 1980s product allows user create virtual building virtual structural elements like walls slabs roofs doors windows furniture large variety pre-designed customizable objects come program archicad allows user work either 2d 3d representation screen two-dimensional drawings exported time even though model program database always stores data three dimensions plans elevations sections generated three-dimensional virtual building model constantly updated user 'rebuilds view detail drawings based enlarged portions model 2d detail added archicad released first file exchange based teamwork solution version 5.1 1997 allowed architects work building model simultaneously completely rewritten teamwork 2.0 solution new database approach came version 13 2009 named graphisoft bim server since changes differences sent central storage solution allows remote access project internet thus allowing worldwide project collaboration coordination 2014 introduction bimcloud better integration provided standard solutions browser-based management ldap connection http/https based communication also new scalability options available allowing multi-server layouts created optional caching servers third-party vendors manufacturers architectural products compiled libraries architectural components use archicad program includes geometric description language gdl used create new components also api application programming interface odbc database connections supported third party add-on developers via direct api links 4d 5d software vico office suite tocoman ilink archicad model exported bim-based cost estimation scheduling archicad also directly linked via api solibri model checking quality assurance tools addition graphisoft provides direct link grasshopper 3d enabling visual programming environment parametric modelling design archicad import export dwg dxf ifc bcf files among others graphisoft active member buildingsmart formerly international alliance interoperability iai industry organization publishes standards file data interoperability built environment software graphisoft one founders open bim concept supports 3d bim data exchange different design disciplines open-source platforms archicad also export 3d model corresponding 2d drawings bimx format viewed number desktop mobile platforms native bimx viewers commercial educational fully functional 30-day trial versions installed installer long hardware protection present software activated trial educational serial number archicad launched demo mode installer files downloaded without registration educational trial serial numbers obtained registration archicad available number localized versions addition translated user interface documentation versions set parametric objects object libraries developed considering specific requirements regional market different default values object properties menu arrangements etc various free commercial add-on products extensions add extra functionality archicad provide data exchange possibilities software applications extensions developed graphisoft freely available trimble sketchup google earth maxon cinema 4d import/export add-ons extensions sold separately graphisoft mep modeler graphisoft ecodesigner graphisoft virtual building explorer number add-ons provided third party vendors cigraph cadimage detailed version history see help center article | [
5034,
727,
4759,
5571,
7346
] | Test |
5,037 | 3 | Macintosh_IIsi:macintosh iisi macintosh iisi personal computer designed manufactured sold apple computer inc. october 1990 march 1993 introduced lower-cost alternative macintosh ii family desktop models popular home use offered expandability performance macintosh lc introduced time like lc built-in sound support well support color displays maximum screen resolution 640×480 eight-bit color iisi remained market two half years discontinued shortly introduction replacement centris 610 iisi case design compact three-box desktop unit used macintosh model one macintosh models true positioned macintosh iici apple entry-level professional model iisi price lowered redesign motherboard substituting different memory controller deletion one expansion card slots single processor direct slot removal level 2 cache slot shipped either 40-mb 80-mb internal hard disk 1.44-mb floppy disk drive mc 68882 fpu optional upgrade mounted special plug-in card ports included scsi two serial ports adb port floppy drive port 3.5mm stereo headphone sound output microphone sound input sockets bridge card available iisi convert processor direct slot standard internal nubus card slot compatible machines macintosh ii family bridge card included math co-processor improve floating-point performance nubus card mounted horizontally motherboard cut costs iisi video shared main system memory also effect slowing video considerably especially iisi 1 mb slow ram soldered motherboard david pogue book macworld macintosh secrets observed one could speed video considerably one set disk cache size large enough force computer draw video ram faster ram installed simm banks iisi also suffers sound difficulties time speaker contacts fail causing sound periodically drop problem caused modular construction computer mono loudspeaker daughterboard motherboard springy contacts speaker vibrations led fretting touching surfaces problem could solved removing motherboard using pencil eraser clean contacts daughterboard holding loudspeaker iisi macintosh use case design issues never corrected subsequent model iisi designed easily cheaply manufactured tools required put one together – everything held place clips latches heritage cut-down iici simple modification substitute new clock crystal increase system clock rate 25 mhz slight increase performance charles bukowski enthusiastic user iisi | [
7890,
5732,
722,
1094,
2926,
5752,
405,
2954,
7572,
6482,
6142,
4373,
7226,
2978,
7601,
4749,
5097,
3346,
6165,
4389,
5463,
102,
5469,
4768,
3008,
5477,
6200,
6202,
3387,
3390,
1216,
2331,
4820,
1234,
1237,
7311,
889,
550,
552,
5916,
34... | Test |
5,038 | 3 | Compaq_Presario_V6000:compaq presario v6000 compaq presario v6000 series widescreen 15.4 nowiki /nowiki laptop computers manufactured hewlett packard includes v6000z series based amd processors mobile sempron dual core turion x2 v6000t based intel processors repeated reliability issues amd based v6000z laptops fan algorithm bios misconfigured causing overheating damage wireless cards motherboard late 2007 hp extended limited warranty cover defects however date limited 2 years purchase product computer shows faults 2-year period hewlett packard repair despite fault cause australia resulted action queensland office fair trading hewlett packard misrepresenting customers rights resulting agreed au 3 million settlement computer available following processors max screen resolution 1280x800 nvidia geforce go 6150 intel x3100 depending cpu family nvidia geforce go 7150m intel gma 950 memory expandable 3 gb memory built wireless lan receiver intel r pro/wireless 3945abg broadcom equipped 802.1g bluetooth powered hp software upgrade windows 7 ultimate 32-bit possible problems reported many hp pavilion dv9000 laptop computers well | [
1237,
4736
] | Validation |
5,039 | 5 | STUN:stun session traversal utilities nat stun standardized set methods including network protocol traversal network address translator nat gateways applications real-time voice video messaging interactive communications stun tool used protocols interactive connectivity establishment ice session initiation protocol sip webrtc provides tool hosts discover presence network address translator discover mapped usually public internet protocol ip address port number nat allocated application user datagram protocol udp flows remote hosts protocol requires assistance third-party network server stun server located opposing public side nat usually public internet originally stun acronym simple traversal user datagram protocol udp network address translators title changed specification updated set methods published rfc 5389 retaining acronym stun tool communications protocols detect traverse network address translators located path two endpoints communication implemented light-weight client-server protocol requiring simple query response components third-party server located common easily accessible network typically internet client side implemented user communications application voice internet protocol voip phone instant messaging client basic protocol operates essentially follows client typically operating inside private network sends binding request stun server public internet stun server responds success response contains ip address port number client observed server perspective result obfuscated exclusive xor mapping avoid translation packet content application layer gateways algs perform deep packet inspection attempt perform alternate nat traversal methods stun messages sent user datagram protocol udp packets since udp provide reliable transport guarantees reliability achieved application-controlled retransmissions stun requests stun servers implement reliability mechanism responses reliability mandatory transmission control protocol tcp may used induces extra networking overhead security-sensitive applications stun may transported encrypted transport layer security tls application may automatically determine suitable stun server communications particular peer querying domain name system dns stun udp stuns tcp/tls server srv resource record e.g. _stun._udp.example.com standard listening port number stun server 3478 udp tcp 5349 tls alternatively tls may also run tcp port server implementation de-multiplex tls stun packets case stun server found using dns lookups standard recommends destination domain name queried address records aaaa would used default port numbers addition using protocol encryption tls stun also built-in authentication message-integrity mechanisms via specialized stun packet types client evaluated external address use candidate communicating peers sharing external nat address rather private address reachable peers public network communicating peers located different private networks behind nat peers must coordinate determine best communication path nat behavior may restrict peer connectivity even public binding known interactive connectivity establishment ice protocol provides structured mechanism determine optimal communication path two peers session initiation protocol sip extensions defined enable use ice setting call two hosts network address translation implemented via number different address port mapping schemes none standardized stun self-contained nat traversal solution applicable nat deployment scenarios work correctly tool among methods tool protocols dealing nat traversal notably traversal using relay nat turn interactive connectivity establishment ice stun work three types nat full cone nat restricted cone nat port restricted cone nat cases restricted cone port restricted cone nats client must send packet endpoint nat allow packets endpoint client stun work symmetric nat also known bi-directional nat often found networks large companies since ip address stun server different endpoint symmetric nat case nat mapping different stun server endpoint turn offers better results symmetric nat original specification stun rfc 3489 specified algorithm characterize nat behavior according address port mapping behavior algorithm reliably successful applicable subset nat devices deployed algorithm consists series tests performed application path diagram ends red box udp communication possible path ends yellow green box communication possible methods rfc 3489 proved unreliable cope plethora different nat implementations application scenarios encountered production networks stun protocol method updated rfc 5389 retaining many original specifications subset methods removing others | [
7148,
456,
6879,
4577,
2281,
6521,
6976,
3775,
3855,
3952,
2644,
7170,
6531,
1462,
2650,
2111,
7637,
1470,
5488,
2119,
6908,
2664,
7091,
2219,
3383,
3640,
3797,
5847,
407,
2043,
3312,
2681,
4172,
2057,
3819,
3820,
3821,
2880,
2696,
7214,
... | Test |
5,040 | 8 | Web_data_services:web data services web data services refers service-oriented architecture soa applied data sourced world wide web internet whole web data services enable maximal mashup reuse sharing structured data relational tables semi-structured information extensible markup language xml documents unstructured information rss feeds content web applications commercial data online business sources web data services environment applications may subscribe consume information provide publish information others consume applications serve consumer-subscriber and/or provider-publisher web data services include mobile computing web portals enterprise portals online business software social media social networks web data services may support business-to-consumer b2c business-to-business b2b information-sharing requirements increasingly enterprises including web data services soa implementations integrate mashup-style user-driven information sharing business intelligence business process management predictive analytics content management applications according industry analysts speed development web data services enterprises deploy technologies ease discovery extraction movement transformation cleansing normalization joining consolidation access presentation disparate information types diverse internal sources data warehouses customer relationship management crm systems external sources commercial market data aggregators web data services build industry-standard protocols interfaces formats integration patterns used soa web 2.0 web-oriented architecture representational state transfer rest addition operating public internet web data services may run solely within corporate intranets across b2b supply chains even span hosted software-as-a-service saas cloud computing environments | [
2961,
84
] | Test |
5,041 | 2 | VM_(operating_system):vm operating system vm often vm/cms family ibm virtual machine operating systems used ibm mainframes system/370 system/390 zseries system z compatible systems including hercules emulator personal computers first version released 1972 vm/370 officially virtual machine facility/370 system/370 reimplementation earlier cp/cms operating system milestone versions included vm/sp current version z/vm still widely used one main full virtualization solutions mainframe market cms usually coupled vm name refers conversational monitor system single-user operating system developed provide conversational time-sharing vm heart vm architecture control program hypervisor called vm-cp usually cp sometimes ambiguously vm runs physical hardware creates virtual machine environment vm-cp provides full virtualization physical machine – including i/o privileged operations performs system resource-sharing including device management dispatching virtual storage management traditional operating system tasks vm user provided separate virtual machine address space virtual devices etc. capable running software could run stand-alone machine given vm mainframe typically runs hundreds thousands virtual machine instances vm-cp began life cp-370 reimplementation cp-67 reimplementation cp-40 running within virtual machine another guest operating system might one time cms capable running bare machine true operating system though configuration would unusual runs guest os vm cms relies hypervisor interface vm-cp perform file system operations request vm services paravirtualization interface ibm coined term hypervisor 360/65 later used diag handler cp-67 diagnose instruction '83 x—no mnemonic privileged instruction originally intended ibm perform built-in diagnostic functions model-dependent functions vm/370 repurposed communication virtual machine cp instruction contains two four-bit register numbers called rx ry contain operand storage addresses return codes passed diagnose interface two-byte code cp uses determine diagnose function perform available diagnose functions listed early history vm described articles cp/cms history cp/cms vm/370 reimplementation cp/cms made available 1972 part ibm system/370 advanced function announcement added virtual memory hardware operating systems system/370 series early releases vm vm/370 release 6 continued open source today considered public domain policy ended late 1970s chargeable vm/se vm/bse upgrades 1980 vm/system product vm/sp however ibm continued providing updates source form existing code many years cp-67 privileged instructions virtual machine cause program interrupt cp simulated behavior privileged instruction vm remained important platform within ibm used operating system development time-sharing use customers remained ibm operating system os dos families remained ibm strategic products customers encouraged run vm formed close working relationships continuing community-support model early cp/cms users meantime system struggled political infighting within ibm resources available project compared ibm efforts basic problem system seen ibm field sales level vm/cms demonstrably reduced amount hardware needed support given number time-sharing users ibm business selling computer systems melinda varian provides fascinating quote illustrating vm unexpected success marketing forecasts vm/370 predicted one 168 would ever run vm entire life product fact first 168 delivered customer ran cp cms ten years later ten percent large processors shipped poughkeepsie would destined run vm would substantial portion mid-range machines built endicott fifteen years passed would vm licenses mvs licenses pc dos version runs xt/370 later at/370 called vm/pc vm/pc 1.1 based vm/sp release 3 ibm introduced system/370 extended architecture 3081 customers faced need run production mvs/370 system testing mvs/xa machine ibm solution vm/xa migration aid used new start interpretive execution sie instruction run virtual machine sie automatically handled privileged instructions returned cp cases could n't handle processor resource/system manager pr/sm later 3090 also used sie several vm/xa products eventually supplanted vm/esa z/vm vm role changed within ibm hardware evolution led significant changes processor architecture backward compatibility remained cornerstone ibm mainframe family still uses basic instruction set introduced original system/360 need efficient use 64-bit zseries made vm approach much attractive vm also utilized data centers converting dos/vse mvs useful running mainframe aix linux platforms become increasingly important current z/vm platform finally achieved recognition within ibm vm users long felt deserved z/vm sites run thousands simultaneous virtual machine users single system z/vm first released october 2000 remains active use development ibm third parties offered many applications tools run vm examples include ramis focus spss nomad db2 rexx racf officevision current vm offerings run gamut mainframe applications including http servers database managers analysis tools engineering packages financial systems release 6 vm/370 control program number commands general users concerned defining controlling user virtual machine lower-case portions command optional early 1980s vm group within share ibm user group sought mascot logo community adopt part response ibm mvs users selecting turkey mascot hilariously chosen according legend mvs performance group early days mvs performance sore topic 1983 teddy bear became vm de facto mascot share 60 teddy bear stickers attached nametags cuddlier oldtimers flag newcomers friendly approached bears hit soon appeared widely bears awarded inductees order knights vm individuals made useful contributions community | [
1807,
4291,
3,
4297,
4670,
5021,
5726,
13,
3271,
3276,
3626,
387,
7546,
5396,
7550,
402,
405,
1855,
2229,
4347,
65,
6849,
4366,
4733,
5783,
6853,
5088,
6500,
785,
1516,
2266,
788,
3682,
1522,
7605,
7611,
4759,
7242,
6518,
4397,
6892,
... | Validation |
5,042 | 3 | Simultaneous_multithreading:simultaneous multithreading simultaneous multithreading smt technique improving overall efficiency superscalar cpus hardware multithreading smt permits multiple independent threads execution better utilize resources provided modern processor architectures name multithreading ambiguous multiple threads executed simultaneously one cpu core also multiple tasks different page tables different task state segments different protection rings different i/o permissions etc. although running core completely separated multithreading similar concept preemptive multitasking implemented thread level execution modern superscalar processors simultaneous multithreading smt one two main implementations multithreading form temporal multithreading also known super-threading temporal multithreading one thread instructions execute given pipeline stage time simultaneous multithreading instructions one thread executed given pipeline stage time done without great changes basic processor architecture main additions needed ability fetch instructions multiple threads cycle larger register file hold data multiple threads number concurrent threads decided chip designers two concurrent threads per cpu core common processors support eight concurrent threads per core really efficiency technique inevitably increases conflict shared resources measuring agreeing effectiveness difficult however measured energy efficiency smt parallel native managed workloads historical 130 nm 32 nm intel smt hyper-threading implementations found 45 nm 32 nm implementations smt extremely energy efficient even inorder atom processors modern systems smt effectively exploits concurrency little additional dynamic power even performance gains minimal power consumption savings considerable researchers shown extra threads used proactively seed shared resource like cache improve performance another single thread claim shows smt increase efficiency others use smt provide redundant computation level error detection recovery however current cases smt hiding memory latency increasing efficiency increasing throughput computations per amount hardware used processor design two ways increase on-chip parallelism fewer resource requirements one superscalar technique tries exploit instruction level parallelism ilp multithreading approach exploiting thread level parallelism tlp superscalar means executing multiple instructions time thread-level parallelism tlp executes instructions multiple threads within one processor chip time many ways support one thread within chip namely key factor distinguish look many instructions processor issue one cycle many threads instructions come example sun microsystems ultrasparc t1 known niagara november 14 2005 release multicore processor combined fine-grain multithreading technique instead simultaneous multithreading core issue one instruction time multithreading cpus around since 1950s simultaneous multithreading first researched ibm 1968 part acs-360 project first major commercial microprocessor developed smt alpha 21464 ev8 microprocessor developed dec coordination dean tullsen university california san diego susan eggers henry levy university washington microprocessor never released since alpha line microprocessors discontinued shortly hp acquired compaq turn acquired dec. dean tullsen work also used develop hyper-threading hyper-threading technology htt versions intel pentium 4 microprocessors northwood prescott intel pentium 4 first modern desktop processor implement simultaneous multithreading starting 3.06 ghz model released 2002 since introduced number processors intel calls functionality hyper-threading provides basic two-thread smt engine intel claims 30 speed improvement compared otherwise identical non-smt pentium 4 performance improvement seen application-dependent however running two programs require full attention processor actually seem like one programs slows slightly hyper-threading turned due replay system pentium 4 tying valuable execution resources increasing contention resources bandwidth caches tlbs re-order buffer entries equalizing processor resources two programs adds varying amount execution time pentium 4 prescott core gained replay queue reduces execution time needed replay system enough completely overcome performance hit latest imagination technologies mips architecture designs include smt system known mips mt mips mt provides heavyweight virtual processing elements lighter-weight hardware microthreads rmi cupertino-based startup first mips vendor provide processor soc based eight cores runs four threads threads run fine-grain mode different thread executed cycle threads also assigned priorities imagination technologies mips cpus two smt threads per core ibm blue gene/q 4-way smt ibm power5 announced may 2004 comes either dual core dual-chip module dcm quad-core oct-core multi-chip module mcm core including two-thread smt engine ibm implementation sophisticated previous ones assign different priority various threads fine-grained smt engine turned dynamically better execute workloads smt processor would increase performance ibm second implementation generally available hardware multithreading 2010 ibm released systems based power7 processor eight cores four simultaneous intelligent threads switches threading mode one thread two threads four threads depending number process threads scheduled time optimizes use core minimum response time maximum throughput ibm power8 8 intelligent simultaneous threads per core smt8 ibm z13 two threads per core smt-2 although many people reported sun microsystems ultrasparc t1 known niagara 14 november 2005 release defunct processor codenamed rock originally announced 2005 many delays cancelled 2009 implementations sparc focused almost entirely exploiting smt cmp techniques niagara actually using smt sun refers combined approaches cmt overall concept throughput computing niagara eight cores core one pipeline actually uses fine-grained multithreading unlike smt instructions multiple threads share issue window cycle processor uses round robin policy issue instructions next active thread cycle makes similar barrel processor sun microsystems rock processor different complex cores one pipeline oracle corporation sparc t3 eight fine-grained threads per core sparc t4 sparc t5 sparc m5 m6 m7 eight fine-grained threads per core two executed simultaneously fujitsu sparc64 vi coarse-grained vertical multithreading vmt sparc vii newer 2-way smt intel itanium montecito used coarse-grained multithreading tukwila newer use 2-way smt dual-domain multithreading intel xeon phi 4-way smt time-multiplexed multithreading hardware based threads ca n't disabled unlike regular hyperthreading intel atom released 2008 first intel product feature 2-way smt marketed hyper-threading without supporting instruction reordering speculative execution register renaming intel reintroduced hyper-threading nehalem microarchitecture absence core microarchitecture amd bulldozer microarchitecture flexfpu shared l2 cache multithreaded integer cores module single threaded partial smt implementation amd zen microarchitecture 2-way smt visc architecture uses virtual software layer translation layer dispatch single thread instructions global front end splits instructions virtual hardware threadlets dispatched separate virtual cores virtual cores send available resources physical cores multiple virtual cores push threadlets reorder buffer single physical core split partial instructions data multiple threadlets execution ports time virtual core keeps track position relative output form multithreading increase single threaded performance allowing single thread use resources cpu allocation resources dynamic near-single cycle latency level 1-4 cycles depending change allocation depending individual application needs therefore two virtual cores competing resources appropriate algorithms place determine resources allocated depending design architecture processor simultaneous multithreading decrease performance shared resources bottlenecks performance critics argue considerable burden put software developers test whether simultaneous multithreading good bad application various situations insert extra logic turn decreases performance current operating systems lack convenient api calls purpose preventing processes different priority taking resources also security concern certain simultaneous multithreading implementations intel hyperthreading netburst based processors vulnerability possible one application steal cryptographic key another application running processor monitoring cache use also sophisticated machine learning exploits ht implementation explained black hat 2018 | [
2539,
5012,
1447,
5371,
3948,
7527,
7529,
5737,
4318,
2567,
4694,
1481,
5055,
2226,
1867,
4718,
6474,
2961,
5779,
7213,
2248,
3667,
2969,
6148,
441,
4742,
5447,
2266,
450,
4047,
1546,
4049,
4408,
1185,
5483,
1556,
5487,
1947,
6198,
1568,
... | Test |
5,043 | 9 | AngelScript:angelscript angelscript game-oriented interpreted compiled scripting language angelscript features static typing object handles similar c++ pointers garbage collected via reference counting object-orientation single inheritance multiple inheritance interfaces allows operators registered overloaded angelscript used c++ ide netbeans geany eclipse also supported angeljuice ide developed specifically language c c++ functions called within angelscript environment angelscript class syntax closely follows c++ classes design proxy functions required embed angelscript c++ applications easing two languages integration several differences angelscript c++ angelscript used video game development including amy dustforce gekkeiju online king arthur gold overgrowth puddle rigs rods sine mora star ruler supertuxkart warsow sven co-op jazz jackrabbit 2 plus urho3d angelscript used university ulm interactive 3d-animation program angelscript also used robotics example program behavioral rules robotic agents | [
1361,
6507,
3915,
5571,
236,
3772,
5510,
7848,
1803
] | Train |
5,044 | 2 | Nokia_N79:nokia n79 nokia n79 symbian os v9.3 smartphone member nokia nseries multimedia smartphone family running s60 3rd edition feature pack 2 officially announced nokia 26 august 2008 n79 advanced device 5 megapixel camera dual led flash gps many improvements nokia n78 retailed 350 euros upon release october 2008 n79 somewhat vibrant style compared usual nseries devices rotated nokia logo would later appear nokia n97 nokia advertised n79 bold-coloured xpress-on covers change software colour theme cover also slim nseries standards considered attractive features include 2.4-inch display 369 mhz arm11 processor physical keylock switch fm transmitter navi wheel 14 january 2009 nokia announced would ship sports edition dubbed n79 active included bluetooth heart rate monitor armband new version nokia sports tracker application photos music maps navigation video | [
1066,
5979,
2271,
6517,
372,
1724,
463,
7521,
3615,
1453,
4935,
3694,
3524,
3952,
472,
5909,
8072,
2922,
4407,
118,
23,
2564,
3703,
7261,
6440,
7545,
5493,
740,
1202,
5315,
3029,
5499,
7012,
139,
6465,
5062,
3039,
3653,
4894,
5068,
597,... | Test |
5,045 | 4 | Call_screening:call screening call screening process evaluating characteristics telephone call deciding whether answer methods may include addition us canada call screen name calling feature offered telephone companies allows customer establish list numbers anyone calling customer numbers receive automatic message indicating call accepted another name usually used marketing purposes selective call rejection also devices telezapper screening telephone calls | [
7813
] | Validation |
5,046 | 4 | Wardriving:wardriving wardriving act searching wi-fi wireless networks person usually moving vehicle using laptop smartphone software wardriving freely available internet warbiking warcycling similar wardriving done moving bicycle motorcycle practice sometimes facilitated mounting wi-fi enabled device vehicle warwalking warjogging similar wardriving done foot rather moving vehicle warrailing wartraining similar wardriving done trains tram buses means public transport wardroning accomplished drone war driving originated wardialing method popularized character played matthew broderick film wargames named film war dialing consists dialing every phone number specific sequence search modems warbiking warcycling similar wardriving done moving bicycle motorcycle practice sometimes facilitated mounting wi-fi enabled device vehicle warwalking warjogging similar wardriving done foot rather moving vehicle disadvantages method slower speed travel leading discovery infrequently discovered networks absence convenient computing environment consequently handheld devices pocket computers perform tasks users walking standing dominated practice technology advances developments early 2000s expanded extent practice advances include computers integrated wi-fi rather compactflash cf pc card pcmcia add-in cards computers dell axim compaq ipaq toshiba pocket computers starting 2002 recently active nintendo ds sony psp enthusiast communities gained wi-fi abilities devices many newer smartphones integrate wi-fi global positioning system gps warrailing wartraining similar wardriving done train tram rather slower controllable vehicle disadvantages method higher speed travel resulting less discovery infrequently discovered networks often limited major roads higher traffic warkitting combination wardriving rootkitting warkitting attack hacker replaces firmware attacked router allows control traffic victim could even permit disable tls replacing html content downloaded warkitting identified tsow jakobsson yang wardrivers use wifi-equipped device together gps device record location wireless networks results uploaded websites like wigle openbmap geomena data processed form maps network neighborhood also clients available smartphones running android upload data directly better range sensitivity antennas built bought vary omnidirectional highly directional maps known network ids used geolocation system—an alternative gps—by triangulating current position signal strengths known network ids examples include place lab intel skyhook navizon cyril houri seekerlocate seeker wireless openbmap geomena navizon openbmap combines information wi-fi cell phone tower maps contributed users wi-fi-equipped cell phones addition location finding provides navigation information allows tracking position friends geotagging december 2004 class 100 undergraduates worked map city seattle washington several weeks found 5,225 access points 44 secured wep encryption 52 open 3 pay-for-access noticed trends frequency security networks depending location many open networks clearly intended used general public network names like open share porn please free access nice information collected high-resolution maps published online previous efforts mapped cities dublin portray wardriving questionable practice typically association piggybacking though technical viewpoint everything working designed many access points broadcast identifying data accessible anyone suitable receiver could compared making map neighborhood house numbers mail box labels may claim wardriving illegal laws specifically prohibit allow wardriving though many localities laws forbidding unauthorized access computer networks protecting personal privacy google created privacy storm countries eventually admitted systematically surreptitiously gathering wifi data capturing video footage mapping data street view service since using android-based mobile devices gather data passive listen-only wardriving programs like kismet kismac communicate networks merely logging broadcast addresses likened listening radio station happens broadcasting area forms dxing types software netstumbler wardriver actively sends probe messages access point responds per design legality active wardriving less certain since wardriver temporarily becomes associated network even though data transferred access points using default box security settings intended provide wireless access request war driver liability may reduced setting computer static ip instead using dhcp preventing network granting computer ip address logging connection united states case usually referenced determining whether network accessed state v. allen case allen wardialing attempt get free long distance calling southwestern bell computer systems presented password protection screen however attempt bypass court ruled although contacted approached computer system constitute access company network also homebrew wardriving applications handheld game consoles support wi-fi sniff jazzbox/wardive nintendo ds/android road dog sony psp wifi-where iphone g-mon wardrive wigle wifi android wlanpollution symbian nokias60 devices also exists mode within sony psp wherein player able find new comrades searching wireless access points used wardrive treasure world ds commercial game gameplay wholly revolves around wardriving | [
6788,
558,
7808,
3792,
4699,
740,
37,
7836,
6823,
7207,
6220,
1124,
4451,
1708
] | Test |
5,047 | 5 | Transport_Sample_Protocol:transport sample protocol transport sample protocol tsp open source network protocol sampling data based tcp/ip allows synchronous asynchronous sample delivery implementations linux windows solaris osf1 vxworks c java released gnu lesser general public license lgpl tsp developed use satellite validation benches | [
2810,
7581,
6489,
753,
4759,
2026,
6211,
578,
7669,
1435
] | Validation |
5,048 | 2 | MNOS_(operating_system):mnos operating system mnos meaning mobilnaya operatsionnaya sistema мобильная операционная система мнос portable operating system unix-like operating system developed soviet union system derived version 6 unix consequently heavily modified incorporate many features bsd unix 1983 1986 enjoyed significant popularity ussr eastern bloc countries due light weight better performance version 7 unix later bsd unix-based alternatives development initiated ipk minavtoproma moscow 1981 development continued cooperation institutes including kurchatov institute mnos alternative demos version 1.x gradually merged 1986 1990 resulting joint os demos version 2.x mnos became first completely bilingual version unix used proprietary 8-bit cyrillic character set u-code later dropped favor koi-8 process merging demos origin version qualifier rl rabochaya loshadka working horsy | [
4751,
6076,
7794,
4478,
5462,
3690,
900,
2467,
2294,
7079,
5571,
2300,
2118,
6360,
578,
1288,
6367,
2864,
4447,
6577,
2887,
443
] | Test |
5,049 | 6 | TiVo_Media_File_System:tivo media file system mfs media file system proprietary file system used tivo hard drives fault tolerant real-time recording live tv although mfs still particularly well understood programmers unaffiliated tivo corporation enough known file system able reads limited writes applications exist manipulate file system objects within applications reverse engineered software found tivo many early tivo programs little specialized scripts manipulated data mfs file system organized like database including transaction logging rollback capabilities utilizes multiple partitions drive complete system partitions come pairs one application partition media partition media region invariably quite large organized long continuous blocks data variable block size minimum least 1 megabyte designed store large sections video object tivo file system assigned id internally called fsid presumably file system id least 4 types objects mfs supports streams recordings audio video directory database files stream objects stored mfs media regions types stored application regions file system implemented entirely linux userspace primary reason tivo devised system needed way store large continuous sections data easily manner lent well streaming data directly media decoders tivo devices without cpu dependent thus cpu little involvement playback recording functionality simply directing encoder/decoder chips stream data directly drives via direct memory access mapping sections virtual memory onto drive main cpu orchestrates entire affair result data stored mfs media region formatted normal files direct data stream indexed database sections mfs application region | [
3599,
2547,
7161,
4672,
3626,
6117,
6854,
5437,
4375,
6500,
6505,
5457,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
6558,
2683,
5859,
5865,
4444,
5518,
6231,
869,
2704,
1605,
174,
2710,
1624,
5900,
4480,
4855,
7718,
200,
12... | Test |
5,050 | 1 | Common_Database_on_Designated_Areas:common database designated areas common database designated areas cdda data bank officially designated protected areas nature reserves protected landscapes national parks etc europe data bank went live 1999 community project european environment agency eea council europe united nations environment programme world conservation monitoring centre unep-wcmc data bank divided national area international area national area member states eu eea european environment information observation network eionet data cleansing national area non-eea members international area carried unep-wcmc systems data bank follows system international union conservation nature natural resources iucn standards united nations order ensure compatibility similar data banks worldwide especially world database protected areas wdpa data bank accessed internet using website european nature information system eunis date true marine protected areas marine protected areas atlantic arc maia included data bank pursued | [] | Test |
5,051 | 4 | Penetration_test:penetration test penetration test colloquially known pen test pentest ethical hacking authorized simulated cyberattack computer system performed evaluate security system test performed identify weaknesses also referred vulnerabilities including potential unauthorized parties gain access system features data well strengths enabling full risk assessment completed process typically identifies target systems particular goal reviews available information undertakes various means attain goal penetration test target may white box provides background system information black box provides basic information except company name gray box penetration test combination two limited knowledge target shared auditor penetration test help determine whether system vulnerable attack defenses sufficient defenses test defeated security issues penetration test uncovers reported system owner penetration test reports may also assess potential impacts organization suggest countermeasures reduce risk national cyber security center describes penetration testing following method gaining assurance security system attempting breach system security using tools techniques adversary might goals penetration test vary depending type approved activity given engagement primary goal focused finding vulnerabilities could exploited nefarious actor informing client vulnerabilities along recommended mitigation strategies penetration tests component full security audit example payment card industry data security standard requires penetration testing regular schedule system changes flaw hypothesis methodology systems analysis penetration prediction technique list hypothesized flaws software system compiled analysis specifications documentation system list hypothesized flaws prioritized basis estimated probability flaw actually exists ease exploiting extent control compromise prioritized list used direct actual testing system mid 1960s growing popularity time-sharing computer systems made resources accessible communications lines created new security concerns scholars deborah russell g. t. gangemi sr. explain 1960s marked true beginning age computer security june 1965 example several country leading computer security experts held one first major conferences system security—hosted government contractor system development corporation sdc conference someone noted one sdc employee able easily undermine various system safeguards added sdc an/fsq-32 time-sharing computer system hopes system security study would useful attendees requested ... studies conducted areas breaking security protection time-shared system words conference participants initiated one first formal requests use computer penetration tool studying system security spring 1967 joint computer conference many leading computer specialists met discuss system security concerns conference computer security experts willis ware harold petersen rein tern rand corporation bernard peters national security agency nsa used phrase penetration describe attack computer system paper ware referred military remotely accessible time-sharing systems warning deliberate attempts penetrate computer systems must anticipated colleagues petersen turn shared concerns observing online communication systems ... vulnerable threats privacy including deliberate penetration bernard peters nsa made point insisting computer input output ... could provide large amounts information penetrating program conference computer penetration would become formally identified major threat online computer systems threat computer penetration posed next outlined major report organized united states department defense dod late 1967 essentially dod officials turned willis ware lead task force experts nsa cia dod academia industry formally assess security time-sharing computer systems relying many papers presented spring 1967 joint computer conference task force largely confirmed threat system security computer penetration posed ware report initially classified many country leading computer experts quickly identified study definitive document computer security jeffrey r. yost charles babbage institute recently described ware report ... far important thorough study technical operational issues regarding secure computing systems time period effect ware report reaffirmed major threat posed computer penetration new online time-sharing computer systems better understand system weaknesses federal government contractors soon began organizing teams penetrators known tiger teams use computer penetration test system security deborah russell g. t. gangemi sr. stated 1970s ... 'tiger teams first emerged computer scene tiger teams government industry-sponsored teams crackers attempted break defenses computer systems effort uncover eventually patch security holes leading scholar history computer security donald mackenzie similarly points rand done penetration studies experiments circumventing computer security controls early time-sharing systems behalf government jeffrey r. yost charles babbage institute work history computer security also acknowledges rand corporation sdc engaged first so-called 'penetration studies try infiltrate time-sharing systems order test vulnerability virtually early studies tiger teams successfully broke targeted computer systems country time-sharing systems poor defenses early tiger team actions efforts rand corporation demonstrated usefulness penetration tool assessing system security time one rand analyst noted tests ... demonstrated practicality system-penetration tool evaluating effectiveness adequacy implemented data security safeguards addition number rand analysts insisted penetration test exercises offered several benefits justified continued use noted one paper penetrator seems develop diabolical frame mind search operating system weaknesses incompleteness difficult emulate reasons others many analysts rand recommended continued study penetration techniques usefulness assessing system security perhaps leading computer penetration expert formative years james p. anderson worked nsa rand government agencies study system security early 1971 u.s. air force contracted anderson private company study security time-sharing system pentagon study anderson outlined number major factors involved computer penetration anderson described general attack sequence steps time anderson description general computer penetration steps helped guide many security experts relied technique assess time-sharing computer system security following years computer penetration tool security assessment became refined sophisticated early 1980s journalist william broad briefly summarized ongoing efforts tiger teams assess system security broad reported dod-sponsored report willis ware ... showed spies could actively penetrate computers steal copy electronic files subvert devices normally guard top-secret information study touched decade quiet activity elite groups computer scientists working government tried break sensitive computers succeeded every attempt various studies may suggested computer security u.s. remained major problem scholar edward hunt recently made broader point extensive study computer penetration security tool hunt suggests recent paper history penetration testing defense establishment ultimately ... created many tools used modern day cyberwarfare carefully defined researched many ways computer penetrators could hack targeted systems wide variety security assessment tools available assist penetration testing including free-of-charge free software commercial software several operating system distributions geared towards penetration testing distributions typically contain pre-packaged pre-configured set tools penetration tester hunt individual tool might increase risk complications—such compile errors dependency issues configuration errors also acquiring additional tools may practical tester context notable penetration testing os examples include many specialized operating systems facilitate penetration testing—each less dedicated specific field penetration testing number linux distributions include known os application vulnerabilities deployed targets practice systems help new security professionals try latest security tools lab environment examples include damn vulnerable linux dvl owasp web testing environment wtw metasploitable process penetration testing may simplified five phases attacker exploited one vulnerability may gain access machines process repeats i.e look new vulnerabilities attempt exploit process referred pivoting legal operations let tester execute illegal operation include unescaped sql commands unchanged hashed passwords source-visible projects human relationships old hashing cryptographic functions single flaw may enough enable critically serious exploit leveraging multiple known flaws shaping payload way appears valid operation almost always required metasploit provides ruby library common tasks maintains database known exploits budget time constraints fuzzing common technique discovers vulnerabilities aims get unhandled error random input tester uses random input access less often used code paths well-trodden code paths usually free errors errors useful either expose information http server crashes full info trace-backs—or directly usable buffer overflows imagine website 100 text input boxes vulnerable sql injections certain strings submitting random strings boxes hopefully hits bugged code path error shows broken html page half rendered sql error case text boxes treated input streams however software systems many possible input streams cookie session data uploaded file stream rpc channels memory errors happen input streams test goal first get unhandled error understand flaw based failed test case testers write automated tool test understanding flaw correct may become obvious package payload target system triggers execution viable one hope another error produced fuzzer yields fruit use fuzzer saves time checking adequate code paths exploits unlikely illegal operation payload metasploit terminology include functions logging keystrokes taking screenshots installing adware stealing credentials creating backdoors using shellcode altering data companies maintain large databases known exploits provide products automatically test target systems vulnerabilities general services administration gsa standardized penetration test service pre-vetted support service rapidly address potential vulnerabilities stop adversaries impact us federal state local governments services commonly referred highly adaptive cybersecurity services hacs listed us gsa advantage website effort identified key service providers technically reviewed vetted provide advanced penetration services gsa service intended improve rapid ordering deployment services reduce us government contract duplication protect support us infrastructure timely efficient manner 132-45a penetration testing security testing service assessors mimic real-world attacks identify methods circumventing security features application system network hacs penetration testing services typically strategically test effectiveness organization preventive detective security measures employed protect assets data part service certified ethical hackers typically conduct simulated attack system systems applications another target environment searching security weaknesses testing typically document vulnerabilities outline defenses effective defeated exploited also typically provide recommended remediation plans address weaknesses discovered uk penetration testing services standardized via professional bodies working collaboration national cyber security centre | [
3932,
4663,
3088,
1174,
4138,
5381,
7075,
2747,
2478,
8091,
1942,
5577,
578,
5664,
6022,
7836,
1708,
4521,
7845,
848,
3480,
7111,
1584,
6756,
6301,
3486,
6761,
2513,
429,
2347,
1893,
5613,
1332,
1805
] | Test |
5,052 | 4 | Validation_authority:validation authority public key infrastructure validation authority va entity provides service used verify validity digital certificate per mechanisms described x.509 standard page 69 dominant method used purpose host certificate revocation list download via http ldap protocols reduce amount network traffic required certificate validation ocsp protocol may used instead validation authority capable responding network-based request crl lacks ability issue revoke certificates must continuously updated current crl information certificate authority issued certificates contained within crl potentially labor-intensive process use dedicated validation authority allows dynamic validation certificates issued offline root certificate authority root ca unavailable network traffic certificates issued always verified via validation authority protocols mentioned ongoing administrative overhead maintaining crls hosted validation authority typically minimal uncommon root cas issue revoke large numbers certificates | [
363,
887,
7567,
6795,
3094,
3383
] | Test |
5,053 | 7 | Freifunk:freifunk freifunk german free radio non-commercial open grassroots initiative support free computer networks german region freifunk part international movement wireless community network initiative counts 400 local communities 41,000 access points among münster aachen munich stuttgart paderborn biggest communities 1000 access points main goals freifunk build large scale free wireless wi-fi network decentralized owned run support local communication initiative based picopeering agreement agreement participants agree upon network free discrimination sense net neutrality similar grassroots initiatives austria switzerland funkfeuer openwireless like many free community-driven networks freifunk uses mesh technology bring ad hoc networks interconnecting multiple wireless lans wi-fi mobile ad hoc network routers connect using special routing software router fails software automatically calculates new route destination software freifunk firmware based openwrt free software several different implementations firmware depending hardware protocols local communities use first wi-fi ad hoc network done georgia usa 1999 demonstrated toh.it six-node implementation running associativity-based routing protocol linux kernel wavelan wifi abr patented protocol following experience freifunk work standard ietf protocols two common standard proposals olsr b.a.t.m.a.n development b.a.t.m.a.n driven freifunk activists volunteering basis one results berlon workshop october 2002 free wireless community networks berlin london picopeering agreement agreement rationales free networks describes transmission people data handled free network become core agreement community workshop participants also agreed upon regular meetings berlin build free wifi network ever since weekly meetings c-base hackerspace every wednesday time german language site freifunk.net started september 2003 freifunk activists founded non-profit association förderverein freie netzwerke e.v support free communication infrastructures following years initiative became quite successful germany also became easier install freifunk firmware off-the-shelf wireless routers yearly wireless community weekend taking place berlin c-base 2012 berlin freifunk community got lot media attention project called freifunk freedom fighter box project fights secondary liability secondary liability legal situation makes owners open non-encrypted wireless access points liable users internet connection outlined störerhaftung law owners thus forced pay copyright infringements third persons opened network public legal practice led fear uncertainty made many people close access points e.g cafés public locations freifunk freedom fighter box preconfigured access point sent data public network sweden vpn connection sweden countries secondary liability 2013 hamburg freifunk community set network 300 nodes using vpn tunnels netherlands many new freifunk communities emerged berlin community building backbone network based microwave transmission longer distances project funded local broadcasting corporation medienanstalt berlin-brandenburg still on-going germany | [
2132,
4177,
2004,
6335
] | Test |
5,054 | 1 | Apache_Kylin:apache kylin apache kylin open source distributed analytics engine designed provide sql interface multi-dimensional analysis olap hadoop alluxio supporting extremely large datasets originally developed ebay project apache software foundation kylin project started 2013 ebay r shanghai china oct 2014 kylin v0.6 open sourced github.com name kylinolap nov 2014 kylin joined apache software foundation incubator december 2015 apache kylin graduated top level project kyligence inc chinese company provides commercial support apache kylin consists primarily original developers open source code apache kylin built top apache hadoop apache hive apache hbase apache calcite apache spark technologies technologies powerful matured making kylin able support massive data load easily scale kylin following core components apache kylin adopted many companies olap platform production typical users includes ebay meituan xiaomi netease beike yahoo japan apache kylin roadmap kylin website | [
7238,
894,
4303,
5728,
7805,
2741,
7444,
7896,
917,
3463,
3542,
3204,
1286,
6821,
840,
1392,
3031,
5408,
3558,
5677,
3479,
5863,
6387,
5075,
6137,
7488,
7857,
5874,
1511,
4742,
5007,
1333,
702
] | Test |
5,055 | 3 | MIPS_architecture:mips architecture mips microprocessor without interlocked pipelined stages reduced instruction set computer risc instruction set architecture isa developed mips computer systems mips technologies based united states multiple versions mips including mips ii iii iv v well five releases mips32/64 32- 64-bit implementations respectively early mips architectures 32-bit 64-bit versions developed later april 2017 current version mips mips32/64 release 6 mips32/64 primarily differs mips i–v defining privileged kernel mode system control coprocessor addition user mode architecture computer architecture courses universities technical schools often study mips architecture architecture greatly influenced later risc architectures alpha april 2017 mips processors used embedded systems residential gateways routers originally mips designed general-purpose computing 1980s 1990s mips processors personal workstation server computers used many companies digital equipment corporation mips computer systems nec pyramid technology sicortex siemens nixdorf silicon graphics tandem computers historically video game consoles nintendo 64 sony playstation playstation 2 playstation portable used mips processors mips processors also used popular supercomputers 1990s systems dropped top500 list uses complemented embedded applications first 1990s mips became major presence embedded processor market 2000s mips processors applications mid- late-1990s estimated one three risc microprocessors produced mips processor mips modular architecture supporting four coprocessors cp0/1/2/3 mips terminology cp0 system control coprocessor essential part processor implementation-defined mips i–v cp1 optional floating-point unit fpu cp2/3 optional implementation-defined coprocessors mips iii removed cp3 reused opcodes purposes example playstation video game console cp2 geometry transformation engine gte accelerates processing geometry 3d computer graphics mips architecture several optional extensions mips-3d simple set floating-point simd instructions dedicated common 3d tasks mdmx madmax extensive integer simd instruction set using 64-bit floating-point registers mips16e adds compression instruction stream make programs take less room mips mt adds multithreading capability december 2018 wave computing new owner mips architecture see mips technologies announced mips isa open-sourced program dubbed mips open initiative program planned 2019 intended open access recent versions 32-bit 64-bit designs making available without licensing royalty fees well granting participants licenses existing mips patents first version mips architecture designed mips computer systems r2000 microprocessor first mips implementation mips r2000 introduced together 1985 mips ii introduced mips renamed mips distinguish new version mips load/store architecture also known register-register architecture except load/store instructions used access memory instructions operate registers mips thirty-two 32-bit general-purpose registers gpr register 0 hardwired zero writes discarded register 31 link register integer multiplication division instructions run asynchronously instructions pair 32-bit registers hi lo provided small set instructions copying data general-purpose registers hi/lo registers program counter 32 bits two low-order bits always contain zero since mips instructions 32 bits long aligned natural word boundaries instructions divided three types r j every instruction starts 6-bit opcode addition opcode r-type instructions specify three registers shift amount field function field i-type instructions specify two registers 16-bit immediate value j-type instructions follow opcode 26-bit jump target following three formats used core instruction set mips instructions load store 8-bit bytes 16-bit halfwords 32-bit words one addressing mode supported base displacement since mips 32-bit architecture loading quantities fewer 32 bits requires datum either signed- zero-extended 32 bits load instructions suffixed unsigned perform zero extension otherwise sign extension performed load instructions source base contents gpr rs write result another gpr rt store instructions source base contents gpr rs store data another gpr rt load store instructions compute memory address summing base sign-extended 16-bit immediate mips requires memory accesses aligned natural word boundaries otherwise exception signaled support efficient unaligned memory accesses load/store word instructions suffixed left right load instructions followed load delay slot instruction load delay slot use data loaded load instruction load delay slot filled instruction dependent load nop substituted instruction found mips instructions perform addition subtraction instructions source operands two gprs rs rt write result third gpr rd alternatively addition source one operands 16-bit immediate sign-extended 32 bits instructions addition subtraction two variants default exception signaled result overflows instructions unsigned suffix signal exception overflow check interprets result 32-bit two complement integer mips instructions perform bitwise logical xor instructions source operands two gprs write result third gpr xor instructions alternatively source one operands 16-bit immediate zero-extended 32 bits set relation instructions write one zero destination register specified relation true false instructions source operands two gprs one gpr 16-bit immediate sign-extended 32 bits write result third gpr default operands interpreted signed integers variants instructions suffixed unsigned interpret operands unsigned integers even source operand sign-extended 16-bit immediate load immediate upper instruction copies 16-bit immediate high-order 16 bits gpr used conjunction immediate instruction load 32-bit immediate register mips instructions perform left right logical shifts right arithmetic shifts operand obtained gpr rt result written another gpr rd shift distance obtained either gpr rs 5-bit shift amount sa field mips instructions signed unsigned integer multiplication division instructions source operands two gprs write results pair 32-bit registers called hi lo since may execute separately concurrently cpu instructions multiplication high- low-order halves 64-bit product written hi lo respectively division quotient written lo remainder hi access results pair instructions move hi move lo provided copy contents hi lo gpr instructions interlocked reads hi lo proceed past unfinished arithmetic instruction write hi lo another pair instructions move hi move lo copies contents gpr hi lo instructions used restore hi lo original state exception handling instructions read hi lo must separated two instructions write hi lo mips control flow instructions followed branch delay slot unless branch delay slot filled instruction performing useful work nop substituted mips branch instructions compare contents gpr rs zero another gpr rt signed integers branch specified condition true control transferred address computed shifting 16-bit offset left two bits sign-extending 18-bit result adding 32-bit sign-extended result sum program counter instruction address 8 jumps two versions absolute register-indirect absolute jumps jump jump link compute address control transferred shifting 26-bit instr_index left two bits concatenating 28-bit result four high-order bits address instruction branch delay slot register-indirect jumps transfer control instruction address sourced gpr rs address sourced gpr must word-aligned else exception signaled instruction branch delay slot executed branch jump instructions link except jump link register save return address gpr 31 jump link register instruction permits return address saved writable gpr mips two instructions software signal exception system call breakpoint system call used user mode software make kernel calls breakpoint used transfer control debugger via kernel exception handler instructions 20-bit code field contain operating environment-specific information exception handler mips 32 floating-point registers two registers paired double precision numbers odd numbered registers used arithmetic branching part double precision register pair resulting 16 usable registers instructions moves/copies loads/stores affected single precision denoted .s suffix double precision denoted .d suffix mips ii removed load delay slot added several sets instructions shared-memory multiprocessing synchronize shared memory load linked word store conditional word instructions added set trap-on-condition instructions added instructions caused exception evaluated condition true existing branch instructions given branch-likely versions executed instruction branch delay slot branch taken instructions improve performance certain cases allowing useful instructions fill branch delay slot doubleword load store instructions cop1–3 added consistent memory access instructions loads stores required doubleword naturally aligned instruction set floating point coprocessor also several instructions added ieee 754-compliant floating-point square root instruction added supported single- double-precision operands set instructions converted single- double-precision floating-point numbers 32-bit words added complemented existing conversion instructions allowing ieee rounding mode specified instruction instead floating point control status register mips computer systems r6000 microprocessor 1989 first mips ii implementation designed servers r6000 fabricated sold bipolar integrated technology commercial failure mid-1990s many new 32-bit mips processors embedded systems mips ii implementations introduction 64-bit mips iii architecture 1991 left mips ii newest 32-bit mips architecture mips32 introduced 1999.a mips iii backwards-compatible extension mips ii added support 64-bit memory addressing integer operations 64-bit data type called doubleword mips iii extended general-purpose registers hi/lo registers program counter 64 bits support new instructions added load store doublewords perform integer addition subtraction multiplication division shift operations move doubleword gprs hi/lo registers existing instructions originally defined operate 32-bit words redefined necessary sign-extend 32-bit results permit words doublewords treated identically instructions among instructions redefined load word mips iii sign-extends words 64 bits complement load word version zero-extends added r instruction format inability specify full shift distance 64-bit shifts 5-bit shift amount field narrow specify shift distance doublewords required mips iii provide three 64-bit versions mips shift instruction first version 64-bit version original shift instructions used specify constant shift distances 0–31 bits second version similar first adds 32 shift amount field value constant shift distances 32–64 bits specified third version obtains shift distance six low-order bits gpr mips iii added supervisor privilege level existing kernel user privilege levels feature affected implementation-defined system control processor coprocessor 0 mips iii removed coprocessor 3 cp3 support instructions reused opcodes new doubleword instructions remaining coprocessors gained instructions move doublewords coprocessor registers gprs floating general registers fgrs extended 64 bits requirement instructions use even-numbered register removed incompatible earlier versions architecture bit floating-point control/status register used operate mips iii floating-point unit fpu mips i- ii-compatible mode floating-point control registers extended compatibility new floating-point instructions added copy doublewords cpu fpu convert single- double-precision floating-point numbers doubleword integers vice versa mips computer systems r4000 microprocessor 1991 first mips iii implementation designed use personal workstation server computers mips computer systems aggressively promoted mips architecture r4000 establishing advanced computing environment ace consortium advance advanced risc computing arc standard aimed establish mips dominant personal computing platform arc found little success personal computers r4000 r4400 derivative widely used workstation server computers especially largest user silicon graphics uses r4000 included high-end embedded systems supercomputers mips iii eventually implemented number embedded microprocessors quantum effect design r4600 1993 derivatives widely used high-end embedded systems low-end workstations servers mips technologies r4200 1994 designed embedded systems laptop personal computers derivative r4300i fabricated nec electronics used nintendo 64 game console nintendo 64 along playstation among highest volume users mips architecture processors mid-1990s mips iv fourth version architecture superset mips iii compatible existing versions mips mips iv designed mainly improve floating-point fp performance improve access operands indexed addressing mode base index sourced gprs fp loads stores added prefetch instructions performing memory prefetching specifying cache hints supported base offset base index addressing modes mips iv added several features improve instruction-level parallelism alleviate bottleneck caused single condition bit seven condition code bits added floating-point control status register bringing total eight fp comparison branch instructions redefined could specify condition bit written read respectively delay slot fp branch read condition bit written prior fp comparison removed support partial predication added form conditional move instructions gprs fprs implementation could choose precise imprecise exceptions ieee 754 traps mips iv added several new fp arithmetic instructions single- double-precision fpns fused-multiply add subtract reciprocal reciprocal square-root fp fused-multiply add subtract instructions perform either one two roundings implementation-defined exceed meet ieee 754 accuracy requirements respectively fp reciprocal reciprocal square-root instructions comply ieee 754 accuracy requirements produce results differ required accuracy one two units last place implementation defined instructions serve applications instruction latency important accuracy first mips iv implementation mips technologies r8000 microprocessor chipset 1994 design r8000 began silicon graphics inc. used high-end workstations servers scientific technical applications high performance large floating-point workloads important later implementations mips technologies r10000 1996 quantum effect devices r5000 1996 rm7000 1998 r10000 fabricated sold nec electronics toshiba derivatives used nec pyramid technology silicon graphics inc. tandem computers among others workstations servers supercomputers r5000 r7000 found use high-end embedded systems personal computers low-end workstations servers derivative r5000 toshiba r5900 used sony computer entertainment emotion engine powered playstation 2 game console announced october 21 1996 microprocessor forum 1996 alongside mips digital media extensions mdmx extension mips v designed improve performance 3d graphics transformations mid-1990s major use non-embedded mips microprocessors graphics workstations sgi mips v completed integer-only mdmx extension provide complete system improving performance 3d graphics applications mips v implementations never introduced may 12 1997 sgi announced h1 beast h2 capitan microprocessors former first mips v implementation due introduced first half 1999 h1 h2 projects later combined eventually canceled 1998 mips v implementations mips64 release 1 1999 based mips v retains features optional coprocessor 1 fpu feature called paired-single mips v added new data type paired single ps consisted two single-precision 32-bit floating-point numbers stored existing 64-bit floating-point registers variants existing floating-point instructions arithmetic compare conditional move added operate data type simd fashion new instructions added loading rearranging converting ps data first instruction set exploit floating-point simd existing resources mips technologies spun-out silicon graphics 1998 refocused embedded market mips v successive version strict superset previous version property found problem architecture definition changed define 32-bit 64-bit architecture mips32 mips64 introduced 1999 mips32 based mips ii additional features mips iii mips iv mips v mips64 based mips v. nec toshiba sibyte later acquired broadcom obtained licenses mips64 soon announced philips lsi logic idt raza microelectronics inc. cavium loongson technology ingenic semiconductor since joined first release mips32 based mips ii added conditional moves prefetch instructions features r4000 r5000 families 64-bit processors first release mips64 adds mips32 mode run 32-bit code mul madd multiply-add instructions previously available implementations added mips32 mips64 specifications cache control instructions announced december 6 2012 release 4 skipped number four perceived unlucky many asian cultures mips32/mips64 release 6 2014 added following removed infrequently used instructions reorganized instruction encoding freeing space future expansions micromips32/64 architectures supersets mips32 mips64 architectures respectively designed replace mips16e ase disadvantage mips16e requires mode switch 16-bit instructions processed micromips adds versions most-frequently used 32-bit instructions encoded 16-bit instructions allows programs intermix 16- 32-bit instructions without switch modes micromips introduced alongside mips32/64 release 3 subsequent release mips32/64 corresponding micromips32/64 version processor may implement micromips32/64 micromips32/64 corresponding mips32/64 subset starting mips32/64 release 6 support mips16e ended micromips form code compression mips base mips32 mips64 architectures supplemented number optional architectural extensions collectively referred application-specific extensions ases ases provide features improve efficiency performance certain workloads digital signal processing enhancements microcontroller applications mcu ase application-specific extension developed extend interrupt controller support reduce interrupt latency enhance i/o peripheral control function typically required microcontroller system designs mips16 application-specific extension mips v designed lsi logic mips technologies announced october 21 1996 alongside first implementation lsi logic tinyrisc processor mips16 subsequently licensed nec electronics philips semiconductors toshiba among others implemented extension mips ii iii architectures mips16 decreases size application 40 using 16-bit instructions instead 32-bit instructions also improves power efficiency instruction cache hit rate equivalent performance base architecture supported hardware software development tools mips technologies providers mips16e improved version mips16 first supported mips32 mips64 release 1 mips16e2 improved version mips16 supported mips32 mips64 release 5 release 6 replaced micromips dsp ase optional extension mips32/mips64 release 2 newer instruction sets used accelerate large range media computations—particularly audio video dsp module comprises set instructions state integer pipeline requires minimal additional logic implement mips processor cores revision 2 ase introduced second half 2006 revision adds extra instructions original ase otherwise backwards-compatible unlike bulk mips architecture fairly irregular set operations many chosen particular relevance key algorithm main novel features vs original mips32 make use mips dsp ase may linux 2.6.12-rc5 starting 2005-05-31 adds support dsp ase note actually make use dsp ase toolchain support required gcc already support dsp dspr2 instruction set extensions designed accelerate multimedia hardware supported virtualization technology multi-threaded mips core support two vpes virtual processing elements share single pipeline well hardware resources however since vpe includes complete copy processor state seen software system vpe appears complete standalone processor smp linux operating system fine-grained thread processing applications vpe capable supporting nine tcs allocated across two vpes tcs share common execution unit program counter core register files handle thread software mips mt architecture also allows allocation processor cycles threads sets relative thread priorities optional quality service qos manager block enables two prioritization mechanisms determine flow information across bus first mechanism allows user prioritize one thread another second mechanism used allocate specified ratio cycles specific threads time combined use mechanisms allows effective allocation bandwidth set threads better control latencies real-time systems system-level determinism critical qos block facilitates improvement predictability system hardware designers advanced systems may replace standard qos block provided mips technologies one specifically tuned application single-threaded microprocessors today waste many cycles waiting access memory considerably limiting system performance use multi-threading masks effect memory latency increasing processor utilization one thread stalls additional threads instantly fed pipeline executed resulting significant gain application throughput users allocate dedicated processing bandwidth real-time tasks resulting guaranteed quality service qos mips ’ mt technology constantly monitors progress threads dynamically takes corrective actions meet exceed real-time requirements processor pipeline achieve 80-90 utilization switching threads data-dependent stalls cache misses leads improved mobile device user experience responsiveness greatly increased smartmips application-specific extension ase designed gemplus international mips technologies improve performance reduce memory consumption smart card software supported mips32 since smart cards require capabilities mips64 processors smart cards use smartmips open virtual platforms ovp includes freely available non-commercial use simulator ovpsim library models processors peripherals platforms apis enable users develop models models library open source written c include mips 4k 24k 34k 74k 1004k 1074k m14k microaptiv interaptiv proaptiv 32-bit cores mips 64-bit 5k range cores models created maintained imperas partnership mips technologies tested assigned mips-verified tm mark sample mips-based platforms include bare metal environments platforms booting unmodified linux binary images platforms–emulators available source binaries fast free non-commercial usage easy use ovpsim developed maintained imperas fast hundreds million instructions per second built handle multicore homogeneous heterogeneous architectures systems freely available mips32 simulator earlier versions simulated r2000/r3000 called spim use education edumips64 gpl graphical cross-platform mips64 cpu simulator written java/swing supports wide subset mips64 isa allows user graphically see happens pipeline assembly program run cpu mars another gui-based mips emulator designed use education specifically use hennessy computer organization design webmips browser-based mips simulator visual representation generic pipelined processor simulator quite useful register tracking step step execution advanced free emulators available gxemul formerly known mips64emul project qemu projects emulate various mips iii iv microprocessors addition entire computer systems use commercial simulators available especially embedded use mips processors example wind river simics mips 4kc 5kc pmc rm9000 qed rm7000 broadcom/netlogic ec4400 cavium octeon imperas mips32 mips64 cores vast systems r3000 r4000 coware mips4ke mips24k mips25kf mips34k wepsim browser-based simulator subset mips instructions micro-programmed simulator useful order learn cpu works microprogramming mips routines traps interruptions system calls etc | [
2903,
1447,
1452,
5737,
1465,
5740,
2929,
1478,
4336,
1481,
4362,
4363,
4365,
4368,
4370,
4372,
5794,
5799,
1522,
5804,
2989,
5822,
4408,
3014,
1556,
1568,
1570,
5849,
154,
156,
5883,
7314,
5893,
4479,
5911,
5917,
3098,
1640,
1644,
7364,
... | Test |
5,056 | 9 | MOO_(programming_language):moo programming language moo programming language relatively simple programming language used support moo server dynamically typed uses prototype-based object-oriented system syntax roughly derived ada school programming languages stephen white authored first moo server language 1990 using c. course year pavel curtis joined project releasing first version lambdamoo server lambdamoo run maintained entirely volunteer basis sourceforge project although last packaged release 2000 development still active project cvs white describes moo mishmash c-like operators ada-like control structures combined prototype-style single-inheritance language explicit exception handling control flow well traditional looping constructs verb property hierarchy provides default values prototype objects over-riding values lower hierarchy hierarchy objects maintained delegation object parent property resulting form single inheritance special security-related attributes objects verbs properties include ownership read write execute flags moo programs byte-code compiled implicit decompilation editing providing canonical form programs moo programs orthogonally persistent periodic checkpoints objects identified unique integer identifier unused program data eliminated automatic garbage collection implemented reference counting however moo objects garbage collected manually deleted owners superusers aka wizards process called 'recycling moo explicitly multi-user system programs verbs contributed number connected users distinction made 'driver runtime 'core programs written moo language vast majority functionality running moo handled 'in-core runtime supports multi-tasking using retribution based time slicing method verbs run exclusive access database explicit locking necessary maintain synchronization simple tcp/ip messaging telnet compatible used communicate client sockets identified 'player virtual reality representation system language supports weak references objects number properties verbs strings built-in functions retrieve lists properties verbs exist giving language runtime facilities reflection server also contains support wildcard verb matching code easily used handle multiple commands similar names functions available sequence types moo lists strings support random access well head tail operations similar available lisp operations lists strings non-destructive non-object datatypes immutable built-in functions libraries allow lists also used associative arrays ordered unordered sets moo basic set control structures for-in-list fancy feature classic hello world program written moo interesting example | [
1616,
6507,
7032,
4995,
8137,
4906,
304,
6882,
1435
] | Test |
5,057 | 8 | Scieno_Sitter:scieno sitter scieno sitter content-control software installed computer blocks certain websites critical scientology viewed software released church scientology 1998 church members using windows 95 term scieno sitter coined critics scientology assert program form internet censorship program started late summer 1998 scientologists mailed software cds told program would help members build web sites would link scientology main site however recipients program told also censorship program blocked critical sites viewed user computer sites deemed dangerous critics scientology referred program cult mind-control 21st century asserted stifles freedom speech one software developer stated though thought spam filters general good idea found disturbing huge number terms banned completely unrelated stated goals however vice president office special affairs branch scientology stated scientologists make personal choice whether use filtering software different spokesperson claimed members scientology asked software stating many parishioners want use internet asked filter protection elements sought twist pervert religion packaging cd mailed users specifically request filter states popular demand scientologists program developed prevent subjected 'entheta hate mail internet filter allows direct access sites rapidly without dev-t 'd vilifying material forgeries hate messages fashion attention remain focused dissemination setting people feet bridge total freedom order gain access software scientologists must first sign contract section 7 contract states members must agree use specific internet filter program csi provided allows freedom view sites dianetics scientology principals without threat accessing sites deemed using marks works unauthorized fashion deemed improper discreditable scientology religion program works preventing user accessing sites certain keywords scientology identified objectionable material viewing members use keywords functions way prevent members learning guarded scientology doctrine xenu ot iii material relating space opera scientology scripture keywords notable topics blocked program include names several notable critics scientology including robert vaughn young keith henson well several hundred frequent participants alt.religion.scientology newsgroup together terms like suppressive person lisa mcpherson screening process limited viewing web sites however also blocks users discussing forbidden keywords chat programs internet relay chat keywords mentioned certain individuals identified undesirable enter chat room user kicked discussion tory christman worked operative osa osa operatives removed program computer allow analyze critical material spread internet scientology time software removed christman encountered operation clambake web site online discussions operator andreas heldal-lund eventually led leaving scientology public announcement alt.religion.scientology december 1998 software discussed e network program investigative reports program showed web page operation clambake described software piece entitled church scientology—afraid real world censors net members bob minton quoted report stating scientologists given filtering software allow go internet want scientologists subjected critical information 2006 film bridge scientologist character diane wheat attempts find information internet google search word zeenu directed search word xenu operation clambake web site comes first search results wheat attempts view site message appears computer stating page requested identified containing racist/hate-oriented material scientology symbol displayed left-hand side warning box | [] | Test |
5,058 | 5 | MAC-Forced_Forwarding:mac-forced forwarding mac-forced forwarding macff used control unwanted broadcast traffic host-to-host communication achieved directing network traffic hosts located subnet different locations upstream gateway device provides security layer 2 since traffic able pass directly hosts macff suitable ethernet networks layer 2 bridging device known ethernet access node ean connects access routers clients macff configured eans macff described rfc 4562 mac-forced forwarding method subscriber separation ethernet access network allied telesis switches implement macff using dhcp snooping maintain database hosts appear switch port host tries access network switch port dhcp snooping checks host ’ ip address database ensure host valid macff uses dhcp snooping check whether host gateway access router macff uses form proxy arp reply arp requests giving router mac address forces host send traffic router even traffic destined host subnet source router receives traffic makes forwarding decisions based set forwarding rules typically qos policy set filters | [
5181,
3828,
44
] | Test |
5,059 | 3 | Configuration_Menu_Language:configuration menu language configuration menu language cml used linux kernel versions prior 2.5.45 configure values determine composition exact functionality kernel many possible variations kernel functionality exist customization possible instance specifications exact hardware run also tuned administrator preferences cml written raymond chen 1993 question-and-answer interface allowed systematic selection particular behaviors without editing multiple system files eric s. raymond wrote menu-driven module named cml2 replace officially rejected linus torvalds attributed rejection 2007 lkml.org post preference small incremental changes concern maintainer involved rewrite ca n't ... go thing expect merged said noting raymond left splash rejection linuxkernelconf replaced cml kernel version 2.5.45 remains use 4.0 kernel | [
4435,
1991,
578
] | Test |
5,060 | 3 | HP_95LX:hp 95lx hp 95lx palmtop pc f1000a f1010a also known project jaguar hewlett packard first ms-dos-based pocket computer personal digital assistant introduced april 1991 collaboration lotus development corporation seen successor series larger portable pcs like hp 110 hp 110 plus hp 95lx nec v20 cpu intel 8088 clone running 5.37 mhz intel corporation system chip soc device considered completely pc-compatible quarter-cga mda resolution lcd screen ran microsoft ms-dos version 3.22 customized version lotus 1-2-3 release 2.2 built software read-only memory rom included calculator appointment calendar telecommunications program simple text editor also included cr 2032 lithium coin cell memory backup two aa main batteries run mass storage hp 95lx single pcmcia slot could hold static ram card cr 2025 back-up coin cell rs-232-compatible serial port provided well infrared port printing compatible models hewlett packard printers character mode display showed 16 lines 40 characters backlight ibm compatible pcs work hardware code page 437 hp 95lx text mode font hard-wired code page 850 instead lotus 1-2-3 internally used lotus international character set lics characters translated code page 850 display printing purposes successor models hp 95lx include hp 100lx hp palmtop fx hp 200lx hp 1000cx hp omnigo 700lx | [
1522,
3764,
2278,
7520,
900,
1150,
5735,
5571,
6380,
1670,
1581,
7759,
1134,
4736,
1237,
4018
] | Test |
5,061 | 9 | Three-address_code:three-address code computer science three-address code often abbreviated tac 3ac intermediate code used optimizing compilers aid implementation code-improving transformations tac instruction three operands typically combination assignment binary operator example codice_1 name derives use three operands statements even though instructions fewer operands may occur since three-address code used intermediate language within compilers operands likely concrete memory addresses processor registers rather symbolic addresses translated actual addresses register allocation also uncommon operand names numbered sequentially since three-address code typically generated compiler refinement three-address code a-normal form anf three-address code would broken several separate instructions instructions translate easily assembly language also easier detect common sub-expressions shortening code following example one calculation composed several smaller ones three-address code may conditional unconditional jumps methods accessing memory may also methods calling functions may reduce jumps way three-address code may useful control-flow analysis following c-like example loop stores squares numbers 0 9 | [
7474,
1854,
336
] | Train |
5,062 | 2 | S60_(software_platform):s60 software platform s60 platform formerly series 60 user interface software platform smartphones runs top symbian operating system created nokia based 'pearl user interface symbian ltd introduced comdex november 2001 first shipped nokia 7650 smartphone platform since seen 5 updated editions series 60 renamed s60 november 2005 2008 symbian foundation formed consolidate assets different symbian platforms s60 uiq moap making open source 2009 based code base s60 first iteration platform since creation symbian foundation launched s60 5th edition symbian^1 top symbian os 9.4 base subsequent iterations named symbian^2 japanese market symbian^3 s60 software multivendor standard smartphones supports application development java midp c++ python adobe flash api called avkon ui s60 consists suite libraries standard applications telephony personal information manager pim tools helix-based multimedia players intended power fully featured modern phones large colour screens commonly known smartphones originally distinguishing feature s60 phones allowed users install new applications purchase unlike standard desktop platform however built-in apps rarely upgraded vendor beyond bug fixes new features added phones developed rather public release certain buttons standardized menu key four way joystick d-pad left right soft keys clear key s60 mainly used nokia also licensed manufacturers including lenovo lg electronics panasonic samsung sendo siemens mobile sony ericsson solstice vertu sony ericsson notably main vendor using competing uiq symbian interface addition manufacturers community includes four major releases s60 series 60 2001 series 60 second edition 2002 s60 3rd edition 2005 s60 5th edition 2008 release updated version called feature pack sometimes known relay runs different symbian version many devices capable running s60 software platform symbian os devices ranging early nokia 7650 running s60 v0.9 symbian os v6.1 latest samsung i8910 omnia hd running s60 v5.0 symbian os v9.4 symbian^3 version revised platform v5.2 table lists devices carrying version s60 well symbian os version based note new devices since symbian^3 may capable upgrading later systems symbian anna symbian belle therefore may see device listed many systems symbian progressing period organisational change metamorph open source software platform project os symbian os originally provided user interface ui visual layer runs atop operating system implemented separately examples symbian uis moap series 60 series 80 series 90 uiq separation ui underlying os created flexibility confusion market place nokia purchase symbian brokered involvement ui developers major user interface layers pledged donated open source foundation independently symbian operating system new symbian foundation announced intent unify different symbian uis single ui based s60 platform announcements made march 2009 indicated would s60 5th edition feature pack 1 12 april 2011 nokia announced symbian anna software update symbian^3 release three new devices 500 x7 e6 announced symbian anna pre-installed symbian anna available software update symbian^3 based devices well significant updates come anna 24 august 2011 nokia announced symbian belle later renamed nokia belle software update symbian anna release three new devices 603 700 701 nokia 600 cancelled replaced nokia 603 announced symbian belle pre-installed symbian belle available software update symbian anna-based devices well significant updates came belle november 2011 nokia announced carla donna updates carla expected released late 2012 early 2013 feature new web browser new widgets new nfc capabilities dolby surround audio enhancement donna going dual-core processor exclusive planned released late 2013 early 2014 may 2012 nokia executive claimed carla donna cancelled nokia would instead release belle feature pack 2 later 2012 lacking many new features planned carla donna february 2011 nokia announced partnership microsoft adopt windows phone 7 nokia primary operating system leaving symbian development question nokia promised support symbian newer devices least 2016 new symbian devices released nokia 808 pureview 29 april 2011 nokia announce would transfer symbian activities accenture along 3,000 employees symbian belle symbian belle – facts features pictures | [
1066,
7511,
7881,
372,
2187,
7521,
3615,
1453,
3952,
2919,
2922,
23,
2564,
6440,
5391,
7545,
5044,
740,
6465,
3653,
5068,
2240,
3657,
4726,
3321,
424,
1129,
76,
6158,
7956,
2271,
6510,
6517,
1172,
3694,
472,
4400,
474,
4407,
118,
3703,
... | Train |
5,063 | 3 | Socket_AM4:socket am4 socket am4 microprocessor socket used amd central processing units cpus built zen including zen+ zen 2 excavator microarchitectures am4 launched september 2016 designed replace sockets am3+ fm2+ fs1b single platform 1331 pin slots first amd support ddr4-compatible memory well achieve unified compatibility high-end cpus previously using socket am3+ amd lower-end apus various sockets am4 socket specifies 4 holes fastening heatsink motherboard placed corners rectangle lateral length 54×90 mm previous sockets 48×96 mm heat sinks older sockets compatible however cooler manufacturers reported offering brackets allowing previously manufactured coolers work am4 coolers redesigned alternatively motherboard makers including am3 am4 cooler mounting holes allowing previous generation coolers used socket am4 currently base 6 chipset models processors socket designed systems chip soc traditional northbridge southbridge board processor motherboard chipset increase number pci express lanes connectivity options connectivity options include nvme sata usb 3.2 gen 2 | [
2539,
6599,
2541,
5895,
4931,
7163,
2997,
3362,
1735,
5377,
6351,
913,
7826,
4694,
2751,
6545,
6373,
1961,
6655,
6562,
7484,
3145,
4090,
866,
694,
3063,
1237,
5436,
1143
] | Validation |
5,064 | 7 | Amazon_Web_Services:amazon web services amazon web services aws subsidiary amazon provides on-demand cloud computing platforms individuals companies governments metered pay-as-you-go basis aggregate cloud computing web services provide set primitive abstract technical infrastructure distributed computing building blocks tools one services amazon elastic compute cloud allows users disposal virtual cluster computers available time internet aws version virtual computers emulate attributes real computer including hardware central processing units cpus graphics processing units gpus processing local/ram memory hard-disk/ssd storage choice operating systems networking pre-loaded application software web servers databases customer relationship management crm etc aws technology implemented server farms throughout world maintained amazon subsidiary fees based combination usage hardware/os/software/networking features chosen subscriber required availability redundancy security service options subscribers pay single virtual aws computer dedicated physical computer clusters either part subscription agreement amazon provides security subscribers system aws operates many global geographical regions including 6 north america 2017 aws comprised 90 165 2019 services spanning wide range including computing storage networking database analytics application services deployment management mobile developer tools tools internet things popular include amazon elastic compute cloud ec2 amazon simple storage service amazon s3 services exposed directly end users instead offer functionality apis developers use applications amazon web services offerings accessed http using rest architectural style soap protocol amazon markets aws subscribers way obtaining large scale computing capacity quickly cheaply building actual physical server farm services billed based usage service measures usage varying ways 2017 aws owns dominant 34 cloud iaas paas next three competitors microsoft google ibm 11 8 6 respectively according synergy group aws platform launched july 2002 early stages platform consisted disparate tools services late 2003 aws concept publicly reformulated chris pinkham benjamin black presented paper describing vision amazon retail computing infrastructure completely standardized completely automated would rely extensively web services services storage would draw internal work already underway near end paper mentioned possibility selling access virtual servers service proposing company could generate revenue new infrastructure investment november 2004 first aws service launched public usage simple queue service sqs thereafter pinkham lead developer christopher brown developed amazon ec2 service team cape town south africa amazon web services officially re-launched march 14 2006 combining three initial service offerings amazon s3 cloud storage sqs ec2 aws platform finally provided integrated suite core online services chris pinkham benjamin black proposed back 2003 service offered developers web sites client-side applications companies andy jassy aws founder vice president 2006 said time amazon s3 one first scalable elements aws helps free developers worrying going store data whether safe secure available need costs associated server maintenance whether enough storage available amazon s3 enables developers focus innovating data rather figuring store it. 2016 jassy promoted ceo division reflecting success aws annual compensation 2017 hit nearly 36 million support industry-wide training skills standardization aws began offering certification program computer engineers april 30 2013 highlight expertise cloud computing james hamilton aws engineer wrote retrospective article 2016 highlight ten-year history online service 2006 2016 early fan outspoken proponent technology joined aws engineering team 2008 january 2018 amazon launched autoscaling service aws november 2018 aws announced customized arm cores use servers also november 2018 aws developing ground stations communicate customer satellites november 2010 reported amazon.com retail sites migrated aws prior 2012 aws considered part amazon.com revenue delineated amazon financial statements year industry watchers first time estimated aws revenue 1.5 billion april 2015 amazon.com reported aws profitable sales 1.57 billion first quarter year 265 million operating income founder jeff bezos described fast-growing 5 billion business analysts described surprisingly profitable forecast october 2015 amazon.com said q3 earnings report aws operating income 521 million operating margins 25 percent aws 2015 q3 revenue 2.1 billion 78 increase 2014 q3 revenue 1.17 billion 2015 q4 revenue aws segment increased 69.5 y/y 2.4 billion 28.5 operating margin giving aws 9.6 billion run rate 2015 gartner estimated aws customers deploying 10x infrastructure aws combined adoption next 14 providers 2016 q1 revenue 2.57 billion net income 604 million 64 increase 2015 q1 resulted aws profitable amazon north american retail business first time first quarter 2016 amazon experienced 42 rise stock value result increased earnings aws contributed 56 corporate profits aws 17.46 billion annual revenue 2017 end 2018 number grown 25.65 billion notable customers include nasa obama presidential campaign 2012 netflix 2019 reported 80 germany listed dax companies use aws 2019 aws distinct operations 20 geographical regions 6 north america 1 south america 5 emea 8 asia pacific aws announced 5 new regions coming online hong kong sar bahrain milan cape town jakarta region wholly contained within single country data services stay within designated region region multiple availability zones consist one discrete data centers redundant power networking connectivity housed separate facilities availability zones automatically provide additional scalability redundancy within region since intentionally isolated prevent outages spreading zones several services operate across availability zones e.g. s3 dynamodb others configured replicate across zones spread demand avoid downtime failures december 2014 amazon web services operated estimated 1.4 million servers across 28 availability zones global network aws edge locations consists 54 points presence worldwide including locations united states europe asia australia south america 2014 aws claimed aim achieve 100 renewable energy usage future united states aws partnerships renewable energy providers include community energy virginia support us east region pattern development january 2015 construct operate amazon wind farm fowler ridge iberdrola renewables llc july 2015 construct operate amazon wind farm us east edp renewables north america november 2015 construct operate amazon wind farm us central tesla motors apply battery storage technology address power needs us west northern california region aws also pop-up lofts different locations around world market aws entrepreneurs startups different tech industries physical location visitors work relax inside loft learn aws june 2014 aws opened first temporary pop-up loft san francisco may 2015 expanded new york city september 2015 expanded berlin aws opened fourth location tel aviv march 1 2016 march 22 2016 pop-up loft open london september 10 october 29 2015 2017 aws launched amazon start united kingdom help young adults military veterans retrain technology-related skills partnership prince trust ministry defence mod aws help provide re-training opportunities young people disadvantaged backgrounds former military personnel aws working alongside number partner companies including cloudreach sage edf energy tesco bank | [
4293,
2182,
370,
9,
3613,
7165,
3953,
2556,
3954,
3958,
6806,
22,
3627,
6810,
4692,
2212,
1474,
5396,
5754,
3978,
3309,
754,
6469,
1125,
62,
2961,
3326,
6484,
1134,
4738,
1511,
3676,
1514,
88,
1906,
5453,
7608,
2988,
7613,
7969,
6521,
... | Test |
5,065 | 2 | MidnightBSD:midnightbsd midnightbsd free unix-like desktop-oriented operating system originally forked freebsd 6.1 periodically updated code drivers later freebsd releases default desktop environment gnustep borrows heavily nextstep graphical user interface midnightbsd began fork freebsd 2005 founder project lucas holt wished create bsd derived desktop operating system familiar several live cd projects work trueos desktopbsd time also interest gnustep two ideas folded plan create user friendly desktop environment midnightbsd 0.1 released based efforts lucas holt caryn holt d. adam karim phil pereira bsdnexus christian reinhardt release features modified version freebsd ports system ports system evolved mports includes fake support generation packages installation license tagging strict rules package list generation modification files outside destination many features introduced midnightbsd 0.1.1 christian reinhardt replaced phil pereira lead mports maintainer prior release midnightbsd 0.1 d. adam karim acted security officer first release release engineering handled lucas holt 0.2 introduced refined mports system 2000 packages portable c compiler added i386 addition gnu compiler collection changes include enabling ipfw sound card detection startup newer versions many software packages including bind gcc openssh sendmail well live cd creation system currently project focusing finishing magus build cluster software creating new installer finishing new package installation management tools called mport beginning work 0.3 release next release feature enhancements found freebsd 7.0 dragonfly bsd midnightbsd named lucas caryn holt cat midnight midnight ten-pound black turkish angora midnightbsd released several licenses kernel code newly created code released two-clause bsd license parts gpl lgpl isc beerware licenses along three- four-clause bsd licenses jesse smith reviewed midnightbsd 0.6 distrowatch weekly | [
5268,
1522,
1523,
885,
1341,
1254,
7514,
191,
6085,
6711,
1356,
6984,
1547,
4498,
7355,
481,
3457,
732,
2300,
5571,
6278,
8194,
8096,
1193,
1013,
3636,
4059,
5232,
6367,
8001,
6918,
5760,
3559,
6211,
3986,
4806,
594,
4441,
5865,
4534,
6... | Validation |
5,066 | 4 | Trojan.Win32.DNSChanger:trojan.win32.dnschanger trojan.win32.dnschanger trojan win32/dnschanger microsoft malware protection center definition multiple av-labs backdoor trojan due mcafee labs malware variant detected april 19 2009 though microsoft malware protection center knew threat since december 8 2006 dns changer trojans dropped onto systems malware tdss koobface dns-changer-trojan malicious .exe file unable spread accord may therefore perform several actions attacker choice compromised computer changing domain name server dns settings order divert traffic unsolicited potentially illegal and/or malicious domains win32.dnschanger used organized crime syndicates maintain click-fraud moment unaware user browsing activity secretly manipulated altering user clicks seemingly legitimate link forwarded another offered site attackers generate revenues pay-per-click online advertising schemes mostly trojan usually extremely small file +/- 1.5 kilobytes designed change 'nameserver registry key value custom ip address link called ip address encrypted body trojan result change victim device contact newly assigned dns -server resolve names different webservers sometimes randomly f-secure received samples variant named paypal-2.5.200-mswin32-x86-2005.exe case paypal attribution indicates phishing likely trojan programmed change dns server name victim computer ip address 193.227.227.218 registry key affected trojan | [
5452,
91,
7425,
7087,
924,
6644,
1395,
6305,
74,
5619,
88
] | Test |
5,067 | 2 | OpenBSD_Cryptographic_Framework:openbsd cryptographic framework openbsd cryptographic framework ocf service virtualization layer uniform management cryptographic hardware operating system part openbsd project included operating system since openbsd 2.8 december 2000 like openbsd projects openssh ported systems based berkeley unix freebsd netbsd solaris linux one linux ports supported intel use proprietary cryptographic software hardware provide hardware-accelerated ssl encryption open source apache http server cryptography computationally intensive used many different contexts software implementations often serve bottleneck information flow increase network latency specialist hardware cryptographic accelerators mitigate bottleneck problem introducing parallelism certain kinds hardware hardware random number generators also produce randomness reliably pseudo-random software algorithm exploiting entropy natural events unlike graphics applications games film processing similar hardware accelerators common use strong operating system support use hardware cryptography relatively low uptake late 1990s need uniform operating system layer mediate cryptographic hardware application software used lack layer led production applications hard-coded work one small range cryptographic accelerators openbsd project history integrating strong carefully audited cryptography operating system core produced framework provision cryptographic hardware acceleration operating system service application-level support provided pseudo-device provides access hardware drivers standard ioctl interface simplifies writing applications removes need application programmer understand operational details actual hardware used openbsd implementation ipsec packet-level encryption protocol altered packets decoded batches improves throughput one rationale maximize efficiency hardware usage—larger batches reduce bus transmission overhead—but practice ipsec developers found strategy improves efficiency even software implementations many intel firmware hubs i386 motherboards provide hardware random number generator possible facility used provide entropy ipsec openssl uses ocf systems hardware supports rsa dh dsa cryptographic protocols automatically use hardware without modification software 11 december 2010 former government contractor named gregory perry sent email openbsd project leader theo de raadt alleging fbi paid openbsd ex-developers 10 years previously compromise security system inserting number backdoors side channel key leaking mechanisms ocf theo de raadt made email public 14 december forwarding openbsd-tech mailing list suggested audit ipsec codebase de raadt response skeptical report invited developers independently review relevant code weeks followed bugs fixed evidence backdoors found oracle proprietary operating system solaris originally developed sun features unrelated product called solaris cryptographic framework plug-in system cryptographic algorithms hardware | [
5626,
8024,
8178,
2883,
5760,
578,
7626,
2644,
6367
] | Test |
5,068 | 2 | Series_90_(software_platform):series 90 software platform series 90 formerly hildon platform mobile phones uses symbian os developed nokia collaboration psion released 2003 going platform nokia 7700 cancelled eventually make market nokia 7710 nokia discontinued series 90 platform merged technology s60 although one production series 90 device made form gui continued nokia hildon user interface maemo shipped nokia internet tablets series 90 completely incompatible series 60 s60 uiq popular platforms symbian smartphones however applications nokia series 80 communicator devices – nokia 9300 – function series 90 essentially series 90 development psion eikon gui used series 5 series 5mx revo netpad series 7 netbook machines modified controlled entirely touchscreen supplemented 77x0 seven hardware buttons rocker-dial nokia 7700 never released on-screen keyboard text input 7710 added basic handwriting recognition applications single menu tree accessible title bar top screen exit quit option apps button bar added right hand side screen resembling nokia communicator smartphones | [
1066,
7511,
7881,
372,
2187,
7521,
3615,
1453,
3952,
2922,
23,
2564,
6440,
5391,
7545,
5044,
740,
6465,
5062,
3653,
2240,
3657,
4726,
424,
1129,
76,
5794,
6158,
7956,
2271,
6517,
1172,
3694,
472,
4400,
474,
4407,
118,
3703,
7261,
2300,
... | Test |
5,069 | 6 | Fast_Virtual_Disk:fast virtual disk fast virtual disk better known fvd virtualization-oriented disk image file format developed ibm qemu virtualization platform differs existing paravirtualization-centric virtual disk image formats design emphasizes lack contention separation concerns host guest kernels duduplication filesystem block layer storage management fvd written either directly physical logical blockstore avoiding host filesystem overheads regular host file system file strives maintain similarity raw disk layouts eliminate host filesystem disk image compression overheads minimize metadata-related overheads | [
7584,
7306,
6885,
578
] | Test |
5,070 | 5 | Cleancode_eMail:cleancode email cleancode email also known cleancode email simply email simple command line software utility sending smtp email portable enough compile run linux os x bsd solaris cygwin perhaps unix-like operating systems upon installing cleancode email codice_1 executable binary becomes available program offers features sending email via smtp supports smtp auth via login plain mechanisms mime attachments address book encryption transport via tls message via pgp digital signatures via pgp easily used sending email command line via shell scripts software packages lack modern features helps cleancode email stand fast efficient helpful tool system administrators unix-like environments intentional purpose first developed cleancode email started september 2001 currently still maintained developed original author dean jones | [
1152,
6965,
2453,
7975,
6721,
735,
1475,
6908,
578,
6648,
2131,
4352,
6582,
6588,
5887,
4918
] | Test |
5,071 | 4 | Synack:synack synack american technology company based redwood city california synack ’ business includes vulnerability intelligence platform automates discovery exploitable vulnerabilities reconnaissance turns company ’ freelance hackers create vulnerability reports clients synack founded 2013 former nsa agents jay kaplan mark kuhr synack uses network freelance security analysts hackers 50 countries check vulnerability security problems synack also developed hydra platform built spot vulnerabilities look out-of-date software clients first form hydra went live october 21 2015 april 24 2014 company announced secured series funding kleiner perkins caufield byers google ventures allegis capital derek smith shape security february 2015 company raised 25 million series b funding april 11 2017 reported synack raised 21 million microsoft ventures hewlett packard enterprise singtel prior investors ggv capital gv kleiner perkins caufield byers also took part funding round bringing total money raised company 55 million since founding april 11 2017 company 100 employees well growing network freelance hackers cnbc named synack cnbc disruptor company three times row 2015 2017 | [
7637,
1134,
3486
] | Test |
5,072 | 3 | Avnu_Alliance:avnu alliance avnu alliance consortium professional automotive consumer electronics industrial manufacturing companies working together establish certify interoperability open audio video bridging avb time-sensitive networking tsn standards alliance works member companies certify avb tsn products interoperability manufacturers may use avnu logo certified products every avb-compliant device submitted certification avnu alliance lack avnu logo necessarily imply device incompatible avnu-certified devices institute electrical electronics engineers ieee formed 1963 merger american institute electrical engineers founded 1884 institute radio engineers founded 1912 two organizations merged rise electronics many interests beginning overlap 1980 ieee started project 802 create standards local area network lan applications 1985 802.3 became official standard ethernet cable-based data transmission system originally developed xerox 1970s audio video bridging name given set technical standards developed ieee audio video bridging task group ieee 802.1 standards committee committee developed original technical standards avb way simplify audio video streaming use ethernet cable rather complicated approach traditionally taken using array analog one-way single-purpose point-to-point cables avnu alliance launched august 25 2009 create certification processes based avb standards would ensure interoperability founding members include broadcom cisco systems harman international intel xilinx august 2013 alliance includes 60 members worldwide represent cross-section companies 2012 avnu alliance announced formation avnu automotive avb gen2 council aaa2c committee automotive industry experts collectively identify automotive requirements future development second generation avb standards april 2013 forum launched avnu alliance broadcast advisory council aabac assess improve avb requirements broadcast industry created participation avnu alliance members network technologists broadcasters aabac also intends promote use avb broadcast applications avnu alliance chairman president rick kreifeldt harman international avnu alliance invites industry companies participate collaborate efforts improve audio/video quality members create broad array products including cars semiconductors loudspeakers consoles microphones 2012 avnu alliance created single set open standards avb uses certify devices guarantee interoperability since january 2012 avnu alliance worked test house university new hampshire interoperability laboratory unh-iol test interoperability provide validation certified products avnu certification testing officially began unh-iol february 2013 unh-iol neutral independent testing service works audio/video industry consortiums including ethernet alliance wi-fi alliance ipv6 forum provide third-party verification lower costs collaborative testing help guide industry acceptance technology standard technology ecosystem supporting accelerating development avnu certified products matured include standards-compliant silicon devices fpga ip open-source software also 3rd-party avb certification services coveloz avb certification service product submitted avnu alliance certification tested 400 pages conformance requirements combine ieee 802.1 standard requirements additional requirements developed avnu issues product may reported manufacturer fixing outstanding issues manufacturer submit product avnu official approval permission use avnu certification logo product accompanying marketing efforts february 2014 avnu alliance announced first certified products series avb switches extreme networks passed conformance tests bear avnu-certified logo extreme networks summit x440 series stackable switches extend benefits extremexos software intended professional av applications allowing data audio video co-exist single standards-based network avnu alliance goal make easier implement network systems promoting adoption ieee 802.1 1722 1733 avb standards automotive professional consumer electronics markets ensuring avb products different manufacturers would able interconnect seamlessly along ensuring interoperability adoption ieee 802.1 related ieee 1722 ieee 1733 avb standards various networks would reduce technical issues synching glitches delays improving content streaming capabilities alliance industry standards improved ethernet technology making simpler add enhanced performance capabilities audio/video networks bringing costs using lighter cheaper cable easier set able carry larger amount information regularly used networking environments 2018 avnu alliance announced milan initiative define implementation details media formats clocking redundancy device control provide certification testing program ensure devices different vendors interoperable within common device profiles milan specification based following ieee standards specification requires media clocking based ieee 1722 crf clock reference format sample rate 48 khz optionally 96 192 khz audio stream format based ieee 1722 32-bit standard aaf audio format 8 channels per stream optionally 24 32 bit high capacity format 56 64 channels redundancy providedcwith two independent logical networks every endpoint seamless switchover mechanism avdecc defines operations discover device addition removal retrieve device entity model connect disconnect streams manage device connection status remote control devices alliance members represent variety facets automotive technology growing complexity in-vehicle audio/video systems increasing number in-vehicle applications infotainment safety multiple cameras testing ensure interoperability increasingly important automotive market automotive systems multiple applications require interoperability work properly 2013 avnu alliance works genivi alliance jaspar alliance standardize in-vehicle ethernet requirements ieee avb task group developed series enhancements provide highly-reliable delivery low latency synchronized audio video technology enables construction affordable high performance professional media networks ieee avb task force developed improvements ethernet order improve audio/video networking avnu certifies avb products ensure interoperability video interoperability specifications pro market currently development meyer sound noted adopting avnu alliance ethernet standards assist development first avb-capable loudspeaker named cal stands column array loudspeaker completed 2013 improvements ethernet developed ieee avb task force also benefit desiring distribute digital content among multiple devices home networks 2013 avnu alliance began establish testing requirements avb interoperability specifications reliable time-synced av streaming ethernet wireless networks residential applications | [
4783,
2087
] | Test |
5,073 | 9 | SASL_(programming_language):sasl programming language sasl st andrews static language alternatively st andrews standard language purely functional programming language developed david turner university st andrews 1972 based applicative subset iswim 1976 turner redesigned reimplemented non-strict lazy language form foundation turner later languages krc miranda sasl appears untyped whereas miranda polymorphic types burroughs corporation used sasl write compiler operating system | [
6507,
2740,
4302,
1450,
920
] | Test |
5,074 | 4 | Location-based_authentication:location-based authentication location-based authentication special procedure prove individual identity authenticity appearance simply detecting presence distinct location enable location-based authentication special combination objects required basic requirement safe location-based authentication well defined separation locations well equally well defined proximity applying individual location offered technical solution simple location-based authentication includes method limiting granted access presence hence terminating granted authentication leave defines mandate either include new additional procedure | [
1249,
5078,
3884,
6162,
6944,
3461,
5725,
3794,
1805
] | Test |
5,075 | 8 | Apache_Axis:apache axis apache axis apache extensible interaction system open-source xml based web service framework consists java c++ implementation soap server various utilities apis generating deploying web service applications using apache axis developers create interoperable distributed computing applications axis development takes place auspices apache software foundation using java version axis two ways expose java code web service easiest one use axis native jws java web service files another way use custom deployment custom deployment enables customize resources exposed web services see also apache axis2 jws files contain java class source code exposed web service main difference ordinary java file jws file file extension another difference jws files deployed source code compiled class files following example expose methods add subtract class calculator axis servlet deployed need copy jws file axis directory server work using apache tomcat container case using another web container custom war archive creation required jws web service accessible using url nowiki http //localhost:8080/axis/calculator.jws /nowiki running custom configuration apache tomcat different container url might different custom web service deployment requires specific deployment descriptor called wsdd web service deployment descriptor syntax used specify resources exposed web services current version 1.3 supports web service exposed using axis generate wsdl file automatically accessing web service url wsdl appended example implementing deploying simple web-service c++ version axis found axis-cpp tutorial link reference section steps necessary information individual steps go directly tutorial | [
542,
5631,
7238,
894,
4303,
5728,
7805,
6986,
2741,
7444,
7896,
917,
5571,
3463,
3542,
4422,
3204,
1286,
6821,
5054,
840,
1392,
3031,
5408,
3558,
5677,
3479,
5863,
6387,
6137,
7488,
7763,
7857,
5874,
3915,
3239,
1511,
4742,
5007,
1333,
... | Test |
5,076 | 4 | Pre-play_attack:pre-play attack field security engineering pre-play attack cryptographic attack attacker prepares attack advance carrying simulated transaction pretending device attacked repeats attack second time real device time likely carry series operations simulation technique relies able guess content transaction advance something usually made possible poor choice unpredictability within system name play replay attack pre-play attacks effective chances success slim | [] | Test |
5,077 | 9 | CommonLoops:commonloops commonloops common lisp object-oriented programming system acronym reminiscent earlier lisp oo system loops interlisp-d system early programming language extended common lisp include object-oriented programming functionality dynamic object system differs oop facilities found static languages c++ java like new flavors commonloops supported multiple inheritance generic functions method combination commonloops also supported multi-methods made use metaobjects commonloops new flavors primary ancestors clos commonloops supported portable implementation known portable commonloops pcl ran common lisp implementations day | [
7878,
1445,
5019,
1820,
6796,
6087,
2915,
5734,
1102,
1478,
2218,
4704,
5757,
6116,
1116,
6471,
7573,
2600,
1885,
2249,
1889,
1890,
795,
6876,
6888,
3370,
1557,
6191,
5494,
5501,
6210,
144,
4074,
4085,
7298,
5515,
8025,
3749,
6949,
5883,
... | Test |
5,078 | 4 | Time-based_authentication:time-based authentication time-based authentication special procedure prove individual identity authenticity appearance simply detecting presence scheduled time day within scheduled time interval distinct location enable time-based authentication special combination objects required makes sense define starting time time span without constraints location granting access known without defining distinct location access shall granted basic requirement safe time based authentication well defined separation locations well equally well defined proximity applying individual location | [
3794,
5074
] | Test |
5,079 | 3 | Motorola_68000:motorola 68000 motorola 68000 'sixty-eight-thousand also called m68k motorola 68k sixty-eight-kay 16/32-bit cisc microprocessor introduced 1979 motorola semiconductor products sector design implements 32-bit instruction set 32-bit registers 32-bit internal data bus address bus 24-bits use memory segmentation made popular programmers internally uses 16-bit data alu two additional 16-bit alus used mostly addresses 16-bit external data bus reason motorola referred 16/32-bit processor one first widely available processors 32-bit instruction set running relatively high speeds era 68k popular design 1980s widely used new generation personal computers graphical user interfaces including apple macintosh commodore amiga atari st many others competed primarily intel 8088 found ibm pc easily outperformed 68k 8088 pushed designs like zilog z8000 niche markets made motorola major player cpu space 68k soon expanded additional family members implementing full 32-bit alus part growing motorola 68000 series original 68k generally software forward-compatible rest line despite limited 16-bit wide external bus 40 years production 68000 architecture still use motorola first widely-produced cpu motorola 6800 although capable design eclipsed powerful designs like zilog z80 less powerful faster designs like mos 6502 sales prospects 6800 dimmed motorola began totally new design replace became motorola advanced computer system silicon project macss begun 1976 macss aimed develop entirely new architecture without backward compatibility 6800 ultimately retain bus protocol compatibility mode existing 6800 peripheral devices version 8-bit data bus produced however designers mainly focused future forward compatibility gave 68000 design head start later 32-bit instruction set architectures instance cpu registers 32 bits wide though self-contained structures processor operate 32 bits time macss team drew heavily influence minicomputer processor design pdp-11 vax systems similarly microcode-based mid 1970s 8-bit microprocessor manufacturers raced introduce 16-bit generation national semiconductor first imp-16 pace processors 1973–1975 issues speed intel worked advanced 16/32-bit intel iapx 432 alias 8800 since 1975 intel 8086 since 1976 introduced 1978 became really widespread form almost identical 8088 ibm pc years later arriving late 16-bit arena afforded new processor transistors roughly 40,000 active versus 20,000 active 8086 32-bit macroinstructions acclaimed general ease use original mc68000 fabricated using hmos process 3.5 µm feature size formally introduced september 1979 initial samples released february 1980 production chips available counter november initial speed grades 4 6 8 mhz 10 mhz chips became available 1981 12.5 mhz chips june 1982 16.67 mhz 12f version mc68000 fastest version original hmos chip produced late 1980s 68k instruction set particularly well suited implement unix 68000 successors became dominant cpus unix-based workstations including sun workstations apollo/domain workstations 68000 also used mass-market computers apple lisa macintosh amiga atari st 68000 used microsoft xenix systems well early netware unix-based server 68000 used first generation desktop laser printers including original apple inc. laserwriter hp laserjet 1982 68000 received minor update isa support virtual memory conform popek goldberg virtualization requirements updated chip called 68010 also added new loop mode sped small loops increased overall performance 10 clock speeds extended version exposed 31 bits address bus also produced small quantities 68012 support lower-cost systems control applications smaller memory sizes motorola introduced 8-bit compatible mc68008 also 1982 68000 8-bit data bus smaller 20-bit address bus 1982 motorola devoted attention 68020 88000 projects several companies second-source manufacturers hmos 68000 included hitachi hd68000 shrank feature size 2.7 µm 12.5 mhz version mostek mk68000 rockwell r68000 signetics scn68000 thomson/sgs-thomson originally ef68000 later ts68000 toshiba tmp68000 toshiba also second-source maker cmos 68hc000 tmp68hc000 encrypted variants 68000 hitachi fd1089 fd1094 store decryption keys opcodes opcode data battery-backed memory used certain sega arcade systems including system 16 prevent piracy illegal bootleg games 68hc000 first cmos version 68000 designed hitachi jointly introduced 1985 motorola version called mc68hc000 hitachi hd68hc000 68hc000 eventually offered speeds 8–20 mhz except using cmos circuitry behaved identically hmos mc68000 change cmos greatly reduced power consumption original hmos mc68000 consumed around 1.35 watts ambient temperature 25 °c regardless clock speed mc68hc000 consumed 0.13 watts 8 mhz 0.38 watts 20 mhz unlike cmos circuits hmos still draws power idle power consumption varies little clock rate apple selected 68hc000 use macintosh portable motorola replaced mc68008 mc68hc001 1990 chip resembled 68hc000 respects data bus could operate either 16-bit 8-bit mode depending value input pin reset thus like 68008 could used systems cheaper 8-bit memories later evolution 68000 focused modern embedded control applications on-chip peripherals 68ec000 chip scm68000 core expanded address bus 32 bits removed m6800 peripheral bus excluded move sr instruction user mode programs 1996 motorola updated standalone core fully static circuitry drawing 2 µw low-power mode calling mc68sec000 motorola ceased production hmos mc68000 mc68008 1996 spin-off company freescale semiconductor still producing mc68hc000 mc68hc001 mc68ec000 mc68sec000 well mc68302 mc68306 microcontrollers later versions dragonball family 68000 architectural descendants 680x0 cpu32 coldfire families also still production recently sendai fab closure 68hc000 68020 68030 68882 parts discontinued leaving 68sec000 production succeeded true 32-bit microprocessors 68000 used core many microcontrollers 1989 motorola introduced mc68302 communications processor introduction 68000 first used high-priced systems including multiuser microcomputers like wicat 150 early alpha microsystems computers sage ii iv tandy trs-80 model 16 single-user workstations hewlett-packard hp 9000 series 200 systems first apollo/domain systems sun microsystems sun-1 corvus concept graphics terminals like digital equipment corporation vaxstation 100 silicon graphics iris 1000 1200 unix systems rapidly moved capable later generations 68k line remained popular market throughout 1980s mid-1980s falling production cost made 68000 viable use personal home computers starting apple lisa macintosh followed commodore amiga atari st sharp x68000 hand sinclair ql microcomputer commercially important utilisation 68008 along derivatives icl one per desk business terminal helix systems missouri united states designed extension swtpc ss-50 bus ss-64 produced systems built around 68008 processor adoption risc x86 displaced 68000 series desktop/workstation cpu processor found substantial use embedded applications early 1980s quantities 68000 cpus could purchased less 30 usd per part video game manufacturers used 68000 backbone many arcade games home game consoles atari food fight 1982 one first 68000-based arcade games others included sega system 16 capcom cp system cps-2 snk neo geo late 1980s 68000 inexpensive enough power home game consoles sega mega drive/genesis console also sega cd attachment sega cd system three cpus two 68000s 1993 multi-processor atari jaguar console used 68000 support chip although developers used primary processor due familiarity 1994 multi-processor sega saturn console used 68000 sound co-processor much mega drive/genesis uses z80 co-processor sound and/or purposes certain arcade games steel gunner others based namco system 2 use dual 68000 cpu configuration systems triple 68000 cpu configuration also exist galaxy force others based sega board along quad 68000 cpu configuration used jaleco one 68000 sound lower clock rate compared 68000 cpus games big run cisco heat fifth 68000 different clock rate compared 68000 cpus additionally used jaleco arcade game wild pilot i/o processing 68000 also saw great success embedded controller early 1981 laser printers imagen imprint-10 controlled external boards equipped 68000 first hp laserjet—introduced 1984—came built-in 8 mhz 68000 printer manufacturers adopted 68000 including apple introduction laserwriter 1985 first postscript laser printer 68000 continued widely used printers throughout rest 1980s persisting well 1990s low-end printers 68000 also saw success field industrial control systems among systems benefited 68000 derivative microprocessor families programmable logic controllers plcs manufactured allen-bradley texas instruments subsequently following acquisition division ti siemens users systems accept product obsolescence rate domestic users entirely likely despite installed 20 years ago many 68000-based controllers continue reliable service well 21st century number digital oscilloscopes 80s 68000 used waveform display processor models including lecroy 9400/9400a also use 68000 waveform math processor including addition subtraction multiplication division two waveforms/references/waveform memories digital oscilloscopes using 68000 including 9400/9400a also perform fft functions waveform 683xx microcontrollers based 68000 architecture used networking telecom equipment television set-top boxes laboratory medical instruments even handheld calculators mc68302 derivatives used many telecom products cisco 3com ascend marconi cyclades others past models palm pdas handspring visor used dragonball derivative 68000 alphasmart uses dragonball family later versions portable word processors texas instruments uses 68000 high-end graphing calculators ti-89 ti-92 series voyage 200 early versions used specialized microcontroller static 68ec000 core later versions use standard mc68sec000 processor modified version 68000 formed basis ibm xt/370 hardware emulator system 370 processor 68000 24-bit external address bus two byte-select signals replaced a0 24 lines therefore address 16 mb physical memory byte resolution address storage computation uses 32 bits internally however 8 high-order address bits ignored due physical lack device pins allows run software written logically flat 32-bit address space accessing 24-bit physical address space motorola intent internal 32-bit address space forward compatibility making feasible write 68000 software would take full advantage later 32-bit implementations 68000 instruction set however prevent programmers writing forward incompatible software 24-bit software discarded upper address byte used purposes addressing could fail 32-bit 68000 implementations example early pre-7.0 versions apple mac os used high byte memory-block master pointers hold flags locked purgeable later versions os moved flags nearby location apple began shipping computers 32-bit clean roms beginning release 1989 mac iici 68000 family stores multi-byte integers memory big-endian order cpu eight 32-bit general-purpose data registers d0-d7 eight address registers a0-a7 last address register stack pointer assemblers accept label sp equivalent a7 good number registers time many ways small enough allow 68000 respond quickly interrupts even worst case 8 data registers d0–d7 7 address registers a0–a6 needed saved 15 registers total yet large enough make calculations fast could done entirely within processor without keeping partial results memory note exception routine supervisor mode also save user stack pointer a7 would total 8 address registers however dual stack pointer a7 supervisor-mode a7 design 68000 makes normally unnecessary except task switch performed multitasking system two types registers mildly annoying times hard use practice reportedly allowed cpu designers achieve higher degree parallelism using auxiliary execution unit address registers 68000 comparison arithmetic logic operations set bit flags status register record results use later conditional jumps bit flags zero z carry c overflow v extend x negative n extend x flag deserves special mention separate carry flag permits extra bit arithmetic logic shift operations separated carry flow-of-control linkage designers attempted make assembly language orthogonal instructions divided operations address modes almost address modes available almost instructions 56 instructions minimum instruction size 16 bits many instructions addressing modes longer include additional address mode bits cpu later whole family implements two levels privilege user mode gives access everything except privileged instructions interrupt level controls supervisor privilege gives access everything interrupt always becomes supervisory supervisor bit stored status register visible user programs advantage system supervisor level separate stack pointer permits multitasking system use small stacks tasks designers allocate memory required hold stack frames maximum stack-up interrupts cpu recognizes seven interrupt levels levels 1 5 strictly prioritized higher-numbered interrupt always interrupt lower-numbered interrupt status register privileged instruction allows one set current minimum interrupt level blocking lower equal priority interrupts example interrupt level status register set 3 higher levels 4 7 cause exception level 7 level triggered non-maskable interrupt nmi level 1 interrupted higher level level 0 means interrupt level stored status register visible user-level programs hardware interrupts signalled cpu using three inputs encode highest pending interrupt priority separate encoder usually required encode interrupts though systems require three hardware interrupts possible connect interrupt signals directly encoded inputs cost additional software complexity interrupt controller simple 74ls148 priority encoder may part vlsi peripheral chip mc68901 multi-function peripheral used atari st range computers sharp x68000 also provided uart timer parallel i/o exception table interrupt vector table interrupt vector addresses fixed addresses 0 1023 permitting 256 32-bit vectors first vector reset consists two vectors namely starting stack address starting code address vectors 3 15 used report various errors bus error address error illegal instruction zero division chk chk2 vector privilege violation block privilege escalation reserved vectors became line 1010 emulator line 1111 emulator hardware breakpoint vector 24 starts real interrupts spurious interrupt hardware acknowledgement level 1 level 7 autovectors 16 trap vectors reserved vectors user defined vectors since minimum starting code address vector must always valid reset systems commonly included nonvolatile memory e.g rom starting address zero contain vectors bootstrap code however general purpose system desirable operating system able change vectors runtime often accomplished either pointing vectors rom jump table ram use bank switching allow rom replaced ram runtime 68000 meet popek goldberg virtualization requirements full processor virtualization single unprivileged instruction move sr allows user-mode software read-only access small amount privileged state 68000 also unable easily support virtual memory requires ability trap recover failed memory access 68000 provide bus error exception used trap save enough processor state resume faulted instruction operating system handled exception several companies succeed making 68000-based unix workstations virtual memory worked using two 68000 chips running parallel different phased clocks leading 68000 encountered bad memory access extra hardware would interrupt main 68000 prevent also encountering bad memory access interrupt routine would handle virtual memory functions restart leading 68000 correct state continue properly synchronized operation main 68000 returned interrupt problems fixed next major revision 68k architecture release mc68010 bus error address error exceptions push large amount internal state onto supervisor stack order facilitate recovery move sr instruction made privileged new unprivileged move ccr instruction provided use place user mode software operating system trap emulate user-mode move sr instructions desired standard addressing modes plus access status register later models special registers instructions dot-letter suffixes permitting operations occur 8-bit bytes .b 16-bit words .w 32-bit longs .l like many cpus era cycle timing instructions varied depending source operand example unsigned multiply instruction takes 38+2n clock cycles complete n equal number bits set operand create function took fixed cycle count required addition extra code multiply instruction would typically consume extra cycles bit n't set original multiplication operand instructions dyadic operation source destination destination changed notable instructions 68ec000 low-cost version 68000 slightly different pinout designed embedded controller applications 68ec000 either 8-bit 16-bit data bus switchable reset processors available variety speeds including 8 16 mhz configurations producing 2,100 4,376 dhrystones processors floating-point unit difficult implement fpu coprocessor mc68881/2 one ec series lacks necessary coprocessor instructions 68ec000 used controller many audio applications including ensoniq musical instruments sound cards part midi synthesizer ensoniq sound boards controller provided several advantages compared competitors without cpu board processor allowed board configured perform various audio tasks mpu-401 midi synthesis mt-32 emulation without use tsr program improved software compatibility lowered cpu usage eliminated host system memory usage motorola 68ec000 core later used m68k-based dragonball processors motorola/freescale also used sound controller sega saturn game console controller hp jetdirect ethernet controller boards mid-1990s laserjet printers 68000 assembly code subroutine named copies null-terminated string 8-bit characters destination string converting alphabetic characters lower case subroutine establishes call frame using register a6 frame pointer kind calling convention supports reentrant recursive code typically used languages like c c++ subroutine retrieves parameters passed stack loops reading ascii character single byte string checking whether capital alphabetic character converting lower-case character otherwise leaving writing character string finally checks whether character null character repeats loop otherwise restores previous stack frame a6 register returns note string pointers registers a0 a1 auto-incremented iteration loop contrast code stand-alone function even restrictive version ams ti-89 series calculators kernel-independent values looked tables files libraries executing system calls exception processing minimal registers used need save valid historical julian dates 1 march 1 ad gregorian ones less two dozen operations calculates day number compatible iso 8601 called three inputs stored corresponding locations | [
5012,
6078,
1075,
3614,
1454,
7533,
4321,
7541,
2567,
2929,
7905,
1103,
2934,
6111,
4702,
405,
6121,
1867,
3987,
5421,
3664,
4006,
5784,
7588,
2257,
3674,
2617,
2621,
2266,
1150,
1522,
2983,
4751,
5097,
5100,
3688,
804,
7970,
5110,
4397,
... | Test |
5,080 | 2 | Telephony_service_provider:telephony service provider telephony service provider defined microsoft tapi specification software interface physical telephony device modem accessed programmatically perform actions dialing phone number logging call tsps thought tapi specific driver telephony device example windows 10 supplies | [
768
] | Test |
5,081 | 2 | Execute_Direct_Access_Program:execute direct access program ibm mainframe operating systems execute direct access program xdap pseudo access method accessing direct access datasets block block basis xdap specifically described os system programmer guide existing blocks may read updated dataset may created extended using xdap purpose true access method required xdap may coexist bsam bpam several os components implemented way programmer responsible computing full direct access block identifier mbbcchhr system algorithms available calculating mbbcchhr ttrn system data form track capacity tables available calculating ttrn block number direct access device type later versions os facilitate accessing large capacity devices using trkaddr macro list execute forms xdap supported whereby prototype form called list form expanded data functional form called execute form expanded instructions xdap also supported conventionally case two forms combined expanded inline data instructions use list execute forms facilitates development re-enterable programs xdap results excp supervisor call executed hence execute channel program excp implicitly embedded within xdap iob sole parameter excp included data structure within xdap macro expansion channel command words xdap must reference opened dcb full direct access identifier dcb may opened input output input output inout outputs must update writes existing blocks xdap support format writes bsam bpam available executing format writes writes add new blocks dataset i.e initial additional block particularly final block iobspsvc flag logically iob sam pam svc flag available causes sequential access methods appendages bypassed enhancement first implemented svs retrofitted previous versions os significantly facilitated processing dataset already opened bsam bpam using xdap otherwise certain pre-svs sam pam appendages could cause random supervisor storage overlays presented certain xdap channel programs ibm guarantee system security data integrity pre-svs systems obvious circumvention utilize xdap channel programs also utilize rps rps-type xdap channel programs confusing sam pam appendages thereby leading random supervisor storage overlays | [
4361,
607,
8159,
5852,
3233,
7040,
5571,
5105,
6213,
7264,
7024,
7661,
2596,
4647,
1851,
7783
] | Test |
5,082 | 9 | Inline_expansion:inline expansion computing inline expansion inlining manual compiler optimization replaces function call site body called function inline expansion similar macro expansion occurs compilation without changing source code text macro expansion occurs prior compilation results different text processed compiler inlining important optimization complicated effects performance rule thumb inlining improve speed minor cost space excess inlining hurt speed due inlined code consuming much instruction cache also cost significant space survey modest academic literature inlining 1980s 1990s given jones marlow 1999 inline expansion similar macro expansion compiler places new copy function place called inlined functions run little faster normal functions function-calling-overheads saved however memory penalty function inlined 10 times 10 copies function inserted code hence inlining best small functions called often c++ member functions class defined within class definition inlined default need use inline keyword otherwise keyword needed compiler may ignore programmer ’ attempt inline function mainly particularly large inline expansion used eliminate time overhead excess time function called typically used functions execute frequently also space benefit small functions enabling transformation optimizations without inline functions compiler decides functions inline programmer little control functions inlined giving degree control programmer allows use application-specific knowledge choosing functions inline ordinarily function invoked control transferred definition branch call instruction inlining control drops directly code function without branch call instruction compilers usually implement statements inlining loop conditions loop bodies need lazy evaluation property fulfilled code compute loop conditions loop bodies inlined performance considerations another reason inline statements context functional programming languages inline expansion usually followed beta-reduction transformation programmer might inline function manually copy paste programming one-time operation source code however methods controlling inlining see preferable precipitate bugs arising programmer overlooks possibly modified duplicated version original function body fixing bug inlined function direct effect optimization improve time performance eliminating call overhead cost worsening space usage due duplicating function body code expansion due duplicating function body dominates except simple cases thus direct effect inline expansion improve time cost space however primary benefit inline expansion allow optimizations improved scheduling due increasing size function body better optimization possible larger functions ultimate impact inline expansion speed complicated due multiple effects performance memory system primarily instruction cache dominates performance modern processors depending specific program cache inlining particular functions increase decrease performance impact inlining varies programming language program due different degrees abstraction lower-level imperative languages c fortran typically 10–20 speed boost minor impact code size abstract languages significantly important due number layers inlining removes extreme example self one compiler saw improvement factors 4 55 inlining direct benefits eliminating function call primary benefit inlining however optimizations allows optimizations cross function boundaries done without requiring interprocedural optimization ipo inlining performed additional intra procedural optimizations global optimizations become possible enlarged function body example done without inlining require significantly complicated compiler linker case caller callee separate compilation units conversely cases language specification may allow program make additional assumptions arguments procedures longer make procedure inlined preventing optimizations smarter compilers glasgow haskell compiler track naive inlining loses information benefit inlining memory system direct cost inlining increased code size due duplicating function body call site however always namely case short functions function body smaller size function call caller including argument return value handling trivial accessor methods mutator methods getters setters function used one place case duplicated thus inlining may minimized eliminated optimizing code size often case embedded systems inlining also imposes cost performance due code expansion due duplication hurting instruction cache performance significant prior expansion working set program hot section code fit one level memory hierarchy e.g. l1 cache expansion longer fits resulting frequent cache misses level due significant difference performance different levels hierarchy hurts performance considerably highest level result increased page faults catastrophic performance degradation due thrashing program failing run last rare common desktop server applications code size small relative available memory issue resource-constrained environments embedded systems one way mitigate problem split functions smaller hot inline path fast path larger cold non-inline path slow path inlining hurting performance primarily problem large functions used many places break-even point beyond inlining reduces performance difficult determine depends general precise load subject manual optimization profile-guided optimization similar issue code expanding optimizations loop unrolling also reduces number instructions processed decrease performance due poorer cache performance precise effect inlining cache performance complicated small cache sizes much smaller working set prior expansion increased sequentiality dominates inlining improves cache performance cache sizes close working set inlining expands working set longer fits cache dominates cache performance decreases cache sizes larger working set inlining negligible impact cache performance changes cache design load forwarding offset increase cache misses compilers use variety mechanisms decide function calls inlined include manual hints programmers specific functions together overall control via command-line options inlining done automatically many compilers many languages based judgment whether inlining beneficial cases manually specified via compiler directives typically using keyword compiler directive called codice_1 typically hints inlining desired rather requiring inlining force hint varying language compiler typically compiler developers keep performance issues mind incorporate heuristics compilers choose functions inline improve performance rather worsening cases compiler decided inline particular function performing inlining operation usually simple depending whether compiler inlines functions across code different languages compiler inlining either high-level intermediate representation like abstract syntax trees low-level intermediate representation either case compiler simply computes arguments stores variables corresponding function arguments inserts body function call site linkers also function inlining linker inlines functions may inline functions whose source available library functions see link-time optimization run-time system inline function well run-time inlining use dynamic profiling information make better decisions functions inline java hotspot compiler simple example inline expansion performed hand source level c programming language inlining inlining note example actual c application would preferable use inlining language feature parameterized macros inline functions tell compiler transform code way next section lists ways optimize code assembler macros provide alternative approach inlining whereby sequence instructions normally generated inline macro expansion single macro source statement zero parameters one parameters might option alternatively generate one-time separate subroutine containing sequence processed instead inlined call function example range different heuristics explored inlining usually inlining algorithm certain code budget allowed increase program size aims inline valuable callsites without exceeding budget sense many inlining algorithms usually modeled knapsack problem decide callsites valuable inlining algorithm must estimate benefit -- i.e expected decrease execution time commonly inliners use profiling information frequency execution different code paths estimate benefits addition profiling information newer jit compilers apply several advanced heuristics traditionally languages c inline expansion accomplished source level using parameterized macros use true inline functions available c99 provides several benefits approach many compilers also inline expand recursive functions recursive macros typically illegal bjarne stroustrup designer c++ likes emphasize macros avoided wherever possible advocates extensive use inline functions inline expansion optimization since eliminates overhead calls much important enabling transformation compiler expands function body context call site—often arguments may fixed constants—it may able variety transformations possible example conditional branch may turn always true always false particular call site turn may enable dead code elimination loop-invariant code motion induction variable elimination c example previous section optimization opportunities abound compiler may follow sequence steps new function looks like complete inline expansion always possible due recursion recursively inline expanding calls terminate various solutions expanding bounded amount analyzing call graph breaking loops certain nodes i.e. expanding edge recursive loop identical problem occurs macro expansion recursive expansion terminate typically resolved forbidding recursive macros c c++ many compilers aggressively inline functions wherever beneficial although lead larger executables aggressive inlining nevertheless become desirable memory capacity increased faster cpu speed inlining critical optimization functional languages object-oriented programming languages rely provide enough context typically small functions make classical optimizations effective many languages including java functional languages provide language constructs inline functions compilers interpreters often perform aggressive inline expansion languages provide constructs explicit hints generally compiler directives pragmas ada programming language exists pragma inline functions functions common lisp may defined inline codice_1 declaration haskell compiler ghc tries inline functions values small enough inlining may noted explicitly using language pragma c c++ codice_1 keyword functions compiler directive – specifying inlining desired required – also changes visibility linking behavior visibility change necessary allow function inlined via standard c toolchain compilation individual files rather translation units followed linking linker able inline functions must specified header visible marked codice_1 avoid ambiguity multiple definitions | [
4573,
4662,
2633,
1445,
5203,
2460,
1361,
6002,
2740,
3188,
1180,
6186,
7541,
7005,
5312,
1854,
7460,
8106,
7474,
851,
2420,
6472,
5956,
336,
7416,
1435
] | Validation |
5,083 | 4 | Frank_W._Lewis:frank w. lewis frank waring lewis august 25 1912 – november 18 2010 american cryptographer cryptic crossword compiler puzzles printed nation 60 years total 2,962 puzzles leonard bernstein kurt vonnegut katha pollitt listed among fans puzzles lewis born august 25 1912 salt lake city utah father england lewis attended secretarial school university utah later earned degree absentia passed federal civil service test earned master degree music catholic university america washington d.c washington lewis worked government secretarial jobs world war ii lewis approached col. william f. friedman head u.s. army cryptography section looking smart people lewis hired civilian helped break code used coordinate japanese ships war joined national security agency nsa awarded decoration exceptional civilian service war department nsa may person two medals much work remains classified 1969 retired wife caribbean relocated massachusetts eruption montserrat volcano died november 18 2010 age 98 survived wife 74 years sylvia née shosteck six children lewis discovered british-style cryptic crosswords stationed war bletchley park code-breaking station england lewis took nation puzzle setter 1947 nation started running puzzles every week instead weekly starting 2008 public outcry great resumed printing puzzles weekly lewis published last puzzle nation december 2009 magazine began reprinting old ones lewis death magazine continued reprint old puzzles searched new puzzle setter | [] | Validation |
5,084 | 1 | LDAP_Account_Manager:ldap account manager ldap account manager web application managing various account types ldap directory written php contrast tools likephpldapadmin focus account based give user abstract view directory aims allow people little technical background manage ldap data base application licensed gnu general public license extended version available commercial license ldap account manager lam project founded february 2003 first developers michael dürgner roland gruber tilo lutz leonhard walchshäusl goal create application manage samba software accounts time samba supported ldap 2.x releases version 3 alpha stage gui manage lam version 0.4.10 samba accounts could managed year 2004 project started develop plugin architecture support account types first stable release new code lam 0.5.0 september 2005 commercial variant lam pro since 1.0.4 supports user self-service e.g change password telephone number ... also supports additional ldap objects e.g zarafa kerberos ppolicy ... important account types supported lam samba unix zarafa ppolicy user define profiles account types set default values account information exported pdf files also possibility create users via file upload also includes tree view phpldapadmin access raw ldap attributes lam translated 16 languages supported account types commercial version also includes user self-service allows users edit data register accounts reset passwords | [
4731,
6029
] | Test |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.