node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4 values |
|---|---|---|---|---|
2,085 | 2 | DirectX:directx microsoft directx collection application programming interfaces apis handling tasks related multimedia especially game programming video microsoft platforms originally names apis began direct direct3d directdraw directmusic directplay directsound forth name directx coined shorthand term apis x standing particular api names soon became name collection microsoft later set develop gaming console x used basis name xbox indicate console based directx technology x initial carried forward naming apis designed xbox xinput cross-platform audio creation tool xact directx pattern continued windows apis direct2d directwrite direct3d 3d graphics api within directx widely used development video games microsoft windows xbox line consoles direct3d also used software applications visualization graphics tasks cad/cam engineering direct3d widely publicized component directx common see names directx direct3d used interchangeably directx software development kit sdk consists runtime libraries redistributable binary form along accompanying documentation headers use coding originally runtimes installed games explicitly user windows 95 launch directx directx included windows 95 oem service release 2 windows 98 windows nt 4.0 shipped directx every version windows released since sdk available free download runtimes proprietary closed-source software source code provided sdk samples starting release windows 8 developer preview directx sdk integrated windows sdk late 1994 microsoft ready release windows 95 next operating system important factor value consumers would place programs would able run three microsoft employees—craig eisler alex st. john eric engstrom—were concerned programmers tended see microsoft previous operating system ms-dos better platform game programming meaning games would developed windows 95 operating system would much success compounded negative reception surrounding windows port video game lion king game used wing crashed compaq presarios came shipped following partnership compaq disney cirrus logic display drivers used presarios thoroughly tested api dos allowed direct access video cards keyboards mice sound devices parts system windows 95—with protected memory model—restricted access working much standardized model microsoft needed quick solution programmers operating system months away released eisler development lead st. john engstrom program manager worked together fix problem solution eventually named directx first version directx released september 1995 windows games sdk win32 replacement dci wing apis windows 3.1 directx allowed versions microsoft windows starting windows 95 incorporate high-performance multimedia eisler wrote frenzy build directx 1 5 blog directx 2.0 became component windows releases windows 95 osr2 windows nt 4.0 mid-1996 since windows 95 still new games released microsoft engaged heavy promotion directx developers generally distrustful microsoft ability build gaming platform windows alex st. john evangelist directx staged elaborate event 1996 computer game developers conference game developer jay barnson described roman theme including real lions togas something resembling indoor carnival event microsoft first introduced direct3d directplay demonstrated multiplayer mechwarrior 2 played internet directx team faced challenging task testing directx release array computer hardware software variety different graphics cards audio cards motherboards cpus input devices games multimedia applications tested beta final release directx team also built distributed tests allowed hardware industry confirm new hardware designs driver releases would compatible directx prior directx microsoft included opengl windows nt platform time opengl required high-end hardware focused engineering cad uses direct3d intended microsoft controlled alternative opengl focused initially game use 3d gaming grew opengl developed include better support programming techniques interactive multimedia applications like games giving developers choice using opengl direct3d 3d graphics api applications point battle began supporters cross-platform opengl windows-only direct3d incidentally opengl supported microsoft directx team developer chose use opengl 3d graphics api apis directx often combined opengl computer games opengl include directx functionality sound joystick support console-specific version directx used basis microsoft xbox xbox 360 xbox one console api api developed jointly microsoft nvidia developed custom graphics hardware used original xbox xbox api similar directx version 8.1 non-updateable like console technologies xbox code named directxbox shortened xbox commercial name 2002 microsoft released directx 9 support use much longer shader programs pixel vertex shader version 2.0 microsoft continued update directx suite since introducing shader model 3.0 directx 9.0c released august 2004 april 2005 directshow removed directx moved microsoft platform sdk instead directx confirmed present microsoft windows phone 8 real-time raytracing announced dxr 2018 original logo resembled deformed radiation warning symbol controversially original name directx project manhattan project reference us nuclear weapons initiative alex st. john head microsoft directx evangelism time claims connotation ultimate outcome manhattan project nuclear bombing japan intentional directx sister project xbox shares similar logo meant displace japanese videogame-makers dominance video-game industry however microsoft publicly denies account instead claiming logo merely artistic design directx composed multiple apis microsoft deprecated still supports directx components directx functionality provided form com-style objects interfaces additionally directx components managed objects built top parts directx managed direct3d xna graphics library top direct3d 9 directx 9 released 2002 windows 98 xp currently supported subsequent versions microsoft continues make changes directx 9c causing support dropped aforementioned operating systems january 2007 windows 2000 xp required also introduced shader model 2.0 containing pixel shader 2.0 vertex shader 2.0 major update directx api directx 10 ships available windows vista later previous versions windows windows xp able run directx 10-exclusive applications rather programs run windows xp system directx 10 hardware simply resort directx 9.0c code path latest available windows xp computers changes directx 10 extensive many former parts directx api deprecated latest directx sdk preserved compatibility directinput deprecated favor xinput directsound deprecated favor cross-platform audio creation tool system xact additionally lost support hardware accelerated audio since vista audio stack renders sound software cpu directplay dplay.dll also removed replaced dplayx.dll games rely dll must duplicate rename dplay.dll order achieve backwards compatibility directx windows vista contains several versions direct3d direct3d 10.1 incremental update direct3d 10.0 shipped required windows vista service pack 1 release mainly sets image quality standards graphics vendors giving developers control image quality also adds support cube map arrays separate blend modes per-mrt coverage mask export pixel shader ability run pixel shader per sample access multi-sampled depth buffers requires video card supports shader model 4.1 higher 32-bit floating-point operations direct3d 10.1 still fully supports direct3d 10 hardware order utilize new features updated hardware required microsoft unveiled directx 11 gamefest 08 event seattle major scheduled features including gpgpu support directcompute direct3d 11 tessellation support improved multi-threading support assist video game developers developing games better utilize multi-core processors direct3d 11 runs windows vista windows 7 windows 8 windows 10 parts new api multi-threaded resource handling supported direct3d 9/10/10.1-class hardware hardware tessellation shader model 5.0 require direct3d 11 supporting hardware microsoft since released direct3d 11 technical preview direct3d 11 strict superset direct3d 10.1 — hardware api features version 10.1 retained new features added necessary exposing new functionality helps keep backwards compatibility previous versions directx microsoft released final platform update windows vista october 27 2009 5 days initial release windows 7 launched direct3d 11 base standard since four updates directx 11 released directx 12 announced microsoft gdc march 20 2014 officially launched alongside windows 10 july 29 2015 primary feature highlight new release directx introduction advanced low-level programming apis direct3d 12 reduce driver overhead developers able implement command lists buffers gpu allowing efficient resource utilization parallel computation lead developer max mcmullen stated main goal direct3d 12 achieve console-level efficiency phone tablet pc release direct3d 12 comes alongside initiatives low-overhead graphics apis including amd mantle amd graphics cards apple metal ios macos khronos group cross-platform vulkan multiadapter support feature directx 12 allowing developers utilize multiple gpus system simultaneously multi-gpu support previously dependent vendor implementations amd crossfirex nvidia sli directx 12 supported fermi later nvidia gpus amd gcn-based chips intel haswell later processors graphics units siggraph 2014 intel released demo showing computer generated asteroid field directx 12 claimed 50–70 efficient directx 11 rendering speed cpu power consumption ashes singularity first publicly available game utilize directx 12 testing ars technica august 2015 revealed slight performance regressions directx 12 directx 11 mode nvidia geforce 980 ti whereas amd radeon r9 290x achieved consistent performance improvements 70 directx 12 scenarios amd outperformed powerful nvidia directx 12 performance discrepancies may due poor nvidia driver optimizations directx 12 even hardware limitations card optimized directx 11 serial execution however exact cause remains unclear directx 12 apis also featured xbox however directx 12 code directly portable pc xbox one due inherent differences two platforms performance improvements directx 12 xbox substantial pc march 2018 directx raytracing dxr announced capable real-time ray-tracing supported hardware dxr api added windows 10 october 2018 update 2019 microsoft announced arrival directx 12 windows 7 version number reported microsoft dxdiag tool version 4.09.0000.0900 higher use x.xx.xxxx.xxxx format version numbers however directx windows xp msdn page claims registry always x.xx.xx.xxxx format put another way table lists version 4.09.00.0904 microsoft dxdiag tool may 4.09.0000.0904 various releases windows included supported various versions directx allowing newer versions operating system continue running applications designed earlier versions directx versions gradually phased favor newer apis drivers hardware apis direct3d directsound need interact hardware device driver hardware manufacturers write drivers particular directx version device driver interface ddi test individual piece hardware make directx compatible hardware devices directx compatible drivers words one must install directx order use hardware early versions directx included up-to-date library directx compatible drivers currently available practice stopped however favor web-based windows update driver-update system allowed users download drivers relevant hardware rather entire library prior directx 10 directx runtime designed backward compatible older drivers meaning newer versions apis designed interoperate older drivers written previous version ddi application programmer query available hardware capabilities using complex system cap bits tied particular hardware feature direct3d 7 earlier would work version ddi direct3d 8 requires minimum ddi level 6 direct3d 9 requires minimum ddi level 7 however direct3d 10 runtime windows vista run older hardware drivers due significantly updated ddi requires unified feature set abandons use cap bits direct3d 10.1 introduces feature levels 10_0 10_1 allow use hardware features defined specified version direct3d api direct3d 11 adds level 11_0 10 level 9 subset direct3d 10 api designed run direct3d 9 hardware three feature levels 9_1 9_2 9_3 grouped common capabilities low med high-end video cards runtime directly uses direct3d 9 ddi provided wddm drivers feature level 11_1 introduced direct3d 11.1 2002 microsoft released version directx compatible microsoft .net framework thus allowing programmers take advantage directx functionality within .net applications using compatible languages managed c++ use c programming language api known managed directx mdx short claimed operate 98 performance underlying native directx apis december 2005 february 2006 april 2006 august 2006 microsoft released successive updates library culminating beta version called managed directx 2.0 managed directx 2.0 consolidated functionality previously scattered multiple assemblies single assembly thus simplifying dependencies software developers development version subsequently discontinued longer supported managed directx 2.0 library expired october 5 2006 gdc 2006 microsoft presented xna framework new managed version directx similar identical managed directx intended assist development games making easier integrate directx high-level shader language hlsl tools one package also supports execution managed code xbox 360 xna game studio express rtm made available december 11 2006 free download windows xp unlike directx runtime managed directx xna framework xbox 360 apis xinput xact etc shipped part windows developers expected redistribute runtime components along games applications microsoft product including latest xna releases provides directx 10 support .net framework approach directx managed languages use third-party libraries like alternatives directx family apis opengl successor vulkan metal mantle features comparable direct3d examples apis include sdl allegro openmax openml openal opencl fmod sfml etc many libraries cross-platform open codebases also alternative implementations aim provide api one wine furthermore developers reactos trying reimplement directx name reactx | [
7149,
7879,
3937,
3263,
6420,
714,
378,
2198,
720,
381,
7169,
3623,
1460,
6096,
7176,
2928,
7907,
1475,
4697,
5747,
7553,
3303,
7195,
5410,
7564,
2953,
53,
6839,
6840,
422,
6844,
63,
425,
1128,
2245,
4736,
435,
6498,
5442,
4377,
4017,
... | Test |
2,086 | 8 | URL:url uniform resource locator url colloquially termed web address reference web resource specifies location computer network mechanism retrieving url specific type uniform resource identifier uri although many people use two terms interchangeably urls occur commonly reference web pages http also used file transfer ftp email mailto database access jdbc many applications web browsers display url web page page address bar typical url could form codice_1 indicates protocol codice_2 hostname codice_3 file name codice_4 uniform resource locators defined 1994 tim berners-lee inventor world wide web uri working group internet engineering task force ietf outcome collaboration started ietf living documents birds feather session 1992 format combines pre-existing system domain names created 1985 file path syntax slashes used separate directory filenames conventions already existed server names could prefixed complete file paths preceded double slash codice_5 berners-lee later expressed regret use dots separate parts domain name within uris wishing used slashes throughout also said given colon following first component uri two slashes domain name unnecessary early 1993 draft html specification referred universal resource locators dropped time june 1994 rfc 1630 october 1994 draft-ietf-uri-url-08.txt every http url conforms syntax generic uri web browser usually dereference url performing http request specified host default port number 80 urls using codice_6 scheme require requests responses made secure connection website internet users distributed throughout world using wide variety languages alphabets expect able create urls local alphabets internationalized resource identifier iri form url includes unicode characters modern browsers support iris parts url requiring special treatment different alphabets domain name path domain name iri known internationalized domain name idn web internet software automatically convert domain name punycode usable domain name system example chinese url codice_7 becomes codice_8 codice_9 indicates character originally ascii url path name also specified user local writing system already encoded converted utf-8 characters part basic url character set escaped hexadecimal using percent-encoding example japanese url codice_10 becomes codice_11 target computer decodes address displays page protocol-relative links prl also known protocol-relative urls prurl urls protocol specified example codice_12 use protocol current page either http https | [
623,
2812,
5982,
4925,
3935,
7047,
1355,
8174,
1828,
5375,
3857,
3957,
3958,
1640,
2923,
3531,
2295,
4411,
6810,
730,
5570,
6997,
655,
3383,
3469,
2043,
5851,
1395,
8009,
7286,
2138,
5620,
1581,
7390,
3731,
3819,
3999,
1411,
2621,
6135,
... | Test |
2,087 | 3 | Interoperability:interoperability interoperability characteristic product system whose interfaces completely understood work products systems present future either implementation access without restrictions term initially defined information technology systems engineering services allow information exchange broader definition takes account social political organizational factors impact system system performance task building coherent services users individual components technically different managed different organizations two systems use common data formats communication protocols capable communicating exhibit syntactic interoperability xml sql examples common data formats protocols lower-level data formats also contribute syntactic interoperability ensuring alphabetical characters stored ascii unicode format communicating systems beyond ability two computer systems exchange information semantic interoperability ability automatically interpret information exchanged meaningfully accurately order produce useful results defined end users systems achieve semantic interoperability sides must refer common information exchange reference model content information exchange requests unambiguously defined sent understood possibility promoting result user-driven convergence disparate interpretations information object study research prototypes s3db cross-domain interoperability involves multiple social organizational political legal entities working together common interest and/or information exchange interoperability imply open standards ab-initio i.e definition interoperability imply exchanges range products similar products several different vendors even past future revisions product interoperability may developed post-facto special measure two products excluding rest using open standards vendor forced adapt system dominant system based open standards interoperability compatibility open standards rely broadly consultative inclusive group including representatives vendors academics others holding stake development discusses debates technical economic merits demerits feasibility proposed common protocol doubts reservations members addressed resulting common document endorsed common standard document subsequently released public henceforth becomes open standard usually published available freely nominal cost comers encumbrances various vendors individuals even part original group use standards document make products implement common protocol defined standard thus interoperable design specific liability advantage customer choosing one product another basis standardised features vendors products compete quality implementation user interface ease use performance price host factors keeping customers data intact transferable even chooses switch another competing product business reasons post facto interoperability may result absolute market dominance particular product contravention applicable standards effective standards present time product introduction vendor behind product choose ignore forthcoming standards co-operate standardisation process using near-monopoly insist product sets de facto standard market dominance problem product implementation open minimally encumbered may well closed heavily encumbered e.g patent claims network effect achieving interoperability product critical vendor wishes remain relevant market difficult accomplish lack co-operation equal terms original vendor may well see new vendor potential competitor threat newer implementations often rely clean-room reverse engineering absence technical data achieve interoperability original vendors provide technical data others often name 'encouraging competition data invariably encumbered may limited use availability data equivalent open standard telecommunication term defined two-way radio interoperability composed three dimensions search interoperability refers ability two information collections searched single query specifically related web-based search challenge interoperability stems fact designers web resources typically little need concern exchanging information web resources federated search technology place format requirements data owner emerged one solution search interoperability challenges addition standards oai-pmh rdf sparql emerged recently also help address issue search interoperability related web resources standards also address broader topics interoperability allowing data mining respect software term interoperability used describe capability different programs exchange data via common set exchange formats read write file formats use protocols ability execute binary code different processor platforms 'not contemplated definition interoperability lack interoperability consequence lack attention standardization design program indeed interoperability taken granted non-standards-based portion computing world according iso/iec 2382-01 information technology vocabulary fundamental terms interoperability defined follows capability communicate execute programs transfer data among various functional units manner requires user little knowledge unique characteristics units note definition somewhat ambiguous user program another program latter portion set program required interoperable might well need knowledge characteristics units definition focuses technical side interoperability also pointed interoperability often organizational issue often interoperability significant impact organizations concerned raising issues ownership people want share data dealing information silos labor relations people prepared undergo training usability context apt definition captured term business process interoperability interoperability important economic consequences example research estimated cost inadequate interoperability u.s. capital facilities industry 15.8 billion year competitors products interoperable due causes patents trade secrets coordination failures result may well monopoly market failure reason may prudent user communities governments take steps encourage interoperability various situations least 30 international bodies countries implemented egovernment-based interoperability framework initiatives called e-gif united states niem initiative standards defining organizations sdos provide open public software specifications facilitate interoperability examples include oasis-open organization buildingsmart formerly international alliance interoperability far user communities neutral third party creating standards business process interoperability another example neutral party rfc documents internet engineering task force ietf oslc open service lifecycle collaboration community working finding common standard order software tools share exchange data e.g bugs tasks requirements etc final goal agree open standard interoperability open source alm tools java great example interoperable programming language allows programs written run anywhere java virtual machine one writing program java long use system specific functionality maintain interoperability machines java virtual machine many implementations java virtual machine oracle ibm android etc ... java virtual machine created specification applications maintain compatibility implementation different underlying language interfaces many organizations dedicated interoperability common want push development world wide web towards semantic web concentrate egovernment ebusiness data exchange general internationally network centric operations industry consortium facilitates global interoperability across borders language technical barriers europe instance european commission idabc programme issue european interoperability framework idabc succeeded isa programme also initiated semantic interoperability centre europe semic.eu european land information service eulis established 2006 consortium european national land registers aim service establish single portal customers provided access information individual properties land property registration services associated legal environment united states government core.gov service provides collaboration environment component development sharing registration reuse related national information exchange model niem work component repository national institute standards technology serves agency measurement standards new technology introduced hospitals labs ever-increasing rate need “ plug-and-play ” interoperability – ability take medical device box easily make work one devices – attracted great attention healthcare providers industry increasingly medical devices like incubators imaging mri ct ultrasound others driven sophisticated software must integrate point care electronic systems electronic medical records 2016 regulatory affairs professionals society raps meeting experts field like angela n. johnson ge healthcare representative united states food drug administration provided practical seminars companies developing new medical devices hospitals installing work effectively align interoperable software systems speaking e-government perspective interoperability refers collaboration ability cross-border services citizens businesses public administrations exchanging data challenge due language barriers different specifications formats varieties categorizations many hindrances identified data interpreted differently collaboration limited takes longer efficient instance citizen country wants purchase land country b person asked submit proper address data address data countries include full name details street name number well post code order address details might vary language obstacle order provided address data across language barriers becomes difficult language requires characters almost impossible translation tools available hence egovernment applications need exchange data semantically interoperable manner saves time money reduces sources errors fields practical use found every policy area justice trade participation etc clear concepts interpretation patterns required interoperability important issue law enforcement fire fighting ems public health safety departments first responders need able communicate wide-scale emergencies major area investment research last 12 years traditionally agencies could exchange information operated widely disparate hardware incompatible agencies information systems computer-aided dispatch systems cad records management systems rms functioned largely isolation so-called information islands agencies tried bridge isolation inefficient stop-gap methods large agencies began implementing limited interoperable systems approaches inadequate us lack interoperability public safety realm become evident 9/11 attacks pentagon world trade center structures evidence lack interoperability surfaced agencies tackled aftermath hurricane katrina disaster contrast overall national picture states including utah already made great strides forward utah highway patrol departments utah created statewide data-sharing network using technology company based bountiful utah fatpot technologies commonwealth virginia one leading states united states improving interoperability continually recognized national best practice department homeland security dhs virginia proven practitioner-driven governance structure ensures right players involved decision making training exercises planning efforts interoperability coordinator leverages regional structure better allocate grant funding around commonwealth areas opportunity improve communications interoperability virginia strategic plan communications updated yearly include new initiatives commonwealth – projects efforts tied plan aligned national emergency communications plan authored department homeland security office emergency communications oec state washington seeks enhance interoperability statewide state interoperability executive committee siec established legislature 2003 works assist emergency responder agencies police fire sheriff medical hazmat etc levels government city county state tribal federal define interoperability local region washington recognizes collaborating system design development wireless radio systems enables emergency responder agencies efficiently provide additional services increase interoperability reduce long-term costs work saves lives emergency personnel citizens serve u.s. government making effort overcome nation lack public safety interoperability department homeland security office interoperability compatibility oic pursuing safecom cadip project 25 programs designed help agencies integrate cad systems oic launched cadip august 2007 project partner oic agencies several locations including silicon valley program use case studies identify best practices challenges associated linking cad systems across jurisdictional boundaries lessons create tools resources public safety agencies use build interoperable cad systems communicate across local state federal boundaries force interoperability defined nato ability forces two nations train exercise operate effectively together execution assigned missions tasks additionally nato defines interoperability generally ability act together coherently effectively efficiently achieve allied tactical operational strategic objectives strategic level interoperability enabler coalition building facilitates meaningful contributions coalition partners level interoperability issues center harmonizing world views strategies doctrines force structures interoperability element coalition willingness work together long term achieve maintain shared interests common threats interoperability operational tactical levels strategic/political interoperability technological interoperability come together help allies shape environment manage crises win wars benefits interoperability operational tactical levels generally derive fungibility interchangeability force elements units technological interoperability reflects interfaces organizations systems focuses communications computers also involves technical capabilities systems resulting mission compatibility incompatibility systems data coalition partners technological level benefits interoperability come primarily impacts operational tactical levels terms enhancing fungibility flexibility interoperability used researchers context urban flood risk management cities urban areas worldwide expanding creates complex spaces many interactions environment infrastructure people address complexity manage water urban areas appropriately system systems approach water flood management necessary context interoperability important facilitate system systems thinking flood management defined “ ability water management system redirect water make use system maintain enhance performance function water exceedance events ” assessing complex properties urban infrastructure systems particularly interoperability drainage systems urban systems e.g infrastructure transport could possible expand capacity overall system manage flood water towards achieving improved urban flood resilience software interoperability achieved five interrelated ways important role reducing variability intercommunication software enhancing common understanding end goal achieved desktop interoperability also known interop sub-section software interoperability early days focus ‘ interop ’ integrate web-applications web-applications time open-system ‘ containers ’ developed create virtual desktop environment applications could registered communicate using simple pub/sub patterns rudimentary ui capabilities also supported allowing windows grouped windows today desktop interoperability evolved full-service interop platforms includes container support basic exchange web web also native support application types advanced window management latest interop platforms also include application services universal search notifications user permissions preferences 3rd party application connectors language adapters in-house applications interoperability tends regarded issue experts implications daily living sometimes underrated european union microsoft competition case shows interoperability concerns important questions power relationships 2004 european commission found microsoft abused market power deliberately restricting interoperability windows work group servers non-microsoft work group servers microsoft able protect dominant market position work group server operating systems heart corporate networks microsoft ordered disclose complete accurate interface documentation enable rival vendors compete equal footing “ interoperability remedy ” june 2005 commission market testing new proposal microsoft rejected previous proposals insufficient interoperability also surfaced software patent debate european parliament june–july 2005 critics claim patents techniques required interoperability kept rand reasonable non discriminatory licensing conditions customers pay license fees twice product appropriate case patent protected programme product uses railways greater lesser interoperability depending conforming standards gauge couplings brakes signalling communications loading gauge structure gauge operating rules mention parameters passenger rail service different railway platform height width clearance standards may also cause interoperability problems north american freight intercity passenger railroads highly interoperable systems europe asia africa central south america australia much less parameter difficult overcome reasonable cost incompatibility gauge though variable gauge axle systems increasingly used | [
4469,
4212,
547,
3513,
6080,
1257,
374,
1636,
6524,
296,
7532,
7076,
7540,
6105,
5930,
578,
7093,
4705,
405,
7188,
668,
410,
1665,
506,
145,
3898,
5328,
7290,
5072,
7117,
7576,
2695,
4635,
7940,
611,
3916,
3237,
1237,
6948,
84,
8042,
... | Validation |
2,088 | 2 | GVisor:gvisor gvisor container sandbox developed google focuses security efficiency ease use.. gvisor implements around 200 linux system calls userspace additional security compared docker containers run directly top linux kernel isolated namespaces contrary linux kernel project written memory-safe programming language prevent common pitfalls frequently occur software written c. gvisor used google production environment like app engine standard environment cloud functions cloud ml engine google cloud run according google brad fitzpatrick recently gvisor integrated google kubernetes engine allows users sandbox kubernetes pods use cases like saas multitenancy | [
6984,
3495,
5571,
330,
578
] | Train |
2,089 | 7 | Elements_CRM:elements crm elements crm mac customer relationship management mac crm solution built ntractive apple business using apple devices offered cloud computing subscription-based service elements crm part desktop part cloud main functions include managing leads contact information tracking communication history managing tasks follow-ups tracking email communication creating estimates invoices managing projects architecture overall development elements crm product line initially began 2003 company founder justin bartak first product elements sbm launch october 2007 july 2009 product name changed elements crm ntractive privately held software development company based grand forks north dakota markets business software small medium-sized companies established 2006 company sole product elements crm customer relationship management application aimed small businesses use mac os x computers ipads iphones elements crm cloud based app employs unique site-specific browser merge os x desktop web application functionality product first introduced public keynote address apple 2007 world wide developer conference official launch elements sbm product ’ original name 1.0 took place macworld/iworld 2009 product renamed elements crm 2.0 release awarded honor apple staff pick july 2009 elements crm mac customer relationship management mac crm solution apple business using apple devices offered subscription-based service elements crm part desktop part cloud main functions include managing leads contact information tracking communication history managing tasks follow-ups tracking email communication creating estimates invoices managing projects elements crm ios universal mobile app iphone ipad elements crm ios add-on elements crm desktop app ipad crm version elements crm ios looks works feels like desktop app iphone crm app limited version important functions desktop app mac customer relationship management mac crm approach managing company ’ interaction current future customers apple inc desktop computers ios devices mac crm solutions web-based applications use web browser interaction instead mac crm combination cloud based app built apple programming language objective-c swift programming language mac crms involve using apple devices technology organize automate synchronize sales marketing customer service technical support | [
2961,
6788,
4575,
5091,
4228
] | Test |
2,090 | 3 | Plessey_System_250:plessey system 250 plessey system 250 first operational computer system implement capability-based addressing first sold commercially designed real-time controller computerized telephone switching systems multiprocessing architecture manufactured plessey company plc united kingdom 1970 successfully deployed ministry defence british army ptarmigan project served first gulf war tactical mobile communication network switch | [
180,
2859,
7072,
4771,
5962,
7554,
5504,
8111,
7570,
2615,
7414
] | Test |
2,091 | 2 | PackageKit:packagekit packagekit free open-source suite software applications designed provide consistent high-level front end number different package management systems packagekit created richard hughes 2007 first introduced operating system default application may 2008 release fedora 9 suite cross-platform though primarily targeted linux distributions follow interoperability standards set freedesktop.org group uses software libraries provided d-bus polkit projects handle inter-process communication privilege negotiation respectively since 1995 package formats around since 2000 dependency solvers auto-downloaders layer top around since 2004 graphical front-ends packagekit seeks introduce automatic updates without authenticate root fast-user-switching warnings translated correct locale common upstream gnome kde tools one software multiple linux distributions packagekit active maintenance since 2014 packagekit runs system-activated daemon codice_1 abstracts differences different systems library called codice_2 allows programs interact packagekit features include graphical front-ends packagekit include pkcon operates command-line number different package management systems known back-ends support different abstract methods signals used front-end tools back-ends supported include | [
5017,
5726,
4675,
4685,
395,
7912,
2581,
7555,
2594,
761,
781,
2260,
5092,
7959,
5103,
6883,
7619,
3366,
5480,
4778,
4059,
4441,
523,
163,
5530,
1989,
8055,
1621,
5200,
5545,
6609,
2728,
1260,
5912,
1267,
5571,
578,
2034,
2771,
6663,
16... | Test |
2,092 | 3 | Bank_Panic:bank panic bank panic arcade game developed sanritsu manufactured sega 1984 bally/midway manufactured game america player assumes part old west sheriff must protect bank customers masked robbers layout bank implicitly circle twelve numbered doors player center player rotate left right view three doors time doors open reveal customer drop bag money making deposit robber attempt shoot player young boy holding stack three five hats player rapidly shoot bag money bonus time level ends twelve doors received one deposits indicated numbered boxes across top screen red dollar sign showing door completed deposit random intervals bomb placed one doors rapid timer count 99 player must move door destroy bomb gunfire shooting customer shot robber failing destroy bomb failing complete level overall timer runs shown bar bottom screen costs player one life robbers wear white boots robbers need shot twice eliminated level starts word fair displayed cuckoo clock shooting robber sight deemed unfair robber incurs penalty however timer appear player fast enough shooting robber timer counts eventually averages timer cuckoo clock determines bonus points shooting robber timer showing 0:00 earns larger amount bonus points shooting robber red shirt earns maximum bonus points available 5,000 shooting robber red shirt timer says 0:00 lights letter word extra shown bottom screen lighting whole word earns extra life even bonus points automatic advancement next level due bug high score table shown game ends never attract mode west bank clone dinamic software zx spectrum commodore 64 msx amstrad cpc atari 8-bit family clone released 1992 bang bank hotel panic clone android | [
1237
] | Train |
2,093 | 4 | The_Snowden_Files:snowden files snowden files inside story world wanted man 2014 book luke harding published vintage books greg miller washington post described book first single-book account edward snowden 2013 leaking national security agency nsa documents however miller commented british perspective book overlooks significant u.s. developments underplays important work done journalists including barton gellman washington post greg miller concluded harding delivered clearly written captivating account snowden leaks aftermath succeeding beyond basic ambition arrive bookstores first book received positive reviews guardian london review books called super-readable thrillerish account events surrounding reporting documents michiko kakutani new york times wrote book reads like le carré novel crossed something kafka conversely daily telegraph david blair wrote harding story crackles verve complexity nuance banished particular real dilemmas intelligence work ignored snowden files initially criticised snowden associate journalist glenn greenwald read extracts harding book later reading whole book conceded criticise snowden february 14 2014 greenwald told financial times purporting tell inside story edward snowden written someone never met even spoken edward snowden luke came talked half day without realising trying get write book cut interview realised financial times since amended article stating harding insists spoke greenwald rio made clear research book snowden wikileaks founder snowden backer julian assange—subject 2011 book coauthored luke harding david leigh assange condemned—harshly criticized snowden files author calling book walloping fraud written frauds praised frauds assange stated disappointing thing snowden files exploitative existed understand pressures facing print journalism need diversify revenue order cross-subsidize investigative journalism investigative journalism involves able develop relationships trust sources snowden files along fictionalized time octopus snowden russian lawyer anatoly kucherena forms basis oliver stone film snowden 2016 | [
7524
] | Validation |
2,094 | 2 | Security_descriptor:security descriptor security descriptors data structures security information securable windows objects objects identified unique name security descriptors associated named objects including files folders shares registry keys processes threads named pipes services job objects resources security descriptors contain discretionary access control lists dacls contain access control entries aces grant deny access trustees users groups also contain system access control list sacls control auditing object access aces may explicitly applied object inherited parent object order aces acl important access denied aces appearing higher order aces grant access security descriptors also contain object owner mandatory integrity control implemented new type ace security descriptor files folder permissions edited various tools including windows explorer wmi command line tools like cacls xcacls icacls subinacl freeware win32 console fileacl free software utility setacl utilities edit security descriptor user needs write_dac permissions object permission usually delegated default administrators object owner ntfs uses set 14 12 older systems permissions files folders form acl stored security descriptors following table summarizes system permissions individual rows obscured using different names abbreviations various programs see icacls cacls columns well number levels permission mappings like generic access rights columns gr ge gw ga table generic_read generic_execute generic_write generic_all respectively standard access rights special permissions mapped permissions files folders | [
1710,
644,
4025,
8128,
5149,
458,
2631,
7564,
5637,
1534,
6256,
1805,
6022
] | Test |
2,095 | 4 | Fluhrer,_Mantin_and_Shamir_attack:fluhrer mantin shamir attack cryptography fluhrer mantin shamir attack stream cipher attack widely used rc4 stream cipher attack allows attacker recover key rc4 encrypted stream large number messages stream fluhrer mantin shamir attack applies specific key derivation methods apply general rc4-based ssl tls since ssl generates encryption keys uses rc4 hashing meaning different ssl sessions unrelated keys however closely related bar mitzvah attack based research revealed 2015 exploit cases weak keys generated ssl keying process fluhrer mantin shamir fms attack published 2001 paper weaknesses key scheduling algorithm rc4 takes advantage weakness rc4 key scheduling algorithm reconstruct key encrypted messages fms attack gained popularity network attack tools including airsnort weplab aircrack use recover key used wep protected wireless networks discussion use rc4 key scheduling algorithm ksa following pseudo-random generation algorithm prga also used basis fms attack lies use weak initialization vectors ivs used rc4 rc4 encrypts one byte time keystream output prga rc4 uses key initialize state machine via ksa continuously modifies state generates new byte keystream new state theoretically key stream functions random one-time pad pseudo-random number generator controls output step certain ivs attacker knowing first byte keystream first bytes key derive 1 th byte key due weakness prng used generate keystream first byte plaintext comes wep snap header attacker assume derive first byte keystream b ⊕ 0x aa snap header almost always 0xaa needs iv form 3 n − 1 x key index origin 0 element value space n 256 since 8 bits make byte x start attacker needs ivs 3 255 x wep uses 24-bit ivs making value one byte long start attacker utilizes iv first 3 elements k fills s-box sequential values 0 n rc4 initializing s-box known k performs first 3 iterations ksa begin initializing s-box third step attacker possibly definitely derive fourth byte key using keystream output computing − j − mod n k value 3 step point attacker yet fourth byte key algorithm regenerate next byte key generates possible value key collecting multiple messages—for example wep packets—and repeating steps attacker generate number different possible values correct value appears significantly frequently attacker determine value key recognizing value selecting next byte point start attack fifth byte key although attacker attack words key order store messages later sequential attack later words knows earlier words needs messages weak ivs discard others process gather large number messages attack entire key fact store short portion beginning messages enough carry attack far word key iv allow attack | [
6049,
1353,
2400,
7207,
1708
] | Test |
2,096 | 3 | LUNA:luna luna computer product line omron tateishi electric late 1980s early 1990s luna 20mhz/m68030 desktop computer netbsd supported luna since 1.4.2 released 2000 later omron luna 88k available two models dt8840 td8860 1-4 25 mhz 88100 cpus 16 mb ram native operating system cmu mach 2.5 omron unios | [
4939
] | Test |
2,097 | 1 | Lightning_Memory-Mapped_Database:lightning memory-mapped database lightning memory-mapped database lmdb software library provides high-performance embedded transactional database form key-value store lmdb written c api bindings several programming languages lmdb stores arbitrary key/data pairs byte arrays range-based search capability supports multiple data items single key special mode appending records end database mdb_append gives dramatic write performance increase similar stores lmdb relational database strictly key-value store like berkeley db dbm lmdb may also used concurrently multi-threaded multi-processing environment read performance scaling linearly design lmdb databases may one writer time however unlike many similar key-value databases write transactions block readers readers block writers lmdb also unusual multiple applications system may simultaneously open use lmdb store means scale performance also lmdb require transaction log thereby increasing write performance needing write data twice maintains data integrity inherently design lmdb design first discussed 2009 post openldap developer mailing list context exploring solutions cache management difficulty caused project dependence berkeley db specific goal replace multiple layers configuration caching inherent berkeley db design single automatically managed cache control host operating system development subsequently began initially fork similar implementation openbsd ldapd project first publicly available version appeared openldap source repository june 2011 project known mdb november 2012 renamed order avoid conflicts existing software internally lmdb uses b+ tree data structures efficiency design small footprint unintended side-effect providing good write performance well lmdb api similar berkeley db dbm lmdb treats computer memory single address space shared across multiple processes threads using shared memory copy-on-write semantics known historically single-level store due former modern computing architectures 32-bit memory address space limitations imposes hard limit 4 gb size database using techniques effectiveness technique directly mapping database single-level store strictly limited however today 64-bit processors mostly implement 48-bit address spaces giving access 47-bit addresses 128 terabytes database size making databases using shared memory useful real-world applications specific noteworthy technical features lmdb lmdb employs multiversion concurrency control mvcc allows multiple threads within multiple processes coordinate simultaneous access database readers scale linearly design write transactions globally serialized via mutex read-only transactions operate parallel including presence write transaction entirely wait free except first read-only transaction thread thread reading database gains ownership element shared memory array may update indicate within transaction writers scan array determine oldest database version transaction must preserve without requiring direct synchronization active readers 2011 google published software allowed users generate micro-benchmarks comparing leveldb performance sqlite kyoto cabinet different scenarios 2012 symas added support lmdb berkeley db made updated benchmarking software publicly available resulting benchmarks showed lmdb outperformed databases read batch write operations sqlite lmdb excelled write operations particularly synchronous/transactional writes benchmarks showed underlying filesystem big influence performance jfs external journal performs well especially compared modern systems like btrfs zfs zimbra tested back-mdb vs back-hdb performance openldap lmdb clearly outperforming bdb based back-hdb many openldap users observed similar benefits since initial benchmarking work done 2012 multiple follow-on tests conducted additional database engines in-memory on-disk workloads characterizing performance across multiple cpus record sizes tests show lmdb performance unmatched in-memory workloads excels disk-bound read workloads well disk-bound write workloads using large record sizes benchmark driver code subsequently published github expanded database coverage lmdb designed start resist data loss face system application crashes copy-on-write approach never overwrites currently-in-use data avoiding overwrites means structure disk/storage always valid application system crashes never leave database corrupted state default mode worst crash lose data last not-yet-committed write transaction even asynchronous modes enabled os catastrophic failure hardware power-loss event rather merely application crash could potentially result data corruption two academic papers usenix osdi symposium covered failure modes db engines including lmdb sudden power loss system crash paper pillai et al. find failure lmdb would occur real-world file systems considered single failure identified study lmdb relates hypothetical file systems mai zheng et al paper claims point failures lmdb conclusion depends whether fsync fdatasync utilised using fsync ameliorates problem selection fsync fdatasync compile-time switch default behavior current gnu/linux builds lmdb default macos *bsd android windows default gnu/linux builds lmdb therefore ones vulnerable problem discovered zhengmai researchers however lmdb may simply rebuilt gnu/linux users utilise fsync instead june 2013 oracle changed license berkeley db related project sleepycat license affero general public license thus restricting use wide variety applications caused debian project exclude library 6.0 onwards also criticized license friendly commercial redistributors discussion sparked whether licensing change could happen lmdb author howard chu made clear lmdb part openldap project bsd style license joined stay like copyright transferred anybody checking would make similar move like oracle impossible berkeley db license issue caused major gnu/linux distributions debian completely phase use berkeley db preference lmdb wrappers several programming languages c++ java python lua go ruby objective c javascript c perl php tcl common lisp complete list wrappers may found main web site howard chu ported sqlite 3.7.7.1 use lmdb instead original b-tree code calling end result sqlightning one cited insert test 1000 records 20 times faster original sqlite b-tree implementation lmdb available backing store open source projects including cyrus sasl heimdal kerberos opendkim also available nosql projects like memcachedb mapkeeper lmdb used make in-memory store redis persist data disk existing back-end redis showed pathological behaviour rare cases replacement sought baroque api lmdb criticized though forcing lot coding get simple things done however performance reliability testing considerably better alternative back-end stores tried independent third-party software developer utilised python bindings lmdb high-performance environment published prominent technical news site slashdot system managed successfully sustain 200,000 simultaneous read write delete operations per second total 600,000 database operations per second up-to-date list applications using lmdb maintained main web site many popular free software projects distribute include support lmdb often primary sole storage mechanism lmdb makes unusual novel use well-known computer science techniques copy-on-write semantics b+ trees provide atomicity reliability guarantees well performance hard accept given library relative simplicity similar key-value store database offers guarantees overall performance even though authors explicitly state presentations lmdb read-optimised write-optimised additionally lmdb primarily developed use openldap developers focussed mainly development maintenance openldap lmdb per se developers limited time spent presenting first benchmark results therefore criticized stating limitations giving silver bullet impression adequate address engineers attitude pointed concerns raised however later adequately addressed reviewer satisfaction key developer behind lmdb presentation spark database developers dissecting code in-depth understand works reviews run brief in-depth database developer oren eini wrote 12-part series articles analysis lmdb beginning july 9 2013 conclusion lines impressive codebase ... dearly needs love mainly long methods code duplication review conducted .net developer former experience c concluded august 22 2013 beyond issues code implementation really quite brilliant way lmdb manages pack much functionality things quite impressive ... learned quite lot project frustrating annoying fascinating experience multiple reviews cover lmdb various languages including chinese | [
3599,
4759,
3863,
5571,
7182,
578,
3873,
1104,
1105,
6117,
6462,
2429,
5965,
1435,
6505
] | Test |
2,098 | 2 | BeleniX:belenix belenix discontinued operating system distribution built using opensolaris source base used live cd well installed hard disk information provided belenix website may appear currently belenix compiled 32-bit execution i586/pentium op-code based compounded lack clarity belenix site whether belenix distribution supports true 64-bit i.e. x86-64/amd64 solaris kernel userland however oblique references belenix team members indicated belenix 0.7 live cd contains 32-bit 64-bit installation files initially developed live cd along lines knoppix showcase opensolaris technologies belenix went become initial base sun opensolaris distribution number technologies pioneered belenix project gone become full projects right within opensolaris ecosystem belenix focused using kde desktop environment although xfce also supported since beginning distribution upcoming release also include first-class support gnome belenix dev team focuses technology innovation aims working communities including opensolaris based distros milax nexenta os schillix name logo references celtic god light belenus belenix aims latest stable revisions software packages continuously pushed package repository aim mind however many cases bleeding-edge software pushed help validate try new features due reasons belenix also includes lot third-party drivers may found official opensolaris distribution sun focus belenix developer desktop also stable scalable enough work workstation development server environment mainly due quality underlying opensolaris kernel userland environment belenix thus also first-class opensolaris development environment completely self-hosting every package included belenix built belenix including opensolaris kernel belenix aims easy-to-use distribution gently exposes power opensolaris live cd format makes opensolaris easily approachable boots within two three minutes cd-rom also aims encourage innovation bringing new features usability enhancements increasing community participation announcement opensolaris project belenix started private project sun employees working sun india engineering centre bangalore india year 2005 aim something along lines knoppix showcase opensolaris end users weeks time iso image ready people make use period time belenix developed grew popularity non-sun contributors also joined effort developing foss community project belenix first opensolaris distribution bundle complete working xorg x11 gui environment years number critical innovations sprung belenix project later incorporated opensolaris distributions sun fact first beta release sun opensolaris distro largely based belenix belenix second opensolaris distribution appear schillix first provide auto-configuring xorg based gui introduced various missing technologies opensolaris important innovations include project indiana leveraged technologies served starting point taking technologies developed indiana account future focus belenix set evolve grow source-level indiana derivate focus kde desktop make fully featured functional opensolaris distro based kde check livecd features timeline references see chronological account belenix development till release opensolaris distro sun 2008 belenix team aims ensure packages co-exist system ensuring latest versions package built latest compilers result belenix far kde 3.5.9 built gcc 3.4.3 newer packages including kde4 increasingly built gcc 4.4 packages especially gnome components derived jds project built sun studio 12 actively migrated gcc 4.4 team aims eventually belenix built completely foss toolchain gcc belenix far positioned kde distribution also providing xfce upcoming releases also provide gnome belenix today uses caiman installer libraries used sun opensolaris distro going forward plans re-implement installer gui qt4 still using underlying caiman installer libraries belenix team presently continues use svr4 packaging solaris provided date team intend use ips present state due various technical reasons considering alternatives including deb format rpm5 format along smart package manager | [
3271,
3697,
4229,
6984,
326,
3732,
6761,
8037,
3751,
3678,
3423,
788,
6505
] | Test |
2,099 | 5 | Line_code:line code telecommunication line code pattern voltage current photons used represent digital data transmitted transmission line repertoire signals usually called constrained code data storage systems signals prone error others conveyed communication channel physics communication storage medium constrains repertoire signals used reliably common line encodings unipolar polar bipolar manchester code line coding signal put physical communication channel either transmission medium data storage medium common physical channels common binary line codes include line code advantages disadvantages line codes chosen meet one following criteria long-distance communication channels reliably transport dc component dc component also called disparity bias dc coefficient disparity bit pattern difference number one bits vs number zero bits running disparity running total disparity previously transmitted bits simplest possible line code unipolar gives many errors systems unbounded dc component line codes eliminate dc component codes called dc-balanced zero-dc dc-free three ways eliminating dc component bipolar line codes two polarities generally implemented rz radix three since three distinct output levels negative positive zero one principle advantages type code completely eliminate dc component important signal must pass transformer long transmission line unfortunately several long-distance communication channels polarity ambiguity polarity-insensitive line codes compensate channels three ways providing unambiguous reception 0 1 bits channels reliable clock recovery receiver maximum run length constraint may imposed generated channel sequence i.e. maximum number consecutive ones zeros bounded reasonable number clock period recovered observing transitions received sequence maximum run length guarantees clock recovery sequences without constraint could seriously hamper detection quality run-length limited rll coding line coding technique used send arbitrary data communications channel bandwidth limits rll codes defined four main parameters n k first two n refer rate code remaining two specify minimal maximal k number zeroes consecutive ones used telecommunication storage systems move medium past fixed recording head specifically rll bounds length stretches runs repeated bits signal change runs long clock recovery difficult short high frequencies might attenuated communications channel modulating data rll reduces timing uncertainty decoding stored data would lead possible erroneous insertion removal bits reading data back mechanism ensures boundaries bits always accurately found preventing bit slip efficiently using media reliably store maximal amount data given space early disk drives used simple encoding schemes rll 0,1 fm code followed rll 1,3 mfm code widely used hard disk drives mid-1980s still used digital optical discs cd dvd md hi-md blu-ray using efm efmplus codes higher density rll 2,7 rll 1,7 codes became de facto industry standard hard disks early 1990s line coding make possible receiver synchronize phase received signal synchronization ideal signal decoded optimal differences amplitude various digits symbols used line code increase error probability received data biphase line codes require least one transition per bit time makes easier synchronize transceivers detect errors however baud rate greater nrz codes also preferred line code structure enable error detection note line-coded signal signal produced terminal may differ thus requiring translation line code typically reflect technical requirements transmission medium optical fiber shielded twisted pair requirements unique medium one different behavior related interference distortion capacitance loss amplitude optical line codes | [
5714,
1618,
7241,
2099,
2102,
3956,
8184,
2114,
4970,
7569,
5777,
2149,
5693,
5175
] | Test |
2,100 | 4 | Conference_on_Email_and_Anti-Spam:conference email anti-spam conference email anti-spam ceas annual scientific conference sponsored microsoft subjects relating email use abuse latter commonly known spam ceas hosts concurrent open competition spam filters known ceas live spam filter challenge first conference held july 30–31 2004 2008 conference site always california either mountain view stanford university web site also apparently hosted stanford university sixth conference ceas held mountain view california seventh conference held redmond washington | [
7624,
1805
] | Test |
2,101 | 4 | Bacula:bacula bacula open-source enterprise-level computer backup system heterogeneous networks designed automate backup tasks often required intervention systems administrator computer operator bacula supports linux unix windows macos backup clients range professional backup devices including tape libraries administrators operators configure system via command line console gui web interface back-end catalog information stored mysql postgresql sqlite bacula set computer programs managing backup recovery verification computer data across network—providing backup solution mixed operating system environments bacula open-source released agpl version 3 license exceptions permit linking openssl distributing windows binaries bacula available dual license see multi-licensing agplv3 proprietary license several entities offer commercial support agpl bacula community version bacula systems sells various levels annual support contracts bacula enterprise edition contains various non-gpl components developed in-house 2015 bacula systems named top 20 promising data center solution providers cio review common dual-license software components developed bacula enterprise edition released bacula community edition period exclusivity proprietary version since april 2002 bacula 2 million downloads makes downloaded open-source backup program bacula features include client software executed file daemon running bacula client supports multiple operating systems default bacula differential incremental backups based system time stamps consequently move files existing directory move whole directory backup fileset full backup files may backed incremental save may old dates must explicitly update date/time stamp moved files bacula versions starting 3.0 later support accurate backup option addresses issue without requiring modification files timestamps feature always used accurate state filesystem important criteria applied configurable i.e inode comparisons modification times md5/sha1 signatures 2011 graham keeling former bacula community developer released friendly fork bacula february 2013 former bacula community developer several free software users released bareos fork bacula | [
3821,
1593,
2390,
4386,
3863,
3915,
4759,
5571,
3219,
7567,
7637,
578,
5956,
1435
] | Validation |
2,102 | 5 | Wire_protocol:wire protocol computer networking wire protocol refers way getting data point point wire protocol needed one application interoperate generally refers protocols higher physical layer contrast transport protocols transport level like tcp udp term wire protocol used describe common way represent information application level refers common application layer protocol common object semantic applications representation application level needs common infoset e.g xml data binding using e.g common encoding scheme like xsd wire protocol may either text-based binary protocol although important architectural decision separate matter distinction wire protocols programmatic apis electronics wire protocol mechanism used transmit data one point another wire protocol provides means interoperation one applications network often refer distributed object protocols use applications designed work together name suggests distributed object protocols run different processes one several computers connected network wire protocols provide means program running one operating system communicate program running operating system using internet interconnect multiple platforms language-independent allowing communication programs written different languages examples wire protocols include | [
4685,
7637,
2822,
7315,
2099
] | Validation |
2,103 | 1 | QUEL_query_languages:quel query languages quel relational database query language based tuple relational calculus similarities sql created part ingres dbms effort university california berkeley based codd earlier suggested implemented data sub-language alpha quel used short time products based freely available ingres source code notably implementation called postquel supported postgres oracle db2 gained market share early 1980s companies supporting quel moved sql instead quel continues available part ingres dbms although quel-specific language enhancements added many years quel statements always defined tuple variables used limit queries return result sets consider example taken one first original ingres papers equivalent sql statement sample simple session creates table inserts row retrieves modifies data inside finally deletes row added assuming name unique field another feature quel built-in system moving records en-masse system consider command creates comma-delimited file records student table d1 indicates delimiter opposed data type changing codice_1 codice_2 reverses process similar commands available many sql systems usually external tools opposed internal sql language makes unavailable stored procedures quel extremely powerful aggregation capability aggregates nested different aggregates independent by-lists and/or restriction clauses example example illustrates one arguably less desirable quirks quel namely string comparisons potentially pattern matches codice_3 matches y.str values starting ii | [
4303,
7248,
105,
3011,
4505,
6462,
6128,
2054,
5956,
684,
2878,
4635,
8137,
4743,
4747
] | Test |
2,104 | 6 | GFS2:gfs2 computing global file system 2 gfs2 shared-disk file system linux computer clusters gfs2 differs distributed file systems afs coda intermezzo glusterfs gfs2 allows nodes direct concurrent access shared block storage addition gfs gfs2 also used local filesystem gfs disconnected operating-mode client server roles nodes gfs cluster function peers using gfs cluster requires hardware allow access shared storage lock manager control access storage lock manager operates separate module thus gfs gfs2 use distributed lock manager dlm cluster configurations nolock lock manager local filesystems older versions gfs also support gulm server-based lock manager implements redundancy via failover gfs gfs2 free software distributed terms gnu general public license development gfs began 1995 originally developed university minnesota professor matthew o'keefe group students originally written sgi irix operating system 1998 ported linux since open source code provided convenient development platform late 1999/early 2000 made way sistina software lived time open-source project 2001 sistina made choice make gfs proprietary product developers forked opengfs last public release gfs enhanced include updates allowing work opendlm opengfs opendlm became defunct since red hat purchased sistina december 2003 released gfs many cluster-infrastructure pieces gpl late june 2004 red hat subsequently financed development geared towards bug-fixing stabilization development gfs2 derives gfs included along distributed lock manager shared gfs linux 2.6.19 red hat enterprise linux 5.2 included gfs2 kernel module evaluation purposes 5.3 update gfs2 became part kernel package gfs forms part fedora red hat enterprise linux 5.3 upwards associated centos linux distributions users purchase commercial support run gfs fully supported top red hat enterprise linux since red hat enterprise linux version 5.3 red hat enterprise linux advanced platform included support gfs additional cost following list summarizes version numbers major features introduced design gfs gfs2 targets san-like environments although possible use single node filesystem full feature-set requires san take form iscsi fibrechannel aoe device presented linux block device shared number nodes example drbd device dlm requires ip based network communicate normally ethernet many possible solutions depending upon choice san may possible combine normal practice involves separate networks dlm storage gfs requires fencing hardware kind requirement cluster infrastructure rather gfs/gfs2 required multi-node clusters usual options include power switches remote access controllers e.g drac ipmi ilo fencing used ensure node cluster believes failed suddenly start working another node recovering journal failed node also optionally restart failed node automatically recovery complete although designers gfs/gfs2 aimed emulate local filesystem closely number differences aware due existing filesystem interfaces allowing passing information relating cluster stem difficulty implementing features efficiently clustered manner example main difference one shared similar cluster filesystems cache control mechanism known glocks pronounced gee-locks gfs/gfs2 effect across whole cluster inode filesystem two glocks associated one called iopen glock keeps track processes inode open inode glock controls cache relating inode glock four states un unlocked sh shared – read lock df deferred – read lock incompatible sh ex exclusive four modes maps directly dlm lock mode ex mode inode allowed cache data metadata might dirty i.e waiting write back filesystem sh mode inode cache data metadata must dirty df mode inode allowed cache metadata must dirty df mode used direct i/o un mode inode must cache metadata order operations change inode data metadata interfere ex lock used means certain operations create/unlink files directory writes file general restricted one node cluster course operations multiple nodes work expected due requirement flush caches frequently efficient single frequently asked question gfs/gfs2 performance performance poor email servers solution break mail spool separate directories try keep far possible node reading writing private set directories gfs gfs2 journaled file systems gfs2 supports similar set journaling modes ext3 data=writeback mode metadata journaled mode supported gfs however possible turn journaling individual data-files zero size journaled files gfs number restrictions placed upon support mmap sendfile system calls also use different on-disk format regular files also inherit-journal attribute set directory causes files sub-directories created within directory journal inherit-journal respectively flag set used instead data=journal mount option ext3 supports gfs/gfs2 gfs2 also supports data=ordered mode similar data=writeback except dirty data synced journal flush completed ensures blocks added inode content synced back disk metadata updated record new size thus prevents uninitialised blocks appearing file node failure conditions default journaling mode data=ordered match ext3 default gfs2 yet support data=journal mode unlike gfs use on-disk format regular journaled files also supports journaled inherit-journal attributes gfs2 also relaxes restrictions file may journaled attribute changed time file open also ext3 performance reasons node gfs gfs2 journal gfs journals disk extents gfs2 journals regular files number nodes may mount filesystem one time limited number available journals gfs2 adds number new features gfs summary features already mentioned boxes right page gfs2 designed upgrading gfs would simple procedure end on-disk structure remained gfs including big-endian byte ordering differences though journaling systems gfs gfs2 compatible upgrading possible means tool gfs2_convert run filesystem off-line update metadata spare blocks gfs journals used create small per_node files required gfs2 update process data remains place gfs2 meta filesystem filesystem right alternate root main filesystem although behaves like normal filesystem contents various system files used gfs2 normally users need ever look gfs2 utilities mount unmount meta filesystem required behind scenes | [
3599,
2547,
7161,
4672,
6431,
3626,
5049,
6117,
759,
3998,
5783,
6854,
5437,
4375,
6500,
2621,
6505,
5457,
460,
1534,
7976,
4406,
821,
7258,
5130,
1561,
836,
5843,
2313,
6558,
2683,
5859,
5865,
4444,
5518,
6231,
869,
6586,
2704,
1605,
6... | Test |
2,105 | 4 | Secure_by_design:secure design secure design software engineering means software designed foundation secure malicious practices taken granted care taken minimize impact anticipation security vulnerabilities security vulnerability discovered invalid user input closely related practice using good software design domain-driven design cloud native way increase security reducing risk vulnerability-opening mistakes—even though design principles used originally conceived security purposes generally designs work well rely secret often secrecy reduces number attackers demotivating subset threat population logic increase complexity attacker increased attacker effort compromise target technique implies reduced inherent risks virtually infinite set threat actors techniques applied time cause secrecy methods fail mandatory proper security usually means everyone allowed know understand design secure advantage many people looking computer code improves odds flaws found sooner see linus law attackers also obtain code makes easier find vulnerabilities well also important everything works fewest privileges possible see principle least privilege example web server runs administrative user root admin privilege remove files users belong flaw program could put entire system risk whereas web server runs inside isolated environment privileges required network filesystem functions compromise system runs unless security around also flawed many things especially input distrusted secure design fault-tolerant program could even distrust internals two examples insecure design allowing buffer overflows format string vulnerabilities following c program demonstrates flaws gets function c standard library stop writing bytes codice_1 reads newline character eof typing 99 characters prompt constitutes buffer overflow allocating 100 characters codice_1 assumption almost given name user longer 99 characters n't prevent user actually typing 99 characters lead arbitrary machine code execution second flaw program tries print input passing directly codice_3 function function prints first argument replacing conversion specifications et cetera sequentially arguments call stack needed thus malicious user entered instead name program would attempt print non-existent integer value undefined behavior would occur related mistake web programming online script validate parameters example consider script fetches article taking filename read script parsed script might use following hypothetical url retrieve article dog food script input checking instead trusting filename always valid malicious user could forge url retrieve configuration files webserver depending script may expose /etc/passwd file unix-like systems contains among others user ids login names home directory paths shells see sql injection similar attack server/client architectures program side may authorised client client server may authorised server even man-in-the-middle attack could compromise communications often easiest way break security client/server system go head security mechanisms instead go around man middle attack simple example use collect details impersonate user important consider encryption hashing security mechanisms design ensure information collected potential attacker wo n't allow access another key feature client-server security design good coding practices example following known software design structure client broker help designing well-built structure solid foundation furthermore software modified future even important follows logical foundation separation client server programmer comes clearly understand dynamics program may end adding changing something add security flaw even best design always possibility better standardized design less chance occurring | [
623,
3932,
6694,
6515,
3681,
3448,
6430,
1461,
651,
2566,
6725,
2747,
5485,
1376,
3794,
5401,
2310,
6823,
1019,
2491,
6118,
5149,
6376,
3033,
7282,
3726,
7570,
1584,
4440,
5190,
6756,
3486,
2789,
74,
3495,
7865,
7319,
3680,
1805,
3426
] | Test |
2,106 | 4 | Carbon_Black_(company):carbon black company carbon black inc. formerly bit9 inc. cybersecurity company based waltham massachusetts company develops cloud-native endpoint security software designed detect malicious behavior help prevent malicious files attacking organization company leverages technology known predictive security cloud psc big data analytics cloud platform analyzes customers ’ unfiltered data threats company approximately 100 partners including ibm vmware partners account approximately 125 product integrations according s-1 filing sec carbon black currently 5,600-plus customers including approximately one third fortune 100 4 may 2018 company joined public markets listing cblk nasdaq exchange part ipo carbon black raised approximately 152 million valuation 1.25 billion prior ipo firm raised 190m investors including kleiner perkins highland capital sequoia accomplice blackstone carbon black founded bit9 inc. 2002 todd brennan allen hillery john hanratty company first ceo george kassabgi current ceo patrick morley formerly chief operating officer corel took position 2007 2013 company network broken malicious actors copied private signing key certificate used sign malware february 2014 bit9 acquired start-up security firm carbon black time acquisition company also raised 38.25 million series e funding bringing bit9 ’ total venture capital raised approximately 120 million company acquired objective logistics june 2015 august 2015 carbon black announced acquired data analytics firm visitrend would open technology development center downtown boston month later company announced would partner secureworks ernst young kroll trustwave rapid7 provide managed security incident response services company changed name bit9 inc carbon black inc. february 1 2016 july 2016 carbon black announced acquired next-generation antivirus provider confer undisclosed sum prior deal confer raised 25m venture funding 50 employees according wall street journal deal valued 100m | [
7795,
3890,
7359,
4492
] | Test |
2,107 | 2 | Roboto:roboto roboto neo-grotesque sans-serif typeface family developed google system font mobile operating system android released 2011 android 4.0 ice cream sandwich google developed font modern yet approachable emotional entire font family licensed apache license 2014 roboto redesigned android 5.0 lollipop roboto default font android since 2013 google services google+ google play youtube google maps mobile google search 2017 roboto used lcd countdown clocks new york city subway b division lines roboto bold default font unreal engine 4 kodi roboto condensed used display information european versions nintendo switch packaging including physical releases games font designed entirely in-house christian robertson previously released expanded ubuntu-title font personal type foundry betatype font officially made available free download january 12 2012 newly launched android design website compared android previous system font humanist sans-serif droid roboto belongs neo-grotesque genre sans-serif typefaces includes thin light regular medium bold black weights matching oblique styles rather true italics also includes condensed styles light regular bold also matching oblique designs 2014 matias duarte announced google i/o roboto significantly redesigned android 5.0 lollipop punctuation marks tittles lowercase j changed square rounded roboto received variable reviews release joshua topolsky editor-in-chief technology news media network verge describes font clean modern overly futuristic – science fiction font however typography commentator stephen coles typographica.org called initial release roboto “ four-headed frankenfont ” describing “ hodgepodge ” different typographic styles work well together type design professionals called obvious errors accented glyphs john gruber called font helvetica ripoff roboto supports latin greek partial cyrillic scripts android noto font used languages supported roboto including chinese simplified traditional japanese korean thai hindi roboto slab slab serif font based roboto introduced march 2013 default font google note-taking service google keep font changed sans-serif roboto 2018 available four weights thin light regular bold however oblique versions released roboto mono monospace font based roboto available five weights thin light regular medium bold oblique stylings weight heebo extension roboto includes hebrew characters | [
2902,
3933,
5372,
6427,
1095,
2927,
2569,
740,
4340,
42,
3309,
3310,
7924,
2591,
5771,
5775,
6489,
7223,
7956,
5455,
4762,
7967,
6176,
5473,
474,
5476,
6183,
822,
831,
5141,
7274,
136,
2317,
2673,
6209,
7285,
2683,
855,
6937,
168,
6232,... | Validation |
2,108 | 2 | List_of_iOS_devices:list ios devices list comparison devices designed marketed apple inc. run unix-like operating system named ios ipados often colloquially referred simply idevices devices include iphone ipod touch design similar iphone cellular radio cell phone hardware ipad three devices function digital audio portable media players internet clients apple tv runs tvos set-top box streaming media local sources certain internet services connected television set screen 1.35 billion ios devices sold worldwide march 2015 operating system ios devices updated itunes ios 5 later using over-the-air ota updates major version ios tends released every time new type iphone launched usually year minor changes throughout year needed updates free ios devices although ipod touch users formerly required pay update apple upgrades products hardware periodically approximately yearly source second third generation apple tv run unnamed operating system derived ios fourth subsequent generations apple tv run ios-based tvos first generation ran modified version mac os x tiger instead ios apple runs tests pre-production units determine battery life however purported maximums actual user experiences vary numbers hours unless specified apple increased storage capacity devices time units available given storage capacity indicated table indicates highest supported versions ios available generation ios devices beta versions may listed support discontinued older devices 3½-inch display introduced original iphone almost unchanged models 2010 ipad larger display also uses different aspect ratio resolution iphone 4 iphone 4s fourth generation ipod touch keep physical dimensions prior models double resolution dimensions thereby quadrupling number pixels amount space iphone 5 first departure traditional iphone ipod touch screen size increasing 3.5 4 resolution increased include extra screen space iphone 6 iphone 6 plus second departure traditional iphone ipod touch screen size increasing screen sizes 4 4.7 5.5 respectively increased resolution include extra screen space note hardware reviewers commented benchmark results comparable cpu/socs architecture due software codes optimization | [
6788,
3940,
7890,
5732,
722,
1094,
4320,
2926,
4690,
5037,
734,
5752,
405,
5405,
6125,
2954,
1123,
7572,
6482,
6847,
7211,
6142,
2609,
1895,
4373,
7226,
4376,
2978,
5091,
4749,
5450,
7601,
3346,
6874,
6165,
4389,
5463,
102,
463,
5469,
4... | Validation |
2,109 | 7 | Distributed_object:distributed object distributed computing distributed objects objects sense object-oriented programming distributed across different address spaces either different processes computer even multiple computers connected via network work together sharing data invoking methods often involves location transparency remote objects appear local objects main method distributed object communication remote method invocation generally message-passing one object sends message another object remote machine process perform task results sent back calling object distributed objects popular late 1990s early 2000s since fallen favor term may also generally refer one extensions basic object concept used context distributed computing replicated objects live distributed objects see also internet protocol suite local distributed objects differ many respects rpc facilities cross platform serialization protocol cap n proto amount distributed object protocol distributed object method calls executed chained single network request needs interface references/capabilities distributed objects implemented objective-c using cocoa api nsconnection class supporting objects distributed objects used java rmi corba lets one build distributed mixed object systems dcom framework distributed objects microsoft platform ddobjects framework distributed objects using borland delphi jt framework distributed components using messaging paradigm javaspaces sun specification distributed shared memory space based pyro framework distributed objects using python programming language distributed ruby drb framework distributed objects using ruby programming language | [
382,
3779,
5650,
3531,
2471,
6989,
5965,
7059,
6034,
5786,
3752,
3855,
3905
] | Test |
2,110 | 9 | TrueImage:trueimage trueimage postscript-compatible interpreter clone originally developed cal bauer bauer enterprises sold microsoft 1989 microsoft subsequently cross-licensed trueimage apple computer exchange truetype license many delays microsoft finally delivered version 1.0 trueimage apple apple announced would licensing postscript level 2 adobe systems months later apple tried build one product trueimage trueimage products ever released company however trueimage used variety laser printers abaton okidata lasermaster mid-1990s limited success | [
6016
] | Test |
2,111 | 4 | Middlebox:middlebox middlebox network appliance computer networking device transforms inspects filters otherwise manipulates traffic purposes packet forwarding common examples middleboxes include firewalls filter unwanted malicious traffic network address translators modify packets source destination addresses dedicated middlebox hardware widely deployed enterprise networks improve network security performance however even home network routers often integrated firewall nat middlebox functionality widespread deployment middleboxes network appliances resulted challenges criticism due poor interaction higher layer protocols lixia zhang jonathan b. postel professor computer science university california los angeles coined term middlebox 1999 following examples commonly deployed middleboxes although widely deployed middleboxes generated technical challenges application development controversy regarding impact middleboxes interfere application functionality restricting preventing end host applications performing properly network address translators present challenge nat devices divide traffic destined public ip address across several receivers connections host internet host behind nat initiated host behind nat nat learns traffic connection belongs local host thus traffic coming internet destined public shared address particular port nat direct traffic appropriate host however connections initiated host internet present nat opportunity learn internal host connection belongs moreover internal host may even know public ip address announce potential clients address connect resolve issue several new protocols proposed common middlebox-induced application challenges include web proxies serving stale date content firewalls rejecting traffic desired ports one criticism middleboxes limit choice transport protocols thus placing limits application service designs middleboxes may filter drop traffic conform expected behaviors new uncommon protocols protocol extensions may filtered middleboxes conversely certain types middlebox assist protocol deployment providing translation new old protocols ipv6 example deployed public endpoints load balancers proxies forms nat backend traffic routed ipv4 ipv6 generally middleboxes considered violate end-to-end principle computer system design | [
5564,
2111,
651,
1470,
5039,
79,
2681,
3680
] | Test |
2,112 | 7 | Diskless_shared-root_cluster:diskless shared-root cluster diskless shared-root cluster way manage several machines time instead operating system os local disk one image os available server nodes use image ssi cluster single-system image simplest way achieve use nfs server configured host generic boot image ssi cluster nodes pxe dhcp tftp nfs ensure single point failure nfs export boot-image hosted two node cluster architecture diskless computer cluster makes possible separate servers storage array operating system well actual reference data userfiles databases websites stored competitively attached storage system centralized manner server acts cluster node easily exchanged demand additional abstraction layer storage system computing power eases scale infrastructure notably storage capacity computing power network bandwidth scaled independent one another similar technology found vmscluster openvms trucluster tru64 unix open-source implementation diskless shared-root cluster known open-sharedroot | [
5337,
5453,
6461,
7639,
5571,
83
] | Test |
2,113 | 1 | British_and_Irish_Legal_Information_Institute:british irish legal information institute british irish legal information institute bailii pronounced bailey provides legal information especially reports cases decided courts united kingdom generally decisions england wales ireland northern ireland scotland european union european court human rights put online partial online database british irish legislation case law law reform reports treaties legal scholarship traditionally legal information accessible law report usually written private individuals groups court judgments official reports recently historically court judgment would simply spoken publication precedents built depended record interested third parties year books recorded judgments 1268 1535 probably compiled law students people like judge sir edward coke 1572 1615 created series reports would necessarily accurate record said recorded might selective inaccurate reporting industry developed people became involved specialised particular areas law incorporated council law reporting created 1885 released copies various cases still could gaps reporting however advent internet possible access multiple databases fee online particularly westlaw lexis however freely available source yet made bailii set long hard campaign various activists including senior members society computers law then-chairman neil cameron barrister laurie west-knights qc lord saville lord justice brooke concerned lack availability court judgments ordinary court users inspired australasian legal information institute austlii lii aim provide free access publicly available legal information 2006 bailii included 5 jurisdictions fourteen databases bailii website jointly hosted institute advanced legal studies university london university college cork law school bailii uses neutral citation method quickly adopted standard citation cases different series cases bailii produces follows bailii received criticisms due restrictions imposes usage guardian editorial noted bailii done wonderful job making case law freely accessible lawyers including historic european data otherwise difficult find however also noted small charity service struggles afford host 297,000 judgments allow search engines index instances even clear whether crown judge concerned holds copyright words reproducing site forbidden organization known judgmental established scrape information bailii make indexable search engines founding members judgmental included francis irving one developers theyworkforyou judgmental shut threat legal action regarding court records libel case former bailii chairman henry brooke defended criticisms stating restrictions indexing ensure records could retroactively edited removed clerical legal reasons errors information authorized published records properly anonymized brooke went explain bailii consider taking extra step making judgments searchable using google search engines necessary order achieve primary objective making judgments courts freely available public also stated restriction redistribution protect value-added content converting suitable format making efforts prevent publication material must published much material available bailii duplicated elsewhere example legislation rulings courts supreme court bailii agreement ministry justice indemnifying legal prosecutions bailii historically received payment part contract 2010/2011 tax year bailii received part contract | [] | Test |
2,114 | 5 | Modified_AMI_code:modified ami code modified ami codes digital telecommunications technique maintain system synchronization alternate mark inversion ami line codes modified deliberate insertion bipolar violations several types modified ami codes used various t-carrier e-carrier systems clock rate incoming t-carrier extracted bipolar line code signal transition provides opportunity receiver see transmitter clock ami code guarantees transitions always present mark 1 bit missing adjacent spaces 0 bits prevent loss synchronization long string zeros present payload deliberate bipolar violations inserted line code create sufficient number transitions maintain synchronization form run length limited coding receive terminal equipment recognizes bipolar violations removes user data marks attributable bipolar violations t-carrier originally developed voice applications voice signals digitized transmission via t-carrier data stream always includes ample 1 bits maintain synchronization help μ-law algorithm digitizing voice signals encodes silence continuous stream 1 bits however used transmission digital data conventional ami line code may fail sufficient marks permit recovery incoming clock synchronization lost happens many consecutive zeros user data transported exact pattern bipolar violations transmitted given case depends line rate i.e level line code t-carrier hierarchy polarity last valid mark user data prior unacceptably long string zeros would useful violation immediately following mark would produce transition reason modified ami codes include space 0 bit violation mark descriptions b denotes balancing mark opposite polarity preceding mark v denotes bipolar violation mark polarity preceding mark order preserve ami coding desirable absence dc bias number positive marks must equal number negative marks happens automatically balancing b marks line code must ensure positive negative violation marks balance first technique used ensure minimum density marks zero code suppression form bit stuffing set least significant bit 8-bit byte transmitted 1 bit already unavailable due robbed-bit signaling avoided need modify ami code way limited available data rates 56,000 bits per second per ds0 voice channel also low minimum density ones 12.5 sometimes led increased clock slippage span increased demand bandwidth compatibility g.703 isdn pri standards called 64,000 bits per second led system superseded b8zs commonly used north american t1 digital signal 1 1.544 mbit/s line code bipolar eight-zero substitution b8zs replaces string 8 consecutive zeros special pattern 000vb0vb depending polarity preceding mark could 000+−0−+ 000−+0+− north american t2 rate 6.312 mbit/s bipolar violations inserted 6 consecutive zeros occur line code called bipolar six-zero substitution b6zs replaces 6 consecutive zeros pattern 0vb0vb depending polarity preceding mark could 0+−0−+ 0−+0+− used levels european e-carrier system high density bipolar order 3 hdb3 code replaces instance 4 consecutive 0 bits one patterns 000v b00v choice made ensure consecutive violations differing polarity i.e. separated odd number normal − marks rules applied code built original string every time 4 consecutive zeros code replaced either 000− 000+ +00+ −00− determine pattern use one must count number pluses number minuses − since last violation bit v subtract one result odd number 000− 000+ used result even number +00+ −00− used determine polarity use one must look pulse preceding four zeros 000v form must used v simply copies polarity last pulse b00v form must used b v chosen opposite polarity last pulse examples bit streams codes ami hdb3 assume starting conditions previous 1 bit − previous violation even number 1 bits ago e.g preceding bits could ++− north american t3 rate 44.736 mbit/s bipolar violations inserted 3 consecutive zeros occur line code called bipolar three-zero substitution b3zs similar hdb3 run 3 consecutive zeros replaced 00v b0v choice made ensure consecutive violations differing polarity i.e separated odd number normal b marks line codes 3 states | [
5714,
4970,
5175,
5485,
7569,
2236,
2099,
5777
] | Test |
2,115 | 7 | BisQue_(Bioimage_Analysis_and_Management_Platform):bisque bioimage analysis management platform bisque free open source web-based platform exchange exploration large complex datasets developed vision research lab university california santa barbara bisque specifically supports large scale multi-dimensional multimodal-images image analysis metadata stored arbitrarily nested linked tag/value pairs allowing domain-specific data organization image analysis modules added perform complex analysis tasks compute clusters analysis results stored within database querying processing data analysis provenance maintained reproducibility results bisque easily deployed cloud computing environments computer clusters scalability bisque integrated nsf cyberinfrastructure project cyverse user interacts bisque via modern web browser project bisque originally started 2004 part us national science foundation nsf supported center bio-image informatics ucsb facilitate integration database image analysis methods specifically context microscopy images given diversity imaging equipment image formats urgent need access multiple formats uniform way importantly also need maintaining analysis provenance reproducing image analysis results early realized bisque go schema-less support needs diverse biological experiments—each experiment analysis results unique slightly different beginning bisque focused using web browser standard interface posed unique database visualization challenges dealing large scale multimodal data process bisque developed unique novel framework visualizing large images 100k x 100k pixels example currently supports 250 different image file formats within browser users visualize 2d 3d 4d 5d images export many standardized formats years bisque team closely worked iplant cyberinfrastructure cyverse supporting image database management needs plant biology community going beyond bioimaging applications bisque used analyzing underwater images video ref medical imaging applications current bisque interface supports latest dicom standard bisque integrated 100 different image features feature service next release include support deep learning methods feature classification services bisque provides online resource management analysis 5d biological images addition image collection management system facilitates common biological workflows typical biological images imaging experimental annotation repeated analysis presentation images results image metadata ingestion first step using bisque ingestion either happen web browser-based interface via bisque api date bisque supports 240 different image formats generic jpeg specialized microscopy image formats zeiss czi imaris ims nikon nd2 images arbitrarily large automatically pyramided ingestion guarantees fluent user experience panning zooming image viewer addition image data bisque also captures metadata image e.g. camera settings geo coordinates etc attaches image tags images metadata organized tags name–value pairs associated image bisque allows arbitrary number tags per resource arbitrary nesting tags similar xml documents provides flexible way managing information tailored needs underlying imaging project efficiency reliability tags values stored indexed tag/value table underlying sql database graphical annotations stored addition tags include simple objects points lines circles complex objects region outlines graphical objects stored indexed underlying database well addition searchable graphical annotation also rendered bisque image viewer overlays top viewed image users typically locate images interest browsing collections searching specific queries former bisque provides web-based tag organizer enables rapid filtering grouping large image collections tag names values latter bisque offers restful tag query interface find images specific tag values search capabilities converted sql queries tag/value table behind scenes besides tag-centric image organization bisque also provides traditional folder view allows users browse images navigating folders similar file manager bisque allows users write analysis modules programming language choice e.g. matlab python c++ using language-specific apis modules typically read images metadata generate new images additional metadata output results stored back system form tags graphical objects and/or images images metadata never over-written order preserve complete provenance information tested modules registered bisque system execution bisque supports different execution modes depending available infrastructure simple modules bisque execute single node high-performance needs bisque leverage htcondor high-throughput computing software framework coarse-grained distributed parallelization latter case bisque automatically parallelize analysis large image datasets collect results single bisque metadata document metadata bisque take many forms text objects interest user annotations another web-based file e.g associated publication pdf textual graphical markup viewing editing available web 5d image viewer viewer used image object browsing ground-truth acquisition statistical summaries biological objects additionally allows various visualization options channel mapping image enhancement projections rotations recent image viewer able present volumetric imagery 3d without browser plug-ins utilizing modern browsers webgl capabilities biological image sharing often difficult due proprietary formats bisque sharing images metadata analysis results performed web system contains export facility allows conversions image formats application variety image-processing operations export textual graphical annotations xml csv google docs services modules accessible via standard web access methods http permits wide variety tools web browsers custom analysis applications interact bisque bisque services implemented using restful design pattern architecture exposes resources uris resources manipulated using common http methods among many benefits attributed restful pattern scalability web caches use client side state processing resources bisque services exchange data xml format easy integration existing software bisque also provides api covers aspects resource ingestion search analysis manipulation currently available python matlab bisque used manage analyze 23.3 hours 884gb high definition video dives bering sea submarine canyons evaluate density fishes structure-forming corals sponges document describe fishing damage non-overlapping frames extracted video transect constant frequency 1 frame per 30s image processing algorithm developed matlab used detect laser dots projected onto seafloor scale reference bisque module system allows wrap matlab code analysis module parallelized across compute cluster addition frame manually annotated objects interest e.g. fishes sponges substrates annotations image metadata e.g. pixel resolution gps location stored bisque flexible metadata store annotations used compute average density species co-habitation behavior different regions canyons resulting new insights ecosystem bisque platform part iplant cyberinfrastructure cyverse analyze plant-related images context phenotype analysis bisque integrated iplant ’ authentication cloud storage high-performance grid computing infrastructure configured sample data algorithms designed assay phenotypes directional root-tip growth comparisons seed size differences version 0.5.5 bisque released modified bsd license requires proper visible attribution bisque project whole parts bisque used either research commercial purposes | [
4159,
2451,
6489,
5965,
4759,
5571,
6015,
2054,
7778,
578,
1878,
5889,
5117
] | Test |
2,116 | 5 | Multiplex_baseband:multiplex baseband telecommunication term multiplex baseband following meanings example output group multiplexer consists band frequencies 60 khz 108 khz group-level baseband results combining 12 voice-frequency input channels bandwidth 4 khz including guard bands turn 5 groups multiplexed super group baseband 312 khz 552 khz baseband however represent group-level baseband ten super groups turn multiplexed one master group output baseband may used modulate microwave-frequency carrier | [
1374
] | Test |
2,117 | 5 | Multiplexing:multiplexing telecommunications computer networks multiplexing sometimes contracted muxing method multiple analog digital signals combined one signal shared medium aim share scarce resource example telecommunications several telephone calls may carried using one wire multiplexing originated telegraphy 1870s widely applied communications telephony george owen squier credited development telephone carrier multiplexing 1910 multiplexed signal transmitted communication channel cable multiplexing divides capacity communication channel several logical channels one message signal data stream transferred reverse process known demultiplexing extracts original channels receiver end device performs multiplexing called multiplexer mux device performs reverse process called demultiplexer demux dmx inverse multiplexing imux opposite aim multiplexing namely break one data stream several streams transfer simultaneously several communication channels recreate original data stream computing i/o multiplexing also used refer concept processing multiple input/output events single event loop system calls like poll select unix multiple variable bit rate digital bit streams may transferred efficiently single fixed bandwidth channel means statistical multiplexing asynchronous mode time-domain multiplexing form time-division multiplexing digital bit streams transferred analog channel means code-division multiplexing techniques frequency-hopping spread spectrum fhss direct-sequence spread spectrum dsss wireless communications multiplexing also accomplished alternating polarization horizontal/vertical clockwise/counterclockwise adjacent channel satellite phased multi-antenna array combined multiple-input multiple-output communications mimo scheme wired communication space-division multiplexing also known space-division multiple access use separate point-to-point electrical conductors transmitted channel examples include analogue stereo audio cable one pair wires left channel another right channel multi-pair telephone cable switched star network telephone access network switched ethernet network mesh network wireless communication space-division multiplexing achieved multiple antenna elements forming phased array antenna examples multiple-input multiple-output mimo single-input multiple-output simo multiple-input single-output miso multiplexing ieee 802.11g wireless router k antennas makes principle possible communicate k multiplexed channels peak bit rate 54 mbit/s thus increasing total peak bit rate factor k different antennas would give different multi-path propagation echo signatures making possible digital signal processing techniques separate different signals techniques may also utilized space diversity improved robustness fading beamforming improved selectivity rather multiplexing frequency-division multiplexing fdm inherently analog technology fdm achieves combining several signals one medium sending signals several distinct frequency ranges single medium fdm signals electrical signals one common applications fdm traditional radio television broadcasting terrestrial mobile satellite stations cable television one cable reaches customer residential area service provider send multiple television channels signals simultaneously cable subscribers without interference receivers must tune appropriate frequency channel access desired signal variant technology called wavelength-division multiplexing wdm used optical communications time-division multiplexing tdm digital rare cases analog technology uses time instead space frequency separate different data streams tdm involves sequencing groups bits bytes individual input stream one way associated appropriate receiver done sufficiently quickly receiving devices detect circuit time used serve another logical communication path consider application requiring four terminals airport reach central computer terminal communicated 2400 baud rather acquire four individual circuits carry low-speed transmission airline installed pair multiplexers pair 9600 baud modems one dedicated analog communications circuit airport ticket desk back airline data center also installed web proxy servers e.g polipo use tdm http pipelining multiple http transactions onto tcp/ip connection carrier sense multiple access multidrop communication methods similar time-division multiplexing multiple data streams separated time medium signals separate origins instead combined single signal best viewed channel access methods rather form multiplexing td legacy multiplexing technology still providing backbone national fixed line telephony networks europe providing 2m/bit voice signalling ports narrow band telephone exchanges dms100 e1 2m/bit tdm port provides either 30 31 speech timeslots case ccitt7 signalling systems 30 voice channels customer connected q931 dass2 dpnss v5 cass signalling systems polarization-division multiplexing uses polarization electromagnetic radiation separate orthogonal channels practical use radio optical communications particularly 100 gbit/s per channel fiber optic transmission systems orbital angular momentum multiplexing relatively new experimental technique multiplexing multiple channels signals carried using electromagnetic radiation single path potentially used addition physical multiplexing methods greatly expand transmission capacity systems still early research phase small-scale laboratory demonstrations bandwidths 2.5 tbit/s single light path controversial subject academic community many claiming new method multiplexing rather special case space-division multiplexing code division multiplexing cdm code division multiple access cdma spread spectrum class techniques several channels simultaneously share frequency spectrum spectral bandwidth much higher bit rate symbol rate one form frequency hopping another direct sequence spread spectrum latter case channel transmits bits coded channel-specific sequence pulses called chips number chips per bit chips per symbol spreading factor coded transmission typically accomplished transmitting unique time-dependent series short pulses placed within chip times within larger bit time channels different code transmitted fiber radio channel medium asynchronously demultiplexed advantages conventional techniques variable bandwidth possible statistical multiplexing wide bandwidth allows poor signal-to-noise ratio according shannon-hartley theorem multi-path propagation wireless communication combated rake receivers significant application cdma global positioning system gps multiplexing technique may extended multiple access method channel access method example tdm time-division multiple access tdma statistical multiplexing carrier-sense multiple access csma multiple access method makes possible several transmitters connected physical medium share capacity multiplexing provided physical layer osi model multiple access also involves media access control protocol part data link layer transport layer osi model well tcp/ip model provides statistical multiplexing several application layer data flows to/from computer code-division multiplexing cdm technique channel transmits bits coded channel-specific sequence pulses coded transmission typically accomplished transmitting unique time-dependent series short pulses placed within chip times within larger bit time channels different code transmitted fiber asynchronously demultiplexed widely used multiple access techniques time-division multiple access tdma frequency-division multiple access fdma code-division multiplex techniques used access technology namely code-division multiple access cdma universal mobile telecommunications system umts standard third-generation 3g mobile communication identified itu earliest communication technology using electrical wires therefore sharing interest economies afforded multiplexing electric telegraph early experiments allowed two separate messages travel opposite directions simultaneously first using electric battery ends one end telephony customer telephone line typically ends remote concentrator box multiplexed along telephone lines neighborhood similar area multiplexed signal carried central switching office significantly fewer wires much distances customer line practically go likewise also true digital subscriber lines dsl fiber loop fitl common method multiplexing uses optical fiber backbone connects pots phone lines rest pstn also replaces dsl connecting directly ethernet wired home asynchronous transfer mode often communications protocol used cable tv long carried multiplexed television channels late 20th century began offering services telephone companies iptv also depends multiplexing video editing processing systems multiplexing refers process interleaving audio video one coherent data stream digital video transport stream normally feature container format may include metadata information subtitles audio video streams may variable bit rate software produces transport stream and/or container commonly called statistical multiplexer muxer demuxer software extracts otherwise makes available separate processing components stream container digital television systems several variable bit-rate data streams multiplexed together fixed bitrate transport stream means statistical multiplexing makes possible transfer several video audio channels simultaneously frequency channel together various services may involve several standard definition television sdtv programmes particularly dvb-t dvb-s2 isdb atsc-c one hdtv possibly single sdtv companion channel one 6 8 mhz-wide tv channel device accomplishes called statistical multiplexer several systems multiplexing results mpeg transport stream newer dvb standards dvb-s2 dvb-t2 capacity carry several hdtv channels one multiplex digital radio multiplex also known ensemble number radio stations grouped together multiplex stream digital information includes audio data communications satellites carry broadcast television networks radio networks known multiple channel per carrier mcpc multiplexing practical different sources using single transponder single channel per carrier mode used fm broadcasting analog radio media multiplexing term commonly given process adding subcarriers audio signal enters transmitter modulation occurs fact stereo multiplex signal generated using time-division multiplexing switching two left channel right channel input signals ultrasonic rate subcarrier filtering higher harmonics multiplexing sense sometimes known mpx turn also old term stereophonic fm seen stereo systems since 1960s spectroscopy term used indicate experiment performed mixture frequencies respective response unravelled afterwards using fourier transform principle computer programming may refer using single in-memory resource file handle handle multiple external resources on-disk files electrical multiplexing techniques require physical multiplexer device refer keyboard matrix charlieplexing design style high-throughput dna sequencing term used indicate artificial sequences often called barcodes indexes added link given sequence reads given sample thus allow sequencing multiple samples reaction | [
5714,
365,
1443,
3956,
5387,
7543,
7550,
740,
4341,
6468,
7569,
2236,
1127,
768,
4365,
1142,
2258,
3338,
84,
4378,
7241,
4392,
2652,
7637,
5492,
5847,
3724,
4801,
1976,
5175,
1988,
3755,
6966,
7331,
911,
1279,
2400,
7738,
8108,
1670,
20... | Test |
2,118 | 2 | UNIX_System_V:unix system v unix system v pronounced system five one first commercial versions unix operating system originally developed first released 1983 four major versions system v released numbered 1 2 3 4 system v release 4 svr4 commercially successful version result effort marketed unix system unification solicited collaboration major unix vendors source several common commercial unix features system v sometimes abbreviated sysv unix market divided five system v variants ibm aix hewlett-packard hp-ux oracle solaris xinuos unixware illumos distributions open-source opensolaris continuation system v successor 1982 unix system iii developed sold hardware ran system v customers ran version reseller based reference implementation standards document called system v interface definition outlined default features behavior implementations formative years computer business division went several phases system v software groups beginning unix support group usg followed unix system development laboratory usdl followed information systems attis finally unix system laboratories usl 1980s early-1990s unix system v berkeley software distribution bsd two major version unix historically bsd also commonly called bsd unix berkeley unix eric s. raymond summarizes longstanding relationship rivalry system v bsd early period hp ibm others chose system v basis unix offerings vendors sun microsystems dec extended bsd throughout development though system v infused features bsd bsd variants dec ultrix received system v features sun microsystems worked together merge system v bsd-based sunos produce solaris one primary system v descendants still use today since early 1990s due standardization efforts posix commercial success linux division system v bsd become less important system v known inside bell labs unix 5.0 succeeded previous commercial unix called system iii january 1983 unix 4.0 never released externally would designated system iv first release system v called system v.0 system v release 1 svr1 developed unix support group usg based bell labs internal usg unix 5.0 system v also included features vi editor curses 4.1 bsd developed university california berkeley also improved performance adding buffer inode caches also added support inter-process communication using messages semaphores shared memory developed earlier bell-internal cb unix svr1 ran dec pdp-11 vax minicomputers unix support group usg transformed unix system development laboratory usdl released system v release 2 1984 svr2 added shell functions svid svr2.4 added demand paging copy-on-write shared memory record file locking concept porting base formalized dec vax-11/780 chosen release porting base so-called original version release porting efforts machines emanate educational source licenses svr2 offered us 800 first cpu 400 additional cpu commercial source license offered 43,000 three months support 16,000 price per additional cpu apple computer a/ux operating system initially based release sco xenix also used svr2 basis first release hp-ux also svr2 derivative maurice j. bach book design unix operating system definitive description svr2 kernel unix system development laboratory usdl succeeded information systems attis distributed unix system v release 3 1987 svr3 included streams remote file sharing rfs file system switch fss virtual file system mechanism restricted form shared libraries transport layer interface tli network api final version release 3.2 1988 added binary compatibility xenix intel platforms see intel binary compatibility standard user interface improvements included layers windowing system dmd 5620 graphics terminal svr3.2 curses libraries offered eight color pairs time important features forms panels menus etc. 3b2 became official porting base sco unix based upon svr3.2 isc 386/ix among obscure distributions svr3.2 386 esix 3.2 everex system v release 3.2 sold intel two shipped plain vanilla codebase ibm aix operating system svr3 derivative system v release 4.0 announced october 18 1988 incorporated variety commercial unix products early 1989 onwards joint project unix system laboratories sun microsystems combined technology new features included many companies licensed svr4 bundled computer systems workstations network servers svr4 systems vendors included atari atari system v commodore amiga unix data general dg/ux fujitsu uxp/ds hitachi hi-ux hewlett-packard hp-ux ncr unix/ns nec ews-ux up-ux ux/4800 super-ux oki oki system v pyramid technology dc/osx sgi irix siemens sinix sony news-os sumitomo electric industries seiux sun microsystems solaris illumos 2010s open-source platform software porting houses also sold enhanced supported intel x86 versions svr4 software vendors included dell dell unix everex esix micro station technology svr4 microport svr4 uhc svr4 primary platforms svr4 intel x86 sparc sparc version called solaris 2 internally sunos 5.x developed sun relationship sun terminated release svr4 meaning later versions solaris inherit features later svr4.x releases sun would 2005 release source code solaris 10 sunos 5.10 open-source opensolaris project creating forks open-source albeit heavily modified system v implementation available oracle took sun solaris forked proprietary release illumos continuation project developed open-source consortium intel-based resellers including unisys icl ncr corporation olivetti developed svr4.0mp multiprocessing capability allowing system calls processed processor interrupt servicing master processor release 4.1 es enhanced security added security features required orange book b2 compliance access control lists support dynamic loading kernel modules 1992 usl engaged joint venture novell called univel year saw release system v.4.2 univel unixware featuring veritas file system vendors included uhc consensys release 4.2mp completed late 1993 added support multiprocessing released unixware 2 1995 eric s. raymond warned prospective buyers svr4.2 versions often include on-line man pages 1994 buyers guide attributes change policy unix system laboratories santa cruz operation sco owners xenix eventually acquired unixware trademark distribution rights system v release 4.2 codebase novell vendors sun ibm hp continued use extend system v release 4 novell transferred ownership unix trademark open group operating system meets single unix specification sus effectively successor system v interface definition may granted unix rights sus met apple macos bsd derivative well several operating systems derived either bsd system v. system v release 5 developed 1997 santa cruz operation sco merger sco openserver svr3-derivative unixware focus large-scale servers released sco unixware 7 sco successor sco group also based sco openserver 6 svr5 codebase used major developer reseller system v release 6 announced sco released end 2004 apparently cancelled supposed support 64-bit systems industry coalesced around open group single unix specification version 3 unix 03 see also smallfoot 1980s 1990s variety svr4 versions unix available commercially x86 pc platform however market commercial unix pcs declined linux bsd became widely available late 1994 eric s. raymond discontinued pc-clone unix software buyer guide usenet stating reason dropping run linux longer find svr4 market interesting significant 1998 confidential memo microsoft stated linux track eventually x86 unix market predicted believe linux – moreso nt – biggest threat sco near future infoworld article 2001 characterized sco unixware bleak outlook due trounced market linux solaris idc predicted sco would continue see shrinking share market project monterey started 1998 combine major features existing commercial unix platforms joint project compaq ibm intel sco sequent computer systems target platform meant intel new ia-64 architecture itanium line processors however project abruptly canceled 2001 little progress 2001 several major unix variants sco unixware compaq tru64 unix sgi irix decline three major unix versions well market ibm aix hewlett-packard hp-ux sun solaris 2006 sgi declared bankruptcy analysts questioned whether linux would replace proprietary unix altogether 2006 article written computerworld mark hall economics linux cited major factor driving migration unix linux article also cites trends high-performance computing applications evidence dramatic shift unix linux november 2015 survey top 500 supercomputers unix used 1.2 running ibm aix linux used 98.8 survey november 2017 reports 100 using linux system v derivatives continued deployed proprietary server platforms principal variants system v remain commercial use aix ibm solaris oracle hp-ux hp according study done idc 2012 worldwide unix market divided ibm 56 oracle 19.2 hp 18.6 commercial unix vendor 2 market industry analysts generally characterize proprietary unix entered period slow permanent decline opensolaris derivatives svr4 descendants open-source software core system software continues developed illumos used illumos distributions smartos openindiana others system v interprocess communication mechanisms available unix-like operating systems derived system v particular linux reimplementation unix well bsd derivative freebsd posix 2008 specifies replacement interfaces freebsd maintains binary compatibility layer coff format allows freebsd execute binaries compiled svr3.2 derivatives sco unix interactive unix modern system v linux bsd platforms use elf file format natively compiled binaries | [
1807,
3599,
5362,
361,
6085,
5374,
396,
5048,
1105,
7555,
7916,
4713,
410,
4344,
1493,
56,
4733,
5783,
4013,
443,
444,
1522,
4751,
4387,
473,
5822,
5481,
2294,
2300,
4799,
5865,
4816,
4447,
6577,
4094,
6583,
3062,
1614,
7702,
3764,
4478... | Test |
2,119 | 5 | Dynamic_Host_Configuration_Protocol:dynamic host configuration protocol dynamic host configuration protocol dhcp network management protocol used udp/ip networks whereby dhcp server dynamically assigns ip address network configuration parameters device network communicate ip networks dhcp server enables computers request ip addresses networking parameters automatically internet service provider isp reducing need network administrator user manually assign ip addresses network devices absence dhcp server computer device network needs manually assigned ip address assign apipa address enable communicate outside local subnet dhcp implemented networks ranging size home networks large campus networks regional internet service provider networks router residential gateway enabled act dhcp server residential network routers receive globally unique ip address within isp network within local network dhcp server assigns local ip address device connected network 1984 reverse address resolution protocol rarp defined rfc 903 introduced allow simple devices diskless workstations dynamically obtain suitable ip address however acted data link layer made implementation difficult many server platforms also required server present individual network link rarp superseded bootstrap protocol bootp defined rfc 951 september 1985 introduced concept relay agent allowed forwarding bootp packets across networks allowing one central bootp server serve hosts many ip subnets dhcp based bootp dynamically allocate ip addresses pool reclaim longer use also used deliver wide range extra configuration parameters ip clients including platform-specific parameters dhcp first defined rfc 1531 october 1993 due errors editorial process almost immediately reissued rfc 1541 four years later dhcpinform message type small changes added rfc 2131 remains standard ipv4 networks dhcpv6 initially described rfc 3315 2003 updated many subsequent rfcs rfc 3633 added dhcpv6 mechanism prefix delegation stateless address autoconfiguration added rfc 3736 udp/ip defines devices one network communicate devices another network dhcp server manage udp/ip settings devices network automatically dynamically assigning ip addresses devices dhcp operates based client–server model computer device connects network dhcp client software sends dhcp broadcast query requesting necessary information dhcp server network may service request dhcp server manages pool ip addresses information client configuration parameters default gateway domain name name servers time servers receiving dhcp request dhcp server may respond specific information client previously configured administrator specific address information valid entire network time period allocation lease valid dhcp client typically queries information immediately booting periodically thereafter expiration information dhcp client refreshes assignment initially requests parameter values dhcp server may assign new address based assignment policies set administrators large networks consist multiple links single dhcp server may service entire network aided dhcp relay agents located interconnecting routers agents relay messages dhcp clients dhcp servers located different subnets depending implementation dhcp server may three methods allocating ip addresses dhcp used internet protocol version 4 ipv4 ipv6 versions serve purpose details protocol ipv4 ipv6 differ sufficiently may considered separate protocols ipv6 operation devices may alternatively use stateless address autoconfiguration ipv6 hosts may also use link-local addressing achieve operations restricted local network link dhcp employs connectionless service model using user datagram protocol udp implemented two udp port numbers operations bootstrap protocol bootp udp port number 67 destination port server udp port number 68 used client dhcp operations fall four phases server discovery ip lease offer ip lease request ip lease acknowledgement stages often abbreviated dora discovery offer request acknowledgement dhcp operation begins clients broadcasting request client server different subnets dhcp helper dhcp relay agent may used clients requesting renewal existing lease may communicate directly via udp unicast since client already established ip address point additionally broadcast flag 1 bit 2 byte flags field bits reserved set 0 client use indicate way broadcast unicast receive dhcpoffer 0x8000 broadcast 0x0000 unicast usually dhcpoffer sent unicast hosts accept unicast packets ip addresses configured flag used work around issue dhcp client broadcasts dhcpdiscover message network subnet using destination address 255.255.255.255 limited broadcast specific subnet broadcast address directed broadcast dhcp client may also request last known ip address client remains connected network server may grant request otherwise depends whether server set authoritative authoritative server denies request causing client issue new request non-authoritative server simply ignores request leading implementation-dependent timeout client expire request ask new ip address example htype set 1 specify medium used ethernet hlen set 6 ethernet address mac address 6 octets long chaddr set mac address used client options set well dhcp server receives dhcpdiscover message client ip address lease request dhcp server reserves ip address client makes lease offer sending dhcpoffer message client message contains client client id traditionally mac address ip address server offering subnet mask lease duration ip address dhcp server making offer dhcp server may also take notice hardware-level mac address underlying transport layer according current rfcs transport layer mac address may used client id provided dhcp packet dhcp server determines configuration based client hardware address specified chaddr client hardware address field server 192.168.1.1 specifies client ip address yiaddr ip address field response dhcp offer client replies dhcprequest message broadcast server requesting offered address client receive dhcp offers multiple servers accept one dhcp offer based required server identification option request broadcast messaging servers informed whose offer client accepted dhcp servers receive message withdraw offers made client return offered ip address pool available addresses dhcp server receives dhcprequest message client configuration process enters final phase acknowledgement phase involves sending dhcpack packet client packet includes lease duration configuration information client might requested point ip configuration process completed protocol expects dhcp client configure network interface negotiated parameters client obtains ip address probe newly received address e.g arp address resolution protocol prevent address conflicts caused overlapping address pools dhcp servers dhcp client may request information server sent original dhcpoffer client may also request repeat data particular application example browsers use dhcp inform obtain web proxy settings via client sends request dhcp server release dhcp information client deactivates ip address client devices usually know users may unplug network protocol mandate sending dhcp release dhcp server provide optional configuration parameters client rfc 2132 describes available dhcp options defined internet assigned numbers authority iana dhcp bootp parameters dhcp client select manipulate overwrite parameters provided dhcp server unix-like systems client-level refinement typically takes place according values configuration file /etc/dhclient.conf options octet strings varying length first octet option code second octet number following octets remaining octets code dependent example dhcp message-type option offer would appear 0x35 0x01 0x02 0x35 code 53 dhcp message type 0x01 means one octet follows 0x02 value offer following tables list available dhcp options listed rfc 2132 iana registry option exists identify vendor functionality dhcp client information variable-length string characters octets meaning specified vendor dhcp client one method dhcp client utilize communicate server using certain type hardware firmware set value dhcp requests called vendor class identifier vci option 60 method allows dhcp server differentiate two kinds client machines process requests two types modems appropriately types set-top boxes also set vci option 60 inform dhcp server hardware type functionality device value option set gives dhcp server hint required extra information client needs dhcp response relay agent information option option 82 specifies container attaching sub-options dhcp requests transmitted dhcp relay dhcp server small networks one ip subnet managed dhcp clients communicate directly dhcp servers however dhcp servers also provide ip addresses multiple subnets case dhcp client yet acquired ip address communicate directly dhcp server using ip routing routable ip address know link layer address router know ip address dhcp server order allow dhcp clients subnets directly served dhcp servers communicate dhcp servers dhcp relay agents installed subnets dhcp client broadcasts local link relay agent receives broadcast transmits one dhcp servers using unicast relay agent stores ip address field giaddr field dhcp packet dhcp server uses giaddr-value determine subnet relay agent received broadcast allocates ip address subnet dhcp server replies client sends reply giaddr-address using unicast relay agent retransmits response local network situation communication relay agent dhcp server typically uses source destination udp port 67 dhcp ensures reliability several ways periodic renewal rebinding failover dhcp clients allocated leases last period time clients begin attempt renew leases half lease interval expired sending unicast dhcprequest message dhcp server granted original lease server unreachable fail respond dhcprequest however case client repeats dhcprequest time time dhcp server comes back becomes reachable dhcp client succeed contacting renew lease dhcp server unreachable extended period time dhcp client attempt rebind broadcasting dhcprequest rather unicasting broadcast dhcprequest message reach available dhcp servers dhcp server able renew lease time order rebinding work client successfully contacts backup dhcp server server must accurate information client binding maintaining accurate binding information two servers complicated problem servers able update lease database must mechanism avoid conflicts updates independent servers proposal implementing fault-tolerant dhcp servers submitted internet engineering task force never formalized rebinding fails lease eventually expire lease expires client must stop using ip address granted lease time restart dhcp process beginning broadcasting codice_1 message since lease expired accept ip address offered new ip address presumably different dhcp server able use network however since ip address changed ongoing connections broken 2018 dhcp remains widely-used automatically assign ip addresses newer iterations assigning ip addresses include dhcpv6 slaac base dhcp include mechanism authentication vulnerable variety attacks attacks fall three main categories client way validate identity dhcp server unauthorized dhcp servers commonly called rogue dhcp operated networks providing incorrect information dhcp clients serve either denial-of-service attack preventing client gaining access network connectivity man-in-the-middle attack dhcp server provides dhcp client server ip addresses ip address one dns servers attacker convince dhcp client dns lookups dns server therefore provide answers dns queries client turn allows attacker redirect network traffic allowing eavesdrop connections client network servers contacts simply replace network servers dhcp server secure mechanism authenticating client clients gain unauthorized access ip addresses presenting credentials client identifiers belong dhcp clients also allows dhcp clients exhaust dhcp server store ip addresses—by presenting new credentials time asks address client consume available ip addresses particular network link preventing dhcp clients getting service dhcp provide mechanisms mitigating problems relay agent information option protocol extension rfc 3046 usually referred industry actual number option 82 allows network operators attach tags dhcp messages messages arrive network operator trusted network tag used authorization token control client access network resources client access network upstream relay agent lack authentication prevent dhcp server operator relying authorization token another extension authentication dhcp messages rfc 3118 provides mechanism authenticating dhcp messages 2002 nowiki rfc 3118 /nowiki seen widespread adoption problems managing keys large numbers dhcp clients 2007 book dsl technologies remarked numerous security vulnerabilities identified security measures proposed rfc 3118 fact combined introduction 802.1x slowed deployment take-rate authenticated dhcp never widely deployed 2010 book notes implementations dhcp authentication challenges key management processing delays due hash computation deemed heavy price pay perceived benefits architectural proposals 2008 involve authenticating dhcp requests using 802.1x pana transport eap ietf proposal made including eap dhcp so-called eapodhcp appear progressed beyond ietf draft level last dates 2010 | [
7148,
709,
4676,
4677,
7170,
4683,
6432,
1462,
5039,
6446,
2219,
3640,
6456,
4709,
7916,
44,
3312,
7581,
7214,
7217,
2612,
7224,
3337,
3338,
1900,
84,
6871,
456,
6879,
2281,
6521,
106,
1543,
2644,
6531,
2650,
121,
7637,
1554,
4414,
7639... | Test |
2,120 | 3 | Aliens:_The_Computer_Game_(1986_video_game):aliens computer game 1986 video game aliens computer game video game developed published activision commodore 64 apple ii zx spectrum computer systems based film title also known aliens us europe initially planned released aliens second part aliens series six minigames strung together via graphical interactive sequences akin adventure game though interaction possible advancing dialog displayed speech balloons minigames mostly action sequences involve piloting ship sulaco planet surface recognizing equipment fighting aliens time release game received mixed reviews including scores 85 commodore format 8/10 averaged computer video games 4/10 crash 5/10 sinclair user 9/10 sinclair 60 zzap 64 info gave commodore 64 version four stars five aliens appropriately creepy sequence well done plays quite differently others venturebeat stephen kleckner commented 2014 feature lot compilation-designed titles aliens falls trap collection mediocre experiences instead game singular focus … hardcore fans commodore 64 load one everyone else ’ missing much let play video wo n't provide hand chris cummins topless robot wrote 2010 now-crude graphics aside still arguably best game based films alien saga | [
1712
] | Validation |
2,121 | 5 | Ethernet_in_the_first_mile:ethernet first mile ethernet first mile efm refers using one ethernet family computer network protocols telecommunications company customer premises customer point view first mile although access network point view known last mile working group institute electrical electronics engineers ieee produced standards known ieee 802.3ah-2004 later included overall standard ieee 802.3-2008 although often used businesses also known ethernet home etth one family standards known ethernet passive optical network epon uses passive optical network wide metro local area networks using various forms ethernet goal eliminate non-native transport ethernet asynchronous transfer mode atm access networks one early effort etherloop technology invented nortel networks 1996 spun company elastic networks 1998 principal inventor jack terry hope combine packet-based nature ethernet ability digital subscriber line dsl technology work existing telephone access wires name comes local loop traditionally describes wires telephone company office subscriber protocol half-duplex control provider side loop adapted line conditions peak 10 mbit/s advertised 4-6 mbit/s typical distance symbol rates 1 megabaud 1.67 megabaud 2 4 6 bits per symbol etherloop product name registered trademark us canada etherloop technology eventually purchased paradyne networks 2002 turn purchased zhone technologies 2005 another effort concept promoted michael silverton using ethernet variants used fiber optic communication residential well business customers example become known fiber home ftth fiberhood networks company provided service 1999 2001 early products around year 2000 marketed 10bases infineon technologies although technically use baseband signalling rather passband very-high-bit-rate digital subscriber line vdsl technology patent filed 1997 peleg shimon porat boaz noam alroy rubinstain avinoam sfadya yackow long reach ethernet product name used cisco systems starting 2001 supported modes 5 mbit/s 10 mbit/s 15 mbit/s depending distance october 2000 howard frazier issued call interest ethernet last mile november 2000 meeting ieee 802.3 created ethernet first mile study group july 16 2001 802.3ah working group parallel participating vendors formed ethernet first mile alliance efma december 2001 promote ethernet subscriber access technology support ieee standard efforts early meeting etherloop technology called 100base-cu another technology called eovdsl ethernet vdsl working group efm standard approved june 24 2004 published september 7 2004 ieee 802.3ah-2004 2005 included base ieee 802.3 standard 2005 efma absorbed metro ethernet forum early 2006 work began even higher-speed 10 gigabit/second ethernet passive optical network 10g-epon standard ratified 2009 ieee 802.3av work epon continued ieee p802.3bk extended epon task force formed march 2012 major goals task force included adding support px30 px40 prx40 pr40 power budget classes 1g-epon 10g-epon 802.3bk amendment approved ieee-sa sb august 2013 published soon thereafter standard ieee std 802.3bk-2013 november 2011 ieee 802.3 began work epon protocol coax epoc efm defines ethernet transmitted new media types using new ethernet physical layer phy interfaces efm also addresses issues required mass deployment ethernet services operations administration management oa compatibility existing technologies plain old telephone service spectral compatibility copper twisted pair fiber home use passive optical network additionally clause 57 defines link-level oa including discovery link monitoring remote fault indication loopbacks variable access 2base-tl ieee 802.3-2008 physical layer phy specification full-duplex long-reach point-to-point ethernet link voice-grade copper wiring unlike 10base-t 100base-t 1000base-t phys providing single rate 10 100 1000 mbit/s respectively 2base-tl link rate vary depending copper media characteristics length wire diameter gauge number pairs link aggregated amount crosstalk pairs etc desired link parameters desired snr margin power back-off etc regional spectral limitations 2base-tl phys deliver minimum 2 mbit/s distances using itu-t g.991.2 g.shdsl.bis technology single copper pair phys may also support optional aggregation bonding multiple copper pairs called pme aggregation function paf single pair minimum possible link bitrate 192 kbit/s 3 x 64 kbit/s maximum bitrate 5.7 mbit/s 89 x 64 kbit/s 0.5 mm wire 3 db noise margin spectral limitations max bitrate achieved distances max achievable bitrate 850 kbit/s throughput 2base-tl link lower link bitrate average 5 due 64/65-octet encoding paf overhead factors depend packet size 10pass-ts ieee 802.3-2008 physical layer phy specification full-duplex short reach point-to-point ethernet link voice-grade copper wiring 10pass-ts phys deliver minimum 10 mbit/s distances using itu-t g.993.1 vdsl technology single copper pair phys may also support optional aggregation bonding multiple copper pairs called pme aggregation function paf unlike ethernet physical layers provide single rate 10 100 1000 mbit/s 10pass-ts link rate vary similar 2base-tl depending copper channel characteristics length wire diameter gauge wiring quality number pairs link aggregated factors vdsl short range technology designed provide broadband distances less 1 km voice-grade copper twisted pair line connection data rates deteriorate quickly line distance increases led vdsl referred fiber curb technology requires fiber backhaul connect carrier network greater distances vdsl ethernet first mile services using may useful way standardise functionality metro ethernet networks potentially distribute internet access services voice-grade wiring multi-dwelling unit buildings however vdsl2 already proven versatile faster standard greater reach vdsl | [
2149,
1974,
2967,
4667,
4783
] | Test |
2,122 | 8 | WSMO:wsmo wsmo web service modeling ontology conceptual model relevant aspects related semantic web services provides ontology based framework supports deployment interoperability semantic web services wsmo four main components wsmo working group part essi cluster aligns research development efforts areas semantic web services several european fp6 research projects wsmo working group includes wsml working group aims developing language called web services modeling language wsml formalizes web services modeling ontology wsmo | [
1024,
5179
] | Test |
2,123 | 9 | Acornsoft_LISP:acornsoft lisp acornsoft lisp marketed simply lisp dialect commercial implementation lisp programming language released early 1980s 8-bit acorn atom bbc micro acorn electron computers acornsoft lisp released cassette disk rom cartridge rom cartridge version instantaneous loading well greater amount available free ram user definitions contrast large-scale lisp implementations acornsoft variant modest number built-in definitions fit limited memory space 8-bit acorn computers interpreter implemented 6502 machine-code 5.5k size based owl lisp written mike gardner owl computers published apple ii 1979 acornsoft licensed owl computers 1981 developed acorn atom bbc microcomputer supplied lisp workspace image containing commonly used built-in functions constants 3k size although could deleted needed user free memory supported datatypes included nested lists 16-bit signed integers strings 127 characters length loop keywords available program control acornsoft also commissioned book lisp bbc microcomputer arthur norman gillian cattell published 1983 arthur norman lecturer computer science cambridge university gillian cattell research lisp cambridge book sold separately software contained examples illustrating use acornsoft specific features vdu function allowing machine-specific graphics capabilities book also contained working examples including tree-sorting program arbitrary arithmetic package animal guessing game route finding program graphics package simple compiler adventure game route-finding demo program supplied standard interpreter program loaded command codice_1 tested typing codice_2 example display output codice_3 thus showing total mileage shortest possible route listing intermediate towns visited | [
6159,
4543
] | Test |
2,124 | 1 | Database_normalization:database normalization database normalization process structuring relational database accordance series so-called normal forms order reduce data redundancy improve data integrity first proposed edgar f. codd part relational model normalization entails organizing columns attributes tables relations database ensure dependencies properly enforced database integrity constraints accomplished applying formal rules either process synthesis creating new database design decomposition improving existing database design basic objective first normal form defined codd 1970 permit data queried manipulated using universal data sub-language grounded first-order logic sql example data sub-language albeit one codd regarded seriously flawed objectives normalization beyond 1nf first normal form stated follows codd attempt made modify update insert delete relation following undesirable side-effects may arise relations sufficiently normalized fully normalized database allows structure extended accommodate new types data without changing existing structure much result applications interacting database minimally affected normalized relations relationship one normalized relation another mirror real-world concepts interrelationships querying manipulating data within data structure normalized following non-1nf representation customers credit card transactions involves complexity really necessary br customer corresponds 'repeating group transactions automated evaluation query relating customers transactions therefore would broadly involve two stages example order find monetary sum transactions occurred october 2003 customers system would know must first unpack transactions group customer sum amounts transactions thus obtained date transaction falls october 2003 one codd important insights structural complexity reduced reduced structural complexity gives users application dbms power flexibility formulate evaluate queries normalized equivalent structure might look like modified structure key cust id first relation cust id tr id second relation row represents individual credit card transaction dbms obtain answer interest simply finding rows date falling october summing amounts data structure places values equal footing exposing dbms directly potentially participate directly queries whereas previous situation values embedded lower-level structures handled specially accordingly normalized design lends general-purpose query processing whereas unnormalized design normalized version also allows user change customer name one place guards errors arise customer name misspelled records codd introduced concept normalization known first normal form 1nf 1970 codd went define second normal form 2nf third normal form 3nf 1971 codd raymond f. boyce defined boyce-codd normal form bcnf 1974 informally relational database relation often described normalized meets third normal form 3nf relations free insertion update deletion anomalies normal forms least normalized normalized normalization database design technique used design relational database table higher normal form process progressive higher level database normalization achieved unless previous levels satisfied means data unnormalized form least normalized aiming achieve highest level normalization first step would ensure compliance first normal form second step would ensure second normal form satisfied forth order mentioned data conform sixth normal form however worth noting normal forms beyond 4nf mainly academic interest problems exist solve rarely appear practice please note data following example intentionally designed contradict normal forms real life quite possible able skip normalization steps table n't contain anything contradicting given normal form also commonly occurs fixing violation one normal form also fixes violation higher normal form process also one table chosen normalization step meaning end example process might still tables satisfying highest normal form let database table following structure assume example book one author satisfy 1nf need ensure values column table atomic initial table subject contains set values meaning comply one way achieve first normal form would separate duplicities multiple columns although table formally complies 1nf atomic problem solution obvious book three subjects added database without altering structure solve problem elegant way necessary identify entities represented table separate respective tables case would result book subject publisher tables simply separating initial data multiple tables would break connection data means also need determine relationships newly introduced tables might noticed publisher id column book table foreign key realizing many-to-one relation book publisher book fit many subjects well subject may correspond many books means also need define many-to-many relationship achieve creating link table instead one table unnormalized form 4 tables conforming 1nf book table one candidate key compound key title format consider following table fragment attributes part key depend title price also depends format conform 2nf remove duplicities every non-key attribute must depend whole key part normalize table make title simple key every non-key attribute depends upon whole key remove price separate table dependency format preserved book table conforms 2nf table third normal form 3nf table 2nf transitive dependencies note book table rows previously omitted brevity genre id genre name depend upon primary key title independent one another dependency say genre name primary key deduced dependency genre name genre id genre id primary key since titles genres dependency introduces redundant data book table eliminated abstracting dependency genre name genre id table book table third normal form although tables 1nf definition normalized normalized commonly used mean 3nf eknf falls strictly 3nf bcnf n't much discussed literature intended “ capture salient qualities 3nf bcnf ” avoiding problems namely 3nf “ forgiving ” bcnf “ prone computational complexity ” since rarely mentioned literature included example information eknf see wikipedia page relational schema r considered boyce–codd normal form bcnf every one dependencies x → one following conditions hold true consider table 3nf previous step non-trivial dependency violating bcnf author → author nationality therefore table decomposed attribute represents fact key whole key nothing key therefore bcnf achieved assume database owned book retailer franchise several franchisees shops different locations therefore retailer decided add table contains data availability books different locations table structure consists compound primary key n't contain non-key attributes already bcnf therefore also satisfies previous normal forms however assume available books offered area might notice title unambiguously bound certain location therefore table n't satisfy 4nf means satisfy fourth normal form table needs decomposed well every record unambiguously identified superkey therefore 4nf satisfied suppose franchisees also order books different suppliers let relation also subject following constraint table 4nf supplier id equal join projections supplier id book book franchisee id franchisee id supplier id component join dependency superkey sole superkey entire heading table satisfy etnf decomposed decomposition compliance etnf ensured spot table satisfying 5nf usually necessary examine data thoroughly suppose table 4nf example little modification data let examine satisfies 5nf decompose table lower redundancies get following two tables happens try join tables query would return following data apparently join returns three rows let try add another table clarify relation end three separate tables join return actually possible join three tables means n't possible decompose franchisee book location without data loss therefore table already satisfies 5nf c.j date argued database 5nf truly normalized let look book table previous examples see satisfies domain key normal form logically thickness determined number pages means depends pages key let set example convention saying book 350 pages considered slim book 350 pages considered thick convention technically constraint neither domain constraint key constraint therefore rely domain constraints key constraints keep data integrity words nothing prevents us putting example thick book 50 pages makes table violate dknf solve create table holding enumeration defines thickness remove column original table way domain integrity violation eliminated table dknf simple intuitive definition sixth normal form table 6nf row contains primary key one attribute means example publishers table designed creating 1nf needs decomposed two tables normalization 6nf mostly used data warehouses benefits outweigh drawbacks | [
1449,
3951,
3621,
6430,
6098,
7915,
6462,
1861,
6128,
7205,
2956,
5419,
7937,
7213,
6144,
1891,
1902,
784,
2265,
1905,
7248,
3005,
4046,
4048,
3011,
4054,
6543,
2663,
7999,
4798,
6932,
517,
7303,
4457,
6594,
6604,
7330,
5209,
7341,
7715,
... | Test |
2,125 | 5 | TCP_delayed_acknowledgment:tcp delayed acknowledgment tcp delayed acknowledgment technique used implementations transmission control protocol effort improve network performance essence several ack responses may combined together single response reducing protocol overhead however circumstances technique reduce application performance described rfc 1122 host may delay sending ack response 500 ms. additionally stream full-sized incoming segments ack responses must sent every second segment delayed acks give application opportunity update tcp receive window also possibly send immediate response along ack certain protocols telnet delayed acks reduce number responses sent server factor 3 combining ack window update response data one segment additional wait time introduced delayed ack cause delays interacting certain applications configurations nagle algorithm used sending party data queued sender ack received sender send enough data fill maximum segment size example performs two small writes followed blocking read transfer pause ack delay timeout linux 2.4.4+ supports codice_1 socket option disables delayed ack example consider situation bob sending data carol bob socket layer less complete packet worth data remaining send per nagle algorithm sent receives ack data already sent time carol application layer send response gets data carol using delayed acks socket layer send ack timeout reached application transmitting data smaller chunks expecting periodic acknowledgment replies negative interaction occur prevent delay application layer needs continuously send data without waiting acknowledgment replies alternatively nagle algorithm may disabled application sending side | [
7765,
4125,
7637
] | Train |
2,126 | 9 | Bean_Validation:bean validation bean validation defines metadata model api javabean validation metadata source annotations ability override extend meta-data use xml validation descriptors originally defined part java ee version 2 aims work java se apps well java bean validation jsr 303 originated framework approved jcp 16 november 2009 accepted part java ee 6 specification hibernate team provides hibernate validator reference implementation bean validation also created bean validation tck implementation jsr 303 needs pass bean validation 2.0 defined jsr 380 approved 2017-07-31 major release leverages language features java 8 useful purposes bean validation java 8 required minimum java version changes include bean validation 1.1 jsr 349 improves upon initial version 1.0 jsr 303 significant changes include final release 1.1 specification occurred 2013-05-24 | [
2371,
7347,
6986,
1479,
2322,
3488,
2517,
773,
2519,
2799
] | Test |
2,127 | 4 | Agbogbloshie:agbogbloshie agbogbloshie nickname commercial district korle lagoon odaw river near center accra ghana capital city near slum called old fadama agbogbloshie site became known destination locally generated automobile electronic scrap collected across city accra alleged center legal illegal exportation network environmental dumping electronic waste e-waste industrialized nations basel action network small ngo based seattle referred agbogbloshie digital dumping ground allege millions tons e-waste processed year however repeated international studies failed confirm allegations labelled e-waste hoax international reuse advocate wr3a exhaustive study trade used electronics nigeria funded unep basel convention revealed 540 000 tonnes informally processed waste electronics 52 material recovered according statistics world bank large cities like accra lagos majority households owned televisions computers decades un report weee africa 2012 disclosed majority used electronics found african dumps fact recently imported scrap originated african cities agbogbloshie situated banks korle lagoon northwest accra central business district roughly 40,000 ghanaians inhabit area migrants rural areas due harsh living conditions rampant crime area nicknamed sodom gomorrah basel convention prevents transfrontier shipment hazardous waste developed less developed countries however convention specifically allows export reuse repair annex ix b1110 numerous international press reports made reference allegations majority exports ghana dumped research us international trade commission found little evidence unprocessed e-waste shipped africa united states finding corroborated united nations environment programme mit memorial university arizona state university research 2013 original source allegation blaming foreign dumping material found agbogbloshie recanted rather stated never made claim 80 us e-waste exported whether domestically generated residents ghana imported concern remains methods waste processing especially burning emit toxic chemicals air land water exposure especially hazardous children toxins known inhibit development reproductive system nervous system especially brain concerns human health environment agbogbloshie continue raised area remains heavily polluted 2000s ghanaian government new funding loans implemented korle lagoon ecological restoration project klerp environmental remediation restoration project address pollution problem dredging lagoon odaw canal improve drainage flooding ocean 1960s slum area agbogbloshie wetland city accra urbanized ghetto grew referred old fadama ayaalolo 1980s ghetto place shelter refugees konkomba-nanumba war late 1990s newly available electricity akosombo dam led increased local demand electric electronic appliance consumption critics claim caused imbalanced shift electricity akosombo dam increased demand functional second-hand televisions computers imported west africa tech sector help ‘ bridge digital divide ’ ghanaians welcomed donations computers cost one-tenth price new one basel action network circulated claim 2008 much 75 percent second-hand electronics sent africa could reused ended landfills ban allegation slightly different 2002 claim 80 waste exporting harm 2002 became one cited references academic journals though documentation peer reviewed source documentation made available mapping e-waste controversy statements debates ii 2013 ban denied ever making claim ever stating statistic african imports local economy agbogbloshie based onion market serving immigrants accra greater tamale region dagbani north unemployed immigrants turned scrap metal collection including auto scrap supplement incomes electronic scrap processing fairly small activity market claim hundreds millions tons electronic waste imported area year reported several news sources considered experts utterly ridiculous preposterous united states definitely leading exporter e-waste ghana although imports arrive countries france germany korea switzerland netherlands multinational brands philips canon dell microsoft nokia siemens sony commonly found throughout waste according e-waste assessment studies refurbishing eee sales used eee important economic sector e.g alaba market lagos well-organized dynamic sector holds potential industrial development indirectly sector another important economic role supplies low middle income households affordable ict equipment eee view sector ’ positive socio-economic performance policy measures aiming improve e-waste management nigeria refrain undifferentiated banning second-hand imports refurbishing activities strive co-operative approach including market sector associations followers ban.org alleged non-governmental organizations ngos adding waste excess electronics donated intention helping scholarly institutions claim based 75 -80 orphaned waste statistic exporters must found numerous loopholes avoid legislation forbidding e-waste shipping labeling broken electronics ‘ end-of-life ’ ‘ second-hand-goods ’ falsely identifying working order true 50 75 electronics imported unable salvaged remain land import would illegal however un studies failed find evidence allegation source dumping statistic denied young men burning wires auto harnesses electronics subject several photojournal essays workers mostly young men disassemble cars appliances scrap electronics gathered wheeled push carts accra neighborhoods revenue recovery metals copper aluminum iron produce low wages several british news outlets made recycling workers cause celebre photographs workers burning old wire top tires plastic order melt plastic dismantling waste bare hands stones popularized press magnets electronics shown used gather smallest ferrous metal scraps remaining materials burned dumped nearby workers children adults alike sell metal scraps earn living half sack copper aluminium sell 700 ghana cedis amounting eight ten ghana cedis per day 4 6 usd population agbogbloshie consists economic migrants northern rural parts ghana living standards growing worse causing people move urban settings agbogbloshie conditions may significantly better making living easier inhabitants agbogbloshie live eat work relieve land amongst waste children able attend school often spend every evening weekend processing waste searching metals dwellings wooden shacks lack water sanitation area also home armed robbers prostitutes drug dealers others involved underground markets crime disease run rampant throughout agbogbloshie creating almost uninhabitable environment humans outsiders nicknamed area “ sodom gomorrah ” two condemned biblical cities due harsh living conditions agbogbloshie processing dumping electronic waste agbogbloshie polluting area creating serious environmental concern photographs agbogbloshie e-waste landfill show scrap workers burning wires auto harnesses plastic-encased electronics recover copper e-waste contains toxic chemicals emitted ground water atmosphere electronics broken burned processed poisons lead mercury arsenic dioxins furans brominated flame retardants seep surrounding soil water thereby seriously polluting landscape greenpeace lab tests shown water soil areas agbogbloshie revealed area contained concentrations chemicals levels hundred times allowable amount.several studies confirmed high levels lead soil particular risks workers children environmental lead contamination predominantly due burning plastic covering copper wires pvc insulation contains approximately 3000 mg/kg lead stiffener lead released burning guardian april 2019 reported study ipen basel action network found dangerous levels dioxins polychlorinated biphenyls pcbs chicken eggs agbogbloshie lead containing glass used computer monitors crt tubes also contributes elevated soil lead levels korle lagoon agbogbloshie situated extremely low levels dissolved oxygen result large uncontrolled quantities domestic industrial waste emitted water studies indicate entrance lagoon severely polluted suitable primary secondary contact due large amounts bacteria present processing electronic waste presents serious health threat workers agbogbloshie fumes released burning plastics metals used electronics composed highly toxic chemicals carcinogens workers often inhale lead cadmium dioxins furans phthalates brominated flame retardants.exposure fumes especially hazardous children toxins known inhibit development reproductive system nervous system brain particular similar e-waste processing areas conditions demographics like agbogbloshie 80 children dangerous levels lead blood inhabitants often suffer chronic nausea headaches chest respiratory problems high levels toxins also discovered soil food samples chemicals stay food chain e-waste presents potential security threat individuals exporting countries hard drives properly erased computer disposed reopened exposing sensitive information credit card numbers private financial data account information records online transactions accessed willing individuals organized criminals ghana commonly search drives information use local scams government contracts discovered hard drives found agbogbloshie multimillion-dollar agreements united states security institutions defense intelligence agency dia transportation security administration homeland security resurfaced agbogbloshie ghanaian government made effort restore area “ korle lagoon ecological restoration project ” klerp 2003 opec fund international development arab bank economic development africa kuwait fund arab economic development provided loan project expectation ghanaian government dredge lagoon restore surroundings goals project include reduction flooding increase marine life improvement water quality improvement general sanitary conditions due invasive nature project restoration efforts disputed inhabitants agbogbloshie klerp requires people leave area home majority squatters accra metropolitan assembly ama continually tried evict people met much resistance matter still dispute 2014 ngo pure earth formally blacksmith institute funded creation copper wire recycling center within agbogbloshie helped install several automated machines simplify removal plastic coating reduce burning efforts appear moderately successful however burning continues | [
2323,
972
] | Validation |
2,128 | 4 | ICMP_hole_punching:icmp hole punching icmp hole punching technique employed network address translator nat applications maintaining internet control message protocol icmp packet streams traverse nat nat traversal techniques typically required client-to-client networking applications internet involving hosts connected private networks especially peer-to-peer voice internet protocol voip deployments icmp hole punching establishes connectivity two hosts communicating across one network address translators either peer-to-peer client-server model typically third party hosts public transit network used establish udp tcp port states may used direct communications communicating hosts however icmp hole punching requires third party involvement pass information one nats exploiting nat loose acceptance inbound icmp time exceeded packets icmp time exceeded packet reaches destination nat arbitrary data packet expected nat allows packet reach destination server allowing destination server obtain client public ip address data stored packet client currently method icmp hole punching hole punching without third party involvement autonomous nat traversal developed samy kamkar january 22 2010 released open source software pwnat method later published ieee according paper proposed technique assumes client somehow learned current external globally routable ip address server nat key idea enabling server learn client's ip address server periodically send message fixed known ip address simplest approach uses icmp echo request messages unallocated ip address 1.2.3.4 since 1.2.3.4 allocated icmp request routed routers without default route icmp destination unreachable messages may created routers ignored server result messages sent 1.2.3.4 nat enable routing replies response request connecting client fake reply specifically client transmit icmp message indicating ttl_expired message could legitimately transmitted internet router sender address would expected match server target ip server listens fake icmp replies upon receipt initiates connection sender ip specified icmp reply | [
6025,
954,
3775,
4577,
8,
2681,
5790,
2664
] | Test |
2,129 | 2 | USENIX_Annual_Technical_Conference:usenix annual technical conference usenix annual technical conference usenix atc canonically usenix conference computing professions sponsored usenix association conference includes computing tutorials single track technical session presenting refereed research papers sig meetings bofs several notable announcements talks usenix 1995 james gosling announced oak become java programming language john ousterhout first presented tcl usenet announced considered one prestigious operating systems venues rating australian ranking ict conferences era prior 1995 two usenix technical conferences held year one held summer winter | [
1315,
2315,
280,
191,
486,
2379,
6046
] | Test |
2,130 | 3 | Clipper_architecture:clipper architecture clipper architecture 32-bit risc-like instruction set architecture designed fairchild semiconductor architecture never enjoyed much market success computer manufacturers create major product lines using clipper processors intergraph high level hardware first processors using clipper architecture designed sold fairchild division responsible subsequently sold intergraph 1987 intergraph continued work clipper processors use systems clipper architecture used simplified instruction set compared earlier cisc architectures incorporate complicated instructions present contemporary risc processors instructions implemented so-called macro instruction rom within clipper cpu scheme allowed clipper somewhat higher code density risc cpus initial clipper microprocessor produced fairchild c100 became available 1986 followed faster c300 intergraph 1988 final model clipper c400 released 1990 extensively redesigned faster added floating-point registers c400 processor combined two key architectural techniques achieve new level performance — superscalar instruction dispatch superpipelined operation many processors time used either superscalar instruction dispatch superpipelined operation clipper c400 first processor use intergraph started work subsequent clipper processor design known c5 never completed released nonetheless advanced processor design techniques devised c5 intergraph granted patents patents along original clipper patents basis patent-infringement lawsuits intergraph intel companies unlike many microprocessors clipper processors actually sets several distinct chips c100 c300 consist three chips one central processing unit containing integer unit floating point unit two cache memory management units cammus one responsible data one instructions cammus contained caches translation lookaside buffers support memory protection virtual memory c400 consists four basic units integer cpu fpu mmu cache unit initial version used one chip cpu fpu discrete elements mmu cache unit later versions mmu cache unit combined one cammu chip clipper 16 integer registers r15 used stack pointer 16 floating-point registers limited 8 early implementations plus program counter pc processor status word psw containing alu fpu status flags trap enables system status word ssw containing external interrupt enable user/supervisor mode address translation control bits user supervisor mode separate banks integer registers interrupt handling consisted saving pc psw ssw stack clearing psw loading pc ssw memory trap vector clipper load/store architecture arithmetic operations could specify register immediate operands basic instruction parcel 16 bits 8 bits opcode 4 bits source register 4 bits destination register immediate-operand forms allowed 1 2 following instruction parcels specify 16-bit sign-extended 32-bit immediate operand processor uniformly little-endian including immediate operands special quick encoding 4-bit unsigned operand provided add subtract load move quick register move complement quick register addressing modes load/store branch instructions follows displacements sign-extended addition usual logical arithmetic operations processor supported complex macro instructions allowed instructions allowed arbitrary stack pointer register specified except user register save/restore multiple-register operations could use r15 intergraph sold several generations clipper systems including servers workstations systems included interact interserve interpro product lines targeted largely cad market fairchild promoted clix operating system version unix system v use clipper intergraph adopted clix clipper-based systems continued develop operating system available systems intergraph work version microsoft windows nt clipper systems publicly demonstrated effort canceled release intergraph decided discontinue clipper line began selling x86 systems windows nt instead | [
5012,
1447,
5371,
3948,
7527,
7529,
5737,
2567,
2929,
4694,
5042,
1481,
5055,
2226,
1867,
2248,
6148,
2266,
447,
6177,
4047,
4408,
5483,
3014,
1556,
5487,
6198,
6922,
7666,
515,
8024,
5521,
3747,
1237,
6236,
534,
5893,
1252,
1254,
4847,
... | Test |
2,131 | 5 | Geary_(e-mail_client):geary e-mail client geary free open-source email client written vala based webkitgtk although since adopted gnome project originally developed yorba foundation purpose e-mail client according adam dingle yorba founder bring back users online webmails faster easier use desktop application pantheon mail fork initiated elementary os community demise yorba though point decided rewrite scratch remaining references geary pantheon code base translations implementation support gpg started still incomplete 2019 geary internally uses sqlite database store local copy emails indexing uses fully asynchronous gobject-based imap client library one feature distinguishes geary open source email clients focus conversation view geary pantheon mail using gettext translations pantheon mail migrated webkitgtk+2 yet developers decided first migrate code managing conversation view use native gtk widgets gtk.css granite gtk+ library used part elementary os offered several advantages including minimizing use webviews reducing code supporting hardware accelerated animations supporting rtl languages also removed use custom gtk bars like codice_5 making code complicated difficult read geary uses webkit2 since least version 3.32.0 historically elementary os directly supported project geary became default application gnu/linux distribution march 25 2013 jim nelson executive director yorba launched crowdfunding campaign indiegogo gather us 100,000 would used pay 3 full-time yorba engineers working time geary unfortunately april 23 2013 us 50,860 gathered 1,192 backers amount met campaign failed according rules set indiegogo yorba receive money pledged failure jim nelson declared blog post crowdfunding campaign kind experiment see route enough sustain open-source development reaffirmed geary created improve linux experience therefore chance ported os x windows platforms yorba foundation stopped activities gnome announced plans project time future geary unclear result uncertainties due previous design disagreements old geary team elementary os actually using geary default mail client though heavily patched version daniel foré leader elementary os decided fork project continue development fork project renamed pantheon mail process pantheon mail replaced geary elementary os 0.4 codenamed loki march 2016 michael gratton applied become new maintainer geary main goal try fixing pressing issues like dependency old webkit1gtk collaboration pantheon mail better support non-gmail servers mailbox management account ui extending search etc contributing geary gnome project requires maintainer become gnome member discussion adam dingle yorba founder agreed wait gratton fulfill gnome membership application requirements meantime gratton post patches gnome bugzilla instance adam commit version 0.11 released version 0.13 released february 18 2019 shortly afterwards version scheme changed match gnome release schedule current geary version 3.32 initial name geary coincides name geary street yorba products named streets san francisco however according former yorba employee application named address yorba foundation located actually coincidence first beta geary released may 2012 yorba still located capp street time | [
1152,
6965,
7959,
2453,
2091,
7159,
6883,
2728,
7975,
1267,
4685,
3863,
6721,
6011,
5571,
735,
1475,
6908,
578,
2581,
499,
4352,
5070,
3152,
6582,
6588,
2260,
5887,
4918
] | Test |
2,132 | 7 | NYC_Mesh:nyc mesh nyc mesh physical network interconnected routers group enthusiasts working support expansion project freely accessible open wireless community network nyc mesh internet service provider isp although connect internet offer internet access service members network includes 200 active member nodes throughout five boroughs concentrations users lower manhattan brooklyn goal nyc mesh build large scale decentralized digital network owned run eventually cover new york city neighboring urban areas participation project governed network commons license agreement partially modeled similar license use guifi.net lists four key tenets similar projects include freifunk germany ninux italy sarantaporo.gr greece people open network oakland ca red hook wi-fi brooklyn ny like many free community-driven networks nyc mesh uses mesh technology facilitate robustness resiliency additionally larger nodes project uses border gateway protocol bgp nodes connected via wifi links similar used wireless routers homes powerful routers able function backbone making connections distances mile nyc mesh founded 2012 originally based cjdns protocol 2015 project received grant isoc-ny new york chapter internet society nyc mesh connects internet via de-cix internet exchange point ixp first super node sabey data center 375 pearl street project received membership boost due u.s. federal communications commission vote december 2017 repeal 2015 net neutrality rules coinciding decision average number member sign-ups requests per month jumped 20 400 | [
5053,
6987,
1205,
6335
] | Train |
2,133 | 3 | Freescale_DragonBall:freescale dragonball motorola/freescale semiconductor dragonball mc68328 microcontroller design based famous 68000 core implemented all-in-one low-power system handheld computer use supported μclinux designed motorola hong kong released 1995 dragonball major design win earlier versions palm computing platform however palm os 5 onwards superseded arm-based processors texas instruments intel processor also used alphasmart line portable word processors examples include dana dana wireless processor capable speeds 16.58 mhz run 2.7 mips million instructions per second base 68328 dragonball ez mc68ez328 model extended 33 mhz 5.4 mips dragonball vz mc68vz328 model 66 mhz 10.8 mips dragonball super vz mc68sz328 32-bit processor 32-bit internal external address bus 24-bit external address bus ez vz variants 32-bit data bus many built-in functions like color grayscale display controller pc speaker sound serial port uart irda support uart bootstrap real time clock able directly access dram flash rom mask rom built-in support touch screens all-in-one computer chip dragonball ez palm handhelds twice many ics recent dragonball mx series microcontrollers later renamed freescale i.mx mc9328mx/mcimx series intended similar application earlier dragonball devices based arm processor core instead 68000 core | [
5097,
4754,
5100,
7326,
1075,
7327,
4479,
2551,
1454,
5652,
3708,
7905,
7990,
6111,
4702,
1386,
7654,
5762,
234,
2501,
2781,
2785,
5079,
5614,
2257,
7133,
3674,
2353,
5622
] | Test |
2,134 | 5 | List_of_DNS_record_types:list dns record types list dns record types overview resource records rrs permissible zone files domain name system dns also contains pseudo-rrs types records simply provide types information example hinfo record gives description type computer/os host uses others return data used experimental features type field also used protocol various operations progress rendered originally defined record-types obsolete records listed iana limited use various reasons marked obsolete list obscure services older versions services special notes saying right | [
5733,
5673,
5519,
7214,
2043,
3629,
2704,
6908,
2755,
5773,
3819,
2644
] | Test |
2,135 | 5 | Real_Data_Transport:real data transport real data transport rdt proprietary transport protocol actual audio-video data developed realnetworks 1990s commonly used companion control protocol streaming media like ietf real time streaming protocol rtsp non-proprietary alternative rdt ietf real-time transport protocol rtp also implemented realnetworks players reported 2002 book firewalls rdt used two unidirectional udp connections one data sent server client another opposite direction retransmission requests book reported realnetworks g2 server used rdt configuration default another 2003 book reported rdt also seen carried transmission control protocol tcp fall-back mechanism rdt included part helix community project | [
6531,
7637,
7169
] | Test |
2,136 | 3 | Dizzy_Down_the_Rapids:dizzy rapids dizzy rapids arcade style action video game published 1991 codemasters amstrad cpc spectrum dos atari st commodore 64 amiga developed harmony gold tatsunoko production published 1993 toshiba miramax communications msx2 game involves dizzy riding barrels river avoiding obstacles enemies another game derived minigame game found fantastic adventures dizzy like bubble dizzy game based game play arcade game titled toobin c64 version developed first paul black c64 version originally clone toobin called 'toobin turles game taken codemasters consideration rebranded take advantage dizzy character | [
1929
] | Test |
2,137 | 4 | CERT_C_Coding_Standard:cert c coding standard sei cert c coding standard software coding standard c programming language developed cert coordination center improve safety reliability security software systems guidelines cert c secure coding standard cross-referenced several standards including common weakness enumeration cwe entries misra | [
5125,
4486,
404
] | Test |
2,138 | 2 | Netgear_WNR3500L:netgear wnr3500l wnr3500l also known wnr3500u 802.11b/g/n wi-fi router created netgear officially launched autumn 2009 wnr3500l runs open-source linux firmware supports installation third party packages dd-wrt tomato version 1 version 2 several ways identify version including v2 label version 2 version 1 version 2 according one analysis installing dd-wrt reduced performance | [
2086,
578
] | Validation |
2,139 | 3 | Apulet:apulet apulet plural apulettes component cell computer architecture consisting bundle comprising data object code necessary perform action upon cell architecture calls several apus attached processing units primary processing system control single processing element pe apu loaded apulet pe pass results next apu | [
6597,
450,
4408,
5042,
4242,
5665,
1388,
6922,
4718,
239,
763,
602,
2873,
2601,
3234,
4200,
1606,
1244,
4839
] | Test |
2,140 | 4 | National_Strategy_for_Trusted_Identities_in_Cyberspace:national strategy trusted identities cyberspace national strategy trusted identities cyberspace nstic us government initiative announced april 2011 improve privacy security convenience sensitive online transactions collaborative efforts private sector advocacy groups government agencies organizations strategy imagined online environment individuals organizations trust identify authenticate digital identities digital identities organizations devices promoted offer mandate stronger identification authentication protecting privacy limiting amount information individuals must disclose strategy developed input private sector lobbyists including organizations representing 18 business groups 70 nonprofit federal advisory groups comments dialogue public strategy four guiding principles nstic described vision compared ecosystem individuals businesses organizations enjoy greater trust security conduct sensitive transactions online technologies policies agreed upon standards would securely support transactions ranging anonymous fully authenticated low high value imagined world implementation included three initiatives nstic announced presidency barack obama near end first term april 15 2011 magazine article said individuals might validate identities securely sensitive transactions banking viewing health records let stay anonymous blogging surfing web january 2011 u.s. department commerce established national program office npo led national institute standards technology help implement nstic coordinate implementation activities federal agencies npo works white house cybersecurity coordinator originally howard schmidt 2012 michael daniel nstic called steering group led private sector administer development adoption framework identity ecosystem steering group idesg held meeting chicago august 15–16 2012 meeting brought together 195 members person 315 members remotely additional plenary meetings phoenix arizona santa clara california boston massachusetts grant 2012 2014 trusted federal systems inc. group administrative body federal government initiated supported pilot programs 2012 nstic awarded 9 million pilot projects first year example american association motor vehicle administrators developing demonstration commercial identity provider credentials virginia state government including securely verifying identities online virginia department motor vehicles internet2 received 1.8 million research id.me given two-year grant 2013 work funded nist trusted identities group web page nstic called u.s. federal government agencies early adopters identity ecosystem envisioned nstic agencies struggled implement services provide internally externally technical policy cost barriers made challenging accept third-party credential providers accredited federal identity credential access management ficam initiative response white house created federal cloud credential exchange fccx team co-chaired nstic general services administration team consisted representatives agencies whose applications accessed large population external customers november 2012 united states postal service chosen manage pilot version fccx awarded contract build securekey technologies member fido alliance contract renewed may 2015 connect.gov launched december 2014 manifestation pilot first two companies provide individual us citizens identity management services compatible connect.gov id.me verizon ping identity forgerock first software platforms provide ficam-compliant credentials enable private sector organizations connect securely government agencies primary objective project may 10 2016 18f announced blog entry connect.gov would replaced replacement system would called login.gov launched april 2017 identity ecosystem steering group idesg received start funding nist 2010 since created series documents available web site 2016 introduced identity ecosystem framework idef registry self-assessment proposal generated criticism since released draft form june 2010 much centered around privacy implications proposal shortly draft release electronic privacy information center epic consumer-rights civil liberties organizations sent committee statement response draft nstic policy requesting clearer complete plan create safeguard internet users rights privacy epic head marc rotenberg called nstic historic also cautioned ... online identity complex problem risk 'cyber-identity theft consolidated identity systems real us need protect online privacy nstic addressed early privacy concerns 2013 fair information practice principles document subsequent initiatives sought advance privacy example american civil liberties union electronic frontier foundation involved privacy committee idesg | [
904,
6143,
4133,
7144
] | Test |
2,141 | 3 | Timer_coalescing:timer coalescing timer coalescing computer system energy-saving technique reduces central processing unit cpu power consumption reducing precision software timers allow synchronization process wake-ups minimizing number times cpu forced perform relatively power-costly operation entering exiting idle states | [
4137,
3741,
364,
458,
2276,
4759,
1237,
2332
] | Test |
2,142 | 5 | Eggdrop:eggdrop eggdrop popular irc bot oldest still maintained originally written robey pointer december 1993 help manage protect efnet channel gayteen one eggdrop bot version named valis eggdrop originally intended help manage protect channels takeover attempts forms irc war bot written c programming language features interfaces c modules tcl scripts allow users enhance functionality bot large number tcl scripts available expand bot functionality written eggdrop users scripts available add extend support online games stats user channel management information storage lookup greeting channel members tracking last seen times botnet management anti-spam file serving distribution usually via dcc protocol irc services similar chanserv nickserv much eggdrop includes built-in support sharing user information channel bans however script required simultaneously control multiple bots bots coordinate channel management modes bot also features botnet allows multiple bots linked together share data act coordinated fashion botnet supports party line accessible via dcc chat telnet people communicate within botnet various channels equivalent miniature irc channel 0 default referred party line years eggdrop become one popular bots run irc users | [
4021,
2810,
4759,
6715,
2386,
5571,
2026,
486,
3722,
753,
6211,
1674,
5162,
7669,
7581,
6489,
1691,
7765,
3915,
1989,
1435
] | Test |
2,143 | 2 | Plymouth_(software):plymouth software plymouth bootsplash linux supporting animations using direct rendering manager drm kms driver gets packed initrd besides eye-candy plymouth also handles user interaction boot plymouth first included fedora 10 cambridge shipped november 25 2008 replaced red hat graphical boot rhgb ubuntu includes ubuntu 10.04 lts lucid lynx release shipped april 29 2010 mandriva switched splashy plymouth version adélie 2010.0 | [
6051,
4685,
2091,
5103,
6011,
5156,
5571,
5658,
6058,
1989,
578,
7912,
1435,
2511,
7787
] | Test |
2,144 | 9 | Gambit_(scheme_implementation):gambit scheme implementation gambit also called gambit-c programming language variant language family lisp variants named scheme gambit implementation consists scheme interpreter compiler compiles scheme language c makes cross-platform software conforms standards rrs rrs institute electrical electronics engineers ieee several scheme requests implementations srfis gambit released first 1988 gambit-c gambit c backend released first 1994 free open-source software released gnu lesser general public license lgpl 2.1 apache license 2.0 compiling intermediate representation case portable c chicken bigloo programs written gambit compiled common popular operating systems linux macos unix-like systems windows gerbil scheme variant scheme implemented gambit-c supports current r*rs standards common srfis state art macro module system inspired racket language termite scheme variant scheme implemented gambit-c. termite intended distributed computing offers simple powerful message passing model concurrency inspired erlang gambit compiler produces c code full integration support c++ objective-c compilers gnu compiler collection gcc thus software written gambit-c contain c++ objective-c code fully integrate corresponding libraries | [
7878,
1445,
5019,
1820,
6796,
6087,
2915,
5734,
1478,
2218,
4704,
5757,
6116,
1116,
6471,
7573,
2600,
5077,
1885,
1889,
6507,
795,
6876,
4759,
6888,
1557,
5494,
5501,
6210,
144,
4074,
4085,
7298,
5515,
8025,
3749,
6949,
5883,
6955,
4837,
... | Test |
2,145 | 2 | I/O_Kit:i/o kit i/o kit written iokit source code sometimes elsewhere open-source framework xnu kernel helps developers code device drivers apple macos ios operating systems i/o kit framework evolved nextstep driverkit shared similarities either mac os 9 device driver framework bsd i/o kit framework implemented subset c++ omits features apple feels unsafe use multithreaded kernel exceptions multiple inheritance templates run-time type information embedded c++ chosen partly apple believed developers would comfortable writing drivers commonly used language objective-c still providing object-oriented framework allowing device driver developers focus coding features specific hardware instead reimplementing features common given device addition providing common code device drivers framework also provides power management driver stacking automatic configuration dynamic loading drivers | [
3940,
713,
4690,
734,
6832,
3989,
2597,
3322,
7581,
1502,
5786,
4740,
1897,
6505,
2627,
7609,
1171,
5109,
2284,
1178,
6188,
1187,
1562,
6909,
6548,
502,
6557,
2679,
6565,
2329,
3050,
163,
6582,
5535,
5191,
8051,
7335,
3445,
569,
5571,
7... | Test |
2,146 | 5 | Constrained_Shortest_Path_First:constrained shortest path first constrained shortest path first cspf extension shortest path algorithms path computed using cspf shortest path fulfilling set constraints simply means runs shortest path algorithm pruning links violate given set constraints constraint could minimum bandwidth required per link also known bandwidth guaranteed constraint end-to-end delay maximum number links traversed include/exclude nodes cspf widely used mpls traffic engineering routing using cspf known constraint based routing cbr path computed using cspf could exactly computed ospf is-is could completely different depending set constraints met consider network right route computed router-a router-c satisfying bandwidth constrained x- units link cost link based hop-count i.e. 1 x 50 units cspf give path → b → c. x 55 units cspf give path → → e → c. x 90 units cspf give path → → e → f → c. cases ospf is-is result path → b → c. however link costs topology different cspf may accordingly determine different path example suppose hop count used link cost links → b b → c cost 4 case x 50 units cspf give path → → e → c. x 55 units cspf give path → → e → c. x 90 units cspf give path → → e → f → c | [
106,
4177,
1543
] | Train |
2,147 | 3 | WTX_(form_factor):wtx form factor wtx workstation technology extended motherboard form factor specification introduced intel idf september 1998 use high-end multiprocessor multiple-hard-disk servers workstations specification support major oems compaq dell fujitsu gateway hewlett-packard ibm intergraph nec siemens nixdorf umax motherboard manufacturers acer asus supermicro tyan updated 1.1 february 1999. specification discontinued url www.wtx.org longer hosts website owned intel since least 2004 form factor geared specifically towards needs high-end systems included specifications wtx power supply unit psu using two wtx-specific 24-pin 22-pin molex connectors wtx specification created standardize new motherboard chassis form factor fix relative processor location allow high volume airflow portion chassis processors positioned allowed standard form factor motherboards chassis used integrate processors demanding thermal management requirements bigger atx maximum wtx motherboard size intended provide room order accommodate higher numbers integrated components wtx computer cases backwards compatible atx motherboards vice versa sometimes came equipped atx power supplies | [
7212,
1759,
4974,
1237,
7041,
7484,
6089,
6478
] | Test |
2,148 | 3 | Pac-Man:pac-man development game began april 1979 directed toru iwatani nine-man team iwatani wanted create game could appeal women well men video games time war- sports-themed although inspiration pac-man character reportedly image pizza slice removed iwatani said also rounded japanese symbol kuchi meaning mouth in-game characters made cute colorful appeal younger players original japanese title puckman derived titular character hockey-puck shape pac-man widespread critical commercial success game important influential commonly listed one greatest video games time success game led several sequels merchandise two television series well hit single buckner garcia pac-man video game franchise remains one highest-grossing best-selling game series time generating 14 billion revenue 43 million sales combined character pac-man mascot flagship icon bandai namco entertainment highest brand awareness video game character north america player navigates pac-man maze dead ends maze filled pac-dots includes four roving multi-colored ghosts blinky pinky inky clyde passageway left side screen right side one energizer four quadrants bonus fruits appear level objective game accumulate many points possible eating dots fruits blue ghosts dots stage eaten stage completed player advance next stages one three intermission animations plays four ghosts roam maze chase pac-man ghosts touches pac-man life lost lives lost game player begins three lives dip switches machine change number starting lives one two five player receive one extra life bonus obtaining 10,000 points number points needed bonus life changed 15,000 20,000 disabled altogether near corners maze four flashing energizers allow pac-man eat ghosts earn bonus points enemies turn deep blue reverse direction move away pac-man usually move slowly enemy eaten eyes return center ghost box ghost regenerated normal color bonus score earned eating blue ghost increases exponentially consecutive ghost eaten single energizer active score 200 points scored eating one ghost 400 eating second ghost 800 third 1600 fourth cycle restarts 200 points pac-man eats next energizer blue enemies flash white signal return normal color become dangerous length time enemies remain vulnerable varies one stage next generally becoming shorter game progresses later stages enemies begin flashing immediately energizer consumed without solid-blue phase starting stage nineteen ghosts become edible still reverse direction fruits appear twice per level directly center ghost box eating one gives 100 5,000 points table lists stage type value fruit appears long ghosts blue energizer eaten many times ghosts flash returning normal enemies pac-man known alternately monsters ghosts creator toru iwatani designed enemy distinct personality keep game becoming impossibly difficult boring play iwatani described enemy behaviors detail 2011 game developers conference red enemy simply chases pac-man pink enemy aims position front pac-man mouth blue enemy seek position similar fixed spot pink enemy practice however blue enemy behave like three enemies although iwatani claimed orange enemy behavior random alternates behaving like red enemy distance pac-man moving towards lower-left corner maze whenever gets close pac-man designed ending however level 256 bug corrupts entire right half maze seemingly random symbols tiles overwriting values edible dots makes impossible eat enough dots complete level serving effectively final level known split screen bug caused calculation number fruit draw rolling zero code attempts draw 256 fruit 236 designed resulting maze corrupted tilemap holds fruits 20 elements long arranged three cases case handles levels less seven case b handles levels 8–19 case c handles level 19 game reaches level 256 level counter overflows back 0 thus level 256 treated level 0 game executes case rather case c level number less seven algorithm draws fruits continues draw fruit till fruit number level number match upon reaching fruit number 255 fruit number overflows back 0 matching level number 256 fruit drawn game draws first 13 fruit issues upon reaching fruit number 14 begins draw fruit right side map game reaches 20th entry fruit table game longer draw fruit still 236 fruit needs draw thus game begins draw pieces tile map onto screen substitute 236 extra fruit pac-man move pieces act like walls 256 fruit drawn game draws 7 extra blank spaces final fruit level impossible beat using one game player needs eat 244 dots move next level dots overwritten tilemap nine dots hidden within glitch screen re-spawn player dies maximum five extra lives limits number dots 168 however player able continue re-spawned dots eaten level beaten level 0 beaten player returned level 1 ghosts difficulty set high thus ghost blue time also two broken keys bottom screen one live counter one level counter disappear round beaten perfect pac-man game player achieves maximum possible score first 255 levels eating every possible dot energizer fruit enemy without losing single life using extra lives score many points possible level 256 first person credited achieving score 3,333,360 points esports player billy mitchell claimed perform feat six hours 1999 however april 2018 video game ranker twin galaxies removed mitchell scores database ruling certain donkey kong submissions achieved using original arcade hardware since mitchell pac-man achievement 7 players attained maximum score original arcade unit world record according twin galaxies currently held david race fastest completion time 3 hours 28 minutes 49 seconds maximum possible score 3,333,360 points historically december 1982 eight-year-old boy jeffrey r. yee received letter u.s. president ronald reagan congratulating worldwide record 6,131,940 points score possible passed level 256 september 1983 walter day chief scorekeeper twin galaxies took us national video game team tour east coast visit video game players said could get level 256 video game player could demonstrate ability 1999 billy mitchell offered 100,000 anyone could complete level 256 january 1 2000 prize expired unclaimed early 1970s namco primarily specialized kiddie rides japanese department stores masaya nakamura founder namco started direct company toward arcade games starting electromechanical ones f-1 1976 later hired number software engineers develop video games compete companies like atari inc. pac-man one first games developed new department within namco game developed primarily young 24-year-old employee named toru iwatani year beginning april 1979 employing nine-man team based concept eating original japanese title inspired japanese onomatopoeic phrase paku-paku describes sound mouth movement widely opened closed succession although iwatani repeatedly stated character shape inspired pizza missing slice 1986 interview admitted half-truth character design also came simplifying rounding kanji character mouth kuchi iwatani attempted appeal wider audience beyond typical demographics young boys teenagers intention attract girl gamers arcades found games played women time led add elements maze well cute ghost-like enemy characters eating gain power iwatani said concept borrowed popeye result game named puckman reference main character hockey puck shape later 1980 game picked manufacture united states bally division midway changed game name puckman pac-man effort avoid vandalism people changing letter p f spell f-word cabinet artwork also changed western markets first launched japan namco 1980 pac-man received lukewarm response space invaders similar games popular time however game success north america year took competitors distributors surprise frequently-repeated story claims marketing executives saw pac-man trade show release completely overlooked now-classic defender seeing racing game called rally-x also involves collecting items maze game outdo year pac-man quickly became popular anything seen video game industry game estimated 30 million active players across united states 1982 1983 interview nakamura said though expect pac-man successful never thought would big overtook asteroids best-selling arcade game north america grossing 1 billion quarters within year surpassing highest-grossing film time star wars arcade machines retailed around 2400 sales totaled around 1 billion equivalent billion within 18 months release 1982 400,000 arcade machines sold worldwide estimated 7 billion coins inserted combined sales counterfeit arcade machines nearly high original united states revenues pac-man licensed games products exceeded 1 billion toward end 20th century arcade game total gross consumer revenue estimated twin galaxies 10 billion quarters 2.5 billion making highest-grossing video game time beating space invaders 2016 usgamer calculated machines inflation-adjusted takings equivalent 7.68 billion pac-man awarded best commercial arcade game 1981 arcade awards ii computing listed atarisoft port tenth magazine list top apple ii games late 1985 based sales market-share data 2001 pac-man voted greatest video game time dixons poll uk game pac-man regarded one influential video games time title character first original gaming mascot game established maze chase game genre demonstrated potential characters video games increased appeal video games female audiences gaming first broad licensing success first video game power-ups individual ghosts deterministic artificial intelligence ai reacts player actions often cited first game cutscenes form brief comical interludes pac-man blinky chasing though actually space invaders part ii employed similar style between-level intermissions 1979 maze chase games exploded home computers release pac-man appeared official ports garnered attention consumers sometimes lawyers result include taxman 1981 snack attack 1982 apple ii jawbreaker 1981 atari 8-bit family scarfman 1981 trs-80 k.c munchkin 1981 odyssey² pac-man also inspired 3d variants concept monster maze 1982 spectre 1982 early first-person shooters midi maze 1987 also similar character designs john romero credited pac-man game biggest influence career wolfenstein 3d includes pac-man level first-person perspective many post- pac-man titles include power-ups briefly turn tables enemy game artificial intelligence inspired programmers later worked companies like bethesda atari inc. licensed home rights developed versions pac-man atari 2600 atari 8-bit family atari 5200 systems ports systems published atarisoft label apple ii commodore 64 vic-20 intellivision ibm pc texas instruments ti-99/4a zx spectrum one first ports march 1982 release much-maligned port atari 2600 somewhat resembles original widely criticized flickering ghosts several design implementation choices nonetheless seven million copies version pac-man sold 37.95 becoming best-selling game time console enjoying initial sales success atari overestimated demand producing 12 million cartridges 5 million went unsold richard a. edwards reviewed atari 2600 version space gamer 53 edwards commented must pac-man home 're hesitant enough differences version suggest passing port poor quality damaged company reputation among consumers retailers becoming contributing factor alongside atari e.t extra-terrestrial atari inc. decline north american video game crash 1983 namco later produced versions nintendo entertainment system game boy game boy color game gear neo geo pocket color namco ported game famicom 1985 north american operations time license atari—under tengen name—to release certain namco famicom games us audiences atari release pac-man initially licensed nintendo cartridge standard gray shell soon afterward atari began manufacturing unauthorized clones nes lockout chip produced unlicensed nes cartridges black shells including pac-man nintendo eventually discovered ruse filed lawsuit atari 1993 namco released pac-man nes three different north american releases nes pac-man —the atari gray cartridge atari black cartridge namco version—differing copyright notices title screen pac-man arcade game bonus game within super nes sega genesis pac-man world playstation pac-man party wii nintendo 3ds guinness world records awarded pac-man series eight records guinness world records gamer edition 2008 including first perfect pac-man game billy mitchell july 3 1999 score successful coin-operated game june 3 2010 nlgd festival games game creator toru iwatani officially received certificate guinness world records pac-man coin-operated arcade machines installed worldwide 293,822 record set recognized 2005 mentioned guinness world records gamer edition 2008 finally actually awarded 2010 pac-man character game series became icon video game culture 1980s wide variety pac-man merchandise marketed character image t-shirts toys hand-held video game imitations even specially shaped pasta general mills manufactured cereal pac-man name 1983 game inspired various real-life recreations involving either real people robots one event called pac-manhattan set guinness world record largest pac-man game 2004 business term pac-man defense mergers acquisitions refers hostile takeover target attempts reverse situation take would-be acquirer instead reference pac-man energizers game popularity led pac-man adopted nickname notably boxer manny pacquiao well american football player adam jones august 21 2016 2016 summer olympics closing ceremony video showcased tokyo host 2020 summer olympics small segment shows pac-man ghosts racing eating dots running track pac-man animated tv series produced hanna–barbera aired abc 1982 1983 computer-generated animated series titled pac-man ghostly adventures aired disney xd june 2013 february 2019 series also planned air universal kids ultimately canceled due low coverage nbcuniversal music buckner garcia song pac-man fever 1981 went 9 billboard hot 100 charts received gold certification 1 million records sold 1982 total 2.5 million copies sold 2008 group pac-man fever album 1982 also sold million copies 1982 weird al yankovic recorded parody taxman beatles pac-man eventually released 2017 part 1992 aphex twin name power-pill released pac-man techno album consists mostly samples game 2008 feature film based game development pac-man character appears film pixels 2015 denis akiyama playing series creator toru iwatani pac-man referenced makes appearance 2017 film guardians galaxy 2 kirito friends beat vr pac-man game called pac-man 2024 iwatani makes cameo beginning film arcade technician japanese tokusatsu film kamen rider heisei generations dr. pac-man vs. ex-aid ghost legend riders pac-man-like character introduced main villain 2019 film relaxer uses pac-man strong plot element form 1999 couch-bound man attempts beat game encounters famous level 256 glitch y2k occurs 1982 milton bradley released board game based pac-man players move four pac-man characters traditional yellow plus red green blue plus two ghosts per throws pair dice sticker manufacturer fleer included rub-off game cards pac-man stickers card packages contain pac-man style maze points along path hidden opaque coverings starting position player moves around maze scratching coverings score points pac-man playable character super smash bros. nintendo 3ds wii u 3ds version stage based original arcade game called pac-maze pac-man amiibo figurine also released nintendo may 29 2015 pac-man later returned playable character super smash bros ultimate within mathematical research field dynamical systems new kind renormalization called pac-man renormalization introduced dzmitry dudko mikhail lyubich nikita selinger name inspired visual similarity pac-man figure main object study theory announced 2017 advanced 2018 made significant advances study famous mandelbrot set pac-man one games consistently published three decades remade numerous platforms spawning many sequels pac-man included namco long-running namco museum compilations well microsoft return arcade downloads game made available game services xbox live arcade gametap virtual console namco released mobile versions pac-man brew java ios well palm pdas windows mobile-based devices pac-man numerous sequels spin-offs one designed original designer toru iwatani follow-ups developed namco either including significant midway ms. pac-man released united states 1981 originally called crazy otto unauthorized hack pac-man created general computer corporation sold midway without namco permission bally-midway released several unauthorized spin-offs pac-man plus jr. pac-man baby pac-man professor pac-man resulting namco severing business relations midway coleco tabletop mini-arcade versions game yielded 1.5 million units sold 1982 nelsonic industries produced pac-man lcd wristwatch game simplified maze also 1982 namco repeatedly re-released game arcades 2001 namco released ms. pac-man galaga class 1981 reunion edition cabinet pac-man available play hidden game commemorate pac-man 25th anniversary 2005 namco released revision officially featured three games june 5 2007 first pac-man world championship held new york city brought together ten competitors eight countries play new pac-man championship edition developed toru iwatani sequel released november 2010 namco networks sold downloadable windows pc version pac-man 2009 also includes enhanced mode replaces original sprites sprites pac-man championship edition namco networks made downloadable bundle includes pc version pac-man port dig dug called 2010 namco bandai announced release game windows phone 7 xbox live game weekend may 21–23 2010 google changed logo homepage playable version game recognition 30th anniversary game release google doodle version pac-man estimated played 1 billion people worldwide 2010 google later allowed access game separate web page april 2011 soap creative published world biggest pac-man working together microsoft namco-bandai celebrate pac-man 30th anniversary multiplayer browser-based game user-created interlocking mazes 2016 in-app version pac-man introduced facebook messenger allows users play game friends talking facebook | [
8052,
5720,
2908,
7430,
723,
7179,
5397,
1019,
3560,
4435,
7388,
3313,
1120,
5686,
3044,
4454,
1237,
3421,
4016
] | Train |
2,149 | 5 | Passband:passband passband range frequencies wavelengths pass filter example radio receiver contains bandpass filter select frequency desired radio signal radio waves picked antenna passband receiver range frequencies receive bandpass-filtered signal signal energy passband known bandpass signal contrast baseband signal telecommunications optics acoustics passband band-pass filtered signal portion frequency spectrum transmitted minimum relative loss maximum relative gain filtering device words band frequencies pass es filter set filters accompanying figure shows schematic waveform filtered bandpass filter consisting highpass lowpass filter radio receivers generally include tunable band-pass filter passband wide enough accommodate bandwidth radio signal transmitted single station two main categories digital communication transmission methods baseband passband general inverse relationship width filter passband time required filter respond new inputs broad passbands yield faster response times consequence mathematics fourier analysis limiting frequencies passband defined relative intensity power decreases specified fraction maximum intensity power decrease power often specified half-power points i.e 3 db maximum power difference limiting frequencies called bandwidth expressed hertz optical regime nanometers micrometers differential wavelength related term bandpass adjective describes type filter filtering process frequently confused passband refers actual portion affected spectrum two words compound words follow english rules formation primary meaning latter part compound modifier first part hence one may correctly say dual bandpass filter two passbands | [
7241,
2099,
3956,
8184,
2117,
2121,
5133,
4970,
5693,
768,
5175
] | Validation |
2,150 | 4 | Password_length_parameter:password length parameter telecommunication password length parameter basic parameter value affects password strength brute force attack contributor computer security one use password length parameters expression formula_1 formula_2 probability password guessed lifetime formula_3 maximum lifetime password used log system formula_4 number guesses per unit time formula_5 number unique algorithm-generated passwords 'password space degree password security determined probability password guessed lifetime | [
3795,
1805
] | Test |
2,151 | 3 | Rockchip_RK3288:rockchip rk3288 rockchip rk3288 arm architecture system chip soc rockchip first soc august 2014 uses 32 bit arm cortex-a17 processor quad-core processor neon coprocessor hardware acceleration video 3d graphics used number chromebooks low-power low-performance devices rk3288-c used veyron board design several chromebooks powers following devices | [
1977,
1095,
3309,
6378,
6950
] | Test |
2,152 | 4 | Trademark_(computer_security):trademark computer security trademark computer security contract code verifies security properties object code requires object certain security properties useful ensuring secure information flow object-oriented languages trademarking analogous signing data often implemented without cryptography trademark two operations operation analogous private key digital signature process must exposed untrusted code applied immutable objects makes sure verifytrademark called value returns true operation analogous public key digital signature process exposed untrusted code returns true if-and-only-if applytrademark called given object trademarking inverse taint checking whereas taint checking black-listing approach says certain objects trusted trademarking white-listing approach marks certain objects certain security properties apply trademark thought memoizing verification process sometimes verification process need done fact value particular security property verified statically case apply property used assert object produced code formally verified produce outputs particular security property one way applying trademark java | [] | Test |
2,153 | 2 | Insure++:insure++ insure++ memory debugger computer program used software developers detect various errors programs written c c++ made parasoft functionally similar memory debuggers purify valgrind dr memory insure++ automatically find erroneous accesses freed memory use-after-free situations array-bounds violations freeing unallocated memory often happens programmer frees memory twice frees global stack memory many others unlike purify valgrind insure++ inserts instrumentation source-code level allows detect errors tools miss particular insure++ detect buffer overflows automatic arrays overflows involve pointers accidentally jump one valid memory region another following example source-level instrumentation allows identify leak occurred occurred tools merely provide information memory allocated insure++ also gives stack trace when/where actual leak occurred additionally insure++ produce linear code sequence jump code coverage metrics tested code | [
1019,
1203,
1363,
3915,
4759,
572,
573,
5571,
3114,
578,
6567,
1174,
8150,
1435
] | Test |
2,154 | 2 | Visopsys:visopsys visopsys visual operating system operating system written andy mclaughlin development operating system began 1997 operating system licensed gnu gpl headers libraries less restrictive lgpl license runs 32-bit ia-32 architecture features multitasking kernel supports asynchronous i/o fat line file systems requires pentium processor development visopsys began 1997 written andy mclaughlin first public release operating system 2 march 2001 version 0.1 release visopsys 32 bit operating system supporting preemptive multitasking virtual memory visopsys uses monolithic kernel written c programming language elements assembly language certain interactions hardware operating system sports graphical user interface small c library | [
336,
1522,
5571,
3751,
8066,
5232,
1435
] | Test |
2,155 | 3 | ST6_and_ST7:st6 st7 st6 st7 8-bit microcontroller product lines stmicroelectronics commonly used small embedded applications like washing machines although use similar peripherals marketed part product line two architectures actually quite different 8-bit accumulator used operations plus two 8-bit index registers x used memory addressing also 8-bit instructions followed 2 bytes operands support manipulating branching individual bits memory similarities end st6 harvard architecture 8-bit 256 byte data address space separate 12-bit 4096 byte program space operands always 1 byte long instructions support two operands move 8-bit immediate 8-bit memory address subroutine calls done using separate hardware stack data registers program counter flags memory-mapped st6 addressing modes limited immediate 8-bit absolute memory address register indirect modes x st7 von neumann architecture single 16-bit 64 kib address space first 256 bytes ram zero page extra flexibility two-operand instructions except test bit branch registers memory-mapped uses general-purpose ram plus stack pointer register subroutine calls st7 supports wide variety addressing modes including base+index double-indirect st6 64 bytes ram 4096 bytes program rom larger amounts accessed bank-switching low 2k section rom ram address space actually 256 bytes divided follows mapped address space 12-bit program counter associated hardware stack four six levels deep depending model two status bits carry zero banked based processor mode separate status bits normal interrupt non-maskable interrupt operation first four general-purpose ram locations also known x v w registers instructions access using special short addressing modes x registers serve index registers use indirect addressing modes codice_1 codice_2 instruction set consists one byte opcode followed two one-byte operands instruction set summarized follows st7 six registers accumulator x index registers stack pointer program counter condition code register also double-indirect addressing allows zero page ram serve additional registers unusual useful feature interrupt pushes four registers stack x well usual pc cc interrupt return restores alu instructions fall two categories two-operand one-operand two-operand instructions use accumulator first source addressing mode specifies second source may destination usually accumulator instructions modify second source immediate operands forbidden cases one-operand instructions use specified operand source destination operand may register plus offset computes full-width sum 8-bit form may address memory 255+255 510 addition three prefix bytes may prepended instruction make sense | [
708,
4846,
804,
5208,
5114,
1150,
3365,
4864,
6720,
1556,
7905,
7654,
6919,
6299,
6753,
6662
] | Test |
2,156 | 9 | Dylan_(programming_language):dylan programming language dylan multi-paradigm programming language includes support functional object-oriented programming oop dynamic reflective providing programming model designed support generating efficient machine code including fine-grained control dynamic static behaviors created early 1990s group led apple computer concise thorough overview language may found dylan reference manual dylan derives scheme common lisp adds integrated object system derived common lisp object system clos dylan values including numbers characters functions classes first-class objects dylan supports multiple inheritance polymorphism multiple dispatch keyword arguments object introspection pattern-based syntax extension macros many advanced features programs express fine-grained control dynamism admitting programs occupy continuum dynamic static programming supporting evolutionary development allowing rapid prototyping followed incremental refinement optimization dylan main design goal dynamic language well-suited developing commercial software dylan attempts address potential performance issues introducing natural limits full flexibility lisp systems allowing compiler clearly understand compilable units libraries dylan derives much semantics scheme lisps dylan implementations initially built within extant lisp systems however dylan algol-like syntax instead lisp-like prefix syntax dylan created early 1990s group led apple computer one time development intended use apple newton computer dylan implementation reach sufficient maturity time newton instead used mix c newtonscript developed walter smith apple ended dylan development effort 1995 though made technology release version available apple dylan tr1 included advanced integrated development environment ide two groups contributed design language developed implementations harlequin released commercial ide microsoft windows carnegie mellon university released open source compiler unix systems called gwydion dylan implementations open source harlequin implementation named open dylan maintained group volunteers dylan hackers dylan language code-named ralph james joaquin chose name dylan dynamic language many dylan syntax features come lisp heritage originally dylan used lisp-like prefix syntax based s-expressions time language design completed syntax changed algol-like syntax expectation would familiar wider audience programmers syntax designed michael kahl described great detail dylan reference manual dylan case sensitive dylan lexical syntax allows use naming convention hyphen-minus signs used connect parts multiple-word identifiers sometimes called lisp-case kebab case convention common lisp languages used programming languages treat hyphen-minus part numeric literal single lexical token even surrounded whitespace characters identifiers dylan may contain special characters languages besides alphanumeric characters hyphen-minus signs dylan allows following non-alphanumerical characters part identifiers underscore codice_1 asterisk codice_2 ampersand codice_3 less-than sign codice_4 equals sign codice_5 greater-than sign codice_6 vertical bar codice_7 caret codice_8 dollar sign codice_9 percent sign codice_10 sign codice_11 identifiers may consist non-alphanumeric characters numeric characters alone ambiguity whitespace used simple class several slots convention classes named less-than greater-than signs used angle brackets e.g class named codice_12 code example codice_13 codice_14 codice_12 optional true codice_16 clauses example may write codice_17 codice_16 terminate codice_19 statement class rewritten minimal way possible slots typed codice_20 slots must initialized manually convention constant names begin factorial function codice_21 codice_22 normal identifiers explicit return statement result method function last expression evaluated common style leave semicolon expression return position many object-oriented languages classes main means encapsulation modularity class defines namespace controls definitions externally visible classes many languages define indivisible unit must used whole example using codice_23 concatenation function requires importing compiling codice_23 languages including dylan also include separate explicit namespace module system performs encapsulation general way dylan concepts compile-unit import-unit separated classes nothing specifically either library defines items compiled handled together module defines namespace classes placed together modules cut across programmer wishes often complete definition class exist single module spread across several optionally collected together different programs different definitions class including need example consider add-on library regex support codice_23 languages functionality included strings functionality must added codice_23 namespace soon occurs codice_23 class becomes larger functions n't need use regex still must pay increased library size reason sorts add-ons typically placed namespaces objects downside approach new functions longer part codice_23 instead isolated set functions must called separately instead codice_29 would natural organization oo viewpoint something like codice_30 used effectively reverses ordering dylan many interfaces defined code instance string concatenation method could placed string interface concat interface collects together different concatenation functions various classes commonly used math libraries functions tend applicable widely differing object types practical use interface construct build public private versions module something languages include bolt feature invariably causes problems adds syntax dylan every function call simply places private development interface collect publicly accessible functions codice_31 java c++ visibility object defined code meaning support similar change programmer would forced rewrite definitions fully could two versions time classes dylan describe codice_32 data members fields ivars etc objects fashion similar oo languages access slots via methods smalltalk default getter setter methods automatically generated based slot names contrast oo languages methods applicable class often defined outside class thus class definitions dylan typically include definition storage instance define class window view end class example class codice_33 defined class name syntax convention make class names stand out—the angle brackets merely part class name contrast languages convention capitalize first letter class name prefix name c example codice_33 inherits single class codice_35 contains two slots codice_36 holding string window title codice_37 holding x-y point corner window example title given default value position optional init-keyword syntax allows programmer specify initial value slot instantiating object class languages c++ java class would also define interface case definition explicit instructions languages access slots methods considered codice_38 meaning used subclasses allow unrelated code use window instances must declared codice_39 dylan sorts visibility rules considered part code module/interface system adds considerable flexibility instance one interface used early development could declare everything public whereas one used testing deployment could limit c++ java changes would require changes source code people wo n't whereas dylan fully unrelated concept although example use dylan also supports multiple inheritance dylan methods intrinsically associated specific class methods thought existing outside classes like clos dylan based multiple dispatch multimethods specific method called chosen based types arguments method need known compile time understanding required function may available based user preferences java methods would isolated specific class use functionality programmer forced import class refer explicitly call method class unavailable unknown compile time application simply wo n't compile dylan code isolated storage functions many classes methods call functions thereby looking feeling like oo languages however code may also located generic functions meaning attached specific class called natively anyone linking specific generic function method class accomplished thusly define method turn-blue w window end method definition similar languages would likely encapsulated within codice_33 class note setter call syntactic sugar codice_41 utility generic methods comes consider generic examples instance one common function languages codice_42 returns human-readable form object instance window might return title position parens string would return dylan methods could collected single module called codice_42 thereby removing code definition class specific object support codice_42 could easily added codice_42 module whole concept might strike readers odd code handle codice_42 window n't defined codice_33 might make sense consider dylan handles call codice_42 languages program compiled codice_42 codice_33 looked replaced pointer less method dylan occurs program first run runtime builds table method-name/parameters details looks methods dynamically via table means function specific method located anywhere compile-time unit end programmer given considerable flexibility terms place code collecting along class lines appropriate functional lines implication programmer add functionality existing classes defining functions separate file instance might wish add spell checking codice_51s languages would require access source code string class—and basic classes rarely given source form dylan extensible languages spell checking method could added codice_52 module defining classes applied via codice_53 construct case actual functionality might defined single generic function takes string returns errors codice_52 module compiled program strings objects get added functionality apple dylan implementation dylan produced apple computer originally developed apple newton product | [
3931,
7878,
1445,
4302,
1820,
5019,
6796,
6087,
1825,
2915,
6428,
5734,
1102,
1478,
2576,
2218,
4704,
4705,
5757,
6116,
7557,
1116,
6471,
7573,
2600,
5077,
1885,
1889,
6507,
795,
6876,
4759,
7245,
6886,
6888,
1557,
5494,
7277,
5501,
6210,... | Validation |
2,157 | 4 | Double_Image_Backup:double image backup double image backup software runs windows laptops workstations windows servers double image first released march 1994 since followed major releases double image 7.0 released january 12 2011 become compatible windows 7 windows vista windows server 2008 operating systems double image 7.0.58 released march 15 2018 included compatibility windows 10 windows 8 windows server 2016 windows server 2012 added options file synchronization using 'major delete feature double image code installation package code sign certified using sha-2 current release double image 7.0.61 released august 26 2018 features systems supported remain previous versions release several bug fixes including dealing windows 10 registry restore | [
3764,
1254,
4759,
3180,
2390,
2566,
5571,
578,
1382,
6289,
1670,
3734,
2885,
2795,
1237,
352
] | Test |
2,158 | 4 | Implicit_authentication:implicit authentication implicit authentication ia technique allows smart device recognize owner acquainted his/her behaviors technique uses machine learning algorithms learn user behavior various sensors smart devices achieve user identification current authentication techniques e.g. password pattern lock finger print iris recognition explicit authentication require user input comparing explicit authentication ia transparent users usage significantly increases usability reducing time users spending login users find annoying lack cellular coverage implicit authentication ia user behaviors raw data captured various sensors embedded smart device stored database preparing processing filtering noise selecting suitable features data sent machine learning tool train return fine-tuned model back smart device smart device uses model signature identify current user due battery computation limitation smart device training phase computations carried usually implemented remote server lightweight algorithms e.g. kl divergence implemented local device parts real-time authentication units control lock mechanism device developing ia model largely depends operating systems usually adopt android ios two different approaches establish ia model device-centric application-centric device-centric approaches traditional way establish ia model leverage information gathered operating system various sensors ia model directly running operating system application-centric approaches however achieve ia establishing individual framework app executes independently sandbox preserves intrinsic structure operating system simplifies ia developing 1977 wood indicated two types bio-metric authentication approaches physiological behavioral bio-metrics second approach related user gait location information keystroke patterns utilization bio-metrics user authentication developed field location-based access control notably keystroke dynamics typing pattern 2010 shi et al migrated bio-metrics authentication approach mobile device contained many sensors significantly increased accuracy authentication called new approach implicit authentication due fast growth smart technology smart device became sophisticated computational power grew year provided foundation ia achieve high accurate user-friendly authentication current ia approaches mainly focused touch sensor gps accelerometer corresponding techniques svm knn gmm topic model | [
3495
] | Test |
2,159 | 7 | Slurm_Workload_Manager:slurm workload manager slurm workload manager formerly known simple linux utility resource management slurm slurm free open-source job scheduler linux unix-like kernels used many world supercomputers computer clusters provides three key functions slurm workload manager 60 top500 supercomputers slurm uses best fit algorithm based hilbert curve scheduling fat tree network topology order optimize locality task assignments parallel computers slurm began development collaborative effort primarily lawrence livermore national laboratory schedmd linux networx hewlett-packard groupe bull free software resource manager inspired closed source quadrics rms shares similar syntax name reference soda futurama 100 people around world contributed project since evolved sophisticated batch scheduler capable satisfying requirements many large computer centers top500 list powerful computers world indicates slurm workload manager six top ten systems including sunway taihulight 10,649,600 computing cores slurm design modular 100 optional plugins simplest configuration installed configured couple minutes sophisticated configurations provide database integration accounting management resource limits workload prioritization notable slurm features include following following features announced version 14.11 slurm released november 2014 slurm primarily developed work alongside linux distributions although also support posix-based operating systems including bsds freebsd netbsd openbsd slurm also supports several unique computer architectures including slurm available gnu general public license v2 2010 developers slurm founded schedmd maintains canonical source provides development level 3 commercial support training services commercial support also available bright computing bull cray science computing following list useful commands available slurm built ccr allow easier reporting users usage information commands use example use linux command information commands example italicized font commands indicates user supplied information brackets indicate optional flags | [
3256,
2182,
3613,
7528,
7532,
5744,
6443,
2942,
6117,
4341,
5762,
412,
415,
1494,
3666,
2970,
7956,
5453,
5460,
7242,
1535,
1924,
6892,
1176,
1933,
5829,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
1596,
165,
7312,
3751,
1607,
5884,
1991,
... | Test |
2,160 | 6 | Peripheral_Interchange_Program:peripheral interchange program peripheral interchange program pip utility transfer files devices digital equipment corporation computers first implemented pdp-6 architecture harrison dit morse early 1960s subsequently implemented dec operating systems pdp-10 pdp-11 pdp-8 architectures 1970s 1980s digital research implemented pip cp/m mp/m said development named atlatl acronym anything lord anything lord humorously described purpose device-independent file copying tool difficulties time safely copying files devices original pip syntax using left-arrow character ascii-1963 character set flexowriter keyboards time used terminals introduced used later versions ascii without left-arrow character pip allowed syntax underscore character ascii character position left-arrow occupied still supported separate destination source specifications source destination file specification strings consisted device name typically 2 characters device type dk disk lp line printer mt magnetic tape etc unit number 0 7 colon filename extension copying generally permitted file specification made sense late mid 1980s pip still common use tops-10 tops-20 pdp-11 systems gary kildall developed cp/m mp/m based much design file structure command processor operating systems digital equipment rsts/e pdp-11 besides accessing files floppy disk pip command cp/m could also transfer data following special files true device files however handling limited pip two custom devices inp implemented calls fixed locations start pip program intention user oem could patch locations add input output devices 246 bytes free space left program purpose addition usual pip destination=source syntax pip cp/m still allowed old pip destination_source form behaviour documented cp/m generally standard characters could appear file names therefore programs could create filenames containing underscore characters pip could handle | [
980,
4843,
2280,
190,
1537,
2010,
5911,
8087,
5571,
126,
6907,
4786,
3210,
7020,
4180,
7032,
3664,
861,
1894,
6496,
8043,
4745
] | Validation |
2,161 | 2 | FreeSBIE:freesbie freesbie live cd operating system able load directly bootable cd installation process hard disk based freebsd operating system name pun frisbee currently freesbie uses xfce fluxbox freesbie 1.0 based freebsd 5.2.1 released february 27 2004 first version freesbie 2 developed summer 2005 thanks google summer code freesbie 2.0.1 complete rewrite so-called toolkit based freebsd 6.2 released february 10 2007 according distrowatch freesbie project discontinued goals freesbie project | [
5268,
1523,
1341,
1254,
7514,
191,
6085,
6711,
1356,
1547,
4498,
7355,
481,
3457,
732,
2300,
5571,
6278,
8194,
8096,
1193,
1013,
3636,
4059,
5232,
8001,
6918,
5760,
6211,
3986,
4806,
5065,
594,
4441,
5865,
4534,
6477,
424,
2512,
5250,
1... | Validation |
2,162 | 9 | Carlo_Ghezzi:carlo ghezzi carlo ghezzi professor chair software engineering politecnico di milano italy adjunct professor università della svizzera italiana usi switzerland politecnico rector delegate research department chair head phd program member academic senate board governors politecnico received dr.eng degree electrical engineering politecnico di milano spent professional life assistant associate full professor also taught research institutions university california los angeles usa 1976 university north carolina chapel hill usa 1979–80 università degli studi di padova italy 1980–81 escuela superior latinoamericana de informática argentina 1990 university california santa barbara usa 1991 technical university vienna austria 1996 university klagenfurt austria 1996 ghezzi 1999 acm fellow citation numerous research contributions compiler theory real-time systems software processes strong contributor software engineering community europe worldwide 2006 ieee fellow citation contributions programming languages software engineering 2006 awarded acm sigsoft distinguished service award member regular member program committee important conferences software engineering field international conference software engineering icse foundations software engineering fse conference jointly held conjunction european software engineering conference esec chairing conferences program co-chair icse 1991 program chair esec/fse '99 general chair icse 2000 general co-chair international conference service oriented computing icsoc 2006 keynote speaker several conferences including esec 1993 ieee international conference software maintenance icsm 1997 european joint conference theory practice software etaps 2006 icse 2009 ieee international conference engineering complex computer systems iceccs 2010 ieee international conference software engineering formal methods sefm 2010 international symposium empirical software engineering measurement esem 2010 servicewave servicewave 2010 fundamentals software engineering fsen 2011 editor chief acm transactions software engineering methodology 2001–2006 associate editor ieee transactions software engineering currently associate editor science computer programming elsevier service oriented computing applications springer science+business media software process improvement practice john wiley sons research constantly focused different facets software engineering programming languages currently active area software architectures especially evolvable distributed software architectures ubiquitous pervasive computer applications long-term goal contribute making software dependable basing solid rigorous methodological theoretical foundations ghezzi co-authored 180 papers almost published internationally papers appeared prestigious journals like journal acm information control information computation acm transactions software engineering methodology acm transactions programming languages systems ieee transactions software engineering co-author 8 books including 2008 awarded advanced investigators grant european research council funding smscom project | [
1243
] | Train |
2,163 | 2 | HP-1000/RTE:hp-1000/rte hp-1000/rte hp product code 2171a real-time computer system first produced hewlett packard 1966 discontinued november 2000 hp 1000 series runs rte real-time operating system initially technical applications electronic data capture mainly store data captured used also analyse data captured generate graphics reports later operating system used also small commercial applications mainly inside industries small factories hp 9000 systems became able handle real-time processes rte systems declined | [
6687,
5571,
4336
] | Train |
2,164 | 2 | Chain_loading:chain loading chain loading method used computer programs replace currently executing program new program using common data area pass information current program new program occurs several areas computing chain loading similar use overlays unlike overlays however chain loading replaces currently executing program entirety overlays usually replace portion running program like use overlays use chain loading increases i/o load application operating system boot manager programs chain loading used pass control boot manager boot sector target boot sector loaded disk replacing in-memory boot sector boot manager bootstrapped executed unix unix-like operating systems exec system call used perform chain loading program image current process replaced entirely new image current thread begins execution image common data area comprises data process environment variables preserved across system call addition exec process level chain loading linux supports kexec system call replace entire operating system kernel different version new kernel boots started power running processes preserved basic programs chain loading purview codice_1 statement commodore basic codice_2 statement causes current program terminated chained-to program loaded invoked dialects basic support optional parameter specifying line number execution commence rather default first line new program common data area varies according particular dialect basic use bbc basic example specific subset variables preserved across chain basics codice_3 statement used conjunction codice_1 specify variables preserved common data across chain operation chain loading permits basic programs execute program code could fit available program variable memory applications written basic could thus far larger size working memory via set cooperating programs codice_1 back forth amongst program flow moves within overall application many versions fortran include codice_6 statement performs chain loading preserving contents common storage unrelated codice_7 subroutine gnu fortran os/360 successors use codice_8 transfer control macro chain loading operating system memory management may may result replacement code calling program memory | [
2223,
607,
5480,
3493,
5877,
5926,
3751,
4915,
578,
2803,
1992
] | Test |
2,165 | 7 | Cluster_Computing_(journal):cluster computing journal cluster computing journal networks software tools applications peer-reviewed scientific journal parallel processing distributed computing systems computer communication networks journal established 1998 2016 journal journal citation reports impact factor 2.040 | [] | Test |
2,166 | 2 | Network_Policy_Server:network policy server network policy access services npas component windows server 2008 replaces internet authentication service ias windows server 2003 npas helps safeguard health security network npas server role includes network policy server nps health registration authority hra host credential authorization protocol hcap windows server 2003 ias microsoft implementation remote authentication dial-in user service radius server windows server operating systems later windows server 2003 ias renamed nps npas role service windows server 2008 function npsee enables use heterogeneous set wireless switch remote access vpn equipment one use nps routing remote access service available microsoft windows 2000 windows server 2003 standard edition windows server 2003 enterprise edition windows server 2003 datacenter edition server running nps member active directory domain services ad ds domain nps uses directory service user account database part single sign-on solution set credentials used network access control authenticating authorizing access network log ad ds domain | [
644,
6575,
2885,
4759
] | Train |
2,167 | 4 | Backdoor.Win32.Seed:backdoor.win32.seed backdoor.win32.seed definition backdoor trojan first known detection goes back february 7th 2005 according securelist kaspersky labs meanwhile several variants malware self-replicate non-a.i. backdoor.win32.seed spread manually often premise .exe file something beneficial distribution channels include irc peer-to-peer networks newsgroup postings e-mails | [
496,
5452,
1395,
142,
74,
7683
] | Validation |
2,168 | 7 | Process_migration:process migration computing process migration specialized form process management whereby processes moved one computing environment another originated distributed computing used widely multicore machines multiple cores one processor multiple processors process migration happens standard part process scheduling quite easy migrate process within given machine since resources memory files sockets need changed execution context primarily program counter registers traditional form process migration computer clusters processes moved machine machine significantly difficult requires serializing process image migrating reacquiring resources new machine process migration implemented among others openmosix pioneered sprite os university california berkeley process migration computing comes two flavors several problems occur running process moves another machine problems i/o redirection process i/o files devices bound certain machine must way redirect access resources even process migrated involves redirection i/o data stream network disadvantages concerning security performance reliability inter-process communication messages sent process process id p machine redirected new machine n new process id q machine process migrated away needs keep records migrated processes multiple migration occurs overhead increases shared memory one group cooperating processes migrates away processes use shared memory segment network must used emulate shared memory access adds complexity slows access shared memory dramatically processes migrated away machine holding shared memory phenomena host computer must provide services process migrated away called residual dependency addition problems mentioned process based operating systems usually maintain variety tables states running processes simple way retrieve administrative information process simple sequence copy operations depending execution process tables need searched copied altered re-established destination system thus process state replication simple task reference http //www.klammeraffe.org/~fritsch/uni-sb/fsinfo/papers/migrate/node4.html alternate definition process migration used integrated circuit design engineering process migration layout migration context design flow change shrink existing ic layout new process technology node implementation process migration could done manually redrawing layout feature feature automatic eda/cad tools load sharing systems process migrated one node another using mechanism called process migration concept process introduced report processes well-known design operating systems process migration refers mobility executing suspended processes distributed computing environment usually term indicates process uses network migrate another machine continue execution sometimes term used describe change execution one processor another processor within machine | [
6268,
5022,
83,
2266
] | Test |
2,169 | 9 | Parser_Grammar_Engine:parser grammar engine parser grammar engine pge originally parrot grammar engine compiler runtime perl 6 rules parrot virtual machine pge uses rules convert parsing expression grammar parrot bytecode therefore compiling rules program unlike virtual machines runtimes store regular expressions secondary internal format interpreted runtime regular expression engine rules format used pge express regular expression formal grammars forms first link compiler chain parrot front-end languages executed bytecode generated pge parse text described input rules generating parse tree parse tree manipulated directly fed next stage parrot compiler toolchain order generate ast code generation occur grammar describes programming language originally named p6ge written c pge translated native parrot renamed long initial release november 2004 author patrick r. michaud pge written order reduce amount work required implement compiler top parrot also written allow perl 6 easily self-host though current pugs development longer uses pge primary rules back-end favor native engine called pcr pge combines three styles parsing primary form perl 6 rules pge rule might look like addition-only grammar operator precedence parser allows operator table built used directly perl 6 rule style parser like accomplishes goal defining simple addition-only grammar using combination perl 6 style regex/rules codice_1 codice_2 shift-reduce optable everything else though pge outputs code parse grammar described rule used run time handle simple grammars regular expressions found code primary purpose parsing high level languages parrot compiler toolchain broken several parts pge first pge converts source code parse trees tree grammar engine tge converts parrot abstract syntax trees past second tge pass converts past parrot opcode syntax trees post directly transformed executable bytecode | [
1361,
6497,
2420
] | Test |
2,170 | 2 | Debian_GNU/Hurd:debian gnu/hurd debian gnu/hurd flavor debian operating system based hurd microkernel instead common debian kernels linux freebsd debian gnu/hurd development since 1998 made formal release may 2013 78 software packaged debian gnu/linux ported gnu hurd debian gnu/hurd developers hoping able release debian wheezy 2013 however hurd yet official debian release maintained developed unofficial port according gnu/hurd compatibility guide current version compatible laptops pcmcia support yet 2019 debian gnu/hurd several shortcomings among offered i386 uses ext2 filesystem dhcp work roadmap includes plans migrate ext4 filesystem using dhcp machine hang boot debian gnu/hurd distributed installer cd running official debian installer ready-to-run virtual disk image live cd live usb cd uses ia-32 architecture making compatible ia-32 x86-64 pcs current version debian gnu/hurd 2019 published july 2019 | [
1523,
8158,
3174,
7161,
7969,
1351,
5021,
6086,
2916,
5912,
3271,
6984,
2559,
5571,
3868,
6365,
6549,
7463,
7559,
3981,
4070,
4165,
3559,
2599,
1406,
6674,
5787,
966,
3751,
2351,
174,
4910,
6317,
788
] | Test |
2,171 | 3 | Might_and_Magic_Book_One:_The_Secret_of_the_Inner_Sanctum:might magic book one secret inner sanctum might magic book one secret inner sanctum also known simply might magic early role-playing video game first popular influential might magic franchise released 1986 new world computing debut ported numerous platforms re-released continuously early '90s original apple ii version game written almost single-handedly jon van caneghem three years van caneghem difficulty finding publisher distribute might magic self-published new world computing handling distribution apartment able broker distribution deal activision due popularity game ported number platforms popular time nine sequels released next fifteen years port might magic released nintendo entertainment system 1992 basic gameplay similar ports released earlier platforms graphics general polish game reflected later release date greater capability nintendo platform game remade release japan pc engine platform version game released cd-rom² rather cartridge able feature digitized voices dialogue result increased storage capacity offered cd medium game later included limited edition special edition game set world varn features expansive outdoor terrain castles caves underground cities astral plane game centers six adventurers trying discover secret inner sanctum kind holy grail quest trying discover inner sanctum heroes discover information mysterious character named corak hunt missing villain sheltem end unmasking sheltem masquerading king defeating evil machinations end game go gates another world travel cron knowing sheltem also escaped world although appears take place straightforward medieval fantasy setting knights armor mythical monsters magicians number science fiction elements revealed later game actual meaning varn vehicular astropod research nacelle relatively common trait early crpgs also seen oldest ultima wizardry titles example sheltem plot first introduced adventurers visit site crashed space ship told aliens prisoner large world characters might magic successors defined number rules conforming loosely fantasy role-playing archetypes characters statistics analogous dungeons dragons ability scores might endurance accuracy personality intelligence luck six character classes player assigns character race creation time human elf half-orc gnome dwarf affects character starting statistics resistance various forms attack alignment also chosen characters party acts collectively time implications minimal alignment plays part game particular determine reward one game quests characters also male female like alignment gender serves minimal purpose game save situations notably city portsmith males males injured stepping certain areas city character gender changed back forth via certain actions within game world two types magic spells might magic sorcerer spells clerical spells sorcerer spells available sorcerer archer characters clerical spells available cleric paladin characters daily spellcasting ability limited character spell points users sorcerer spells number spell points available depends character intelligence statistic clerical spellcasters number spell points depends character personality statistic sorcerer spells tend offensive nature inflicting damage enemy creatures clerical spells usually defensive focusing healing defense removal poison undesirable effects world presented labyrinth utilizing first person perspective interface similar employed bard tale gaming world divided maze-like grid player movement options move forward backward turn ninety degrees left right walls represent mountain ridges cave stone rows trees whatever obstruction might expected terrain explored exploration like combat turn-based might magic hence in-game time pass player delays party moves place hostile creatures random encounter occurs game switches combat phase hostile creatures encountered player usually given option run away attempt surrender creatures try bribe attack player elects attack combat evasion attempt fails game enters combat mode platforms combat interface presented text-only format turn-based combat conducted combatant acting order speed statistic round random speed bonus applied either player party enemy creatures player-character turn player selects action list options including attacking creature casting spell attempting run away combat ends combatants one side either rendered unconscious dead usually hit points reduced zero fled combat player also lose combat allowing members party succumb sleep paralysis effects might magic sold 100,000 copies 1989 1987 compute magazine praised might magic wealth content non-linear play aspects graphics though notes game graphics lack animation limited graphical representation enemy combatants scorpia computer gaming world similarly praised game extensiveness noted early versions game equipped new party members clubs making beginning game difficult 1988 might magic joined magazine hall fame games highly rated time readers 1993 magazine stated despite starting difficulty well worth effort 1996 magazine named might magic 23rd best game ever editors wrote 3d dungeon view combined biggest world map date two major features advanced level crpg apple ii version game reviewed 1987 dragon 122 patricia lesser role computers column lesser stated adventure awesome scope completely fascinating graphically pleasing one top five games ever produced computer subsequent column reviewers gave game 5 5 stars hartley patricia kirk lesser reviewed ibm version game 1988 dragon 132 also giving 5 5 stars lessers reviewed macintosh version game dragon 140 giving macintosh ii version 4½ stars macintosh plus version 3½ stars modern commentators acknowledge mm1 immense scope world freedom exploration pioneering aspects incorporating player characters race gender alignment gameplay | [
6380,
725
] | Test |
2,172 | 3 | List_of_AMD_CPU_microarchitectures:list amd cpu microarchitectures following list amd cpu microarchitectures historically amd cpu families given k-number originally stood kryptonite allusion superman comic book character fatal weakness starting first internal x86 cpu design k5 represent generational changes amd used k-nomenclature codenames official amd documents press releases since beginning 2005 k8 described athlon 64 processor family amd refers codename k8 processors family 0fh processors 10h 0fh refer main result cpuid x86 processor instruction hexadecimal numbering 0f h h represents hexadecimal numbering equals decimal number 15 10 h equals decimal number 16 k10h form sometimes pops improper hybrid k code family xxh identifier number family hexadecimal identifier number determined particular processor using freeware system profiling application cpu-z shows family number ext family field application seen various screenshots cpu-z validator world records website list microarchitectures many codenames associated | [
2539,
5799,
3347,
5804,
4845,
4759,
6170,
5559,
7442,
7726,
5055,
1961,
4077,
6563,
4090,
694,
4098,
1237,
780,
7499,
352,
1797
] | Test |
2,173 | 4 | Operation:_Bot_Roast:operation bot roast operation bot roast operation fbi track bot herders crackers virus coders install malicious software computers internet without owners knowledge turns computer zombie computer sends spam computers compromised computer making botnet network bot infected computers operation launched vast scale botnet resources poses threat national security operation created disrupt disassemble bot herders june 2007 fbi identified 1 million computers compromised leading arrest persons responsible creating malware process owners infected computers notified many unaware exploitation early results operation include charges following | [
7151,
6417,
6419,
3281,
7186,
2577,
5401,
6823,
51,
1500,
74,
2618,
7600,
3680,
4025,
2632,
6515,
2996,
3698,
5848,
7657,
7294,
3047,
2693,
862,
7307,
3071,
2354,
4110,
3426,
880,
2724,
2376,
1632,
2733,
210,
2789,
8133,
3154,
5611,
668... | Test |
2,174 | 2 | Klaus_Knopper:klaus knopper klaus knopper born 1968 ingelheim german electrical engineer free software developer knopper creator knoppix well-known live cd linux distribution received degree electrical engineering kaiserslautern university technology german technische universität kaiserslautern co-founded linuxtag 1996 major european linux expo self-employed information technology consultant since 1998 also teaches kaiserslautern university applied sciences knopper married adriane knopper visual impairment assisting knopper version knoppix blind visually impaired people released third quarter 2007 live cd name given distribution adriane knoppix adriane desktop non-graphical-userinterface blind computer beginners distribution work linux distribution screenreader preferably sbl screenreader blind linux users text-based tools internet access normal work | [
578,
6761,
788
] | Validation |
2,175 | 3 | Head_Over_Heels_(video_game):head heels video game head heels action-adventure video game released ocean software 1987 several 8-bit home computers subsequently ported wide range formats working title game foot mouth uses isometric engine similar filmation technique first developed ultimate head heels second isometric game jon ritman bernie drummond earlier batman computer game released 1986 1994 another isometric video game ritman drummond monster max released nintendo game boy player controls two characters instead one different abilities head jump higher heels control air fire doughnuts hooter paralyze enemies heels run twice fast head climb certain staircases head carry objects around room bag abilities become complementary player combines together completing roughly sixth game compared predecessors game offers unique revolutionary gameplay complex puzzles 300 rooms explore drummond contributed famously surreal touches including robots controlled push switches bore remarkable resemblance head prince charles body dalek surreal touches include enemies heads elephants staircases made dogs teleport away soon head enters room headus mouthion head footus underium heels two spies planet freedom sent blacktooth liberate enslaved planets penitentiary safari book world egyptus defeat emperor prevent planets falling rule captured separated spies placed prison headquarters castle blacktooth must first escape break market orbiting moonbase teleport planets locate reobtain stolen crowns liberation planets defeat emperor allow head heels return freedom heroes 2003 retrospec released remake head heels microsoft windows mac os x beos linux 2019 piko interactive released atari st port head heels atari jaguar jon ritman re-used modified isometric engine created batman support control 2 players instead 1 modifications made code c64 version lower processor load end little difference versions | [
4759,
578,
680,
638,
4060
] | Train |
2,176 | 9 | Iterator:iterator computer programming iterator object enables programmer traverse container particularly lists various types iterators often provided via container interface though interface semantics given iterator fixed iterators often implemented terms structures underlying container implementation often tightly coupled container enable operational semantics iterator iterator performs traversal also gives access data elements container perform iteration i.e. without significant liberty taken concept trivial use terminology iterator behaviorally similar database cursor iterators date clu programming language 1974 internal iterators higher order functions often taking anonymous functions map reduce etc. implementing traversal across container applying given function every element turn external iterator may thought type pointer two primary operations referencing one particular element object collection called element access modifying points next element called element traversal must also way create iterator points first element well way determine iterator exhausted elements container depending language intended use iterators may also provide additional operations exhibit different behaviors primary purpose iterator allow user process every element container isolating user internal structure container allows container store elements manner wishes allowing user treat simple sequence list iterator class usually designed tight coordination corresponding container class usually container provides methods creating iterators loop counter sometimes also referred loop iterator loop counter however provides traversal functionality element access functionality one way implementing iterators use restricted form coroutine known generator contrast subroutine generator coroutine yield values caller multiple times instead returning iterators naturally expressible generators generators preserve local state invocations 're particularly well-suited complicated stateful iterators tree traversers subtle differences distinctions use terms generator iterator vary authors languages python generator iterator constructor function returns iterator example python generator returning iterator fibonacci numbers using python codice_1 statement follows object-oriented languages c c++ later versions delphi later versions go java later versions lua perl python ruby provide intrinsic way iterating elements container object without introduction explicit iterator object actual iterator object may exist reality exposed within source code language implicit iterators often manifested foreach statement equivalent following python example python iterable object converted iterator iterated loop done implicitly times may created collection object ruby example iteration style sometimes called internal iteration code fully executes within context iterable object controls aspects iteration programmer provides operation execute step using anonymous function languages support list comprehensions similar constructs may also make use implicit iterators construction result list python sometimes implicit hidden nature partial c++ language function templates implicit iteration codice_2 functions still require explicit iterator objects initial input subsequent iteration expose iterator object user iterators useful abstraction input streams – provide potentially infinite iterable necessarily indexable object several languages perl python implement streams iterators alternative implementations stream include data-driven languages awk sed procedural languages common use subscript operator loop counter loop elements sequence array although indexing may also used object-oriented containers use iterators may advantages ability container modified iterating elements become necessary modern object-oriented programming interrelationships objects effects operations may obvious using iterator one isolated sorts consequences assertion must however taken grain salt often efficiency reasons iterator implementation tightly bound container preclude modification underlying container without invalidating containers may move around data memory way invalidate iterator container somehow keep track currently alive iterators update fly since number iterators given time may arbitrarily large comparison size tied container updating drastically impair complexity guarantee container operations alternative way keep number updates bound relatively container size would use kind handle mechanism collection indirect pointers container elements must updated container let iterators point handles instead directly data elements approach negatively impact iterator performance since must effectuate double pointer following access actual data element usually desirable many algorithms using iterators invoke iterators data access operation often advance method therefore especially important iterators efficient data access always trade-off security iterators remain always valid efficiency time added security worth efficiency price pay using alternative container example singly linked list instead vector would better choice globally efficient stability iterators needed iterators categorised according functionality non-exhaustive list iterator categories different languages libraries used languages define iterator types iterators .net framework called enumerators represented codice_3 interface codice_3 provides codice_5 method advances next element indicates whether end collection reached codice_6 property obtain value element currently pointed optional codice_7 method rewind enumerator back initial position enumerator initially points special value first element call codice_5 required begin iterating enumerators typically obtained calling codice_9 method object implementing codice_10 interface container classes typically implement interface however foreach statement c operate object providing method even n't implement codice_10 duck typing interfaces expanded generic versions .net 2.0 following shows simple use iterators c 2.0 c 2.0 also supports generators method declared returning codice_3 codice_10 uses codice_14 statement produce sequence elements instead returning object instance transformed compiler new class implementing appropriate interface c++ language makes wide use iterators standard library describes several categories iterators differing repertoire operations allow include forward iterators bidirectional iterators random access iterators order increasing possibilities standard container template types provide iterators one categories iterators generalize pointers elements array indeed used iterators syntax designed resemble c pointer arithmetic codice_15 codice_16 operators used reference element iterator points pointer arithmetic operators like codice_17 used modify iterators traversal container traversal using iterators usually involves single varying iterator two fixed iterators serve delimit range traversed distance limiting iterators terms number applications operator codice_17 needed transform lower limit upper one equals number items designated range number distinct iterator values involved one convention lower limiting iterator points first element range upper limiting iterator point element range rather beyond end range traversal entire container codice_19 method provides lower limit codice_20 upper limit latter reference element container valid iterator value compared following example shows typical use iterator iterator types separate container types used though two often used concert category iterator thus operations defined usually depends type container instance arrays vectors providing random access iterators sets use linked structure implementation providing bidirectional iterators container type one associated iterator type instance codice_21 container type allows traversal either using raw pointers elements type codice_22 values special type codice_23 yet another type provided reverse iterators whose operations defined way algorithm performing usual forward traversal actually traversal reverse order called reverse iterators containers also provide separate codice_24 type operations would allow changing values pointed intentionally defined simple traversal container object range elements including modification elements unless codice_24 used done using iterators alone container types may also provide methods like codice_26 codice_27 modify structure container methods container class addition require one iterator values specify desired operation possible multiple iterators pointing container simultaneously structure-modifying operations may invalidate certain iterator values standard specifies case whether may using invalidated iterator error lead undefined behvior errors need signalled run time system implicit iteration also partially supported c++ use standard function templates codice_28 codice_29 codice_30 used must initialized existing iterators usually codice_31 codice_32 define range iteration occurs explicit iterator object subsequently exposed iteration proceeds example shows use codice_33 achieved using codice_34 passing codice_35 value third iterator since c++11 lambda function syntax used specify operation iterated inline avoiding need define named function example for-each iteration using lambda function introduced java jdk 1.2 release interface allows iteration container classes codice_36 provides method may optionally support method iterators created corresponding container class typically method named codice_37 codice_38 method advances iterator returns value pointed iterator first element obtained upon first call codice_38 determine elements container visited codice_40 test method used following example shows simple use iterators show codice_40 called repeatedly use insert commas elements last element approach properly separate advance operation actual data access data element must used advance needs stored temporary variable advance needed without data access i.e skip given data element access nonetheless performed though returned value ignored case collection types support codice_42 method iterator removes recently visited element container keeping iterator usable adding removing elements calling methods container also thread makes iterator unusable attempt get next element throws exception exception also thrown elements remaining codice_40 previously returned false additionally similar api allows forward backward iteration provides current index list allows setting list element position j2se 5.0 release java introduced interface support enhanced codice_44 foreach loop iterating collections arrays codice_45 defines method returns codice_36 using enhanced codice_44 loop preceding example rewritten containers also use older since 1.0 codice_48 class provides codice_49 codice_50 methods methods modify container scala iterators rich set methods similar collections used directly loops indeed iterators collections inherit common base trait scala.collection.traversableonce however rich set methods available scala collections library map collect filter etc. often necessary deal iterators directly programming scala java iterators collections automatically converted scala iterators collections respectively simply adding single line import scala.collection.javaconversions._ file javaconversions object provides implicit conversions implicit conversions feature scala methods visible current scope automatically insert calls relevant expressions appropriate place make typecheck otherwise would n't matlab supports external internal implicit iteration using either native arrays codice_51 arrays case external iteration onus user advance traversal request next elements one define set elements within array storage structure traverse elements using codice_44-loop construct example traverses array integers using codice_44 keyword case internal iteration user supply operation iterator perform every element collection many built-in operators matlab functions overloaded execute every element array return corresponding output array implicitly furthermore codice_54 codice_55 functions leveraged performing custom user defined operations native arrays codice_51 arrays respectively example defines primary function codice_57 implicitly applies custom subfunction codice_58 element array using built-in function codice_54 alternatively may desirable abstract mechanisms array storage container user defining custom object-oriented matlab implementation iterator pattern implementation supporting external iteration demonstrated matlab central file exchange item design pattern iterator behavioral written new class-definition syntax introduced matlab software version 7.6 r2008a features one-dimensional codice_51 array realization list abstract data type adt mechanism storing heterogeneous data type set elements provides functionality explicit forward list traversal codice_40 codice_38 codice_63 methods use codice_64-loop php ’ foreach loop introduced version 4.0 made compatible objects values 4.0 beta 4 however support iterators added php 5 introduction internal traversable interface two main interfaces implementation php scripts enable objects iterated via foreach loop iterator iteratoraggregate latter require implementing class declare required methods instead implements accessor method codice_65 returns instance traversable standard php library provides several classes work special iterators php also supports generators since 5.5 simplest implementation wrapping array useful type hinting information hiding methods example class used execution complete foreach loop codice_66 iterator ’ methods executed following order next example illustrates php class implements traversable interface could wrapped iteratoriterator class act upon data returned foreach loop usage together codice_75 constant allows php scripts iterate result sets billions rows little memory usage features exclusive php mysql class implementations e.g pdostatement class implement traversable interface well iterators python fundamental part language many cases go unseen implicitly used codice_44 foreach statement list comprehensions generator expressions python standard built-in collection types support iteration well many classes part standard library following example shows typical implicit iteration sequence python dictionaries form associative array also directly iterated dictionary keys returned items method dictionary iterated yields corresponding key value pairs tuple iterators however used defined explicitly iterable sequence type class built-in function codice_77 used create iterator object iterator object iterated codice_38 function uses codice_79 method internally returns next element container previous statement applies python 3.x python 2.x codice_38 method equivalent codice_81 exception raised elements left following example shows equivalent iteration sequence using explicit iterators user-defined class support standard iteration either implicit explicit defining codice_82 method returns iterator object iterator object needs define codice_79 method returns next element python generators implement iteration protocol ruby implements iterators quite differently iterations done means passing callback closures container methods way ruby implements basic iteration also several patterns iteration like function mapping filters reducing ruby also supports alternative syntax basic iterating method codice_84 following three examples equivalent …and… even shorter ruby also iterate fixed lists using enumerators either calling next method rust implements iterators language iterate element vectors create iterators iterator iterator adapters map filter skip take ... fibonacci custom iterator | [
361,
2176,
5983,
6789,
6172,
993,
109,
5117,
6428,
3368,
6029,
8106,
235,
2619,
5510,
1407,
7032,
6053,
8032,
5965,
1891,
2530,
2355,
1435
] | Test |
2,177 | 3 | Namco_System_246:namco system 246 namco system 246 development sony playstation 2 technology basis arcade system board released december 2000 first game bloody roar 3 like sega naomi widely licensed use manufacturers games battle gear 3 capcom fighting evolution examples system 246-based arcade games namco products namco system 256 upgraded version system 246 upgrades unknown vram faster cpu speeds likely namco super system 256 regular namco system 256 gun board integrated though variant used time crisis 4 namco system 147 similar 246 use dvd-rom drive instead rom chips system board | [
2903,
450,
6330,
7962,
7514,
4761,
6621,
4408,
481,
5055,
746,
7014,
5446,
4718,
602,
2873,
424,
253,
3063,
4011,
4911,
4016,
4748
] | Validation |
2,178 | 0 | Analogical_modeling:analogical modeling analogical modeling formal theory exemplar based analogical reasoning proposed royal skousen professor linguistics english language brigham young university provo utah applicable language modeling categorization tasks analogical modeling related connectionism nearest neighbor approaches data-based rather abstraction-based distinguished ability cope imperfect datasets caused simulated short term memory limits base predictions relevant segments dataset whether near far language modeling successfully predicted empirically valid forms theoretical explanation known see discussion finnish morphology skousen et al 2002 exemplar-based model consists general-purpose modeling engine problem-specific dataset within dataset exemplar case reasoned informative past experience appears feature vector row values set parameters define problem example spelling-to-sound task feature vector might consist letters word exemplar dataset stored outcome phoneme phone generated model presented novel situation form outcome-less feature vector engine algorithmically sorts dataset find exemplars helpfully resemble selects one whose outcome model prediction particulars algorithm distinguish one exemplar-based modeling system another think feature values characterizing context outcome behavior occurs within context accordingly novel situation known given context given known features context engine systematically generates contexts include supracontexts extracts dataset exemplars belong engine discards supracontexts whose outcomes inconsistent measure consistency discussed leaving analogical set supracontexts probabilistically selects exemplar analogical set bias toward large supracontexts multilevel search exponentially magnifies likelihood behavior predicted occurs reliably settings specifically resemble given context performs process case asked evaluate given context consisting n variables used template generate formula_1 supracontexts supracontext set exemplars one variables values given context variables ignored effect view data created filtering criteria similarity given context total set supracontexts exhausts views alternatively supracontext theory task proposed rule whose predictive power needs evaluated important note supracontexts equal peers one another arranged distance given context forming hierarchy supracontext specifies variables another one subcontext one lies closer given context hierarchy strictly branching supracontext subcontext several others several subcontexts hierarchy becomes significant next step algorithm engine chooses analogical set among supracontexts supracontext may contain exemplars exhibit one behavior deterministically homogeneous included view data displays regularity relevant theory never yet disproven supracontext may exhibit several behaviors contain exemplars occur specific supracontext subcontexts case non-deterministically homogeneous included great evidence systematic behavior occurs also counterargument finally supracontext may heterogeneous meaning exhibits behaviors found subcontext closer given context also behaviors ambiguous behavior nondeterministically homogeneous supracontext accepted rejected intervening subcontext demonstrates better theory found heterogeneous supracontext therefore excluded guarantees see increase meaningfully consistent behavior analogical set approach given context analogical set chosen appearance exemplar given exemplar may appear several analogical supracontexts given pointer every appearance exemplar within supracontexts one pointers selected random followed exemplar points provides outcome gives supracontext importance proportional square size makes exemplar likely selected direct proportion sum sizes analogically consistent supracontexts appears course probability predicting particular outcome proportional summed probabilities exemplars support given context formula_2 elements terminology best understood example example used second chapter skousen 1989 context consists three variables potential values 0-3 two outcomes dataset e r exemplars define network pointers like solid lines represent pointers exemplars matching outcomes dotted lines represent pointers exemplars non-matching outcomes statistics example follows behavior predicted given context example let us predict outcome context 3 1 2 first find contexts containing given context contexts called supracontexts find supracontexts systematically eliminating variables given context variables generally formula_19 supracontexts following table lists sub- supracontexts means x means anything contexts shown venn diagram next step determine exemplars belong contexts order determine contexts homogeneous table shows subcontexts behavior terms given exemplars number disagreements within behavior analyzing subcontexts table see 1 subcontext disagreements 3 1 dataset consists 3 1 0 e 3 1 1 r 2 disagreements subcontext 1 pointing exemplars see pointer network pictured therefore supracontexts containing subcontext contain disagreements use simple rule identify homogeneous supracontexts number disagreements supracontext greater number disagreements contained subcontext say heterogeneous otherwise homogeneous 3 situations produce homogeneous supracontext two heterogeneous supracontexts 1 combination non-deterministic 3 1 subcontexts containing r outcome causes heterogeneity actually 4th type homogeneous supracontext contains one non-empty subcontext non-deterministic frequency outcomes sub-context exactly analogical modeling consider situation however 2 reasons next construct analogical set consists pointers outcomes homogeneous supracontexts figure shows pointer network homogeneous contexts highlighted pointers summarized following table 4 pointers analogical set associated outcome e 9 associated r pointer randomly selected outcome points predicted total 13 pointers probability outcome e predicted 4/13 30.8 outcome r 9/13 69.2 create detailed account listing pointers occurrences homogeneous supracontexts see analogical effect instances data set analogy considered useful describing language least since time saussure noam chomsky others recently criticized analogy vague really useful bańko 1991 appeal deus ex machina skousen proposal appears address criticism proposing explicit mechanism analogy tested psychological validity analogical modeling employed experiments ranging phonology morphology linguistics orthography syntax though analogical modeling aims create model free rules seen contrived linguists current form still requires researchers select variables take consideration necessary so-called exponential explosion processing power requirements computer software used implement analogical modeling recent research suggests quantum computing could provide solution performance bottlenecks skousen et al 2002 see pp 45–47 | [
1314,
2882
] | Test |
2,179 | 2 | SliTaz:slitaz slitaz gnu/linux lightweight gnu/linux distribution community-based suitable use older hardware live cd live usb slitaz stands simple light incredible temporary autonomous zone according boot screen slitaz uses openbox window manager additional packages added using program called tazpanel due specific package format slitaz uses tazpkg still use packages popular distribution though debian means first carrying conversion different packages default slitaz offers persistence however still added user wish choice filesystem/bootloader used slitaz importance however persistence available ext2 ext3 filesystems syslinux extlinux boot loader another useful tool tazlito users create livecd based selected packages even based upon current system state slitaz gnu/linux supported machines based i486 x86 intel compatible processors live cd four variants slitaz requiring 192 mb ram core system 48 mb text mode x window system slitaz even run 16 mb ram little swap memory slitaz booted live cd live usb floppy disk local area network pxe installed requiring approximately 80 mb hard disk space tazlito livecd creation utility slitaz gnu/linux check ensure uid zero i.e. tazlito run root root sudoer looks existence etc directory root file system directory n.b. checking ensure anything actually directory however tazlito used livecd creation operations one create/modify directories used tazlito directories existence implies populated properly looks existence boot directory root cd directory n.b. checking ensure anything actually directory however tazlito used livecd creation operations one create/modify directories used tazlito directories existence implies populated properly linux distribution route development slitaz mainly determined coders slitaz 5 major changes seem swapping systemd busybox init udev hence avoiding safety risks implementation qt implementation x64 arm architectures currently development dedoimedo reviewed slitaz gnu/linux 1.0 wrote dedoimedo also reviewed version 2.0 distrowatch wrote distrowatch weekly review slitaz gnu/linux 1.0 | [
362,
5200,
1629,
3444,
7251,
3271,
474,
7075,
1941,
314,
5232,
2758,
7555,
1663,
2864,
3559,
6209,
7954,
6761,
2063,
343,
4824,
5523,
7587,
5259,
1893,
5530,
5704,
6317,
352,
3751,
4207,
6244,
788
] | Test |
2,180 | 1 | List_of_object-relational_mapping_software:list object-relational mapping software list well-known object-relational mapping software up-to-date all-inclusive athena framework open source flex orm native support multitenancy | [
2624,
7156,
2725,
6701,
2186,
7715,
4944,
3961,
3863,
1643,
2660,
5228,
1860,
7920,
3479,
5956,
1309,
5248,
4185,
2702,
6156,
6594,
2623
] | Test |
2,181 | 2 | Resource_allocation_(computer):resource allocation computer computing resource allocation necessary application run system user opens program counted process therefore requires computer allocate certain resources able run resources could access section computer memory data device interface buffer one files required amount processing power computer single processor perform one process time regardless amount programs loaded user initiated start-up computers using single processors appear running multiple programs processor quickly alternates programs processing needed small amounts time process known multitasking time slicing time allocation automatic however higher lower priority may given certain processes essentially giving high priority programs more/bigger slices processor time computer multiple processors different processes allocated different processors computer truly multitask programs adobe photoshop yafray require intense processing power coded able run one processor thus running quickly efficiently method generally suitable multiprogramming environments actually helpful | [
1710,
1237,
4172
] | Test |
2,182 | 3 | L4Linux:l4linux llinux variant linux kernel altered extent run virtualized l4 l4 microkernel l4linux kernel runs service l4linux fork variant binary compatible linux/x86 kernel thus replace linux kernel linux distribution llinux developed dresden real-time operating system project drops allow real-time time-sharing-programs run computer parallel time llinux also allows setting virtualized environment vaguely similar xen kvm couple significant differences intention xen llinux l4android fork llinux encompasses modifications main-line linux kernel android joint project operating systems group dresden university technology chair security telecommunications berlin institute technology | [
4293,
3256,
3613,
5021,
7528,
7532,
5744,
6443,
5396,
7554,
2942,
3978,
6117,
4341,
5762,
412,
5064,
415,
3666,
2970,
7956,
5453,
5460,
7242,
1535,
1924,
6892,
1176,
1933,
1547,
5829,
1208,
6211,
4435,
5865,
7669,
3404,
1227,
1596,
165,
... | Test |
2,183 | 7 | IncrediBuild:incredibuild incredibuild suite grid computing software developed incredibuild ltd. incredibuild designed help accelerate computationally-intensive tasks distributing network notable applications including compiling source code building software generally software development-related tasks jobs distributed several computers network giving possibility accelerating work using resources available initiating computer alone potentially freeing local resources tasks incredibuild tools available microsoft windows linux out-of-the-box support accelerating builds targeting platforms well android nintendo switch playstation 4 xbox one platforms originally sold specifically tool accelerate compiling incredibuild used development processes well general high performance computing incredibuild software suite broken several separately-licensable tools incredibuild visual studio c/c++ provides visual studio integration accelerate builds c c++ projects incredibuild make build tools provides integration several standard build tools including make cmake msbuild incredibuild dev tools provides additional interfaces distributing jobs need necessarily building compiling-related incredibuild several software development companies customers including number video game developers turn 10 studios instance used incredibuild accelerate builds rendering 3ds max code analysis tasks development forza 5 incredibuild also claims epic games electronic arts id software bohemia interactive scaleform corporation fromsoftware bugbear entertainment clients cryengine unreal engine include built-in support build acceleration via incredibuild incredibuild ltd. israeli company based tel aviv incredibuild selling product 2002 introduced incredibuild v1.0 offering solution acceleration microsoft visual studio 6.0 c/c++ code builds incredibuild 1.3 awarded game developer magazine annual front line award category programming year 2003 adding support visual studio .net visual studio 2005 incredibuild later expanded incredibuild time called xge interfaces package allowed customers implement custom acceleration jobs necessarily compilation-related exposing set interfaces incredibuild core grid engine technology 2008 incredibuild productivity award change configuration management category 18th annual jolt awards | [
1361,
4159,
1023,
3915,
4759,
3106,
5571,
578
] | Test |
2,184 | 0 | Interlingual_machine_translation:interlingual machine translation interlingual machine translation one classic approaches machine translation approach source language i.e text translated transformed interlingua i.e. abstract language-independent representation target language generated interlingua within rule-based machine translation paradigm interlingual approach alternative direct approach transfer approach direct approach words translated directly without passing additional representation transfer approach source language transformed abstract less language-specific representation linguistic rules specific language pair transform source language representation abstract target language representation target sentence generated interlingual approach machine translation advantages disadvantages advantages requires fewer components order relate source language target language takes fewer components add new language supports paraphrases input original language allows analysers generators written monolingual system developers handles languages different e.g english arabic obvious disadvantage definition interlingua difficult maybe even impossible wider domain ideal context interlingual machine translation thus multilingual machine translation specific domain first ideas interlingual machine translation appeared 17th century descartes leibniz came theories create dictionaries using universal numerical codes others cave beck athanasius kircher johann joachim becher worked developing unambiguous universal language based principles logic iconographs 1668 john wilkins described interlingua essay towards real character philosophical language 18th 19th centuries many proposals universal international languages developed well known esperanto said applying idea universal language machine translation appear first significant approaches instead work started pairs languages however 1950s 60s researchers cambridge headed margaret masterman leningrad headed nikolai andreev milan silvio ceccato started work area idea discussed extensively israeli philosopher yehoshua bar-hillel 1969 1970s noteworthy research done grenoble researchers attempting translate physics mathematical texts russian french texas similar project metal ongoing russian english early interlingual mt systems also built stanford 1970s roger schank yorick wilks former became basis commercial system transfer funds latter code preserved computer museum boston first interlingual machine translation system 1980s renewed relevance given interlingua-based knowledge-based approaches machine translation general much research going field uniting factor research high-quality translation required abandoning idea requiring total comprehension text instead translation based linguistic knowledge specific domain system would used important research era done distributed language translation dlt utrecht worked modified version esperanto fujitsu system japan method translation interlingua thought way describing analysis text written source language possible convert morphological syntactic semantic even pragmatic characteristics meaning target language interlingua able describe characteristics languages translated instead simply translating one language another sometimes two interlinguas used translation possible one two covers characteristics source language possess characteristics target language translation proceeds converting sentences first language sentences closer target language two stages system may also set second interlingua uses specific vocabulary closer aligned target language could improve translation quality above-mentioned system based idea using linguistic proximity improve translation quality text one original language many structurally similar languages one original analysis principle also used pivot machine translation natural language used bridge two distant languages example case translating english ukrainian using russian intermediate language interlingual machine translation systems two monolingual components analysis source language interlingual generation interlingua target language however necessary distinguish interlingual systems using syntactic methods example systems developed 1970s universities grenoble texas based artificial intelligence 1987 japan research universities southern california carnegie mellon first type system corresponds outlined figure 1. types would approximated diagram figure 4 following resources necessary interlingual machine translation system one problems knowledge-based machine translation systems becomes impossible create databases domains larger specific areas another processing databases computationally expensive one main advantages strategy provides economical way make multilingual translation systems interlingua becomes unnecessary make translation pair pair languages system instead creating formula_1 language pairs formula_2 number languages system necessary make formula_3 pairs formula_2 languages interlingua main disadvantage strategy difficulty creating adequate interlingua abstract independent source target languages languages added translation system different potent interlingua must express possible translation directions another problem difficult extract meaning texts original languages create intermediate representation | [
8057,
4760,
5528,
7474,
7293,
5008
] | Validation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.