node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
4,085 | 9 | Robert_Bruce_Findler:robert bruce findler robert bruce findler colloquially known robby american computer scientist currently professor electrical engineering computer science northwestern university also member plt group responsible creation maintenance drracket addition drracket findler contributed numerous components racket supervises web-based software library called planet findler also leading team member programbydesign project findler received phd rice university direction matthias felleisen dissertation linguistics software contracts popularly known design contract work software contracts provides careful accounting blame thereby helping programmers quickly home faulty part software system addition drracket software contracts findler focuses design implementation workbench semantics engineers workbench called redex tool specifying executing reduction semantics programming language used programming language researchers us europe recently sun fortress research team used redex specify explore key parts language findler served semantics editor revised^6 report scheme programming language phd student jacob matthews developed redex model core semantics included appendix report appendix plays role standard ml formal specification milner tofte harper macqueen executable thus visualize individual examples | [
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,
4074,
6471,
7481,
2144,
2600,
154,
7298,
5515,
8025,
5077,
7032,
4543,
1889,
2156,
4999,
... | Test |
4,086 | 3 | Super_Cobra:super cobra super cobra horizontally scrolling shooter developed konami originally released coin-operated arcade game 1981 published konami japan march 1981 manufactured distributed stern north america june 22 1981 sequel 1981 scramble arcade game game commercial success selling 12,337 arcade cabinets united states four months october 2 1981 becoming stern third best-selling arcade classic berzerk scramble scramble sold 15,136 cabinets u.s. five months earlier year adding 27,473 u.s. cabinet sales super cobra widely ported parker brothers adventure vision standalone versions entex player controls helicopter tight caverns slightest misstep result loss life however unlike scramble game continued player left adding credits machine may usually offer option others n't player loses points upon continuing joystick accelerates decelerates moves moves helicopter uses laser bomb destroy defenders tanks ufos infiltrating 10 super cobra defense systems ship limited fuel supply depleted time fuel acquired destroying fuel tanks game game divided ten sections plus finale different style terrain different obstacles players navigate ten levels base must safely make level remove booty levels described follows intermission section game simply scrolls new terrain player destroys booty final level must start back beginning level booty safely carried away player starts back beginning first level cycle repeats second time levels tanks fire much aggressively fuel consumed much faster third subsequent times levels fuel consumed still faster faster rate fuel consumption second subsequent cycles may make difficult complete cycles without losing least one chopper due running fuel although compensated somewhat awarding extra chopper time cycle completed booty carried away game ported atari 2600 atari 5200 colecovision intellivision odyssey² atari 8-bit family parker brothers released also sord m5 msx entex adventure vision entex also made standalone tabletop version game arcade express november 1982 gave adventure vision port score 9 10 concluded takes real skill master represents state-of-the-art scrolling shoot-outs atari 2600 version awarded certificate merit category best action videogame 5th annual arkie awards 1983 compared vanguard said provides brand relentless multi-scenario action super cobra appeared alongside scramble retro compilation konami arcade classics released sony playstation 1999 made available microsoft defunct game room service march 24 2010 | [
1237
] | Test |
4,087 | 7 | Andrew_Project:andrew project andrew project distributed computing environment developed carnegie mellon university cmu beginning 1982 ambitious project time resulted unprecedentedly vast accessible university computing infrastructure information technology center partnership carnegie mellon ibm began work andrew project 1982 initial phase project involved software hardware including wiring campus data developing workstations distributed students faculty cmu elsewhere proposed 3m computer workstations included million pixel display megabyte memory running million instructions per second unfortunately cost order us 10,000 made computers beyond reach students budgets initial hardware deployment 1985 established number university-owned clusters public workstations various academic buildings dormitories campus fully wired ready eventual availability inexpensive personal computers early development within information technology center originally called vice vast integrated computing environment virtue virtue reached unix emacs focused centralized tools file server workstation tools including window manager editor email file system client code initially system prototyped sun microsystems machines ibm rt pc series computers running special ibm academic operating system people involved project included james h. morris nathaniel borenstein james gosling david s. h. rosenthal project extended several times 1985 order complete software renamed andrew andrew carnegie andrew mellon founders institutions eventually became carnegie mellon university mostly rewritten result experience early deployments andrew four major software components afs moved information technology center transarc 1988 ams fully decommissioned replaced cyrus imap server 2002 ibm funding ended andrew continued open source project named andrew user interface system auis set tools allows users create distribute documents containing variety formatted embedded objects open-source project run department computer science cmu andrew consortium governs maintains development distribution andrew user interface system andrew user interface system encompasses three primary components andrew user environment aue contains main editor help system user interface tools rendering multimedia embedded objects andrew toolkit atk contains formattable embeddable objects allows method developers design objects atk allows multi-level object embedding objects embedded one another example raster image object embedded spreadsheet object andrew message system ams provides mail bulletin board access allows user send receive organize mail well post read message boards version 6.3 following components auis wireless andrew first campus-wide wireless internet network built 1993 predating wi-fi branding wireless andrew 2-megabit-per-second wireless local area network connected access points wired andrew network high-speed ethernet backbone linking buildings across cmu campus wireless andrew consists 100 access points covering six buildings campus university tested current setup 40 mobile units allowing general use researchers students february 1997 | [
5125,
5275,
2704,
5705,
7457,
2900
] | Validation |
4,088 | 2 | DESQview:desqview desqview dv text mode multitasking operating environment developed quarterdeck office systems enjoyed modest popularity late 1980s early 1990s running top dos allowed users run multiple programs concurrently multiple windows quarterdeck predecessor desqview task switching product called desq shipped late april may 1984 allowed users switch running programs quarterdeck revamped package bringing multitasking adding topview compatibility desqview released july 1985 four months microsoft released first version windows widely thought first program bring multitasking windowing capabilities dos fact predecessor ibm topview shipped march 1985 desqview inherited pop-up menu desqview well-behaved dos programs could run concurrently resizable overlapping windows something first version ms windows could simple hideable menu allowed cutting pasting programs desqview provided support simple editable macros well quarterdeck also developed set optional utilities desqview including notepad dialer later versions allowed graphics mode programs loaded well run full screen mode desqview gui graphical user interface operating system rather non-graphical windowed shell ran real mode top dos although could run intel 8086- intel 80286-based pc could also use expanded memory add-ons work around 640 kb ram limit conventional memory early pcs desqview really came intel 80386 machines better utilizing memory dos limit however either case ran real mode rather protected mode meaning misbehaving program could still crash system make maximum use extended memory intel 80386 processors transforming expanded memory upper memory blocks umbs accessible desqview real-mode programs quarterdeck developed sophisticated memory manager owing foresight marketing manager quarterdeck marketed separate product qemm-386 quarterdeck expanded memory manager 386 became popular desqview sold steadily many years generating us 150 million sales 1987 1994 release intel pentium processor 386 qemm dropped combination package desqview qemm-386 called desqview 386 dv386 introduction 80386 memory management features enhanced allow system shifted protected mode also allowing addresses configured virtual 8086 mode extended memory could mapped addressing frames accessible real-mode programs dos allowed 386 implement lim lotus intel microsoft ems expanded memory specification memory manager easily controlled user dos program qemm.com desqview able use qemm features far beyond lim ems api mapping conventional address space 640 kb multiple extended memory blocks could execute transparently context main copy dos device networking drivers loaded desqview resulting space largest single program could run desqview qemm could run many instances programs ems would allow 8 mb system could generally dozen full-sized dos programs running concurrently 16 mb system could run twenty desqview noteworthy supported common dos-compatible programs achieved degree performance stability remarkable given constraints host operating system also clever interface generally unobtrusive quickly available easy learn normal pcs include keyboard three shift modifier keys control alt normal shift keys keys normally held combination keys desqview default monitored alt key isolated presses combination pressing alt key would bring desqview menu allowing access program features start new tasks switch among mark text screen paste text input current task resize move text windows configure new menu items etc addition shift+alt combination would cause desqview learn set keys macro allowed desqview run programs without interfering keybindings might using desqview critically acclaimed many fans never met mass appeal despite quarterdeck sustained efforts win people one area however desqview lasting success many multiuser bulletin board systems based thanks modest hardware requirements robust multitasking superlative handling multiple communication ports free inexpensive bbs software time ran single-node single-tasking dos program normally one copy bbs software could run limiting host pc running one node desqview allowed multiple copies single-task programs run computer allowing anyone even unimpressive hardware run large powerful multiuser bbs home desqview provide graphical user interface gui quarterdeck provide suites programming libraries utilities support development software use features never became widely popular desqview ability run software modification cost run-time licenses combined costs development suites made unreasonable combination commercial shrink-wrapped software publishers vendors microsoft released ms windows version 3.0 memory management multitasking features desqview far faster smaller stable expensive n't include support graphical features ms windows decline qemm started bundling memory manager digital research dr dos 5.0 released 1990 catch microsoft included emm386 ms-dos 5.0 previously memory management functionality available windows qemm could still used instead notably windows 3.1x provided incremental benefits sales qemm declined august 1994 three quarters losses company laid 25 employees ceo president founder terry myers resigned users moved desqview platforms notably windows 3.x os/2 third party utility authors wrote utility programs emulated desqview api functions allow suitably equipped dos programs co-operate os notable tame windows os/2speed os/2 quarterdeck eventually also released product named desqview/x dvx x window system server running dos desqview thus provided gui x software mostly unix could ported desqview/x three window managers launched x/motif open look twm default package contained twm others costly optional extras ability interact tcp/ip networks mosaic ported dvx dvx could serve dos programs 16-bit windows environment across network x programs made useful wished run dos windows programs unix workstations functionality available ncd wincenter internetworking company novell developed product called netware access server nas incorporating features desqview 386 pcanywhere desqview multitasking support used create environment 16 pc macintosh clients could login remotely access netware services run dos applications desqview development continued parallel desqview/x ceasing development desqview/x another version desqview released qemm still developed discontinuation desqview version compatible windows 98 released mid-1990s quarterdeck tried recast internet company releasing version mosaic web browser eventually company acquired symantec byte 1984 stated desq application compatibility highest five window managers tested magazine 1989 listed version 3.0 among distinction winners byte awards stating unlike os/2 desqview lets run programs 've already paid … many users find desqview need | [
1522,
7512,
4759,
6170,
5571,
5743,
126,
1648,
6634,
4061,
1668,
3137,
858,
5784
] | Validation |
4,089 | 0 | Optical_character_recognition:optical character recognition optical character recognition optical character reader ocr mechanical electronic conversion images typed handwritten printed text machine-encoded text whether scanned document photo document scene-photo example text signs billboards landscape photo subtitle text superimposed image example television broadcast widely used form information entry printed paper data records – whether passport documents invoices bank statements computerized receipts business cards mail printouts static-data suitable documentation – common method digitizing printed texts electronically edited searched stored compactly displayed on-line used machine processes cognitive computing machine translation extracted text-to-speech key data text mining ocr field research pattern recognition artificial intelligence computer vision early versions needed trained images character worked one font time advanced systems capable producing high degree recognition accuracy fonts common support variety digital image file format inputs systems capable reproducing formatted output closely approximates original page including images columns non-textual components early optical character recognition may traced technologies involving telegraphy creating reading devices blind 1914 emanuel goldberg developed machine read characters converted standard telegraph code concurrently edmund fournier d'albe developed optophone handheld scanner moved across printed page produced tones corresponded specific letters characters late 1920s 1930s emanuel goldberg developed called statistical machine searching microfilm archives using optical code recognition system 1931 granted usa patent number 1,838,389 invention patent acquired ibm advent smart-phones smartglasses ocr used internet connected mobile device applications extract text captured using device camera devices ocr functionality built operating system typically use ocr api extract text image file captured provided device ocr api returns extracted text along information location detected text original image back device app processing text-to-speech display 1974 ray kurzweil started company kurzweil computer products inc. continued development omni-font ocr could recognize text printed virtually font kurzweil often credited inventing omni-font ocr use companies including compuscan late 1960s 1970s kurzweil decided best application technology would create reading machine blind would allow blind people computer read text loud device required invention two enabling technologiesthe ccd flatbed scanner text-to-speech synthesizer january 13 1976 successful finished product unveiled widely reported news conference headed kurzweil leaders national federation blind 1978 kurzweil computer products began selling commercial version optical character recognition computer program lexisnexis one first customers bought program upload legal paper news documents onto nascent online databases two years later kurzweil sold company xerox interest commercializing paper-to-computer text conversion xerox eventually spun scansoft merged nuance communications research group headed a. g. ramakrishnan medical intelligence language engineering lab indian institute science developed printtobraille tool open source gui front end used ocr convert scanned images printed books braille books 2000s ocr made available online service webocr cloud computing environment mobile applications like real-time translation foreign-language signs smartphone various commercial open source ocr systems available common writing systems including latin cyrillic arabic hebrew indic bengali bangla devanagari tamil chinese japanese korean characters ocr engines developed many kinds domain-specific ocr applications receipt ocr invoice ocr check ocr legal billing document ocr used ocr generally offline process analyses static document handwriting movement analysis used input handwriting recognition instead merely using shapes glyphs words technique able capture motions order segments drawn direction pattern putting pen lifting additional information make end-to-end process accurate technology also known on-line character recognition dynamic character recognition real-time character recognition intelligent character recognition ocr software often pre-processes images improve chances successful recognition techniques include segmentation fixed-pitch fonts accomplished relatively simply aligning image uniform grid based vertical grid lines least often intersect black areas proportional fonts sophisticated techniques needed whitespace letters sometimes greater words vertical lines intersect one character two basic types core ocr algorithm may produce ranked list candidate characters matrix matching involves comparing image stored glyph pixel-by-pixel basis also known pattern matching pattern recognition image correlation relies input glyph correctly isolated rest image stored glyph similar font scale technique works best typewritten text work well new fonts encountered technique early physical photocell-based ocr implemented rather directly feature extraction decomposes glyphs features like lines closed loops line direction line intersections extraction features reduces dimensionality representation makes recognition process computationally efficient features compared abstract vector-like representation character might reduce one glyph prototypes general techniques feature detection computer vision applicable type ocr commonly seen intelligent handwriting recognition indeed modern ocr software nearest neighbour classifiers k-nearest neighbors algorithm used compare image features stored glyph features choose nearest match software cuneiform tesseract use two-pass approach character recognition second pass known adaptive recognition uses letter shapes recognized high confidence first pass recognize better remaining letters second pass advantageous unusual fonts low-quality scans font distorted e.g blurred faded ocr result stored standardized alto format dedicated xml schema maintained united states library congress list optical character recognition software see comparison optical character recognition software ocr accuracy increased output constrained lexicona list words allowed occur document might example words english language technical lexicon specific field technique problematic document contains words lexicon like proper nouns tesseract uses dictionary influence character segmentation step improved accuracy output stream may plain text stream file characters sophisticated ocr systems preserve original layout page produce example annotated pdf includes original image page searchable textual representation near-neighbor analysis make use co-occurrence frequencies correct errors noting certain words often seen together example washington d.c. generally far common english washington doc knowledge grammar language scanned also help determine word likely verb noun example allowing greater accuracy levenshtein distance algorithm also used ocr post-processing optimize results ocr api recent years major ocr technology providers began tweak ocr systems deal efficiently specific types input beyond application-specific lexicon better performance may taking account business rules standard expression rich information contained color images strategy called application-oriented ocr customized ocr applied ocr license plates invoices screenshots id cards driver licenses automobile manufacturing new york times adapted ocr technology proprietary tool entitle document helper enables interactive news team accelerate processing documents need reviewed note enables process amounts many 5,400 pages per hour preparation reporters review contents several techniques solving problem character recognition means improved ocr algorithms special fonts like ocr-a ocr-b micr fonts precisely specified sizing spacing distinctive character shapes allow higher accuracy rate transcription bank check processing ironically however several prominent ocr engines designed capture text popular fonts arial times new roman incapable capturing text fonts specialized much different popularly used fonts google tesseract trained recognize new fonts recognize ocr-a ocr-b micr fonts comb fields pre-printed boxes encourage humans write legiblyone glyph per box often printed dropout color easily removed ocr system palm os used special set glyphs known graffiti similar printed english characters simplified modified easier recognition platform computationally limited hardware users would need learn write special glyphs zone-based ocr restricts image specific part document often referred template ocr crowdsourcing humans perform character recognition quickly process images like computer-driven ocr higher accuracy recognizing images obtained computers practical systems include amazon mechanical turk recaptcha national library finland developed online interface users correct ocred texts standardized alto format crowd sourcing also used perform character recognition directly invite software developers develop image processing algorithms example use rank-order tournaments commissioned u.s. department energy doe information science research institute isri mission foster improvement automated technologies understanding machine printed documents conducted authoritative annual test ocr accuracy 1992 1996 recognition latin-script typewritten text still 100 accurate even clear imaging available one study based recognition 19th- early 20th-century newspaper pages concluded character-by-character ocr accuracy commercial ocr software varied 81 99 total accuracy achieved human review data dictionary authentication areas—including recognition hand printing cursive handwriting printed text scripts especially east asian language characters many strokes single character —are still subject active research mnist database commonly used testing systems ability recognise handwritten digits accuracy rates measured several ways measured greatly affect reported accuracy rate example word context basically lexicon words used correct software finding non-existent words character error rate 1 99 accuracy may result error rate 5 95 accuracy worse measurement based whether whole word recognized incorrect letters example difficulties inherent digitizing old text inability ocr differentiate long f characters web-based ocr systems recognizing hand-printed text fly become well known commercial products recent years see tablet pc history accuracy rates 80 90 neat clean hand-printed characters achieved pen computing software accuracy rate still translates dozens errors per page making technology useful limited applications recognition cursive text active area research recognition rates even lower hand-printed text higher rates recognition general cursive script likely possible without use contextual grammatical information example recognizing entire words dictionary easier trying parse individual characters script reading amount line cheque always written-out number example using smaller dictionary increase recognition rates greatly shapes individual cursive characters simply contain enough information accurately greater 98 recognize handwritten cursive script programs allow users set confidence rates means software achieve desired level accuracy user notified manual review characters support ocr added unicode standard june 1993 release version 1.1 characters mapped fonts specific micr ocr-a ocr-b | [
3601,
1718,
458,
1444,
7331,
4760,
8065,
715,
7431,
7436,
4940,
7539,
6102,
5304,
5486,
6015,
2214,
2215,
1751,
3292,
740,
7372,
4337,
6645,
3807,
3651,
4349,
7202,
5773,
4267,
1314,
2961,
5429,
4821,
5781,
5528,
5612,
5183,
7138,
5885,
... | Test |
4,090 | 3 | Socket_FM1:socket fm1 socket fm1 cpu socket desktop computers used llano processors llano-derived athlon ii processors released july 2011 direct successors socket fm2 september 2012 socket fm2+ january 2014 socket am1 january 2014 targeting low-power socs available chipsets consult fusion controller hubs fch apu using socket fm1 amd platform please consult list amd accelerated processing units concrete product denominations | [
2539,
6599,
2541,
5895,
4931,
7163,
2997,
1735,
3362,
2016,
5377,
6351,
913,
7826,
4694,
2751,
6545,
6373,
1961,
5063,
6655,
6562,
7484,
6307,
3145,
866,
5436,
780,
1143,
7782,
2172
] | Test |
4,091 | 4 | Novell_BorderManager:novell bordermanager bordermanager multi purpose network security application developed novell inc. bordermanager designed proxy server firewall vpn access point novell announced migration superlumin 4.0 proxy cache novell preferred firewall proxy solution netware customers upgrading novell open enterprise server linux bordermanager designed run top netware kernel takes advantage fast file services netware kernel delivers aside easily copied firewall vpn access point services novell designed proxy services retrieve web data server server connection rather client server connection prior proxy servers market done retrieval method along netware fast file io proprietary code made bordermanager proxy engine one fastest existence 2003 novell announced successor product netware open enterprise server oes first released march 2005 oes completes separation services traditionally associated netware i.e file print makes possible customer choose netware linux kernel services run time novell announced end development netware kernel numerous public private statements 64-bit future netware linux path 64-bit computing oes follow migration path novell began porting applications linux company began looking alternate ways deliver services firewall vpn access point services equivalent functionality readily available free/open-source community also basic proxy services well i.e squid desire deliver functional equivalent could done full software code port much cache engine sold part volera excelerator novell holds great desire use create open-source software basic services novell entered agreement astaro relabel astaro security gateway license novell security manager product removed novell price list 15 february 2007 late summer 2006 novell announced would bordermanager 3.9 release novell brainshare conference 2010 novell announced superlumin 4.0 proxy cache path forward bordermanager customers also announced extended bordermanager general support two years march 7 2012 give customers adequate time make move november 2011 novell support lifecycle page states border manager 3.9 general support extended september 30 2013 make easy customers plan execute upgrade novell open enterprise server upgrade path border manager remains superlumin nemesis third-party filtering solutions available novell bordermanager following companies | [
1249,
3165,
1809,
4759,
806,
994,
3185,
4492,
7351,
4138,
385,
7536,
651,
2296,
2746,
6107,
578,
3637,
8100,
6456,
3551,
1291,
7275,
7744,
8043,
3394,
2680,
6560,
4977,
7289,
7478,
3223,
3484,
6842,
4632,
2790,
7683,
6235,
6149,
6951,
3... | Test |
4,092 | 3 | Xputer:xputer xputer design reconfigurable computer proposed computer scientist reiner hartenstein hartenstein uses various terms describe various innovations design including config-ware flow-ware morph-ware anti-machine xputer represents move away traditional von neumann computer architecture coarse-grained soft arithmetic logic unit alu architecture parallelism achieved configurable elements known reconfigurable datapath arrays rdpa organized two-dimensional array alu similar kressarray xputer architecture data-stream-based counterpart instruction-based von neumann computer architecture xputer architecture one first coarse-grained reconfigurable architectures consists reconfigurable datapath array rdpa organized two-dimensional array alus rdpu bus-width alu 32-bit first version xputer alus also known rdpus used computing single mathematical operation addition subtraction multiplication also used purely routing alus mesh-connected via three types connections data-flow along connections managed address generation unit programs xputer written c language compiled usage xputer using codex compiler written author codex compiler maps suitable portions c program onto xputer rdpa fabric remainder program executed host system personal computer reconfigurable datapath array rdpa semiconductor device containing reconfigurable data path units programmable interconnects first proposed rainer kress 1993 university kaiserslautern instead fpgas field-programmable gate arrays single bit configurable logic blocks clbs rdpas multiple bits wide instance 32 bit path width reconfigurable datapath units rdpus rdpu configured perform individual function rdpus interconnects programmed manufacturing process customer/designer hence term reconfigurable rdpa perform whatever complex computation needed rdpus multiple bits wide instance 32 bits talk coarse-grained reconfigurability contrast fpgas single-bit wide configurable logic blocks called fine-gained reconfigurable rdpas structurally programmed config-ware source code compiled pipe-networks mapped onto rdpa rdpas instruction-stream-driven instruction fetch run time rdpus program counter | [
3365,
4864,
1556,
3156,
2659,
7777,
5936,
4703,
1435,
8024
] | Train |
4,093 | 5 | Token_bus_network:token bus network token bus network implementing token ring protocol virtual ring coaxial cable token passed around network nodes node possessing token may transmit node n't anything send token passed next node virtual ring node must know address neighbour ring special protocol needed notify nodes connections disconnections ring due difficulties handling device failures adding new stations network token ring gained reputation unreliable difficult upgrade bus networks ethernet flexible reliable physical architecture ethernet access protocol could absolutely guarantee maximum time station would wait access network thought unsuitable manufacturing automation applications token bus protocol created combine benefits physical bus network deterministic access protocol token ring network token bus standardized ieee standard 802.4 mainly used industrial applications token bus used general motors manufacturing automation protocol map standardization effort application concepts used token ring networks main difference endpoints bus meet form physical ring order guarantee packet delay transmission token bus protocol modified token bus proposed manufacturing automation systems flexible manufacturing system fms means carrying internet protocol ieee 802 networks including token bus networks developed ieee 802.4 working group disbanded standard withdrawn ieee | [
7052,
1618,
6071,
4926,
823,
4321,
3105,
5387,
7824,
309,
2659,
3799,
2672,
3724,
2057,
7209,
2061,
3821,
1974,
3230,
1988,
7777,
4836,
2714
] | Test |
4,094 | 2 | Open_Transport:open transport open transport name given apple inc. implementation unix-originated system v streams networking stack based code licensed mentat portable streams product open transport built provide classic mac os modern tcp/ip implementation replacing mactcp apple also added implementation appletalk stack support legacy networks prior release open transport classic mac os used variety stand-alone inits provide networking functionality one widely used throughout os appletalk system among protocol stacks supported mactcp becoming increasingly important internet boom started gain momentum mactcp emulated berkeley sockets system widely used among unix-like operating systems mactcp previous generation appletalk library slow powerpc-based macintoshes written previous generation 680x0-based macintoshes therefore ran emulation powerpc-based machines mactcp also lacking features however major upgrade clearly needed apple keep hand internet market late 1980s several major efforts re-combine many unix derivatives single system underway significant among t-led system v. system v included entirely new networking stack streams replacing existing berkeley sockets system streams number advantages sockets including ability support multiple networking stacks time ability plug modules middle existing stacks provide simple mechanisms filtering similar duties offering single application programming interface user programs time appeared streams would become de facto standard change market led apple move support streams well also presented two practical advantages company streams multiprotocol support would allow support tcp/ip appletalk single interface portable cross-platform version streams available purchase commercially one included high-quality tcp implementation using streams also appeared offer way one microsoft whose tcp/ip networking system winsock based apparently soon-to-be-obsolete sockets open transport introduced may 1995 power mac 9500 included system 7.5.2 release new pci based power macs became available older hardware later mactcp supported pci-based macs older systems could switch mactcp open transport using control panel called network software selector unlike mactcp open transport allowed users save switch configuration sets developer opinion open transport divided felt offered enormous speed improvements mactcp developers also liked flexible way allowed protocols stacked apply filters duties however system also large complex flexibility open transport architecture one could plug desired protocol felt thoroughly overcomplicated additionally unix code still used sockets streams mactcp offered real advantages terms porting software mac vaunted flexibility open transport architecture undermined ultimately made obsolete rapid rise tcp/ip networking mid-90s true wider unix market system v undermined rapid rise free unix-like systems notably linux systems grew popularity vast majority programmers ignored closed streams favour bsd-licensed sockets open transport abandoned move os x derived bsd networking stack based entirely sockets open transport received deprecation status starting mac os x 10.4 sdks open transport support removed entirely os x starting version 10.9 mavericks | [
405,
3908,
4453,
3062,
2118,
578,
4175,
3072
] | Test |
4,095 | 4 | National_Information_Assurance_Partnership:national information assurance partnership national information assurance partnership niap united states government initiative meet security testing needs information technology consumers producers operated national security agency nsa originally joint effort nsa national institute standards technology nist long-term goal niap help increase level trust consumers information systems networks use cost-effective security testing evaluation validation programs meeting goal niap seeks principal objective niap validation body ensure provision competent security evaluation validation services government industry validation body ultimate responsibility operation ccevs accordance policies procedures appropriate interpret amend policies procedures nsa responsible providing sufficient resources validation body may carry responsibilities validation body led director deputy director selected nsa management director validation body reports niap director administrative budgetary matters nsa certificate-issuing authorities ccevs related operational matters general director deputy director serve two-year term service term service may extended discretion nsa management also significant number technical administrative support personnel required provide full range validation services sponsors evaluations common criteria testing laboratories cctl personnel include validators technical experts various technology cells senior members technical staff security community oversight board validation body ensures appropriate mechanisms place protect interests parties within ccevs participating process security evaluation dispute brought forth participating party i.e. sponsor evaluation product protection profile developer cctl concerning operation ccevs associated activities shall referred validation body resolution disputes involving validation body nsa management attempt resolve dispute procedures agreed upon two organizations | [
4608,
6208,
1959,
3003
] | Test |
4,096 | 5 | X_video_extension:x video extension x video extension often abbreviated xvideo xv video output mechanism x window system protocol designed david carver specification version 2 protocol written july 1991 mainly used today resize video content video controller hardware order enlarge given video watch full screen mode without xvideo x would scaling main cpu requires considerable amount processing power could slow degrade video stream video controllers specifically designed kind computation much cheaply similarly x video extension video controller perform color space conversions change contrast brightness hue displayed video stream order work three things come together modern video controllers provide functions required xvideo feature known hardware scaling yuv acceleration sometimes 2d hardware acceleration xfree86 x display server implemented xvideo since version 4.0.2 check whether given x display server supports xvideo one use utility xdpyinfo check whether video controller provides required functions whether x device driver implements xvideo one use xvinfo program video playback programs run x window system mplayer mythtv xine typically option enable xvideo output advisable switch option system gpu video-hardware device drivers supports xvideo modern rendering systems opengl vdpau unavailable – speedup noticeable even fast cpu protocol features reading writing video streams video adapters practice today functions xvputimage xvshmputimage used client program repeatedly prepares images passes graphics hardware scaled converted displayed video scaled prepared display video card must displayed possible ways display accelerated video stage since full acceleration means video controller responsible scaling converting drawing video technique used depends entirely video drawn onto x video finally drawn depends largely x window manager use properly installed drivers gpu hardware supported intel ati nvidia chip sets window managers called compositing window managers allow windows separately processed rendered composited involves windows rendered separate output buffers memory first later combined form complete graphical interface video memory individual windows transformed separately accelerated video may added stage using texture filter window composited drawn xvideo also used accelerate video playback drawing windows using opengl framebuffer object pbuffer metacity x window manager uses compositing way compositing also make use 3d pipelines accelerations glx_ext_texture_from_pixmap among things process allows many video outputs share screen without interfering compositing window managers compiz also use compositing however system limited opengl acceleration function specifically lack opengl framebuffer object pbuffer use opengl environment like xgl makes xv hardware accelerations impossible event window manager n't directly support compositing difficult isolate video stream rendered time accelerated output already turned single image way usually employ post processed hardware overlay using chroma keying windows already drawn pieces information available size position video window canvas third piece information required indicate parts video window canvas obscured windows therefore video player draws canvas using solid color 'll say green color becomes makeshift third dimension windows drawn windows covering video player block green color video stream added output graphics card simply scan co-ordinates canvas encounters green knows found visible portion video window draws portions video process also available option render hardware accelerated video microsoft windows xp earlier since window management features deeply embedded operating system accelerating would impossible window manager n't support compositing post processed hardware overlays using chroma keying described previous paragraph make impossible produce proper screenshots xvideo applications also make impossible view kind playback secondary display one overlay allowed hardware level | [
7442,
6414,
6055,
1138,
305,
5103,
1237,
1822,
8022,
6665
] | Test |
4,097 | 9 | Prince_(software):prince software prince formerly prince xml proprietary software program converts xml html documents pdf files applying cascading style sheets css technology electronic publishing dynamic data-driven pdf generation enables replacing xsl-fo frameworks css3 ones developed yeslogic small company based melbourne australia marketed professional xml+css3 pdf solution received positive reviews considered unique product 2000s april 2003 prince 1.0 released basic support xhtml cascading style sheets css scalable vector graphics svg arbitrary xml first version command-line program supported microsoft windows linux graphical user interface windows yet subsequent releases css support steadily extended comparable web browsers opera mozilla firefox also expanded support additional platforms—the latest offering include packages apple mac freebsd solaris platforms december 2005 prince 5.1 passed acid2 test web standards project third user agent pass test safari konqueror prince developed using mercury functional logic programming language main driving force behind prince standard css3-paged integrates paged media including pdf layout specification w3c technologies html4 html5 xhtml free xml working javascript sources | [
2451,
5984,
740,
3420,
4575,
4759,
5571,
4126,
2706,
6015,
578,
1496,
6221
] | Test |
4,098 | 3 | List_of_Intel_CPU_microarchitectures:list intel cpu microarchitectures following partial list intel cpu microarchitectures list incomplete additional details found intel tick-tock model process-architecture-optimization model | [
2449,
2814,
5802,
6332,
6698,
6793,
4847,
3942,
3849,
4765,
6170,
3443,
6344,
1265,
6616,
1465,
7449,
7453,
3020,
7364,
3717,
3803,
6647,
1867,
3565,
4985,
766,
858,
2248,
691,
5343,
6772,
6057,
4098,
352,
6152,
2351,
2977,
4108,
2172
] | Validation |
4,099 | 3 | DECstation:decstation decstation brand computers used dec refers three distinct lines computer systems—the first released 1978 word processing system latter widely known two released 1989 comprised range computer workstations based mips architecture range pc compatibles mips-based workstations ran ultrix dec-proprietary version unix early releases osf/1 first line computer systems given decstation name word processing systems based pdp-8 systems built vt52 terminal also known vt78 second completely unrelated line decstations began decstation 3100 released 11 january 1989 decstation 3100 first commercially available risc-based machine built dec line decstations fruit advanced development skunkworks project carried dec palo alto hamilton ave facility known pmax project focus produce computer systems family economics performance compete likes sun microsystems risc-based unix platforms day brainchild james billmaier mario pagliaro armando stettner joseph dinucci systems family also employ truly risc-based architecture compared heavier cisc vax still development prism architectures time dec mostly known cisc systems including successful pdp vax lines several architectures considered intel motorola others group quickly selected mips line microprocessors early mips microprocessors supported big- little-endian modes configured hardware reset little-endian mode chosen match byte ordering vax-based systems growing number intel-based pcs computers contrast vax later dec alpha architectures decstation 3100 family specifically designed built run unix system ultrix version vms operating system ever released decstations one issues debated project inception whether dec could sustain grow compete architecture invent manage core advocates later left company mips-based line computers shut favor alpha-based computers dec invented owned architecture descended prism development work first generation commercially marketed dec alpha systems dec 3000 axp series similar respects contemporaneous mips-based decstations sold alongside alpha systems decstation line gradually phased used turbochannel expansion bus video network cards well sold turbochannel option modules mice monitors keyboards later decstations planned based ecl-based r6000 canceled 14 august 1990 bipolar integrated technology failed deliver sufficient volumes microprocessor difficult fabricate yields r6000 reduced dec required little-endian mode used beginning continue available mips-based decstations used first target system development platform mach microkernel well early development windows nt operating system shortly prior release dec alpha systems port osf/1 decstation completed commercially released recently various free operating systems netbsd linux/mips ported mips-based decstations extending useful life providing modern operating system gxemul project emulates several decstation models original mips-based decstation 3100 followed cost reduced 2100 decstation 3100 claimed world fastest unix workstation time introduced three times fast vaxstation 3100 introduced time server configurations decstation models distributed without framebuffer graphics accelerator turbochannel q-bus based called decsystem confused pdp-10 machines name early models decstation heavily integrated systems little expansion capability even possess expansion buses decstation 5000 systems introduced later improved lack expansion capabilities providing turbochannel interconnect decstation 5000 systems also arc advanced risc computing compatible last decstation models focused increased component integration using custom asics reduce number discrete components begun decstation 5000 model 240 replaced discrete components lsi asics ended last model decstation 5000 model 260 used single vlsi asic much control logic packaged decstation 5000 systems sometimes suffixed two three letters letters refer graphics option system decstation 3100 2100 uses r2000 processor r2010 floating point coprocessor four r2020 write buffers r2000 uses external 64 kb direct-mapped instruction cache 64 kb direct-mapped write-through data cache cache line size four bytes four r2020 implement four-stage write buffer improve performance permitting r2000 write write-through data cache without stalling r2000 microprocessor could configured run either big-endian little-endian mode decstation family decision made run little-endian maintain compatibility vax family growing population intel-based pc decstation 3100 2100 memory system contains dram-based system memory vram-based framebuffers amount system memory supported 4 24 mb organized six physical memory banks systems 12 simm slots use 2 mb simms simm containing 1,048,576 word × 18-bit drams simms installed pairs increments 4 mb memory system byte-parity protected monochrome framebuffer implemented 256 kb vfb01 simm color framebuffer 1 mb vbf02 simm one framebuffer simms present framebuffer used simm slots rated 25 removal insertion cycles five recommended limit graphics capability provided two frame buffer modules monochrome color frame buffer monochrome frame buffer supports 1-bit color resolution 1024 × 864 pixels color frame buffer supports 8-bit color resolution monochrome frame buffer frame buffers use brooktree bt478 ramdac three 256-entry 8-bit color maps hardware cursor generated dc503 pcc programmable cursor chip provide 16 × 16 pixel 2-bit color cursor color frame buffer 8-bit write mask used select pixel updated none framebuffers use memory provided frame buffer module color frame buffer vram organized 2048 × 1024 pixels monochrome frame buffer 1024 × 1024 leftmost pixels displayed color frame buffer topmost pixels monochrome frame buffer unused areas vram may used store graphical structures fonts frame buffers parity-protected unlike rest system memory db15 male connector used video connector uses rs343a/rs170 compatible signals decstations onboard 10 mbit/s ethernet provided amd 7990 lance local area network controller ethernet amd 7992 sia serial interface adapter implements interface bnc thinwire ethernet connector 32 768 word × 16-bit 64 kb network buffer constructed srams provided improve performance 32 word 8-bit ethernet station address rom esar provides mac address mounted dip socket removable 5 mb/s single-ended scsi interface provided dc7061 sii gate array 64 k 16-bit 128 kb scsi buffer used improve performance decstations provide internal storage scsi interface connected external port honda68 male connector connected drive expansion boxes systems four asynchronous serial lines provided dc7085 gate array four serial lines third line required modem control signals support modem 4-pin mmj connector provided keyboard line 7-pin din connector mouse line two 6-pin mmj connectors printer modem lines real time clock motorola mc146818 also 50 bytes ram storing console configuration information 256 kb rom storing boot-strap self-test software provided two 128 kb roms dip sockets enclosure used decstation 3100 2100 identical enclosure used vaxstation 3100 systems use mechanically identical system module enclosure accommodate two 3.5-inch drives mounted trays system module system module located left enclosure power supply takes fourth space inside enclosure located left personal decstation 5000 series entry-level workstations code named maxine personal decstation uses low-profile desktop case contained power supply left two mounts two fixed drives one fixed drive one diskette drive front system logic contained two printed circuit boards base system module contained majority logic cpu module contained processor three models cpu module contains cpu subsystem first model contains chipset consisting 20 25 33 mhz r3000a cpu r3010 fpu accompanied 64 kb instruction cache 64 kb data cache caches direct-mapped 4-byte cache line data cache write components cpu module operate clock frequency r300a cpuctl asic also present purpose provide interfacing buffering faster cpu module slower 12.5 mhz system module cpuctl asic also implements 12.5 mhz turbochannel serves system interconnect second model revised version first module 20 25 mhz r3000a r3010 used plastic packaging whereas previous model used ceramic packaging third model contains r4000 microprocessor internal instruction data caches complemented 1 mb secondary cache systems 8 mb onboard memory four simm slots used expand amount memory 32 mb total 40 mb memory simm slots accept 2 8 mb simms pairs simms system must size memory bus 40 bits wide 32 bits used data four bits used byte-parity memory control asic controls memory communicates cpu subsystem via turbochannel bus expansion provided two turbochannel slots 64 mb physical address space personal decstation features integrated 8-bit color frame buffer capable resolution 1024 × 768 refresh rate 72 hz frame buffer consists 1 mb vram organized 262,144 32-bit words 32-bit word containing four 8-bit pixels frame buffer uses inmos ims g332 ramdac 256-entry 24-bit color look table selects 256 colors display palette 16,777,216 frame buffer treated part memory subsystem i/o subsystem provides system 8-bit single-ended scsi bus 10 mbit/s ethernet serial line serial desktop bus analog audio scsi provided ncr 53c94 asc advanced scsi controller ethernet provided amd am7990 lance local area network controller ethernet amd am7992 sia serial interface adapter implements aui interface single serial port capable 50 19,200 baud full modem control capability provided zilog z85c30 scc serial communications controller analog audio isdn support provided amd 79c30a dsc digital subscriber controller devices connected ioctl asic via two 8-bit buses one 16-bit bus asic interfaces subsystem turbochannel interconnect decstation 5000 model 100 series code named 3min mid-range workstations early models used chipset consisting r3000a cpu r3010 cpu 3- 5-inch daughter card plugs connector system module model 150 replaces r3000a r3010 single r4000 integrated fpu model 120 125 two external caches 64 kb instruction cache 64 kb data cache model 133 128 kb instruction cache systems support 16 128 mb memory 16 simm slots accept 2 8 mb simms one type simm may used 2 8 mb simms mixed system 2 mb simm identical simm used decstation 2100 3100 allowing upgrades older systems model 100 series reuse old memory three turbochannel option slots provided model 100 series introduces i/o controller asic later known ioctl asic interfaces two 8-bit i/o buses 12.5 mhz turbochannel decstation 200 series high-end workstations server configurations decstation 500 model 200 240 260 known decsystem 5000 model 200 240 260 respectively systems contain cpu module system module power supply located left side enclosure internal storage capability drives intended installed external single- multiple-drive enclosures enclosures connected system via scsi connector located rear system alternatively storage provided file server accessed network member model 200 series unique cpu subsystem model 200 cpu subsystem located kn02 system module contains chipset composed r3000 cpu r3010 fpu r3220 mb six-stage write/memory buffer also part subsystem processor external 64 kb instruction cache 64 kb write-through data cache contrast model 240 cpu subsystem located daughter card cpu module use processor chipset featuring single 40 mhz r3400 instead r3400 integrates r3000a cpu r3010 fpu single die package processor external 64 kb instruction cache 64 kb data cache connected r3400 40 mhz bus also serves datapath mb asic model 260 cpu subsystem also located cpu module daughter card features 120 mhz 60 mhz external r4000 internal instruction data caches external secondary cache model 260 cpu subsystem unique model 200 series contains boot rom firmware unlike members boot rom located system module difference due r4000 requiring different firmware could replaced upgrading model 240 model 260 model 200 series 15 simm slots located system module hold 8 480 mb memory proprietary 128-pin memory array modules simms capacities 8 mb 39 1 mbit dram chips 32 mb 39 4 mbit dram chips used simms installed system must size 8 mb simms used system may contain 8 120 mb memory 32 mb simms used system may contain 32 480 mb memory memory subsystem operates 25 mhz 32 bits wide match native word length r3000 memory subsystem protected ecc scheme seven bits check every 32-bit transaction simms two-way interleaved using low-order method even odd memory addresses treated separate banks memory interleaving memory subsystem doubles bandwidth non-interleaved memory subsystem using drams allowing model 200 series achieve effective maximum bandwidth 100 mb/s optional 1 mb nvram module provides disk cache improve performance installed one simm slots slot 14 simm slot closest front edge system module module uses battery prevent data lost case power failure module useful optional software installed model 200 uses discrete components implement memory subsystem logic model 240 discrete components replaced three asics mb asic mt asic ms asic mb memory buffer asic serves interface 40 mhz cpu module domain 25 mhz system module domain connected mt asic serves memory controller mt asic provides memory control refresh handles memory dma transactions ecc checking ms memory strobe asic provides 15 sets memory control lines routes memory control signals mt asic destination simm ms asic replaces 16 discrete components used model 200 also generates 25 mhz system clock signal replacing three discrete components used model 200 model 200 series uses turbochannel interconnect expansion models three turbochannel option slots model 200 provides 4 mb physical address space turbochannel option model 240 260 provides 8 mb turbochannel model 240 260 clocked 25 mhz model 240 260 mt asic implements turbochannel serves controller model 200 i/o subsystem significantly different model 240 260 i/o subsystem model 200 ethernet scsi capabilities provided two integrated turbochannel option modules pmad-aa ethernet pmaz-aa scsi pmad-aa uses amd 7990 lance local area network controller ethernet provides 10base-t ethernet interface implemented amd 7992 sia serial interface adapter bnc thinwire connector 8-bit single-ended scsi bus provided ncr 53c94 asc advanced scsi controller integrated option modules 128 kb sram serving buffer improve performance four serial lines also provided keyboard mouse communications port printer lines implemented two dc7085s dallas semiconductor ds1287 real time clock 50 bytes nvram also featured 256 kb system boot-strap diagnostic rom socket contrast model 240 260 i/o subsystem based around i/o controller asic serves bridge turbochannel two i/o buses implements i/o devices two zilog z85c30 sccs serial communications controller ncr 53c94 asc amd 7990 lance dallas semiconductor ds1287 real time clock system rom connected i/o buses i/o controller asic introduced model 240 first featured model 100 series asic used model 240 differs clocked twice high 25 mhz instead 12.5 mhz model 240 i/o subsystem would later used dec 3000 axp modified form decstation systems turbochannel slots could use turbochannel-based framebuffers 2d graphics accelerators 3d graphics accelerators options pxg variants capable either 8-bit 24-bit color resolution 1280 × 1024 refresh rate either 66 72 hz pxg also 8-bit 24-bit z-buffer double buffered color depth depth z-buffer extended installing additional vsimms z-buffer modules module pxg turbo variants capable 24-bit color resolution 1280 × 1024 refresh rate either 66 72 hz differ featuring 24-bit buffer storing off-screen pixmaps addition 24-bit z-buffer double buffer 3d graphics accelerators implemented digital proprietary pixelstamp architecture derived two research projects pixel planes university north carolina 8 8 display carnegie-mellon university pixelstamp architecture geometry pipeline consists dma engine geometry engine pixelstamp dma engine interfaces pipeline system via turbochannel receiving packets cpu sending geometry engine geometry engine consists amount sram intel i860 packets dma engine stored sram processed i860 writes results fifo pixelstamp consists stic stamp interface chip asic one two stamp asics stic fetches results fifo passes stamp asic performs scan conversion graphical functions data processed stamp asics final result consists rgb data written framebuffer built vsimms simm vrams located graphics accelerator option module displayed graphics accelerators grouped two distinct categories double-width options triple-width options pxg pxg+ double-width turbochannel option modules pxg turbo pxg turbo+ triple-width turbochannel option modules models suffixed higher performance models base model 44 mhz i860 instead 40 mhz i860 stic stamp asics operate clock frequencies 33 higher models suffixed turbo differ featuring 256 kb sram two stamp asics instead 128 kb sram one stamp asic models known lo 3d graphics accelerator lo 3d plus graphics accelerator upgraded mid 3d graphics accelerator mid 3d plus graphics accelerator installing vsimms z-buffer modules depending model decstation systems capable performing video conferencing high-quality audio output video input achieved use turbochannel option modules external peripherals video input achieved using decvideo also known pip picture-in-picture live-video-in option daughterboard plugs tx framebuffer provide ntsc pal secam input option used conjunction video camera microphone required software decstation used video conferencing audio capabilities provided decaudio turbochannel option module contained two amd 79c30a dsc digital subscriber controller devices motorola 56001 dsp two amd 79c30a dscs used voice-quality audio input output motorola 56001 used high-quality audio dsp initially used due firmware incomplete although capability provided later update confusingly simultaneous launch decstation workstation line digital also announced range decstation-branded pc compatibles intel x86 processors ran ms-dos identified three-digit model numbers decstation 2xx 3xx 4xx series using intel 80286 80386 80486 processors respectively computers built digital tandy corporation united states olivetti europe time introduction digital offered trade-in program owners earlier x86 pc incompatible computer rainbow 100 systems based 80286 systems based 80386 systems based 80486 | [
7702,
551,
6256,
5021,
1727,
5911,
4859,
5571,
3970,
578,
4795,
5055,
2226,
4799,
5849,
6380,
8117,
2792,
4368,
4370,
6583,
7131,
5614,
4099,
4277,
352,
534,
970,
5181,
6784
] | Validation |
4,100 | 4 | Aanval:aanval aanval commercial siem product designed specifically use snort suricata syslog data aanval active development since 2003 remains one longest running snort capable siem products industry aanval dutch attack aanval created loyal moses 2003 publicly made available march 2004 released private commercial license c1-ra1008 throughout lifecycle software also referred openaanval comaanval addition current registered trademark name aanval aanval original success providing ajax style security event monitoring reporting web-browser since aanval creation become intrusion detection correlation threat management console specific focus normalizing snort suricata syslog data 2010 aanval first intrusion detection vendor provide integrated ios app allowed users view security events remotely iphone ipad ipod touch several information security related books published include details references aanval including linux server security second edition o'reilly media security log management o'reilly media snort ids ips toolkit o'reilly media 2010 unix linux system administration handbook fourth edition o'reilly media | [
4382,
6029,
5454,
5983,
6788,
4575,
5571,
578,
3680,
2466
] | Validation |
4,101 | 5 | Wireless_Application_Protocol:wireless application protocol wireless application protocol wap technical standard accessing information mobile wireless network wap browser web browser mobile devices mobile phones uses protocol introduced much hype 1999 wap achieved popularity early 2000s 2010s largely superseded modern standards modern handset internet browsers fully support html need use wap markup web page compatibility therefore longer able render display pages written wml wap markup language introduction wap mobile service providers limited opportunities offer interactive data services needed interactivity support internet web applications email stock prices news sports headlines japanese i-mode system offered another major competing wireless data protocol wap standard described protocol suite stack allowing interoperability wap equipment software different network technologies gsm is-95 also known cdma bottom-most protocol suite wireless datagram protocol wdp functions adaptation layer makes every data network look bit like udp upper layers providing unreliable transport data two 16-bit port numbers origin destination upper layers view wdp one protocol several technical realizations top data bearers sms ussd etc native ip bearers gprs umts packet-radio service ppp top circuit-switched data connection wdp fact exactly udp wtls optional layer provides public-key cryptography-based security mechanism similar tls wtp provides transaction support reliable request/response adapted wireless world wtp supports effectively tcp problem packet loss occurs commonly 2g wireless technologies radio conditions misinterpreted tcp network congestion finally one think wsp initially compressed version http protocol suite allows terminal transmit requests http https equivalent wap gateway gateway translates requests plain http wireless application environment wae space defines application-specific markup languages wap version 1.x primary language wae wireless markup language wml wap 2.0 primary markup language xhtml mobile profile wap push incorporated specification allow wap content pushed mobile handset minimal user intervention wap push basically specially encoded message includes link wap address wap push specified top wireless datagram protocol wdp delivered wdp-supported bearer gprs sms gsm networks wide range modified processors gprs activation network generally supported wap push messages delivered top sms bearer receiving wap push wap 1.2 later -enabled handset automatically give user option access wap content also known wap push si service indication variant known wap push sl service loading directly opens browser display wap content without user interaction since behaviour raises security concerns handsets handle wap push sl messages way si providing user interaction network entity processes wap pushes delivers ip sms bearer known push proxy gateway ppg re-engineered 2.0 version released 2002 uses cut-down version xhtml end-to-end http dropping gateway custom protocol suite used communicate wap gateway used conjunction wap 2.0 however scenario used standard proxy server wap gateway role would shift one translation adding additional information request would configured operator could include telephone numbers location billing information handset information mobile devices process xhtml mobile profile xhtml mp markup language defined wap 2.0 subset xhtml superset xhtml basic version cascading style sheets css called wap css supported xhtml mp multimedia messaging service mms combination wap sms allowing sending picture messages wap forum founded 1998 ericsson motorola nokia unwired planet aimed primarily bring together various wireless technologies standardised protocol 2002 wap forum consolidated along many forums industry open mobile alliance oma first company launch wap site dutch mobile phone operator telfort bv october 1999 site developed side project christopher bee euan mcleod launched debut nokia 7110 marketers hyped wap time introduction leading users expect wap performance fixed non-mobile internet access bt cellnet one uk telecoms ran advertising campaign depicting cartoon wap user surfing neuromancer -like information space terms speed ease use appearance interoperability reality fell far short expectations first handsets became available 1999 led wide usage sardonic phrases worthless application protocol wait pay waplash 2003 2004 wap made stronger resurgence introduction wireless services vodafone live t-mobile t-zones easily accessible services operator revenues generated transfer gprs umts data different business model used traditional web sites isps according mobile data association wap traffic uk doubled 2003 2004 year 2013 wap use largely disappeared major companies websites since retired use wap mainstream technology web mobile number years modern handset internet browsers support full html css javascript need use kind wap markup webpage compatibility list handsets supporting html extensive includes android handsets versions iphone handset blackberry devices devices running windows phone many nokia handsets wap saw major success japan largest operator ntt docomo use wap favor in-house system i-mode rival operators kddi au softbank mobile previously vodafone japan successfully deployed wap technology particular j-phone sha-mail picture mail java jscl services well au chakuuta/chakumovie ringtone song/ringtone movie services based wap like europe wap i-mode usage declined 2010s html-capable smartphones became popular japan adoption wap us suffered many cell phone providers required separate activation additional fees data support also telecommunications companies sought limit data access approved data providers operating license signal carrier recognition problem u.s. federal communications commission fcc issued order 31 july 2007 mandated licensees 22-megahertz wide upper 700 mhz c block spectrum would implement wireless platform allows customers device manufacturers third-party application developers others use device application choice operating particular licensed network band commentators criticized several aspects wireless markup language wml wap technical criticisms include criticisms address wireless carriers particular implementations wap original wap model provided simple platform access web-like wml services e-mail using mobile phones europe se asian regions 2009 continued considerable user base later versions wap primarily targeting united states market designed different requirement enable full web xhtml access using mobile devices higher specification cost higher degree software complexity considerable discussion addressed question whether wap protocol design appropriate suggested bandwidth-sparing simple interface gopher would better match mobile phones personal digital assistants pdas initial design wap specifically aimed protocol independence across range different protocols sms ip ppp circuit switched bearer ip gprs etc. led protocol considerably complex approach directly ip might caused controversial especially many ip side design wap ip wap transmission layer protocol wtp uses retransmission mechanisms udp attempt solve problem inadequacy tcp high-packet-loss networks | [
6788,
3933,
2,
709,
2185,
3615,
4676,
7170,
7173,
2564,
740,
2219,
1108,
7916,
3653,
6837,
3314,
5417,
2240,
7217,
4380,
7956,
6871,
796,
6515,
2281,
6522,
4400,
1543,
1544,
2644,
7261,
7637,
6908,
5492,
3383,
5142,
8009,
1582,
6221,
52... | Test |
4,102 | 5 | People_Finder_Interchange_Format:people finder interchange format people finder interchange format pfif widely used open data standard information missing displaced people pfif designed enable information sharing among governments relief organizations survivor registries help people find contact family friends disaster pfif extended xml consists person records contain identifying information person note records contain comments updates status location person note attached one person pfif defines set fields records xml-based format store transfer pfif xml records embedded atom feeds rss feeds pfif allows different repositories missing person data exchange aggregate records every record unique identifier indicates domain name original repository record created unique record identifier preserved record copied one repository another example repository receives copy given person publish note attached person even note person copied repositories remain traceable respective original sources within three days 2001 september 11 attacks people using 25 different online forums survivor registries report check family friends one first largest survivor registry safe.millennium.berkeley.edu created graduate students ka-ping yee miriam walker hosted millennium computer cluster uc berkeley reduce confusion caused proliferation different websites berkeley survivor registry began collecting data several major sites one searchable database information formatted differently site site site required manual effort custom programming download incorporate data hurricane katrina displaced hundreds thousands people 2005 online survivor registries appeared many different websites large volunteer effort called katrina peoplefinder project worked gather manually re-enter information one searchable database provided salesforce.com organizer project david geilhufe put call technical help create data standard would enable survivor registries aggregate share information via automated means working katrina volunteers kieran lal jonathan plax civicrm team yee drafted first specification people finder interchange format released september 4 2005 pfif 1.0 pfif 1.1 small corrections released september 5 salesforce.com database added support pfif yahoo google also launched searchable databases katrina survivors exchanged information using pfif next major use pfif occurred 2010 haiti earthquake google launched google person finder used data model based pfif exchanged data cnn new york times national library medicine survivor registries using pfif however pfif 1.1 made us-specific assumptions applicable haiti released january 26 2010 pfif 1.2 added fields person home country international postal code fields sex age date birth status links duplicate records person pfif 1.3 released march 2011 addressed privacy personal information adding field specify expiry date person record setting requirements data deletion pfif 1.3 also moved away us-specific assumption first last name adding one field person full name pfif 1.4 released may 2012 renamed name fields given_name last_name added field alternate names added field linking personal profiles websites added support multiple photos per person following websites software projects implement pfif | [
7037,
6092
] | Validation |
4,103 | 2 | Uhuru_Mobile:uhuru mobile uhuru mobile secure android-based operating system operating system principal program allowing smartphones tablets pcs run central tool connects coordinates components kernel computers programs software device drivers letting users managing devices uhuru mobile solution composed application encryption market modified android-based os virtual private network sms encryption solution purpose uhuru mobile prevent physical attacks name uhuru comes swahili language means freedom independence uhuru mobile result research development project initiated 2012 promote digital sovereignty android-based operating system uhuru mobile focuses security privacy end-users individuals businesses mobile devices operating system currently developed software editor company called teclib ’ ensure os protection security using applications dedicated market installed replacing google play store uhuru mobile ’ applications market provides apps approved certified team security experts companies also customize uhuru marketplace providing in-house applications uhuru mobile provided deception system sending fake gps location coordinates applications decoy geolocation tool allows users fool applications using geolocation administrators define redirecting coordinates example demo version nsa headquarters coordinates sent deception system mobile device management tool administration mobile devices provided without additional setup administrators access web-console order manage uhuru mobile fleet linked applications remote apps installation/suppression set user accounts | [
3932,
2566,
6725,
5571,
3751,
4014,
740
] | Test |
4,104 | 1 | TiDB:tidb tidb open-source newsql database supports hybrid transactional analytical processing htap workloads mysql compatible provide horizontal scalability strong consistency high availability developed supported primarily pingcap inc. licensed apache 2.0 tidb drew initial design inspiration google ’ spanner f1 papers tidb recognized infoworld 2018 bossie award one best open source software data storage analytics pingcap inc. software company founded april 2015 began developing tidb founding company primary developer maintainer driver tidb associated open-source communities pingcap venture-backed company announced 50 million usd series c round financing september 2018 tidb expand sql processing storage capacity adding new nodes makes infrastructure capacity scaling easier flexible compare traditional relational database scale vertically tidb acts like mysql 5.7 server applications user continue use existing mysql client libraries tidb ’ sql processing layer built scratch mysql fork compatibility 100 known behavior differences mysql tidb tidb internally shards table small range-based chunks referred regions region defaults approximately 100mib size tidb uses two-phase commit internally ensure regions maintained transactionally consistent way tidb designed work cloud make deployment provisioning operations maintenance flexible storage layer tidb called tikv became cloud native computing foundation member project august 2018 sandbox level project architecture tidb platform also allows sql processing storage scaled independently tidb support online transaction processing oltp online analytical processing olap workloads means user may traditionally transacted mysql extracted transformed loaded etl data column store analytical processing step longer required tidb uses raft consensus algorithm ensure data highly available safely replicated throughout storage raft groups event failure raft group automatically elect new leader failed member self-heal tidb cluster without required manual intervention failure self-healing operations transparent applications tidb deployed kubernetes-enabled cloud environment using tidb operator operator method packaging deploying managing kubernetes application designed running stateful workloads first introduced coreos 2016.tidb operator originally developed pingcap open-sourced august 2018 tidb operator used deploy tidb laptop google cloud platform ’ google kubernetes engine amazon web services ’ elastic container service kubernetes tidb deployed using ansible using tidb-ansible playbook docker used deploy tidb containerized environment multiple nodes multiple machines docker compose used deploy tidb single command testing purposes tidb series open-source tools built around help data replication migration existing mysql mariadb users syncer tool supports full data migration incremental data replication mysql mariadb instances tidb cluster data migration dm second-generation iteration syncer suited replicating data already sharded mysql mariadb tables tidb common use case syncer/dm connect mysql mariadb tables tidb treating tidb almost slave directly run analytical workloads tidb cluster near real-time lightning tool supports high speed full-import large mysql dump new tidb cluster providing faster import experience executing sql statement tool used populate initially empty tidb cluster lots data quickly order speed testing production migration import speed improvement achieved parsing sql statements key-value pairs directly generate sorted string table sst files rocksdb tidb-binlog tool used collect logical changes made tidb cluster used provide incremental backup replication either two tidb clusters tidb cluster another downstream platform similar functionality mysql master-slave replication main difference since tidb distributed database binlog generated tidb instance needs merged sorted according time transaction commit consumed downstream | [
6462,
6056,
5064,
5506,
7248,
993
] | Test |
4,105 | 9 | Expressive_power_(computer_science):expressive power computer science computer science expressive power also called expressiveness expressivity language breadth ideas represented communicated language expressive language greater variety quantity ideas used represent example web ontology language expression language profile owl2 el lacks ideas negation expressed owl2 rl rule language owl2 el may therefore said less expressive power owl2 rl restrictions allow efficient polynomial time reasoning owl2 el owl2 rl owl2 el trades expressive power efficient reasoning processing knowledge representation language term expressive power may used range meaning may mean measure ideas expressible language first sense dominates areas mathematics logic deal formal description languages meaning formal language theory mathematical logic process algebra informal discussions term often refers second sense often case discussing programming languages efforts made formalize informal uses term notion expressive power always relative particular kind thing language question describe term normally used comparing languages describe kind things least comparable kinds things design languages formalisms involves trade-off expressive power analyzability formalism express harder becomes understand instances formalism say decision problems become harder answer completely undecidable formal language theory mostly studies formalisms describe sets strings context-free grammars regular expressions instance formalism e.g grammar regular expression describes particular set strings context expressive power formalism set sets strings instances describe comparing expressive power matter comparing sets important yardstick describing relative expressive power formalisms area chomsky hierarchy says instance regular expressions nondeterministic finite automatons regular grammars equal expressive power context-free grammars greater means sets sets strings described first three formalisms equal proper subset set sets strings described context-free grammars area cost expressive power central topic study known instance deciding whether two arbitrary regular expressions describe set strings hard arbitrary context-free grammars completely impossible however still efficiently decided whether given string set expressive formalisms problem harder even undecidable turing complete formalism arbitrary formal grammars problem every nontrivial property regarding set strings describe undecidable fact known rice theorem results conciseness well instance nondeterministic state machines regular grammars concise regular expressions sense latter translated former without blowup size i.e 1 reverse possible similar considerations apply formalisms describe sets strings sets trees e.g xml schema languages graphs structures database theory concerned among things database queries e.g formulas given contents database extract certain information predominant relational database paradigm contents database described finite set finite mathematical relations boolean queries always yield true false formulated first-order logic turns first-order logic lacking expressive power express certain types boolean queries e.g queries involving transitive closure however adding expressive power must done care must still remain possible evaluate queries reasonable efficiency case e.g. second-order logic consequently literature sprang many query languages language constructs compared expressive power efficiency e.g various versions datalog similar considerations apply query languages types data e.g xml query languages xquery | [
6507,
1254,
3680,
7435,
7627,
7442,
4497,
4743,
651,
5571,
6543,
5666,
7277,
6462,
5854,
6922,
3895,
8013,
2054,
6756,
684,
515,
8024,
7032,
5429,
6778,
1989,
1607,
84,
1805
] | Test |
4,106 | 9 | SPICE:spice spice simulation program integrated circuit emphasis general-purpose open-source analog electronic circuit simulator program used integrated circuit board-level design check integrity circuit designs predict circuit behavior unlike board-level designs composed discrete parts practical breadboard integrated circuits manufacture high costs photolithographic masks manufacturing prerequisites make essential design circuit close perfect possible integrated circuit first built simulating circuit spice industry-standard way verify circuit operation transistor level committing manufacturing integrated circuit board-level circuit designs often breadboarded testing even breadboard circuit properties may accurate compared final printed wiring board parasitic resistances capacitances parasitic components often estimated accurately using spice simulation also designers may want information circuit available single mock-up instance circuit performance affected component manufacturing tolerances cases common use spice perform monte carlo simulations effect component variations performance task impractical using calculations hand circuit appreciable complexity circuit simulation programs spice derivatives prominent take text netlist describing circuit elements transistors resistors capacitors etc connections translate description equations solved general equations produced nonlinear differential algebraic equations solved using implicit integration methods newton method sparse matrix techniques spice developed electronics research laboratory university california berkeley laurence nagel direction research advisor prof. donald pederson spice1 largely derivative cancer program nagel worked prof. ronald rohrer cancer acronym computer analysis nonlinear circuits excluding radiation hint berkeley liberalism 1960s times many circuit simulators developed united states department defense contracts required capability evaluate radiation hardness circuit nagel original advisor prof. rohrer left berkeley prof. pederson became advisor pederson insisted cancer proprietary program rewritten enough restrictions could removed program could put public domain spice1 first presented conference 1973 spice1 coded fortran used nodal analysis construct circuit equations nodal analysis limitations representing inductors floating voltage sources various forms controlled sources spice1 relatively circuit elements available used fixed-timestep transient analysis real popularity spice started spice2 1975 spice2 also coded fortran much-improved program circuit elements variable timestep transient analysis using either trapezoidal second order adams-moulton method gear integration method also known bdf equation formulation via modified nodal analysis avoiding limitations nodal analysis innovative fortran-based memory allocation system developed another graduate student ellis cohen last fortran version spice 2g.6 1983 spice3 developed thomas quarles a. richard newton advisor 1989 written c uses netlist syntax added x window system plotting early public domain software program source code available spice widely distributed used ubiquity became spice circuit remains synonymous circuit simulation spice source code beginning distributed uc berkeley nominal charge cover cost magnetic tape license originally included distribution restrictions countries considered friendly us source code currently covered bsd license birth spice named ieee milestone 2011 entry mentions spice evolved become worldwide standard integrated circuit simulator nagel awarded 2019 ieee donald o. pederson award solid-state circuits development spice newer versions berkeley spice released version 3f.5 1993 since open-source academic continuations spice include xspice developed georgia tech added mixed analog/digital code models behavioral simulation cider previously codecs developed uc berkeley oregon state univ. added semiconductor device simulation spice opus developed maintained university ljubljana based spice 3f.4 xspice ngspice based spice 3f.5 xspice cider berkeley spice inspired served basis many circuit simulation programs academia industry commercial products first commercial version spice ispice interactive version timeshare service national css prominent commercial versions spice include hspice originally commercialized ashawna kim hailey meta software owned synopsys pspice owned cadence design systems integrated circuit industry adopted spice quickly commercial versions became well developed many ic design houses proprietary versions spice today ic manufacturers typically larger companies groups continuing develop spice-based circuit simulation programs among adice analog devices ltspice linear technology available public freeware mica freescale semiconductor tina texas instruments similarly linear technology texas instruments makes available freeware windows version tina software called tina-ti also includes version spice comes preloaded models company integrated circuits analog devices offers similar free tool called adisimpe based simetrix/simplis implementation spice companies maintain internal circuit simulators directly based upon spice among powerspice ibm titan infineon technologies lynx intel corporation pstar nxp semiconductor spice became popular contained analyses models needed design integrated circuits time robust enough fast enough practical use precursors spice often single purpose bias program example simulation bipolar transistor circuit operating points slic program small-signal analyses spice combined operating point solutions transient analysis various small-signal analyses circuit elements device models needed successfully simulate many circuits spice2 included analyses since spice generally used model nonlinear circuits small signal analyses necessarily preceded quiescent point calculation circuit linearized spice2 also contained code small-signal analyses sensitivity analysis pole-zero analysis small-signal distortion analysis analysis various temperatures done automatically updating semiconductor model parameters temperature allowing circuit simulated temperature extremes circuit simulators since added many analyses beyond spice2 address changing industry requirements parametric sweeps added analyze circuit performance changing manufacturing tolerances operating conditions loop gain stability calculations added analog circuits harmonic balance time-domain steady state analyses added rf switched-capacitor circuit design however public-domain circuit simulator containing modern analyses features needed become successor popularity spice yet emerged important use appropriate analyses carefully chosen parameters example application linear analysis nonlinear circuits justified separately also application transient analysis default simulation parameters lead qualitatively wrong conclusions circuit dynamics spice2 included many semiconductor device compact models three levels mosfet model combined ebers–moll gummel–poon bipolar model jfet model model junction diode addition many elements resistors capacitors inductors including coupling independent voltage current sources ideal transmission lines active components voltage current controlled sources spice3 added sophisticated mosfet models required due advances semiconductor technology particular bsim family models added also developed uc berkeley commercial industrial spice simulators added many device models technology advanced earlier models became inadequate attempt standardization models set model parameters may used different simulators industry working group formed compact model council choose maintain promote use standard models standard models today include bsim3 bsim4 bsimsoi psp hicum mextram traditional photonic device simulators apply direct methods solve maxwell equations complete structure whereas photonic circuit simulators based segmentation building blocks bbs represented logic level phothonic device coupled bbs guided modes optical waveguides circuit-level modeling photonic integrated circuit pic contain electrical wires optical signals respectively described voltage/current complex-valued envelope forward- backward-propagating modes building block netlist photonic electronic circuits including net port connections expressed spice format schematic editors like ones used electronic design automation reproduce complete photonic signal information without losing eventual optical phenomena needed real-time waveform electric magnetic field every mode polarization waveguide spice works 10 time steps timescale datacommunications ≈10–100 10 common make amount information tractable modulation increases complexity encode amplitude phase way similar simulation rf circuits however photonic integrated circuit simulators need test multiple communication channels match different carrier frequencies equivalently amplitudes single channel type sophisticated signal unsupported spice program features structure described 2019 spice ca n't used simulate photonics electronics together photonic circuit simulator thus n't yet considered test simulator photonic integrated circuits spice2 took text netlist input produced line-printer listings output fit computing environment 1975 listings either columns numbers corresponding calculated outputs typically voltages currents line-printer character plots spice3 retained netlist circuit description allowed analyses controlled command-line interface similar c shell spice3 also added basic x plotting unix engineering workstations became common vendors various free software projects added schematic capture front-ends spice allowing schematic diagram circuit drawn netlist automatically generated also graphical user interfaces added selecting simulations done manipulating voltage current output vectors addition capable graphing utilities added see waveforms graphs parametric dependencies several free versions extended programs available introductory limited packages without restrictions since transient analysis dependent time uses different analysis algorithms control options different convergence-related issues different initialization parameters dc analysis however since transient analysis first performs dc operating point analysis unless uic option specified .tran statement dc analysis algorithms control options initialization convergence issues apply transient analysis circuits oscillators circuits feedback stable operating point solutions circuits either feedback loop must broken dc operating point calculated initial conditions must provided simulation input dc operating point analysis bypassed uic parameter included .tran statement uic included .tran statement transient analysis started using node voltages specified .ic statement node set 5 v .ic statement value node first time point time 0 5 v. use .op statement store estimate dc operating point transient analysis codice_1 .tran statement uic parameter example bypasses initial dc operating point analysis .op statement calculates transient operating point 20 ns transient analysis although transient analysis might provide convergent dc solution transient analysis still fail converge transient analysis error message internal timestep small indicates circuit failed converge convergence failure might due stated initial conditions close enough actual dc operating point values | [
5148,
5458,
2654,
5459,
3378,
2994,
2803,
1435,
5999
] | Test |
4,107 | 3 | Chack'n_Pop:chack n pop arcade rom-set also contains unused graphics mechanical wind-up zen-chan later appeared bubble bobble home ports released sg-1000 msx famicom nec pc-6001 nec pc-8801 arcade emulation included taito legends power-up psp taito legends 2 xbox playstation 2 pc chack n small yellow creature later recolored green extendable legs must traverse series single-screen mazes capable walking floors ceilings walls climb steps traverse high walls extending legs tall enough pass onto next step capable throwing hand grenades left right short period explode cloud smoke separate fire buttons control rolling left right chack n killed caught explosion cloud screen played time limit marked mighta pushing boulder along top screen mighta reappears bubble bobble recurring enemy chack n aim reach top screen time limit expires delayed process series solid walls order get past walls must free hearts cages using hand grenades obstruction comes form monstas creatures appear bubble bobble hatching eggs hand grenades also used destroy creatures eggs producing however player get bonus points completing level destroying enemies later levels include moving platforms reminiscent bubble bobble water bottles blown flood level water water destroy anything way inhibit movement enemies allows chack n swim otherwise unreachable platforms levels completed chack n able marry girlfriend miss chack n sega sg-1000 version extended introduction ending sequences small additional training stage first chack n content chack n pop appeared bubble bobble fairyland story parasol stars puzzle bobble bubble symphony bubble memories pop n pop arkanoid ds huge silver robotic chack n also mid-boss stage 5 taito arcade shooter megablast | [] | Validation |
4,108 | 3 | Coffee_Lake:coffee lake coffee lake intel codename second 14 nm process node refinement following broadwell skylake kaby lake integrated graphics coffee lake chips allow support dp 1.2 hdmi 2.0 hdcp 2.2 connectivity coffee lake natively supports ddr4-2666 mhz memory dual channel mode used xeon core i5 i7 i9 cpus ddr4-2400 mhz memory dual channel mode used celeron pentium core i3 cpus lpddr3-2133 mhz memory used mobile cpus desktop coffee lake cpus introduces major changes intel core cpus nomenclature i5 i7 cpus feature six cores along hyper-threading case latter core i3 cpus four cores dropping hyper-threading first time received change well 9th generation release october 2018 changed nomenclature core i7 moving 8 cores dropping hyper-threading first time new mainstream desktop core i9 processors released featuring 8 cores hyper-threading chips released october 5 2017 coffee lake used conjunction 300-series chipset officially work 100- 200-series chipset motherboards although desktop coffee lake processors use physical lga 1151 socket skylake kaby lake pinout electrically incompatible older processors motherboards april 2 2018 intel released additional desktop core i3 i5 i7 pentium gold celeron cpus first six-core core i7 i9 mobile cpus hyper-threaded four-core core i5 mobile cpus first coffee lake ultra-power cpus intel iris plus graphics october 8 2018 intel launched 9th generation coffee lake refresh cpus eight cores avoid running thermal problems high clockspeeds intel soldered integrated heat spreader ihs cpu die instead using thermal paste core i7 i9 however core i5 still use thermal paste cpu die ihs development led intel israel processor design team haifa israel optimization kaby lake intel first launched 8th generation intel core family processors august 2017 release new 8th gen intel core i9 processor 2018 intel said would highest-performance laptop processor intel ever built coffee lake cpus built using second refinement intel 14 nm process 14 nm++ features increased transistor gate pitch lower current density higher leakage transistors allows higher peak power higher frequency expense die area idle power coffee lake marks shift number cores intel mainstream desktop processors first update previous ten-year history intel core cpus 8th generation mainstream desktop i7 cpus feature six cores 12 threads i5 cpus feature six single-threaded cores i3 cpus feature four single-threaded cores 9th generation intel core i9 branding made debut mainstream desktop describing cpus 8 cores 16 threads 9th generation i7s feature 8 single-threaded cores marking first time desktop core i7s featured intel hyper-threading technology 9th generation i5 cpus feature six single-threaded cores like 8th generation predecessors ninth generation core series includes hardware fixes meltdown v3 l1 terminal fault 300 series chipsets using physically identical lga 1151 socket 100 200 series chipsets officially compatible coffee lake cpus meaning older motherboards officially support coffee lake processors 300 series motherboards officially support skylake kaby lake processors enthusiast z370 rebranded z270 launched alongside first coffee lake cpus october 2017 officially supported chipset mainstream cpus full lineup cpus revealed april 2018 accompanied lower-end h310 b360 h370 q370 chipsets home business users z390 chipset launched alongside release 9th generation cpus supporting 8th 9th generation mainstream desktop parts b365 chipset added later 9th generation xeons need motherboards chipset c246 coffee lake features largely cpu core performance per mhz skylake/kaby lake features specific coffee lake include august 8 2017 intel announced new eighth generation processors would revealed following august 21 intel previous changes product generations coincided new microarchitectures unclear generally expected eighth core generation products would based new coffee lake microarchitecture however officially announced august 21 2017 intel stated eighth generation would based multiple microarchitectures including kaby lake coffee lake cannon lake additional core resources mid-range eighth-generation coffee lake desktop chips offer significant gains performance versus previous seventh-generation intel cpus multi-threaded workloads however architecture delivers noipc difference skylake kaby lake processors mark first time intel released mainstream consumer cpus support 128gb ram nowiki /nowiki various reviews show core i7-8700k cpu may consume 110w load first 9th generation coffee lake cpus released fourth quarter 2018 include hardware mitigations certain meltdown/spectre vulnerabilities main differences 8th generation besides increased frequency even though f suffix cpus lack integrated gpu intel set price cpus featureful counterparts nowiki /nowiki various reviews show core i9-9900k cpu may consume 140w load | [
2449,
2814,
5802,
6332,
6698,
6793,
3942,
4221,
3849,
4765,
3443,
6170,
6344,
6616,
7442,
1465,
7449,
7453,
3020,
7364,
3717,
5669,
5670,
584,
3803,
6647,
1867,
1770,
3565,
4077,
6569,
3139,
4985,
766,
6307,
691,
5343,
866,
4098,
6057,
... | Train |
4,109 | 4 | HTTP_POST_flood:http post flood http post flood simply post flood denial service attack uses post requests part hypertext transfer protocol http one kind http flood attack late 2013 post floods increasingly launched mobile devices | [
3177,
3383
] | Test |
4,110 | 4 | Bredolab_botnet:bredolab botnet bredolab botnet also known alias oficla russian botnet mostly involved viral e-mail spam botnet eventually dismantled november 2010 seizure command control servers estimated consist millions zombie computers though earliest reports surrounding bredolab botnet originate may 2009 first malware samples bredolab trojan horse found botnet rise prominence august 2009 major surge size botnet bredonet main form propagation sending malicious e-mails included malware attachments would infect computer opened effectively turning computer another zombie controlled botnet peak botnet capable sending 3.6 billion infected emails every day main form propagation use drive-by downloads method exploits security vulnerabilities software method allowed botnet bypass software protection order facilitate downloads without user aware main income botnet generated leasing parts botnet third parties could subsequently use infected systems purposes security researchers estimate owner botnet made 139,000 month botnet related activities due rental business strategy payload bredolab diverse ranged scareware malware e-mail spam 25 october 2010 team dutch law enforcement agents seized control 143 servers contained three command control servers one database server several management servers bredolab botnet datacenter leaseweb effectively removing botnet herder ability control botnet centrally attempt regain control botnet botnet herder utilized 220,000 computers still control unleash ddos attack leaseweb servers though attempts ultimately vain taking control botnet law enforcement team utilized botnet send message owners infected computers stating computer part botnet subsequently armenian law enforcement officers arrested armenian citizen georgy avanesov basis suspected mastermind behind botnet suspect denied involvement botnet sentenced four years prison may 2012 seizure command control servers severely disrupted botnet ability operate botnet still partially intact command control servers persisting russia kazakhstan security firm fireeye believes secondary group botnet herders taken remaining part botnet purposes possibly previous client reverse engineered parts original botnet creator code even group noted botnet size capacity severely reduced law enforcement intervention | [
2173,
3932,
2632,
2376,
1632,
6715,
7441,
3281,
651,
7186,
2577,
3875,
5401,
6740,
6370,
5675,
7657,
51,
7294,
2693,
2789,
7307,
3154,
2354,
7600,
2535,
6328
] | Validation |
4,111 | 5 | Ultrasurf:ultrasurf ultrasurf freeware internet censorship circumvention product created ultrareach internet corporation software bypasses internet censorship firewalls using http proxy server employs encryption protocols privacy software developed chinese dissidents means allowing internet users bypass great firewall china currently boasts many 11 million users worldwide tool described one important free-speech tools internet wired best performing circumvention tool harvard university 2007 study 2011 study freedom house ranked fourth critics open-source community george turner says expressed concern software closed-source nature alleged security obscurity design ultrareach says security considerations mean prefer third party expert review open source review 2001 ultrareach founded chinese dissidents silicon valley shortly ultrasurf created allow internet users china evade government censorship monitoring 2011 ultrasurf reported eleven million users worldwide arab spring ultrareach recorded 700 percent spike traffic tunisia similar traffic spikes occur frequently times unrest regions tibet burma saffron revolution wired magazine 2010 called ultrasurf one important free-speech tools internet enabling citizens access share information oppressed countries times humanitarian human rights crises ultrasurf funded part contracts u.s. government broadcasting board governors administers voice america radio free asia 2012 ultrareach difficulty serving growing user base due insufficient funding ultrasurf free download requires installation ultrasurf install files user computer leaves registry edits exits words leaves trace use fully remove software computer user needs delete exe file named u.exe available windows platform runs internet explorer default optional plug-in firefox chrome ultrareach website notes anti-virus software companies misclassify ultrasurf malware trojan ultrasurf encrypts communications circumvents internet censorship security companies agreed whitelist ultrasurf according applebaum ultrasurf client uses anti-debugging techniques also employs executable compression client acts local proxy communicates ultrareach network appears obfuscated form tls/ssl software works creating encrypted http tunnel user computer central pool proxy servers enabling users bypass firewalls censorship ultrareach hosts servers software makes use sophisticated proprietary anti-blocking technology overcome filtering censorship online according wired magazine ultrasurf changes ip addresses proxy servers 10,000 times hour server-side 2011 analysis found ultrareach network employed squid ziproxy software well isc bind servers bootstrapping wider network open recursive dns servers latter ultrareach control ultrasurf designed primarily anti-censorship tool also offers privacy protections form industry standard encryption added layer obfuscation built ultrareach uses internal content filter blocks sites deemed pornographic otherwise offensive according wired magazine partly network lacks bandwidth accommodate much data-heavy traffic also falun gong frowns erotica additionally falun gong criticism website facts.org.cn alleged operated chinese government also unreachable ultrasurf 2007 study harvard university berkman center internet society found ultrasurf best performing tested circumvention tools in-country tests recommended widespread use particular report found ultrasurf effectively bypassed various forms censorship blocking include ip block dns block keyword filtering also fastest tool in-country tests noted easy use install simple user interface report noted however ultrareach designed primarily circumvention product rather anonymity tool suggested users concerned anonymity disable browser support active content using ultrasurf 2011 report u.s.-based human rights group freedom house ranked ultrasurf fourth overall among censorship circumvention privacy tools measured combination performance usability support security particular tool recommended users interested downloading viewing information required relatively high degree privacy favored fast connection speed technologists expressed reservations ultrareach model however particular developers criticized proponents open-source software allowing peer review tool design except discretion creators moreover ultrareach operates servers developers access user logs architecture means users required trust ultrareach reveal user data ultrareach maintains keeps logs short period time uses purpose analyzing traffic signs interference monitor overall performance efficacy company says disclose user logs third parties according jacob appelbaum tor project essentially amounts example privacy policy april 2012 report appelbaum criticized ultrasurf use internal content filtering including blocking pornographic websites willingness comply subpoenas u.s. law enforcement officials appelbaum report also noted ultrasurf pages employed google analytics potential leak user data systems date latest security patches make use forward security mechanisms furthermore applebaum claims ultrasurf client uses open free software including putty zlib use putty zlib disclosed use lack disclosure violation licenses response posted day ultrareach wrote already resolved issues asserted appelbaum report misrepresented misunderstood aspects software ultrareach also argued differences software approaches internet censorship represented tor ultrasurf base philosophical simply different approaches censorship circumvention top-secret nsa presentation revealed part 2013 global surveillance disclosures dismisses response ultrasurf talk show due restrictions imposed organizations mcafee virusscan flagging ultrasurf versions potentially unwanted program avoiding execution machines ultrasurf virus ultrasurf virus used inappropriately students minors circumvent firewalls measures put place prevent exposure inappropriate and/or indecent content pornography fact runs undetected operating system makes virtually impossible disable block | [
96,
4759,
3850,
1175,
6348,
1931,
2563,
2566,
5571,
6025,
7282,
1886,
7214,
431,
6398,
3338,
4014
] | Test |
4,112 | 9 | Metacharacter:metacharacter metacharacter character special meaning computer program shell interpreter regular expression regex engine posix extended regular expressions 14 metacharacters must escaped preceded backslash order drop special meaning treated literally inside expression opening closing square brackets backslash caret dollar sign period/full stop/dot vertical bar/pipe symbol question mark asterisk plus sign opening closing curly brackets/braces opening closing parentheses example match arithmetic expression 1+1 *3=6 regex correct regex 1\+1\ \*3=6 otherwise parentheses plus sign asterisk special meanings characters may special meaning environments term escape metacharacter means make metacharacter ineffective strip special meaning causing literal meaning example pcre dot stands single character regular expression a.c match abc a3c even c however escaped lose meaning metacharacter interpreted literally causing regular expression a\.c match string a.c usual way escape character regex elsewhere prefixing backslash environments may employ different methods like ms-dos/windows command prompt caret used instead | [
1019,
666,
4539,
6789,
6380,
2438,
5116,
878
] | Train |
4,113 | 5 | Software_Upgrade_Protocol:software upgrade protocol software upgrade protocol sup system set programs developed carnegie mellon university 1980s andrew file system provides collections files maintained identical versions across number machines originally developed mach operating system implementations provided debian ubuntu linux distributions | [
5275,
2704
] | Test |
4,114 | 5 | Named_data_networking:named data networking named data networking ndn related content-centric networking ccn content-based networking data-oriented networking information-centric networking icn proposed future internet architecture inspired years empirical research network usage growing awareness unsolved problems contemporary internet architectures like ip ndn roots earlier project content-centric networking ccn van jacobson first publicly presented 2006 ndn project investigating jacobson proposed evolution today host-centric network architecture ip data-centric network architecture ndn belief conceptually simple shift far-reaching implications people design develop deploy use networks applications premise internet primarily used information distribution network good match ip future internet thin waist based named data rather numerically addressed hosts underlying principle communication network allow user focus data needs named content rather reference specific physical location data retrieved named hosts motivation derived fact vast majority current internet usage high 90 level traffic consists data disseminated source number users named-data networking comes potential wide range benefits content caching reduce congestion improve delivery speed simpler configuration network devices building security network data level today internet hourglass architecture centers universal network layer ip implements minimal functionality necessary global inter-connectivity contemporary internet architecture revolves around host-based conversation model created 1970s allow geographically distributed users use big immobile computers thin waist enabled internet explosive growth allowing lower upper layer technologies innovate independently however ip designed create communication network packets named communication endpoints sustained growth e-commerce digital media social networking smartphone applications led dominant use internet distribution network distribution networks general communication networks solving distribution problems via point-to-point communication protocol complex error-prone named data networking ndn project proposed evolution ip architecture generalizes role thin waist packets name objects communication endpoints specifically ndn changes semantics network service delivering packet given destination address fetching data identified given name name ndn packet name anything – endpoint data chunk movie book command turn lights etc hope conceptually simple change allows ndn networks apply almost internet well-tested engineering properties broader range problems beyond end-to-end communications examples ndn applying lessons learned 30 years networking engineering self-regulation network traffic via flow balance interest data request data packets security primitives via signatures named data integrated protocol start philosophy behind ndn pioneered ted nelson 1979 later brent baccala 2002 1999 triad project stanford proposed avoiding dns lookups using name object route towards close replica 2006 data-oriented network architecture dona project uc berkeley icsi proposed content-centric network architecture improved triad incorporating security authenticity persistence first-class primitives architecture van jacobson gave google talk new way look networking 2006 evolution network argued ndn next step 2009 parc announced content-centric architecture within ccnx project led jacobson time research fellow parc september 21 2009 parc published specifications interoperability released initial open source implementation gpl content-centric networking research project project ccnx site ndn one instance general network research direction called information-centric networking icn different architecture designs emerged internet research task force irtf established icn research working group 2012 ndn includes sixteen nsf-funded principal investigators twelve campuses growing interest academic industrial research communities 30 institutions form global testbed exists large body research actively growing code base contributed ndn ndn forwarder currently supported ubuntu 16.04 18.04 fedora 20+ centos 6+ gentoo linux raspberry pi openwrt freebsd 10+ several platforms common client libraries actively supported c++ java javascript python .net framework c squirrel programming languages ndn simulator emulator also available actively developed several client applications developed areas real-time conferencing ndn friendly file systems chat file sharing iot communication ndn driven receivers i.e. data consumers exchange two types packets interest data types packets carry name identifies piece data transmitted one data packet packet types complete specification see ndn packet format specification carry interest data packet forwarding functions ndn router maintains three data structures forwarding policy interest packet arrives ndn router first checks content store matching data exists router returns data packet interface interest came otherwise router looks name pit matching entry exists simply records incoming interface interest pit entry absence matching pit entry router forward interest toward data producer based information fib well router adaptive forwarding strategy router receives interests name multiple downstream nodes forwards first one upstream toward data producer data packet arrives ndn router finds matching pit entry forwards data down-stream interfaces listed pit entry removes pit entry caches data content store data packets always take reverse path interests absence packet losses one interest packet results one data packet link providing flow balance fetch large content objects comprise multiple packets interests provide similar role controlling traffic flow tcp acks today internet fine-grained feedback loop controlled consumer data neither interest data packets carry host interface addresses routers forward interest packets toward data producers based names carried packets forward data packets consumers based pit state information set interests hop interest/data packet exchange symmetry induces hop-by-hop control loop confused symmetric routing routing eliminates need notion source destination nodes data delivery unlike ip end-to-end packet delivery model ndn names opaque network allows application choose naming scheme fits needs naming thus evolve independently network ndn design assumes hierarchically structured names e.g. video produced ucla may name /ucla/videos/demo.mpg ‘ ’ delineates name components text representations similar urls hierarchical structure many potential benefits retrieve dynamically generated data consumers must able deterministically construct name desired piece data without previously seen name data either current research exploring applications choose names facilitate application development network delivery aim work develop refine existing principles guidelines naming converting rules naming conventions implemented system libraries simplify future application development data may retrieved globally must globally unique names names used local communications may require local routing local broadcast find matching data individual data names meaningful various scopes contexts ranging “ light switch room ” “ country names world ” namespace management part ndn architecture address space management part ip architecture however naming important part ndn application designs enabling application developers sometimes users design namespaces data exchange several benefits ndn routes forwards packets based names eliminates three problems caused addresses ip architecture ndn use conventional routing algorithms link state distance vector instead announcing ip prefixes ndn router announces name prefixes cover data router willing serve conventional routing protocols ospf bgp adapted route name prefixes treating names sequence opaque components component-wise longest prefix match name interest packet fib table enables wide array inputs aggregated real time distributed across multiple interface environments simultaneously without compromising content encryption pit state router supports forwarding across ndn data plane recording pending interest incoming interface removing interest matching data received timeout occurs per hop per packet state differs ip stateless data plane based information fib performance measurements adaptive forwarding strategy module router makes informed decisions router decides interest satisfied e.g. upstream link forwarding entry fib extreme congestion occurs router send nack downstream neighbor transmitted interest negative acknowledgment nack may trigger receiving router forward interest interfaces explore alternate paths pit state enables routers identify discard looping packets allowing freely use multiple paths toward data producer packets loop ndn means need time-to-live measures implemented ip related protocols address issues contrast tcp/ip leaves responsibility security lack thereof endpoints ndn secures data requiring data producers cryptographically sign every data packet publisher signature ensures integrity enables determination data provenance allowing consumer trust data decoupled obtained ndn also supports fine-grained trust allowing consumers reason whether public key owner acceptable publisher specific piece data specific context second primary research thrust designing developing usable mechanisms manage user trust research 2 different types trust models ndn data-centric security natural applications content access control infrastructure security applications encrypt data distribute keys named packets using named infrastructure distribute keys effectively limiting data security perimeter context single application verify data packet signature application fetch appropriate key identified packet key locator field like content trust management i.e. determine authenticity given key particular packet given application primary research challenge consistent experimental approach ndn trust management research driven application development use solving specific problems first identifying common patterns example security needs nlsr required development simple hierarchical trust model keys lower closer root levels used sign keys higher levels keys published names reflect trust relationship trust model namespace matches hierarchy trust delegation i.e. /root/site/operator/ router/process publishing keys particular name hierarchy authorizes sign specific data packets limits scope paradigm easily extended applications real world trust tends follow hierarchical pattern building management systems bms since ndn leaves trust model control application flexible expressive trust relations may also expressed one example chronochat motivated experimentation web-of-trust model security model current chatroom participant introduce newcomer others signing newcomer key future applications implement cross-certifying model sdsi 13 3 provides redundancy verification allowing data key names independent easily accommodates variety real-world trust relationships furthermore ndn treats network routing control messages like ndn data requiring signatures provides solid foundation securing routing protocols attack e.g. spoofing tampering ndn use multipath forwarding together adaptive forwarding strategy module mitigates prefix hijacking routers detect anomalies caused hijacks retrieve data alternate paths since ndn packets reference content rather devices trickier maliciously target particular device although mitigation mechanisms needed ndn-specific attacks e.g. interest flooding dos. furthermore pending interest table keeps state regarding past requests make informed forward decisions handle interest numerous security advantages | [
3821,
1462,
2650,
7774,
354
] | Test |
4,115 | 4 | VIPRE:vipre vipre security also known vipre brand j2 global develops cybersecurity products focused endpoint email security along advanced threat intelligence solutions vipre based clearwater florida operations washington d.c. vancouver b.c. spain uk philippines company originally founded 1994 sunbelt software acquired 2010 gfi software becoming vipre distributed products threattrack security 2017 concentrates vipre suite company uses name vipre portfolio encompasses endpoint security heritage original sunbelt software anti-virus products email security heritage fusemail electric mail products previously acquired j2 2017 vipre earned recognition av-comparatives one six top-rated products av-test virus bulletin february 2018 acquired j2 global recently featured pc world magazine article | [
5452,
91,
5274,
3089,
4585,
1931,
385,
910,
1838,
6005,
2296,
4689,
6006,
4783,
3111,
7087,
496,
6644,
5144,
7193,
3123,
4521,
142,
935,
1395,
3561,
7478,
6043,
6305,
8134,
6777,
4645,
88
] | Test |
4,116 | 2 | Android_version_history:android version history version history android mobile operating system began public release android beta november 5 2007 first commercial version android 1.0 released september 23 2008 android continually developed google open handset alliance seen number updates base operating system since initial release versions android 1.0 1.1 released specific code names although android 1.1 unofficially known petit four android code names confectionery-themed alphabetical order since 2009 android 1.5 cupcake recent version android android 9 pie released august 2018 development android started 2003 android inc. purchased google 2005 beta released november 5 2007 software development kit sdk released november 12 2007 november 5 date popularly celebrated android birthday public beta versions sdk released following order following tables show release dates key features android operating system updates date listed chronologically official application programming interface api levels main hardware platform android arm architecture armv7 armv8-a architectures formerly also armv5 x86 mips architectures also officially supported later versions android mips support since deprecated support removed ndk r17 unofficial android-x86 project used provide support x86 mips architectures ahead official support 2012 android devices intel processors began appear including phones tablets gaining support 64-bit platforms android first made run 64-bit x86 arm64 since android 5.0 lollipop 64-bit variants platforms supported addition 32-bit variants requirements minimum amount ram devices running android 7.1 depend screen size density type cpu ranging 816mb–1.8gb 64-bit 512mb–1.3gb 32-bit meaning practice 1gb common type display minimum android watch 416mb recommendation android 4.4 least 512 mb ram low ram devices 340 mb required minimum amount include memory dedicated various hardware components baseband processor android 4.4 requires 32-bit armv7 mips x86 architecture processor latter two unofficial ports together opengl es 2.0 compatible graphics processing unit gpu android supports opengl es 1.1 2.0 3.0 3.2 since android 7.0 vulkan version 1.1 available devices applications may explicitly require certain version opengl es suitable gpu hardware required run applications android used require autofocus camera relaxed fixed-focus camera | [
2902,
3933,
5372,
6427,
7170,
1095,
2569,
740,
5055,
4340,
42,
3309,
3310,
7924,
2591,
5771,
7209,
5775,
4014,
6153,
4375,
7956,
5455,
4762,
7967,
6176,
5473,
474,
5476,
6183,
822,
831,
6908,
6910,
5141,
6916,
136,
2317,
2673,
6209,
728... | Test |
4,117 | 4 | Red_Condor:red condor red condor inc. privately held company offers anti-spam appliances hosted service block e-mail spam spyware viruses company also offers message archiving service provides back-up inbound outbound email messages 2007 red condor introduced vx technology integrates local appliance hosted service technology redirects email appliance hosted service event network failure november 2008 company named dr. thomas steding former ceo pgp corporation president ceo january 2009 red condor received technology year award infoworld magazine april 2010 red condor purchased st. bernard software | [
651,
5401,
1805
] | Test |
4,118 | 0 | PATR-II:patr-ii patr-ii linguistic formalism used computational linguistics developed stuart m. shieber uses context-free grammar rules feature constraints rules | [
1314
] | Test |
4,119 | 2 | DasBoot:dasboot dasboot software utility produced subrosasoft.com inc allows user create bootable mac os x usb device mac os x 10.5 earlier freeware product live usb device used diagnostic repair recovery mac os x systems macworld uk editor choice 5 star award creating dasboot device requires steps addition dasboot application user needs bootable cd dvd firewire usb flash drive intel-powered apple computers support booting via usb usb firewire hard drives may also used dasboot works versions mac os x prior 10.6 bootable mac os x cd/dvds included programs drive genius diskwarrior filesalvage copycatx software utilities bootable dvd used mac os x installer disc used lacks libraries required create bootable device default following applications installed dasboot devices also present user applications folder following applications automatically included users add additional applications dasboot device dragging dropping desired application applications area dasboot application users also select deselect included applications simply clicking icon within applications section user selected device 'd like make bootable selected bootable disk copy required libraries information chosen programs include dasboot device clicking single button starts process building required information copying device boot system dasboot device user starts mac 'option sometimes called 'alt key held display startup screen allows select bootable device would like start system select dasboot device system start normal dasboot interface appear system boots allow user select installed application would like run release version 2.0 added support mac os x 10.6 snow leopard along support newer intel macs performance enhancements bug fixes | [
6557,
5571,
4207,
3271,
788
] | Test |
4,120 | 9 | Sethi–Ullman_algorithm:sethi–ullman algorithm computer science sethi–ullman algorithm algorithm named ravi sethi jeffrey d. ullman inventors translating abstract syntax trees machine code uses registers possible generating code arithmetic expressions compiler decide best way translate expression terms number instructions used well number registers needed evaluate certain subtree especially case free registers scarce order evaluation important length generated code different orderings may lead larger smaller numbers intermediate values spilled memory restored sethi–ullman algorithm also known sethi–ullman numbering fulfills property producing code needs fewest instructions possible well fewest storage references assumption commutativity associativity apply operators used distributive laws i.e formula_1 hold please note algorithm succeeds well neither commutativity associativity hold expressions used therefore arithmetic transformations applied algorithm also take advantage common subexpressions apply directly expressions represented general directed acyclic graphs rather trees simple sethi–ullman algorithm works follows load/store architecture arithmetic expression formula_2 abstract syntax tree looks like continue algorithm need examine arithmetic expression formula_3 i.e look right subtree assignment '= start traversing tree preorder assigning number registers needed evaluate subtree note last summand expression formula_3 constant tree seen need 2 registers compute left subtree '* 1 register compute right subtree nodes c g need registers following reasons tree leaf number registers evaluate either 1 0 depending whether left right subtree since operation add r1 handle right component directly without storing register therefore shall start emit code left subtree first might run situation 2 registers left compute whole expression computed right subtree first needs 1 register would need register hold result right subtree computing left subtree would still need 2 registers therefore needing 3 registers concurrently computing left subtree first needs 2 registers result stored 1 since right subtree needs 1 register compute evaluation expression 2 registers left advanced version sethi–ullman algorithm arithmetic expressions first transformed exploiting algebraic properties operators used | [
1361,
290,
5190
] | Validation |
4,121 | 3 | SGI_IRIS:sgi iris sgi iris series line terminals workstations silicon graphics built 1980s early systems use motorola 68000 family processors originally later models feature early-generation mips processors | [
5055,
4362,
7010,
7990,
4802,
6922,
5104,
3849,
3567,
970,
3692,
156,
5883,
787
] | Validation |
4,122 | 6 | PEFS:pefs pefs private encrypted file system kernel level stacked cryptographic file system freebsd open source software available bsd license pefs official website pefs.io sources available github | [
6025,
6458,
4990,
3350,
5808,
4014,
4559,
5773
] | Test |
4,123 | 3 | LGA_1567:lga 1567 lga 1567 socket ls cpu socket used high-end server segment 1567 protruding pins make contact pads processor supports intel nehalem codenamed beckton xeon 7500 xeon 6500 series processors first released march 2010 6500 series scalable 2 sockets 7500 series scalable 4/8 sockets supporting motherboard later xeon e7 series using westmere-ex architecture reused socket | [
2541,
2814,
3849,
1729,
2828,
6173,
7974,
2830,
3002,
4314,
5379,
3193,
1841,
1645,
3203,
4968,
3385,
4972,
5853,
2685,
6935,
8021,
7302,
5963,
866,
3333,
7134,
262,
6683,
5886
] | Test |
4,124 | 2 | Binary_Application_Markup_Language:binary application markup language binary application markup language file format microsoft generated compiling xaml files xaml file compiled binary application markup language file .baml extension may inserted resource .net framework assembly run-time framework engine extracts .baml file assembly resources parses creates corresponding wpf visual tree workflow format content loadable faster runtime xaml enriched tokens lexical analysis completed | [
1710,
930,
3931,
80,
2530
] | Test |
4,125 | 5 | Nagle's_algorithm:nagle algorithm nagle algorithm means improving efficiency tcp/ip networks reducing number packets need sent network defined john nagle working ford aerospace published 1984 request comments rfc title congestion control ip/tcp internetworks see rfc 896 rfc describes called small-packet problem application repeatedly emits data small chunks frequently 1 byte size since tcp packets 40-byte header 20 bytes tcp 20 bytes ipv4 results 41-byte packet 1 byte useful information huge overhead situation often occurs telnet sessions keypresses generate single byte data transmitted immediately worse slow links many packets transit time potentially leading congestion collapse nagle algorithm works combining number small outgoing messages sending specifically long sent packet sender received acknowledgment sender keep buffering output full packet worth output thus allowing output sent rfc defines algorithm inhibit sending new tcp segments new outgoing data arrives user previously transmitted data connection remains unacknowledged mss maximum segment size largest segment sent connection window size currently acceptable window unacknowledged data written pseudocode algorithm interacts badly tcp delayed acknowledgments delayed ack feature introduced tcp roughly time early 1980s different group algorithms enabled applications two successive writes tcp connection followed read fulfilled data second write reached destination experience constant delay 500 milliseconds ack delay reason tcp implementations usually provide applications interface disable nagle algorithm typically called codice_1 option solution recommended nagle avoid algorithm sending premature packets buffering application writes flushing buffer user-level solution avoid write-write-read sequences sockets write-read-write-read fine write-write-write fine write-write-read killer buffer little writes tcp send using standard unix i/o package flushing write read usually works nagle considers delayed acks bad idea since application layer usually respond within time window protocol level recommends disabling delayed ack example codice_2 linux instead algorithm quick acks incur much overhead many small packets algorithm applies data size data single write spans 2 n packets last packet withheld waiting ack previous packet request-response application protocols request data larger packet artificially impose hundred milliseconds latency requester responder even requester properly buffered request data nagle algorithm disabled requester case response data larger packet responder also disable nagle algorithm requester promptly receive whole response general since nagle algorithm defense careless applications benefit carefully written application takes proper care buffering algorithm either effect negative effect application applications expect real-time responses low latency react poorly nagle algorithm applications networked multiplayer video games movement mouse remotely controlled operating system expect actions sent immediately algorithm purposefully delays transmission increasing bandwidth efficiency expense latency reason applications low-bandwidth time-sensitive transmissions typically use codice_1 bypass nagle delay another option use udp instead modern operating systems implement nagle algorithms aix linux enabled default disabled per-socket basis using codice_1 option | [
7765,
7637,
2125,
3618,
3819
] | Test |
4,126 | 9 | XSL_Formatting_Objects:xsl formatting objects xsl-fo xsl formatting objects markup language xml document formatting often used generate pdf files xsl-fo part xsl extensible stylesheet language set w3c technologies designed transformation formatting xml data parts xsl xslt xpath version 1.1 xsl-fo published 2006 xsl-fo considered feature complete w3c last update working draft january 2012 working group closed november 2013 unlike combination html css xsl-fo unified presentational language semantic markup term used html unlike css modifies default presentation external xml html document stores document data within general idea behind xsl-fo use user writes document fo xml language xhtml docbook tei possible examples user obtains xslt transform either writing one finding one document type question xslt transform converts xml xsl-fo xsl-fo document generated passed application called fo processor fo processors convert xsl-fo document something readable printable common output xsl-fo pdf file postscript fo processors output formats like rtf files even window user gui displaying sequence pages contents xslt language originally conceived purpose widespread use general xml transformations transformation step taken much granted xsl-fo uncommon people call xslt turns xml xsl-fo actual xsl-fo document even tutorials xsl-fo tend written xslt commands around fo processing instructions xslt transformation step exceptionally powerful allows automatic generation table contents linked references index various possibilities xsl-fo document like pdf postscript document definitively describe layout text various pages instead describes pages look like various contents go fo processor determines position text within boundaries described fo document xsl-fo specification even allows different fo processors varying responses regard resultant generated pages example fo processors hyphenate words minimize space breaking line others choose different processors may even use different hyphenation algorithms ranging simple complex hyphenation algorithms take account whether previous next line also hyphenated change borderline cases quite substantially layout various pages cases xsl-fo specification explicitly allows fo processors degree choice regard layout differentiation fo processors creating inconsistent results processors often concern general purpose behind xsl-fo generate paged printed media xsl-fo documents usually used intermediaries mostly generate either pdf files printed document final form distributed opposed html generated distributed final form directly user distributing final pdf rather formatting language input whether html/css xsl-fo means one hand recipients n't affected unpredictability resulting differences among formatting language interpreters hand means document easily adapt different recipient needs different page size preferred font size tailoring on-screen versus on-paper versus audio presentation xsl-fo language designed paged media concept pages integral part xsl-fo structure fo works best could called content-driven design standard method layout books articles legal documents forth involves single flowing span fairly contiguous text various repeating information built margins page opposed layout-driven design used newspapers magazines content documents fit required space trimmed away fit xsl-fo easily handle tight restrictions magazine layout indeed many cases lacks ability express forms said layout despite basic nature language design capable great deal expressiveness tables lists side floats variety features available features comparable css layout features though features expected built xslt xsl-fo documents xml documents conform dtd schema instead conform syntax defined xsl-fo specification xsl-fo documents contain two required sections first section details list named page layouts second section list document data markup uses various page layouts determine content fills various pages page layouts define properties page define directions flow text match conventions language question define size page well margins page importantly define sequences pages allow effects odd even pages look different example one define page layout sequence gives extra space inner margins printing purposes allows space given margin book bound document data portion broken sequence flows flow attached page layout flows contain list blocks turn contain list text data inline markup elements combination two content may also added margins document page numbers chapter headings like blocks inline elements function much way css though rules padding margins differ fo css direction relative page orientation progression blocks inlines fully specified thus allowing fo documents function languages read different english language fo specification unlike css 2.1 uses direction-neutral terms like start end rather left right describing directions xsl-fo basic content markup derived css cascading rules many attributes xsl-fo propagate child elements unless explicitly overridden xsl-fo capable great deal textual layout functionality addition information specified xsl-fo language allows specification following page defined multiple columns case blocks flow one column next default individual blocks set span columns creating textual break page columns break flow columns break text allowed flow section section nature xsl-fo page specification multiple pages may actually different numbers widths columns text flow 3 column page 5 column page 1 column page quite easily fo features work within restrictions multi-column page span multiple columns specifying two attributes i.e.. span padding-after xsl-fo list essentially two sets blocks stacked side side entry consists block left start inline direction block sequence right end inline direction block left conceptually would number bullet list however could easily string text one might see glossary entry block right works expected blocks block containers multiple blocks single list entry numbering xsl-fo lists numbered expected done xslt whatever process generated xsl-fo document number lists explicitly numbered xsl-fo user specify widow orphan blocks flow allow attributes cascade child blocks additionally blocks specified kept together single page example image block description image set never separated fo processor best adhere commands even requires creating great deal empty space page user create footnotes appear bottom page footnote written fo document regular flow text point referenced reference represented inline definition though required body one blocks placed fo processor bottom page fo processor guarantees wherever reference footnote cited reference begin page even means creating extra empty space page fo table functions much like html/css table user specifies rows data individual cell user also specify styling information column background color additionally user specify first row table header row separate styling information fo processor told exactly much space give column told auto-fit text table fo extensive controls orienting blocks text one middle page designate block text oriented different orientation oriented blocks used languages different orientation rest document simply one needs orient text layout purposes blocks contain virtually kind content tables lists even blocks reoriented text version 1.1 xsl-fo adds number new features version 1.0 xsl-fo 1.0 fairly restrictive text allowed go areas page version 1.1 loosens restrictions significantly allowing flowing text mapped multiple explicit regions page allows newspaper-like typesetting many output formats xsl-fo processors specifically pdf bookmarking features allow format specify string text separate window selected user selected document window scrolls immediately specific region document xsl-fo v1.1 provides ability create named bookmarks xsl-fo thus allowing processor pass output format supports xsl-fo 1.1 features support generation index might found back book done referencing properly marked-up elements fo document last page generated without providing explicit in-document reference specific anchor fo document definition last page restricted within specific set pages cover entire document allows user specify something like page 2 15 page 15 page number last page definition table markers allow user create dynamic content within table headers footers running totals bottom page table table continued indicators xsl-fo 1.1 adds keywords inside outside side floats makes possible achieve page layouts marginalia positioned outside inside edges pages inside refers side page towards book binding outside refers side page away book binding xsl-fo 1.1 refines functionality sizing graphics fit ability shrink fit grow fit well ability define specific scaling steps addition resulting scaling factor referenced display example say figure caption image shown 50 actual size trying decide whether xsl-fo work given document following typographic layout requirements usually indicate xsl-fo work although may satisfied proprietary extensions xml html standards css standard since css2 paged media module starts supply basic features printed media css paged media module level 3 w3c completing formulation integrated standard document formatting generate pdfs since 2013 css3-paged w3c proposal xsl-fo replacement software products like prince antenna house formatter demonstrated comparable quality xsl-fo using css pdf production design notes version 2.0 xsl formatting objects first published 2009 last updated 2012 | [
8154,
5631,
5542,
7628,
3363,
7537,
6015,
6016,
6221,
4635,
4097,
7411,
2973,
4743,
1609,
7315,
87,
5191
] | Validation |
4,127 | 3 | Joint_Interoperability_of_Tactical_Command_and_Control_Systems:joint interoperability tactical command control systems joint interoperability tactical command control systems jintaccs united states military program development maintenance tactical information exchange configuration items cis operational procedures originated ensure command control c2 c3 weapons systems us military services nato forces would interoperable made standard message text formats mtf man-readable machine-processable information core set common warfighting symbols data link standards called tactical data links tdls | [] | Test |
4,128 | 9 | Aliasing_(computing):aliasing computing computing aliasing describes situation data location memory accessed different symbolic names program thus modifying data one name implicitly modifies values associated aliased names may expected programmer result aliasing makes particularly difficult understand analyze optimize programs aliasing analysers intend make compute useful information understanding aliasing programs example implementations c programming language perform array bounds checking one exploit implementation programming language compiler computer architecture assembly language conventions achieve aliasing effects writing outside array type buffer overflow invokes undefined behaviour according c language specification however many implementations c show aliasing effects described array created stack variable laid memory directly beside array one could index outside array directly change variable changing relevant array element example int array size 2 example sake calling arr next another int variable call arr 2 i.e 3rd element would aliased adjacent memory int main possible implementations c array block contiguous memory array elements merely referenced offsets address beginning block multiplied size single element since c bounds checking indexing addressing outside array possible note aforementioned aliasing behaviour undefined behaviour implementations may leave space arrays variables stack instance align variables memory locations multiple architecture native word size c standard generally specify data laid memory iso/iec 9899:1999 section 6.2.6.1 erroneous compiler omit aliasing effects accesses fall outside bounds array another variety aliasing occur language refer one location memory one name example pointers see c example xor swap algorithm function assumes two pointers passed distinct fact equal aliases function fails common problem functions accept pointer arguments tolerance lack thereof aliasing must carefully documented particularly functions perform complex manipulations memory areas passed controlled aliasing behaviour may desirable cases aliasing behaviour specified unlike enabled memory layout c common practice fortran perl programming language specifies constructs aliasing behaviour foreach loops allows certain data structures modified directly less code example array 1 2 3 foreach element array print 2 3 4 result one wanted bypass aliasing effects one could copy contents index variable another change copy optimizers often make conservative assumptions variables presence pointers example knowing value variable codice_1 5 normally allows certain optimizations constant propagation however compiler use information assignment another variable example c codice_2 could codice_3 alias codice_1 could case assignment like codice_5 effect assignment codice_3 value x would changed well propagating information codice_1 5 statements following codice_2 would potentially wrong codice_3 indeed alias codice_1 however information pointers constant propagation process could make query like codice_1 alias codice_3 answer codice_13 propagated safely another optimization impacted aliasing code reordering compiler decides codice_1 aliased codice_3 code uses changes value codice_1 moved assignment codice_2 would improve scheduling enable loop optimizations carried enable optimizations predictable manner iso standard c programming language including newer c99 edition see section 6.5 paragraph 7 specifies illegal exceptions access memory location using pointers different types compiler may therefore assume pointers alias rule known strict aliasing rule sometimes allows impressive increases performance known break otherwise valid code several software projects intentionally violate portion c99 standard example python 2.x implement reference counting required changes basic object structs python 3 enable optimization linux kernel strict aliasing causes problems optimization inlined code cases compiled gcc option codice_18 invoked prevent unwanted optimizations could yield unexpected code term aliasing also used describe situation due either hardware design choice hardware failure one available address bits used memory selection process may design decision address bits available necessary support installed memory device failure one address bits may shorted together may forced ground logic 0 supply voltage logic 1 example assume memory design 8 locations requiring 3 address lines bits since 2 8 address bits named a2 a0 decoded select unique memory locations follows standard binary counter fashion table 8 unique combinations address bits selects different memory location however one address bit say a2 shorted ground table would modified follows case a2 always zero first four memory locations duplicated appear second four memory locations 4 7 become inaccessible change occurred different address bit decoding results would different general effect would loss single address bit cuts available memory space half resulting duplication aliasing remaining space | [
1019,
6118,
5983,
7260,
1435,
1281,
3442,
5932,
809,
2803,
7005,
1854,
336
] | Test |
4,129 | 2 | Remote_Application_Programming_Interface:remote application programming interface remote application programming interface rapi remote procedure call rpc mechanism pocket pc server pc application client words rapi allows pc applications call functions executed pocket pc rapi registry file system database configuration pocket pc device available pc application | [
4022,
7149,
4026,
7607,
1526,
6696,
3687,
6699,
4848,
714,
3598,
7438,
720,
6000,
1460,
2018,
5479,
6989,
6991,
8085,
8183,
7263,
2928,
8094,
7907,
5747,
1755,
930,
5850,
590,
5321,
2953,
6840,
150,
6933,
422,
519,
3052,
3407,
4448,
569... | Validation |
4,130 | 7 | Kynapse:kynapse kynapse artificial intelligence middleware product developed kynogon bought autodesk 2008 called autodesk kynapse 2011 re-engineered rebranded autodesk navigation kynapse used development 80 game titles including mafia ii crackdown alone dark 5 fable ii sonic hedgehog 2006 unreal engine kynapse also used companies eads bae systems électricité de france develop military industrial simulation | [
5897,
4408,
2002,
2275,
7898,
4759,
4833,
1606,
578,
6759,
8195,
5666,
3571
] | Test |
4,131 | 8 | SOAPjr:soapjr soapjr protocol specification exchanging structured information implementation web services computer networks hybrid soap json-rpc abbreviated jr case soapjr designed create clean fast ajax-style apis analogous introduction band signalling telephony world traditional soap longer simple object access protocol initially designed bloated overly verbose making bandwidth-hungry slow also based xml making expensive parse manipulate especially mobile embedded clients however core envelope/head/body design pattern useful ajax style apis soapjr uses similar envelope/head/body model using lightweight easier manipulate json contrast soap json-rpc overly simplistic basically tunnels http get-style key/value pairs within query string using json however within json-rpc head/body separation leaving metadata pollute main data space soapjr combines best two concepts designed create modern ajax apis easily used mobile devices embedded systems desktop browsers see soapjr specs detailed description soapjr open source project software released gpl content creative commons following soapjr entities defined json-schemas latest versions also downloaded single file soapjr.org also aims contribute creation common set dmds data model definitions may align json-schema proposal service mapping description proposal applications within specific domains easily share data primary extension soapjr may provide use consistent standardised error codes resources may inform development common data models utilised within microformats rdf basic request view jcard details single user based username message would passed request within json parameter e.g simple soapjr response head.result represents success body contains single jcard record list list search context would contain array 0 jcard records | [
562,
6986,
4276,
7315
] | Validation |
4,132 | 1 | Hindu_genealogy_registers_at_Haridwar:hindu genealogy registers haridwar genealogy registers families maintained brahmin pandits priests ‘ pandas ’ double professional genealogists haridwar subject study many years several cases voluminous records vahis bahi also used settling legal cases regarding inheritance property disputes records held sacrosanct pilgrims pandas many places records trace family history twenty prior generations stretching across many centuries haridwar traditionally site death rites also shraaddha amongst hindus soon also became customary family pandits priest record visit family along gotra family tree marriages members present etc. grouped according family home town centuries registers became important genealogical source many families part splintered families tracing family tree family history well especially partition india 1947 later amongst indian diaspora custom similar panjis panji prabandh extensive genealogical records maintained among maithil brahmins bihar custom well known today indians settled abroad ancient custom detailed family genealogies hindu families past several generations kept professional hindu brahmin pandits popularly known pandas hindu holy city haridwar hand written registers passed generations pandit ancestors classified according original districts villages ones ancestors special designated pandit families charge designated district registers even cases ancestral districts villages left behind pakistan partition india hindus migrate india several cases present day descendants sikhs muslims christians uncommon one find details even one past seven generations genealogy registers kept pandas haridwar centuries hindu ancestors visited holy town haridwar purpose may mostly pilgrimage purposes or/and cremation dead immersion ashes bones kin cremation waters holy river ganges required hindu religious custom ancient custom go pandit charge ones family register update family genealogical family tree details marriages births deaths ones extended joint family present day india people visiting haridwar dumbfounded pundits blue solicit come update ancestral genealogical family tree news travels like wildfire among pandits ones family designated pandit quickly notified ones visit nowadays hindu joint family system broken people preferring nuclear families record keeping pandits prefer visitors haridwar come prepared getting touch ones extended family bringing relevant details regarding ones ancestral district village names grand parents great grand parents marriages births deaths occurred extended family even much details possible families married visiting family member required personally sign family genealogical register furnished ones family panda updating future family visitors generations see authenticate updated entries friends family members accompanying visit may also requested sign witnesses starting around 1977 hindu genealogy records microfilmed later housed genealogical society utah gsu usa since 1981 places records records hindu families kurukshetra pehowa chintpurni jawalapur haridwar jawalamukhi genealogical society utah currently restricts online access hindu genealogy records members church jesus christ latter-day saints lds church others notable places shraadhs performed pitrs noted sites became customary family pandits priest record visit family along gotra family tree marriages members present etc. grouped according family home town centuries registers became important genealogical source many families part splintered families tracing family tree family history thanesar kurukshetra traditionally site death rites also shraaddha amongst hindus genealogy records also kept pitrudhak teerth pehowa banks sarasvati river kurukshetra district haryana site hindu pilgrimage pandava performed death rites mahabharata war genealogy records pilgrims also kept jawalamukhi shakti peetha town nagar parishad kangra district indian state himachal pradesh site hindu pilgrimage genealogy records also kept chintpurni village una district himachal pradesh one shakti peethas major hindu pilgrimage site genealogy records also kept ghats varanasi ganges river major site hindu pilgrimage death rites performed especially manikarnika ghat genealogy records also kept ghats ganges prayagraj long place pilgrimage hindus spawned set priests maintain genealogy records often dating back centuries trimbakeshwar shiva temple ancient hindu temple town trimbak trimbakeshwar tehsil nashik district maharashtra india 28 km city nashik 40 km nashik road dedicated god shiva one twelve jyotirlingas genealogy records also kept purohits pandas tarakeswar shiva temple maintain genealogy records pilgrims | [] | Validation |
4,133 | 4 | FIDO_Alliance:fido alliance fido fast identity online alliance open industry association launched february 2013 whose mission develop promote authentication standards help reduce world ’ over-reliance passwords fido addresses lack interoperability among strong authentication devices reduces problems users face creating remembering multiple usernames passwords fido supports full range authentication technologies including biometrics fingerprint iris scanners voice facial recognition well existing solutions communications standards trusted platform modules tpm usb security tokens embedded secure elements ese smart cards near field communication nfc usb security token device may used authenticate using simple password e.g four-digit pin pressing button specifications emphasize device-centric model authentication wire happens using public-key cryptography user device registers user server registering public key authenticate user device signs challenge server using private key holds keys device unlocked local user gesture biometric pressing button fido provides two types user experiences depending protocol used protocols define common interface client whatever local authentication method user exercises nok nok labs paypal lenovo among fido founders end september 2016 fido members totaled 260 including board made aetna alibaba group amazon american express arm bank america bc card broadcom crucialtec daon egis technology feitian gemalto google hypr infineon intel ing lenovo mastercard microsoft nok nok labs ntt docomo nxp semiconductors oberthur technologies paypal qualcomm rsa samsung electronics synaptics usaa visa vmware onespan yubico full list members available official website following open specifications may obtained fido web site u2f 1.0 proposed standard october 9 2014 starting point short-lived specification known fido 2.0 proposed standard september 4 2015 latter formally submitted world wide web consortium w3c november 12 2015 subsequently first working draft w3c web authentication webauthn standard published may 31 2016 webauthn standard revised numerous times since becoming w3c recommendation march 4 2019 meanwhile u2f 1.2 proposed standard july 11 2017 became starting point client authenticator protocol 2.0 proposed standard published september 27 2017 fido ctap 2.0 complements w3c webauthn scope fido2 project | [
6874,
4295,
4412,
730,
3794,
7380,
2319,
7918,
4348,
2140,
6219,
7120,
6049,
3490,
1505,
87
] | Test |
4,134 | 1 | Quicklaw:quicklaw lexisnexis quicklaw canadian electronic legal research database provides court decisions levels news reports provincial federal statutes journals legal commentary also offers case citator case digests 2002 quicklaw purchased lexisnexis subsidiary lexisnexis canada lexisnexis quicklaw used lawyers law firms canada access case law legislation exclusive current awareness services expert commentary addition research lexisnexis quicklaw service also includes citation tools help lawyers law firms validate authority cases find summaries judicial considerations along treatment pinpoint references lexisnexis quicklaw composed several products providing legal practitioners access need perform research designed practices focus particular legal segments lexisnexis quicklaw essentials provides content needed research areas westlaw/ecarswell offers similar fee-based services canlii.org non-profit organization managed federation law societies canada canlii goal make canadian law accessible free internet website provides access court judgments tribunal decisions statutes regulations canadian jurisdictions canlii part collaboration legal information institute around world include austlii bailii lii etc | [] | Train |
4,135 | 9 | F*_(programming_language):f* programming language f* pronounced f star functional programming language inspired ml aimed program verification type system includes dependent types monadic effects refinement types allows expressing precise specifications programs including functional correctness security properties f* type-checker aims prove programs meet specifications using combination smt solving manual proofs programs written f* translated ocaml f c execution previous versions f* could also translated javascript latest version f* written entirely common subset f* f bootstraps ocaml f open source apache 2.0 license active development github | [
6507,
2451,
7385,
3915,
5231,
5571,
7848,
1649,
578,
5164,
1435
] | Validation |
4,136 | 9 | Bridging_(programming):bridging programming computer science bridging describes systems map runtime behaviour different programming languages share common resources often used allow foreign languages operate host platform native object libraries translating data state across two sides bridge bridging contrasts embedding systems allow limited interaction black box mechanism state sharing limited non-existent apple inc. made heavy use bridging several occasions notably early versions mac os x bridged older classic systems using carbon system well java microsoft common language runtime introduced .net framework designed multi-language start avoided need extensive bridging solutions platforms recently added new bridging systems javascript apple objc-to-js microsoft html bridge programming languages include concept subroutine function mechanism allows commonly used code encapsulated re-used throughout program instance program makes heavy use mathematics might need perform square root calculation various numbers throughout program code might isolated codice_1 function passed number perform square root calculation returns result many cases code question already exists either implemented hardware part underlying operating system program runs within cases codice_2 function simplified calling built-in code functions often fall easily identifiable groups similar capabilities mathematics functions instance handling text files functions often gathered together collections known libraries supplied system commonly past programming language language method calling functions libraries written one language may work another semantics calling functions c different pascal generally c programs call pascal libraries vice versa commonly used solution problem pick one set call semantics default system platform programming languages conform standard computer languages platforms generally added functionality expressed call/return model function garbage collection instance runs throughout lifetime application run sort functionality effectively outside program present expressed directly program functions like generally implemented ever-growing runtime systems libraries compiled programs necessarily visible within code introduction shared library systems changed model conventional program construction considerably past library code copied directly programs linker effectively became part program dynamic linking library code normally exists one place vendor-provided file system applications share aryl systems presented many problems often performance terms shared libraries largely isolated particular languages platforms opposed operating system whole many problems addressed 1990s early 2000s major platforms switched shared libraries primary interface entire system although systems addressed problem providing common code libraries new applications systems generally added runtimes well meant language library entire system often tightly linked together instance openstep entire operating system effect objective-c program programs running wished use extensive object suite provided openstep would able call libraries using obj-c semantics also interact obj-c runtime provide basic control application contrast microsoft .net framework designed start able support multiple languages initially c c++ new version visual basic ms isolated object libraries runtime common language infrastructure cli instead programs compiling directly source code underlying runtime format case languages cli model languages first compiled common intermediate language cil calls common language runtime clr theory programming language use cli system use .net objects although platforms like osx .net offer ability programming languages adapted platform runtime system also case programming languages often target runtime mind objective-c essentially requires obj-c runtime c clr one wants use c code within obj-c vice versa one find version written use runtime often n't exist common version problem concerns use languages platform independent like java runtimes libraries although possible build java compiler calls underlying system like j system would also able interact java code unless re-compiled access code java libraries may difficult impossible rise web browser sort virtual operating system made problem acute modern programming paradigm html5 includes javascript js language document object model major library browser runtime environment although would possible build version js runs clr would largely defeat purpose language designed largely operating browsers unless compiler interact browser directly little purpose using cases many like need arises system allows two runtimes interoperate known bridging runtimes apple made considerable use bridging technologies since earliest efforts led mac os x next first purchased apple plan build new version openstep then-known rhapsody emulator known blue box would run classic mac os programs led considerable push-back developer community rhapsody cancelled place os x would implement many older mac os calls top core functionality openstep providing path existing applications gracefully migrated forward apple took useful code openstep platform re-implemented core functionality pure-c library known core foundation cf short openstep libraries calling cf underlying code became cocoa api new mac-like c libraries became carbon api c obj-c sides system needed share data data obj-c side normally stored objects opposed base types conversions cf could expensive apple willing pay performance penalty implemented scheme known toll-free bridging help reduce eliminate problem time java becoming major player programming world apple also provided java bridging solution developed webobjects platform classical bridging solution direct conversions java openstep/cf types completed code required carbon program using cfstrings using code cocoa application using nsstring two could bridged toll-free java bridge cfstrings instead cast java string objects required work made porting essentially invisible developers made widespread use similar technologies provide support languages including peering system used allow obj-c code call .net code mono need porting solutions waned carbon java bridge deprecated eventually removed later releases system java support migrated using java native interface jni standard java world allowed java interact c-based code osx jni allowed obj-c code used difficulty around 2012 apple extensive work webkit led introduction new bridging technology allows javascript program code call obj-c/cocoa runtime vice versa allows browser automation using obj-c alternately automation cocoa applications using javascript originally part safari web browser 2013 code promoted part new osx 10.9 although examples bridging used past microsoft cli system intended support languages top .net system rather running native runtimes bridging led number new languages implemented cli system often including either hash mark iron name see list cli languages comprehensive set examples concept seen example ms embrace extend extinguish behaviour produced java-like languages c j instance work java code used libraries nevertheless classic windows ecosystem included considerable code would needed used within .net world role ms introduced well supported bridging system system included numerous utilities language features ease use windows visual basic code within .net system vice versa microsoft also introduced javascript bridging technology silverlight html bridge bridge exposes js types .net code .net types js code manages memory access safety similar bridging technologies often javascript one side common various platforms one example js bridge android os written example term also sometimes used describe object-relational mapping systems bridge divide sql database world modern object programming languages | [
1616,
2451,
4662,
5101,
5571,
7096,
5948,
2679,
2420,
7299,
1989,
2530,
6594,
1435
] | Test |
4,137 | 3 | Time_Stamp_Counter:time stamp counter time stamp counter tsc 64-bit register present x86 processors since pentium counts number cycles since reset instruction codice_1 returns tsc edx eax x86-64 mode codice_1 also clears higher 32 bits rax rdx opcode codice_3 pentium competitors cyrix 6x86 always tsc may consider codice_1 illegal instruction cyrix included time stamp counter mii time stamp counter excellent high-resolution low-overhead way program get cpu timing information advent multi-core/hyper-threaded cpus systems multiple cpus hibernating operating systems tsc relied upon provide accurate results — unless great care taken correct possible flaws rate tick whether cores processors identical values time-keeping registers promise timestamp counters multiple cpus single motherboard synchronized therefore program get reliable results limiting run one specific cpu even cpu speed may change power-saving measures taken os bios system may hibernated later resumed resetting tsc latter cases stay relevant program must re-calibrate counter periodically relying tsc also reduces portability processors may similar feature recent intel processors include constant rate tsc identified kern.timecounter.invariant_tsc sysctl freebsd codice_5 flag linux codice_6 processors tsc ticks processor nominal frequency regardless actual cpu clock frequency due turbo power saving states hence tsc ticks counting passage time number cpu clock cycles elapsed windows platforms microsoft strongly discourages using tsc high-resolution timing exactly reasons providing instead windows apis codice_7 codice_8 posix systems program get similar function reading value codice_9 clock using codice_10 function starting pentium pro intel processors practiced out-of-order execution instructions necessarily performed order appear program cause processor execute codice_1 later simple program expects producing misleading cycle count programmer solve problem inserting serializing instruction cpuid force every preceding instruction complete allowing program continue using codice_12 instruction serializing variant codice_1 instruction intel processor families increment time-stamp counter differently specific processor configuration determines behavior constant tsc behavior ensures duration clock tick uniform makes possible use tsc wall clock timer even processor core changes frequency architectural behavior later intel processors amd processors k8 core always incremented time-stamp counter every clock cycle thus power management features able change number increments per second values could get sync different cores processors system windows amd provides utility periodically synchronize counters multiple core cpus since family 10h barcelona/phenom amd chips feature constant tsc driven either hypertransport speed highest p state cpuid bit codice_14 advertises operating system may provide methods use n't use codice_1 instruction time keeping administrator control example versions linux kernel seccomp sandboxing mode disables codice_1 also disabled using codice_17 argument codice_18 system call time stamp counter used time instructions accurately exploited meltdown spectre security vulnerabilities however available counters timers used case arm processors vulnerable type attack processors also registers count cpu clock cycles different names instance avr32 called performance clock counter pccnt register sparc v9 provides codice_19 register armv7 armv8 architectures provide generic counter counts constant frequency powerpc provides 64-bit codice_20 register | [
5799,
4845,
2989,
4847,
2204,
5571,
578,
2141,
1772,
1052,
5261,
352,
263,
971,
4017
] | Test |
4,138 | 4 | Symantec_Endpoint_Protection:symantec endpoint protection symantec endpoint protection developed symantec security software suite consists anti-malware intrusion prevention firewall features server desktop computers largest market-share product endpoint security first release symantec endpoint protection published september 2007 called version 11.0 endpoint protection result merger several security software products including symantec antivirus corporate edition 10.0 client security network access control sygate enterprise edition endpoint protection also included new features example block data transfers unauthorized device types usb flash drives bluetooth devices time symantec antivirus corporate edition widely criticized become bloated unwieldy endpoint protection 11.0 intended address criticisms disk footprint symantec corporate edition 10.0 almost 100 mb whereas endpoint protection projected 21 mb 2009 symantec introduced managed service whereby symantec staff deploy manage symantec endpoint protection installations remotely small business edition faster installation process released 2010 february 2011 symantec announced version 12.0 endpoint protection version 12 incorporated cloud-based database malicious files called symantec insight insight intended combat malware generates mutations files avoid detection signature-based anti-malware software late 2012 symantec released version 12.1.2 supports vmware vshield cloud version endpoint protection released september 2016 followed version 14 november version 14 incorporates machine learning technology find patterns digital data may indicative presence cyber-security threat also incorporates memory exploit mitigation performance improvements symantec endpoint protection security software suite includes intrusion prevention firewall anti-malware features according sc magazine endpoint protection also features typical data loss prevention software typically installed server running windows linux macos 2018 version 14 currently-supported release endpoint protection scans computers security threats used prevent unapproved programs running apply firewall policies block allow network traffic attempts identify block malicious traffic corporate network coming web browser uses aggregate information users identify malicious software 2016 symantec claims use data 175 million devices installed endpoint security 175 countries endpoint protection administrative console allows department modify security policies department programs files exclude antivirus scans manage mobile devices directly treats peripherals connected computer protects computer malicious software mobile device early 2012 source code symantec endpoint protection stolen published online hacker group called lords dharmaraja claimed credit alleging source code stolen indian military intelligence indian government requires vendors submit source code computer program sold government ensure used espionage july 2012 update endpoint protection caused compatibility issues triggering blue screen death windows xp machines running certain third-party file system drivers 2014 offensive security discovered exploit symantec endpoint protection penetration test financial services organization exploit application device control driver allowed logged-in user get system access patched august according gartner symantec endpoint protection 14 one comprehensive endpoint security products available regularly scores well independent tests however common criticism customers fatigued near constant changes product company direction sc magazine said enpoint protection 14 comprehensive tool type superb installation documentation review said endpoint protection no-brainer setup administration wart support fees bit steep forrester said version 12.1 complete endpoint security software product market different security functions software well-integrated report speculated lack integration would addressed version 14 network world ranked symantec endpoint protection sixth endpoint security products based data nss labs testing | [
1809,
4295,
385,
7536,
1838,
4689,
6107,
5051,
6456,
7193,
6149,
7597,
88,
5452,
91,
806,
4398,
1931,
2296,
4783,
496,
7275,
5144,
142,
3394,
5856,
6560,
7289,
4091,
7683,
6235,
6951,
875,
6962,
1249,
5552,
3089,
4492,
7351,
910,
208,
... | Test |
4,139 | 9 | Atari_BASIC:atari basic atari basic interpreter basic programming language shipped atari 8-bit family 6502-based home computers unlike basics home computer era atari basic derivative microsoft basic differs significant ways includes keywords atari-specific features lacks support string arrays example language originally 8 kb rom cartridge first machines 8-bit series 400 800 1200xl starting 600xl 800xl basic built-in machines disabled holding codice_1 key booting xegs disables basic powered without keyboard attached complete annotated source code design specifications atari basic published atari basic source book 1983 machines would become atari 8-bit family originally developed second-generation video game consoles intended replace atari 2600 ray kassar new president atari decided challenge apple computer building home computer instead meant designs among changes needed support basic programming language standard language home computers 1978 atari purchased source code mos 6502 version microsoft 8k basic original 8k basic referred memory footprint compiled intel 8080 instruction set lower code density 6502 expanded code 9 kb slightly larger natural 8 kb size atari rom cartridges atari felt also needed expand language add better support specific hardware features computers similar apple done applesoft basic increased size 9 kb around 11 kb paring code 11 8 kb fit rom turned significant problem adding problem fact 6502 code supplied microsoft undocumented six months later almost ready shippable version interpreter however atari facing january 1979 deadline consumer electronics show ces machines would demonstrated decided ask help get version basic ready time show september 1978 shepardson microsystems bid completing basic shepardson written number programs apple ii family used 6502 processor middle finishing new basic cromemco s-100 bus machines cromemco 32k structured basic shepardson examined existing work decided difficult continue cutting size instead recommended developing completely new version originally 10k size make fit 8k rom common routines would moved operating system roms atari accepted proposal specifications finalized october 1978 paul laughton kathleen o'brien began work new language contract specified delivery date 6 april 1979 also included file manager system later known dos 1.0 atari plans take early 8k version microsoft basic 1979 ces switch new atari basic production development proceeded quickly helped bonus clause contract 8k cartridge available release machines atari took version ces instead ms version atari microsoft basic later became available separate product version shepardson gave atari ces demo supposed final version time delivered demo final delivery weeks later shepardson found several bugs code developed fixes however unknown shepardson atari already sent ces version manufacturing version later known revision among several problems version contains major bug subroutine copies memory deleting lines code exactly 256 bytes long causes lockup sometimes known two-line lockup trigger next line code command entered notorious one problems could fixed pressing key revision b attempted fix major bugs revision released 1983 built-in rom 600xl 800xl models fixing memory copying bug programmer noticed pattern code section inserting lines applied fix fix instead introduced original bug code inserting new lines much common deleting old ones change dramatically increased number crashes another major problem revision b bug added 16 bytes memory program every time codice_2d codice_3ed eventually causing machine run memory even smallest programs mapping atari described awesome bugs advised revision b owners n't fool around get new rom available cartridge atari book provided type-in program patch revision b revision c without cartridge revision c finally eliminated memory leaks revision b version built-in later versions 800xls xe computers xegs revision c also available cartridge production run version determined typing codice_4 ready prompt result codice_5 revision codice_6 revision b codice_7 revision c. atari basic uses line editor like home computer basics unlike basics atari basic scans just-entered program line reports errors immediately error found editor re-displays line highlighting text near error inverse video errors displayed numeric codes descriptions printed manual program lines entered starting line number insert new line amend existing one lines without line number executed immediately programmer types codice_8 program executes lowest line number atari basic allows commands executed modes instance codice_9 command used inside program list statement used display either entire basic program section program lines specifying starting ending line separated comma used output program listing printer program lines logical lines three screen lines physical lines 40 characters 120 characters total cursor moved freely lines unlike basics cursor moved left right editor os handles tracking whether physical line flowed next logical line moving cursor could move within logical lines automatically pressing sends tokenizer logical line cursor sits example pictured codice_10 author needs fix error move cursor codice_11 type editor overwrite mode hit common editing technique say renumbering lines atari basic built-in renumbering command one quickly learn overwrite numbers set lines hit repeatedly put back program atari basic uses token structure handle lexical processing better performance reduced memory size contrast ms-derived basics perform tokenization line-by-line basis program runs atari basic occurs user hits immediate syntax checking described program editing section side effect converting line tokenized form stored shepardson referred early-tokenizing concept pre-compiling interpreter tokenizer converts lines using small buffer memory program stored parse tree token output buffer addressed pointer lomem – 80 81 256 bytes tokenized statement larger buffer generates error 14 – line long output tokenizer moved permanent storage various locations memory set pointers addresses indicates locations variables stored variable name table pointed vntp – 82 83 values stored variable value table pointed vvtp – 86 87 indirecting variable names way reference variable needs two bytes address entry appropriate table strings area pointed starp – 8c 8d runtime stack pointed runstk – 8e 8f used store line numbers looping statements codice_12 subroutines codice_13 finally end basic memory usage indicated address stored memtop – 90 91 pointer atari basic uses unique way recognize abbreviated reserved words keyword abbreviated using period point writing codice_14 expanded codice_9 codice_16 expand abbreviation tokenizer searches list reserved words find first matches portion supplied commonly used commands occur first list reserved words codice_17 beginning typed codice_18 program later codice_9ed always write full words three exceptions codice_20 synonym codice_21 codice_22 synonym codice_23 codice_24 synonym empty string mean thing separate tokens remain program listing keywords communicating peripherals see input/output section codice_25 codice_26 codice_27 actually part tokenized keyword separate symbol example codice_20 codice_29 thing presented differently atari basic includes 12 functions mathematical trigonometric calculations tan function included may derived via exp function deg rad used set whether trigonometric functions use radians degrees radians default rnd function generates number 0 1 parameter function used number derived via pokey random number register address d20a atari basic differs considerably microsoft-style basics way handles strings microsoft basic mostly copied string-handling system dec basic-plus strings first-class types variable bounds allows string variables well arrays strings represented internally computer word pointing storage heap contrast atari basic copied string-handling system hewlett-packard basic basic data type single character strings arrays characters side-effect design true string arrays string variable must dimensioned used example program 20 character string reserved characters excess string length truncated maximum possible length string atari basic 32,768 characters ms basic included function accessing bits strings instance codice_30 would return leftmost 10 characters codice_31 atari basic string represented array access using array indexing functions equivalent statement atari basic would codice_32 note arrays 1-indexed 0-indexed modern variations slicing syntax two-dimensional arrays basics way define work arrays strings atari basic initialize array variables string array may contain whatever random data present memory allocated following trick allows fast string initialization also useful clearing large areas memory unwanted garbage numeric arrays cleared slow ... next loop string concatenation atari basic works following example target string must large enough hold combined string error result input statement used prompt array variables latter must filled indirectly via statement like 20 input b 1 =a array variables atari basic also may contain two subscripts strings included data statements enclosed quote marks atari basic result also possible data items contain comma read statement also used array variables arrays base index 0 statement dim 10 actually creates 11-element array elements 0-10 atari os includes subsystem peripheral device input/output i/o known cio central input/output programs written independently device might use conform common interface rare home computers time new device drivers could written fairly easily would automatically available atari basic program using atari os existing drivers could supplanted augmented new ones replacement example could displace one rom provide 80-column display piggyback generate checksum whenever line returned used verify type-in program listing atari basic supports cio access reserved words routines os graphics fill draw available specific basic keywords line drawing supported command providing area fill fill feature used general cio entry point called using basic command basic statement prepares device i/o access means ensure channel 1 free call driver prepare device set cassette tape spools onto tension advance heads keeping cassette tape player paused means read codes write read-and-write third number auxiliary information set 0 needed name device filename filename ignored cassette driver physical devices numbers mainly disks printers serial devices might plotter daisy-wheel printer may one disk drive present 1 assumed lprint statement used output strings printer atari basic include equivalent microsoft basic get inkey commands detect keypress simulated either pokeing keyboard driver directly opening file e.g open 1,4,0 k get 1 although latter wait keypress unlike get inkey typing codice_33 basic exit atari dos command menu unsaved programs lost command display disk directory within basic must done exiting dos dos occupies roughly 5k memory thus cassette-based atari machine 48k greater around 37,000 bytes free basic program memory 32,000 bytes dos present basic use extra ram xl xe machines atari basic built-in support sound via statement graphics joysticks paddles n't supplied command fill arbitrary shape pixels limited operating system function exists called command also commands drawing lines graphics primitives combination plot drawto statements used draw lines dedicated command clearing screen atari basic usually done prints clear screen control code analogous commodore basic atari basic include tab function simulated either pokeing cursor column position 55 tab position c9 default value 10 changed values take effect print statement executed also spc function atari basic advanced aspects hardware player/missile graphics sprites redefined character sets setting color palette/luminance tables scrolling custom graphics modes supported basic require machine language routines peek/poke statements graphics modes accessed basic atari 400/800 os roms support way access machine language setting antic registers display list manually os roms xl/xe added support modes bitmap modes basic normally set text window occupying last three rows bottom screen user may display prompts enter data program 16 added mode number invoked via graphics statement entire screen bitmap mode e.g graphics 8+16 bitmap mode full screen invoked atari basic automatically switch back text mode program execution terminated unlike many basics leave user bitmap mode unreadable screen switched via typing blind command resetting computer bitmap coordinates calculated range 1 maximum row/column minus one thus mode 6 160x192 maximum coordinates pixel 159 191 user goes allowed coordinates mode basic exit error unlike ms-derived basics atari basic allows numeric variables expressions used supply line numbers codice_22 codice_35 commands used clarify code instance subroutine clears screen could written codice_36 much easier understand typical codice_37 particular subroutine executed frequently placing line number variable also improve execution speed faster basic look constant variable instead processing time statement executed basics era allow codice_9 command send source code printer device atari basic also includes codice_39 command reads source code device merges back program user typed allows programs saved sections reading using codice_39 merge replace existing code carefully using blocks line numbers overlap programmers build libraries subroutines merge new programs needed atari basic call machine code subroutines machine code generally stored strings anywhere memory code needs position independent 256-byte page 6 area starting address 1536 600 used basic operating system code loaded page 6 reading codice_41 statements machine code invoked codice_42 function first parameter address machine code routine following values parameters example machine language code stored string named codice_43 called parameters parameters pushed onto hardware stack 16-bit integers order specified codice_42 function low byte high byte order last value pushed stack byte indicating number arguments machine language code must remove values returning via codice_45 instruction value returned basic program placing addresses 212 213 d4 d5 16-bit integer running original hardware atari basic slower home computer basics often large amount two widely used benchmarks era byte magazine sieve eratosthenes creative computing benchmark test written david h. ahl atari much slower apple ii even sinclair zx81 finishing near end list terms performance despite atari cpu running 1.79 mhz twice speed 6502-based computers language slowness stemmed two problems first numeric values basic stored floating-point binary coded decimal bcd format includes numbers integers like line numbers array indexes every time number encountered interpreter convert bcd format internal binary representation using routines operating system floating point math routines atari slow notably bcd binary conversion function affected programs byte benchmark constant conversion array indexes greatly slows program ahl benchmark single exponent operation loops poorly optimized multiplication function responsible much machine poor showing second problem due atari basic implemented loops branches perform branch codice_22 codice_35 interpreter searches entire program matching line number needs atari already slowed need convert numbers binary however serious problem case codice_48 ... codice_49 loop interpreters would push pointer location codice_48 stack reached codice_49 could easily return codice_48 atari basic location memory placed stack line number meant every time codice_49 encountered system search entire program find line loops atari basic program cause large loss performance relative basics several basics atari addressed issues resulting large performance gains basic xl reduced time byte benchmark 194 58 seconds three times fast accomplished caching location codice_54 loops basics cache also used codice_22 codice_35 improvements turbo-basic xl included similar caching well re-written high-performance floating-point library ahl benchmark atari basic required 405 seconds exactly code turbo basic took 41.6 seconds | [
3931,
5367,
1255,
12,
2463,
6891,
8183,
5651,
2925,
7448,
5926,
5129,
5571,
7906,
5137,
5234,
2941,
3303,
1304,
61,
6394,
4003,
7864,
1789,
5877,
4012,
4745,
1064
] | Test |
4,140 | 9 | Modem_script:modem script modem script settings file software programs use communicate modem also known ccl files connection control language files like modem init string modem scripts files provide modem configuration settings modem scripts go beyond init strings providing internal scripting language script authors use tune modem response main use terminal emulators dialers | [
768,
3698
] | Test |
4,141 | 4 | Greenpois0n:greenpois0n greenpois0n name shared series ios jailbreaking tools developed chronic dev team sometimes called greenpois0n team use exploits remove software restrictions iphones ipads ipod touches apple tvs greenpois0n initial release october 2010 jailbroke ios 4.1 second version february 2011 jailbroke ios 4.2.1 well ios 4.2.6 cdma iphones second generation tool greenpois0n absinthe developed iphone dev team members jailbroke ios 5.0.1 january 2012 providing first jailbreak iphone 4s second version jailbroke ios 5.1.1 may 2012 providing first jailbreak third generation ipad jailbreaking enables root access ios operating system allowing installation applications customizations unavailable official app store ios jailbreaking voids device warranty apple releases ios updates make jailbreaking difficult october 12 2010 chronic dev team released greenpois0n desktop-based tool jailbreaking ios 4.1 iphone 4 iphone 3gs ipod touch third fourth generation ipad 1 development apple released second generation apple tv greenpois0n developers reported could jailbreak apple tv well developers announced plans release october 10 news spread another jailbreak developer george hotz preparing release jailbreaking tool called limera1n would perform similar function different exploit greenpois0n developers delayed order integrate limera1n exploit supported devices using limera1n also meant original greenpois0n exploit shatter could saved use later jailbreaks shatter limera1n boot rom exploits means patched ios updates boot rom code embedded ios devices manufacturing february 2011 chronic dev team released new version greenpois0n jailbreak ios 4.2.1 jailbreak ios 4.2.6 cdma verizon iphone 4 desktop-based tools os x microsoft windows linux provides untethered jailbreak means jailbroken device rebooted without computer assistance supports ipad iphone ipod touch apple tv chronic dev team announced support newly released cdma iphone 4 devices stores developers chronic dev team iphone dev team released greenpois0n absinthe sometimes simply known absinthe january 2012 desktop-based tool os x microsoft windows linux jailbreak iphone 4s first time ipad 2 second time ios 5.0.1 devices also ios 5.0 iphone 4s absinthe provides untethered jailbreak means jailbroken device rebooted without computer assistance incorporated untether exploit called corona pod2g released december older ios devices next web said jailbreak took long time released venturebeat said absinthe n't easy use earlier jailbreaking tool jailbreakme according iphone dev team approximately one million devices newly jailbroken three days absinthe release developers called joint effort jailbreak dream team apple credited document listing security patches subsequent version ios may 2012 developers chronic dev team iphone dev team released absinthe 2.0 os x windows linux jailbreak ios 5.1.1 untethered iphone ipad ipod touch models support ios 5.1.1 including jailbreaking third generation ipad first time announced hack box security conference amsterdam end presentation earlier absinthe jailbreak initially support recently released model ipad 2 according chronic dev team approximately one million devices jailbroken weekend friday release pc world noted devices jailbroken tools absinthe 2.0 security concern companies bring device policies | [
6788,
3648,
6312,
4575,
4759,
6628,
5571,
578,
1992
] | Test |
4,142 | 1 | MultiValue:multivalue multivalue type nosql multidimensional database typically considered synonymous pick database originally developed pick operating system multivalue databases include commercial products rocket software zumasys revelation ladybridge intersystems northgate information solutions ongroup companies databases differ relational database features support encourage use attributes take list values rather attributes single-valued often categorized mumps within category post-relational databases although data model actually pre-dates relational model unlike sql-dbms tools multivalue databases accessed without sql nelson designed multivalue data model early mid-1960s dick pick developer trw worked first implementation model us army 1965 pick considered software public domain written military first dispute regarding multivalue databases addressed courts ken simms wrote databasic sometimes known s-basic mid-70 based dartmouth basic enhanced features data management simms played lot star trek developing language order language function satisfaction three implementations multivalue pick version r77 microdata reality 3.x prime information 1.0 similar spite attempts standardize particularly international spectrum spectrum manufacturers association designed logo use standards across multivalue implementations subsequently flavors diverged although cross-over streams multivalue database development could classified one stemming pick r83 one microdata reality one prime information differences implementations provisions supporting several flavors languages attempt document similarities differences found post-relational database reference prdb marketing groups others industry years classified multivalue databases pre-relational post-relational relational embedded detractors often classifying legacy could classified nosql data model aligns well json xml permits access without use sql one reasonable hypothesis data model lasting 50 years new database implementations model even 21st century provides inexpensive database solutions historically industry benchmarks tied sql transactions difficult hypothesis test although considerable anecdotes failed attempts get functionality multivalue application relational database framework spite history 40 years implementations starting trw many multivalue industry remained current various multivalue implementations employ object-oriented versions data/basic support ajax frameworks one needs use sql databases fit nosql umbrella fact multivalue developers first acquire nosql domain names likely prior database products classifying offerings nosql well multivalue seasoned data model several vendors competing multivalue space continuously enhanced years multivalue database system data stored using two separate files file store raw data dictionary store format displaying raw data example assume file table called person file attribute called emailaddress emailaddress field store variable number email address values single record list joe example.com jdb example.net joe_bacde example.org stored accessed via single query accessing associated record achieving one-to-many relationship within traditional relational database system would include creating additional table store variable number email addresses associated single person record however modern relational database systems support multi-value data model example postgresql column array base type like java programming language typical data/basic compiler compiles p-code runs p-machine jbase notable exception many different implementations compilers multivalue databases like php programming language data/basic language typecasting programmer known english access aql uniquery retrieve cmql many names years corresponding different multivalue implementations multivalue query language differs sql several respects query issued single dictionary within schema could understood virtual file portal database view data statement would list e-mail addresses person whose last name starts van single entry would output person multiple lines showing multiple e-mail addresses without repeating data person | [
4946,
6029,
6462,
7303,
674,
5810,
2054,
6543,
4769,
5956
] | Test |
4,143 | 4 | SF_City_ID_Card:sf city id card sf city id card municipal identification card program operated san francisco california residents city-county regardless immigration status cards also specify person gender assist transgender individuals often difficulty identification documents stated purpose photo id card streamline access city programs connect residents local businesses program modeled similar program operating new connecticut since 2007 according sf city id card website users card use cards accepted licenses drive purchase alcohol tobacco recognized federal state law possession cards considered mandatory city government applicants must submit proof identity city residency parents may obtain card minor separate cards children 13 anyone 14 years age older fee ranging 5 15 charged card expiration card occurs every 2 years cardholder turns 14 years age loses residency city limits supervisor tom ammiano said card public safety measure make residents living social margins likely seek help police well giving access banking services city bound law keep names private information confidential “ maximum extent permitted applicable laws ” according city attorney office early months 2007 immigration customs enforcement ice conducted dozens raids us conducted arrest deportation hundreds immigrants one states affected california latin american alliance immigrant rights aliadi bay area based grassroots organization founded miguel robles conformed local leaders like ramon cardona attorney daniel luna miguel perez julio garcia among others organized press conference san francisco city hall request order materialize sanctuary status city county san francisco city officials must issue resident identification card improve interaction community members regardless migratory status police officers well allow san francisco residents access city services open bank accounts aliadi started conversations supervisors chris daly gerardo sandoval tom ammiano supervisor chris daly showed interest political reasons could n't sponsor gerardo sandoval interested chief staff lupita peimbert suggested aliadi ask supervisor tom ammiano showed interest finally supported concept aliadi gathered 40 grassroots organizations non profits saw city id card tool improve life clients members concept adopted san francisco aliadi organized february 16 2008 women building first 3 conferences called cities integrating communities 1st event attended 100 organizers spark launch campaigns support city identification cards richmond santa clara county oakland los angeles detroit chicago minneapolis among others aliadi invited present experiences ordinance authorizing county clerk issue id card passed board supervisors november 20 2007 immigration group washington-based immigration reform law institute filed legal challenge law claiming program conflicts federal law judge dismissed challenge october 14 2008 first cards issued january 15 2009 san francisco thus became one small growing number municipalities issuing municipal identification cards undocumented immigrants access form document | [
4459
] | Test |
4,144 | 4 | HTTP_response_splitting:http response splitting http response splitting form web application vulnerability resulting failure application environment properly sanitize input values used perform cross-site scripting attacks cross-user defacement web cache poisoning similar exploits attack consists making server print carriage return cr ascii 0x0d line feed lf ascii 0x0a sequence followed content supplied attacker header section response typically including input fields sent application per http standard rfc 2616 headers separated one crlf response headers separated body two therefore failure remove crs lfs allows attacker set arbitrary headers take control body break response two separate responses—hence name generic solution url-encode strings inclusion http headers location set-cookie typical examples sanitization include casting integers aggressive regular expression replacement although response splitting specific php php interpreter contains protection attack since version 4.4.2 5.1.2 | [
3932,
6029,
5115,
84,
3999,
3383,
2901
] | Test |
4,145 | 5 | Remote_job_entry:remote job entry remote job entry procedure sending requests data processing tasks 'jobs mainframe computers remote workstations extension process receiving output tasks remote workstation rje workstation called remote usually located distance host computer workstation connects host modem local area network lan today known client–server model rje early form request–response architecture terms remote batch remote job system remote job processing also used rje facilities remote job entry rje also name os/360 component provided rje services rje workstation operator may complete console control job flow workstation mainframe depending local configuration policy conversational remote job entry crje component os/360 os/vs1 provides job submission job retrieval editing user interactive terminal netrjs protocol developed campus computing network ucla deliver batch jobs ibm 360 model 91 protocol originally assigned arpanet initial connection protocol sockets 71 73 75 later reassigned internet ports 71-74 | [
768,
607,
7858,
4428,
7331,
1554,
7264,
1493,
2933,
1774,
7024,
5911,
7973
] | Test |
4,146 | 8 | Usage_analysis:usage analysis usage analysis technique understanding usage statistics something example web statistics website | [
84
] | Test |
4,147 | 2 | Smarterphone:smarterphone smarterphone norwegian company making software mobile phones founded 1993 kvaleberg renamed december 2010 june 2007 venture capital investor ferd invested €2 million company january 2010 €3.6 million invested nokia completed acquisition smarterphone november 2011 head office oslo norway company also offices taiwan south korea japan united states smarterphone develops mobile software handsets mobile phone oems odms chipset vendors customers company also provides professional services areas 2008 kvaleberg company joined limo foundation 2009 mobile world congress presented madrid handset cooperation compal communications company main product smarterphone os platform-independent full mobile phone operating system applications suite feature phone segment smarterphone os called mimiria first unveiled mobile world congress show february 2008 used handsets kyocera c4700 vibo t588 madrid limo device smarterphone architecture clean-room strict model-view-controller design enables variations implemented little effort user interface smarterphone os programmed scripting language variant scheme object-oriented extensions smarterphone os includes user interface mmi software stack implementing full user interface middleware 2g 3g feature phones also integrates range third-party modules java jvm oracle corporation mobile browser obigo mms sms stack mobile messaging factory predictive text input nuance cootek handwriting recognition sinovoice nokia asha platform inherits capabilities smarterphone | [
7032,
6874,
2520,
6440,
3653,
1582,
3751,
3637,
1565
] | Test |
4,148 | 3 | IBM_ThinkPad_240:ibm thinkpad 240 ibm thinkpad 240 ultra-portable laptop computer designed produced ibm june 1999 2001 one thinkpad 200 series models made available america smallest lightest thinkpad model produced date 240 series discontinued well 570 series replaced thinkpad x series 2000 first 240 series models included 300 mhz mobile celeron processor 64 mb built-in ram one slot memory expansion maximum 320 mb laptop also one first feature mini pci card slot built-in optical drive diskette drive included due size limitations external drive access via usb 1.0 port and/or ibm external floppy drive connector unit shipped either standard 6 gb hard disk drive 12 gb upgrade option 240 series models feature 10.4 tft display first models featured neomagic magicgraph128xd graphics chips 2 mb video memory 240 capable displaying svga 800x600 tft display xga output available external monitor 240s also audio controllers vga ports connect external display devices | [
2342,
1237,
6169
] | Test |
4,149 | 6 | Shadow_paging:shadow paging computer science shadow paging technique providing atomicity durability two acid properties database systems page context refers unit physical storage probably hard disk typically order 1 64 kib shadow paging copy-on-write technique avoiding in-place updates pages instead page modified shadow page allocated since shadow page references pages disk modified liberally without concern consistency constraints etc page ready become durable pages referred original updated refer new replacement page instead page activated ready atomic referring pages must also updated via shadow paging procedure may recurse many times becoming quite costly one solution employed wafl file system write anywhere file layout lazy making pages durable i.e write-behind caching increases performance significantly avoiding many writes hotspots high referential hierarchy e.g file system superblock cost high commit latency write-ahead logging popular solution uses in-place updates shadow paging similar old master–new master batch processing technique used mainframe database systems systems output batch run possibly day work written two separate disks form storage medium one kept backup used starting point next day work shadow paging also similar purely functional data structures in-place updates avoided | [
3599
] | Train |
4,150 | 1 | Dark_data:dark data dark data data acquired various computer network operations used manner derive insights decision making ability organisation collect data exceed throughput analyse data cases organisation may even aware data collected ibm estimate roughly 90 percent data generated sensors analog-to-digital conversions never get used industrial context dark data include information gathered sensors telematics organizations retain dark data multitude reasons estimated companies analyzing 1 data often stored regulatory compliance record keeping organizations believe dark data could useful future acquired better analytic business intelligence technology process information storage inexpensive storing data easy however storing securing data usually entails greater expenses even risk potential return profit lot dark data unstructured means information formats may difficult categorise read computer thus analysed often reason business analyse dark data amount resources would take difficulty data analysed according computer weekly 60 organisations believe business intelligence reporting capability inadequate 65 say somewhat disorganised content management approaches useful data may become dark data becomes irrelevant processed fast enough called perishable insights live flowing data example geolocation customer known business business make offer based location however data processed immediately may irrelevant future according ibm 60 percent data loses value immediately analysing data immediately letting go 'dark lead significant losses organisation terms identifying fraud example fast enough addressing issue late according new york times 90 energy used data centres wasted data stored energy costs could saved furthermore costs associated underutilisation information thus missed opportunities according datamation storage environments emea organizations consist 54 percent dark data 32 percent redundant obsolete trivial data 14 percent business-critical data 2020 add 891 billion storage management costs otherwise avoided continuous storage dark data put organisation risk especially data sensitive case breach result serious repercussions financial legal seriously hurt organisation reputation example breach private records customers could result stealing sensitive information could result identity theft another example could breach company sensitive information example relating research development risks mitigated assessing auditing whether data useful organisation employing strong encryption security finally determined discarded discarded way becomes unretrievable generally considered advanced computing systems analysis data built higher value dark data noted data analytics foundation modern industrial revolution course includes data currently considered dark data since enough resources process data collected used future bring maximum productivity ability organisations meet consumers demand technology advancements helping leverage dark data affordably thanks young innovative companies datumize veritas lucidworks furthermore many organisations realise value dark data right example healthcare education organisations deal large amounts data could create significant potential service students patients manner consumer financial services pursue target population | [] | Test |
4,151 | 8 | ERuby:eruby eruby embedded ruby templating system embeds ruby text document often used embed ruby code html document similar asp jsp php server-side scripting languages templating system eruby combines ruby code plain text provide flow control variable substitution thus making easy maintain view module rails responsible display response output browser simplest form view piece html code static content applications static content may enough many rails applications require dynamic content created controller action method displayed view made possible using embedded ruby generate templates contain dynamic content embedded ruby allows ruby code embedded view document code gets replaced proper value resulted execution code run time ability embed code view document risk bridging clear separation present mvc frame thus responsibility developer make sure clear separation responsibility among model view controller modules his/her application eruby allows ruby code embedded within pair codice_1 codice_2 delimiters embedded code blocks evaluated in-place replaced result evaluation apart creating web pages eruby also used create xml documents rss feeds forms structured text files eruby dynamically generates static files based templates functionalities eruby found erb library different types tag markers used erb templates indicates tag encloses expression tag starts opening tag delimiter followed equal symbol ends end tag delimiter rendering template piece code gets substituted result code evaluated result string gets converted string rendered example resulting text looks like value x 500 code enclosed tags called scriptlet code tag gets executed result gets replaced place scriptlet tags must matching tag denote end functional block example example text list item gets printed four times scriptlet produces text makes enclosed statement run multiple times output code contents comment tags n't get rendered output tags start open tag delimiter followed hash symbol end end tag delimiter example comment tag shown comment ruby ruby code ignored generates nothing things common eruby simply common ruby string substitution codice_3 similar languages perl php newlines eruby suppressed adding hyphen beginning end tag delimiter example 2.times end output code value name gets printed twice line several implementations eruby namely erb implementation eruby written purely ruby programming language included ruby standard library template generated running piece code written using erb object simple example shown require 'erb' x 400 simple_template value x x renderer erb.new simple_template puts output renderer.result binding result looks follows value x 400 could achieved using code make use erb object x 400 string value x x puts string code snippets generate output happens interchange lines 2 line 3 first code snippet line 1 line 2 second code snippet first snippet changes code shown require 'erb' simple_template value x x x 400 renderer erb.new simple_template puts output renderer.result binding still generates output i.e. value x 400 second code snippet changes code string value x x x 400 puts string code get executed 1st line know value x gets executed thus main reason using erb object write templates ahead time binding variables methods may exist given time template gets processed result called erb object order get access instance methods instance variable object erb makes use binding object access variables methods object given private binding object exists ruby class easy get access methods variables within method class access variables different class class expose binding object via public method example shown class erbexample end example erbexample.new variable1 renderer erb.new template puts output renderer.result example.get_binding see example exposing binding object class erbexample furthermore used binding object access variables methods class within one methods new method erb object takes two parameters second parameter specifies safety level giving number second parameter max value 4 one make template run different thread value number determines safety level maximum isolation level unless binding object marked trusted erb use third parameter specify optional modifiers used control adding newlines output example make sure erb output newlines tag ends create erb object shown renderer erb.new template 3 provide third parameter ignore second parameter use 0 input second parameter erb many methods exposed used render template full list apis exposed erb object refer erb documentation given reference section already explained previous sections erb used generate templates often used generate web pages text files usually needs erb push output desired file achieve use redirection ability provided command-line redirect output file rather making print standard output example output gets redirected my_view.html.erb file linking third party libraries achievable making use -r option providing name library remember functionality one remember ruby key word require functionality -r option example uses ipaddr library mentioned safety levels previous section one specify safety level command line argument using -s option erubis implementation eruby implemented ruby also java according home page runs faster eruby erb several useful options including alternate tags allowing valid xml ember pure ruby implementation eruby linux allows debugging eruby templates improves composability provides powerful shorthand eruby directives table compares tags available implementations | [
5983,
1532,
5369,
6428,
2211,
397,
1378,
3021,
578,
3462,
7370,
1287,
3879,
6029,
3889,
7671,
952,
8137,
4909,
1989,
1803
] | Test |
4,152 | 9 | Heinz_Rutishauser:heinz rutishauser heinz rutishauser 30 january 1918 – 10 november 1970 swiss mathematician pioneer modern numerical mathematics computer science heinz rutishauser father died 13 years old mother died three years later together younger brother sister went live uncle home 1936 rutishauser studied mathematics eth zürich graduated 1942 1942 1945 assistant walter saxer eth 1945 1948 mathematics teacher glarisegg trogen 1948 received phd eth well-received thesis complex analysis 1948 1949 rutishauser united states universities harvard princeton order study state art computing 1949 1955 research associate institute applied mathematics eth zürich recently founded eduard stiefel worked together ambros speiser development first swiss computer ermeth developed programming language superplan 1949–1951 name reference rechenplan i.e computation plan konrad zuse terminology designating single plankalkül-program contributed particular field compiler pioneering work eventually involved defining programming languages algol 58 algol 60 among contributions introduced number basic syntactic features programming notably keyword codice_1 loop first german für superplan next via english translation algol 58 1951 rutishauser became lecturer german privatdozent 1955 appointed extraordinary professor 1962 associate professor applied mathematics eth 1968 became head group computer science later became computer science institute ultimately 1981 division computer science eth zürich least since 1950s rutishauser suffered heart problems 1964 suffered heart attack recovered died 10 november 1970 office acute heart failure untimely death wife margaret took care publication posthumous works | [
1361,
1114,
6146,
4302,
6497,
4222,
1243
] | Test |
4,153 | 9 | Andrew_D._Gordon:andrew d. gordon andrew d. gordon british computer scientist employed microsoft research research interests include programming language design formal methods concurrency cryptography access control gordon earned ph.d. university cambridge 1992 1997 gordon research fellow university cambridge computer laboratory joined microsoft research laboratory cambridge england principal researcher programming principles tools group also holds professorship university edinburgh gordon one designers concurrent haskell functional programming language explicit primitives concurrency co-designer martin abadi spi calculus extension π-calculus formalized reasoning cryptographic systems luca cardelli invented ambient calculus reasoning mobile code moritz y. becker cédric fournet gordon also designed secpal microsoft specification language access control policies gordon ph.d. thesis functional programming input/output 1993 distinguished dissertation award british computer society 2000 paper ambient calculus subject luca cardelli anytime anywhere modal logics mobile ambients 2010 sigplan influential popl paper award | [
6642
] | Test |
4,154 | 3 | Instruction-level_parallelism:instruction-level parallelism instruction-level parallelism ilp measure many instructions computer program executed simultaneously two approaches instruction level parallelism hardware level works upon dynamic parallelism whereas software level works static parallelism dynamic parallelism means processor decides run time instructions execute parallel whereas static parallelism means compiler decides instructions execute parallel pentium processor works dynamic sequence parallel execution itanium processor works static level parallelism consider following program operation 3 depends results operations 1 2 calculated completed however operations 1 2 depend operation calculated simultaneously assume operation completed one unit time three instructions completed total two units time giving ilp 3/2 goal compiler processor designers identify take advantage much ilp possible ordinary programs typically written sequential execution model instructions execute one order specified programmer ilp allows compiler processor overlap execution multiple instructions even change order instructions executed much ilp exists programs application specific certain fields graphics scientific computing amount large however workloads cryptography may exhibit much less parallelism micro-architectural techniques used exploit ilp include known ilp exploited compiler hardware support compiler also provides inherent implicit ilp programs hardware compilation optimization optimization techniques extracting available ilp programs would include scheduling register allocation/renaming memory access optimization dataflow architectures another class architectures ilp explicitly specified recent example see trips architecture recent years ilp techniques used provide performance improvements spite growing disparity processor operating frequencies memory access times early ilp designs ibm system/360 model 91 used ilp techniques overcome limitations imposed relatively small register file presently cache miss penalty main memory costs several hundreds cpu cycles principle possible use ilp tolerate even memory latencies associated resource power dissipation costs disproportionate moreover complexity often latency underlying hardware structures results reduced operating frequency reducing benefits hence aforementioned techniques prove inadequate keep cpu stalling off-chip data instead industry heading towards exploiting higher levels parallelism exploited techniques multiprocessing multithreading | [
5012,
1447,
5371,
3948,
7527,
7529,
5737,
4318,
2567,
4694,
5042,
1481,
5055,
2226,
1867,
2961,
2248,
3667,
2969,
6148,
441,
4742,
5447,
2266,
4047,
1546,
4049,
5483,
1556,
5487,
6198,
1568,
1570,
6922,
3041,
7666,
1586,
515,
8024,
1592,
... | Test |
4,155 | 4 | Hiya_(company):hiya company hiya seattle-based company provides caller profile information help consumers identify incoming calls block unwanted ones hiya originally developed caller-id app whitepages largest database contact information americans april 2016 hiya spun whitepages april 2016 hiya app 25 million downloads whitepages founder alex algard stepped parent company focus leading hiya april 2016 employs 40 february 2016 hiya time part whitepages reached deal samsung integrate caller profile spam protection services galaxy s7 galaxy s7 edge phones 16 countries.the company extended partnership samsung separate deal august 2016 include service galaxy note 7 expand partnership total 28 countries august 2016 hiya launched hiya cloud network level caller id call-blocking offering offering limited version app iphones hiya announced september 2016 full version app would available ios 10 soon hiya began providing spam protection services phones call protect product 2017 hiya entered similar partnership zte provide call spam protection services axon 7 users october 2017 hiya announced received first outside funding series 18 million led balderton capital participation nautilus venture partners lumia capital hiya said would use funds expand globally following investment balderton ’ lars fjeldsoe-nielsen early executive uber dropbox joined hiya ’ board hiya database 1.5 billion phone numbers draws identify source incoming calls helps users make decision whether want pick call unknown number service automatically block calls numbers deemed associated fraud notifies user blocked call cases app let call go notify user number suspected spam users report numbers associated unwanted calls app well block future calls certain phone numbers | [] | Test |
4,156 | 2 | .NET_Core:.net core .net core free open-source managed computer software framework windows linux macos operating systems open source cross platform successor .net framework project primarily developed microsoft released mit license 1.0 announced november 12 2014 released june 27 2016 along microsoft visual studio 2015 update 3 enables .net core development 1.0.4 .net core 1.1.1 released along .net core tools 1.0 visual studio 2017 march 7 2017 .net core 2.0 released august 14 2017 along visual studio 2017 15.3 asp.net core 2.0 entity framework core 2.0 2.1 released may 30 2018 .net core 2.2 released december 4 2018 .net core 3 announced may 7 2019 microsoft build currently preview builds available official release planned september 2019 .net core 3 framework get support development desktop application software artificial intelligence/machine learning iot apps next release .net core 3.0 .net 5 .net framework deprecated .net 5 .net going forwardhence removal core branding skipping version 4 avoid confusion .net framework 4.x .net core fully supports c f partially supports visual basic .net currently vb.net compiles runs .net core separate visual basic runtime implemented microsoft announced .net core 3 would include visual basic runtime c++/cli yet supported although support planned windows supports four cross-platform scenarios asp.net core web apps command-line apps libraries universal windows platform apps prior .net core 3.0 implement windows forms windows presentation foundation wpf render standard gui desktop software windows however .net core 3 supports desktop technologies winforms wpf universal windows platform uwp supports use nuget packages unlike .net framework serviced using windows update relies package manager receive updates similar .net framework implements common language infrastructure cli via common language runtime clr framework class library fcl two main components coreclr corefx respectively cli implementation virtual execution system ves coreclr complete runtime virtual machine managed execution programs includes just-in-time compiler called ryujit also contains corert runtime optimized integrated aot compiled native binaries cli implementation foundational standard libraries corefx shares subset apis however also comes apis part variant library used uwp command-line interface offers execution entry point operating systems provides developer services like compilation package management | [
7149,
714,
720,
1460,
1840,
2928,
7907,
5747,
2953,
6840,
422,
2619,
6504,
4022,
4026,
7607,
1526,
3687,
4759,
7247,
2283,
5479,
7263,
5850,
150,
6933,
519,
3052,
4448,
3407,
1232,
2702,
7687,
1989,
4477,
4848,
2018,
8085,
6989,
6991,
5... | Validation |
4,157 | 1 | Universal_IR_Evaluation:universal ir evaluation computer science universal ir evaluation information retrieval evaluation aims develop measures database retrieval performance shall comparable across information retrieval tasks ir information retrieval evaluation begins whenever user submits query search term database user able determine relevance document database relevant relevant query complete set documents naturally divided four distinct mutually exclusive subsets relevant documents retrieved relevant documents retrieved relevant documents retrieved relevant documents retrieved four subsets documents denoted letters b c respectively called swets variables named inventor addition swets definitions four relevance metrics also defined precision refers fraction relevant documents retrieved a/ a+b recall refers fraction retrieved documents relevant a/ a+c commonly used well-known relevance metrics found ir evaluation literature two less commonly used metrics include fallout i.e. fraction relevant documents retrieved b/ b+d miss refers fraction relevant documents retrieved c/ c+d given search universal ir evaluation addresses mathematical possibilities relationships among four relevance metrics precision recall fallout miss denoted p r f respectively one aspect problem involves finding mathematical derivation complete set universal ir evaluation points complete set 16 points one quadruple form p r f describes possible universal ir outcomes example many us experience querying database retrieving documents case precision would take undetermined form 0/0 recall fallout would zero miss would value greater zero less one assuming mix relevant relevant documents database none retrieved universal ir evaluation point would thus denoted 0/0 0 0 represents one 16 possible universal ir outcomes mathematics universal ir evaluation fairly new subject since relevance metrics p r f analyzed collectively recently within past decade lot theoretical groundwork already formulated new insights area await discovery detailed mathematical analysis query sciencedirect database universal ir evaluation retrieves several relevant peer-reviewed papers | [
2054
] | Train |
4,158 | 7 | BaseN:basen basen global full stack internet things iot operator headquartered helsinki finland basen established 2001 provide extremely scalable fault-tolerant network service management systems telecom operators large multinational enterprises basen develops markets software service saas suite basen platform public private infrastructures basen platform built redundant computing grid due basen linearly scalable flexible resilient components grid work together function separately automatically take roles grid architecture also allows quick deployment individual components functional immediately installation spimes record manage full lifecycle physical representations physical hardware support software come go object considered spime essential programming managed cloud spime concept originally crafted author bruce sterling neologism futuristic internet things object basen founded 2001 pasi hurri president ceo basen holds following us patents technology us20170139788a1 us 20120158328 us 20120089523 us 20120158327 us 20120154171 us 20120158329 basen developed system telecom networks basen one founders fennogrid association whose purpose sharing information grid peer-to-peer research promotion cooperation projects fields basen also member international e-science consortium enabling grids e-science 2015 tm forum awarded basen partners innovative catalyst digital health 2013 basen awarded two industry awards tm forum one innovative catalyst smart grid empowering digital customer one significant contribution frameworx ehealth – curing complexity | [
330,
4159
] | Test |
4,159 | 7 | Grid_computing:grid computing grid computing use widely distributed computer resources reach common goal computing grid thought distributed system non-interactive workloads involve large number files grid computing distinguished conventional high-performance computing systems cluster computing grid computers node set perform different task/application grid computers also tend heterogeneous geographically dispersed thus physically coupled cluster computers although single grid dedicated particular application commonly grid used variety purposes grids often constructed general-purpose grid middleware software libraries grid sizes quite large grids form distributed computing whereby super virtual computer composed many networked loosely coupled computers acting together perform large tasks certain applications distributed grid computing seen special type parallel computing relies complete computers onboard cpus storage power supplies network interfaces etc connected computer network private public conventional network interface ethernet contrast traditional notion supercomputer many processors connected local high-speed computer bus grid computing combines computers multiple administrative domains reach common goal solve single task may disappear quickly size grid may vary small—confined network computer workstations within corporation example—to large public collaborations across many companies networks notion confined grid may also known intra-nodes cooperation whereas notion larger wider grid may thus refer inter-nodes cooperation grids form distributed computing whereby “ super virtual computer ” composed many networked loosely coupled computers acting together perform large tasks technology applied computationally intensive scientific mathematical academic problems volunteer computing used commercial enterprises diverse applications drug discovery economic forecasting seismic analysis back office data processing support e-commerce web services coordinating applications grids complex task especially coordinating flow information across distributed computing resources grid workflow systems developed specialized form workflow management system designed specifically compose execute series computational data manipulation steps workflow grid context “ distributed ” “ grid ” computing general special type parallel computing relies complete computers onboard cpus storage power supplies network interfaces etc connected network private public internet conventional network interface producing commodity hardware compared lower efficiency designing constructing small number custom supercomputers primary performance disadvantage various processors local storage areas high-speed connections arrangement thus well-suited applications multiple parallel computations take place independently without need communicate intermediate results processors high-end scalability geographically dispersed grids generally favorable due low need connectivity nodes relative capacity public internet also differences programming mc costly difficult write programs run environment supercomputer may custom operating system require program address concurrency issues problem adequately parallelized “ thin ” layer “ grid ” infrastructure allow conventional standalone programs given different part problem run multiple machines makes possible write debug single conventional machine eliminates complications due multiple instances program running shared memory storage space time one feature distributed grids formed computing resources belonging one multiple individuals organizations known multiple administrative domains facilitate commercial transactions utility computing make easier assemble volunteer computing networks one disadvantage feature computers actually performing calculations might entirely trustworthy designers system must thus introduce measures prevent malfunctions malicious participants producing false misleading erroneous results using system attack vector often involves assigning work randomly different nodes presumably different owners checking least two different nodes report answer given work unit discrepancies would identify malfunctioning malicious nodes however due lack central control hardware way guarantee nodes drop network random times nodes like laptops dial-up internet customers may also available computation network communications unpredictable periods variations accommodated assigning large work units thus reducing need continuous network connectivity reassigning work units given node fails report results expected time another set could termed social compatibility issues early days grid computing related goals grid developers carry innovation beyond original field high-performance computing across disciplinary boundaries new fields like high-energy physics impacts trust availability performance development difficulty influence choice whether deploy onto dedicated cluster idle machines internal developing organization open external network volunteers contractors many cases participating nodes must trust central system abuse access granted interfering operation programs mangling stored information transmitting private data creating new security holes systems employ measures reduce amount trust “ client ” nodes must place central system placing applications virtual machines public systems crossing administrative domains including different departments organization often result need run heterogeneous systems using different operating systems hardware architectures many languages trade-off investment software development number platforms supported thus size resulting network cross-platform languages reduce need make tradeoff though potentially expense high performance given node due run-time interpretation lack optimization particular platform various middleware projects created generic infrastructure allow diverse scientific commercial projects harness particular associated grid purpose setting new grids boinc common one various academic projects seeking public volunteers listed end article fact middleware seen layer hardware software top middleware number technical areas considered may may middleware independent example areas include sla management trust security virtual organization management license management portals data management technical areas may taken care commercial solution though cutting edge area often found within specific research projects examining field segmentation grid computing market two perspectives need considered provider side user side overall grid market comprises several specific markets grid middleware market market grid-enabled applications utility computing market software-as-a-service saas market grid middleware specific software product enables sharing heterogeneous resources virtual organizations installed integrated existing infrastructure involved company companies provides special layer placed among heterogeneous infrastructure specific user applications major grid middlewares globus toolkit glite unicore utility computing referred provision grid computing applications service either open grid utility hosting solution one organization vo major players utility computing market sun microsystems ibm hp grid-enabled applications specific software applications utilize grid infrastructure made possible use grid middleware pointed software service saas “ software owned delivered managed remotely one providers. ” gartner 2007 additionally saas applications based single set common code data definitions consumed one-to-many model saas uses pay go payg model subscription model based usage providers saas necessarily computing resources required run saas therefore saas providers may draw upon utility computing market utility computing market provides computing resources saas providers companies demand user side grid computing market different segments significant implications deployment strategy deployment strategy well type investments made relevant aspects potential grid users play important role grid adoption cpu-scavenging cycle-scavenging shared computing creates “ grid ” idle resources network participants whether worldwide internal organization typically technique exploits 'spare instruction cycles resulting intermittent inactivity typically occurs night lunch breaks even comparably miniscule though numerous moments idle waiting modern desktop cpu experience throughout day computer waiting io user network storage practice participating computers also donate supporting amount disk storage space ram network bandwidth addition raw cpu power many volunteer computing projects boinc use cpu scavenging model since nodes likely go offline time time owners use resources primary purpose model must designed handle contingencies creating opportunistic environment another implementation cpu-scavenging special workload management system harvests idle desktop computers compute-intensive jobs also refers enterprise desktop grid edg instance htcondor open-source high-throughput computing software framework coarse-grained distributed rationalization computationally intensive tasks configured use desktop machines keyboard mouse idle effectively harness wasted cpu power otherwise idle desktop workstations like full-featured batch systems htcondor provides job queueing mechanism scheduling policy priority scheme resource monitoring resource management used manage workload dedicated cluster computers well seamlessly integrate dedicated resources rack-mounted clusters non-dedicated desktop machines cycle scavenging one computing environment term grid computing originated early 1990s metaphor making computer power easy access electric power grid power grid metaphor accessible computing quickly became canonical ian foster carl kesselman published seminal work grid blueprint new computing infrastructure 1999 preceded decades metaphor utility computing 1961 computing public utility analogous phone system cpu scavenging volunteer computing popularized beginning 1997 distributed.net later 1999 seti home harness power networked pcs worldwide order solve cpu-intensive research problems ideas grid including distributed computing object-oriented programming web services brought together ian foster steve tuecke university chicago carl kesselman university southern california information sciences institute trio led effort create globus toolkit widely regarded fathers grid toolkit incorporates computation management also storage management security provisioning data movement monitoring toolkit developing additional services based infrastructure including agreement negotiation notification mechanisms trigger services information aggregation globus toolkit remains de facto standard building grid solutions number tools built answer subset services needed create enterprise global grid 2007 term cloud computing came popularity conceptually similar canonical foster definition grid computing terms computing resources consumed electricity power grid earlier utility computing indeed grid computing often always associated delivery cloud computing systems exemplified applogic system 3tera november 2006 seidel received sidney fernbach award supercomputing conference tampa florida outstanding contributions development software hpc grid computing enable collaborative numerical investigation complex problems physics particular modeling black hole collisions award one highest honors computing awarded achievements numerical relativity also march 2019 bitcoin network measured computing power equivalent 80,000,000 pflops floating-point operations per second measurement reflects number flops required equal hash output bitcoin network rather capacity general floating-point arithmetic operations since elements bitcoin network perform specific cryptographic hash computation required bitcoin protocol grid computing offers way solve grand challenge problems protein folding financial modeling earthquake simulation climate/weather modeling grids offer way using information technology resources optimally inside organization also provide means offering information technology utility commercial noncommercial clients clients paying use electricity water october 2016 4 million machines running open-source berkeley open infrastructure network computing boinc platform members world community grid one projects using boinc seti home using 400,000 computers achieve 0.828 tflops october 2016 october 2016 folding home part boinc achieved 101 x86-equivalent petaflops 110,000 machines european union funded projects framework programmes european commission beingrid business experiments grid research project funded european commission integrated project sixth framework programme fp6 sponsorship program started june 1 2006 project ran 42 months november 2009 project coordinated atos origin according project fact sheet mission “ establish effective routes foster adoption grid computing across eu stimulate research innovative business models using grid technologies ” extract best practice common themes experimental implementations two groups consultants analyzing series pilots one technical one business project significant long duration also budget 24.8 million euros largest fp6 integrated project 15.7 million provided european commission remainder 98 contributing partner companies since end project results beingrid taken carried forward it-tude.com enabling grids e-science project based european union included sites asia united states follow-up project european datagrid edg evolved european grid infrastructure along lhc computing grid lcg developed support experiments using cern large hadron collider list active sites participating within lcg found online real time monitoring egee infrastructure relevant software documentation also publicly accessible speculation dedicated fiber optic links installed cern address lcg data-intensive needs may one day available home users thereby providing internet services speeds 10,000 times faster traditional broadband connection european grid infrastructure also used research activities experiments simulation oncological clinical trials distributed.net project started 1997 nasa advanced supercomputing facility nas ran genetic algorithms using condor cycle scavenger running 350 sun microsystems sgi workstations 2001 united devices operated united devices cancer research project based grid mp product cycle-scavenges volunteer pcs connected internet project ran 3.1 million machines close 2007 today many definitions grid computing | [
7153,
2183,
370,
374,
5371,
3947,
4318,
5042,
1802,
744,
1481,
6473,
2238,
6130,
7930,
1878,
7934,
2961,
2962,
7213,
3667,
72,
2969,
4742,
5447,
2266,
5093,
7958,
6878,
4031,
6887,
1923,
5109,
5819,
110,
112,
817,
1546,
4049,
1204,
6205... | Test |
4,160 | 1 | Leuven_Database_of_Ancient_Books:leuven database ancient books leuven database ancient books ldab resource ancient written literary manuscripts 500 bc ad 800 currently lists 16.000 greek latin coptic syriac demotic literary texts attempts collect basic information ancient literary texts includes authors homer gregory great 3.600 texts unidentified authors founded 1998 ku leuven willy clarysse | [] | Validation |
4,161 | 7 | Brownout_(software_engineering):brownout software engineering brownout software engineering technique increase robustness application computing capacity shortage many users simultaneously accessing application hosted online underlying computing infrastructure may become overloaded rendering application unresponsive users likely abandon application switch competing alternatives hence incurring long-term revenue loss better deal situation application given brownout capabilities application disable certain features – e.g. online shop longer display recommendations related products – avoid overload although reducing features generally negative impact short-term revenue application owner long-term revenue loss avoided technique inspired brownouts power grids consists reducing power grid voltage case electricity demand exceeds production consumers incandescent light bulbs dim – hence originating term – draw less power thus helping match demand production similarly brownout application helps match computing capacity requirements available target infrastructure brownout complements elasticity former help application withstand short-term capacity shortage without changing capacity available application contrast elasticity consists adding removing capacity application preferably advance avoid capacity shortage altogether two techniques combined e.g. brownout triggered number users increases unexpectedly elasticity triggered latter usually requiring minutes show effect brownout relatively non-intrusive developer example implemented advice aspect-oriented programming however surrounding components load-balancers need made brownout-aware distinguish cases application running normally cases application maintains low response time triggering brownout | [
2633
] | Test |
4,162 | 4 | VyOS:vyos vyos open source network operating system based debian gnu/linux vyos provides free routing platform competes directly commercially available solutions well known network providers vyos run standard amd64 i586 systems able used router firewall platform cloud deployments brocade communications stopped development vyatta core edition vyatta routing software small group enthusiasts took last community edition worked building open source fork live place end life vc vyos version 1.0.0 hydrogen released december 22 2013 october 9 2014 version 1.1.0 helium released versions released thus far based debian 6.0 squeeze available 32-bit images 64-bit images physical virtual machines january 28 2019 version 1.2.0 crux released version 1.2.0 based debian 8 jessie version 1.0 1.1 named elements new naming scheme based constellations used version 1.2 vyos ova image vmware released february 3 2014 maintenance release allows convenient setup vyos vmware platform includes vmware tools paravirtual drivers ova image downloaded standard download site starting version 1.0.2 amazon ec2 customers select vyos ami image deprecated removed february 2018 starting version 1.1.7 aws customers use new marketplace vyos ami starting version 1.2.0 aws customers deploy new marketplace ami new offering comes support starting version 1.2.0 azure customers use vyos azure | [
6456,
7189,
2961,
6487,
7587,
1893,
4014,
7954,
7251,
2644,
474,
1941,
5488,
1559,
7275,
6918,
6209,
8008,
5157,
7289,
4824,
5523,
5530,
3751,
2356,
6244,
2001,
5200,
1629,
1261,
3444,
2746,
5571,
5232,
2758,
1663,
7752,
4177,
2063,
5259,... | Test |
4,163 | 1 | Amazon_Redshift:amazon redshift amazon redshift internet hosting service data warehouse product forms part larger cloud-computing platform amazon web services built top technology massive parallel processing mpp data warehouse company paraccel later acquired actian handle large scale data sets database migrations redshift differs amazon hosted database offering amazon rds ability handle analytic workloads big data data sets stored column-oriented dbms principle amazon redshift based older version postgresql 8.0.2 redshift made changes version initial preview beta released november 2012 full release made available february 15 2013 service handle connections applications using odbc jdbc connections according cloud data warehouse report published forrester q4 2018 amazon redshift largest cloud data warehouse deployments 6,500 deployments 2018 redshift came second industry wide benchmark test run gigaom behind microsoft azure amazon listed number business intelligence software proprietors partners tested tools apn partner program including actian actuate corporation alteryx dundas data visualization ibm cognos inetsoft infor logi analytics looker company microstrategy pentaho qlik sisense tableau software yellowfin partner companies providing data integration tools include informatica snaplogic system integration consulting partners include accenture deloitte capgemini dxc technology | [
7957,
5894,
4217,
3953,
7722,
8083,
1550,
5571,
7838,
7102,
4431,
5064,
2054,
5419,
6219,
5956,
6386,
518,
2961,
3915,
7500,
5882,
5706
] | Validation |
4,164 | 9 | Comparison_of_programming_languages_(object-oriented_programming):comparison programming languages object-oriented programming comparison programming languages compares object-oriented programming languages c++ java smalltalk object pascal perl python others manipulate data structures declare property named bar access members object x | [
1616,
2451,
5983,
1345,
3351,
7333,
4302,
109,
6428,
4053,
6277,
2661,
7005,
7460,
4425,
666,
6029,
1114,
5855,
7844,
5091,
3898,
5510,
2871,
7394,
8122,
2881,
5965,
5786,
2619,
1803
] | Test |
4,165 | 2 | Scott_James_Remnant:scott james remnant scott james remnant born 18 july 1980 open source software engineer scott served long-time debian developer 2006 worked ubuntu developer manager ubuntu linux distribution canonical ltd works google technical lead bluetooth systems scott openly gay believes important open support others open source community | [
1523,
7969,
8169,
6086,
2916,
5912,
642,
2297,
5658,
314,
6549,
2585,
2511,
4187,
5523,
5704,
2074,
4910,
968,
6317,
6951,
2170,
7873
] | Validation |
4,166 | 3 | Devices_using_Qualcomm_Snapdragon_systems-on-chip:devices using qualcomm snapdragon systems-on-chip list devices using qualcomm snapdragon chips snapdragon family mobile system chip soc made qualcomm use smartphones tablets smartbook devices | [
5718,
6082,
6421,
7890,
722,
4317,
2926,
5740,
5750,
740,
5752,
7189,
5405,
5406,
1864,
67,
446,
451,
6874,
6165,
463,
804,
5472,
469,
4041,
3008,
3365,
6910,
7654,
6919,
1581,
1977,
2339,
2711,
550,
3786,
2398,
5576,
7364,
1284,
4879,
... | Test |
4,167 | 1 | SQLyog:sqlyog sqlyog gui tool rdbms mysql developed webyog inc. based bangalore india santa clara california sqlyog used 30,000 customers worldwide downloaded 2,000,000 times sqlyog v0.9 first released public 2001 eight months development sqlyog available free charge closed source code v3.0 made fully commercial software nowadays sqlyog distributed free software well several paid proprietary versions free software version known community edition github paid versions sold professional enterprise ultimate editions prominent features sqlyog sqlyog works windows platform ranging windows vista windows 10 windows 9x/me support removed version 5.0 windows 2000 support stopped version 8.6 windows xp support ended version 12.5 also made work linux various unixes including macos using wine environment subset sqlyog enterprise/ultimate functionalities available free sja sqlyog job agent linux native linux utility makes possible specify test scheduled jobs windows environment port execution parameters seamlessly linux environment webyog provides priority support customers primarily ticket based support system users community edition get support webyog forums 15000 registered users webyog also maintains extensive faq commonly asked questions | [
5717,
6604,
4759,
1359,
3863,
5126,
5571,
6279,
578,
3383,
4708,
3652,
7848,
6755,
6386,
1128,
4363,
7214,
5780,
6056,
1695,
2259,
7598
] | Validation |
4,168 | 7 | Traversed_edges_per_second:traversed edges per second number traversed edges per second teps performed supercomputer cluster measure communications capabilities computational power machine contrast standard metric floating point operations per second flops give weight communication capabilities machine term first entered usage 2010 advent petascale computing since measured many world largest supercomputers context edge connection two vertices graph traversal ability machine communicate data two points standardized benchmark associated graph500 september 2011 calls executing graph generation search algorithms graphs large 1.1 petabyte ability application utilize supercomputer cluster effectively depends raw speed processor also communication network importance communication capability varies application application clear linpack benchmarks traditionally used rating flops supercomputers require communications capability many scientific applications therefore alternative metrics characterize performance machine holistic manner may relevant many scientific applications may desirable making purchasing decisions | [
1023,
1346
] | Test |
4,169 | 2 | Least_frequently_used:least frequently used least frequently used lfu type cache algorithm used manage memory within computer standard characteristics method involve system keeping track number times block referenced memory cache full requires room system purge item lowest reference frequency lfu sometimes combined least recently used algorithm called lrfu simplest method employ lfu algorithm assign counter every block loaded cache time reference made block counter increased one cache reaches capacity new block waiting inserted system search block lowest counter remove cache lfu method may seem like intuitive approach memory management without faults consider item memory referenced repeatedly short period time accessed extended period time due rapidly accessed counter increased drastically even though used decent amount time leaves blocks may actually used frequently susceptible purging simply accessed different method moreover new items entered cache subject removed soon start low counter even though might used frequently due major issues like explicit lfu system fairly uncommon instead hybrids utilize lfu concepts | [
1640,
1575,
8174
] | Test |
4,170 | 9 | Winbatch:winbatch winbatch microsoft windows scripting language originally developed wilson windowware currently supported maintained enhanced island lake consulting llc environment includes interpreter code editor along dialog designer optional compiler create self-contained executables language structure syntax cross dos batch command basic fortran c. developed years functions added support things like .net activex controls com ole unicode uac code signing wilson windowware founded 1989 product command post 1991 menuing language command post became winbatch shortly corporate version released included code binder program combines bytecode version program along interpreter july 2017 wilson windowware ceased operation winbatch acquired newly formed island lake consulting llc documentation available german spanish japanese languages winbatch hello world program extenders add additional commands winbatch programming language popular extenders included default winbatch installer additional extenders available download | [
768,
7607,
4759,
5987,
5129,
5571,
2281,
6062,
3922,
6908
] | Test |
4,171 | 4 | CARO:caro caro computer antivirus research organization organization established 1990 research study malware organization perhaps best known virus naming convention 1991 subsequent revisions though widely adopted still faced usage obstacles led proposal new naming systems product vendors industry groups annual workshop biggest caro event workshop usually organized hosted one anti-virus firm home country workshops started 2007 attendance limited 120-130 top anti-malware experts strict policy photography recordings kind br caro collaboration eicar european institute computer antivirus research developed eicar test file executable string designed test integrity antivirus software caro membership private issue members choosing publicize membership members caro founders current publicly stated membership point include friðrik skúlason founder frisk software international dr. alan solomon founder dr solomon antivirus toolkit vesselin bontchev mikko hyppönen cro f-secure eugene kaspersky founder kaspersky lab nick fitzgerald peter ferrie dmitry gryaznov igor muttik atley padgett peterson costin raiu peter kruse morton swimmer righard zwienenberg philipp wolf | [
5452,
6644,
21,
1838,
25,
3896,
3137
] | Test |
4,172 | 4 | Session_border_controller:session border controller session border controller sbc network element deployed protect sip based voice internet protocol voip networks early deployments sbcs focused borders two service provider networks peering environment role expanded include significant deployments service provider access network backbone network provide service residential and/or enterprise customers term session refers communication two parties – context telephony would call call consists one call signaling message exchanges control call one call media streams carry call audio video data along information call statistics quality together streams make session job session border controller exert influence data flows sessions term border refers point demarcation one part network another simple example edge corporate network firewall demarcates local network inside corporation rest internet outside corporation complex example large corporation different departments security needs location perhaps kind data case filtering routers network elements used control flow data streams job session border controller assist policy administrators managing flow session data across borders term controller refers influence session border controllers data streams comprise sessions traverse borders one part network another additionally session border controllers often provide measurement access control data conversion facilities calls control sbcs commonly maintain full session state offer following functions advent webrtc sbcs also assumed role sip webrtc gateway translate sip one signalling protocol mandated webrtc specifications sip websockets rfc 7118 often used partially due applicability sip envisaged communication scenarios well availability open source software jssip case sbc acts gateway webrtc applications sip end points sbcs inserted signaling and/or media paths calling called parties voip call predominantly using session initiation protocol sip h.323 mgcp call-signaling protocols many cases sbc hides network topology protects service provider enterprise packet networks sbc terminates inbound call initiates second call leg destination party technical terms used sip protocol defines back-to-back user agent b2bua effect behavior signaling traffic also media traffic voice video controlled sbc cases sbc capability provide media services sbcs also able redirect media traffic different element elsewhere network recording generation music-on-hold media-related purposes conversely without sbc media traffic travels directly endpoints without in-network call signaling elements control path cases sbc simply modifies stream call control signaling data involved call perhaps limiting kinds calls conducted changing codec choices ultimately sbcs allow network operators manage calls made networks fix change protocols protocol syntax achieve interoperability also overcome problems firewalls network address translators nats present voip calls show operation sbc one compare simple call establishment sequence call establishment sequence sbc simplest session establishment sequence one proxy user agents proxy ’ task identify callee ’ location forward request proxy also adds via header address indicate path response traverse proxy change dialog identification information present message tag header call-id cseq proxies also alter information sip message bodies note session initiation phase user agents exchange sip messages sdp bodies include addresses agents expect media traffic successfully finishing session initiation phase user agents exchange media traffic directly without involvement proxy sbcs designed many applications used operators enterprises achieve variety goals even sbc implementation might act differently depending configuration use case hence easily possible describe exact sbc behavior would apply sbc implementations general possible identify certain features common sbcs example sbcs implemented back-to-back user agent b2bua proxy-like server splits sip transaction two call legs side facing user agent client uac acts server side facing user agent server uas acts client proxy usually keeps state information related active transactions b2buas keep state information active dialogs e.g. calls proxy receives sip request save state information transaction e.g. receiving response state information soon deleted b2bua maintain state information active calls delete information call terminated sbc included call path sbc acts b2bua behaves user agent server towards caller user agent client towards callee sense sbc actually terminates call generated caller starts new call towards callee invite message sent sbc contains longer clear reference caller invite sent sbc proxy includes via contact headers point sbc caller sbcs often also manipulate dialog identification information listed call-id tag case sbc configured also control media traffic sbc also changes media addressing information included c lines sdp body thereby sip messages traverse sbc also audio video packets invite sent sbc establishes new dialog sbc also manipulates message sequence number cseq well max-forwards value note list header manipulations listed subset possible changes sbc might introduce sip message furthermore sbcs might listed manipulations sbc expected control media traffic might need change anything sdp header sbcs change dialog identification information others might even change addressing information sbcs often used corporations along firewalls intrusion prevention systems ips enable voip calls protected enterprise network voip service providers use sbcs allow use voip protocols private networks internet connections using nat also implement strong security measures necessary maintain high quality service sbcs also replace function application-level gateways larger enterprises sbcs also used conjunction sip trunks provide call control make routing/policy decisions calls routed lan/wan often tremendous cost savings associated routing traffic internal ip networks enterprise rather routing calls traditional circuit-switched phone network additionally sbcs allow voip calls set two phones using different voip signaling protocols e.g. sip h.323 megaco/mgcp well performing transcoding media stream different codecs use sbcs also provide firewall features voip traffic denial service protection call filtering bandwidth management protocol normalization header manipulation also commonly provided sbcs enabling communication different vendors networks ip multimedia subsystem ims 3gpp 3rd generation partnership project architecture perspective sbc integration p-cscf ims-alg signaling plane ims access gateway media plane access side interconnect side sbc maps ibcf iwf signaling plane trgw transition gateway media plane ims/tispan architecture perspective sbc integration p-cscf c-bgf functions access side ibcf iwf thig i-bgf functions peering side sbcs decomposed meaning signaling functions located separate hardware platform media relay functions – words p-cscf separated c-bgf ibcf/iwf separated i-bgf functions physically standards-based protocol h.248 ia profile used signaling platform control media one sbcs use proprietary protocols infancy concept sbc controversial proponents end-to-end systems peer-to-peer networking controversy surrounding sbcs pertains whether call control remain solely two endpoints call service owners rather shared network elements owned organizations managing various networks involved connecting two call endpoints example call control remain alice bob two callers call control shared operators ip networks involved connecting alice bob voip phones together debate point vigorous almost religious nature wanted unfettered control endpoints also greatly frustrated various realities modern networks firewalls filtering/throttling side network operators typically concerned overall network performance interoperability quality want ensure secure sbc may provide session media usually rtp signaling often sip wiretap services used providers enforce requests lawful interception network sessions standards interception services provided atis tia cablelabs etsi among others according jonathan rosenberg author rfc 3261 sip numerous related rfcs dynamicsoft developed first working sbc conjunction aravox product never truly gained marketshare newport networks first ipo london stock exchange aim may 2004 nng cisco publicly traded since 1990 acme packet followed october 2006 floating nasdaq field narrowed acquisition nextone merged reefpoint becoming nextpoint subsequently acquired 2008 genband time emerged “ integrated ” sbc border control function integrated another edge device 2009 ingate systems ’ firewall became first sbc earn certification icsa labs milestone certifying voip security capabilities sbc continuing growth voip networks pushes sbcs edge mandating adaptation capacity complexity voip network grows traffic volume increases sessions passing sbc vendors addressing new scale requirements variety ways developed separate load balancing systems sit front sbc clusters others developed new architectures using latest generation chipsets offering higher performance sbcs scalability using service cards | [
6025,
1664,
1691,
2181,
651,
5039,
2681,
4553,
1354,
2644,
7170
] | Test |
4,173 | 3 | PlayStation_Broadband_Navigator:playstation broadband navigator playstation broadband navigator also referred bb navigator psbbn software japanese playstation 2 consoles formats hard disk drive use consoles provides interface manipulating data hard disk drive works official playstation 2 hdd units apparently playstation broadband navigator strict region lock normal playstation 2 software software boot ntsc-j systems model number ending 0 meaning sold japan making software unusable korean asian ntsc-j playstation 2 consoles playstation broadband navigator offers many features available original hdd utility disc software japanese releases take advantage features may even require specific version higher software sony computer entertainment america released hdd march 23 2004 hdd utility disc 1.01 bundled final fantasy xi consumers knew playstation broadband navigator confused n't included hdd utility disc scea response always playstation broadband navigator would released north america later date date appears never light scea switched manufacturing slim hdd-incompatible playstation 2 models stopping manufacture hdd units region sony computer entertainment europe sony computer entertainment australia never released hdd outside linux kit switching manufacturing slim playstation 2 model appears neither hdd utility disc playstation broadband navigator released regions broadband navigator used ps2 using modified var games require playstation broadband navigator either certain features work game work | [
578
] | Test |
4,174 | 3 | Read_(system_call):read system call modern posix compliant operating systems program needs access data file stored file system uses read system call file identified file descriptor normally obtained previous call open system call reads data bytes number specified caller file stores buffer supplied calling process read system call takes three arguments read system call interface standardized posix specification data file read calling read function value returned number bytes read zero indicates end file file position advanced number error number smaller number bytes requested may happen example fewer bytes actually available right maybe close end-of-file reading pipe terminal system call interrupted signal alternatively -1 returned error occurs case errno set appropriately left unspecified whether file position changes | [
3256,
2182,
7532,
3626,
5744,
2942,
6117,
4341,
5762,
412,
415,
3666,
2970,
6857,
7956,
5460,
7242,
1924,
6892,
4771,
1176,
1933,
5829,
1208,
4435,
4438,
3404,
1596,
165,
7312,
174,
5884,
1991,
2361,
890,
3084,
6264,
6984,
1281,
578,
48... | Test |
4,175 | 3 | Mac_OS_nanokernel:mac os nanokernel mac os nanokernel extremely simple operating system kernel serving basis powerpc based system software versions 7 9 classic mac os predating mac os x initial revision software extremely simple single tasking system delegates tasks emulator running motorola 68000 series 68k version operating system second major revision supports multitasking multiprocessing message passing would properly called microkernel unlike 68k-derived mac os kernel running within powerpc kernel exists protected memory space executes device drivers user mode nanokernel different copland os microkernel although created succession similar goals original nanokernel tightly integrated mac 68k emulator written emulation consultant gary davidian main purpose allow existing motorola 68k version operating system run new hardware normal state system running 68k code operating system little activated interrupt quickly mapped 68k equivalent within virtual machine tasks may include switching back powerpc mode necessary upon completion interrupt handler mapping macintosh virtual memory system powerpc hardware however software little documented might instead handled emulator running user mode nanokernel stored mac os rom chip integrated old world rom computers inside mac os rom file disk new world rom computers rather installed familiar sense progress 1994 demanded additional functionality forward-looking architecture introduced pci card drivers anticipation copland microkernel called nukernel supports memory protection open transport networking architecture introduced standardized powerpc synchronization primitives daystar digital genesis mp macintosh clone requires kernel extensions support multiprocessing evolution would later affect overhaul nanokernel mac os 8.6 mac os 8.6 nanokernel rewritten rené a. vega add multiprocessing services 2.0 support powermacinfo distributed multiprocessing sdk application displays statistics nanokernel operation | [
5275,
713,
5021,
7339,
8066,
4399,
3531,
7823,
5571,
7990,
3544,
7554,
405,
1959,
6921,
2357,
6385,
5962,
4094,
3751,
7775
] | Test |
4,176 | 9 | Patrick_Cousot:patrick cousot patrick cousot born 3 december 1948 french computer scientist currently silver professor computer science courant institute mathematical sciences new york university usa professor école normale supérieure ens paris france école polytechnique palaiseau france university metz france research scientist french national center scientific research cnrs joseph fourier university grenoble france together wife radhia cousot 1947–2014 patrick cousot originator abstract interpretation influential technique formal methods 2000s worked practical methods static analysis critical embedded software astrée found avionics 1999 received cnrs silver medal 2006 great prize eads foundation 2001 bestowed honorary doctorate saarland university germany radhia cousot received acm sigplan programming languages achievement award 2013 ieee computer society harlan d. mills award 2014 “ invention ‘ abstract interpretation ’ development tool support practical application ” received humboldt research award 2008 2018 ieee john von neumann medal introducing abstract interpretation powerful framework automatically calculating program properties broad application verification optimisation knight chevalier ordre national du mérite ordre des palmes académiques member academia europaea informatics section since 2006 member board trustees imdea software institute | [
5249,
7695,
1243
] | Test |
4,177 | 7 | B.A.T.M.A.N.:b.a.t.m.a.n better approach mobile adhoc networking b.a.t.m.a.n routing protocol multi-hop mobile ad hoc networks development german freifunk community intended replace optimized link state routing protocol olsr b.a.t.m.a.n crucial point decentralization knowledge best route network — single node data technique eliminates need spread information concerning network changes every node network individual node saves information direction received data sends data accordingly data gets passed node node packets get individual dynamically created routes network collective intelligence created early 2007 b.a.t.m.a.n developers started experimenting idea routing layer 2 ethernet layer instead layer 3 differentiate layer 3 routing daemon suffix adv advanced chosen instead manipulating routing tables based information exchanged via udp/ip provides virtual network interface transparently transports ethernet packets batman-adv kernel module part official linux kernel since 2.6.38 b.a.t.m.a.n elements classical routing protocols detects b.a.t.m.a.n nodes finds best way route also keeps track new nodes informs neighbors existence static networks network administrators technicians decide computer reached via way cable radio networks undergo constant changes low participation-thresholds vital part freifunk -networks foundation task automated much possible regular basis every node sends broadcast thereby informing neighbors existence neighbors relay message neighbors carries information every node network order find best way certain node b.a.t.m.a.n counts originator-messages received logs neighbor message came like distance-vector protocols b.a.t.m.a.n try determine entire route using originator-messages packet first step right direction data handed next neighbor direction turn uses mechanism process repeated data reaches destination addition radio networks b.a.t.m.a.n also used common wired cable connections ethernet task create protocol easy small fast possible seemed therefore sensible split development several phases implement complex functions using iterative process first phase routing algorithm implemented tested practicality suitability task hand sending receiving originator-messages information existence udp port 1966 chosen version one algorithm made significant assumption soon node receives existence data another node assumes also send data back radio networks however may well one-way communication possible i.e. asymmetric links mechanism incorporated protocol allow solve arising problems mechanism enables node determine whether neighbouring node provides bidirectional communication bidirectional nodes considered part network one-way nodes longer fully included greatest innovation version b.a.t.m.a.n support multiple network devices computer router running b.a.t.m.a.n deployed central location like church another high building several wired wireless network interfaces attached deployed b.a.t.m.a.n relay network data one direction without retransmission delay certain unusual phenomena special circumstances could appear determination best route network tackled counteracted prevent circular routing prevent data reaching destination occurring node inform network provides access internet nodes use information evaluate whether connection internet close much bandwidth available either use specific gateway allow b.a.t.m.a.n determine gateway use based criteria connection speed announcing devices running b.a.t.m.a.n also included version usually method used connect home networks mesh-networks antenna installation roof connect wireless network b.a.t.m.a.n rest building simply announced thus also reachable version b.a.t.m.a.n shown exhibit high levels stability slightly slow convergence times real-world conditions confirmed theoretical analysis batman-experimental bmx aims approximate real exponent also sending ogms multiple times independent broadcast datagrams originated independent branch batman developed axel neumann extended version incorporates securely-entrusted multi-topology routing semtor called bmx7 2017 b.a.t.m.a.n written whiteboard hbo series silicon valley season 4 episode 2 show lead character richard hendricks appears include b.a.t.m.a.n component new internet concept text visible top-right whiteboard | [
5453,
2001,
6335,
2004,
1261,
106,
1543,
6178,
1462,
2650,
5571,
6456,
5053,
7275,
4162,
7752,
7289,
2146,
3821,
1227,
427,
1435
] | Test |
4,178 | 4 | Lace_card:lace card lace card punched card holes punched also called whoopee card ventilator card flyswatter card ibm doily mainly used practical jokes cause unwanted disruption card readers card readers tended jam lace card inserted resulting card little structural strength avoid buckling inside mechanism card punches could also jam trying produce cards holes punched owing power-supply problems lace card fed reader card knife card saw flat tool used punched card readers card punches needed clear jam | [
2737,
1254,
1704
] | Test |
4,179 | 4 | Wazuh:wazuh wazuh free open-source host-based intrusion detection system hids performs log analysis integrity checking windows registry monitoring rootkit detection time-based alerting active response provides intrusion detection operating systems including linux openbsd freebsd os x solaris windows wazuh centralized cross-platform architecture allowing multiple systems monitored managed wazuh fork ossec | [
3915,
4759,
5571,
578,
1805,
6823
] | Validation |
4,180 | 2 | HDOS:hdos hdos early microcomputer operating system originally written heathkit h8 computer system later also available heathkit h89 zenith z-89 computers author heath company employee gordon letwin later early employee microsoft lead architect os/2 hdos originally came limited set system software tools including assembler many commercial large set freeware programs hug heath user group became available eventually hdos 2.0 notable one first microcomputer operating systems use loadable device drivers achieve degree device independence extensibility device names followed rsx-11-style convention dkn first two letters device driver file name n number dk0 dk1 would handled dk.sys similarities rsx included use pip file transfer use eot file termination similar heath/zenith published complete schematics part lists computers company sold users source code hdos full source paper listing held yesterpc.org old computer museum item references heathkit part number hos-1-sl part number 595-2466 | [
1522,
6380,
5571,
2160,
4670,
336,
7396
] | Test |
4,181 | 1 | Data_retrieval:data retrieval data retrieval means obtaining data database management system odbms case considered data represented structured way ambiguity data order retrieve desired data user present set criteria query database management system dbms software managing databases selects demanded data database retrieved data may stored file printed viewed screen query language structured query language sql used prepare queries sql american national standards institute ansi standardized query language developed specifically write database queries dbms may language relational reports queries two primary forms retrieved data database overlaps queries generally select relatively small portion database reports show larger amounts data queries also present data standard format usually display monitor whereas reports allow formatting output however like normally printed reports designed using report generator built dbms | [
2515,
6462,
3383,
7303
] | Test |
4,182 | 1 | Architectuul:architectuul architectuul online architecture catalog uses crowdsourcing build content founded 2010 team architects graphic designers software engineers content images uploaded site use creative commons license making process similar wikipedia architectuul buildings various era large range 20th century rare constructivist architecture architectuul utilised source several publications universities including wall street journal | [] | Validation |
4,183 | 2 | Single_user_mode:single user mode single user mode mode multiuser computer operating system boots single superuser mainly used maintenance multi-user environments network servers tasks may require exclusive access shared resources example running codice_1 network share mode also used security purposes network services run eliminating possibility outside interference systems lost superuser password changed switching single user mode asking password circumstances viewed security vulnerability unix-like operating systems provide single user mode functionality either system v-style runlevels bsd-style boot-loader options boot-time options run-level usually changed using codice_2 command runlevel 1 boot single user mode boot-loader options changed startup execution kernel freebsd dragonfly bsd changed rebooting system command codice_3 bootloader offers option bootup start single user mode solaris command codice_4 cause reboot single user mode macos users accomplish holding powering system user may required enter password set firmware os x el capitan later releases macos mode reversed single user mode command codice_5 terminal system fully rebooted single-user mode command codice_6 single user mode different safe mode boot system goes directly console instead starting core elements macos items codice_7 ignoring codice_8 codice_9 et al. users encouraged prompt run fsck command line utilities needed installed microsoft windows provides recovery console last known good configuration safe mode recently windows recovery environment standard recovery means also bootable bartpe-based third-party recovery discs available recovery console recovery discs different single user modes operating systems independent maintained operating system works like chrooting environment kernel linux | [
606,
6646,
3685,
4759,
6773,
5571,
7616,
3587,
3835,
1992,
1682
] | Test |
4,184 | 4 | Cyber-collection:cyber-collection cyber-collection refers use cyber-warfare techniques order conduct espionage cyber-collection activities typically rely insertion malware targeted network computer order scan collect exfiltrate sensitive information cyber-collection started far back 1996 widespread deployment internet connectivity government corporate systems gained momentum since time numerous cases activity addition state sponsored examples cyber-collection also used organized crime identity e-banking theft corporate spies operation high roller used cyber-collection agents order collect pc smart-phone information used electronically raid bank accounts rocra aka red october collection system espionage hire operation organized criminals sell collected information highest bidder cyber-collection tools developed governments private interests nearly every computer smart-phone operating system tools known exist microsoft apple linux computers iphone android blackberry windows phones major manufacturers commercial off-the-shelf cots cyber collection technology include gamma group uk hacking team italy bespoke cyber-collection tool companies many offering cots packages zero-day exploits include endgame inc. netragard united states vupen france state intelligence agencies often teams develop cyber-collection tools stuxnet require constant source zero-day exploits order insert tools newly targeted systems specific technical details attack methods often sells six figure sums common functionality cyber-collection systems include several common ways infect access target cyber-collection agents usually installed payload delivery software constructed using zero-day attacks delivered via infected usb drives e-mail attachments malicious web sites state sponsored cyber-collections efforts used official operating system certificates place relying security vulnerabilities flame operation microsoft states microsoft certificate used impersonate windows update forged however experts believe may acquired humint efforts | [
5193,
4025,
1071,
6419,
104,
5914,
3528,
5132,
7646,
5509,
6756,
6574,
6589
] | Train |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.