node_id int64 0 76.9k | label int64 0 39 | text stringlengths 13 124k | neighbors listlengths 0 3.32k | mask stringclasses 4
values |
|---|---|---|---|---|
4,486 | 9 | HyperTalk:hypertalk hypertalk high-level procedural programming language created 1987 dan winkler used conjunction apple computer hypercard hypermedia program bill atkinson main target audience hypertalk beginning programmers hypertalk programmers usually called authors process writing programs scripting hypertalk scripts resembled written english used logical structure similar pascal programming language hypertalk supported basic control structures procedural languages repeat for/while/until if/then/else well function message handler calls function handler subroutine message handler procedure data types usually need specified programmer conversion happened transparently background strings numbers classes data structures traditional sense place special string literals lists items delimited commas later versions itemdelimiter property allowed choosing arbitrary character late 1980s apple considered using hypercard hypertalk scripting language standard language across company within classic mac os operating system well interprocess communication apple non-apple products company oppose development imitations like supercard created hypertalk standards committee avoid incompatibility language variants case-insensitive language initially interpreted gained just-in-time compilation hypercard 2.0 basic operations including mathematical computations hypertalk favored natural-language ordering predicates ordering used mathematical notation example hypertalk codice_1 assignment command variable placed end statement whereas traditional basic programming language others would accomplished writing hypertalk code side-effect creating variable theresult fly scripts could assign type value variable using codice_1 command making hypertalk weakly typed conversions variable types invisible automatic string 3 could multiplied number 5 produce number 15 number 5 concatenated onto string 3 produce string 35 hypertalk would complain unless types could automatically converted flow control logic generally similar common languages using codice_3 structure conditionals supporting loops based flexible codice_4 syntax comments prefaced two minus signs codice_5 hypercard primary user interface concept card display system emulated index card cards normally used store information similar record conventional flat-file database graphical layout card created using mouse placing various elements card text fields buttons master layout card known background shown behind transparent areas card objects placed background fields buttons would shared common layout among several cards card-specific content collection cards backgrounds associated data stored stored single file known stack cards collectively data-containing objects referred containers hypertalk functions scripts normally stored within codice_6 property available many stack containers scripts could access properties container corresponding instance variables using codice_7 codice_8 instructions script property held plain text special properties scripts could placed run text container including string variables imported stacks using codice_9 command script could even user-provided text typed on-screen text field arbitrary text could executed using codice_10 command manner similar dynamic sql key concept hypertalk way referred containers navigational system based visual hierarchy stack every container stack given unique id number created could also given name scripts could refer objects using either identifiers along object type specified using codice_11 operator operator used natural language syntax making easily readable self-documenting code instance script stored button card might wish take user-supplied text gathered using text field store text variable called thevalue various contextual aspects statements could inferred interpreter statement example script would running context button specific card identifier card understood refer card user interacting addition value text submitted user assumed main property target operations otherwise specified likewise card field assumed target command opposed background field information could also omitted even container types short forms programmers could use save typing thus code equivalent shorter form objects within given context—the card background instance—were also given runtime number based z-order screen assist using position navigation hypertalk also included variety ordinal cardinal referencing systems simplify syntax assuming field typehere field card code could also written choice addressing style left programmer often different styles used different statements order make code readable hypertalk included codice_12 container acted fashion codice_13 qualifier found object-oriented languages allowing simple access current container object less common codice_14 variable held value last operation certain built-in operators example uses codice_15 command display dialog box capture text typed accompanying text field dialog completed hitting clicking value assigned codice_14 pseudo-variable code copies value card field using codice_1 assignment operator containers given type also available collections pluralized version container type name—the collection fields card codice_18 collections containers properties key among codice_19 property widely used iterations similar tasks instance one wanted hide fields card could accomplished code code exposes another common feature hypertalk property might several names operators case codice_20 command associated codice_21 act setting value container codice_22 property thus codice_23 exactly equivalent codice_24 similar example codice_25 command stopped visual updating short form codice_26 codice_27 property hypercard itself—also container many examples sort syntactic sugar found hypertalk order simplify syntax improve readability common code hypercard 2.2 later collection collections also available container codice_28 allowed script address objects container single iterator notable feature hypertalk container model handling text every collection text whether literal string program text typed text field considered container multiple collections containers within allowed scripts parse text using navigational commands container instance parsing space-delimited data file one might want extract third column like syntax allowed script walk text find particular data example process treating text container known chunking functions chunk expressions sorts expressions used handle file manipulation along set file management functions following code opens known file reads extracts data closes file hypertalk also included functions chunking strings using substring-find operation using codice_29 operator following code finds examples given pattern using codice_29 part codice_31 loop codice_32 finds location pattern within string hypertalk used chunking system produce structures like arrays lists structure would created placing multiple data items variable separated commas various types data could imported hypertalk script using strings would get parsed required instance position objects screen defined pair numbers representing x coordinates relative upper left corner following code creates variable called pos holds coordinate pair manipulates re-position buttons card diagonal top-left bottom-right codice_33 chunking expression originally based comma delimiter later versions hypercard changed value codice_34 offering ability parse arbitrary lists structures hypertalk used object-oriented concept calling scripts objects stack sending events would processed handlers declared interest receiving events using codice_35 syntax instance gui containers could send codice_36 event mouse button clicked released top container script could capture events like events first sent script object created event instance user clicked button codice_36 event first sent button button script object codice_36 handler script passed card background stack stacks whose scripts explicitly imported using codice_9 command home stack user-selected always-open hypercard stack finally hypercard application many simple events like mouse clicks buttons script would placed directly within object question button instance one might use example code within button handler fashion case code called multiple locations used global handler event script could determine original sender event using codice_40 function likewise scripts could send events containers using codice_41 command using navigational code refer container holding handlers code combining hypertalk string processing codice_10 command allowed construction interactive interpreters placing text field card placing code field script codice_43 global property returns name line number last field clicked form like line 10 card field 4 code first selects text clicked line extracts line number local variable uses codice_10 run text hypercard script codice_45 message sent button user clicked codice_36 sent user released mouse inside trigger action similarly hypercard sent periodic codice_47 message codice_48 codice_49 ... various messages related navigation different cards hypercard stack well user input codice_50 codice_51 ... system events far scripters concerned main event loops like procedural programming languages unlike general rapid application development platforms hypercard stacks always looked like stacks menu bar hypercard programmer default—scripting could add delete modify menus single window fixed size early versions certain cases commands central operation part application directly available hypertalk good example creation new cards part application directly accessible hypertalk language new card could created using new card menu item could simulated code usingcodice_52 hypertalk called menu commands menu commands also invoked handlers hypertalk run custom code copy menu item selected one would place script stack using codice_53 handler examine codice_54 see copy hypertalk also provided script control built-in drawing tools simply scripting needed changes paint tools simulating mouse movements using codice_55 codice_56 commands although hypertalk language languished like hypercard received second lease life plugin protocol so-called external commands xcmds external functions xfcns native code containers attached stacks macintosh-specific resources single entry point return value xcmds xfcns could called like regular message function handlers hypertalk scripts also able send messages back hypercard application enterprising xcmd authors added advanced features like full color support colorizehc hypertint addcolor multiple special-purpose windows prompt tabloid textoid listoid showdialog megawindows drag drop support various hardware interfaces language various scripting languages taken cues hypertalk commonly regrouped loosely defined family named xtalk well second-level clones like many method names first popularized hypertalk made later languages codice_57 event handler javascript although asymetrix toolbook often also considered hypercard clone scripting language apparently bears little resemblance hypertalk clones dialects commonly referred moniker xtalk-languages added various features language expected modern programming language like exception handling user-defined object properties timers multi-threading even user-defined objects | [
9345,
3462,
6791,
2571,
8973,
655,
5395,
8854,
544,
8225,
8609,
6958,
10030,
9780,
1973,
576,
10435,
6085,
8262,
8524,
2768,
11219,
11228,
9185,
2658,
4844,
1389,
10097,
9209,
2556,
4989
] | Test |
4,487 | 4 | M86_Security:m86 security m86 security privately owned internet threat protection company specialized web email security products content filtering appliances company international headquarters located basingstoke development centers located california israel new zealand founded 1995 company changed name 8e6 technologies 2000 co-founder ceo ten years george shih developed many technologies used 8e6 internet filtering products originally effort provide “ pornography-free internet use children ” company offered filtering software computers used education environments later 8e6 technologies developed products manage internet access markets company internet filtering reporting monitoring appliances named “ best buy ” sc magazine 2007 2008 november 2008 8e6 technologies marshal limited provider email web security products merged became marshal8e6 george shih remained interim ceo former finjan ceo john vigouroux named position april 2009 november 2008 8e6 technologies company sold web filtering products marshal software provider integrated email web security products merged form marshal8e6 march 2009 marshal8e6 acquired avinti along behavior-based malware technology detecting blended threats occur email upon completion merger avinti ceo william kilmer joined marshal8e6 chief marketing officer part rebranding campaign marshal8e6 changed name m86 security september 2009 following november m86 security acquired finjan software along secure web gateway formerly finjan vital security product licenses patents real-time code analysis technology giving company malware detection prevention capabilities web gateway company previously announced john vigouroux ceo finjan software new ceo m86 security marshal trace labs finjan malicious code research center combined form m86 security labs researches reports web email-based security threats august 2010 m86 ranked number 1,230 inc. 5000 annual listing fastest private growing companies america march 6 2012 announced chicago based trustwave holdings would acquire m86 security march 19 2012 trustwave completed acquisition m86 security subsequently rebranded products operations trustwave name | [
612,
3941,
6707,
2325,
4725,
4471,
10745,
7515,
9215
] | Test |
4,488 | 4 | R-U-Dead-Yet:r-u-dead-yet r.u.d.y. short r u dead yet acronym used describe denial service dos tool used hackers perform slow-rate a.k.a “ low slow ” attacks directing long form fields targeted server known interactive console thus making user-friendly tool opens fewer connections website targeted long period keeps sessions open long feasible amount open sessions overtires server website making unavailable authentic visitors data sent small packs incredibly slow rate normally gap ten seconds byte intervals definite may vary avert detection victim servers types attacks may face issues able access particular website disrupt connection drastically slow network performance etc hackers use attacks different purposes targeting different servers hosts purposes include limited blackmail vengeance sometimes even activism rudy attack opens concurrent post http connections http server delays sending body post request point server resources saturated attack sends numerous small packets slow rate keep connection open server busy low-and slow attack behavior makes relatively difficult detect compared flooding dos attacks raise traffic volume abnormally | [
225,
2754,
9282,
2409,
6347,
2060,
6735,
11351,
953
] | Test |
4,489 | 4 | Resilient_control_systems:resilient control systems modern society computerized digital control systems used reliably automate many industrial operations take granted power plant automobiles drive however complexity systems designers integrate roles responsibilities humans interact systems cyber security highly networked systems led new paradigm research philosophy next generation control systems resilient control systems consider elements disciplines contribute effective design cognitive psychology computer science control engineering develop interdisciplinary solutions solutions consider things tailor control system operating displays best enable user make accurate reproducible response design cyber security protections system defends attack changing behaviors better integrate widely distributed computer control systems prevent cascading failures result disruptions critical industrial operations context cyber-physical systems resilient control systems aspect focuses unique interdependencies control system compared information technology computer systems networks due importance operating critical industrial operations originally intended provide efficient mechanism controlling industrial operations development digital control systems allowed flexibility integrating distributed sensors operating logic maintaining centralized interface human monitoring interaction ease readily adding sensors logic software done relays isolated analog instruments led wide acceptance integration systems industries however digital control systems often integrated phases cover different aspects industrial operation connected network leading complex interconnected interdependent system control theory applied often nothing digital version analog counterparts dependence digital control systems upon communications networks precipitated need cybersecurity due potential effects confidentiality integrity availability information achieve resilience next generation control systems therefore addressing complex control system interdependencies including human systems interaction cyber security recognized challenge research resilience engineering last decade focused two areas organizational information technology organizational resilience considers ability organization adapt survive face threats including prevention mitigation unsafe hazardous compromising conditions threaten existence information technology resilience considered number standpoints networking resilience considered quality service computing considered issues dependability performance face unanticipated changes however based upon application control dynamics industrial processes functionality determinism primary considerations captured traditional objectives information technology considering paradigm control systems one definition suggested resilient control systems tolerate fluctuations via structure design parameters control structure control parameters however definition taken perspective control theory application control system consideration malicious actor cyber security directly considered might suggest definition effective reconstitution control attack intelligent adversaries proposed however definition focuses resilience response malicious actor consider cyber-physical aspects control system definition resilience considers benign malicious human interaction addition complex interdependencies control system application use term “ recovery ” used context resilience paralleling response rubber ball stay intact force exerted recover original dimensions force removed considering rubber ball terms system resilience could defined ability maintain desired level performance normalcy without irrecoverable consequences resilience context based upon yield strength ball control systems require interaction environment namely sensors valves pumps make industrial operation reactive environment control systems require awareness state make corrective changes industrial process maintain normalcy mind consideration discussed cyber-physical aspects human systems integration cyber security well definitions resilience broader critical infrastructure level following deduced definition resilient control system considering flow digital control system basis resilient control system framework designed referring left side fig 1 resilient control system holistically considers measures performance normalcy state space center understanding performance priority provide basis appropriate response combination human automation embedded within multi-agent semi-autonomous framework finally right information must tailored consumer address need position desirable response several examples scenarios resilience differs provides benefit control system design available literature primary tenets resilience contrasted traditional reliability presented considering integrated approach resilient control systems cyber-physical tenants complement fundamental concept dependable reliable computing characterizing resilience regard control system concerns including design considerations provide level understanding assurance safe secure operation industrial facility tenants discussed individually summarize challenges address order achieve resilience benign human ability quickly understand novel solutions provide ability adapt unexpected conditions behavior provide additional resilience control system reproducibly predicting human behavior continuing challenge ability capture historic human preferences applied bayesian inference bayesian belief networks ideally solution would consider direct understanding human state using sensors eeg considering control system design interaction goal would tailor amount automation necessary achieve level optimal resilience mixed initiative response presented human would actionable information provides basis targeted reproducible response contrast challenges prediction integration benign human control systems abilities malicious actor hacker undermine desired control system behavior also create significant challenge control system resilience application dynamic probabilistic risk analysis used human reliability provide basis benign actor however decidedly malicious intentions adversarial individual organization nation make modeling human variable objectives motives however defining control system response intentions malicious actor looks forward level recognized behavior gain advantage provide pathway undermining system whether performed separately preparation cyber attack system behaviors provide opportunity successful attack without detection therefore considering resilient control system architecture atypical designs imbed active passively implemented randomization attributes would suggested reduce advantage much current critical infrastructure controlled web interconnected control systems either architecture termed distributed control systems dcs supervisory control data acquisition scada application control moving toward decentralized state moving smart grid complex interconnected nature individual homes commercial facilities diverse power generation storage creates opportunity challenge ensuring resulting system resilient threats ability operate systems achieve global optimum multiple considerations overall efficiency stability security require mechanisms holistically design complex networked control systems multi-agent methods suggest mechanism tie global objective distributed assets allowing management coordination assets optimal benefit semi-autonomous constrained controllers react rapidly maintain resilience rapidly changing conditions establishing metric capture resilience attributes complex least considered based upon differences interactions interdependencies evaluating control cyber cognitive disturbances especially considered disciplinary standpoint leads measures already established however metric instead based upon normalizing dynamic attribute performance characteristic impacted degradation alternative suggested specifically applications base metrics resilience characteristics given follows type disturbance performance characteristics exist time data integrity time terms delay mission communications latency data terms corruption modification normalizing factors general idea base metric “ expected ” necessarily actual initiator degradation considering time metrics basis resilient un-resilient systems observed fig 2 dependent upon abscissa metrics chosen fig 2 reflects generalization resiliency system several common terms represented graphic including robustness agility adaptive capacity adaptive insufficiency resiliency brittleness overview definitions terms following explanations provided abscissa fig 2 recognized cyber cognitive influences affect data time underscores relative importance recognizing forms degradation resilient control designs cybersecurity single cyberattack degrade control system multiple ways additionally control impacts characterized indicated terms fundamental seem little value correlating impact terms like cost development use cases provide means relevance codified example given impact system dynamics data performance control loop directly ascertained show approach instability operational impact nature control systems implies starting point development resilience metrics control physical process based upon quantifiable performance measures including first principles stochastic ability provide measurement basis correlating operational performance adaptation also becomes starting point correlation data time variations come cognitive cyber-physical sources effective understanding based upon developing manifold adaptive capacity correlates design operational buffer power system manifold based upon real reactive power assets controllable latitude maneuver impact disturbances time modern distribution system mds assets aggregated individual contributions shown fig 3 figure assets include battery b alternate tie line source c asymmetric p/q-conjectured source distribution static synchronous compensator dstatcom e low latency four quadrant source energy limit 1 considering current digital control system designs cyber security systems dependent upon considered border protections i.e. firewalls passwords etc malicious actor compromised digital control system industrial operation man-in-the-middle attack data corrupted control system industrial facility operator would way knowing data compromised someone security engineer recognized attack occurring operators trained provide prompt appropriate response stabilize industrial facility likelihood corrupt data would lead operator reacting situation lead plant upset resilient control system per fig 1 cyber physical data fused recognize anomalous situations warn operator 2 society becomes automated variety drivers including energy efficiency need implement ever effective control algorithms naturally follow however advanced control algorithms dependent upon data multiple sensors predict behaviors industrial operation make corrective responses type system become brittle insofar unrecognized degradation sensor lead incorrect responses control algorithm potentially worsened condition relative desired operation industrial facility therefore implementation advanced control algorithms resilient control system also requires implementation diagnostic prognostic architectures recognize sensor degradation well failures industrial process equipment associated control algorithms world advancing automation dependence upon advancing technologies skill sets needed keep united states forefront innovation challenges may appear rooted design better means better control infrastructures greater safety efficiency generation use energy however evolution technologies developed achieve current design automation achieved complex environment cyber-attack human error design operation damaging storm wreak havoc infrastructure depend nation next generation systems need consider broader picture ensure path forward failures lead ever greater catastrophic events critical resource students tomorrow expected advance designs require perspective challenges contributions others fulfill need addressing need courses developed provide perspectives relevant examples overview issues provide opportunity create resilient solutions universities george mason university northeastern tie critical infrastructure operations important aspect courses development technologies designed set stage next generation automation become evident effective teams comprised several disciplines however developing level effectiveness time consuming done professional environment expend lot energy time provides little obvious benefit desired outcome clear earlier stem disciplines successfully integrated effective recognizing ’ contributions working together achieve common set goals professional world team competition venues resilience week natural outcome developing environment allowing interdisciplinary participation providing exciting challenge motivate students pursue stem education standards policy define resilience nomenclature metrics needed establish value proposition investment includes government academia industry ieee industrial electronics society taken lead forming technical committee toward end purpose committee establish metrics standards associated codifying promising technologies promote resilience automation effort distinct supply chain community focus resilience security efforts iso nist | [
5002,
4081,
4863,
9688,
5373,
8095
] | None |
4,490 | 7 | Client_(computing):client computing client computer program part operation relies sending request another program computer hardware software accesses service made available server may may located another computer example web browsers clients connect web servers retrieve web pages display email clients retrieve email mail servers online chat uses variety clients vary depending chat protocol used multiplayer video games online video games may run client computer term client may also applied computers devices run client software users use client software client part client–server model still used today clients servers may computer programs run machine connect via inter-process communication techniques combined internet sockets programs may connect service operating possibly remote system internet protocol suite servers wait potential clients initiate connections may accept term first applied devices capable running stand-alone programs could interact remote computers via network computer terminals clients time-sharing mainframe computer one classification client computers devices either thick clients thin clients hybrid clients thick client also known rich client fat client client performs bulk data processing operations necessarily rely server personal computer common example fat client relatively large set features capabilities light reliance upon server example computer running art program krita sketchup ultimately shares result work network thick client computer runs almost entirely standalone machine save send receive files via network standard called workstation thin client minimal sort client thin clients use resources host computer thin client generally presents processed data provided application server performs bulk required data processing device using web application office web apps thin client hybrid client mixture two client models similar fat client processes locally relies server storing persistent data approach offers features fat client multimedia support high performance thin client high manageability flexibility device running online version video game diablo iii example hybrid client | [
5125,
4623,
10258,
531,
5652,
7188,
3094,
5146,
8731,
2076,
2080,
545,
7204,
4135,
8747,
5677,
559,
8760,
10816,
5188,
71,
5199,
7761,
1107,
5205,
3670,
6231,
6746,
3676,
6237,
8797,
10341,
3692,
9332,
4725,
5749,
119,
2169,
1664,
5251,
... | Train |
4,491 | 3 | Advanced_Synchronization_Facility:advanced synchronization facility advanced synchronization facility asf proposed extension x86-64 instruction set architecture adds hardware transactional memory support introduced amd latest specification dated march 2009. still proposal stage released microprocessors implement extension asf provides capability start end abort transactional execution mark cache lines protected memory access transactional code regions contains four new instructions—codice_1 codice_2 codice_3 codice_4—and turns otherwise invalid codice_5-prefixed codice_6 codice_7 codice_8 instructions valid ones inside transactional code regions 256 levels nested transactional code regions supported codice_1 codice_2 instructions mark start end transactional code region inside transactional code regions codice_5-prefixed codice_12 codice_7 codice_8 instructions mark four cache lines protected memory access accesses processor cores protected cache lines result exceptions turn cause transaction aborts stores protected cache lines must performed using codice_15 instructions marked cache lines released protection codice_4 instruction transaction aborts generated hardware explicitly requested codice_3 instruction rolls back modifications protected cache lines restarts execution instruction following top-level codice_1 instruction | [
2821,
6924,
4237,
7313,
6038,
9369,
9500,
2088,
9391,
8120,
8506,
2237,
1085,
8125,
8126,
833,
7234,
9541,
3142,
5326,
977,
2514,
3537,
2516,
5844,
9428,
7387,
4444,
8795,
3294,
2655,
1122,
7783,
10985,
5356,
9964,
5358,
9582,
8944,
10734... | Train |
4,492 | 2 | Dartmouth_Time_Sharing_System:dartmouth time sharing system dartmouth time-sharing system dtss operating system first developed dartmouth college 1963 1964 first successful large-scale time-sharing system implemented also system basic language developed dtss developed continually next decade reimplemented several generations computers finally shut 1999 professors john kemeny thomas kurtz dartmouth college purchased royal mcbee lgp-30 computer around 1959 programmed undergraduates assembly language kurtz four students programmed dartmouth algol 30 compiler implementation algol 58 programming language two students evolved scalp self contained algol processor language 1962-1964 kemeny freshman sidney marshall collaborated create dartmouth oversimplified programming experiment dope used large freshman courses kurtz approached kemeny either 1961 1962 following proposal dartmouth students would access computing free open-access could accomplished via creating time-sharing system kurtz learned colleague john mccarthy mit suggested n't guys timesharing although stated dtss inspired pdp-1-based time-sharing system bolt beranek newman evidence true 1962 kemeny kurtz submitted proposal development new time-sharing system nsf ultimately funded 1964 sufficient assurance dartmouth nsf would support system signed contract ge began preliminary work 1963 proposal funded particular evaluated candidate computers bendix ge ibm settled upon ge-225 system paired datanet-30 communications processor two-processor approach unorthodox kemeny later recalled time many experts ge elsewhere tried convince us route two-computer solution wasteful inefficient essence datanet-30 provided user-interface scheduler user programs ran ge-225 implementation began 1963 student team direction kemeny kurtz aim providing easy access computing facilities members college ge-225 datanet-30 computers arrived february 1964 became operational mid march may 1 1964 4:00 a.m. system began operations autumn 1964 hundreds freshman students began use system via 20 teletypes access hanover high school via one additional teletype later autumn ge-225 computer replaced faster ge-235 computer minimal issues summer 1965 system could support forty simultaneous users dartmouth document october 1964 later revised ge describes overall dtss architecture dtss design emphasized immediate feedback kemeny kurtz observed response time averages 10 seconds destroys illusion one computer consequence many dtss users believed terminal computer educational aims ease use priority dtss design dtss implemented world first integrated design environment ide line typed user beginning line number added program replacing previously stored line number anything else taken command immediately executed lines consisted solely line number n't stored remove previously stored line number method editing provided simple easy use service allowed large numbers teleprinters terminal units dartmouth timesharing system ide commands included commands often believed part basic language users fact part time sharing system also used preparing algol fortran programs via dtss terminals kemeny kurtz originally hoped ge would enter research partnership end kurtz student anthony knapp authored document proposed system design presented ge phoenix office 1962 however ge rejected partnership october 1962 proposal dartmouth framed solely commercial sale said ge dartmouth promoted operational dartmouth time sharing system october 1964 fall joint computer conference san francisco three teletypes connected dartmouth system hanover.. december 1964 january 1965 two dartmouth students installed working copies dtss basic ge computers phoenix early 1965 ge began advertise timesharing services ge-265 system ge 235 datanet 30 including basic dartmouth algol later renaming ge mark time-sharing system next years ge opened 25 computer centers united states elsewhere serving fifty thousand users computer history museum corporate histories collection describes ge mark history way 1966-1968 dtss reimplemented ge 635 still using datanet-30 terminal control ge 635 system delivered november 1966 october 1967 providing service based phase software jointly developed dartmouth ge ge subsequently marketed ge mark ii system parallel work dartmouth embarked 1967 development phase ii direction professor john kemeny programming carried students faculty phase ii dartmouth time-sharing system replaced phase 1st april 1969 dartmouth described 1969 new dtss architecture influenced three criteria new version completely different internally earlier dtss provided near-identical user interface enable smooth transition users course materials 635 version provided interactive time-sharing nearly 300 simultaneous users 1970s large number time operated eleven commercial academic sites u.s.a. canada europe evolved 1970s later versions moved honeywell 6000 series mainframes 1973 honeywell 716 communication processors 1974 1976 ge-635 system replaced honeywell 66/40a computer remained operation end 1999 dtss version 2 included novel form inter-process communication called communication files significantly antedated unix pipes design documents put conceptual origin sometime 1967 described briefly 1969 conference communication files supported read write close operations also synchronous asynchronous data transfer random access status inquiries out-of-band signaling error reporting access control precise semantics operation determined master process douglas mcilroy notes communication files akin plan 9 9p protocol familiar io notable application communication files support multi-user conferences behaved somewhat like conference phone calls implemented entirely user-space application programs mentioned hanover high school connected dtss system beginning next decade many high schools colleges connected dtss via kiewit network named peter kiewit donor funds kiewit computation center housed dtss computers staff schools connected dtss via one teletypes modems dial-up telephone lines time dartmouth ran active programs engage train high school teachers using computation within courses 1967 following high schools joined kiewit network hanover high school holderness school mascoma valley regional high school kimball union academy mount hermon school phillips andover academy phillips exeter academy st. paul school vermont academy.. group expanded dartmouth secondary school project funded nsf 1967-1968 added following new england high schools cape elizabeth high school concord high school hartford high school vermont keene high school lebanon high school loomis school manchester central high school rutland high school st. johnsbury academy south portland high school timberlane high school 1968-1970 dartmouth added number colleges kiewit network via regional college consortium included bates college berkshire community college bowdoin college colby junior college middlebury college mount holyoke college new england college norwich university university vermont vermont technical college 1971 kiewit network connected 30 high schools 20 colleges new england new york new jersey time dtss supporting 30,000 users 3,000 dartmouth college 1973 kiewit network expanded include schools illinois michigan upstate new york ohio montreal canada kemeny kurtz intended students technical nontechnical fields use dtss arranged second trimester freshman mathematics class include requirement writing debugging four dartmouth basic programs 1968 80 dartmouth students experience computer programming 80 classes included official computer use including engineering classics geography sociology spanish 57 dtss use courses 16 research 27 casual use entertainment university stated sense regarded frivolous kemeny kurtz believed activities encouraged users become familiar fear computer pleased find 40 faculty members—not technical fields—used dtss many students continued using system longer required kemeny wrote brochure describing system student could enter library borrow book without asking permission explaining purpose student may walk kiewit computation center sit console use time-sharing system one ask solving serious research problem homework easy way playing game football writing letter girlfriend 1967–68 school year dtss library 500 programs including kemeny kurtz reported many games addition 2,600 dartmouth users 5,550 people ten universities 23 high schools accessed dtss early 1970s campus 150 terminals 25 buildings including portable units patients campus infirmary 2,000 users logged dtss day 80 students 70 faculty used system year off-campus dartmouth educational time-sharing network included users 79 terminals 30 high schools 20 universities including middlebury college phillips andover mount holyoke college goddard college u.s merchant marine academy bates college dartmouth club new york dartmouth affiliate jersey city new jersey sharing dtss dartmouth people basic change system remained compatible older applications kemeny reported 1974 programs written 1964 would still run system allowed email-type messages passed users real-time chat via precursor unix talk program 1980 supported languages systems included 2000 project recreate dtss system simulator undertaken result dtss available microsoft windows systems apple macintosh computer | [
512,
6675,
7187,
10776,
25,
8732,
4637,
9762,
5158,
557,
7217,
9784,
10809,
576,
8262,
1610,
1611,
9804,
9298,
10333,
97,
6242,
8298,
6772,
7285,
9335,
2168,
1147,
3197,
1150,
2179,
10883,
6797,
9366,
6296,
7325,
9887,
10400,
3248,
6837,
... | None |
4,493 | 3 | Linux-libre:linux-libre linux-libre operating system kernel gnu package gnu project attempts keep linux-libre synchronization upstream development linux kernel removing software include source code source code obfuscated released proprietary license software components available source code called binary blobs mostly used proprietary firmware images linux kernel generally redistributable binary blobs give user freedom audit modify consequently redistribute modified versions linux kernel started include binary blobs 1996 work clear binary blobs began 2006 gnewsense find-firmware gen-kernel work taken blag linux distribution 2007 deblob linux-libre born linux-libre first released free software foundation latin america fsfla endorsed free software foundation fsf valuable component totally free linux distributions became gnu package march 2012 alexandre oliva project maintainer removal process achieved using script called deblob-main script inspired one used gnewsense jeff moe made subsequent modifications meet certain requirements use blag linux gnu distribution another script called deblob-check used check kernel source file patch compressed sources file still contains software suspected proprietary aside primary intended effect running system free software practical consequences removing device firmware user allowed study modify positive negative effects advantages include removal device firmware audited bugs security problems malicious operations backdoors fixed linux kernel maintainers even know possible entire system compromised malicious firmware without ability perform security audit manufacturer-provided firmware even innocent bug could undermine safety running system downside removing proprietary firmware kernel cause loss functionality certain hardware free software replacement available affects certain sound video tv tuner network especially wireless cards well devices possible free software replacement firmware provided substitute openfwwf b43 carl9170 ath9k_htc wireless card drivers source code precompiled packages deblobbed linux kernel available directly distributions use linux-libre scripts freed-ora subproject prepares maintains rpm packages based fedora also precompiled packages debian derived distributions ubuntu distros n't use packaged linux-libre instead completely deblob proprietary linux kernel tools make linux-libre source compiled resulting free linux kernel used default systems distributions linux default kernel used propose linux-libre alternative kernel | [
2560,
2050,
1028,
4616,
3082,
5644,
5139,
9237,
6680,
10780,
4637,
10785,
3618,
6180,
9257,
2044,
1584,
8242,
9266,
9780,
59,
4161,
4673,
7234,
8258,
6213,
8262,
5703,
8772,
10817,
10822,
8268,
589,
593,
2134,
1112,
3162,
3674,
2658,
1085... | Test |
4,494 | 4 | Default_Credential_vulnerability:default credential vulnerability default credential vulnerability type vulnerability commonly found affect devices like modems routers digital cameras devices pre-set default administrative credentials access configuration settings vendor manufacturer devices uses single pre-defined set admin credentials access device configurations potential hacker misuse fact hack devices credentials changed consumers several proof-of-concept poc well real world worms running across internet configured search systems set default username password voyager alpha force zotob myspooler examples poc malware scans internet specific devices try login using default credentials real world many new malware including mirai using vulnerability using compromised devices carrying distributed denial service ddos attacks one particular incident hacker able gain access control large number networks including university maryland baltimore county imagination capital market strategies l leveraging fact using default credentials netgear switch | [
612,
5636,
2409,
1803,
11198,
3807
] | None |
4,495 | 4 | Smurf_attack:smurf attack smurf attack distributed denial-of-service attack large numbers internet control message protocol icmp packets intended victim spoofed source ip broadcast computer network using ip broadcast address devices network default respond sending reply source ip address number machines network receive respond packets large victim computer flooded traffic slow victim computer point becomes impossible work original smurf.c written dan moschuk aka tfreak late 1990s many ip networks would participate smurf attacks prompted would respond icmp requests sent broadcast addresses name comes idea small numerous attackers overwhelming much larger opponent see smurfs today administrators make network immune abuse therefore networks remain vulnerable smurf attacks fix two-fold another proposed solution network ingress filtering rejects attacking packets basis forged source address example configuring router forward packets broadcast addresses cisco router smurf amplifier computer network lends used smurf attack smurf amplifiers act worsen severity smurf attack configured way generate large number icmp replies victim spoofed source ip address fraggle attack variation smurf attack attacker sends large amount udp traffic ports 7 echo 19 chargen ip broadcast address intended victim spoofed source ip address works similarly smurf attack many computers network respond traffic sending traffic back spoofed source ip victim flooding traffic source code attack also released tfreak | [
2947,
6667,
2960,
11413,
5402,
933,
939,
1965,
6834,
2240,
6735,
3024,
849,
4689,
10852,
2408,
2409,
8692,
2299
] | Test |
4,496 | 4 | Gordon–Loeb_model:gordon–loeb model gordon–loeb /ˈgȯr-dən ˈlōb/ model mathematical economic model analyzing optimal investment level information security investing protect company data involves cost unlike investments usually generate profit however serve prevent additional costs thus important compare expensive protect specific set data potential loss case said data stolen lost damaged corrupted draft model company must possess knowledge three parameters much data worth much data risk probability attack data going successful last parameter gordon loeb defined vulnerability product said parameters provides medium money loss security investment model gather amount money company spends protecting information cases small fraction predicted loss example expected value loss following security breach specifically model shows generally inconvenient invest informatics security including cybersecurity computer security related activities amounts higher 37 predicted loss gordon–loeb model also shows specific level potential loss amount resources invest order protect information set always increase increase vulnerability said set thus companies enjoy greater economic returns investing cyber/information security activities aimed increase security data sets medium level vulnerability words investment safeguarding company data reduces vulnerability decreasing incremental returns example suppose estimated data value 1.000.000 euros attack probability 15 80 chance attack would successful case potential loss given product 1.000.000 euros x 0.15 x 0.8 120.000 euros according gordon loeb company investment security exceed 120.000 euros x 0.37 44.000 euros gordon–loeb model first published lawrence a. gordon martin p. loeb 2002 paper acm transactions information system security entitled economics information security investment paper reprinted 2004 book economics information security gordon loeb professors university maryland robert h. smith school business gordon–loeb model one well accepted analytical models economics cyber/information security literature model widely referenced academic practitioner literature model also empirically tested several different settings research mathematicians marc lelarge yuliy baryshnikov generalized results gordon–loeb model gordon–loeb model featured popular press wall street journal financial times | [
2750,
5373,
2558,
5636
] | Test |
4,497 | 4 | Gardening_(cryptanalysis):gardening cryptanalysis cryptanalysis gardening act encouraging target use known plaintext encrypted message term used british government code cypher school bletchley park england world war ii schemes entice germans include particular words british called cribs encrypted messages term presumably came raf minelaying missions gardening sorties gardening standard raf slang sowing mines rivers ports oceans low heights possibly sea area around european coasts given code-name flowers vegetables technique claimed effective messages produced german navy enigma machines germans recently swept particular area mines analysts bletchley park need cribs might apparently several occasions request area mined would hopefully evoke encrypted messages local command mentioning minen german mines and/or location perhaps messages also headquarters minesweeping ships assign location mentioning worked often enough try several times crib-based decryption example chosen-plaintext attack plain text effectively chosen british injected ciphertext | [
9156,
1941,
11119
] | None |
4,498 | 4 | HTTP_Flood:http flood http flood type distributed denial service ddos attack attacker manipulates http post unwanted requests order attack web server application attacks often use interconnected computers taken aid malware trojan horses instead using malformed packets spoofing reflection techniques http floods require less bandwidth attack targeted sites servers http flood http clients web browser interact application server send http requests request either “ get ” “ post ” aim attack compel server allocate many resources possible serving attack thus denying legitimate users access server resources get request used retrieve static content like images typically induces relatively low load server per request post requests likely require server perform kind processing looking items database therefore http post flood attacks typically impose higher load server per request http flood attacks use standard url requests hence quite challenging differentiate valid traffic one effective mitigation methods combination traffic profiling methods mainly includes identification ip reputation tracking abnormal actions employing progressive sanctuary challenges | [
225,
2947,
10756,
6347,
7515,
5884
] | Test |
4,499 | 2 | FFADO:ffado free firewire audio drivers ffado project provide open-source drivers firewire sound interfaces linux project began freebob driver specifically firewire audio devices based technology made bridgeco use interface named bebob current version allows devices accessed via jack audio connection kit jack following presentation paper 2007 linux audio conference outlining future project march 26 2007 announced project would renamed ffado drivers rewritten include support firewire audio chipsets | [
2908,
7983,
823
] | Test |
4,500 | 4 | Computer_Online_Forensic_Evidence_Extractor:computer online forensic evidence extractor computer online forensic evidence extractor cofee tool kit developed microsoft help computer forensic investigators extract evidence windows computer installed usb flash drive external disk drive acts automated forensic tool live analysis microsoft provides cofee devices online technical support free law enforcement agencies cofee developed anthony fung former hong kong police officer works senior investigator microsoft internet safety enforcement team fung conceived device following discussions 2006 law enforcement technology conference sponsored microsoft device used 2,000 officers least 15 countries case cited microsoft april 2008 credits cofee crucial new zealand investigation trafficking child pornography producing evidence led arrest april 2009 microsoft interpol signed agreement interpol would serve principal international distributor cofee university college dublin center cyber crime investigations conjunction interpol develops programs training forensic experts using cofee national white collar crime center licensed microsoft sole us domestic distributor cofee november 6 2009 copies microsoft cofee leaked onto various torrent websites analysis leaked tool indicates largely wrapper around utilities previously available investigators microsoft confirmed leak however spokesperson firm said anticipate possible availability cofee cybercriminals download find ways ‘ build around significant concern device activated plugged usb port contains 150 tools graphical user interface help investigators collect data software reported made three sections first cofee configured advance investigator selecting data wish export saved usb device plugging target computer interface generates reports collected data estimates cited microsoft state jobs previously took 3–4 hours done cofee little 20 minutes cofee includes tools password decryption internet history recovery data extraction also recovers data stored volatile memory could lost computer shut mid late 2009 tool named detect eliminate computer acquired forensics decaf announced uninvolved group programmers tool would reportedly protect computers cofee render tool ineffective alleged would provide real-time monitoring cofee signatures usb devices running applications cofee signature detected decaf performs numerous user-defined processes included cofee log clearing ejecting usb devices contamination spoofing mac addresses december 18 2009 decaf creators announced tool hoax part stunt raise awareness security need better forensic tools | [
6916,
2437,
7968,
9377,
5284,
11182,
4789,
1975,
8635,
830,
2494,
6475,
4049,
4834,
5475,
7525,
5990,
9319,
7411
] | Test |
4,501 | 2 | Cdist:cdist cdist free software configuration management tool unix-like systems manages nodes ssh using bourne shell require additional software installed target nodes cdist differentiates competing configuration management systems choosing bourne shell primary language writing configuration scripts requiring effectively dependencies target nodes although cdist core written python interpreter required host machine target nodes cdist development started 2010 eth zurich actively developed maintained primarily nico schottelius steven armstrong major part discussion cdist happens mailinglist irc channel cstar freenode network cdist used various companies switzerland eth zurich oma browser project us germany france cdist zero dependency configuration management system requires ssh bourne-compatible shell target hosts provided default unix-like machines cdist used bootstrap configuration management systems cdist typically installed package like .deb .rpm rather via git commands run created checkout entry point configuration shell script conf/manifest/init called initial manifest cdist terms main components cdist called types bundle functionality types essentially consists number shell scripts define types type reuses code generated executed target host cdist split two components cdist core handles reading configuration communicating remote hosts like ansible cdist uses push model apply configuration changes cdist process host machine connects number remote nodes via ssh performs configuration updates nodes cdist configure multiple hosts parallel reduce time spent configuring configuration scripts define targets shall configured typically written bourne shell consists shell de facto language writing cdist configuration scripts scripts written language contain suitable shebang line shell scripting favored simple access environment variables read files execute system commands user configurable parts contained manifests gencode-scripts shell scripts shell scripts chosen unix system administrators usually proficient reading writing shell scripts furthermore shell also commonly available potential target systems thus avoiding need install additional software zero dependencies cdist reads configuration initial manifest conf/manifest/init hosts mapped types using types cdist called like normal programs manifests make use advanced parameter parsing well reading stdin dependencies expressed setting require environment variable access paths files within types given environment variables like ansible like cdist uses agentless push model configure nodes however ansible normally requires python targets whereas cdist ansible makes distinction roles written declarative yaml-based language modules written python cdist types serve purposes modules roles mostly written bourne shell cdist approach might preferrable shell familiar many system administrators never used configuration management system ansible declarative language arguably readable appropriate | [
10341,
8554,
7983,
11632,
5397,
823
] | None |
4,502 | 1 | CSQL:csql csql open source main memory high-performance relational database management system developed sourceforge.net designed provide high performance sql queries dml statements disk i/o in-memory databases provide predictive response time suited real time near real time applications something called datablitz described 1998 project called dbcache done ibm presented 2004 c. mohan configured work transparent cache database management systems mysql postgresql circa 2009 version 3.3 released 2011 promoted company called lakshya bangalore existed 2013 | [
10921,
10413,
7022,
7983,
3323,
10286,
3219,
8539
] | None |
4,503 | 4 | Client_honeypot:client honeypot honeypots security devices whose value lie probed compromised traditional honeypots servers devices expose server services wait passively attacked client honeypots active security devices search malicious servers attack clients client honeypot poses client interacts server examine whether attack occurred often focus client honeypots web browsers client interacts servers part client honeypot example ftp ssh email etc. several terms used describe client honeypots besides client honeypot generic classification honeyclient term generally used accepted however subtlety honeyclient actually homograph could also refer first known open source client honeypot implementation see although clear context client honeypot composed three components first component queuer responsible creating list servers client visit list created example crawling second component client able make requests servers identified queuer interaction server taken place third component analysis engine responsible determining whether attack taken place client honeypot addition components client honeypots usually equipped sort containment strategy prevent successful attacks spreading beyond client honeypot usually achieved use firewalls virtual machine sandboxes analogous traditional server honeypots client honeypots mainly classified interaction level high low denotes level functional interaction server utilize client honeypot addition also newly hybrid approaches denotes usage high low interaction detection techniques high interaction client honeypots fully functional systems comparable real systems real clients functional limitations besides containment strategy exist high interaction client honeypots attacks high interaction client honeypots detected via inspection state system server interacted detection changes client honeypot may indicate occurrence attack exploited vulnerability client example change presence new altered file high interaction client honeypots effective detecting unknown attacks clients however tradeoff accuracy performance hit amount system state monitored make attack assessment also detection mechanism prone various forms evasion exploit example attack could delay exploit immediately triggering time bombs could trigger upon particular set conditions actions logic bombs since immediate detectable state change occurred client honeypot likely incorrectly classify server safe even though successfully perform attack client finally client honeypots running virtual machines exploit may try detect presence virtual environment cease triggering behave differently capture high interaction client honeypot developed researchers victoria university wellington nz capture differs existing client honeypots various ways first designed fast state changes detected using event based model allowing react state changes occur second capture designed scalable central capture server able control numerous clients across network third capture supposed framework allows utilize different clients initial version capture supports internet explorer current version supports major browsers internet explorer firefox opera safari well http aware client applications office applications media players honeyclient web browser based ie/firefox high interaction client honeypot designed kathy wang 2004 subsequently developed mitre first open source client honeypot mix perl c++ ruby honeyclient state-based detects attacks windows clients monitoring files process events registry entries integrated capture-hpc real-time integrity checker perform detection honeyclient also contains crawler seeded list initial urls start continue traverse web sites search client-side malware honeymonkey web browser based ie high interaction client honeypot implemented microsoft 2005 available download honeymonkey state based detects attacks clients monitoring files registry processes unique characteristic honeymonkey layered approach interacting servers order identify zero-day exploits honeymonkey initially crawls web vulnerable configuration attack identified server reexamined fully patched configuration attack still detected one conclude attack utilizes exploit patch publicly released yet therefore quite dangerous shelia high interaction client honeypot developed joan robert rocaspana vrije universiteit amsterdam integrates email reader processes email receives urls attachments depending type url attachment received opens different client application e.g browser office application etc monitors whether executable instructions executed data area memory would indicate buffer overflow exploit triggered approach shelia able detect exploits able actually ward exploits triggering spycrawler developed university washington yet another browser based mozilla high interaction client honeypot developed moshchuk et al 2005 client honeypot available download spycrawler state based detects attacks clients monitoring files processes registry browser crashes spycrawlers detection mechanism event based increases passage time virtual machine spycrawler operating overcome rather reduce impact time bombs wef implementation automatic drive-by-download – detection virtualized environment developed thomas müller benjamin mack mehmet arziman three students hochschule der medien hdm stuttgart summer term 2006 wef used active honeynet complete virtualization architecture underneath rollbacks compromised virtualized machines low interaction client honeypots differ high interaction client honeypots utilize entire real system rather use lightweight simulated clients interact server browser world similar web crawlers responses servers examined directly assess whether attack taken place could done example examining response presence malicious strings low interaction client honeypots easier deploy operate high interaction client honeypots also perform better however likely lower detection rate since attacks known client honeypot order detect new attacks likely go unnoticed also suffer problem evasion exploits may exacerbated due simplicity thus making easier exploit detect presence client honeypot honeyc low interaction client honeypot developed victoria university wellington christian seifert 2006 honeyc platform independent open source framework written ruby currently concentrates driving web browser simulator interact servers malicious servers detected statically examining web server ’ response malicious strings usage snort signatures monkey-spider low-interaction client honeypot initially developed university mannheim ali ikinci monkey-spider crawler based client honeypot initially utilizing anti-virus solutions detect malware claimed fast expandable detection mechanisms work started diploma thesis continued released free software gpl phoneyc low-interaction client developed jose nazario phoneyc mimics legitimate web browsers understand dynamic content de-obfuscating malicious content detection furthermore phoneyc emulates specific vulnerabilities pinpoint attack vector phoneyc modular framework enables study malicious http pages understands modern vulnerabilities attacker techniques spybye low interaction client honeypot developed niels provos spybye allows web master determine whether web site malicious set heuristics scanning content clamav engine thug low-interaction client honeypot developed angelo dell'aera thug emulates behaviour web browser focused detection malicious web pages tool uses google v8 javascript engine implements document object model dom important unique features thug activex controls handling module vulnerability module static dynamic analysis capabilities using abstract syntax tree libemu shellcode analyser thug written python gnu general public license yalih yet another low interaction honeyclient low interaction client honeypot developed masood mansoori honeynet chapter victoria university wellington new zealand designed detect malicious websites signature pattern matching techniques yalih capability collect suspicious urls malicious website databases bing api inbox spam folder pop3 imap protocol perform javascript extraction de-obfuscation de-minification scripts embedded within website emulate referer browser agents handle redirection cookies sessions visitor agent capable fetching website multiple locations bypass geo-location ip cloaking attacks yalih also generate automated signatures detect variations attack yalih available open source project minic low interaction client honeypot based wget retriever yara engine designed light fast suitable retrieval large number websites minic allows set simulate referer user-agent accept_language variables minic designed new zealand honeynet chapter victoria university wellington hybrid client honeypots combine low high interaction client honeypots gain advantages approaches honeyspider network hybrid client honeypot developed joint venture nask/cert polska surfnet projects goal develop complete client honeypot system based existing client honeypot solutions crawler specially bulk processing urls | [
3555,
7364,
9256,
4585,
1785,
7482
] | None |
4,504 | 4 | HTTP_tunnel:http tunnel http tunneling used create network link two computers conditions restricted network connectivity including firewalls nats acls among restrictions tunnel created intermediary called proxy server usually located dmz tunneling also allow communication using protocol normally ’ supported restricted network common form http tunneling standardized http connect method mechanism client asks http proxy server forward tcp connection desired destination server proceeds make connection behalf client connection established server proxy server continues proxy tcp stream client initial connection request http server simply proxies established tcp connection mechanism client behind http proxy access websites using ssl tls i.e https proxy servers may also limit connections allowing connections default https port 443 whitelisting hosts blocking traffic n't appear ssl client connects proxy server requests tunneling specifying port host computer would like connect port used indicate protocol requested connection allowed proxy connected specified host proxy return 2xx success response client proxied remote host data sent proxy server forwarded unmodified remote host client communicate using protocol accepted remote host example client starting ssh communications hinted port number initial connect request http tunnel also implemented using usual http methods post get put delete similar approach used bidirectional-streams synchronous http bosh special http server runs outside protected network client program run computer inside protected network whenever network traffic passed client client repackages traffic data http request relays data outside server extracts executes original network request client response request sent server repackaged http response relayed back client since traffic encapsulated inside normal get post requests responses approach works proxies firewalls | [
11392,
8998,
5608,
9834,
9868,
10924,
5749,
4725,
4797
] | None |
4,505 | 3 | Windows_Server_2016:windows server 2016 windows server 2016 server operating system developed microsoft part windows nt family operating systems developed concurrently windows 10 first early preview version technical preview became available october 1 2014 together first technical preview system center windows server 2016 released september 26 2016 microsoft ignite conference became generally available october 12 2016 two successors windows server 2019 windows server semi-annual channel excludes graphical user interface many older components windows server 2016 variety new features including microsoft announced new installation option nano server offers minimal-footprint headless version windows server excludes graphical user interface wow64 support 32-bit software windows installer support console login either locally via remote desktop connection management performed remotely via windows management instrumentation wmi windows powershell remote server management tools collection web-based gui command line tools however technical preview 5 microsoft re-added ability administer nano server locally powershell according microsoft engineer jeffrey snover nano server 93 lower vhd size 92 fewer critical security advisories 80 fewer reboots windows server nano server available microsoft software assurance customers cloud computing platforms microsoft azure amazon web services starting new feature release windows server version 1709 nano server installed inside container host microsoft reorganized satya nadella putting server system center teams together previously server team closely aligned windows client team azure team also working closely server team march 2017 microsoft demonstrated internal version server 2016 running armv8-a architecture reported microsoft working qualcomm centriq cavium thunderx2 chips according james vincent verge decision endangers intel dominance server cpu market however later inquiry microsoft revealed version windows server internal use impacts subscribers microsoft azure service public beta version windows server 2016 still called vnext branded windows server technical preview released october 1 2014 technical preview builds aimed toward enterprise users first technical preview first set expire april 15 2015 microsoft later released tool extend expiry date last second tech preview os may 2015 second beta version technical preview 2 released may 4 2015 third preview version technical preview 3 released august 19 2015 technical preview 4 released november 19 2015 technical preview 5 released april 27 2016 windows server 2016 insider preview build 16237 released windows insiders july 13 2017 windows server 2016 officially released microsoft ignite conference september 26 2016 unlike predecessor windows server 2016 licensed number cpu cores rather number cpu sockets—a change similarly adopted biztalk server 2013 sql server 2014 new licensing structure adopted windows server 2016 also moved away windows server 2012/2012r2 cpu socket licensing model amount cores covered one license limited windows server 2016 standard datacenter core licensing covers minimum 8 core licenses physical processor minimum 16 core licenses server core licenses sold packs two standard edition providing familiar rights run 2 virtualized os environments server goes 16 core licenses 2 processor server additional licenses required windows server 2016 windows server 2016 technical preview released october 1 2014 first beta version operating system made publicly available version number 6.4.9841 windows server 2016 technical preview 2 made available may 4 2015 version number 10.0.10074 similar jump significant part version number 6 10 seen windows 10 highlights version include third technical preview windows server 2016 made available august 19 2015 version number 10.0.10514 highlights version include fourth technical preview operating system made available november 19 2015 one year one month initial technical preview version number 10.0.10586 highlights include last technical preview windows server 2016 made available april 27 2016 version number 10.0.14300 highlights include windows server 2016 released manufacturing september 26 2016 bearing version number 10.0.14393 windows 10 anniversary update microsoft added following final touches windows server version 1709 based windows 10 fall creators update released october 17 2017 release dropped windows server 2016 name called windows server microsoft offered microsoft software assurance customers active windows server 2016 license system requirements first windows server product fall semi-annual channel sac release cadence product features server core nano server modes two server core mode os installed bare system nano server mode available operating system container windows server version 1803 based windows 10 april 2018 update second semi-annual channel release windows server also final version branched server 2016 codebase next release shares version number 1809 windows server 2019 | [
6150,
6153,
6675,
11283,
9762,
11301,
6697,
1581,
64,
582,
1608,
1098,
4174,
7248,
8798,
2656,
10338,
8296,
5225,
10344,
8299,
6768,
7796,
6265,
8315,
636,
639,
641,
2179,
9863,
651,
6797,
10896,
2193,
2196,
2713,
9375,
4771,
3250,
9910,
... | Train |
4,506 | 6 | Ext2Fsd:ext2fsd ext2fsd short ext2 file system driver free installable file system driver written c microsoft windows operating system family facilitates read write access ext2 ext3 ext4 file systems driver installed windows 2000 windows xp windows server 2003 windows vista windows 7 windows 8 windows 10 windows server 2008 windows server 2008 r2 support windows nt dropped version 0.30 program ext2mgr optionally installed additionally manage drive letters april 2019 main web site ext2fsd.com gone dark german computer magazine pc-welt reported frequent program crashes 2009 program able access ext3 partitions smoothly often led blue screen crashes type lead data loss example yet permanently stored data main memory program could access ext2 partitions without errors 2012 computerwoche warned access ext3 partitions harmless data loss may occur warning issued release version 0.69 n't use ext2fsd 0.68 earlier versions latest ubuntu debian systems ext2fsd 0.68 process ext4 64-bit mode enabled could corrupt data sorry disaster issue 'm working improvement unclear whether v0.69 corrects deficiency | [
6434,
9762,
4074,
8298,
6413,
6797,
7663,
7983,
5969,
8976,
3859,
1844,
2197,
246,
2199,
9335,
11184,
2045
] | Test |
4,507 | 9 | ColdFusion_Markup_Language:coldfusion markup language coldfusion markup language commonly known cfml scripting language web development runs jvm .net framework google app engine multiple commercial open source implementations cfml engines available including adobe coldfusion lucee new atlanta bluedragon offer java-based .net-based version railo open bluedragon well cfml server engines simplest form like many web scripting languages cfml augments standard html files database commands conditional operators high-level formatting functions elements produce web applications cfml also includes numerous constructs including coldfusion components cfcs cfml version objects allow separation business logic presentation cfml written using either tags cfscript resembles javascript ecma script pages cfml application include server-side cfml tags functions addition html tags modern cfml applications also tend cfcs accessed cfml pages executing business logic web browser requests page coldfusion application automatically pre-processed coldfusion application server cfml also used generate languages aside html xml javascript css despite name cfml markup language also sgml since certain core cfml features prevent complying cfml engine configured way certain file extensions server .cfm .cfc handed cfml engine processing case java-based engines accomplished via java servlets cfml engine processes cfml tags functions returns text outside cfml tags functions web server unchanged named cold fusion outset software created 1995 allaire corporation originally located minnesota later moved cambridge massachusetts finally newton massachusetts acquired macromedia 2001 allaire cold fusion thus became macromedia cold fusion release version 4 space name removed become coldfusion adobe acquired macromedia 2005 still actively developing coldfusion 1998 alan williamson scottish company n-ary began creating templating engine java simplify common programming tasks williamson using curly-brace notation instead tags saw example cfml solving similar problems although java using tag syntax started developing would eventually become bluedragon first java implementation cfml language coldfusion written c c++ version 6.0 — first java-based version coldfusion — released 2002 new atlanta licensed bluedragon around 2001 made available commercial product eventually creating .net implementation cfml open bluedragon fork commercial bluedragon product first released 2008 railo cfml engine began student project 2002 first launched commercial project 2005 railo announced making engine open source 2008 first open source version released 2009 june 18 2009 adobe announced cfunited conference formed cfml advisory committee would responsible guiding reviewing changes cfml language effort disbanded 2010 google group cfml conventional wisdom created forum open public discussions language engine features use dwindled since 2011 2012 opencfml foundation launched function push open-source cfml applications platforms former railo lead developer michael offner launched lucee fork railo london january 29 2015 backed community supporters members lucee association goal project provide functionality cfml using fewer resources giving better performance move cfml past roots modern dynamic web programming platform cfml tags similar format html tags enclosed angle brackets generally zero named attributes though tags e.g cfset cfif contain expression rather attributes many cfml tags bodies beginning end tags text processed example tags cfset cfftp never bodies required information goes beginning character ending character form tag attributes name/value pairs example legal tags body syntactically acceptable leave unclosed first example though many cfml developers choose self-close tags second example arguably make code legible even tag body including body may necessary instances attributes specify required information cases second example end tag hence tag body may omitted tag may self-closing following example various tags offer ability type-check input parameters e.g cffunction cfparam cfqueryparam programmer declares type specifically functionality used cfqueryparam secure web applications databases hackers malicious web requests sql injection nearly 100 tags many functions make heart cfml language following lists cfml tags function purpose cfml allows language extensions form custom tags tags created developer part cfml language custom tags regular cfml files intended invoked tags although possible treat template custom tag regular template custom tags written cfml typically invoked prefixing custom tag file name cf_ although ways invoke custom tags template invoked custom tag attributes used invoke tag available within tag attributes scope variables calling page accessible via caller scope example writing custom tag perform addition taking two attributes adding together tag would addition.cfm file could look like assuming tag directory file pre-defined customtags directory invoked thus cfx tags custom tags developed using java c++ prefixed cfx_ like cf_ java c++ tags added cfml runtime environment using cfml engine administrator editing configuration files cfml engines jsp tags also included cfml pages using cfimport tag coldfusion markup language includes set functions use perform logical arithmetic operations manipulate data cfcs provide typical features functionality provided object-oriented oop languages create cfc cfcs plain cfml within cfc cfml tag function custom tag components etc may used cfcs used various ways method contained cfc simply needs invoked cfinvoke tag create instance cfc invoke desired method destroy instance cfc cfinvoke takes name component minus .cfc extension method execute access returned data returnvariable attribute provides name variable contain whatever function returns cfcs created using four tags saved .cfc files invoked using cfinvoke tag example component temperature.cfc method ftoc converts temperature fahrenheit celsius test.cfm template invokes method converts 212 degrees fahrenheit outputs result cfcs may also instantiated objects assuming cfc file called person.cfc instance cfc would instantiated follows cfcs also form basis ability create web services cfml cfc created usual way attribute access= remote added function within cfc make function available called soap-based web service cfml engine auto-generates wsdl creates necessary stubs web service function | [
9345,
2946,
899,
3462,
10506,
3469,
9618,
148,
8854,
155,
5917,
8990,
4512,
6819,
8739,
11688,
5677,
7983,
4529,
5684,
7862,
3895,
1591,
5048,
9144,
8385,
5314,
9666,
9926,
3920,
11219,
2901,
4956,
479,
4069,
102,
11625,
7274,
5612,
10994... | None |
4,508 | 3 | Qualcomm_Centriq:qualcomm centriq centriq brand system chip soc semiconductor products designed marketed qualcomm data centers centriq central processing unit cpu uses arm risc instruction set multiple cpu cores single chip november 2014 qualcomm announced developing arm armv8-a microarchitecture based cpu purpose-built data centers december 2016 company announced demonstrated first multi-core cpus based custom arm armv8-a microarchitecture first centriq 2400 series products made available server manufacturers november 2017 first products qualcomm introduced falkor armv8-a microarchitecture chip 48 qualcomm custom designed falkor cores 2.6ghz six-channel ddr4 memory 60 mb l3 cache number reviews noted release centriq expected face significant competition established x86-64 data-center cpu manufacturers intel amd arm microarchitecture server products cavium thunderx2 addition competitive pressures noted running established workloads arm microarchitectures requires re-optimizing recompiling software x86-64 emulation presenting barrier entry potential customers | [
7170,
8720,
11282,
9235,
11289,
1057,
38,
4139,
8237,
9774,
8250,
8253,
7745,
7235,
7747,
2635,
99,
8812,
11374,
10361,
638,
644,
9863,
8842,
146,
659,
1170,
7833,
666,
5786,
4258,
4773,
9913,
10945,
9928,
2273,
2788,
3301,
5356,
9964,
... | Test |
4,509 | 0 | North_American_Chapter_of_the_Association_for_Computational_Linguistics:north american chapter association computational linguistics north american chapter association computational linguistics naacl provides regional focus members association computational linguistics acl north america well central south america organizes annual conferences promotes cooperation information exchange among related scientific professional societies encourages facilitates acl membership people institutions americas provides source information regional activities acl executive committee naacl hosts annual professional conference north american city alternating years acl holds annual conference elsewhere current officers naacl include owen rambow chair lillian lee secretary christopher manning treasurer graeme hirst past chair | [
7780,
1890,
7724,
10557
] | Validation |
4,510 | 7 | WEB2GRID:web2grid web2grid project aims support web 2.0 communities dynamically building necessary infrastructure needed processing high-end tasks community way content generated joint effort members web2grid technology enables community build required infrastructure joint community effort exploiting volunteer computing resources community members order achieve goal web2grid exploits sztaki desktop grid boinc 3g bridge technologies developed eu fp7 edges enabling desktop grids e-science eu fp7 edgi european desktop grid initiative projects project started 2009 technically coordinated prof. peter kacsuk head laboratory parallel distributed systems lpds mta-sztaki hungary web2 technologies assist assure resources desktop grid community voluntary settlement bases developed platform extended desktop grid systems offers back-end infrastructure operational requirements web2 portals systems combining web2 desktop grid technologies web2 extend capabilities community contents towards shared services help grid technologies project aims develop tools interfaces methodologies above-mentioned targeted services established closed local desktop grid open global desktop grid environments three main blocks project grid web2 connections two technologies last decades grid systems offered large-scale distributed computing storage services mainly academic university research area focus shifting towards services knowledge sharing extension application domain standardized access methods eliminating system heterogeneity grid point view project relies results eu fp7 supported edges enabling desktop grids e-science infrastructure project desktop grids system often based community offerings similar web2 content building solution edges project important grid/web2 integration web2grid project also extends edges technologies towards direction commercial grids web2 services owner server provides service framework real content shared maintained users generally due large number connections users web2 systems handle heavy data traffic complex relations may needs large computational power many cases web2 side numerous application topics large capacity solved grid technologies connection web2 grid realized well defined low-level application development interface api high-level graphical application development solutions project partners web2 applications come various fields justifies need development multi-level interfaces project benefits numerous eu fp6 eu fp7 project achievements connecting web2 communities grid technologies project aims achieve various social economical goals including following partners participate project | [
6042,
8420
] | Train |
4,511 | 4 | NetBarrier_X4:netbarrier x4 netbarrier x4 discontinued version intego netbarrier line firewall os x features cookie cleaner browser history cleaner internet traffic statistic internet bandwidth meter cookie filters information hiding firewall customizable already configured options restrictions network client local server server client customized customized option allows flexible firewall configuration netbarrier features integrated virusbarrier x6 longer sold standalone product | [
1792,
2049,
4480,
2563,
6797,
1172,
9496,
3482,
1436,
6431,
10531,
5924,
550,
8998,
10790,
3243,
1708,
3885,
7983,
8753,
823,
569,
5178,
11577,
9279,
5057,
1858,
10433,
11073,
2118,
4814,
9423,
10574,
7121,
10451,
10708,
4568,
4953,
9048,
... | Validation |
4,512 | 9 | BlueDragon:bluedragon bluedragon coldfusion markup language cfml engine comparable adobe systems coldfusion licensed distributed new atlanta tagservlet ltd based scotland bluedragon also distributed supported bea systems oracle weblogic server server platform bluedragon applications run variety platforms including microsoft windows linux mac os x mostly compatible coldfusion mx 7 march 2008 new atlanta announced future versions bluedragon java ee editions would released open source products open source version released open bluedragon openbd december 2008 bluedragon available six editions first two editions standalone servers run windows linux os x bd j2ee cfml applications deployed j2ee server enabling integration cfml j2ee enabled coldfusion mx bd bea weblogic edition special edition based bd j2ee use bea weblogic server bd.net extends microsoft .net framework iis permit deployment cfml applications native ms .net web applications offering integration cfml asp.net possible coldfusion server jx j2ee ms .net bea weblogic editions bluedragon commercial products available 30-day unlimited trials convert single-ip developer edition expiration server edition hand free deployment—though hosting redeployment 6.2 release commercial use differences cfml tags supported free server edition supports odbc drivers ms windows mysql postgresql linux mac os x supports iis ms windows apache linux mac os x support secured ssl connections none limitations free server edition exist commercial server jx j2ee .net bea weblogic editions .net edition bluedragon runs microsoft .net platform bd.net enables cfml applications leverage .net platform allows integration cfml asp.net well .net objects open bluedragon open source version bluedragon released gnu general public license version 3 gplv3 chief differences open source j2ee version removal commercial libraries e.g. pdf generation jturbo jdbc driver microsoft sql server bluedragon administrator application runs standard j2ee application server tomcat jboss jetty original version bluedragon released 2002 myspace used .net version bluedragon power online applications 2007 though bluedragon 7.0 designed compatible adobe coldfusion mx 7.0.2 differences two cfml implementations bluedragon offers several advantages tags functions functionality found coldfusion similarly tags functions found coldfusion supported currently bluedragon new atlanta maintains complete list incompatibilities adobe coldfusion mx documentation number popular coldfusion frameworks fully supported bluedragon list useful resources developers see coldfusion development aids section | [
3469,
6797,
9618,
148,
4507,
4512,
6819,
8739,
7983,
4529,
7862,
823,
3895,
5048,
9144,
5314,
9666,
102,
5612,
10994
] | Train |
4,513 | 2 | Page_address_register:page address register page address register par contains physical addresses pages currently held main memory computer system pars used order avoid excessive use address table operating systems par may check page number entries par simultaneously allowing retrieve pages physical address quickly par used single process used pages frequently referenced though pages may change process behaviour changes accordance principle locality example computer made use pars atlas | [
4423,
1801,
7983,
11539,
3702
] | None |
4,514 | 4 | Weplab:weplab weplab tool designed teach wired equivalent privacy wep wireless encryption protocol works explain security vulnerabilities protocol demonstrate attacks used compromise wep protected wireless network weplab designed crack wep keys analyze wireless security network educational point view author attempted make source code clear possible instead implementing optimizations would obfuscate weplab works unix-like systems like gnu/linux *bsd mac os x cygwin layer windows weplab tries break wep key using several known attacks | [
5612,
4140,
6797,
7983,
2961,
5397,
823,
10329,
9151
] | None |
4,515 | 3 | Windows_CE_5.0:windows ce 5.0 windows ce 5.0 codenamed macallan magellan brand gps units run successor windows ce 4.2 third release windows ce .net family first released july 9 2004 like predecessors windows ce 5.0 marketed towards embedded device market independent device vendors windows ce 5.0 billed low-cost compact fast-to-market real-time operating system available x86 arm mips superh microprocessor-based systems windows ce 5.0 builds previous windows ce releases adoption shared source since 2001 microsoft steadily expanding available windows ce source tree embedded system developers windows ce 5.0 open microsoft operating system date though system available shared source agreements developers freedom modify kernel level without need share changes microsoft competitors windows ce 5.x base os windows mobile 6.0 6.1 6.5 x86 platform windows ce 5.0 competes microsoft embedded operating systems windows xp embedded predecessor windows nt embedded platform builder ide windows ce 5.0 last builder tool available standalone product windows ce 5.0 currently available device emulator according microsoft windows ce preferable windows xp embedded situations demanding wireless multimedia requirements need met following primary considerations “ choosing right version ” also difference cost | [
8576,
641,
2179,
3463,
651,
6797,
8080,
3857,
1298,
7057,
2196,
8976,
9366,
10896,
11283,
4505,
11301,
3496,
6441,
6697,
1581,
7983,
3250,
3890,
9910,
6462,
7615,
321,
7106,
7234,
582,
1098,
10957,
9173,
11605,
2391,
3289,
4316,
8798,
111... | Validation |
4,516 | 9 | Game_Oriented_Assembly_Lisp:game oriented assembly lisp game oriented assembly lisp goal programming language dialect language lisp made video games developed andy gavin jak daxter team company naughty dog written using allegro common lisp used development entire jak daxter series games syntactically goal resembles lisp dialect scheme though many idiosyncratic object-oriented programming features classes inheritance virtual functions goal encourages imperative programming style programs tend consist sequence events executed rather functional programming style functions evaluated recursively diversion scheme allows side effects encourage imperative style goal run interpreter instead compiled directly playstation 2 machine code execute offers limited facilities garbage collection relying extensively runtime support offers dynamic memory allocation primitives designed make well-suited running constant memory video game console goal extensive support inlined assembly language code using special codice_1 form allowing programs freely mix assembly higher-level constructs within one function goal compiler implemented allegro common lisp supports long term compiling listener session gives compiler knowledge state compiled thus running program including symbol table addition dynamic linking allows function edited recompiled uploaded inserted running game without restart process similar edit continue feature offered c++ compilers allows programs replace arbitrary amounts code even entire object files interrupt running game debugger feature used implement code level streaming jak daxter games goal first use game predecessor language game oriented object lisp gool also developed andy gavin crash bandicoot game since naughty dog longer employs goal primary development maintenance engineer pressure new parent company sony share technology studios naughty dog transitioned away lisp however since resumed using scripting playstation 3 games including last us | [
10752,
4098,
11269,
2056,
2062,
9231,
7184,
2577,
9749,
8728,
4633,
4122,
8226,
3119,
2105,
3132,
6717,
8258,
8771,
8262,
10316,
1613,
9299,
10841,
3675,
7267,
2660,
8293,
7273,
2666,
6252,
5751,
7805,
9345,
1159,
9865,
9871,
9877,
6311,
... | Test |
4,517 | 4 | Rogue_access_point:rogue access point rogue access point wireless access point installed secure network without explicit authorization local network administrator whether added well-meaning employee malicious attacker although technically easy well-meaning employee install soft access point inexpensive wireless router—perhaps make access mobile devices easier—it likely configure open poor security potentially allow access unauthorized parties attacker installs access point able run various types vulnerability scanners rather physically inside organization attack remotely—perhaps reception area adjacent building car park high gain antenna even several miles away prevent installation rogue access points organizations install wireless intrusion prevention systems monitor radio spectrum unauthorized access points presence large number wireless access points sensed airspace typical enterprise facility include managed access points secure network plus access points neighborhood wireless intrusion prevention system facilitates job auditing access points continuous basis learn whether rogue access points among order detect rogue access points two conditions need tested first two conditions easy test—compare wireless mac address also called bssid access point managed access point bssid list however automated testing second condition become challenging light following factors need cover different types access point devices bridging nat router unencrypted wireless links encrypted wireless links different types relations wired wireless mac addresses access points soft access points b necessity determine access point connectivity acceptable response time large networks c requirement avoid false positives negatives described false positives occur wireless intrusion prevention system detects access point actually connected secure network wired rogue frequent false positives result wastage administrative bandwidth spent chasing possibility false positives also creates hindrance enabling automated blocking wired rogues due fear blocking friendly neighborhood access point false negatives occur wireless intrusion prevention system fails detect access point actually connected secure network wired rogue false negatives result security holes unauthorized access point found connected secure network rogue access point first kind also called “ wired rogue ” hand unauthorized access point found connected secure network external access point among external access points found mischievous potential risk e.g. whose settings attract already attracted secure network wireless clients tagged rogue access point second kind often called evil twin soft access point soft ap set wi-fi adapter using example windows virtual wi-fi intel wifi makes possible without need physical wi-fi router share wired network access one computer wireless clients connected soft ap employee sets soft ap machine without coordinating department shares corporate network soft ap becomes rogue ap | [
6466,
2084,
4517,
9640,
9968,
794,
4863
] | Validation |
4,518 | 3 | Pooyan:pooyan pooyan ported atari 2600 atari 8-bit family tandy color computer 2 commodore 64 sord m5 msx apple ii tandy trs-80 tomy tutor pv-1000 famicom player controls mama pig whose babies kidnapped pack wolves must rescue using bow arrow slabs meat controls consist two-position up/down joystick moves elevator mama pig rides button fires arrows throws meat level consists two rounds first wolves descend slowly high ledge using balloons player must shoot order drop ground wolves reach ground safely climb set ladders behind elevator try eat mama pig moves front second round wolves start ground inflate balloons order ascend cliff boulder resting push toward edge airborne wolves throw rocks rounds trying hit mama pig addition balloon carrying last boss wolf second round must shot several times order defeat reaches cliff player must defeat additional enemies facing boss slab meat occasionally appears top elevator range motion picking allows player throw distracting wolves on/near trajectory causing let go balloons crash ground bonus points stray balloons dropped fruits also shot extra points every second round bonus screen played first screen requires player defeat group wolves using meat second awards points shooting fruits thrown wolves two screens alternate level player loses one life mama pig hit rock eaten wolf ladders first round crushed boulder many wolves reach cliff push edge second round lives lost game ends game starts day met bear heard opening scene wolves kidnap mama babies first stage theme bears slight resemblance main theme music frogger another konami arcade game song part desecration rag operatic nightmare felix arndt portion mimics beginning antonín dvořák humoresque opus 101 number 7 second stage cleared second time part oh susanna heard pooyan included compilation disc konami 80 arcade gallery playstation emulated version game released 2006 playstation 2 japan part oretachi geasen zoku sono -series famicom port released virtual console japan series extra ops known pooyan missions involves shooting fulton surface-to-air recovery balloons carrying abducted soldiers air sound effects music arcade game used throughout mission largely identical bootleg sold name pootan david hanzman rochester ny usa scored world record 1,609,250 points arcade version pooyan december 16 1983 | [
3788,
10316,
9006,
1776,
10576,
10931,
599
] | Test |
4,519 | 9 | ASF+SDF_Meta_Environment:asf+sdf meta environment asf+sdf meta-environment ide toolset interactive program analysis transformation combines sdf syntax definition formalism asf algebraic specification formalism technologies features components toolbus component interconnection architecture somewhat like d-bus corba based process algebra formalism aterms generic data representation format efficient terms resource usage due maximal subterm sharing automatic garbage collection used throughout tools toolset apis provided c java developers use applications | [
932,
605,
2374,
4293,
6694,
8262,
5677,
7983,
11475,
4980,
5492,
823,
5399,
2045
] | None |
4,520 | 2 | GNUstep_Renaissance:gnustep renaissance gnustep renaissance development framework reads xml descriptions graphical user interfaces application bundle converts native widgets connections runtime either gnustep mac os x. gnustep renaissance written nicola pero alternative nib gorm files used interface builder gorm respectively unlike aforementioned formats renaissance generate interfaces run without modification either gnustep mac os x also uses feature called autolayout means localized strings manually resized january 2006 gnustep renaissance beta software graphical frontend renaissance yet exist stable release made since 2008 though downloadable binary rebuilt still previous version simple example interface specification assuming file application bundle named sample.gsmarkup loaded following objective-c code | [
10406,
10470,
5612,
7983,
8304,
479
] | None |
4,521 | 2 | Ksplice:ksplice ksplice open-source extension linux kernel allows security patches applied running kernel without need reboots avoiding downtimes improving availability technique broadly referred dynamic software updating ksplice supports patches make significant semantic changes kernel data structures ksplice implemented linux ia-32 x86-64 architectures developed ksplice inc. 21 july 2011 oracle acquired ksplice started offering support oracle linux support red hat enterprise linux dropped turned free 30-day trial rhel customers incentive migrate oracle linux premier support time use oracle unbreakable enterprise kernel uek became requirement using ksplice production systems ksplice available free desktop linux installations official support available fedora ubuntu linux distributions ksplice takes input unified diff original kernel source code updates running kernel memory using ksplice require preparation system originally booted running kernel needs special prior compiling example order generate update ksplice must determine code within kernel changed source code patch ksplice performs analysis executable linkable format elf object code layer rather c source code layer apply patch ksplice first freezes execution computer program running system verifies processors middle executing functions modified patch ksplice modifies beginning changed functions instead point new updated versions functions modifies data structures memory need changed finally ksplice resumes processor running left fully automatic ksplice design originally limited patches introduce semantic changes data structures since linux kernel security patches make kinds changes evaluation linux kernel security patches may 2005 may 2008 found ksplice able apply fixes 64 significant kernel vulnerabilities discovered interval 2009 major linux vendors asked customers install kernel update per month patches introduce semantic changes data structures ksplice requires programmer write short amount additional code help apply patch necessary 12 updates time period ksplice software created four mit students based jeff arnold master thesis later created ksplice inc. around may 2009 company mit 100k entrepreneurship competition cyber security challenge global security challenge whereas ksplice software provided open source license ksplice inc. provided service make easier use software ksplice inc. provided prebuilt tested updates red hat centos debian ubuntu fedora linux distributions virtualization technologies openvz virtuozzo also supported updates ubuntu desktop fedora systems provided free charge whereas platforms offered subscription basis 21 july 2011 oracle corporation announced acquired ksplice inc. time company acquired ksplice inc. claimed 700 companies using service protect 100,000 servers service available multiple linux distributions stated time acquisition oracle believes enterprise linux provider offer zero downtime updates explicitly oracle plan support use ksplice technology red hat enterprise linux existing legacy customers continue supported ksplice new customers accepted platforms ksplice available free fedora ubuntu january 2016 ksplice integrated oracle unbreakable enterprise kernel release 4 oracle linux 6 7 oracle redistribution red hat enterprise linux | [
5636,
4616,
3082,
5139,
6675,
7187,
10776,
25,
10780,
4637,
10785,
9762,
6180,
5158,
8233,
7217,
8242,
9266,
9784,
10809,
576,
4161,
8772,
6213,
8268,
589,
593,
10333,
97,
6244,
5222,
10856,
8298,
4207,
7285,
9335,
2168,
1147,
5244,
3197,... | Test |
4,522 | 4 | Linux_Spike_Trojan_malware:linux spike trojan malware linux spike trojan malware widely known mrblack type malware infects routers eventually spreads routers incapsula internet security firm first saw malware december 2014 tool prone attack devices still use default credentials bot type malware allows attacker take control affected computer also known web robots bots usually part network infected machines known botnet typically made victim machines stretch across globe router infected attack injects malware order configure ddos attacks used mitm attacks cookie hijacking attacks targeted router infected mrblack regarded one widespread malware varieties infecting forty thousand routers | [
3941,
2409,
8176,
4863,
87,
823,
7515,
3581,
3807
] | Train |
4,523 | 3 | Socket_1:socket 1 socket 1 originally called overdrive socket second series standard cpu sockets created intel various x86 microprocessors inserted upgrade intel first standard 168-pin pin grid array pga socket first official designation socket 1 intended 486 upgrade socket added one extra pin prevent upgrade chips inserted incorrectly socket 1 169-pin low insertion force lif zero insertion force zif 17×17 pin grid array pga socket suitable 5-volt 16 33 mhz 486 sx 486 dx 486 dx2 486 overdrive processors | [
3588,
5901,
5523,
4246,
2455,
3992,
8855,
11417,
3995,
4252,
6175,
7714,
10019,
2604,
2350,
6192,
9649,
4537,
2874,
7105,
4805,
7110,
8394,
3403,
4427,
4179,
3798,
4185,
7002,
9945,
11484,
9570,
10468,
613,
8552,
1260,
4717,
10225,
371,
4... | Test |
4,524 | 3 | Time_Pilot:time pilot time pilot 夕イム・パイ口ツ卜 multidirectional shooter designed yoshiki okamoto released arcades konami 1982 distributed united states centuri engaging aerial combat player-controlled jet flies across open airspace scrolls indefinitely directions level themed different time period home ports atari 2600 msx colecovision released 1983 sequel time pilot '84 released arcades 1984 top view instead side view allows player shoot guided missiles drops time travel motif instead takes place science fiction-themed landscape player assumes role pilot futuristic fighter jet trying rescue fellow pilots trapped different time eras level player must fight hordes enemy craft defeat much stronger enemy ship player plane always remains center screen 56 enemy craft defeated mothership time period appears destroyed player time-travels next level level parachuting pilot occasionally appear rescuing pilot initially award 1,000 points increase 1,000 points consecutive rescue maximum 5,000 award reset 1,000 points upon losing life advancing level enemy formations appear level formations heralded series quick tones 2,000 points awarded entire formation destroyed within approximately 3 seconds extra lives usually given 10,000 per 50,000 scored thereafter first four levels common enemies motherships fire yellow bullets similar white bullets fired player except travel rather slowly 1910 level biplanes fire bombs addition yellow bullets bombs resemble tin cans initially fired upward accelerate downward moving faster fall bottom screen paths simulate gravity following parabolic trajectory thrown object despite fact player fly downward indefinitely never reach ground time gravity present 1940 planes slimmer biplanes blend background making tougher target level also features red-and-yellow supply planes fly horizontally across screen require multiple hits destroy fire player pose threat long player crash helicopters 1970 smaller airplanes fire bullets well homing missiles missiles travel faster player make sharp turns player destroy missiles shooting avoid turning sharply jets 1982 resemble player craft aggressive making easier player collide fire homing missles helicopters meaning typically missiles screen given time 1982 1970 2001 action shifts outer space enemies flying saucers saucers fire fast-travelling circular bullets blend background asteroids screen hurt player serve camouflage enemies missiles saucers bullets missiles shot destroyed according account yoshiki okamoto proposal time pilot initially rejected boss konami assigned okamoto work driving game instead okamoto secretly gave instructions programmer work idea pretending working driving game front boss fury 1983 clone computer shack trs-80 color computer two unrelated clones name released 1984 kingsoft space pilot commodore 64 superior software space pilot bbc micro remake game rumored works nintendo 64 | [
4357,
9957,
10695,
3788,
10316,
9006,
1776,
6449,
10576,
10931,
8887
] | None |
4,525 | 3 | Multikernel:multikernel multikernel operating system treats multi-core machine network independent cores distributed system assume shared memory rather implements inter-process communications message-passing | [
2179,
10499,
10883,
394,
3978,
1804,
6797,
273,
7057,
6675,
7187,
11539,
9366,
11667,
6296,
25,
10776,
8092,
4637,
7325,
9887,
10016,
9762,
421,
5029,
5158,
10235,
2345,
7983,
3248,
7217,
11184,
10675,
6837,
823,
9784,
4409,
10809,
6075,
... | Test |
4,526 | 7 | PSSC_Labs:pssc labs pssc labs california-based company provides supercomputing solutions united states internationally products include high-performance servers clusters workstations raid storage systems scientific research government military entertainment content creators developers private clouds company implemented clustering software nasa goddard beowulf project supercomputers designed bioinformatics medical imaging computational chemistry scientific applications pssc labs founded 1984 larry lesser 1998 manufactured aeneas supercomputer dr. herbert hamber university california irvine physics astronomy department based linux maximum speed 20.1 gigaflops 2001 company developed cbest software packages utilities custom scripts used ease cluster administration process 2003 company released third version cluster management software support 32-bit 64-bit amd intel processors linux kernel open source tools 2005 pssc labs demonstrated new water-cooling technology high-performance computers acm/ieee supercomputing conference seattle washington 2007 company focused supercomputer development life sciences researchers announced technological solution full-genome data analysis including assembly read mapping analysis large amounts high-throughput dna rna sequencing data 2008 pssc labs designed powerserve quattro i/a 4000 supercomputer genome sequencing 2013 released cloudoop server platform big data analytics hadoop server offers 50tb storage space 1ru company joined cloudera partner program following year certified cloudoop 12000 2014 compatible cloudera enterprise 5 year mapr started using cloudoop 12000 platform record setting time series data base ingestion rate company joined hortonworks partner program 2015 company cloudoop 12000 certified compatible hortonworks hdp 2.2 | [
330,
2834,
8446,
823
] | Test |
4,527 | 3 | Ultima_III:_Exodus:ultima iii exodus ultima iii exodus third game series ultima role-playing video games exodus also name game principal antagonist final installment age darkness trilogy released 1983 first ultima game published origin systems originally developed apple ii exodus eventually ported 13 platforms including nes/famicom remake ultima iii revolves around exodus spawn mondain minax ultima ultima ii respectively threatening world sosaria player travels sosaria defeat exodus restore world peace ultima iii hosts advances graphics particularly animation adds musical score increases player options gameplay larger party interactivity game world ultima iii followed 1985 exodus featured revolutionary graphics time one first computer rpgs display animated characters also exodus differs previous games players direct actions party four characters rather one regular play characters represented single player icon move one however battle mode character represented separately tactical battle screen player alternates commands character order followed enemy character turn differs two previous games ultima series player simply depicted trading blows one opponent main map either defeated enemies overworld map seen least temporarily avoided enemies dungeons appear randomly without forewarning party four player uses chosen beginning game choice 11 classes fighter paladin cleric wizard ranger thief barbarian lark illusionist druid alchemist player also chooses among five races human elf dwarf bobbit fuzzy players assign points statistics strength dexterity intelligence wisdom races determine limitations maximum stat growth thus case intelligence wisdom maximum spellcasting ability character classes differ terms fighting skill magical abilities thieving abilities varying degrees proficiency fighters example use weapons armor lack thieving magic abilities clerics use maces chain armor clerical spells alchemists use daggers cloth armor half wizard spells half thieving abilities character begins level 1 increases individually maximum effective level characters 25 beyond point level continue increase however number hit points fixed 2550 maximum hit points character calculated following formula hp 100 l 50 l current level character character gained enough experience points must transact lord british character level aside ability talk townspeople commands used commands player use bribe steal fight bribing used make certain guards go away post steal used townspeople enemies result conflict townspeople caught player choose fight townsperson prompt guards chase characters always come parties eight difficult defeat also choose fight lord british killed thus resulting long drawn-out fight player ultimately lose lord british temporarily killed cannon fire ship castle moat exiting re-entering castle restores unlike two previous ultima games wire-frame first-person dungeons exodus dungeons solid-3d appearance integrated game plot dungeons necessary obtain certain marks needed finish game dungeon 8 levels deeper level challenging enemies note monsters spawned dungeons based character level overworld monsters rather based dungeon level encountered going deep certain dungeons may hard characters early stages game one find many chests gold weapons armor inside dungeons many trapped aside chests marks one find fountains dungeons heal cure poison peering gems allows see map given dungeon level torches light-casting spells necessary able see inside dungeons three modes travel game foot horseback boat getting around foot slow often lead monsters catching horseback gives advantage moving faster consuming less food making getting away unwanted fights easier getting boat requires players reach certain level pirate ships begin appearing pirate ship defeated boat belongs player obtaining boat necessary order visit island ambrosia reach exodus thus win game denying player ability see behind mountain peaks forests walls overland maps contain many small surprises hidden treasure secret paths out-of-the-way informants look game longer based certain characteristics apple ii hardware rather carefully designed screen layout beating game requires player get four marks four prayer cards get altar exodus insert cards particular order thus defeat exodus set earth story exodus returns player sosaria world game named chief villain exodus creation minax mondain series later describes neither human machine although demonic figure appears cover game exodus turns something like computer possibly artificial intelligence defeat player acquire four magic punch cards insert mainframe specific order beginning game exodus terrorizing land sosaria stronghold isle fire player summoned lord british defeat exodus embarks quest takes lost land ambrosia depths dungeons sosaria receive powerful magical branding marks find mysterious time lord finally isle fire confront exodus lair game ends immediately upon exodus defeat unlike many games genre exodus simply killed battle strong party adventurers puzzle-solving paying attention clues given throughout game end game players instructed report thy victory origin received certificate completion autographed richard garriott although last game series take place sosaria places game ambrosia isle fire make appearances later games ultima vii ultima online ultima iii first game series published richard garriott company origin systems ports appeared many different systems 120,000 copies ultima iii sold video magazine listed game seventh list best selling video games march 1985 ii computing listing fifth magazine list top apple ii games late 1985 based sales market-share data exodus credited game laid foundation role-playing video game genre influencing games dragon quest final fantasy turn exodus influenced wizardry richard garriot credited inspiration behind party-based combat game computer gaming world stated february 1994 exodus game became known ultima hundreds thousands cartridge gamers softline stated ultima iii far surpasses predecessors praising masterfully unified plot individual tactical combat magazine concluded game upgrades market several ways sets new standards fantasy gaming state art happily also shows us maturing artistic discipline part imaginative author computer gaming world scorpia 1983 called ultima iii unquestionably best series far ... many hours enjoyment frustration although criticized ending anticlimactic magazine patricia fitzgibbons 1985 reviewed macintosh version complimented graphics criticized audio stated game adequately use computer user interface describing using mouse aggravating fitzgibbons concluded even though mac conversion far ideal ultima iii enjoyable game well worth hefty price 1993 scorpia stated ultima iii best first trilogy surprisingly quiet nonviolent defeat villain presaged later games resolutions less combative spirit magazine stated february 1994 exodus really first ultima coherent plot beyond typical dungeon romp compute 1984 stated ultima iii ushers exciting new era fantasy role-playing combination superb graphics music excellent playability makes exodus modern-day masterpiece noted cloth map extensive documentation thrilling 3-d dungeons game use time spell system magazine concluded lord british outdone latest work art ... delight play info stated lord british latest offering also best ... many wonderful hours spent unravelling secrets magazine gave amiga version four stars compared five stars 64 version stating graphics user interface could better amiga-tized chicago tribune called ultima iii one best computer games providing epic adventure last months famitsu reviewed 1987 famicom remake scored 32 40 1984 softline readers named game third most-popular apple eighth most-popular atari program 1983 adventure game year prize computer gaming world nowiki /nowiki 1985 reader poll editors wrote although ultima iii well year feel still best game kind score 7.55 10 1988 ultima iii among first members computer gaming world hall fame honoring games rated highly time readers 1996 magazine ranked 144th best game time featuring one nastiest villains grace computer screen demon figure appeared front box caused religious fundamentalists protest made accusations game corrupting youth america encouraging satan worshiping along factors led richard garriott develop next game based virtues ultima series became famous | [
5260,
9006,
7023,
9166,
4530,
11443,
4533,
4536
] | Validation |
4,528 | 9 | DejaGnu:dejagnu dejagnu framework testing programs main script called runtest goes directory looking configuration files runs tests given criteria purpose dejagnu package provide single front end tests part gnu project licensed gpl based expect turn based tcl current maintainers rob savoye ben elliston dejagnu strong history testing due tcl base tcl used extensively companies oracle sybase test products dejagnu allows work much structured tests grouped according tool testing test run merely calling root project directory look directory folders starting run .exp files folder one field dejagnu particularly well suited embedded system design allows testing done remotely development boards separate initialization files created operating system board mainly focuses embedded targets remote hosts dejagnu thus popular many gnu projects universities private companies essential files files set tool apache run tests apache | [
7847,
5032,
4298,
5612,
10732,
7983,
692,
9118
] | None |
4,529 | 9 | Fusebox_(programming):fusebox programming fusebox web application framework cfml php originally released 1997 final version 5.5.2 released may 2012 january 2012 rights fusebox transferred teratech team five developers removed rights placed framework hands community fusebox intended easy learn provide benefits helping developers structure code set simple conventions fusebox also allowed advanced developers build large applications leveraging design patterns object-oriented programming techniques wish fusebox provided web application developers standardized structured way developing applications using relatively straightforward easy learn set core files encouraged conventions addition framework fusebox became closely associated web application development methodology developed proponents known flip fusebox lifecycle process many people refer fusebox methodology fact development framework flip however methodology framework ported used asp jsp lasso perl/cgi php well though cfml php versions fusebox versions gain momentum fusebox dealt primarily effort wiring together view states pages controller actions form submits etc front-end business-logic tier framework address creating maintaining business logic database interaction service layers original concepts behind fusebox based household idiom electrical fusebox controls number circuits one fuse fusebox web application requests routed single point usually codice_1 cfml processed fusebox core files application divided number circuits usually sub-directories intended contain related functionality circuit application divided small files called fuses perform simple tasks fusebox considered implementation front controller common design pattern urls within fusebox web application usually form codice_2 codice_3 name circuit codice_4 xml-defined method within circuit known fuseaction query-string variable name fuseaction vary depending configuration parameters applications using fusebox need use action variable fuseaction fusebox encourages enforce separation presentation logic business logic uses number file naming conventions encourage separation presentation files begin dsp display lay layout database access files begin qry query general business files begin act action typical file names format prefix filename like dsp_loginform.cfm additional naming conventions used fusebox developers common ones another concept fusebox encourages parameterize exit points web page coding variables set circuit control file exit points known xfas exit fuseactions idea parameterizing exit points web page flow control updated easily allowing reuse web pages fragments thereof associated framework strictly part concept fusedocs semi-formalized form documentation written xml specifies inputs outputs fuse file third-party tools available use fusedocs things like generate test harness code fusebox several major revisions years fusebox 3 control files written underlying programming language e.g. fbx_switch.cfm cfml fusebox 4 later versions use xml control files fusebox.xml circuit.xml framework components written using underlying programming language e.g fusebox5.cfm cfml theory helps improve tool support framework also allowed pre-parsing generation single template processing fuseaction greatly increasing performance fusebox 5.5 allows xml files omitted certain conventions followed fusebox 1 grew conversation cf-talk mailing list april 1998 steve nelson gabe roffman credited creating original fusebox though first fusebox program written josh cyr methodology constantly evolving beyond whitepaper handful examples official documentation existed developers exposed fusebox early days craig girard steve nelson along hal helms nat papovich wrote book fusebox methodology techniques published 2000 fusion authority programmers followed practices described book said fusebox 2 hal helms built upon fusebox 2 called ideas extended fusebox xfb fusebox 3 written primarily hal helms john quarto-von tivadar nat papovich effort leading members fusebox community incorporate xfb ideas reusable library known core files simple api allowed application code communicate core files upon release fall 2001 fusebox became framework rather methodology subsequent 3.01 release addressed minor issues fusebox 3 something sea-change fusebox 2 original principles remained relatively unchanged fusebox 2 fusebox 3 application structured differently fusebox 4 complete rewrite fusebox 3 license core files open source held private company owned hal helms john quarto-von tivadar fusebox corporation appears defunct corporation fusebox 4.1 introduced new xml grammar elements beyond available 4.0 let declare instantiate manipulate objects com java coldfusion components well web services features provided fusebox developers means tying object-oriented models i.e business-logic directly controllers however many fusebox developers used object-oriented highly structured models earlier versions fusebox current versions without use grammar elements 2006 fusebox corporation asked sean corfield take lead developing next iteration fusebox fusebox 5 another complete rewrite new features improved performance fusebox 5 nearly completely maintained backwards-compatibility fusebox 4.1 november 2006 fusebox corporation transferred ownership core files fusebox website teratech guidance teratech president fusebox speaker michael smith teratech announced fusebox remain open source seeking increase community involvement project fusebox 5.1 subsequent releases licensed apache source license 2.0 february 2007 members team fusebox met frameworks conference bethesda maryland created plan action community involvement using volunteers nine different areas fusebox release focused primarily adding set conventions allow creation fusebox applications without xml configuration files use new features instead xml called implicit fusebox release fusebox 5.5.1 march 2008 last release sean corfield august 2008 adam haskell took development became frustrated fusebox organization attempted branch new framework called fuseng ng next generation star trek reference fuseng quickly lost steam ended without release january 2012 team five community developers led john blayter announced fusebox mailing list obtained rights copyright fusebox teratech framework code copyright removed available github encourage community participation fusebox 5.6 goals announced never implemented | [
1920,
3462,
8582,
3469,
2062,
9614,
2576,
9618,
148,
1812,
4507,
6941,
9245,
10526,
4512,
8739,
3876,
11688,
4777,
5165,
7987,
692,
2485,
7862,
3895,
5048,
8883,
6074,
9144,
190,
5314,
9666,
8644,
1353,
595,
84,
4056,
6493,
479,
102,
85... | None |
4,530 | 3 | Ultima_I:_The_First_Age_of_Darkness:ultima first age darkness ultima later known ultima first age darkness simply ultima first game ultima series role-playing video games created richard garriott originally released apple ii first published united states california pacific computer company registered copyright game september 2 1980 officially released june 1981 since release game completely re-coded ported many different platforms 1986 re-code ultima commonly known available version game ultima revolves around quest find destroy gem immortality used evil wizard mondain enslave lands sosaria gem possession killed minions roam terrorize countryside player takes role stranger individual summoned another world end rule mondain game follows endeavors stranger task involves progressing many aspects game play including dungeon crawling space travel game one first definitive commercial computer rpgs considered important influential turning point development genre throughout years come addition influences rpg genre also first open-world computer game world ultima presented variety different ways overworld projected topdown third-person view dungeons displayed first-person one-point perspective scenarios player character controlled keyboard directional arrows shortcut keys used commands attack b board character creation start ultima unlike simplified version traditional tabletop role-playing games player presented number points distribute various statistics affect competence certain aspects gameplay example adding points strength statistic increase amount damage inflicted foe adding points charisma results cheaper deals merchants portion character creation completed player given choice four races human elf dwarf bobbit hobbit-like creature depending race picked points added various statistics e.g elves receive points agility statistic dwarves receive strength points race chosen player given list four classes choose distribute additional points appropriate statistics classes fighter cleric wizard thief player also asked choose gender player character though stat difference simple sprite character looks four statistics used gameplay hit points food experience points coin gold original release hit points determine health character fewer hp character closer death hit points obtained variety ways including acts emerging alive dungeon giving tribute payment one eight lords sosaria food consumed every two tiles character moves except castles towns food supply drops zero character die food bought towns prevent situation occurring experience points received successfully battle monsters determine character levels one thousand points needed progress new level vital item near end game obtained player reached eighth level coin used buy things game world weapons spells food obtained defeating monsters rescuing princesses castles game also sports arcade-like first-person space shooter section gameplay element appeared ultima subsequent games series player participates real-time space combat environment confronted enemy spaceships must shoot order progress along story richard garriott says added wanted fill every space disk everything possibly could ultima set fictional world sosaria land broken four different continents land ruled total eight different lords two world four land masses four continents contain two castles quests obtained player two types quests given castles—one entails visiting certain location main map killing specific type monster dungeons fulfilling former type quest gives stat boosts latter gains player important item needed reach endgame also variety towns different goods services purchased world dungeons explored populated forests mountain ranges lakes oceans towns exactly alike original release game dungeons maps different designed rather randomly created castles differ different quests may assigned 1986 remake variety added appearance content towns castles sosaria inhabited numerous monsters beasts attack player character sight also ruins places interest continent usually somewhat hard-to-reach places small islands player enter order receive rewards usually form weapon statistic boost order solve quests two main characters featured ultima mondain evil wizard antagonist induced reign terror world sosaria protagonist character player choosing game features lord british richard garriott first game akalabeth introduction characters iolo shamino three characters become staples nearly future ultima games see list ultima characters story ultima revolves around evil wizard mondain rule kingdom sosaria according game back story mondain created evil gem 1000 years ago granted immortality since mondain released monsters beasts upon land ravage villages towns sosaria cause nobles bicker amongst effort stop mondain dominion lord british searches person bring wizard end call answered player player informed way defeat mondain travel back time kill gem immortality created majority game spent searching time machine way activate four lords game one realm hold gem allow time machine work four gems found exchange gem lord ask player complete quest involves traveling dungeon killing specific creature achieved lord hand gem time machine also needs found purchasing space shuttle traveling outer space prerequisite —the player must become space ace destroying 20 enemy ships order complete game task completed rescuing princess reveal location time machine always appears north castle princess held prisoner main character travel back time face mondain completed gem immortality destroying gem requirement beating game well killing wizard mondain dead player transported one thousand years future rewarded lord british richard garriott started development ultima unexpected success previous game large sections akalabeth used subroutines within ultima create first-person dungeon sections game towns quests plot user interface added original akalabeth code ultima completed star wars elements also added including spaceships lightsabers development ultima done garriott freshman year university texas help friend ken w. arnold finished less year ultima coded applesoft basic apple ii computer arnold wrote code assembly language tile-based graphics system first game genre unlike akalabeth commercial sale afterthought hobbyist endeavor ultima approached much professional attitude right start project game first planned called ultimatum discovered name already use board game company shortened ultima garriott later commented title wrote first game course idea would ever second california pacific computer company published ultima 1981 apple ii june 1982 sold 20,000 copies went sell 50,000 copies sierra online re-released ultima atari 8-bit computers 1986 origin systems completely re-coded game assembly re-released 1986 remake re-coded entirely assembly significantly improved running speed able handle superior graphics small cosmetic changes content also made addition another castle map variant three new city maps introduction traveling monsters outdoors section division money player separate copper silver gold coins first released apple ii december 23 1986 ultima first age darkness ports commodore 64 dos/ega also released many subsequent releases made later years including 1989 version msx2 published japan pony canyon well apple ii specific port late 1994 vitesse 1997 dos/ega version ultima released electronic arts part ultima collection softline stated 1981 ultima seems best available apple ii role-playing game magazine called graphics impressive concluded retails 39.95 well worth price computer gaming world 1991 1993 called game truly epic scope stating among first outdoor settings npc conversations noting unbalanced combat system magazine concluded ultima classic missed | [
712,
5260,
4527,
9137,
4533,
1142,
4536,
5436,
477
] | Test |
4,531 | 0 | Lemmatisation:lemmatisation lemmatisation lemmatization linguistics process grouping together inflected forms word analysed single item identified word lemma dictionary form computational linguistics lemmatisation algorithmic process determining lemma word based intended meaning unlike stemming lemmatisation depends correctly identifying intended part speech meaning word sentence well within larger context surrounding sentence neighboring sentences even entire document result developing efficient lemmatisation algorithms open area research many languages words appear several inflected forms example english verb 'to walk may appear 'walk 'walked 'walks 'walking base form 'walk one might look dictionary called lemma word association base form part speech often called lexeme word lemmatisation closely related stemming difference stemmer operates single word without knowledge context therefore discriminate words different meanings depending part speech however stemmers typically easier implement run faster reduced accuracy may matter applications fact used within information retrieval systems stemming improves query recall accuracy true positive rate compared lemmatisation nonetheless stemming reduces precision true negative rate systems instance document indexing software like lucene store base stemmed format word without knowledge meaning considering word formation grammar rules stemmed word might valid word 'lazy seen example stemmed many stemmers 'lazi purpose stemming produce appropriate lemma – challenging task requires knowledge context main purpose stemming map different forms word single form rules-based algorithm dependent upon spelling word sacrifices accuracy ensure example 'laziness stemmed 'lazi stem 'lazy trivial way lemmatization simple dictionary lookup works well straightforward inflected forms rule-based system needed cases languages long compound words rules either hand-crafted learned automatically annotated corpus morphological analysis published biomedical literature yield useful results morphological processing biomedical text effective specialised lemmatisation program biomedicine may improve accuracy practical information extraction tasks | [
5122,
2440,
2059,
6798,
11538,
1044,
5399,
538,
7599,
4662,
3127,
2488,
10557,
6208,
3533,
5197,
6223,
8538,
5857,
1890,
7780,
7918,
8046,
8688,
10231,
8440,
7164
] | None |
4,532 | 2 | Repair_permissions:repair permissions repairing disk permissions troubleshooting activity commonly associated macos operating system apple efficacy repairing permissions troubleshoot application errors debated bsd layer macos responsible file-system security including management unix posix permissions model applications depend correct assignment interpretation permissions order function properly repairing permissions involves checking permissions set files folders volume macos installed list correct posix permissions correcting discrepancies list correct permissions compiled consulting various bill-of-materials .bom files typically files stored within reduced-size installer package .pkg files receipts folder local library directory /library/receipts volume checked whenever user installs software uses macos installer package format bill-of-materials file created consulted future permission repair files whose permissions incorrectly altered administrator administrator operating root privileges poorly designed installer package installed similar privileges cause wide array problems ranging application errors inability boot macos repairing permissions become necessary become increasingly less versions panther 10.3 os x el capitan apple introduced security feature called system integrity protection enabled root privileges longer able change system files folders including permissions permissions repairs instead performed automatically upon system installs updates end disk utility well corresponding diskutil command-line utility lost ability repair permissions systems prior os x el capitan permissions repair performed selecting startup volume clicking repair disk permissions button first aid section disk utility operation also performed using diskutil command-line utility el capitan user instead use two command-line utilities pkgutil repair particular packages /usr/libexec/repair_packages repair standard set system packages cases user disable system integrity protection change permissions system files directories macos sierra /usr/libexec/repair_packages available permissions also repaired using third-party utilities apotek applejack prosoft engineering drive genius | [
1509,
811,
7983,
5492,
10036,
6264,
700
] | Train |
4,533 | 3 | Ultima_II:_The_Revenge_of_the_Enchantress:ultima ii revenge enchantress ultima ii revenge enchantress released august 24 1982 apple ii usco pa-317-502 second role-playing video game ultima series second installment ultima age darkness trilogy also official ultima game published sierra on-line controversy sierra royalties pc port game led series creator richard garriott start company origin systems plot ultima ii revolves around evil enchantress minax taking world exacting revenge player player defeat mondain player travels time acquire means defeat minax restore world peace ultima ii larger game world ultima hosts advances graphics gameplay gameplay similar previous game series scope game bigger several places explore even though like solar system planets dungeons towers required complete game game player travel several different time periods earth using time doors periods time legends mythological period pangea 300 250 million years ago b.c 1423 dawn civilization a.d. 1990 aftermath 2112 player also travel space planets solar system visited game story player learns lover dark wizard mondain enchantress minax threatening earth disturbances space-time continuum player must guide hero time solar system order defeat evil plot young minax survived mentor lover death hands stranger went hiding several years later minax got older powerful mondain minax wanted avenge death lover used time doors created mondain defeat travel time legends place located origin times sent evil minions different time eras also used dark powers disturb fabric time influence men ultimately destroyed far future nearly wiping humanity lord british called hero crush minax evil plans stranger answered british call game begins stranger starting quest defeat minax minax castle named shadow guard reached time doors similar moongates later games even enchanted ring required pass force fields inside hero hunts sorceress time legends pursues teleports throughout castle destroys quicksword enilno even though ultima set fictional land sosaria ultima ii borrowed characters story ultima relocated earth garriott explained narrative perspective earth needed used basis comparison due time travel element later games ultima series ret-conned assumed ultima ii actually happened sosaria earth create continuity among games ultima ii garriott first program wrote completely assembly language instead interpreted basic playing speed reaction time vastly improved original release ultima since garriott attending university texas time took almost two years create ultima ii including learning assembly one month tom luhrs author popular apple ii arcade game apple-oids ultima ii first game series include cloth map inside box would become staple franchise map illustrated time doors linked inspired one seen film time bandits time doors california pacific computer published garriott first two games financial difficulties pay full royalties publishers approached garriott insisted including map sierra on-line agreed provided garriott left university technical assistance developed first major assembly-language project two versions map produced first version heavier thicker material map found large boxed 8 x11 apple ii atari 800 versions game later production runs game featured much smaller box lighter weight map despite reservations richard garriott chuck bueche original apple ii version game copy-protected using sierra new spiradisc system original apple ultima ii received audiovisual upgrade 1989 bringing graphics date recent games series much done ultima enhanced version available part ultima trilogy i-ii-iii box set released year discontinued months later commodore ibm versions ultima trilogy include original unenhanced versions game respective platforms game re-released several times later cd-rom pc compilations including 1998 ultima collection re-releases missing necessary map files planets earth however map planet x intact game still winnable modern fast computers also generate divide zero error attempting run game issues addressed fan patches created voyager dragon fan series available website exodus project game known run without errors acceptable speed dosbox environment provided missing map files present ultima ii first game series officially ported platforms apple ii atari version released late 1983 several months apple original requires atari 800 810 disk drive game mostly direct port apple ii utilizing computer high resolution graphics works similar manner apple ii hgr mode otherwise take advantage atari advanced features c64 port apparently released programmer credited bobbit could finish consequence missing gameplay elements also simplified title screen text characters instead dragon graphic versions otherwise commodore 64 version takes advantage platform advanced graphics sound ibm version ultima ii dos game run self-booting disk unusual game released 1983 supports cga graphics pc speaker sound also uses cpu timing hence run fast anything except 8088 pc ultima ii designed dos 1.x support subdirectories save games must directory game files pc port also prone generating divide zero errors crashing dos prompt 1985 sierra released port ultima ii macintosh 128/512 along ultima iii would classic ultima games available macintosh family game compatible mac os versions system 6 run system 7.5 patch atari st port one earliest commercially released games system coming shortly computer june 1985 launch utilizes mostly simple block graphics little enhancement st hardware capabilities runs within tos self-booting disk atari st games softline 1983 stated ultima ii continues interplanetary saga creative programming flair far beyond scope fantasy adventure games magazine concluded lord british another greater hit hands ... ultimate real-time type fantasy games micro computer gaming world 1983 gave ultima ii positive review noting many improvements predecessor particularly amount detail magazine praised large size game world even though little necessary complete game suggesting additional scenarios would added leading ultimate quest 1991 1993 magazine scorpia called good sequel original game k-power gave game 7 points 10 magazine described animated graphic adventure game stated ultima ii sophisticated quicker pace predecessor fascinating world concluded game unique storyline original pc magazine gave ultima ii 15.5 points 18 also praising game great big wonderful world ultima ii sold 50,000 1982 100,000 copies date nominated best adventure game home computer 1983 origins game fair losing knight diamonds | [
4527,
10449,
4530,
4536,
477
] | Validation |
4,534 | 3 | Link_register:link register link register special-purpose register holds address return function call completes efficient traditional scheme storing return addressed call stack sometimes called machine stack link register require writes reads memory containing stack save considerable percentage execution time repeated calls small subroutines link register used many instruction set architectures powerpc arm pa-risc architectures sparc register purpose another name case output register 7 o7 usage link register general-purpose register done instruction set architectures allows faster calls leaf subroutines subroutine non-leaf passing return address register still result generation efficient code thunks e.g function whose sole purpose call another function arguments rearranged way subroutines benefit use link register saved batch callee-used registers—e.g arm subroutine pushes registers 4-7 along link register lr single instruction codice_1 pipelining memory writes required | [
9911,
9964,
5358,
5040,
8944,
1399,
8700
] | Validation |
4,535 | 2 | Job_Entry_Subsystem_2/3:job entry subsystem 2/3 job entry subsystem jes component ibm mainframe operating systems responsible managing batch workloads modern times two distinct implementations job entry system called jes2 jes3 designed provide efficient execution batch jobs job processing divided several phases provide parallelism pipelining phases include input processing jobs read interpreted execution phase jobs run output processing job output printed stored dasd jobs phase execution usually said reside particular queue example jobs currently executing execution queue improve i/o efficiency jes performs spooling provides multiple jobs simultaneous access common storage volume jes uses structure called checkpoint backup information currently executing jobs associated output checkpoint used restore jobs output event unexpected hardware software failures although jes2 jes3 provide core functionality certain features may present one jes differences one jes may favored certain customer installations jcl used define jobs jes2 jes3 small changes usually need made jcl get job written one jes run os/360 batch job processing limited operational flexibility performance addressed two field-developed packages called houston automatic spooling priority hasp attached support processor asp hasp developed ibm federal systems division contractors johnson space center houston originally managed job scheduling print punch output single os/360 computer multi access spool capability added let peer computers share common job queue print/punch output queues introduction system/370 1972 ibm rewrote hasp become standard part system renamed job entry subsystem 2 jes2 introduced os/vs2 release 2 also known mvs 1973 many years hasp labels removed source code messages issued jes2 still prefixed codice_1 several jes2 commands continue support specification either codice_2 codice_3 maintain backwards compatibility asp initially stood attached support processor developed provide efficient use multiple os/360 systems shared workload allowed one central system distribute jobs multiple connected systems asp announced march 1967 year reported running stably asp evolved design 7094/7044 direct coupled system using data channel data channel communication attaching ibm 7044 peripheral processor throughput doubled typical asp configuration small mainframe 360/40 called support system controlled one 360/65 larger processors called main systems computers connected selector channels host attached channel-to-channel adapters early form short distance point-to-point computer networking asp required purchase additional computer manage input output hosts running job workload economically justified high cost standalone byte-multiplexor channels needed drive printers punched card reader devices 360/50 smaller systems built-in byte multiplexor channel whereas faster 360/65 larger systems required relatively expensive standalone unit using asp made possible avoid cost byte multiplexor channel offloading job scheduling print card handling also offloaded functions larger machines increased reliability another advantage offset added hardware cost one main systems could fail taken offline maintenance without taking whole complex asp primarily targeted large government agencies defense contractors might many six 360/65s scheduled managed separate asp machine uncommon variant local asp lasp single large machine asp functions running machine 1970s notable installation asp princeton university controlling ibm 360/91 mainframe 1973 ibm rewrote asp renamed jes3 supporting mvs also jes os/vs1 often referred jes1 addition master mstr subsystem built modern z/os operating system start jobs run outside control jes including primary jes source code provided ibm customers asp hasp many customers made substantial enhancements programs incorporated official product far installations made use hasp asp contemporary z/os systems many jes2 installations jes3 unique history ibm continues ship jes2 jes3 source code instead object code unlike components operating system improve maintainability serviceability user-written enhancements jes provides set exit points pass control jes user programs key points processing extensions provide custom functionality special commands custom print page headings non-standard job processing 2017 ibm released statement direction jes2 strategic jes meaning future development efforts focused jes2 rather jes3 ibm reassured customers jes3 continue supported end-of-support date announced february 2019 ibm announced z/os 2.5 expected released 2021 last version z/os include jes3 | [
11131,
11236,
8037,
6342,
7881,
3916,
7053,
340,
437,
9814,
3323,
2172
] | Test |
4,536 | 3 | Ultima_IV:_Quest_of_the_Avatar:ultima iv quest avatar ultima iv quest avatar first released 1985 apple ii fourth series ultima role-playing video games first age enlightenment trilogy shifting series hack slash dungeon crawl gameplay age darkness predecessors towards ethically-nuanced story-driven approach ultima iv much larger game world predecessors overworld map sixteen times size ultima iii puzzle-filled dungeon rooms explore ultima iv advances franchise dialog improvements new means travel exploration world interactivity 1996 computer gaming world named ultima iv 2 best games time list pc designer richard garriott considers game among favorites ultima series ultima iv followed release 1988 ultima iv among computer role-playing games perhaps first game story center asking player overcome tangible ultimate evil defeat members triad evil previous three ultima games world sosaria underwent radical changes geography three quarters world disappeared continents rose sank new cities built replace ones lost eventually world unified lord british rule renamed britannia lord british felt people lacked purpose great struggles triad concerned spiritual well-being unfamiliar new age relative peace proclaimed quest avatar needed someone step forth become shining example others follow unlike rpgs game set age darkness prosperous britannia resembles renaissance italy king arthur camelot object game focus main character development virtuous life—possible land peace—and become spiritual leader example people world britannia game follows protagonist struggle understand exercise eight virtues proving understanding virtues locating several artifacts finally descending dungeon called stygian abyss gain access codex ultimate wisdom protagonist becomes avatar conversely actions game could remove character gained virtues distancing construction truth love courage greater axiom infinity—all required complete game though avatarhood exclusive one chosen person hero remains known avatar throughout later games time passes increasingly regarded myth instead simply choosing stats assign points first three ultima games players asked various ethical dilemmas gypsy fortune-teller using remotely tarot-like cards eight virtues situations one correct resolution rather players must rank eight virtues whichever stands highest priority determines type character play example choosing compassion creates bard honor paladin sacrifice tinker also first ultima playing human necessary eliminating races elves dwarves bobbits found previous games however even first three ultima could chosen player characters never non-player characters non-human races although profession embodies particular virtue become avatar player must achieve enlightenment eight virtues virtue affects npcs interact player enlightenment virtues achieved player actions well meditation shrines shrines virtues scattered britannia requiring player possess corresponding virtue rune allowing entry meditation correctly repeating virtue mantra three times shrine player gains insight ultimately enlightenment virtue seer hawkwind lord british castle provides player feedback progress virtues offering advice actions improve standing eight virtues informing ready visit shrine elevation chastising character hath strayed far path avatar player may encouraged give alms poor improve sacrifice never flee battle improve honor players equally able lower virtue in-game actions stealing crops food lowering honesty selecting bragging response dialog certain characters lowers humility actions minor effect virtue progress certain actions immediate devastating effect player progress multiple virtues attacking npc sleep technically game similar although much larger first ultima feature real conversation system whereas npcs earlier games would give one canned answer talked players could interact specifying subject conversation subject determined either standard set questions name job health information gleaned previous answers characters many sub-quests arranged around users playing game second time could save considerable time knowing answers key questions frequently required travel another city talk another npc least one case player asked sent may require yet another round trip cities another addition dungeon rooms uniquely designed combat areas dungeons supplemented standard combat randomly appearing enemies ultima iv open world game quests completed order fetch quests although turn-based game clock runs game running player act npcs monsters may move time passes time important aspect game certain actions performed certain times world britannia first introduced full world map series greatly change later games player may travel britannia foot horseback across sea ship air lighter air device speed ease travel affected mode travel well terrain wind eight virtues avatar relationship three principles truth love courage gameplay designed around follows richard garriott stated receive customer feedback first three games neither california pacific computer sierra on-line forwarded mail company released ultima iii garriott—who attended interdenominational christian sunday school teenager—realized partly letters enraged parents earlier games immoral actions like stealing murder peaceful citizens necessary least useful actions order win game features might objectionable garriott stated wanted become good storyteller make certain story content 90 games including first three ultima games called go kill evil bad guy stories said ultima iv first one ethical overtones also better told story shay addams garriott official biographer wrote decided people going look hidden meaning work n't even exist would introduce ideas symbols meaning significance deemed worthwhile give something could really think encourage sense responsibility character actions players intended feel playing transported fantasy realm separate person garriott removed gameplay elements believed would prevent players identifying personally character playing non-human retrospect 1up.com described ultima iv direct barb self-appointed moral crusaders sought demonize rpgs complained irony seeing 'evil rpg better present christian admonition back faith works quiet modesty bible-waving watchdog decrying medium seems lost game moral dilemmas designed give players opportunity reap temporary rewards amoral behavior realize later penalized garriott hoped would approach later dilemmas thoughtfulness near end game took advantage encourage players overthink puzzles question morality choices one point players seemingly required murder innocents revealed demons disguise though one playtester threatened quit dilemma garriott refused remove game reasoning served purpose provoking emotional response concept virtues inspired tv show avatars hindu mythology described avatars master 16 different virtues eight virtues used game derived combinations truth love courage set motivators garriott found worked best also found one favorite films wizard oz game took two years develop twice garriott described playtesting slightly rushed make christmas season one finish playing game time went publishing like contemporary origin games ultima iv developed apple ii series ported computers partially garriott apple ii user/coder partially developing games first made ports easier garriott said 1984 commodore 64 atari 8-bit sprites hardware sound chips made porting apple far difficult perhaps even impossible ... apple version never get done like previous games ultima iv permit saving dungeons technical limitations garriott described non-trivial ankh used onward symbol avatar virtuous path chosen garriott saw film logan run like previous ultima richard garriott wrote core code however games getting complex one person handle required call outside assistance programming tasks familiar music optimized disk routines ultima iv first game series require 64k apple ii primarily targeted newer apple iie iic although still capable running apple ii+ language card used boost system 64k garriott still using ii+ time happened ultima iii ultima iv also included support mockingboard sound card enabled apple ii users 3-voice music custom disk routines allowed ultima iv faster disk access previous games also important growing size game caused use two floppy disks instead one dialog two npcs apple ii release accidentally entered leaving default test states one npcs elusive game provided player final answer would require complete game character responding properly players forced guess correct answer find sources outside game complete bug would later acknowledged ultima v npc appears admits mistake player c64 port first series take full advantage computer hardware rather simply converting sound graphics apple ii include in-game music came two 1541 disks like apple ii side 1 disk 1 labeled program copy protected disk sides overworld town dungeon user instructed make backups ultima iv also added support two disk drives case user would keep overworld side disk 1 drive 0 flip town/dungeon disk needed drive 1 overworld disk also used load/save player progress one biggest criticisms c64 port lack disk fast loader made extremely slow disk access speed-optimized disk routines apple version ultima iv final game series ported atari 8-bit family game still designed support 48k atari 800 even though four models 64k/128k atari 8-bit computers released one 64k-upgradable model starting two half years earlier order fit game 48k atari 8-bit version cut music support reason 48k made requirement instead 64k requirement apple ii version whereas earliest apple ii models upgradable 64k atari 400/800 officially upgradable 48k since apple version programmed require 64k apple 6502 code ported create atari 8-bit commodore 64 version would required extra programming selectively use 48k/64k including music support 64k machines since atari 8-bit market smallest installed bases game initially released special support provided similar reasons game distributed earliest 90k atari 810 disk format require disk drive upgrade players thus occupies four disks instead two disks apple ii commodore 64 versions similar c64 port ibm version ultima iv released two years 8-bit versions takes proper advantage hardware first time instead rushed conversion apple ii ega tandy graphics support added well proper hard disk support game finally supported dos 2.x subdirectories however music ibm version even though tandy 1000 series 3-voice sound chip atari st version ultima iv released 1987 amiga version 1988 extremely similar pc port fully utilize machines respective hardware features particular amiga version 16-color graphics although amiga could display 64 screen without using copper processor make color palette changes however atari st version support midi music one could play music connected midi synthesizer sampler ports made use mouse limited use native operating system windowing environment mouse cursor support dialog boxes requesting disks etc. like ultima iii ultima iv released nes fci pony canyon version titled ultima quest avatar released 1990 nes port ultima iv different versions graphics completely redone music dialogue options greatly reduced among gameplay changes player seven recruitable characters player party time one could versions character four player could would stay hostel castle britannia requiring player return change characters however combat system fairly close personal computer games additional option use automated combat additionally spell-casting simplified removing need mix spells puzzles removed well port also replaced character julia tinker male character named julius changes done memory limitations single cartridge instead multiple floppy diskettes ultima iv quest avatar master system ultima ported sega platform released 1990 ported published sega port features completely re-drawn graphics although unlike nes port style retained origin version simpler conversation system unlike nes version uses regular ultima iv background music although master system easily capable displaying complex first-person scenes found ultima iv see phantasy star version dungeons viewed top-down perspective much like ultima vi released year seems cartridges produced european market contain multi-lingual english french german manual books original version well folded paper map books different colour three editions blue uk version fully translated fit inside game box graphical error version gypsy picture man mustache even though gypsy referred throughout text xu4 cross-platform game engine recreation ultima iv development dreamcast linux mac os x risc os windows two remakes using neverwinter nights engine online version written adobe flash march 2011 electronic arts sent dmca cease desist notice fan project 2015 also fan-made remaster project commodore 64 version game released source code github addressing bugs improving aspects game ultima iv available free gog.com publisher ip owner electronic arts released game freeware 2011 promote free-to-play remake would release 2013 garriott stated 1985 interview working ultima iv part 2 ultima v ultima v appeared global sales ultima iv surpassed 400,000 copies mid-1989 scorpia computer gaming world 1986 called incredible game criticizing fact experience came combat stated became tedious scorpia concluded waiting classic ... go get game became first replace —the top-rated adventure game five years—in magazine reader poll named ultima iv game year 1986 1987 scorpia cited ultima iv taking genre away hack slash— first time crpg whose focus character development many monsters kill much loot pick —in 1991 1993 called favorite game 1994 stated maybe nothing ever surpass retiring reviewing games called all-time number one favorite rpg june 1986 dragon hartley pattie lesser called ultima iv impressive complex adventure date total adventuring environment takes place across entire continent september 1986 issue mike gray lauded game best computer simulation true fantasy role-playing experience ever seen apple ii commodore 64 128 treasure hoard computer frp games complete unless get hands one praised ultima iv incredible find store ’ pass ... ’ discouraged takes find copy — search easy one compared awaits start quest avatar famitsu reviewed nes/famicom version scored 31 40 ultima iv top game billboard list software best sellers february march 1986 co-creator dave arneson 1988 wrote ultima iv games stood pretty much alone quirks instead trend setters crpg industry games follow innovations score 7.80 10 1988 ultima iv among first members computer gaming world hall fame games rated highly time readers 1990 game received third-highest number votes survey readers all-time favorites 1996 magazine ranked second-best video game time second most-innovative computer game 2013 ign placed ultima iv 26 list top 100 rpgs time 2015 peter tieryas tor.com stated nes version represented different type ideal ... make narrative determine course journey engendering sense immersion effect making feel like control previous rpg | [
5260,
6797,
9006,
4527,
4530,
11443,
4533,
11221,
823
] | Validation |
4,537 | 3 | Socket_2:socket 2 socket 2 one series cpu sockets various x86 microprocessors inserted updated socket 1 added support pentium overdrive processors socket 2 238-pin low insertion force lif zero insertion force zif 19×19 pin grid array pga socket suitable 5-volt 25 66 mhz 486 sx 486 dx 486 dx2 486 overdrive 63 83 mhz pentium overdrive processors | [
5901,
8851,
4246,
2455,
3992,
8855,
11417,
3995,
4252,
6175,
7714,
10019,
4523,
2604,
2350,
6192,
9649,
2874,
7105,
4805,
7110,
8394,
3403,
4427,
4179,
3798,
4185,
7002,
9945,
11484,
9570,
10468,
613,
8552,
1260,
4717,
10225,
371,
499,
95... | Test |
4,538 | 7 | Apache_Hama:apache hama apache hama distributed computing framework based bulk synchronous parallel computing techniques massive scientific computations e.g. matrix graph network algorithms top level project apache software foundation created edward j. yoon named short hadoop matrix inspired google pregel large-scale graph computing framework described 2010 hama also means hippopotamus korean language 하마 following trend naming apache projects animals zoology apache pig hama consists three major components bspmaster groomservers zookeeper bspmaster responsible bsp master multiple grooms started script bsp master starts rpc server groom servers groom servers starts bsppeer instance rpc proxy contact bsp master started groom periodically sends heartbeat message encloses groom server status including maximum task capacity unused memory time bsp master receives heartbeat message brings up-to-date groom server status bsp master makes use groom servers status order effectively assign tasks idle groom servers returns heartbeat response contains assigned tasks others actions groom server fifo job scheduler simple task assignment algorithms groom server shortly referred groom process performs bsp tasks assigned bspmaster groom contacts bspmaster takes assigned tasks reports status means periodical piggybacks bspmaster groom designed run hdfs distributed storages basically groom server data node run one physical node zookeeper used manage efficient barrier synchronisation bsppeers | [
10377,
8460,
7567,
1296,
6161,
1047,
8217,
11161,
6555,
8860,
3877,
10661,
11303,
5677,
1327,
7983,
4919,
5047,
6074,
1851,
7485,
7742,
9789,
7233,
6338,
4419,
1222,
1991,
4294,
7750,
5066,
8139,
4944,
1363,
8408,
9179,
7261,
990,
8799,
1... | Validation |
4,539 | 1 | National_Information_Governance_Board_for_Health_and_Social_Care:national information governance board health social care national information governance board health social care nigb established united kingdom section 157 health social care act 2008 effect october 2008 range advisory functions relating information governance january 2009 nigb also gained functions section 251 nhs act 2006 previously held patient information advisory group piag abolition functions advise secretary state health use powers set aside common law duty confidentiality england identifiable patient information needed consent practicable 1 april 2013 nigb functions monitoring improving information governance practice transferred care quality commission established national information governance committee oversee work functions relating section 251 nhs act 2006 access people personal confidential information research purposes transferred health research authority confidentiality advisory group key functions nigb excerpted legislation definition “ relevant information ” legislation covers patient information information obtained generated course provision health service information obtained generated course exercise local social services authority england adult social services functions areas nigb functions e delegated nigb ethics confidentiality committee ecc functions primarily related applications use identifiable patient information without consent specific circumstances within bounds section 251 nhs act 2006 applications considered piag nigb passed health research authority confidentiality advisory group cag 1 april 2013 nigb also replaced care record development board crdb closed september 2007 nigb subsequently maintained nhs care record guarantee originally developed crdb developed companion social care record guarantee nigb consisted chair number public members appointed nhs appointments commission number representative members appointed secretary state health range stakeholder organisations representatives several stakeholder organisations served corresponding advisers nigb typically attended meetings regular observers meetings included representatives information commissioner office devolved uk administrations ecc consisted chair number members appointed nigb advice nhs appointments commission approved independent assessor ecc chair two ecc members also nigb members 1 june 2011 31 march 2013 dame fiona caldicott chair nigb succeeding harry cayton chaired nigb since inception members nigb ecc widely distributed nationally attended meetings nigb office since september 2011 based skipton house london se1 nigb staff team predominantly based office result health social care act 2012 nigb abolished effect 1 april 2013 functions delegated ecc respect research transferred health research authority nhs commissioning board responsible providing advice guidance nhs bodies functions transferred national information governance committee hosted care quality commission | [] | Test |
4,540 | 3 | Front_Line_(video_game):front line video game game created tetsuya sasaki influenced space invaders galaga 1985 ikari warriors follows conventions established front line including vertically scrolling levels entering/exiting tanks dying occupied tank destroyed playing lone soldier player ultimate objective lob hand grenade enemy fort first fighting infantry units battling tanks finally reaching opponent compound player begins two weapons pistol grenades ammo limit player advanced far enough enemy territory tank warfare stage player hijack tank fight enemy tanks two types tanks available light tank armed machine gun heavy tank armed cannon light tank nimble easily destroyed enemy heavy tank slower sustain one hit light tank second hit light tank destroy single shot heavy tank destroy either type tank partially damaged tank evacuated player jump back resume normal operation however either type tank player must exit vehicle within seconds struck fatal shot player exit tank explodes loses life extra life awarded 10,000 15,000 none thereafter tank battle continues player reaches enemy fort fort brick-barricaded tank fires mortar rounds player attempts take order destroy tank player must toss grenade brick barricade accomplished foot done tank explode enemy soldier wave white flag signalling surrender plus 1,000 bonus points game repeats infantry level enemy soldiers become increasingly quicker deadlier successive rounds points multiplied based level played following release coin-op arcade platform game ported colecovision console pc-8801 sharp x1 computers 1983 atari 2600 msx 1982 fm-7 nintendo famicom 1985. famicom version taito first game console 1983 arcade awards front line runner-up coin-op game year behind pole position award given electronic games stated arcade approach dirty business infantry combat forces player keep moving firing constantly action non-stop attractive shoot 'em game boy color spin-off entitled sgt rock frontline published taito 2000 game follows template original arcade game set within dc comics universe arcade original included taito memories gekan playstation 2 console 2005 taito legends 2 playstation 2 xbox windows platforms 2006 famicom version released virtual console service japan june 5 2007 wii january 15 2014 nintendo 3ds | [
11522,
3075,
11238,
10316,
6797,
9006,
3256
] | Test |
4,541 | 4 | Handwritten_biometric_recognition:handwritten biometric recognition handwritten biometric recognition process identifying author given text handwritten biometric recognition belongs behavioural biometric systems based something user learned handwritten biometrics split two main categories static mode users writes paper digitize optical scanner camera biometric system recognizes text analyzing shape group also known off-line dynamic mode users writes digitizing tablet acquires text real time another possibility acquisition means stylus-operated pdas dynamic recognition also known on-line .dynamic information usually consists following information better accuracies achieved means dynamic systems technological approaches exist handwritten biometric recognition confused optical character recognition ocr goal handwritten biometrics identify author given text goal ocr recognize content text regardless author | [
5857,
10207
] | None |
4,542 | 2 | Killbit:killbit killbit security feature web browsers based microsoft trident engine internet explorer activex containers respect killbit microsoft office killbit instructs activex control container never use specific piece activex software whether third-party microsoft identified class identifier clsid main purpose killbit close security holes vendor discovers security hole specific version activex control request microsoft put killbit killbit updates typically deployed microsoft windows operating systems via windows update flag windows registry identifies clsid unsafe clsid type guid acts serial number software question must exist piece software behaves activex control activex container finds clsid killbit entry matches clsid software software blocked running activex container vendor wants release updated version release different clsid internet explorer html application host also respects killbit processing object tag html processing scripts html | [
10026,
11683,
6797,
6679
] | None |
4,543 | 5 | High-Level_Data_Link_Control:high-level data link control high-level data link control hdlc bit-oriented code-transparent synchronous data link layer protocol developed international organization standardization iso standard hdlc iso/iec 13239:2002 hdlc provides connection-oriented connectionless service hdlc used point-to-multipoint connections via original master-slave modes normal response mode nrm asynchronous response mode arm rarely used used almost exclusively connect one device another using asynchronous balanced mode abm hdlc based ibm sdlc protocol layer 2 protocol ibm systems network architecture sna extended standardized itu lap link access procedure ansi named essentially identical version adccp hdlc specification specify full semantics frame fields allows fully compliant standards derived derivatives since appeared innumerable standards adopted x.25 protocol stack lapb v.42 protocol lapm frame relay protocol stack lapf isdn protocol stack lapd original iso standards hdlc following iso/iec 13239:2002 current standard replaced specifications hdlc inspiration ieee 802.2 llc protocol basis framing mechanism used ppp synchronous lines used many servers connect wan commonly internet similar version used control channel e-carrier e1 sonet multichannel telephone lines cisco hdlc uses low-level hdlc framing techniques adds protocol field standard hdlc header hdlc frames transmitted synchronous asynchronous serial communication links links mechanism mark beginning end frame beginning end frame identified done using unique sequence bits frame delimiter flag encoding data ensure flag sequence never seen inside frame frame begins ends frame delimiter frame delimiter end frame may also mark start next frame synchronous asynchronous links flag sequence binary 01111110 hexadecimal 0x7e details quite different flag sequence consists six consecutive 1-bits data coded ensure never contains five 1-bits row done bit stuffing time five consecutive 1-bits appear transmitted data data paused 0-bit transmitted receiving device knows done seeing five 1-bits row following 0-bit stripped received data instead sixth bit 1 either flag seventh bit 0 error seventh bit 1 latter case frame receive procedure aborted restarted flag next seen bit-stuffing serves second purpose ensuring sufficient number signal transitions synchronous links data nrzi encoded 0-bit transmitted change signal line 1-bit sent change thus 0 bit provides opportunity receiving modem synchronize clock via phase-locked loop many 1-bits row receiver lose count bit-stuffing provides minimum one transition per six bit times transmission data one transition per seven bit times transmission flag frames transmitted simplex full-duplex synchronous link frame delimiter continuously transmitted link generates one two continuous waveforms depending initial state hdlc specification allows 0-bit end frame delimiter shared start next frame delimiter i.e 011111101111110 hardware support half-duplex multi-drop communication several transmitters share line receiver line see continuous idling 1-bits inter-frame period transmitter active hdlc transmits bytes data least significant bit first confused little-endian order refers byte ordering within multi-byte field using asynchronous serial communication standard rs-232 serial ports synchronous-style bit stuffing inappropriate several reasons instead asynchronous framing uses control-octet transparency also called byte stuffing octet stuffing frame boundary octet 01111110 0x7e hexadecimal notation control escape octet value 0x7d bit sequence '10111110 rs-232 transmits least-significant bit first either two octets appears transmitted data escape octet sent followed original data octet bit 5 inverted example byte 0x7e would transmitted 0x7d 0x5e 10111110 01111010 reserved octet values xon xoff escaped way necessary abort sequence 0x7d 0x7e ends packet incomplete byte-stuff sequence forcing receiver detect error used abort packet transmission chance partial packet interpreted valid receiver contents hdlc frame shown following table note end flag one frame may beginning start flag next frame data usually sent multiples 8 bits variants require others theoretically permit data alignments 8-bit boundaries frame check sequence fcs 16-bit crc-ccitt 32-bit crc-32 computed address control information fields provides means receiver detect errors may induced transmission frame lost bits flipped bits extraneous bits however given algorithms used calculate fcs probability certain types transmission errors going undetected increases length data checked errors fcs implicitly limit practical size frame receiver calculation fcs match sender indicating frame contains errors receiver either send negative acknowledge packet sender send nothing either receiving negative acknowledge packet timing waiting positive acknowledge packet sender retransmit failed frame fcs implemented many early communication links relatively high bit error rate fcs could readily computed simple fast circuitry software effective forward error correction schemes widely used protocols synchronous data link control sdlc originally designed connect one computer multiple peripherals via mutidrop bus original normal response mode master-slave mode computer primary terminal gives peripheral secondary terminal permission speak turn communication either primary terminal frames include one address secondary terminal primary terminal assigned address distinction commands sent primary secondary responses sent secondary primary reflected encoding commands responses indistinguishable except difference direction transmitted normal response mode allows secondary-to-primary link shared without contention primary give secondaries permission transmit one time also allows operation half-duplex communication links long primary aware may transmit given permission secondary asynchronous response mode hdlc addition use full-duplex links retaining primary/secondary distinction allows secondary transmit time thus must mechanism ensure multiple secondaries try transmit time one secondary asynchronous balanced mode adds concept combined terminal act primary secondary unfortunately mode operation implementation subtleties common frames sent care whether command response frame essential ones notably unnumbered frames frame p/f bit set address field received frame must examined determine whether contains command address received response address received terminal means address field optional even point-to-point links needed disambiguate peer talked hdlc variants extend address field include source destination addresses explicit command/response bit three fundamental types hdlc frames may distinguished general format control field also extended 2-byte forms frames least significant bit rightmost table sent first poll/final single bit two names called poll part command set primary station obtain response secondary station final part response set secondary station indicate response end transmission cases bit clear bit used token passed back forth stations one token exist time secondary sends final received poll primary primary sends poll received final back secondary timeout indicating bit lost operating combined station important maintain distinction p f bits may two checkpoint cycles operating simultaneously p bit arriving command remote station response p bit f bit arriving response frames contain receive sequence number n r n r provides positive acknowledgement receipt i-frames side link value always first frame yet received acknowledges frames n values n r −1 modulo 8 modulo 128 received indicates n next frame expects receive n r operates way whether part command response combined station one sequence number space incremented successive i-frames modulo 8 modulo 128 depending number bits sequence number 7 127 i-frames may awaiting acknowledgment time information frames i-frames transport user data network layer addition also include flow error control information piggybacked data sub-fields control field define functions least significant bit first transmitted defines frame type 0 means i-frame except interpretation p/f field difference command frame response frame p/f 0 two forms exactly equivalent supervisory frames 's-frames used flow error control whenever piggybacking impossible inappropriate station data send s-frames hdlc information fields although hdlc-derived protocols use information fields multi-selective reject s-frame control field includes leading 10 indicating s-frame followed 2-bit type poll/final bit 3-bit sequence number 4-bit padding field followed 7-bit sequence number first least significant 2 bits mean s-frame frames include p/f bit receive sequence number described except interpretation p/f field difference command frame response frame p/f 0 two forms exactly equivalent unnumbered frames u-frames used link management also used transfer user data exchange session management control information connected devices u-frames contain information field used system management information user data first 2 bits 11 mean u-frame 5 type bits 2 p/f bit 3 bit p/f bit create 32 different types u-frame link configurations categorized either three link configurations additional link configuration disconnected mode mode secondary station initialized primary explicitly disconnected mode secondary responds almost every frame mode set command disconnected mode response purpose mode allow primary reliably detect secondary powered otherwise reset minimal set required operation hdlc module end transmits ua frame request accepted request rejected sends dm disconnect mode frame unnumbered frames identified low two bits 1 p/f flag leaves 5 bits frame type even though fewer 32 values use types different meanings depending direction sent command response relationship disc disconnect command rd request disconnect response seems clear enough reason making sarm command numerically equal dm response obscure ui uih xid test frames contain payload used commands responses sm command frmr response also contain payload | [
2306,
9860,
3847,
6544,
1297,
10647,
5531,
5021,
2206,
7071,
8989,
7478,
7865,
2746,
5439,
7360,
4546,
11332,
1478,
1997,
5581,
10833,
1246,
2912,
1121,
4963,
1893,
8432,
5875,
8692,
3323,
5118,
2431
] | Test |
4,544 | 2 | Foundation_Kit:foundation kit foundation kit foundation short objective-c framework openstep specification provides basic classes wrapper classes data structure classes framework uses prefix ns nextstep next/sun_microsystems class common base class objective-c hierarchies provides standard methods working objects managing memory associated querying class used string manipulation representing unicode string typically using utf-16 internal format nsstring immutable thus initialized modified nsmutablestring modifiable version nsvalue wrapper class c data types nsnumber wrapper class c number data types int double float data structures foundation kit hold objects primitive types wrappers nsvalue nsnumber used data structures dynamic array objects supporting constant-time indexing nsarray immutable version initialized objects modified nsmutablearray may modified adding removing objects associative data container key-value pairs unique keys searching element addition removal case nsmutabledictionary faster-than-linear however order elements within container guaranteed associative container unique keys similar nsdictionary difference members contain data object wrapper raw byte data object type dynamically allocate manage data refer data owned managed something else static numeric array classes store times dates represent calendrical information offer methods calculating date time differences together nslocale provide methods displaying dates times many formats adjusting times dates based location world foundation kit part cocoa api beginning successor openstep/mach framework deviated openstep compliance places incompatible foundation kit cocoa touch api framework based macos foundation openstep foundation kit implemented gnustep base package implementation mostly comparable 4 classes missing aims comparable openstep api later macos additions foundation kit implemented cocotron open-source implementation cocoa purefoundation open-source implementation foundation implements foundation wrapping core foundation like cocoa rather create separate foundation scratch like gnustep cocotron swiftfoundation apple open-source swift implementation foundation api platforms objective-c runtime | [
9665,
10470,
7806,
7307,
10765,
3790,
8303,
8304,
2673,
7292,
2045,
3038
] | None |
4,545 | 1 | Art_Recovery_Group:art recovery group art recovery international previously art recovery group private company provides due diligence dispute resolution art recovery services international art market cultural heritage institutions headquartered venice italy company founded 2013 initially specialising recovery stolen claimed works art 2015 company launched artclaim database new art market due diligence resource online-resource developed soza technical ltu technologies introducing image-recognition technology commercial due diligence first time 2016 non-profit company based us formed artclaim database became artive.org art recovery international established 2013 christopher a. marinello lawyer specialising recovery stolen claimed works art prior founding company marinello formerly general counsel art loss register marinello responsible virtually successful art recoveries art loss register 2006-2013 2013 marinello became dissatisfied methods alr chairman julian radcliffe decided form art recovery business stolen art database cases clients followed art recovery international enjoyed almost immediate success acclaim company services provided law enforcement agencies pro-bono basis since establishment art recovery overseen number high-profile recovery cases including works 2015 company launched artclaim database new due diligence resource international art market web-based platform introduced image-recognition technology searches item registrations order improve accuracy efforts reduce trade illicit art october 2015 artclaim database awarded wealth management innovator year spear wealth management awards 2016 non-profit company based us formed artclaim database became artive.org art recovery group ceo christopher a. marinello one world leading practitioners restitution recovery stolen claimed works art involved recovery 500 million worth art high-profile stolen art cases around world marinello also represented heirs paul rosenberg recovery efforts art works looted second world war may 2015 marinello oversaw recovery painting henri matisse discovered munich home cornelius gurlitt behalf rosenberg family 2013 marinello co-founded annual art crime cultural heritage symposium new york university school professional studies | [
10549
] | Test |
4,546 | 2 | IBM_Systems_Network_Architecture:ibm systems network architecture systems network architecture sna ibm proprietary networking architecture created 1974 complete protocol stack interconnecting computers resources sna describes formats protocols piece software implementation sna takes form various communications packages notably virtual telecommunications access method vtam mainframe software package sna communications sna made public part ibm advanced function communications announcement september 1974 included implementation sna/sdlc synchronous data link control protocols new communications products supported ibm 3704/3705 communication controllers network control program ncp system/370 vtam software cics ims announcement followed another announcement july 1975 introduced ibm 3760 data entry station ibm 3790 communication system new models ibm 3270 display system sna mainly designed ibm systems development division laboratory research triangle park north carolina usa helped laboratories implemented sna/sdlc details later made public ibm system reference library manuals ibm systems journal sna still used extensively banks financial transaction networks well many government agencies ibm still providing support sna one primary pieces hardware 3745/3746 communications controller withdrawn market ibm estimated 20,000 controllers installed however ibm continues provide hardware maintenance service microcode features support users robust market smaller companies continues provide 3745/3746 features parts service vtam also supported ibm ibm network control program ncp required 3745/3746 controllers 2008 ibm publication said ibm mid-1970s saw mainly hardware vendor hence innovations period aimed increase hardware sales sna objective reduce costs operating large numbers terminals thus induce customers develop expand interactive terminal-based systems opposed batch systems expansion interactive terminal-based systems would increase sales terminals importantly mainframe computers peripherals partly simple increase volume work done systems partly interactive processing requires computing power per transaction batch processing hence sna aimed reduce main non-computer costs difficulties operating large networks using earlier communications protocols difficulties included result running large number terminals required lot communications lines number required today especially different types terminals needed supported users wanted use different types applications .e.g cics tso location purely financial terms sna objectives increase customers spending terminal-based systems time increase ibm share spending mainly expense telecommunications companies sna also aimed overcome limitation architecture ibm system/370 mainframes inherited system/360 cpu could connect 16 i/o channels channel could handle 256 peripherals i.e maximum 4096 peripherals per cpu time sna designed communications line counted peripheral thus number terminals powerful mainframes could otherwise communicate limited improvements computer component technology made feasible build terminals included powerful communications cards could operate single standard communications protocol rather stripped-down protocol suited specific type terminal result several multi-layer communications protocols proposed 1970s ibm sna itu-t x.25 became dominant later important elements sna include sna removed link control application program placed ncp following advantages disadvantages sna core designed ability wrap different layers connections blanket security communicate within sna environment would first connect node establish maintain link connection network negotiate proper session handle flows within session level different security controls govern connections protect session information network addressable units sna network components assigned address send receive information distinguished follows sna essentially offers transparent communication equipment specifics impose constraints onto lu-lu communication eventually serves purpose make distinction lu types application must take functionality terminal equipment account e.g screen sizes layout within sna three types data stream connect local display terminals printers sna character string scs used lu1 terminals logging sna network unformatted system services uss 3270 data stream mainly used mainframes system/370 successors including zseries family 5250 data stream mainly used minicomputers/servers system/34 system/36 system/38 as/400 successors including system ibm power systems running ibm i. sna defines several kinds devices called logical unit types primary ones use lu1 lu2 lu6.2 advanced protocol application application conversations term 37xx refers ibm family sna communications controllers 3745 supports eight high-speed t1 circuits 3725 large-scale node front-end processor host 3720 remote node functions concentrator router vtam/ncp pu4 nodes attached ibm token ring networks share local area network infrastructure workstations servers ncp encapsulates sna packets token-ring frames allowing sessions flow token-ring network actual encapsulation decapsulation takes place 3745 mainframe-based entities looked alternatives 37xx-based networks ibm partnered cisco mid-1990s together developed data link switching dlsw dlsw encapsulates sna packets ip datagrams allowing sessions flow ip network actual encapsulation decapsulation takes place cisco routers end dlsw peer connection local mainframe site router uses token ring topology connect natively vtam remote user end connection pu type 2 emulator sna gateway server connects peer router via router lan interface end user terminals typically pcs 3270 emulation software defined sna gateway vtam/ncp pu type 2 definition becomes switched major node local vtam without ncp line connection defined using various possible solutions token ring interface 3745 3172 lan channel station cisco escon-compatible channel interface processor | [
8192,
4490,
2827,
909,
7053,
6544,
11024,
7188,
10104,
5531,
10280,
45,
7983,
9007,
5562,
4667,
3774,
5439,
2112,
4543,
4546,
7360,
8640,
10438,
8138,
11596,
6993,
10065,
2901,
10072,
1760,
5472,
5603,
868,
4586,
4589,
10094,
2168,
3323
] | Test |
4,547 | 5 | LISTSERV:listserv term listserv written registered trademark licensee l-soft international inc. listserv used refer electronic mailing list software applications general properly applied early instances software allows sender send one email list transparently sends addresses subscribers list original listserv software bitnic listserv also known bitnic listserv 1984–1986 allowed mailing lists implemented ibm vm mainframes developed ira fuchs daniel oberst ricky hernandez 1984 mailing list service known listserv bitnic also known listserv bitnic quickly became key service bitnet network provided functionality similar unix sendmail alias sendmail subscriptions managed manually 1986 éric thomas developed independent application originally named revised listserv also known revised listserv first automated mailing list management application prior revised listserv email lists managed manually join leave list people would write human list administrator ask added removed process got time-consuming discussion lists grew popularity 1987 users bitnic listserv migrated thomas version listserv freeware 1986 1993 commercial product developed l-soft company founded listserv author éric thomas 1994 free version limited ten lists 500 subscribers downloaded company web site several list management tools subsequently developed lyris listmanager 1997 sympa 1997 gnu mailman 1998 1986 éric thomas developed concept automated mailing list manager whilst student ecole centrale paris developed software known listserv early software features allowed joining leaving list without need human administration also list owner could add remove subscribers edit templates welcome system messages amongst innovations listserv introduced double opt-in 1993 first spam filter 1995 release thomas listserv 1986 listserv bitnic enhanced provide automatic list management abandoned months later bitnic installed thomas listserv name bitnic thomas products unrelated neither product based product code though electronic mailing lists also known email lists popular continue used today due ease use listserv registered trademark u.s. patent trademark office 1995 based use since 1986 registered swedish patent registration office prv 2001 jurisdictions using word listserv describe different product generic term email-based mailing list kind trademark misuse standard generic terms electronic mailing list elist email list list email list manager email list software software product manages list nevertheless generic use term common times version 15.0 individual user passwords stored clear available users listed site managers postmasters application configuration thus allowing unethical managers attackers compromise site easily try reuse username password sites passwords hashed protect since version 15.5 released 2007 listserv available several licensing options listserv lite free edition non-commercial hobby use listserv lite smaller workloads listserv standard full-featured version listserv hpo high performance option listserv maestro customized targeted email publishing reporting list currently-supported operating systems found http //lsoft.com/products/listserv_os.asp | [
4272,
6762,
3323,
5612
] | None |
4,548 | 2 | Gary_Kildall:gary kildall gary arlen kildall may 19 1942 – july 11 1994 american computer scientist microcomputer entrepreneur created cp/m operating system founded digital research inc. dri kildall one first people see microprocessors fully capable computers rather equipment controllers organize company around concept also co-hosted pbs tv show computer chronicles although career computing spanned two decades mainly remembered connection ibm unsuccessful attempt 1980 license cp/m ibm personal computer gary kildall born grew seattle washington family operated seamanship school father joseph kildall captain norwegian heritage mother emma half-swedish gary grandmother born långbäck sweden skellefteå municipality emigrated canada 23 years age gary attended university washington uw hoping become mathematics teacher became increasingly interested computer technology receiving degree fulfilled draft obligation united states navy teaching naval postgraduate school nps monterey california within hour drive silicon valley kildall heard first commercially available microprocessor intel 4004 bought one processors began writing experimental programs learn processors worked intel consultant days kildall briefly returned uw finished doctorate computer science 1972 resumed teaching nps published paper introduced theory data-flow analysis used today optimizing compilers continued experiment microcomputers emerging technology floppy disks intel lent systems using 8008 8080 processors 1973 developed first high-level programming language microprocessors called pl/m created cp/m year enable 8080 control floppy drive combining first time essential components computer microcomputer scale demonstrated cp/m intel intel little interest chose market pl/m instead kildall wife dorothy established company originally called intergalactic digital research later renamed digital research inc market cp/m advertisements hobbyist magazines digital research licensed cp/m imsai 8080 popular clone altair 8800 manufacturers licensed cp/m became de facto standard support increasing number hardware variations response kildall pioneered concept bios set simple programs stored computer hardware rom eprom chip enabled cp/m run different systems without modification cp/m quick success took kildall surprise slow update high density floppy disks hard disk drives hardware manufacturers talked creating rival operating system kildall started rush project develop cp/m 2 1981 peak popularity cp/m ran 3,000 different computer models dri 5.4 million yearly revenues ibm presided john r. opel approached digital research 1980 bill gates suggestion negotiate purchase forthcoming version cp/m called cp/m-86 ibm pc gary left negotiations wife dorothy usually colleague developer mp/m operating system tom rolander used gary private airplane deliver software manufacturer bill godbout ibm representatives would explain purpose visit insisted dorothy sign non-disclosure agreement advice dri attorney gerry davis dorothy refused sign agreement without gary approval gary returned afternoon tried move discussion ibm forward accounts disagree whether signed non-disclosure agreement well ever met ibm representatives various reasons given two companies failing reach agreement dri products might unwilling sell main product ibm one-time payment rather usual royalty-based plan dorothy might believed company could deliver cp/m-86 ibm proposed schedule company busy developing implementation pl/i programming language data general also possible ibm representatives might annoyed dri spent hours considered routine formality according kildall ibm representatives took flight florida night dorothy took vacation negotiated flight reaching handshake agreement ibm lead negotiator jack sams insisted never met gary one ibm colleague confirmed sams said time accepted someone else group might flight noted flew back seattle talk microsoft sams related story gates already agreed provide basic interpreter several programs pc gates impression story gary capriciously went flying would later tell reporters sams left gates task finding usable operating system weeks later proposed using operating system 86-dos—an independently developed operating system implemented kildall cp/m api—from seattle computer products scp paul allen negotiated licensing deal scp allen 86-dos adapted ibm hardware ibm shipped ibm pc dos kildall obtained copy pc dos examined concluded infringed cp/m asked gerry davis legal options available davis told intellectual property law software clear enough sue instead kildall threatened ibm legal action ibm responded proposal offer cp/m-86 option pc return release liability kildall accepted believing ibm new system like previous personal computers would significant commercial success ibm pc introduced ibm sold operating system unbundled option one operating system options pc dos priced us 40 pc dos seen practically necessary option software titles required without ibm pc limited built-in cassette basic cp/m-86 shipped months later six times expensive 240 sold poorly dos enjoyed far less software support loss ibm deal gary dorothy found pressure bring experienced management gary influence company waned worked various experimental research projects version cp/m multitasking mp/m implementation logo programming language hoped logo educational dialect lisp would supplant basic education seeing demonstration apple lisa kildall oversaw creation dri graphical user interface called gem novell acquired dri 1991 deal netted millions kildall kildall also pursued computing-related projects outside dri seven years 1983 1990 co-hosted public television program side called computer chronicles followed trends personal computing 1984 started another company activenture adapted optical disc technology computer use early 1985 renamed knowledgeset released first computer encyclopedia june 1985 cd-rom version grolier academic american encyclopedia named electronic encyclopedia later acquired banta corporation kildall final business venture known prometheus light sound pls based austin texas developed home pbx system integrated land-line telephones mobile phones kildall colleagues recall creative easygoing adventurous addition flying loved sports cars auto racing boating lifelong love sea although kildall preferred leave ibm affair past known work afterward continually faced comparisons bill gates well fading memories contributions legend grew around fateful ibm-dri meeting encouraged gates various journalists suggesting kildall irresponsibly taken day recreational flight became tired constantly refute story later years occasional private expressions bitterness overshadowed microsoft kildall annoyed university washington asked distinguished graduate attend computer science program anniversary 1992 gave keynote speech gates dropout harvard response started writing memoir computer connections memoir distributed friends expressed frustration people seem value elegance software said gates divisive manipulative user taken much industry appendix called dos plain simple theft first 26 system calls worked cp/m accused ibm contriving price difference pc dos cp/m-86 order marginalize cp/m journalist harold evans used memoir source chapter kildall 2004 book made america concluding microsoft robbed kildall inventions ibm veterans pc project disputed book description events microsoft described one-sided inaccurate august 2016 kildall family made first part memoir available public selling dri novell made kildall wealthy man moved west lake hills suburb austin austin house lakeside property stalls several sports cars plus video studio basement kildall owned flew learjet least one boat lake austin also participated volunteer efforts assist children hiv/aids owned mansion panoramic ocean view pebble beach california near headquarters dri july 8 1994 kildall fell monterey california biker bar hit head exact circumstances injury remain unclear alcoholic later years various sources claimed fell chair fell steps assaulted walked franklin street bar grill wearing harley-davidson leathers checked hospital twice died three days later community hospital monterey peninsula autopsy next day conclusively determine cause death cp/m usenet faq says concussed fall died heart attack connection two unclear buried evergreen washelli memorial park north seattle following announcement kildall death bill gates commented one original pioneers pc revolution creative computer scientist excellent work although competitors always tremendous respect contributions pc industry untimely death unfortunate work missed march 1995 kildall posthumously honored software publishers association software information industry association contributions microcomputer industry april 2014 city pacific grove installed commemorative plaque outside kildall former residence also served early headquarters digital research | [
10113,
1922,
6148,
2055,
8712,
6921,
8075,
8831,
3216,
4114,
2840,
2201,
7068,
1952,
2345,
2729,
7849,
11562,
5293,
7983,
5425,
178,
7217,
8115,
9907,
8502,
4409,
2620,
7999,
6594,
8262,
10067,
2135,
6242,
10083,
5220,
6502,
1515,
8301,
2... | Test |
4,549 | 4 | Mark_Kriegsman:mark kriegsman mark edwin kriegsman born 1966 american entrepreneur computer programmer inventor writer director engineering veracode lives massachusetts favorite person world daughter eleanor kriegsman writing porting open-source software 30 years founded ran pioneering software companies including document.com later acquired merrill clearway technologies acquired mirror image internet college kriegsman worked cognitive systems inc. started notable ai researcher roger schank developing large scale rule-based statistical text-processing ai systems later integrated three technologies paper wrote ieee designing document management systems interleaf led found first startup document.com founding clearway kriegsman senior developer stake later acquired symantec clearway created firesite web accelerator content delivery network early webarcher internet search tool late 1998 clearway involved early ad-blocking controversy release ad blocking web software adscreen angered user base spurred lively discussion role advertisements web publishing based user feedback clearway pulled adscreen two days later kriegsman active participant several often overlapping areas software development one founders veracode reflecting long-standing interest software security also however interested secure information sharing open-access movement outspoken skeptic sees shady business practices computer industry kriegsman fascination computers caught attention local newspaper 1979 13 lucy meyer new jersey summit herald reported mark ... likes make programs sometimes patterns sometimes short programs 'that pop head parlayed skill interest writing computer games age 15 released first game starblaster later second panic button graduated hampshire college amherst massachusetts studied cognitive science graduation kriegsman worked cognitive systems inc. later went found several successful technology companies starting document.com later including clearway veracode kriegsman descendant william bradford leader plymouth colony massachusetts well early santa fe merchants willi flora spiegelberg willi mayor santa fe 1884–1886 kriegsman holds following patents patents concerning content delivery networks systems patent concerning dynamic web page assembly caching | [
5512,
6665,
10368,
9569
] | Test |
4,550 | 9 | Allegro_Common_Lisp:allegro common lisp allegro common lisp programming language integrated development environment ide developed franz inc dialect language lisp commercial software implementation language common lisp allegro cl provides full american national standards institute ansi common lisp standard many extensions including threads clos streams clos mop unicode ssl streams implementations various internet protocols opengl interface first version allegro common lisp finished end 1986 originally called extended common lisp allegro cl available many operating systems including microsoft windows 32/64-bit many unix unix-like 32-bit 64-bit including macos intel 32/64-bit linux 32/64-bit freebsd 32-bit solaris x64 sparc 32/64-bit unicos uts internationalization localization support based unicode supports various external text encodings provides string character types based universal coded character set 2 ucs-2 allegro cl used without integrated development environment ide available windows linux macos version 8.2 ide written allegro cl includes development tools including editor interface designer allegro cl used deliver applications allegro cl available freeware free express edition limits like constrained heap space non-commercial use customers get access much source code allegro cl allegro cl includes implementation prolog object caching database called allegrocache recent release allegro cl 10.1 supports symmetric multiprocessing allegro cl used implement various applications | [
10752,
11269,
2056,
2062,
9231,
7184,
2577,
9749,
8728,
4633,
4122,
9245,
8226,
2603,
5165,
5677,
3119,
3631,
2105,
6201,
3132,
6717,
576,
8258,
8771,
8262,
1613,
9299,
10841,
3675,
2658,
7267,
2660,
7269,
8293,
3176,
2666,
2667,
5743,
83... | Test |
4,551 | 3 | King's_Valley_II:king valley ii king valley ii seal el giza game msx1 msx2 computers konami sequel king valley 1985 msx2 version saw release japan goes rare contest version contest making levels games built-in level editor held four japanese msx magazines two msx.fan beep winners contest received gold cartridge twenty custom stages custom levels saved either disk tape levels interchangeable msx1 msx2 versions far far future inter-planetary archaeologist vick xiii makes choking discovery pyramids earth malfunctioning devices alien origin enough energy destroy earth vick switch core functions el giza game consists six pyramids wall engravings color pattern every pyramid contains 10 levels idea game collect crystals called soul stones level solving different puzzles evading killing enemies using many tools weapons available unlock exit door take next level later konami game nintendo ds reuses stage musics search secret spell sandfall egyptian area game msx 2 version game except minor changes like music remixed items backgrounds recolored | [
10931,
9006,
7679
] | Test |
4,552 | 4 | Pass_the_hash:pass hash cryptanalysis computer security pass hash hacking technique allows attacker authenticate remote server service using underlying ntlm lanman hash user password instead requiring associated plaintext password normally case example security obscurity merely kicks road moving goalposts replaces need stealing plaintext password merely stealing hash using authenticate attacker obtains valid user name user password hash values somehow using different methods tools able use information authenticate remote server service using lm ntlm authentication without need brute-force hashes obtain cleartext password required technique published attack exploits implementation weakness authentication protocol password hash remain static session session password next changed technique performed server service accepting lm ntlm authentication whether runs machine windows unix operating system systems services using ntlm authentication users passwords never sent cleartext wire instead provided requesting system like domain controller hash response challenge-response authentication scheme native windows applications ask users cleartext password call apis like lsalogonuser convert password one two hash values lm nt hashes send remote server ntlm authentication analysis mechanism shown cleartext password required complete network authentication successfully hashes needed attacker hashes user password need brute-force cleartext password simply use hash arbitrary user account harvested authenticate remote system impersonate user words attacker perspective hashes functionally equivalent original passwords generated pass hash technique originally published paul ashton 1997 consisted modified samba smb client accepted user password hashes instead cleartext passwords later versions samba third-party implementations smb ntlm protocols also included functionality implementation technique based smb stack created third-party e.g. samba others reason suffered series limitations hacker perspective including limited partial functionality smb protocol continued evolve years means third parties creating implementation smb protocol need implement changes additions protocol introduced newer versions windows smb historically reverse engineering complex time consuming means even performing ntlm authentication successfully using pass hash technique tools like samba smb client might implemented functionality attacker might want use meant difficult attack windows programs use dcom rpc also attackers restricted using third-party clients carrying attacks possible use built-in windows applications like net.exe active directory users computers tool amongst others asked attacker user enter cleartext password authenticate corresponding password hash value 2008 hernan ochoa published tool called pass-the-hash toolkit allowed 'pass hash performed natively windows allowed user name domain name password hashes cached memory local security authority changed runtime user authenticated — made possible 'pass hash using standard windows applications thereby undermine fundamental authentication mechanisms built operating system tool also introduced new technique allowed dumping password hashes cached memory lsass.exe process persistent storage disk quickly became widely used penetration testers attackers hash harvesting technique advanced previously used techniques e.g dumping local security accounts manager database sam using pwdump similar tools mainly hash values stored memory could include credentials domain users domain administrators logged machine example hashes authenticated domain users stored persistently local sam also dumped makes possible penetration tester attacker compromise whole windows domain compromising single machine member domain furthermore attack implemented instantaneously without requirement expensive computing resources carry brute force attack toolkit subsequently superseded windows credential editor extends original tool functionality operating system support antivirus vendors classify toolkit malware attacker carry pass-the-hash attack must obtain password hashes target user accounts end penetration testers attackers harvest password hashes using number different methods system using lm ntlm authentication combination communication protocol smb ftp rpc http etc risk attack exploit difficult defend due possible exploits windows applications running windows used attacker elevate privileges carry hash harvesting facilitates attack furthermore may require one machine windows domain configured correctly missing security patch attacker find way wide range penetration testing tools furthermore available automate process discovering weakness machine single defense technique thus standard defense depth practices apply – example use firewalls intrusion prevention systems 802.1x authentication ipsec antivirus software reducing number people elevated privileges pro-active security patching etc preventing windows storing cached credentials may limit attackers obtaining hashes memory usually means target account must logged machine attack executed allowing domain administrators log systems may compromised untrusted create scenario administrators hashes become targets attackers limiting domain administrator logons trusted domain controllers therefore limit opportunities attacker principle least privilege suggests least user access lua approach taken users use accounts privileges necessary complete task hand configuring systems use lm ntlm also strengthen security newer exploits able forward kerberos tickets similar way limiting scope debug privileges system may frustrate attacks inject code steal hashes memory sensitive processes restricted admin mode new windows operating system feature introduced 2014 via security bulletin 2871997 designed reduce effectiveness attack | [
7556,
774,
1429,
1941,
3477,
10232,
3742,
2213,
8998,
10279,
10281,
7228,
3394,
10437,
582,
7754,
10442,
6098,
10835,
93,
9440,
9569,
2928,
6904,
10747,
2558
] | None |
4,553 | 3 | PDP-11_architecture:pdp-11 architecture pdp-11 architecture instruction set architecture isa developed digital equipment corporation dec implemented central processing units cpus microprocessors used pdp-11 minicomputers wide use 1970s eventually overshadowed powerful vax-11 architecture 1980s sixteen-bit words stored little-endian least significant bytes first thirty-two-bit data—supported extensions basic architecture e.g. floating point fpu instruction set double-words extended instruction set long data commercial instruction set —are stored one format including unusual middle-endian format sometimes referred pdp-endian pdp-11 16-bit addresses address 64 kb time pdp-11 yielded vax 8-bit bytes hexadecimal notation becoming standard industry however numeric values pdp-11 always use octal notation amount memory attached pdp-11 always stated number words basic logical address space 32k words high 4k physical address space addresses 160000 177777 absence memory management populated input/output registers bus respond addresses range originally fully loaded pdp-11 28k words processor reserves low memory addresses two-word vectors give program counter processor status word begin service routine i/o device interrupts program places address vector bus indicate service routine take control lowest vectors service routines handle various types trap traps occur program errors attempt execute undefined instruction also program executes instruction bpt emt iot trap request service operating system article pdp-11 describes 16-bit logical address space became insurmountable limitation life pdp-11 following techniques used work around limitation cpu contains eight general-purpose 16-bit registers r0 r7 register r7 program counter pc although register used stack pointer r6 stack pointer sp used hardware interrupts traps r5 often used point current procedure call frame speed context switching pdp-11 models provide dual r1-r5 register sets kernel supervisor present user modes separate memory maps also separate stack pointers user program cause system malfunction storing invalid value stack pointer register instructions allocate six bits specify operand three bits select one eight addressing modes three bits select one eight general registers use three-bit groups makes octal notation natural following sections item includes example operand would written assembly language prototypical single-operand instruction symbol opr rn means one registers written r0 r7 rn signifies contents register following eight modes applied general register effects applied r6 stack pointer sp r7 program counter pc set separately following sections index index deferred modes x 16-bit value taken second word instruction double-operand instructions operands use modes instructions three words long autoincrementation autodecrementation register 1 byte instructions 2 word instructions 2 whenever deferred mode used since quantity register addresses word pointer r7 program counter specified four addressing modes naturally yield useful effects common use absolute mode—whose syntax combines immediate deferred mode—is specify input/output registers registers device specific memory addresses relative mode simpler syntax typical referring program variables jump destinations program uses relative mode relative deferred mode exclusively internal references position-independent contains assumptions location loaded arbitrary memory location even moved need addresses adjusted reflect location relocated computing addresses relative current location processor performed relocation fly immediate absolute modes merely autoincrement autoincrement deferred mode respectively applied pc auxiliary word instruction table says pc next instruction automatically incremented past auxiliary word pc always points words autoincrementation always 2 r6 also written sp used hardware stack traps interrupts convention enforced set modes pdp-11 provides stack grows downward—toward lower addresses—as items pushed onto mode applied sp register programmer elects use software stack addressing modes following effects although software stacks contain bytes sp always stack words autoincrementation autodecrementation sp always 2 pdp-11 operates bytes words bytes specified register number—identifying register low-order byte—or memory location words specified register number memory location low-order byte must even number instructions take operands bit 15 set specify byte addressing clear specify word addressing lists following two sections assembly-language programmer appended b instruction symbol specify byte operation example mov became movb instructions example mark sob implemented pdp-11 models high-order four bits specify operation performed bit 15 generally selecting word versus byte addressing two groups six bits specify mode register defined two operands add sub instructions use word addressing byte-oriented variations additional two-operand instructions require register source operand register pair used written r r+1 first register contains low-order bits must even second register contains high-order bits remainder exception multiply instruction r may odd high 16 bits result stored high-order nine bits specify operation performed bit 15 generally selecting word versus byte addressing many operations seems combinations high-order four bits taken double-operand instructions single group six bits specifies mode register defined single operand branch instructions take conditional effect based state condition codes psw branch instruction typically preceded two-operand cmp compare bit bit test one-operand tst test instruction arithmetic logic instructions also set condition codes contrast intel processors x86 architecture mov instructions set branch instruction could used branch depending whether value moved zero negative high-order byte specifies operation bits 8 9 10 op-code bit 15 reversing branch sense low-order byte offset relative current location program counter offset number words multiplied 2 combined program counter signed number enabling branches forward backward code limited range branch instructions meant code grew target addresses branches would become unreachable programmer would change one-word br two-word jmp instruction next group jmp conditional forms programmer would change beq bne branched around jmp sob subtract one branch listed two-operand instructions another conditional branch instruction jsr instruction could save register stack programs need feature specified pc register jsr pc address routine returned using rts pc routine called instance jsr r4 address old value r4 would top stack return address jsr would r4 let routine gain access values coded in-line specifying r4 in-line pointers specifying r4 autoincrementation moved past data point caller code resumed routine would specify rts r4 return caller four condition codes processor status word psw instructions group digital called micro-programmed single bit instruction word referenced single condition code assembler define syntax specify every combination symbols scc ccc assembled instruction set cleared respectively four condition codes eis option 11/35/40 11/03 standard newer processors fis instruction set option pdp-11/35/40 11/03 optional floating point processor option 11/45 subsequent models cis implemented optional microcode 11/23/24 add-in module 11/44 one version 11/74 provided string decimal instructions used cobol dibol psw mapped memory address 177 776 instructions found earliest pdp-11s gave programs direct access register pdp-11s provided multiple instruction spaces data spaces set non-orthogonal move instructions gave access spaces example routines operating system handled run-time service calls would use instructions exchange information caller life pdp-11 subtle differences arose implementation instructions combinations addressing modes though implementation regarded correct inconsistencies affect ordinary use pdp-11 pdp-11 processor speed varied model memory configuration op code addressing modes instruction timing three components execute/fetch instruction access time source destination last two components depended addressing mode example pdp-11/70 circa 1975 instruction form add x r r n fetch/execute time 1.35 microseconds plus source destination times 0.6 microseconds total instruction time 2.55 microseconds case addressed memory cache added 1.02 microseconds register-to-register add r r n could execute cache 0.3 microseconds floating point even complex since overlap cpu floating-point processor general floating point significantly slower single-precision floating add instruction could range 2.4 5.5 microseconds plus time fetch operands pdp-11 operated priority level 0 7 declared three bits processor status word psw high-end models could operate choice modes kernel privileged user application sometimes supervisor according two bits psw request interrupt bus device would assert one four common bus lines br4 br7 processor responded higher numbers indicated greater urgency perhaps data might lost desired sector might rotate contact read/write heads unless processor responded quickly printer readiness another character lowest priority br4 would remain ready indefinitely processor operating level 5 br6 br7 would order processor operating 3 lower would grant interrupt 7 would grant none bus requests granted lost merely deferred device needing service would continue assert bus request whenever interrupt exceeded processor priority level processor asserted corresponding bus grant bg4 bg7 bus-grant lines common lines daisy chain input gate output previous gate chain gate bus device device physically closer processor earlier daisy chain device made request sensing bus-grant input could conclude control bus pass grant signal next device bus device made request propagated bus-grant input bus-grant output giving next closest device chance reply devices occupy adjacent slots processor board grant continuity cards inserted empty slots propagated bus-grant line control bus device dropped bus request placed bus memory address two-word vector processor saved program counter pc psw entered kernel mode loaded new values specified vector device br6 new psw vector would typically specify 6 new processor priority processor would honor urgent requests br7 service routine defer requests lower priority new pc processor jumped service routine interrupting device routine operated device least removing condition caused interrupt routine ended rti return interrupt instruction restored pc psw processor granted interrupt bus request made error device responded bus grant processor timed performed trap would suggest bad hardware macro-11 assembly language pdp-11 successor pal-11 program assembler loader earlier version pdp-11 assembly language without macro facilities macro-11 supported dec pdp-11 operating systems pdp-11 unix systems also include assembler called structurally similar macro-11 different syntax fewer features folk myth instruction set architecture pdp-11 influenced idiomatic use b programming language pdp-11 increment decrement addressing modes correspond codice_1 codice_2 constructs c. codice_3 codice_4 register variables expression codice_5 could compiled single machine instruction dennis ritchie says folk myth historically impossible however c programming language take advantage several low-level programming features pdp-11 resulting inclusion new processors | [
1922,
3142,
5065,
9739,
5933,
3630,
5358,
1776,
2045,
6063,
3699,
5492,
757,
10548,
11604,
7032,
477,
6558
] | Validation |
4,554 | 4 | Site_Security_Handbook:site security handbook site security handbook rfc 2196 guide setting computer security policies procedures sites systems internet however information provided also useful sites yet connected internet guide lists issues factors site must consider setting policies makes number recommendations provides discussions relevant areas guide framework setting security policies procedures order effective set policies procedures site make many decisions gain agreement communicate implement policies guide product ietf ssh working group published 1997 obsoleting earlier rfc 1244 1991 | [
6162,
5373,
2558
] | None |
4,555 | 4 | Alphonse_F._La_Porta:alphonse f. la porta alphonse f. la porta born january 15 1939 career member senior foreign service served u.s ambassador mongolia december 1997 november 2000 subsequently served political advisor u.s. commander-in-chief regional headquarters allied forces southern europe january 2001 november 2003 alphonse la porta born january 15 1939 brooklyn new york family moved south shore long island – first oceanside lynbrook.when young parents first generation immigrants worked hair dressers father came sicily mother ukraine child attended davison avenue elementary school malverne junior high school finally graduating malverne high school 1956 enrolled georgetown university school foreign service graduating 1960 took foreign service exam passing written portion failing score passing grade oral exams decided pursue master degree new york university 1960 1962 entered u.s. army worked army intelligence finished enlistment 1963 began pursue ph.d. georgetown university recruited work national security agency retook foreign service exam 1963–64 time passed exams entered foreign service 1965 first assignment office planning management 1967 1970 political officer chief consular section u.s. embassy jakarta indonesia position attested passport application stanley ann dunham soetoro mother president barack h. obama thus become part barack obama citizenship conspiracy theories principal officer u.s. consulate medan 1978–1981 1985 1987 la porta served state department office management operations moved deputy chief mission u.s. embassy wellington new zealand 1987 1991 amb la porta washington-based assignments included working bureau east asian pacific affairs director office cambodian genocide investigation executive assistant president special representative philippine economic reform deputy director office indonesia malaysia brunei singapore affairs becoming u.s ambassador mongolia 1997 served president vice president american foreign service association 1995 1997 ambassador la porta retired u.s. foreign service september 2003 38 years service president united states-indonesia society usindo 2004 2007 currently managing partner trans pacific partners llc tpp provides professional support military exercises pacific europe latin america serves consultant civil preparedness disaster management amb la porta graduate national war college georgetown university school foreign service 1960 new york university served commissioned officer united states army 1961 1963 speaks indonesian turkish | [
7887
] | Validation |
4,556 | 4 | ZMW_attack:zmw attack zmw attack hypothetical denial-of-service attack internet routing infrastructure named ying zhang z. morley mao jia wang researchers published original paper considered possibility relies using targeted denial-of-service attacks links carrying bgp connections autonomous systems attempt overwhelm routers default-free zone routing updates leading disruption forcing perform continuous route recalculations 2010 security researcher max schuchard published paper considering possibility using botnet perform zmw attack internet entire core infrastructure hypothetically allowing botnet 250,000 computers crash entire internet | [
2409,
4883,
2085
] | Validation |
4,557 | 3 | Conceptual_interoperability:conceptual interoperability conceptual interoperability concept simulation theory however broadly applicable model-based information technology domains early ideas harkrider lunceford simulation composability studied detail petty weisel formulated current working definition composability capability select assemble simulation components various combinations simulation systems satisfy specific user requirements defining characteristic composability ability combine recombine components different simulation systems different purposes recent rand study provided coherent overview state composability military simulation systems within u.s. department defense many findings much broader applicability resulting challenges produced layered views petty weisel distinguish idea interoperability coping technical challenges composability dealing modeling issues research virginia modeling analysis simulation center vmasc refined layers define levels conceptual interoperability model lcim definition undergone gradual improvement since first discussion current version lcim first documented turnitsa different levels characterized follows lcim shows layered approach support composable services necessary ws standards described earlier able manage levels particular specific upper layers worth mentioning however lcim focuses technical support information systems command control information systems military context alberts hayes point organizational social aspects often even important tolk proposes layered framework measures merits dealing questions like tactical strategic alignment objectives even political coalition partners within contribution however focus information system aspects page et al suggest defining composability realm model interoperability realm software implementation model addition research introduces integratability coping hardware-side configuration side connectivity author supports categorization recommends following distinction dealing issues simulation system interoperability include meaningful simulation-to-simulation system interoperation ideas complement lcim lcim successfully applied domain modeling simulation generally model-based interoperability challenges pointed lcim used descriptive prescriptive mode recently recommended extend lcim interoperability maturity matrix acm sigsim scs sponsored expert discussion scs spring simulation multiconference san diego ca april 11 2013 professor tolk addressed composability grand challenge modeling simulation thinking cloud-based simulation proposed following two definitions referred latest work research team utilizes model theory lcim form slight variations thereof applied simulation many domains well examples given 500 journal articles book chapters conference papers referencing lcim ideas health human sciences http //aspe.hhs.gov/sp/reports/2010/erpreqlim/report.shtml medical simulation weininger s. jaffe m.b. robkin m. rausch t. arney d. goldman j.m. 2016 importance state context safe interoperable medical systems ieee journal translational engineering health medicine 4 pp.1-10 internet things kolbe niklas jérémy robert sylvain kubler yves le traon proficient productivity tool semantic interoperability open iot ecosystem proceedings 14th eai international conference mobile ubiquitous systems computing networking services 2017 department energy smartgrid http //www.gridwiseac.org/pdfs/interopframework_v1_1.pdf enterprise interoperability geographic information systems digital library ecosystem adaptive instructional systems workshop proceedings 2nd ais standards workshop opening address understanding ais problem space dr. robert sottilare original information based tolk 2006 comes semantic web pads implications dynamic web pads pp 55–62 20th workshop principles advanced distributed simulation pads'06 http //doi.ieeecomputersociety.org/10.1109/pads.2006.39 tolk diallo sy turnitsa cd winters ls 2006 composable web services net-centric applications journal defense modeling simulation jdms volume 3 number 1 pp 27-44 january 2006 enhanced several user contributions additions since | [
8717,
10452,
2948,
7045
] | None |
4,558 | 4 | Slowdroid:slowdroid slowdroid denial-of-service attack allows single mobile device take network server requiring minimal bandwidth attack created research purposes maurizio aiello developed enrico cambiaso ieiit institute national research council italy released android application slowdroid behavior similar slow dos attacks slowloris since creates many connections victim order saturate resources listening daemon application one difference sent payload case slowdroid compliant specific protocol instead sending forged http request endless sequence spaces sent instead characteristic makes slowdroid able target different protocols payload another difference sending data sending phase instead sending sequence characters slowloris slowdroid sends single character hence reducing bandwidth amounts finally main difference implementation slowdroid implemented executed android mobile operating system platform slowdroid initially published google play store due developers terms service application removed store currently available researchers website | [
2018,
10852,
2409,
6347,
2060,
5677,
7983,
953,
8413,
9727
] | None |
4,559 | 4 | Invicta_Networks:invicta networks invicta networks computer security company founded victor sheymov former kgb officer exfiltrated moscow brought united states 1980 company products use technology shifts ip addresses company claims makes impossible hack company technology mentioned film breach film | [
4956,
2558
] | Test |
4,560 | 4 | First_Department:first department first department charge secrecy political security workplace every enterprise institution soviet union dealt kind technical scientific information plants r institutions etc printing capabilities e.g. publishing houses every branch central statistical administration successor state statistics committee goskomstat also first department control access distribution publication official economic population social statistics copies especially sensitive documents numbered labeled stamped secret official use cases official use version documents mimicked public use versions format provided much detailed information first departments part kgb subordinated management enterprise institution among functions control access information considered state secret foreign travel publications first department also kept account usage copying devices xerographers printing presses typewriters etc prevent unsanctioned copying including samizdat | [] | Test |
4,561 | 6 | Gzip:gzip gzip file format software application used file compression decompression program created jean-loup gailly mark adler free software replacement compress program used early unix systems intended use gnu g gnu version 0.1 first publicly released 31 october 1992 version 1.0 followed february 1993. gzip based deflate algorithm combination lz77 huffman coding deflate intended replacement lzw patent-encumbered data compression algorithms time limited usability compress popular archivers gzip often also used refer gzip file format although file format also allows multiple streams concatenated gzipped files simply decompressed concatenated originally one file gzip normally used compress single files compressed archives typically created assembling collections files single tar archive also called tarball compressing archive gzip final compressed file usually extension gzip confused zip archive format also uses deflate zip format hold collections files without external archiver less compact compressed tarballs holding data compresses files individually take advantage redundancy files solid compression various implementations program written commonly known gnu project implementation using lempel-ziv coding lz77 openbsd version gzip actually compress program support gzip format added openbsd 3.4 g specific version stands gratis freebsd dragonfly bsd netbsd use bsd-licensed implementation instead gnu version actually command-line interface zlib intended compatible gnu implementation options implementations originally come netbsd support decompression bzip2 unix pack format alternative compression program achieving 3-8 better compression zopfli achieves gzip-compatible compression using exhaustive algorithms expense compression time required affect decompression time codice_3 written mark adler compatible gzip speeds compression using available cpu cores threads tar utility included linux distributions extract .tar.gz files passing option e.g. zlib abstraction deflate algorithm library form includes support gzip file format lightweight stream format api zlib stream format deflate gzip file format standardized respectively rfc 1950 rfc 1951 rfc 1952 gzip format used http compression technique used speed sending html content world wide web one three standard formats http compression specified rfc 2616 rfc also specifies zlib format called deflate equal gzip format except gzip adds eleven bytes overhead form headers trailers still gzip format sometimes recommended zlib internet explorer implement standard correctly handle zlib format specified rfc 1950. zlib deflate used internally portable network graphics png format since late 1990s bzip2 file compression utility based block-sorting algorithm gained popularity gzip replacement produces considerably smaller files especially source code structured text cost memory processing time factor 4 advancecomp 7-zip produce gzip-compatible files using internal deflate implementation better compression ratios gzip itself—at cost processor time compared reference implementation | [
2050,
516,
7702,
8214,
3618,
10791,
3114,
1583,
2095,
6713,
10817,
5698,
10822,
5703,
1098,
3659,
10317,
4174,
3674,
1631,
6759,
9320,
10857,
1646,
8304,
3188,
9844,
119,
9343,
2180,
7813,
658,
1172,
1173,
3222,
9880,
8863,
4780,
7855,
47... | Test |
4,562 | 4 | Stack_buffer_overflow:stack buffer overflow software stack buffer overflow stack buffer overrun occurs program writes memory address program call stack outside intended data structure usually fixed-length buffer stack buffer overflow bugs caused program writes data buffer located stack actually allocated buffer almost always results corruption adjacent data stack cases overflow triggered mistake often cause program crash operate incorrectly stack buffer overflow type general programming malfunction known buffer overflow buffer overrun overfilling buffer stack likely derail program execution overfilling buffer heap stack contains return addresses active function calls stack buffer overflow caused deliberately part attack known stack smashing affected program running special privileges accepts data untrusted network hosts e.g webserver bug potential security vulnerability stack buffer filled data supplied untrusted user user corrupt stack way inject executable code running program take control process one oldest reliable methods attackers gain unauthorized access computer canonical method exploiting stack-based buffer overflow overwrite function return address pointer attacker-controlled data usually stack illustrated codice_1 following example code takes argument command line copies local stack variable codice_2 works fine command-line arguments smaller 12 characters see figure b arguments larger 11 characters long result corruption stack maximum number characters safe one less size buffer c programming language strings terminated null byte character twelve-character input thus requires thirteen bytes store input followed sentinel zero byte zero byte ends overwriting memory location one byte beyond end buffer program stack codice_3 various inputs notice figure c argument larger 11 bytes supplied command line codice_3 overwrites local stack data saved frame pointer importantly return address codice_3 returns pops return address stack jumps address i.e starts executing instructions address thus attacker overwritten return address pointer stack buffer codice_6 contains attacker-supplied data actual stack buffer overflow exploit string would instead shellcode suitable platform desired function program special privileges e.g suid bit set run superuser attacker could use vulnerability gain superuser privileges affected machine attacker also modify internal variable values exploit bugs example number platforms subtle differences implementation call stack affect way stack buffer overflow exploit work machine architectures store top-level return address call stack register means overwritten return address used later unwinding call stack another example machine-specific detail affect choice exploitation techniques fact risc-style machine architectures allow unaligned access memory combined fixed length machine opcodes machine limitation make jump esp technique almost impossible implement one exception program actually contains unlikely code explicitly jump stack register within topic stack buffer overflows often-discussed-but-rarely-seen architecture one stack grows opposite direction change architecture frequently suggested solution stack buffer overflow problem overflow stack buffer occurs within stack frame overwrite return pointer investigation claimed protection finds naïve solution best overflow occurs buffer previous stack frame still overwrite return pointer allow malicious exploitation bug instance example return pointer codice_7 overwritten overflow actually occurs within stack frame codice_8 however buffer overflows call codice_8 resides previous stack frame return pointer codice_8 numerically higher memory address buffer means instead return pointer codice_7 overwritten return pointer codice_8 overwritten means growing stack opposite direction change details stack buffer overflows exploitable reduce significantly number exploitable bugs years number control-flow integrity schemes developed inhibit malicious stack buffer overflow exploitation may usually classified three categories stack canaries named analogy canary coal mine used detect stack buffer overflow execution malicious code occur method works placing small integer value randomly chosen program start memory stack return pointer buffer overflows overwrite memory lower higher memory addresses order overwrite return pointer thus take control process canary value must also overwritten value checked make sure changed routine uses return pointer stack technique greatly increase difficulty exploiting stack buffer overflow forces attacker gain control instruction pointer non-traditional means corrupting important variables stack another approach preventing stack buffer overflow exploitation enforce memory policy stack memory region disallows execution stack w^x write xor execute means order execute shellcode stack attacker must either find way disable execution protection memory find way put her/his shellcode payload non-protected region memory method becoming popular hardware support no-execute flag available desktop processors method definitely makes canonical approach stack buffer overflow exploitation fail without problems first common find ways store shellcode unprotected memory regions like heap little need change way exploitation even ways damning so-called return libc method shellcode creation attack malicious payload load stack shellcode proper call stack execution vectored chain standard library calls usually effect disabling memory execute protections allowing shellcode run normal works execution never actually vectors stack variant return-to-libc return-oriented programming rop sets series return addresses executes small sequence cherry-picked machine instructions within existing program code system libraries sequence ends return so-called gadgets accomplish simple register manipulation similar execution returning stringing together achieves attacker ends even possible use returnless return-oriented programming exploiting instructions groups instructions behave much like return instruction instead separating code data another mitigation technique introduce randomization memory space executing program since attacker needs determine executable code used resides either executable payload provided executable stack one constructed using code reuse ret2libc return-oriented programming rop randomizing memory layout concept prevent attacker knowing code however implementations typically randomize everything usually executable loaded fixed address hence even aslr address space layout randomization combined nonexecutable stack attacker use fixed region memory therefore programs compiled pie position-independent executables even region memory randomized entropy randomization different implementation implementation low enough entropy problem terms brute forcing memory space randomized | [
642,
8066,
5636,
3473,
1554,
3603,
1304,
1820,
9244,
161,
7717,
10024,
9854,
815,
5040,
435,
10933,
7734,
5176,
700,
2878,
2367,
1474,
1094,
5065,
1103,
4956,
6754,
7139,
11106,
9317,
4582,
4071,
8167,
10344,
10727,
5492,
3704,
2558
] | Train |
4,563 | 6 | Cylinder-head-sector:cylinder-head-sector cylinder-head-sector chs early method giving addresses physical block data hard disk drive 3d-coordinate system made vertical coordinate head horizontal radial coordinate cylinder angular coordinate sector head selects circular surface platter disk one two sides cylinder cylindrical intersection stack platters disk centered around disk spindle combined together cylinder head intersect circular line precisely circular strip physical data blocks called track sector finally selects data block track addressed viewed sort angular component chs addresses exposed instead simple linear addresses going 0 total block count disk 1 early hard drives n't come embedded disk controller would hide physical layout separate generic controller card used operating system know exact physical geometry specific drive attached controller correctly address data blocks geometry became complicated example introduction zone bit recording drive sizes grew time chs addressing method became restrictive since late 1980s hard drives begun shipping embedded disk controller good knowledge physical geometry would however report false geometry computer e.g. larger number heads actually present gain addressable space logical chs values would translated controller thus chs addressing longer corresponded physical attributes drive soon hard drive interfaces replaced chs scheme logical block addressing many tools manipulating master boot record mbr partition table still aligned partitions cylinder boundaries thus artifacts chs addressing still seen partitioning programs 2010s early 2010s disk size limitations imposed mbr became problematic guid partition table gpt designed replacement modern computers without mbr longer use notions chs addressing chs addressing process identifying individual sectors aka physical block data disk position track track determined head cylinder numbers terms explained bottom disk addressing sector smallest unit disk controllers introduce address translations map logical physical positions e.g. zone bit recording stores fewer sectors shorter inner tracks physical disk formats necessarily cylindrical sector numbers track skewed floppy disks controllers use physical sector sizes 128 256 512 1024 bytes e.g. pc/ax whereby formats 512 bytes per physical sector became dominant 1980s common physical sector size harddisks today 512 bytes hard disks 520 bytes per sector well non-ibm compatible machines 2005 seagate custom hard disks used sector sizes 1024 bytes per sector advanced format hard disks use 4096 bytes per physical sector 4kn since 2010 also able emulate 512 byte sectors 512e transitional period magneto-optical drives use sector sizes 512 1024 bytes 5.25-inch drives 512 2048 bytes 3.5-inch drives chs addressing sector numbers always start 1 sector 0 lead confusion since logical sector addressing schemes e.g. logical block addressing lba relative sector addressing dos typically start counting 0 physical disk geometries maximal sector number determined low level format disk however disk access bios ibm-pc compatible machines sector number encoded six bits resulting maximal number 111111 63 sectors per track maximum still use virtual chs geometries tracks thin concentric circular strips sectors least one head required read single track respect disk geometries terms track cylinder closely related single double sided floppy disk track common term two heads cylinder common term strictly speaking track given codice_1 combination consisting codice_2 sectors cylinder consists codice_3 sectors cylinder division data disk drive used chs addressing mode fixed block architecture disk cylinder–head–record cchhr addressing mode ckd disk concept concentric hollow cylindrical slices physical disks platters collecting respective circular tracks aligned stack platters number cylinders disk drive exactly equals number tracks single surface drive comprises track number platter spanning tracks across platter surface able store data without regard whether track bad cylinders vertically formed tracks words track 12 platter 0 plus track 12 platter 1 etc cylinder 12 forms direct access storage device dasd drum memory devices ibm 2321 data cell might give blocks addresses include cylinder address although cylinder address n't select geometric cylindrical slice device device called head reads writes data hard drive manipulating magnetic medium composes surface associated disk platter naturally platter 2 sides thus 2 surfaces data manipulated usually 2 heads per platter one per side sometimes term side substituted head since platters might separated head assemblies removable media floppy drive codice_4 addressing supported ibm-pc compatible bioses code used eight bits theoretically 256 heads counted head 0 255 codice_5 however bug versions microsoft dos/ibm pc dos including 7.10 cause operating systems crash boot encountering volumes 256 heads therefore compatible bioses use mappings 255 heads codice_6 including virtual codice_7 geometries historical oddity affect maximum disk size old bios int 13h code well old pc dos similar operating systems codice_8 mb actually codice_9 mb yields known 8 gb limit context relevant definition 8 gb 8192 mb another incorrect limit would require chs codice_10 64 sectors per track tracks cylinders counted 0 i.e. track 0 first outer-most track floppy cylindrical disks old bios code supported ten bits chs addressing 1024 cylinders codice_11 adding six bits sectors eight bits heads results 24 bits supported bios interrupt 13h subtracting disallowed sector number 0 codice_12 tracks corresponds 128 mb sector size 512 bytes codice_13 codice_14 confirms roughly 8 gb limit chs addressing starts codice_15 maximal value codice_16 codice_17 bits codice_18 24 bits limited 255 heads chs values used specify geometry disk count cylinder 0 head 0 resulting maximum codice_19 codice_20 24 bits 256 255 heads chs tuples specifying geometry actually means sectors per track virtual geometry still matches capacity disk contains codice_21 sectors larger hard disks come use cylinder become also logical disk structure standardised 16 065 sectors codice_22 chs addressing 28 bits eide ata-2 permits eight bits sectors still starting 1 i.e. sectors 1…255 four bits heads 0…15 sixteen bits cylinders 0…65535 results roughly 128 gb limit actually codice_23 sectors corresponding 130560 mb sector size 512 bytes codice_24 bits ata-2 specification also covered ralf brown interrupt list old working draft expired standard published old bios limit 1024 cylinders ata limit 16 heads combined effect codice_25 sectors i.e. 504 mb limit sector size 512 bios translation schemes known echs revised echs mitigated limitation using 128 240 instead 16 heads simultaneously reducing numbers cylinders sectors fit codice_26 echs limit 4032 mb codice_27 revised echs limit 7560 mb given total number sectors disk unix communities employ term block refer sector group sectors example linux fdisk utility version 2.25 displayed partition sizes using 1024-byte blocks clusters allocation units data various file systems fat ntfs etc data mainly consists files clusters directly affected physical virtual geometry disk i.e. cluster begin sector near end given codice_1 track end sector physically logically next codice_1 track 2002 ata-6 specification introduced optional 48 bits logical block addressing declared chs addressing obsolete still allowed implement ata-5 translations unsurprisingly chs lba translation formula given also matches last ata-5 chs translation ata-5 specification chs support mandatory 16 514 064 sectors optional larger disks ata-5 limit corresponds chs codice_30 equivalent disk capacities 16514064 16383×16×63 1032×254×63 requires 24 14+4+6 bits 16383 1 2 chs tuples mapped onto lba addresses using following formula lba address n number heads disk n maximum number sectors per track c h chs address logical sector number formula ecma-107 iso/iec 9293:1994 superseding iso 9293:1987 standards fat file systems matches exactly lba formula given logical block address logical sector number lsn synonyms formula use number cylinders requires number heads number sectors per track disk geometry chs tuple addresses different logical sector numbers depending geometry examples help visualize sequencing sectors linear lba model note cylinder head record format used count key data ckd hard disks ibm mainframes since least 1960s largely comparable cylinder head sector format used pcs save sector size fixed could vary track track based needs application contemporary use disk geometry presented mainframe emulated storage firmware longer relation physical disk geometry earlier hard drives used pc mfm rll drives divided cylinder equal number sectors chs values matched physical properties drive drive chs tuple codice_43 would 500 tracks per side platter two platters 4 heads 32 sectors per track total 32 768 000 bytes 31.25 mb ata/ide drives much efficient storing data replaced archaic mfm rll drives use zone bit recording zbr number sectors dividing track varies location groups tracks surface platter tracks nearer edge platter contain blocks data tracks close spindle physical space within given track near edge platter thus chs addressing scheme correspond directly physical geometry drives due varying number sectors per track different regions platter many drives still surplus sectors less 1 cylinder size end drive since total number sectors rarely ever ends cylinder boundary ata/ide drive set system bios configuration cylinders heads sectors exceed capacity drive bios since drive convert given chs value actual address specific hardware configuration however cause compatibility problems operating systems microsoft dos older version windows partition must start end cylinder boundary modern operating systems windows xp included may disregard rule still cause compatibility issues especially user wants perform dual booting drive microsoft follow rule internal disk partition tools since windows vista | [
3841,
6148,
6797,
2193,
6939,
6434,
7983,
5552,
434,
178,
9907,
7734,
8900,
8393,
589,
9166,
4441,
5598,
6118,
11494,
1515,
2545,
3315,
5492,
2811,
9597
] | Test |
4,564 | 2 | AmigaGuide:amigaguide amigaguide hypertext document file format designed amiga files stored ascii possible read edit file without need special software since workbench 2.1 amiga guide system o.s inline help files reading manuals hypertext formatting elements launched amigaos based viewer called simply amigaguide included standard feature amiga system users earlier versions workbench could view files downloading program library amigaguide 34 distributed public domain collections floppy disks example fred fish collection could downloaded directly aminet software repository starting amigaos 3.0 amigaguide tool replaced complete flexible multiview amigaguide default tool viewing amigaguide files used amigaos 2.1 also basic text viewer ascii documents handle multiple files thanks cross-linking tables called xref multiview basically void container natural gui various datatypes open multiview default tool media file including amigaguide files invoked mouse clicking recognized existing correspondent datatype although amigaguide format almost solely used documenting amiga programs viewers available several platforms amigaguide document simple ascii-formatted document edited normal text editor viewed text reader software amigaguide commands begin pronounced 'at symbol recognized amigaguide document first line include text codice_1 three categories commands global node attributes global commands usually specified beginning document nodes defined apply nodes document technically anywhere many commands used globally nodes node commands usable inside node node endnode affect node used attributes may specified anywhere normal line addition symbol attributes always use pair braces enclose attribute name possibly additional arguments commands index help next prev toc all-purpose hypertext link specify nodes jump support naming nodes within current document also support path along name lets node located amigaguide document shown simply embossed text squared buttons page multiview access node another document simply required put amigados file path node name point view amigaguide simple hypertext language since amigaos 3.0 user jump file supported amiga datatypes – pictures animation anything uses multiview program handle internal support datatype amiga standard user must still give node name even though file amigaguide file nodes – syntax codice_2 | [
9,
139,
6797,
11023,
5264,
2193,
9236,
3233,
9249,
8618,
6062,
432,
8369,
8115,
823,
6075,
319,
1347,
11076,
10570,
5709,
1742,
850,
6233,
345,
5729,
5736,
11370,
5743,
7539,
11123,
9848
] | Test |
4,565 | 3 | PC-based_IBM-compatible_mainframes:pc-based ibm-compatible mainframes since rise personal computer 1980s ibm vendors created pc-based ibm-compatible mainframes compatible larger ibm mainframe computers period time pc-based mainframe-compatible systems lower price require much electricity floor space however sacrificed performance dependable mainframe-class hardware products popular mainframe developers education training settings small companies non-critical processing certain disaster relief roles field insurance adjustment systems hurricane relief mid-1990s mainframes large machines often occupied entire rooms rooms often air conditioned special power arrangements accommodate three-phase electric power required machines modern mainframes physically comparatively small require little special building arrangements ibm demonstrated use mainframe instruction set first desktop computer—the ibm 5100 released 1975 product used microcode execute many system/370 processor instructions could run slightly modified version ibm apl mainframe program interpreter 1980 rumors spread new ibm personal computer perhaps miniaturized version ibm system/370 1981 ibm personal computer appeared based system 370 architecture however ibm use new pc platform create exotic combinations additional hardware could execute s/370 instructions locally october 1983 ibm announced ibm personal computer xt/370 essentially three-in-one product could run pc dos locally could also act 3270 terminal finally—its important distinguishing feature relative ibm 3270 pc—was could execute s/370 instructions locally xt/370 ibm personal computer xt system unit 5160 three custom 8-bit cards processor card 370pc-p contained two modified motorola 68000 chips could emulate s/370 fixed-point instructions non-floating-point instructions intel 8087 coprocessor modified emulate s/370 floating point instructions second card 370pc-m connected first unique card back connector contained 512 kib memory third card pc3277-em 3270 terminal emulator required download system software host mainframe xt/370 computer booted dos ran vm/pc control program card memory space added additional system memory first 256 kib motherboard memory could used move data 512 kib expansion card expansion memory dual ported provided additional 384 kib xt machine bringing total ram xt side 640 kib memory arbitrator could bank switch second 128 kib bank card banks allowing xt intel 8088 processor address ram 370pc-m card besides 416 kb usable ram s/370 applications xt/370 also supported 4 mb virtual memory using hard drive paging device ibm claimed xt/370 reached 0.1 mips data fit ram 1984 list price xt/370 typical configuration approximately 12,000 compared favorably ibm mainframes /mips basis example ibm 4341 delivered 1.2 mips 500,000 theoretically reduced demand customers mainframes offloading load onto smaller computer customers purchased xt/370s likely increased overall load mainframes increasing ibm mainframe sales similarly mainframe version vm/cms vm/pc also created illusion virtual disks pc version maintained pc-dos files either floppy hard disk example cms virtual disk belonging user fred device address 101 stored dos file fred.101 cms import export commands allowed extraction files virtual drives well ascii/ebcdic conversion xt/370 came xt-style 83-key keyboard 10 function keys newer revisions xt/370 dropped pc3277-em favor ibm 3278/79 boards xt/370 among xt systems could use second hard drive mounted 5161 expansion chassis byte 1984 called xt/370 qualified success magazine praised ibm fitting 370 features xt hoped technical improvements might result even better computer 1984 ibm introduced ibm personal computer at/370 similar cards xt/370 updated software supporting larger hard disks dma transfers 3277 card at/370 processor card system almost 60 faster xt/370 at/370 used different 16-bit interface co-processing cards xt called pc/370-p2 pc/370-m2 latter card still 512 kb memory 480 kb usable programs s/370 mode 32 kb reserved microcode storage terminal emulation function at/370 came 3278/79 emulation adapter late-series xt/370 at/370 motherboard equipped 512 kb ram at/370 also ran vm/pc pc dos 3.0 instead 2.10 xt version used vm/pc version 2 launched november 1985 improved performance 50 allowed add-on memory addition disk used page cache vm november 1985 computerworld article noted machine slow selling april 1988 ibm introduced system/370 workstation shipping customers since august 1987 officially called ibm 7437 vm/sp technical workstation later also known personal system/370 freestanding tower connected mca card installed ps/2 model 60 70 80 7437 tower contained processor 16main memory ps/2 provided i/o disk storage 7437 ran ibm vm/sp operating system one ibm representative described 7437 like 9370 single terminal intended existing s/370 users november 1988 list price 18,100 minimum 25-unit order one intended roles provide single-user s/370-compatible computer could run computer-aided design engineering applications originated ibm mainframes cadam catia graphics support provided ibm 5080 graphics system floor-standing tower 5080 connected 7437 ps/2 via cable mca adapter later ibm introduced personal/370 aka p/370 single slot 32-bit mca card added ps/2 rs/6000 computer run system/370 oss like music/sp vm vse parallel os/2 ps/2 aix rs/6000 supporting multiple concurrent users complete implementation s/370 processor including fpu co-processor 16 mb memory management standard i/o channels provided via host os/hardware additional 370 channel card added provide mainframe-specific i/o 3270 local control units 3400/3480 tape drives 7171 protocol converters although single-card product p/370 ran three times faster 7437 attaining 3.5 mips par low-end ibm 4381 subsequent book author claims 4.1 mips p/370 personal/370 available early november 1989 although special bid basis 1995 ibm introduced card enhanced s/390 microprocessor complex supported ibm esa/390 architecture pc-based system ibm pc-related products evolved support well employing card ibm part number 8640-pb0 ibm pc server 330 1998 ibm pc server 500 models important goal design s/390 processor card complete compatibility existing mainframe operating systems software processor implements esa/390 xa instructions prevents need instruction translation three generations card r/390 designation used expansion card used ibm rs/6000 server original r/390 featured 67 77 mhz power2 processor 32 512 mb ram depending configuration mca p/390 expansion card installed mca rs/6000 system pci p/390 card installed number early pci rs/6000s configurations referred r/390 r/390 servers need run aix version 4 host operating system p/390 designation used expansion card used ibm pc server less expensive r/390 original p/390 server housed ibm pc server 500 featured 90 mhz intel pentium processor running os/2 model revised mid-1996 rebranded pc server 520 featured 133 mhz intel pentium processor models came standard 32 mb ram expandable 256 mb pc server 500 featured eight mca expansion slots pc server 520 added two pci expansion slots removed two mca slots s/390 integrated server aka s/390 mainframe housed comparably small case hxwxd 82 x 52 x 111 cm became available november 1998 intended customers require i/o bandwidth performance s/390 multiprise 3000 size 256 mb ecc memory single cmos main processor performance 8 mips used s/390 cpu used integrated server fact p/390 e-card pentium ii used iosp i/o service processor supports four escon four parallel channels standard pci isa slots present maximum 255 gb internal harddisks supported 16x 18gb hds 2x hds redundancy supported oss os/390 mvs/esa vm/esa vse/esa fujitsu offers two pc-compatible systems make lower end fujitsu s/390-based bs2000 mainframe product line sq100 slower configuration using dual-core 2.93ghz intel xeon e7220 processors capable 200rpf performance sq200 introduced recently uses six-core 2.66ghz xeon x7542 processors performance 700rpf intel 64-based bs2000 mainframes run linux windows separate partitions fujitsu also continues make custom s/390-native processors mainframe hardware high end bs2000 line since late 1990s pc processors become fast enough perform mainframe emulation without need coprocessor card currently several personal computer emulators available support system/390 z/architecture | [
7607,
421,
7269,
3304,
11673,
8379,
6415,
7151,
7217,
3443,
11539,
1461,
2519,
2168,
11447,
3323
] | None |
4,566 | 4 | John_C._Inglis:john c. inglis john chris inglis also known chris inglis former deputy director national security agency retired deputy director january 10 2014 inglis born baltimore maryland 29 october 1954 graduated andover high school linthicum 1972 inglis distinguished eagle scout high school inglis attended united states air force academy graduating 1976 distinguished graduate bachelor science degree engineering mechanics inglis training includes undergraduate instructor pilot training also attended air war college designated outstanding graduate | [
289,
4898,
7137,
10305,
11302,
327,
266,
6668,
365,
9357,
4719,
7759,
2897,
1714,
7887,
10832,
2712,
6749
] | None |
4,567 | 3 | Display_Data_Channel:display data channel display data channel ddc collection protocols digital communication computer display graphics adapter enable display communicate supported display modes adapter enable computer host adjust monitor parameters brightness contrast standard created video electronics standards association vesa ddc suite standards aims provide plug play experience computer displays ddc1 ddc2b/ab/b+/bi protocols physical link monitor video card originally carried either two three pins 15-pin analog vga connector extended display identification data edid companion standard defines compact binary file format describing monitor capabilities supported graphics modes stored read-only memory eeprom chip programmed manufacturer monitor format uses description block containing 128 bytes data optional extension blocks provide additional information current version enhanced edid e-edid release v2.0 first version ddc standard adopted august 1994 included edid 1.0 format specified ddc1 ddc2b ddc2ab physical links ddc version 2 introduced april 1996 split edid separate standard introduced ddc2b+ protocol ddc version 3 december 1997 introduced ddc2bi protocol support vesa plug display flat panel display interface separate device addresses requiring comply edid 2.0 ddc standard superseded e-ddc 1999 prior ddc vga standard reserved four pins analog vga connector known id0 id1 id2 id3 pins 11 12 4 15 identification monitor type id pins attached resistors pull one ground gnd allowed definition monitor type open n/c connected meaning monitor commonly documented scheme id3 pin unused 3 remaining pins defined id0 pulled gnd color monitors monochrome monitors pulled id1 gnd finally id2 pulled gnd signaled monitor capable 1024×768 resolution ibm 8514 scheme input states id pins would encode monitor type follows elaborate schemes also existed used 4 id pins manipulating hsync vsync signals order extract 16 bits 4 id pin values 4 combinations hsync vsync states monitor identification ddc changed purpose id pins incorporate serial link interface however transition change backwards-compatible video cards using old scheme could problems ddc-capable monitor connected ddc signal send video graphics array vga monitor ic protocol using master serial clock serial data pins ddc1 simple low-speed unidirectional serial link protocol pin 12 id1 functions data line continuously transmits 128-byte edid block data clock synchronised vertical sync providing typical clock rates 60 100 hz display devices implemented protocol common version called ddc2b based i²c serial bus pin 12 id1 vga connector used data pin i²c bus formerly-unused pin 15 became i²c clock pin 9 previously used mechanical key supplied +5v dc power 50ma drive eeprom allows host read edid even monitor powered though i²c fully bidirectional supports multiple bus-masters ddc2b unidirectional allows one bus master graphics adapter monitor acts slave device 7-bit i²c address 50h provides 128-256 bytes read-only edid access always read first i²c octet always a1h ddc2ab implementation i²c-based 100 kbit/s access.bus interface allowed monitor manufacturers support external access.bus peripherals mouse keyboard little additional effort devices monitors briefly available mid 1990s disappeared introduction usb ddc2b+ ddc2bi scaled-down versions ddc2ab support monitor graphics card devices still allow bidirectional communication ddc2 exclusive vga connector dvi hdmi connectors feature dedicated ddc2b wires ddc/ci command interface standard introduced august 1998 specifies means computer send commands monitor well receive sensor data monitor bidirectional link specific commands control monitors defined separate monitor control command set mccs standard version 1.0 released september 1998 ddc/ci monitors sometimes supplied external color sensor allow automatic calibration monitor color balance tilting ddc/ci monitors support auto-pivot function rotation sensor monitor enables operating system keep display upright monitor moved portrait landscape positions ddc/ci monitors support small subset mccs commands undocumented commands many manufacturers pay attention ddc/ci past almost monitors support general mccs commands brightness contrast management ddc/ci standard describes full suite bidirectional control protocols ddc2ab ddc2bi ddc2b+ single standard provides means packaging monitor control command set commands ddc/ci version 1.1 adopted october 2004 monitor control command set version 2.0 adopted october 2003 new mccs v3 introduced july 2006 though n't gain enough industry attention yet latest release v2 standard version 2.2 adopted february 2009 enhanced display data channel e-ddc recent revision ddc standard version 1 introduced september 1999 featured addition segment pointer allowed 32 kbytes display information storage use enhanced edid e-edid standard earlier ddc implementations used simple 8-bit data offset communicating edid memory monitor limiting storage size 2 bytes 256 bytes allowing use cheap 2-kbit eeproms e-ddc special i²c addressing scheme introduced multiple 256-byte segments could selected single 8-bit segment index passed display via i²c address 30h access always write first i²c octet always 60h data selected segment immediately read via regular ddc2 address using repeated i²c 'start signal however vesa specification defines segment index value range 00h 7fh allows addressing 128 segments × 256 bytes segment index register volatile defaulting zero automatically resetting zero nack stop therefore must set every time access data first 256-byte segment performed auto-reset mechanism provide backward compatibility example ddc2b hosts otherwise may stuck segment 00h rare cases important changes removal ddc1 ddc2ab protocols deprecation separate vesa p fpdi device addresses clarifications ddc power requirements e-ddc version 1.1 approved march 2004 featured support hdmi consumer electronics e-ddc version 1.2 approved december 2007 introduced support displayport dedicated ddc2b links uses bidirectional auxiliary channel edid mccs communication displayid standards e-ddc version 1.3 september 2017 contains corrections errata minor clarifications kvm switches keyboard-video-mouse video extenders handle ddc traffic incorrectly making necessary disable monitor plug play features operating system maybe even physically remove pin 12 serial data pin analog vga cables connect device multiple pcs microsoft windows features standard plug play monitor driver uses display edid information construct list supported monitor modes display resolution control panel applet allows user disable driver plug play features manually select resolution refresh rate supported video card many video card manufacturers third parties provide control applications allow user select custom display mode conform edid information monitor .inf file | [
9056,
9057,
2594,
9321,
7594,
11631,
10833,
11634,
6995,
6233,
3548,
3453
] | None |
4,568 | 4 | ZoneAlarm_Z100G:zonealarm z100g zonealarm secure wireless router z100g discontinued unified threat management security router home soho market z100g developed sofaware technologies check point company hardware similar sofaware safe office vpn-1 edge lines software differs features license allows user access degree zonealarm z100g provides networking security related features including | [
1792,
2049,
4480,
2563,
6797,
1172,
8343,
9496,
3482,
1436,
4511,
6431,
2082,
10531,
5924,
550,
8998,
10790,
3243,
1708,
3885,
7983,
8753,
823,
569,
5178,
11577,
9279,
5057,
1858,
10433,
11073,
2118,
4814,
9423,
10574,
7121,
10451,
10708,
... | Validation |
4,569 | 3 | ARM9:arm9 arm9 group older 32-bit risc arm processor cores licensed arm holdings microcontroller use arm9 core family consists arm9tdmi arm940t arm9e-s arm966e-s arm920t arm922t arm946e-s arm9ej-s arm926ej-s arm968e-s arm996hs since arm9 cores released 1998 2006 longer recommended new ic designs instead arm cortex-a arm cortex-m arm cortex-r cores preferred design generation arm moved von neumann architecture princeton architecture modified meaning split cache harvard architecture separate instruction data buses caches significantly increasing potential speed silicon chips integrating cores package modified harvard architecture chips combining two address buses side separated cpu caches tightly coupled memories two subfamilies implementing different arm architecture versions key improvements arm7 cores enabled spending transistors include additionally arm9 cores incorporate enhanced dsp instructions multiply-accumulate support efficient implementations digital signal processing algorithms switching von neumann architecture entailed non-unified cache instruction fetches evict data vice versa arm9 cores separate data address bus signals chip designers use various ways cases connect least part address space von neumann style used instructions data usually ahb interconnect connecting dram interface external bus interface usable flash memory hybrids longer pure harvard architecture processors arm holdings neither manufactures sells cpu devices based designs rather licenses processor architecture interested parties arm offers variety licensing terms varying cost deliverables licensees arm provides integratable hardware description arm core well complete software development toolset right sell manufactured silicon containing arm cpu integrated device manufacturers idm receive arm processor ip synthesizable rtl written verilog form ability perform architectural level optimizations extensions allows manufacturer achieve custom design goals higher clock speed low power consumption instruction set extensions optimizations size debug support etc determine components included particular arm cpu chip consult manufacturer datasheet related documentation arm mpcore family multicore processors support software written using either asymmetric amp symmetric smp multiprocessor programming paradigms amp development central processing unit within mpcore may viewed independent processor follow traditional single processor development strategies arm9tdmi successor popular arm7tdmi core also based armv4t architecture cores based support 32-bit arm 16-bit thumb instruction sets include arm9e arm9ej sibling implement basic arm9tdmi pipeline add support armv5te architecture includes dsp-esque instruction set extensions addition multiplier unit width doubled halving time required multiplication operations support 32-bit 16-bit sometimes 8-bit instruction sets amount documentation arm chips daunting especially newcomers documentation microcontrollers past decades would easily inclusive single document chips evolved documentation grown total documentation especially hard grasp arm chips since consists documents ic manufacturer documents cpu core vendor arm holdings typical top-down documentation tree high-level marketing slides datasheet exact physical chip detailed reference manual describes common peripherals aspects physical chips within series reference manual exact arm core processor within chip reference manual arm architecture core includes detailed description instruction sets ic manufacturer additional documents including evaluation board user manuals application notes getting started development software software library documents errata | [
7170,
10767,
8720,
11282,
5659,
10784,
38,
4139,
8237,
11314,
8250,
6203,
8253,
6207,
7234,
7235,
2635,
7269,
11374,
7281,
3698,
4211,
5237,
630,
638,
11395,
9863,
11405,
1170,
659,
5267,
9366,
666,
5786,
9371,
4773,
682,
9391,
2224,
1144... | None |
4,570 | 4 | Spanish_Network_of_Excellence_on_Cybersecurity_Research:spanish network excellence cybersecurity research spanish network excellence cybersecurity research renic research initiative promote cybersecurity interests spain | [] | Test |
4,571 | 2 | Property_list:property list macos ios nextstep gnustep programming frameworks property list files files store serialized objects property list files use filename extension .plist thus often referred p-list files property list files often used store user settings also used store information bundles applications task served resource fork old mac os since data represented property lists somewhat abstract underlying file format implemented many ways namely nextstep used one format represent property list subsequent gnustep macos frameworks introduced differing formats nextstep property lists designed human-readable edited hand serialized ascii syntax somewhat like programming language strings represented binary data represented arrays represented dictionaries represented one limitation original next property list format could represent nsvalue number boolean etc object gnustep adopts nextstep format additions first supports nsvalue objects represented plain ascii second supports nsdate objects serialized *dyyyy-mm-dd hh mm ss timezone gnustep also read write property lists formats used macos macos also read nextstep format apple sets aside favor two new formats mac os x 10.0 nextstep format deprecated new xml format introduced public dtd defined apple xml format supports non-ascii characters storing nsvalue objects unlike gnustep ascii property list format apple ascii property list format support since xml files however space-efficient means storage mac os x 10.2 introduced new format property list files stored binary files starting mac os x 10.4 default format preference files mac os x 10.7 support reading writing files json format introduced json property lists fully compatible though example property lists native date data types json format support conversely json permits null values property lists support explicit nulls plutil utility introduced mac os x 10.2 used check syntax property lists convert property list file one format another also defaults utility introduced nextstep used manipulate plist files used storage preferences also known os x defaults hence name command line via preferences domain utility used edit arbitrary plist files another tool plistbuddy command line utility resides /usr/libexec/plistbuddy useful merging plist files altering entries related software development xml json property lists hand-editable text editor additionally apple provides support xcode editing property lists hierarchical viewer/editor handle plists formatted binary xml json mac os x 10.4 apple provides applescript interface reading property list files system events application mac os x 10.5 apple provides applescript interface editing creating writing property list files well xml format tags related foundation classes corefoundation types data storage formats follows binary file format documented comment block c code source file apple open sourced implementation binary plists foundation library apple describes implementation opaque plist manual page documentation means reliance format discouraged binary file format magic number first bytes file indicate valid plist file text bplist binary file store information captured xml json file formats array set dictionary binary types made pointers objref keyref entries index object table file means binary plists capture fact example separate array dictionary serialized file data element stored captured xml file converting binary file result copy data element placed xml file additionally binary file uid type used identify data items serialized practice uid type simply expanded 64 bit integer complete list data stored taken c code source file follows although best known apple darwin systems including ios macos plist files also present windows computers apple software itunes safari installed windows files typically binary files although applications may generate plist files formats windows plist files stored user ’ home directory following path plist files windows typically store preferences information rather using windows registry options editing plist files windows extensive macos file xml json format care text editor notepad++ used apple ships utility named plutil.exe apple application support package part itunes convert binary plist files xml edited text xml editor plisteditorpro afterwards convert back binary using plutil.exe provides zero cost solution plist editing windows commercial tool plistinator plist editor handles xml binary plist files windows introduced 2006 first released netbsd 4.0 2007 proplib library used serialising data kernel userland one sample users proplib second revision sysmon envsys framework system monitoring netbsd proplib library also ported dragonfly 2010 available since dragonfly bsd 2.8 | [
4615,
10765,
4111,
5647,
1042,
9762,
6700,
1071,
4657,
1074,
8262,
9802,
5710,
5713,
3670,
4184,
2141,
4702,
1637,
2149,
8303,
8304,
8816,
6771,
2676,
7806,
9343,
3719,
10888,
11402,
2193,
8852,
1686,
7318,
3228,
2207,
1699,
5292,
8877,
1... | None |
4,572 | 9 | Type_safety:type safety computer science type safety extent programming language discourages prevents type errors type error erroneous undesirable program behaviour caused discrepancy differing data types program constants variables methods functions e.g. treating integer int floating-point number float type safety sometimes alternatively considered property computer program rather language program written languages type-safe facilities circumvented programmers adopt practices exhibit poor type safety formal type-theoretic definition type safety considerably stronger understood programmers type enforcement static catching potential errors compile time dynamic associating type information values run-time consulting needed detect imminent errors combination behaviors classified type errors given programming language usually result attempts perform operations values appropriate data type classification partly based opinion may imply operation leading program crashes security flaws obvious failures legitimate need considered error may imply contravention programmer explicit intent communicated via typing annotations erroneous type-safe context static compile-time type systems type safety usually involves among things guarantee eventual value expression legitimate member expression static type precise requirement subtle — see example subtype polymorphism complications type safety closely linked memory safety restriction ability copy arbitrary bit patterns one memory location another instance implementation language type formula_1 sequence bits appropriate length represent legitimate member formula_1 language allows data copied variable type formula_1 type-safe operation might assign non-formula_1 value variable conversely language type-unsafe extent allowing arbitrary integer used pointer memory-safe statically typed languages provide degree type safety strictly stronger memory safety type systems enforce proper use abstract data types defined programmers even strictly necessary memory safety prevention kind catastrophic failure type-safe code accesses memory locations authorized access discussion type safety specifically refers memory type safety confused type safety broader respect example type-safe code read values another object private fields robin milner provided following slogan describe type safety appropriate formalization slogan depends style formal semantics used particular language context denotational semantics type safety means value expression well-typed say type τ bona fide member set corresponding τ 1994 andrew wright matthias felleisen formulated standard definition proof technique type safety languages defined operational semantics approach type safety determined two properties semantics programming language properties exist vacuum linked semantics programming language describe large space varied languages fit criteria since notion well typed program part static semantics programming language notion getting stuck going wrong property dynamic semantics vijay saraswat provides following definition type safety ultimately aimed excluding problems e.g type safety usually requirement toy language proposed academic programming language research many languages hand big human-generated type safety proofs often require checking thousands cases nevertheless languages standard ml rigorously defined semantics proved meet one definition type safety languages haskell believed meet definition type safety provided certain escape features used example haskell unsafeperformio used escape usual restricted environment i/o possible circumvents type system used break type safety type punning another example escape feature regardless properties language definition certain errors may occur run-time due bugs implementation linked libraries written languages errors could render given implementation type unsafe certain circumstances early version sun java virtual machine vulnerable sort problem programming languages often colloquially classified strongly typed weakly typed also loosely typed refer certain aspects type safety 1974 liskov zilles defined strongly-typed language one whenever object passed calling function called function type must compatible type declared called function 1977 jackson wrote strongly typed language data area distinct type process state communication requirements terms types contrast weakly typed language may produce unpredictable results may perform implicit type conversion object oriented languages type safety usually intrinsic fact type system place expressed terms class definitions class essentially defines structure objects derived api contract handling objects time new object created comply contract function exchanges objects derived specific class implementing specific interface adhere contract hence function operations permitted object defined methods class object implements guarantee object integrity preserved exceptions object oriented languages allow dynamic modification object structure use reflection modify content object overcome constraints imposed class methods definitions ada designed suitable embedded systems device drivers forms system programming also encourage type-safe programming resolve conflicting goals ada confines type-unsafety certain set special constructs whose names usually begin string unchecked_ unchecked_deallocation effectively banned unit ada text applying pragma pure unit expected programmers use unchecked_ constructs carefully necessary programs use type-safe spark programming language subset ada eliminating potential ambiguities insecurities time adding statically checked contracts language features available spark avoids issues dangling pointers disallowing allocation run time entirely ada2012 adds statically checked contracts language form pre- post-conditions well type invariants c programming language type-safe limited contexts example compile-time error generated attempt made convert pointer one type structure pointer another type structure unless explicit cast used however number common operations non-type-safe example usual way print integer something like codice_2 codice_3 tells codice_4 run-time expect integer argument something like codice_5 tells function expect pointer character-string yet supplies integer argument may accepted compilers produce undefined results partially mitigated compilers gcc checking type correspondences printf arguments format strings addition c like ada provides unspecified undefined explicit conversions unlike ada idioms use conversions common helped give c type-unsafe reputation example standard way allocate memory heap invoke memory allocation function codice_6 argument indicating many bytes required function returns untyped pointer type codice_7 calling code must explicitly implicitly cast appropriate pointer type pre-standardized implementations c required explicit cast therefore code codice_8 became accepted practice features c++ promote type-safe code c type-safe statically type-safe support untyped pointers must accessed using unsafe keyword prohibited compiler level inherent support run-time cast validation casts validated using keyword return null reference cast invalid using c-style cast throw exception cast invalid see c sharp conversion operators undue reliance object type types derived runs risk defeating purpose c type system usually better practice abandon object references favour generics similar templates c++ generics java java language designed enforce type safety anything java happens inside object object instance class implement type safety enforcement object usage needs allocated java allows usage primitive types inside properly allocated objects sometimes part type safety implemented indirectly e.g class bigdecimal represents floating point number arbitrary precision handles numbers expressed finite representation operation bigdecimal.divide calculates new object division two numbers expressed bigdecimal case division finite representation one computes e.g 1/3=0.33333 ... divide method raise exception rounding mode defined operation hence library rather language guarantees object respects contract implicit class definition sml rigorously defined semantics known type-safe however implementations sml including standard ml new jersey sml/nj syntactic variant mythryl mlton provide libraries offer certain unsafe operations facilities often used conjunction implementations foreign function interfaces interact non-ml code c libraries may require data laid specific ways another example sml/nj interactive toplevel must use unsafe operations execute ml code entered user modula-2 strongly typed language design philosophy require unsafe facilities explicitly marked unsafe achieved moving facilities built-in pseudo-library called system must imported used import thus makes visible facilities used unfortunately consequently implemented original language report implementation still remained unsafe facilities type cast syntax variant records inherited pascal could used without prior import difficulty moving facilities system pseudo-module lack identifier facility could imported since identifiers imported syntax iso modula-2 standard corrected type cast facility changing type cast syntax function called cast imported pseudo-module system however unsafe facilities variant records remained available without import pseudo-module system recent revision language applied original design philosophy rigorously first pseudo-module system renamed unsafe make unsafe nature facilities imported explicit remaining unsafe facilities either removed altogether example variant records moved pseudo-module unsafe facilities identifier could imported enabling identifiers introduced order enable facility corresponding enabling identifier must imported pseudo-module unsafe unsafe facilities remain language require import unsafe pascal number type safety requirements kept compilers pascal compiler dictates strict typing two variables assigned unless either compatible conversion integer real assigned identical subtype example following code fragment strict typing variable defined twotypes compatible dualtypes identical even though components user defined type identical assignment t1 d2 illegal assignment t1 t2 would legal subtypes defined identical however assignment t1.q d1.q would legal general common lisp type-safe language common lisp compiler responsible inserting dynamic checks operations whose type safety proven statically however programmer may indicate program compiled lower level dynamic type-checking program compiled mode considered type-safe following examples illustrates c++ cast operators break type safety used incorrectly first example shows basic data types incorrectly casted example codice_9 explicitly prevents compiler performing safe conversion integer floating-point value program runs output garbage floating-point value problem could avoided instead writing codice_10 next example shows object references incorrectly downcasted two child classes members different types downcasting parent class pointer child class pointer resulting pointer may point valid object correct type example leads garbage value printed problem could avoided replacing codice_11 codice_12 throws exception invalid casts | [
6021,
2062,
1936,
11030,
10649,
11674,
10013,
10145,
1954,
3876,
5796,
3624,
428,
5677,
7734,
3767,
11574,
8251,
10043,
10684,
2878,
10049,
1474,
11203,
70,
8262,
7627,
8524,
5837,
11212,
4823,
479,
8545,
4069,
8421,
2152,
363,
4974,
5872,
... | Test |
4,573 | 4 | Signed_and_Encrypted_Email_Over_The_Internet:signed encrypted email internet signed encrypted email internet seeoti initiative approach providing small medium enterprises ability communicate securely one another government defence ministries major aerospace defence contractors allowing play full part defence supply chain seeoti implements secure email specifications defined transglobal secure collaboration program tscp support interoperable signing encryption email messages federated environment addition security labelling email messages supported network border guard able check labels even though messages encrypted meets goal protecting intellectual property global business environment particular importance uk cyber security strategy intellectual property seen key growth economy deep-secure organised trial seeoti uk mod uk council electronic business integrated commercial shelf cots products titus boldon james deep-secure provide system email security functionality deep-secure selected overall winner ukceb excellence awards 2011 work seeoti february 2012 deep-secure partners adept4 intercede trustis providing seeoti solution service nexor provide compatible products | [
11046,
3930,
6110
] | Test |
4,574 | 4 | GoodSync:goodsync goodsync backup file synchronization program used synchronizing files two directories either one computer computer another storage device e.g another computer removable disc flash drive smartphone computer remote computer server goodsync allows version files maintained multiple computing devices words two devices synchronized user sure current version file available devices regardless last modified several versions | [
9025,
11201,
7364,
3366,
10185,
1358,
7983,
4623,
11633,
11543
] | None |
4,575 | 4 | Initiative_for_Open_Authentication:initiative open authentication initiative open authentication oath industry-wide collaboration develop open reference architecture using open standards promote adoption strong authentication close thirty coordinating contributing members proposing standards variety authentication technologies aim lowering costs simplifying use name oath acronym phrase open authentication pronounced english word oath oath related oauth open standard authorization | [
3521,
4965,
2558,
10566,
7368,
11175,
3309,
10801,
7958,
6750
] | Test |
4,576 | 2 | Open_Programming_Language:open programming language open programming language opl embedded programming language portable devices run symbian operating system found nokia 9200 9300 9500 communicator series mobile telephone/personal digital assistant pda sony ericsson p800 p900 p910 series classic psion pdas series 3 5/5mx series 7 netbook/netpad well mc218 opl part standard application suite opl also included psion teklogix industrial handhelds workabout mx opl interpreted language similar basic fully visual basic-compatible language oval also developed language originally called organiser programming language developed psion ltd psion organiser designed colly myers first iteration implemented richard harrison martin stamp first implementation without graphics original psion organiser referred psion organiser 1984 came bundled science finance math data packs became truly accessible built-in software psion organiser ii 1986 language went used psion series 3 later psion retired portable digital assistant market project delayed 2003 fledgling symbian developer program released open source language developed sourceforge opl-dev project language available symbian os v8 later mainly due lack interest support major symbian licencees nokia sony ericsson hence opl likely never made available newer generation symbian os phones sony ericsson p990 m600 w950 p1i nokia e61i e90 2010 nokia device developers encouraged use python s60 instead see python s60 console version hello world program gui version nokia series 80 user interface opl structured programming language opl programs contain procedures much like functions programming languages example cruel interrogative program yes button assigned shortcut ctrl+y ctrl+n represented n respectively user input dialog tested statement printing appropriate responses screen note 'get keyword gets user input without using dialog box used simply wait keypress terminating program otherwise would end immediately without giving time user read text output dialog also stored variable variables specific procedure must declared local keyword global variables defined global keyword table uses example variable called 'var opl interfaced advanced psion series 3 features means operating system calls later psion series 5mx changed so-called 'opx library stored system rom z drive 'opx libraries also made available nokia 9210 nokia 9300 nokia 9500 communicators adding opxs routines handling sms managing bluetooth communication opl features include letter g beginning graphical functions letter 'm menus letter 'd dialogs | [
9345,
9316,
8262,
8554,
9292,
5998,
7983,
847,
5395
] | Test |
4,577 | 5 | Sequenced_Packet_Exchange:sequenced packet exchange sequenced packet exchange spx osi-model transport layer protocol ipx/spx protocol stack reliable connection-oriented protocol similar tcp protocol tcp/ip datagram rather stream protocol spx packet begins header following structure connection control fields contains 4 single-bit flags datastream type serves close spx connection purpose two values used | [
10924
] | None |
4,578 | 9 | Martin_Odersky:martin odersky martin odersky born 5 september 1958 german computer scientist professor programming methods école polytechnique fédérale de lausanne epfl switzerland specializes code analysis programming languages designed scala programming language generic java pizza others implemented gj compiler implementation became basis javac java compiler 2007 inducted fellow association computing machinery 1989 received ph.d. eth zurich supervision niklaus wirth best known designer several programming languages including pascal postdoctoral work ibm yale university 12 may 2011 odersky collaborators launched typesafe inc. renamed lightbend inc. company provide commercial support training services scala currently serves chairman chief architect teaches two courses coursera online learning platform functional programming principles scala functional program design scala | [
8057,
8262,
8524,
3823,
3323,
8116,
1783,
3705,
1051,
7775
] | Test |
4,579 | 3 | Hacker_(video_game):hacker video game hacker 1985 computer game activision designed steve cartwright released amiga amstrad cpc apple ii atari 8-bit family atari st commodore 64 macintosh ms-dos msx zx spectrum activision executive jim levy introduced hacker reporters pretending something gone wrong attempt connect line company headquarters demonstrate new game several attempts logged mysterious non-activision computer explaining ladies gentlemen game player assumes role hacker person experienced breaking secure computer systems accidentally acquires access non-public system game shipped information play thus building concept player hack system player must attempt hack magma ltd. computer system beginning game guessing logon password password becomes obvious gaining access another means entry later stage game typing help h initial command line gives clue since initial attempts consist guessing likely failing access eventually granted due supposed malfunction security system player player asked identify various parts robot unit pointing cursor relevant parts pressing joystick button parts exotic technical names asynchronous data compactor phlamson joint —this allows room error initially trying guess part name belongs failure identify part correctly forces player take retest 100 percent identification made point player allowed continue player gains control robot travel around globe via secret tunnels deep within earth game text states robot powered manner magma evident player logged magma company network acting remote user global subterranean transport network various strange messages broadcast hinting dangerous experiments company getting far player informed shredded portions secret document containing magma ltd. plans world domination stolen player instructed retrieve document bargaining spies stole located various locations throughout globe player warned must retrieved order prevent u.s. government thwarting plans point player objective clear retrieve strips stolen document deliver washington d.c robot tunnel system extensive unmarked getting around initially exercise trial error throughout globe several cities robot surface interact people primarily spies want bargain piece evidence various surfacing cities player must try convince agents turn piece evidence initially player 5,000 bargain arsenal items grows time bargaining real challenge game determining spy wants get eventually spies whims satisfied pieces secret document note different copies game even computer platform differences items spies want n't enough however magma ltd. discovers player break-in shortly penetration launches security satellite intersects player position demands information supposedly legitimate user would know information queried given player previously game questions answered player taken careful notes information asked rather obscure put pressure player satellites allow player pass checks 4 times another catch cause player get disconnected due suspicious activity addition player time limit tracked movements sru makes player take long system automatically disconnect anyway regardless satellites sensors network also start fail limiting player ability see turns tunnels ahead eventually sru located forcing player rely maps tunnel network make player goes near australia network automatic game issued however knowledge may help future play evading check since game lacks save game feature player fails must start beginning try solve game puzzles late 1987 50,000 copies hacker sold activision third best-selling commodore game info rated hacker four stars five describing interesting concept fair good graphics sound compute praised game initial realism concluded worthy addition software collection especially enjoy adventure games require bit thought investment time ahoy wrote puzzle nature certain enthrall repel others ... repeated play integral part reaching solution enjoy protracted battle wits find hacker lively test abilities game followed 1986 much difficult sequel player actually recruited based upon assumed success activities original game tasked controlling robot time infiltrate secure facility order retrieve documents known doomsday papers well-guarded vault ensure security united states | [
391,
9166,
9006,
5435,
4956
] | None |
4,580 | 4 | Aircrack-ng:aircrack-ng aircrack-ng network software suite consisting detector packet sniffer wep wpa/wpa2-psk cracker analysis tool 802.11 wireless lans works wireless network interface controller whose driver supports raw monitoring mode sniff 802.11a 802.11b 802.11g traffic program runs linux freebsd macos openbsd windows linux version packaged openwrt also ported android zaurus pda maemo platforms proof concept port made iphone april 2007 team darmstadt university technology germany developed new attack method based paper released rc4 cipher adi shamir new attack named 'ptw decreases number initialization vectors ivs needed decrypt wep key included aircrack-ng suite since 0.9 release aircrack-ng fork original aircrack project found preinstalled tool many linux distributions kali linux parrot share common attributes developed project debian aircrack-ng software suite includes | [
7426,
7556,
7557,
9732,
6797,
2961,
2716,
10788,
9640,
7983,
8497,
2739,
7989,
823,
7228,
8513,
6466,
6345,
1232,
6993,
2006,
10329,
8922,
10332,
733,
9440,
3937,
10346,
5612,
10349,
2671,
2045,
2430
] | None |
4,581 | 2 | Open_Firmware:open firmware open firmware openboot sun microsystems parlance standard defining interfaces computer firmware system formerly endorsed institute electrical electronics engineers ieee originated sun used sun apple ibm arm non-x86 pci chipset vendors open firmware allows system load platform-independent drivers directly pci card improving compatibility open firmware may accessed forth language shell interface achieves essentially functionality later efi standard initiated intel lower overhead open firmware described ieee standard ieee 1275-1994 reaffirmed open firmware working group ofwg since 1998 therefore officially withdrawn ieee several commercial implementations open firmware released open source community 2006 including sun openboot firmworks openfirmware codegen smartfirmware source code available openbios project sun implementation available bsd license open firmware forth code may compiled fcode bytecode independent computer architecture details instruction set memory hierarchy pci card may include program compiled fcode runs open firmware system way provide platform-independent boot-time diagnostics configuration code device drivers fcode also compact disk driver may require one two kilobytes therefore many i/o cards used sun systems macintoshes used open firmware fcode implements ans forth subset open firmware library open firmware furthermore defines standard way describe hardware system helps operating system better understand host computer relying less user configuration hardware polling example open firmware essential reliably identifying slave i²c devices like temperature sensors hardware monitoring whereas alternative solution performing blind probe i²c bus done software like lm_sensors generic hardware known result serious hardware issues certain circumstances based upon interactive programming language open firmware used efficiently test bring new hardware allows drivers written tested interactively operational video mouse drivers prerequisite graphical interface suitable end-user diagnostics apple shipped diagnostic operating system many power macintoshes sun also shipped fcode-based diagnostic tool suite called openboot diagnostics obdiag used customer service support hardware manufacturing teams sun sparc systems open firmware interface displayed console terminal bootstrapping system software keyboard connected main video display used console terminal open firmware re-entered time pressing keyboard keyboard connected first serial line system usually used console open firmware re-entered sending break serial line system software running various open firmware settings read written using codice_1 command powerpc-based macintosh open firmware interface accessed pressing keys startup using standard pc usb keyboard intel-based macintoshes use open firmware use extensible firmware interface following apple transition intel processors also early versions powerbook 3400 connect open firmware input output modem port default functionality generally used developers troubleshooting i.t personnel common users mac os x operating system provides high level graphical user interface change commonly used open firmware settings instance possible specify boot disk partition without directly using open firmware interface limitations e.g possible select boot usb mass-storage devices open firmware allows imac boot using codice_2 command open firmware settings changed using codice_3 command system software running pegasos interface accessed pressing startup ibm power systems open firmware ok prompt accessed sms boot menu sms boot menu accessed pressing boot sequence hardware checking os boot olpc xo-1 laptop open firmware access requires developer key obtained registration olpc installing key upon power-on boot countdown interrupted upper left key get forth prompt | [
8828,
8708,
7045,
7049,
5520,
4241,
2066,
10130,
5270,
5671,
4264,
10153,
6187,
4396,
8877,
9004,
8625,
434,
3762,
9777,
9016,
11321,
2811,
3904,
5439,
9665,
3780,
9540,
9932,
9422,
6995,
10332,
2525,
5863,
1515,
9964,
3314,
499,
9714,
11... | Test |
4,582 | 4 | Shadow_stack:shadow stack computer security shadow stack mechanism protecting procedure stored return address stack buffer overflow shadow stack second separate stack shadows program call stack function prologue function stores return address call stack shadow stack function epilogue function loads return address call stack shadow stack compares two records return address differ attack detected typical course action simply terminate program alert system administrators possible intrusion attempt shadow stack similar stack canaries mechanisms aim maintain control-flow integrity protected program detecting attacks tamper stored return address attacker exploitation attempt shadow stacks implemented recompiling programs modified prologues epilogues dynamic binary rewriting techniques achieve effect hardware support unlike call stack also stores local program variables passed arguments spilled registers data shadow stack typically stores second copy function return address shadow stacks provide protection return addresses stack canaries rely secrecy canary value vulnerable non-contiguous write attacks shadow stacks protected guard pages information hiding attacker would also need locate shadow stack overwrite return address stored like stack canaries shadow stacks protect stack data return addresses offer incomplete protection security vulnerabilities result memory safety errors 2016 intel announced upcoming hardware support shadow stacks control-flow enforcement technology shadow stacks face compatibility problems program throws exception longjmp occurs return address top shadow stack match return address popped call stack typical solution problem pop entries shadow stack matching return address found terminate program match found shadow stack multithreaded program would call stack executing thread would also shadow stack shadowing call stacks | [
1474,
642,
6754,
1094,
5040,
3473,
4562,
2558
] | None |
4,583 | 4 | Access_Control_Matrix:access control matrix computer science access control matrix access matrix abstract formal security model protection state computer systems characterizes rights subject respect every object system first introduced butler w. lampson 1971 access matrix envisioned rectangular array cells one row per subject one column per object entry cell – entry particular subject-object pair – indicates access mode subject permitted exercise object column equivalent access control list object row equivalent access profile subject according model protection state computer system abstracted set objects formula_1 set entities needs protected e.g processes files memory pages set subjects formula_2 consists active entities e.g users processes exists set rights formula_3 form formula_4 formula_5 formula_6 formula_7 right thereby specifies kind access subject allowed process object matrix example exists two processes file device first process ability execute second read file write information device second process read information first define granularity protection mechanisms access control matrix used model static access permissions type access control system model rules permissions change particular system therefore gives incomplete description system access control security policy access control matrix thought abstract model permissions given point time literal implementation two-dimensional array would excessive memory requirements capability-based security access control lists categories concrete access control mechanisms whose static permissions modeled using access control matrices although two mechanisms sometimes presented example butler lampson protection paper simply row-based column-based implementations access control matrix view criticized drawing misleading equivalence systems take account dynamic behaviour | [
3616,
3723,
3440,
2737,
6162,
8627,
1013,
10968
] | Test |
4,584 | 4 | Chameleon_botnet:chameleon botnet chameleon botnet botnet discovered february 28 2013 security research firm spider.io involved infection 120,000 computers generated average 6 million us dollars per month advertising traffic traffic generated infected systems looked advertising parties regular end users browsed web seen legitimate web traffic affected computers windows pcs majority private pcs residential systems make actions software look like legitimate human behavior made mouse infected systems move around pages browsers rebooted system sessions crashed also sophisticated adobe flash javascript scripts executed infected systems least 202 websites targeted botnet 9 billion advertisements served side effect web traffic generated botnet infected systems likely suffered general operating lag slow network connectivity well symptoms indicators pc possibly infected malware removal software like clamwin exterminate infection could removed infected system also possible deactivate malware changing registry infected windows pc manually | [
5766,
3462,
6823,
6797,
4883,
7515
] | Test |
4,585 | 4 | Shadowserver:shadowserver shadowserver foundation nonprofit security organization gathers analyzes data malicious internet activity including malware botnets computer fraud sends daily network reports subscribers works law enforcement organizations around world cybercrime investigations established 2004 volunteer watchdog group liaises national governments csirts network providers academic institutions financial institutions fortune 500 companies end users improve internet security enhance product capability advance research dismantle criminal infrastructure shadowserver scans ipv4 internet 30 times per day harvests data malware spam bots botnets using large-scale sensor networks honeypots honeyclients placed throughout world uses sinkholes collect data bots ddos attacks also receives additional malware sinkhole data governments industry partners law enforcement agencies established reciprocal data-sharing agreements shadowserver shadowserver stores raw malware data permanently repository new data collected shadowserver analyzes using thousands virtual sandboxes hundreds iron sandboxes regularly re-analyzes raw data previously collected results analyses stored organization analysis cluster shadowserver sends daily custom reports users subscribed reports contain data shadowserver collected analyzed suspicious activity able detect within specific networks regions subscriber responsible example national government might receive data aggregated geo-spatial coordinates defined latitude longitude international network provider might receive data filtered asn shadowserver liaises security organizations national governments csirts dismantle global cybercrime networks example worked fbi europol interpol take avalanche network 2016 also helps law enforcement partners develop strategies cyber security threats mitigate threats emerge focusing cases involve criminal abuse internet ’ infrastructure | [
8133,
9256,
2409,
10952,
4972,
4945,
4883,
2325,
4503,
7515
] | None |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.